[pkg-boost-commits] r14035 - in boost/trunk: . boost boost/algorithm boost/algorithm/string boost/algorithm/string/detail boost/archive boost/archive/detail boost/archive/impl boost/assign boost/config/compiler boost/config/platform boost/date_time boost/date_time/gregorian boost/detail boost/dynamic_bitset boost/format boost/function boost/functional/hash boost/graph boost/graph/detail boost/io boost/iostreams boost/iostreams/filter boost/iterator boost/iterator/detail boost/lambda/detail boost/math/complex boost/mpl boost/mpl/aux_ boost/mpl/list/aux_ boost/mpl/map/aux_ boost/mpl/set/aux_ boost/mpl/vector/aux_ boost/multi_array boost/multi_index boost/multi_index/detail boost/numeric/interval boost/numeric/interval/detail boost/numeric/ublas boost/numeric/ublas/detail boost/optional boost/parameter boost/parameter/aux_ boost/parameter/aux_/preprocessor boost/parameter/aux_/python boost/pending boost/pool boost/pool/detail boost/program_options boost/ptr_container boost/ptr_container/detail boost/python boost/python/converter boost/python/detail boost/python/object boost/python/suite/indexing boost/range boost/range/detail boost/regex boost/regex/pending boost/regex/v4 boost/serialization boost/serialization/detail boost/signals boost/signals/detail boost/spirit boost/spirit/core/primitives/impl boost/spirit/iterator boost/spirit/iterator/impl boost/spirit/phoenix boost/spirit/symbols boost/spirit/tree boost/spirit/tree/impl boost/spirit/utility boost/statechart boost/statechart/detail boost/test boost/test/detail boost/test/impl boost/test/included boost/test/output boost/thread boost/thread/detail boost/tr1 boost/tr1/detail boost/tr1/tr1 boost/type_traits boost/type_traits/detail boost/type_traits/msvc boost/typeof boost/typeof/msvc boost/utility boost/utility/detail boost/wave boost/wave/cpplexer boost/wave/cpplexer/re2clex boost/wave/grammars boost/wave/util boost/xpressive boost/xpressive/detail boost/xpressive/detail/core boost/xpressive/detail/core/matcher boost/xpressive/detail/dynamic boost/xpressive/detail/static boost/xpressive/detail/static/productions boost/xpressive/detail/utility boost/xpressive/proto boost/xpressive/proto/compiler boost/xpressive/traits boost/xpressive/traits/detail debian doc doc/html doc/html/boost_math doc/html/boost_typetraits doc/src libs libs/algorithm/minmax/example libs/algorithm/minmax/test libs/algorithm/string libs/algorithm/string/doc libs/algorithm/string/example libs/algorithm/string/test libs/any libs/any/test libs/array libs/array/doc libs/assign libs/assign/doc libs/assign/test libs/bind libs/bind/doc libs/bind/test libs/compatibility libs/compose libs/concept_check libs/config libs/config/test libs/config/test/link libs/config/tools libs/conversion/test libs/date_time libs/date_time/build libs/date_time/doc libs/date_time/example libs/date_time/example/gregorian libs/date_time/example/posix_time libs/date_time/src/gregorian libs/date_time/test libs/date_time/test/gregorian libs/date_time/xmldoc libs/disjoint_sets libs/dynamic_bitset libs/dynamic_bitset/example libs/filesystem libs/filesystem/build libs/filesystem/doc libs/filesystem/example libs/filesystem/src libs/filesystem/test libs/foreach libs/foreach/doc libs/foreach/test libs/format libs/format/benchmark libs/format/doc libs/format/example libs/format/test libs/function libs/function/doc libs/function/test libs/functional libs/functional/hash libs/functional/hash/doc libs/functional/hash/examples libs/functional/hash/test libs/graph libs/graph/build libs/graph/doc libs/graph/doc/figs libs/graph/example libs/graph/src libs/graph/test libs/integer libs/io libs/io/test libs/iostreams libs/iostreams/build libs/iostreams/doc libs/iostreams/doc/tree libs/iostreams/example libs/iostreams/test libs/iostreams/test/detail libs/iterator libs/iterator/doc libs/iterator/example libs/iterator/test libs/lambda libs/lambda/doc libs/lambda/test libs/logic/test libs/math libs/math/doc libs/math/quaternion libs/math/test libs/mem_fn libs/mpl libs/mpl/doc libs/mpl/doc/refmanual libs/mpl/doc/src/refmanual libs/mpl/doc/tutorial libs/mpl/example libs/mpl/example/fsm libs/mpl/preprocessed libs/mpl/preprocessed/list libs/mpl/preprocessed/map libs/mpl/preprocessed/set libs/mpl/preprocessed/src libs/mpl/preprocessed/vector libs/mpl/test libs/mpl/test/aux_ libs/multi_array libs/multi_array/doc/xml libs/multi_array/test libs/multi_index libs/multi_index/doc libs/multi_index/doc/reference libs/multi_index/doc/tutorial libs/multi_index/example libs/multi_index/perf libs/multi_index/test libs/numeric libs/numeric/conversion libs/numeric/conversion/doc libs/numeric/conversion/test libs/numeric/interval/doc libs/numeric/interval/test libs/numeric/ublas libs/numeric/ublas/bench1 libs/numeric/ublas/bench2 libs/numeric/ublas/bench3 libs/numeric/ublas/bench4 libs/numeric/ublas/doc/samples libs/numeric/ublas/test libs/optional libs/optional/doc libs/optional/test libs/parameter/doc libs/parameter/doc/html libs/parameter/test libs/pool libs/pool/doc libs/pool/doc/implementation libs/pool/doc/interfaces libs/preprocessor libs/preprocessor/doc libs/preprocessor/doc/data libs/preprocessor/doc/headers libs/preprocessor/doc/headers/arithmetic libs/preprocessor/doc/headers/array libs/preprocessor/doc/headers/comparison libs/preprocessor/doc/headers/config libs/preprocessor/doc/headers/control libs/preprocessor/doc/headers/debug libs/preprocessor/doc/headers/facilities libs/preprocessor/doc/headers/iteration libs/preprocessor/doc/headers/list libs/preprocessor/doc/headers/logical libs/preprocessor/doc/headers/punctuation libs/preprocessor/doc/headers/repetition libs/preprocessor/doc/headers/selection libs/preprocessor/doc/headers/seq libs/preprocessor/doc/headers/slot libs/preprocessor/doc/headers/tuple libs/preprocessor/doc/ref libs/preprocessor/doc/terms libs/preprocessor/doc/topics libs/program_options libs/program_options/build libs/program_options/doc libs/program_options/example libs/program_options/src libs/program_options/test libs/property_map libs/property_map/test libs/ptr_container libs/ptr_container/doc libs/ptr_container/test libs/python libs/python/build libs/python/doc libs/python/doc/PyConDC_2003 libs/python/doc/tutorial libs/python/doc/tutorial/doc libs/python/doc/tutorial/doc/html libs/python/doc/tutorial/doc/html/python libs/python/doc/v2 libs/python/example libs/python/example/tutorial libs/python/pyste libs/python/pyste/dist libs/python/pyste/doc libs/python/pyste/doc/theme libs/python/pyste/install libs/python/pyste/src/Pyste libs/python/pyste/tests libs/python/src libs/python/src/converter libs/python/src/object libs/python/test libs/random libs/random/test libs/range/doc libs/range/test libs/rational libs/regex libs/regex/build libs/regex/doc libs/regex/example libs/regex/example/timer libs/regex/performance libs/regex/src libs/regex/test libs/regex/test/captures libs/regex/test/object_cache libs/regex/test/pathology libs/regex/test/profile libs/regex/test/regress libs/serialization/build libs/serialization/doc libs/serialization/example libs/serialization/src libs/serialization/test libs/serialization/vc7ide libs/signals libs/signals/build libs/signals/doc libs/signals/doc/reference libs/signals/example libs/signals/src libs/signals/test libs/smart_ptr libs/smart_ptr/test libs/spirit libs/spirit/example libs/spirit/example/intermediate/simple_xml libs/spirit/example/techniques/no_rules_with_typeof libs/spirit/fusion/test libs/spirit/phoenix/example libs/spirit/phoenix/test libs/spirit/test libs/spirit/test/actor libs/spirit/test/impl libs/statechart libs/statechart/doc libs/statechart/example libs/statechart/example/BitMachine libs/statechart/example/Camera libs/statechart/example/Handcrafted libs/statechart/example/Keyboard libs/statechart/example/Performance libs/statechart/example/PingPong libs/statechart/example/StopWatch libs/statechart/test libs/static_assert libs/static_assert/doc libs/test/build libs/test/build/msvc71_proj libs/test/example libs/test/example/cla libs/test/example/cla/validation libs/test/example/env libs/test/example/env/validation libs/test/test libs/test/test/auto-link-test libs/thread libs/thread/build libs/thread/doc libs/thread/example libs/thread/src libs/thread/test libs/thread/tutorial libs/timer libs/tokenizer libs/tr1 libs/tr1/doc libs/tr1/test libs/tr1/test/config libs/tr1/test/type_traits libs/tuple libs/tuple/doc libs/tuple/test libs/type_traits libs/type_traits/doc libs/type_traits/test libs/typeof libs/typeof/doc libs/typeof/test libs/utility libs/utility/enable_if/test libs/utility/test libs/variant/doc/reference libs/variant/test libs/wave libs/wave/build libs/wave/doc libs/wave/samples/advanced_hooks libs/wave/samples/advanced_hooks/build libs/wave/samples/cpp_tokens libs/wave/samples/cpp_tokens/build libs/wave/samples/cpp_tokens/slex libs/wave/samples/lexed_tokens libs/wave/samples/lexed_tokens/build libs/wave/samples/list_includes libs/wave/samples/list_includes/build libs/wave/samples/quick_start libs/wave/samples/quick_start/build libs/wave/samples/waveidl libs/wave/samples/waveidl/build libs/wave/samples/waveidl/idllexer libs/wave/src libs/wave/src/cpplexer/re2clex libs/wave/test/build libs/wave/test/testlexers libs/wave/test/testwave libs/wave/test/testwave/testfiles libs/xpressive libs/xpressive/doc libs/xpressive/example libs/xpressive/perf libs/xpressive/perf/gcc libs/xpressive/perf/msvc libs/xpressive/test more more/whos_using more/writingdoc more/writingdoc/template people status tools tools/bcp tools/boostbook tools/boostbook/doc tools/boostbook/xsl tools/boostbook/xsl/caramel tools/boostbook/xsl/doxygen tools/boostbook/xsl/dtd tools/boostbook/xsl/testing tools/build tools/build/v2 tools/build/v2/build tools/build/v2/doc tools/build/v2/doc/src tools/build/v2/example tools/build/v2/example/customization tools/build/v2/example/gettext tools/build/v2/example/libraries/app tools/build/v2/example/libraries/util/foo tools/build/v2/example/make tools/build/v2/example/qt tools/build/v2/example/variant tools/build/v2/example/variant/libs tools/build/v2/example/versioned tools/build/v2/kernel tools/build/v2/notes tools/build/v2/options tools/build/v2/test tools/build/v2/test/boostbook tools/build/v2/test/dependency-test tools/build/v2/test/dependency-test/src1 tools/build/v2/test/direct-request-test tools/build/v2/test/generators-test tools/build/v2/test/generators-test/lib tools/build/v2/test/module-actions tools/build/v2/test/prebuilt tools/build/v2/test/prebuilt/ext tools/build/v2/test/project-test1 tools/build/v2/test/project-test1/dir tools/build/v2/test/project-test1/dir2 tools/build/v2/test/project-test3 tools/build/v2/test/project-test3/lib tools/build/v2/test/project-test3/lib2 tools/build/v2/test/project-test3/lib2/helper tools/build/v2/test/project-test3/lib3 tools/build/v2/test/project-test4 tools/build/v2/test/project-test4/lib tools/build/v2/test/project-test4/lib2 tools/build/v2/test/railsys/libx tools/build/v2/test/railsys/libx/src tools/build/v2/test/railsys/program tools/build/v2/test/railsys/program/liba tools/build/v2/test/railsys/program/main tools/build/v2/test/startup/boost-root tools/build/v2/test/startup/boost-root/build tools/build/v2/test/startup/bootstrap-env tools/build/v2/test/startup/bootstrap-explicit tools/build/v2/test/startup/bootstrap-implicit tools/build/v2/test/startup/no-bootstrap1 tools/build/v2/test/startup/no-bootstrap1/subdir tools/build/v2/test/startup/no-bootstrap2 tools/build/v2/test/startup/no-bootstrap3 tools/build/v2/test/test2 tools/build/v2/test/testing-primitives tools/build/v2/test/unused tools/build/v2/test/v1-testing tools/build/v2/test/v1_testing tools/build/v2/tools tools/build/v2/tools/types tools/build/v2/util tools/inspect tools/inspect/build tools/jam tools/jam/doc tools/jam/src tools/jam/src/debian tools/quickbook tools/quickbook/detail tools/quickbook/doc tools/quickbook/doc/html tools/quickbook/doc/html/quickbook tools/quickbook/doc/html/quickbook/syntax tools/quickbook/test tools/regression tools/regression/build tools/regression/build/vcide tools/regression/test tools/regression/xsl_reports tools/regression/xsl_reports/runner tools/regression/xsl_reports/test tools/regression/xsl_reports/xsl/v2 tools/regression/xsl_reports/xsl/v2/html tools/release tools/wave tools/wave/build wiki

Domenico Andreoli cavok at alioth.debian.org
Fri Feb 16 17:50:14 CET 2007 

Author: cavok
Date: 2007-02-16 17:48:35 +0100 (Fri, 16 Feb 2007)
New Revision: 14035

Added:
   boost/trunk/boost/date_time.hpp
   boost/trunk/boost/graph/max_cardinality_matching.hpp
   boost/trunk/boost/numeric/interval/detail/ia64_rounding_control.hpp
   boost/trunk/boost/parameter/aux_/cast.hpp
   boost/trunk/boost/parameter/aux_/set.hpp
   boost/trunk/boost/parameter/name.hpp
   boost/trunk/boost/parameter/value_type.hpp
   boost/trunk/boost/python/ssize_t.hpp
   boost/trunk/boost/tr1/tr1/sun/
   boost/trunk/boost/typeof/incr_registration_group.hpp
   boost/trunk/boost/typeof/native.hpp
   boost/trunk/boost/wave/cpp_throw.hpp
   boost/trunk/boost/wave/grammars/cpp_value_error.hpp
   boost/trunk/doc/html/bbv2.html
   boost/trunk/doc/html/bbv2/
   boost/trunk/doc/html/boost_math/gcd_lcm.html
   boost/trunk/doc/html/boost_math/math_special_functions.html
   boost/trunk/doc/html/boost_math/octonions.html
   boost/trunk/doc/html/boost_math/quaternions.html
   boost/trunk/doc/html/date_time/
   boost/trunk/doc/html/docutils.css
   boost/trunk/doc/html/foreach.html
   boost/trunk/doc/html/jam.html
   boost/trunk/doc/html/jam/
   boost/trunk/doc/html/thread.html
   boost/trunk/doc/html/typeof.html
   boost/trunk/doc/html/xpressive.html
   boost/trunk/libs/any/test/any_to_ref_test.cpp
   boost/trunk/libs/array/array0.cpp
   boost/trunk/libs/graph/doc/lengauer_tarjan_dominator.htm
   boost/trunk/libs/graph/doc/sorted_erdos_renyi_gen.html
   boost/trunk/libs/graph/test/serialize.cpp
   boost/trunk/libs/mpl/doc/src/refmanual/Algorithms-Runtime.rst
   boost/trunk/libs/mpl/doc/src/refmanual/for_each.rst
   boost/trunk/libs/mpl/example/fsm/README.txt
   boost/trunk/libs/multi_index/example/Jamfile.v2
   boost/trunk/libs/multi_index/perf/Jamfile.v2
   boost/trunk/libs/numeric/ublas/test/test1.cpp
   boost/trunk/libs/numeric/ublas/test/test1.hpp
   boost/trunk/libs/numeric/ublas/test/test11.cpp
   boost/trunk/libs/numeric/ublas/test/test12.cpp
   boost/trunk/libs/numeric/ublas/test/test13.cpp
   boost/trunk/libs/numeric/ublas/test/test2.cpp
   boost/trunk/libs/numeric/ublas/test/test2.hpp
   boost/trunk/libs/numeric/ublas/test/test21.cpp
   boost/trunk/libs/numeric/ublas/test/test22.cpp
   boost/trunk/libs/numeric/ublas/test/test23.cpp
   boost/trunk/libs/numeric/ublas/test/test3.cpp
   boost/trunk/libs/numeric/ublas/test/test3.hpp
   boost/trunk/libs/numeric/ublas/test/test31.cpp
   boost/trunk/libs/numeric/ublas/test/test32.cpp
   boost/trunk/libs/numeric/ublas/test/test33.cpp
   boost/trunk/libs/numeric/ublas/test/test4.cpp
   boost/trunk/libs/numeric/ublas/test/test4.hpp
   boost/trunk/libs/numeric/ublas/test/test42.cpp
   boost/trunk/libs/numeric/ublas/test/test43.cpp
   boost/trunk/libs/numeric/ublas/test/test5.cpp
   boost/trunk/libs/numeric/ublas/test/test5.hpp
   boost/trunk/libs/numeric/ublas/test/test52.cpp
   boost/trunk/libs/numeric/ublas/test/test53.cpp
   boost/trunk/libs/numeric/ublas/test/test6.cpp
   boost/trunk/libs/numeric/ublas/test/test6.hpp
   boost/trunk/libs/numeric/ublas/test/test62.cpp
   boost/trunk/libs/numeric/ublas/test/test63.cpp
   boost/trunk/libs/numeric/ublas/test/test7.cpp
   boost/trunk/libs/numeric/ublas/test/test7.hpp
   boost/trunk/libs/numeric/ublas/test/test71.cpp
   boost/trunk/libs/numeric/ublas/test/test72.cpp
   boost/trunk/libs/numeric/ublas/test/test73.cpp
   boost/trunk/libs/parameter/test/deduced.cpp
   boost/trunk/libs/parameter/test/deduced.hpp
   boost/trunk/libs/parameter/test/deduced_dependent_predicate.cpp
   boost/trunk/libs/parameter/test/deduced_unmatched_arg.cpp
   boost/trunk/libs/parameter/test/normalized_argument_types.cpp
   boost/trunk/libs/parameter/test/optional_deduced_sfinae.cpp
   boost/trunk/libs/parameter/test/preprocessor_deduced.cpp
   boost/trunk/libs/parameter/test/python_test.cpp
   boost/trunk/libs/parameter/test/python_test.py
   boost/trunk/libs/ptr_container/doc/style.css
   boost/trunk/libs/ptr_container/doc/tutorial_example.html
   boost/trunk/libs/python/doc/v2/opaque.html
   boost/trunk/libs/python/doc/v2/ssize_t.html
   boost/trunk/libs/python/example/Jamroot
   boost/trunk/libs/python/example/tutorial/Jamroot
   boost/trunk/libs/python/test/crossmod_opaque.py
   boost/trunk/libs/python/test/crossmod_opaque_a.cpp
   boost/trunk/libs/python/test/crossmod_opaque_b.cpp
   boost/trunk/libs/python/test/numarray_tests.py
   boost/trunk/libs/python/test/numeric_tests.py
   boost/trunk/libs/python/test/operators_wrapper.cpp
   boost/trunk/libs/python/test/operators_wrapper.py
   boost/trunk/libs/python/test/printer.py
   boost/trunk/libs/regex/performance/Jamfile.v2
   boost/trunk/libs/statechart/doc/ExceptionsAndOrthStates.gif
   boost/trunk/libs/statechart/doc/TransAcrossOrthRegions.gif
   boost/trunk/libs/statechart/doc/contact.html
   boost/trunk/libs/statechart/doc/rationale.pdf
   boost/trunk/libs/statechart/doc/reference.pdf
   boost/trunk/libs/statechart/doc/tutorial.pdf
   boost/trunk/libs/statechart/test/UnsuppDeepHistoryTest.cpp
   boost/trunk/libs/statechart/test/UnsuppDeepHistoryTest.vcproj
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_cx_over_fail.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_cx_over_pass.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_cx_trig_fail.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_cx_trig_pass.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_tt_fail.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_tt_pass.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_un_map_fail.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_un_map_pass.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_un_set_fail.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_un_set_pass.cpp
   boost/trunk/libs/tr1/test/test_bind_header.cpp
   boost/trunk/libs/tr1/test/test_complex_header.cpp
   boost/trunk/libs/tr1/test/test_function_header.cpp
   boost/trunk/libs/tr1/test/test_hash_header.cpp
   boost/trunk/libs/tr1/test/test_integral_const_header.cpp
   boost/trunk/libs/tr1/test/test_mem_fn_header.cpp
   boost/trunk/libs/tr1/test/test_mpl_header.cpp
   boost/trunk/libs/tr1/test/test_ref_header.cpp
   boost/trunk/libs/tr1/test/test_ref_wrapper_tricky.cpp
   boost/trunk/libs/tr1/test/test_result_of_header.cpp
   boost/trunk/libs/tr1/test/test_shared_array_header.cpp
   boost/trunk/libs/tr1/test/test_shared_ptr_header.cpp
   boost/trunk/libs/tr1/test/test_shd_this_header.cpp
   boost/trunk/libs/tr1/test/test_type_traits_header.cpp
   boost/trunk/libs/tr1/test/test_weak_ptr_header.cpp
   boost/trunk/libs/tr1/test/type_traits/tr1_has_trivial_destr_test.cpp
   boost/trunk/libs/tr1/test/type_traits/tr1_has_virtual_destr_test.cpp
   boost/trunk/libs/tr1/test/type_traits/tr1_tky_abstract_type_test.cpp
   boost/trunk/libs/tr1/test/type_traits/tr1_tky_function_type_test.cpp
   boost/trunk/libs/tr1/test/type_traits/tr1_tky_incomp_type_test.cpp
   boost/trunk/libs/tr1/test/type_traits/tr1_tky_partial_spec_test.cpp
   boost/trunk/libs/typeof/test/function_binding.cpp
   boost/trunk/libs/typeof/test/odr_no_uns1.cpp
   boost/trunk/libs/typeof/test/odr_no_uns1.hpp
   boost/trunk/libs/typeof/test/odr_no_uns2.cpp
   boost/trunk/libs/typeof/test/odr_no_uns2.hpp
   boost/trunk/libs/wave/samples/advanced_hooks/advanced_hooks.hpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_063.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_063.hpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_064.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_065.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_066.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_066.hpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_067.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_067.hpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_068.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_069.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_9_018.cpp
   boost/trunk/libs/xpressive/test/misc2.cpp
   boost/trunk/more/Jamfile.v2
   boost/trunk/more/cvs.html
   boost/trunk/more/getting_started.rst
   boost/trunk/more/getting_started/
   boost/trunk/people/andreas_huber.html
   boost/trunk/tools/build/v2/doc/src/fragments.xml
   boost/trunk/tools/build/v2/doc/src/tasks.xml
   boost/trunk/tools/build/v2/doc/src/v1_vs_v2.xml
   boost/trunk/tools/build/v2/example/generate/
   boost/trunk/tools/build/v2/example/generator/
   boost/trunk/tools/build/v2/example/make/main_cpp.pro
   boost/trunk/tools/build/v2/example/pch/
   boost/trunk/tools/build/v2/example/python_modules/
   boost/trunk/tools/build/v2/test/pch.py
   boost/trunk/tools/build/v2/test/project_glob.py
   boost/trunk/tools/build/v2/test/remove_requirement.py
   boost/trunk/tools/build/v2/tools/doxproc.py
   boost/trunk/tools/build/v2/tools/generate.jam
   boost/trunk/tools/build/v2/tools/mpi.jam
   boost/trunk/tools/inspect/run_inspect.sh
   boost/trunk/tools/inspect/time_string.hpp
   boost/trunk/tools/inspect/unnamed_namespace_check.cpp
   boost/trunk/tools/inspect/unnamed_namespace_check.hpp
   boost/trunk/tools/regression/test/test-cases/
   boost/trunk/tools/regression/xsl_reports/boostbook_report.py
   boost/trunk/tools/regression/xsl_reports/db/
   boost/trunk/tools/regression/xsl_reports/test/test-components/
   boost/trunk/tools/regression/xsl_reports/xsl/v2/dump_toolsets.xsl
Removed:
   boost/trunk/Jamfile
   boost/trunk/boost/archive/array/
   boost/trunk/boost/archive/detail/dynamically_initialized.hpp
   boost/trunk/boost/archive/detail/register_archive.hpp
   boost/trunk/boost/concept/
   boost/trunk/boost/concept_check/
   boost/trunk/boost/detail/has_default_constructor.hpp
   boost/trunk/boost/graph/maximum_cardinality_matching.hpp
   boost/trunk/boost/range/as_array.hpp
   boost/trunk/boost/range/as_literal.hpp
   boost/trunk/boost/range/category.hpp
   boost/trunk/boost/range/detail/as_literal.hpp
   boost/trunk/boost/range/detail/detail_str.hpp
   boost/trunk/boost/range/detail/str_types.hpp
   boost/trunk/boost/range/distance.hpp
   boost/trunk/boost/range/mutable_iterator.hpp
   boost/trunk/boost/range/pointer.hpp
   boost/trunk/boost/range/reference.hpp
   boost/trunk/boost/serialization/array.hpp
   boost/trunk/boost/serialization/collection_size_type.hpp
   boost/trunk/boost/serialization/detail/get_data.hpp
   boost/trunk/boost/serialization/ephemeral.hpp
   boost/trunk/boost/serialization/valarray.hpp
   boost/trunk/boost/serialization/wrapper.hpp
   boost/trunk/boost/type_traits/floating_point_promotion.hpp
   boost/trunk/boost/type_traits/integral_promotion.hpp
   boost/trunk/boost/type_traits/promote.hpp
   boost/trunk/boost/typeof/binding_workaround.hpp
   boost/trunk/boost/typeof/increment_registration_group.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/optional_matcher.hpp
   boost/trunk/boost/xpressive/detail/dynamic/sequence.hpp
   boost/trunk/boost/xpressive/detail/utility/counted_base.hpp
   boost/trunk/boost/xpressive/detail/utility/width.hpp
   boost/trunk/boost/xpressive/proto/compiler/pass_through.hpp
   boost/trunk/boost/xpressive/proto/fusion.hpp
   boost/trunk/doc/html/boost_math/greatest_common_divisor_and_least_common_multiple.html
   boost/trunk/doc/html/threads.html
   boost/trunk/libs/algorithm/minmax/example/Jamfile
   boost/trunk/libs/algorithm/minmax/test/Jamfile
   boost/trunk/libs/algorithm/string/doc/external_concepts.html
   boost/trunk/libs/algorithm/string/example/Jamfile
   boost/trunk/libs/algorithm/string/test/Jamfile
   boost/trunk/libs/any/test/Jamfile
   boost/trunk/libs/any/test/any_cast_cv_failed.cpp
   boost/trunk/libs/assign/test/Jamfile
   boost/trunk/libs/assign/test/TODO
   boost/trunk/libs/bind/test/Jamfile
   boost/trunk/libs/concept_check/Jamfile
   boost/trunk/libs/concept_check/fake_sort.hpp
   boost/trunk/libs/concept_check/function_requires_fail.cpp
   boost/trunk/libs/concept_check/old_concept_class_fail.cpp
   boost/trunk/libs/concept_check/old_concept_function_fail.cpp
   boost/trunk/libs/concept_check/old_concept_pass.cpp
   boost/trunk/libs/concept_check/old_concepts.hpp
   boost/trunk/libs/concept_check/where.cpp
   boost/trunk/libs/concept_check/where_fail.cpp
   boost/trunk/libs/config/test/Jamfile
   boost/trunk/libs/config/test/link/Jamfile
   boost/trunk/libs/config/test/link/test/
   boost/trunk/libs/config/tools/Jamfile
   boost/trunk/libs/conversion/test/Jamfile
   boost/trunk/libs/date_time/build/Jamfile
   boost/trunk/libs/date_time/example/Jamfile
   boost/trunk/libs/date_time/test/Jamfile
   boost/trunk/libs/disjoint_sets/Jamfile
   boost/trunk/libs/dynamic_bitset/Jamfile
   boost/trunk/libs/dynamic_bitset/example/Jamfile
   boost/trunk/libs/filesystem/build/Jamfile
   boost/trunk/libs/filesystem/example/Jamfile
   boost/trunk/libs/filesystem/test/Jamfile
   boost/trunk/libs/foreach/test/Jamfile
   boost/trunk/libs/format/Jamfile
   boost/trunk/libs/format/benchmark/Jamfile
   boost/trunk/libs/format/example/Jamfile
   boost/trunk/libs/format/test/Jamfile
   boost/trunk/libs/function/test/Jamfile
   boost/trunk/libs/functional/hash/examples/Jamfile
   boost/trunk/libs/functional/hash/test/Jamfile
   boost/trunk/libs/graph/build/Jamfile
   boost/trunk/libs/graph/build/python/
   boost/trunk/libs/graph/doc/lengauer_tarjan_dominator_tree.htm
   boost/trunk/libs/graph/doc/sorted_erdos_renyi_generator.html
   boost/trunk/libs/graph/example/Jamfile
   boost/trunk/libs/graph/example/python/
   boost/trunk/libs/graph/example/regrtest.py
   boost/trunk/libs/graph/src/Makefile
   boost/trunk/libs/graph/src/README
   boost/trunk/libs/graph/src/python/
   boost/trunk/libs/graph/test/Jamfile
   boost/trunk/libs/graph/test/python/
   boost/trunk/libs/io/test/Jamfile
   boost/trunk/libs/iostreams/build/Jamfile
   boost/trunk/libs/iostreams/test/Jamfile
   boost/trunk/libs/iterator/doc/.cvsignore
   boost/trunk/libs/iterator/doc/facade-and-adaptor.diff
   boost/trunk/libs/iterator/doc/filter_iterator_ref.html
   boost/trunk/libs/iterator/doc/indirect_iterator_ref.diff
   boost/trunk/libs/iterator/doc/indirect_iterator_ref.html
   boost/trunk/libs/iterator/doc/issues.html
   boost/trunk/libs/iterator/doc/iter-issue-list.html
   boost/trunk/libs/iterator/doc/iter-issue-list.rst
   boost/trunk/libs/iterator/doc/iterator_adaptor_abstract.diff
   boost/trunk/libs/iterator/doc/iterator_adaptor_body.diff
   boost/trunk/libs/iterator/doc/iterator_adaptor_ref.html
   boost/trunk/libs/iterator/doc/make_filter_iterator.html
   boost/trunk/libs/iterator/doc/quickbook/
   boost/trunk/libs/iterator/doc/ref_problem.html
   boost/trunk/libs/iterator/doc/transform_iterator_ref.diff
   boost/trunk/libs/iterator/example/Jamfile
   boost/trunk/libs/iterator/test/Jamfile
   boost/trunk/libs/lambda/test/Jamfile
   boost/trunk/libs/logic/test/Jamfile
   boost/trunk/libs/math/test/Jamfile
   boost/trunk/libs/mpl/example/Jamfile
   boost/trunk/libs/mpl/test/Jamfile
   boost/trunk/libs/mpl/test/aux_/Jamfile
   boost/trunk/libs/multi_array/test/Jamfile
   boost/trunk/libs/multi_index/Jamfile
   boost/trunk/libs/multi_index/example/Jamfile
   boost/trunk/libs/multi_index/perf/Jamfile
   boost/trunk/libs/multi_index/test/Jamfile
   boost/trunk/libs/numeric/conversion/test/Jamfile
   boost/trunk/libs/numeric/interval/test/Jamfile
   boost/trunk/libs/numeric/ublas/bench1/Jamfile
   boost/trunk/libs/numeric/ublas/bench2/Jamfile
   boost/trunk/libs/numeric/ublas/bench3/Jamfile
   boost/trunk/libs/numeric/ublas/bench4/Jamfile
   boost/trunk/libs/numeric/ublas/doc/samples/Jamfile
   boost/trunk/libs/numeric/ublas/test/Jamfile
   boost/trunk/libs/numeric/ublas/test/test1/
   boost/trunk/libs/numeric/ublas/test/test2/
   boost/trunk/libs/numeric/ublas/test/test3/
   boost/trunk/libs/numeric/ublas/test/test4/
   boost/trunk/libs/numeric/ublas/test/test5/
   boost/trunk/libs/numeric/ublas/test/test6/
   boost/trunk/libs/numeric/ublas/test/test7/
   boost/trunk/libs/optional/test/.cvsignore
   boost/trunk/libs/optional/test/Jamfile
   boost/trunk/libs/parameter/test/Jamfile
   boost/trunk/libs/parameter/test/python.cpp
   boost/trunk/libs/parameter/test/python.py
   boost/trunk/libs/parameter/test/unnamed.cpp
   boost/trunk/libs/parameter/test/unnamed_fail.cpp
   boost/trunk/libs/pool/doc/copyright.html
   boost/trunk/libs/program_options/build/Jamfile
   boost/trunk/libs/program_options/example/Jamfile
   boost/trunk/libs/program_options/test/Jamfile
   boost/trunk/libs/property_map/test/Jamfile
   boost/trunk/libs/ptr_container/test/Jamfile
   boost/trunk/libs/python/build/Jamfile
   boost/trunk/libs/python/doc/v2/opaque_pointer_converter.html
   boost/trunk/libs/python/example/Jamfile
   boost/trunk/libs/python/example/tutorial/Jamfile
   boost/trunk/libs/python/example/tutorial/Jamrules
   boost/trunk/libs/python/pyste/dist/.cvsignore
   boost/trunk/libs/python/pyste/src/Pyste/.cvsignore
   boost/trunk/libs/python/pyste/tests/.cvsignore
   boost/trunk/libs/python/test/Jamfile
   boost/trunk/libs/random/test/Jamfile
   boost/trunk/libs/range/test/Jamfile
   boost/trunk/libs/range/test/TODO
   boost/trunk/libs/range/test/compat1.cpp
   boost/trunk/libs/regex/build/Jamfile
   boost/trunk/libs/regex/example/Jamfile
   boost/trunk/libs/regex/performance/Jamfile
   boost/trunk/libs/regex/test/Jamfile
   boost/trunk/libs/regex/test/auto-link-test/
   boost/trunk/libs/regex/test/captures/Jamfile
   boost/trunk/libs/regex/test/regress/tests.txt
   boost/trunk/libs/serialization/build/Jamfile
   boost/trunk/libs/serialization/example/Jamfile
   boost/trunk/libs/serialization/src/array_binary_iarchive.cpp
   boost/trunk/libs/serialization/src/array_binary_oarchive.cpp
   boost/trunk/libs/serialization/test/Jamfile
   boost/trunk/libs/serialization/test/array_binary_archive.hpp
   boost/trunk/libs/serialization/test/polymorphic_array_binary_archive.hpp
   boost/trunk/libs/serialization/test/test_valarray.cpp
   boost/trunk/libs/signals/build/Jamfile
   boost/trunk/libs/signals/example/Jamfile
   boost/trunk/libs/signals/test/Jamfile
   boost/trunk/libs/smart_ptr/test/Jamfile
   boost/trunk/libs/spirit/example/Jamfile
   boost/trunk/libs/spirit/fusion/test/Jamfile
   boost/trunk/libs/spirit/phoenix/example/Jamfile
   boost/trunk/libs/spirit/phoenix/test/Jamfile
   boost/trunk/libs/spirit/test/Jamfile
   boost/trunk/libs/statechart/doc/ExceptionsAndOrthogonalStates.gif
   boost/trunk/libs/statechart/doc/TransitionsAcrossOrthogonalRegions.gif
   boost/trunk/libs/statechart/example/BuildExamples.bat
   boost/trunk/libs/statechart/example/Jamfile
   boost/trunk/libs/statechart/test/InvalidTransitionTest3.cpp
   boost/trunk/libs/statechart/test/InvalidTransitionTest3.vcproj
   boost/trunk/libs/statechart/test/InvalidTransitionTest4.cpp
   boost/trunk/libs/statechart/test/InvalidTransitionTest4.vcproj
   boost/trunk/libs/statechart/test/Jamfile
   boost/trunk/libs/statechart/test/RunTests.bat
   boost/trunk/libs/statechart/test/UnsupportedDeepHistoryTest.cpp
   boost/trunk/libs/statechart/test/UnsupportedDeepHistoryTest.vcproj
   boost/trunk/libs/static_assert/Jamfile
   boost/trunk/libs/test/build/.cvsignore
   boost/trunk/libs/test/build/Jamfile
   boost/trunk/libs/test/build/msvc71_proj/.cvsignore
   boost/trunk/libs/test/example/.cvsignore
   boost/trunk/libs/test/example/Jamfile
   boost/trunk/libs/test/example/cla/Jamfile
   boost/trunk/libs/test/example/cla/validation/Jamfile
   boost/trunk/libs/test/example/env/Jamfile
   boost/trunk/libs/test/example/env/validation/Jamfile
   boost/trunk/libs/test/test/.cvsignore
   boost/trunk/libs/test/test/Jamfile
   boost/trunk/libs/test/test/auto-link-test/.cvsignore
   boost/trunk/libs/test/test/auto-link-test/Jamfile
   boost/trunk/libs/thread/build/.cvsignore
   boost/trunk/libs/thread/build/Jamfile
   boost/trunk/libs/thread/build/threads.jam
   boost/trunk/libs/thread/build/threads.mcp
   boost/trunk/libs/thread/example/.cvsignore
   boost/trunk/libs/thread/example/Jamfile
   boost/trunk/libs/thread/test/.cvsignore
   boost/trunk/libs/thread/test/Jamfile
   boost/trunk/libs/thread/tutorial/Jamfile
   boost/trunk/libs/tr1/test/Jamfile
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_over_fail.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_over_pass.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_trig_fail.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_trig_pass.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_type_traits_fail.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_type_traits_pass.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_map_fail.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_map_pass.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_set_fail.cpp
   boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_set_pass.cpp
   boost/trunk/libs/tr1/test/test_boost.cpp
   boost/trunk/libs/tr1/test/test_reference_wrapper_tricky.cpp
   boost/trunk/libs/tr1/test/type_traits/tr1_has_trivial_destructor_test.cpp
   boost/trunk/libs/tr1/test/type_traits/tr1_has_virtual_destructor_test.cpp
   boost/trunk/libs/tr1/test/type_traits/tr1_tricky_abstract_type_test.cpp
   boost/trunk/libs/tr1/test/type_traits/tr1_tricky_function_type_test.cpp
   boost/trunk/libs/tr1/test/type_traits/tr1_tricky_incomplete_type_test.cpp
   boost/trunk/libs/tr1/test/type_traits/tr1_tricky_partial_spec_test.cpp
   boost/trunk/libs/tuple/test/Jamfile
   boost/trunk/libs/type_traits/test/Jamfile
   boost/trunk/libs/type_traits/test/promote_basic_test.cpp
   boost/trunk/libs/type_traits/test/promote_enum_test.cpp
   boost/trunk/libs/type_traits/test/promote_mpl_test.cpp
   boost/trunk/libs/type_traits/test/promote_util.hpp
   boost/trunk/libs/typeof/test/Jamfile
   boost/trunk/libs/utility/enable_if/test/Jamfile
   boost/trunk/libs/utility/test/Jamfile
   boost/trunk/libs/variant/test/Jamfile
   boost/trunk/libs/wave/build/Jamfile
   boost/trunk/libs/wave/samples/advanced_hooks/advanced_preprocessing_hooks.hpp
   boost/trunk/libs/wave/samples/advanced_hooks/build/Jamfile
   boost/trunk/libs/wave/samples/cpp_tokens/build/Jamfile
   boost/trunk/libs/wave/samples/lexed_tokens/build/Jamfile
   boost/trunk/libs/wave/samples/list_includes/build/Jamfile
   boost/trunk/libs/wave/samples/quick_start/build/Jamfile
   boost/trunk/libs/wave/samples/waveidl/build/Jamfile
   boost/trunk/libs/wave/test/build/Jamfile
   boost/trunk/libs/xpressive/example/Jamfile
   boost/trunk/libs/xpressive/test/Jamfile
   boost/trunk/status/.cvsignore
   boost/trunk/status/Jamfile
   boost/trunk/tools/bcp/Jamfile
   boost/trunk/tools/build/v1/
   boost/trunk/tools/build/v2/example/make/main.cpp.pro
   boost/trunk/tools/build/v2/test/.cvsignore
   boost/trunk/tools/build/v2/test/glob.py
   boost/trunk/tools/build/v2/tools/kylix.jam
   boost/trunk/tools/inspect/build/Jamfile
   boost/trunk/tools/quickbook/detail/actions_class.hpp
   boost/trunk/tools/quickbook/detail/markups.hpp
   boost/trunk/tools/quickbook/doc/html/HTML.manifest
   boost/trunk/tools/quickbook/test/templates.gold
   boost/trunk/tools/quickbook/test/templates.quickbook
   boost/trunk/tools/regression/build/Jamfile
   boost/trunk/tools/regression/test/Jamfile
   boost/trunk/tools/wave/build/Jamfile
Modified:
   boost/trunk/Jamfile.v2
   boost/trunk/README
   boost/trunk/boost-build.jam
   boost/trunk/boost.css
   boost/trunk/boost/algorithm/string.hpp
   boost/trunk/boost/algorithm/string/detail/find_format.hpp
   boost/trunk/boost/algorithm/string/find_format.hpp
   boost/trunk/boost/algorithm/string/regex.hpp
   boost/trunk/boost/any.hpp
   boost/trunk/boost/archive/add_facet.hpp
   boost/trunk/boost/archive/basic_archive.hpp
   boost/trunk/boost/archive/basic_binary_iarchive.hpp
   boost/trunk/boost/archive/basic_binary_iprimitive.hpp
   boost/trunk/boost/archive/basic_binary_oarchive.hpp
   boost/trunk/boost/archive/basic_text_iarchive.hpp
   boost/trunk/boost/archive/basic_text_oarchive.hpp
   boost/trunk/boost/archive/basic_xml_iarchive.hpp
   boost/trunk/boost/archive/basic_xml_oarchive.hpp
   boost/trunk/boost/archive/binary_iarchive.hpp
   boost/trunk/boost/archive/binary_oarchive.hpp
   boost/trunk/boost/archive/binary_wiarchive.hpp
   boost/trunk/boost/archive/binary_woarchive.hpp
   boost/trunk/boost/archive/codecvt_null.hpp
   boost/trunk/boost/archive/detail/common_iarchive.hpp
   boost/trunk/boost/archive/detail/common_oarchive.hpp
   boost/trunk/boost/archive/detail/iserializer.hpp
   boost/trunk/boost/archive/detail/known_archive_types.hpp
   boost/trunk/boost/archive/detail/oserializer.hpp
   boost/trunk/boost/archive/detail/polymorphic_iarchive_impl.hpp
   boost/trunk/boost/archive/detail/polymorphic_oarchive_impl.hpp
   boost/trunk/boost/archive/dinkumware.hpp
   boost/trunk/boost/archive/impl/basic_xml_iarchive.ipp
   boost/trunk/boost/archive/impl/xml_woarchive_impl.ipp
   boost/trunk/boost/archive/polymorphic_binary_iarchive.hpp
   boost/trunk/boost/archive/polymorphic_binary_oarchive.hpp
   boost/trunk/boost/archive/polymorphic_iarchive.hpp
   boost/trunk/boost/archive/polymorphic_oarchive.hpp
   boost/trunk/boost/archive/polymorphic_text_iarchive.hpp
   boost/trunk/boost/archive/polymorphic_text_oarchive.hpp
   boost/trunk/boost/archive/polymorphic_text_wiarchive.hpp
   boost/trunk/boost/archive/polymorphic_text_woarchive.hpp
   boost/trunk/boost/archive/polymorphic_xml_iarchive.hpp
   boost/trunk/boost/archive/polymorphic_xml_oarchive.hpp
   boost/trunk/boost/archive/polymorphic_xml_wiarchive.hpp
   boost/trunk/boost/archive/polymorphic_xml_woarchive.hpp
   boost/trunk/boost/archive/text_iarchive.hpp
   boost/trunk/boost/archive/text_oarchive.hpp
   boost/trunk/boost/archive/text_wiarchive.hpp
   boost/trunk/boost/archive/text_woarchive.hpp
   boost/trunk/boost/archive/xml_iarchive.hpp
   boost/trunk/boost/archive/xml_oarchive.hpp
   boost/trunk/boost/archive/xml_wiarchive.hpp
   boost/trunk/boost/archive/xml_woarchive.hpp
   boost/trunk/boost/array.hpp
   boost/trunk/boost/assign/list_of.hpp
   boost/trunk/boost/assign/ptr_list_of.hpp
   boost/trunk/boost/bind.hpp
   boost/trunk/boost/concept_check.hpp
   boost/trunk/boost/config/compiler/hp_acc.hpp
   boost/trunk/boost/config/compiler/vacpp.hpp
   boost/trunk/boost/config/platform/hpux.hpp
   boost/trunk/boost/date_time/date_parsing.hpp
   boost/trunk/boost/date_time/gregorian/gregorian_io.hpp
   boost/trunk/boost/date_time/locale_config.hpp
   boost/trunk/boost/date_time/period.hpp
   boost/trunk/boost/date_time/string_parse_tree.hpp
   boost/trunk/boost/detail/algorithm.hpp
   boost/trunk/boost/detail/bad_weak_ptr.hpp
   boost/trunk/boost/detail/dynamic_bitset.hpp
   boost/trunk/boost/detail/endian.hpp
   boost/trunk/boost/detail/indirect_traits.hpp
   boost/trunk/boost/detail/limits.hpp
   boost/trunk/boost/detail/utf8_codecvt_facet.hpp
   boost/trunk/boost/dynamic_bitset/dynamic_bitset.hpp
   boost/trunk/boost/format/exceptions.hpp
   boost/trunk/boost/format/feed_args.hpp
   boost/trunk/boost/function/function_base.hpp
   boost/trunk/boost/function/function_template.hpp
   boost/trunk/boost/functional.hpp
   boost/trunk/boost/functional/hash/hash.hpp
   boost/trunk/boost/graph/adj_list_serialize.hpp
   boost/trunk/boost/graph/adjacency_list.hpp
   boost/trunk/boost/graph/adjacency_matrix.hpp
   boost/trunk/boost/graph/astar_search.hpp
   boost/trunk/boost/graph/bc_clustering.hpp
   boost/trunk/boost/graph/betweenness_centrality.hpp
   boost/trunk/boost/graph/circle_layout.hpp
   boost/trunk/boost/graph/compressed_sparse_row_graph.hpp
   boost/trunk/boost/graph/cuthill_mckee_ordering.hpp
   boost/trunk/boost/graph/depth_first_search.hpp
   boost/trunk/boost/graph/detail/adjacency_list.hpp
   boost/trunk/boost/graph/detail/edge.hpp
   boost/trunk/boost/graph/detail/indexed_properties.hpp
   boost/trunk/boost/graph/detail/read_graphviz_spirit.hpp
   boost/trunk/boost/graph/dijkstra_shortest_paths.hpp
   boost/trunk/boost/graph/dominator_tree.hpp
   boost/trunk/boost/graph/erdos_renyi_generator.hpp
   boost/trunk/boost/graph/filtered_graph.hpp
   boost/trunk/boost/graph/floyd_warshall_shortest.hpp
   boost/trunk/boost/graph/fruchterman_reingold.hpp
   boost/trunk/boost/graph/graph_concepts.hpp
   boost/trunk/boost/graph/graphviz.hpp
   boost/trunk/boost/graph/gursoy_atun_layout.hpp
   boost/trunk/boost/graph/kamada_kawai_spring_layout.hpp
   boost/trunk/boost/graph/king_ordering.hpp
   boost/trunk/boost/graph/page_rank.hpp
   boost/trunk/boost/graph/plod_generator.hpp
   boost/trunk/boost/graph/properties.hpp
   boost/trunk/boost/graph/random_layout.hpp
   boost/trunk/boost/graph/reverse_graph.hpp
   boost/trunk/boost/graph/small_world_generator.hpp
   boost/trunk/boost/graph/two_bit_color_map.hpp
   boost/trunk/boost/graph/visitors.hpp
   boost/trunk/boost/implicit_cast.hpp
   boost/trunk/boost/intrusive_ptr.hpp
   boost/trunk/boost/io/ios_state.hpp
   boost/trunk/boost/iostreams/char_traits.hpp
   boost/trunk/boost/iostreams/filter/symmetric.hpp
   boost/trunk/boost/iostreams/positioning.hpp
   boost/trunk/boost/iterator/detail/facade_iterator_category.hpp
   boost/trunk/boost/iterator/iterator_archetypes.hpp
   boost/trunk/boost/iterator/iterator_concepts.hpp
   boost/trunk/boost/iterator/iterator_facade.hpp
   boost/trunk/boost/iterator/permutation_iterator.hpp
   boost/trunk/boost/iterator/transform_iterator.hpp
   boost/trunk/boost/iterator/zip_iterator.hpp
   boost/trunk/boost/lambda/detail/operator_return_type_traits.hpp
   boost/trunk/boost/lexical_cast.hpp
   boost/trunk/boost/math/complex/acos.hpp
   boost/trunk/boost/math/complex/asin.hpp
   boost/trunk/boost/math/complex/details.hpp
   boost/trunk/boost/mpl/assert.hpp
   boost/trunk/boost/mpl/aux_/begin_end_impl.hpp
   boost/trunk/boost/mpl/aux_/include_preprocessed.hpp
   boost/trunk/boost/mpl/aux_/integral_wrapper.hpp
   boost/trunk/boost/mpl/aux_/lambda_spec.hpp
   boost/trunk/boost/mpl/has_xxx.hpp
   boost/trunk/boost/mpl/integral_c.hpp
   boost/trunk/boost/mpl/integral_c_fwd.hpp
   boost/trunk/boost/mpl/list/aux_/include_preprocessed.hpp
   boost/trunk/boost/mpl/map/aux_/include_preprocessed.hpp
   boost/trunk/boost/mpl/print.hpp
   boost/trunk/boost/mpl/quote.hpp
   boost/trunk/boost/mpl/set/aux_/include_preprocessed.hpp
   boost/trunk/boost/mpl/vector/aux_/include_preprocessed.hpp
   boost/trunk/boost/multi_array.hpp
   boost/trunk/boost/multi_array/index_range.hpp
   boost/trunk/boost/multi_index/detail/access_specifier.hpp
   boost/trunk/boost/multi_index/detail/seq_index_ops.hpp
   boost/trunk/boost/multi_index/hashed_index.hpp
   boost/trunk/boost/multi_index/random_access_index.hpp
   boost/trunk/boost/multi_index/sequenced_index.hpp
   boost/trunk/boost/none.hpp
   boost/trunk/boost/numeric/interval/arith2.hpp
   boost/trunk/boost/numeric/interval/detail/alpha_rounding_control.hpp
   boost/trunk/boost/numeric/interval/hw_rounding.hpp
   boost/trunk/boost/numeric/interval/utility.hpp
   boost/trunk/boost/numeric/ublas/detail/config.hpp
   boost/trunk/boost/numeric/ublas/detail/iterator.hpp
   boost/trunk/boost/numeric/ublas/functional.hpp
   boost/trunk/boost/numeric/ublas/matrix.hpp
   boost/trunk/boost/numeric/ublas/matrix_expression.hpp
   boost/trunk/boost/numeric/ublas/matrix_sparse.hpp
   boost/trunk/boost/numeric/ublas/operation_sparse.hpp
   boost/trunk/boost/numeric/ublas/vector.hpp
   boost/trunk/boost/numeric/ublas/vector_expression.hpp
   boost/trunk/boost/numeric/ublas/vector_of_vector.hpp
   boost/trunk/boost/optional/optional.hpp
   boost/trunk/boost/parameter.hpp
   boost/trunk/boost/parameter/aux_/arg_list.hpp
   boost/trunk/boost/parameter/aux_/maybe.hpp
   boost/trunk/boost/parameter/aux_/overloads.hpp
   boost/trunk/boost/parameter/aux_/preprocessor/flatten.hpp
   boost/trunk/boost/parameter/aux_/preprocessor/for_each.hpp
   boost/trunk/boost/parameter/aux_/python/invoker.hpp
   boost/trunk/boost/parameter/aux_/tagged_argument.hpp
   boost/trunk/boost/parameter/binding.hpp
   boost/trunk/boost/parameter/parameters.hpp
   boost/trunk/boost/parameter/preprocessor.hpp
   boost/trunk/boost/parameter/python.hpp
   boost/trunk/boost/pending/container_traits.hpp
   boost/trunk/boost/pending/fibonacci_heap.hpp
   boost/trunk/boost/pending/property_serialize.hpp
   boost/trunk/boost/pending/stringtok.hpp
   boost/trunk/boost/pool/detail/for.m4
   boost/trunk/boost/pool/detail/pool_construct.bat
   boost/trunk/boost/pool/detail/pool_construct.m4
   boost/trunk/boost/pool/detail/pool_construct.sh
   boost/trunk/boost/pool/detail/pool_construct_simple.bat
   boost/trunk/boost/pool/detail/pool_construct_simple.m4
   boost/trunk/boost/pool/detail/pool_construct_simple.sh
   boost/trunk/boost/pool/pool.hpp
   boost/trunk/boost/program_options/positional_options.hpp
   boost/trunk/boost/program_options/variables_map.hpp
   boost/trunk/boost/property_map.hpp
   boost/trunk/boost/property_map_iterator.hpp
   boost/trunk/boost/ptr_container/detail/reversible_ptr_container.hpp
   boost/trunk/boost/ptr_container/ptr_map_adapter.hpp
   boost/trunk/boost/ptr_container/ptr_sequence_adapter.hpp
   boost/trunk/boost/ptr_container/ptr_set_adapter.hpp
   boost/trunk/boost/python/converter/builtin_converters.hpp
   boost/trunk/boost/python/converter/implicit.hpp
   boost/trunk/boost/python/detail/config.hpp
   boost/trunk/boost/python/detail/python22_fixed.h
   boost/trunk/boost/python/detail/unwrap_wrapper.hpp
   boost/trunk/boost/python/detail/wrap_python.hpp
   boost/trunk/boost/python/docstring_options.hpp
   boost/trunk/boost/python/exec.hpp
   boost/trunk/boost/python/import.hpp
   boost/trunk/boost/python/list.hpp
   boost/trunk/boost/python/numeric.hpp
   boost/trunk/boost/python/object.hpp
   boost/trunk/boost/python/object/pointer_holder.hpp
   boost/trunk/boost/python/object_operators.hpp
   boost/trunk/boost/python/opaque_pointer_converter.hpp
   boost/trunk/boost/python/operators.hpp
   boost/trunk/boost/python/suite/indexing/indexing_suite.hpp
   boost/trunk/boost/python/type_id.hpp
   boost/trunk/boost/python/with_custodian_and_ward.hpp
   boost/trunk/boost/python/wrapper.hpp
   boost/trunk/boost/range/begin.hpp
   boost/trunk/boost/range/const_iterator.hpp
   boost/trunk/boost/range/const_reverse_iterator.hpp
   boost/trunk/boost/range/detail/begin.hpp
   boost/trunk/boost/range/detail/common.hpp
   boost/trunk/boost/range/detail/const_iterator.hpp
   boost/trunk/boost/range/detail/end.hpp
   boost/trunk/boost/range/detail/implementation_help.hpp
   boost/trunk/boost/range/detail/iterator.hpp
   boost/trunk/boost/range/detail/size_type.hpp
   boost/trunk/boost/range/detail/value_type.hpp
   boost/trunk/boost/range/difference_type.hpp
   boost/trunk/boost/range/empty.hpp
   boost/trunk/boost/range/end.hpp
   boost/trunk/boost/range/functions.hpp
   boost/trunk/boost/range/iterator.hpp
   boost/trunk/boost/range/iterator_range.hpp
   boost/trunk/boost/range/metafunctions.hpp
   boost/trunk/boost/range/rbegin.hpp
   boost/trunk/boost/range/rend.hpp
   boost/trunk/boost/range/result_iterator.hpp
   boost/trunk/boost/range/reverse_result_iterator.hpp
   boost/trunk/boost/range/size.hpp
   boost/trunk/boost/range/size_type.hpp
   boost/trunk/boost/range/sub_range.hpp
   boost/trunk/boost/range/value_type.hpp
   boost/trunk/boost/rational.hpp
   boost/trunk/boost/regex/icu.hpp
   boost/trunk/boost/regex/pending/object_cache.hpp
   boost/trunk/boost/regex/v4/basic_regex.hpp
   boost/trunk/boost/regex/v4/basic_regex_creator.hpp
   boost/trunk/boost/regex/v4/basic_regex_parser.hpp
   boost/trunk/boost/regex/v4/cpp_regex_traits.hpp
   boost/trunk/boost/regex/v4/match_results.hpp
   boost/trunk/boost/regex/v4/perl_matcher.hpp
   boost/trunk/boost/regex/v4/perl_matcher_common.hpp
   boost/trunk/boost/regex/v4/perl_matcher_recursive.hpp
   boost/trunk/boost/regex/v4/regex_token_iterator.hpp
   boost/trunk/boost/regex/v4/regex_traits_defaults.hpp
   boost/trunk/boost/regex/v4/u32regex_token_iterator.hpp
   boost/trunk/boost/regex/v4/w32_regex_traits.hpp
   boost/trunk/boost/serialization/base_object.hpp
   boost/trunk/boost/serialization/binary_object.hpp
   boost/trunk/boost/serialization/collections_load_imp.hpp
   boost/trunk/boost/serialization/collections_save_imp.hpp
   boost/trunk/boost/serialization/deque.hpp
   boost/trunk/boost/serialization/export.hpp
   boost/trunk/boost/serialization/hash_collections_load_imp.hpp
   boost/trunk/boost/serialization/hash_map.hpp
   boost/trunk/boost/serialization/hash_set.hpp
   boost/trunk/boost/serialization/is_abstract.hpp
   boost/trunk/boost/serialization/level.hpp
   boost/trunk/boost/serialization/list.hpp
   boost/trunk/boost/serialization/map.hpp
   boost/trunk/boost/serialization/nvp.hpp
   boost/trunk/boost/serialization/set.hpp
   boost/trunk/boost/serialization/slist.hpp
   boost/trunk/boost/serialization/string.hpp
   boost/trunk/boost/serialization/tracking.hpp
   boost/trunk/boost/serialization/traits.hpp
   boost/trunk/boost/serialization/type_info_implementation.hpp
   boost/trunk/boost/serialization/utility.hpp
   boost/trunk/boost/serialization/vector.hpp
   boost/trunk/boost/serialization/version.hpp
   boost/trunk/boost/serialization/void_cast.hpp
   boost/trunk/boost/serialization/void_cast_fwd.hpp
   boost/trunk/boost/shared_array.hpp
   boost/trunk/boost/shared_ptr.hpp
   boost/trunk/boost/signals/detail/named_slot_map.hpp
   boost/trunk/boost/signals/signal_template.hpp
   boost/trunk/boost/spirit/core/primitives/impl/numerics.ipp
   boost/trunk/boost/spirit/iterator/impl/position_iterator.ipp
   boost/trunk/boost/spirit/iterator/position_iterator.hpp
   boost/trunk/boost/spirit/iterator/position_iterator_fwd.hpp
   boost/trunk/boost/spirit/iterator/typeof.hpp
   boost/trunk/boost/spirit/phoenix/operators.hpp
   boost/trunk/boost/spirit/symbols/symbols.hpp
   boost/trunk/boost/spirit/tree/ast.hpp
   boost/trunk/boost/spirit/tree/impl/tree_to_xml.ipp
   boost/trunk/boost/spirit/utility/rule_parser.hpp
   boost/trunk/boost/spirit/version.hpp
   boost/trunk/boost/statechart/asynchronous_state_machine.hpp
   boost/trunk/boost/statechart/custom_reaction.hpp
   boost/trunk/boost/statechart/deep_history.hpp
   boost/trunk/boost/statechart/deferral.hpp
   boost/trunk/boost/statechart/detail/avoid_unused_warning.hpp
   boost/trunk/boost/statechart/detail/constructor.hpp
   boost/trunk/boost/statechart/detail/counted_base.hpp
   boost/trunk/boost/statechart/detail/leaf_state.hpp
   boost/trunk/boost/statechart/detail/memory.hpp
   boost/trunk/boost/statechart/detail/node_state.hpp
   boost/trunk/boost/statechart/detail/rtti_policy.hpp
   boost/trunk/boost/statechart/detail/state_base.hpp
   boost/trunk/boost/statechart/event.hpp
   boost/trunk/boost/statechart/event_base.hpp
   boost/trunk/boost/statechart/event_processor.hpp
   boost/trunk/boost/statechart/exception_translator.hpp
   boost/trunk/boost/statechart/fifo_scheduler.hpp
   boost/trunk/boost/statechart/fifo_worker.hpp
   boost/trunk/boost/statechart/history.hpp
   boost/trunk/boost/statechart/in_state_reaction.hpp
   boost/trunk/boost/statechart/null_exception_translator.hpp
   boost/trunk/boost/statechart/processor_container.hpp
   boost/trunk/boost/statechart/result.hpp
   boost/trunk/boost/statechart/shallow_history.hpp
   boost/trunk/boost/statechart/simple_state.hpp
   boost/trunk/boost/statechart/state.hpp
   boost/trunk/boost/statechart/state_machine.hpp
   boost/trunk/boost/statechart/termination.hpp
   boost/trunk/boost/statechart/transition.hpp
   boost/trunk/boost/test/detail/unit_test_parameters.hpp
   boost/trunk/boost/test/floating_point_comparison.hpp
   boost/trunk/boost/test/impl/exception_safety.ipp
   boost/trunk/boost/test/included/unit_test_framework.hpp
   boost/trunk/boost/test/output/compiler_log_formatter.hpp
   boost/trunk/boost/test/parameterized_test.hpp
   boost/trunk/boost/test/test_tools.hpp
   boost/trunk/boost/thread.hpp
   boost/trunk/boost/thread/barrier.hpp
   boost/trunk/boost/thread/condition.hpp
   boost/trunk/boost/thread/detail/config.hpp
   boost/trunk/boost/thread/detail/lock.hpp
   boost/trunk/boost/thread/detail/read_write_lock.hpp
   boost/trunk/boost/thread/detail/tss_hooks.hpp
   boost/trunk/boost/thread/exceptions.hpp
   boost/trunk/boost/thread/mutex.hpp
   boost/trunk/boost/thread/once.hpp
   boost/trunk/boost/thread/read_write_mutex.hpp
   boost/trunk/boost/thread/recursive_mutex.hpp
   boost/trunk/boost/thread/thread.hpp
   boost/trunk/boost/thread/tss.hpp
   boost/trunk/boost/thread/xtime.hpp
   boost/trunk/boost/token_functions.hpp
   boost/trunk/boost/tr1/array.hpp
   boost/trunk/boost/tr1/complex.hpp
   boost/trunk/boost/tr1/detail/config.hpp
   boost/trunk/boost/tr1/functional.hpp
   boost/trunk/boost/tr1/memory.hpp
   boost/trunk/boost/tr1/random.hpp
   boost/trunk/boost/tr1/regex.hpp
   boost/trunk/boost/tr1/tuple.hpp
   boost/trunk/boost/tr1/type_traits.hpp
   boost/trunk/boost/tr1/utility.hpp
   boost/trunk/boost/type_traits.hpp
   boost/trunk/boost/type_traits/add_pointer.hpp
   boost/trunk/boost/type_traits/add_reference.hpp
   boost/trunk/boost/type_traits/aligned_storage.hpp
   boost/trunk/boost/type_traits/alignment_of.hpp
   boost/trunk/boost/type_traits/config.hpp
   boost/trunk/boost/type_traits/detail/bool_trait_def.hpp
   boost/trunk/boost/type_traits/function_traits.hpp
   boost/trunk/boost/type_traits/integral_constant.hpp
   boost/trunk/boost/type_traits/intrinsics.hpp
   boost/trunk/boost/type_traits/is_base_and_derived.hpp
   boost/trunk/boost/type_traits/is_class.hpp
   boost/trunk/boost/type_traits/is_convertible.hpp
   boost/trunk/boost/type_traits/is_integral.hpp
   boost/trunk/boost/type_traits/msvc/remove_all_extents.hpp
   boost/trunk/boost/type_traits/remove_const.hpp
   boost/trunk/boost/type_traits/remove_pointer.hpp
   boost/trunk/boost/type_traits/remove_reference.hpp
   boost/trunk/boost/type_traits/remove_volatile.hpp
   boost/trunk/boost/type_traits/type_with_alignment.hpp
   boost/trunk/boost/typeof/encode_decode.hpp
   boost/trunk/boost/typeof/encode_decode_params.hpp
   boost/trunk/boost/typeof/int_encoding.hpp
   boost/trunk/boost/typeof/integral_template_param.hpp
   boost/trunk/boost/typeof/modifiers.hpp
   boost/trunk/boost/typeof/msvc/typeof_impl.hpp
   boost/trunk/boost/typeof/pointers_data_members.hpp
   boost/trunk/boost/typeof/register_functions.hpp
   boost/trunk/boost/typeof/register_functions_iterate.hpp
   boost/trunk/boost/typeof/template_encoding.hpp
   boost/trunk/boost/typeof/template_template_param.hpp
   boost/trunk/boost/typeof/type_encoding.hpp
   boost/trunk/boost/typeof/type_template_param.hpp
   boost/trunk/boost/typeof/typeof.hpp
   boost/trunk/boost/typeof/typeof_impl.hpp
   boost/trunk/boost/utility/detail/result_of_iterate.hpp
   boost/trunk/boost/utility/result_of.hpp
   boost/trunk/boost/utility/value_init.hpp
   boost/trunk/boost/wave.hpp
   boost/trunk/boost/wave/cpp_context.hpp
   boost/trunk/boost/wave/cpp_exceptions.hpp
   boost/trunk/boost/wave/cpp_iteration_context.hpp
   boost/trunk/boost/wave/cpplexer/convert_trigraphs.hpp
   boost/trunk/boost/wave/cpplexer/cpp_lex_interface.hpp
   boost/trunk/boost/wave/cpplexer/cpp_lex_iterator.hpp
   boost/trunk/boost/wave/cpplexer/cpp_lex_token.hpp
   boost/trunk/boost/wave/cpplexer/cpplexer_exceptions.hpp
   boost/trunk/boost/wave/cpplexer/detect_include_guards.hpp
   boost/trunk/boost/wave/cpplexer/re2clex/aq.hpp
   boost/trunk/boost/wave/cpplexer/re2clex/cpp_re.hpp
   boost/trunk/boost/wave/cpplexer/re2clex/cpp_re2c_lexer.hpp
   boost/trunk/boost/wave/cpplexer/re2clex/scanner.hpp
   boost/trunk/boost/wave/cpplexer/token_cache.hpp
   boost/trunk/boost/wave/cpplexer/validate_universal_char.hpp
   boost/trunk/boost/wave/grammars/cpp_chlit_grammar.hpp
   boost/trunk/boost/wave/grammars/cpp_defined_grammar.hpp
   boost/trunk/boost/wave/grammars/cpp_defined_grammar_gen.hpp
   boost/trunk/boost/wave/grammars/cpp_expression_grammar.hpp
   boost/trunk/boost/wave/grammars/cpp_expression_grammar_gen.hpp
   boost/trunk/boost/wave/grammars/cpp_expression_value.hpp
   boost/trunk/boost/wave/grammars/cpp_grammar.hpp
   boost/trunk/boost/wave/grammars/cpp_grammar_gen.hpp
   boost/trunk/boost/wave/grammars/cpp_intlit_grammar.hpp
   boost/trunk/boost/wave/grammars/cpp_literal_grammar_gen.hpp
   boost/trunk/boost/wave/grammars/cpp_predef_macros_gen.hpp
   boost/trunk/boost/wave/grammars/cpp_predef_macros_grammar.hpp
   boost/trunk/boost/wave/language_support.hpp
   boost/trunk/boost/wave/preprocessing_hooks.hpp
   boost/trunk/boost/wave/token_ids.hpp
   boost/trunk/boost/wave/util/cpp_ifblock.hpp
   boost/trunk/boost/wave/util/cpp_include_paths.hpp
   boost/trunk/boost/wave/util/cpp_iterator.hpp
   boost/trunk/boost/wave/util/cpp_macromap.hpp
   boost/trunk/boost/wave/util/cpp_macromap_predef.hpp
   boost/trunk/boost/wave/util/cpp_macromap_utils.hpp
   boost/trunk/boost/wave/util/file_position.hpp
   boost/trunk/boost/wave/util/functor_input.hpp
   boost/trunk/boost/wave/util/insert_whitespace_detection.hpp
   boost/trunk/boost/wave/util/interpret_pragma.hpp
   boost/trunk/boost/wave/util/iteration_context.hpp
   boost/trunk/boost/wave/util/macro_definition.hpp
   boost/trunk/boost/wave/util/macro_helpers.hpp
   boost/trunk/boost/wave/util/pattern_parser.hpp
   boost/trunk/boost/wave/util/symbol_table.hpp
   boost/trunk/boost/wave/util/time_conversion_helper.hpp
   boost/trunk/boost/wave/util/transform_iterator.hpp
   boost/trunk/boost/wave/util/unput_queue_iterator.hpp
   boost/trunk/boost/wave/wave_config.hpp
   boost/trunk/boost/wave/wave_config_constant.hpp
   boost/trunk/boost/wave/wave_version.hpp
   boost/trunk/boost/wave/whitespace_handling.hpp
   boost/trunk/boost/xpressive/basic_regex.hpp
   boost/trunk/boost/xpressive/detail/core/access.hpp
   boost/trunk/boost/xpressive/detail/core/adaptor.hpp
   boost/trunk/boost/xpressive/detail/core/linker.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/action_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/alternate_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/epsilon_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/keeper_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/lookahead_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/lookbehind_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/mark_begin_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/mark_end_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/mark_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/regex_byref_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/regex_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/repeat_begin_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/repeat_end_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/simple_repeat_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matcher/string_matcher.hpp
   boost/trunk/boost/xpressive/detail/core/matchers.hpp
   boost/trunk/boost/xpressive/detail/core/optimize.hpp
   boost/trunk/boost/xpressive/detail/core/peeker.hpp
   boost/trunk/boost/xpressive/detail/core/quant_style.hpp
   boost/trunk/boost/xpressive/detail/core/regex_impl.hpp
   boost/trunk/boost/xpressive/detail/core/state.hpp
   boost/trunk/boost/xpressive/detail/core/sub_match_impl.hpp
   boost/trunk/boost/xpressive/detail/detail_fwd.hpp
   boost/trunk/boost/xpressive/detail/dynamic/dynamic.hpp
   boost/trunk/boost/xpressive/detail/dynamic/matchable.hpp
   boost/trunk/boost/xpressive/detail/dynamic/parser.hpp
   boost/trunk/boost/xpressive/detail/dynamic/parser_traits.hpp
   boost/trunk/boost/xpressive/detail/static/as_xpr.hpp
   boost/trunk/boost/xpressive/detail/static/compile.hpp
   boost/trunk/boost/xpressive/detail/static/is_pure.hpp
   boost/trunk/boost/xpressive/detail/static/placeholders.hpp
   boost/trunk/boost/xpressive/detail/static/productions/alt_compilers.hpp
   boost/trunk/boost/xpressive/detail/static/productions/charset_transforms.hpp
   boost/trunk/boost/xpressive/detail/static/productions/complement_compiler.hpp
   boost/trunk/boost/xpressive/detail/static/productions/independent_compiler.hpp
   boost/trunk/boost/xpressive/detail/static/productions/marker_compiler.hpp
   boost/trunk/boost/xpressive/detail/static/productions/marker_transform.hpp
   boost/trunk/boost/xpressive/detail/static/productions/modify_compiler.hpp
   boost/trunk/boost/xpressive/detail/static/productions/noop_compiler.hpp
   boost/trunk/boost/xpressive/detail/static/productions/productions.hpp
   boost/trunk/boost/xpressive/detail/static/productions/quant_compilers.hpp
   boost/trunk/boost/xpressive/detail/static/productions/quant_traits.hpp
   boost/trunk/boost/xpressive/detail/static/productions/quant_transforms.hpp
   boost/trunk/boost/xpressive/detail/static/productions/set_compilers.hpp
   boost/trunk/boost/xpressive/detail/static/productions/visitor.hpp
   boost/trunk/boost/xpressive/detail/static/regex_operators.hpp
   boost/trunk/boost/xpressive/detail/static/static.hpp
   boost/trunk/boost/xpressive/detail/static/width_of.hpp
   boost/trunk/boost/xpressive/detail/utility/tracking_ptr.hpp
   boost/trunk/boost/xpressive/match_results.hpp
   boost/trunk/boost/xpressive/proto/arg_traits.hpp
   boost/trunk/boost/xpressive/proto/compiler/branch.hpp
   boost/trunk/boost/xpressive/proto/compiler/conditional.hpp
   boost/trunk/boost/xpressive/proto/compiler/error.hpp
   boost/trunk/boost/xpressive/proto/compiler/fold.hpp
   boost/trunk/boost/xpressive/proto/compiler/switch.hpp
   boost/trunk/boost/xpressive/proto/compiler/transform.hpp
   boost/trunk/boost/xpressive/proto/op_base.hpp
   boost/trunk/boost/xpressive/proto/op_tags.hpp
   boost/trunk/boost/xpressive/proto/operators.hpp
   boost/trunk/boost/xpressive/proto/proto.hpp
   boost/trunk/boost/xpressive/proto/proto_fwd.hpp
   boost/trunk/boost/xpressive/regex_algorithms.hpp
   boost/trunk/boost/xpressive/regex_compiler.hpp
   boost/trunk/boost/xpressive/regex_constants.hpp
   boost/trunk/boost/xpressive/regex_iterator.hpp
   boost/trunk/boost/xpressive/regex_primitives.hpp
   boost/trunk/boost/xpressive/regex_token_iterator.hpp
   boost/trunk/boost/xpressive/sub_match.hpp
   boost/trunk/boost/xpressive/traits/cpp_regex_traits.hpp
   boost/trunk/boost/xpressive/traits/detail/c_ctype.hpp
   boost/trunk/boost/xpressive/xpressive_fwd.hpp
   boost/trunk/boost/xpressive/xpressive_typeof.hpp
   boost/trunk/configure
   boost/trunk/debian/changelog
   boost/trunk/doc/Jamfile.v2
   boost/trunk/doc/html/CopyConstructible.html
   boost/trunk/doc/html/any.html
   boost/trunk/doc/html/array.html
   boost/trunk/doc/html/boost_math.html
   boost/trunk/doc/html/boost_math/inverse_complex.html
   boost/trunk/doc/html/boost_staticassert.html
   boost/trunk/doc/html/boost_tr1.html
   boost/trunk/doc/html/boost_typetraits.html
   boost/trunk/doc/html/boost_typetraits/background.html
   boost/trunk/doc/html/boostbook.css
   boost/trunk/doc/html/boostbook.html
   boost/trunk/doc/html/date_time.html
   boost/trunk/doc/html/function.html
   boost/trunk/doc/html/functionN.html
   boost/trunk/doc/html/hash.html
   boost/trunk/doc/html/lambda.html
   boost/trunk/doc/html/program_options.html
   boost/trunk/doc/html/ref.html
   boost/trunk/doc/html/reference.css
   boost/trunk/doc/html/signals.html
   boost/trunk/doc/html/string_algo.html
   boost/trunk/doc/html/tribool.html
   boost/trunk/doc/html/variant.html
   boost/trunk/doc/html/who_s_using_boost_.html
   boost/trunk/doc/src/boost.xml
   boost/trunk/index.htm
   boost/trunk/libs/algorithm/string/doc/concept.xml
   boost/trunk/libs/algorithm/string/doc/credits.xml
   boost/trunk/libs/algorithm/string/doc/design.xml
   boost/trunk/libs/algorithm/string/doc/environment.xml
   boost/trunk/libs/algorithm/string/doc/intro.xml
   boost/trunk/libs/algorithm/string/doc/quickref.xml
   boost/trunk/libs/algorithm/string/doc/rationale.xml
   boost/trunk/libs/algorithm/string/doc/release_notes.xml
   boost/trunk/libs/algorithm/string/doc/string_algo.xml
   boost/trunk/libs/algorithm/string/doc/usage.xml
   boost/trunk/libs/algorithm/string/index.html
   boost/trunk/libs/any/any_test.cpp
   boost/trunk/libs/any/index.html
   boost/trunk/libs/any/test/Jamfile.v2
   boost/trunk/libs/array/doc/array.xml
   boost/trunk/libs/array/index.html
   boost/trunk/libs/assign/doc/index.html
   boost/trunk/libs/assign/doc/style.css
   boost/trunk/libs/assign/index.html
   boost/trunk/libs/assign/test/Jamfile.v2
   boost/trunk/libs/assign/test/ptr_map_inserter.cpp
   boost/trunk/libs/assign/test/static_list_of.cpp
   boost/trunk/libs/bind/bind.html
   boost/trunk/libs/bind/doc/ref.xml
   boost/trunk/libs/bind/index.html
   boost/trunk/libs/bind/mem_fn.html
   boost/trunk/libs/bind/ref.html
   boost/trunk/libs/bind/test/Jamfile.v2
   boost/trunk/libs/compatibility/generate_cpp_c_headers.py
   boost/trunk/libs/compatibility/index.html
   boost/trunk/libs/compose/index.htm
   boost/trunk/libs/concept_check/Jamfile.v2
   boost/trunk/libs/concept_check/class_concept_check_test.cpp
   boost/trunk/libs/concept_check/class_concept_fail_expected.cpp
   boost/trunk/libs/concept_check/concept_check.htm
   boost/trunk/libs/concept_check/concept_check_fail_expected.cpp
   boost/trunk/libs/concept_check/concept_check_test.cpp
   boost/trunk/libs/concept_check/index.html
   boost/trunk/libs/concept_check/stl_concept_check.cpp
   boost/trunk/libs/concept_check/stl_concept_covering.cpp
   boost/trunk/libs/config/config.htm
   boost/trunk/libs/config/index.html
   boost/trunk/libs/config/test/Jamfile.v2
   boost/trunk/libs/config/test/boost_no_mem_tem_pnts.ipp
   boost/trunk/libs/config/test/config_info.cpp
   boost/trunk/libs/config/test/link/Jamfile.v2
   boost/trunk/libs/config/test/link/bc_gen.sh
   boost/trunk/libs/config/test/link/borland.mak
   boost/trunk/libs/config/test/link/common.sh
   boost/trunk/libs/config/test/link/vc6-stlport.mak
   boost/trunk/libs/config/test/link/vc6.mak
   boost/trunk/libs/config/test/link/vc7-stlport.mak
   boost/trunk/libs/config/test/link/vc7.mak
   boost/trunk/libs/config/test/link/vc71-stlport.mak
   boost/trunk/libs/config/test/link/vc71.mak
   boost/trunk/libs/config/test/link/vc_gen.sh
   boost/trunk/libs/config/test/math_info.cpp
   boost/trunk/libs/config/test/options.jam
   boost/trunk/libs/config/test/options_v2.jam
   boost/trunk/libs/config/tools/configure.in
   boost/trunk/libs/config/tools/generate.cpp
   boost/trunk/libs/conversion/test/Jamfile.v2
   boost/trunk/libs/date_time/build/Jamfile.v2
   boost/trunk/libs/date_time/doc/index.html
   boost/trunk/libs/date_time/example/gregorian/Jamfile.v2
   boost/trunk/libs/date_time/example/posix_time/Jamfile.v2
   boost/trunk/libs/date_time/index.html
   boost/trunk/libs/date_time/src/gregorian/date_generators.cpp
   boost/trunk/libs/date_time/test/gregorian/testdate_facet_new.cpp
   boost/trunk/libs/date_time/test/gregorian/testperiod.cpp
   boost/trunk/libs/date_time/test/testgeneric_period.cpp
   boost/trunk/libs/date_time/xmldoc/Jamfile.v2
   boost/trunk/libs/date_time/xmldoc/README
   boost/trunk/libs/date_time/xmldoc/buildinfo.xml
   boost/trunk/libs/date_time/xmldoc/changes.xml
   boost/trunk/libs/date_time/xmldoc/date_class.xml
   boost/trunk/libs/date_time/xmldoc/date_time_docs_howto.html
   boost/trunk/libs/date_time/xmldoc/exclusive_date_time.xml
   boost/trunk/libs/date_time/xmldoc/license.xml
   boost/trunk/libs/date_time/xmldoc/motivation.xml
   boost/trunk/libs/date_time/xmldoc/usage_examples.xml
   boost/trunk/libs/disjoint_sets/bibliography.html
   boost/trunk/libs/disjoint_sets/disjoint_sets.html
   boost/trunk/libs/disjoint_sets/index.html
   boost/trunk/libs/dynamic_bitset/Jamfile.v2
   boost/trunk/libs/dynamic_bitset/bitset_test.hpp
   boost/trunk/libs/dynamic_bitset/dyn_bitset_unit_tests3.cpp
   boost/trunk/libs/dynamic_bitset/index.html
   boost/trunk/libs/expected_results.xml
   boost/trunk/libs/filesystem/build/Jamfile.v2
   boost/trunk/libs/filesystem/doc/faq.htm
   boost/trunk/libs/filesystem/doc/i18n.html
   boost/trunk/libs/filesystem/example/Jamfile.v2
   boost/trunk/libs/filesystem/index.html
   boost/trunk/libs/filesystem/src/operations.cpp
   boost/trunk/libs/filesystem/test/Jamfile.v2
   boost/trunk/libs/foreach/doc/foreach.qbk
   boost/trunk/libs/foreach/index.html
   boost/trunk/libs/format/benchmark/bench_format.cpp
   boost/trunk/libs/format/benchmark/results.txt
   boost/trunk/libs/format/doc/choices.html
   boost/trunk/libs/format/doc/format.html
   boost/trunk/libs/format/index.html
   boost/trunk/libs/format/test/Jamfile.v2
   boost/trunk/libs/format/test/format_test3.cpp
   boost/trunk/libs/function/doc/Jamfile.v2
   boost/trunk/libs/function/doc/faq.xml
   boost/trunk/libs/function/doc/history.xml
   boost/trunk/libs/function/doc/misc.xml
   boost/trunk/libs/function/doc/reference.xml
   boost/trunk/libs/function/doc/tests.xml
   boost/trunk/libs/function/doc/tutorial.xml
   boost/trunk/libs/function/index.html
   boost/trunk/libs/functional/binders.html
   boost/trunk/libs/functional/function_test.cpp
   boost/trunk/libs/functional/function_traits.html
   boost/trunk/libs/functional/hash/doc/changes.qbk
   boost/trunk/libs/functional/hash/doc/disable.qbk
   boost/trunk/libs/functional/hash/doc/intro.qbk
   boost/trunk/libs/functional/hash/doc/links.qbk
   boost/trunk/libs/functional/hash/doc/portability.qbk
   boost/trunk/libs/functional/hash/doc/ref.xml
   boost/trunk/libs/functional/hash/doc/thanks.qbk
   boost/trunk/libs/functional/hash/doc/tutorial.qbk
   boost/trunk/libs/functional/hash/index.html
   boost/trunk/libs/functional/index.html
   boost/trunk/libs/functional/mem_fun.html
   boost/trunk/libs/functional/negators.html
   boost/trunk/libs/functional/ptr_fun.html
   boost/trunk/libs/graph/build/Jamfile.v2
   boost/trunk/libs/graph/doc/AStarHeuristic.html
   boost/trunk/libs/graph/doc/AStarVisitor.html
   boost/trunk/libs/graph/doc/AdjacencyGraph.html
   boost/trunk/libs/graph/doc/AdjacencyMatrix.html
   boost/trunk/libs/graph/doc/BFSVisitor.html
   boost/trunk/libs/graph/doc/BasicMatrix.html
   boost/trunk/libs/graph/doc/BellmanFordVisitor.html
   boost/trunk/libs/graph/doc/BidirectionalGraph.html
   boost/trunk/libs/graph/doc/Buffer.html
   boost/trunk/libs/graph/doc/ColorValue.html
   boost/trunk/libs/graph/doc/DFSVisitor.html
   boost/trunk/libs/graph/doc/DijkstraVisitor.html
   boost/trunk/libs/graph/doc/EdgeListGraph.html
   boost/trunk/libs/graph/doc/EdgeMutableGraph.html
   boost/trunk/libs/graph/doc/EventVisitor.html
   boost/trunk/libs/graph/doc/EventVisitorList.html
   boost/trunk/libs/graph/doc/Graph.html
   boost/trunk/libs/graph/doc/IncidenceGraph.html
   boost/trunk/libs/graph/doc/IteratorConstructibleGraph.html
   boost/trunk/libs/graph/doc/Makefile
   boost/trunk/libs/graph/doc/Monoid.html
   boost/trunk/libs/graph/doc/MutableGraph.html
   boost/trunk/libs/graph/doc/MutablePropertyGraph.html
   boost/trunk/libs/graph/doc/PropertyGraph.html
   boost/trunk/libs/graph/doc/PropertyTag.html
   boost/trunk/libs/graph/doc/VertexAndEdgeListGraph.html
   boost/trunk/libs/graph/doc/VertexListGraph.html
   boost/trunk/libs/graph/doc/VertexMutableGraph.html
   boost/trunk/libs/graph/doc/acknowledgements.html
   boost/trunk/libs/graph/doc/adjacency_iterator.html
   boost/trunk/libs/graph/doc/adjacency_list.html
   boost/trunk/libs/graph/doc/adjacency_list_traits.html
   boost/trunk/libs/graph/doc/adjacency_matrix.html
   boost/trunk/libs/graph/doc/astar_heuristic.html
   boost/trunk/libs/graph/doc/astar_search.html
   boost/trunk/libs/graph/doc/astar_visitor.html
   boost/trunk/libs/graph/doc/bandwidth.html
   boost/trunk/libs/graph/doc/bc_clustering.html
   boost/trunk/libs/graph/doc/bellman_ford_shortest.html
   boost/trunk/libs/graph/doc/bellman_visitor.html
   boost/trunk/libs/graph/doc/betweenness_centrality.html
   boost/trunk/libs/graph/doc/bfs_visitor.html
   boost/trunk/libs/graph/doc/bgl_named_params.html
   boost/trunk/libs/graph/doc/bibliography.html
   boost/trunk/libs/graph/doc/breadth_first_search.html
   boost/trunk/libs/graph/doc/breadth_first_visit.html
   boost/trunk/libs/graph/doc/challenge.html
   boost/trunk/libs/graph/doc/circle_layout.html
   boost/trunk/libs/graph/doc/compressed_sparse_row.html
   boost/trunk/libs/graph/doc/connected_components.html
   boost/trunk/libs/graph/doc/constructing_algorithms.html
   boost/trunk/libs/graph/doc/copy_graph.html
   boost/trunk/libs/graph/doc/cuthill_mckee_ordering.html
   boost/trunk/libs/graph/doc/dag_shortest_paths.html
   boost/trunk/libs/graph/doc/default.css
   boost/trunk/libs/graph/doc/depth_first_search.html
   boost/trunk/libs/graph/doc/depth_first_visit.html
   boost/trunk/libs/graph/doc/dfs_visitor.html
   boost/trunk/libs/graph/doc/dijkstra_shortest_paths.html
   boost/trunk/libs/graph/doc/dijkstra_visitor.html
   boost/trunk/libs/graph/doc/distance_recorder.html
   boost/trunk/libs/graph/doc/edge_list.html
   boost/trunk/libs/graph/doc/edmunds_karp_max_flow.html
   boost/trunk/libs/graph/doc/exception.html
   boost/trunk/libs/graph/doc/faq.html
   boost/trunk/libs/graph/doc/figs/Makefile
   boost/trunk/libs/graph/doc/file_dependency_example.html
   boost/trunk/libs/graph/doc/filtered_graph.html
   boost/trunk/libs/graph/doc/floyd_warshall_shortest.html
   boost/trunk/libs/graph/doc/fruchterman_reingold.html
   boost/trunk/libs/graph/doc/graph_coloring.html
   boost/trunk/libs/graph/doc/graph_concepts.html
   boost/trunk/libs/graph/doc/graph_theory_review.html
   boost/trunk/libs/graph/doc/graph_traits.html
   boost/trunk/libs/graph/doc/gursoy_atun_layout.html
   boost/trunk/libs/graph/doc/history.html
   boost/trunk/libs/graph/doc/incident.html
   boost/trunk/libs/graph/doc/incremental_components.html
   boost/trunk/libs/graph/doc/index.html
   boost/trunk/libs/graph/doc/inv_adjacency_iterator.html
   boost/trunk/libs/graph/doc/isomorphism.html
   boost/trunk/libs/graph/doc/johnson_all_pairs_shortest.html
   boost/trunk/libs/graph/doc/jwebfrob.pl
   boost/trunk/libs/graph/doc/kamada_kawai_spring_layout.html
   boost/trunk/libs/graph/doc/kevin_bacon.html
   boost/trunk/libs/graph/doc/king_ordering.html
   boost/trunk/libs/graph/doc/known_problems.html
   boost/trunk/libs/graph/doc/kruskal_min_spanning_tree.html
   boost/trunk/libs/graph/doc/layout_tolerance.html
   boost/trunk/libs/graph/doc/leda_conversion.html
   boost/trunk/libs/graph/doc/maximum_matching.html
   boost/trunk/libs/graph/doc/minimum_degree_ordering.html
   boost/trunk/libs/graph/doc/null_visitor.html
   boost/trunk/libs/graph/doc/opposite.html
   boost/trunk/libs/graph/doc/predecessor_recorder.html
   boost/trunk/libs/graph/doc/prim_minimum_spanning_tree.html
   boost/trunk/libs/graph/doc/profile.htm
   boost/trunk/libs/graph/doc/property.html
   boost/trunk/libs/graph/doc/property_map.html
   boost/trunk/libs/graph/doc/property_writer.html
   boost/trunk/libs/graph/doc/publications.html
   boost/trunk/libs/graph/doc/push_relabel_max_flow.html
   boost/trunk/libs/graph/doc/python.html
   boost/trunk/libs/graph/doc/quick_tour.html
   boost/trunk/libs/graph/doc/random.html
   boost/trunk/libs/graph/doc/random_layout.html
   boost/trunk/libs/graph/doc/read_graphviz.html
   boost/trunk/libs/graph/doc/read_graphviz.rst
   boost/trunk/libs/graph/doc/reverse_graph.html
   boost/trunk/libs/graph/doc/sequential_vertex_coloring.html
   boost/trunk/libs/graph/doc/sloan_ordering.htm
   boost/trunk/libs/graph/doc/sloan_start_end_vertices.htm
   boost/trunk/libs/graph/doc/sparse_matrix_ordering.html
   boost/trunk/libs/graph/doc/stanford_graph.html
   boost/trunk/libs/graph/doc/strong_components.html
   boost/trunk/libs/graph/doc/subgraph.html
   boost/trunk/libs/graph/doc/table_of_contents.html
   boost/trunk/libs/graph/doc/time_stamper.html
   boost/trunk/libs/graph/doc/topological_sort.html
   boost/trunk/libs/graph/doc/transitive_closure.html
   boost/trunk/libs/graph/doc/transpose_graph.html
   boost/trunk/libs/graph/doc/trouble_shooting.html
   boost/trunk/libs/graph/doc/undirected_dfs.html
   boost/trunk/libs/graph/doc/users.html
   boost/trunk/libs/graph/doc/using_adjacency_list.html
   boost/trunk/libs/graph/doc/using_property_maps.html
   boost/trunk/libs/graph/doc/visitor_concepts.html
   boost/trunk/libs/graph/doc/wavefront.htm
   boost/trunk/libs/graph/doc/write-graphviz.html
   boost/trunk/libs/graph/example/cuthill_mckee_ordering.cpp
   boost/trunk/libs/graph/example/data1.txt
   boost/trunk/libs/graph/example/data2.txt
   boost/trunk/libs/graph/example/data3.txt
   boost/trunk/libs/graph/example/file_dependencies.cpp
   boost/trunk/libs/graph/example/kevin-bacon2.cpp
   boost/trunk/libs/graph/example/king_ordering.cpp
   boost/trunk/libs/graph/example/matching_example.cpp
   boost/trunk/libs/graph/example/property_iterator.cpp
   boost/trunk/libs/graph/example/sloan_ordering.cpp
   boost/trunk/libs/graph/index.html
   boost/trunk/libs/graph/src/graphviz_digraph_lex.cpp
   boost/trunk/libs/graph/src/graphviz_digraph_parser.hpp
   boost/trunk/libs/graph/src/graphviz_graph_lex.cpp
   boost/trunk/libs/graph/src/graphviz_graph_parser.hpp
   boost/trunk/libs/graph/src/read_graphviz_spirit.cpp
   boost/trunk/libs/graph/test/Jamfile.v2
   boost/trunk/libs/graph/test/bidir_remove_edge.cpp
   boost/trunk/libs/graph/test/csr_graph_test.cpp
   boost/trunk/libs/graph/test/cuthill_mckee_ordering.cpp
   boost/trunk/libs/graph/test/dag_longest_paths.cpp
   boost/trunk/libs/graph/test/dominator_tree_test.cpp
   boost/trunk/libs/graph/test/graph.cpp
   boost/trunk/libs/graph/test/king_ordering.cpp
   boost/trunk/libs/graph/test/matching_test.cpp
   boost/trunk/libs/graph/test/property_iter.cpp
   boost/trunk/libs/graph/test/random_matching_test.cpp
   boost/trunk/libs/index.html
   boost/trunk/libs/integer/cstdint_test.cpp
   boost/trunk/libs/io/index.html
   boost/trunk/libs/io/test/Jamfile.v2
   boost/trunk/libs/iostreams/build/Jamfile.v2
   boost/trunk/libs/iostreams/doc/home.html
   boost/trunk/libs/iostreams/doc/installation.html
   boost/trunk/libs/iostreams/doc/menu.html
   boost/trunk/libs/iostreams/doc/tree/tree.css
   boost/trunk/libs/iostreams/example/finite_state_filter.hpp
   boost/trunk/libs/iostreams/index.html
   boost/trunk/libs/iostreams/test/Jamfile.v2
   boost/trunk/libs/iostreams/test/detail/utf8_codecvt_facet.cpp
   boost/trunk/libs/iostreams/test/detail/utf8_codecvt_facet.hpp
   boost/trunk/libs/iostreams/test/putback_test.hpp
   boost/trunk/libs/iterator/doc/BidirectionalTraversal.html
   boost/trunk/libs/iterator/doc/BidirectionalTraversal.rst
   boost/trunk/libs/iterator/doc/ForwardTraversal.html
   boost/trunk/libs/iterator/doc/ForwardTraversal.rst
   boost/trunk/libs/iterator/doc/IncrementableIterator.html
   boost/trunk/libs/iterator/doc/IncrementableIterator.rst
   boost/trunk/libs/iterator/doc/InteroperableIterator.rst
   boost/trunk/libs/iterator/doc/LvalueIterator.html
   boost/trunk/libs/iterator/doc/LvalueIterator.rst
   boost/trunk/libs/iterator/doc/RandomAccessTraversal.html
   boost/trunk/libs/iterator/doc/RandomAccessTraversal.rst
   boost/trunk/libs/iterator/doc/ReadableIterator.html
   boost/trunk/libs/iterator/doc/ReadableIterator.rst
   boost/trunk/libs/iterator/doc/SinglePassIterator.html
   boost/trunk/libs/iterator/doc/SinglePassIterator.rst
   boost/trunk/libs/iterator/doc/SwappableIterator.html
   boost/trunk/libs/iterator/doc/SwappableIterator.rst
   boost/trunk/libs/iterator/doc/WritableIterator.html
   boost/trunk/libs/iterator/doc/WritableIterator.rst
   boost/trunk/libs/iterator/doc/counting_iterator.html
   boost/trunk/libs/iterator/doc/counting_iterator.rst
   boost/trunk/libs/iterator/doc/counting_iterator_abstract.rst
   boost/trunk/libs/iterator/doc/counting_iterator_eg.rst
   boost/trunk/libs/iterator/doc/counting_iterator_ref.rst
   boost/trunk/libs/iterator/doc/default.css
   boost/trunk/libs/iterator/doc/facade-and-adaptor.html
   boost/trunk/libs/iterator/doc/facade-and-adaptor.rst
   boost/trunk/libs/iterator/doc/filter_iterator.html
   boost/trunk/libs/iterator/doc/filter_iterator.rst
   boost/trunk/libs/iterator/doc/filter_iterator_abstract.rst
   boost/trunk/libs/iterator/doc/filter_iterator_eg.rst
   boost/trunk/libs/iterator/doc/func_output_iter_abstract.rst
   boost/trunk/libs/iterator/doc/func_output_iter_ref.rst
   boost/trunk/libs/iterator/doc/function_output_iterator.html
   boost/trunk/libs/iterator/doc/function_output_iterator.rst
   boost/trunk/libs/iterator/doc/function_output_iterator_eg.rst
   boost/trunk/libs/iterator/doc/index.html
   boost/trunk/libs/iterator/doc/index.rst
   boost/trunk/libs/iterator/doc/indirect_iterator.html
   boost/trunk/libs/iterator/doc/indirect_iterator.rst
   boost/trunk/libs/iterator/doc/indirect_iterator_abstract.rst
   boost/trunk/libs/iterator/doc/indirect_iterator_eg.rst
   boost/trunk/libs/iterator/doc/indirect_iterator_ref.rst
   boost/trunk/libs/iterator/doc/interoperability-revisited.rst
   boost/trunk/libs/iterator/doc/iterator_adaptor.html
   boost/trunk/libs/iterator/doc/iterator_adaptor.rst
   boost/trunk/libs/iterator/doc/iterator_adaptor_abstract.rst
   boost/trunk/libs/iterator/doc/iterator_adaptor_body.rst
   boost/trunk/libs/iterator/doc/iterator_adaptor_ref.rst
   boost/trunk/libs/iterator/doc/iterator_archetypes.html
   boost/trunk/libs/iterator/doc/iterator_archetypes.rst
   boost/trunk/libs/iterator/doc/iterator_concepts.html
   boost/trunk/libs/iterator/doc/iterator_concepts.rst
   boost/trunk/libs/iterator/doc/iterator_facade.html
   boost/trunk/libs/iterator/doc/iterator_facade.rst
   boost/trunk/libs/iterator/doc/iterator_facade_abstract.rst
   boost/trunk/libs/iterator/doc/iterator_facade_body.rst
   boost/trunk/libs/iterator/doc/iterator_facade_ref.rst
   boost/trunk/libs/iterator/doc/iterator_traits.html
   boost/trunk/libs/iterator/doc/iterator_traits.rst
   boost/trunk/libs/iterator/doc/make_counting_iterator.rst
   boost/trunk/libs/iterator/doc/make_filter_iterator.rst
   boost/trunk/libs/iterator/doc/make_reverse_iterator.rst
   boost/trunk/libs/iterator/doc/make_transform_iterator.rst
   boost/trunk/libs/iterator/doc/make_zip_iterator.rst
   boost/trunk/libs/iterator/doc/new-iter-concepts.html
   boost/trunk/libs/iterator/doc/new-iter-concepts.rst
   boost/trunk/libs/iterator/doc/permutation_iter_abstract.rst
   boost/trunk/libs/iterator/doc/permutation_iterator.html
   boost/trunk/libs/iterator/doc/permutation_iterator.rst
   boost/trunk/libs/iterator/doc/permutation_iterator_body.rst
   boost/trunk/libs/iterator/doc/permutation_iterator_eg.rst
   boost/trunk/libs/iterator/doc/permutation_iterator_ref.rst
   boost/trunk/libs/iterator/doc/pointee.html
   boost/trunk/libs/iterator/doc/pointee.rst
   boost/trunk/libs/iterator/doc/reverse_iterator.html
   boost/trunk/libs/iterator/doc/reverse_iterator.rst
   boost/trunk/libs/iterator/doc/reverse_iterator_abstract.rst
   boost/trunk/libs/iterator/doc/reverse_iterator_eg.rst
   boost/trunk/libs/iterator/doc/reverse_iterator_ref.rst
   boost/trunk/libs/iterator/doc/rst2html
   boost/trunk/libs/iterator/doc/rst2latex
   boost/trunk/libs/iterator/doc/transform_iterator.html
   boost/trunk/libs/iterator/doc/transform_iterator.rst
   boost/trunk/libs/iterator/doc/transform_iterator_abstract.rst
   boost/trunk/libs/iterator/doc/transform_iterator_eg.rst
   boost/trunk/libs/iterator/doc/transform_iterator_ref.rst
   boost/trunk/libs/iterator/doc/zip_iterator.html
   boost/trunk/libs/iterator/doc/zip_iterator.rst
   boost/trunk/libs/iterator/doc/zip_iterator_abstract.rst
   boost/trunk/libs/iterator/doc/zip_iterator_eg.rst
   boost/trunk/libs/iterator/doc/zip_iterator_ref.rst
   boost/trunk/libs/iterator/index.html
   boost/trunk/libs/iterator/test/Jamfile.v2
   boost/trunk/libs/iterator/test/iterator_facade.cpp
   boost/trunk/libs/iterator/test/permutation_iterator_test.cpp
   boost/trunk/libs/iterator/test/zip_iterator_test.cpp
   boost/trunk/libs/lambda/doc/index.html
   boost/trunk/libs/lambda/doc/lambda.xml
   boost/trunk/libs/lambda/index.html
   boost/trunk/libs/libraries.htm
   boost/trunk/libs/maintainers.txt
   boost/trunk/libs/math/doc/common_factor.html
   boost/trunk/libs/math/doc/index.html
   boost/trunk/libs/math/doc/math-gcd.qbk
   boost/trunk/libs/math/doc/math.qbk
   boost/trunk/libs/math/index.html
   boost/trunk/libs/math/quaternion/HSO3.hpp
   boost/trunk/libs/math/test/Jamfile.v2
   boost/trunk/libs/math/test/common_factor_test.cpp
   boost/trunk/libs/mem_fn/index.html
   boost/trunk/libs/mpl/doc/index.html
   boost/trunk/libs/mpl/doc/refmanual.html
   boost/trunk/libs/mpl/doc/refmanual/accumulate.html
   boost/trunk/libs/mpl/doc/refmanual/acknowledgements.html
   boost/trunk/libs/mpl/doc/refmanual/advance.html
   boost/trunk/libs/mpl/doc/refmanual/algorithms-concepts.html
   boost/trunk/libs/mpl/doc/refmanual/algorithms.html
   boost/trunk/libs/mpl/doc/refmanual/always.html
   boost/trunk/libs/mpl/doc/refmanual/and.html
   boost/trunk/libs/mpl/doc/refmanual/apply-wrap.html
   boost/trunk/libs/mpl/doc/refmanual/apply.html
   boost/trunk/libs/mpl/doc/refmanual/arg.html
   boost/trunk/libs/mpl/doc/refmanual/arithmetic-operations.html
   boost/trunk/libs/mpl/doc/refmanual/assert-msg.html
   boost/trunk/libs/mpl/doc/refmanual/assert-not.html
   boost/trunk/libs/mpl/doc/refmanual/assert-relation.html
   boost/trunk/libs/mpl/doc/refmanual/assert.html
   boost/trunk/libs/mpl/doc/refmanual/asserts.html
   boost/trunk/libs/mpl/doc/refmanual/associative-sequence.html
   boost/trunk/libs/mpl/doc/refmanual/at-c.html
   boost/trunk/libs/mpl/doc/refmanual/at.html
   boost/trunk/libs/mpl/doc/refmanual/aux-lambda-support.html
   boost/trunk/libs/mpl/doc/refmanual/back-extensible-sequence.html
   boost/trunk/libs/mpl/doc/refmanual/back-inserter.html
   boost/trunk/libs/mpl/doc/refmanual/back.html
   boost/trunk/libs/mpl/doc/refmanual/begin.html
   boost/trunk/libs/mpl/doc/refmanual/bidirectional-iterator.html
   boost/trunk/libs/mpl/doc/refmanual/bidirectional-sequence.html
   boost/trunk/libs/mpl/doc/refmanual/bind.html
   boost/trunk/libs/mpl/doc/refmanual/bitand.html
   boost/trunk/libs/mpl/doc/refmanual/bitor.html
   boost/trunk/libs/mpl/doc/refmanual/bitwise-operations.html
   boost/trunk/libs/mpl/doc/refmanual/bitxor.html
   boost/trunk/libs/mpl/doc/refmanual/bool.html
   boost/trunk/libs/mpl/doc/refmanual/broken-compiler.html
   boost/trunk/libs/mpl/doc/refmanual/categorized-concepts.html
   boost/trunk/libs/mpl/doc/refmanual/categorized-index.html
   boost/trunk/libs/mpl/doc/refmanual/cfg-no-has-xxx.html
   boost/trunk/libs/mpl/doc/refmanual/cfg-no-preprocessed.html
   boost/trunk/libs/mpl/doc/refmanual/classes.html
   boost/trunk/libs/mpl/doc/refmanual/clear.html
   boost/trunk/libs/mpl/doc/refmanual/comparisons.html
   boost/trunk/libs/mpl/doc/refmanual/components.html
   boost/trunk/libs/mpl/doc/refmanual/composition-and-argument.html
   boost/trunk/libs/mpl/doc/refmanual/concepts.html
   boost/trunk/libs/mpl/doc/refmanual/configuration.html
   boost/trunk/libs/mpl/doc/refmanual/contains.html
   boost/trunk/libs/mpl/doc/refmanual/copy-if.html
   boost/trunk/libs/mpl/doc/refmanual/copy.html
   boost/trunk/libs/mpl/doc/refmanual/count-if.html
   boost/trunk/libs/mpl/doc/refmanual/count.html
   boost/trunk/libs/mpl/doc/refmanual/data-concepts.html
   boost/trunk/libs/mpl/doc/refmanual/data-miscellaneous.html
   boost/trunk/libs/mpl/doc/refmanual/data-types.html
   boost/trunk/libs/mpl/doc/refmanual/deque.html
   boost/trunk/libs/mpl/doc/refmanual/deref.html
   boost/trunk/libs/mpl/doc/refmanual/distance.html
   boost/trunk/libs/mpl/doc/refmanual/divides.html
   boost/trunk/libs/mpl/doc/refmanual/empty-base.html
   boost/trunk/libs/mpl/doc/refmanual/empty-sequence.html
   boost/trunk/libs/mpl/doc/refmanual/empty.html
   boost/trunk/libs/mpl/doc/refmanual/end.html
   boost/trunk/libs/mpl/doc/refmanual/equal-to.html
   boost/trunk/libs/mpl/doc/refmanual/equal.html
   boost/trunk/libs/mpl/doc/refmanual/erase-key.html
   boost/trunk/libs/mpl/doc/refmanual/erase.html
   boost/trunk/libs/mpl/doc/refmanual/eval-if-c.html
   boost/trunk/libs/mpl/doc/refmanual/eval-if.html
   boost/trunk/libs/mpl/doc/refmanual/extensible-associative.html
   boost/trunk/libs/mpl/doc/refmanual/extensible-sequence.html
   boost/trunk/libs/mpl/doc/refmanual/filter-view.html
   boost/trunk/libs/mpl/doc/refmanual/find-if.html
   boost/trunk/libs/mpl/doc/refmanual/find.html
   boost/trunk/libs/mpl/doc/refmanual/fold.html
   boost/trunk/libs/mpl/doc/refmanual/forward-iterator.html
   boost/trunk/libs/mpl/doc/refmanual/forward-sequence.html
   boost/trunk/libs/mpl/doc/refmanual/front-extensible-sequence.html
   boost/trunk/libs/mpl/doc/refmanual/front-inserter.html
   boost/trunk/libs/mpl/doc/refmanual/front.html
   boost/trunk/libs/mpl/doc/refmanual/greater-equal.html
   boost/trunk/libs/mpl/doc/refmanual/greater.html
   boost/trunk/libs/mpl/doc/refmanual/has-key.html
   boost/trunk/libs/mpl/doc/refmanual/has-xxx-trait-def.html
   boost/trunk/libs/mpl/doc/refmanual/has-xxx-trait-named-def.html
   boost/trunk/libs/mpl/doc/refmanual/identity.html
   boost/trunk/libs/mpl/doc/refmanual/if-c.html
   boost/trunk/libs/mpl/doc/refmanual/if.html
   boost/trunk/libs/mpl/doc/refmanual/inherit-linearly.html
   boost/trunk/libs/mpl/doc/refmanual/inherit.html
   boost/trunk/libs/mpl/doc/refmanual/insert-range.html
   boost/trunk/libs/mpl/doc/refmanual/insert.html
   boost/trunk/libs/mpl/doc/refmanual/inserter.html
   boost/trunk/libs/mpl/doc/refmanual/inserters-inserter.html
   boost/trunk/libs/mpl/doc/refmanual/inserters.html
   boost/trunk/libs/mpl/doc/refmanual/int.html
   boost/trunk/libs/mpl/doc/refmanual/integral-c.html
   boost/trunk/libs/mpl/doc/refmanual/integral-constant.html
   boost/trunk/libs/mpl/doc/refmanual/integral-sequence-wrapper.html
   boost/trunk/libs/mpl/doc/refmanual/intrinsic-metafunctions.html
   boost/trunk/libs/mpl/doc/refmanual/introspection.html
   boost/trunk/libs/mpl/doc/refmanual/invocation.html
   boost/trunk/libs/mpl/doc/refmanual/is-sequence.html
   boost/trunk/libs/mpl/doc/refmanual/iter-fold.html
   boost/trunk/libs/mpl/doc/refmanual/iteration-algorithms.html
   boost/trunk/libs/mpl/doc/refmanual/iterator-category.html
   boost/trunk/libs/mpl/doc/refmanual/iterator-metafunctions.html
   boost/trunk/libs/mpl/doc/refmanual/iterator-range.html
   boost/trunk/libs/mpl/doc/refmanual/iterators-concepts.html
   boost/trunk/libs/mpl/doc/refmanual/iterators.html
   boost/trunk/libs/mpl/doc/refmanual/joint-view.html
   boost/trunk/libs/mpl/doc/refmanual/key-type.html
   boost/trunk/libs/mpl/doc/refmanual/lambda-expression.html
   boost/trunk/libs/mpl/doc/refmanual/lambda.html
   boost/trunk/libs/mpl/doc/refmanual/less-equal.html
   boost/trunk/libs/mpl/doc/refmanual/less.html
   boost/trunk/libs/mpl/doc/refmanual/limit-list-size.html
   boost/trunk/libs/mpl/doc/refmanual/limit-map-size.html
   boost/trunk/libs/mpl/doc/refmanual/limit-metafunction-arity.html
   boost/trunk/libs/mpl/doc/refmanual/limit-set-size.html
   boost/trunk/libs/mpl/doc/refmanual/limit-unrolling.html
   boost/trunk/libs/mpl/doc/refmanual/limit-vector-size.html
   boost/trunk/libs/mpl/doc/refmanual/list-c.html
   boost/trunk/libs/mpl/doc/refmanual/list.html
   boost/trunk/libs/mpl/doc/refmanual/logical-operations.html
   boost/trunk/libs/mpl/doc/refmanual/long.html
   boost/trunk/libs/mpl/doc/refmanual/lower-bound.html
   boost/trunk/libs/mpl/doc/refmanual/macros.html
   boost/trunk/libs/mpl/doc/refmanual/map.html
   boost/trunk/libs/mpl/doc/refmanual/max-element.html
   boost/trunk/libs/mpl/doc/refmanual/max.html
   boost/trunk/libs/mpl/doc/refmanual/metafunction-class.html
   boost/trunk/libs/mpl/doc/refmanual/metafunction.html
   boost/trunk/libs/mpl/doc/refmanual/metafunctions-concepts.html
   boost/trunk/libs/mpl/doc/refmanual/metafunctions.html
   boost/trunk/libs/mpl/doc/refmanual/min-element.html
   boost/trunk/libs/mpl/doc/refmanual/min.html
   boost/trunk/libs/mpl/doc/refmanual/minus.html
   boost/trunk/libs/mpl/doc/refmanual/miscellaneous.html
   boost/trunk/libs/mpl/doc/refmanual/modulus.html
   boost/trunk/libs/mpl/doc/refmanual/negate.html
   boost/trunk/libs/mpl/doc/refmanual/next.html
   boost/trunk/libs/mpl/doc/refmanual/not-equal-to.html
   boost/trunk/libs/mpl/doc/refmanual/not.html
   boost/trunk/libs/mpl/doc/refmanual/numeric-cast.html
   boost/trunk/libs/mpl/doc/refmanual/numeric-metafunction.html
   boost/trunk/libs/mpl/doc/refmanual/numeric.html
   boost/trunk/libs/mpl/doc/refmanual/or.html
   boost/trunk/libs/mpl/doc/refmanual/order.html
   boost/trunk/libs/mpl/doc/refmanual/pair.html
   boost/trunk/libs/mpl/doc/refmanual/partition.html
   boost/trunk/libs/mpl/doc/refmanual/placeholder-expression.html
   boost/trunk/libs/mpl/doc/refmanual/placeholders.html
   boost/trunk/libs/mpl/doc/refmanual/plus.html
   boost/trunk/libs/mpl/doc/refmanual/pop-back.html
   boost/trunk/libs/mpl/doc/refmanual/pop-front.html
   boost/trunk/libs/mpl/doc/refmanual/prior.html
   boost/trunk/libs/mpl/doc/refmanual/protect.html
   boost/trunk/libs/mpl/doc/refmanual/push-back.html
   boost/trunk/libs/mpl/doc/refmanual/push-front.html
   boost/trunk/libs/mpl/doc/refmanual/querying-algorithms.html
   boost/trunk/libs/mpl/doc/refmanual/quote.html
   boost/trunk/libs/mpl/doc/refmanual/random-access-iterator.html
   boost/trunk/libs/mpl/doc/refmanual/random-access-sequence.html
   boost/trunk/libs/mpl/doc/refmanual/range-c.html
   boost/trunk/libs/mpl/doc/refmanual/refmanual_toc.html
   boost/trunk/libs/mpl/doc/refmanual/remove-if.html
   boost/trunk/libs/mpl/doc/refmanual/remove.html
   boost/trunk/libs/mpl/doc/refmanual/replace-if.html
   boost/trunk/libs/mpl/doc/refmanual/replace.html
   boost/trunk/libs/mpl/doc/refmanual/reverse-copy-if.html
   boost/trunk/libs/mpl/doc/refmanual/reverse-copy.html
   boost/trunk/libs/mpl/doc/refmanual/reverse-fold.html
   boost/trunk/libs/mpl/doc/refmanual/reverse-iter-fold.html
   boost/trunk/libs/mpl/doc/refmanual/reverse-partition.html
   boost/trunk/libs/mpl/doc/refmanual/reverse-remove-if.html
   boost/trunk/libs/mpl/doc/refmanual/reverse-remove.html
   boost/trunk/libs/mpl/doc/refmanual/reverse-replace-if.html
   boost/trunk/libs/mpl/doc/refmanual/reverse-replace.html
   boost/trunk/libs/mpl/doc/refmanual/reverse-stable-partition.html
   boost/trunk/libs/mpl/doc/refmanual/reverse-transform.html
   boost/trunk/libs/mpl/doc/refmanual/reverse-unique.html
   boost/trunk/libs/mpl/doc/refmanual/reverse.html
   boost/trunk/libs/mpl/doc/refmanual/reversible-algorithm.html
   boost/trunk/libs/mpl/doc/refmanual/sequence-tag.html
   boost/trunk/libs/mpl/doc/refmanual/sequences.html
   boost/trunk/libs/mpl/doc/refmanual/set-c.html
   boost/trunk/libs/mpl/doc/refmanual/set.html
   boost/trunk/libs/mpl/doc/refmanual/shift-left.html
   boost/trunk/libs/mpl/doc/refmanual/shift-right.html
   boost/trunk/libs/mpl/doc/refmanual/single-view.html
   boost/trunk/libs/mpl/doc/refmanual/size-t.html
   boost/trunk/libs/mpl/doc/refmanual/size.html
   boost/trunk/libs/mpl/doc/refmanual/sizeof.html
   boost/trunk/libs/mpl/doc/refmanual/sort.html
   boost/trunk/libs/mpl/doc/refmanual/stable-partition.html
   boost/trunk/libs/mpl/doc/refmanual/tag-dispatched.html
   boost/trunk/libs/mpl/doc/refmanual/terminology.html
   boost/trunk/libs/mpl/doc/refmanual/times.html
   boost/trunk/libs/mpl/doc/refmanual/transform-view.html
   boost/trunk/libs/mpl/doc/refmanual/transform.html
   boost/trunk/libs/mpl/doc/refmanual/transformation-algorithms.html
   boost/trunk/libs/mpl/doc/refmanual/trivial-metafunction.html
   boost/trunk/libs/mpl/doc/refmanual/trivial-metafunctions.html
   boost/trunk/libs/mpl/doc/refmanual/trivial.html
   boost/trunk/libs/mpl/doc/refmanual/type-selection.html
   boost/trunk/libs/mpl/doc/refmanual/unique.html
   boost/trunk/libs/mpl/doc/refmanual/unpack-args.html
   boost/trunk/libs/mpl/doc/refmanual/upper-bound.html
   boost/trunk/libs/mpl/doc/refmanual/value-type.html
   boost/trunk/libs/mpl/doc/refmanual/variadic-sequence.html
   boost/trunk/libs/mpl/doc/refmanual/vector-c.html
   boost/trunk/libs/mpl/doc/refmanual/vector.html
   boost/trunk/libs/mpl/doc/refmanual/views.html
   boost/trunk/libs/mpl/doc/refmanual/void.html
   boost/trunk/libs/mpl/doc/refmanual/zip-view.html
   boost/trunk/libs/mpl/doc/src/refmanual/ASSERT_MSG.rst
   boost/trunk/libs/mpl/doc/src/refmanual/IntegralConstant.rst
   boost/trunk/libs/mpl/doc/src/refmanual/refmanual.toc
   boost/trunk/libs/mpl/doc/src/refmanual/transform.rst
   boost/trunk/libs/mpl/doc/tutorial/acknowledgements.html
   boost/trunk/libs/mpl/doc/tutorial/apply-lambda-semantics.html
   boost/trunk/libs/mpl/doc/tutorial/broken-integral-constant.html
   boost/trunk/libs/mpl/doc/tutorial/changelog-history.html
   boost/trunk/libs/mpl/doc/tutorial/changes-in-boost-1-32-0.html
   boost/trunk/libs/mpl/doc/tutorial/dependencies.html
   boost/trunk/libs/mpl/doc/tutorial/details.html
   boost/trunk/libs/mpl/doc/tutorial/dimensional-analysis.html
   boost/trunk/libs/mpl/doc/tutorial/eti.html
   boost/trunk/libs/mpl/doc/tutorial/exercises.html
   boost/trunk/libs/mpl/doc/tutorial/handling-placeholders.html
   boost/trunk/libs/mpl/doc/tutorial/higher-order.html
   boost/trunk/libs/mpl/doc/tutorial/implementing-addition-and.html
   boost/trunk/libs/mpl/doc/tutorial/implementing-division.html
   boost/trunk/libs/mpl/doc/tutorial/implementing.html
   boost/trunk/libs/mpl/doc/tutorial/incomplete-support-for.html
   boost/trunk/libs/mpl/doc/tutorial/iterator-protocol.html
   boost/trunk/libs/mpl/doc/tutorial/lambda-and-non.html
   boost/trunk/libs/mpl/doc/tutorial/lambda-details.html
   boost/trunk/libs/mpl/doc/tutorial/metafunction-composition.html
   boost/trunk/libs/mpl/doc/tutorial/miscellaneous.html
   boost/trunk/libs/mpl/doc/tutorial/more-lambda-capabilities.html
   boost/trunk/libs/mpl/doc/tutorial/numeric-metafunction.html
   boost/trunk/libs/mpl/doc/tutorial/partial-metafunction.html
   boost/trunk/libs/mpl/doc/tutorial/physical-structure.html
   boost/trunk/libs/mpl/doc/tutorial/placeholder-expression.html
   boost/trunk/libs/mpl/doc/tutorial/placeholders.html
   boost/trunk/libs/mpl/doc/tutorial/portability.html
   boost/trunk/libs/mpl/doc/tutorial/reference-manual.html
   boost/trunk/libs/mpl/doc/tutorial/renaming-cleanup.html
   boost/trunk/libs/mpl/doc/tutorial/representing-dimensions.html
   boost/trunk/libs/mpl/doc/tutorial/representing-quantities.html
   boost/trunk/libs/mpl/doc/tutorial/resources.html
   boost/trunk/libs/mpl/doc/tutorial/tag-dispatching-protocol.html
   boost/trunk/libs/mpl/doc/tutorial/technical-details.html
   boost/trunk/libs/mpl/doc/tutorial/the-apply-metafunction.html
   boost/trunk/libs/mpl/doc/tutorial/the-importance-of-being.html
   boost/trunk/libs/mpl/doc/tutorial/the-lambda-metafunction.html
   boost/trunk/libs/mpl/doc/tutorial/tutorial-metafunctions.html
   boost/trunk/libs/mpl/doc/tutorial/tutorial_toc.html
   boost/trunk/libs/mpl/index.html
   boost/trunk/libs/mpl/preprocessed/list/list10.cpp
   boost/trunk/libs/mpl/preprocessed/list/list10_c.cpp
   boost/trunk/libs/mpl/preprocessed/list/list20.cpp
   boost/trunk/libs/mpl/preprocessed/list/list20_c.cpp
   boost/trunk/libs/mpl/preprocessed/list/list30.cpp
   boost/trunk/libs/mpl/preprocessed/list/list30_c.cpp
   boost/trunk/libs/mpl/preprocessed/list/list40.cpp
   boost/trunk/libs/mpl/preprocessed/list/list40_c.cpp
   boost/trunk/libs/mpl/preprocessed/list/list50.cpp
   boost/trunk/libs/mpl/preprocessed/list/list50_c.cpp
   boost/trunk/libs/mpl/preprocessed/map/map10.cpp
   boost/trunk/libs/mpl/preprocessed/map/map20.cpp
   boost/trunk/libs/mpl/preprocessed/map/map30.cpp
   boost/trunk/libs/mpl/preprocessed/map/map40.cpp
   boost/trunk/libs/mpl/preprocessed/map/map50.cpp
   boost/trunk/libs/mpl/preprocessed/preprocess_list.py
   boost/trunk/libs/mpl/preprocessed/preprocess_map.py
   boost/trunk/libs/mpl/preprocessed/preprocess_set.py
   boost/trunk/libs/mpl/preprocessed/preprocess_vector.py
   boost/trunk/libs/mpl/preprocessed/set/set10.cpp
   boost/trunk/libs/mpl/preprocessed/set/set10_c.cpp
   boost/trunk/libs/mpl/preprocessed/set/set20.cpp
   boost/trunk/libs/mpl/preprocessed/set/set20_c.cpp
   boost/trunk/libs/mpl/preprocessed/set/set30.cpp
   boost/trunk/libs/mpl/preprocessed/set/set30_c.cpp
   boost/trunk/libs/mpl/preprocessed/set/set40.cpp
   boost/trunk/libs/mpl/preprocessed/set/set40_c.cpp
   boost/trunk/libs/mpl/preprocessed/set/set50.cpp
   boost/trunk/libs/mpl/preprocessed/set/set50_c.cpp
   boost/trunk/libs/mpl/preprocessed/src/advance_backward.cpp
   boost/trunk/libs/mpl/preprocessed/src/advance_forward.cpp
   boost/trunk/libs/mpl/preprocessed/src/and.cpp
   boost/trunk/libs/mpl/preprocessed/src/apply.cpp
   boost/trunk/libs/mpl/preprocessed/src/apply_fwd.cpp
   boost/trunk/libs/mpl/preprocessed/src/apply_wrap.cpp
   boost/trunk/libs/mpl/preprocessed/src/arg.cpp
   boost/trunk/libs/mpl/preprocessed/src/basic_bind.cpp
   boost/trunk/libs/mpl/preprocessed/src/bind.cpp
   boost/trunk/libs/mpl/preprocessed/src/bind_fwd.cpp
   boost/trunk/libs/mpl/preprocessed/src/bitand.cpp
   boost/trunk/libs/mpl/preprocessed/src/bitor.cpp
   boost/trunk/libs/mpl/preprocessed/src/bitxor.cpp
   boost/trunk/libs/mpl/preprocessed/src/deque.cpp
   boost/trunk/libs/mpl/preprocessed/src/divides.cpp
   boost/trunk/libs/mpl/preprocessed/src/equal_to.cpp
   boost/trunk/libs/mpl/preprocessed/src/fold_impl.cpp
   boost/trunk/libs/mpl/preprocessed/src/full_lambda.cpp
   boost/trunk/libs/mpl/preprocessed/src/greater.cpp
   boost/trunk/libs/mpl/preprocessed/src/greater_equal.cpp
   boost/trunk/libs/mpl/preprocessed/src/inherit.cpp
   boost/trunk/libs/mpl/preprocessed/src/iter_fold_if_impl.cpp
   boost/trunk/libs/mpl/preprocessed/src/iter_fold_impl.cpp
   boost/trunk/libs/mpl/preprocessed/src/lambda_no_ctps.cpp
   boost/trunk/libs/mpl/preprocessed/src/less.cpp
   boost/trunk/libs/mpl/preprocessed/src/less_equal.cpp
   boost/trunk/libs/mpl/preprocessed/src/list.cpp
   boost/trunk/libs/mpl/preprocessed/src/list_c.cpp
   boost/trunk/libs/mpl/preprocessed/src/map.cpp
   boost/trunk/libs/mpl/preprocessed/src/minus.cpp
   boost/trunk/libs/mpl/preprocessed/src/modulus.cpp
   boost/trunk/libs/mpl/preprocessed/src/not_equal_to.cpp
   boost/trunk/libs/mpl/preprocessed/src/or.cpp
   boost/trunk/libs/mpl/preprocessed/src/placeholders.cpp
   boost/trunk/libs/mpl/preprocessed/src/plus.cpp
   boost/trunk/libs/mpl/preprocessed/src/quote.cpp
   boost/trunk/libs/mpl/preprocessed/src/reverse_fold_impl.cpp
   boost/trunk/libs/mpl/preprocessed/src/reverse_iter_fold_impl.cpp
   boost/trunk/libs/mpl/preprocessed/src/set.cpp
   boost/trunk/libs/mpl/preprocessed/src/set_c.cpp
   boost/trunk/libs/mpl/preprocessed/src/shift_left.cpp
   boost/trunk/libs/mpl/preprocessed/src/shift_right.cpp
   boost/trunk/libs/mpl/preprocessed/src/template_arity.cpp
   boost/trunk/libs/mpl/preprocessed/src/times.cpp
   boost/trunk/libs/mpl/preprocessed/src/unpack_args.cpp
   boost/trunk/libs/mpl/preprocessed/src/vector.cpp
   boost/trunk/libs/mpl/preprocessed/src/vector_c.cpp
   boost/trunk/libs/mpl/preprocessed/vector/vector10.cpp
   boost/trunk/libs/mpl/preprocessed/vector/vector10_c.cpp
   boost/trunk/libs/mpl/preprocessed/vector/vector20.cpp
   boost/trunk/libs/mpl/preprocessed/vector/vector20_c.cpp
   boost/trunk/libs/mpl/preprocessed/vector/vector30.cpp
   boost/trunk/libs/mpl/preprocessed/vector/vector30_c.cpp
   boost/trunk/libs/mpl/preprocessed/vector/vector40.cpp
   boost/trunk/libs/mpl/preprocessed/vector/vector40_c.cpp
   boost/trunk/libs/mpl/preprocessed/vector/vector50.cpp
   boost/trunk/libs/mpl/preprocessed/vector/vector50_c.cpp
   boost/trunk/libs/mpl/test/integral_wrapper_test.hpp
   boost/trunk/libs/mpl/test/is_sequence.cpp
   boost/trunk/libs/mpl/test/multiset.cpp
   boost/trunk/libs/mpl/test/set.cpp
   boost/trunk/libs/multi_array/doc/xml/multi_array_ref.xml
   boost/trunk/libs/multi_array/index.html
   boost/trunk/libs/multi_array/test/generative_tests.hpp
   boost/trunk/libs/multi_array/test/index_bases.cpp
   boost/trunk/libs/multi_array/test/resize.cpp
   boost/trunk/libs/multi_index/doc/acknowledgements.html
   boost/trunk/libs/multi_index/doc/compiler_specifics.html
   boost/trunk/libs/multi_index/doc/reference/hash_indices.html
   boost/trunk/libs/multi_index/doc/reference/key_extraction.html
   boost/trunk/libs/multi_index/doc/tutorial/basics.html
   boost/trunk/libs/multi_index/test/test_list_ops.cpp
   boost/trunk/libs/multi_index/test/test_modifiers.cpp
   boost/trunk/libs/multi_index/test/test_range.cpp
   boost/trunk/libs/multi_index/test/test_rearrange.cpp
   boost/trunk/libs/numeric/conversion/doc/converter_policies.html
   boost/trunk/libs/numeric/conversion/index.html
   boost/trunk/libs/numeric/index.html
   boost/trunk/libs/numeric/interval/doc/checking.htm
   boost/trunk/libs/numeric/interval/doc/comparisons.htm
   boost/trunk/libs/numeric/interval/doc/examples.htm
   boost/trunk/libs/numeric/interval/doc/guide.htm
   boost/trunk/libs/numeric/interval/doc/includes.htm
   boost/trunk/libs/numeric/interval/doc/index.html
   boost/trunk/libs/numeric/interval/doc/interval.htm
   boost/trunk/libs/numeric/interval/doc/numbers.htm
   boost/trunk/libs/numeric/interval/doc/policies.htm
   boost/trunk/libs/numeric/interval/doc/rounding.htm
   boost/trunk/libs/numeric/interval/doc/todo.htm
   boost/trunk/libs/numeric/interval/test/Jamfile.v2
   boost/trunk/libs/numeric/ublas/index.html
   boost/trunk/libs/numeric/ublas/test/Jamfile.v2
   boost/trunk/libs/numeric/ublas/test/placement_new.cpp
   boost/trunk/libs/optional/doc/optional.html
   boost/trunk/libs/optional/index.html
   boost/trunk/libs/parameter/doc/Jamfile.v2
   boost/trunk/libs/parameter/doc/html/index.html
   boost/trunk/libs/parameter/doc/html/python.html
   boost/trunk/libs/parameter/doc/html/reference.html
   boost/trunk/libs/parameter/doc/html/rst.css
   boost/trunk/libs/parameter/doc/index.rst
   boost/trunk/libs/parameter/doc/python.rst
   boost/trunk/libs/parameter/doc/reference.rst
   boost/trunk/libs/parameter/test/Jamfile.v2
   boost/trunk/libs/parameter/test/basics.cpp
   boost/trunk/libs/parameter/test/maybe.cpp
   boost/trunk/libs/parameter/test/mpl.cpp
   boost/trunk/libs/parameter/test/ntp.cpp
   boost/trunk/libs/parameter/test/preprocessor.cpp
   boost/trunk/libs/pool/TODO.txt
   boost/trunk/libs/pool/doc/concepts.html
   boost/trunk/libs/pool/doc/implementation/alignment.html
   boost/trunk/libs/pool/doc/implementation/ct_gcd_lcm.html
   boost/trunk/libs/pool/doc/implementation/for.html
   boost/trunk/libs/pool/doc/implementation/gcd_lcm.html
   boost/trunk/libs/pool/doc/implementation/guard.html
   boost/trunk/libs/pool/doc/implementation/mutex.html
   boost/trunk/libs/pool/doc/implementation/object_pool.html
   boost/trunk/libs/pool/doc/implementation/pool.html
   boost/trunk/libs/pool/doc/implementation/pool_alloc.html
   boost/trunk/libs/pool/doc/implementation/pool_construct.html
   boost/trunk/libs/pool/doc/implementation/simple_segregated_storage.html
   boost/trunk/libs/pool/doc/implementation/singleton.html
   boost/trunk/libs/pool/doc/implementation/singleton_pool.html
   boost/trunk/libs/pool/doc/index.html
   boost/trunk/libs/pool/doc/interfaces.html
   boost/trunk/libs/pool/doc/interfaces/object_pool.html
   boost/trunk/libs/pool/doc/interfaces/pool.html
   boost/trunk/libs/pool/doc/interfaces/pool_alloc.html
   boost/trunk/libs/pool/doc/interfaces/simple_segregated_storage.html
   boost/trunk/libs/pool/doc/interfaces/singleton_pool.html
   boost/trunk/libs/pool/doc/interfaces/user_allocator.html
   boost/trunk/libs/pool/doc/pool.css
   boost/trunk/libs/pool/index.html
   boost/trunk/libs/preprocessor/doc/acknowledgements.html
   boost/trunk/libs/preprocessor/doc/bibliography.html
   boost/trunk/libs/preprocessor/doc/contents.html
   boost/trunk/libs/preprocessor/doc/data.html
   boost/trunk/libs/preprocessor/doc/data/arrays.html
   boost/trunk/libs/preprocessor/doc/data/lists.html
   boost/trunk/libs/preprocessor/doc/data/sequences.html
   boost/trunk/libs/preprocessor/doc/data/tuples.html
   boost/trunk/libs/preprocessor/doc/examples.html
   boost/trunk/libs/preprocessor/doc/headers.html
   boost/trunk/libs/preprocessor/doc/headers/arithmetic.html
   boost/trunk/libs/preprocessor/doc/headers/arithmetic/add.html
   boost/trunk/libs/preprocessor/doc/headers/arithmetic/dec.html
   boost/trunk/libs/preprocessor/doc/headers/arithmetic/div.html
   boost/trunk/libs/preprocessor/doc/headers/arithmetic/inc.html
   boost/trunk/libs/preprocessor/doc/headers/arithmetic/mod.html
   boost/trunk/libs/preprocessor/doc/headers/arithmetic/mul.html
   boost/trunk/libs/preprocessor/doc/headers/arithmetic/sub.html
   boost/trunk/libs/preprocessor/doc/headers/array.html
   boost/trunk/libs/preprocessor/doc/headers/array/data.html
   boost/trunk/libs/preprocessor/doc/headers/array/elem.html
   boost/trunk/libs/preprocessor/doc/headers/array/insert.html
   boost/trunk/libs/preprocessor/doc/headers/array/pop_back.html
   boost/trunk/libs/preprocessor/doc/headers/array/pop_front.html
   boost/trunk/libs/preprocessor/doc/headers/array/push_back.html
   boost/trunk/libs/preprocessor/doc/headers/array/push_front.html
   boost/trunk/libs/preprocessor/doc/headers/array/remove.html
   boost/trunk/libs/preprocessor/doc/headers/array/replace.html
   boost/trunk/libs/preprocessor/doc/headers/array/reverse.html
   boost/trunk/libs/preprocessor/doc/headers/array/size.html
   boost/trunk/libs/preprocessor/doc/headers/assert_msg.html
   boost/trunk/libs/preprocessor/doc/headers/cat.html
   boost/trunk/libs/preprocessor/doc/headers/comma.html
   boost/trunk/libs/preprocessor/doc/headers/comma_if.html
   boost/trunk/libs/preprocessor/doc/headers/comparison.html
   boost/trunk/libs/preprocessor/doc/headers/comparison/equal.html
   boost/trunk/libs/preprocessor/doc/headers/comparison/greater.html
   boost/trunk/libs/preprocessor/doc/headers/comparison/greater_equal.html
   boost/trunk/libs/preprocessor/doc/headers/comparison/less.html
   boost/trunk/libs/preprocessor/doc/headers/comparison/less_equal.html
   boost/trunk/libs/preprocessor/doc/headers/comparison/not_equal.html
   boost/trunk/libs/preprocessor/doc/headers/config/limits.html
   boost/trunk/libs/preprocessor/doc/headers/control.html
   boost/trunk/libs/preprocessor/doc/headers/control/deduce_d.html
   boost/trunk/libs/preprocessor/doc/headers/control/expr_if.html
   boost/trunk/libs/preprocessor/doc/headers/control/expr_iif.html
   boost/trunk/libs/preprocessor/doc/headers/control/if.html
   boost/trunk/libs/preprocessor/doc/headers/control/iif.html
   boost/trunk/libs/preprocessor/doc/headers/control/while.html
   boost/trunk/libs/preprocessor/doc/headers/debug.html
   boost/trunk/libs/preprocessor/doc/headers/debug/assert.html
   boost/trunk/libs/preprocessor/doc/headers/debug/line.html
   boost/trunk/libs/preprocessor/doc/headers/dec.html
   boost/trunk/libs/preprocessor/doc/headers/empty.html
   boost/trunk/libs/preprocessor/doc/headers/enum.html
   boost/trunk/libs/preprocessor/doc/headers/enum_params.html
   boost/trunk/libs/preprocessor/doc/headers/enum_shifted.html
   boost/trunk/libs/preprocessor/doc/headers/enum_shifted_params.html
   boost/trunk/libs/preprocessor/doc/headers/epwad.html
   boost/trunk/libs/preprocessor/doc/headers/epwd.html
   boost/trunk/libs/preprocessor/doc/headers/expand.html
   boost/trunk/libs/preprocessor/doc/headers/expr_if.html
   boost/trunk/libs/preprocessor/doc/headers/facilities.html
   boost/trunk/libs/preprocessor/doc/headers/facilities/apply.html
   boost/trunk/libs/preprocessor/doc/headers/facilities/empty.html
   boost/trunk/libs/preprocessor/doc/headers/facilities/expand.html
   boost/trunk/libs/preprocessor/doc/headers/facilities/identity.html
   boost/trunk/libs/preprocessor/doc/headers/facilities/intercept.html
   boost/trunk/libs/preprocessor/doc/headers/for.html
   boost/trunk/libs/preprocessor/doc/headers/identity.html
   boost/trunk/libs/preprocessor/doc/headers/if.html
   boost/trunk/libs/preprocessor/doc/headers/inc.html
   boost/trunk/libs/preprocessor/doc/headers/iterate.html
   boost/trunk/libs/preprocessor/doc/headers/iteration.html
   boost/trunk/libs/preprocessor/doc/headers/iteration/iterate.html
   boost/trunk/libs/preprocessor/doc/headers/iteration/local.html
   boost/trunk/libs/preprocessor/doc/headers/iteration/self.html
   boost/trunk/libs/preprocessor/doc/headers/library.html
   boost/trunk/libs/preprocessor/doc/headers/limits.html
   boost/trunk/libs/preprocessor/doc/headers/list.html
   boost/trunk/libs/preprocessor/doc/headers/list/adt.html
   boost/trunk/libs/preprocessor/doc/headers/list/append.html
   boost/trunk/libs/preprocessor/doc/headers/list/at.html
   boost/trunk/libs/preprocessor/doc/headers/list/cat.html
   boost/trunk/libs/preprocessor/doc/headers/list/enum.html
   boost/trunk/libs/preprocessor/doc/headers/list/filter.html
   boost/trunk/libs/preprocessor/doc/headers/list/first_n.html
   boost/trunk/libs/preprocessor/doc/headers/list/fold_left.html
   boost/trunk/libs/preprocessor/doc/headers/list/fold_right.html
   boost/trunk/libs/preprocessor/doc/headers/list/for_each.html
   boost/trunk/libs/preprocessor/doc/headers/list/for_each_i.html
   boost/trunk/libs/preprocessor/doc/headers/list/for_each_product.html
   boost/trunk/libs/preprocessor/doc/headers/list/rest_n.html
   boost/trunk/libs/preprocessor/doc/headers/list/reverse.html
   boost/trunk/libs/preprocessor/doc/headers/list/size.html
   boost/trunk/libs/preprocessor/doc/headers/list/to_tuple.html
   boost/trunk/libs/preprocessor/doc/headers/list/transform.html
   boost/trunk/libs/preprocessor/doc/headers/logical.html
   boost/trunk/libs/preprocessor/doc/headers/logical/and.html
   boost/trunk/libs/preprocessor/doc/headers/logical/bitand.html
   boost/trunk/libs/preprocessor/doc/headers/logical/bitnor.html
   boost/trunk/libs/preprocessor/doc/headers/logical/bitor.html
   boost/trunk/libs/preprocessor/doc/headers/logical/bitxor.html
   boost/trunk/libs/preprocessor/doc/headers/logical/bool.html
   boost/trunk/libs/preprocessor/doc/headers/logical/compl.html
   boost/trunk/libs/preprocessor/doc/headers/logical/nor.html
   boost/trunk/libs/preprocessor/doc/headers/logical/not.html
   boost/trunk/libs/preprocessor/doc/headers/logical/or.html
   boost/trunk/libs/preprocessor/doc/headers/logical/xor.html
   boost/trunk/libs/preprocessor/doc/headers/max.html
   boost/trunk/libs/preprocessor/doc/headers/min.html
   boost/trunk/libs/preprocessor/doc/headers/preprocessor.html
   boost/trunk/libs/preprocessor/doc/headers/punctuation.html
   boost/trunk/libs/preprocessor/doc/headers/punctuation/comma.html
   boost/trunk/libs/preprocessor/doc/headers/punctuation/comma_if.html
   boost/trunk/libs/preprocessor/doc/headers/punctuation/paren.html
   boost/trunk/libs/preprocessor/doc/headers/punctuation/paren_if.html
   boost/trunk/libs/preprocessor/doc/headers/repeat.html
   boost/trunk/libs/preprocessor/doc/headers/repeat_2nd.html
   boost/trunk/libs/preprocessor/doc/headers/repeat_3rd.html
   boost/trunk/libs/preprocessor/doc/headers/repeat_from_to.html
   boost/trunk/libs/preprocessor/doc/headers/repeat_from_to_2nd.html
   boost/trunk/libs/preprocessor/doc/headers/repeat_from_to_3rd.html
   boost/trunk/libs/preprocessor/doc/headers/repetition.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/deduce_r.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/deduce_z.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/enum.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/enum_binary_params.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/enum_params.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/enum_shifted.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/enum_shifted_params.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/enum_trailing.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/enum_trailing_params.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/epwad.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/epwd.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/esbp.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/etbp.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/for.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/repeat.html
   boost/trunk/libs/preprocessor/doc/headers/repetition/repeat_from_to.html
   boost/trunk/libs/preprocessor/doc/headers/selection.html
   boost/trunk/libs/preprocessor/doc/headers/selection/max.html
   boost/trunk/libs/preprocessor/doc/headers/selection/min.html
   boost/trunk/libs/preprocessor/doc/headers/seq.html
   boost/trunk/libs/preprocessor/doc/headers/seq/cat.html
   boost/trunk/libs/preprocessor/doc/headers/seq/elem.html
   boost/trunk/libs/preprocessor/doc/headers/seq/enum.html
   boost/trunk/libs/preprocessor/doc/headers/seq/filter.html
   boost/trunk/libs/preprocessor/doc/headers/seq/first_n.html
   boost/trunk/libs/preprocessor/doc/headers/seq/fold_left.html
   boost/trunk/libs/preprocessor/doc/headers/seq/fold_right.html
   boost/trunk/libs/preprocessor/doc/headers/seq/for_each.html
   boost/trunk/libs/preprocessor/doc/headers/seq/for_each_i.html
   boost/trunk/libs/preprocessor/doc/headers/seq/for_each_product.html
   boost/trunk/libs/preprocessor/doc/headers/seq/insert.html
   boost/trunk/libs/preprocessor/doc/headers/seq/pop_back.html
   boost/trunk/libs/preprocessor/doc/headers/seq/pop_front.html
   boost/trunk/libs/preprocessor/doc/headers/seq/push_back.html
   boost/trunk/libs/preprocessor/doc/headers/seq/push_front.html
   boost/trunk/libs/preprocessor/doc/headers/seq/remove.html
   boost/trunk/libs/preprocessor/doc/headers/seq/replace.html
   boost/trunk/libs/preprocessor/doc/headers/seq/rest_n.html
   boost/trunk/libs/preprocessor/doc/headers/seq/reverse.html
   boost/trunk/libs/preprocessor/doc/headers/seq/seq.html
   boost/trunk/libs/preprocessor/doc/headers/seq/size.html
   boost/trunk/libs/preprocessor/doc/headers/seq/subseq.html
   boost/trunk/libs/preprocessor/doc/headers/seq/to_array.html
   boost/trunk/libs/preprocessor/doc/headers/seq/to_tuple.html
   boost/trunk/libs/preprocessor/doc/headers/seq/transform.html
   boost/trunk/libs/preprocessor/doc/headers/slot.html
   boost/trunk/libs/preprocessor/doc/headers/slot/counter.html
   boost/trunk/libs/preprocessor/doc/headers/slot/slot.html
   boost/trunk/libs/preprocessor/doc/headers/stringize.html
   boost/trunk/libs/preprocessor/doc/headers/tuple.html
   boost/trunk/libs/preprocessor/doc/headers/tuple/eat.html
   boost/trunk/libs/preprocessor/doc/headers/tuple/elem.html
   boost/trunk/libs/preprocessor/doc/headers/tuple/rem.html
   boost/trunk/libs/preprocessor/doc/headers/tuple/reverse.html
   boost/trunk/libs/preprocessor/doc/headers/tuple/to_list.html
   boost/trunk/libs/preprocessor/doc/headers/tuple/to_seq.html
   boost/trunk/libs/preprocessor/doc/headers/while.html
   boost/trunk/libs/preprocessor/doc/headers/wstringize.html
   boost/trunk/libs/preprocessor/doc/index.html
   boost/trunk/libs/preprocessor/doc/miscellanea.html
   boost/trunk/libs/preprocessor/doc/ref.html
   boost/trunk/libs/preprocessor/doc/ref/add.html
   boost/trunk/libs/preprocessor/doc/ref/add_d.html
   boost/trunk/libs/preprocessor/doc/ref/and.html
   boost/trunk/libs/preprocessor/doc/ref/apply.html
   boost/trunk/libs/preprocessor/doc/ref/array_data.html
   boost/trunk/libs/preprocessor/doc/ref/array_elem.html
   boost/trunk/libs/preprocessor/doc/ref/array_insert.html
   boost/trunk/libs/preprocessor/doc/ref/array_insert_d.html
   boost/trunk/libs/preprocessor/doc/ref/array_pop_back.html
   boost/trunk/libs/preprocessor/doc/ref/array_pop_back_z.html
   boost/trunk/libs/preprocessor/doc/ref/array_pop_front.html
   boost/trunk/libs/preprocessor/doc/ref/array_pop_front_z.html
   boost/trunk/libs/preprocessor/doc/ref/array_push_back.html
   boost/trunk/libs/preprocessor/doc/ref/array_push_front.html
   boost/trunk/libs/preprocessor/doc/ref/array_remove.html
   boost/trunk/libs/preprocessor/doc/ref/array_remove_d.html
   boost/trunk/libs/preprocessor/doc/ref/array_replace.html
   boost/trunk/libs/preprocessor/doc/ref/array_replace_d.html
   boost/trunk/libs/preprocessor/doc/ref/array_reverse.html
   boost/trunk/libs/preprocessor/doc/ref/array_size.html
   boost/trunk/libs/preprocessor/doc/ref/assert.html
   boost/trunk/libs/preprocessor/doc/ref/assert_msg.html
   boost/trunk/libs/preprocessor/doc/ref/assign_slot.html
   boost/trunk/libs/preprocessor/doc/ref/bitand.html
   boost/trunk/libs/preprocessor/doc/ref/bitnor.html
   boost/trunk/libs/preprocessor/doc/ref/bitor.html
   boost/trunk/libs/preprocessor/doc/ref/bitxor.html
   boost/trunk/libs/preprocessor/doc/ref/bool.html
   boost/trunk/libs/preprocessor/doc/ref/cat.html
   boost/trunk/libs/preprocessor/doc/ref/comma.html
   boost/trunk/libs/preprocessor/doc/ref/comma_if.html
   boost/trunk/libs/preprocessor/doc/ref/compl.html
   boost/trunk/libs/preprocessor/doc/ref/config_extended_line_info.html
   boost/trunk/libs/preprocessor/doc/ref/counter.html
   boost/trunk/libs/preprocessor/doc/ref/dec.html
   boost/trunk/libs/preprocessor/doc/ref/deduce_d.html
   boost/trunk/libs/preprocessor/doc/ref/deduce_r.html
   boost/trunk/libs/preprocessor/doc/ref/deduce_z.html
   boost/trunk/libs/preprocessor/doc/ref/div.html
   boost/trunk/libs/preprocessor/doc/ref/div_d.html
   boost/trunk/libs/preprocessor/doc/ref/empty.html
   boost/trunk/libs/preprocessor/doc/ref/enum.html
   boost/trunk/libs/preprocessor/doc/ref/enum_binary_params.html
   boost/trunk/libs/preprocessor/doc/ref/enum_binary_params_z.html
   boost/trunk/libs/preprocessor/doc/ref/enum_params.html
   boost/trunk/libs/preprocessor/doc/ref/enum_params_with_a_default.html
   boost/trunk/libs/preprocessor/doc/ref/enum_params_with_defaults.html
   boost/trunk/libs/preprocessor/doc/ref/enum_params_z.html
   boost/trunk/libs/preprocessor/doc/ref/enum_shifted.html
   boost/trunk/libs/preprocessor/doc/ref/enum_shifted_params.html
   boost/trunk/libs/preprocessor/doc/ref/enum_shifted_params_z.html
   boost/trunk/libs/preprocessor/doc/ref/enum_shifted_z.html
   boost/trunk/libs/preprocessor/doc/ref/enum_trailing.html
   boost/trunk/libs/preprocessor/doc/ref/enum_trailing_params.html
   boost/trunk/libs/preprocessor/doc/ref/enum_trailing_params_z.html
   boost/trunk/libs/preprocessor/doc/ref/enum_trailing_z.html
   boost/trunk/libs/preprocessor/doc/ref/enum_z.html
   boost/trunk/libs/preprocessor/doc/ref/equal.html
   boost/trunk/libs/preprocessor/doc/ref/equal_d.html
   boost/trunk/libs/preprocessor/doc/ref/esbp.html
   boost/trunk/libs/preprocessor/doc/ref/esbpz.html
   boost/trunk/libs/preprocessor/doc/ref/etbp.html
   boost/trunk/libs/preprocessor/doc/ref/etbpz.html
   boost/trunk/libs/preprocessor/doc/ref/expand.html
   boost/trunk/libs/preprocessor/doc/ref/expr_if.html
   boost/trunk/libs/preprocessor/doc/ref/expr_iif.html
   boost/trunk/libs/preprocessor/doc/ref/filename_x.html
   boost/trunk/libs/preprocessor/doc/ref/for.html
   boost/trunk/libs/preprocessor/doc/ref/for_r.html
   boost/trunk/libs/preprocessor/doc/ref/frame_finish.html
   boost/trunk/libs/preprocessor/doc/ref/frame_flags.html
   boost/trunk/libs/preprocessor/doc/ref/frame_iteration.html
   boost/trunk/libs/preprocessor/doc/ref/frame_start.html
   boost/trunk/libs/preprocessor/doc/ref/greater.html
   boost/trunk/libs/preprocessor/doc/ref/greater_d.html
   boost/trunk/libs/preprocessor/doc/ref/greater_equal.html
   boost/trunk/libs/preprocessor/doc/ref/greater_equal_d.html
   boost/trunk/libs/preprocessor/doc/ref/identity.html
   boost/trunk/libs/preprocessor/doc/ref/if.html
   boost/trunk/libs/preprocessor/doc/ref/iif.html
   boost/trunk/libs/preprocessor/doc/ref/inc.html
   boost/trunk/libs/preprocessor/doc/ref/include_self.html
   boost/trunk/libs/preprocessor/doc/ref/indirect_self.html
   boost/trunk/libs/preprocessor/doc/ref/intercept.html
   boost/trunk/libs/preprocessor/doc/ref/is_iterating.html
   boost/trunk/libs/preprocessor/doc/ref/is_selfish.html
   boost/trunk/libs/preprocessor/doc/ref/iterate.html
   boost/trunk/libs/preprocessor/doc/ref/iteration.html
   boost/trunk/libs/preprocessor/doc/ref/iteration_depth.html
   boost/trunk/libs/preprocessor/doc/ref/iteration_finish.html
   boost/trunk/libs/preprocessor/doc/ref/iteration_flags.html
   boost/trunk/libs/preprocessor/doc/ref/iteration_limits.html
   boost/trunk/libs/preprocessor/doc/ref/iteration_params_x.html
   boost/trunk/libs/preprocessor/doc/ref/iteration_start.html
   boost/trunk/libs/preprocessor/doc/ref/less.html
   boost/trunk/libs/preprocessor/doc/ref/less_d.html
   boost/trunk/libs/preprocessor/doc/ref/less_equal.html
   boost/trunk/libs/preprocessor/doc/ref/less_equal_d.html
   boost/trunk/libs/preprocessor/doc/ref/limit_dim.html
   boost/trunk/libs/preprocessor/doc/ref/limit_for.html
   boost/trunk/libs/preprocessor/doc/ref/limit_iteration.html
   boost/trunk/libs/preprocessor/doc/ref/limit_iteration_dim.html
   boost/trunk/libs/preprocessor/doc/ref/limit_mag.html
   boost/trunk/libs/preprocessor/doc/ref/limit_repeat.html
   boost/trunk/libs/preprocessor/doc/ref/limit_seq.html
   boost/trunk/libs/preprocessor/doc/ref/limit_slot_count.html
   boost/trunk/libs/preprocessor/doc/ref/limit_slot_sig.html
   boost/trunk/libs/preprocessor/doc/ref/limit_tuple.html
   boost/trunk/libs/preprocessor/doc/ref/limit_while.html
   boost/trunk/libs/preprocessor/doc/ref/line.html
   boost/trunk/libs/preprocessor/doc/ref/list_append.html
   boost/trunk/libs/preprocessor/doc/ref/list_append_d.html
   boost/trunk/libs/preprocessor/doc/ref/list_at.html
   boost/trunk/libs/preprocessor/doc/ref/list_at_d.html
   boost/trunk/libs/preprocessor/doc/ref/list_cat.html
   boost/trunk/libs/preprocessor/doc/ref/list_cat_d.html
   boost/trunk/libs/preprocessor/doc/ref/list_cons.html
   boost/trunk/libs/preprocessor/doc/ref/list_enum.html
   boost/trunk/libs/preprocessor/doc/ref/list_enum_r.html
   boost/trunk/libs/preprocessor/doc/ref/list_filter.html
   boost/trunk/libs/preprocessor/doc/ref/list_filter_d.html
   boost/trunk/libs/preprocessor/doc/ref/list_first.html
   boost/trunk/libs/preprocessor/doc/ref/list_first_n.html
   boost/trunk/libs/preprocessor/doc/ref/list_first_n_d.html
   boost/trunk/libs/preprocessor/doc/ref/list_fold_left.html
   boost/trunk/libs/preprocessor/doc/ref/list_fold_left_2nd.html
   boost/trunk/libs/preprocessor/doc/ref/list_fold_left_2nd_d.html
   boost/trunk/libs/preprocessor/doc/ref/list_fold_left_d.html
   boost/trunk/libs/preprocessor/doc/ref/list_fold_left_d_old.html
   boost/trunk/libs/preprocessor/doc/ref/list_fold_right.html
   boost/trunk/libs/preprocessor/doc/ref/list_fold_right_2nd.html
   boost/trunk/libs/preprocessor/doc/ref/list_fold_right_2nd_d.html
   boost/trunk/libs/preprocessor/doc/ref/list_fold_right_d.html
   boost/trunk/libs/preprocessor/doc/ref/list_fold_right_d_old.html
   boost/trunk/libs/preprocessor/doc/ref/list_for_each.html
   boost/trunk/libs/preprocessor/doc/ref/list_for_each_i.html
   boost/trunk/libs/preprocessor/doc/ref/list_for_each_i_r.html
   boost/trunk/libs/preprocessor/doc/ref/list_for_each_product.html
   boost/trunk/libs/preprocessor/doc/ref/list_for_each_product_r.html
   boost/trunk/libs/preprocessor/doc/ref/list_for_each_r.html
   boost/trunk/libs/preprocessor/doc/ref/list_is_cons.html
   boost/trunk/libs/preprocessor/doc/ref/list_is_nil.html
   boost/trunk/libs/preprocessor/doc/ref/list_nil.html
   boost/trunk/libs/preprocessor/doc/ref/list_rest.html
   boost/trunk/libs/preprocessor/doc/ref/list_rest_n.html
   boost/trunk/libs/preprocessor/doc/ref/list_rest_n_d.html
   boost/trunk/libs/preprocessor/doc/ref/list_reverse.html
   boost/trunk/libs/preprocessor/doc/ref/list_reverse_d.html
   boost/trunk/libs/preprocessor/doc/ref/list_size.html
   boost/trunk/libs/preprocessor/doc/ref/list_size_d.html
   boost/trunk/libs/preprocessor/doc/ref/list_to_tuple.html
   boost/trunk/libs/preprocessor/doc/ref/list_to_tuple_r.html
   boost/trunk/libs/preprocessor/doc/ref/list_transform.html
   boost/trunk/libs/preprocessor/doc/ref/list_transform_d.html
   boost/trunk/libs/preprocessor/doc/ref/local_iterate.html
   boost/trunk/libs/preprocessor/doc/ref/local_limits.html
   boost/trunk/libs/preprocessor/doc/ref/local_macro.html
   boost/trunk/libs/preprocessor/doc/ref/lparen.html
   boost/trunk/libs/preprocessor/doc/ref/lparen_if.html
   boost/trunk/libs/preprocessor/doc/ref/max.html
   boost/trunk/libs/preprocessor/doc/ref/max_d.html
   boost/trunk/libs/preprocessor/doc/ref/min.html
   boost/trunk/libs/preprocessor/doc/ref/min_d.html
   boost/trunk/libs/preprocessor/doc/ref/mod.html
   boost/trunk/libs/preprocessor/doc/ref/mod_d.html
   boost/trunk/libs/preprocessor/doc/ref/mul.html
   boost/trunk/libs/preprocessor/doc/ref/mul_d.html
   boost/trunk/libs/preprocessor/doc/ref/nil.html
   boost/trunk/libs/preprocessor/doc/ref/nor.html
   boost/trunk/libs/preprocessor/doc/ref/not.html
   boost/trunk/libs/preprocessor/doc/ref/not_equal.html
   boost/trunk/libs/preprocessor/doc/ref/not_equal_d.html
   boost/trunk/libs/preprocessor/doc/ref/or.html
   boost/trunk/libs/preprocessor/doc/ref/relative_finish.html
   boost/trunk/libs/preprocessor/doc/ref/relative_flags.html
   boost/trunk/libs/preprocessor/doc/ref/relative_iteration.html
   boost/trunk/libs/preprocessor/doc/ref/relative_start.html
   boost/trunk/libs/preprocessor/doc/ref/repeat.html
   boost/trunk/libs/preprocessor/doc/ref/repeat_1st.html
   boost/trunk/libs/preprocessor/doc/ref/repeat_2nd.html
   boost/trunk/libs/preprocessor/doc/ref/repeat_3rd.html
   boost/trunk/libs/preprocessor/doc/ref/repeat_from_to.html
   boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_1st.html
   boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_2nd.html
   boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_3rd.html
   boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_d.html
   boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_d_z.html
   boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_z.html
   boost/trunk/libs/preprocessor/doc/ref/repeat_z.html
   boost/trunk/libs/preprocessor/doc/ref/rparen.html
   boost/trunk/libs/preprocessor/doc/ref/rparen_if.html
   boost/trunk/libs/preprocessor/doc/ref/seq_cat.html
   boost/trunk/libs/preprocessor/doc/ref/seq_cat_s.html
   boost/trunk/libs/preprocessor/doc/ref/seq_elem.html
   boost/trunk/libs/preprocessor/doc/ref/seq_enum.html
   boost/trunk/libs/preprocessor/doc/ref/seq_filter.html
   boost/trunk/libs/preprocessor/doc/ref/seq_filter_s.html
   boost/trunk/libs/preprocessor/doc/ref/seq_first_n.html
   boost/trunk/libs/preprocessor/doc/ref/seq_fold_left.html
   boost/trunk/libs/preprocessor/doc/ref/seq_fold_left_s.html
   boost/trunk/libs/preprocessor/doc/ref/seq_fold_right.html
   boost/trunk/libs/preprocessor/doc/ref/seq_fold_right_s.html
   boost/trunk/libs/preprocessor/doc/ref/seq_for_each.html
   boost/trunk/libs/preprocessor/doc/ref/seq_for_each_i.html
   boost/trunk/libs/preprocessor/doc/ref/seq_for_each_i_r.html
   boost/trunk/libs/preprocessor/doc/ref/seq_for_each_product.html
   boost/trunk/libs/preprocessor/doc/ref/seq_for_each_product_r.html
   boost/trunk/libs/preprocessor/doc/ref/seq_for_each_r.html
   boost/trunk/libs/preprocessor/doc/ref/seq_head.html
   boost/trunk/libs/preprocessor/doc/ref/seq_insert.html
   boost/trunk/libs/preprocessor/doc/ref/seq_nil.html
   boost/trunk/libs/preprocessor/doc/ref/seq_pop_back.html
   boost/trunk/libs/preprocessor/doc/ref/seq_pop_front.html
   boost/trunk/libs/preprocessor/doc/ref/seq_push_back.html
   boost/trunk/libs/preprocessor/doc/ref/seq_push_front.html
   boost/trunk/libs/preprocessor/doc/ref/seq_remove.html
   boost/trunk/libs/preprocessor/doc/ref/seq_replace.html
   boost/trunk/libs/preprocessor/doc/ref/seq_rest_n.html
   boost/trunk/libs/preprocessor/doc/ref/seq_reverse.html
   boost/trunk/libs/preprocessor/doc/ref/seq_reverse_s.html
   boost/trunk/libs/preprocessor/doc/ref/seq_size.html
   boost/trunk/libs/preprocessor/doc/ref/seq_subseq.html
   boost/trunk/libs/preprocessor/doc/ref/seq_tail.html
   boost/trunk/libs/preprocessor/doc/ref/seq_to_array.html
   boost/trunk/libs/preprocessor/doc/ref/seq_to_tuple.html
   boost/trunk/libs/preprocessor/doc/ref/seq_transform.html
   boost/trunk/libs/preprocessor/doc/ref/seq_transform_s.html
   boost/trunk/libs/preprocessor/doc/ref/slot.html
   boost/trunk/libs/preprocessor/doc/ref/stringize.html
   boost/trunk/libs/preprocessor/doc/ref/sub.html
   boost/trunk/libs/preprocessor/doc/ref/sub_d.html
   boost/trunk/libs/preprocessor/doc/ref/tuple_eat.html
   boost/trunk/libs/preprocessor/doc/ref/tuple_elem.html
   boost/trunk/libs/preprocessor/doc/ref/tuple_rem.html
   boost/trunk/libs/preprocessor/doc/ref/tuple_rem_ctor.html
   boost/trunk/libs/preprocessor/doc/ref/tuple_reverse.html
   boost/trunk/libs/preprocessor/doc/ref/tuple_to_list.html
   boost/trunk/libs/preprocessor/doc/ref/tuple_to_seq.html
   boost/trunk/libs/preprocessor/doc/ref/update_counter.html
   boost/trunk/libs/preprocessor/doc/ref/value.html
   boost/trunk/libs/preprocessor/doc/ref/while.html
   boost/trunk/libs/preprocessor/doc/ref/while_d.html
   boost/trunk/libs/preprocessor/doc/ref/wstringize.html
   boost/trunk/libs/preprocessor/doc/ref/xor.html
   boost/trunk/libs/preprocessor/doc/styles.css
   boost/trunk/libs/preprocessor/doc/syntax.html
   boost/trunk/libs/preprocessor/doc/terms.html
   boost/trunk/libs/preprocessor/doc/terms/evaluated.html
   boost/trunk/libs/preprocessor/doc/terms/named_external.html
   boost/trunk/libs/preprocessor/doc/title.html
   boost/trunk/libs/preprocessor/doc/top.html
   boost/trunk/libs/preprocessor/doc/topics.html
   boost/trunk/libs/preprocessor/doc/topics/evaluated_slots.html
   boost/trunk/libs/preprocessor/doc/topics/file_iteration.html
   boost/trunk/libs/preprocessor/doc/topics/incompatible.html
   boost/trunk/libs/preprocessor/doc/topics/local_iteration.html
   boost/trunk/libs/preprocessor/doc/topics/motivation.html
   boost/trunk/libs/preprocessor/doc/topics/problems.html
   boost/trunk/libs/preprocessor/doc/topics/reentrancy.html
   boost/trunk/libs/preprocessor/doc/topics/techniques.html
   boost/trunk/libs/preprocessor/index.html
   boost/trunk/libs/program_options/doc/index.html
   boost/trunk/libs/program_options/index.html
   boost/trunk/libs/program_options/src/options_description.cpp
   boost/trunk/libs/program_options/src/variables_map.cpp
   boost/trunk/libs/program_options/test/Jamfile.v2
   boost/trunk/libs/property_map/identity_property_map.html
   boost/trunk/libs/property_map/index.html
   boost/trunk/libs/ptr_container/doc/Jamfile.v2
   boost/trunk/libs/ptr_container/doc/associative_ptr_container.html
   boost/trunk/libs/ptr_container/doc/associative_ptr_container.rst
   boost/trunk/libs/ptr_container/doc/comp.sh
   boost/trunk/libs/ptr_container/doc/comp_all.sh
   boost/trunk/libs/ptr_container/doc/comp_assoc_ptr_container.sh
   boost/trunk/libs/ptr_container/doc/comp_conventions.sh
   boost/trunk/libs/ptr_container/doc/comp_examples.sh
   boost/trunk/libs/ptr_container/doc/comp_faq.sh
   boost/trunk/libs/ptr_container/doc/comp_guidelines.sh
   boost/trunk/libs/ptr_container/doc/comp_headers.sh
   boost/trunk/libs/ptr_container/doc/comp_indirect_fun.sh
   boost/trunk/libs/ptr_container/doc/comp_ptr_array.sh
   boost/trunk/libs/ptr_container/doc/comp_ptr_container.sh
   boost/trunk/libs/ptr_container/doc/comp_ptr_deque.sh
   boost/trunk/libs/ptr_container/doc/comp_ptr_list.sh
   boost/trunk/libs/ptr_container/doc/comp_ptr_map.sh
   boost/trunk/libs/ptr_container/doc/comp_ptr_map_adapter.sh
   boost/trunk/libs/ptr_container/doc/comp_ptr_multimap.sh
   boost/trunk/libs/ptr_container/doc/comp_ptr_multimap_adapter.sh
   boost/trunk/libs/ptr_container/doc/comp_ptr_multiset.sh
   boost/trunk/libs/ptr_container/doc/comp_ptr_multiset_adapter.sh
   boost/trunk/libs/ptr_container/doc/comp_ptr_sequence_adapter.sh
   boost/trunk/libs/ptr_container/doc/comp_ptr_set.sh
   boost/trunk/libs/ptr_container/doc/comp_ptr_set_adapter.sh
   boost/trunk/libs/ptr_container/doc/comp_ptr_vector.sh
   boost/trunk/libs/ptr_container/doc/comp_reference.sh
   boost/trunk/libs/ptr_container/doc/comp_rever_ptr_container.sh
   boost/trunk/libs/ptr_container/doc/comp_tutorial.sh
   boost/trunk/libs/ptr_container/doc/conventions.html
   boost/trunk/libs/ptr_container/doc/conventions.rst
   boost/trunk/libs/ptr_container/doc/examples.html
   boost/trunk/libs/ptr_container/doc/examples.rst
   boost/trunk/libs/ptr_container/doc/faq.html
   boost/trunk/libs/ptr_container/doc/faq.rst
   boost/trunk/libs/ptr_container/doc/guidelines.html
   boost/trunk/libs/ptr_container/doc/guidelines.rst
   boost/trunk/libs/ptr_container/doc/headers.html
   boost/trunk/libs/ptr_container/doc/headers.rst
   boost/trunk/libs/ptr_container/doc/indirect_fun.html
   boost/trunk/libs/ptr_container/doc/indirect_fun.rst
   boost/trunk/libs/ptr_container/doc/ptr_array.html
   boost/trunk/libs/ptr_container/doc/ptr_array.rst
   boost/trunk/libs/ptr_container/doc/ptr_container.html
   boost/trunk/libs/ptr_container/doc/ptr_container.rst
   boost/trunk/libs/ptr_container/doc/ptr_deque.html
   boost/trunk/libs/ptr_container/doc/ptr_deque.rst
   boost/trunk/libs/ptr_container/doc/ptr_list.html
   boost/trunk/libs/ptr_container/doc/ptr_list.rst
   boost/trunk/libs/ptr_container/doc/ptr_map.html
   boost/trunk/libs/ptr_container/doc/ptr_map.rst
   boost/trunk/libs/ptr_container/doc/ptr_map_adapter.html
   boost/trunk/libs/ptr_container/doc/ptr_map_adapter.rst
   boost/trunk/libs/ptr_container/doc/ptr_multimap.html
   boost/trunk/libs/ptr_container/doc/ptr_multimap.rst
   boost/trunk/libs/ptr_container/doc/ptr_multimap_adapter.html
   boost/trunk/libs/ptr_container/doc/ptr_multimap_adapter.rst
   boost/trunk/libs/ptr_container/doc/ptr_multiset.html
   boost/trunk/libs/ptr_container/doc/ptr_multiset.rst
   boost/trunk/libs/ptr_container/doc/ptr_multiset_adapter.html
   boost/trunk/libs/ptr_container/doc/ptr_multiset_adapter.rst
   boost/trunk/libs/ptr_container/doc/ptr_sequence_adapter.html
   boost/trunk/libs/ptr_container/doc/ptr_sequence_adapter.rst
   boost/trunk/libs/ptr_container/doc/ptr_set.html
   boost/trunk/libs/ptr_container/doc/ptr_set.rst
   boost/trunk/libs/ptr_container/doc/ptr_set_adapter.html
   boost/trunk/libs/ptr_container/doc/ptr_set_adapter.rst
   boost/trunk/libs/ptr_container/doc/ptr_vector.html
   boost/trunk/libs/ptr_container/doc/ptr_vector.rst
   boost/trunk/libs/ptr_container/doc/reference.html
   boost/trunk/libs/ptr_container/doc/reference.rst
   boost/trunk/libs/ptr_container/doc/reversible_ptr_container.html
   boost/trunk/libs/ptr_container/doc/reversible_ptr_container.rst
   boost/trunk/libs/ptr_container/doc/todo.txt
   boost/trunk/libs/ptr_container/doc/tutorial.html
   boost/trunk/libs/ptr_container/doc/tutorial.rst
   boost/trunk/libs/ptr_container/index.html
   boost/trunk/libs/ptr_container/test/Jamfile.v2
   boost/trunk/libs/ptr_container/test/ptr_map.cpp
   boost/trunk/libs/ptr_container/test/serialization.cpp
   boost/trunk/libs/python/build/Jamfile.v2
   boost/trunk/libs/python/doc/PyConDC_2003/bpl.html
   boost/trunk/libs/python/doc/PyConDC_2003/bpl.txt
   boost/trunk/libs/python/doc/PyConDC_2003/bpl_mods.txt
   boost/trunk/libs/python/doc/PyConDC_2003/default.css
   boost/trunk/libs/python/doc/boost.css
   boost/trunk/libs/python/doc/building.html
   boost/trunk/libs/python/doc/index.html
   boost/trunk/libs/python/doc/news.html
   boost/trunk/libs/python/doc/polymorphism.txt
   boost/trunk/libs/python/doc/projects.html
   boost/trunk/libs/python/doc/support.html
   boost/trunk/libs/python/doc/tutorial/doc/Jamfile.v2
   boost/trunk/libs/python/doc/tutorial/doc/html/boostbook.css
   boost/trunk/libs/python/doc/tutorial/doc/html/index.html
   boost/trunk/libs/python/doc/tutorial/doc/html/python/embedding.html
   boost/trunk/libs/python/doc/tutorial/doc/html/python/exception.html
   boost/trunk/libs/python/doc/tutorial/doc/html/python/exposing.html
   boost/trunk/libs/python/doc/tutorial/doc/html/python/functions.html
   boost/trunk/libs/python/doc/tutorial/doc/html/python/hello.html
   boost/trunk/libs/python/doc/tutorial/doc/html/python/iterators.html
   boost/trunk/libs/python/doc/tutorial/doc/html/python/object.html
   boost/trunk/libs/python/doc/tutorial/doc/html/python/techniques.html
   boost/trunk/libs/python/doc/tutorial/doc/tutorial.qbk
   boost/trunk/libs/python/doc/tutorial/index.html
   boost/trunk/libs/python/doc/v2/Apr2002.html
   boost/trunk/libs/python/doc/v2/CallPolicies.html
   boost/trunk/libs/python/doc/v2/Dereferenceable.html
   boost/trunk/libs/python/doc/v2/Extractor.html
   boost/trunk/libs/python/doc/v2/HolderGenerator.html
   boost/trunk/libs/python/doc/v2/Jun2002.html
   boost/trunk/libs/python/doc/v2/Mar2002.html
   boost/trunk/libs/python/doc/v2/May2002.html
   boost/trunk/libs/python/doc/v2/ObjectWrapper.html
   boost/trunk/libs/python/doc/v2/ResultConverter.html
   boost/trunk/libs/python/doc/v2/acknowledgments.html
   boost/trunk/libs/python/doc/v2/args.html
   boost/trunk/libs/python/doc/v2/call.html
   boost/trunk/libs/python/doc/v2/call_method.html
   boost/trunk/libs/python/doc/v2/callbacks.html
   boost/trunk/libs/python/doc/v2/callbacks.txt
   boost/trunk/libs/python/doc/v2/class.html
   boost/trunk/libs/python/doc/v2/configuration.html
   boost/trunk/libs/python/doc/v2/copy_const_reference.html
   boost/trunk/libs/python/doc/v2/copy_non_const_reference.html
   boost/trunk/libs/python/doc/v2/data_members.html
   boost/trunk/libs/python/doc/v2/def.html
   boost/trunk/libs/python/doc/v2/def_visitor.html
   boost/trunk/libs/python/doc/v2/default_call_policies.html
   boost/trunk/libs/python/doc/v2/definitions.html
   boost/trunk/libs/python/doc/v2/dict.html
   boost/trunk/libs/python/doc/v2/docstring_options.html
   boost/trunk/libs/python/doc/v2/enum.html
   boost/trunk/libs/python/doc/v2/errors.html
   boost/trunk/libs/python/doc/v2/exception_translator.html
   boost/trunk/libs/python/doc/v2/exec.html
   boost/trunk/libs/python/doc/v2/extract.html
   boost/trunk/libs/python/doc/v2/faq.html
   boost/trunk/libs/python/doc/v2/feb2002.html
   boost/trunk/libs/python/doc/v2/handle.html
   boost/trunk/libs/python/doc/v2/has_back_reference.html
   boost/trunk/libs/python/doc/v2/implicit.html
   boost/trunk/libs/python/doc/v2/import.html
   boost/trunk/libs/python/doc/v2/index.html
   boost/trunk/libs/python/doc/v2/indexing.html
   boost/trunk/libs/python/doc/v2/init.html
   boost/trunk/libs/python/doc/v2/instance_holder.html
   boost/trunk/libs/python/doc/v2/iterator.html
   boost/trunk/libs/python/doc/v2/list.html
   boost/trunk/libs/python/doc/v2/long.html
   boost/trunk/libs/python/doc/v2/lvalue_from_pytype.html
   boost/trunk/libs/python/doc/v2/make_function.html
   boost/trunk/libs/python/doc/v2/manage_new_object.html
   boost/trunk/libs/python/doc/v2/module.html
   boost/trunk/libs/python/doc/v2/numeric.html
   boost/trunk/libs/python/doc/v2/object.html
   boost/trunk/libs/python/doc/v2/operators.html
   boost/trunk/libs/python/doc/v2/overloads.html
   boost/trunk/libs/python/doc/v2/pickle.html
   boost/trunk/libs/python/doc/v2/platforms.html
   boost/trunk/libs/python/doc/v2/pointee.html
   boost/trunk/libs/python/doc/v2/progress_reports.html
   boost/trunk/libs/python/doc/v2/ptr.html
   boost/trunk/libs/python/doc/v2/python.html
   boost/trunk/libs/python/doc/v2/raw_function.html
   boost/trunk/libs/python/doc/v2/reference.html
   boost/trunk/libs/python/doc/v2/reference_existing_object.html
   boost/trunk/libs/python/doc/v2/register_ptr_to_python.html
   boost/trunk/libs/python/doc/v2/return_arg.html
   boost/trunk/libs/python/doc/v2/return_by_value.html
   boost/trunk/libs/python/doc/v2/return_internal_reference.html
   boost/trunk/libs/python/doc/v2/return_opaque_pointer.html
   boost/trunk/libs/python/doc/v2/return_value_policy.html
   boost/trunk/libs/python/doc/v2/scope.html
   boost/trunk/libs/python/doc/v2/slice.html
   boost/trunk/libs/python/doc/v2/stl_iterator.html
   boost/trunk/libs/python/doc/v2/str.html
   boost/trunk/libs/python/doc/v2/to_python_converter.html
   boost/trunk/libs/python/doc/v2/to_python_indirect.html
   boost/trunk/libs/python/doc/v2/to_python_value.html
   boost/trunk/libs/python/doc/v2/tuple.html
   boost/trunk/libs/python/doc/v2/type_id.html
   boost/trunk/libs/python/doc/v2/with_custodian_and_ward.html
   boost/trunk/libs/python/doc/v2/wrapper.html
   boost/trunk/libs/python/example/Jamfile.v2
   boost/trunk/libs/python/example/README
   boost/trunk/libs/python/example/boost-build.jam
   boost/trunk/libs/python/example/test_getting_started1.py
   boost/trunk/libs/python/example/test_getting_started2.py
   boost/trunk/libs/python/example/test_std_pair.py
   boost/trunk/libs/python/index.html
   boost/trunk/libs/python/pyste/NEWS
   boost/trunk/libs/python/pyste/README
   boost/trunk/libs/python/pyste/TODO
   boost/trunk/libs/python/pyste/dist/create_build.py
   boost/trunk/libs/python/pyste/dist/setup.py
   boost/trunk/libs/python/pyste/doc/adding_new_methods.html
   boost/trunk/libs/python/pyste/doc/exporting_an_entire_header.html
   boost/trunk/libs/python/pyste/doc/global_variables.html
   boost/trunk/libs/python/pyste/doc/inserting_code.html
   boost/trunk/libs/python/pyste/doc/introduction.html
   boost/trunk/libs/python/pyste/doc/policies.html
   boost/trunk/libs/python/pyste/doc/pyste.txt
   boost/trunk/libs/python/pyste/doc/renaming_and_excluding.html
   boost/trunk/libs/python/pyste/doc/running_pyste.html
   boost/trunk/libs/python/pyste/doc/smart_pointers.html
   boost/trunk/libs/python/pyste/doc/templates.html
   boost/trunk/libs/python/pyste/doc/the_interface_files.html
   boost/trunk/libs/python/pyste/doc/theme/style.css
   boost/trunk/libs/python/pyste/doc/wrappers.html
   boost/trunk/libs/python/pyste/index.html
   boost/trunk/libs/python/pyste/install/pyste.py
   boost/trunk/libs/python/pyste/install/setup.py
   boost/trunk/libs/python/release_notes.txt
   boost/trunk/libs/python/src/converter/builtin_converters.cpp
   boost/trunk/libs/python/src/converter/type_id.cpp
   boost/trunk/libs/python/src/exec.cpp
   boost/trunk/libs/python/src/import.cpp
   boost/trunk/libs/python/src/list.cpp
   boost/trunk/libs/python/src/numeric.cpp
   boost/trunk/libs/python/src/object/class.cpp
   boost/trunk/libs/python/src/object/function.cpp
   boost/trunk/libs/python/src/object/pickle_support.cpp
   boost/trunk/libs/python/src/object_operators.cpp
   boost/trunk/libs/python/src/object_protocol.cpp
   boost/trunk/libs/python/src/str.cpp
   boost/trunk/libs/python/test/Jamfile.v2
   boost/trunk/libs/python/test/andreas_beyer.cpp
   boost/trunk/libs/python/test/args.cpp
   boost/trunk/libs/python/test/args.py
   boost/trunk/libs/python/test/crossmod_exception.py
   boost/trunk/libs/python/test/defaults.cpp
   boost/trunk/libs/python/test/exec.cpp
   boost/trunk/libs/python/test/exec.py
   boost/trunk/libs/python/test/keywords.cpp
   boost/trunk/libs/python/test/keywords_test.py
   boost/trunk/libs/python/test/module_tail.cpp
   boost/trunk/libs/python/test/numpy.cpp
   boost/trunk/libs/python/test/numpy.py
   boost/trunk/libs/python/test/opaque.py
   boost/trunk/libs/python/test/pickle1.cpp
   boost/trunk/libs/python/test/pickle1.py
   boost/trunk/libs/python/test/pickle3.cpp
   boost/trunk/libs/python/test/pointer_vector.cpp
   boost/trunk/libs/python/test/slice.cpp
   boost/trunk/libs/python/test/slice.py
   boost/trunk/libs/python/test/voidptr.cpp
   boost/trunk/libs/random/index.html
   boost/trunk/libs/random/nondet_random.html
   boost/trunk/libs/random/random-concepts.html
   boost/trunk/libs/random/random-distributions.html
   boost/trunk/libs/random/random-generators.html
   boost/trunk/libs/random/random-misc.html
   boost/trunk/libs/random/random-performance.html
   boost/trunk/libs/random/random-variate.html
   boost/trunk/libs/random/test/Jamfile.v2
   boost/trunk/libs/random/wg21-proposal.html
   boost/trunk/libs/range/doc/boost_range.html
   boost/trunk/libs/range/doc/example.cpp
   boost/trunk/libs/range/doc/examples.html
   boost/trunk/libs/range/doc/faq.html
   boost/trunk/libs/range/doc/headers.html
   boost/trunk/libs/range/doc/history_ack.html
   boost/trunk/libs/range/doc/intro.html
   boost/trunk/libs/range/doc/portability.html
   boost/trunk/libs/range/doc/range.html
   boost/trunk/libs/range/doc/style.css
   boost/trunk/libs/range/doc/style.html
   boost/trunk/libs/range/doc/utility_class.html
   boost/trunk/libs/range/test/Jamfile.v2
   boost/trunk/libs/range/test/algorithm_example.cpp
   boost/trunk/libs/range/test/array.cpp
   boost/trunk/libs/range/test/extension_mechanism.cpp
   boost/trunk/libs/range/test/iterator_pair.cpp
   boost/trunk/libs/range/test/iterator_range.cpp
   boost/trunk/libs/range/test/partial_workaround.cpp
   boost/trunk/libs/range/test/reversible_range.cpp
   boost/trunk/libs/range/test/std_container.cpp
   boost/trunk/libs/range/test/string.cpp
   boost/trunk/libs/range/test/sub_range.cpp
   boost/trunk/libs/rational/rational_test.cpp
   boost/trunk/libs/regex/build/Jamfile.v2
   boost/trunk/libs/regex/build/bc_gen.sh
   boost/trunk/libs/regex/build/bcb6.mak
   boost/trunk/libs/regex/build/common.sh
   boost/trunk/libs/regex/build/gcc.mak
   boost/trunk/libs/regex/build/gcc_gen.sh
   boost/trunk/libs/regex/build/generic.mak
   boost/trunk/libs/regex/build/generic_gen.sh
   boost/trunk/libs/regex/build/sun_gen.sh
   boost/trunk/libs/regex/build/sunpro.mak
   boost/trunk/libs/regex/build/vc6-stlport.mak
   boost/trunk/libs/regex/build/vc6.mak
   boost/trunk/libs/regex/build/vc7-stlport.mak
   boost/trunk/libs/regex/build/vc7.mak
   boost/trunk/libs/regex/build/vc71-stlport.mak
   boost/trunk/libs/regex/build/vc71.mak
   boost/trunk/libs/regex/build/vc8.mak
   boost/trunk/libs/regex/build/vc_gen.sh
   boost/trunk/libs/regex/doc/error_type.html
   boost/trunk/libs/regex/doc/gcc-performance.html
   boost/trunk/libs/regex/doc/history.html
   boost/trunk/libs/regex/doc/index.html
   boost/trunk/libs/regex/doc/install.html
   boost/trunk/libs/regex/doc/introduction.html
   boost/trunk/libs/regex/doc/match_results.html
   boost/trunk/libs/regex/doc/regex_replace.html
   boost/trunk/libs/regex/doc/syntax_leftmost_longest.html
   boost/trunk/libs/regex/doc/vc71-performance.html
   boost/trunk/libs/regex/example/Jamfile.v2
   boost/trunk/libs/regex/example/timer/bc55.mak
   boost/trunk/libs/regex/example/timer/bcb4.mak
   boost/trunk/libs/regex/example/timer/bcb5.mak
   boost/trunk/libs/regex/example/timer/gcc.mak
   boost/trunk/libs/regex/example/timer/vc6-stlport.mak
   boost/trunk/libs/regex/example/timer/vc6.mak
   boost/trunk/libs/regex/index.html
   boost/trunk/libs/regex/performance/main.cpp
   boost/trunk/libs/regex/src/usinstances.cpp
   boost/trunk/libs/regex/test/Jamfile.v2
   boost/trunk/libs/regex/test/captures/Jamfile.v2
   boost/trunk/libs/regex/test/object_cache/object_cache_test.cpp
   boost/trunk/libs/regex/test/pathology/bad_expression_test.cpp
   boost/trunk/libs/regex/test/profile/Makefile
   boost/trunk/libs/regex/test/regress/bcb6.mak
   boost/trunk/libs/regex/test/regress/gcc.mak
   boost/trunk/libs/regex/test/regress/info.hpp
   boost/trunk/libs/regex/test/regress/main.cpp
   boost/trunk/libs/regex/test/regress/sunpro.mak
   boost/trunk/libs/regex/test/regress/test.hpp
   boost/trunk/libs/regex/test/regress/test_alt.cpp
   boost/trunk/libs/regex/test/regress/test_non_greedy_repeats.cpp
   boost/trunk/libs/regex/test/regress/test_regex_search.hpp
   boost/trunk/libs/regex/test/regress/test_tricky_cases.cpp
   boost/trunk/libs/regex/test/regress/vc6-stlport.mak
   boost/trunk/libs/regex/test/regress/vc6.mak
   boost/trunk/libs/regex/test/regress/vc7.mak
   boost/trunk/libs/regex/test/regress/vc71.mak
   boost/trunk/libs/regex/test/regress/vc8.mak
   boost/trunk/libs/serialization/build/Jamfile.v2
   boost/trunk/libs/serialization/doc/acknowledgments.html
   boost/trunk/libs/serialization/doc/archive_reference.html
   boost/trunk/libs/serialization/doc/archives.html
   boost/trunk/libs/serialization/doc/bibliography.html
   boost/trunk/libs/serialization/doc/class_diagram.html
   boost/trunk/libs/serialization/doc/codecvt.html
   boost/trunk/libs/serialization/doc/configuration.html
   boost/trunk/libs/serialization/doc/contents.html
   boost/trunk/libs/serialization/doc/dataflow.html
   boost/trunk/libs/serialization/doc/definitions.html
   boost/trunk/libs/serialization/doc/derivation.html
   boost/trunk/libs/serialization/doc/exception_safety.html
   boost/trunk/libs/serialization/doc/exceptions.html
   boost/trunk/libs/serialization/doc/extended_type_info.html
   boost/trunk/libs/serialization/doc/faq.html
   boost/trunk/libs/serialization/doc/headers.html
   boost/trunk/libs/serialization/doc/history.html
   boost/trunk/libs/serialization/doc/implementation.html
   boost/trunk/libs/serialization/doc/index.html
   boost/trunk/libs/serialization/doc/overview.html
   boost/trunk/libs/serialization/doc/pimpl.html
   boost/trunk/libs/serialization/doc/rationale.html
   boost/trunk/libs/serialization/doc/reference.html
   boost/trunk/libs/serialization/doc/release.html
   boost/trunk/libs/serialization/doc/serialization.html
   boost/trunk/libs/serialization/doc/shared_ptr.html
   boost/trunk/libs/serialization/doc/shared_ptr2.html
   boost/trunk/libs/serialization/doc/smart_cast.html
   boost/trunk/libs/serialization/doc/special.html
   boost/trunk/libs/serialization/doc/state_saver.html
   boost/trunk/libs/serialization/doc/static_warning.html
   boost/trunk/libs/serialization/doc/strong_typedef.html
   boost/trunk/libs/serialization/doc/traits.html
   boost/trunk/libs/serialization/doc/tutorial.html
   boost/trunk/libs/serialization/doc/void_cast.html
   boost/trunk/libs/serialization/doc/wrappers.html
   boost/trunk/libs/serialization/test/Jamfile.v2
   boost/trunk/libs/serialization/test/test_exported.cpp
   boost/trunk/libs/serialization/test/test_tools.hpp
   boost/trunk/libs/serialization/vc7ide/BoostSerializationLibrary.sln
   boost/trunk/libs/serialization/vc7ide/Library.vcproj
   boost/trunk/libs/serialization/vc7ide/test_inclusion.vcproj
   boost/trunk/libs/serialization/vc7ide/test_set.vcproj
   boost/trunk/libs/signals/doc/Jamfile.v2
   boost/trunk/libs/signals/doc/design.xml
   boost/trunk/libs/signals/doc/faq.xml
   boost/trunk/libs/signals/doc/index.html
   boost/trunk/libs/signals/doc/introduction.xml
   boost/trunk/libs/signals/doc/rationale.xml
   boost/trunk/libs/signals/doc/reference/connection.xml
   boost/trunk/libs/signals/doc/reference/last_value.xml
   boost/trunk/libs/signals/doc/reference/reference.xml
   boost/trunk/libs/signals/doc/reference/signal_header.xml
   boost/trunk/libs/signals/doc/reference/slot.xml
   boost/trunk/libs/signals/doc/reference/trackable.xml
   boost/trunk/libs/signals/doc/reference/visit_each.xml
   boost/trunk/libs/signals/doc/tests.xml
   boost/trunk/libs/signals/doc/tutorial.xml
   boost/trunk/libs/signals/index.html
   boost/trunk/libs/signals/src/named_slot_map.cpp
   boost/trunk/libs/signals/test/Jamfile.v2
   boost/trunk/libs/signals/test/deletion_test.cpp
   boost/trunk/libs/smart_ptr/enable_shared_from_this.html
   boost/trunk/libs/smart_ptr/index.html
   boost/trunk/libs/smart_ptr/intrusive_ptr.html
   boost/trunk/libs/smart_ptr/sp_techniques.html
   boost/trunk/libs/smart_ptr/test/Jamfile.v2
   boost/trunk/libs/spirit/change_log.html
   boost/trunk/libs/spirit/example/intermediate/simple_xml/actions.hpp
   boost/trunk/libs/spirit/example/intermediate/simple_xml/driver.cpp
   boost/trunk/libs/spirit/example/intermediate/simple_xml/tag.cpp
   boost/trunk/libs/spirit/example/intermediate/simple_xml/xml_g.hpp
   boost/trunk/libs/spirit/example/techniques/no_rules_with_typeof/rule_parser_2_1.cpp
   boost/trunk/libs/spirit/example/techniques/no_rules_with_typeof/rule_parser_2_2.cpp
   boost/trunk/libs/spirit/fusion/test/pair_tests.cpp
   boost/trunk/libs/spirit/test/actor/assign_key_test.cpp
   boost/trunk/libs/spirit/test/actor/assign_test.cpp
   boost/trunk/libs/spirit/test/actor/clear_test.cpp
   boost/trunk/libs/spirit/test/actor/decrement_test.cpp
   boost/trunk/libs/spirit/test/actor/erase_at_test.cpp
   boost/trunk/libs/spirit/test/actor/increment_test.cpp
   boost/trunk/libs/spirit/test/actor/insert_key_test.cpp
   boost/trunk/libs/spirit/test/actor/push_back_test.cpp
   boost/trunk/libs/spirit/test/actor/push_front_test.cpp
   boost/trunk/libs/spirit/test/actor/swap_test.cpp
   boost/trunk/libs/spirit/test/directives_tests.cpp
   boost/trunk/libs/spirit/test/epsilon_tests.cpp
   boost/trunk/libs/spirit/test/for_tests.cpp
   boost/trunk/libs/spirit/test/if_tests.cpp
   boost/trunk/libs/spirit/test/impl/string_length.hpp
   boost/trunk/libs/spirit/test/mix_and_match_trees.cpp
   boost/trunk/libs/spirit/test/primitives_tests.cpp
   boost/trunk/libs/spirit/test/scanner_tests.cpp
   boost/trunk/libs/spirit/test/scanner_value_type_tests.cpp
   boost/trunk/libs/spirit/test/tree_tests.cpp
   boost/trunk/libs/spirit/test/while_tests.cpp
   boost/trunk/libs/statechart/Jamfile.v2
   boost/trunk/libs/statechart/Statechart.sln
   boost/trunk/libs/statechart/doc/acknowledgments.html
   boost/trunk/libs/statechart/doc/configuration.html
   boost/trunk/libs/statechart/doc/definitions.html
   boost/trunk/libs/statechart/doc/faq.html
   boost/trunk/libs/statechart/doc/future_and_history.html
   boost/trunk/libs/statechart/doc/index.html
   boost/trunk/libs/statechart/doc/performance.html
   boost/trunk/libs/statechart/doc/rationale.html
   boost/trunk/libs/statechart/doc/reference.html
   boost/trunk/libs/statechart/doc/tutorial.html
   boost/trunk/libs/statechart/doc/uml_mapping.html
   boost/trunk/libs/statechart/example/BitMachine/BitMachine.cpp
   boost/trunk/libs/statechart/example/BitMachine/UniqueObject.hpp
   boost/trunk/libs/statechart/example/BitMachine/UniqueObjectAllocator.hpp
   boost/trunk/libs/statechart/example/Camera/Camera.cpp
   boost/trunk/libs/statechart/example/Camera/Camera.hpp
   boost/trunk/libs/statechart/example/Camera/Configuring.cpp
   boost/trunk/libs/statechart/example/Camera/Configuring.hpp
   boost/trunk/libs/statechart/example/Camera/Main.cpp
   boost/trunk/libs/statechart/example/Camera/Precompiled.cpp
   boost/trunk/libs/statechart/example/Camera/Precompiled.hpp
   boost/trunk/libs/statechart/example/Camera/Shooting.cpp
   boost/trunk/libs/statechart/example/Camera/Shooting.hpp
   boost/trunk/libs/statechart/example/Handcrafted/Handcrafted.cpp
   boost/trunk/libs/statechart/example/Jamfile.v2
   boost/trunk/libs/statechart/example/Keyboard/Keyboard.cpp
   boost/trunk/libs/statechart/example/Performance/Performance.cpp
   boost/trunk/libs/statechart/example/PingPong/PingPong.cpp
   boost/trunk/libs/statechart/example/StopWatch/StopWatch.cpp
   boost/trunk/libs/statechart/example/StopWatch/StopWatch2.cpp
   boost/trunk/libs/statechart/index.html
   boost/trunk/libs/statechart/test/CustomReactionTest.cpp
   boost/trunk/libs/statechart/test/DeferralTest.cpp
   boost/trunk/libs/statechart/test/FifoSchedulerTest.cpp
   boost/trunk/libs/statechart/test/HistoryTest.cpp
   boost/trunk/libs/statechart/test/InStateReactionTest.cpp
   boost/trunk/libs/statechart/test/InconsistentHistoryTest1.cpp
   boost/trunk/libs/statechart/test/InconsistentHistoryTest2.cpp
   boost/trunk/libs/statechart/test/InconsistentHistoryTest3.cpp
   boost/trunk/libs/statechart/test/InconsistentHistoryTest4.cpp
   boost/trunk/libs/statechart/test/InconsistentHistoryTest5.cpp
   boost/trunk/libs/statechart/test/InconsistentHistoryTest6.cpp
   boost/trunk/libs/statechart/test/InconsistentHistoryTest7.cpp
   boost/trunk/libs/statechart/test/InconsistentHistoryTest8.cpp
   boost/trunk/libs/statechart/test/InnermostDefault.hpp
   boost/trunk/libs/statechart/test/InvalidChartTest1.cpp
   boost/trunk/libs/statechart/test/InvalidChartTest2.cpp
   boost/trunk/libs/statechart/test/InvalidChartTest3.cpp
   boost/trunk/libs/statechart/test/InvalidResultAssignTest.cpp
   boost/trunk/libs/statechart/test/InvalidResultCopyTest.cpp
   boost/trunk/libs/statechart/test/InvalidResultDefCtorTest.cpp
   boost/trunk/libs/statechart/test/InvalidTransitionTest1.cpp
   boost/trunk/libs/statechart/test/InvalidTransitionTest2.cpp
   boost/trunk/libs/statechart/test/Jamfile.v2
   boost/trunk/libs/statechart/test/OuterOrthogonal.hpp
   boost/trunk/libs/statechart/test/StateCastTest.cpp
   boost/trunk/libs/statechart/test/StateIterationTest.cpp
   boost/trunk/libs/statechart/test/TerminationTest.cpp
   boost/trunk/libs/statechart/test/ThrowingBoostAssert.hpp
   boost/trunk/libs/statechart/test/TransitionTest.cpp
   boost/trunk/libs/statechart/test/TuTest.cpp
   boost/trunk/libs/statechart/test/TuTest.hpp
   boost/trunk/libs/statechart/test/TuTestMain.cpp
   boost/trunk/libs/statechart/test/TypeInfoTest.cpp
   boost/trunk/libs/statechart/test/UnconsumedResultTest.cpp
   boost/trunk/libs/static_assert/Jamfile.v2
   boost/trunk/libs/static_assert/doc/static_assert.qbk
   boost/trunk/libs/static_assert/index.html
   boost/trunk/libs/static_assert/static_assert.htm
   boost/trunk/libs/static_assert/static_assert_example_1.cpp
   boost/trunk/libs/static_assert/static_assert_example_3.cpp
   boost/trunk/libs/test/build/Jamfile.v2
   boost/trunk/libs/test/test/Jamfile.v2
   boost/trunk/libs/thread/build/Jamfile.v2
   boost/trunk/libs/thread/doc/Jamfile.v2
   boost/trunk/libs/thread/doc/acknowledgements.xml
   boost/trunk/libs/thread/doc/barrier-ref.xml
   boost/trunk/libs/thread/doc/bibliography.xml
   boost/trunk/libs/thread/doc/build.xml
   boost/trunk/libs/thread/doc/concepts.xml
   boost/trunk/libs/thread/doc/condition-ref.xml
   boost/trunk/libs/thread/doc/configuration.xml
   boost/trunk/libs/thread/doc/design.xml
   boost/trunk/libs/thread/doc/entities.xml
   boost/trunk/libs/thread/doc/exceptions-ref.xml
   boost/trunk/libs/thread/doc/faq.xml
   boost/trunk/libs/thread/doc/glossary.xml
   boost/trunk/libs/thread/doc/implementation_notes.xml
   boost/trunk/libs/thread/doc/index.html
   boost/trunk/libs/thread/doc/mutex-ref.xml
   boost/trunk/libs/thread/doc/once-ref.xml
   boost/trunk/libs/thread/doc/overview.xml
   boost/trunk/libs/thread/doc/rationale.xml
   boost/trunk/libs/thread/doc/read_write_mutex-ref.xml
   boost/trunk/libs/thread/doc/recursive_mutex-ref.xml
   boost/trunk/libs/thread/doc/reference.xml
   boost/trunk/libs/thread/doc/release_notes.xml
   boost/trunk/libs/thread/doc/thread-ref.xml
   boost/trunk/libs/thread/doc/thread.xml
   boost/trunk/libs/thread/doc/tss-ref.xml
   boost/trunk/libs/thread/doc/xtime-ref.xml
   boost/trunk/libs/thread/example/Jamfile.v2
   boost/trunk/libs/thread/example/condition.cpp
   boost/trunk/libs/thread/example/monitor.cpp
   boost/trunk/libs/thread/example/mutex.cpp
   boost/trunk/libs/thread/example/once.cpp
   boost/trunk/libs/thread/example/recursive_mutex.cpp
   boost/trunk/libs/thread/example/starvephil.cpp
   boost/trunk/libs/thread/example/tennis.cpp
   boost/trunk/libs/thread/example/thread.cpp
   boost/trunk/libs/thread/example/thread_group.cpp
   boost/trunk/libs/thread/example/tss.cpp
   boost/trunk/libs/thread/example/xtime.cpp
   boost/trunk/libs/thread/index.html
   boost/trunk/libs/thread/src/barrier.cpp
   boost/trunk/libs/thread/src/condition.cpp
   boost/trunk/libs/thread/src/exceptions.cpp
   boost/trunk/libs/thread/src/mutex.cpp
   boost/trunk/libs/thread/src/mutex.inl
   boost/trunk/libs/thread/src/once.cpp
   boost/trunk/libs/thread/src/read_write_mutex.cpp
   boost/trunk/libs/thread/src/recursive_mutex.cpp
   boost/trunk/libs/thread/src/thread.cpp
   boost/trunk/libs/thread/src/timeconv.inl
   boost/trunk/libs/thread/src/tss.cpp
   boost/trunk/libs/thread/src/tss_dll.cpp
   boost/trunk/libs/thread/src/tss_hooks.cpp
   boost/trunk/libs/thread/src/tss_pe.cpp
   boost/trunk/libs/thread/src/xtime.cpp
   boost/trunk/libs/thread/test/Jamfile.v2
   boost/trunk/libs/thread/test/test_barrier.cpp
   boost/trunk/libs/thread/test/test_condition.cpp
   boost/trunk/libs/thread/test/test_mutex.cpp
   boost/trunk/libs/thread/test/test_once.cpp
   boost/trunk/libs/thread/test/test_read_write_mutex.cpp
   boost/trunk/libs/thread/test/test_thread.cpp
   boost/trunk/libs/thread/test/test_tss.cpp
   boost/trunk/libs/thread/test/test_xtime.cpp
   boost/trunk/libs/thread/test/util.inl
   boost/trunk/libs/thread/tutorial/bounded_buffer.cpp
   boost/trunk/libs/thread/tutorial/counter.cpp
   boost/trunk/libs/thread/tutorial/factorial.cpp
   boost/trunk/libs/thread/tutorial/factorial2.cpp
   boost/trunk/libs/thread/tutorial/factorial3.cpp
   boost/trunk/libs/thread/tutorial/helloworld.cpp
   boost/trunk/libs/thread/tutorial/helloworld2.cpp
   boost/trunk/libs/thread/tutorial/helloworld3.cpp
   boost/trunk/libs/thread/tutorial/helloworld4.cpp
   boost/trunk/libs/thread/tutorial/once.cpp
   boost/trunk/libs/thread/tutorial/tss.cpp
   boost/trunk/libs/timer/index.html
   boost/trunk/libs/tokenizer/char_delimiters_separator.htm
   boost/trunk/libs/tokenizer/char_separator.htm
   boost/trunk/libs/tokenizer/escaped_list_separator.htm
   boost/trunk/libs/tokenizer/index.html
   boost/trunk/libs/tokenizer/introduc.htm
   boost/trunk/libs/tokenizer/offset_separator.htm
   boost/trunk/libs/tokenizer/token_iterator.htm
   boost/trunk/libs/tokenizer/tokenizer.htm
   boost/trunk/libs/tokenizer/tokenizerfunction.htm
   boost/trunk/libs/tr1/doc/tr1.qbk
   boost/trunk/libs/tr1/index.html
   boost/trunk/libs/tr1/test/Jamfile.v2
   boost/trunk/libs/tr1/test/test_array_tricky.cpp
   boost/trunk/libs/tr1/test/test_random.cpp
   boost/trunk/libs/tr1/test/verify_return.hpp
   boost/trunk/libs/tuple/doc/tuple_advanced_interface.html
   boost/trunk/libs/tuple/index.html
   boost/trunk/libs/type_traits/cxx_type_traits.htm
   boost/trunk/libs/type_traits/doc/type_traits.qbk
   boost/trunk/libs/type_traits/index.html
   boost/trunk/libs/type_traits/test/Jamfile.v2
   boost/trunk/libs/typeof/doc/typeof.qbk
   boost/trunk/libs/typeof/index.html
   boost/trunk/libs/typeof/test/Jamfile.v2
   boost/trunk/libs/typeof/test/data_member.cpp
   boost/trunk/libs/typeof/test/function.cpp
   boost/trunk/libs/typeof/test/function_ptr.cpp
   boost/trunk/libs/typeof/test/function_ptr_from_tpl.cpp
   boost/trunk/libs/typeof/test/function_ref.cpp
   boost/trunk/libs/typeof/test/member_function.cpp
   boost/trunk/libs/typeof/test/modifiers.cpp
   boost/trunk/libs/typeof/test/nested_typedef.cpp
   boost/trunk/libs/typeof/test/noncopyable.cpp
   boost/trunk/libs/typeof/test/odr.hpp
   boost/trunk/libs/typeof/test/odr1.cpp
   boost/trunk/libs/typeof/test/odr2.cpp
   boost/trunk/libs/typeof/test/std.cpp
   boost/trunk/libs/typeof/test/template_dependent.cpp
   boost/trunk/libs/typeof/test/template_enum.cpp
   boost/trunk/libs/typeof/test/template_int.cpp
   boost/trunk/libs/typeof/test/template_multiword.cpp
   boost/trunk/libs/typeof/test/template_tpl.cpp
   boost/trunk/libs/typeof/test/template_type.cpp
   boost/trunk/libs/typeof/test/type.cpp
   boost/trunk/libs/utility/Assignable.html
   boost/trunk/libs/utility/Collection.html
   boost/trunk/libs/utility/CopyConstructible.html
   boost/trunk/libs/utility/LessThanComparable.html
   boost/trunk/libs/utility/MultiPassInputIterator.html
   boost/trunk/libs/utility/assert.html
   boost/trunk/libs/utility/call_traits.htm
   boost/trunk/libs/utility/checked_delete.html
   boost/trunk/libs/utility/current_function.html
   boost/trunk/libs/utility/generator_iterator.htm
   boost/trunk/libs/utility/index.html
   boost/trunk/libs/utility/test/Jamfile.v2
   boost/trunk/libs/utility/throw_exception.html
   boost/trunk/libs/utility/utility.htm
   boost/trunk/libs/variant/doc/reference/get.xml
   boost/trunk/libs/wave/ChangeLog
   boost/trunk/libs/wave/build/Jamfile.v2
   boost/trunk/libs/wave/doc/acknowledgements.html
   boost/trunk/libs/wave/doc/class_reference_context.html
   boost/trunk/libs/wave/doc/class_reference_ctxpolicy.html
   boost/trunk/libs/wave/doc/class_reference_filepos.html
   boost/trunk/libs/wave/doc/class_reference_inptpolcy.html
   boost/trunk/libs/wave/doc/class_reference_lexer.html
   boost/trunk/libs/wave/doc/class_reference_tokentype.html
   boost/trunk/libs/wave/doc/compiletime_config.html
   boost/trunk/libs/wave/doc/introduction.html
   boost/trunk/libs/wave/doc/macro_expansion_process.html
   boost/trunk/libs/wave/doc/predefined_macros.html
   boost/trunk/libs/wave/doc/preface.html
   boost/trunk/libs/wave/doc/quickstart.html
   boost/trunk/libs/wave/doc/references.html
   boost/trunk/libs/wave/doc/samples.html
   boost/trunk/libs/wave/doc/supported_pragmas.html
   boost/trunk/libs/wave/doc/token_ids.html
   boost/trunk/libs/wave/doc/tracing_facility.html
   boost/trunk/libs/wave/doc/wave_driver.html
   boost/trunk/libs/wave/index.html
   boost/trunk/libs/wave/samples/advanced_hooks/advanced_hooks.cpp
   boost/trunk/libs/wave/samples/advanced_hooks/build/Jamfile.v2
   boost/trunk/libs/wave/samples/cpp_tokens/build/Jamfile.v2
   boost/trunk/libs/wave/samples/cpp_tokens/cpp_tokens.cpp
   boost/trunk/libs/wave/samples/cpp_tokens/cpp_tokens.hpp
   boost/trunk/libs/wave/samples/cpp_tokens/cpp_tokens_config.hpp
   boost/trunk/libs/wave/samples/cpp_tokens/instantiate_cpp_exprgrammar.cpp
   boost/trunk/libs/wave/samples/cpp_tokens/instantiate_cpp_grammar.cpp
   boost/trunk/libs/wave/samples/cpp_tokens/instantiate_cpp_literalgrs.cpp
   boost/trunk/libs/wave/samples/cpp_tokens/instantiate_defined_grammar.cpp
   boost/trunk/libs/wave/samples/cpp_tokens/instantiate_slex_lexer.cpp
   boost/trunk/libs/wave/samples/cpp_tokens/slex/cpp_slex_lexer.hpp
   boost/trunk/libs/wave/samples/cpp_tokens/slex/lexer.hpp
   boost/trunk/libs/wave/samples/cpp_tokens/slex_interface.hpp
   boost/trunk/libs/wave/samples/cpp_tokens/slex_iterator.hpp
   boost/trunk/libs/wave/samples/cpp_tokens/slex_token.hpp
   boost/trunk/libs/wave/samples/lexed_tokens/build/Jamfile.v2
   boost/trunk/libs/wave/samples/lexed_tokens/lexed_tokens.cpp
   boost/trunk/libs/wave/samples/list_includes/build/Jamfile.v2
   boost/trunk/libs/wave/samples/list_includes/list_includes.cpp
   boost/trunk/libs/wave/samples/list_includes/list_includes.hpp
   boost/trunk/libs/wave/samples/list_includes/list_includes_config.hpp
   boost/trunk/libs/wave/samples/list_includes/list_includes_version.hpp
   boost/trunk/libs/wave/samples/quick_start/build/Jamfile.v2
   boost/trunk/libs/wave/samples/quick_start/quick_start.cpp
   boost/trunk/libs/wave/samples/waveidl/build/Jamfile.v2
   boost/trunk/libs/wave/samples/waveidl/idl.cpp
   boost/trunk/libs/wave/samples/waveidl/idl.hpp
   boost/trunk/libs/wave/samples/waveidl/idl_config.hpp
   boost/trunk/libs/wave/samples/waveidl/idl_version.hpp
   boost/trunk/libs/wave/samples/waveidl/idllexer/idl.re
   boost/trunk/libs/wave/samples/waveidl/idllexer/idl_lex_interface.hpp
   boost/trunk/libs/wave/samples/waveidl/idllexer/idl_lex_iterator.hpp
   boost/trunk/libs/wave/samples/waveidl/idllexer/idl_re.cpp
   boost/trunk/libs/wave/samples/waveidl/idllexer/idl_re.hpp
   boost/trunk/libs/wave/samples/waveidl/idllexer/idl_re2c_lexer.hpp
   boost/trunk/libs/wave/samples/waveidl/instantiate_cpp_grammar.cpp
   boost/trunk/libs/wave/samples/waveidl/instantiate_defined_grammar.cpp
   boost/trunk/libs/wave/samples/waveidl/instantiate_predef_macros.cpp
   boost/trunk/libs/wave/samples/waveidl/instantiate_re2c_lexer.cpp
   boost/trunk/libs/wave/samples/waveidl/instantiate_re2c_lexer_str.cpp
   boost/trunk/libs/wave/src/cpplexer/re2clex/aq.cpp
   boost/trunk/libs/wave/src/cpplexer/re2clex/cpp.re
   boost/trunk/libs/wave/src/cpplexer/re2clex/cpp_re.cpp
   boost/trunk/libs/wave/src/cpplexer/re2clex/cpp_re.inc
   boost/trunk/libs/wave/src/cpplexer/re2clex/strict_cpp.re
   boost/trunk/libs/wave/src/cpplexer/re2clex/strict_cpp_re.inc
   boost/trunk/libs/wave/src/instantiate_cpp_exprgrammar.cpp
   boost/trunk/libs/wave/src/instantiate_cpp_grammar.cpp
   boost/trunk/libs/wave/src/instantiate_cpp_literalgrs.cpp
   boost/trunk/libs/wave/src/instantiate_defined_grammar.cpp
   boost/trunk/libs/wave/src/instantiate_predef_macros.cpp
   boost/trunk/libs/wave/src/instantiate_re2c_lexer.cpp
   boost/trunk/libs/wave/src/instantiate_re2c_lexer_str.cpp
   boost/trunk/libs/wave/src/token_ids.cpp
   boost/trunk/libs/wave/src/wave_config_constant.cpp
   boost/trunk/libs/wave/test/testlexers/test_re2c_lexer.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_009.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_019.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_020.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_021.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_024.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_032.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_033.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_035.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_037.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_051.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_052.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_053.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_058.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_059.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_060.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/t_6_062.cpp
   boost/trunk/libs/wave/test/testwave/testfiles/test.cfg
   boost/trunk/libs/wave/test/testwave/testwave.cpp
   boost/trunk/libs/wave/test/testwave/testwave_app.cpp
   boost/trunk/libs/wave/test/testwave/testwave_app.hpp
   boost/trunk/libs/xpressive/doc/Jamfile.v2
   boost/trunk/libs/xpressive/doc/static_regexes.qbk
   boost/trunk/libs/xpressive/doc/xpressive.qbk
   boost/trunk/libs/xpressive/example/example.vcproj
   boost/trunk/libs/xpressive/index.html
   boost/trunk/libs/xpressive/perf/Jamfile.v2
   boost/trunk/libs/xpressive/perf/command_line.cpp
   boost/trunk/libs/xpressive/perf/gcc/long_twain_search.xml
   boost/trunk/libs/xpressive/perf/gcc/short_matches.xml
   boost/trunk/libs/xpressive/perf/gcc/short_twain_search.xml
   boost/trunk/libs/xpressive/perf/main.cpp
   boost/trunk/libs/xpressive/perf/msvc/long_twain_search.xml
   boost/trunk/libs/xpressive/perf/msvc/short_matches.xml
   boost/trunk/libs/xpressive/perf/msvc/short_twain_search.xml
   boost/trunk/libs/xpressive/perf/regex_comparison.hpp
   boost/trunk/libs/xpressive/perf/time_boost.cpp
   boost/trunk/libs/xpressive/perf/time_dynamic_xpressive.cpp
   boost/trunk/libs/xpressive/perf/time_static_xpressive.cpp
   boost/trunk/libs/xpressive/test/Jamfile.v2
   boost/trunk/libs/xpressive/test/misc1.cpp
   boost/trunk/libs/xpressive/test/multiple_defs1.cpp
   boost/trunk/libs/xpressive/test/multiple_defs2.cpp
   boost/trunk/libs/xpressive/test/regress.txt
   boost/trunk/libs/xpressive/test/test_cycles.cpp
   boost/trunk/more/background.html
   boost/trunk/more/bibliography.html
   boost/trunk/more/blanket-permission.txt
   boost/trunk/more/borland_cpp.html
   boost/trunk/more/bugs.htm
   boost/trunk/more/count_bdy.htm
   boost/trunk/more/cpp_committee_meetings.html
   boost/trunk/more/discussion_policy.htm
   boost/trunk/more/faq.htm
   boost/trunk/more/feature_model_diagrams.htm
   boost/trunk/more/formal_review_process.htm
   boost/trunk/more/formal_review_schedule.html
   boost/trunk/more/getting_started.html
   boost/trunk/more/header.htm
   boost/trunk/more/imp_vars.htm
   boost/trunk/more/index.htm
   boost/trunk/more/int_const_guidelines.htm
   boost/trunk/more/lib_guide.htm
   boost/trunk/more/library_reuse.htm
   boost/trunk/more/license_info.html
   boost/trunk/more/links.htm
   boost/trunk/more/mailing_lists.htm
   boost/trunk/more/microsoft_vcpp.html
   boost/trunk/more/moderators.html
   boost/trunk/more/release_mgr_checklist.html
   boost/trunk/more/release_procedures.htm
   boost/trunk/more/separate_compilation.html
   boost/trunk/more/submission_process.htm
   boost/trunk/more/test_policy.htm
   boost/trunk/more/version_history.html
   boost/trunk/more/whos_using/using.qbk
   boost/trunk/more/writingdoc/design.html
   boost/trunk/more/writingdoc/index.html
   boost/trunk/more/writingdoc/introduction.html
   boost/trunk/more/writingdoc/structure.html
   boost/trunk/more/writingdoc/template/acknowledgments.html
   boost/trunk/more/writingdoc/template/bibliography.html
   boost/trunk/more/writingdoc/template/configuration.html
   boost/trunk/more/writingdoc/template/definitions.html
   boost/trunk/more/writingdoc/template/faq.html
   boost/trunk/more/writingdoc/template/header.html
   boost/trunk/more/writingdoc/template/index.html
   boost/trunk/more/writingdoc/template/overview.html
   boost/trunk/more/writingdoc/template/rationale.html
   boost/trunk/people/aleksey_gurtovoy.htm
   boost/trunk/people/beman_dawes.html
   boost/trunk/people/darin_adler.htm
   boost/trunk/people/daryle_walker.html
   boost/trunk/people/dave_abrahams.htm
   boost/trunk/people/dietmar_kuehl.htm
   boost/trunk/people/doug_gregor.html
   boost/trunk/people/ed_brey.htm
   boost/trunk/people/eric_friedman.htm
   boost/trunk/people/fernando_cacciola.html
   boost/trunk/people/gary_powell.htm
   boost/trunk/people/gennadiy_rozental.htm
   boost/trunk/people/greg_colvin.htm
   boost/trunk/people/hartmut_kaiser.htm
   boost/trunk/people/herve_bronnimann.htm
   boost/trunk/people/howard_hinnant.htm
   boost/trunk/people/hubert_holin.html
   boost/trunk/people/jaakko_jarvi.htm
   boost/trunk/people/jeff_garland.html
   boost/trunk/people/jens_maurer.htm
   boost/trunk/people/jeremy_siek.htm
   boost/trunk/people/joaquin_lopez.htm
   boost/trunk/people/joel_de_guzman.htm
   boost/trunk/people/john_maddock.htm
   boost/trunk/people/jonathan_turkanis.htm
   boost/trunk/people/kevlin_henney.htm
   boost/trunk/people/liequan_lee.htm
   boost/trunk/people/mac_murrett.htm
   boost/trunk/people/mark_rodgers.htm
   boost/trunk/people/mat_marcus.htm
   boost/trunk/people/paul_mensonides.htm
   boost/trunk/people/pavol_droba.htm
   boost/trunk/people/people.htm
   boost/trunk/people/peter_dimov.htm
   boost/trunk/people/ralf_w_grosse_kunstleve.htm
   boost/trunk/people/rene_rivera.htm
   boost/trunk/people/robert_ramey.htm
   boost/trunk/people/ronald_garcia.htm
   boost/trunk/people/samuel_krempp.htm
   boost/trunk/people/thomas_witt.html
   boost/trunk/people/thorsten_ottosen.html
   boost/trunk/people/vladimir_prus.htm
   boost/trunk/people/william_kempf.htm
   boost/trunk/project-root.jam
   boost/trunk/rst.css
   boost/trunk/status/Jamfile.v2
   boost/trunk/status/explicit-failures-markup.xml
   boost/trunk/status/explicit-failures.xsd
   boost/trunk/tools/Jamfile.v2
   boost/trunk/tools/bcp/Jamfile.v2
   boost/trunk/tools/bcp/bcp.html
   boost/trunk/tools/boostbook/doc/Jamfile.v2
   boost/trunk/tools/boostbook/doc/boostbook.xml
   boost/trunk/tools/boostbook/doc/documenting.xml
   boost/trunk/tools/boostbook/doc/reference.xml
   boost/trunk/tools/boostbook/doc/together.xml
   boost/trunk/tools/boostbook/setup_boostbook.py
   boost/trunk/tools/boostbook/setup_boostbook.sh
   boost/trunk/tools/boostbook/xsl/admon.xsl
   boost/trunk/tools/boostbook/xsl/annotation.xsl
   boost/trunk/tools/boostbook/xsl/caramel/concept2docbook.xsl
   boost/trunk/tools/boostbook/xsl/caramel/cpp-operators.xml
   boost/trunk/tools/boostbook/xsl/caramel/unparser.xsl
   boost/trunk/tools/boostbook/xsl/chunk-common.xsl
   boost/trunk/tools/boostbook/xsl/docbook-layout.xsl
   boost/trunk/tools/boostbook/xsl/docbook.xsl
   boost/trunk/tools/boostbook/xsl/doxygen/collect.xsl
   boost/trunk/tools/boostbook/xsl/doxygen/doxygen2boostbook.xsl
   boost/trunk/tools/boostbook/xsl/dtd/dtd2boostbook.xsl
   boost/trunk/tools/boostbook/xsl/error.xsl
   boost/trunk/tools/boostbook/xsl/fo.xsl
   boost/trunk/tools/boostbook/xsl/function.xsl
   boost/trunk/tools/boostbook/xsl/global.xsl
   boost/trunk/tools/boostbook/xsl/html-single.xsl
   boost/trunk/tools/boostbook/xsl/html.xsl
   boost/trunk/tools/boostbook/xsl/index.xsl
   boost/trunk/tools/boostbook/xsl/library.xsl
   boost/trunk/tools/boostbook/xsl/lookup.xsl
   boost/trunk/tools/boostbook/xsl/macro.xsl
   boost/trunk/tools/boostbook/xsl/manpages.xsl
   boost/trunk/tools/boostbook/xsl/navbar.xsl
   boost/trunk/tools/boostbook/xsl/reference.xsl
   boost/trunk/tools/boostbook/xsl/relative-href.xsl
   boost/trunk/tools/boostbook/xsl/source-highlight.xsl
   boost/trunk/tools/boostbook/xsl/template.xsl
   boost/trunk/tools/boostbook/xsl/testing/Jamfile.xsl
   boost/trunk/tools/boostbook/xsl/testing/testsuite.xsl
   boost/trunk/tools/boostbook/xsl/type.xsl
   boost/trunk/tools/boostbook/xsl/utility.xsl
   boost/trunk/tools/boostbook/xsl/xref.xsl
   boost/trunk/tools/build/boost.css
   boost/trunk/tools/build/index.html
   boost/trunk/tools/build/v2/boost-build.jam
   boost/trunk/tools/build/v2/boost.css
   boost/trunk/tools/build/v2/build-system.jam
   boost/trunk/tools/build/v2/build/alias.jam
   boost/trunk/tools/build/v2/build/feature.jam
   boost/trunk/tools/build/v2/build/generators.jam
   boost/trunk/tools/build/v2/build/project.jam
   boost/trunk/tools/build/v2/build/property-set.jam
   boost/trunk/tools/build/v2/build/property.jam
   boost/trunk/tools/build/v2/build/readme.txt
   boost/trunk/tools/build/v2/build/scanner.jam
   boost/trunk/tools/build/v2/build/targets.jam
   boost/trunk/tools/build/v2/build/toolset.jam
   boost/trunk/tools/build/v2/build/type.jam
   boost/trunk/tools/build/v2/build/version.jam
   boost/trunk/tools/build/v2/build/virtual-target.jam
   boost/trunk/tools/build/v2/changes.txt
   boost/trunk/tools/build/v2/doc/development_plan.html
   boost/trunk/tools/build/v2/doc/src/advanced.xml
   boost/trunk/tools/build/v2/doc/src/extending.xml
   boost/trunk/tools/build/v2/doc/src/install.xml
   boost/trunk/tools/build/v2/doc/src/reference.xml
   boost/trunk/tools/build/v2/doc/src/standalone.xml
   boost/trunk/tools/build/v2/doc/src/tutorial.xml
   boost/trunk/tools/build/v2/doc/src/userman.xml
   boost/trunk/tools/build/v2/doc/tools.html
   boost/trunk/tools/build/v2/example/boost-build.jam
   boost/trunk/tools/build/v2/example/customization/Jamfile
   boost/trunk/tools/build/v2/example/customization/inline_file.py
   boost/trunk/tools/build/v2/example/customization/project-root.jam
   boost/trunk/tools/build/v2/example/customization/readme.txt
   boost/trunk/tools/build/v2/example/customization/verbatim.jam
   boost/trunk/tools/build/v2/example/gettext/Jamfile
   boost/trunk/tools/build/v2/example/gettext/project-root.jam
   boost/trunk/tools/build/v2/example/gettext/readme.txt
   boost/trunk/tools/build/v2/example/libraries/app/Jamfile
   boost/trunk/tools/build/v2/example/libraries/util/foo/Jamfile
   boost/trunk/tools/build/v2/example/make/Jamroot
   boost/trunk/tools/build/v2/example/make/readme.txt
   boost/trunk/tools/build/v2/example/qt/README.txt
   boost/trunk/tools/build/v2/example/variant/Jamfile
   boost/trunk/tools/build/v2/example/variant/libs/Jamfile
   boost/trunk/tools/build/v2/example/variant/project-root.jam
   boost/trunk/tools/build/v2/example/variant/readme.txt
   boost/trunk/tools/build/v2/example/versioned/jamfile.jam
   boost/trunk/tools/build/v2/example/versioned/project-root.jam
   boost/trunk/tools/build/v2/generators_prototype.py
   boost/trunk/tools/build/v2/hacking.txt
   boost/trunk/tools/build/v2/index.html
   boost/trunk/tools/build/v2/kernel/boost-build.jam
   boost/trunk/tools/build/v2/kernel/bootstrap.jam
   boost/trunk/tools/build/v2/kernel/class.jam
   boost/trunk/tools/build/v2/kernel/errors.jam
   boost/trunk/tools/build/v2/kernel/modules.jam
   boost/trunk/tools/build/v2/nightly.sh
   boost/trunk/tools/build/v2/notes/README.txt
   boost/trunk/tools/build/v2/notes/build_dir_option.txt
   boost/trunk/tools/build/v2/notes/relative_source_paths.txt
   boost/trunk/tools/build/v2/options/help.jam
   boost/trunk/tools/build/v2/release_procedure.txt
   boost/trunk/tools/build/v2/roll.sh
   boost/trunk/tools/build/v2/site-config.jam
   boost/trunk/tools/build/v2/test/BoostBuild.py
   boost/trunk/tools/build/v2/test/Jamfile
   boost/trunk/tools/build/v2/test/TestCmd.py
   boost/trunk/tools/build/v2/test/absolute_sources.py
   boost/trunk/tools/build/v2/test/alias.py
   boost/trunk/tools/build/v2/test/alternatives.py
   boost/trunk/tools/build/v2/test/assert-equal.jam
   boost/trunk/tools/build/v2/test/bad_dirname.py
   boost/trunk/tools/build/v2/test/boost-build.jam
   boost/trunk/tools/build/v2/test/boostbook.py
   boost/trunk/tools/build/v2/test/boostbook/a.hpp
   boost/trunk/tools/build/v2/test/boostbook/docs.xml
   boost/trunk/tools/build/v2/test/build_dir.py
   boost/trunk/tools/build/v2/test/build_no.py
   boost/trunk/tools/build/v2/test/c_file.py
   boost/trunk/tools/build/v2/test/chain.py
   boost/trunk/tools/build/v2/test/check-arguments.jam
   boost/trunk/tools/build/v2/test/check-bindrule.jam
   boost/trunk/tools/build/v2/test/check-jam-patches.jam
   boost/trunk/tools/build/v2/test/check-test-tools.jam
   boost/trunk/tools/build/v2/test/composite.py
   boost/trunk/tools/build/v2/test/conditionals.py
   boost/trunk/tools/build/v2/test/conditionals2.py
   boost/trunk/tools/build/v2/test/conditionals3.py
   boost/trunk/tools/build/v2/test/core_d12.py
   boost/trunk/tools/build/v2/test/core_delete_module.py
   boost/trunk/tools/build/v2/test/core_dependencies.py
   boost/trunk/tools/build/v2/test/core_import_module.py
   boost/trunk/tools/build/v2/test/core_modifiers.py
   boost/trunk/tools/build/v2/test/core_typecheck.py
   boost/trunk/tools/build/v2/test/core_varnames.py
   boost/trunk/tools/build/v2/test/custom_generator.py
   boost/trunk/tools/build/v2/test/default_build.py
   boost/trunk/tools/build/v2/test/default_features.py
   boost/trunk/tools/build/v2/test/dependency-test/Jamfile
   boost/trunk/tools/build/v2/test/dependency-test/foo.jam
   boost/trunk/tools/build/v2/test/dependency-test/project-root.jam
   boost/trunk/tools/build/v2/test/dependency-test/src1/z.h
   boost/trunk/tools/build/v2/test/direct-request-test/Jamfile
   boost/trunk/tools/build/v2/test/direct-request-test/project-root.jam
   boost/trunk/tools/build/v2/test/dll_path.py
   boost/trunk/tools/build/v2/test/generators-test/Jamfile
   boost/trunk/tools/build/v2/test/generators-test/extra.jam
   boost/trunk/tools/build/v2/test/generators-test/lex.jam
   boost/trunk/tools/build/v2/test/generators-test/lib/Jamfile
   boost/trunk/tools/build/v2/test/generators-test/nm.jam
   boost/trunk/tools/build/v2/test/generators-test/project-root.jam
   boost/trunk/tools/build/v2/test/generators-test/qt.jam
   boost/trunk/tools/build/v2/test/generators_test.py
   boost/trunk/tools/build/v2/test/indirect_conditional.py
   boost/trunk/tools/build/v2/test/inherit_toolset.py
   boost/trunk/tools/build/v2/test/inline.py
   boost/trunk/tools/build/v2/test/library_chain.py
   boost/trunk/tools/build/v2/test/library_order.py
   boost/trunk/tools/build/v2/test/library_property.py
   boost/trunk/tools/build/v2/test/loop.py
   boost/trunk/tools/build/v2/test/m1-01.py
   boost/trunk/tools/build/v2/test/m1-02.py
   boost/trunk/tools/build/v2/test/m1-03.py
   boost/trunk/tools/build/v2/test/make_rule.py
   boost/trunk/tools/build/v2/test/module-actions/boost-build.jam
   boost/trunk/tools/build/v2/test/module-actions/bootstrap.jam
   boost/trunk/tools/build/v2/test/module_actions.py
   boost/trunk/tools/build/v2/test/ndebug.py
   boost/trunk/tools/build/v2/test/no_type.py
   boost/trunk/tools/build/v2/test/notfile.py
   boost/trunk/tools/build/v2/test/ordered_properties.py
   boost/trunk/tools/build/v2/test/path_features.py
   boost/trunk/tools/build/v2/test/prebuilt.py
   boost/trunk/tools/build/v2/test/prebuilt/Jamfile
   boost/trunk/tools/build/v2/test/prebuilt/ext/Jamfile
   boost/trunk/tools/build/v2/test/prebuilt/ext/Jamfile2
   boost/trunk/tools/build/v2/test/prebuilt/ext/Jamfile3
   boost/trunk/tools/build/v2/test/prebuilt/ext/project-root.jam
   boost/trunk/tools/build/v2/test/prebuilt/project-root.jam
   boost/trunk/tools/build/v2/test/print.py
   boost/trunk/tools/build/v2/test/project-test1.jam
   boost/trunk/tools/build/v2/test/project-test1/Jamfile
   boost/trunk/tools/build/v2/test/project-test1/dir/Jamfile
   boost/trunk/tools/build/v2/test/project-test1/dir2/Jamfile
   boost/trunk/tools/build/v2/test/project-test1/dir2/project-root.jam
   boost/trunk/tools/build/v2/test/project-test1/project-root.jam
   boost/trunk/tools/build/v2/test/project-test1/project-test1.jam
   boost/trunk/tools/build/v2/test/project-test1/readme.txt
   boost/trunk/tools/build/v2/test/project-test1/standalone-project.jam
   boost/trunk/tools/build/v2/test/project-test3/Jamfile
   boost/trunk/tools/build/v2/test/project-test3/lib/Jamfile
   boost/trunk/tools/build/v2/test/project-test3/lib2/Jamfile
   boost/trunk/tools/build/v2/test/project-test3/lib2/helper/Jamfile
   boost/trunk/tools/build/v2/test/project-test3/lib3/Jamfile
   boost/trunk/tools/build/v2/test/project-test3/lib3/project-root.jam
   boost/trunk/tools/build/v2/test/project-test3/project-root.jam
   boost/trunk/tools/build/v2/test/project-test3/readme.txt
   boost/trunk/tools/build/v2/test/project-test4/Jamfile
   boost/trunk/tools/build/v2/test/project-test4/lib/Jamfile
   boost/trunk/tools/build/v2/test/project-test4/lib2/Jamfile
   boost/trunk/tools/build/v2/test/project-test4/project-root.jam
   boost/trunk/tools/build/v2/test/project-test4/readme.txt
   boost/trunk/tools/build/v2/test/project_dependencies.py
   boost/trunk/tools/build/v2/test/project_root_constants.py
   boost/trunk/tools/build/v2/test/project_test1.py
   boost/trunk/tools/build/v2/test/project_test3.py
   boost/trunk/tools/build/v2/test/project_test4.py
   boost/trunk/tools/build/v2/test/property_expansion.py
   boost/trunk/tools/build/v2/test/railsys.py
   boost/trunk/tools/build/v2/test/railsys/libx/project-root.jam
   boost/trunk/tools/build/v2/test/railsys/libx/src/Jamfile
   boost/trunk/tools/build/v2/test/railsys/program/Jamfile
   boost/trunk/tools/build/v2/test/railsys/program/liba/Jamfile
   boost/trunk/tools/build/v2/test/railsys/program/main/Jamfile
   boost/trunk/tools/build/v2/test/railsys/program/project-root.jam
   boost/trunk/tools/build/v2/test/rebuilds.py
   boost/trunk/tools/build/v2/test/recursive.jam
   boost/trunk/tools/build/v2/test/regression.py
   boost/trunk/tools/build/v2/test/relative_sources.py
   boost/trunk/tools/build/v2/test/searched_lib.py
   boost/trunk/tools/build/v2/test/skipping.py
   boost/trunk/tools/build/v2/test/stage.py
   boost/trunk/tools/build/v2/test/standalone.py
   boost/trunk/tools/build/v2/test/startup/boost-root/boost-build.jam
   boost/trunk/tools/build/v2/test/startup/boost-root/build/boost-build.jam
   boost/trunk/tools/build/v2/test/startup/boost-root/build/bootstrap.jam
   boost/trunk/tools/build/v2/test/startup/bootstrap-env/boost-build.jam
   boost/trunk/tools/build/v2/test/startup/bootstrap-explicit/boost-build.jam
   boost/trunk/tools/build/v2/test/startup/bootstrap-implicit/readme.txt
   boost/trunk/tools/build/v2/test/startup/no-bootstrap1/boost-build.jam
   boost/trunk/tools/build/v2/test/startup/no-bootstrap1/subdir/readme.txt
   boost/trunk/tools/build/v2/test/startup/no-bootstrap2/boost-build.jam
   boost/trunk/tools/build/v2/test/startup/no-bootstrap3/boost-build.jam
   boost/trunk/tools/build/v2/test/startup_v1.py
   boost/trunk/tools/build/v2/test/startup_v2.py
   boost/trunk/tools/build/v2/test/suffix.py
   boost/trunk/tools/build/v2/test/symlink.py
   boost/trunk/tools/build/v2/test/test-config-example.jam
   boost/trunk/tools/build/v2/test/test.jam
   boost/trunk/tools/build/v2/test/test1.py
   boost/trunk/tools/build/v2/test/test2.py
   boost/trunk/tools/build/v2/test/test2/Jamfile
   boost/trunk/tools/build/v2/test/test_all.py
   boost/trunk/tools/build/v2/test/test_nt_line_length.jam
   boost/trunk/tools/build/v2/test/testing-primitives/boost-build.jam
   boost/trunk/tools/build/v2/test/testing-primitives/bootstrap.jam
   boost/trunk/tools/build/v2/test/testing_primitives.py
   boost/trunk/tools/build/v2/test/tree.py
   boost/trunk/tools/build/v2/test/unit-tests.jam
   boost/trunk/tools/build/v2/test/unit_test.py
   boost/trunk/tools/build/v2/test/unit_tests.py
   boost/trunk/tools/build/v2/test/unused.py
   boost/trunk/tools/build/v2/test/unused/Jamfile
   boost/trunk/tools/build/v2/test/unused/b.cpp
   boost/trunk/tools/build/v2/test/unused/project-root.jam
   boost/trunk/tools/build/v2/test/use_requirements.py
   boost/trunk/tools/build/v2/test/v1-testing/Jamfile
   boost/trunk/tools/build/v2/test/v1-testing/boost-build.jam
   boost/trunk/tools/build/v2/test/v1_testing.py
   boost/trunk/tools/build/v2/test/v1_testing/Jamfile
   boost/trunk/tools/build/v2/test/v1_testing/boost-build.jam
   boost/trunk/tools/build/v2/test/v1_testing/project-root.jam
   boost/trunk/tools/build/v2/test/wrapper.py
   boost/trunk/tools/build/v2/tools/acc.jam
   boost/trunk/tools/build/v2/tools/bison.jam
   boost/trunk/tools/build/v2/tools/boostbook.jam
   boost/trunk/tools/build/v2/tools/borland.jam
   boost/trunk/tools/build/v2/tools/builtin.jam
   boost/trunk/tools/build/v2/tools/common.jam
   boost/trunk/tools/build/v2/tools/como-linux.jam
   boost/trunk/tools/build/v2/tools/como-win.jam
   boost/trunk/tools/build/v2/tools/cw.jam
   boost/trunk/tools/build/v2/tools/darwin.jam
   boost/trunk/tools/build/v2/tools/docutils.jam
   boost/trunk/tools/build/v2/tools/doxygen-config.jam
   boost/trunk/tools/build/v2/tools/doxygen.jam
   boost/trunk/tools/build/v2/tools/gcc.jam
   boost/trunk/tools/build/v2/tools/gettext.jam
   boost/trunk/tools/build/v2/tools/intel-linux.jam
   boost/trunk/tools/build/v2/tools/intel-win.jam
   boost/trunk/tools/build/v2/tools/lex.jam
   boost/trunk/tools/build/v2/tools/make.jam
   boost/trunk/tools/build/v2/tools/msvc.jam
   boost/trunk/tools/build/v2/tools/package.jam
   boost/trunk/tools/build/v2/tools/pch.jam
   boost/trunk/tools/build/v2/tools/python.jam
   boost/trunk/tools/build/v2/tools/qcc.jam
   boost/trunk/tools/build/v2/tools/qt3.jam
   boost/trunk/tools/build/v2/tools/qt4.jam
   boost/trunk/tools/build/v2/tools/quickbook.jam
   boost/trunk/tools/build/v2/tools/rc.jam
   boost/trunk/tools/build/v2/tools/stage.jam
   boost/trunk/tools/build/v2/tools/stlport.jam
   boost/trunk/tools/build/v2/tools/sun.jam
   boost/trunk/tools/build/v2/tools/symlink.jam
   boost/trunk/tools/build/v2/tools/testing.jam
   boost/trunk/tools/build/v2/tools/types/lib.jam
   boost/trunk/tools/build/v2/tools/xsltproc.jam
   boost/trunk/tools/build/v2/user-config.jam
   boost/trunk/tools/build/v2/util/assert.jam
   boost/trunk/tools/build/v2/util/container.jam
   boost/trunk/tools/build/v2/util/doc.jam
   boost/trunk/tools/build/v2/util/indirect.jam
   boost/trunk/tools/build/v2/util/numbers.jam
   boost/trunk/tools/build/v2/util/os.jam
   boost/trunk/tools/build/v2/util/path.jam
   boost/trunk/tools/build/v2/util/print.jam
   boost/trunk/tools/build/v2/util/regex.jam
   boost/trunk/tools/build/v2/util/sequence.jam
   boost/trunk/tools/build/v2/util/set.jam
   boost/trunk/tools/build/v2/util/string.jam
   boost/trunk/tools/build/v2/util/utility.jam
   boost/trunk/tools/index.html
   boost/trunk/tools/inspect/build/Jamfile.v2
   boost/trunk/tools/inspect/copyright_check.cpp
   boost/trunk/tools/inspect/copyright_check.hpp
   boost/trunk/tools/inspect/crlf_check.cpp
   boost/trunk/tools/inspect/crlf_check.hpp
   boost/trunk/tools/inspect/cvs_iterator.hpp
   boost/trunk/tools/inspect/index.html
   boost/trunk/tools/inspect/inspect.cpp
   boost/trunk/tools/inspect/inspector.hpp
   boost/trunk/tools/inspect/license_check.cpp
   boost/trunk/tools/inspect/license_check.hpp
   boost/trunk/tools/inspect/link_check.cpp
   boost/trunk/tools/inspect/link_check.hpp
   boost/trunk/tools/inspect/long_name_check.cpp
   boost/trunk/tools/inspect/long_name_check.hpp
   boost/trunk/tools/inspect/minmax_check.cpp
   boost/trunk/tools/inspect/minmax_check.hpp
   boost/trunk/tools/inspect/tab_check.cpp
   boost/trunk/tools/inspect/tab_check.hpp
   boost/trunk/tools/jam/doc/bjam.qbk
   boost/trunk/tools/jam/index.html
   boost/trunk/tools/jam/src/boost-jam.spec
   boost/trunk/tools/jam/src/build.bat
   boost/trunk/tools/jam/src/build.jam
   boost/trunk/tools/jam/src/builtins.c
   boost/trunk/tools/jam/src/bump_version.py
   boost/trunk/tools/jam/src/debian/copyright
   boost/trunk/tools/jam/src/execnt.c
   boost/trunk/tools/jam/src/headers.c
   boost/trunk/tools/jam/src/patchlevel.h
   boost/trunk/tools/jam/src/variable.c
   boost/trunk/tools/make-cputime-page.pl
   boost/trunk/tools/quickbook/block.hpp
   boost/trunk/tools/quickbook/detail/actions.cpp
   boost/trunk/tools/quickbook/detail/actions.hpp
   boost/trunk/tools/quickbook/detail/quickbook.cpp
   boost/trunk/tools/quickbook/doc/Jamfile.v2
   boost/trunk/tools/quickbook/doc/html/boostbook.css
   boost/trunk/tools/quickbook/doc/html/index.html
   boost/trunk/tools/quickbook/doc/html/quickbook/change_log.html
   boost/trunk/tools/quickbook/doc/html/quickbook/intro.html
   boost/trunk/tools/quickbook/doc/html/quickbook/ref.html
   boost/trunk/tools/quickbook/doc/html/quickbook/syntax.html
   boost/trunk/tools/quickbook/doc/html/quickbook/syntax/block.html
   boost/trunk/tools/quickbook/doc/html/quickbook/syntax/comments.html
   boost/trunk/tools/quickbook/doc/html/quickbook/syntax/phrase.html
   boost/trunk/tools/quickbook/doc/quickbook.qbk
   boost/trunk/tools/quickbook/doc/quickbook.xml
   boost/trunk/tools/quickbook/index.html
   boost/trunk/tools/quickbook/phrase.hpp
   boost/trunk/tools/quickbook/syntax_highlight.hpp
   boost/trunk/tools/quickbook/test/Jamfile.v2
   boost/trunk/tools/quickbook/test/quickbook-manual.gold
   boost/trunk/tools/quickbook/test/quickbook-manual.quickbook
   boost/trunk/tools/regression/build/vcide/process_jam_log.vcproj
   boost/trunk/tools/regression/compiler_status.cpp
   boost/trunk/tools/regression/index.htm
   boost/trunk/tools/regression/process_jam_log.cpp
   boost/trunk/tools/regression/run_tests.sh
   boost/trunk/tools/regression/test/test.py
   boost/trunk/tools/regression/xsl_reports/boost_wide_report.py
   boost/trunk/tools/regression/xsl_reports/make_snapshot.py
   boost/trunk/tools/regression/xsl_reports/runner/collect_and_upload_logs.py
   boost/trunk/tools/regression/xsl_reports/runner/instructions.html
   boost/trunk/tools/regression/xsl_reports/runner/instructions.rst
   boost/trunk/tools/regression/xsl_reports/runner/regression.py
   boost/trunk/tools/regression/xsl_reports/test/common.py
   boost/trunk/tools/regression/xsl_reports/test/generate_test_results.py
   boost/trunk/tools/regression/xsl_reports/xsl/v2/add_expected_results.xsl
   boost/trunk/tools/regression/xsl_reports/xsl/v2/common.xsl
   boost/trunk/tools/regression/xsl_reports/xsl/v2/html/master.css
   boost/trunk/tools/regression/xsl_reports/xsl/v2/links_page.xsl
   boost/trunk/tools/regression/xsl_reports/xsl/v2/result_page.xsl
   boost/trunk/tools/regression/xsl_reports/xsl/v2/summary_page.xsl
   boost/trunk/tools/release/user-config.jam
   boost/trunk/tools/wave/build/Jamfile.v2
   boost/trunk/tools/wave/cpp.cpp
   boost/trunk/tools/wave/cpp.hpp
   boost/trunk/tools/wave/cpp_config.hpp
   boost/trunk/tools/wave/cpp_version.hpp
   boost/trunk/tools/wave/stop_watch.hpp
   boost/trunk/tools/wave/trace_macro_expansion.hpp
   boost/trunk/wiki/index.html
Log:
new upstream snapshot

Deleted: boost/trunk/Jamfile
===================================================================
--- boost/trunk/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,280 +0,0 @@
-#~ Copyright 2003-2005, Rene Rivera.
-#~ Distributed under the Boost Software License, Version 1.0.
-#~ (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
-
-if --help in $(ARGV)
-{
-    ECHO "
-Usage:
-    bjam [options] [install|stage]
-
-    * install               Installs to the configured location(s).
-    * stage                 Stages the build products only to common stage
-                            location.
-
-Options:
-    --help                  This message.
-    
-    -sTOOLS=<toolsets>      Indicates the tools to build with.
-    
-    --show-libraries        Displays the list of Boost libraries that require
-                            build and installation steps, then exit.
-
-    --layout=<layout>       Determines what kind of build layout to use. This
-                            allows one to control the naming of the resulting
-                            libraries, and the locations of the installed
-                            files. Default is 'versioned'. Possible values:
-                            
-                                versioned - Uses the Boost standard names
-                                which include version number for Boost the
-                                release and version and name of the
-                                compiler as part of the library names. Also
-                                installs the includes to a versioned
-                                sub-directory.
-                                
-                                system - Builds an install without the
-                                Boost standard names, and does not install
-                                includes to a versioned sub-directory. This
-                                is intended for system integrators to build
-                                for packaging of distributions.
-
-Locations:
-    --prefix=PREFIX         Install architecture independent files here.
-                            Default; C:\\Boost on Win32
-                            Default; /usr/local on Unix. Linux, etc.
-                            
-    --exec-prefix=EPREFIX   Install architecture dependent files here.
-                            Default; PREFIX
-                            
-    --libdir=DIR            Install libraries here.
-                            Default; EPREFIX/lib
-                            
-    --includedir=DIR        Install source headers here.
-                            Default; PREFIX/include
-                            
-    --builddir=DIR          Build in this location instead of building
-                            within the distribution tree. Recommended!
-                            
-    --stagedir=DIR          When staging only, stage to the location.
-                            Default; ./stage
-
-Features:
-    --with-<library>        Build, stage, or install the specified <library>
-                            If used, the default becomes to only build
-                            indicated libraries.
-                            
-    --without-<library>     Do not build, stage, or install the specified
-                            <library>. By default all libraries attempt to
-                            build.
-                            
-    --with-python-root[=PYTHON_ROOT]
-                            Build Boost.Python libraries with the Python
-                            devel packages located at PYTHON_ROOT.
-                            Default PYTHON_ROOT; C:\\Python24 on Win32.
-                            Default PYTHON_ROOT; /usr on Unix, Linux, Cygwin, etc.
-                            
-    --with-python-version[=2.4]
-                            Build Boost.Python libraries with the Python
-                            version indicated.
-                            Default; 2.4.
-                            
-    --with-pydebug          Build Boost.Python libraries using the
-                            Python debug runtime.
-" ;
-    EXIT "" ;
-}
-
-local with-install = ;
-local with-stage = ;
-
-# build only, or build+install
-if install in $(ARGV)
-{
-    with-install = install ;
-    with-stage = ;
-}
-
-# stage only? (no install, only build and stage to a common dir)
-if stage in $(ARGV)
-{
-    with-stage = stage ;
-    with-install = ;
-}
-
-# what kind of layout are we doing?
-local layout = [ MATCH "^--layout=(.*)" : $(ARGV) ] ;
-layout ?= versioned ;
-layout-$(layout) = true ;
-
-# possible stage only location
-local stage-locate = [ MATCH "^--stagedir=(.*)" : $(ARGV) ] ;
-stage-locate ?= stage ;
-
-# architecture independent files
-local boost-locate = [ unless $(with-stage) : [ MATCH "^--prefix=(.*)" : $(ARGV) ] : $(stage-locate) ] ;
-if $(NT) { boost-locate ?= C:\\Boost ; }
-else if $(UNIX) { boost-locate ?= /usr/local ; }
-
-# architecture dependent files
-local exec-locate = [ MATCH "^--exec-prefix=(.*)" : $(ARGV) ] ;
-exec-locate ?= $(boost-locate) ;
-
-# object code libraries
-local lib-locate = [ MATCH "^--libdir=(.*)" : $(ARGV) ] ;
-lib-locate ?= $(exec-locate)/lib ;
-
-# where to build
-local all-locate = [ MATCH "^--builddir=(.*)" : $(ARGV) ] ;
-ALL_LOCATE_TARGET ?= $(all-locate) ;
-
-# source header files
-local include-locate = [ MATCH "^--includedir=(.*)" : $(ARGV) ] ;
-include-locate ?= $(boost-locate)/include ;
-
-# location of python
-local python-root = [ MATCH "^--with-python-root=(.*)" : $(ARGV) ] ;
-PYTHON_ROOT ?= $(python-root) ;
-
-# version of python
-local python-version = [ MATCH "^--with-python-version=(.*)" : $(ARGV) ] ;
-PYTHON_VERSION ?= $(python-version) ;
-
-# variant for pydebug build
-local with-debug-python ;
-if --with-pydebug in $(ARGV)
-{
-    with-debug-python = debug-python ;
-}
-
-# libraries to disable building, etc.
-local without-libraries = [ MATCH "^--without-(.*)" : $(ARGV) ] ;
-
-# libraries to enable
-local with-libraries ;
-for local arg in $(ARGV)
-{
-    switch $(arg)
-    {
-        case --with-python-root=* : local _ ;
-        case --with-python-version=* : local _ ;
-        case --with-pydebug : local _ ;
-        
-        case --with-* :
-        with-libraries += [ MATCH "^--with-(.*)" : $(arg) ] ;
-    }
-}
-
-#
-project-root ;
-
-# bring in the rules for python
-import python ;
-
-# print out libraries to build/install
-if --show-libraries in $(ARGV)
-{
-    local library-jamfiles ;
-    library-jamfiles =
-        [ MATCH ^(.*build[/\\:]$(JAMFILE))$ : 
-            [ glob-tree $(BOOST_ROOT)/libs : $(JAMFILE) ] ] ;
-    libraries =
-        [ MATCH ^.*libs[/\\:]([^/\\:]*)[/\\:]build[/\\:]Jamfile$ :
-            $(library-jamfiles) ] ;
-    EXIT $(libraries) ;
-}
-
-#
-local version-tag = [ MATCH "^([^.]+)[.]([^.]+)[.]([^.]+)" : $(BOOST_VERSION) ] ;
-if $(version-tag[3]) = 0
-{
-    version-tag = $(version-tag[1-2]) ;
-}
-version-tag = $(version-tag:J="_") ;
-
-#
-install-subinclude
-    [ MATCH ^(.*build[/\\:]$(JAMFILE))$ : [ glob-tree $(BOOST_ROOT)/libs : $(JAMFILE) ] ]
-    : <exclude>$(without-libraries) <include>$(with-libraries) ;
-
-local lib-sources = [ install-sources lib ] ;
-
-if $(lib-sources)
-{
-    local gNOWARN_INCOMPATIBLE_BUILDS = TRUE ;
-    local gUNVERSIONED_VARIANT_TAG = [ cond $(layout-system) : TRUE ] ;
-    
-    local lib-build =
-        debug release
-        [ cond $(with-debug-python) : debug-python ]
-        [ cond $(NT) : <runtime-link>static/dynamic ]
-        <threading>single/multi
-        ;
-    local lib-target =
-        [ cond $(with-install) : install : all ]
-        [ cond $(with-stage) : stage : all ]
-        ;
-    local lib-dest-files = [
-        stage $(lib-locate:D=)
-            :
-                $(lib-sources)
-            :
-                <locate>$(lib-locate:D)
-                common-variant-tag
-                <target>$(lib-target)
-            :
-                $(lib-build)
-                [ unless $(with-install) $(with-stage) : <suppress>true ]
-        ] ;
-    if ! $(gIN_LIB_INCLUDE) && $(layout-versioned)
-    {
-        local unversioned-files ;
-        if $(with-install) || $(with-stage)
-        {
-            if $(NT)
-            {
-                local version-files = [ MATCH "(.*[.]lib)" : $(lib-dest-files) ] ;
-                local noversion-files ;
-                for local version-file in $(version-files)
-                {
-                    local noversion-file =
-                        [ MATCH "(.*)-[0-9_]+([.]lib)" : $(version-file) ] ;
-                    noversion-file = $(noversion-file[1])$(noversion-file[2]) ;
-                    MakeLocate $(noversion-file) : [ FDirName [ split-path $(lib-locate) ] ] ;
-                    HardLink $(noversion-file) : $(version-file) ;
-                    noversion-files += $(noversion-file) ;
-                }
-                declare-fake-targets $(lib-target) : $(noversion-files) ;
-            }
-            else if $(UNIX)
-            {
-                local so-version-files = [ MATCH "(.*[.]so[.0-9]+)" : $(lib-dest-files) ] ;
-                so-version-files ?= [ MATCH "(.*[.]so)" : $(lib-dest-files) ] ;
-                local version-files = $(so-version-files) [ MATCH "(.*[.]a)" : $(lib-dest-files) ] ;
-                local noversion-files ;
-                for local version-file in $(version-files)
-                {
-                    local noversion-file =
-                        [ MATCH "(.*)-[0-9_]+([.]so)[.0-9]*" : $(version-file) ]
-                        [ MATCH "(.*)-[0-9_]+([.]a)" : $(version-file) ] ;
-                    noversion-file = $(noversion-file[1])$(noversion-file[2]) ;
-                    MakeLocate $(noversion-file) : [ FDirName [ split-path $(lib-locate) ] ] ;
-                    HardLink $(noversion-file) : $(version-file) ;
-                    noversion-files += $(noversion-file) ;
-                }
-                declare-fake-targets $(lib-target) : $(noversion-files) ;
-            }
-        }
-    }
-}
-
-stage [ cond $(layout-versioned) : $(include-locate:D=)/boost-$(version-tag) : $(include-locate:D=) ]
-    :
-        [ glob-tree $(BOOST_ROOT)/boost/compatibility/cpp_c_headers : c* ]
-        [ glob-tree $(BOOST_ROOT)/boost : *.hpp *.ipp *.h *.inc ]
-    :
-        <locate>$(include-locate:D)
-        <tree-subdirs>$(BOOST_ROOT)
-        [ cond $(with-install) : <target>install : <target>all ]
-    :
-        [ unless $(with-install) : <suppress>true ]
-    ;

Modified: boost/trunk/Jamfile.v2
===================================================================
--- boost/trunk/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,12 @@
+# Copyright Vladimir Prus 2002-2006.
+# Copyright Dave Abrahams 2005-2006.
+# Copyright Rene Rivera 2005-2006.
+# Copyright Douglas Gregor 2005.
+#
+# Distributed under the Boost Software License, Version 1.0.
+#    (See accompanying file LICENSE_1_0.txt or copy at
+#          http://www.boost.org/LICENSE_1_0.txt)
+
 # Usage:
 #
 #   bjam [options] [install|stage]
@@ -9,23 +18,23 @@
 #   install                 Install headers and compiled library files to the
 #   =======                 configured locations (below).
 #
-#   --prefix=PREFIX         Install architecture independent files here.
+#   --prefix=<PREFIX>       Install architecture independent files here.
 #                           Default; C:\Boost on Win32
 #                           Default; /usr/local on Unix. Linux, etc.
 #
-#   --exec-prefix=EPREFIX   Install architecture dependent files here.
-#                           Default; PREFIX
+#   --exec-prefix=<EPREFIX> Install architecture dependent files here.
+#                           Default; <PREFIX>
 #
-#   --libdir=DIR            Install library files here.
-#                           Default; EPREFIX/lib
+#   --libdir=<DIR>          Install library files here.
+#                           Default; <EPREFIX>/lib
 #
-#   --includedir=DIR        Install header files here.
-#                           Default; PREFIX/include
+#   --includedir=<HDRDIR>   Install header files here.
+#                           Default; <PREFIX>/include
 #
 #   stage                   Build and install only compiled library files
 #   =====                   to the stage directory.
 #
-#   --stagedir=DIR          Install library files here
+#   --stagedir=<STAGEDIR>   Install library files here
 #                           Default; ./stage
 #
 # Other Options:
@@ -38,24 +47,30 @@
 #   --show-libraries        Displays the list of Boost libraries that require
 #                           build and installation steps, then exit.
 #
-#   --layout=<layout>       Determines what kind of build layout to use. This
-#                           allows one to control the naming of the resulting
-#                           libraries, and the locations of the installed
-#                           files. Default is 'versioned'. Possible values:
+#   --layout=<layout>       Determines whether to choose library names 
+#                           and header locations such that multiple 
+#                           versions of Boost or multiple compilers can
+#                           be used on the same system.
 #
-#                               versioned - Uses the Boost standard names
-#                               which include version number for Boost the
-#                               release and version and name of the
-#                               compiler as part of the library names. Also
-#                               installs the includes to a versioned
-#                               sub-directory.
+#                               versioned (default) - Names of boost
+#                               binaries include the Boost version
+#                               number and the name and version of the
+#                               compiler.  Boost headers are installed
+#                               in a subdirectory of <HDRDIR> whose
+#                               name contains the Boost version
+#                               number.
 #
-#                               system - Builds an install without the
-#                               Boost standard names, and does not install
-#                               includes to a versioned sub-directory. This
-#                               is intended for system integrators to build
-#                               for packaging of distributions.
+#                               system - Binaries names do not include
+#                               the Boost version number or the name
+#                               and version number of the compiler.
+#                               Boost headers are installed directly
+#                               into <HDRDIR>.  This option is
+#                               intended for system integrators who
+#                               are building distribution packages.
 #
+#   --buildid=ID            Adds the specified ID to the name of built
+#                           libraries.  The default is to not add anything.
+#
 #   --help                  This message.
 #
 #   --with-<library>        Build and install the specified <library>
@@ -64,41 +79,74 @@
 #
 #   --without-<library>     Do not build, stage, or install the specified
 #                           <library>. By default, all libraries are built.
-#
-#   --with-python-root[=PYTHON_ROOT]
-#                           Build Boost.Python libraries with the Python
-#                           devel packages located at PYTHON_ROOT.
-#                           Default PYTHON_ROOT; C:\Python24 on Win32.
-#                           Default PYTHON_ROOT; /usr on Unix, Linux,
-#                               Cygwin, etc.
-#
-#   --with-python-version[=2.4]
-#                           Build Boost.Python libraries with the Python
-#                           version indicated.
-#                           Default; 2.4.
-#
-#   --with-pydebug          Build Boost.Python libraries for use with a
-#                           debug build of Python.
 
-#
-# This is Boost Jamfile for Boost.Build V2.
-#
-# Pass --v2 option to bjam to use this file. For example:
-#
-#    bjam --v2 link=static
-#
-
 # TODO:
 #  - handle boost version
+#  - handle python options such as pydebug
 
-
 import modules ;
 import set ;
 import stage ;
 import package ;
+import path ;
+import common ;
+import os ;
+import regex ;
+import errors ;
+import "class" : new ;
+import common ;
 
 constant BOOST_VERSION : 1.34.0 ;
 
+local version-tag = [ MATCH "^([^.]+)[.]([^.]+)[.]([^.]+)" : $(BOOST_VERSION) ] ;
+if $(version-tag[3]) = 0
+{
+    version-tag = $(version-tag[1-2]) ;
+}
+
+constant BOOST_VERSION_TAG : $(version-tag:J="_") ;
+
+local default-build ;
+if $(__file__:D) = ""
+{
+    default-build =
+        debug release
+        <threading>single <threading>multi
+        <link>shared <link>static
+        ;
+    
+    if [ os.name ] = NT
+    {
+        default-build += <runtime-link>shared <runtime-link>static ;
+    }
+}
+else
+{
+    default-build =
+        debug
+        ;
+}
+
+
+rule handle-static-runtime ( properties * )
+{    
+    # This property combination is dangerous.
+    # Ideally, we'd add constraint to default build,
+    # so that user can build with property combination
+    # by hand. But we don't have any 'constraint' mechanism
+    # for default-build, so disable such builds in requirements.
+    
+    # For CW, static runtime is needed so that
+    # std::locale works.
+    if <link>shared in $(properties)
+      && <runtime-link>static in $(properties)
+        && ! ( <toolset>cw in $(properties) )    
+    {
+        return <build>no ;
+    }
+}
+
+
 project boost
     : requirements <include>.
       # disable auto-linking for all targets here,
@@ -107,14 +155,18 @@
       # Used to encode variant in target name. See the
       # 'tag' rule below.
       <tag>@$(__name__).tag
+      <conditional>@handle-static-runtime
+            
     : usage-requirements <include>.
     : build-dir bin.v2
+    : default-build $(default-build)
     ;
 
 # Setup convenient aliases for all libraries.
 
-all-libraries = [ MATCH .*libs/(.*)/build/.*
-                  : [ glob libs/*/build/Jamfile.v2 ] ] ;
+all-libraries =
+    [ MATCH .*libs/(.*)/build/.* : [ glob libs/*/build/Jamfile.v2 ] ]
+    ;
 
 # First, the complicated libraries: where the target name in
 # Jamfile is different from directory name.
@@ -122,8 +174,8 @@
 alias test_exec_monitor : libs/test/build//boost_test_exec_monitor ;
 alias unit_test_framework : libs/test/build//boost_unit_test_framework ;
 alias bgl-vis : libs/graps/build//bgl-vis ;
-alias serialization : libs/serialization//serialization ;
-alias wserialization : libs/serialization//wserialization ;
+alias serialization : libs/serialization/build//boost_serialization ;
+alias wserialization : libs/serialization/build//boost_wserialization ;
 
 explicit prg_exec_monitor test_exec_monitor unit_test_framework
     bgl-vis serialization wserialization ;
@@ -180,25 +232,41 @@
 }
 
 # what kind of layout are we doing?
-layout = [ MATCH "^--layout=(.*)" : $(ARGV) ] ;
+layout = [ MATCH "^--layout=(.*)" : [ modules.peek : ARGV ] ] ;
 layout ?= versioned ;
 layout-$(layout) = true ;
 
 # possible stage only location
-local stage-locate = [ MATCH "^--stagedir=(.*)" : $(ARGV) ] ;
+local stage-locate = [ MATCH "^--stagedir=(.*)" : [ modules.peek : ARGV ] ] ;
 stage-locate ?= stage ;
 
 path-constant BOOST_STAGE_LOCATE : $(stage-locate) ;
 
 
 # location of python
-local python-root = [ MATCH "^--with-python-root=(.*)" : $(ARGV) ] ;
+local python-root = [ MATCH "^--with-python-root=(.*)" : [ modules.peek : ARGV ] ] ;
 PYTHON_ROOT ?= $(python-root) ;
 
 # Select the libraries to install.
 libraries = [ libraries-to-install $(all-libraries) ] ;
 
+if --show-libraries in [ modules.peek : ARGV ]
+{
+    ECHO "The following libraries require building:" ;
+    for local l in $(libraries)
+    {
+        ECHO "    - $(l)" ;
+    }
+    EXIT ;
+}
 
+# Custom build ID.
+local build-id = [ MATCH "^--buildid=(.*)" : [ modules.peek : ARGV ] ] ;
+if $(build-id)
+{
+    constant BUILD_ID : [ regex.replace $(build-id) "[*\\/:.\"\' ]" "_" ] ;
+}
+
 # This rule is called by Boost.Build to determine the name of
 # target. We use it to encode build variant, compiler name and
 # boost version in the target name
@@ -208,57 +276,163 @@
     {
         if $(layout) = versioned
         {
-            name = [ stage.add-variant-and-compiler $(name)
-              : $(type) : $(property-set) ] ;
-
-            local version-tag = [ MATCH "^([^.]+)[.]([^.]+)" : $(BOOST_VERSION[1]) ] ;
-            version-tag = $(version-tag:J="_") ;
-
+            local result = [ common.format-name
+                <base> <toolset> <threading> <runtime> -$(BOOST_VERSION_TAG)
+                -$(BUILD_ID)
+                : $(name) : $(type) : $(property-set) ] ;
+            
             # Optionally add version suffix.
-            if $(type) != SHARED_LIB ||
-              [ $(property-set).get <os> ] in NT CYGWIN MACOSX AIX
+            # On NT, library with version suffix won't be recognized
+            # by linkers. On CYGWIN, we get strage duplicate symbol
+            # errors when library is generated with version suffix.
+            # On OSX, version suffix is not needed -- the linker expets
+            # libFoo.1.2.3.dylib format.
+            # AIX linkers don't accept version suffixes either.
+            if $(type) = SHARED_LIB &&
+              ! ( [ $(property-set).get <target-os> ] in windows cygwin darwin aix )
             {
-                # On NT, library with version suffix won't be recognized
-                # by linkers. On CYGWIN, we get strage duplicate symbol
-                # errors when library is generated with version suffix.
-                # On OSX, version suffix is not needed -- the linker expets
-                # libFoo.1.2.3.dylib format.
-                # AIX linkers don't accept version suffixes either.
-                return $(name:B)-$(version-tag)$(name:S) ;
+                result = $(result).$(BOOST_VERSION)  ;
             }
-            else
-            {
-                return $(name:B)-$(version-tag)$(name:S).$(BOOST_VERSION)  ;
-            }
+            
+            return $(result) ;
         }
         else
         {
-            return [ stage.add-variant-and-compiler $(name)
-              : $(type) : $(property-set) ] ;
+            return [ common.format-name
+                <base> <threading> <runtime> -$(BUILD_ID)
+                : $(name) : $(type) : $(property-set) ] ;
         }
     }
 }
 
 # Install to system location.
 
-local patterns = *.hpp *.ipp *.h *.inc ;
-local dirs = boost boost/* boost/*/* ;
+local install-requirements =
+    <install-source-root>boost
+    ;
+if $(layout-versioned)
+{
+    install-requirements += <install-header-subdir>boost-$(BOOST_VERSION_TAG)/boost ;
+}
+else
+{
+    install-requirements += <install-header-subdir>boost ;
+}
+if [ modules.peek : NT ]
+{
+    install-requirements += <install-default-prefix>C:/Boost ;
+}
+else if [ modules.peek : UNIX ]
+{
+    install-requirements += <install-default-prefix>/usr/local ;
+}
 
+local headers =
+    [ path.glob-tree boost : *.hpp *.ipp *.h *.inc : CVS ]
+    [ path.glob-tree boost/compatibility/cpp_c_headers : c* : CVS ]
+    ;
+
+
 # Complete install
-package.install install
-    : <install-source-root>. # No specific requirements
-    : # No binaries
-    : libs/$(libraries)/build
-    : [ glob $(dirs)/$(patterns) ]
+package.install install-proper
+    :   $(install-requirements) <install-no-version-symlinks>on
+    :
+    :   libs/$(libraries)/build
+    :   $(headers)
     ;
+explicit install-proper ;
 
 # Install just library.
-install stage : libs/$(libraries)/build
-  : <location>$(stage-locate)
-  ;
+install stage-proper
+    :   libs/$(libraries)/build
+    :   <location>$(stage-locate)/lib
+        <install-dependencies>on <install-type>LIB 
+        <install-no-version-symlinks>on
+    ;
+explicit stage-proper ;
 
+
+if $(layout-versioned) 
+  && ( [ modules.peek : NT ] || [ modules.peek : UNIX ] )
+{
+    rule make-unversioned-links ( project name ? : property-set : sources * )
+    {
+        local result ;
+        local filtered ;
+        local pattern ;        
+        local nt = [ modules.peek : NT ] ;
+        
+        # Collect the libraries that have the version number in 'filtered'.
+        for local s in $(sources)
+        {
+            local m ;
+            if $(nt)
+            {
+                m = [ MATCH "(.*[.]lib)" : [ $(s).name ] ] ;
+            }
+            else
+            {
+                m = [ MATCH "(.*[.]so[.0-9]+)" "(.*[.]a)" : [ $(s).name ] ] ;
+            }            
+            if $(m)
+            {
+                filtered += $(s) ;
+            }
+        }
+        
+        # Create hardlinks without version.
+        for local s in $(filtered)
+        {
+            local name = [ $(s).name ] ;
+            local ea = [ $(s).action ] ;
+            local ep = [ $(ea).properties ] ;
+            local a  = [
+              new non-scanning-action $(s) : common.hard-link : $(ep) ] ;
+            
+            local noversion-file ;
+            if $(nt)
+            {
+                noversion-file = [ MATCH "(.*)-[0-9_]+([.]lib)" : $(name) ] ;
+            }
+            else
+            {
+                noversion-file = 
+                  [ MATCH "(.*)-[0-9_]+([.]so)[.0-9]*" : $(name) ] 
+                  [ MATCH "(.*)-[0-9_]+([.]a)" : $(name) ] ;
+            }
+                        
+            local new-name = 
+               $(noversion-file[1])$(noversion-file[2]) ;
+            result += [ new file-target $(new-name) exact : [ $(s).type ] : $(project)
+                    : $(a) ] ;
+
+        }
+        return $(result) ;
+    }    
+            
+    generate stage-unversioned : stage-proper : 
+      <generating-rule>@make-unversioned-links ;
+    explicit stage-unversioned ;
+    
+    generate install-unversioned : install-proper : 
+      <generating-rule>@make-unversioned-links ;
+    explicit install-unversioned ;
+}
+else
+{
+    # Create do-nothing aliases
+    alias stage-unversioned ;
+    alias install-unversioned ;
+}
+
+alias install : install-proper install-unversioned ;
+alias stage : stage-proper stage-unversioned ;
+explicit install ;
+explicit stage ;
+
+
 # Just build the libraries, don't install them anywhere.
-# This is what happend with just "bjam --v2".
+# This is what happens with just "bjam --v2".
 alias build_all : libs/$(libraries)/build ;
 
 # This rule should be called from libraries' Jamfiles and will
@@ -270,7 +444,7 @@
 rule boost-install ( libraries * )
 {
     package.install install
-        : <dependency>/boost//install-headers
+        : <dependency>/boost//install-headers $(install-requirements)
         : # No binaries
         : $(libraries)
         : # No headers, it's handled by the dependency
@@ -286,8 +460,6 @@
     }
 }
 
-
-
 # Make project ids of all libraries known.
 for local l in $(libraries)
 {

Modified: boost/trunk/README
===================================================================
--- boost/trunk/README	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/README	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+Copyright 2000-2003 Beman Dawes
+Distributed under the Boost Software License, Version 1.0. (See accompany-
+ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 Unless otherwise specified, all Boost software and documentation is subject
 to the Boost Software License Version 1.0. See the accompanying file LICENSE_1_0.txt.
 A copy of the license is also available at http://www.boost.org/LICENSE_1_0.txt.

Modified: boost/trunk/boost/algorithm/string/detail/find_format.hpp
===================================================================
--- boost/trunk/boost/algorithm/string/detail/find_format.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/algorithm/string/detail/find_format.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -26,20 +26,17 @@
             template< 
                 typename OutputIteratorT,
                 typename InputT,
-                typename FinderT,
                 typename FormatterT,
                 typename FindResultT >
             inline OutputIteratorT find_format_copy_impl(
                 OutputIteratorT Output,
                 const InputT& Input,
-                FinderT Finder,
                 FormatterT Formatter,
                 const FindResultT& FindResult )
             {       
                 return find_format_copy_impl2( 
                     Output,
                     Input,
-                    Finder,
                     Formatter,
                     FindResult,
                     Formatter(FindResult) );
@@ -48,14 +45,12 @@
             template< 
                 typename OutputIteratorT,
                 typename InputT,
-                typename FinderT,
                 typename FormatterT,
                 typename FindResultT,
                 typename FormatResultT >
             inline OutputIteratorT find_format_copy_impl2(
                 OutputIteratorT Output,
                 const InputT& Input,
-                FinderT Finder,
                 FormatterT Formatter,
                 const FindResultT& FindResult,
                 const FormatResultT& FormatResult )
@@ -91,18 +86,15 @@
 
             template< 
                 typename InputT, 
-                typename FinderT,
                 typename FormatterT,
                 typename FindResultT >
             inline InputT find_format_copy_impl(
                 const InputT& Input,
-                FinderT Finder,
                 FormatterT Formatter,
                 const FindResultT& FindResult)
             {
                 return find_format_copy_impl2(
                     Input,
-                    Finder,
                     Formatter,
                     FindResult,
                     Formatter(FindResult) );
@@ -110,13 +102,11 @@
 
             template< 
                 typename InputT, 
-                typename FinderT,
                 typename FormatterT,
                 typename FindResultT,
                 typename FormatResultT >
             inline InputT find_format_copy_impl2(
                 const InputT& Input,
-                FinderT Finder,
                 FormatterT Formatter,
                 const FindResultT& FindResult,
                 const FormatResultT& FormatResult)
@@ -151,18 +141,15 @@
         
             template<
                 typename InputT,
-                typename FinderT,
                 typename FormatterT,
                 typename FindResultT >
             inline void find_format_impl( 
                 InputT& Input,
-                FinderT Finder,
                 FormatterT Formatter,
                 const FindResultT& FindResult)
             {
                 find_format_impl2(
                     Input,
-                    Finder,
                     Formatter,
                     FindResult,
                     Formatter(FindResult) );
@@ -170,13 +157,11 @@
 
             template<
                 typename InputT,
-                typename FinderT,
                 typename FormatterT,
                 typename FindResultT,
                 typename FormatResultT >
             inline void find_format_impl2( 
                 InputT& Input,
-                FinderT,
                 FormatterT Formatter,
                 const FindResultT& FindResult,
                 const FormatResultT& FormatResult)

Modified: boost/trunk/boost/algorithm/string/find_format.hpp
===================================================================
--- boost/trunk/boost/algorithm/string/find_format.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/algorithm/string/find_format.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -71,7 +71,6 @@
             return detail::find_format_copy_impl(
                 Output,
                 Input,
-                Finder,
                 Formatter,
                 Finder( begin(Input), end(Input) ) );
         }
@@ -100,7 +99,6 @@
 
             return detail::find_format_copy_impl(
                 Input,
-                Finder,
                 Formatter,
                 Finder(begin(Input), end(Input)));
         }
@@ -134,7 +132,6 @@
 
             detail::find_format_impl(
                 Input,
-                Finder,
                 Formatter,
                 Finder(begin(Input), end(Input)));
         }

Modified: boost/trunk/boost/algorithm/string/regex.hpp
===================================================================
--- boost/trunk/boost/algorithm/string/regex.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/algorithm/string/regex.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -584,8 +584,8 @@
 
             // Construct container to hold the result
             ResultT Result;
+                               
 
-
             // Roll to the first element that will be added
             while(
                 itBegin!=itEnd && 
@@ -630,6 +630,14 @@
     using algorithm::find_all_regex;
     using algorithm::split_regex;
 
+#ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
+    using algorithm::join_if;
+#else  // BOOST_NO_FUNCTION_TEMPLATE_ORDERING
+    using algorithm::join_if_regex;
+#endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING
+
+
+
 } // namespace boost
 
 

Modified: boost/trunk/boost/algorithm/string.hpp
===================================================================
--- boost/trunk/boost/algorithm/string.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/algorithm/string.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,6 +20,7 @@
 #include <boost/algorithm/string/predicate.hpp>
 #include <boost/algorithm/string/find.hpp>
 #include <boost/algorithm/string/split.hpp>
+#include <boost/algorithm/string/join.hpp>
 #include <boost/algorithm/string/replace.hpp>
 #include <boost/algorithm/string/erase.hpp>
 #include <boost/algorithm/string/classification.hpp>

Modified: boost/trunk/boost/any.hpp
===================================================================
--- boost/trunk/boost/any.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/any.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -168,13 +168,13 @@
     }
 
     template<typename ValueType>
-    inline const ValueType * any_cast(const any * operand)
+    const ValueType * any_cast(const any * operand)
     {
         return any_cast<ValueType>(const_cast<any *>(operand));
     }
 
     template<typename ValueType>
-    ValueType any_cast(any & operand)
+    ValueType any_cast(const any & operand)
     {
         typedef BOOST_DEDUCED_TYPENAME remove_reference<ValueType>::type nonref;
 
@@ -188,14 +188,14 @@
         BOOST_STATIC_ASSERT(!is_reference<nonref>::value);
 #endif
 
-        nonref * result = any_cast<nonref>(&operand);
+        const nonref * result = any_cast<nonref>(&operand);
         if(!result)
             boost::throw_exception(bad_any_cast());
         return *result;
     }
 
     template<typename ValueType>
-    inline ValueType any_cast(const any & operand)
+    ValueType any_cast(any & operand)
     {
         typedef BOOST_DEDUCED_TYPENAME remove_reference<ValueType>::type nonref;
 
@@ -205,7 +205,10 @@
         BOOST_STATIC_ASSERT(!is_reference<nonref>::value);
 #endif
 
-        return any_cast<const nonref &>(const_cast<any &>(operand));
+        nonref * result = any_cast<nonref>(&operand);
+        if(!result)
+            boost::throw_exception(bad_any_cast());
+        return *result;
     }
 
     // Note: The "unsafe" versions of any_cast are not part of the
@@ -214,15 +217,15 @@
     // use typeid() comparison, e.g., when our types may travel across
     // different shared libraries.
     template<typename ValueType>
-    ValueType * unsafe_any_cast(any * operand)
+    inline ValueType * unsafe_any_cast(any * operand)
     {
         return &static_cast<any::holder<ValueType> *>(operand->content)->held;
     }
 
     template<typename ValueType>
-    const ValueType * unsafe_any_cast(const any * operand)
+    inline const ValueType * unsafe_any_cast(const any * operand)
     {
-        return any_cast<ValueType>(const_cast<any *>(operand));
+        return unsafe_any_cast<ValueType>(const_cast<any *>(operand));
     }
 }
 

Modified: boost/trunk/boost/archive/add_facet.hpp
===================================================================
--- boost/trunk/boost/archive/add_facet.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/add_facet.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,8 +21,7 @@
 #include <boost/detail/workaround.hpp>
 
 // does STLport uses native STL for locales?
-#if (defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)) \
-&& defined(_STLP_NO_OWN_IOSTREAMS)
+#if (defined(__SGI_STL_PORT)&& defined(_STLP_NO_OWN_IOSTREAMS))
 // and this native STL lib is old Dinkumware (has not defined _CPPLIB_VER)
 #  if (defined(_YVALS) && !defined(__IBMCPP__)) || !defined(_CPPLIB_VER)
 #    define BOOST_ARCHIVE_OLD_DINKUMWARE_BENEATH_STLPORT

Modified: boost/trunk/boost/archive/basic_archive.hpp
===================================================================
--- boost/trunk/boost/archive/basic_archive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/basic_archive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -117,4 +117,14 @@
 BOOST_CLASS_IMPLEMENTATION(boost::archive::object_reference_type, primitive_type)
 BOOST_CLASS_IMPLEMENTATION(boost::archive::tracking_type, primitive_type)
 
+/////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
+// Make sure that the export.hpp header isn't included before any archive header
+// Doing so would inhibit construction of correct mpl list of known archive
+// types which in turn would inhibit instantiation of all combinations of
+// serialization/archive types.
+
+#ifdef BOOST_SERIALIZATION_EXPORT_HPP
+#error "export.hpp must not be included before any archive header"
+#endif
+
 #endif //BOOST_ARCHIVE_BASIC_ARCHIVE_HPP

Modified: boost/trunk/boost/archive/basic_binary_iarchive.hpp
===================================================================
--- boost/trunk/boost/archive/basic_binary_iarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/basic_binary_iarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -30,7 +30,6 @@
 
 #include <boost/archive/detail/common_iarchive.hpp>
 #include <boost/serialization/string.hpp>
-#include <boost/serialization/collection_size_type.hpp>
 
 #include <boost/archive/detail/abi_prefix.hpp> // must be the last header
 
@@ -103,11 +102,6 @@
         * this->This() >> x;
         t = (0 != x);
     }
-  void load_override(serialization::collection_size_type & t, int){
-       unsigned int x;
-       * this->This() >> x;
-       t = serialization::collection_size_type(x);
-   }
 
     BOOST_ARCHIVE_OR_WARCHIVE_DECL(void)
     load_override(class_name_type & t, int);

Modified: boost/trunk/boost/archive/basic_binary_iprimitive.hpp
===================================================================
--- boost/trunk/boost/archive/basic_binary_iprimitive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/basic_binary_iprimitive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -86,7 +86,6 @@
         load_binary(& t, sizeof(t));
         int i = t;
         assert(0 == i || 1 == i);
-        (void)i; // warning suppression for release builds.
     }
     BOOST_ARCHIVE_OR_WARCHIVE_DECL(void)
     load(std::string &s);

Modified: boost/trunk/boost/archive/basic_binary_oarchive.hpp
===================================================================
--- boost/trunk/boost/archive/basic_binary_oarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/basic_binary_oarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -29,7 +29,6 @@
 #include <boost/detail/workaround.hpp>
 #include <boost/archive/detail/common_oarchive.hpp>
 #include <boost/serialization/string.hpp>
-#include <boost/serialization/collection_size_type.hpp>
 
 namespace boost {
 namespace archive {
@@ -105,12 +104,6 @@
         * this->This() << s;
     }
 
-    void save_override(const serialization::collection_size_type & t, int){
-    // for backward compatibility, 64 bit integer or variable length integer would be preferred
-        unsigned int x = t.t;
-        * this->This() << x;
-   }
-
     BOOST_ARCHIVE_OR_WARCHIVE_DECL(void)
     init();
 

Modified: boost/trunk/boost/archive/basic_text_iarchive.hpp
===================================================================
--- boost/trunk/boost/archive/basic_text_iarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/basic_text_iarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -61,6 +61,16 @@
     {
         this->detail_common_iarchive::load_override(t, 0);
     }
+
+    // Borland compilers has a problem with strong type.  Try to fix this here
+    #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x582))
+    void load_override(version_type & t, int){ 
+        unsigned int x;
+        * this->This() >> x;
+        t.t = version_type(x);
+    }
+    #endif
+
     // text file don't include the optional information 
     void load_override(class_id_optional_type & /*t*/, int){}
 

Modified: boost/trunk/boost/archive/basic_text_oarchive.hpp
===================================================================
--- boost/trunk/boost/archive/basic_text_oarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/basic_text_oarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -91,9 +91,26 @@
     // text file don't include the optional information 
     void save_override(const class_id_optional_type & /* t */, int){}
 
+    // note the following four overrides are necessary for some borland
+    // compilers which don't handle BOOST_STRONG_TYPE properly.
+    void save_override(const version_type & t, int){
+        // note:t.t resolves borland ambguity
+        unsigned int x = t.t;
+        * this->This() << x;
+    }
+    void save_override(const class_id_type & t, int){
+        // note:t.t resolves borland ambguity
+        int x = t.t;
+        * this->This() << x;
+    }
+    void save_override(const class_id_reference_type & t, int){
+        // note:t.t resolves borland ambguity
+        int x = t.t;
+        * this->This() << x;
+    }
     void save_override(const class_name_type & t, int){
-                const std::string s(t);
-                * this->This() << s;
+        const std::string s(t);
+        * this->This() << s;
     }
 
     BOOST_ARCHIVE_OR_WARCHIVE_DECL(void)

Modified: boost/trunk/boost/archive/basic_xml_iarchive.hpp
===================================================================
--- boost/trunk/boost/archive/basic_xml_iarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/basic_xml_iarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,7 +9,7 @@
 /////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
 // basic_xml_iarchive.hpp
 
-// (C) Copyright 2002 Robert Ramey - http://www.rrsd.com .
+// (C) Copyright 2002 Robert Ramey - http://www.rrsd.com . 
 // Use, modification and distribution is subject to the Boost Software
 // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
@@ -25,8 +25,6 @@
 #include <boost/serialization/nvp.hpp>
 #include <boost/serialization/string.hpp>
 
-#include <boost/mpl/assert.hpp>
-
 #include <boost/archive/detail/abi_prefix.hpp> // must be the last header
 
 namespace boost {
@@ -35,7 +33,7 @@
 /////////////////////////////////////////////////////////////////////////
 // class xml_iarchive - read serialized objects from a input text stream
 template<class Archive>
-class basic_xml_iarchive :
+class basic_xml_iarchive : 
     public detail::common_iarchive<Archive>
 {
 protected:
@@ -62,8 +60,7 @@
         // If your program fails to compile here, its most likely due to
         // not specifying an nvp wrapper around the variable to
         // be serialized.
-        BOOST_MPL_ASSERT((serialization::is_wrapper<T>));
-        this->detail_common_iarchive::load_override(t, 0);
+        BOOST_STATIC_ASSERT(0 == sizeof(T));
     }
 
     // Anything not an attribute - see below - should be a name value
@@ -74,7 +71,7 @@
         #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
         const
         #endif
-        boost::serialization::nvp<T> & t,
+        boost::serialization::nvp<T> & t, 
         int
     ){
         load_start(t.name());
@@ -104,9 +101,9 @@
     // handle this.
     // void load_override(class_name_type & t, int);
 
-    BOOST_ARCHIVE_OR_WARCHIVE_DECL(BOOST_PP_EMPTY())
+    BOOST_ARCHIVE_OR_WARCHIVE_DECL(BOOST_PP_EMPTY()) 
     basic_xml_iarchive(unsigned int flags);
-    BOOST_ARCHIVE_OR_WARCHIVE_DECL(BOOST_PP_EMPTY())
+    BOOST_ARCHIVE_OR_WARCHIVE_DECL(BOOST_PP_EMPTY()) 
     ~basic_xml_iarchive();
 };
 

Modified: boost/trunk/boost/archive/basic_xml_oarchive.hpp
===================================================================
--- boost/trunk/boost/archive/basic_xml_oarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/basic_xml_oarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,7 +9,7 @@
 /////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
 // basic_xml_oarchive.hpp
 
-// (C) Copyright 2002 Robert Ramey - http://www.rrsd.com .
+// (C) Copyright 2002 Robert Ramey - http://www.rrsd.com . 
 // Use, modification and distribution is subject to the Boost Software
 // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
@@ -24,18 +24,15 @@
 #include <boost/serialization/tracking.hpp>
 #include <boost/serialization/string.hpp>
 
-#include <boost/mpl/assert.hpp>
-
 #include <boost/archive/detail/abi_prefix.hpp> // must be the last header
 
-
-namespace boost {
+namespace boost { 
 namespace archive {
-
+        
 //////////////////////////////////////////////////////////////////////
 // class basic_xml_oarchive - write serialized objects to a xml output stream
 template<class Archive>
-class basic_xml_oarchive :
+class basic_xml_oarchive : 
     public detail::common_oarchive<Archive>
 {
 protected:
@@ -58,13 +55,13 @@
     init();
     BOOST_ARCHIVE_OR_WARCHIVE_DECL(void)
     write_attribute(
-        const char *attribute_name,
+        const char *attribute_name, 
         int t,
         const char *conjunction = "=\""
     );
     BOOST_ARCHIVE_OR_WARCHIVE_DECL(void)
     write_attribute(
-        const char *attribute_name,
+        const char *attribute_name, 
         const char *key
     );
     // helpers used below
@@ -83,8 +80,7 @@
         // If your program fails to compile here, its most likely due to
         // not specifying an nvp wrapper around the variable to
         // be serialized.
-        BOOST_MPL_ASSERT((serialization::is_wrapper<T>));
-        this->detail_common_oarchive::save_override(t, 0);
+        BOOST_STATIC_ASSERT(0 == sizeof(T));
     }
 
    // special treatment for name-value pairs.
@@ -94,7 +90,7 @@
         #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
         const
         #endif
-        ::boost::serialization::nvp<T> & t,
+        ::boost::serialization::nvp<T> & t, 
         int
     ){
         save_start(t.name());
@@ -121,9 +117,9 @@
     BOOST_ARCHIVE_OR_WARCHIVE_DECL(void)
     save_override(const tracking_type & t, int);
 
-    BOOST_ARCHIVE_OR_WARCHIVE_DECL(BOOST_PP_EMPTY())
+    BOOST_ARCHIVE_OR_WARCHIVE_DECL(BOOST_PP_EMPTY()) 
     basic_xml_oarchive(unsigned int flags);
-    BOOST_ARCHIVE_OR_WARCHIVE_DECL(BOOST_PP_EMPTY())
+    BOOST_ARCHIVE_OR_WARCHIVE_DECL(BOOST_PP_EMPTY()) 
     ~basic_xml_oarchive();
 };
 

Modified: boost/trunk/boost/archive/binary_iarchive.hpp
===================================================================
--- boost/trunk/boost/archive/binary_iarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/binary_iarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -50,6 +50,6 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(boost::archive::binary_iarchive)
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(boost::archive::binary_iarchive)
 
 #endif // BOOST_ARCHIVE_BINARY_IARCHIVE_HPP

Modified: boost/trunk/boost/archive/binary_oarchive.hpp
===================================================================
--- boost/trunk/boost/archive/binary_oarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/binary_oarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -48,6 +48,6 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(boost::archive::binary_oarchive)
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(boost::archive::binary_oarchive)
 
 #endif // BOOST_ARCHIVE_BINARY_OARCHIVE_HPP

Modified: boost/trunk/boost/archive/binary_wiarchive.hpp
===================================================================
--- boost/trunk/boost/archive/binary_wiarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/binary_wiarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -53,7 +53,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(boost::archive::binary_wiarchive)
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(boost::archive::binary_wiarchive)
 
 #endif // BOOST_NO_STD_WSTREAMBUF
 #endif // BOOST_ARCHIVE_BINARY_WIARCHIVE_HPP

Modified: boost/trunk/boost/archive/binary_woarchive.hpp
===================================================================
--- boost/trunk/boost/archive/binary_woarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/binary_woarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -53,7 +53,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(boost::archive::binary_woarchive)
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(boost::archive::binary_woarchive)
 
 #endif // BOOST_NO_STD_WSTREAMBUF
 #endif // BOOST_ARCHIVE_BINARY_WOARCHIVE_HPP

Modified: boost/trunk/boost/archive/codecvt_null.hpp
===================================================================
--- boost/trunk/boost/archive/codecvt_null.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/codecvt_null.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -26,7 +26,7 @@
         using ::mbstate_t;
     #elif defined(__QNXNTO__)
         using std::mbstate_t;
-    #elif defined(BOOST_DINKUMWARE_STDLIB) && ! defined(__BORLANDC__) 
+    #elif defined(BOOST_DINKUMWARE_STDLIB) && BOOST_DINKUMWARE_STDLIB == 1
         using ::mbstate_t;
     #elif defined(__SGI_STL_PORT)
     #elif defined(BOOST_NO_STDC_NAMESPACE)
@@ -87,44 +87,4 @@
 } // namespace archive
 } // namespace boost
 
-// this befuddles the msvc 6 compiler so we can't use it
-#if ! ((defined _MSC_VER) && (_MSC_VER <= 1300)) \
-&&  ! defined(__BORLANDC__)
-
-#if defined(__SGI_STL_PORT)
-#if defined(_STLPORT_VERSION) && (_STLPORT_VERSION < 0x500)
-namespace std {
-
-#if 0
-template <>
-locale::locale(
-    const locale& __loc,
-    boost::archive::codecvt_null<char> * __f
-){
-     _M_impl = 0;
-    //      _M_impl = this->_S_copy_impl(__loc._M_impl, __f != 0);
-    new(this) locale(__loc._M_impl, __f != 0);
-    if (__f != 0)
-        this->_M_insert(__f, boost::archive::codecvt_null<char> ::id);
-}
-
-template <>
-locale::locale(
-    const locale& __loc,
-    boost::archive::codecvt_null<wchar_t> * __f
-){
-     _M_impl = 0;
-    //      _M_impl = this->_S_copy_impl(__loc._M_impl, __f != 0);
-    new(this) locale(__loc._M_impl, __f != 0);
-    if (__f != 0)
-        this->_M_insert(__f, boost::archive::codecvt_null<wchar_t> ::id);
-}
-#endif
-
-} // namespace std
-#endif
-#endif
-
-#endif
-
 #endif //BOOST_ARCHIVE_CODECVT_NULL_HPP

Modified: boost/trunk/boost/archive/detail/common_iarchive.hpp
===================================================================
--- boost/trunk/boost/archive/detail/common_iarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/detail/common_iarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,7 +19,6 @@
 #include <boost/archive/detail/basic_iarchive.hpp>
 #include <boost/archive/detail/interface_iarchive.hpp>
 #include <boost/archive/detail/iserializer.hpp>
-#include <boost/archive/detail/register_archive.hpp>
 #include <boost/pfto.hpp>
 
 namespace boost {

Modified: boost/trunk/boost/archive/detail/common_oarchive.hpp
===================================================================
--- boost/trunk/boost/archive/detail/common_oarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/detail/common_oarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,7 +19,6 @@
 #include <boost/archive/detail/basic_oarchive.hpp>
 #include <boost/archive/detail/interface_oarchive.hpp>
 #include <boost/archive/detail/oserializer.hpp>
-#include <boost/archive/detail/register_archive.hpp>
 
 namespace boost {
 namespace archive {

Deleted: boost/trunk/boost/archive/detail/dynamically_initialized.hpp
===================================================================
--- boost/trunk/boost/archive/detail/dynamically_initialized.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/detail/dynamically_initialized.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,39 +0,0 @@
-// 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)
-#ifndef BOOST_ARCHIVE_DETAIL_DYNAMICALLY_INITIALIZED_DWA2006524_HPP
-# define BOOST_ARCHIVE_DETAIL_DYNAMICALLY_INITIALIZED_DWA2006524_HPP
-
-# include <boost/serialization/force_include.hpp>
-
-namespace boost { namespace archive { namespace detail { 
-
-//
-// Provides a dynamically-initialized (singleton) instance of T in a
-// way that avoids LNK1179 on vc6.  See http://tinyurl.com/ljdp8 or
-// http://lists.boost.org/Archives/boost/2006/05/105286.php for
-// details.
-//
-template <class T>
-struct dynamically_initialized
-{
-    static BOOST_DLLEXPORT T& instance;
-    
- private:
-    static BOOST_DLLEXPORT T& get_instance();
-};
-
-template <class T>
-BOOST_DLLEXPORT T& dynamically_initialized<T>::instance
-  = dynamically_initialized<T>::get_instance();
-
-template <class T>
-BOOST_DLLEXPORT T& dynamically_initialized<T>::get_instance()
-{
-    static T instance_;
-    return instance_;
-}
-
-}}} // namespace boost::archive::detail
-
-#endif // BOOST_ARCHIVE_DETAIL_DYNAMICALLY_INITIALIZED_DWA2006524_HPP

Modified: boost/trunk/boost/archive/detail/iserializer.hpp
===================================================================
--- boost/trunk/boost/archive/detail/iserializer.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/detail/iserializer.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -44,7 +44,6 @@
 #include <boost/type_traits/is_enum.hpp>
 #include <boost/type_traits/is_const.hpp>
 #include <boost/type_traits/remove_const.hpp>
-#include <boost/type_traits/remove_all_extents.hpp>
 #include <boost/serialization/is_abstract.hpp>
 
 #include <boost/mpl/eval_if.hpp>
@@ -58,7 +57,6 @@
 #include <boost/mpl/list.hpp>
 #include <boost/mpl/empty.hpp>
 #include <boost/mpl/not.hpp>
-#include <boost/mpl/bool.hpp>
 
  #ifndef BOOST_SERIALIZATION_DEFAULT_TYPE_INFO   
      #include <boost/serialization/extended_type_info_typeid.hpp>   
@@ -67,7 +65,7 @@
 #include <boost/archive/detail/basic_iarchive.hpp>
 #include <boost/archive/detail/basic_iserializer.hpp>
 #include <boost/archive/detail/archive_pointer_iserializer.hpp>
-#include <boost/archive/detail/dynamically_initialized.hpp>
+#include <boost/archive/archive_exception.hpp>
 
 #include <boost/serialization/force_include.hpp>
 #include <boost/serialization/serialization.hpp>
@@ -78,8 +76,7 @@
 #include <boost/serialization/nvp.hpp>
 #include <boost/serialization/binary_object.hpp>
 #include <boost/serialization/void_cast.hpp>
-#include <boost/serialization/array.hpp>
-#include <boost/serialization/collection_size_type.hpp>
+
 namespace boost {
 
 namespace serialization {
@@ -165,10 +162,11 @@
     );
 }
 
-template<class Archive, class T>
-class pointer_iserializer
-  : public archive_pointer_iserializer<Archive>
-  , public dynamically_initialized<pointer_iserializer<Archive,T> >
+// instantiation of this template creates a static object.  Note inversion of
+// normal argument order to workaround bizarre error in MSVC 6.0 which only
+// manifests iftself during compiler time.
+template<class T, class Archive>
+class pointer_iserializer : public archive_pointer_iserializer<Archive> 
 {
 private:
     virtual const basic_iserializer & get_basic_serializer() const {
@@ -184,17 +182,32 @@
 #endif
     // private constructor to inhibit any existence other than the 
     // static one.  Note GCC doesn't permit constructor to be private
-    BOOST_DLLEXPORT pointer_iserializer() BOOST_USED;
-    friend class dynamically_initialized<pointer_iserializer<Archive,T> >;
+    explicit BOOST_DLLEXPORT pointer_iserializer() BOOST_USED;
+    static const pointer_iserializer instance;
 public:
     // at least one compiler (CW) seems to require that serialize_adl
     // be explicitly instantiated. Still under investigation. 
-    #if !defined(__BORLANDC__)
+    #if ! BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x582))
     void (* const m)(Archive &, T &, const unsigned);
     boost::serialization::extended_type_info * (* e)();
     #endif
+    static BOOST_DLLEXPORT const pointer_iserializer & instantiate() BOOST_USED;
+    virtual ~pointer_iserializer(){};
 };
 
+template<class T, class Archive>
+BOOST_DLLEXPORT const pointer_iserializer<T, Archive> & 
+pointer_iserializer<T, Archive>::instantiate() {
+    return instance;
+}
+
+// note: instances of this template to be constructed before the main
+// is called in order for things to be initialized properly.  For this
+// reason, hiding the instance in a static function as was done above
+// won't work here so we created a free instance here.
+template<class T, class Archive>
+const pointer_iserializer<T, Archive> pointer_iserializer<T, Archive>::instance;
+
 // note trick to be sure that operator new is using class specific
 // version if such exists. Due to Peter Dimov.
 // note: the following fails if T has no default constructor.
@@ -265,15 +278,19 @@
     T* m_p;
 };
 
-template<class Archive, class T>
-BOOST_DLLEXPORT void pointer_iserializer<Archive, T>::load_object_ptr(
+template<class T, class Archive>
+BOOST_DLLEXPORT void pointer_iserializer<T, Archive>::load_object_ptr(
     basic_iarchive & ar, 
     void * & x,
     const unsigned int file_version
-) const
-{
+) const {
     Archive & ar_impl = boost::smart_cast_reference<Archive &>(ar);
 
+//    if(0 != (ar.get_flags() & no_object_creation)){
+//        ar_impl >> boost::serialization::make_nvp(NULL, * static_cast<T *>(x));
+//        return;
+//    }
+
     auto_ptr_with_deleter<T> ap(heap_allocator<T>::invoke());
     if(NULL == ap.get())
         boost::throw_exception(std::bad_alloc()) ;
@@ -303,16 +320,16 @@
     ap.release();
 }
 
-template<class Archive, class T>
-#if !defined(__BORLANDC__)
-BOOST_DLLEXPORT pointer_iserializer<Archive, T>::pointer_iserializer() :
+template<class T, class Archive>
+#if ! BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x582))
+BOOST_DLLEXPORT pointer_iserializer<T, Archive>::pointer_iserializer() :
     archive_pointer_iserializer<Archive>(
         * boost::serialization::type_info_implementation<T>::type::get_instance()
     ),
     m(boost::serialization::serialize_adl<Archive, T>),
     e(boost::serialization::type_info_implementation<T>::type::get_instance)
 #else
-BOOST_DLLEXPORT pointer_iserializer<Archive, T>::pointer_iserializer() :
+BOOST_DLLEXPORT pointer_iserializer<T, Archive>::pointer_iserializer() :
     archive_pointer_iserializer<Archive>(
         * boost::serialization::type_info_implementation<T>::type::get_instance()
     )
@@ -489,8 +506,6 @@
 template<class Archive, class T>
 struct load_array_type {
     static void invoke(Archive &ar, T &t){
-        typedef typename remove_all_extents<T>::type value_type;
-        
         // convert integers to correct enum to load
         int current_count = sizeof(t) / (
             static_cast<char *>(static_cast<void *>(&t[1])) 
@@ -502,11 +517,12 @@
             boost::throw_exception(archive::archive_exception(
                 boost::archive::archive_exception::array_size_too_short
             ));
-        ar >> serialization::make_array(static_cast<value_type*>(&t[0]),count);
+        int i;
+        for(i = 0; i < count; ++i)
+            ar >> boost::serialization::make_nvp("item", t[i]);
     }
 };
 
-
 // note bogus arguments to workaround msvc 6 silent runtime failure
 template<class Archive, class T>
 BOOST_DLLEXPORT 
@@ -523,7 +539,9 @@
     Archive * /* ar = NULL */,
     T * /* t = NULL */
 ){
-    return pointer_iserializer<Archive,T>::instance;
+    // note: reversal of order of arguments to work around msvc 6.0 bug
+    // that manifests itself while trying to link.
+    return pointer_iserializer<T, Archive>::instantiate();
 }
 
 } // detail
@@ -554,7 +572,7 @@
 
 // BORLAND
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x560))
-// borland has a couple of problems
+// borland has a couple fo problems
 // a) if function is partiall specialized - see below
 // const paramters are transformed to non-const ones
 // b) implementation of base_object can't be made to work
@@ -567,19 +585,21 @@
 }
 #endif
 
-// let wrappers through.
+// let wrappers through.  (Someday implement is_wrapper)
 #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 template<class Archive, class T>
-inline void load_wrapper(Archive &ar, const T&t, mpl::true_){
-  boost::archive::load(ar, const_cast<T&>(t));
+inline void load(Archive &ar, const serialization::nvp<T> &t){
+        boost::archive::load(ar, const_cast<serialization::nvp<T> &>(t));
 }
+template<class Archive>
+inline void load(Archive &ar, const serialization::binary_object &t){
+        boost::archive::load(ar, const_cast<serialization::binary_object &>(t));
+}
 
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x560))
-template<class Archive, class T>
-inline void load(Archive &ar, const T&t){
-  load_wrapper(ar,t,serialization::is_wrapper<T>());
-}
-#endif 
+//template<class Archive, class T>
+//inline void load(Archive &ar, const serialization::binary_object &t){
+//      load(ar, const_cast<binary_object &>(t));
+//}
 #endif
 
 } // namespace archive

Modified: boost/trunk/boost/archive/detail/known_archive_types.hpp
===================================================================
--- boost/trunk/boost/archive/detail/known_archive_types.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/detail/known_archive_types.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -76,12 +76,6 @@
                 #if defined(BOOST_ARCHIVE_POLYMORPHIC_IARCHIVE_HPP)
                     , boost::archive::polymorphic_iarchive
                 #endif
-                #if defined(BOOST_ARCHIVE_ARRAY_BINARY_OARCHIVE_HPP)
-                    , boost::archive::array::binary_oarchive
-                #endif
-                #if defined(BOOST_ARCHIVE_ARRAY_BINARY_IARCHIVE_HPP)
-                    , boost::archive::array::binary_iarchive
-                #endif
                 #if defined(BOOST_ARCHIVE_CUSTOM_IARCHIVE_TYPES)
                     , BOOST_ARCHIVE_CUSTOM_IARCHIVE_TYPES
                 #endif

Modified: boost/trunk/boost/archive/detail/oserializer.hpp
===================================================================
--- boost/trunk/boost/archive/detail/oserializer.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/detail/oserializer.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -37,7 +37,6 @@
 #include <boost/type_traits/is_volatile.hpp>
 #include <boost/type_traits/is_const.hpp>
 #include <boost/type_traits/is_same.hpp>
-#include <boost/type_traits/remove_all_extents.hpp>
 #include <boost/serialization/is_abstract.hpp>
 
 #include <boost/mpl/eval_if.hpp>
@@ -58,7 +57,6 @@
 #include <boost/archive/detail/basic_oarchive.hpp>
 #include <boost/archive/detail/basic_oserializer.hpp>
 #include <boost/archive/detail/archive_pointer_oserializer.hpp>
-#include <boost/archive/detail/dynamically_initialized.hpp>
 
 #include <boost/serialization/force_include.hpp>
 #include <boost/serialization/serialization.hpp>
@@ -68,8 +66,6 @@
 #include <boost/serialization/type_info_implementation.hpp>
 #include <boost/serialization/nvp.hpp>
 #include <boost/serialization/void_cast.hpp>
-#include <boost/serialization/array.hpp>
-#include <boost/serialization/collection_size_type.hpp>
 
 #include <boost/archive/archive_exception.hpp>
 
@@ -104,7 +100,7 @@
 private:
     // private constructor to inhibit any existence other than the 
     // static one
-    explicit BOOST_DLLEXPORT oserializer() :
+    explicit oserializer() :
         basic_oserializer(
             * boost::serialization::type_info_implementation<T>::type::get_instance()
         )
@@ -155,10 +151,11 @@
     );
 }
 
-template<class Archive, class T>
-class pointer_oserializer
-  : public archive_pointer_oserializer<Archive>
-  , public dynamically_initialized<pointer_oserializer<Archive,T> >
+// instantiation of this template creates a static object.  Note inversion of
+// normal argument order to workaround bizarre error in MSVC 6.0 which only
+// manifests iftself during compiler time.
+template<class T, class Archive>
+class pointer_oserializer : public archive_pointer_oserializer<Archive> 
 {
 private:
     virtual const basic_oserializer & get_basic_serializer() const {
@@ -174,18 +171,33 @@
     // private constructor to inhibit any existence other than the 
     // static one.  Note GCC doesn't permit constructor to be private
     explicit BOOST_DLLEXPORT pointer_oserializer() BOOST_USED;
-    friend class dynamically_initialized<pointer_oserializer<Archive,T> >;
+    static const pointer_oserializer instance;
 public:
-    #if !defined(__BORLANDC__)
+    #if ! BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x582))
     // at least one compiler (CW) seems to require that serialize_adl
     // be explicitly instantiated. Still under investigation. 
     void (* const m)(Archive &, T &, const unsigned);
     boost::serialization::extended_type_info * (* e)();
     #endif
+    static BOOST_DLLEXPORT const pointer_oserializer & instantiate() BOOST_USED;
+    virtual ~pointer_oserializer(){}
 };
 
-template<class Archive, class T>
-BOOST_DLLEXPORT void pointer_oserializer<Archive, T>::save_object_ptr(
+template<class T, class Archive>
+BOOST_DLLEXPORT const pointer_oserializer<T, Archive> & 
+pointer_oserializer<T, Archive>::instantiate(){
+    return instance;
+}
+
+// note: instances of this template to be constructed before the main
+// is called in order for things to be initialized properly.  For this
+// reason, hiding the instance in a static function as was done above
+// won't work here so we created a free instance here.
+template<class T, class Archive>
+const pointer_oserializer<T, Archive> pointer_oserializer<T, Archive>::instance;
+
+template<class T, class Archive>
+BOOST_DLLEXPORT void pointer_oserializer<T, Archive>::save_object_ptr(
     basic_oarchive & ar,
     const void * x
 ) const {
@@ -203,16 +215,16 @@
     ar_impl << boost::serialization::make_nvp(NULL, * t);
 }
 
-template<class Archive, class T>
-#if !defined(__BORLANDC__)
-BOOST_DLLEXPORT pointer_oserializer<Archive, T>::pointer_oserializer() :
+template<class T, class Archive>
+#if ! BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x582))
+BOOST_DLLEXPORT pointer_oserializer<T, Archive>::pointer_oserializer() :
     archive_pointer_oserializer<Archive>(
         * boost::serialization::type_info_implementation<T>::type::get_instance()
     ),
     m(boost::serialization::serialize_adl<Archive, T>),
     e(boost::serialization::type_info_implementation<T>::type::get_instance)
 #else
-BOOST_DLLEXPORT pointer_oserializer<Archive, T>::pointer_oserializer() :
+BOOST_DLLEXPORT pointer_oserializer<T, Archive>::pointer_oserializer() :
     archive_pointer_oserializer<Archive>(
         * boost::serialization::type_info_implementation<T>::type::get_instance()
     )
@@ -469,8 +481,6 @@
 struct save_array_type
 {
     static void invoke(Archive &ar, const T &t){
-        typedef typename remove_all_extents<T>::type value_type;
-        
         save_access::end_preamble(ar);
         // consider alignment
         int count = sizeof(t) / (
@@ -478,12 +488,12 @@
             - static_cast<const char *>(static_cast<const void *>(&t[0]))
         );
         ar << BOOST_SERIALIZATION_NVP(count);
-        ar << serialization::make_array(static_cast<value_type const*>(&t[0]),count);
+        int i;
+        for(i = 0; i < count; ++i)
+            ar << boost::serialization::make_nvp("item", t[i]);
     }
 };
 
-
-
 // note bogus arguments to workaround msvc 6 silent runtime failure
 // declaration to satisfy gcc
 template<class Archive, class T>
@@ -499,7 +509,9 @@
     Archive * /* ar = NULL */,
     T * /* t = NULL */
 ){
-    return pointer_oserializer<Archive, T>::instance;
+    // note: reversal of order of arguments to work around msvc 6.0 bug
+    // that manifests itself while trying to link.
+    return pointer_oserializer<T, Archive>::instantiate();
 }
 
 } // detail

Modified: boost/trunk/boost/archive/detail/polymorphic_iarchive_impl.hpp
===================================================================
--- boost/trunk/boost/archive/detail/polymorphic_iarchive_impl.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/detail/polymorphic_iarchive_impl.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -174,7 +174,7 @@
                 ArchiveImplementation::insert_basic_helper(eti, sph);
         }
 public:
-    // this can't be inheriteded because they appear in mulitple
+    // this can't be inherited because they appear in mulitple
     // parents
     typedef mpl::bool_<true> is_loading;
     typedef mpl::bool_<false> is_saving;

Modified: boost/trunk/boost/archive/detail/polymorphic_oarchive_impl.hpp
===================================================================
--- boost/trunk/boost/archive/detail/polymorphic_oarchive_impl.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/detail/polymorphic_oarchive_impl.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -164,7 +164,7 @@
                 ArchiveImplementation::insert_basic_helper(eti, sph);
         }
 public:
-    // this can't be inheriteded because they appear in mulitple
+    // this can't be inherited because they appear in mulitple
     // parents
     typedef mpl::bool_<false> is_loading;
     typedef mpl::bool_<true> is_saving;

Deleted: boost/trunk/boost/archive/detail/register_archive.hpp
===================================================================
--- boost/trunk/boost/archive/detail/register_archive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/detail/register_archive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,47 +0,0 @@
-// 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)
-#ifndef BOOST_ARCHIVE_DETAIL_REGISTER_ARCHIVE_DWA2006521_HPP
-# define BOOST_ARCHIVE_DETAIL_REGISTER_ARCHIVE_DWA2006521_HPP
-
-# include <boost/type_traits/add_pointer.hpp>
-
-namespace boost { namespace archive { namespace detail { 
-
-template <class Archive, class Serializable>
-struct ptr_serialization_support;
-
-// We could've just used ptr_serialization_support, above, but using
-// it with only a forward declaration causes vc6/7 to complain about a
-// missing instantiate member, even if it has one.  This is just a
-// friendly layer of indirection.
-template <class Archive, class Serializable>
-struct _ptr_serialization_support
-  : ptr_serialization_support<Archive,Serializable>
-{
-    typedef int type;
-};
-
-// This function gets called, but its only purpose is to participate
-// in overload resolution with the functions declared by
-// BOOST_SERIALIZATION_REGISTER_ARCHIVE, below.
-template <class Serializable>
-void instantiate_ptr_serialization(Serializable*, int) {}
-
-// The function declaration generated by this macro never actually
-// gets called, but its return type gets instantiated, and that's
-// enough to cause registration of serialization functions between
-// Archive and any exported Serializable type.  See also:
-// boost/serialization/export.hpp
-# define BOOST_SERIALIZATION_REGISTER_ARCHIVE(Archive)                  \
-namespace boost { namespace archive { namespace detail {                \
-                                                                        \
-template <class Serializable>                                           \
-typename _ptr_serialization_support<Archive, Serializable>::type        \
-instantiate_ptr_serialization( Serializable*, Archive* );               \
-                                                                        \
-}}}
-
-}}} // namespace boost::archive::detail
-
-#endif // BOOST_ARCHIVE_DETAIL_INSTANTIATE_SERIALIZE_DWA2006521_HPP

Modified: boost/trunk/boost/archive/dinkumware.hpp
===================================================================
--- boost/trunk/boost/archive/dinkumware.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/dinkumware.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -27,12 +27,6 @@
 
 namespace std {
 
-// and this native STL lib is old Dinkumware (has not defined _CPPLIB_VER)
-//#if (defined _STLPORT_VERSION) \
-//&& !(defined _STLP_USE_NO_IOSTREAMS) \
-//&& (defined _YVALS)  \
-//&& (defined __IBMCPP__)
-
 // define i/o operators for 64 bit integers
 template<class CharType>
 basic_ostream<CharType> & 

Modified: boost/trunk/boost/archive/impl/basic_xml_iarchive.ipp
===================================================================
--- boost/trunk/boost/archive/impl/basic_xml_iarchive.ipp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/impl/basic_xml_iarchive.ipp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -57,7 +57,7 @@
     if(0 == --depth)
         return;
         
-    if(0 != (this->get_flags() & no_xml_tag_checking)){
+    if(0 == (this->get_flags() & no_xml_tag_checking)){
         // double check that the tag matches what is expected - useful for debug
         if(0 != name[this->This()->gimpl->rv.object_name.size()]
         || ! std::equal(

Modified: boost/trunk/boost/archive/impl/xml_woarchive_impl.ipp
===================================================================
--- boost/trunk/boost/archive/impl/xml_woarchive_impl.ipp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/impl/xml_woarchive_impl.ipp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -140,7 +140,7 @@
     // gets destroyed.
     if(0 == (flags & no_codecvt)){
         detail::utf8_codecvt_facet *pfacet;
-        #if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)
+        #if defined(__SGI_STL_PORT)
             static detail::utf8_codecvt_facet facet(static_cast<size_t>(1));
             pfacet = & facet;
         #else

Modified: boost/trunk/boost/archive/polymorphic_binary_iarchive.hpp
===================================================================
--- boost/trunk/boost/archive/polymorphic_binary_iarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/polymorphic_binary_iarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -34,7 +34,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(
     boost::archive::polymorphic_binary_iarchive
 )
 

Modified: boost/trunk/boost/archive/polymorphic_binary_oarchive.hpp
===================================================================
--- boost/trunk/boost/archive/polymorphic_binary_oarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/polymorphic_binary_oarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -34,7 +34,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(
     boost::archive::polymorphic_binary_oarchive
 )
 

Modified: boost/trunk/boost/archive/polymorphic_iarchive.hpp
===================================================================
--- boost/trunk/boost/archive/polymorphic_iarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/polymorphic_iarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,7 +32,6 @@
 #include <boost/archive/detail/iserializer.hpp>
 #include <boost/archive/detail/interface_iarchive.hpp>
 #include <boost/serialization/nvp.hpp>
-#include <boost/archive/detail/register_archive.hpp>
 
 // determine if its necessary to handle (u)int64_t specifically
 // i.e. that its not a synonym for (unsigned) long
@@ -162,6 +161,6 @@
 
 // required by smart_cast for compilers not implementing
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(boost::archive::polymorphic_iarchive)
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(boost::archive::polymorphic_iarchive)
 
 #endif // BOOST_ARCHIVE_POLYMORPHIC_IARCHIVE_HPP

Modified: boost/trunk/boost/archive/polymorphic_oarchive.hpp
===================================================================
--- boost/trunk/boost/archive/polymorphic_oarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/polymorphic_oarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -31,7 +31,6 @@
 #include <boost/archive/detail/oserializer.hpp>
 #include <boost/archive/detail/interface_oarchive.hpp>
 #include <boost/serialization/nvp.hpp>
-#include <boost/archive/detail/register_archive.hpp>
 
 // determine if its necessary to handle (u)int64_t specifically
 // i.e. that its not a synonym for (unsigned) long
@@ -151,6 +150,6 @@
 
 // required by smart_cast for compilers not implementing
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(boost::archive::polymorphic_oarchive)
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(boost::archive::polymorphic_oarchive)
 
 #endif // BOOST_ARCHIVE_POLYMORPHIC_OARCHIVE_HPP

Modified: boost/trunk/boost/archive/polymorphic_text_iarchive.hpp
===================================================================
--- boost/trunk/boost/archive/polymorphic_text_iarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/polymorphic_text_iarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,7 +32,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(
     boost::archive::polymorphic_text_iarchive
 )
 

Modified: boost/trunk/boost/archive/polymorphic_text_oarchive.hpp
===================================================================
--- boost/trunk/boost/archive/polymorphic_text_oarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/polymorphic_text_oarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,7 +32,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(
     boost::archive::polymorphic_text_oarchive
 )
 

Modified: boost/trunk/boost/archive/polymorphic_text_wiarchive.hpp
===================================================================
--- boost/trunk/boost/archive/polymorphic_text_wiarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/polymorphic_text_wiarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,7 +36,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(
     boost::archive::polymorphic_text_wiarchive
 )
 

Modified: boost/trunk/boost/archive/polymorphic_text_woarchive.hpp
===================================================================
--- boost/trunk/boost/archive/polymorphic_text_woarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/polymorphic_text_woarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,7 +36,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(
     boost::archive::polymorphic_text_woarchive
 )
 

Modified: boost/trunk/boost/archive/polymorphic_xml_iarchive.hpp
===================================================================
--- boost/trunk/boost/archive/polymorphic_xml_iarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/polymorphic_xml_iarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,7 +32,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(
     boost::archive::polymorphic_xml_iarchive
 )
 

Modified: boost/trunk/boost/archive/polymorphic_xml_oarchive.hpp
===================================================================
--- boost/trunk/boost/archive/polymorphic_xml_oarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/polymorphic_xml_oarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,7 +32,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(
     boost::archive::polymorphic_xml_oarchive
 )
 

Modified: boost/trunk/boost/archive/polymorphic_xml_wiarchive.hpp
===================================================================
--- boost/trunk/boost/archive/polymorphic_xml_wiarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/polymorphic_xml_wiarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,7 +36,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(
     boost::archive::polymorphic_xml_wiarchive
 )
 

Modified: boost/trunk/boost/archive/polymorphic_xml_woarchive.hpp
===================================================================
--- boost/trunk/boost/archive/polymorphic_xml_woarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/polymorphic_xml_woarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,7 +36,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(
     boost::archive::polymorphic_xml_woarchive
 )
 

Modified: boost/trunk/boost/archive/text_iarchive.hpp
===================================================================
--- boost/trunk/boost/archive/text_iarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/text_iarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -92,7 +92,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(boost::archive::text_iarchive)
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(boost::archive::text_iarchive)
 
 #include <boost/archive/detail/abi_suffix.hpp> // pops abi_suffix.hpp pragmas
 

Modified: boost/trunk/boost/archive/text_oarchive.hpp
===================================================================
--- boost/trunk/boost/archive/text_oarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/text_oarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -93,7 +93,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(boost::archive::text_oarchive)
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(boost::archive::text_oarchive)
 
 #include <boost/archive/detail/abi_suffix.hpp> // pops abi_suffix.hpp pragmas
 

Modified: boost/trunk/boost/archive/text_wiarchive.hpp
===================================================================
--- boost/trunk/boost/archive/text_wiarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/text_wiarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -90,7 +90,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(boost::archive::text_wiarchive)
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(boost::archive::text_wiarchive)
 
 #include <boost/archive/detail/abi_suffix.hpp> // pops abi_suffix.hpp pragmas
 

Modified: boost/trunk/boost/archive/text_woarchive.hpp
===================================================================
--- boost/trunk/boost/archive/text_woarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/text_woarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -119,7 +119,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(boost::archive::text_woarchive)
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(boost::archive::text_woarchive)
 
 #include <boost/archive/detail/abi_suffix.hpp> // pops abi_suffix.hpp pragmas
 

Modified: boost/trunk/boost/archive/xml_iarchive.hpp
===================================================================
--- boost/trunk/boost/archive/xml_iarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/xml_iarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -104,7 +104,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(boost::archive::xml_iarchive)
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(boost::archive::xml_iarchive)
 
 #include <boost/archive/detail/abi_suffix.hpp> // pops abi_suffix.hpp pragmas
 

Modified: boost/trunk/boost/archive/xml_oarchive.hpp
===================================================================
--- boost/trunk/boost/archive/xml_oarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/xml_oarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -106,7 +106,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(boost::archive::xml_oarchive)
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(boost::archive::xml_oarchive)
 
 #include <boost/archive/detail/abi_suffix.hpp> // pops abi_suffix.hpp pragmas
 

Modified: boost/trunk/boost/archive/xml_wiarchive.hpp
===================================================================
--- boost/trunk/boost/archive/xml_wiarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/xml_wiarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -108,7 +108,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(boost::archive::xml_wiarchive)
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(boost::archive::xml_wiarchive)
 
 #include <boost/archive/detail/abi_suffix.hpp> // pops abi_suffix.hpp pragmas
 

Modified: boost/trunk/boost/archive/xml_woarchive.hpp
===================================================================
--- boost/trunk/boost/archive/xml_woarchive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/archive/xml_woarchive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -118,7 +118,7 @@
 
 // required by smart_cast for compilers not implementing 
 // partial template specialization
-BOOST_SERIALIZATION_REGISTER_ARCHIVE(boost::archive::xml_woarchive)
+BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(boost::archive::xml_woarchive)
 
 #include <boost/archive/detail/abi_suffix.hpp> // pops abi_suffix.hpp pragmas
 

Modified: boost/trunk/boost/array.hpp
===================================================================
--- boost/trunk/boost/array.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/array.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,13 @@
  * an STL container (as wrapper) for arrays of constant size.
  *
  * See
- *      http://www.josuttis.com/cppcode
- * for details and the latest version.
- * See
- *      http://www.boost.org/libs/array for Documentation.
+ *      http://www.boost.org/libs/array/
  * for documentation.
  *
+ * The original author site is at: http://www.josuttis.com/
+ *
  * (C) Copyright Nicolai M. Josuttis 2001.
+ *
  * Distributed under the Boost Software License, Version 1.0. (See
  * accompanying file LICENSE_1_0.txt or copy at
  * http://www.boost.org/LICENSE_1_0.txt)
@@ -30,6 +30,7 @@
 
 // Handles broken standard libraries better than <iterator>
 #include <boost/detail/iterator.hpp>
+#include <boost/throw_exception.hpp>
 #include <algorithm>
 
 // FIXES for broken compilers
@@ -52,7 +53,7 @@
         typedef const T&       const_reference;
         typedef std::size_t    size_type;
         typedef std::ptrdiff_t difference_type;
-    
+
         // iterator support
         iterator begin() { return elems; }
         const_iterator begin() const { return elems; }
@@ -135,6 +136,7 @@
 
         // direct access to data (read-only)
         const T* data() const { return elems; }
+        T* data() { return elems; }
 
         // use array as C array (direct read/write access to data)
         T* c_array() { return elems; }
@@ -154,13 +156,134 @@
 
         // check range (may be private because it is static)
         static void rangecheck (size_type i) {
-            if (i >= size()) { 
+            if (i >= size()) {
                 throw std::range_error("array<>: index out of range");
             }
         }
 
     };
 
+#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
+    template< class T >
+    class array< T, 0 > {
+
+      public:
+        // type definitions
+        typedef T              value_type;
+        typedef T*             iterator;
+        typedef const T*       const_iterator;
+        typedef T&             reference;
+        typedef const T&       const_reference;
+        typedef std::size_t    size_type;
+        typedef std::ptrdiff_t difference_type;
+
+        // iterator support
+        iterator begin() { return iterator( reinterpret_cast< T * >( this ) ); }
+        const_iterator begin() const { return const_iterator(  reinterpret_cast< const T * >( this ) ); }
+        iterator end() { return begin(); }
+        const_iterator end() const { return begin(); }
+
+        // reverse iterator support
+#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_MSVC_STD_ITERATOR) && !defined(BOOST_NO_STD_ITERATOR_TRAITS)
+        typedef std::reverse_iterator<iterator> reverse_iterator;
+        typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+#elif defined(_MSC_VER) && (_MSC_VER == 1300) && defined(BOOST_DINKUMWARE_STDLIB) && (BOOST_DINKUMWARE_STDLIB == 310)
+        // workaround for broken reverse_iterator in VC7
+        typedef std::reverse_iterator<std::_Ptrit<value_type, difference_type, iterator,
+                                      reference, iterator, reference> > reverse_iterator;
+        typedef std::reverse_iterator<std::_Ptrit<value_type, difference_type, const_iterator,
+                                      const_reference, iterator, reference> > const_reverse_iterator;
+#else
+        // workaround for broken reverse_iterator implementations
+        typedef std::reverse_iterator<iterator,T> reverse_iterator;
+        typedef std::reverse_iterator<const_iterator,T> const_reverse_iterator;
+#endif
+
+        reverse_iterator rbegin() { return reverse_iterator(end()); }
+        const_reverse_iterator rbegin() const {
+            return const_reverse_iterator(end());
+        }
+        reverse_iterator rend() { return reverse_iterator(begin()); }
+        const_reverse_iterator rend() const {
+            return const_reverse_iterator(begin());
+        }
+
+        // operator[]
+        reference operator[](size_type i)
+        {
+            return failed_rangecheck();
+        }
+
+        const_reference operator[](size_type i) const
+        {
+            return failed_rangecheck();
+        }
+
+        // at() with range check
+        reference at(size_type i)               {   return failed_rangecheck(); }
+        const_reference at(size_type i) const   {   return failed_rangecheck(); }
+
+        // front() and back()
+        reference front()
+        {
+            return failed_rangecheck();
+        }
+
+        const_reference front() const
+        {
+            return failed_rangecheck();
+        }
+
+        reference back()
+        {
+            return failed_rangecheck();
+        }
+
+        const_reference back() const
+        {
+            return failed_rangecheck();
+        }
+
+        // size is constant
+        static size_type size() { return 0; }
+        static bool empty() { return true; }
+        static size_type max_size() { return 0; }
+        enum { static_size = 0 };
+
+        void swap (array<T,0>& y) {
+        }
+
+        // direct access to data (read-only)
+        const T* data() const { return 0; }
+        T* data() { return 0; }
+
+        // use array as C array (direct read/write access to data)
+        T* c_array() { return 0; }
+
+        // assignment with type conversion
+        template <typename T2>
+        array<T,0>& operator= (const array<T2,0>& ) {
+            return *this;
+        }
+
+        // assign one value to all elements
+        void assign (const T& ) {   }
+
+        // check range (may be private because it is static)
+        static reference failed_rangecheck () {
+                std::range_error e("attempt to access element of an empty array");
+                boost::throw_exception(e);
+                //
+                // We need to return something here to keep
+                // some compilers happy: however we will never
+                // actually get here....
+                //
+                static T placeholder;
+                return placeholder;
+            }
+    };
+#endif
+
     // comparisons
     template<class T, std::size_t N>
     bool operator== (const array<T,N>& x, const array<T,N>& y) {

Modified: boost/trunk/boost/assign/list_of.hpp
===================================================================
--- boost/trunk/boost/assign/list_of.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/assign/list_of.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -484,13 +484,6 @@
             return this-> BOOST_NESTED_TEMPLATE convert_to_container<Container>();
         }
 
-        template< class U, std::size_t M >
-        operator array<U,M>() const
-        {
-            BOOST_STATIC_ASSERT( M == N );
-            return this-> BOOST_NESTED_TEMPLATE convert_to_container< array<U,M> >();
-        }
-
     private:
         void insert( T& r )
         {

Modified: boost/trunk/boost/assign/ptr_list_of.hpp
===================================================================
--- boost/trunk/boost/assign/ptr_list_of.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/assign/ptr_list_of.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -37,26 +37,8 @@
 namespace assign_detail
 {
     /////////////////////////////////////////////////////////////////////////
-    // Part 0: common conversion code
-    /////////////////////////////////////////////////////////////////////////
-
-    template< class T >
-    struct assign_decay
-    {
-        //
-        // Add constness to array parameters
-        // to support string literals properly
-        //
-        typedef BOOST_DEDUCED_TYPENAME mpl::eval_if<
-            ::boost::is_array<T>,
-            ::boost::decay<const T>,
-            ::boost::decay<T> >::type type;
-    };
-    
-    /////////////////////////////////////////////////////////////////////////
-    // Part 1: flexible and efficient interface
-    /////////////////////////////////////////////////////////////////////////    
-
+    // Part 0: flexible and efficient interface
+    ///////////////////////////////////////////////////////////////////////// 
     template< class T > 
     class generic_ptr_list       
     {

Modified: boost/trunk/boost/bind.hpp
===================================================================
--- boost/trunk/boost/bind.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/bind.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1161,7 +1161,8 @@
 
 // visit_each, ADL
 
-#if !defined( BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP ) && !defined( __BORLANDC__ )
+#if !defined( BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP ) && !defined( __BORLANDC__ ) \
+   && !(defined(__GNUC__) && __GNUC__ == 3 && __GNUC_MINOR__ <= 3)
 
 template<class V, class T> void visit_each( V & v, value<T> const & t, int )
 {
@@ -1180,7 +1181,8 @@
 
 // visit_each, no ADL
 
-#if defined( BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP ) || defined( __BORLANDC__ )
+#if defined( BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP ) || defined( __BORLANDC__ ) \
+  || (defined(__GNUC__) && __GNUC__ == 3 && __GNUC_MINOR__ <= 3)
 
 template<class V, class T> void visit_each( V & v, _bi::value<T> const & t, int )
 {

Modified: boost/trunk/boost/concept_check.hpp
===================================================================
--- boost/trunk/boost/concept_check.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/concept_check.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,144 +13,234 @@
 // See http://www.boost.org/libs/concept_check for documentation.
 
 #ifndef BOOST_CONCEPT_CHECKS_HPP
-# define BOOST_CONCEPT_CHECKS_HPP
+#define BOOST_CONCEPT_CHECKS_HPP
 
-# include <boost/concept/assert.hpp>
+#include <boost/config.hpp>
+#include <boost/iterator.hpp>
+#include <boost/type_traits/conversion_traits.hpp>
+#include <utility>
+#include <boost/type_traits/conversion_traits.hpp>
+#include <boost/static_assert.hpp>
+#include <boost/mpl/identity.hpp>
 
-# include <boost/iterator.hpp>
-# include <boost/type_traits/conversion_traits.hpp>
-# include <utility>
-# include <boost/type_traits/is_same.hpp>
-# include <boost/type_traits/is_void.hpp>
-# include <boost/mpl/assert.hpp>
-# include <boost/detail/workaround.hpp>
-# include <boost/detail/iterator.hpp>
 
-# include <boost/concept/detail/concept_def.hpp>
+#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300 || defined(__BORLANDC__)
+#define BOOST_FPTR
+#else
+#define BOOST_FPTR &
+#endif
 
-namespace boost
+namespace boost {
+
+/*
+  "inline" is used for ignore_unused_variable_warning()
+   and function_requires() to make sure there is no
+   overhead with g++.
+ */
+
+template <class T> inline void ignore_unused_variable_warning(const T&) { }
+
+// the unused, defaulted parameter is a workaround for MSVC and Compaq C++
+template <class Concept>
+inline void function_requires(mpl::identity<Concept>* = 0)
 {
+#if !defined(NDEBUG)
+  void (Concept::*x)() = BOOST_FPTR Concept::constraints;
+  ignore_unused_variable_warning(x);
+#endif
+}
 
-  //
-  // Backward compatibility
-  //
-  
-  template <class Model>
-  inline void function_requires(Model* = 0)
-  {
-      BOOST_CONCEPT_ASSERT((Model));
-  }    
-  template <class T> inline void ignore_unused_variable_warning(T const&) {}
-  
-#  define BOOST_CLASS_REQUIRE(type_var, ns, concept)    \
-    BOOST_CONCEPT_ASSERT((ns::concept<type_var>))
+#define BOOST_CLASS_REQUIRE(type_var, ns, concept) \
+  typedef void (ns::concept <type_var>::* func##type_var##concept)(); \
+  template <func##type_var##concept Tp1_> \
+  struct concept_checking_##type_var##concept { }; \
+  typedef concept_checking_##type_var##concept< \
+    BOOST_FPTR ns::concept<type_var>::constraints> \
+    concept_checking_typedef_##type_var##concept
 
-#  define BOOST_CLASS_REQUIRE2(type_var1, type_var2, ns, concept)   \
-    BOOST_CONCEPT_ASSERT((ns::concept<type_var1,type_var2>))
+#define BOOST_CLASS_REQUIRE2(type_var1, type_var2, ns, concept) \
+  typedef void (ns::concept <type_var1,type_var2>::* \
+     func##type_var1##type_var2##concept)(); \
+  template <func##type_var1##type_var2##concept Tp1_> \
+  struct concept_checking_##type_var1##type_var2##concept { }; \
+  typedef concept_checking_##type_var1##type_var2##concept< \
+    BOOST_FPTR ns::concept<type_var1,type_var2>::constraints> \
+    concept_checking_typedef_##type_var1##type_var2##concept
 
-#  define BOOST_CLASS_REQUIRE3(tv1, tv2, tv3, ns, concept)  \
-    BOOST_CONCEPT_ASSERT((ns::concept<tv1,tv2,tv3>))
+#define BOOST_CLASS_REQUIRE3(tv1, tv2, tv3, ns, concept) \
+  typedef void (ns::concept <tv1,tv2,tv3>::* \
+     func##tv1##tv2##tv3##concept)(); \
+  template <func##tv1##tv2##tv3##concept Tp1_> \
+  struct concept_checking_##tv1##tv2##tv3##concept { }; \
+  typedef concept_checking_##tv1##tv2##tv3##concept< \
+    BOOST_FPTR ns::concept<tv1,tv2,tv3>::constraints> \
+    concept_checking_typedef_##tv1##tv2##tv3##concept
 
-#  define BOOST_CLASS_REQUIRE4(tv1, tv2, tv3, tv4, ns, concept) \
-    BOOST_CONCEPT_ASSERT((ns::concept<tv1,tv2,tv3,tv4>))
+#define BOOST_CLASS_REQUIRE4(tv1, tv2, tv3, tv4, ns, concept) \
+  typedef void (ns::concept <tv1,tv2,tv3,tv4>::* \
+     func##tv1##tv2##tv3##tv4##concept)(); \
+  template <func##tv1##tv2##tv3##tv4##concept Tp1_> \
+  struct concept_checking_##tv1##tv2##tv3##tv4##concept { }; \
+  typedef concept_checking_##tv1##tv2##tv3##tv4##concept< \
+    BOOST_FPTR ns::concept<tv1,tv2,tv3,tv4>::constraints> \
+    concept_checking_typedef_##tv1##tv2##tv3##tv4##concept
 
-  
-  //
-  // Begin concept definitions
-  //
-  BOOST_concept(Integer, (T))
-  {
-      ~Integer()
-        { 
-            x.error_type_must_be_an_integer_type();
-        }
-   private:
-      T x;
+// NOTE: The BOOST_CLASS_REQUIRES (with an 'S' at the end) is deprecated.
+
+// The BOOST_CLASS_REQUIRES macros use function pointers as
+// template parameters, which VC++ does not support.
+
+#if defined(BOOST_NO_FUNCTION_PTR_TEMPLATE_PARAMETERS)
+
+#define BOOST_CLASS_REQUIRES(type_var, concept)
+#define BOOST_CLASS_REQUIRES2(type_var1, type_var2, concept)
+#define BOOST_CLASS_REQUIRES3(type_var1, type_var2, type_var3, concept)
+#define BOOST_CLASS_REQUIRES4(type_var1, type_var2, type_var3, type_var4, concept)
+
+#else
+
+#define BOOST_CLASS_REQUIRES(type_var, concept) \
+  typedef void (concept <type_var>::* func##type_var##concept)(); \
+  template <func##type_var##concept Tp1_> \
+  struct concept_checking_##type_var##concept { }; \
+  typedef concept_checking_##type_var##concept< \
+    BOOST_FPTR concept <type_var>::constraints> \
+    concept_checking_typedef_##type_var##concept
+
+#define BOOST_CLASS_REQUIRES2(type_var1, type_var2, concept) \
+  typedef void (concept <type_var1,type_var2>::* func##type_var1##type_var2##concept)(); \
+  template <func##type_var1##type_var2##concept Tp1_> \
+  struct concept_checking_##type_var1##type_var2##concept { }; \
+  typedef concept_checking_##type_var1##type_var2##concept< \
+    BOOST_FPTR concept <type_var1,type_var2>::constraints> \
+    concept_checking_typedef_##type_var1##type_var2##concept
+
+#define BOOST_CLASS_REQUIRES3(type_var1, type_var2, type_var3, concept) \
+  typedef void (concept <type_var1,type_var2,type_var3>::* func##type_var1##type_var2##type_var3##concept)(); \
+  template <func##type_var1##type_var2##type_var3##concept Tp1_> \
+  struct concept_checking_##type_var1##type_var2##type_var3##concept { }; \
+  typedef concept_checking_##type_var1##type_var2##type_var3##concept< \
+    BOOST_FPTR concept <type_var1,type_var2,type_var3>::constraints>  \
+  concept_checking_typedef_##type_var1##type_var2##type_var3##concept
+
+#define BOOST_CLASS_REQUIRES4(type_var1, type_var2, type_var3, type_var4, concept) \
+  typedef void (concept <type_var1,type_var2,type_var3,type_var4>::* func##type_var1##type_var2##type_var3##type_var4##concept)(); \
+  template <func##type_var1##type_var2##type_var3##type_var4##concept Tp1_> \
+  struct concept_checking_##type_var1##type_var2##type_var3##type_var4##concept { }; \
+  typedef concept_checking_##type_var1##type_var2##type_var3##type_var4##concept< \
+    BOOST_FPTR concept <type_var1,type_var2,type_var3,type_var4>::constraints>  \
+    concept_checking_typedef_##type_var1##type_var2##type_var3##type_var4##concept
+
+
+#endif
+
+#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+template <class T, class U>
+struct require_same { };
+
+template <class T>
+struct require_same<T,T> { typedef T type; };
+#else
+// This version does not perform checking, but will not do any harm.
+template <class T, class U>
+struct require_same { typedef T type; };
+#endif
+
+  template <class T>
+  struct IntegerConcept {
+    void constraints() { 
+#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+      x.error_type_must_be_an_integer_type();
+#endif      
+    }
+    T x;
   };
-
-  template <> struct Integer<signed char> {};
-  template <> struct Integer<unsigned char> {};
-  template <> struct Integer<short> {};
-  template <> struct Integer<unsigned short> {};
-  template <> struct Integer<int> {};
-  template <> struct Integer<unsigned int> {};
-  template <> struct Integer<long> {};
-  template <> struct Integer<unsigned long> {};
+#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+  template <> struct IntegerConcept<short> { void constraints() {} };
+  template <> struct IntegerConcept<unsigned short> { void constraints() {} };
+  template <> struct IntegerConcept<int> { void constraints() {} };
+  template <> struct IntegerConcept<unsigned int> { void constraints() {} };
+  template <> struct IntegerConcept<long> { void constraints() {} };
+  template <> struct IntegerConcept<unsigned long> { void constraints() {} };
   // etc.
+#endif      
 
-  BOOST_concept(SignedInteger,(T)) {
-    ~SignedInteger() { 
+  template <class T>
+  struct SignedIntegerConcept {
+    void constraints() { 
+#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
       x.error_type_must_be_a_signed_integer_type();
+#endif      
     }
-   private:
     T x;
   };
-  template <> struct SignedInteger<signed char> { };
-  template <> struct SignedInteger<short> {};
-  template <> struct SignedInteger<int> {};
-  template <> struct SignedInteger<long> {};
+#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+  template <> struct SignedIntegerConcept<short> { void constraints() {} };
+  template <> struct SignedIntegerConcept<int> { void constraints() {} };
+  template <> struct SignedIntegerConcept<long> { void constraints() {} };
 # if defined(BOOST_HAS_LONG_LONG)
-  template <> struct SignedInteger< ::boost::long_long_type> {};
+  template <> struct SignedIntegerConcept< ::boost::long_long_type> { void constraints() {} };
+# endif
   // etc.
 #endif      
 
-  BOOST_concept(UnsignedInteger,(T)) {
-    ~UnsignedInteger() { 
+  template <class T>
+  struct UnsignedIntegerConcept {
+    void constraints() { 
+#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
       x.error_type_must_be_an_unsigned_integer_type();
+#endif      
     }
-   private:
     T x;
   };
-  
-  template <> struct UnsignedInteger<unsigned char> {};
-  template <> struct UnsignedInteger<unsigned short> {};
-  template <> struct UnsignedInteger<unsigned int> {};
-  template <> struct UnsignedInteger<unsigned long> {};
-# if defined(BOOST_HAS_LONG_LONG)
-  template <> struct UnsignedInteger< ::boost::ulong_long_type> {};
+#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+  template <> struct UnsignedIntegerConcept<unsigned short>
+    { void constraints() {} };
+  template <> struct UnsignedIntegerConcept<unsigned int>
+    { void constraints() {} };
+  template <> struct UnsignedIntegerConcept<unsigned long>
+    { void constraints() {} };
   // etc.
 #endif      
 
-  // etc.
-
   //===========================================================================
   // Basic Concepts
 
-  BOOST_concept(DefaultConstructible,(TT))
+  template <class TT>
+  struct DefaultConstructibleConcept
   {
-    ~DefaultConstructible() {
+    void constraints() {
       TT a;               // require default constructor
       ignore_unused_variable_warning(a);
     }
   };
 
-  BOOST_concept(Assignable,(TT))
+  template <class TT>
+  struct AssignableConcept
   {
-    ~Assignable() {
+    void constraints() {
 #if !defined(_ITERATOR_) // back_insert_iterator broken for VC++ STL
       a = a;              // require assignment operator
 #endif
       const_constraints(a);
     }
-   private:
     void const_constraints(const TT& b) {
 #if !defined(_ITERATOR_) // back_insert_iterator broken for VC++ STL
       a = b;              // const required for argument to assignment
 #endif
     }
-   private:
     TT a;
   };
 
-  BOOST_concept(CopyConstructible,(TT))
+  template <class TT>
+  struct CopyConstructibleConcept
   {
-    ~CopyConstructible() {
+    void constraints() {
       TT a(b);            // require copy constructor
       TT* ptr = &a;       // require address of operator
       const_constraints(a);
       ignore_unused_variable_warning(ptr);
     }
-   private:
     void const_constraints(const TT& a) {
       TT c(a);            // require const copy constructor
       const TT* ptr = &a; // require const address of operator
@@ -161,9 +251,10 @@
   };
 
   // The SGI STL version of Assignable requires copy constructor and operator=
-  BOOST_concept(SGIAssignable,(TT))
+  template <class TT>
+  struct SGIAssignableConcept
   {
-    ~SGIAssignable() {
+    void constraints() {
       TT b(a);
 #if !defined(_ITERATOR_) // back_insert_iterator broken for VC++ STL
       a = a;              // require assignment operator
@@ -171,7 +262,6 @@
       const_constraints(a);
       ignore_unused_variable_warning(b);
     }
-   private:
     void const_constraints(const TT& b) {
       TT c(b);
 #if !defined(_ITERATOR_) // back_insert_iterator broken for VC++ STL
@@ -182,13 +272,13 @@
     TT a;
   };
 
-  BOOST_concept(Convertible,(X)(Y))
+  template <class X, class Y>
+  struct ConvertibleConcept
   {
-    ~Convertible() {
+    void constraints() {
       Y y = x;
       ignore_unused_variable_warning(y);
     }
-   private:
     X x;
   };
 
@@ -207,167 +297,177 @@
     ignore_unused_variable_warning(x);
   }
 
-  BOOST_concept(EqualityComparable,(TT))
+  template <class TT>
+  struct EqualityComparableConcept
   {
-    ~EqualityComparable() {
+    void constraints() {
       require_boolean_expr(a == b);
       require_boolean_expr(a != b);
     }
-   private:
     TT a, b;
   };
 
-  BOOST_concept(LessThanComparable,(TT))
+  template <class TT>
+  struct LessThanComparableConcept
   {
-    ~LessThanComparable() {
+    void constraints() {
       require_boolean_expr(a < b);
     }
-   private:
     TT a, b;
   };
 
   // This is equivalent to SGI STL's LessThanComparable.
-  BOOST_concept(Comparable,(TT))
+  template <class TT>
+  struct ComparableConcept
   {
-    ~Comparable() {
+    void constraints() {
       require_boolean_expr(a < b);
       require_boolean_expr(a > b);
       require_boolean_expr(a <= b);
       require_boolean_expr(a >= b);
     }
-   private:
     TT a, b;
   };
 
-#define BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(OP,NAME)    \
-  BOOST_concept(NAME, (First)(Second))                          \
-  {                                                             \
-      ~NAME() { (void)constraints_(); }                         \
-     private:                                                   \
-        bool constraints_() { return a OP b; }                  \
-        First a;                                                \
-        Second b;                                               \
-    }
+#define BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(OP,NAME) \
+  template <class First, class Second> \
+  struct NAME { \
+    void constraints() { (void)constraints_(); } \
+    bool constraints_() {  \
+      return  a OP b; \
+    } \
+    First a; \
+    Second b; \
+  }
 
-#define BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT(OP,NAME)    \
-  BOOST_concept(NAME, (Ret)(First)(Second))                 \
-  {                                                         \
-      ~NAME() { (void)constraints_(); }                     \
-  private:                                                  \
-      Ret constraints_() { return a OP b; }                 \
-      First a;                                              \
-      Second b;                                             \
-    }
+#define BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT(OP,NAME) \
+  template <class Ret, class First, class Second> \
+  struct NAME { \
+    void constraints() { (void)constraints_(); } \
+    Ret constraints_() {  \
+      return a OP b; \
+    } \
+    First a; \
+    Second b; \
+  }
 
-  BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(==, EqualOp);
-  BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(!=, NotEqualOp);
-  BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(<, LessThanOp);
-  BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(<=, LessEqualOp);
-  BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(>, GreaterThanOp);
-  BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(>=, GreaterEqualOp);
+  BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(==, EqualOpConcept);
+  BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(!=, NotEqualOpConcept);
+  BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(<, LessThanOpConcept);
+  BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(<=, LessEqualOpConcept);
+  BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(>, GreaterThanOpConcept);
+  BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(>=, GreaterEqualOpConcept);
 
-  BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT(+, PlusOp);
-  BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT(*, TimesOp);
-  BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT(/, DivideOp);
-  BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT(-, SubtractOp);
-  BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT(%, ModOp);
+  BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT(+, PlusOpConcept);
+  BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT(*, TimesOpConcept);
+  BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT(/, DivideOpConcept);
+  BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT(-, SubtractOpConcept);
+  BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT(%, ModOpConcept);
 
   //===========================================================================
   // Function Object Concepts
 
-  BOOST_concept(Generator,(Func)(Return))
+  template <class Func, class Return>
+  struct GeneratorConcept
   {
-      ~Generator() { test(is_void<Return>()); }
-      
-   private:
-      void test(boost::mpl::false_)
-      {
-          // Do we really want a reference here?
-          const Return& r = f();
-          ignore_unused_variable_warning(r);
-      }
+    void constraints() {
+      const Return& r = f();   // require operator() member function
+      ignore_unused_variable_warning(r);
+    }
+    Func f;
+  };
 
-      void test(boost::mpl::true_)
-      {
-          f();
-      }
-      
-      Func f;
+
+#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+  template <class Func>
+  struct GeneratorConcept<Func,void>
+  {
+    void constraints() {
+      f();              // require operator() member function
+    }
+    Func f;
   };
+#endif
 
+  template <class Func, class Return, class Arg>
+  struct UnaryFunctionConcept
+  {
+    // required in case any of our template args are const-qualified:
+    UnaryFunctionConcept();
+    
+    void constraints() {
+      r = f(arg); // require operator()
+    }
+    Func f;
+    Arg arg;
+    Return r;
+  };
 
-  BOOST_concept(UnaryFunction,(Func)(Return)(Arg))
+#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+  template <class Func, class Arg>
+  struct UnaryFunctionConcept<Func, void, Arg> {
+    void constraints() { 
+      f(arg);                 // require operator()
+    }
+    Func f;
+    Arg arg;
+  };
+#endif
+
+  template <class Func, class Return, class First, class Second>
+  struct BinaryFunctionConcept
   {
-      ~UnaryFunction() { test(is_void<Return>()); }
-      
-   private:
-      void test(boost::mpl::false_)
-      {
-          f(arg);               // "priming the pump" this way keeps msvc6 happy (ICE)
-          Return r = f(arg);
-          ignore_unused_variable_warning(r); 
-      }
-      
-      void test(boost::mpl::true_)
-      {
-          f(arg);
-      }
-      
-      Func f;
-      Arg arg;
+    void constraints() { 
+      r = f(first, second); // require operator()
+    }
+    Func f;
+    First first;
+    Second second;
+    Return r;
   };
 
-  BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
+#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+  template <class Func, class First, class Second>
+  struct BinaryFunctionConcept<Func, void, First, Second>
   {
-      ~BinaryFunction() { test(is_void<Return>()); }
-   private:
-      void test(boost::mpl::false_)
-      {
-          f(first,second);
-          Return r = f(first, second); // require operator()
-          (void)r;
-      }
-      
-      void test(boost::mpl::true_)
-      {
-          f(first,second);
-      }
-      
-      Func f;
-      First first;
-      Second second;
+    void constraints() {
+      f(first, second); // require operator()
+    }
+    Func f;
+    First first;
+    Second second;
   };
+#endif
 
-  BOOST_concept(UnaryPredicate,(Func)(Arg))
+  template <class Func, class Arg>
+  struct UnaryPredicateConcept
   {
-    ~UnaryPredicate() {
+    void constraints() {
       require_boolean_expr(f(arg)); // require operator() returning bool
     }
-   private:
     Func f;
     Arg arg;
   };
 
-  BOOST_concept(BinaryPredicate,(Func)(First)(Second))
+  template <class Func, class First, class Second>
+  struct BinaryPredicateConcept
   {
-    ~BinaryPredicate() {
+    void constraints() {
       require_boolean_expr(f(a, b)); // require operator() returning bool
     }
-   private:
     Func f;
     First a;
     Second b;
   };
 
   // use this when functor is used inside a container class like std::set
-  BOOST_concept(Const_BinaryPredicate,(Func)(First)(Second))
-    : BinaryPredicate<Func, First, Second>
-  {
-    ~Const_BinaryPredicate() { 
+  template <class Func, class First, class Second>
+  struct Const_BinaryPredicateConcept {
+    void constraints() { 
       const_constraints(f);
     }
-   private:
     void const_constraints(const Func& fun) {
+      function_requires<BinaryPredicateConcept<Func, First, Second> >();
       // operator() must be a const member function
       require_boolean_expr(fun(a, b));
     }
@@ -376,604 +476,581 @@
     Second b;
   };
 
-  BOOST_concept(AdaptableGenerator,(Func)(Return))
-    : Generator<Func, typename Func::result_type>
+  template <class Func, class Return>
+  struct AdaptableGeneratorConcept
   {
+    void constraints() {
       typedef typename Func::result_type result_type;
-      
-      ~AdaptableGenerator()
-      {
-          BOOST_CONCEPT_ASSERT((Convertible<result_type, Return>));
-      }
+      BOOST_STATIC_ASSERT((is_convertible<result_type, Return>::value));
+      function_requires< GeneratorConcept<Func, result_type> >();
+    }
   };
 
-  BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
-    : UnaryFunction<Func, typename Func::result_type, typename Func::argument_type>
+  template <class Func, class Return, class Arg>
+  struct AdaptableUnaryFunctionConcept
   {
+    void constraints() {
       typedef typename Func::argument_type argument_type;
       typedef typename Func::result_type result_type;
-
-      ~AdaptableUnaryFunction()
-      {
-          BOOST_CONCEPT_ASSERT((Convertible<result_type, Return>));
-          BOOST_CONCEPT_ASSERT((Convertible<Arg, argument_type>));
-      }
+      BOOST_STATIC_ASSERT((is_convertible<result_type, Return>::value));
+      BOOST_STATIC_ASSERT((is_convertible<Arg, argument_type>::value));
+      function_requires< UnaryFunctionConcept<Func, result_type, argument_type> >();
+    }
   };
 
-  BOOST_concept(AdaptableBinaryFunction,(Func)(Return)(First)(Second))
-    : BinaryFunction<
-          Func
-        , typename Func::result_type
-        , typename Func::first_argument_type
-        , typename Func::second_argument_type
-      >
+  template <class Func, class Return, class First, class Second>
+  struct AdaptableBinaryFunctionConcept
   {
+    void constraints() {
       typedef typename Func::first_argument_type first_argument_type;
       typedef typename Func::second_argument_type second_argument_type;
       typedef typename Func::result_type result_type;
-      
-      ~AdaptableBinaryFunction()
-      {
-          BOOST_CONCEPT_ASSERT((Convertible<result_type, Return>));
-          BOOST_CONCEPT_ASSERT((Convertible<First, first_argument_type>));
-          BOOST_CONCEPT_ASSERT((Convertible<Second, second_argument_type>));
-      }
+      BOOST_STATIC_ASSERT((is_convertible<result_type, Return>::value));
+      BOOST_STATIC_ASSERT((is_convertible<First, first_argument_type>::value));
+      BOOST_STATIC_ASSERT((is_convertible<Second, second_argument_type>::value));
+      function_requires< BinaryFunctionConcept<Func, result_type, 
+        first_argument_type, second_argument_type> >();
+    }
   };
 
-  BOOST_concept(AdaptablePredicate,(Func)(Arg))
-    : UnaryPredicate<Func, Arg>
-    , AdaptableUnaryFunction<Func, bool, Arg>
-  {};
+  template <class Func, class Arg>
+  struct AdaptablePredicateConcept
+  {
+    void constraints() {
+      function_requires< UnaryPredicateConcept<Func, Arg> >();
+      function_requires< AdaptableUnaryFunctionConcept<Func, bool, Arg> >();
+    }
+  };
 
-  BOOST_concept(AdaptableBinaryPredicate,(Func)(First)(Second))
-    : BinaryPredicate<Func, First, Second>
-    , AdaptableBinaryFunction<Func, bool, First, Second>
-  {};
+  template <class Func, class First, class Second>
+  struct AdaptableBinaryPredicateConcept
+  {
+    void constraints() {
+      function_requires< BinaryPredicateConcept<Func, First, Second> >();
+      function_requires< AdaptableBinaryFunctionConcept<Func, bool, First, Second> >();
+    }
+  };
 
   //===========================================================================
   // Iterator Concepts
 
-  BOOST_concept(InputIterator,(TT))
-    : Assignable<TT>
-    , EqualityComparable<TT>
+  template <class TT>
+  struct InputIteratorConcept
   {
-      typedef typename boost::detail::iterator_traits<TT>::value_type value_type;
-      typedef typename boost::detail::iterator_traits<TT>::difference_type difference_type;
-      typedef typename boost::detail::iterator_traits<TT>::reference reference;
-      typedef typename boost::detail::iterator_traits<TT>::pointer pointer;
-      typedef typename boost::detail::iterator_traits<TT>::iterator_category iterator_category;
-
-      ~InputIterator()
-      {
-        BOOST_CONCEPT_ASSERT((SignedInteger<difference_type>));
-        BOOST_CONCEPT_ASSERT((Convertible<iterator_category, std::input_iterator_tag>));
-        
-        TT j(i);
-        (void)*i;           // require dereference operator
-        ++j;                // require preincrement operator
-        i++;                // require postincrement operator
-      }
-   private:
+    void constraints() {
+      function_requires< AssignableConcept<TT> >();
+      function_requires< EqualityComparableConcept<TT> >();
+      TT j(i);
+      (void)*i;           // require dereference operator
+#ifndef BOOST_NO_STD_ITERATOR_TRAITS
+      // require iterator_traits typedef's
+      typedef typename std::iterator_traits<TT>::difference_type D;
+      // Hmm, the following is a bit fragile
+      //function_requires< SignedIntegerConcept<D> >();
+      typedef typename std::iterator_traits<TT>::reference R;
+      typedef typename std::iterator_traits<TT>::pointer P;
+      typedef typename std::iterator_traits<TT>::iterator_category C;
+      function_requires< ConvertibleConcept<C, std::input_iterator_tag> >();
+#endif
+      ++j;                // require preincrement operator
+      i++;                // require postincrement operator
+    }
     TT i;
   };
 
-  BOOST_concept(OutputIterator,(TT)(ValueT))
-    : Assignable<TT>
+  template <class TT, class ValueT>
+  struct OutputIteratorConcept
   {
-    ~OutputIterator() {
-      
+    void constraints() {
+      function_requires< AssignableConcept<TT> >();
       ++i;                // require preincrement operator
       i++;                // require postincrement operator
       *i++ = t;           // require postincrement and assignment
     }
-   private:
     TT i, j;
     ValueT t;
   };
 
-  BOOST_concept(ForwardIterator,(TT))
-    : InputIterator<TT>
+  template <class TT>
+  struct ForwardIteratorConcept
   {
-      ~ForwardIterator()
-      {
-          BOOST_CONCEPT_ASSERT((Convertible<
-              BOOST_DEDUCED_TYPENAME ForwardIterator::iterator_category
-            , std::forward_iterator_tag
-          >));
-          
-          typename InputIterator<TT>::reference r = *i;
-          ignore_unused_variable_warning(r);
-      }
-      
-   private:
-      TT i;
+    void constraints() {
+      function_requires< InputIteratorConcept<TT> >();
+#ifndef BOOST_NO_STD_ITERATOR_TRAITS
+      typedef typename std::iterator_traits<TT>::iterator_category C;
+      function_requires< ConvertibleConcept<C, std::forward_iterator_tag> >();
+      typedef typename std::iterator_traits<TT>::reference reference;
+      reference r = *i;
+      ignore_unused_variable_warning(r);
+#endif
+    }
+    TT i;
   };
 
-  BOOST_concept(Mutable_ForwardIterator,(TT))
-    : ForwardIterator<TT>
+  template <class TT>
+  struct Mutable_ForwardIteratorConcept
   {
-      ~Mutable_ForwardIterator() {
-        *i++ = *i;         // require postincrement and assignment
-      }
-   private:
-      TT i;
+    void constraints() {
+      function_requires< ForwardIteratorConcept<TT> >();
+      *i++ = *i;         // require postincrement and assignment
+    }
+    TT i;
   };
 
-  BOOST_concept(BidirectionalIterator,(TT))
-    : ForwardIterator<TT>
+  template <class TT>
+  struct BidirectionalIteratorConcept
   {
-      ~BidirectionalIterator()
-      {
-          BOOST_CONCEPT_ASSERT((Convertible<
-              BOOST_DEDUCED_TYPENAME BidirectionalIterator::iterator_category
-            , std::bidirectional_iterator_tag
-          >));
-
-          --i;                // require predecrement operator
-          i--;                // require postdecrement operator
-      }
-   private:
-      TT i;
+    void constraints() {
+      function_requires< ForwardIteratorConcept<TT> >();
+#ifndef BOOST_NO_STD_ITERATOR_TRAITS
+      typedef typename std::iterator_traits<TT>::iterator_category C;
+      function_requires< ConvertibleConcept<C, 
+        std::bidirectional_iterator_tag> >();
+#endif
+      --i;                // require predecrement operator
+      i--;                // require postdecrement operator
+    }
+    TT i;
   };
 
-  BOOST_concept(Mutable_BidirectionalIterator,(TT))
-    : BidirectionalIterator<TT>
-    , Mutable_ForwardIterator<TT>
+  template <class TT>
+  struct Mutable_BidirectionalIteratorConcept
   {
-      ~Mutable_BidirectionalIterator()
-      {
-          *i-- = *i;                  // require postdecrement and assignment
-      }
-   private:
-      TT i;
+    void constraints() {
+      function_requires< BidirectionalIteratorConcept<TT> >();
+      function_requires< Mutable_ForwardIteratorConcept<TT> >();
+      *i-- = *i;                  // require postdecrement and assignment
+    }
+    TT i;
   };
 
 
-  BOOST_concept(RandomAccessIterator,(TT))
-    : BidirectionalIterator<TT>
-    , Comparable<TT>
+  template <class TT>
+  struct RandomAccessIteratorConcept
   {
-      ~RandomAccessIterator()
-      {
-          BOOST_CONCEPT_ASSERT((Convertible<
-              BOOST_DEDUCED_TYPENAME BidirectionalIterator<TT>::iterator_category
-            , std::random_access_iterator_tag
-          >));
+    void constraints() {
+      function_requires< BidirectionalIteratorConcept<TT> >();
+      function_requires< ComparableConcept<TT> >();
+#ifndef BOOST_NO_STD_ITERATOR_TRAITS
+      typedef typename std::iterator_traits<TT>::iterator_category C;
+      function_requires< ConvertibleConcept< C,
+        std::random_access_iterator_tag> >();
+      typedef typename std::iterator_traits<TT>::reference R;
+#endif
 
-          i += n;             // require assignment addition operator
-          i = i + n; i = n + i; // require addition with difference type
-          i -= n;             // require assignment subtraction operator
-          i = i - n;                  // require subtraction with difference type
-          n = i - j;                  // require difference operator
-          (void)i[n];                 // require element access operator
-      }
-      
-   private:
+      i += n;             // require assignment addition operator
+      i = i + n; i = n + i; // require addition with difference type
+      i -= n;             // require assignment subtraction operator
+      i = i - n;                  // require subtraction with difference type
+      n = i - j;                  // require difference operator
+      (void)i[n];                 // require element access operator
+    }
     TT a, b;
     TT i, j;
-      typename boost::detail::iterator_traits<TT>::difference_type n;
+#ifndef BOOST_NO_STD_ITERATOR_TRAITS
+    typename std::iterator_traits<TT>::difference_type n;
+#else
+    std::ptrdiff_t n;
+#endif
   };
 
-  BOOST_concept(Mutable_RandomAccessIterator,(TT))
-    : RandomAccessIterator<TT>
-    , Mutable_BidirectionalIterator<TT>
+  template <class TT>
+  struct Mutable_RandomAccessIteratorConcept
   {
-      ~Mutable_RandomAccessIterator()
-      {
-          i[n] = *i;                  // require element access and assignment
-      }
-   private:
+    void constraints() {
+      function_requires< RandomAccessIteratorConcept<TT> >();
+      function_requires< Mutable_BidirectionalIteratorConcept<TT> >();
+      i[n] = *i;                  // require element access and assignment
+    }
     TT i;
-    typename boost::detail::iterator_traits<TT>::difference_type n;
+#ifndef BOOST_NO_STD_ITERATOR_TRAITS
+    typename std::iterator_traits<TT>::difference_type n;
+#else
+    std::ptrdiff_t n;
+#endif
   };
 
   //===========================================================================
-  // Container s
+  // Container Concepts
 
-  BOOST_concept(Container,(C))
-    : Assignable<C>
+  template <class Container>
+  struct ContainerConcept
   {
-    typedef typename C::value_type value_type;
-    typedef typename C::difference_type difference_type;
-    typedef typename C::size_type size_type;
-    typedef typename C::const_reference const_reference;
-    typedef typename C::const_pointer const_pointer;
-    typedef typename C::const_iterator const_iterator;
+    typedef typename Container::value_type value_type;
+    typedef typename Container::difference_type difference_type;
+    typedef typename Container::size_type size_type;
+    typedef typename Container::const_reference const_reference;
+    typedef typename Container::const_pointer const_pointer;
+    typedef typename Container::const_iterator const_iterator;
 
-      ~Container()
-      {
-          BOOST_CONCEPT_ASSERT((InputIterator<const_iterator>));
-          const_constraints(c);
-      }
-      
-   private:
-      void const_constraints(const C& cc) {
-          i = cc.begin();
-          i = cc.end();
-          n = cc.size();
-          n = cc.max_size();
-          b = cc.empty();
-      }
-      C c;
-      bool b;
-      const_iterator i;
-      size_type n;
+    void constraints() {
+      function_requires< InputIteratorConcept<const_iterator> >();
+      function_requires< AssignableConcept<Container> >();
+      const_constraints(c);
+    }
+    void const_constraints(const Container& cc) {
+      i = cc.begin();
+      i = cc.end();
+      n = cc.size();
+      n = cc.max_size();
+      b = cc.empty();
+    }
+    Container c;
+    bool b;
+    const_iterator i;
+    size_type n;
   };
 
-  BOOST_concept(Mutable_Container,(C))
-    : Container<C>
+  template <class Container>
+  struct Mutable_ContainerConcept
   {
-      typedef typename C::reference reference;
-      typedef typename C::iterator iterator;
-      typedef typename C::pointer pointer;
+    typedef typename Container::value_type value_type;
+    typedef typename Container::reference reference;
+    typedef typename Container::iterator iterator;
+    typedef typename Container::pointer pointer;
     
-      ~Mutable_Container()
-      {
-          BOOST_CONCEPT_ASSERT((
-               Assignable<typename Mutable_Container::value_type>));
-          
-          BOOST_CONCEPT_ASSERT((InputIterator<iterator>));
-          
-          i = c.begin();
-          i = c.end();
-          c.swap(c2);
-      }
-      
-   private:
-      iterator i;
-      C c, c2;
+    void constraints() {
+      function_requires< ContainerConcept<Container> >();
+      function_requires< AssignableConcept<value_type> >();
+      function_requires< InputIteratorConcept<iterator> >();
+
+      i = c.begin();
+      i = c.end();
+      c.swap(c2);
+    }
+    iterator i;
+    Container c, c2;
   };
 
-  BOOST_concept(ForwardContainer,(C))
-    : Container<C>
+  template <class ForwardContainer>
+  struct ForwardContainerConcept
   {
-      ~ForwardContainer()
-      {
-          BOOST_CONCEPT_ASSERT((
-               ForwardIterator<
-                    typename ForwardContainer::const_iterator
-               >));
-      }
+    void constraints() {
+      function_requires< ContainerConcept<ForwardContainer> >();
+      typedef typename ForwardContainer::const_iterator const_iterator;
+      function_requires< ForwardIteratorConcept<const_iterator> >();
+    }
   };  
 
-  BOOST_concept(Mutable_ForwardContainer,(C))
-    : ForwardContainer<C>
-    , Mutable_Container<C>
+  template <class ForwardContainer>
+  struct Mutable_ForwardContainerConcept
   {
-      ~Mutable_ForwardContainer()
-      {
-          BOOST_CONCEPT_ASSERT((
-               Mutable_ForwardIterator<
-                   typename Mutable_ForwardContainer::iterator
-               >));
-      }
+    void constraints() {
+      function_requires< ForwardContainerConcept<ForwardContainer> >();
+      function_requires< Mutable_ContainerConcept<ForwardContainer> >();
+      typedef typename ForwardContainer::iterator iterator;
+      function_requires< Mutable_ForwardIteratorConcept<iterator> >();
+    }
   };  
 
-  BOOST_concept(ReversibleContainer,(C))
-    : ForwardContainer<C>
+  template <class ReversibleContainer>
+  struct ReversibleContainerConcept
   {
-      typedef typename
-        C::const_reverse_iterator
+    typedef typename ReversibleContainer::const_iterator const_iterator;
+    typedef typename ReversibleContainer::const_reverse_iterator
       const_reverse_iterator;
 
-      ~ReversibleContainer()
-      {
-          BOOST_CONCEPT_ASSERT((
-              BidirectionalIterator<
-                  typename ReversibleContainer::const_iterator>));
-          
-          BOOST_CONCEPT_ASSERT((BidirectionalIterator<const_reverse_iterator>));
-          
-          const_constraints(c);
-      }
-   private:
-      void const_constraints(const C& cc)
-      {
-          const_reverse_iterator i = cc.rbegin();
-          i = cc.rend();
-      }
-      C c;
+    void constraints() {
+      function_requires< ForwardContainerConcept<ReversibleContainer> >();
+      function_requires< BidirectionalIteratorConcept<const_iterator> >();
+      function_requires< 
+        BidirectionalIteratorConcept<const_reverse_iterator> >();
+      const_constraints(c);
+    }
+    void const_constraints(const ReversibleContainer& cc) {
+      const_reverse_iterator i = cc.rbegin();
+      i = cc.rend();
+    }
+    ReversibleContainer c;
   };
 
-  BOOST_concept(Mutable_ReversibleContainer,(C))
-    : Mutable_ForwardContainer<C>
-    , ReversibleContainer<C>
+  template <class ReversibleContainer>
+  struct Mutable_ReversibleContainerConcept
   {
-      typedef typename C::reverse_iterator reverse_iterator;
-      
-      ~Mutable_ReversibleContainer()
-      {
-          typedef typename Mutable_ForwardContainer<C>::iterator iterator;
-          BOOST_CONCEPT_ASSERT((Mutable_BidirectionalIterator<iterator>));
-          BOOST_CONCEPT_ASSERT((Mutable_BidirectionalIterator<reverse_iterator>));
-          
-          reverse_iterator i = c.rbegin();
-          i = c.rend();
-      }
-   private:  
-      C c;
+    typedef typename ReversibleContainer::iterator iterator;
+    typedef typename ReversibleContainer::reverse_iterator reverse_iterator;
+
+    void constraints() {
+      function_requires< ReversibleContainerConcept<ReversibleContainer> >();
+      function_requires<
+        Mutable_ForwardContainerConcept<ReversibleContainer> >();
+      function_requires< Mutable_BidirectionalIteratorConcept<iterator> >();
+      function_requires<
+        Mutable_BidirectionalIteratorConcept<reverse_iterator> >();
+
+      reverse_iterator i = c.rbegin();
+      i = c.rend();
+    }
+    ReversibleContainer c;
   };
 
-  BOOST_concept(RandomAccessContainer,(C))
-    : ReversibleContainer<C>
+  template <class RandomAccessContainer>
+  struct RandomAccessContainerConcept
   {
-      typedef typename C::size_type size_type;
-      typedef typename C::const_reference const_reference;
+    typedef typename RandomAccessContainer::size_type size_type;
+    typedef typename RandomAccessContainer::const_reference const_reference;
+    typedef typename RandomAccessContainer::const_iterator const_iterator;
+    typedef typename RandomAccessContainer::const_reverse_iterator
+      const_reverse_iterator;
 
-      ~RandomAccessContainer()
-      {
-          BOOST_CONCEPT_ASSERT((
-              RandomAccessIterator<
-                  typename RandomAccessContainer::const_iterator
-              >));
-          
-          const_constraints(c);
-      }
-   private:
-      void const_constraints(const C& cc)
-      {
-          const_reference r = cc[n];
-          ignore_unused_variable_warning(r);
-      }
-    
-      C c;
-      size_type n;
+    void constraints() {
+      function_requires< ReversibleContainerConcept<RandomAccessContainer> >();
+      function_requires< RandomAccessIteratorConcept<const_iterator> >();
+      function_requires<
+        RandomAccessIteratorConcept<const_reverse_iterator> >();
+
+      const_constraints(c);
+    }
+    void const_constraints(const RandomAccessContainer& cc) {
+      const_reference r = cc[n];
+      ignore_unused_variable_warning(r);
+    }
+    RandomAccessContainer c;
+    size_type n;
   };
 
-  BOOST_concept(Mutable_RandomAccessContainer,(C))
-    : Mutable_ReversibleContainer<C>
-    , RandomAccessContainer<C>
+  template <class RandomAccessContainer>
+  struct Mutable_RandomAccessContainerConcept
   {
-   private:
-      typedef Mutable_RandomAccessContainer self;
-   public:
-      ~Mutable_RandomAccessContainer()
-      {
-          BOOST_CONCEPT_ASSERT((Mutable_RandomAccessIterator<typename self::iterator>));
-          BOOST_CONCEPT_ASSERT((Mutable_RandomAccessIterator<typename self::reverse_iterator>));
-          
-          typename self::reference r = c[i];
-          ignore_unused_variable_warning(r);
-      }
-      
-   private:
-      typename Mutable_ReversibleContainer<C>::size_type i;
-      C c;
+    typedef typename RandomAccessContainer::size_type size_type;
+    typedef typename RandomAccessContainer::reference reference;
+    typedef typename RandomAccessContainer::iterator iterator;
+    typedef typename RandomAccessContainer::reverse_iterator reverse_iterator;
+
+    void constraints() {
+      function_requires<
+        RandomAccessContainerConcept<RandomAccessContainer> >();
+      function_requires<
+        Mutable_ReversibleContainerConcept<RandomAccessContainer> >();
+      function_requires< Mutable_RandomAccessIteratorConcept<iterator> >();
+      function_requires<
+        Mutable_RandomAccessIteratorConcept<reverse_iterator> >();
+
+      reference r = c[i];
+      ignore_unused_variable_warning(r);
+    }
+    size_type i;
+    RandomAccessContainer c;
   };
 
   // A Sequence is inherently mutable
-  BOOST_concept(Sequence,(S))
-    : Mutable_ForwardContainer<S>
-      // Matt Austern's book puts DefaultConstructible here, the C++
-      // standard places it in Container --JGS
-      // ... so why aren't we following the standard?  --DWA
-    , DefaultConstructible<S>
+  template <class Sequence>
+  struct SequenceConcept
   {
-      ~Sequence()
-      {
-          S 
-              c(n),
-              c2(n, t),
-              c3(first, last);
 
-          c.insert(p, t);
-          c.insert(p, n, t);
-          c.insert(p, first, last);
+    typedef typename Sequence::reference reference;
+    typedef typename Sequence::const_reference const_reference;
 
-          c.erase(p);
-          c.erase(p, q);
+    void constraints() {
+      // Matt Austern's book puts DefaultConstructible here, the C++
+      // standard places it in Container
+      //    function_requires< DefaultConstructible<Sequence> >();
+      function_requires< Mutable_ForwardContainerConcept<Sequence> >();
+      function_requires< DefaultConstructibleConcept<Sequence> >();
 
-          typename Sequence::reference r = c.front();
+      Sequence 
+        c(n),
+        c2(n, t),
+        c3(first, last);
 
-          ignore_unused_variable_warning(c);
-          ignore_unused_variable_warning(c2);
-          ignore_unused_variable_warning(c3);
-          ignore_unused_variable_warning(r);
-          const_constraints(c);
-      }
-   private:
-      void const_constraints(const S& c) {
-          typename Sequence::const_reference r = c.front();
-          ignore_unused_variable_warning(r);
-      }
-    
-      typename S::value_type t;
-      typename S::size_type n;
-      typename S::value_type* first, *last;
-      typename S::iterator p, q;
+      c.insert(p, t);
+      c.insert(p, n, t);
+      c.insert(p, first, last);
+
+      c.erase(p);
+      c.erase(p, q);
+
+      reference r = c.front();
+
+      ignore_unused_variable_warning(c);
+      ignore_unused_variable_warning(c2);
+      ignore_unused_variable_warning(c3);
+      ignore_unused_variable_warning(r);
+      const_constraints(c);
+    }
+    void const_constraints(const Sequence& c) {
+      const_reference r = c.front();
+      ignore_unused_variable_warning(r);
+    }
+    typename Sequence::value_type t;
+    typename Sequence::size_type n;
+    typename Sequence::value_type* first, *last;
+    typename Sequence::iterator p, q;
   };
 
-  BOOST_concept(FrontInsertionSequence,(S))
-    : Sequence<S>
+  template <class FrontInsertionSequence>
+  struct FrontInsertionSequenceConcept
   {
-      ~FrontInsertionSequence()
-      {
-          c.push_front(t);
-          c.pop_front();
-      }
-   private:
-      S c;
-      typename S::value_type t;
+    void constraints() {
+      function_requires< SequenceConcept<FrontInsertionSequence> >();
+
+      c.push_front(t);
+      c.pop_front();
+    }
+    FrontInsertionSequence c;
+    typename FrontInsertionSequence::value_type t;
   };
 
-  BOOST_concept(BackInsertionSequence,(S))
-    : Sequence<S>
+  template <class BackInsertionSequence>
+  struct BackInsertionSequenceConcept
   {
-      ~BackInsertionSequence()
-      {
-          c.push_back(t);
-          c.pop_back();
-          typename BackInsertionSequence::reference r = c.back();
-          ignore_unused_variable_warning(r);
-          const_constraints(c);
-      }
-   private:
-      void const_constraints(const S& cc) {
-          typename BackInsertionSequence::const_reference
-              r = cc.back();
-          ignore_unused_variable_warning(r);
-      };
-      S c;
-      typename S::value_type t;
+    typedef typename BackInsertionSequence::reference reference;
+    typedef typename BackInsertionSequence::const_reference const_reference;
+
+    void constraints() {
+      function_requires< SequenceConcept<BackInsertionSequence> >();
+
+      c.push_back(t);
+      c.pop_back();
+      reference r = c.back();
+      ignore_unused_variable_warning(r);
+    }
+    void const_constraints(const BackInsertionSequence& cc) {
+      const_reference r = cc.back();
+      ignore_unused_variable_warning(r);
+    };
+    BackInsertionSequence c;
+    typename BackInsertionSequence::value_type t;
   };
 
-  BOOST_concept(AssociativeContainer,(C))
-    : ForwardContainer<C>
-    , DefaultConstructible<C>
+  template <class AssociativeContainer>
+  struct AssociativeContainerConcept
   {
-      typedef typename C::key_type key_type;
-      typedef typename C::key_compare key_compare;
-      typedef typename C::value_compare value_compare;
-      typedef typename C::iterator iterator;
+    void constraints() {
+      function_requires< ForwardContainerConcept<AssociativeContainer> >();
+      function_requires< DefaultConstructibleConcept<AssociativeContainer> >();
+    
+      i = c.find(k);
+      r = c.equal_range(k);
+      c.erase(k);
+      c.erase(i);
+      c.erase(r.first, r.second);
+      const_constraints(c);
+    }
+    void const_constraints(const AssociativeContainer& cc) {
+      ci = cc.find(k);
+      n = cc.count(k);
+      cr = cc.equal_range(k);
+    }
+    typedef typename AssociativeContainer::iterator iterator;
+    typedef typename AssociativeContainer::const_iterator const_iterator;
 
-      ~AssociativeContainer()
-      {
-          i = c.find(k);
-          r = c.equal_range(k);
-          c.erase(k);
-          c.erase(i);
-          c.erase(r.first, r.second);
-          const_constraints(c);
-          BOOST_CONCEPT_ASSERT((BinaryPredicate<key_compare,key_type,key_type>));
-          
-          typedef typename AssociativeContainer::value_type value_type_;
-          BOOST_CONCEPT_ASSERT((BinaryPredicate<value_compare,value_type_,value_type_>));
-      }
-      
-      // Redundant with the base concept, but it helps below.
-      typedef typename C::const_iterator const_iterator;
-   private:
-      void const_constraints(const C& cc)
-      {
-          ci = cc.find(k);
-          n = cc.count(k);
-          cr = cc.equal_range(k);
-      }
-
-      C c;
-      iterator i;
-      std::pair<iterator,iterator> r;
-      const_iterator ci;
-      std::pair<const_iterator,const_iterator> cr;
-      typename C::key_type k;
-      typename C::size_type n;
+    AssociativeContainer c;
+    iterator i;
+    std::pair<iterator,iterator> r;
+    const_iterator ci;
+    std::pair<const_iterator,const_iterator> cr;
+    typename AssociativeContainer::key_type k;
+    typename AssociativeContainer::size_type n;
   };
 
-  BOOST_concept(UniqueAssociativeContainer,(C))
-    : AssociativeContainer<C>
+  template <class UniqueAssociativeContainer>
+  struct UniqueAssociativeContainerConcept
   {
-      ~UniqueAssociativeContainer()
-      {
-          C c(first, last);
+    void constraints() {
+      function_requires< AssociativeContainerConcept<UniqueAssociativeContainer> >();
+    
+      UniqueAssociativeContainer c(first, last);
       
-          pos_flag = c.insert(t);
-          c.insert(first, last);
+      pos_flag = c.insert(t);
+      c.insert(first, last);
 
-          ignore_unused_variable_warning(c);
-      }
-   private:
-      std::pair<typename C::iterator, bool> pos_flag;
-      typename C::value_type t;
-      typename C::value_type* first, *last;
+      ignore_unused_variable_warning(c);
+    }
+    std::pair<typename UniqueAssociativeContainer::iterator, bool> pos_flag;
+    typename UniqueAssociativeContainer::value_type t;
+    typename UniqueAssociativeContainer::value_type* first, *last;
   };
 
-  BOOST_concept(MultipleAssociativeContainer,(C))
-    : AssociativeContainer<C>
+  template <class MultipleAssociativeContainer>
+  struct MultipleAssociativeContainerConcept
   {
-      ~MultipleAssociativeContainer()
-      {
-          C c(first, last);
+    void constraints() {
+      function_requires< AssociativeContainerConcept<MultipleAssociativeContainer> >();
+
+      MultipleAssociativeContainer c(first, last);
       
-          pos = c.insert(t);
-          c.insert(first, last);
+      pos = c.insert(t);
+      c.insert(first, last);
 
-          ignore_unused_variable_warning(c);
-          ignore_unused_variable_warning(pos);
-      }
-   private:
-      typename C::iterator pos;
-      typename C::value_type t;
-      typename C::value_type* first, *last;
+      ignore_unused_variable_warning(c);
+      ignore_unused_variable_warning(pos);
+    }
+    typename MultipleAssociativeContainer::iterator pos;
+    typename MultipleAssociativeContainer::value_type t;
+    typename MultipleAssociativeContainer::value_type* first, *last;
   };
 
-  BOOST_concept(SimpleAssociativeContainer,(C))
-    : AssociativeContainer<C>
+  template <class SimpleAssociativeContainer>
+  struct SimpleAssociativeContainerConcept
   {
-      ~SimpleAssociativeContainer()
-      {
-          typedef typename C::key_type key_type;
-          typedef typename C::value_type value_type;
-          BOOST_MPL_ASSERT((boost::is_same<key_type,value_type>));
-      }
+    void constraints() {
+      function_requires< AssociativeContainerConcept<SimpleAssociativeContainer> >();
+      typedef typename SimpleAssociativeContainer::key_type key_type;
+      typedef typename SimpleAssociativeContainer::value_type value_type;
+      typedef typename require_same<key_type, value_type>::type req;
+    }
   };
 
-  BOOST_concept(PairAssociativeContainer,(C))
-    : AssociativeContainer<C>
+  template <class SimpleAssociativeContainer>
+  struct PairAssociativeContainerConcept
   {
-      ~PairAssociativeContainer()
-      {
-          typedef typename C::key_type key_type;
-          typedef typename C::value_type value_type;
-          typedef typename C::mapped_type mapped_type;
-          typedef std::pair<const key_type, mapped_type> required_value_type;
-          BOOST_MPL_ASSERT((boost::is_same<value_type,required_value_type>));
-      }
+    void constraints() {
+      function_requires< AssociativeContainerConcept<SimpleAssociativeContainer> >();
+      typedef typename SimpleAssociativeContainer::key_type key_type;
+      typedef typename SimpleAssociativeContainer::value_type value_type;
+      typedef typename SimpleAssociativeContainer::mapped_type mapped_type;
+      typedef std::pair<const key_type, mapped_type> required_value_type;
+      typedef typename require_same<value_type, required_value_type>::type req;
+    }
   };
 
-  BOOST_concept(SortedAssociativeContainer,(C))
-    : AssociativeContainer<C>
-    , ReversibleContainer<C>
+  template <class SortedAssociativeContainer>
+  struct SortedAssociativeContainerConcept
   {
-      ~SortedAssociativeContainer()
-      {
-          C 
-              c(kc),
-              c2(first, last),
-              c3(first, last, kc);
+    void constraints() {
+      function_requires< AssociativeContainerConcept<SortedAssociativeContainer> >();
+      function_requires< ReversibleContainerConcept<SortedAssociativeContainer> >();
 
-          p = c.upper_bound(k);
-          p = c.lower_bound(k);
-          r = c.equal_range(k);
+      SortedAssociativeContainer 
+        c(kc),
+        c2(first, last),
+        c3(first, last, kc);
+
+      p = c.upper_bound(k);
+      p = c.lower_bound(k);
+      r = c.equal_range(k);
       
-          c.insert(p, t);
+      c.insert(p, t);
       
-          ignore_unused_variable_warning(c);
-          ignore_unused_variable_warning(c2);
-          ignore_unused_variable_warning(c3);
-          const_constraints(c);
-      }
-      
-      void const_constraints(const C& c)
-      {
-          kc = c.key_comp();
-          vc = c.value_comp();
+      ignore_unused_variable_warning(c);
+      ignore_unused_variable_warning(c2);
+      ignore_unused_variable_warning(c3);
+    }
+    void const_constraints(const SortedAssociativeContainer& c) {
+      kc = c.key_comp();
+      vc = c.value_comp();
 
-          cp = c.upper_bound(k);
-          cp = c.lower_bound(k);
-          cr = c.equal_range(k);
-      }
-      
-   private:
-      typename C::key_compare kc;
-      typename C::value_compare vc;
-      typename C::value_type t;
-      typename C::key_type k;
-      typedef typename C::iterator iterator;
-      typedef typename C::const_iterator const_iterator;
-
-      typedef SortedAssociativeContainer self;
-      iterator p;
-      const_iterator cp;
-      std::pair<typename self::iterator,typename self::iterator> r;
-      std::pair<typename self::const_iterator,typename self::const_iterator> cr;
-      typename C::value_type* first, *last;
+      cp = c.upper_bound(k);
+      cp = c.lower_bound(k);
+      cr = c.equal_range(k);
+    }
+    typename SortedAssociativeContainer::key_compare kc;
+    typename SortedAssociativeContainer::value_compare vc;
+    typename SortedAssociativeContainer::value_type t;
+    typename SortedAssociativeContainer::key_type k;
+    typedef typename SortedAssociativeContainer::iterator iterator;
+    typedef typename SortedAssociativeContainer::const_iterator const_iterator;
+    iterator p;
+    const_iterator cp;
+    std::pair<iterator,iterator> r;
+    std::pair<const_iterator,const_iterator> cr;
+    typename SortedAssociativeContainer::value_type* first, *last;
   };
 
   // HashedAssociativeContainer
 
 } // namespace boost
 
-# include <boost/concept/detail/concept_undef.hpp>
-
 #endif // BOOST_CONCEPT_CHECKS_HPP
 

Modified: boost/trunk/boost/config/compiler/hp_acc.hpp
===================================================================
--- boost/trunk/boost/config/compiler/hp_acc.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/config/compiler/hp_acc.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,11 @@
 //  (C) Copyright John Maddock 2001 - 2003. 
 //  (C) Copyright Jens Maurer 2001 - 2003. 
+//  (C) Copyright John Maddock 2001 - 2003. 
+//  (C) Copyright Jens Maurer 2001 - 2003. 
 //  (C) Copyright Aleksey Gurtovoy 2002. 
 //  (C) Copyright David Abrahams 2002 - 2003. 
 //  (C) Copyright Toon Knapen 2003. 
+//  (C) Copyright Boris Gubenko 2006.
 //  Use, modification and distribution are subject to the 
 //  Boost Software License, Version 1.0. (See accompanying file 
 //  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -11,6 +14,10 @@
 
 //  HP aCC C++ compiler setup:
 
+#if (__HP_aCC >= 61200) && defined(__EDG__)
+#include "boost/config/compiler/common_edg.hpp"
+#endif
+
 #if (__HP_aCC <= 33100)
 #    define BOOST_NO_INTEGRAL_INT64_T
 #    define BOOST_NO_OPERATORS_IN_NAMESPACE
@@ -27,14 +34,13 @@
 #    define BOOST_NO_USING_DECLARATION_OVERLOADS_FROM_TYPENAME_BASE
 #endif
 
-#if (__HP_aCC <= 33900) || !defined(BOOST_STRICT_CONFIG)
+#if (__HP_aCC < 60000) 
 #    define BOOST_NO_UNREACHABLE_RETURN_DETECTION
 #    define BOOST_NO_TEMPLATE_TEMPLATES
 #    define BOOST_NO_SWPRINTF
 #    define BOOST_NO_DEPENDENT_TYPES_IN_TEMPLATE_VALUE_PARAMETERS
 #    define BOOST_NO_IS_ABSTRACT
-//     std lib config should set this one already:
-//#    define BOOST_NO_STD_ALLOCATOR
+#    define BOOST_NO_MEMBER_TEMPLATE_FRIENDS
 #endif 
 
 // optional features rather than defects:
@@ -47,24 +53,20 @@
 #    define BOOST_NO_MEMBER_TEMPLATE_KEYWORD
 #endif
 
-#define BOOST_NO_MEMBER_TEMPLATE_FRIENDS
-
 #define BOOST_COMPILER "HP aCC version " BOOST_STRINGIZE(__HP_aCC)
 
 //
 // versions check:
-// we don't support HP aCC prior to version 0:
+// we don't support HP aCC prior to version 33000:
 #if __HP_aCC < 33000
 #  error "Compiler not supported or configured - please reconfigure"
 #endif
 //
-// last known and checked version is 0:
-#if (__HP_aCC > 53800)
+// last known and checked version is 61300:
+#if (__HP_aCC > 61300)
 #  if defined(BOOST_ASSERT_CONFIG)
 #     error "Unknown compiler version - please run the configure tests and report the results"
 #  endif
 #endif
 
 
-
-

Modified: boost/trunk/boost/config/compiler/vacpp.hpp
===================================================================
--- boost/trunk/boost/config/compiler/vacpp.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/config/compiler/vacpp.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -27,7 +27,6 @@
 
 #if (__IBMCPP__ <= 600) || !defined(BOOST_STRICT_CONFIG)
 #  define BOOST_NO_POINTER_TO_MEMBER_TEMPLATE_PARAMETERS
-#  define BOOST_MPL_CFG_ASSERT_USE_RELATION_NAMES 1
 #endif
 
 //

Modified: boost/trunk/boost/config/platform/hpux.hpp
===================================================================
--- boost/trunk/boost/config/platform/hpux.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/config/platform/hpux.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,6 +2,7 @@
 //  (C) Copyright Jens Maurer 2001 - 2003. 
 //  (C) Copyright David Abrahams 2002. 
 //  (C) Copyright Toon Knapen 2003. 
+//  (C) Copyright Boris Gubenko 2006.
 //  Use, modification and distribution are subject to the 
 //  Boost Software License, Version 1.0. (See accompanying file 
 //  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -15,11 +16,15 @@
 // In principle, HP-UX has a nice <stdint.h> under the name <inttypes.h>
 // However, it has the following problem:
 // Use of UINT32_C(0) results in "0u l" for the preprocessed source
-// (verifyable with gcc 2.95.3, assumed for HP aCC)
-// #define BOOST_HAS_STDINT_H
+// (verifyable with gcc 2.95.3)
+#if (defined(__GNUC__) && (__GNUC__ >= 3)) || defined(__HP_aCC)
+#  define BOOST_HAS_STDINT_H
+#endif
 
-#define BOOST_NO_SWPRINTF 
-#define BOOST_NO_CWCTYPE
+#if !(defined(__HP_aCC) || !defined(_INCLUDE__STDC_A1_SOURCE))
+#  define BOOST_NO_SWPRINTF
+#  define BOOST_NO_CWCTYPE
+#endif
 
 #if defined(__GNUC__)
 #  if (__GNUC__ < 3) || ((__GNUC__ == 3) && (__GNUC_MINOR__ < 3))
@@ -30,6 +35,8 @@
 #     define BOOST_HAS_THREADS
 #     define BOOST_HAS_PTHREADS
 #  endif
+#elif defined(__HP_aCC) && !defined(BOOST_DISABLE_THREADS)
+#  define BOOST_HAS_PTHREADS
 #endif
 
 // boilerplate code:
@@ -64,5 +71,15 @@
 #ifndef BOOST_HAS_SIGACTION
 #  define BOOST_HAS_SIGACTION
 #endif
+#ifndef BOOST_HAS_NRVO 
+#  define BOOST_HAS_NRVO
+#endif
+#ifndef BOOST_HAS_LOG1P 
+#  define BOOST_HAS_LOG1P
+#endif
+#ifndef BOOST_HAS_EXPM1
+#  define BOOST_HAS_EXPM1
+#endif
 
 
+

Modified: boost/trunk/boost/date_time/date_parsing.hpp
===================================================================
--- boost/trunk/boost/date_time/date_parsing.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/date_time/date_parsing.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,11 +2,13 @@
 #define _DATE_TIME_DATE_PARSING_HPP___
 
 /* Copyright (c) 2002,2003,2005 CrystalClear Software, Inc.
- * Use, modification and distribution is subject to the 
- * Boost Software License, Version 1.0. (See accompanying
- * file LICENSE-1.0 or http://www.boost.org/LICENSE-1.0)
+ *
+ * Distributed under the Boost Software License, Version 1.0.
+ *     (See accompanying file LICENSE_1_0.txt or copy at
+ *           http://www.boost.org/LICENSE_1_0.txt)
+ *
  * Author: Jeff Garland, Bart Garst
- * $Date: 2006/03/21 02:26:30 $
+ * $Date: 2006/07/17 03:48:31 $
  */
 
 #include "boost/tokenizer.hpp"
@@ -77,8 +79,8 @@
     /*! find_match searches both arrays for a match to 's'. Indexing of the 
      * arrays is from 0 to 'limit'. The index of the match is returned.
      * Ex. "Jan" returns 0, "Dec" returns 11, "Tue" returns 2.
-     * 'limit' can be sent in with: greg_month::max(), 
-     * greg_weekday::max() or date_time::NumSpecialValues */
+     * 'limit' can be sent in with: (greg_month::max)(), 
+     * (greg_weekday::max)() or date_time::NumSpecialValues */
     template<class charT>
     short find_match(const charT* const* short_names, 
                      const charT* const* long_names, 

Modified: boost/trunk/boost/date_time/gregorian/gregorian_io.hpp
===================================================================
--- boost/trunk/boost/date_time/gregorian/gregorian_io.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/date_time/gregorian/gregorian_io.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
  * Boost Software License, Version 1.0. (See accompanying
  * file LICENSE-1.0 or http://www.boost.org/LICENSE-1.0)
  * Author: Jeff Garland, Bart Garst
- * $Date: 2006/03/26 21:35:58 $
+ * $Date: 2006/03/26 21:29:10 $
  */
 
 #include "boost/date_time/date_facet.hpp"

Modified: boost/trunk/boost/date_time/locale_config.hpp
===================================================================
--- boost/trunk/boost/date_time/locale_config.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/date_time/locale_config.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,12 +1,12 @@
 #ifndef DATE_TIME_LOCALE_CONFIG_HPP___
 #define DATE_TIME_LOCALE_CONFIG_HPP___
 
-/* Copyright (c) 2002-2006 CrystalClear Software, Inc.
+/* Copyright (c) 2002,2003 CrystalClear Software, Inc.
  * Use, modification and distribution is subject to the
  * Boost Software License, Version 1.0. (See accompanying
  * file LICENSE-1.0 or http://www.boost.org/LICENSE-1.0)
  * Author: Jeff Garland
- * $Date: 2006/05/23 14:38:15 $
+ * $Date: 2006/05/23 14:33:55 $
  */
 
 // This file configures whether the library will support locales and hence

Modified: boost/trunk/boost/date_time/period.hpp
===================================================================
--- boost/trunk/boost/date_time/period.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/date_time/period.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,12 +1,15 @@
 #ifndef DATE_TIME_PERIOD_HPP___
 #define DATE_TIME_PERIOD_HPP___
 
-/* Copyright (c) 2002,2003 CrystalClear Software, Inc.
- * Use, modification and distribution is subject to the 
- * Boost Software License, Version 1.0. (See accompanying
- * file LICENSE-1.0 or http://www.boost.org/LICENSE-1.0)
+/*    Copyright (c) 2002,2003 CrystalClear Software, Inc.
+ *
+ * Distributed under the Boost Software License, Version 1.0.
+ *     (See accompanying file LICENSE_1_0.txt or copy at
+ *           http://www.boost.org/LICENSE_1_0.txt)
+ *
+ *
  * Author: Jeff Garland, Bart Garst 
- * $Date: 2006/03/26 20:11:55 $
+ * $Date: 2006/07/17 03:56:05 $
  */
 
 /*! \file period.hpp
@@ -67,7 +70,6 @@
     bool operator==(const period& rhs) const;
     bool operator<(const period& rhs) const;
     void shift(const duration_rep& d);
-    void expand(const duration_rep& d);
     bool contains(const point_rep& point) const;
     bool contains(const period& other) const;
     bool intersects(const period& other) const;
@@ -176,33 +178,6 @@
     last_  = last_  + d;
   }
 
-  /** Expands the size of the period by the duration on both ends.
-   *
-   *So before expand 
-   *@code
-   *
-   *         [-------]
-   * ^   ^   ^   ^   ^   ^  ^
-   * 1   2   3   4   5   6  7
-   * 
-   *@endcode
-   * After expand(2)
-   *@code
-   *
-   * [----------------------]
-   * ^   ^   ^   ^   ^   ^  ^
-   * 1   2   3   4   5   6  7
-   * 
-   *@endcode
-   */
-  template<class point_rep, class duration_rep>
-  inline
-  void period<point_rep,duration_rep>::expand(const duration_rep& d)
-  {
-    begin_ = begin_ - d;
-    last_  = last_  + d;
-  }
-
   //! True if the point is inside the period, zero length periods contain no points
   template<class point_rep, class duration_rep>
   inline
@@ -350,8 +325,8 @@
 
   //! Combine two periods with earliest start and latest end.
   /*! Combines two periods and any gap between them such that 
-   *  start = min(p1.start, p2.start)
-   *  end   = max(p1.end  , p2.end)
+   *  start = minimum(p1.start, p2.start)
+   *  end   = maximum(p1.end  , p2.end)
    *@code
    *        [---p1---)
    *                       [---p2---)

Modified: boost/trunk/boost/date_time/string_parse_tree.hpp
===================================================================
--- boost/trunk/boost/date_time/string_parse_tree.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/date_time/string_parse_tree.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
  * Boost Software License, Version 1.0. (See accompanying
  * file LICENSE-1.0 or http://www.boost.org/LICENSE-1.0)
  * Author: Jeff Garland, Bart Garst
- * $Date: 2006/02/26 20:10:18 $
+ * $Date: 2006/06/23 17:55:18 $
  */
 
 
@@ -45,7 +45,8 @@
   }
   //! Returns true if more characters were parsed than was necessary
   /*! Should be used in conjunction with last_char() 
-   * to get the remaining character. */
+   *  to get the remaining character. 
+   */
   bool has_remaining() const
   {
     return (cache.size() > match_depth);
@@ -55,10 +56,8 @@
   string_type cache;
   unsigned short match_depth;
   short current_match;
-  static const short PARSE_ERROR;
+  enum PARSE_STATE { PARSE_ERROR= -1 };
 };
-template<typename charT>
-const short parse_match_result<charT>::PARSE_ERROR = -1;
 
   //for debug -- really only char streams...
 template<typename charT>

Copied: boost/trunk/boost/date_time.hpp (from rev 14034, boost/branches/upstream/current/boost/date_time.hpp)

Modified: boost/trunk/boost/detail/algorithm.hpp
===================================================================
--- boost/trunk/boost/detail/algorithm.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/detail/algorithm.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,6 @@
-// (C) Copyright Jeremy Siek 2001. Permission to copy, use, modify,
-// sell and distribute this software is granted provided this
-// copyright notice appears in all copies. This software is provided
-// "as is" without express or implied warranty, and with no claim as
-// to its suitability for any purpose.
+// (C) Copyright Jeremy Siek 2001.
+// Distributed under the Boost Software License, Version 1.0. (See accompany-
+// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 /*
  *
@@ -178,17 +176,6 @@
     return all(begin(c), end(c), p);
   }
 
-  template <typename InputIterator, typename Predicate>
-  bool none(InputIterator first, InputIterator last, Predicate p)
-  {
-    return std::find_if(first, last, p) == last;
-  }
-  template <typename Container, typename Predicate>
-  bool none(const Container& c, Predicate p)
-  {
-    return none(begin(c), end(c), p);
-  }
-
   template <typename Container, typename T>
   std::size_t count(const Container& c, const T& value)
   {

Modified: boost/trunk/boost/detail/bad_weak_ptr.hpp
===================================================================
--- boost/trunk/boost/detail/bad_weak_ptr.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/detail/bad_weak_ptr.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -42,7 +42,7 @@
 
     virtual char const * what() const throw()
     {
-        return "boost::bad_weak_ptr";
+        return "tr1::bad_weak_ptr";
     }
 };
 

Modified: boost/trunk/boost/detail/dynamic_bitset.hpp
===================================================================
--- boost/trunk/boost/detail/dynamic_bitset.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/detail/dynamic_bitset.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -151,7 +151,7 @@
     // for static_asserts
     template <typename T>
     struct dynamic_bitset_allowed_block_type {
-        enum { value = T(-1) > 0 }; // ensure T has no sign
+        enum { value = (T(-1) > 0) }; // ensure T has no sign
     };
 
     template <>

Modified: boost/trunk/boost/detail/endian.hpp
===================================================================
--- boost/trunk/boost/detail/endian.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/detail/endian.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+// Copyright 2005 Caleb Epstein
+// Copyright 2006 John Maddock
+// Distributed under the Boost Software License, Version 1.0. (See accompany-
+// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 /*
  * Copyright (c) 1997
  * Silicon Graphics Computer Systems, Inc.
@@ -37,9 +42,15 @@
 #  error Unknown machine endianness detected.
 # endif
 # define BOOST_BYTE_ORDER __BYTE_ORDER
+#elif defined(_BIG_ENDIAN)
+# define BOOST_BIG_ENDIAN
+# define BOOST_BYTE_ORDER 4321
+#elif defined(_LITTLE_ENDIAN)
+# define BOOST_LITTLE_ENDIAN
+# define BOOST_BYTE_ORDER 1234
 #elif defined(__sparc) || defined(__sparc__) \
    || defined(_POWER) || defined(__powerpc__) \
-   || defined(__ppc__) || defined(__hppa) \
+   || defined(__ppc__) || defined(__hpux) \
    || defined(_MIPSEB) || defined(_POWER) \
    || defined(__s390__)
 # define BOOST_BIG_ENDIAN
@@ -47,7 +58,11 @@
 #elif defined(__i386__) || defined(__alpha__) \
    || defined(__ia64) || defined(__ia64__) \
    || defined(_M_IX86) || defined(_M_IA64) \
-   || defined(_M_ALPHA)
+   || defined(_M_ALPHA) || defined(__amd64) \
+   || defined(__amd64__) || defined(_M_AMD64) \
+   || defined(__x86_64) || defined(__x86_64__) \
+   || defined(_M_X64)
+
 # define BOOST_LITTLE_ENDIAN
 # define BOOST_BYTE_ORDER 1234
 #else

Deleted: boost/trunk/boost/detail/has_default_constructor.hpp
===================================================================
--- boost/trunk/boost/detail/has_default_constructor.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/detail/has_default_constructor.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,29 +0,0 @@
-
-//  (C) Copyright Matthias Troyerk 2006.
-//  Use, modification and distribution are subject to the Boost Software License,
-//  Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt).
-//
-//  See http://www.boost.org/libs/type_traits for most recent version including documentation.
-
-#ifndef BOOST_DETAIL_HAS_DEFAULT_CONSTRUCTOR_HPP_INCLUDED
-#define BOOST_DETAIL_HAS_DEFAULT_CONSTRUCTOR_HPP_INCLUDED
-
-#include <boost/type_traits/has_trivial_constructor.hpp>
-
-namespace boost { namespace detail {
-
-/// type trait to check for a default constructor
-///
-/// The default implementation just checks for a trivial constructor.
-/// Using some compiler magic it might be possible to provide a better default
-
-template <class T>
-struct has_default_constructor
- : public has_trivial_constructor<T>
-{};
-
-} } // namespace boost::detail
-
-
-#endif // BOOST_DETAIL_HAS_DEFAULT_CONSTRUCTOR_HPP_INCLUDED

Modified: boost/trunk/boost/detail/indirect_traits.hpp
===================================================================
--- boost/trunk/boost/detail/indirect_traits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/detail/indirect_traits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -388,27 +388,27 @@
 outer_no_type reference_to_pointer_helper(...);
 
 template <class T>
-struct is_reference_to_pointer
+struct reference_to_pointer_impl
 {
     static T t;
     BOOST_STATIC_CONSTANT(
         bool, value
-        = (is_reference<T>::value
-           && sizeof((reference_to_pointer_helper)(t)) == sizeof(inner_yes_type))
+        = (sizeof((reference_to_pointer_helper)(t)) == sizeof(inner_yes_type))
         );
     
     typedef mpl::bool_<value> type;
-    
+};
+   
+template <class T>
+struct is_reference_to_pointer
+  : mpl::eval_if<is_reference<T>, reference_to_pointer_impl<T>, mpl::false_>::type
+{   
     BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_reference_to_pointer,(T))
 };
 
 template <class T>
 struct is_reference_to_function_pointer
-    : mpl::if_<
-          is_reference<T>
-        , is_pointer_to_function_aux<T>
-        , mpl::bool_<false>
-     >::type
+  : mpl::eval_if<is_reference<T>, is_pointer_to_function_aux<T>, mpl::false_>::type
 {
     BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_reference_to_function_pointer,(T))
 };

Modified: boost/trunk/boost/detail/limits.hpp
===================================================================
--- boost/trunk/boost/detail/limits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/detail/limits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright 2001 John Maddock
+// Distributed under the Boost Software License, Version 1.0. (See accompany-
+// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 /*
  * Copyright (c) 1997
  * Silicon Graphics Computer Systems, Inc.

Modified: boost/trunk/boost/detail/utf8_codecvt_facet.hpp
===================================================================
--- boost/trunk/boost/detail/utf8_codecvt_facet.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/detail/utf8_codecvt_facet.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,7 @@
 // Copyright © 2001 Ronald Garcia, Indiana University (garcia at osl.iu.edu)
-// Andrew Lumsdaine, Indiana University (lums at osl.iu.edu). Permission to copy, 
-// use, modify, sell and distribute this software is granted provided this
-// copyright notice appears in all copies. This software is provided "as is"
-// without express or implied warranty, and with no claim as to its suitability
-// for any purpose.
+// Andrew Lumsdaine, Indiana University (lums at osl.iu.edu).
+// Distributed under the Boost Software License, Version 1.0. (See accompany-
+// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_UTF8_CODECVT_FACET_HPP
 #define BOOST_UTF8_CODECVT_FACET_HPP

Modified: boost/trunk/boost/dynamic_bitset/dynamic_bitset.hpp
===================================================================
--- boost/trunk/boost/dynamic_bitset/dynamic_bitset.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/dynamic_bitset/dynamic_bitset.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -419,19 +419,11 @@
 
 };
 
-#if defined(__IBMCPP__) && BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(600))
+#if BOOST_WORKAROUND( __IBMCPP__, <=600 )
 
 // Workaround for IBM's AIX platform.
 // See http://comments.gmane.org/gmane.comp.lib.boost.user/15331
-//
-// Note:
-//  The compiler is actually right, until core issue 454 will be settled:
-//   http://www.open-std.org/JTC1/SC22/WG21/docs/cwg_active.html#454
-//
-//  Considering the direction taken by the committee, however, the
-//  BOOST_WORKAROUND macro seems ok for the future. (G. Prota)
 
-
 template<typename Block, typename Allocator>
 dynamic_bitset<Block, Allocator>::block_width_type const
 dynamic_bitset<Block, Allocator>::bits_per_block;
@@ -470,15 +462,18 @@
 template <typename Block, typename Allocator>
 std::istream& operator>>(std::istream& is, dynamic_bitset<Block,Allocator>& b);
 #else
-template <typename CharT, typename Traits, typename Block, typename Allocator>
-std::basic_ostream<CharT, Traits>&
-operator<<(std::basic_ostream<CharT, Traits>& os,
-           const dynamic_bitset<Block, Allocator>& b);
+// NOTE: Digital Mars wants the same template parameter names
+//       here and in the definition! [last tested: 8.48.10]
+//
+template <typename Ch, typename Tr, typename Block, typename Alloc>
+std::basic_ostream<Ch, Tr>&
+operator<<(std::basic_ostream<Ch, Tr>& os,
+           const dynamic_bitset<Block, Alloc>& b);
 
-template <typename CharT, typename Traits, typename Block, typename Allocator>
-std::basic_istream<CharT, Traits>&
-operator>>(std::basic_istream<CharT, Traits>& is,
-           dynamic_bitset<Block, Allocator>& b);
+template <typename Ch, typename Tr, typename Block, typename Alloc>
+std::basic_istream<Ch, Tr>&
+operator>>(std::basic_istream<Ch, Tr>& is,
+           dynamic_bitset<Block, Alloc>& b);
 #endif
 
 // bitset operations
@@ -1123,24 +1118,24 @@
 
   // Ok, from now on we can be sure there's no "on" bit beyond
   // the allowed positions
-  typedef unsigned long result_type;
 
-  /* if find_next() did its job correctly we don't need this if,
-     because all bits we care about are in the first block
   if (bits_per_block >= ulong_width)
-    return static_cast<result_type>(m_bits[0]);*/
+      return m_bits[0];
 
+
   size_type last_block = block_index((std::min)(m_num_bits-1, // gps
-                                       (size_type)(ulong_width-1)));
-  result_type result = 0;
+                                    (size_type)(ulong_width-1)));
+  unsigned long result = 0;
   for (size_type i = 0; i <= last_block; ++i) {
 
     assert((size_type)bits_per_block * i < (size_type)ulong_width); // gps
 
-    result |= (m_bits[i] << (bits_per_block * i));
+    unsigned long piece = m_bits[i];
+    result |= (piece << (bits_per_block * i));
   }
 
   return result;
+
 }
 
 

Modified: boost/trunk/boost/format/exceptions.hpp
===================================================================
--- boost/trunk/boost/format/exceptions.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/format/exceptions.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,12 +2,15 @@
 // boost/format/exceptions.hpp 
 // ----------------------------------------------------------------------------
 
-//  Copyright Samuel Krempp 2003. Use, modification, and distribution are
-//  subject to the Boost Software License, Version 1.0. (See accompanying
-//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+//  Copyright Samuel Krempp 2003.
+//
+// Distributed under the Boost Software License, Version 1.0.
+//    (See accompanying file LICENSE_1_0.txt or copy at
+//          http://www.boost.org/LICENSE_1_0.txt)
+//
+//
+//  See http://www.boost.org/libs/format/ for library home page
 
-//  See http://www.boost.org/libs/format for library home page
-
 // ----------------------------------------------------------------------------
 
 #ifndef BOOST_FORMAT_EXCEPTIONS_HPP
@@ -56,7 +59,7 @@
             std::size_t get_expected() const { return expected_; }
             virtual const char *what() const throw() {
                 return "boost::too_few_args: "
-                    "format-string refered to more arguments than were passed";
+                    "format-string referred to more arguments than were passed";
             }
         };
 
@@ -70,7 +73,7 @@
             std::size_t get_expected() const { return expected_; }
             virtual const char *what() const throw() {
                 return "boost::too_many_args: "
-                    "format-string refered to less arguments than were passed";
+                    "format-string referred to less arguments than were passed";
             }
         };
 
@@ -87,7 +90,7 @@
             virtual const char *what() const throw() {
                 return "boost::out_of_range: "
                     "tried to refer to an argument (or item) number which"
-                    " is out of range, according to the format string.";
+                    " is out of range, according to the format string";
             }
         };
 

Modified: boost/trunk/boost/format/feed_args.hpp
===================================================================
--- boost/trunk/boost/format/feed_args.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/format/feed_args.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -63,7 +63,8 @@
             if(n_before) res.append(n_before, fill_char);
             if(prefix_space) 
               res.append(1, prefix_space);
-            res.append(beg, size);
+            if (size)  
+              res.append(beg, size);
             if(n_after) res.append(n_after, fill_char);
         }
     } // -mk_str(..) 

Modified: boost/trunk/boost/function/function_base.hpp
===================================================================
--- boost/trunk/boost/function/function_base.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/function/function_base.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -284,10 +284,8 @@
               reinterpret_cast<const functor_type*>(&in_buffer.data);
             new ((void*)&out_buffer.data) functor_type(*in_functor);
           } else if (op == destroy_functor_tag) {
-            functor_type* out_functor = 
-              reinterpret_cast<functor_type*>(&out_buffer.data);
             // Some compilers (Borland, vc6, ...) are unhappy with ~functor_type.
-            out_functor->~Functor();
+            reinterpret_cast<functor_type*>(&out_buffer.data)->~Functor();
           } else /* op == check_functor_type_tag */ {
             const std::type_info& check_type = 
               *static_cast<const std::type_info*>(out_buffer.const_obj_ptr);

Modified: boost/trunk/boost/function/function_template.hpp
===================================================================
--- boost/trunk/boost/function/function_template.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/function/function_template.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -70,6 +70,16 @@
 #  define BOOST_FUNCTION_RETURN(X) X; return BOOST_FUNCTION_VOID_RETURN_TYPE ()
 #endif
 
+#ifdef BOOST_MSVC
+#  pragma warning(push)
+#  pragma warning(disable: 4127) // conditional expression is constant.
+#endif
+
+#ifdef BOOST_MSVC
+#  pragma warning(push)
+#  pragma warning(disable: 4127) // conditional expression is constant.
+#endif
+
 namespace boost {
   namespace detail {
     namespace function {
@@ -788,11 +798,19 @@
   }
 };
 
+#ifdef BOOST_MSVC
+# pragma warning(pop)
+#endif
+
 #undef BOOST_FUNCTION_PARTIAL_SPEC
 #endif // have partial specialization
 
 } // end namespace boost
 
+#ifdef BOOST_MSVC
+# pragma warning(pop)
+#endif
+
 // Cleanup after ourselves...
 #undef BOOST_FUNCTION_VTABLE
 #undef BOOST_FUNCTION_DEFAULT_ALLOCATOR

Modified: boost/trunk/boost/functional/hash/hash.hpp
===================================================================
--- boost/trunk/boost/functional/hash/hash.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/functional/hash/hash.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -41,7 +41,15 @@
     std::size_t hash_value(long);
     std::size_t hash_value(unsigned long);
 
-#if !BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x847))
+#if defined(BOOST_MSVC) && defined(_WIN64)
+    // On 64-bit windows std::size_t is a typedef for unsigned long long, which
+    // isn't due to be supported until Boost 1.35. So add support here.
+    // (Technically, Boost.Hash isn't actually documented as supporting
+    // std::size_t. But it would be pretty silly not to).
+    std::size_t hash_value(std::size_t);
+#endif
+
+#if !BOOST_WORKAROUND(__DMC__, <= 0x848)
     template <class T> std::size_t hash_value(T* const&);
 #else
     template <class T> std::size_t hash_value(T*);
@@ -108,8 +116,20 @@
         return static_cast<std::size_t>(v);
     }
 
+#if defined(_M_X64) && defined(_WIN64)
+    inline std::size_t hash_value(long long v)
+    {
+        return v;
+    }
+
+    inline std::size_t hash_value(unsigned long long v)
+    {
+        return v;
+    }
+#endif
+
     // Implementation by Alberto Barbati and Dave Harris.
-#if !BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x847))
+#if !BOOST_WORKAROUND(__DMC__, <= 0x848)
     template <class T> std::size_t hash_value(T* const& v)
 #else
     template <class T> std::size_t hash_value(T* v)
@@ -388,7 +408,7 @@
     }
 
     template <class T> struct hash
-        : public hash_detail::hash_impl<boost::is_pointer<T>::value>
+        : public boost::hash_detail::hash_impl<boost::is_pointer<T>::value>
             ::BOOST_NESTED_TEMPLATE inner<T>
     {
     };
@@ -468,7 +488,7 @@
 #endif
     };
 
-#if BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x847))
+#if BOOST_WORKAROUND(__DMC__, <= 0x848)
     template <class T, unsigned int n> struct hash<T[n]>
         : std::unary_function<T[n], std::size_t>
     {
@@ -479,7 +499,7 @@
     };
 #endif
 
-#elif !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
+#else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 
     // On compilers without partial specialization, boost::hash<T>
     // has already been declared to deal with pointers, so just
@@ -487,6 +507,11 @@
 
     namespace hash_detail
     {
+        template <bool IsPointer>
+        struct hash_impl;
+
+#if !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
+
         template <>
         struct hash_impl<false>
         {
@@ -507,15 +532,12 @@
 #endif
             };
         };
-    }
 
 #else // Visual C++ 6.5
 
     // There's probably a more elegant way to Visual C++ 6.5 to work
     // but I don't know what it is.
 
-    namespace hash_detail
-    {
         template <bool IsConst>
         struct hash_impl_msvc
         {
@@ -560,8 +582,10 @@
             template <class T>
             struct inner : public hash_impl_msvc2<T> {};
         };
+
+#endif // Visual C++ 6.5
     }
-#endif
+#endif  // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 }
 
 #endif

Modified: boost/trunk/boost/functional.hpp
===================================================================
--- boost/trunk/boost/functional.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/functional.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,21 +1,13 @@
 // ------------------------------------------------------------------------------
+// Copyright (c) 2000 Cadenza New Zealand Ltd
+// Distributed under the Boost Software License, Version 1.0. (See accompany-
+// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+// ------------------------------------------------------------------------------
 // Boost functional.hpp header file
 // See http://www.boost.org/libs/functional for documentation.
 // ------------------------------------------------------------------------------
-// Copyright (c) 2000
-// Cadenza New Zealand Ltd
-//
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without
-// fee, provided that the above copyright notice appears in all copies
-// and that both the copyright notice and this permission notice
-// appear in supporting documentation.  Cadenza New Zealand Ltd makes
-// no representations about the suitability of this software for any
-// purpose.  It is provided "as is" without express or implied
-// warranty.
+// $Id: functional.hpp,v 1.4.20.1 2006/12/02 14:17:26 andreas_huber69 Exp $
 // ------------------------------------------------------------------------------
-// $Id: functional.hpp,v 1.4 2002/12/27 16:51:52 beman_dawes Exp $
-// ------------------------------------------------------------------------------
 
 #ifndef BOOST_FUNCTIONAL_HPP
 #define BOOST_FUNCTIONAL_HPP

Modified: boost/trunk/boost/graph/adj_list_serialize.hpp
===================================================================
--- boost/trunk/boost/graph/adj_list_serialize.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/adj_list_serialize.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,10 +19,20 @@
 #include <boost/serialization/split_free.hpp>
 
 namespace boost { 
+
 namespace serialization {
 
+// Turn off tracking for adjacency_list. It's not polymorphic, and we
+// need to do this to enable saving of non-const adjacency lists.
+template<class OEL, class VL, class D, class VP, class EP, class GP, class EL>
+struct tracking_level<boost::adjacency_list<OEL,VL,D,VP,EP,GP,EL> > {
+  typedef mpl::integral_c_tag tag;
+  typedef mpl::int_<track_never> type;
+  BOOST_STATIC_CONSTANT(int, value = tracking_level::type::value);
+};
+
 template<class Archive, class OEL, class VL, class D, 
-	 class VP, class EP, class GP, class EL>
+     class VP, class EP, class GP, class EL>
 inline void save(
     Archive & ar,
     const boost::adjacency_list<OEL,VL,D,VP,EP,GP,EL> &graph,
@@ -42,21 +52,21 @@
   typename graph_traits<Graph>::vertex_iterator vi;
   for (vi = vertices(graph).first; vi != vertices(graph).second; ++vi) {
     indices[*vi] = num++;
-    ar << get(vertex_all_t(), graph, *vi);
+    ar << serialization::make_nvp("vertex_property", get(vertex_all_t(), graph, *vi) );
   }
   
   // write edges
   typename graph_traits<Graph>::edge_iterator ei;
   for (ei = edges(graph).first; ei != edges(graph).second; ++ei){
-    ar << BOOST_SERIALIZATION_NVP(indices[source(*ei,graph)]);
-    ar << BOOST_SERIALIZATION_NVP(indices[target(*ei,graph)]);
-    ar << get(edge_all_t(), graph, *ei);
+    ar << serialization::make_nvp("u" , indices[source(*ei,graph)]);
+    ar << serialization::make_nvp("v" , indices[target(*ei,graph)]);
+    ar << serialization::make_nvp("edge_property", get(edge_all_t(), graph, *ei) );
   }
 }
 
 
 template<class Archive, class OEL, class VL, class D,
-	 class VP, class EP, class GP, class EL>
+     class VP, class EP, class GP, class EL>
 inline void load(
     Archive & ar,
     boost::adjacency_list<OEL,VL,D,VP,EP,GP,EL> &graph,
@@ -76,7 +86,7 @@
   while(V-- > 0){
     Vertex v = add_vertex(graph);
     verts[i++] = v;
-    ar >> graph[v];
+    ar >> serialization::make_nvp("vertex_property", get(vertex_all_t(), graph, v) );
   }
   while(E-- > 0){
     int u; int v;
@@ -84,7 +94,7 @@
     ar >> BOOST_SERIALIZATION_NVP(v);
     Edge e; bool inserted;
     tie(e,inserted) = add_edge(verts[u], verts[v], graph);
-    ar >> graph[e];
+    ar >> serialization::make_nvp("edge_property", get(edge_all_t(), graph, e) );
   }
 }
 

Modified: boost/trunk/boost/graph/adjacency_list.hpp
===================================================================
--- boost/trunk/boost/graph/adjacency_list.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/adjacency_list.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -259,8 +259,7 @@
 
   template <class OutEdgeListS = vecS,
             class VertexListS = vecS,
-            class DirectedS = directedS,
-            class EdgeListS = listS>
+            class DirectedS = directedS>
   struct adjacency_list_traits
   {
     typedef typename detail::is_random_access<VertexListS>::type
@@ -283,22 +282,6 @@
       std::size_t, vertex_ptr>::type vertex_descriptor;
     typedef detail::edge_desc_impl<directed_category, vertex_descriptor>
       edge_descriptor;
-
-    typedef std::size_t vertices_size_type;
-
-  private:
-    // Logic to figure out the edges_size_type
-    struct dummy {};
-    typedef typename container_gen<EdgeListS, dummy>::type EdgeContainer;
-    typedef typename DirectedS::is_bidir_t BidirectionalT;
-    typedef typename DirectedS::is_directed_t DirectedT;
-    typedef typename ct_and<DirectedT, 
-      typename ct_not<BidirectionalT>::type >::type on_edge_storage;
-  public:
-    typedef typename boost::ct_if_t<on_edge_storage,
-       std::size_t, typename EdgeContainer::size_type
-    >::type edges_size_type;
-
   };
 
 } // namespace boost

Modified: boost/trunk/boost/graph/adjacency_matrix.hpp
===================================================================
--- boost/trunk/boost/graph/adjacency_matrix.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/adjacency_matrix.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -28,6 +28,7 @@
 #include <boost/graph/properties.hpp>
 #include <boost/tuple/tuple.hpp>
 #include <boost/static_assert.hpp>
+#include <boost/type_traits/ice.hpp>
 
 namespace boost {
   
@@ -436,7 +437,9 @@
     // graph type. Instead, use directedS, which also provides the
     // functionality required for a Bidirectional Graph (in_edges,
     // in_degree, etc.).
-    BOOST_STATIC_ASSERT(!(is_same<Directed, bidirectionalS>::value));
+#if !defined(_MSC_VER) || _MSC_VER > 1300
+    BOOST_STATIC_ASSERT(type_traits::ice_not<(is_same<Directed, bidirectionalS>::value)>::value);
+#endif
 
     typedef typename boost::ct_if_t<is_directed,
                                     bidirectional_tag, undirected_tag>::type
@@ -471,11 +474,13 @@
     typedef adjacency_matrix_traits<Directed> Traits;
     
   public:
+#if !defined(BOOST_MSVC) || BOOST_MSVC > 1300
     // The bidirectionalS tag is not allowed with the adjacency_matrix
     // graph type. Instead, use directedS, which also provides the
     // functionality required for a Bidirectional Graph (in_edges,
     // in_degree, etc.).
     BOOST_STATIC_ASSERT(!(is_same<Directed, bidirectionalS>::value));
+#endif
 
 #ifndef BOOST_GRAPH_NO_BUNDLED_PROPERTIES
     typedef typename detail::retag_property_list<vertex_bundle_t, VertexProperty>::type

Modified: boost/trunk/boost/graph/astar_search.hpp
===================================================================
--- boost/trunk/boost/graph/astar_search.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/astar_search.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -301,6 +301,7 @@
       put(distance, *ui, inf);
       put(cost, *ui, inf);
       put(predecessor, *ui, *ui);
+      vis.initialize_vertex(*ui, g);
     }
     put(distance, s, zero);
     put(cost, s, h(s));

Modified: boost/trunk/boost/graph/bc_clustering.hpp
===================================================================
--- boost/trunk/boost/graph/bc_clustering.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/bc_clustering.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright 2004 The Trustees of Indiana University.
 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
 //  Authors: Douglas Gregor

Modified: boost/trunk/boost/graph/betweenness_centrality.hpp
===================================================================
--- boost/trunk/boost/graph/betweenness_centrality.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/betweenness_centrality.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright 2004 The Trustees of Indiana University.
 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
 //  Authors: Douglas Gregor

Modified: boost/trunk/boost/graph/circle_layout.hpp
===================================================================
--- boost/trunk/boost/graph/circle_layout.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/circle_layout.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright 2004 The Trustees of Indiana University.
 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
 //  Authors: Douglas Gregor

Modified: boost/trunk/boost/graph/compressed_sparse_row_graph.hpp
===================================================================
--- boost/trunk/boost/graph/compressed_sparse_row_graph.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/compressed_sparse_row_graph.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright 2005-2006 The Trustees of Indiana University.
 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
 //  Authors: Jeremiah Willcock
@@ -352,7 +352,7 @@
 
 template<BOOST_CSR_GRAPH_TEMPLATE_PARMS>
 inline Vertex
-add_vertices(Vertex count, BOOST_CSR_GRAPH_TYPE& g) {
+add_vertices(typename BOOST_CSR_GRAPH_TYPE::vertices_size_type count, BOOST_CSR_GRAPH_TYPE& g) {
   Vertex old_num_verts_plus_one = g.m_rowstart.size();
   g.m_rowstart.resize(old_num_verts_plus_one + count, EdgeIndex(0));
   return old_num_verts_plus_one - 1;
@@ -496,8 +496,9 @@
 
 // Extra, common functions
 template<BOOST_CSR_GRAPH_TEMPLATE_PARMS>
-inline Vertex
-vertex(Vertex i, const BOOST_CSR_GRAPH_TYPE&)
+inline typename graph_traits<BOOST_CSR_GRAPH_TYPE>::vertex_descriptor
+vertex(typename graph_traits<BOOST_CSR_GRAPH_TYPE>::vertex_descriptor i, 
+       const BOOST_CSR_GRAPH_TYPE&)
 {
   return i;
 }

Modified: boost/trunk/boost/graph/cuthill_mckee_ordering.hpp
===================================================================
--- boost/trunk/boost/graph/cuthill_mckee_ordering.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/cuthill_mckee_ordering.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -41,9 +41,9 @@
       void finish_vertex(Vertex, Graph&) {
         using std::sort;
 
-        typedef typename property_traits<DegreeMap>::value_type DS;
+        typedef typename property_traits<DegreeMap>::value_type ds_type;
 
-        typedef indirect_cmp<DegreeMap, std::less<DS> > Compare;
+        typedef indirect_cmp<DegreeMap, std::less<ds_type> > Compare;
         Compare comp(degree);
                 
         sort(Qptr->begin()+index_begin, Qptr->end(), comp);
@@ -74,7 +74,7 @@
   {
 
     //create queue, visitor...don't forget namespaces!
-    typedef typename property_traits<DegreeMap>::value_type DS;
+    typedef typename property_traits<DegreeMap>::value_type ds_type;
     typedef typename graph_traits<Graph>::vertex_descriptor Vertex;
     typedef typename boost::sparse::sparse_ordering_queue<Vertex> queue;
     typedef typename detail::bfs_rcm_visitor<OutputIterator, queue, DegreeMap> Visitor;

Modified: boost/trunk/boost/graph/depth_first_search.hpp
===================================================================
--- boost/trunk/boost/graph/depth_first_search.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/depth_first_search.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -214,6 +214,9 @@
   void
   depth_first_search(const VertexListGraph& g, DFSVisitor vis, ColorMap color)
   {
+    if (vertices(g).first == vertices(g).second)
+      return;
+
     depth_first_search(g, vis, color, *vertices(g).first);
   }
 
@@ -321,6 +324,8 @@
   {
     typedef typename property_value< bgl_named_params<P, T, R>,
       vertex_color_t>::type C;
+    if (vertices(g).first == vertices(g).second)
+      return;
     detail::dfs_dispatch<C>::apply
       (g,
        choose_param(get_param(params, graph_visitor),

Modified: boost/trunk/boost/graph/detail/adjacency_list.hpp
===================================================================
--- boost/trunk/boost/graph/detail/adjacency_list.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/detail/adjacency_list.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -59,15 +59,10 @@
 
 
   Note: it would be nice to merge some of the undirected and
-  bidirectional code... it is aweful similar.
+  bidirectional code... it is awful similar.
  */
 
 
-#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
-// Stay out of the way of the concept checking class
-# define Graph Graph_
-#endif
-
 namespace boost {
 
   namespace detail {
@@ -1726,8 +1721,18 @@
     inline
     typename boost::property_traits<
       typename boost::property_map<typename Config::graph_type, 
+        Property>::type
+    >::reference
+    get(Property p, adj_list_helper<Config, Base>& g, const Key& key) {
+      return get(get(p, g), key);
+    }
+
+    template <class Config, class Base, class Property, class Key>
+    inline
+    typename boost::property_traits<
+      typename boost::property_map<typename Config::graph_type, 
         Property>::const_type
-    >::value_type
+    >::reference
     get(Property p, const adj_list_helper<Config, Base>& g, const Key& key) {
       return get(get(p, g), key);
     }
@@ -2802,11 +2807,6 @@
 #undef stored_edge_property
 #undef stored_edge_iter
 
-#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
-// Stay out of the way of the concept checking class
-#undef Graph
-#endif
-
 #endif // BOOST_GRAPH_DETAIL_DETAIL_ADJACENCY_LIST_CCT
 
 /*

Modified: boost/trunk/boost/graph/detail/edge.hpp
===================================================================
--- boost/trunk/boost/graph/detail/edge.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/detail/edge.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,7 +49,7 @@
       //  protected:
       property_type* m_eproperty;
     };
-
+    
     template <class D, class V>
     inline bool
     operator==(const detail::edge_desc_impl<D,V>& a, 
@@ -65,36 +65,6 @@
       return ! (a.get_property() == b.get_property());
     }
 
-    // Order edges according to the address of their property object
-    template <class D, class V>
-    inline bool
-    operator<(const detail::edge_desc_impl<D,V>& a, 
-               const detail::edge_desc_impl<D,V>& b)
-    {
-      return a.get_property() < b.get_property();
-    }
-    template <class D, class V>
-    inline bool
-    operator<=(const detail::edge_desc_impl<D,V>& a, 
-               const detail::edge_desc_impl<D,V>& b)
-    {
-      return a.get_property() <= b.get_property();
-    }
-    template <class D, class V>
-    inline bool
-    operator>(const detail::edge_desc_impl<D,V>& a, 
-               const detail::edge_desc_impl<D,V>& b)
-    {
-      return a.get_property() > b.get_property();
-    }
-    template <class D, class V>
-    inline bool
-    operator>=(const detail::edge_desc_impl<D,V>& a, 
-               const detail::edge_desc_impl<D,V>& b)
-    {
-      return a.get_property() >= b.get_property();
-    }
-
   } //namespace detail
   
 } // namespace boost

Modified: boost/trunk/boost/graph/detail/indexed_properties.hpp
===================================================================
--- boost/trunk/boost/graph/detail/indexed_properties.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/detail/indexed_properties.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright 2005 The Trustees of Indiana University.
 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
 //  Authors: Jeremiah Willcock

Modified: boost/trunk/boost/graph/detail/read_graphviz_spirit.hpp
===================================================================
--- boost/trunk/boost/graph/detail/read_graphviz_spirit.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/detail/read_graphviz_spirit.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright 2004-5 Trustees of Indiana University
 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
 //

Modified: boost/trunk/boost/graph/dijkstra_shortest_paths.hpp
===================================================================
--- boost/trunk/boost/graph/dijkstra_shortest_paths.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/dijkstra_shortest_paths.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,6 +32,7 @@
   struct DijkstraVisitorConcept {
     void constraints() {
       function_requires< CopyConstructibleConcept<Visitor> >();
+      vis.initialize_vertex(u, g);
       vis.discover_vertex(u, g);
       vis.examine_vertex(u, g);
       vis.examine_edge(e, g);

Modified: boost/trunk/boost/graph/dominator_tree.hpp
===================================================================
--- boost/trunk/boost/graph/dominator_tree.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/dominator_tree.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,8 @@
 //=======================================================================
 // Copyright (C) 2005 Jong Soo Park <jongsoo.park -at- gmail.com>
 //
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 //=======================================================================
 // Dominator tree computation
@@ -217,8 +217,8 @@
    *      this function would be good for saving computations.
    * @pre Unreachable nodes must be masked as
    *      graph_traits<Graph>::null_vertex in parentMap.
-   * @pre Unreachable nodes must be maksed as
-   *      std::numeric_limits<VerticesSizeType>::max() in dfnumMap.
+   * @pre Unreachable nodes must be masked as
+   *      (std::numeric_limits<VerticesSizeType>::max)() in dfnumMap.
    * 
    * @param domTreePredMap [out] : immediate dominator map (parent map
    * in dom. tree)
@@ -452,8 +452,8 @@
             typename std::set<Vertex>::iterator t;
             for (t = get(domMap, *vi).begin(); t != get(domMap, *vi).end(); )
               {
-		typename std::set<Vertex>::iterator old_t = t;
-		++t; // Done early because t may become invalid
+        typename std::set<Vertex>::iterator old_t = t;
+        ++t; // Done early because t may become invalid
                 if (*old_t == *s) continue;
                 if (get(domMap, *s).find(*old_t) != get(domMap, *s).end())
                   get(domMap, *vi).erase(old_t);

Modified: boost/trunk/boost/graph/erdos_renyi_generator.hpp
===================================================================
--- boost/trunk/boost/graph/erdos_renyi_generator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/erdos_renyi_generator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright 2004, 2005 The Trustees of Indiana University.
 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
 //  Authors: Jeremiah Willcock
@@ -123,16 +123,16 @@
 
     sorted_erdos_renyi_iterator()
       : gen(), rand_vertex(0.5), n(0), allow_self_loops(false),
-	src((std::numeric_limits<vertices_size_type>::max)()), tgt(0), prob(0) {}
+    src((std::numeric_limits<vertices_size_type>::max)()), tgt(0), prob(0) {}
     sorted_erdos_renyi_iterator(RandomGenerator& gen, vertices_size_type n, 
-			        double prob = 0.0, 
+                    double prob = 0.0, 
                                 bool allow_self_loops = false)
       : gen(),
         // The "1.0 - prob" in the next line is to work around a Boost.Random
         // (and TR1) bug in the specification of geometric_distribution.  It
         // should be replaced by "prob" when the issue is fixed.
         rand_vertex(1.0 - prob),
-	n(n), allow_self_loops(allow_self_loops), src(0), tgt(0), prob(prob)
+    n(n), allow_self_loops(allow_self_loops), src(0), tgt(0), prob(prob)
     { 
       this->gen.reset(new uniform_01<RandomGenerator>(gen));
 
@@ -182,27 +182,27 @@
       vertices_size_type increment = rand_vertex(*gen);
       tgt += increment;
       if (is_undirected) {
-	// Update src and tgt based on position of tgt
-	// Basically, we want the greatest src_increment such that (in \bbQ):
-	// src_increment * (src + allow_self_loops + src_increment - 1/2) <= tgt
-	// The result of the LHS of this, evaluated with the computed
-	// src_increment, is then subtracted from tgt
-	double src_minus_half = (src + allow_self_loops) - 0.5;
-	double disc = src_minus_half * src_minus_half + 2 * tgt;
-	double src_increment_fp = floor(sqrt(disc) - src_minus_half);
-	vertices_size_type src_increment = vertices_size_type(src_increment_fp);
-	if (src + src_increment >= n) {
-	  src = n;
-	} else {
-	  tgt -= (src + allow_self_loops) * src_increment + 
-		 src_increment * (src_increment - 1) / 2;
-	  src += src_increment;
-	}
+    // Update src and tgt based on position of tgt
+    // Basically, we want the greatest src_increment such that (in \bbQ):
+    // src_increment * (src + allow_self_loops + src_increment - 1/2) <= tgt
+    // The result of the LHS of this, evaluated with the computed
+    // src_increment, is then subtracted from tgt
+    double src_minus_half = (src + allow_self_loops) - 0.5;
+    double disc = src_minus_half * src_minus_half + 2 * tgt;
+    double src_increment_fp = floor(sqrt(disc) - src_minus_half);
+    vertices_size_type src_increment = vertices_size_type(src_increment_fp);
+    if (src + src_increment >= n) {
+      src = n;
+    } else {
+      tgt -= (src + allow_self_loops) * src_increment + 
+         src_increment * (src_increment - 1) / 2;
+      src += src_increment;
+    }
       } else {
-	// Number of out edge positions possible from each vertex in this graph
-	vertices_size_type possible_out_edges = n - (allow_self_loops ? 0 : 1);
-	src += (std::min)(n - src, tgt / possible_out_edges);
-	tgt %= possible_out_edges;
+    // Number of out edge positions possible from each vertex in this graph
+    vertices_size_type possible_out_edges = n - (allow_self_loops ? 0 : 1);
+    src += (std::min)(n - src, tgt / possible_out_edges);
+    tgt %= possible_out_edges;
       }
       // Set end of graph code so (src, tgt) will be the same as for the end
       // sorted_erdos_renyi_iterator

Modified: boost/trunk/boost/graph/filtered_graph.hpp
===================================================================
--- boost/trunk/boost/graph/filtered_graph.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/filtered_graph.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -246,6 +246,17 @@
     return filtered_graph<Graph, EdgePredicate, VertexPredicate>(g, ep, vp);
   }
 
+  template <typename Graph, typename EdgePredicate>
+  inline filtered_graph<const Graph, EdgePredicate>
+  make_filtered_graph(const Graph& g, EdgePredicate ep) {
+    return filtered_graph<const Graph, EdgePredicate>(g, ep);
+  }
+  template <typename Graph, typename EdgePredicate, typename VertexPredicate>
+  inline filtered_graph<const Graph, EdgePredicate, VertexPredicate>
+  make_filtered_graph(const Graph& g, EdgePredicate ep, VertexPredicate vp) {
+    return filtered_graph<const Graph, EdgePredicate, VertexPredicate>(g, ep, vp);
+  }
+
   template <typename G, typename EP, typename VP>
   std::pair<typename filtered_graph<G, EP, VP>::vertex_iterator,
             typename filtered_graph<G, EP, VP>::vertex_iterator>

Modified: boost/trunk/boost/graph/floyd_warshall_shortest.hpp
===================================================================
--- boost/trunk/boost/graph/floyd_warshall_shortest.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/floyd_warshall_shortest.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright 2002 Rensselaer Polytechnic Institute
 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
 //  Authors: Lauren Foutz

Modified: boost/trunk/boost/graph/fruchterman_reingold.hpp
===================================================================
--- boost/trunk/boost/graph/fruchterman_reingold.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/fruchterman_reingold.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright 2004 The Trustees of Indiana University.
 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
 //  Authors: Douglas Gregor

Modified: boost/trunk/boost/graph/graph_concepts.hpp
===================================================================
--- boost/trunk/boost/graph/graph_concepts.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/graph_concepts.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,89 +18,82 @@
 #include <boost/concept_check.hpp>
 #include <boost/detail/workaround.hpp>
 
-#include <boost/concept/detail/concept_def.hpp>
+namespace boost {
 
-namespace boost
-{
-  BOOST_concept(MultiPassInputIterator,(T)) {
-    ~MultiPassInputIterator() {
-        BOOST_CONCEPT_ASSERT((InputIterator<T>));
+  template <class T>
+  struct MultiPassInputIteratorConcept {
+    void constraints() {
+      function_requires< InputIteratorConcept<T> >();
     }
   };
 
-  BOOST_concept(Graph,(G))
+  template <class G>
+  struct GraphConcept
   {
     typedef typename graph_traits<G>::vertex_descriptor vertex_descriptor;
     typedef typename graph_traits<G>::directed_category directed_category;
     typedef typename graph_traits<G>::edge_parallel_category
       edge_parallel_category;
-      
-      typedef typename graph_traits<G>::traversal_category
+    typedef typename graph_traits<G>::traversal_category
       traversal_category;
-      
-      ~Graph()
-      {
-          BOOST_CONCEPT_ASSERT((DefaultConstructible<vertex_descriptor>));
-          BOOST_CONCEPT_ASSERT((EqualityComparable<vertex_descriptor>));
-          BOOST_CONCEPT_ASSERT((Assignable<vertex_descriptor>));
-      }
-      G g;
-      
-#if BOOST_WORKAROUND(__GNUC__, <= 3)
-      Graph();   // at least 2.96 and 3.4.3 both need this :(
-#endif 
+    void constraints() {
+      function_requires< DefaultConstructibleConcept<vertex_descriptor> >();
+      function_requires< EqualityComparableConcept<vertex_descriptor> >();
+      function_requires< AssignableConcept<vertex_descriptor> >();
+    }
+    G g;
   };
 
-  BOOST_concept(IncidenceGraph,(G))
-    : Graph<G>
+  template <class G>
+  struct IncidenceGraphConcept
   {
-      typedef typename graph_traits<G>::edge_descriptor edge_descriptor;
-      typedef typename graph_traits<G>::out_edge_iterator
+    typedef typename graph_traits<G>::edge_descriptor edge_descriptor;
+    typedef typename graph_traits<G>::out_edge_iterator
       out_edge_iterator;
-      
-      typedef typename graph_traits<G>::traversal_category
+    typedef typename graph_traits<G>::traversal_category
       traversal_category;
-      
-      ~IncidenceGraph() {
-          BOOST_CONCEPT_ASSERT((MultiPassInputIterator<out_edge_iterator>));
-          BOOST_CONCEPT_ASSERT((DefaultConstructible<edge_descriptor>));
-          BOOST_CONCEPT_ASSERT((EqualityComparable<edge_descriptor>));
-          BOOST_CONCEPT_ASSERT((Assignable<edge_descriptor>));
-          BOOST_CONCEPT_ASSERT((Convertible<traversal_category,
-                                incidence_graph_tag>));
+    void constraints() {
+      function_requires< GraphConcept<G> >();
+      function_requires< MultiPassInputIteratorConcept<out_edge_iterator> >();
+      function_requires< DefaultConstructibleConcept<edge_descriptor> >();
+      function_requires< EqualityComparableConcept<edge_descriptor> >();
+      function_requires< AssignableConcept<edge_descriptor> >();
+      function_requires< ConvertibleConcept<traversal_category,
+        incidence_graph_tag> >();
 
-          p = out_edges(u, g);
-          n = out_degree(u, g);
-          e = *p.first;
-          u = source(e, g);
-          v = target(e, g);
-          const_constraints(g);
-      }
-      void const_constraints(const G& cg) {
-          p = out_edges(u, cg);
-          n = out_degree(u, cg);
-          e = *p.first;
-          u = source(e, cg);
-          v = target(e, cg);
-      }
-      std::pair<out_edge_iterator, out_edge_iterator> p;
-      typename graph_traits<G>::vertex_descriptor u, v;
-      typename graph_traits<G>::edge_descriptor e;
-      typename graph_traits<G>::degree_size_type n;
-      G g;
+      p = out_edges(u, g);
+      n = out_degree(u, g);
+      e = *p.first;
+      u = source(e, g);
+      v = target(e, g);
+      const_constraints(g);
+    }
+    void const_constraints(const G& cg) {
+      p = out_edges(u, cg);
+      n = out_degree(u, cg);
+      e = *p.first;
+      u = source(e, cg);
+      v = target(e, cg);
+    }
+    std::pair<out_edge_iterator, out_edge_iterator> p;
+    typename graph_traits<G>::vertex_descriptor u, v;
+    typename graph_traits<G>::edge_descriptor e;
+    typename graph_traits<G>::degree_size_type n;
+    G g;
   };
 
-  BOOST_concept(BidirectionalGraph,(G))
-    : IncidenceGraph<G>
+  template <class G>
+  struct BidirectionalGraphConcept
   {
     typedef typename graph_traits<G>::in_edge_iterator
       in_edge_iterator;
     typedef typename graph_traits<G>::traversal_category
       traversal_category;
-    ~BidirectionalGraph() {
-      BOOST_CONCEPT_ASSERT((MultiPassInputIterator<in_edge_iterator>));
-      BOOST_CONCEPT_ASSERT((Convertible<traversal_category,
-        bidirectional_graph_tag>));
+    void constraints() {
+      function_requires< IncidenceGraphConcept<G> >();
+      function_requires< MultiPassInputIteratorConcept<in_edge_iterator> >();
+      function_requires< ConvertibleConcept<traversal_category,
+        bidirectional_graph_tag> >();
 
       p = in_edges(v, g);
       n = in_degree(v, g);
@@ -119,17 +112,18 @@
     G g;
   };
 
-  BOOST_concept(AdjacencyGraph,(G))
-    : Graph<G>
+  template <class G>
+  struct AdjacencyGraphConcept
   {
     typedef typename graph_traits<G>::adjacency_iterator
       adjacency_iterator;
     typedef typename graph_traits<G>::traversal_category
       traversal_category;
-    ~AdjacencyGraph() {
-      BOOST_CONCEPT_ASSERT((MultiPassInputIterator<adjacency_iterator>));
-      BOOST_CONCEPT_ASSERT((Convertible<traversal_category,
-        adjacency_graph_tag>));
+    void constraints() {
+      function_requires< GraphConcept<G> >();
+      function_requires< MultiPassInputIteratorConcept<adjacency_iterator> >();
+      function_requires< ConvertibleConcept<traversal_category,
+        adjacency_graph_tag> >();
 
       p = adjacent_vertices(v, g);
       v = *p.first;
@@ -162,17 +156,18 @@
 typename T::ThereReallyIsNoMemberByThisNameInT vertices(T const&);
 #endif      
 
-  BOOST_concept(VertexListGraph,(G))
-    : Graph<G>
+  template <class G>
+  struct VertexListGraphConcept
   {
     typedef typename graph_traits<G>::vertex_iterator vertex_iterator;
     typedef typename graph_traits<G>::vertices_size_type vertices_size_type;
     typedef typename graph_traits<G>::traversal_category
       traversal_category;
-    ~VertexListGraph() {
-      BOOST_CONCEPT_ASSERT((MultiPassInputIterator<vertex_iterator>));
-      BOOST_CONCEPT_ASSERT((Convertible<traversal_category,
-        vertex_list_graph_tag>));
+    void constraints() {
+      function_requires< GraphConcept<G> >();
+      function_requires< MultiPassInputIteratorConcept<vertex_iterator> >();
+      function_requires< ConvertibleConcept<traversal_category,
+        vertex_list_graph_tag> >();
 
 #ifdef BOOST_VECTOR_AS_GRAPH_GRAPH_ADL_HACK
       // dwa 2003/7/11 -- This clearly shouldn't be necessary, but if
@@ -206,21 +201,22 @@
     vertices_size_type V;
   };
 
-  BOOST_concept(EdgeListGraph,(G))
-    : Graph<G>
+  template <class G>
+  struct EdgeListGraphConcept
   {
     typedef typename graph_traits<G>::edge_descriptor edge_descriptor;
     typedef typename graph_traits<G>::edge_iterator edge_iterator;
     typedef typename graph_traits<G>::edges_size_type edges_size_type;
     typedef typename graph_traits<G>::traversal_category
       traversal_category;
-    ~EdgeListGraph() {
-      BOOST_CONCEPT_ASSERT((MultiPassInputIterator<edge_iterator>));
-      BOOST_CONCEPT_ASSERT((DefaultConstructible<edge_descriptor>));
-      BOOST_CONCEPT_ASSERT((EqualityComparable<edge_descriptor>));
-      BOOST_CONCEPT_ASSERT((Assignable<edge_descriptor>));
-      BOOST_CONCEPT_ASSERT((Convertible<traversal_category,
-        edge_list_graph_tag>));
+    void constraints() {
+      function_requires< GraphConcept<G> >();
+      function_requires< MultiPassInputIteratorConcept<edge_iterator> >();
+      function_requires< DefaultConstructibleConcept<edge_descriptor> >();
+      function_requires< EqualityComparableConcept<edge_descriptor> >();
+      function_requires< AssignableConcept<edge_descriptor> >();
+      function_requires< ConvertibleConcept<traversal_category,
+        edge_list_graph_tag> >();
 
       p = edges(g);
       e = *p.first;
@@ -242,20 +238,25 @@
     G g;
   };
 
-  BOOST_concept(VertexAndEdgeListGraph,(G))
-    : VertexListGraph<G>
-    , EdgeListGraph<G>
-  {};
+  template <class G>
+  struct VertexAndEdgeListGraphConcept
+  {
+    void constraints() {
+      function_requires< VertexListGraphConcept<G> >();    
+      function_requires< EdgeListGraphConcept<G> >();
+    }
+  };
 
   // Where to put the requirement for this constructor?
   //      G g(n_vertices);
   // Not in mutable graph, then LEDA graph's can't be models of
   // MutableGraph.
 
-  BOOST_concept(EdgeMutableGraph,(G))
+  template <class G>
+  struct EdgeMutableGraphConcept
   {
     typedef typename graph_traits<G>::edge_descriptor edge_descriptor;
-    ~EdgeMutableGraph() {
+    void constraints() {
       p = add_edge(u, v, g);
       remove_edge(u, v, g);
       remove_edge(e, g);
@@ -267,9 +268,10 @@
     typename graph_traits<G>::vertex_descriptor u, v;
   };
 
-  BOOST_concept(VertexMutableGraph,(G))
+  template <class G>
+  struct VertexMutableGraphConcept
   {
-    ~VertexMutableGraph() {
+    void constraints() {
       v = add_vertex(g);
       remove_vertex(v, g);
     }
@@ -277,10 +279,13 @@
     typename graph_traits<G>::vertex_descriptor u, v;
   };
 
-  BOOST_concept(MutableGraph,(G))
-    : EdgeMutableGraph<G>
-    , VertexMutableGraph<G>
+  template <class G>
+  struct MutableGraphConcept
   {
+    void constraints() {
+      function_requires< EdgeMutableGraphConcept<G> >();
+      function_requires< VertexMutableGraphConcept<G> >();
+    }
   };
 
   template <class edge_descriptor>
@@ -290,10 +295,11 @@
     }
   };
 
-  BOOST_concept(MutableIncidenceGraph,(G))
-    : MutableGraph<G>
+  template <class G>
+  struct MutableIncidenceGraphConcept
   {
-    ~MutableIncidenceGraph() {
+    void constraints() {
+      function_requires< MutableGraphConcept<G> >();
       remove_edge(iter, g);
       remove_out_edge_if(u, p, g);
     }
@@ -304,23 +310,24 @@
     typename boost::graph_traits<G>::out_edge_iterator iter;
   };
 
-  BOOST_concept(MutableBidirectionalGraph,(G))
-    : MutableIncidenceGraph<G>
+  template <class G>
+  struct MutableBidirectionalGraphConcept
   {
-      ~MutableBidirectionalGraph()
-      {
-          remove_in_edge_if(u, p, g);
-      }
-      G g;
-      typedef typename graph_traits<G>::edge_descriptor edge_descriptor;
-      dummy_edge_predicate<edge_descriptor> p;
-      typename boost::graph_traits<G>::vertex_descriptor u;
+    void constraints() {
+      function_requires< MutableIncidenceGraphConcept<G> >();
+      remove_in_edge_if(u, p, g);
+    }
+    G g;
+    typedef typename graph_traits<G>::edge_descriptor edge_descriptor;
+    dummy_edge_predicate<edge_descriptor> p;
+    typename boost::graph_traits<G>::vertex_descriptor u;
   };
 
-  BOOST_concept(MutableEdgeListGraph,(G))
-    : EdgeMutableGraph<G>
+  template <class G>
+  struct MutableEdgeListGraphConcept
   {
-    ~MutableEdgeListGraph() {
+    void constraints() {
+      function_requires< EdgeMutableGraphConcept<G> >();
       remove_edge_if(p, g);
     }
     G g;
@@ -328,10 +335,11 @@
     dummy_edge_predicate<edge_descriptor> p;
   };
 
-  BOOST_concept(VertexMutablePropertyGraph,(G))
-    : VertexMutableGraph<G>
+  template <class G>
+  struct VertexMutablePropertyGraphConcept
   {
-    ~VertexMutablePropertyGraph() {
+    void constraints() {
+      function_requires< VertexMutableGraphConcept<G> >();
       v = add_vertex(vp, g);
     }
     G g;
@@ -339,11 +347,12 @@
     typename vertex_property<G>::type vp;
   };
 
-  BOOST_concept(EdgeMutablePropertyGraph,(G))
-    : EdgeMutableGraph<G>
+  template <class G>
+  struct EdgeMutablePropertyGraphConcept
   {
     typedef typename graph_traits<G>::edge_descriptor edge_descriptor;
-    ~EdgeMutablePropertyGraph() {
+    void constraints() {
+      function_requires< EdgeMutableGraphConcept<G> >();
       p = add_edge(u, v, ep, g);
     }
     G g;
@@ -352,11 +361,13 @@
     typename edge_property<G>::type ep;
   };
 
-  BOOST_concept(AdjacencyMatrix,(G))
-    : Graph<G>
+  template <class G>
+  struct AdjacencyMatrixConcept
   {
     typedef typename graph_traits<G>::edge_descriptor edge_descriptor;
-    ~AdjacencyMatrix() {      
+    void constraints() {
+      function_requires< GraphConcept<G> >();
+      
       p = edge(u, v, g);
       const_constraints(g);
     }
@@ -368,14 +379,13 @@
     G g;
   };
 
-  BOOST_concept(ReadablePropertyGraph,(G)(X)(Property))
-    : Graph<G>
+  template <class G, class X, class Property>
+  struct ReadablePropertyGraphConcept
   {
     typedef typename property_map<G, Property>::const_type const_Map;
-    
-    ~ReadablePropertyGraph()
-    {
-      BOOST_CONCEPT_ASSERT((ReadablePropertyMapConcept<const_Map, X>));
+    void constraints() {
+      function_requires< GraphConcept<G> >();
+      function_requires< ReadablePropertyMapConcept<const_Map, X> >();
 
       const_constraints(g);
     }
@@ -389,12 +399,13 @@
     typename property_traits<const_Map>::value_type pval;
   };
 
-  BOOST_concept(PropertyGraph,(G)(X)(Property))
-    : ReadablePropertyGraph<G, X, Property>
+  template <class G, class X, class Property>
+  struct PropertyGraphConcept
   {
     typedef typename property_map<G, Property>::type Map;
-    ~PropertyGraph() {
-      BOOST_CONCEPT_ASSERT((ReadWritePropertyMapConcept<Map, X>));
+    void constraints() {
+      function_requires< ReadablePropertyGraphConcept<G, X, Property> >();
+      function_requires< ReadWritePropertyMapConcept<Map, X> >();
 
       Map pmap = get(Property(), g);
       pval = get(Property(), g, x);
@@ -406,13 +417,14 @@
     typename property_traits<Map>::value_type pval;
   };
 
-  BOOST_concept(LvaluePropertyGraph,(G)(X)(Property))
-    : ReadablePropertyGraph<G, X, Property>
+  template <class G, class X, class Property>
+  struct LvaluePropertyGraphConcept
   {
     typedef typename property_map<G, Property>::type Map;
     typedef typename property_map<G, Property>::const_type const_Map;
-    ~LvaluePropertyGraph() {
-      BOOST_CONCEPT_ASSERT((LvaluePropertyMapConcept<const_Map, X>));
+    void constraints() {
+      function_requires< ReadablePropertyGraphConcept<G, X, Property> >();
+      function_requires< LvaluePropertyMapConcept<const_Map, X> >();
 
       pval = get(Property(), g, x);
       put(Property(), g, x, pval);
@@ -423,9 +435,10 @@
   };
 
   // This needs to move out of the graph library
-  BOOST_concept(Buffer,(B))
+  template <class B>
+  struct BufferConcept
   {
-    ~Buffer() {
+    void constraints() {
       b.push(t);
       b.pop();
       typename B::value_type& v = b.top();
@@ -444,11 +457,13 @@
     B b;
   };
 
-  BOOST_concept(ColorValue,(C))
-    : EqualityComparable<C>
-    , DefaultConstructible<C>
+  template <class C>
+  struct ColorValueConcept
   {
-    ~ColorValue() {
+    void constraints() {
+      function_requires< EqualityComparableConcept<C> >();
+      function_requires< DefaultConstructibleConcept<C> >();
+
       c = color_traits<C>::white();
       c = color_traits<C>::gray();
       c = color_traits<C>::black();
@@ -456,9 +471,10 @@
     C c;
   };
 
-  BOOST_concept(BasicMatrix,(M)(I)(V))
+  template <class M, class I, class V>
+  struct BasicMatrixConcept
   {
-    ~BasicMatrix() {
+    void constraints() {
       V& elt = A[i][j];
       const_constraints(A);
       ignore_unused_variable_warning(elt);      
@@ -473,6 +489,4 @@
 
 } // namespace boost
 
-#include <boost/concept/detail/concept_undef.hpp>
-
 #endif /* BOOST_GRAPH_CONCEPTS_H */

Modified: boost/trunk/boost/graph/graphviz.hpp
===================================================================
--- boost/trunk/boost/graph/graphviz.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/graphviz.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,6 +24,20 @@
 #include <boost/graph/adjacency_list.hpp>
 #include <boost/dynamic_property_map.hpp>
 
+#ifdef BOOST_HAS_DECLSPEC
+#  if defined(BOOST_ALL_DYN_LINK) || defined(BOOST_GRAPH_DYN_LINK)
+#    ifdef BOOST_GRAPH_SOURCE
+#      define BOOST_GRAPH_DECL __declspec(dllexport)
+#    else
+#      define BOOST_GRAPH_DECL __declspec(dllimport)
+#    endif  // BOOST_GRAPH_SOURCE
+#  endif  // DYN_LINK
+#endif  // BOOST_HAS_DECLSPEC
+
+#ifndef BOOST_GRAPH_DECL
+#  define BOOST_GRAPH_DECL
+#endif
+
 namespace boost {
 
   template <typename directed_category>
@@ -734,6 +748,7 @@
   std::map<edge_t, bgl_edge_t> bgl_edges;
 };
 
+BOOST_GRAPH_DECL
 bool read_graphviz(std::istream& in, mutate_graph& graph);
 
 } } // end namespace detail::graph

Modified: boost/trunk/boost/graph/gursoy_atun_layout.hpp
===================================================================
--- boost/trunk/boost/graph/gursoy_atun_layout.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/gursoy_atun_layout.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright 2004 The Trustees of Indiana University.
 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
 //  Authors: Jeremiah Willcock

Modified: boost/trunk/boost/graph/kamada_kawai_spring_layout.hpp
===================================================================
--- boost/trunk/boost/graph/kamada_kawai_spring_layout.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/kamada_kawai_spring_layout.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright 2004 The Trustees of Indiana University.
 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
 //  Authors: Douglas Gregor

Modified: boost/trunk/boost/graph/king_ordering.hpp
===================================================================
--- boost/trunk/boost/graph/king_ordering.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/king_ordering.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -193,18 +193,18 @@
                 ColorMap color, DegreeMap degree,
                 VertexIndexMap index_map)
   {
-    typedef typename property_traits<DegreeMap>::value_type DS;
+    typedef typename property_traits<DegreeMap>::value_type ds_type;
     typedef typename property_traits<ColorMap>::value_type ColorValue;
     typedef color_traits<ColorValue> Color;
     typedef typename graph_traits<Graph>::vertex_descriptor Vertex;
-    typedef iterator_property_map<typename std::vector<DS>::iterator, VertexIndexMap, DS, DS&> PseudoDegreeMap;
-    typedef indirect_cmp<PseudoDegreeMap, std::less<DS> > Compare;
+    typedef iterator_property_map<typename std::vector<ds_type>::iterator, VertexIndexMap, ds_type, ds_type&> PseudoDegreeMap;
+    typedef indirect_cmp<PseudoDegreeMap, std::less<ds_type> > Compare;
     typedef typename boost::sparse::sparse_ordering_queue<Vertex> queue;
     typedef typename detail::bfs_king_visitor<OutputIterator, queue, Compare,             
       PseudoDegreeMap, std::vector<int>, VertexIndexMap > Visitor;
     typedef typename graph_traits<Graph>::vertices_size_type
       vertices_size_type;
-    std::vector<DS> pseudo_degree_vec(num_vertices(g));
+    std::vector<ds_type> pseudo_degree_vec(num_vertices(g));
     PseudoDegreeMap pseudo_degree(pseudo_degree_vec.begin(), index_map);
     
     typename graph_traits<Graph>::vertex_iterator ui, ui_end;    

Copied: boost/trunk/boost/graph/max_cardinality_matching.hpp (from rev 14034, boost/branches/upstream/current/boost/graph/max_cardinality_matching.hpp)

Deleted: boost/trunk/boost/graph/maximum_cardinality_matching.hpp
===================================================================
--- boost/trunk/boost/graph/maximum_cardinality_matching.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/maximum_cardinality_matching.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,876 +0,0 @@
-//=======================================================================
-// Copyright (c) 2005 Aaron Windsor
-//
-// Distributed under the Boost Software License, Version 1.0. 
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-//=======================================================================
-
-#ifndef BOOST_GRAPH_MAXIMUM_CARDINALITY_MATCHING_HPP
-#define BOOST_GRAPH_MAXIMUM_CARDINALITY_MATCHING_HPP
-
-#include <vector>
-#include <list>
-#include <deque>
-#include <algorithm>                     // for std::sort and std::stable_sort
-#include <utility>                       // for std::pair
-#include <boost/property_map.hpp>
-#include <boost/utility.hpp>             // for boost::tie
-#include <boost/graph/graph_traits.hpp>  
-#include <boost/graph/visitors.hpp>
-#include <boost/graph/depth_first_search.hpp>
-#include <boost/graph/filtered_graph.hpp>
-#include <boost/pending/disjoint_sets.hpp>
-#include <boost/assert.hpp>
-
-
-namespace boost
-{
-  namespace graph { namespace detail {
-    enum { V_EVEN, V_ODD, V_UNREACHED };
-  } } // end namespace graph::detail
-
-  template <typename Graph, typename MateMap, typename VertexIndexMap>
-  typename graph_traits<Graph>::vertices_size_type 
-  matching_size(const Graph& g, MateMap mate, VertexIndexMap vm)
-  {
-    typedef typename graph_traits<Graph>::vertex_iterator vertex_iterator_t;
-    typedef typename graph_traits<Graph>::vertex_descriptor
-      vertex_descriptor_t;
-    typedef typename graph_traits<Graph>::vertices_size_type v_size_t;
-
-    v_size_t size_of_matching = 0;
-    vertex_iterator_t vi, vi_end;
-
-    for(tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi)
-      {
-	vertex_descriptor_t v = *vi;
-	if (get(mate,v) != graph_traits<Graph>::null_vertex() 
-            && get(vm,v) < get(vm,get(mate,v)))
-	  ++size_of_matching;
-      }
-    return size_of_matching;
-  }
-
-
-
-
-  template <typename Graph, typename MateMap>
-  inline typename graph_traits<Graph>::vertices_size_type
-  matching_size(const Graph& g, MateMap mate)
-  {
-    return matching_size(g, mate, get(vertex_index,g));
-  }
-
-
-
-
-  template <typename Graph, typename MateMap, typename VertexIndexMap>
-  bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap vm)
-  {
-    typedef typename graph_traits<Graph>::vertex_descriptor
-      vertex_descriptor_t;
-    typedef typename graph_traits<Graph>::vertex_iterator vertex_iterator_t;
-
-    vertex_iterator_t vi, vi_end;
-    for( tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi)
-      {
-	vertex_descriptor_t v = *vi;
-	if (get(mate,v) != graph_traits<Graph>::null_vertex() 
-            && v != get(mate,get(mate,v)))
-	  return false;
-      }    
-    return true;
-  }
-
-
-
-
-  template <typename Graph, typename MateMap>
-  inline bool is_a_matching(const Graph& g, MateMap mate)
-  {
-    return is_a_matching(g, mate, get(vertex_index,g));
-  }
-
-
-
-
-  //***************************************************************************
-  //***************************************************************************
-  //               Maximum Cardinality Matching Functors 
-  //***************************************************************************
-  //***************************************************************************
-  
-  template <typename Graph, typename MateMap, 
-            typename VertexIndexMap = dummy_property_map>
-  struct no_augmenting_path_finder
-  {
-    no_augmenting_path_finder(const Graph& g, MateMap mate, VertexIndexMap vm)
-    { }
-
-    inline bool augment_matching() { return false; }
-
-    template <typename PropertyMap>
-    void get_current_matching(PropertyMap p) {}
-  };
-
-
-
-
-  template <typename Graph, typename MateMap, typename VertexIndexMap>
-  class edmonds_augmenting_path_finder
-  {
-    // This implementation of Edmonds' matching algorithm closely
-    // follows Tarjan's description of the algorithm in "Data
-    // Structures and Network Algorithms."
-
-  public:
-
-    //generates the type of an iterator property map from vertices to type X
-    template <typename X>
-    struct map_vertex_to_ 
-    { 
-      typedef boost::iterator_property_map<typename std::vector<X>::iterator,
-                                           VertexIndexMap> type; 
-    };
-    
-    typedef typename graph_traits<Graph>::vertex_descriptor
-      vertex_descriptor_t;
-    typedef typename std::pair< vertex_descriptor_t, vertex_descriptor_t >
-      vertex_pair_t;
-    typedef typename graph_traits<Graph>::edge_descriptor edge_descriptor_t; 
-    typedef typename graph_traits<Graph>::vertices_size_type v_size_t;
-    typedef typename graph_traits<Graph>::edges_size_type e_size_t;
-    typedef typename graph_traits<Graph>::vertex_iterator vertex_iterator_t;
-    typedef typename graph_traits<Graph>::out_edge_iterator 
-      out_edge_iterator_t;
-    typedef typename std::deque<vertex_descriptor_t> vertex_list_t;
-    typedef typename std::vector<edge_descriptor_t> edge_list_t;
-    typedef typename map_vertex_to_<vertex_descriptor_t>::type 
-      vertex_to_vertex_map_t;
-    typedef typename map_vertex_to_<int>::type vertex_to_int_map_t;
-    typedef typename map_vertex_to_<vertex_pair_t>::type 
-      vertex_to_vertex_pair_map_t;
-    typedef typename map_vertex_to_<v_size_t>::type vertex_to_vsize_map_t;
-    typedef typename map_vertex_to_<e_size_t>::type vertex_to_esize_map_t;
-
-
-
-    
-    edmonds_augmenting_path_finder(const Graph& arg_g, MateMap arg_mate, 
-                                   VertexIndexMap arg_vm) : 
-      g(arg_g),
-      vm(arg_vm),
-      n_vertices(num_vertices(arg_g)),
-
-      mate_vector(n_vertices),
-      ancestor_of_v_vector(n_vertices),
-      ancestor_of_w_vector(n_vertices),
-      vertex_state_vector(n_vertices),
-      origin_vector(n_vertices),
-      pred_vector(n_vertices),
-      bridge_vector(n_vertices),
-      ds_parent_vector(n_vertices),
-      ds_rank_vector(n_vertices),
-
-      mate(mate_vector.begin(), vm),
-      ancestor_of_v(ancestor_of_v_vector.begin(), vm),
-      ancestor_of_w(ancestor_of_w_vector.begin(), vm),
-      vertex_state(vertex_state_vector.begin(), vm),
-      origin(origin_vector.begin(), vm),
-      pred(pred_vector.begin(), vm),
-      bridge(bridge_vector.begin(), vm),
-      ds_parent_map(ds_parent_vector.begin(), vm),
-      ds_rank_map(ds_rank_vector.begin(), vm),
-
-      ds(ds_rank_map, ds_parent_map)
-    {
-      vertex_iterator_t vi, vi_end;
-      for(tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi)
-	mate[*vi] = get(arg_mate, *vi);
-    }
-
-
-    
-
-    bool augment_matching()
-    {
-      //As an optimization, some of these values can be saved from one
-      //iteration to the next instead of being re-initialized each
-      //iteration, allowing for "lazy blossom expansion." This is not
-      //currently implemented.
-      
-      e_size_t timestamp = 0;
-      even_edges.clear();
-      
-      vertex_iterator_t vi, vi_end;
-      for(tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi)
-	{
-	  vertex_descriptor_t u = *vi;
-	  
-	  origin[u] = u;
-	  pred[u] = u;
-	  ancestor_of_v[u] = 0;
-	  ancestor_of_w[u] = 0;	
-	  ds.make_set(u);
-	  
-	  if (mate[u] == graph_traits<Graph>::null_vertex())
-	    {
-	      vertex_state[u] = graph::detail::V_EVEN;
-	      out_edge_iterator_t ei, ei_end;
-	      for(tie(ei,ei_end) = out_edges(u,g); ei != ei_end; ++ei)
-		even_edges.push_back( *ei );
-	    }
-	  else
-	    vertex_state[u] = graph::detail::V_UNREACHED;      
-	}
-    
-      //end initializations
-    
-      vertex_descriptor_t v,w,w_free_ancestor,v_free_ancestor;
-      w_free_ancestor = graph_traits<Graph>::null_vertex();
-      v_free_ancestor = graph_traits<Graph>::null_vertex(); 
-      bool found_alternating_path = false;
-      
-      while(!even_edges.empty() && !found_alternating_path)
-	{
-	  // since we push even edges onto the back of the list as
-	  // they're discovered, taking them off the back will search
-	  // for augmenting paths depth-first.
-	  edge_descriptor_t current_edge = even_edges.back();
-	  even_edges.pop_back();
-
-	  v = source(current_edge,g);
-	  w = target(current_edge,g);
-	  
-	  vertex_descriptor_t v_prime = origin[ds.find_set(v)];
-	  vertex_descriptor_t w_prime = origin[ds.find_set(w)];
-	  
-	  // because of the way we put all of the edges on the queue,
-	  // v_prime should be labeled V_EVEN; the following is a
-	  // little paranoid but it could happen...
-	  if (vertex_state[v_prime] != graph::detail::V_EVEN)
-	    {
-	      std::swap(v_prime,w_prime);
-	      std::swap(v,w);
-	    }
-
-	  if (vertex_state[w_prime] == graph::detail::V_UNREACHED)
-	    {
-	      vertex_state[w_prime] = graph::detail::V_ODD;
-	      vertex_state[mate[w_prime]] = graph::detail::V_EVEN;
-	      out_edge_iterator_t ei, ei_end;
-	      for( tie(ei,ei_end) = out_edges(mate[w_prime], g); ei != ei_end; ++ei)
-		even_edges.push_back(*ei);
-	      pred[w_prime] = v;
-	    }
-          //w_prime == v_prime can happen below if we get an edge that has been
-          //shrunk into a blossom
-	  else if (vertex_state[w_prime] == graph::detail::V_EVEN && w_prime != v_prime) 
-	    {                                                             
-	      vertex_descriptor_t w_up = w_prime;
-	      vertex_descriptor_t v_up = v_prime;
-	      vertex_descriptor_t nearest_common_ancestor 
-                = graph_traits<Graph>::null_vertex();
-	      w_free_ancestor = graph_traits<Graph>::null_vertex();
-	      v_free_ancestor = graph_traits<Graph>::null_vertex();
-	      
-	      // We now need to distinguish between the case that
-	      // w_prime and v_prime share an ancestor under the
-	      // "parent" relation, in which case we've found a
-	      // blossom and should shrink it, or the case that
-	      // w_prime and v_prime both have distinct ancestors that
-	      // are free, in which case we've found an alternating
-	      // path between those two ancestors.
-
-	      ++timestamp;
-
-	      while (nearest_common_ancestor == graph_traits<Graph>::null_vertex() && 
-		     (v_free_ancestor == graph_traits<Graph>::null_vertex() || 
-		      w_free_ancestor == graph_traits<Graph>::null_vertex()
-		      )
-		     )
-		{
-		  ancestor_of_w[w_up] = timestamp;
-		  ancestor_of_v[v_up] = timestamp;
-
-		  if (w_free_ancestor == graph_traits<Graph>::null_vertex())
-		    w_up = parent(w_up);
-		  if (v_free_ancestor == graph_traits<Graph>::null_vertex())
-		    v_up = parent(v_up);
-		  
-		  if (mate[v_up] == graph_traits<Graph>::null_vertex())
-		    v_free_ancestor = v_up;
-		  if (mate[w_up] == graph_traits<Graph>::null_vertex())
-		    w_free_ancestor = w_up;
-		  
-		  if (ancestor_of_w[v_up] == timestamp)
-		    nearest_common_ancestor = v_up;
-		  else if (ancestor_of_v[w_up] == timestamp)
-		    nearest_common_ancestor = w_up;
-		  else if (v_free_ancestor == w_free_ancestor && 
-			   v_free_ancestor != graph_traits<Graph>::null_vertex())
-		    nearest_common_ancestor = v_up;
-		}
-	      
-	      if (nearest_common_ancestor == graph_traits<Graph>::null_vertex())
-		found_alternating_path = true; //to break out of the loop
-	      else
-		{
-		  //shrink the blossom
-		  link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v));
-		  link_and_set_bridges(v_prime, nearest_common_ancestor, std::make_pair(v,w));
-		}
-	    }      
-	}
-      
-      if (!found_alternating_path)
-	return false;
-
-      // retrieve the augmenting path and put it in aug_path
-      reversed_retrieve_augmenting_path(v, v_free_ancestor);
-      retrieve_augmenting_path(w, w_free_ancestor);
-
-      // augment the matching along aug_path
-      vertex_descriptor_t a,b;
-      while (!aug_path.empty())
-	{
-	  a = aug_path.front();
-	  aug_path.pop_front();
-	  b = aug_path.front();
-	  aug_path.pop_front();
-	  mate[a] = b;
-	  mate[b] = a;
-	}
-      
-      return true;
-      
-    }
-
-
-
-
-    template <typename PropertyMap>
-    void get_current_matching(PropertyMap pm)
-    {
-      vertex_iterator_t vi,vi_end;
-      for(tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi)
-	put(pm, *vi, mate[*vi]);
-    }
-
-
-
-
-    template <typename PropertyMap>
-    void get_vertex_state_map(PropertyMap pm)
-    {
-      vertex_iterator_t vi,vi_end;
-      for(tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi)
-	put(pm, *vi, vertex_state[origin[ds.find_set(*vi)]]);
-    }
-
-
-
-
-  private:    
-
-    vertex_descriptor_t parent(vertex_descriptor_t x)
-    {
-      if (vertex_state[x] == graph::detail::V_EVEN 
-          && mate[x] != graph_traits<Graph>::null_vertex())
-	return mate[x];
-      else if (vertex_state[x] == graph::detail::V_ODD)
-	return origin[ds.find_set(pred[x])];
-      else
-	return x;
-    }
-    
-    
-
-
-    void link_and_set_bridges(vertex_descriptor_t x, 
-                              vertex_descriptor_t stop_vertex, 
-			      vertex_pair_t the_bridge)
-    {
-      for(vertex_descriptor_t v = x; v != stop_vertex; v = parent(v))
-	{
-	  ds.union_set(v, stop_vertex);
-	  origin[ds.find_set(stop_vertex)] = stop_vertex;
-
-	  if (vertex_state[v] == graph::detail::V_ODD)
-	    {
-	      bridge[v] = the_bridge;
-	      out_edge_iterator_t oei, oei_end;
-	      for(tie(oei, oei_end) = out_edges(v,g); oei != oei_end; ++oei)
-		even_edges.push_back(*oei);
-	    }
-	}
-    }
-    
-
-    // Since none of the STL containers support both constant-time
-    // concatenation and reversal, the process of expanding an
-    // augmenting path once we know one exists is a little more
-    // complicated than it has to be. If we know the path is from v to
-    // w, then the augmenting path is recursively defined as:
-    //
-    // path(v,w) = [v], if v = w
-    //           = concat([v, mate[v]], path(pred[mate[v]], w), 
-    //                if v != w and vertex_state[v] == graph::detail::V_EVEN
-    //           = concat([v], reverse(path(x,mate[v])), path(y,w)),
-    //                if v != w, vertex_state[v] == graph::detail::V_ODD, and bridge[v] = (x,y)
-    //
-    // These next two mutually recursive functions implement this definition.
-    
-    void retrieve_augmenting_path(vertex_descriptor_t v, vertex_descriptor_t w)  
-    {
-      if (v == w)
-	aug_path.push_back(v);
-      else if (vertex_state[v] == graph::detail::V_EVEN)
-	{
-	  aug_path.push_back(v);
-	  aug_path.push_back(mate[v]);
-	  retrieve_augmenting_path(pred[mate[v]], w);
-	}
-      else //vertex_state[v] == graph::detail::V_ODD 
-	{
-	  aug_path.push_back(v);
-	  reversed_retrieve_augmenting_path(bridge[v].first, mate[v]);
-	  retrieve_augmenting_path(bridge[v].second, w);
-	}
-    }
-
-
-    void reversed_retrieve_augmenting_path(vertex_descriptor_t v,
-                                           vertex_descriptor_t w)  
-    {
-
-      if (v == w)
-	aug_path.push_back(v);
-      else if (vertex_state[v] == graph::detail::V_EVEN)
-	{
-	  reversed_retrieve_augmenting_path(pred[mate[v]], w);
-	  aug_path.push_back(mate[v]);
-	  aug_path.push_back(v);
-	}
-      else //vertex_state[v] == graph::detail::V_ODD 
-	{
-	  reversed_retrieve_augmenting_path(bridge[v].second, w);
-	  retrieve_augmenting_path(bridge[v].first, mate[v]);
-	  aug_path.push_back(v);
-	}
-    }
-
-    
-
-
-    //private data members
-    
-    const Graph& g;
-    VertexIndexMap vm;
-    v_size_t n_vertices;
-    
-    //storage for the property maps below
-    std::vector<vertex_descriptor_t> mate_vector;
-    std::vector<e_size_t> ancestor_of_v_vector;
-    std::vector<e_size_t> ancestor_of_w_vector;
-    std::vector<int> vertex_state_vector;
-    std::vector<vertex_descriptor_t> origin_vector;
-    std::vector<vertex_descriptor_t> pred_vector;
-    std::vector<vertex_pair_t> bridge_vector;
-    std::vector<vertex_descriptor_t> ds_parent_vector;
-    std::vector<v_size_t> ds_rank_vector;
-
-    //iterator property maps
-    vertex_to_vertex_map_t mate;
-    vertex_to_esize_map_t ancestor_of_v;
-    vertex_to_esize_map_t ancestor_of_w;
-    vertex_to_int_map_t vertex_state;
-    vertex_to_vertex_map_t origin;
-    vertex_to_vertex_map_t pred;
-    vertex_to_vertex_pair_map_t bridge;
-    vertex_to_vertex_map_t ds_parent_map;
-    vertex_to_vsize_map_t ds_rank_map;
-
-    vertex_list_t aug_path;
-    edge_list_t even_edges;
-    disjoint_sets< vertex_to_vsize_map_t, vertex_to_vertex_map_t > ds;
-
-  };
-
-
-
-
-  //***************************************************************************
-  //***************************************************************************
-  //               Initial Matching Functors
-  //***************************************************************************
-  //***************************************************************************
-  
-  template <typename Graph, typename MateMap>
-  struct greedy_matching
-  {
-    typedef typename graph_traits< Graph >::vertex_descriptor vertex_descriptor_t;
-    typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t;
-    typedef typename graph_traits< Graph >::edge_descriptor edge_descriptor_t; 
-    typedef typename graph_traits< Graph >::edge_iterator edge_iterator_t;
-
-    static void find_matching(const Graph& g, MateMap mate)
-    {
-      vertex_iterator_t vi, vi_end;
-      for(tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi)
-	put(mate, *vi, graph_traits<Graph>::null_vertex());
-            
-      edge_iterator_t ei, ei_end;
-      for( tie(ei, ei_end) = edges(g); ei != ei_end; ++ei)
-	{
-	  edge_descriptor_t e = *ei;
-	  vertex_descriptor_t u = source(e,g);
-	  vertex_descriptor_t v = target(e,g);
-	  
-	  if (get(mate,u) == get(mate,v))  
-	    //only way equality can hold is if
-            //   mate[u] == mate[v] == null_vertex
-	    {
-	      put(mate,u,v);
-	      put(mate,v,u);
-	    }
-	}    
-    }
-  };
-  
-
-
-  
-  template <typename Graph, typename MateMap>
-  struct extra_greedy_matching
-  {
-    // The "extra greedy matching" is formed by repeating the
-    // following procedure as many times as possible: Choose the
-    // unmatched vertex v of minimum non-zero degree.  Choose the
-    // neighbor w of v which is unmatched and has minimum degree over
-    // all of v's neighbors. Add (u,v) to the matching. Ties for
-    // either choice are broken arbitrarily. This procedure takes time
-    // O(m log n), where m is the number of edges in the graph and n
-    // is the number of vertices.
-    
-    typedef typename graph_traits< Graph >::vertex_descriptor
-      vertex_descriptor_t;
-    typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t;
-    typedef typename graph_traits< Graph >::edge_descriptor edge_descriptor_t; 
-    typedef typename graph_traits< Graph >::edge_iterator edge_iterator_t;
-    typedef std::pair<vertex_descriptor_t, vertex_descriptor_t> vertex_pair_t;
-    
-    struct select_first
-    {
-      inline static vertex_descriptor_t select_vertex(const vertex_pair_t p) 
-      {return p.first;}
-    };
-
-    struct select_second
-    {
-      inline static vertex_descriptor_t select_vertex(const vertex_pair_t p) 
-      {return p.second;}
-    };
-
-    template <class PairSelector>
-    class less_than_by_degree
-    {
-    public:
-      less_than_by_degree(const Graph& g): m_g(g) {}
-      bool operator() (const vertex_pair_t x, const vertex_pair_t y)
-      {
-	return 
-	  out_degree(PairSelector::select_vertex(x), m_g) 
-	  < out_degree(PairSelector::select_vertex(y), m_g);
-      }
-    private:
-      const Graph& m_g;
-    };
-
-
-    static void find_matching(const Graph& g, MateMap mate)
-    {
-      typedef std::vector<std::pair<vertex_descriptor_t, vertex_descriptor_t> >
-        directed_edges_vector_t;
-      
-      directed_edges_vector_t edge_list;
-      vertex_iterator_t vi, vi_end;
-      for(tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
-	put(mate, *vi, graph_traits<Graph>::null_vertex());
-
-      edge_iterator_t ei, ei_end;
-      for(tie(ei, ei_end) = edges(g); ei != ei_end; ++ei)
-	{
-	  edge_descriptor_t e = *ei;
-	  vertex_descriptor_t u = source(e,g);
-	  vertex_descriptor_t v = target(e,g);
-	  edge_list.push_back(std::make_pair(u,v));
-	  edge_list.push_back(std::make_pair(v,u));
-	}
-      
-      //sort the edges by the degree of the target, then (using a
-      //stable sort) by degree of the source
-      std::sort(edge_list.begin(), edge_list.end(), 
-                less_than_by_degree<select_second>(g));
-      std::stable_sort(edge_list.begin(), edge_list.end(), 
-                       less_than_by_degree<select_first>(g));
-      
-      //construct the extra greedy matching
-      for(typename directed_edges_vector_t::const_iterator itr = edge_list.begin(); itr != edge_list.end(); ++itr)
-	{
-	  if (get(mate,itr->first) == get(mate,itr->second)) 
-	    //only way equality can hold is if mate[itr->first] == mate[itr->second] == null_vertex
-	    {
-	      put(mate, itr->first, itr->second);
-	      put(mate, itr->second, itr->first);
-	    }
-	}    
-    }
-  };
-
-
-  
-
-  template <typename Graph, typename MateMap>
-  struct empty_matching
-  { 
-    typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t;
-    
-    static void find_matching(const Graph& g, MateMap mate)
-    {
-      vertex_iterator_t vi, vi_end;
-      for(tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi)
-	put(mate, *vi, graph_traits<Graph>::null_vertex());
-    }
-  };
-  
-
-
-
-  //***************************************************************************
-  //***************************************************************************
-  //               Matching Verifiers
-  //***************************************************************************
-  //***************************************************************************
-
-  namespace detail
-  {
-
-    template <typename SizeType>
-    class odd_components_counter : public dfs_visitor<>
-    // This depth-first search visitor will count the number of connected 
-    // components with an odd number of vertices. It's used by 
-    // maximum_matching_verifier.
-    {
-    public:
-      odd_components_counter(SizeType& c_count):
-	m_count(c_count)
-      {
-	m_count = 0;
-      }
-      
-      template <class Vertex, class Graph>
-      void start_vertex(Vertex v, Graph&) 
-      {  
-	addend = -1; 
-      }
-      
-      template <class Vertex, class Graph>
-      void discover_vertex(Vertex u, Graph&) 
-      {
-	addend *= -1;
-	m_count += addend;
-      }
-      
-    protected:
-      SizeType& m_count;
-      
-    private:
-      SizeType addend;
-      
-    };
-
-  }//namespace detail
-
-
-
-
-  template <typename Graph, typename MateMap, 
-            typename VertexIndexMap = dummy_property_map>
-  struct no_matching_verifier
-  {
-    inline static bool 
-    verify_matching(const Graph& g, MateMap mate, VertexIndexMap vm) 
-    { return true;}
-  };
-  
-  
-
-
-  template <typename Graph, typename MateMap, typename VertexIndexMap>
-  struct maximum_cardinality_matching_verifier
-  {
-
-    template <typename X>
-    struct map_vertex_to_
-    { 
-      typedef boost::iterator_property_map<typename std::vector<X>::iterator,
-                                           VertexIndexMap> type; 
-    };
-
-    typedef typename graph_traits<Graph>::vertex_descriptor 
-      vertex_descriptor_t;
-    typedef typename graph_traits<Graph>::vertices_size_type v_size_t;
-    typedef typename graph_traits<Graph>::vertex_iterator vertex_iterator_t;
-    typedef typename map_vertex_to_<int>::type vertex_to_int_map_t;
-    typedef typename map_vertex_to_<vertex_descriptor_t>::type 
-      vertex_to_vertex_map_t;
-
-    template <typename VertexStateMap>
-    struct non_odd_vertex {
-      //this predicate is used to create a filtered graph that
-      //excludes vertices labeled "graph::detail::V_ODD"
-      non_odd_vertex() : vertex_state(0) { }
-      non_odd_vertex(VertexStateMap* arg_vertex_state) 
-        : vertex_state(arg_vertex_state) { }
-      template <typename Vertex>
-      bool operator()(const Vertex& v) const {
-	BOOST_ASSERT(vertex_state);
-	return get(*vertex_state, v) != graph::detail::V_ODD;
-      }
-      VertexStateMap* vertex_state;
-    };
-
-    static bool verify_matching(const Graph& g, MateMap mate, VertexIndexMap vm)
-    {
-      //For any graph G, let o(G) be the number of connected
-      //components in G of odd size. For a subset S of G's vertex set
-      //V(G), let (G - S) represent the subgraph of G induced by
-      //removing all vertices in S from G. Let M(G) be the size of the
-      //maximum cardinality matching in G. Then the Tutte-Berge
-      //formula guarantees that
-      //
-      //           2 * M(G) = min ( |V(G)| + |U| + o(G - U) )
-      //
-      //where the minimum is taken over all subsets U of
-      //V(G). Edmonds' algorithm finds a set U that achieves the
-      //minimum in the above formula, namely the vertices labeled
-      //"ODD." This function runs one iteration of Edmonds' algorithm
-      //to find U, then verifies that the size of the matching given
-      //by mate satisfies the Tutte-Berge formula.
-
-      //first, make sure it's a valid matching
-      if (!is_a_matching(g,mate,vm))
-	  return false;
-
-      //We'll try to augment the matching once. This serves two
-      //purposes: first, if we find some augmenting path, the matching
-      //is obviously non-maximum. Second, running edmonds' algorithm
-      //on a graph with no augmenting path will create the
-      //Edmonds-Gallai decomposition that we need as a certificate of
-      //maximality - we can get it by looking at the vertex_state map
-      //that results.
-      edmonds_augmenting_path_finder<Graph,MateMap,VertexIndexMap>
-        augmentor(g,mate,vm);
-      if (augmentor.augment_matching())
-	  return false;
-
-      std::vector<int> vertex_state_vector(num_vertices(g));
-      vertex_to_int_map_t vertex_state(vertex_state_vector.begin(), vm);
-      augmentor.get_vertex_state_map(vertex_state);
-      
-      //count the number of graph::detail::V_ODD vertices
-      v_size_t num_odd_vertices = 0;
-      vertex_iterator_t vi, vi_end;
-      for(tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi)
-	if (vertex_state[*vi] == graph::detail::V_ODD)
-	  ++num_odd_vertices;
-
-      //count the number of connected components with odd cardinality
-      //in the graph without graph::detail::V_ODD vertices
-      non_odd_vertex<vertex_to_int_map_t> filter(&vertex_state);
-      filtered_graph<Graph, keep_all, non_odd_vertex<vertex_to_int_map_t> > fg(g, keep_all(), filter);
-
-      v_size_t num_odd_components;
-      detail::odd_components_counter<v_size_t> occ(num_odd_components);
-      depth_first_search(fg, visitor(occ).vertex_index_map(vm));
-
-      if (2 * matching_size(g,mate,vm) == num_vertices(g) + num_odd_vertices - num_odd_components)
-	return true;
-      else
-	return false;
-    }
-  };
-
-
-
-
-  template <typename Graph, 
-	    typename MateMap,
-	    typename VertexIndexMap,
-	    template <typename, typename, typename> class AugmentingPathFinder, 
-	    template <typename, typename> class InitialMatchingFinder,
-	    template <typename, typename, typename> class MatchingVerifier>
-  bool matching(const Graph& g, MateMap mate, VertexIndexMap vm)
-  {
-    
-    InitialMatchingFinder<Graph,MateMap>::find_matching(g,mate);
-
-    AugmentingPathFinder<Graph,MateMap,VertexIndexMap> augmentor(g,mate,vm);
-    bool not_maximum_yet = true;
-    while(not_maximum_yet)
-      {
-	not_maximum_yet = augmentor.augment_matching();
-      }
-    augmentor.get_current_matching(mate);
-
-    return MatchingVerifier<Graph,MateMap,VertexIndexMap>::verify_matching(g,mate,vm);    
-    
-  }
-
-
-
-
-  template <typename Graph, typename MateMap, typename VertexIndexMap>
-  inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm)
-  {
-    return matching 
-      < Graph, MateMap, VertexIndexMap,
-        edmonds_augmenting_path_finder, extra_greedy_matching, maximum_cardinality_matching_verifier>
-      (g, mate, vm);
-  }
-
-
-
-
-  template <typename Graph, typename MateMap>
-  inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate)
-  {
-    return checked_edmonds_maximum_cardinality_matching(g, mate, get(vertex_index,g));
-  }
-
-
-
-
-  template <typename Graph, typename MateMap, typename VertexIndexMap>
-  inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm)
-  {
-    matching < Graph, MateMap, VertexIndexMap,
-               edmonds_augmenting_path_finder, extra_greedy_matching, no_matching_verifier>
-      (g, mate, vm);
-  }
-
-
-
-
-  template <typename Graph, typename MateMap>
-  inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate)
-  {
-    edmonds_maximum_cardinality_matching(g, mate, get(vertex_index,g));
-  }
-
-}//namespace boost
-
-#endif //BOOST_GRAPH_MAXIMUM_CARDINALITY_MATCHING_HPP

Modified: boost/trunk/boost/graph/page_rank.hpp
===================================================================
--- boost/trunk/boost/graph/page_rank.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/page_rank.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,8 @@
 // Copyright 2004-5 The Trustees of Indiana University.
 // Copyright 2002 Brad King and Douglas Gregor
 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
 //  Authors: Douglas Gregor

Modified: boost/trunk/boost/graph/plod_generator.hpp
===================================================================
--- boost/trunk/boost/graph/plod_generator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/plod_generator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,161 +1,161 @@
-// Copyright 2004 The Trustees of Indiana University.
-
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-//  Authors: Douglas Gregor
-//           Andrew Lumsdaine
-#ifndef BOOST_GRAPH_PLOD_GENERATOR_HPP
-#define BOOST_GRAPH_PLOD_GENERATOR_HPP
-
-#include <iterator>
-#include <utility>
-#include <boost/random/uniform_int.hpp>
-#include <boost/shared_ptr.hpp>
-#include <boost/graph/graph_traits.hpp>
-#include <vector>
-#include <map>
-#include <cmath>
-
-namespace boost {
-
-  template<typename RandomGenerator, typename Graph>
-  class plod_iterator
-  {
-    typedef std::vector<std::pair<std::size_t, std::size_t> > out_degrees_t;
-    typedef typename graph_traits<Graph>::directed_category directed_category;
-
-  public:
-    typedef std::input_iterator_tag iterator_category;
-    typedef std::pair<std::size_t, std::size_t> value_type;
-    typedef const value_type& reference;
-    typedef const value_type* pointer;
-    typedef void difference_type;
-
-    plod_iterator() 
-      : gen(0), out_degrees(), degrees_left(0), allow_self_loops(false) { }
-
-    plod_iterator(RandomGenerator& gen, std::size_t n,  
-                  double alpha, double beta, bool allow_self_loops = false)
-      : gen(&gen), n(n), out_degrees(new out_degrees_t),
-        degrees_left(0), allow_self_loops(allow_self_loops)
-    {
-      using std::pow;
-
-      uniform_int<std::size_t> x(0, n-1);
-      for (std::size_t i = 0; i != n; ++i) {
-        std::size_t xv = x(gen);
-	std::size_t degree = (xv == 0? 0 : std::size_t(beta * pow(xv, -alpha)));
-	if (degree != 0) {
-	  out_degrees->push_back(std::make_pair(i, degree));
-	}
-        degrees_left += degree;
-      }
-
-      next(directed_category());
-    }
-
-    reference operator*() const { return current; }
-    pointer operator->() const { return &current; }
-    
-    plod_iterator& operator++()
-    { 
-      next(directed_category());
-      return *this;
-    }
-
-    plod_iterator operator++(int)
-    {
-      plod_iterator temp(*this);
-      ++(*this);
-      return temp;
-    }
-
-    bool operator==(const plod_iterator& other) const
-    { 
-      return degrees_left == other.degrees_left; 
-    }
-
-    bool operator!=(const plod_iterator& other) const
-    { return !(*this == other); }
-
-  private:
-    void next(directed_tag)
-    {
-      uniform_int<std::size_t> x(0, out_degrees->size()-1);
-      std::size_t source;
-      do {
-        source = x(*gen);
-      } while ((*out_degrees)[source].second == 0);
-      current.first = (*out_degrees)[source].first;
-      do {
-        current.second = x(*gen);
-      } while (current.first == current.second && !allow_self_loops);
-      --degrees_left;
-      if (--(*out_degrees)[source].second == 0) {
-        (*out_degrees)[source] = out_degrees->back();
-        out_degrees->pop_back();
-      }
-    }
-
-    void next(undirected_tag)
-    {
-      std::size_t source, target;
-      while (true) {
-        /* We may get to the point where we can't actually find any
-           new edges, so we just add some random edge and set the
-           degrees left = 0 to signal termination. */
-        if (out_degrees->size() < 2) {
-          uniform_int<std::size_t> x(0, n);
-          current.first  = x(*gen);
-          do {
-            current.second = x(*gen);
-          } while (current.first == current.second && !allow_self_loops);
-          degrees_left = 0;
-          out_degrees->clear();
-          return;
-        }
-
-        uniform_int<std::size_t> x(0, out_degrees->size()-1);
-
-        // Select source vertex
-        source = x(*gen);
-        if ((*out_degrees)[source].second == 0) {
-          (*out_degrees)[source] = out_degrees->back();
-          out_degrees->pop_back();
-          continue;
-        } 
-
-        // Select target vertex
-        target = x(*gen);
-        if ((*out_degrees)[target].second == 0) {
-          (*out_degrees)[target] = out_degrees->back();
-          out_degrees->pop_back();
-          continue;
-        } else if (source != target 
-                   || (allow_self_loops && (*out_degrees)[source].second > 2)) {
-          break;
-        }
-      }
-
-      // Update degree counts
-      --(*out_degrees)[source].second;
-      --degrees_left;
-      --(*out_degrees)[target].second;
-      --degrees_left;
-      current.first  = (*out_degrees)[source].first;
-      current.second = (*out_degrees)[target].first;
-    }
-
-    RandomGenerator* gen;
-    std::size_t n;
-    shared_ptr<out_degrees_t> out_degrees;
-    std::size_t degrees_left;
-    bool allow_self_loops;
-    value_type current;
-  };
-
-} // end namespace boost
-
-#endif // BOOST_GRAPH_PLOD_GENERATOR_HPP
+// Copyright 2004 The Trustees of Indiana University.
+
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+//  Authors: Douglas Gregor
+//           Andrew Lumsdaine
+#ifndef BOOST_GRAPH_PLOD_GENERATOR_HPP
+#define BOOST_GRAPH_PLOD_GENERATOR_HPP
+
+#include <iterator>
+#include <utility>
+#include <boost/random/uniform_int.hpp>
+#include <boost/shared_ptr.hpp>
+#include <boost/graph/graph_traits.hpp>
+#include <vector>
+#include <map>
+#include <cmath>
+
+namespace boost {
+
+  template<typename RandomGenerator, typename Graph>
+  class plod_iterator
+  {
+    typedef std::vector<std::pair<std::size_t, std::size_t> > out_degrees_t;
+    typedef typename graph_traits<Graph>::directed_category directed_category;
+
+  public:
+    typedef std::input_iterator_tag iterator_category;
+    typedef std::pair<std::size_t, std::size_t> value_type;
+    typedef const value_type& reference;
+    typedef const value_type* pointer;
+    typedef void difference_type;
+
+    plod_iterator() 
+      : gen(0), out_degrees(), degrees_left(0), allow_self_loops(false) { }
+
+    plod_iterator(RandomGenerator& gen, std::size_t n,  
+                  double alpha, double beta, bool allow_self_loops = false)
+      : gen(&gen), n(n), out_degrees(new out_degrees_t),
+        degrees_left(0), allow_self_loops(allow_self_loops)
+    {
+      using std::pow;
+
+      uniform_int<std::size_t> x(0, n-1);
+      for (std::size_t i = 0; i != n; ++i) {
+        std::size_t xv = x(gen);
+    std::size_t degree = (xv == 0? 0 : std::size_t(beta * pow(xv, -alpha)));
+    if (degree != 0) {
+      out_degrees->push_back(std::make_pair(i, degree));
+    }
+        degrees_left += degree;
+      }
+
+      next(directed_category());
+    }
+
+    reference operator*() const { return current; }
+    pointer operator->() const { return &current; }
+    
+    plod_iterator& operator++()
+    { 
+      next(directed_category());
+      return *this;
+    }
+
+    plod_iterator operator++(int)
+    {
+      plod_iterator temp(*this);
+      ++(*this);
+      return temp;
+    }
+
+    bool operator==(const plod_iterator& other) const
+    { 
+      return degrees_left == other.degrees_left; 
+    }
+
+    bool operator!=(const plod_iterator& other) const
+    { return !(*this == other); }
+
+  private:
+    void next(directed_tag)
+    {
+      uniform_int<std::size_t> x(0, out_degrees->size()-1);
+      std::size_t source;
+      do {
+        source = x(*gen);
+      } while ((*out_degrees)[source].second == 0);
+      current.first = (*out_degrees)[source].first;
+      do {
+        current.second = x(*gen);
+      } while (current.first == current.second && !allow_self_loops);
+      --degrees_left;
+      if (--(*out_degrees)[source].second == 0) {
+        (*out_degrees)[source] = out_degrees->back();
+        out_degrees->pop_back();
+      }
+    }
+
+    void next(undirected_tag)
+    {
+      std::size_t source, target;
+      while (true) {
+        /* We may get to the point where we can't actually find any
+           new edges, so we just add some random edge and set the
+           degrees left = 0 to signal termination. */
+        if (out_degrees->size() < 2) {
+          uniform_int<std::size_t> x(0, n);
+          current.first  = x(*gen);
+          do {
+            current.second = x(*gen);
+          } while (current.first == current.second && !allow_self_loops);
+          degrees_left = 0;
+          out_degrees->clear();
+          return;
+        }
+
+        uniform_int<std::size_t> x(0, out_degrees->size()-1);
+
+        // Select source vertex
+        source = x(*gen);
+        if ((*out_degrees)[source].second == 0) {
+          (*out_degrees)[source] = out_degrees->back();
+          out_degrees->pop_back();
+          continue;
+        } 
+
+        // Select target vertex
+        target = x(*gen);
+        if ((*out_degrees)[target].second == 0) {
+          (*out_degrees)[target] = out_degrees->back();
+          out_degrees->pop_back();
+          continue;
+        } else if (source != target 
+                   || (allow_self_loops && (*out_degrees)[source].second > 2)) {
+          break;
+        }
+      }
+
+      // Update degree counts
+      --(*out_degrees)[source].second;
+      --degrees_left;
+      --(*out_degrees)[target].second;
+      --degrees_left;
+      current.first  = (*out_degrees)[source].first;
+      current.second = (*out_degrees)[target].first;
+    }
+
+    RandomGenerator* gen;
+    std::size_t n;
+    shared_ptr<out_degrees_t> out_degrees;
+    std::size_t degrees_left;
+    bool allow_self_loops;
+    value_type current;
+  };
+
+} // end namespace boost
+
+#endif // BOOST_GRAPH_PLOD_GENERATOR_HPP

Modified: boost/trunk/boost/graph/properties.hpp
===================================================================
--- boost/trunk/boost/graph/properties.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/properties.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,13 +16,6 @@
 #include <boost/graph/graph_traits.hpp>
 #include <boost/type_traits/is_convertible.hpp>
 
-
-#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
-// Stay out of the way of the concept checking class
-# define Graph Graph_
-# define RandomAccessContainer RandomAccessContainer_
-#endif
-
 namespace boost {
 
   enum default_color_type { white_color, gray_color, green_color, red_color, black_color };
@@ -339,7 +332,8 @@
     typedef T value_type;
     typedef T& reference;
     typedef lvalue_property_map_tag category;
-
+ 
+    bundle_property_map() { }
     bundle_property_map(Graph* g_, T Bundle::* pm_) : g(g_), pm(pm_) {}
 
     reference operator[](key_type k) const { return (*g)[k].*pm; }
@@ -378,11 +372,4 @@
 
 } // namespace boost
 
-#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
-// Stay out of the way of the concept checking class
-# undef Graph
-# undef RandomAccessIterator
-#endif
-
-
 #endif /* BOOST_GRAPH_PROPERTIES_HPPA */

Modified: boost/trunk/boost/graph/random_layout.hpp
===================================================================
--- boost/trunk/boost/graph/random_layout.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/random_layout.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright 2004 The Trustees of Indiana University.
 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
 //  Authors: Douglas Gregor

Modified: boost/trunk/boost/graph/reverse_graph.hpp
===================================================================
--- boost/trunk/boost/graph/reverse_graph.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/reverse_graph.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,11 +10,6 @@
 #include <boost/graph/properties.hpp>
 #include <boost/tuple/tuple.hpp>
 
-#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
-// Stay out of the way of the concept checking class
-# define BidirectionalGraph BidirectionalGraph_
-#endif
-
 namespace boost {
 
 struct reverse_graph_tag { };
@@ -316,9 +311,4 @@
 
 } // namespace boost
 
-#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
-// Stay out of the way of the concept checking class
-# undef BidirectionalGraph
 #endif
-
-#endif

Modified: boost/trunk/boost/graph/small_world_generator.hpp
===================================================================
--- boost/trunk/boost/graph/small_world_generator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/small_world_generator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright 2004 The Trustees of Indiana University.
 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
 //  Authors: Douglas Gregor

Modified: boost/trunk/boost/graph/two_bit_color_map.hpp
===================================================================
--- boost/trunk/boost/graph/two_bit_color_map.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/two_bit_color_map.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,90 +1,90 @@
-// Copyright (C) 2005-2006 The Trustees of Indiana University.
-
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-//  Authors: Jeremiah Willcock
-//           Douglas Gregor
-//           Andrew Lumsdaine
-
-// Two bit per color property map
-
-#ifndef BOOST_TWO_BIT_COLOR_MAP_HPP
-#define BOOST_TWO_BIT_COLOR_MAP_HPP
-
-#include <boost/property_map.hpp>
-#include <boost/shared_array.hpp>
-
-namespace boost {
-
-enum two_bit_color_type { 
-  two_bit_white = 0, 
-  two_bit_gray = 1, 
-  two_bit_green = 2, 
-  two_bit_black = 3 
-};
-
-template <>
-struct color_traits<two_bit_color_type>
-{
-  static two_bit_color_type white() { return two_bit_white; }
-  static two_bit_color_type gray() { return two_bit_gray; }
-  static two_bit_color_type green() { return two_bit_green; }
-  static two_bit_color_type black() { return two_bit_black; }
-};
-
-
-template<typename IndexMap = identity_property_map>
-struct two_bit_color_map 
-{
-  std::size_t n;
-  IndexMap index;
-  shared_array<unsigned char> data;
-
-  typedef typename property_traits<IndexMap>::key_type key_type;
-  typedef two_bit_color_type value_type;
-  typedef void reference;
-  typedef read_write_property_map_tag category;
-
-  explicit two_bit_color_map(std::size_t n, const IndexMap& index = IndexMap())
-    : n(n), index(index), data(new unsigned char[(n + 3) / 4])
-  {
-  }
-};
-
-template<typename IndexMap>
-inline two_bit_color_type
-get(const two_bit_color_map<IndexMap>& pm, 
-    typename two_bit_color_map<IndexMap>::key_type key) 
-{
-  typename property_traits<IndexMap>::value_type i = get(pm.index, key);
-  assert (i < pm.n);
-  return two_bit_color_type((pm.data.get()[i / 4] >> ((i % 4) * 2)) & 3);
-}
-
-template<typename IndexMap>
-inline void
-put(const two_bit_color_map<IndexMap>& pm, 
-    typename two_bit_color_map<IndexMap>::key_type key,
-    two_bit_color_type value)
-{
-  typename property_traits<IndexMap>::value_type i = get(pm.index, key);
-  assert (i < pm.n);
-  assert (value >= 0 && value < 4);
-  std::size_t byte_num = i / 4;
-  std::size_t bit_position = ((i % 4) * 2);
-    pm.data.get()[byte_num] = (pm.data.get()[byte_num] & ~(3 << bit_position))
-      | (value << bit_position);
-}
-
-template<typename IndexMap>
-inline two_bit_color_map<IndexMap>
-make_two_bit_color_map(std::size_t n, const IndexMap& index_map)
-{
-  return two_bit_color_map<IndexMap>(n, index_map);
-}
-
-} // end namespace boost
-
-#endif // BOOST_TWO_BIT_COLOR_MAP_HPP
+// Copyright (C) 2005-2006 The Trustees of Indiana University.
+
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+//  Authors: Jeremiah Willcock
+//           Douglas Gregor
+//           Andrew Lumsdaine
+
+// Two bit per color property map
+
+#ifndef BOOST_TWO_BIT_COLOR_MAP_HPP
+#define BOOST_TWO_BIT_COLOR_MAP_HPP
+
+#include <boost/property_map.hpp>
+#include <boost/shared_array.hpp>
+
+namespace boost {
+
+enum two_bit_color_type { 
+  two_bit_white = 0, 
+  two_bit_gray  = 1, 
+  two_bit_green = 2, 
+  two_bit_black = 3 
+};
+
+template <>
+struct color_traits<two_bit_color_type>
+{
+  static two_bit_color_type white() { return two_bit_white; }
+  static two_bit_color_type gray()  { return two_bit_gray; }
+  static two_bit_color_type green() { return two_bit_green; }
+  static two_bit_color_type black() { return two_bit_black; }
+};
+
+
+template<typename IndexMap = identity_property_map>
+struct two_bit_color_map 
+{
+  std::size_t n;
+  IndexMap index;
+  shared_array<unsigned char> data;
+
+  typedef typename property_traits<IndexMap>::key_type key_type;
+  typedef two_bit_color_type value_type;
+  typedef void reference;
+  typedef read_write_property_map_tag category;
+
+  explicit two_bit_color_map(std::size_t n, const IndexMap& index = IndexMap())
+    : n(n), index(index), data(new unsigned char[(n + 3) / 4])
+  {
+  }
+};
+
+template<typename IndexMap>
+inline two_bit_color_type
+get(const two_bit_color_map<IndexMap>& pm, 
+    typename two_bit_color_map<IndexMap>::key_type key) 
+{
+  typename property_traits<IndexMap>::value_type i = get(pm.index, key);
+  assert (i < pm.n);
+  return two_bit_color_type((pm.data.get()[i / 4] >> ((i % 4) * 2)) & 3);
+}
+
+template<typename IndexMap>
+inline void
+put(const two_bit_color_map<IndexMap>& pm, 
+    typename two_bit_color_map<IndexMap>::key_type key,
+    two_bit_color_type value)
+{
+  typename property_traits<IndexMap>::value_type i = get(pm.index, key);
+  assert (i < pm.n);
+  assert (value >= 0 && value < 4);
+  std::size_t byte_num = i / 4;
+  std::size_t bit_position = ((i % 4) * 2);
+    pm.data.get()[byte_num] = (pm.data.get()[byte_num] & ~(3 << bit_position))
+      | (value << bit_position);
+}
+
+template<typename IndexMap>
+inline two_bit_color_map<IndexMap>
+make_two_bit_color_map(std::size_t n, const IndexMap& index_map)
+{
+  return two_bit_color_map<IndexMap>(n, index_map);
+}
+
+} // end namespace boost
+
+#endif // BOOST_TWO_BIT_COLOR_MAP_HPP

Modified: boost/trunk/boost/graph/visitors.hpp
===================================================================
--- boost/trunk/boost/graph/visitors.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/graph/visitors.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,11 +20,6 @@
 #include <boost/limits.hpp>
 #include <boost/graph/detail/is_same.hpp>
 
-#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
-// Stay out of the way of the concept checking class
-# define Graph Graph_
-#endif
-
 namespace boost {
 
   // This is a bit more convenient than std::numeric_limits because
@@ -271,9 +266,4 @@
 
 } /* namespace boost */
 
-#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
-// Stay out of the way of the concept checking class
-# undef Graph
 #endif
-
-#endif

Modified: boost/trunk/boost/implicit_cast.hpp
===================================================================
--- boost/trunk/boost/implicit_cast.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/implicit_cast.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,12 +23,6 @@
 //template <typename T>
 //void implicit_cast (...);
 
-// Macro for when you need a constant expression (Gennaro Prota)
-#define BOOST_IMPLICIT_CAST(dst_type, expr)           \
-          ( sizeof( implicit_cast<dst_type>(expr) )   \
-                     ,                                \
-            static_cast<dst_type>(expr)               \
-          )
 
 } // namespace boost
 

Modified: boost/trunk/boost/intrusive_ptr.hpp
===================================================================
--- boost/trunk/boost/intrusive_ptr.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/intrusive_ptr.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -249,6 +249,9 @@
 
 #else
 
+// in STLport's no-iostreams mode no iostream symbols can be used
+#ifndef _STLP_NO_IOSTREAMS
+
 # if defined(BOOST_MSVC) && BOOST_WORKAROUND(BOOST_MSVC, < 1300 && __SGI_STL_PORT)
 // MSVC6 has problems finding std::basic_ostream through the using declaration in namespace _STL
 using std::basic_ostream;
@@ -261,8 +264,10 @@
     return os;
 }
 
-#endif
+#endif // _STLP_NO_IOSTREAMS
 
+#endif // __GNUC__ < 3
+
 } // namespace boost
 
 #ifdef BOOST_MSVC

Modified: boost/trunk/boost/io/ios_state.hpp
===================================================================
--- boost/trunk/boost/io/ios_state.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/io/ios_state.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,6 +10,7 @@
 #define BOOST_IO_IOS_STATE_HPP
 
 #include <boost/io_fwd.hpp>  // self include
+#include <boost/detail/workaround.hpp>
 
 #include <ios>        // for std::ios_base, std::basic_ios, etc.
 #ifndef BOOST_NO_STD_LOCALE
@@ -19,7 +20,6 @@
 #include <streambuf>  // for std::basic_streambuf
 #include <string>     // for std::char_traits
 
-
 namespace boost
 {
 namespace io

Modified: boost/trunk/boost/iostreams/char_traits.hpp
===================================================================
--- boost/trunk/boost/iostreams/char_traits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/iostreams/char_traits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -28,9 +28,11 @@
 namespace boost { namespace iostreams {
 
 // Dinkumware that comes with QNX Momentics 6.3.0, 4.0.2, incorrectly defines the
-// EOF and WEOF macros to not std:: qualify the wint_t type.
-// Fix by placing the def in this scope.
-#if defined(__QNX__) && defined(BOOST_DINKUMWARE_STDLIB)
+// EOF and WEOF macros to not std:: qualify the wint_t type (and so does
+// Sun C++ 5.8 + STLport 4). Fix by placing the def in this scope.
+// NOTE: Use BOOST_WORKAROUND?
+#if (defined(__QNX__) && defined(BOOST_DINKUMWARE_STDLIB))  \
+    || defined(__SUNPRO_CC)
 using ::std::wint_t;
 #endif
 

Modified: boost/trunk/boost/iostreams/filter/symmetric.hpp
===================================================================
--- boost/trunk/boost/iostreams/filter/symmetric.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/iostreams/filter/symmetric.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -231,7 +231,7 @@
 
     void close();
 
-    enum {
+    enum flag_type {
         f_read   = 1,
         f_write  = f_read << 1,
         f_eof    = f_write << 1,

Modified: boost/trunk/boost/iostreams/positioning.hpp
===================================================================
--- boost/trunk/boost/iostreams/positioning.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/iostreams/positioning.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,6 +14,7 @@
 # pragma once
 #endif
 
+#include <boost/config.hpp>
 #include <boost/cstdint.hpp>
 #include <boost/integer_traits.hpp>
 #include <boost/iostreams/detail/config/codecvt.hpp> // mbstate_t.
@@ -22,6 +23,10 @@
 // Must come last.
 #include <boost/iostreams/detail/config/disable_warnings.hpp> 
 
+#ifdef BOOST_NO_STDC_NAMESPACE
+namespace std { using ::fpos_t; }
+#endif
+
 namespace boost { namespace iostreams {
 
 typedef boost::intmax_t stream_offset;

Modified: boost/trunk/boost/iterator/detail/facade_iterator_category.hpp
===================================================================
--- boost/trunk/boost/iterator/detail/facade_iterator_category.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/iterator/detail/facade_iterator_category.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,12 +6,13 @@
 
 # include <boost/iterator/iterator_categories.hpp>
 
+# include <boost/static_assert.hpp>
+
 # include <boost/mpl/or.hpp>  // used in iterator_tag inheritance logic
 # include <boost/mpl/and.hpp>
 # include <boost/mpl/if.hpp>
 # include <boost/mpl/eval_if.hpp>
 # include <boost/mpl/identity.hpp>
-# include <boost/mpl/assert.hpp>
 
 # include <boost/type_traits/is_same.hpp>
 # include <boost/type_traits/is_const.hpp>
@@ -138,21 +139,29 @@
 struct iterator_category_with_traversal
   : Category, Traversal
 {
+# if 0
+    // Because of limitations on multiple user-defined conversions,
+    // this should be a good test of whether convertibility is enough
+    // in the spec, or whether we need to specify inheritance.
+    operator Category() const { return Category(); }
+    operator Traversal() const { return Traversal(); }
+# endif
+    
 # if !BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
     // Make sure this isn't used to build any categories where
     // convertibility to Traversal is redundant.  Should just use the
     // Category element in that case.
-    BOOST_MPL_ASSERT_NOT((
-        is_convertible<
+    BOOST_STATIC_ASSERT(
+        !(is_convertible<
               typename iterator_category_to_traversal<Category>::type
             , Traversal
-          >));
+          >::value));
 
-    BOOST_MPL_ASSERT((is_iterator_category<Category>));
-    BOOST_MPL_ASSERT_NOT((is_iterator_category<Traversal>));
-    BOOST_MPL_ASSERT_NOT((is_iterator_traversal<Category>));
+    BOOST_STATIC_ASSERT(is_iterator_category<Category>::value);
+    BOOST_STATIC_ASSERT(!is_iterator_category<Traversal>::value);
+    BOOST_STATIC_ASSERT(!is_iterator_traversal<Category>::value);
 #  if !BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1310))
-    BOOST_MPL_ASSERT((is_iterator_traversal<Traversal>));
+    BOOST_STATIC_ASSERT(is_iterator_traversal<Traversal>::value);
 #  endif 
 # endif 
 };
@@ -163,7 +172,7 @@
 struct facade_iterator_category_impl
 {
 # if !BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
-    BOOST_MPL_ASSERT_NOT((is_iterator_category<Traversal>));
+    BOOST_STATIC_ASSERT(!is_iterator_category<Traversal>::value);
 # endif 
     
     typedef typename iterator_facade_default_category<

Modified: boost/trunk/boost/iterator/iterator_archetypes.hpp
===================================================================
--- boost/trunk/boost/iterator/iterator_archetypes.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/iterator/iterator_archetypes.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -196,8 +196,6 @@
           explicit archetype(ctor_arg arg)
             : traversal_archetype_<Derived, Value, incrementable_traversal_tag>(arg)
           {}
-          
-          typedef std::ptrdiff_t difference_type;
       };
   };
 
@@ -221,6 +219,7 @@
           archetype() 
             : traversal_archetype_<Derived, Value, single_pass_traversal_tag>(ctor_arg())
           {}
+          typedef std::ptrdiff_t difference_type;
       };
   };
 

Modified: boost/trunk/boost/iterator/iterator_concepts.hpp
===================================================================
--- boost/trunk/boost/iterator/iterator_concepts.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/iterator/iterator_concepts.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,6 +20,7 @@
 
 #include <boost/type_traits/is_same.hpp>
 #include <boost/type_traits/is_integral.hpp>
+#include <boost/type_traits/is_convertible.hpp>
 
 #include <boost/mpl/bool.hpp>
 #include <boost/mpl/if.hpp>
@@ -34,233 +35,247 @@
 
 #include <algorithm>
 
-#include <boost/concept/detail/concept_def.hpp>
-
-namespace boost_concepts
-{
+namespace boost_concepts {
   // Used a different namespace here (instead of "boost") so that the
   // concept descriptions do not take for granted the names in
   // namespace boost.
 
+  // We use this in place of STATIC_ASSERT((is_convertible<...>))
+  // because some compilers (CWPro7.x) can't detect convertibility.
+  //
+  // Of course, that just gets us a different error at the moment with
+  // some tests, since new iterator category deduction still depends
+  // on convertibility detection. We might need some specializations
+  // to support this compiler.
+  template <class Target, class Source>
+  struct static_assert_base_and_derived
+  {
+      static_assert_base_and_derived(Target* = (Source*)0) {}
+  };
+
   //===========================================================================
   // Iterator Access Concepts
 
-  BOOST_concept(ReadableIterator,(Iterator))
-    : boost::Assignable<Iterator>
-    , boost::CopyConstructible<Iterator>
+  template <typename Iterator>
+  class ReadableIteratorConcept {
+  public:
+    typedef BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits<Iterator>::value_type value_type;
 
-  {
-      typedef BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits<Iterator>::value_type value_type;
-      typedef BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits<Iterator>::reference reference;
+    void constraints() {
+      boost::function_requires< boost::AssignableConcept<Iterator> >();
+      boost::function_requires< boost::CopyConstructibleConcept<Iterator> >();
 
-      ~ReadableIterator()
-      {
-
-          value_type v = *i;
-          boost::ignore_unused_variable_warning(v);
-      }
-  private:
-      Iterator i;
+      value_type v = *i;
+      boost::ignore_unused_variable_warning(v);
+    }
+    Iterator i;
   };
   
   template <
       typename Iterator
     , typename ValueType = BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits<Iterator>::value_type
   >
-  struct WritableIterator
-    : boost::CopyConstructible<Iterator>
-  {
-      ~WritableIterator()
-      {
-          *i = v;
-      }
-  private:
-      ValueType v;
-      Iterator i;
+  class WritableIteratorConcept {
+  public:
+      
+    void constraints() {
+      boost::function_requires< boost::CopyConstructibleConcept<Iterator> >();
+      *i = v;
+    }
+    ValueType v;
+    Iterator i;
   };
+  
+  template <typename Iterator>
+  class SwappableIteratorConcept {
+  public:
 
-  template <
-      typename Iterator
-    , typename ValueType = BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits<Iterator>::value_type
-  >
-  struct WritableIteratorConcept : WritableIterator<Iterator,ValueType> {};
-  
-  BOOST_concept(SwappableIterator,(Iterator))
-  {
-      ~SwappableIterator()
-      {
-          std::iter_swap(i1, i2);
-      }
-  private:
-      Iterator i1;
-      Iterator i2;
+    void constraints() {
+      std::iter_swap(i1, i2);
+    }
+    Iterator i1;
+    Iterator i2;
   };
 
-  BOOST_concept(LvalueIterator,(Iterator))
+  template <typename Iterator>
+  class LvalueIteratorConcept
   {
+   public:
       typedef typename boost::detail::iterator_traits<Iterator>::value_type value_type;
-      
-      ~LvalueIterator()
+      void constraints()
       {
         value_type& r = const_cast<value_type&>(*i);
         boost::ignore_unused_variable_warning(r);
       }
-  private:
-      Iterator i;
+    Iterator i;
   };
 
   
   //===========================================================================
   // Iterator Traversal Concepts
 
-  BOOST_concept(IncrementableIterator,(Iterator))
-    : boost::Assignable<Iterator>
-    , boost::CopyConstructible<Iterator>
-  {
-      typedef typename boost::iterator_traversal<Iterator>::type traversal_category;
+  template <typename Iterator>
+  class IncrementableIteratorConcept {
+  public:
+    typedef typename boost::iterator_traversal<Iterator>::type traversal_category;
 
-      ~IncrementableIterator()
-      {
-          BOOST_CONCEPT_ASSERT((
-            boost::Convertible<
+    void constraints() {
+      boost::function_requires< boost::AssignableConcept<Iterator> >();
+      boost::function_requires< boost::CopyConstructibleConcept<Iterator> >();
+
+      BOOST_STATIC_ASSERT(
+          (boost::is_convertible<
                 traversal_category
               , boost::incrementable_traversal_tag
-            >));
+           >::value
+          ));
 
-          ++i;
-          (void)i++;
-      }
-  private:
-      Iterator i;
+      ++i;
+      (void)i++;
+    }
+    Iterator i;
   };
 
-  BOOST_concept(SinglePassIterator,(Iterator))
-    : IncrementableIterator<Iterator>
-    , boost::EqualityComparable<Iterator>
+  template <typename Iterator>
+  class SinglePassIteratorConcept {
+  public:
+    typedef typename boost::iterator_traversal<Iterator>::type traversal_category;
+    typedef typename boost::detail::iterator_traits<Iterator>::difference_type difference_type;
 
-  {
-      ~SinglePassIterator()
-      {
-          BOOST_CONCEPT_ASSERT((
-              boost::Convertible<
-                 BOOST_DEDUCED_TYPENAME SinglePassIterator::traversal_category
-               , boost::single_pass_traversal_tag
-              > ));
-      }
+    void constraints() {
+      boost::function_requires< IncrementableIteratorConcept<Iterator> >();
+      boost::function_requires< boost::EqualityComparableConcept<Iterator> >();
+
+      BOOST_STATIC_ASSERT(
+          (boost::is_convertible<
+                traversal_category
+              , boost::single_pass_traversal_tag
+           >::value
+          ));
+    }
   };
 
-  BOOST_concept(ForwardTraversal,(Iterator))
-    : SinglePassIterator<Iterator>
-    , boost::DefaultConstructible<Iterator>
-  {
-      typedef typename boost::detail::iterator_traits<Iterator>::difference_type difference_type;
-      
-      ~ForwardTraversal()
-      {
-          BOOST_MPL_ASSERT((boost::is_integral<difference_type>));
-          BOOST_MPL_ASSERT_RELATION(std::numeric_limits<difference_type>::is_signed, ==, true);
-          
-          BOOST_CONCEPT_ASSERT((
-              boost::Convertible<
-                 BOOST_DEDUCED_TYPENAME ForwardTraversal::traversal_category
-               , boost::forward_traversal_tag
-              > ));
+  template <typename Iterator>
+  class ForwardTraversalConcept {
+  public:
+    typedef typename boost::iterator_traversal<Iterator>::type traversal_category;
+    typedef typename boost::detail::iterator_traits<Iterator>::difference_type difference_type;
+
+    void constraints() {
+      boost::function_requires< SinglePassIteratorConcept<Iterator> >();
+      boost::function_requires< 
+        boost::DefaultConstructibleConcept<Iterator> >();
+
+      typedef boost::mpl::and_<
+        boost::is_integral<difference_type>,
+        boost::mpl::bool_< std::numeric_limits<difference_type>::is_signed >
+        > difference_type_is_signed_integral;
+
+      BOOST_STATIC_ASSERT(difference_type_is_signed_integral::value);
+      BOOST_STATIC_ASSERT(
+          (boost::is_convertible<
+                traversal_category
+              , boost::forward_traversal_tag
+           >::value
+          ));
     }
   };
   
-  BOOST_concept(BidirectionalTraversal,(Iterator))
-    : ForwardTraversal<Iterator>
-  {
-      ~BidirectionalTraversal()
-      {
-          BOOST_CONCEPT_ASSERT((
-              boost::Convertible<
-                 BOOST_DEDUCED_TYPENAME BidirectionalTraversal::traversal_category
-               , boost::bidirectional_traversal_tag
-              > ));
-          
-          --i;
-          (void)i--;
-      }
-   private:
-      Iterator i;
+  template <typename Iterator>
+  class BidirectionalTraversalConcept {
+  public:
+    typedef typename boost::iterator_traversal<Iterator>::type traversal_category;
+
+    void constraints() {
+      boost::function_requires< ForwardTraversalConcept<Iterator> >();
+      
+      BOOST_STATIC_ASSERT(
+          (boost::is_convertible<
+                traversal_category
+              , boost::bidirectional_traversal_tag
+           >::value
+          ));
+
+      --i;
+      (void)i--;
+    }
+    Iterator i;
   };
 
-  BOOST_concept(RandomAccessTraversal,(Iterator))
-    : BidirectionalTraversal<Iterator>
-  {
-   public:
-      ~RandomAccessTraversal()
-      {
-          BOOST_CONCEPT_ASSERT((
-              boost::Convertible<
-                 BOOST_DEDUCED_TYPENAME RandomAccessTraversal::traversal_category
-               , boost::random_access_traversal_tag
-              > ));
-          
-          i += n;
-          i = i + n;
-          i = n + i;
-          i -= n;
-          i = i - n;
-          n = i - j;
-      }
+  template <typename Iterator>
+  class RandomAccessTraversalConcept {
+  public:
+    typedef typename boost::iterator_traversal<Iterator>::type traversal_category;
+    typedef typename boost::detail::iterator_traits<Iterator>::difference_type
+      difference_type;
+
+    void constraints() {
+      boost::function_requires< BidirectionalTraversalConcept<Iterator> >();
+
+      BOOST_STATIC_ASSERT(
+          (boost::is_convertible<
+                traversal_category
+              , boost::random_access_traversal_tag
+           >::value
+          ));
       
-   private:
-      typename BidirectionalTraversal<Iterator>::difference_type n;
-      Iterator i, j;
+      i += n;
+      i = i + n;
+      i = n + i;
+      i -= n;
+      i = i - n;
+      n = i - j;
+    }
+    difference_type n;
+    Iterator i, j;
   };
 
   //===========================================================================
-  // Iterator Interoperability 
+  // Iterator Interoperability Concept
 
   namespace detail
   {
+
     template <typename Iterator1, typename Iterator2>
     void interop_single_pass_constraints(Iterator1 const& i1, Iterator2 const& i2)
     {
-        bool b;
-        b = i1 == i2;
-        b = i1 != i2;
-
-        b = i2 == i1;
-        b = i2 != i1;
-        boost::ignore_unused_variable_warning(b);
+      bool b;
+      b = i1 == i2;
+      b = i1 != i2;
+      
+      b = i2 == i1;
+      b = i2 != i1;
     }
-
+    
     template <typename Iterator1, typename Iterator2>
-    void interop_rand_access_constraints(
-        Iterator1 const& i1, Iterator2 const& i2,
-        boost::random_access_traversal_tag, boost::random_access_traversal_tag)
+    void interop_rand_access_constraints(Iterator1 const& i1, Iterator2 const& i2,
+                                         boost::random_access_traversal_tag, boost::random_access_traversal_tag)
     {
-        bool b;
-        typename boost::detail::iterator_traits<Iterator2>::difference_type n;
-        b = i1 <  i2;
-        b = i1 <= i2;
-        b = i1 >  i2;
-        b = i1 >= i2;
-        n = i1 -  i2;
-
-        b = i2 <  i1;
-        b = i2 <= i1;
-        b = i2 >  i1;
-        b = i2 >= i1;
-        n = i2 -  i1;
-        boost::ignore_unused_variable_warning(b);
-        boost::ignore_unused_variable_warning(n);
+      bool b;
+      typename boost::detail::iterator_traits<Iterator2>::difference_type n;
+      b = i1 <  i2;
+      b = i1 <= i2;
+      b = i1 >  i2;
+      b = i1 >= i2;
+      n = i1 -  i2;
+      
+      b = i2 <  i1;
+      b = i2 <= i1;
+      b = i2 >  i1;
+      b = i2 >= i1;
+      n = i2 -  i1;
     }
-
     template <typename Iterator1, typename Iterator2>
-    void interop_rand_access_constraints(
-        Iterator1 const&, Iterator2 const&,
-        boost::single_pass_traversal_tag, boost::single_pass_traversal_tag)
+    void interop_rand_access_constraints(Iterator1 const& i1, Iterator2 const& i2,
+                                         boost::single_pass_traversal_tag, boost::single_pass_traversal_tag)
     { }
 
   } // namespace detail
 
-  BOOST_concept(InteroperableIterator,(Iterator)(ConstIterator))
+  template <typename Iterator, typename ConstIterator>
+  class InteroperableIteratorConcept
   {
-   private:
+  public:
       typedef typename boost::detail::pure_traversal_tag<
           typename boost::iterator_traversal<
               Iterator
@@ -272,26 +287,22 @@
               ConstIterator
           >::type
       >::type const_traversal_category;
-      
-  public:
-      ~InteroperableIterator()
+
+      void constraints()
       {
-          BOOST_CONCEPT_ASSERT((SinglePassIterator<Iterator>));
-          BOOST_CONCEPT_ASSERT((SinglePassIterator<ConstIterator>));
+          boost::function_requires< SinglePassIteratorConcept<Iterator> >();
+          boost::function_requires< SinglePassIteratorConcept<ConstIterator> >();
 
           detail::interop_single_pass_constraints(i, ci);
           detail::interop_rand_access_constraints(i, ci, traversal_category(), const_traversal_category());
 
           ci = i;
       }
-      
-   private:
       Iterator      i;
       ConstIterator ci;
   };
 
 } // namespace boost_concepts
 
-#include <boost/concept/detail/concept_undef.hpp>
 
 #endif // BOOST_ITERATOR_CONCEPTS_HPP

Modified: boost/trunk/boost/iterator/iterator_facade.hpp
===================================================================
--- boost/trunk/boost/iterator/iterator_facade.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/iterator/iterator_facade.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -293,17 +293,17 @@
 
     // operator->() needs special support for input iterators to strictly meet the
     // standard's requirements. If *i is not a reference type, we must still
-    // produce a (constant) lvalue to which a pointer can be formed. We do that by
+    // produce a lvalue to which a pointer can be formed. We do that by
     // returning an instantiation of this special proxy class template.
     template <class T>
     struct operator_arrow_proxy
     {
         operator_arrow_proxy(T const* px) : m_value(*px) {}
-        const T* operator->() const { return &m_value; }
+        T* operator->() const { return &m_value; }
         // This function is needed for MWCW and BCC, which won't call operator->
         // again automatically per 13.3.1.2 para 8
-        operator const T*() const { return &m_value; }
-        T m_value;
+        operator T*() const { return &m_value; }
+        mutable T m_value;
     };
 
     // A metafunction that gets the result type for operator->.  Also

Modified: boost/trunk/boost/iterator/permutation_iterator.hpp
===================================================================
--- boost/trunk/boost/iterator/permutation_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/iterator/permutation_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -50,6 +50,11 @@
     typename super_t::reference dereference() const
         { return *(m_elt_iter + *this->base()); }
 
+#ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS
+    template <class,class> friend class permutation_iterator;
+#else
+ public:
+#endif 
     ElementIterator m_elt_iter;
 };
 

Modified: boost/trunk/boost/iterator/transform_iterator.hpp
===================================================================
--- boost/trunk/boost/iterator/transform_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/iterator/transform_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -37,10 +37,10 @@
   namespace detail 
   {
 
-    template <class UnaryFunc>
+    template <class UnaryFunction>
     struct function_object_result
     {
-      typedef typename UnaryFunc::result_type type;
+      typedef typename UnaryFunction::result_type type;
     };
 
 #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
@@ -52,7 +52,7 @@
 #endif
 
     // Compute the iterator_adaptor instantiation to be used for transform_iterator
-    template <class UnaryFunc, class Iterator, class Reference, class Value>
+    template <class UnaryFunction, class Iterator, class Reference, class Value>
     struct transform_iterator_base
     {
      private:
@@ -62,7 +62,7 @@
         // proposal (e.g. using Doug's result_of)?
         typedef typename ia_dflt_help<
             Reference
-          , function_object_result<UnaryFunc>
+          , function_object_result<UnaryFunction>
         >::type reference;
 
         // To get the default for Value: remove any reference on the
@@ -77,7 +77,7 @@
 
      public:
         typedef iterator_adaptor<
-            transform_iterator<UnaryFunc, Iterator, Reference, Value>
+            transform_iterator<UnaryFunction, Iterator, Reference, Value>
           , Iterator
           , cv_value_type
           , use_default    // Leave the traversal category alone
@@ -86,12 +86,12 @@
     };
   }
 
-  template <class UnaryFunc, class Iterator, class Reference, class Value>
+  template <class UnaryFunction, class Iterator, class Reference, class Value>
   class transform_iterator
-    : public detail::transform_iterator_base<UnaryFunc, Iterator, Reference, Value>::type
+    : public detail::transform_iterator_base<UnaryFunction, Iterator, Reference, Value>::type
   {
     typedef typename
-    detail::transform_iterator_base<UnaryFunc, Iterator, Reference, Value>::type
+    detail::transform_iterator_base<UnaryFunction, Iterator, Reference, Value>::type
     super_t;
 
     friend class iterator_core_access;
@@ -99,7 +99,7 @@
   public:
     transform_iterator() { }
 
-    transform_iterator(Iterator const& x, UnaryFunc f)
+    transform_iterator(Iterator const& x, UnaryFunction f)
       : super_t(x), m_f(f) { }
 
     explicit transform_iterator(Iterator const& x)
@@ -108,9 +108,9 @@
         // Pro8 is a little too aggressive about instantiating the
         // body of this function.
 #if !BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003))
-        // don't provide this constructor if UnaryFunc is a
+        // don't provide this constructor if UnaryFunction is a
         // function pointer type, since it will be 0.  Too dangerous.
-        BOOST_STATIC_ASSERT(is_class<UnaryFunc>::value);
+        BOOST_STATIC_ASSERT(is_class<UnaryFunction>::value);
 #endif 
     }
 
@@ -123,13 +123,13 @@
          transform_iterator<OtherUnaryFunction, OtherIterator, OtherReference, OtherValue> const& t
        , typename enable_if_convertible<OtherIterator, Iterator>::type* = 0
 #if !BOOST_WORKAROUND(BOOST_MSVC, == 1310)
-       , typename enable_if_convertible<OtherUnaryFunction, UnaryFunc>::type* = 0
+       , typename enable_if_convertible<OtherUnaryFunction, UnaryFunction>::type* = 0
 #endif 
     )
       : super_t(t.base()), m_f(t.functor())
    {}
 
-    UnaryFunc functor() const
+    UnaryFunction functor() const
       { return m_f; }
 
   private:
@@ -138,38 +138,38 @@
 
     // Probably should be the initial base class so it can be
     // optimized away via EBO if it is an empty class.
-    UnaryFunc m_f;
+    UnaryFunction m_f;
   };
 
-  template <class UnaryFunc, class Iterator>
-  transform_iterator<UnaryFunc, Iterator>
-  make_transform_iterator(Iterator it, UnaryFunc fun)
+  template <class UnaryFunction, class Iterator>
+  transform_iterator<UnaryFunction, Iterator>
+  make_transform_iterator(Iterator it, UnaryFunction fun)
   {
-      return transform_iterator<UnaryFunc, Iterator>(it, fun);
+      return transform_iterator<UnaryFunction, Iterator>(it, fun);
   }
 
-  // Version which allows explicit specification of the UnaryFunc
+  // Version which allows explicit specification of the UnaryFunction
   // type.
   //
-  // This generator is not provided if UnaryFunc is a function
+  // This generator is not provided if UnaryFunction is a function
   // pointer type, because it's too dangerous: the default-constructed
   // function pointer in the iterator be 0, leading to a runtime
   // crash.
-  template <class UnaryFunc, class Iterator>
+  template <class UnaryFunction, class Iterator>
 #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
   typename mpl::if_<
 #else 
   typename iterators::enable_if<
 #endif 
-      is_class<UnaryFunc>   // We should probably find a cheaper test than is_class<>
-    , transform_iterator<UnaryFunc, Iterator>
+      is_class<UnaryFunction>   // We should probably find a cheaper test than is_class<>
+    , transform_iterator<UnaryFunction, Iterator>
 #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
     , int[3]
 #endif 
   >::type
   make_transform_iterator(Iterator it)
   {
-      return transform_iterator<UnaryFunc, Iterator>(it, UnaryFunc());
+      return transform_iterator<UnaryFunction, Iterator>(it, UnaryFunction());
   }
 
 #if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION ) && !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)

Modified: boost/trunk/boost/iterator/zip_iterator.hpp
===================================================================
--- boost/trunk/boost/iterator/zip_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/iterator/zip_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,22 +1,7 @@
-// (C) Copyright David Abrahams and Thomas Becker 2000. Permission to
-// copy, use, modify, sell and distribute this software is granted
-// provided this copyright notice appears in all copies. This software
-// is provided "as is" without express or implied warranty, and with
-// no claim as to its suitability for any purpose.
-//
-// Compilers Tested:
-// =================
-// Metrowerks Codewarrior Pro 7.2, 8.3
-// gcc 2.95.3
-// gcc 3.2
-// Microsoft VC 6sp5 (test fails due to some compiler bug)
-// Microsoft VC 7 (works)
-// Microsoft VC 7.1
-// Intel 5
-// Intel 6
-// Intel 7.1
-// Intel 8
-// Borland 5.5.1 (broken due to lack of support from Boost.Tuples)
+// Copyright David Abrahams and Thomas Becker 2000-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)
 
 #ifndef BOOST_ZIP_ITERATOR_TMB_07_13_2003_HPP_
 # define BOOST_ZIP_ITERATOR_TMB_07_13_2003_HPP_

Modified: boost/trunk/boost/lambda/detail/operator_return_type_traits.hpp
===================================================================
--- boost/trunk/boost/lambda/detail/operator_return_type_traits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/lambda/detail/operator_return_type_traits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -859,7 +859,7 @@
 
 
 // Forward declarations are incompatible with the libstdc++ debug mode.
-#if BOOST_WORKAROUND(__GNUC__, >= 3) && _GLIBCXX_DEBUG
+#if BOOST_WORKAROUND(__GNUC__, >= 3) && defined(_GLIBCXX_DEBUG)
 #include <string>
 #include <vector>
 #include <map>

Modified: boost/trunk/boost/lexical_cast.hpp
===================================================================
--- boost/trunk/boost/lexical_cast.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/lexical_cast.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,7 +21,6 @@
 #include <boost/limits.hpp>
 #include <boost/throw_exception.hpp>
 #include <boost/type_traits/is_pointer.hpp>
-#include <boost/call_traits.hpp>
 
 #ifdef BOOST_NO_STRINGSTREAM
 #include <strstream>
@@ -210,25 +209,19 @@
         {
             typedef const T * type;
         };
-
-        template<typename Target, typename Source>
-        Target lexical_cast(
-            BOOST_DEDUCED_TYPENAME boost::call_traits<Source>::value_type arg)
-        {
-            detail::lexical_stream<Target, Source> interpreter;
-            Target result;
-
-            if(!(interpreter << arg && interpreter >> result))
-                throw_exception(bad_lexical_cast(typeid(Source), typeid(Target)));
-            return result;
-        }
     }
 
     template<typename Target, typename Source>
-    inline Target lexical_cast(const Source &arg)
+    Target lexical_cast(const Source &arg)
     {
         typedef typename detail::array_to_pointer_decay<Source>::type NewSource;
-        return detail::lexical_cast<Target, NewSource>(arg);
+
+        detail::lexical_stream<Target, NewSource> interpreter;
+        Target result;
+
+        if(!(interpreter << arg && interpreter >> result))
+            throw_exception(bad_lexical_cast(typeid(NewSource), typeid(Target)));
+        return result;
     }
 
     #else

Modified: boost/trunk/boost/math/complex/acos.hpp
===================================================================
--- boost/trunk/boost/math/complex/acos.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/math/complex/acos.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,6 @@
 //  (C) Copyright John Maddock 2005.
-//  Use, modification and distribution are subject to the
-//  Boost Software License, Version 1.0. (See accompanying file
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_MATH_COMPLEX_ACOS_INCLUDED
 #define BOOST_MATH_COMPLEX_ACOS_INCLUDED
@@ -104,7 +103,7 @@
       // Figure out if our input is within the "safe area" identified by Hull et al.
       // This would be more efficient with portable floating point exception handling;
       // fortunately the quantities M and u identified by Hull et al (figure 3), 
-      // match with the max() and min() methods of numeric_limits<T>.
+      // match with the max and min methods of numeric_limits<T>.
       //
       T safe_max = detail::safe_max(static_cast<T>(8));
       T safe_min = detail::safe_min(static_cast<T>(4));
@@ -189,8 +188,8 @@
             // 
             // E^2 > 8*sqrt(u); with:
             //
-            // E = std::numeric_limits<T>::epsilon()
-            // u = std::numeric_limits<T>::min()
+            // E =  std::numeric_limits<T>::epsilon()
+            // u = (std::numeric_limits<T>::min)()
             //
             // Hull et al provide alternative code for "bad" machines
             // but we have no way to test that here, so for now just assert

Modified: boost/trunk/boost/math/complex/asin.hpp
===================================================================
--- boost/trunk/boost/math/complex/asin.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/math/complex/asin.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,6 @@
 //  (C) Copyright John Maddock 2005.
-//  Use, modification and distribution are subject to the
-//  Boost Software License, Version 1.0. (See accompanying file
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_MATH_COMPLEX_ASIN_INCLUDED
 #define BOOST_MATH_COMPLEX_ASIN_INCLUDED
@@ -114,7 +113,7 @@
       // Figure out if our input is within the "safe area" identified by Hull et al.
       // This would be more efficient with portable floating point exception handling;
       // fortunately the quantities M and u identified by Hull et al (figure 3), 
-      // match with the max() and min() methods of numeric_limits<T>.
+      // match with the max and min methods of numeric_limits<T>.
       //
       T safe_max = detail::safe_max(static_cast<T>(8));
       T safe_min = detail::safe_min(static_cast<T>(4));
@@ -199,8 +198,8 @@
             // 
             // E^2 > 8*sqrt(u); with:
             //
-            // E = std::numeric_limits<T>::epsilon()
-            // u = std::numeric_limits<T>::min()
+            // E =  std::numeric_limits<T>::epsilon()
+            // u = (std::numeric_limits<T>::min)()
             //
             // Hull et al provide alternative code for "bad" machines
             // but we have no way to test that here, so for now just assert

Modified: boost/trunk/boost/math/complex/details.hpp
===================================================================
--- boost/trunk/boost/math/complex/details.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/math/complex/details.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,6 +10,7 @@
 // inverse trig complex functions, it also contains all the includes
 // that we need to implement all these functions.
 //
+#include <boost/detail/workaround.hpp>
 #include <boost/config.hpp>
 #include <boost/config/no_tr1/complex.hpp>
 #include <boost/limits.hpp>
@@ -100,3 +101,4 @@
 } } } // namespaces
 
 #endif // BOOST_MATH_COMPLEX_DETAILS_INCLUDED
+

Modified: boost/trunk/boost/mpl/assert.hpp
===================================================================
--- boost/trunk/boost/mpl/assert.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/mpl/assert.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
 #ifndef BOOST_MPL_ASSERT_HPP_INCLUDED
 #define BOOST_MPL_ASSERT_HPP_INCLUDED
 
-// Copyright Aleksey Gurtovoy 2000-2004
+// Copyright Aleksey Gurtovoy 2000-2006
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -11,8 +11,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/boost/mpl/assert.hpp,v $
-// $Date: 2004/09/28 13:56:58 $
-// $Revision: 1.13 $
+// $Date: 2006/11/10 21:31:19 $
+// $Revision: 1.13.14.6 $
 
 #include <boost/mpl/not.hpp>
 #include <boost/mpl/aux_/value_wknd.hpp>
@@ -25,12 +25,18 @@
 #include <boost/mpl/aux_/config/dtp.hpp>
 #include <boost/mpl/aux_/config/gcc.hpp>
 #include <boost/mpl/aux_/config/msvc.hpp>
+#include <boost/mpl/aux_/config/static_constant.hpp>
 #include <boost/mpl/aux_/config/workaround.hpp>
 
 #include <boost/preprocessor/cat.hpp>
 
+#include <boost/config.hpp> // make sure 'size_t' is placed into 'std'
+#include <cstddef>
+
+
 #if BOOST_WORKAROUND(__BORLANDC__, >= 0x560) && BOOST_WORKAROUND(__BORLANDC__, < 0x600) \
-    || (BOOST_MPL_CFG_GCC != 0)
+    || (BOOST_MPL_CFG_GCC != 0) \
+    || BOOST_WORKAROUND(__IBMCPP__, <= 600)
 #   define BOOST_MPL_CFG_ASSERT_USE_RELATION_NAMES
 #endif
 
@@ -41,14 +47,24 @@
 #   define BOOST_MPL_CFG_ASSERT_BROKEN_POINTER_TO_POINTER_TO_MEMBER
 #endif
 
+// agurt, 10/nov/06: use enums for Borland (which cannot cope with static constants) 
+// and GCC (which issues "unused variable" warnings when static constants are used 
+// at a function scope)
+#if BOOST_WORKAROUND(__BORLANDC__, < 0x600) \
+    || (BOOST_MPL_CFG_GCC != 0)
+#   define BOOST_MPL_AUX_ASSERT_CONSTANT(T, expr) enum { expr }
+#else
+#   define BOOST_MPL_AUX_ASSERT_CONSTANT(T, expr) BOOST_STATIC_CONSTANT(T, expr)
+#endif
 
+
 BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN
 
 struct failed {};
 
 // agurt, 24/aug/04: MSVC 7.1 workaround here and below: return/accept 
 // 'assert<false>' by reference; can't apply it unconditionally -- apparently it
-// degrades quality of GCC diagnostics
+// degrades the quality of GCC diagnostics
 #if BOOST_WORKAROUND(BOOST_MSVC, == 1310)
 #   define AUX778076_ASSERT_ARG(x) x&
 #else
@@ -129,7 +145,7 @@
 template< typename P > struct assert_arg_pred_not
 {
     typedef typename P::type p_type;
-    enum { p = !p_type::value };
+    BOOST_MPL_AUX_ASSERT_CONSTANT( bool, p = !p_type::value );
     typedef typename assert_arg_pred_impl<p>::type type;
 };
 
@@ -198,13 +214,14 @@
 // BOOST_MPL_ASSERT((pred<x,...>))
 
 #define BOOST_MPL_ASSERT(pred) \
-enum { \
-    BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
+BOOST_MPL_AUX_ASSERT_CONSTANT( \
+      std::size_t \
+    , BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
           boost::mpl::assertion_failed<false>( \
               boost::mpl::assert_arg( (void (*) pred)0, 1 ) \
             ) \
         ) \
-}\
+    ) \
 /**/
 
 // BOOST_MPL_ASSERT_NOT((pred<x,...>))
@@ -221,13 +238,14 @@
 /**/
 #else
 #   define BOOST_MPL_ASSERT_NOT(pred) \
-enum { \
-    BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
+BOOST_MPL_AUX_ASSERT_CONSTANT( \
+      std::size_t \
+    , BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
           boost::mpl::assertion_failed<false>( \
               boost::mpl::assert_not_arg( (void (*) pred)0, 1 ) \
             ) \
         ) \
-}\
+   ) \
 /**/
 #endif
 
@@ -236,10 +254,13 @@
 #if defined(BOOST_MPL_CFG_ASSERT_USE_RELATION_NAMES)
 
 #   if !defined(BOOST_MPL_CFG_ASSERT_BROKEN_POINTER_TO_POINTER_TO_MEMBER)
+// agurt, 9/nov/06: 'enum' below is a workaround for gcc 4.0.4/4.1.1 bugs #29522 and #29518
 #   define BOOST_MPL_ASSERT_RELATION(x, rel, y) \
-enum { \
-      BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
-        boost::mpl::assertion_failed<(x rel y)>( \
+enum { BOOST_PP_CAT(mpl_assert_rel_value,__LINE__) = (x rel y) }; \
+BOOST_MPL_AUX_ASSERT_CONSTANT( \
+      std::size_t \
+    , BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
+        boost::mpl::assertion_failed<BOOST_PP_CAT(mpl_assert_rel_value,__LINE__)>( \
             (boost::mpl::failed ************ ( boost::mpl::assert_relation< \
                   boost::mpl::assert_::relations( sizeof( \
                       boost::mpl::assert_::arg rel boost::mpl::assert_::arg \
@@ -248,13 +269,19 @@
                 , y \
                 >::************)) 0 ) \
         ) \
-} \
+    ) \
 /**/
 #   else
 #   define BOOST_MPL_ASSERT_RELATION(x, rel, y) \
-enum { \
-      BOOST_PP_CAT(mpl_assert_rel,__LINE__) = sizeof(boost::mpl::assert_::arg rel boost::mpl::assert_::arg) \
-    , BOOST_PP_CAT(mpl_assert_rel_value,__LINE__) = (x rel y) \
+BOOST_MPL_AUX_ASSERT_CONSTANT( \
+      std::size_t \
+    , BOOST_PP_CAT(mpl_assert_rel,__LINE__) = sizeof( \
+          boost::mpl::assert_::arg rel boost::mpl::assert_::arg \
+        ) \
+    ); \
+BOOST_MPL_AUX_ASSERT_CONSTANT( bool, BOOST_PP_CAT(mpl_assert_rel_value,__LINE__) = (x rel y) ); \
+BOOST_MPL_AUX_ASSERT_CONSTANT( \
+      std::size_t \
     , BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
         boost::mpl::assertion_failed<BOOST_PP_CAT(mpl_assert_rel_value,__LINE__)>( \
               boost::mpl::assert_rel_arg( boost::mpl::assert_relation< \
@@ -264,7 +291,7 @@
                 >() ) \
             ) \
         ) \
-} \
+    ) \
 /**/
 #   endif
 
@@ -272,22 +299,24 @@
 
 #   if defined(BOOST_MPL_CFG_ASSERT_BROKEN_POINTER_TO_POINTER_TO_MEMBER)
 #   define BOOST_MPL_ASSERT_RELATION(x, rel, y) \
-enum { \
-    BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
+BOOST_MPL_AUX_ASSERT_CONSTANT( \
+      std::size_t \
+    , BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
         boost::mpl::assertion_failed<(x rel y)>( boost::mpl::assert_rel_arg( \
               boost::mpl::BOOST_MPL_AUX_ASSERT_RELATION(x,y,(&boost::mpl::operator rel))() \
             ) ) \
         ) \
-}\
+    ) \
 /**/
 #   else
 #   define BOOST_MPL_ASSERT_RELATION(x, rel, y) \
-enum { \
-    BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
+BOOST_MPL_AUX_ASSERT_CONSTANT( \
+      std::size_t \
+    , BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
         boost::mpl::assertion_failed<(x rel y)>( (boost::mpl::failed ************ ( \
             boost::mpl::BOOST_MPL_AUX_ASSERT_RELATION(x,y,(&boost::mpl::operator rel))::************))0 ) \
         ) \
-}\
+    ) \
 /**/
 #   endif
 
@@ -298,32 +327,34 @@
 
 #if BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3202))
 #   define BOOST_MPL_ASSERT_MSG( c, msg, types_ ) \
-    struct msg; \
-    typedef struct BOOST_PP_CAT(msg,__LINE__) : boost::mpl::assert_ \
-    { \
-        using boost::mpl::assert_::types; \
-        static boost::mpl::failed ************ (msg::************ assert_arg()) types_ \
-        { return 0; } \
-    } BOOST_PP_CAT(mpl_assert_arg,__LINE__); \
-    enum { \
-        BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
-            boost::mpl::assertion<(c)>::failed( BOOST_PP_CAT(mpl_assert_arg,__LINE__)::assert_arg() ) \
-            ) \
-    }\
+struct msg; \
+typedef struct BOOST_PP_CAT(msg,__LINE__) : boost::mpl::assert_ \
+{ \
+    using boost::mpl::assert_::types; \
+    static boost::mpl::failed ************ (msg::************ assert_arg()) types_ \
+    { return 0; } \
+} BOOST_PP_CAT(mpl_assert_arg,__LINE__); \
+BOOST_MPL_AUX_ASSERT_CONSTANT( \
+      std::size_t \
+    , BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
+        boost::mpl::assertion<(c)>::failed( BOOST_PP_CAT(mpl_assert_arg,__LINE__)::assert_arg() ) \
+        ) \
+    ) \
 /**/
 #else
 #   define BOOST_MPL_ASSERT_MSG( c, msg, types_ ) \
-    struct msg; \
-    typedef struct BOOST_PP_CAT(msg,__LINE__) : boost::mpl::assert_ \
-    { \
-        static boost::mpl::failed ************ (msg::************ assert_arg()) types_ \
-        { return 0; } \
-    } BOOST_PP_CAT(mpl_assert_arg,__LINE__); \
-    enum { \
-        BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
-            boost::mpl::assertion_failed<(c)>( BOOST_PP_CAT(mpl_assert_arg,__LINE__)::assert_arg() ) \
-            ) \
-    }\
+struct msg; \
+typedef struct BOOST_PP_CAT(msg,__LINE__) : boost::mpl::assert_ \
+{ \
+    static boost::mpl::failed ************ (msg::************ assert_arg()) types_ \
+    { return 0; } \
+} BOOST_PP_CAT(mpl_assert_arg,__LINE__); \
+BOOST_MPL_AUX_ASSERT_CONSTANT( \
+      std::size_t \
+    , BOOST_PP_CAT(mpl_assertion_in_line_,__LINE__) = sizeof( \
+        boost::mpl::assertion_failed<(c)>( BOOST_PP_CAT(mpl_assert_arg,__LINE__)::assert_arg() ) \
+        ) \
+    ) \
 /**/
 #endif
 

Modified: boost/trunk/boost/mpl/aux_/begin_end_impl.hpp
===================================================================
--- boost/trunk/boost/mpl/aux_/begin_end_impl.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/mpl/aux_/begin_end_impl.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,8 +11,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/boost/mpl/aux_/begin_end_impl.hpp,v $
-// $Date: 2006/05/16 13:35:43 $
-// $Revision: 1.9 $
+// $Date: 2006/07/22 15:08:37 $
+// $Revision: 1.8.14.1 $
 
 #include <boost/mpl/begin_end_fwd.hpp>
 #include <boost/mpl/sequence_tag_fwd.hpp>
@@ -25,7 +25,6 @@
 
 namespace boost { namespace mpl {
 
-
 namespace aux { 
 
 template< typename Sequence > 

Modified: boost/trunk/boost/mpl/aux_/include_preprocessed.hpp
===================================================================
--- boost/trunk/boost/mpl/aux_/include_preprocessed.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/mpl/aux_/include_preprocessed.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 
 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION
 
-// Copyright Aleksey Gurtovoy 2000-2004
+// Copyright Aleksey Gurtovoy 2000-2006
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -10,25 +10,33 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/boost/mpl/aux_/include_preprocessed.hpp,v $
-// $Date: 2004/09/02 15:40:43 $
-// $Revision: 1.5 $
+// $Date: 2006/11/09 00:46:57 $
+// $Revision: 1.5.14.1 $
 
 #include <boost/mpl/aux_/config/compiler.hpp>
 #include <boost/mpl/aux_/config/preprocessor.hpp>
+#include <boost/mpl/aux_/config/workaround.hpp>
 #include <boost/preprocessor/cat.hpp>
 #include <boost/preprocessor/stringize.hpp>
 
 #if !defined(BOOST_NEEDS_TOKEN_PASTING_OP_FOR_TOKENS_JUXTAPOSING)
-#   define AUX_PREPROCESSED_HEADER \
+#   define AUX778076_PREPROCESSED_HEADER \
     BOOST_MPL_CFG_COMPILER_DIR/BOOST_MPL_PREPROCESSED_HEADER \
 /**/
 #else
-#   define AUX_PREPROCESSED_HEADER \
+#   define AUX778076_PREPROCESSED_HEADER \
     BOOST_PP_CAT(BOOST_MPL_CFG_COMPILER_DIR,/)##BOOST_MPL_PREPROCESSED_HEADER \
 /**/
 #endif
 
-#   include BOOST_PP_STRINGIZE(boost/mpl/aux_/preprocessed/AUX_PREPROCESSED_HEADER)
-#   undef AUX_PREPROCESSED_HEADER
+#if BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(700))
+#   define AUX778076_INCLUDE_STRING BOOST_PP_STRINGIZE(boost/mpl/aux_/preprocessed/AUX778076_PREPROCESSED_HEADER)
+#   include AUX778076_INCLUDE_STRING
+#   undef AUX778076_INCLUDE_STRING
+#else
+#   include BOOST_PP_STRINGIZE(boost/mpl/aux_/preprocessed/AUX778076_PREPROCESSED_HEADER)
+#endif
 
+#   undef AUX778076_PREPROCESSED_HEADER
+
 #undef BOOST_MPL_PREPROCESSED_HEADER

Modified: boost/trunk/boost/mpl/aux_/integral_wrapper.hpp
===================================================================
--- boost/trunk/boost/mpl/aux_/integral_wrapper.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/mpl/aux_/integral_wrapper.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2000-2004
+// Copyright Aleksey Gurtovoy 2000-2006
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/boost/mpl/aux_/integral_wrapper.hpp,v $
-// $Date: 2004/09/02 15:40:43 $
-// $Revision: 1.10 $
+// $Date: 2006/11/08 21:44:30 $
+// $Revision: 1.10.14.1 $
 
 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION!
 
@@ -65,7 +65,7 @@
     typedef AUX_WRAPPER_INST(prior_value) prior;
 #elif BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x561)) \
     || BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(502)) \
-    || BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(53800))
+    || BOOST_WORKAROUND(__HP_aCC, <= 53800)
     typedef AUX_WRAPPER_INST( BOOST_MPL_AUX_STATIC_CAST(AUX_WRAPPER_VALUE_TYPE, (N + 1)) ) next;
     typedef AUX_WRAPPER_INST( BOOST_MPL_AUX_STATIC_CAST(AUX_WRAPPER_VALUE_TYPE, (N - 1)) ) prior;
 #else

Modified: boost/trunk/boost/mpl/aux_/lambda_spec.hpp
===================================================================
--- boost/trunk/boost/mpl/aux_/lambda_spec.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/mpl/aux_/lambda_spec.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
 #ifndef BOOST_MPL_AUX_LAMBDA_SPEC_HPP_INCLUDED
 #define BOOST_MPL_AUX_LAMBDA_SPEC_HPP_INCLUDED
 
-// Copyright Aleksey Gurtovoy 2001-2004
+// Copyright Aleksey Gurtovoy 2001-2007
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -11,8 +11,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/boost/mpl/aux_/lambda_spec.hpp,v $
-// $Date: 2004/09/02 15:40:43 $
-// $Revision: 1.8 $
+// $Date: 2007/01/29 07:28:45 $
+// $Revision: 1.8.14.1 $
 
 #include <boost/mpl/void.hpp>
 #include <boost/mpl/lambda_fwd.hpp>
@@ -35,7 +35,8 @@
     > \
 { \
     typedef false_ is_le; \
-    typedef name< BOOST_MPL_PP_PARAMS(i, T) > type; \
+    typedef name< BOOST_MPL_PP_PARAMS(i, T) > result_; \
+    typedef result_ type; \
 }; \
 /**/
 

Modified: boost/trunk/boost/mpl/has_xxx.hpp
===================================================================
--- boost/trunk/boost/mpl/has_xxx.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/mpl/has_xxx.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
 #ifndef BOOST_MPL_HAS_XXX_HPP_INCLUDED
 #define BOOST_MPL_HAS_XXX_HPP_INCLUDED
 
-// Copyright Aleksey Gurtovoy 2002-2004
+// Copyright Aleksey Gurtovoy 2002-2006
 // Copyright David Abrahams 2002-2003
 //
 // Distributed under the Boost Software License, Version 1.0. 
@@ -12,8 +12,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/boost/mpl/has_xxx.hpp,v $
-// $Date: 2005/06/15 10:43:23 $
-// $Revision: 1.4 $
+// $Date: 2006/11/09 01:05:31 $
+// $Revision: 1.4.6.1 $
 
 #include <boost/mpl/bool.hpp>
 #include <boost/mpl/aux_/type_wrapper.hpp>
@@ -144,9 +144,10 @@
 // SFINAE-based implementations below are derived from a USENET newsgroup's 
 // posting by Rani Sharoni (comp.lang.c++.moderated, 2002-03-17 07:45:09 PST)
 
-#   elif BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1400))
+#   elif BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1400)) \
+      || BOOST_WORKAROUND(__IBMCPP__, <= 700)
 
-// MSVC 7.1+
+// MSVC 7.1+ & VACPP
 
 // agurt, 15/jun/05: replace overload-based SFINAE implementation with SFINAE
 // applied to partial specialization to fix some apparently random failures 

Modified: boost/trunk/boost/mpl/integral_c.hpp
===================================================================
--- boost/trunk/boost/mpl/integral_c.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/mpl/integral_c.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
 #ifndef BOOST_MPL_INTEGRAL_C_HPP_INCLUDED
 #define BOOST_MPL_INTEGRAL_C_HPP_INCLUDED
 
-// Copyright Aleksey Gurtovoy 2000-2004
+// Copyright Aleksey Gurtovoy 2000-2006
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -11,15 +11,15 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/boost/mpl/integral_c.hpp,v $
-// $Date: 2005/07/19 04:03:12 $
-// $Revision: 1.22 $
+// $Date: 2006/11/08 21:44:27 $
+// $Revision: 1.22.6.1 $
 
 #include <boost/mpl/integral_c_fwd.hpp>
 #include <boost/mpl/aux_/config/ctps.hpp>
 #include <boost/mpl/aux_/config/static_constant.hpp>
 #include <boost/mpl/aux_/config/workaround.hpp>
 
-#if BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(53800))
+#if BOOST_WORKAROUND(__HP_aCC, <= 53800)
 // the type of non-type template arguments may not depend on template arguments
 #   define AUX_WRAPPER_PARAMS(N) typename T, long N
 #else

Modified: boost/trunk/boost/mpl/integral_c_fwd.hpp
===================================================================
--- boost/trunk/boost/mpl/integral_c_fwd.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/mpl/integral_c_fwd.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
 #ifndef BOOST_MPL_INTEGRAL_C_FWD_HPP_INCLUDED
 #define BOOST_MPL_INTEGRAL_C_FWD_HPP_INCLUDED
 
-// Copyright Aleksey Gurtovoy 2000-2004
+// Copyright Aleksey Gurtovoy 2000-2006
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -11,15 +11,15 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/boost/mpl/integral_c_fwd.hpp,v $
-// $Date: 2004/09/28 13:56:58 $
-// $Revision: 1.4 $
+// $Date: 2006/11/08 21:44:27 $
+// $Revision: 1.4.14.1 $
 
 #include <boost/mpl/aux_/config/workaround.hpp>
 #include <boost/mpl/aux_/adl_barrier.hpp>
 
 BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN
 
-#if BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(53800))
+#if BOOST_WORKAROUND(__HP_aCC, <= 53800)
 // the type of non-type template arguments may not depend on template arguments
 template< typename T, long N > struct integral_c;
 #else

Modified: boost/trunk/boost/mpl/list/aux_/include_preprocessed.hpp
===================================================================
--- boost/trunk/boost/mpl/list/aux_/include_preprocessed.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/mpl/list/aux_/include_preprocessed.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2001-2004
+// Copyright Aleksey Gurtovoy 2001-2006
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,11 +8,13 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/boost/mpl/list/aux_/include_preprocessed.hpp,v $
-// $Date: 2004/11/28 01:48:53 $
-// $Revision: 1.4 $
+// $Date: 2006/11/09 01:39:54 $
+// $Revision: 1.4.8.1 $
 
 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION!
 
+#include <boost/mpl/aux_/config/workaround.hpp>
+
 #include <boost/preprocessor/cat.hpp>
 #include <boost/preprocessor/stringize.hpp>
 
@@ -20,7 +22,13 @@
     aux_/preprocessed/plain/BOOST_MPL_PREPROCESSED_HEADER \
 /**/
 
+#if BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(700))
+#   define AUX778076_INCLUDE_STRING BOOST_PP_STRINGIZE(boost/mpl/list/AUX778076_HEADER)
+#   include AUX778076_INCLUDE_STRING
+#   undef AUX778076_INCLUDE_STRING
+#else
 #   include BOOST_PP_STRINGIZE(boost/mpl/list/AUX778076_HEADER)
+#endif
 
 #   undef AUX778076_HEADER
 

Modified: boost/trunk/boost/mpl/map/aux_/include_preprocessed.hpp
===================================================================
--- boost/trunk/boost/mpl/map/aux_/include_preprocessed.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/mpl/map/aux_/include_preprocessed.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,14 +8,15 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/boost/mpl/map/aux_/include_preprocessed.hpp,v $
-// $Date: 2004/09/05 09:42:58 $
-// $Revision: 1.3 $
+// $Date: 2006/11/09 01:41:51 $
+// $Revision: 1.3.14.1 $
 
 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION!
 
 #include <boost/mpl/aux_/config/typeof.hpp>
 #include <boost/mpl/aux_/config/ctps.hpp>
 #include <boost/mpl/aux_/config/preprocessor.hpp>
+#include <boost/mpl/aux_/config/workaround.hpp>
 
 #include <boost/preprocessor/cat.hpp>
 #include <boost/preprocessor/stringize.hpp>
@@ -38,8 +39,13 @@
 /**/
 #endif
 
-
+#if BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(700))
+#   define AUX778076_INCLUDE_STRING BOOST_PP_STRINGIZE(boost/mpl/map/aux_/preprocessed/AUX778076_HEADER)
+#   include AUX778076_INCLUDE_STRING
+#   undef AUX778076_INCLUDE_STRING
+#else
 #   include BOOST_PP_STRINGIZE(boost/mpl/map/aux_/preprocessed/AUX778076_HEADER)
+#endif
 
 #   undef AUX778076_HEADER
 #   undef AUX778076_INCLUDE_DIR

Modified: boost/trunk/boost/mpl/print.hpp
===================================================================
--- boost/trunk/boost/mpl/print.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/mpl/print.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -12,8 +12,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/boost/mpl/print.hpp,v $
-// $Date: 2004/09/02 15:40:42 $
-// $Revision: 1.2 $
+// $Date: 2006/11/10 23:15:49 $
+// $Revision: 1.2.14.1 $
 
 #include <boost/mpl/aux_/config/msvc.hpp>
 #include <boost/mpl/identity.hpp>
@@ -57,7 +57,7 @@
 # if defined(__EDG_VERSION__)
            aux::dependent_unsigned<T>::value > -1
 # else 
-           sizeof(T) > -1, 
+           sizeof(T) > -1
 # endif 
         };
 #endif 

Modified: boost/trunk/boost/mpl/quote.hpp
===================================================================
--- boost/trunk/boost/mpl/quote.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/mpl/quote.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,8 +15,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/boost/mpl/quote.hpp,v $
-// $Date: 2006/05/03 03:21:36 $
-// $Revision: 1.7 $
+// $Date: 2006/05/03 03:27:58 $
+// $Revision: 1.5.14.2 $
 
 #if !defined(BOOST_MPL_PREPROCESSING_MODE)
 #   include <boost/mpl/void.hpp>

Modified: boost/trunk/boost/mpl/set/aux_/include_preprocessed.hpp
===================================================================
--- boost/trunk/boost/mpl/set/aux_/include_preprocessed.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/mpl/set/aux_/include_preprocessed.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 
 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION
 
-// Copyright Aleksey Gurtovoy 2001-2004
+// Copyright Aleksey Gurtovoy 2001-2006
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -10,10 +10,11 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/boost/mpl/set/aux_/include_preprocessed.hpp,v $
-// $Date: 2004/09/02 15:41:02 $
-// $Revision: 1.2 $
+// $Date: 2006/11/09 01:44:00 $
+// $Revision: 1.2.14.1 $
 
 #include <boost/mpl/aux_/config/preprocessor.hpp>
+#include <boost/mpl/aux_/config/workaround.hpp>
 
 #include <boost/preprocessor/cat.hpp>
 #include <boost/preprocessor/stringize.hpp>
@@ -28,8 +29,13 @@
 /**/
 #endif
 
-
+#if BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(700))
+#   define AUX778076_INCLUDE_STRING BOOST_PP_STRINGIZE(boost/mpl/set/aux_/preprocessed/AUX778076_HEADER)
+#   include AUX778076_INCLUDE_STRING
+#   undef AUX778076_INCLUDE_STRING
+#else
 #   include BOOST_PP_STRINGIZE(boost/mpl/set/aux_/preprocessed/AUX778076_HEADER)
+#endif
 
 #   undef AUX778076_HEADER
 

Modified: boost/trunk/boost/mpl/vector/aux_/include_preprocessed.hpp
===================================================================
--- boost/trunk/boost/mpl/vector/aux_/include_preprocessed.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/mpl/vector/aux_/include_preprocessed.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 
 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION
 
-// Copyright Aleksey Gurtovoy 2000-2004
+// Copyright Aleksey Gurtovoy 2000-2006
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -10,12 +10,13 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/boost/mpl/vector/aux_/include_preprocessed.hpp,v $
-// $Date: 2004/11/28 01:52:12 $
-// $Revision: 1.4 $
+// $Date: 2006/11/09 01:21:03 $
+// $Revision: 1.4.8.1 $
 
 #include <boost/mpl/aux_/config/typeof.hpp>
 #include <boost/mpl/aux_/config/ctps.hpp>
 #include <boost/mpl/aux_/config/preprocessor.hpp>
+#include <boost/mpl/aux_/config/workaround.hpp>
 
 #include <boost/preprocessor/cat.hpp>
 #include <boost/preprocessor/stringize.hpp>
@@ -40,7 +41,13 @@
 #endif
 
 
+#if BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(700))
+#   define AUX778076_INCLUDE_STRING BOOST_PP_STRINGIZE(boost/mpl/vector/aux_/preprocessed/AUX778076_HEADER)
+#   include AUX778076_INCLUDE_STRING
+#   undef AUX778076_INCLUDE_STRING
+#else
 #   include BOOST_PP_STRINGIZE(boost/mpl/vector/aux_/preprocessed/AUX778076_HEADER)
+#endif
 
 #   undef AUX778076_HEADER
 #   undef AUX778076_INCLUDE_DIR

Modified: boost/trunk/boost/multi_array/index_range.hpp
===================================================================
--- boost/trunk/boost/multi_array/index_range.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/multi_array/index_range.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -35,6 +35,15 @@
     typedef Index index;
     typedef SizeType size_type;
 
+  private:
+    static index from_start()
+      { return (std::numeric_limits<index>::min)(); }
+
+    static index to_end()
+      { return (std::numeric_limits<index>::max)(); }
+
+  public:
+
     index_range()
     {
       start_ = from_start();
@@ -132,12 +141,6 @@
 
     // add conversion to std::slice?
 
-  private:
-    static index from_start()
-      { return (std::numeric_limits<index>::min)(); }
-
-    static index to_end()
-      { return (std::numeric_limits<index>::max)(); }
   public:
     index start_, finish_, stride_;
     bool degenerate_;

Modified: boost/trunk/boost/multi_array.hpp
===================================================================
--- boost/trunk/boost/multi_array.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/multi_array.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -389,7 +389,8 @@
     gen_type ranges;
 
     for (int i=0; i != NumDims; ++i) {
-      ranges.ranges_[i] = typename gen_type::range(0,extents[i]);
+      typedef typename gen_type::range range_type;
+      ranges.ranges_[i] = range_type(0,extents[i]);
     }
     
     return this->resize(ranges);

Modified: boost/trunk/boost/multi_index/detail/access_specifier.hpp
===================================================================
--- boost/trunk/boost/multi_index/detail/access_specifier.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/multi_index/detail/access_specifier.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,4 @@
-/* Copyright 2003-2005 Joaquín M López Muñoz.
+/* Copyright 2003-2006 Joaquín M López Muñoz.
  * Distributed under the Boost Software License, Version 1.0.
  * (See accompanying file LICENSE_1_0.txt or copy at
  * http://www.boost.org/LICENSE_1_0.txt)
@@ -34,12 +34,19 @@
  * MSVC 7.1/8.0 seem to have a similar problem, though the conditions in
  * which the error happens are not that simple. I have yet to isolate this
  * into a snippet suitable for bug reporting.
+ * Sun Studio also has this problem, which might be related, from the
+ * information gathered at Sun forums, with a known issue notified at the
+ * internal bug report 6421933. The bug is present up to Studio Express 2,
+ * the latest preview version of the future Sun Studio 12. As of this writing
+ * (October 2006) it is not known whether a fix will finally make it into the
+ * official Sun Studio 12.
  */
 
 #if BOOST_WORKAROUND(__GNUC__, <3)||\
     BOOST_WORKAROUND(__GNUC__,==3)&&(__GNUC_MINOR__<4)||\
     BOOST_WORKAROUND(BOOST_MSVC,==1310)||\
-    BOOST_WORKAROUND(BOOST_MSVC,==1400)
+    BOOST_WORKAROUND(BOOST_MSVC,==1400)||\
+    BOOST_WORKAROUND(__SUNPRO_CC,BOOST_TESTED_AT(0x590))
 #define BOOST_MULTI_INDEX_PRIVATE_IF_USING_DECL_FOR_TEMPL_FUNCTIONS public
 #else
 #define BOOST_MULTI_INDEX_PRIVATE_IF_USING_DECL_FOR_TEMPL_FUNCTIONS private

Modified: boost/trunk/boost/multi_index/detail/seq_index_ops.hpp
===================================================================
--- boost/trunk/boost/multi_index/detail/seq_index_ops.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/multi_index/detail/seq_index_ops.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,4 @@
-/* Copyright 2003-2005 Joaquín M López Muñoz.
+/* Copyright 2003-2006 Joaquín M López Muñoz.
  * Distributed under the Boost Software License, Version 1.0.
  * (See accompanying file LICENSE_1_0.txt or copy at
  * http://www.boost.org/LICENSE_1_0.txt)
@@ -60,7 +60,7 @@
 void sequenced_index_merge(SequencedIndex& x,SequencedIndex& y,Compare comp)
 {
   typedef typename SequencedIndex::iterator iterator;
-  if(x!=y){
+  if(&x!=&y){
     iterator first0=x.begin(),last0=x.end();
     iterator first1=y.begin(),last1=y.end();
     while(first0!=last0&&first1!=last1){

Modified: boost/trunk/boost/multi_index/hashed_index.hpp
===================================================================
--- boost/trunk/boost/multi_index/hashed_index.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/multi_index/hashed_index.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -274,13 +274,17 @@
     hashed_index_node_impl* y=x->next();
     while(y!=x){
       if(eq(k,key(node_type::from_impl(y)->value()))){
+        bool b;
         do{
           hashed_index_node_impl* z=y->next();
+          b=z!=x&&eq(
+            key(node_type::from_impl(y)->value()),
+            key(node_type::from_impl(z)->value()));
           this->final_erase_(
             static_cast<final_node_type*>(node_type::from_impl(y)));
           y=z;
           ++s;
-        }while(y!=x&&eq(k,key(node_type::from_impl(y)->value())));
+        }while(b);
         break;
       }
       y=y->next();

Modified: boost/trunk/boost/multi_index/random_access_index.hpp
===================================================================
--- boost/trunk/boost/multi_index/random_access_index.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/multi_index/random_access_index.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,6 +21,7 @@
 #include <boost/iterator/reverse_iterator.hpp>
 #include <boost/mpl/push_front.hpp>
 #include <boost/multi_index/detail/access_specifier.hpp>
+#include <boost/multi_index/detail/index_node_base.hpp>
 #include <boost/multi_index/detail/rnd_node_iterator.hpp>
 #include <boost/multi_index/detail/rnd_index_node.hpp>
 #include <boost/multi_index/detail/rnd_index_ops.hpp>
@@ -407,7 +408,7 @@
     BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(i);
     BOOST_MULTI_INDEX_CHECK_IS_OWNER(i,x);
     BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    if(x==*this)relocate(position,i);
+    if(&x==this)relocate(position,i);
     else{
       if(insert(position,*i).second){
 
@@ -438,7 +439,7 @@
     BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,x);
     BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last);
     BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    if(x==*this)relocate(position,first,last);
+    if(&x==this)relocate(position,first,last);
     else{
       size_type n=0;
       BOOST_TRY{
@@ -500,7 +501,7 @@
 
   void merge(random_access_index<SuperMeta,TagList>& x)
   {
-    if(*this!=x){
+    if(this!=&x){
       BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
       size_type s=size();
       splice(end(),x);
@@ -512,7 +513,7 @@
   template <typename Compare>
   void merge(random_access_index<SuperMeta,TagList>& x,Compare comp)
   {
-    if(*this!=x){
+    if(this!=&x){
       BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
       size_type s=size();
       splice(end(),x);

Modified: boost/trunk/boost/multi_index/sequenced_index.hpp
===================================================================
--- boost/trunk/boost/multi_index/sequenced_index.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/multi_index/sequenced_index.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,6 +21,7 @@
 #include <boost/mpl/push_front.hpp>
 #include <boost/multi_index/detail/access_specifier.hpp>
 #include <boost/multi_index/detail/bidir_node_iterator.hpp>
+#include <boost/multi_index/detail/index_node_base.hpp>
 #include <boost/multi_index/detail/safe_ctr_proxy.hpp>
 #include <boost/multi_index/detail/safe_mode.hpp>
 #include <boost/multi_index/detail/scope_guard.hpp>
@@ -354,7 +355,7 @@
     BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(i);
     BOOST_MULTI_INDEX_CHECK_IS_OWNER(i,x);
     BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT;
-    if(x==*this){
+    if(&x==this){
       if(position!=i)relink(position.get_node(),i.get_node());
     }
     else{
@@ -387,7 +388,7 @@
     BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,x);
     BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last);
     BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT;
-    if(x==*this){
+    if(&x==this){
       BOOST_MULTI_INDEX_CHECK_OUTSIDE_RANGE(position,first,last);
       if(position!=last)relink(
         position.get_node(),first.get_node(),last.get_node());

Modified: boost/trunk/boost/none.hpp
===================================================================
--- boost/trunk/boost/none.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/none.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,10 @@
 // Copyright (C) 2003, Fernando Luis Cacciola Carballal.
 //
-// Use, modification, and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 //
-// See http://www.boost.org/lib/optional for documentation.
+// See http://www.boost.org/lib/optional/ for documentation.
 //
 // You are welcome to contact the author at:
 //  fernando_cacciola at hotmail.com
@@ -16,15 +16,12 @@
 
 // NOTE: Borland users have to include this header outside any precompiled headers
 // (bcc<=5.64 cannot include instance data in a precompiled header)
+//  -- * To be verified, now that there's no unnamed namespace
 
 namespace boost {
 
-namespace {
-
 none_t const none = ((none_t)0) ;
 
-}
-
 } // namespace boost
 
 #endif

Modified: boost/trunk/boost/numeric/interval/arith2.hpp
===================================================================
--- boost/trunk/boost/numeric/interval/arith2.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/numeric/interval/arith2.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -176,8 +176,8 @@
   typename Policies::rounding rnd;
   
   if (interval_lib::user::is_neg(x.upper())) {        // [-2,-1]
-    T yl = pow_dn(-x.upper(), pwr, rnd);
-    T yu = pow_up(-x.lower(), pwr, rnd);
+    T yl = pow_dn(static_cast<T>(-x.upper()), pwr, rnd);
+    T yu = pow_up(static_cast<T>(-x.lower()), pwr, rnd);
     if (pwr & 1)     // [-2,-1]^1
       return I(-yu, -yl, true);
     else             // [-2,-1]^2
@@ -186,7 +186,7 @@
     if (pwr & 1) {   // [-1,1]^1
       return I(-pow_up(-x.lower(), pwr, rnd), pow_up(x.upper(), pwr, rnd), true);
     } else {         // [-1,1]^2
-      return I(static_cast<T>(0), pow_up(max BOOST_PREVENT_MACRO_SUBSTITUTION(-x.lower(), x.upper()), pwr, rnd), true);
+      return I(static_cast<T>(0), pow_up(max BOOST_PREVENT_MACRO_SUBSTITUTION(static_cast<T>(-x.lower()), x.upper()), pwr, rnd), true);
     }
   } else {                                // [1,2]
     return I(pow_dn(x.lower(), pwr, rnd), pow_up(x.upper(), pwr, rnd), true);

Modified: boost/trunk/boost/numeric/interval/detail/alpha_rounding_control.hpp
===================================================================
--- boost/trunk/boost/numeric/interval/detail/alpha_rounding_control.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/numeric/interval/detail/alpha_rounding_control.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,6 +16,8 @@
 
 #if defined(__GNUC__) || defined(__digital__) || defined(__DECCXX)
 
+#include <float.h> // write_rnd() and read_rnd()
+
 namespace boost {
 namespace numeric {
 namespace interval_lib {
@@ -55,7 +57,6 @@
 #error Dynamic rounding mode not enabled. See cxx man page for details.
 #endif
 
-#   include <float.h> // write_rnd() and read_rnd()
 
     struct alpha_rounding_control
     {

Copied: boost/trunk/boost/numeric/interval/detail/ia64_rounding_control.hpp (from rev 14034, boost/branches/upstream/current/boost/numeric/interval/detail/ia64_rounding_control.hpp)

Modified: boost/trunk/boost/numeric/interval/hw_rounding.hpp
===================================================================
--- boost/trunk/boost/numeric/interval/hw_rounding.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/numeric/interval/hw_rounding.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -25,6 +25,8 @@
 #  include <boost/numeric/interval/detail/sparc_rounding_control.hpp>
 #elif defined(alpha) || defined(__alpha__)
 #  include <boost/numeric/interval/detail/alpha_rounding_control.hpp>
+#elif defined(ia64) || defined(__ia64) || defined(__ia64__)
+#  include <boost/numeric/interval/detail/ia64_rounding_control.hpp>
 #endif
 
 #if defined(BOOST_NUMERIC_INTERVAL_NO_HARDWARE) && (defined(__USE_ISOC99) || defined(__MSL__))

Modified: boost/trunk/boost/numeric/interval/utility.hpp
===================================================================
--- boost/trunk/boost/numeric/interval/utility.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/numeric/interval/utility.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -254,7 +254,7 @@
     return checking::nan();
   }
   BOOST_USING_STD_MAX();
-  return max BOOST_PREVENT_MACRO_SUBSTITUTION(-x.lower(), x.upper());
+  return max BOOST_PREVENT_MACRO_SUBSTITUTION(static_cast<T>(-x.lower()), x.upper());
 }
 
 template<class T, class Policies> inline
@@ -266,7 +266,7 @@
   if (!interval_lib::user::is_neg(x.lower())) return x;
   if (!interval_lib::user::is_pos(x.upper())) return -x;
   BOOST_USING_STD_MAX();
-  return I(static_cast<T>(0), max BOOST_PREVENT_MACRO_SUBSTITUTION(-x.lower(), x.upper()), true);
+  return I(static_cast<T>(0), max BOOST_PREVENT_MACRO_SUBSTITUTION(static_cast<T>(-x.lower()), x.upper()), true);
 }
 
 template<class T, class Policies> inline

Modified: boost/trunk/boost/numeric/ublas/detail/config.hpp
===================================================================
--- boost/trunk/boost/numeric/ublas/detail/config.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/numeric/ublas/detail/config.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -38,7 +38,7 @@
 
 // Version 6.0 and 7.0
 #if BOOST_MSVC <= 1300
-#define BOOST_UBLAS_UNSUPPORTED_COMPILER
+#define BOOST_UBLAS_UNSUPPORTED_COMPILER 1
 #endif
 
 // Version 7.1
@@ -63,7 +63,7 @@
 #endif
 
 #if __GNUC__ < 3
-#define BOOST_UBLAS_UNSUPPORTED_COMPILER
+#define BOOST_UBLAS_UNSUPPORTED_COMPILER 1
 #endif
 
 #endif
@@ -78,7 +78,7 @@
 #endif
 
 #if (BOOST_INTEL < 700)
-#define BOOST_UBLAS_UNSUPPORTED_COMPILER
+#define BOOST_UBLAS_UNSUPPORTED_COMPILER 1
 #endif
 
 // Define swap for index_pair and triple.
@@ -156,7 +156,7 @@
 
 // 8.x
 #if __MWERKS__ <= 0x3003
-#define BOOST_UBLAS_UNSUPPORTED_COMPILER
+#define BOOST_UBLAS_UNSUPPORTED_COMPILER 1
 #endif
 
 #endif
@@ -165,7 +165,7 @@
 // Detect other compilers with serious defects - override by defineing BOOST_UBLAS_UNSUPPORTED_COMPILER=0
 #ifndef BOOST_UBLAS_UNSUPPORTED_COMPILER
 #if defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) || defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) || defined(BOOST_NO_SFINAE) || defined(BOOST_NO_STDC_NAMESPACE)
-#define BOOST_UBLAS_UNSUPPORTED_COMPILER
+#define BOOST_UBLAS_UNSUPPORTED_COMPILER 1
 #endif
 #endif
 

Modified: boost/trunk/boost/numeric/ublas/detail/iterator.hpp
===================================================================
--- boost/trunk/boost/numeric/ublas/detail/iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/numeric/ublas/detail/iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -203,7 +203,7 @@
    * is LessThan Comparable.
    */
     template<class IC, class I, class T, class D = std::ptrdiff_t>
-    // ISSUE the default for D seems rather dangerous as it can easily be (silently) incorrect
+    // ISSUE the default here seems rather dangerous as it can easlly be (silently) incorrect
     struct random_access_iterator_base:
         public std::iterator<IC, T> {
         typedef I derived_iterator_type;
@@ -878,7 +878,7 @@
         public random_access_iterator_base<IC,
                                            indexed_iterator1<C, IC>, 
                                            typename C::value_type,
-                                           typename C::difference_type> {
+                                           typename C::reference> {
     public:
         typedef C container_type;
         typedef IC iterator_category;
@@ -1024,7 +1024,7 @@
         public random_access_iterator_base<IC,
                                            indexed_const_iterator1<C, IC>, 
                                            typename C::value_type,
-                                           typename C::difference_type> {
+                                           typename C::const_reference> {
     public:
         typedef C container_type;
         typedef IC iterator_category;
@@ -1169,7 +1169,7 @@
         public random_access_iterator_base<IC,
                                            indexed_iterator2<C, IC>, 
                                            typename C::value_type,
-                                           typename C::difference_type> {
+                                           typename C::reference> {
     public:
         typedef C container_type;
         typedef IC iterator_category;
@@ -1312,7 +1312,7 @@
         public random_access_iterator_base<IC,
                                            indexed_const_iterator2<C, IC>,
                                            typename C::value_type,
-                                           typename C::difference_type> {
+                                           typename C::const_reference> {
     public:
         typedef C container_type;
         typedef IC iterator_category;

Modified: boost/trunk/boost/numeric/ublas/functional.hpp
===================================================================
--- boost/trunk/boost/numeric/ublas/functional.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/numeric/ublas/functional.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1370,8 +1370,8 @@
         }
     };
 
-    // This functor defines storage layout and it's properties
-    // matrix (i,j) -> storage [i * size_i + j]
+    // This functor computes the address translation
+    // matrix [i] [j] -> storage [i * size2 + j]
     template <class Z, class D>
     struct basic_row_major {
         typedef Z size_type;
@@ -1380,175 +1380,185 @@
 
         static
         BOOST_UBLAS_INLINE
-        size_type storage_size (size_type size_i, size_type size_j) {
+        size_type storage_size (size_type size1, size_type size2) {
             // Guard against size_type overflow
-            BOOST_UBLAS_CHECK (size_j == 0 || size_i <= (std::numeric_limits<size_type>::max) () / size_j, bad_size ());
-            return size_i * size_j;
+            BOOST_UBLAS_CHECK (size2 == 0 || size1 <= (std::numeric_limits<size_type>::max) () / size2, bad_size ());
+            return size1 * size2;
         }
 
-        // Indexing conversion to storage element
+        // Indexing
         static
         BOOST_UBLAS_INLINE
-        size_type element (size_type i, size_type size_i, size_type j, size_type size_j) {
-            BOOST_UBLAS_CHECK (i < size_i, bad_index ());
-            BOOST_UBLAS_CHECK (j < size_j, bad_index ());
-            detail::ignore_unused_variable_warning(size_i);
+        size_type element (size_type i, size_type size1, size_type j, size_type size2) {
+            BOOST_UBLAS_CHECK (i < size1, bad_index ());
+            BOOST_UBLAS_CHECK (j < size2, bad_index ());
+            detail::ignore_unused_variable_warning(size1);
             // Guard against size_type overflow
-            BOOST_UBLAS_CHECK (i <= ((std::numeric_limits<size_type>::max) () - j) / size_j, bad_index ());
-            return i * size_j + j;
+            BOOST_UBLAS_CHECK (i <= ((std::numeric_limits<size_type>::max) () - j) / size2, bad_index ());
+            return i * size2 + j;
         }
         static
         BOOST_UBLAS_INLINE
-        size_type address (size_type i, size_type size_i, size_type j, size_type size_j) {
-            BOOST_UBLAS_CHECK (i <= size_i, bad_index ());
-            BOOST_UBLAS_CHECK (j <= size_j, bad_index ());
-            // Guard against size_type overflow - address may be size_j past end of storage
-            BOOST_UBLAS_CHECK (size_j == 0 || i <= ((std::numeric_limits<size_type>::max) () - j) / size_j, bad_index ());
-            detail::ignore_unused_variable_warning(size_i);
-            return i * size_j + j;
+        size_type address (size_type i, size_type size1, size_type j, size_type size2) {
+            BOOST_UBLAS_CHECK (i <= size1, bad_index ());
+            BOOST_UBLAS_CHECK (j <= size2, bad_index ());
+            // Guard against size_type overflow - address may be size2 past end of storage
+            BOOST_UBLAS_CHECK (size2 == 0 || i <= ((std::numeric_limits<size_type>::max) () - j) / size2, bad_index ());
+            detail::ignore_unused_variable_warning(size1);
+            return i * size2 + j;
         }
-
-        // Storage element to index conversion
         static
         BOOST_UBLAS_INLINE
-        difference_type distance_i (difference_type k, size_type /* size_i */, size_type size_j) {
-            return size_j != 0 ? k / size_j : 0;
+        difference_type distance1 (difference_type k, size_type /* size1 */, size_type size2) {
+            return size2 != 0 ? k / size2 : 0;
         }
         static
         BOOST_UBLAS_INLINE
-        difference_type distance_j (difference_type k, size_type /* size_i */, size_type /* size_j */) {
+        difference_type distance2 (difference_type k, size_type /* size1 */, size_type /* size2 */) {
             return k;
         }
         static
         BOOST_UBLAS_INLINE
-        size_type index_i (difference_type k, size_type /* size_i */, size_type size_j) {
-            return size_j != 0 ? k / size_j : 0;
+        size_type index1 (difference_type k, size_type /* size1 */, size_type size2) {
+            return size2 != 0 ? k / size2 : 0;
         }
         static
         BOOST_UBLAS_INLINE
-        size_type index_j (difference_type k, size_type /* size_i */, size_type size_j) {
-            return size_j != 0 ? k % size_j : 0;
+        size_type index2 (difference_type k, size_type /* size1 */, size_type size2) {
+            return size2 != 0 ? k % size2 : 0;
         }
         static
         BOOST_UBLAS_INLINE
-        bool fast_i () {
+        bool fast1 () {
             return false;
         }
         static
         BOOST_UBLAS_INLINE
-        bool fast_j () {
+        size_type one1 (size_type /* size1 */, size_type size2) {
+            return size2;
+        }
+        static
+        BOOST_UBLAS_INLINE
+        bool fast2 () {
             return true;
         }
+        static
+        BOOST_UBLAS_INLINE
+        size_type one2 (size_type /* size1 */, size_type /* size2 */) {
+            return 1;
+        }
 
-        // Iterating storage elements
-        template<class I>
         static
         BOOST_UBLAS_INLINE
-        void increment_i (I &it, size_type /* size_i */, size_type size_j) {
-            it += size_j;
+        size_type triangular_size (size_type size1, size_type size2) {
+            size_type size = (std::max) (size1, size2);
+            // Guard against size_type overflow - simplified
+            BOOST_UBLAS_CHECK (size == 0 || size / 2 < (std::numeric_limits<size_type>::max) () / size /* +1/2 */, bad_size ());
+            return ((size + 1) * size) / 2;
         }
-        template<class I>
         static
         BOOST_UBLAS_INLINE
-        void increment_i (I &it, difference_type n, size_type /* size_i */, size_type size_j) {
-            it += n * size_j;
+        size_type lower_element (size_type i, size_type size1, size_type j, size_type size2) {
+            BOOST_UBLAS_CHECK (i < size1, bad_index ());
+            BOOST_UBLAS_CHECK (j < size2, bad_index ());
+            BOOST_UBLAS_CHECK (i >= j, bad_index ());
+            detail::ignore_unused_variable_warning(size1);
+            detail::ignore_unused_variable_warning(size2);
+            // FIXME size_type overflow
+            // sigma_i (i + 1) = (i + 1) * i / 2
+            // i = 0 1 2 3, sigma = 0 1 3 6
+            return ((i + 1) * i) / 2 + j;
         }
-        template<class I>
         static
         BOOST_UBLAS_INLINE
-        void decrement_i (I &it, size_type /* size_i */, size_type size_j) {
-            it -= size_j;
+        size_type upper_element (size_type i, size_type size1, size_type j, size_type size2) {
+            BOOST_UBLAS_CHECK (i < size1, bad_index ());
+            BOOST_UBLAS_CHECK (j < size2, bad_index ());
+            BOOST_UBLAS_CHECK (i <= j, bad_index ());
+            // FIXME size_type overflow
+            // sigma_i (size - i) = size * i - i * (i - 1) / 2
+            // i = 0 1 2 3, sigma = 0 4 7 9
+            return (i * (2 * (std::max) (size1, size2) - i + 1)) / 2 + j - i;
         }
-        template<class I>
+
         static
         BOOST_UBLAS_INLINE
-        void decrement_i (I &it, difference_type n, size_type /* size_i */, size_type size_j) {
-            it -= n * size_j;
+        size_type element1 (size_type i, size_type size1, size_type /* j */, size_type /* size2 */) {
+            BOOST_UBLAS_CHECK (i < size1, bad_index ());
+            detail::ignore_unused_variable_warning(size1);
+            return i;
         }
-        template<class I>
         static
         BOOST_UBLAS_INLINE
-        void increment_j (I &it, size_type /* size_i */, size_type /* size_j */) {
-            ++ it;
+        size_type element2 (size_type /* i */, size_type /* size1 */, size_type j, size_type size2) {
+            BOOST_UBLAS_CHECK (j < size2, bad_index ());
+            detail::ignore_unused_variable_warning(size2);
+            return j;
         }
-        template<class I>
         static
         BOOST_UBLAS_INLINE
-        void increment_j (I &it, difference_type n, size_type /* size_i */, size_type /* size_j */) {
-            it += n;
+        size_type address1 (size_type i, size_type size1, size_type /* j */, size_type /* size2 */) {
+            BOOST_UBLAS_CHECK (i <= size1, bad_index ());
+            detail::ignore_unused_variable_warning(size1);
+            return i;
         }
-        template<class I>
         static
         BOOST_UBLAS_INLINE
-        void decrement_j (I &it, size_type /* size_i */, size_type /* size_j */) {
-            -- it;
+        size_type address2 (size_type /* i */, size_type /* size1 */, size_type j, size_type size2) {
+            BOOST_UBLAS_CHECK (j <= size2, bad_index ());
+            detail::ignore_unused_variable_warning(size2);
+            return j;
         }
-        template<class I>
         static
         BOOST_UBLAS_INLINE
-        void decrement_j (I &it, difference_type n, size_type /* size_i */, size_type /* size_j */) {
-            it -= n;
+        size_type index1 (size_type index1, size_type /* index2 */) {
+            return index1;
         }
-
-		// Triangular access
         static
         BOOST_UBLAS_INLINE
-        size_type triangular_size (size_type size_i, size_type size_j) {
-            size_type size = (std::max) (size_i, size_j);
-            // Guard against size_type overflow - simplified
-            BOOST_UBLAS_CHECK (size == 0 || size / 2 < (std::numeric_limits<size_type>::max) () / size /* +1/2 */, bad_size ());
-            return ((size + 1) * size) / 2;
+        size_type index2 (size_type /* index1 */, size_type index2) {
+            return index2;
         }
         static
         BOOST_UBLAS_INLINE
-        size_type lower_element (size_type i, size_type size_i, size_type j, size_type size_j) {
-            BOOST_UBLAS_CHECK (i < size_i, bad_index ());
-            BOOST_UBLAS_CHECK (j < size_j, bad_index ());
-            BOOST_UBLAS_CHECK (i >= j, bad_index ());
-            detail::ignore_unused_variable_warning(size_i);
-            detail::ignore_unused_variable_warning(size_j);
-            // FIXME size_type overflow
-            // sigma_i (i + 1) = (i + 1) * i / 2
-            // i = 0 1 2 3, sigma = 0 1 3 6
-            return ((i + 1) * i) / 2 + j;
+        size_type size1 (size_type size1, size_type /* size2 */) {
+            return size1;
         }
         static
         BOOST_UBLAS_INLINE
-        size_type upper_element (size_type i, size_type size_i, size_type j, size_type size_j) {
-            BOOST_UBLAS_CHECK (i < size_i, bad_index ());
-            BOOST_UBLAS_CHECK (j < size_j, bad_index ());
-            BOOST_UBLAS_CHECK (i <= j, bad_index ());
-            // FIXME size_type overflow
-            // sigma_i (size - i) = size * i - i * (i - 1) / 2
-            // i = 0 1 2 3, sigma = 0 4 7 9
-            return (i * (2 * (std::max) (size_i, size_j) - i + 1)) / 2 + j - i;
+        size_type size2 (size_type /* size1 */, size_type size2) {
+            return size2;
         }
 
-        // Major and minor indices
+        // Iterating
+        template<class I>
         static
         BOOST_UBLAS_INLINE
-        size_type index_M (size_type index1, size_type /* index2 */) {
-            return index1;
+        void increment1 (I &it, size_type /* size1 */, size_type size2) {
+            it += size2;
         }
+        template<class I>
         static
         BOOST_UBLAS_INLINE
-        size_type index_m (size_type /* index1 */, size_type index2) {
-            return index2;
+        void decrement1 (I &it, size_type /* size1 */, size_type size2) {
+            it -= size2;
         }
+        template<class I>
         static
         BOOST_UBLAS_INLINE
-        size_type size_M (size_type size_i, size_type /* size_j */) {
-            return size_i;
+        void increment2 (I &it, size_type /* size1 */, size_type /* size2 */) {
+            ++ it;
         }
+        template<class I>
         static
         BOOST_UBLAS_INLINE
-        size_type size_m (size_type /* size_i */, size_type size_j) {
-            return size_j;
+        void decrement2 (I &it, size_type /* size1 */, size_type /* size2 */) {
+            -- it;
         }
     };
 
-    // This functor defines storage layout and it's properties
-    // matrix (i,j) -> storage [i + j * size_i]
+    // This functor computes the address translation
+    // matrix [i] [j] -> storage [i + j * size1]
     template <class Z, class D>
     struct basic_column_major {
         typedef Z size_type;
@@ -1557,168 +1567,178 @@
 
         static
         BOOST_UBLAS_INLINE
-        size_type storage_size (size_type size_i, size_type size_j) {
+        size_type storage_size (size_type size1, size_type size2) {
             // Guard against size_type overflow
-            BOOST_UBLAS_CHECK (size_i == 0 || size_j <= (std::numeric_limits<size_type>::max) () / size_i, bad_size ());
-            return size_i * size_j;
+            BOOST_UBLAS_CHECK (size1 == 0 || size2 <= (std::numeric_limits<size_type>::max) () / size1, bad_size ());
+            return size1 * size2;
         }
 
-        // Indexing conversion to storage element
+        // Indexing
         static
         BOOST_UBLAS_INLINE
-        size_type element (size_type i, size_type size_i, size_type j, size_type size_j) {
-            BOOST_UBLAS_CHECK (i < size_i, bad_index ());
-            BOOST_UBLAS_CHECK (j < size_j, bad_index ());
-            detail::ignore_unused_variable_warning(size_j);
+        size_type element (size_type i, size_type size1, size_type j, size_type size2) {
+            BOOST_UBLAS_CHECK (i < size1, bad_index ());
+            BOOST_UBLAS_CHECK (j < size2, bad_index ());
+            detail::ignore_unused_variable_warning(size2);
             // Guard against size_type overflow
-            BOOST_UBLAS_CHECK (j <= ((std::numeric_limits<size_type>::max) () - i) / size_i, bad_index ());
-            return i + j * size_i;
+            BOOST_UBLAS_CHECK (j <= ((std::numeric_limits<size_type>::max) () - i) / size1, bad_index ());
+            return i + j * size1;
         }
         static
         BOOST_UBLAS_INLINE
-        size_type address (size_type i, size_type size_i, size_type j, size_type size_j) {
-            BOOST_UBLAS_CHECK (i <= size_i, bad_index ());
-            BOOST_UBLAS_CHECK (j <= size_j, bad_index ());
-            detail::ignore_unused_variable_warning(size_j);
-            // Guard against size_type overflow - address may be size_i past end of storage
-            BOOST_UBLAS_CHECK (size_i == 0 || j <= ((std::numeric_limits<size_type>::max) () - i) / size_i, bad_index ());
-            return i + j * size_i;
+        size_type address (size_type i, size_type size1, size_type j, size_type size2) {
+            BOOST_UBLAS_CHECK (i <= size1, bad_index ());
+            BOOST_UBLAS_CHECK (j <= size2, bad_index ());
+            detail::ignore_unused_variable_warning(size2);
+            // Guard against size_type overflow - address may be size1 past end of storage
+            BOOST_UBLAS_CHECK (size1 == 0 || j <= ((std::numeric_limits<size_type>::max) () - i) / size1, bad_index ());
+            return i + j * size1;
         }
-
-        // Storage element to index conversion
         static
         BOOST_UBLAS_INLINE
-        difference_type distance_i (difference_type k, size_type /* size_i */, size_type /* size_j */) {
+        difference_type distance1 (difference_type k, size_type /* size1 */, size_type /* size2 */) {
             return k;
         }
         static
         BOOST_UBLAS_INLINE
-        difference_type distance_j (difference_type k, size_type size_i, size_type /* size_j */) {
-            return size_i != 0 ? k / size_i : 0;
+        difference_type distance2 (difference_type k, size_type size1, size_type /* size2 */) {
+            return size1 != 0 ? k / size1 : 0;
         }
         static
         BOOST_UBLAS_INLINE
-        size_type index_i (difference_type k, size_type size_i, size_type /* size_j */) {
-            return size_i != 0 ? k % size_i : 0;
+        size_type index1 (difference_type k, size_type size1, size_type /* size2 */) {
+            return size1 != 0 ? k % size1 : 0;
         }
         static
         BOOST_UBLAS_INLINE
-        size_type index_j (difference_type k, size_type size_i, size_type /* size_j */) {
-            return size_i != 0 ? k / size_i : 0;
+        size_type index2 (difference_type k, size_type size1, size_type /* size2 */) {
+            return size1 != 0 ? k / size1 : 0;
         }
         static
         BOOST_UBLAS_INLINE
-        bool fast_i () {
+        bool fast1 () {
             return true;
         }
         static
         BOOST_UBLAS_INLINE
-        bool fast_j () {
+        size_type one1 (size_type /* size1 */, size_type /* size2 */) {
+            return 1;
+        }
+        static
+        BOOST_UBLAS_INLINE
+        bool fast2 () {
             return false;
         }
+        static
+        BOOST_UBLAS_INLINE
+        size_type one2 (size_type size1, size_type /* size2 */) {
+            return size1;
+        }
 
-        // Iterating
-        template<class I>
         static
         BOOST_UBLAS_INLINE
-        void increment_i (I &it, size_type /* size_i */, size_type /* size_j */) {
-            ++ it;
+        size_type triangular_size (size_type size1, size_type size2) {
+            size_type size = (std::max) (size1, size2);
+            // Guard against size_type overflow - simplified
+            BOOST_UBLAS_CHECK (size == 0 || size / 2 < (std::numeric_limits<size_type>::max) () / size /* +1/2 */, bad_size ());
+            return ((size + 1) * size) / 2;
         }
-        template<class I>
         static
         BOOST_UBLAS_INLINE
-        void increment_i (I &it, difference_type n, size_type /* size_i */, size_type /* size_j */) {
-            it += n;
+        size_type lower_element (size_type i, size_type size1, size_type j, size_type size2) {
+            BOOST_UBLAS_CHECK (i < size1, bad_index ());
+            BOOST_UBLAS_CHECK (j < size2, bad_index ());
+            BOOST_UBLAS_CHECK (i >= j, bad_index ());
+            // FIXME size_type overflow
+            // sigma_j (size - j) = size * j - j * (j - 1) / 2
+            // j = 0 1 2 3, sigma = 0 4 7 9
+            return i - j + (j * (2 * (std::max) (size1, size2) - j + 1)) / 2;
         }
-        template<class I>
         static
         BOOST_UBLAS_INLINE
-        void decrement_i (I &it, size_type /* size_i */, size_type /* size_j */) {
-            -- it;
+        size_type upper_element (size_type i, size_type size1, size_type j, size_type size2) {
+            BOOST_UBLAS_CHECK (i < size1, bad_index ());
+            BOOST_UBLAS_CHECK (j < size2, bad_index ());
+            BOOST_UBLAS_CHECK (i <= j, bad_index ());
+            // FIXME size_type overflow
+            // sigma_j (j + 1) = (j + 1) * j / 2
+            // j = 0 1 2 3, sigma = 0 1 3 6
+            return i + ((j + 1) * j) / 2;
         }
-        template<class I>
+
         static
         BOOST_UBLAS_INLINE
-        void decrement_i (I &it, difference_type n, size_type /* size_i */, size_type /* size_j */) {
-            it -= n;
+        size_type element1 (size_type /* i */, size_type /* size1 */, size_type j, size_type size2) {
+            BOOST_UBLAS_CHECK (j < size2, bad_index ());
+            detail::ignore_unused_variable_warning(size2);
+            return j;
         }
-        template<class I>
         static
         BOOST_UBLAS_INLINE
-        void increment_j (I &it, size_type size_i, size_type /* size_j */) {
-            it += size_i;
+        size_type element2 (size_type i, size_type size1, size_type /* j */, size_type /* size2 */) {
+            BOOST_UBLAS_CHECK (i < size1, bad_index ());
+            detail::ignore_unused_variable_warning(size1);
+            return i;
         }
-        template<class I>
         static
         BOOST_UBLAS_INLINE
-        void increment_j (I &it, difference_type n, size_type size_i, size_type /* size_j */) {
-            it += n * size_i;
+        size_type address1 (size_type /* i */, size_type /* size1 */, size_type j, size_type size2) {
+            BOOST_UBLAS_CHECK (j <= size2, bad_index ());
+            detail::ignore_unused_variable_warning(size2);
+            return j;
         }
-        template<class I>
         static
         BOOST_UBLAS_INLINE
-        void decrement_j (I &it, size_type size_i, size_type /* size_j */) {
-            it -= size_i;
+        size_type address2 (size_type i, size_type size1, size_type /* j */, size_type /* size2 */) {
+            BOOST_UBLAS_CHECK (i <= size1, bad_index ());
+            detail::ignore_unused_variable_warning(size1);
+            return i;
         }
-        template<class I>
         static
         BOOST_UBLAS_INLINE
-        void decrement_j (I &it, difference_type n, size_type size_i, size_type /* size_j */) {
-            it -= n* size_i;
+        size_type index1 (size_type /* index1 */, size_type index2) {
+            return index2;
         }
-
-		// Triangular access
         static
         BOOST_UBLAS_INLINE
-        size_type triangular_size (size_type size_i, size_type size_j) {
-            size_type size = (std::max) (size_i, size_j);
-            // Guard against size_type overflow - simplified
-            BOOST_UBLAS_CHECK (size == 0 || size / 2 < (std::numeric_limits<size_type>::max) () / size /* +1/2 */, bad_size ());
-            return ((size + 1) * size) / 2;
+        size_type index2 (size_type index1, size_type /* index2 */) {
+            return index1;
         }
         static
         BOOST_UBLAS_INLINE
-        size_type lower_element (size_type i, size_type size_i, size_type j, size_type size_j) {
-            BOOST_UBLAS_CHECK (i < size_i, bad_index ());
-            BOOST_UBLAS_CHECK (j < size_j, bad_index ());
-            BOOST_UBLAS_CHECK (i >= j, bad_index ());
-            // FIXME size_type overflow
-            // sigma_j (size - j) = size * j - j * (j - 1) / 2
-            // j = 0 1 2 3, sigma = 0 4 7 9
-            return i - j + (j * (2 * (std::max) (size_i, size_j) - j + 1)) / 2;
+        size_type size1 (size_type /* size1 */, size_type size2) {
+            return size2;
         }
         static
         BOOST_UBLAS_INLINE
-        size_type upper_element (size_type i, size_type size_i, size_type j, size_type size_j) {
-            BOOST_UBLAS_CHECK (i < size_i, bad_index ());
-            BOOST_UBLAS_CHECK (j < size_j, bad_index ());
-            BOOST_UBLAS_CHECK (i <= j, bad_index ());
-            // FIXME size_type overflow
-            // sigma_j (j + 1) = (j + 1) * j / 2
-            // j = 0 1 2 3, sigma = 0 1 3 6
-            return i + ((j + 1) * j) / 2;
+        size_type size2 (size_type size1, size_type /* size2 */) {
+            return size1;
         }
 
-        // Major and minor indices
+        // Iterating
+        template<class I>
         static
         BOOST_UBLAS_INLINE
-        size_type index_M (size_type /* index1 */, size_type index2) {
-            return index2;
+        void increment1 (I &it, size_type /* size1 */, size_type /* size2 */) {
+            ++ it;
         }
+        template<class I>
         static
         BOOST_UBLAS_INLINE
-        size_type index_m (size_type index1, size_type /* index2 */) {
-            return index1;
+        void decrement1 (I &it, size_type /* size1 */, size_type /* size2 */) {
+            -- it;
         }
+        template<class I>
         static
         BOOST_UBLAS_INLINE
-        size_type size_M (size_type /* size_i */, size_type size_j) {
-            return size_j;
+        void increment2 (I &it, size_type size1, size_type /* size2 */) {
+            it += size1;
         }
+        template<class I>
         static
         BOOST_UBLAS_INLINE
-        size_type size_m (size_type size_i, size_type /* size_j */) {
-            return size_i;
+        void decrement2 (I &it, size_type size1, size_type /* size2 */) {
+            it -= size1;
         }
     };
 
@@ -1730,8 +1750,8 @@
         template<class L>
         static
         BOOST_UBLAS_INLINE
-        size_type packed_size (L, size_type size_i, size_type size_j) {
-            return L::storage_size (size_i, size_j);
+        size_type packed_size (size_type size1, size_type size2) {
+            return L::storage_size (size1, size2);
         }
 
         static
@@ -1749,26 +1769,6 @@
         bool other (size_type /* i */, size_type /* j */) {
             return true;
         }
-        static
-        BOOST_UBLAS_INLINE
-        size_type restrict1 (size_type i, size_type j) {
-            return i;
-        }
-        static
-        BOOST_UBLAS_INLINE
-        size_type restrict2 (size_type i, size_type j) {
-            return j;
-        }
-        static
-        BOOST_UBLAS_INLINE
-        size_type mutable_restrict1 (size_type i, size_type j) {
-            return i;
-        }
-        static
-        BOOST_UBLAS_INLINE
-        size_type mutable_restrict2 (size_type i, size_type j) {
-            return j;
-        }
     };
 
     template <class Z>
@@ -1778,8 +1778,8 @@
         template<class L>
         static
         BOOST_UBLAS_INLINE
-        size_type packed_size (L, size_type size_i, size_type size_j) {
-            return L::triangular_size (size_i, size_j);
+        size_type packed_size (L, size_type size1, size_type size2) {
+            return L::triangular_size (size1, size2);
         }
 
         static
@@ -1800,8 +1800,8 @@
         template<class L>
         static
         BOOST_UBLAS_INLINE
-        size_type element (L, size_type i, size_type size_i, size_type j, size_type size_j) {
-            return L::lower_element (i, size_i, j, size_j);
+        size_type element (L, size_type i, size_type size1, size_type j, size_type size2) {
+            return L::lower_element (i, size1, j, size2);
         }
 
         static
@@ -1832,8 +1832,8 @@
         template<class L>
         static
         BOOST_UBLAS_INLINE
-        size_type packed_size (L, size_type size_i, size_type size_j) {
-            return L::triangular_size (size_i, size_j);
+        size_type packed_size (L, size_type size1, size_type size2) {
+            return L::triangular_size (size1, size2);
         }
 
         static
@@ -1854,8 +1854,8 @@
         template<class L>
         static
         BOOST_UBLAS_INLINE
-        size_type element (L, size_type i, size_type size_i, size_type j, size_type size_j) {
-            return L::upper_element (i, size_i, j, size_j);
+        size_type element (L, size_type i, size_type size1, size_type j, size_type size2) {
+            return L::upper_element (i, size1, j, size2);
         }
 
         static
@@ -1886,10 +1886,10 @@
         template<class L>
         static
         BOOST_UBLAS_INLINE
-        size_type packed_size (L, size_type size_i, size_type size_j) {
+        size_type packed_size (L, size_type size1, size_type size2) {
             // Zero size strict triangles are bad at this point
-            BOOST_UBLAS_CHECK (size_i != 0 && size_j != 0, bad_index ());
-            return L::triangular_size (size_i - 1, size_j - 1);
+            BOOST_UBLAS_CHECK (size1 != 0 && size2 != 0, bad_index ());
+            return L::triangular_size (size1 - 1, size2 - 1);
         }
 
         static
@@ -1905,10 +1905,10 @@
         template<class L>
         static
         BOOST_UBLAS_INLINE
-        size_type element (L, size_type i, size_type size_i, size_type j, size_type size_j) {
+        size_type element (L, size_type i, size_type size1, size_type j, size_type size2) {
             // Zero size strict triangles are bad at this point
-            BOOST_UBLAS_CHECK (size_i != 0 && size_j != 0, bad_index ());
-            return L::lower_element (i, size_i - 1, j, size_j - 1);
+            BOOST_UBLAS_CHECK (size1 != 0 && size2 != 0, bad_index ());
+            return L::lower_element (i, size1 - 1, j, size2 - 1);
         }
 
         static
@@ -1929,10 +1929,10 @@
         template<class L>
         static
         BOOST_UBLAS_INLINE
-        size_type packed_size (L, size_type size_i, size_type size_j) {
+        size_type packed_size (L, size_type size1, size_type size2) {
             // Zero size strict triangles are bad at this point
-            BOOST_UBLAS_CHECK (size_i != 0 && size_j != 0, bad_index ());
-            return L::triangular_size (size_i - 1, size_j - 1);
+            BOOST_UBLAS_CHECK (size1 != 0 && size2 != 0, bad_index ());
+            return L::triangular_size (size1 - 1, size2 - 1);
         }
 
         static
@@ -1948,10 +1948,10 @@
         template<class L>
         static
         BOOST_UBLAS_INLINE
-        size_type element (L, size_type i, size_type size_i, size_type j, size_type size_j) {
+        size_type element (L, size_type i, size_type size1, size_type j, size_type size2) {
             // Zero size strict triangles are bad at this point
-            BOOST_UBLAS_CHECK (size_i != 0 && size_j != 0, bad_index ());
-            return L::upper_element (i, size_i - 1, j, size_j - 1);
+            BOOST_UBLAS_CHECK (size1 != 0 && size2 != 0, bad_index ());
+            return L::upper_element (i, size1 - 1, j, size2 - 1);
         }
 
         static
@@ -1972,10 +1972,10 @@
         template<class L>
         static
         BOOST_UBLAS_INLINE
-        size_type packed_size (L, size_type size_i, size_type size_j) {
+        size_type packed_size (L, size_type size1, size_type size2) {
             // Zero size strict triangles are bad at this point
-            BOOST_UBLAS_CHECK (size_i != 0 && size_j != 0, bad_index ());
-            return L::triangular_size (size_i - 1, size_j - 1);
+            BOOST_UBLAS_CHECK (size1 != 0 && size2 != 0, bad_index ());
+            return L::triangular_size (size1 - 1, size2 - 1);
         }
 
         static
@@ -1996,10 +1996,10 @@
         template<class L>
         static
         BOOST_UBLAS_INLINE
-        size_type element (L, size_type i, size_type size_i, size_type j, size_type size_j) {
+        size_type element (L, size_type i, size_type size1, size_type j, size_type size2) {
             // Zero size strict triangles are bad at this point
-            BOOST_UBLAS_CHECK (size_i != 0 && size_j != 0, bad_index ());
-            return L::lower_element (i, size_i - 1, j, size_j - 1);
+            BOOST_UBLAS_CHECK (size1 != 0 && size2 != 0, bad_index ());
+            return L::lower_element (i, size1 - 1, j, size2 - 1);
         }
 
         static
@@ -2030,10 +2030,10 @@
         template<class L>
         static
         BOOST_UBLAS_INLINE
-        size_type packed_size (L, size_type size_i, size_type size_j) {
+        size_type packed_size (L, size_type size1, size_type size2) {
             // Zero size strict triangles are bad at this point
-            BOOST_UBLAS_CHECK (size_i != 0 && size_j != 0, bad_index ());
-            return L::triangular_size (size_i - 1, size_j - 1);
+            BOOST_UBLAS_CHECK (size1 != 0 && size2 != 0, bad_index ());
+            return L::triangular_size (size1 - 1, size2 - 1);
         }
 
         static
@@ -2054,10 +2054,10 @@
         template<class L>
         static
         BOOST_UBLAS_INLINE
-        size_type element (L, size_type i, size_type size_i, size_type j, size_type size_j) {
+        size_type element (L, size_type i, size_type size1, size_type j, size_type size2) {
             // Zero size strict triangles are bad at this point
-            BOOST_UBLAS_CHECK (size_i != 0 && size_j != 0, bad_index ());
-            return L::upper_element (i, size_i - 1, j, size_j - 1);
+            BOOST_UBLAS_CHECK (size1 != 0 && size2 != 0, bad_index ());
+            return L::upper_element (i, size1 - 1, j, size2 - 1);
         }
 
         static

Modified: boost/trunk/boost/numeric/ublas/matrix.hpp
===================================================================
--- boost/trunk/boost/numeric/ublas/matrix.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/numeric/ublas/matrix.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -41,17 +41,15 @@
             // Common elements to preserve
             const size_type size1_min = (std::min) (size1, msize1);
             const size_type size2_min = (std::min) (size2, msize2);
-            // Order for major and minor sizes
-            const size_type major_size = layout_type::size_M (size1_min, size2_min);
-            const size_type minor_size = layout_type::size_m (size1_min, size2_min);
-            // Indexing copy over major
-            for (size_type major = 0; major != major_size; ++major) {
-                for (size_type minor = 0; minor != minor_size; ++minor) {
-			            // find indexes - use invertability of element_ functions
-                    const size_type i1 = layout_type::index_M(major, minor);
-                    const size_type i2 = layout_type::index_m(major, minor);
-                    temporary.data () [layout_type::element (i1, size1, i2, size2)] =
-                            m.data() [layout_type::element (i1, msize1, i2, msize2)];
+            // Order loop for i-major and j-minor sizes
+            const size_type i_size = layout_type::size1 (size1_min, size2_min);
+            const size_type j_size = layout_type::size2 (size1_min, size2_min);
+            for (size_type i = 0; i != i_size; ++i) {    // indexing copy over major
+                for (size_type j = 0; j != j_size; ++j) {
+                    const size_type element1 = layout_type::element1(i,i_size, j,j_size);
+                    const size_type element2 = layout_type::element2(i,i_size, j,j_size);
+                    temporary.data () [layout_type::element (element1, size1, element2, size2)] =
+                            m.data() [layout_type::element (element1, msize1, element2, msize2)];
                 }
             }
             m.assign_temporary (temporary);
@@ -357,28 +355,28 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             const_iterator1 &operator ++ () {
-                layout_type::increment_i (it_, (*this) ().size1 (), (*this) ().size2 ());
+                layout_type::increment1 (it_, (*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             const_iterator1 &operator -- () {
-                layout_type::decrement_i (it_, (*this) ().size1 (), (*this) ().size2 ());
+                layout_type::decrement1 (it_, (*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             const_iterator1 &operator += (difference_type n) {
-                layout_type::increment_i (it_, n, (*this) ().size1 (), (*this) ().size2 ());
+                it_ += n * layout_type::one1 ((*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             const_iterator1 &operator -= (difference_type n) {
-                layout_type::decrement_i (it_, n, (*this) ().size1 (), (*this) ().size2 ());
+                it_ -= n * layout_type::one1 ((*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             difference_type operator - (const const_iterator1 &it) const {
                 BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());
-                return layout_type::distance_i (it_ - it.it_, (*this) ().size1 (), (*this) ().size2 ());
+                return layout_type::distance1 (it_ - it.it_, (*this) ().size1 (), (*this) ().size2 ());
             }
 
             // Dereference
@@ -430,12 +428,12 @@
             BOOST_UBLAS_INLINE
             size_type index1 () const {
                 const self_type &m = (*this) ();
-                return layout_type::index_i (it_ - m.begin1 ().it_, m.size1 (), m.size2 ());
+                return layout_type::index1 (it_ - m.begin1 ().it_, m.size1 (), m.size2 ());
             }
             BOOST_UBLAS_INLINE
             size_type index2 () const {
                 const self_type &m = (*this) ();
-                return layout_type::index_j (it_ - m.begin1 ().it_, m.size1 (), m.size2 ());
+                return layout_type::index2 (it_ - m.begin1 ().it_, m.size1 (), m.size2 ());
             }
 
             // Assignment
@@ -499,28 +497,28 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             iterator1 &operator ++ () {
-                layout_type::increment_i (it_, (*this) ().size1 (), (*this) ().size2 ());
+                layout_type::increment1 (it_, (*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             iterator1 &operator -- () {
-                layout_type::decrement_i (it_, (*this) ().size1 (), (*this) ().size2 ());
+                layout_type::decrement1 (it_, (*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             iterator1 &operator += (difference_type n) {
-                layout_type::increment_i (it_, n, (*this) ().size1 (), (*this) ().size2 ());
+                it_ += n * layout_type::one1 ((*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             iterator1 &operator -= (difference_type n) {
-                layout_type::decrement_i (it_, n, (*this) ().size1 (), (*this) ().size2 ());
+                it_ -= n * layout_type::one1 ((*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             difference_type operator - (const iterator1 &it) const {
                 BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());
-                return layout_type::distance_i (it_ - it.it_, (*this) ().size1 (), (*this) ().size2 ());
+                return layout_type::distance1 (it_ - it.it_, (*this) ().size1 (), (*this) ().size2 ());
             }
 
             // Dereference
@@ -572,12 +570,12 @@
             BOOST_UBLAS_INLINE
             size_type index1 () const {
                 self_type &m = (*this) ();
-                return layout_type::index_i (it_ - m.begin1 ().it_, m.size1 (), m.size2 ());
+                return layout_type::index1 (it_ - m.begin1 ().it_, m.size1 (), m.size2 ());
             }
             BOOST_UBLAS_INLINE
             size_type index2 () const {
                 self_type &m = (*this) ();
-                return layout_type::index_j (it_ - m.begin1 ().it_, m.size1 (), m.size2 ());
+                return layout_type::index2 (it_ - m.begin1 ().it_, m.size1 (), m.size2 ());
             }
 
             // Assignment
@@ -644,28 +642,28 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             const_iterator2 &operator ++ () {
-                layout_type::increment_j (it_, (*this) ().size1 (), (*this) ().size2 ());
+                layout_type::increment2 (it_, (*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             const_iterator2 &operator -- () {
-                layout_type::decrement_j (it_, (*this) ().size1 (), (*this) ().size2 ());
+                layout_type::decrement2 (it_, (*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             const_iterator2 &operator += (difference_type n) {
-                layout_type::increment_j (it_, n, (*this) ().size1 (), (*this) ().size2 ());
+                it_ += n * layout_type::one2 ((*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             const_iterator2 &operator -= (difference_type n) {
-                layout_type::decrement_j (it_, n, (*this) ().size1 (), (*this) ().size2 ());
+                it_ -= n * layout_type::one2 ((*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             difference_type operator - (const const_iterator2 &it) const {
                 BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());
-                return layout_type::distance_j (it_ - it.it_, (*this) ().size1 (), (*this) ().size2 ());
+                return layout_type::distance2 (it_ - it.it_, (*this) ().size1 (), (*this) ().size2 ());
             }
 
             // Dereference
@@ -717,12 +715,12 @@
             BOOST_UBLAS_INLINE
             size_type index1 () const {
                 const self_type &m = (*this) ();
-                return layout_type::index_i (it_ - m.begin2 ().it_, m.size1 (), m.size2 ());
+                return layout_type::index1 (it_ - m.begin2 ().it_, m.size1 (), m.size2 ());
             }
             BOOST_UBLAS_INLINE
             size_type index2 () const {
                 const self_type &m = (*this) ();
-                return layout_type::index_j (it_ - m.begin2 ().it_, m.size1 (), m.size2 ());
+                return layout_type::index2 (it_ - m.begin2 ().it_, m.size1 (), m.size2 ());
             }
 
             // Assignment
@@ -786,28 +784,28 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             iterator2 &operator ++ () {
-                layout_type::increment_j (it_, (*this) ().size1 (), (*this) ().size2 ());
+                layout_type::increment2 (it_, (*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             iterator2 &operator -- () {
-                layout_type::decrement_j (it_, (*this) ().size1 (), (*this) ().size2 ());
+                layout_type::decrement2 (it_, (*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             iterator2 &operator += (difference_type n) {
-                layout_type::increment_j (it_, n, (*this) ().size1 (), (*this) ().size2 ());
+                it_ += n * layout_type::one2 ((*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             iterator2 &operator -= (difference_type n) {
-                layout_type::decrement_j (it_, n, (*this) ().size1 (), (*this) ().size2 ());
+                it_ -= n * layout_type::one2 ((*this) ().size1 (), (*this) ().size2 ());
                 return *this;
             }
             BOOST_UBLAS_INLINE
             difference_type operator - (const iterator2 &it) const {
                 BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());
-                return layout_type::distance_j (it_ - it.it_, (*this) ().size1 (), (*this) ().size2 ());
+                return layout_type::distance2 (it_ - it.it_, (*this) ().size1 (), (*this) ().size2 ());
             }
 
             // Dereference
@@ -859,12 +857,12 @@
             BOOST_UBLAS_INLINE
             size_type index1 () const {
                 self_type &m = (*this) ();
-                return layout_type::index_i (it_ - m.begin2 ().it_, m.size1 (), m.size2 ());
+                return layout_type::index1 (it_ - m.begin2 ().it_, m.size1 (), m.size2 ());
             }
             BOOST_UBLAS_INLINE
             size_type index2 () const {
                 self_type &m = (*this) ();
-                return layout_type::index_j (it_ - m.begin2 ().it_, m.size1 (), m.size2 ());
+                return layout_type::index2 (it_ - m.begin2 ().it_, m.size1 (), m.size2 ());
             }
 
             // Assignment
@@ -1251,7 +1249,7 @@
 #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR
             return const_iterator1 (*this, i, j);
 #else
-            return const_iterator1 (*this, i, j, data () [layout_type::index_M (i, j)].begin ()  + layout_type::index_m (i, j));
+            return const_iterator1 (*this, i, j, data () [layout_type::address1 (i, size1_, j, size2_)].begin ()  + layout_type::address2 (i, size1_, j, size2_));
 #endif
         }
         BOOST_UBLAS_INLINE
@@ -1259,7 +1257,7 @@
 #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR
             return iterator1 (*this, i, j);
 #else
-            return iterator1 (*this, i, j, data () [layout_type::index_M (i, j)].begin ()  + layout_type::index_m (i, j));
+            return iterator1 (*this, i, j, data () [layout_type::address1 (i, size1_, j, size2_)].begin ()  + layout_type::address2 (i, size1_, j, size2_));
 #endif
         }
         BOOST_UBLAS_INLINE
@@ -1267,7 +1265,7 @@
 #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR
             return const_iterator2 (*this, i, j);
 #else
-            return const_iterator2 (*this, i, j, data () [layout_type::index_M (i, j)].begin ()  + layout_type::index_m (i, j));
+            return const_iterator2 (*this, i, j, data () [layout_type::address1 (i, size1_, j, size2_)].begin ()  + layout_type::address2 (i, size1_, j, size2_));
 #endif
         }
         BOOST_UBLAS_INLINE
@@ -1275,7 +1273,7 @@
 #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR
             return iterator2 (*this, i, j);
 #else
-            return iterator2 (*this, i, j, data () [layout_type::index_M (i, j)].begin () + layout_type::index_m (i, j));
+            return iterator2 (*this, i, j, data () [layout_type::address1 (i, size1_, j, size2_)].begin () + layout_type::address2 (i, size1_, j, size2_));
 #endif
         }
 
@@ -1310,7 +1308,7 @@
             const_iterator1 &operator ++ () {
                 ++ i_;
                 const self_type &m = (*this) ();
-                if (layout_type::fast_i ())
+                if (layout_type::fast1 ())
                     ++ it_;
                 else 
                     it_ = m.find1 (1, i_, j_).it_;
@@ -1320,7 +1318,7 @@
             const_iterator1 &operator -- () {
                 -- i_;
                 const self_type &m = (*this) ();
-                if (layout_type::fast_i ())
+                if (layout_type::fast1 ())
                     -- it_;
                 else
                     it_ = m.find1 (1, i_, j_).it_;
@@ -1469,7 +1467,7 @@
             iterator1 &operator ++ () {
                 ++ i_;
                 self_type &m = (*this) ();
-                if (layout_type::fast_i ())
+                if (layout_type::fast1 ())
                     ++ it_;
                 else
                     it_ = m.find1 (1, i_, j_).it_;
@@ -1479,7 +1477,7 @@
             iterator1 &operator -- () {
                 -- i_;
                 self_type &m = (*this) ();
-                if (layout_type::fast_i ())
+                if (layout_type::fast1 ())
                     -- it_;
                 else
                     it_ = m.find1 (1, i_, j_).it_;
@@ -1631,7 +1629,7 @@
             const_iterator2 &operator ++ () {
                 ++ j_;
                 const self_type &m = (*this) ();
-                if (layout_type::fast_j ())
+                if (layout_type::fast2 ())
                     ++ it_;
                 else
                     it_ = m.find2 (1, i_, j_).it_;
@@ -1641,7 +1639,7 @@
             const_iterator2 &operator -- () {
                 -- j_;
                 const self_type &m = (*this) ();
-                if (layout_type::fast_j ())
+                if (layout_type::fast2 ())
                     -- it_;
                 else
                     it_ = m.find2 (1, i_, j_).it_;
@@ -1790,7 +1788,7 @@
             iterator2 &operator ++ () {
                 ++ j_;
                 self_type &m = (*this) ();
-                if (layout_type::fast_j ())
+                if (layout_type::fast2 ())
                     ++ it_;
                 else
                     it_ = m.find2 (1, i_, j_).it_;
@@ -1800,7 +1798,7 @@
             iterator2 &operator -- () {
                 -- j_;
                 self_type &m = (*this) ();
-                if (layout_type::fast_j ())
+                if (layout_type::fast2 ())
                     -- it_;
                 else
                     it_ = m.find2 (1, i_, j_).it_;
@@ -2171,7 +2169,6 @@
             BOOST_UBLAS_INLINE
             bool operator == (const const_iterator1 &it) const {
                 BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());
-                detail::ignore_unused_variable_warning(it);
                 return true;
             }
         };
@@ -2282,7 +2279,6 @@
             BOOST_UBLAS_INLINE
             bool operator == (const const_iterator2 &it) const {
                 BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());
-                detail::ignore_unused_variable_warning(it);
                 return true;
             }
         };
@@ -2729,7 +2725,6 @@
         typedef const T &const_reference;
         typedef T &reference;
         typedef const matrix_reference<const self_type> const_closure_type;
-        typedef matrix_reference<self_type> closure_type;
         typedef dense_tag storage_category;
         typedef unknown_orientation_tag orientation_category;
 

Modified: boost/trunk/boost/numeric/ublas/matrix_expression.hpp
===================================================================
--- boost/trunk/boost/numeric/ublas/matrix_expression.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/numeric/ublas/matrix_expression.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -42,7 +42,7 @@
         typedef typename boost::mpl::if_<boost::is_const<E>,
                                           typename E::const_reference,
                                           typename E::reference>::type reference;
-        typedef E refered_type;
+        typedef E referred_type;
         typedef const self_type const_closure_type;
         typedef self_type closure_type;
         typedef typename E::orientation_category orientation_category;
@@ -50,7 +50,7 @@
 
         // Construction and destruction
         BOOST_UBLAS_INLINE
-        explicit matrix_reference (refered_type &e):
+        explicit matrix_reference (referred_type &e):
               e_ (e) {}
 
         // Accessors
@@ -66,11 +66,11 @@
     public:
         // Expression accessors - const correct
         BOOST_UBLAS_INLINE
-        const refered_type &expression () const {
+        const referred_type &expression () const {
             return e_;
         }
         BOOST_UBLAS_INLINE
-        refered_type &expression () {
+        referred_type &expression () {
             return e_;
         }
 
@@ -269,7 +269,7 @@
         }
 
     private:
-        refered_type &e_;
+        referred_type &e_;
     };
 
 

Modified: boost/trunk/boost/numeric/ublas/matrix_sparse.hpp
===================================================================
--- boost/trunk/boost/numeric/ublas/matrix_sparse.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/numeric/ublas/matrix_sparse.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -552,8 +552,8 @@
             size_type index1 = size_type (-1);
             size_type index2 = size_type (-1);
             while (rank == 1 && it != it_end) {
-                index1 = layout_type::index_i ((*it).first, size1_, size2_);
-                index2 = layout_type::index_j ((*it).first, size1_, size2_);
+                index1 = layout_type::index1 ((*it).first, size1_, size2_);
+                index2 = layout_type::index2 ((*it).first, size1_, size2_);
                 if (direction > 0) {
                     if ((index1 >= i && index2 == j) || (i >= size1_))
                         break;
@@ -581,8 +581,8 @@
             size_type index1 = size_type (-1);
             size_type index2 = size_type (-1);
             while (rank == 1 && it != it_end) {
-                index1 = layout_type::index_i ((*it).first, size1_, size2_);
-                index2 = layout_type::index_j ((*it).first, size1_, size2_);
+                index1 = layout_type::index1 ((*it).first, size1_, size2_);
+                index2 = layout_type::index2 ((*it).first, size1_, size2_);
                 if (direction > 0) {
                     if ((index1 >= i && index2 == j) || (i >= size1_))
                         break;
@@ -610,8 +610,8 @@
             size_type index1 = size_type (-1);
             size_type index2 = size_type (-1);
             while (rank == 1 && it != it_end) {
-                index1 = layout_type::index_i ((*it).first, size1_, size2_);
-                index2 = layout_type::index_j ((*it).first, size1_, size2_);
+                index1 = layout_type::index1 ((*it).first, size1_, size2_);
+                index2 = layout_type::index2 ((*it).first, size1_, size2_);
                 if (direction > 0) {
                     if ((index2 >= j && index1 == i) || (j >= size2_))
                         break;
@@ -639,8 +639,8 @@
             size_type index1 = size_type (-1);
             size_type index2 = size_type (-1);
             while (rank == 1 && it != it_end) {
-                index1 = layout_type::index_i ((*it).first, size1_, size2_);
-                index2 = layout_type::index_j ((*it).first, size1_, size2_);
+                index1 = layout_type::index1 ((*it).first, size1_, size2_);
+                index2 = layout_type::index2 ((*it).first, size1_, size2_);
                 if (direction > 0) {
                     if ((index2 >= j && index1 == i) || (j >= size2_))
                         break;
@@ -690,7 +690,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             const_iterator1 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     ++ it_;
                 else
                     *this = (*this) ().find1 (rank_, index1 () + 1, j_, 1);
@@ -698,7 +698,7 @@
             }
             BOOST_UBLAS_INLINE
             const_iterator1 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     -- it_;
                 else
                     *this = (*this) ().find1 (rank_, index1 () - 1, j_, -1);
@@ -756,8 +756,8 @@
                 BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ());
                 if (rank_ == 1) {
                     const self_type &m = (*this) ();
-                    BOOST_UBLAS_CHECK (layout_type::index_i ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_i ((*it_).first, m.size1 (), m.size2 ());
+                    BOOST_UBLAS_CHECK (layout_type::index1 ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 ((*it_).first, m.size1 (), m.size2 ());
                 } else {
                     return i_;
                 }
@@ -766,8 +766,8 @@
             size_type index2 () const {
                 if (rank_ == 1) {
                     const self_type &m = (*this) ();
-                    BOOST_UBLAS_CHECK (layout_type::index_j ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_j ((*it_).first, m.size1 (), m.size2 ());
+                    BOOST_UBLAS_CHECK (layout_type::index2 ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 ((*it_).first, m.size1 (), m.size2 ());
                 } else {
                     return j_;
                 }
@@ -836,7 +836,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             iterator1 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     ++ it_;
                 else
                     *this = (*this) ().find1 (rank_, index1 () + 1, j_, 1);
@@ -844,7 +844,7 @@
             }
             BOOST_UBLAS_INLINE
             iterator1 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     -- it_;
                 else
                     *this = (*this) ().find1 (rank_, index1 () - 1, j_, -1);
@@ -902,8 +902,8 @@
                 BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ());
                 if (rank_ == 1) {
                     const self_type &m = (*this) ();
-                    BOOST_UBLAS_CHECK (layout_type::index_i ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_i ((*it_).first, m.size1 (), m.size2 ());
+                    BOOST_UBLAS_CHECK (layout_type::index1 ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 ((*it_).first, m.size1 (), m.size2 ());
                 } else {
                     return i_;
                 }
@@ -912,8 +912,8 @@
             size_type index2 () const {
                 if (rank_ == 1) {
                     const self_type &m = (*this) ();
-                    BOOST_UBLAS_CHECK (layout_type::index_j ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_j ((*it_).first, m.size1 (), m.size2 ());
+                    BOOST_UBLAS_CHECK (layout_type::index2 ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 ((*it_).first, m.size1 (), m.size2 ());
                 } else {
                     return j_;
                 }
@@ -987,7 +987,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             const_iterator2 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     ++ it_;
                 else
                     *this = (*this) ().find2 (rank_, i_, index2 () + 1, 1);
@@ -995,7 +995,7 @@
             }
             BOOST_UBLAS_INLINE
             const_iterator2 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     -- it_;
                 else
                     *this = (*this) ().find2 (rank_, i_, index2 () - 1, -1);
@@ -1052,8 +1052,8 @@
             size_type index1 () const {
                 if (rank_ == 1) {
                     const self_type &m = (*this) ();
-                    BOOST_UBLAS_CHECK (layout_type::index_i ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_i ((*it_).first, m.size1 (), m.size2 ());
+                    BOOST_UBLAS_CHECK (layout_type::index1 ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 ((*it_).first, m.size1 (), m.size2 ());
                 } else {
                     return i_;
                 }
@@ -1063,8 +1063,8 @@
                 BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ());
                 if (rank_ == 1) {
                     const self_type &m = (*this) ();
-                    BOOST_UBLAS_CHECK (layout_type::index_j ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_j ((*it_).first, m.size1 (), m.size2 ());
+                    BOOST_UBLAS_CHECK (layout_type::index2 ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 ((*it_).first, m.size1 (), m.size2 ());
                 } else {
                     return j_;
                 }
@@ -1133,7 +1133,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             iterator2 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     ++ it_;
                 else
                     *this = (*this) ().find2 (rank_, i_, index2 () + 1, 1);
@@ -1141,7 +1141,7 @@
             }
             BOOST_UBLAS_INLINE
             iterator2 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     -- it_;
                 else
                     *this = (*this) ().find2 (rank_, i_, index2 () - 1, -1);
@@ -1198,8 +1198,8 @@
             size_type index1 () const {
                 if (rank_ == 1) {
                     const self_type &m = (*this) ();
-                    BOOST_UBLAS_CHECK (layout_type::index_i ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_i ((*it_).first, m.size1 (), m.size2 ());
+                    BOOST_UBLAS_CHECK (layout_type::index1 ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 ((*it_).first, m.size1 (), m.size2 ());
                 } else {
                     return i_;
                 }
@@ -1209,8 +1209,8 @@
                 BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ());
                 if (rank_ == 1) {
                     const self_type &m = (*this) ();
-                    BOOST_UBLAS_CHECK (layout_type::index_j ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_j ((*it_).first, m.size1 (), m.size2 ());
+                    BOOST_UBLAS_CHECK (layout_type::index2 ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 ((*it_).first, m.size1 (), m.size2 ());
                 } else {
                     return j_;
                 }
@@ -1344,13 +1344,13 @@
         mapped_vector_of_mapped_vector ():
             matrix_container<self_type> (),
             size1_ (0), size2_ (0), data_ () {
-            data_ [layout_type::size_M (size1_, size2_)] = vector_data_value_type ();
+            data_ [layout_type::size1 (size1_, size2_)] = vector_data_value_type ();
         }
         BOOST_UBLAS_INLINE
         mapped_vector_of_mapped_vector (size_type size1, size_type size2, size_type non_zeros = 0):
             matrix_container<self_type> (),
             size1_ (size1), size2_ (size2), data_ () {
-            data_ [layout_type::size_M (size1_, size2_)] = vector_data_value_type ();
+            data_ [layout_type::size1 (size1_, size2_)] = vector_data_value_type ();
         }
         BOOST_UBLAS_INLINE
         mapped_vector_of_mapped_vector (const mapped_vector_of_mapped_vector &m):
@@ -1361,7 +1361,7 @@
         mapped_vector_of_mapped_vector (const matrix_expression<AE> &ae, size_type non_zeros = 0):
             matrix_container<self_type> (),
             size1_ (ae ().size1 ()), size2_ (ae ().size2 ()), data_ () {
-            data_ [layout_type::size_M (size1_, size2_)] = vector_data_value_type ();
+            data_ [layout_type::size1 (size1_, size2_)] = vector_data_value_type ();
             matrix_assign<scalar_assign> (*this, ae);
         }
 
@@ -1407,7 +1407,7 @@
             size1_ = size1;
             size2_ = size2;
             data ().clear ();
-            data () [layout_type::size_M (size1_, size2_)] = vector_data_value_type ();
+            data () [layout_type::size1 (size1_, size2_)] = vector_data_value_type ();
         }
 
         // Element support
@@ -1417,8 +1417,8 @@
         }
         BOOST_UBLAS_INLINE
         const_pointer find_element (size_type i, size_type j) const {
-            const size_type element1 = layout_type::index_M (i, j);
-            const size_type element2 = layout_type::index_m (i, j);
+            const size_type element1 = layout_type::element1 (i, size1_, j, size2_);
+            const size_type element2 = layout_type::element2 (i, size1_, j, size2_);
             vector_const_subiterator_type itv (data ().find (element1));
             if (itv == data ().end ())
                 return 0;
@@ -1433,8 +1433,8 @@
         // Element access
         BOOST_UBLAS_INLINE
         const_reference operator () (size_type i, size_type j) const {
-            const size_type element1 = layout_type::index_M (i, j);
-            const size_type element2 = layout_type::index_m (i, j);
+            const size_type element1 = layout_type::element1 (i, size1_, j, size2_);
+            const size_type element2 = layout_type::element2 (i, size1_, j, size2_);
             vector_const_subiterator_type itv (data ().find (element1));
             if (itv == data ().end ())
                 return zero_;
@@ -1448,8 +1448,8 @@
         BOOST_UBLAS_INLINE
         reference operator () (size_type i, size_type j) {
 #ifndef BOOST_UBLAS_STRICT_MATRIX_SPARSE
-            const size_type element1 = layout_type::index_M (i, j);
-            const size_type element2 = layout_type::index_m (i, j);
+            const size_type element1 = layout_type::element1 (i, size1_, j, size2_);
+            const size_type element2 = layout_type::element2 (i, size1_, j, size2_);
             vector_data_value_type& vd (data () [element1]);
             std::pair<subiterator_type, bool> ii (vd.insert (typename array_type::value_type::second_type::value_type (element2, value_type/*zero*/())));
             BOOST_UBLAS_CHECK ((ii.first)->first == element2, internal_logic ());   // broken map
@@ -1463,8 +1463,8 @@
         BOOST_UBLAS_INLINE
         true_reference insert_element (size_type i, size_type j, const_reference t) {
             BOOST_UBLAS_CHECK (!find_element (i, j), bad_index ());        // duplicate element
-            const size_type element1 = layout_type::index_M (i, j);
-            const size_type element2 = layout_type::index_m (i, j);
+            const size_type element1 = layout_type::element1 (i, size1_, j, size2_);
+            const size_type element2 = layout_type::element2 (i, size1_, j, size2_);
 
             vector_data_value_type& vd (data () [element1]);
             std::pair<subiterator_type, bool> ii (vd.insert (typename vector_data_value_type::value_type (element2, t)));
@@ -1475,10 +1475,10 @@
         }
         BOOST_UBLAS_INLINE
         void erase_element (size_type i, size_type j) {
-            vector_subiterator_type itv (data ().find (layout_type::index_M (i, j)));
+            vector_subiterator_type itv (data ().find (layout_type::element1 (i, size1_, j, size2_)));
             if (itv == data ().end ())
                 return;
-            subiterator_type it ((*itv).second.find (layout_type::index_m (i, j)));
+            subiterator_type it ((*itv).second.find (layout_type::element2 (i, size1_, j, size2_)));
             if (it == (*itv).second.end ())
                 return;
             (*itv).second.erase (it);
@@ -1488,7 +1488,7 @@
         BOOST_UBLAS_INLINE
         void clear () {
             data ().clear ();
-            data_ [layout_type::size_M (size1_, size2_)] = vector_data_value_type ();
+            data_ [layout_type::size1 (size1_, size2_)] = vector_data_value_type ();
         }
 
         // Assignment
@@ -1598,8 +1598,8 @@
 
         BOOST_UBLAS_INLINE
         true_reference at_element (size_type i, size_type j) {
-            const size_type element1 = layout_type::index_M (i, j);
-            const size_type element2 = layout_type::index_m (i, j);
+            const size_type element1 = layout_type::element1 (i, size1_, j, size2_);
+            const size_type element2 = layout_type::element2 (i, size1_, j, size2_);
             vector_subiterator_type itv (data ().find (element1));
             BOOST_UBLAS_CHECK (itv != data ().end(), bad_index ());
             BOOST_UBLAS_CHECK ((*itv).first == element1, internal_logic ());   // broken map
@@ -1625,19 +1625,19 @@
         const_iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) const {
             BOOST_UBLAS_CHECK (data ().begin () != data ().end (), internal_logic ());
             for (;;) {
-                vector_const_subiterator_type itv (data ().lower_bound (layout_type::index_M (i, j)));
+                vector_const_subiterator_type itv (data ().lower_bound (layout_type::address1 (i, size1_, j, size2_)));
                 vector_const_subiterator_type itv_end (data ().end ());
                 if (itv == itv_end)
                     return const_iterator1 (*this, rank, i, j, itv_end, (*(-- itv)).second.end ());
 
-                const_subiterator_type it ((*itv).second.lower_bound (layout_type::index_m (i, j)));
+                const_subiterator_type it ((*itv).second.lower_bound (layout_type::address2 (i, size1_, j, size2_)));
                 const_subiterator_type it_end ((*itv).second.end ());
                 if (rank == 0)
                     return const_iterator1 (*this, rank, i, j, itv, it);
-                if (it != it_end && (*it).first == layout_type::index_m (i, j))
+                if (it != it_end && (*it).first == layout_type::address2 (i, size1_, j, size2_))
                     return const_iterator1 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == it_end)
                             return const_iterator1 (*this, rank, i, j, itv, it);
                         i = (*it).first;
@@ -1647,7 +1647,7 @@
                         ++ i;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == (*itv).second.begin ())
                             return const_iterator1 (*this, rank, i, j, itv, it);
                         -- it;
@@ -1664,19 +1664,19 @@
         iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) {
             BOOST_UBLAS_CHECK (data ().begin () != data ().end (), internal_logic ());
             for (;;) {
-                vector_subiterator_type itv (data ().lower_bound (layout_type::index_M (i, j)));
+                vector_subiterator_type itv (data ().lower_bound (layout_type::address1 (i, size1_, j, size2_)));
                 vector_subiterator_type itv_end (data ().end ());
                 if (itv == itv_end)
                     return iterator1 (*this, rank, i, j, itv_end, (*(-- itv)).second.end ());
 
-                subiterator_type it ((*itv).second.lower_bound (layout_type::index_m (i, j)));
+                subiterator_type it ((*itv).second.lower_bound (layout_type::address2 (i, size1_, j, size2_)));
                 subiterator_type it_end ((*itv).second.end ());
                 if (rank == 0)
                     return iterator1 (*this, rank, i, j, itv, it);
-                if (it != it_end && (*it).first == layout_type::index_m (i, j))
+                if (it != it_end && (*it).first == layout_type::address2 (i, size1_, j, size2_))
                     return iterator1 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == it_end)
                             return iterator1 (*this, rank, i, j, itv, it);
                         i = (*it).first;
@@ -1686,7 +1686,7 @@
                         ++ i;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == (*itv).second.begin ())
                             return iterator1 (*this, rank, i, j, itv, it);
                         -- it;
@@ -1703,19 +1703,19 @@
         const_iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) const {
             BOOST_UBLAS_CHECK (data ().begin () != data ().end (), internal_logic ());
             for (;;) {
-                vector_const_subiterator_type itv (data ().lower_bound (layout_type::index_M (i, j)));
+                vector_const_subiterator_type itv (data ().lower_bound (layout_type::address1 (i, size1_, j, size2_)));
                 vector_const_subiterator_type itv_end (data ().end ());
                 if (itv == itv_end)
                     return const_iterator2 (*this, rank, i, j, itv_end, (*(-- itv)).second.end ());
 
-                const_subiterator_type it ((*itv).second.lower_bound (layout_type::index_m (i, j)));
+                const_subiterator_type it ((*itv).second.lower_bound (layout_type::address2 (i, size1_, j, size2_)));
                 const_subiterator_type it_end ((*itv).second.end ());
                 if (rank == 0)
                     return const_iterator2 (*this, rank, i, j, itv, it);
-                if (it != it_end && (*it).first == layout_type::index_m (i, j))
+                if (it != it_end && (*it).first == layout_type::address2 (i, size1_, j, size2_))
                     return const_iterator2 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == it_end)
                             return const_iterator2 (*this, rank, i, j, itv, it);
                         j = (*it).first;
@@ -1725,7 +1725,7 @@
                         ++ j;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == (*itv).second.begin ())
                             return const_iterator2 (*this, rank, i, j, itv, it);
                         -- it;
@@ -1742,19 +1742,19 @@
         iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) {
             BOOST_UBLAS_CHECK (data ().begin () != data ().end (), internal_logic ());
             for (;;) {
-                vector_subiterator_type itv (data ().lower_bound (layout_type::index_M (i, j)));
+                vector_subiterator_type itv (data ().lower_bound (layout_type::address1 (i, size1_, j, size2_)));
                 vector_subiterator_type itv_end (data ().end ());
                 if (itv == itv_end)
                     return iterator2 (*this, rank, i, j, itv_end, (*(-- itv)).second.end ());
 
-                subiterator_type it ((*itv).second.lower_bound (layout_type::index_m (i, j)));
+                subiterator_type it ((*itv).second.lower_bound (layout_type::address2 (i, size1_, j, size2_)));
                 subiterator_type it_end ((*itv).second.end ());
                 if (rank == 0)
                     return iterator2 (*this, rank, i, j, itv, it);
-                if (it != it_end && (*it).first == layout_type::index_m (i, j))
+                if (it != it_end && (*it).first == layout_type::address2 (i, size1_, j, size2_))
                     return iterator2 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == it_end)
                             return iterator2 (*this, rank, i, j, itv, it);
                         j = (*it).first;
@@ -1764,7 +1764,7 @@
                         ++ j;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == (*itv).second.begin ())
                             return iterator2 (*this, rank, i, j, itv, it);
                         -- it;
@@ -1805,7 +1805,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             const_iterator1 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     ++ it_;
                 else {
                     const self_type &m = (*this) ();
@@ -1822,7 +1822,7 @@
             }
             BOOST_UBLAS_INLINE
             const_iterator1 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     -- it_;
                 else {
                     const self_type &m = (*this) ();
@@ -1888,8 +1888,8 @@
             size_type index1 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M ((*itv_).first, (*it_).first) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M ((*itv_).first, (*it_).first);
+                    BOOST_UBLAS_CHECK (layout_type::index1 ((*itv_).first, (*it_).first) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 ((*itv_).first, (*it_).first);
                 } else {
                     return i_;
                 }
@@ -1897,8 +1897,8 @@
             BOOST_UBLAS_INLINE
             size_type index2 () const {
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m ((*itv_).first, (*it_).first) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m ((*itv_).first, (*it_).first);
+                    BOOST_UBLAS_CHECK (layout_type::index2 ((*itv_).first, (*it_).first) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 ((*itv_).first, (*it_).first);
                 } else {
                     return j_;
                 }
@@ -1969,7 +1969,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             iterator1 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     ++ it_;
                 else {
                     self_type &m = (*this) ();
@@ -1986,7 +1986,7 @@
             }
             BOOST_UBLAS_INLINE
             iterator1 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     -- it_;
                 else {
                     self_type &m = (*this) ();
@@ -2052,8 +2052,8 @@
             size_type index1 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M ((*itv_).first, (*it_).first) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M ((*itv_).first, (*it_).first);
+                    BOOST_UBLAS_CHECK (layout_type::index1 ((*itv_).first, (*it_).first) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 ((*itv_).first, (*it_).first);
                 } else {
                     return i_;
                 }
@@ -2061,8 +2061,8 @@
             BOOST_UBLAS_INLINE
             size_type index2 () const {
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m ((*itv_).first, (*it_).first) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m ((*itv_).first, (*it_).first);
+                    BOOST_UBLAS_CHECK (layout_type::index2 ((*itv_).first, (*it_).first) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 ((*itv_).first, (*it_).first);
                 } else {
                     return j_;
                 }
@@ -2138,7 +2138,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             const_iterator2 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     ++ it_;
                 else {
                     const self_type &m = (*this) ();
@@ -2155,7 +2155,7 @@
             }
             BOOST_UBLAS_INLINE
             const_iterator2 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     -- it_;
                 else {
                     const self_type &m = (*this) ();
@@ -2220,8 +2220,8 @@
             BOOST_UBLAS_INLINE
             size_type index1 () const {
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M ((*itv_).first, (*it_).first) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M ((*itv_).first, (*it_).first);
+                    BOOST_UBLAS_CHECK (layout_type::index1 ((*itv_).first, (*it_).first) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 ((*itv_).first, (*it_).first);
                 } else {
                     return i_;
                 }
@@ -2230,8 +2230,8 @@
             size_type index2 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m ((*itv_).first, (*it_).first) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m ((*itv_).first, (*it_).first);
+                    BOOST_UBLAS_CHECK (layout_type::index2 ((*itv_).first, (*it_).first) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 ((*itv_).first, (*it_).first);
                 } else {
                     return j_;
                 }
@@ -2302,7 +2302,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             iterator2 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     ++ it_;
                 else {
                     self_type &m = (*this) ();
@@ -2319,7 +2319,7 @@
             }
             BOOST_UBLAS_INLINE
             iterator2 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     -- it_;
                 else {
                     self_type &m = (*this) ();
@@ -2384,8 +2384,8 @@
             BOOST_UBLAS_INLINE
             size_type index1 () const {
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M ((*itv_).first, (*it_).first) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M ((*itv_).first, (*it_).first);
+                    BOOST_UBLAS_CHECK (layout_type::index1 ((*itv_).first, (*it_).first) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 ((*itv_).first, (*it_).first);
                 } else {
                     return i_;
                 }
@@ -2394,8 +2394,8 @@
             size_type index2 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m ((*itv_).first, (*it_).first) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m ((*itv_).first, (*it_).first);
+                    BOOST_UBLAS_CHECK (layout_type::index2 ((*itv_).first, (*it_).first) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 ((*itv_).first, (*it_).first);
                 } else {
                     return j_;
                 }
@@ -2537,7 +2537,7 @@
             matrix_container<self_type> (),
             size1_ (0), size2_ (0), capacity_ (restrict_capacity (0)),
             filled1_ (1), filled2_ (0),
-            index1_data_ (layout_type::size_M (size1_, size2_) + 1), index2_data_ (capacity_), value_data_ (capacity_) {
+            index1_data_ (layout_type::size1 (size1_, size2_) + 1), index2_data_ (capacity_), value_data_ (capacity_) {
             index1_data_ [filled1_ - 1] = k_based (filled2_);
             storage_invariants ();
         }
@@ -2546,7 +2546,7 @@
             matrix_container<self_type> (),
             size1_ (size1), size2_ (size2), capacity_ (restrict_capacity (non_zeros)),
             filled1_ (1), filled2_ (0),
-            index1_data_ (layout_type::size_M (size1_, size2_) + 1), index2_data_ (capacity_), value_data_ (capacity_) {
+            index1_data_ (layout_type::size1 (size1_, size2_) + 1), index2_data_ (capacity_), value_data_ (capacity_) {
             index1_data_ [filled1_ - 1] = k_based (filled2_);
             storage_invariants ();
         }
@@ -2563,7 +2563,7 @@
         compressed_matrix (const coordinate_matrix<T, L, IB, IA, TA> &m):
             matrix_container<self_type> (),
             size1_ (m.size1()), size2_ (m.size2()),
-            index1_data_ (layout_type::size_M (size1_, size2_) + 1)
+            index1_data_ (layout_type::size1 (size1_, size2_) + 1)
         {
             m.sort();
             reserve(m.nnz(), false);
@@ -2572,7 +2572,7 @@
             const_subiterator_type  i_end   = (i_start + filled2_);
             const_subiterator_type  i = i_start;
             size_type r = 1;
-            for (; (r < layout_type::size_M (size1_, size2_)) && (i != i_end); ++r) {
+            for (; (r < layout_type::size1 (size1_, size2_)) && (i != i_end); ++r) {
                 i = std::lower_bound(i, i_end, r);
                 index1_data_[r] = k_based( i - i_start );
             }
@@ -2589,7 +2589,7 @@
             matrix_container<self_type> (),
             size1_ (ae ().size1 ()), size2_ (ae ().size2 ()), capacity_ (restrict_capacity (non_zeros)),
             filled1_ (1), filled2_ (0),
-            index1_data_ (layout_type::size_M (ae ().size1 (), ae ().size2 ()) + 1),
+            index1_data_ (layout_type::size1 (ae ().size1 (), ae ().size2 ()) + 1),
             index2_data_ (capacity_), value_data_ (capacity_) {
             index1_data_ [filled1_ - 1] = k_based (filled2_);
             storage_invariants ();
@@ -2659,7 +2659,7 @@
         }
         BOOST_UBLAS_INLINE
         void complete_index1_data () {
-            while (filled1_ <= layout_type::size_M (size1_, size2_)) {
+            while (filled1_ <= layout_type::size1 (size1_, size2_)) {
                 this->index1_data_ [filled1_] = k_based (filled2_);
                 ++ this->filled1_;
             }
@@ -2687,7 +2687,7 @@
             capacity_ = restrict_capacity (capacity_);
             filled1_ = 1;
             filled2_ = 0;
-            index1_data_.resize (layout_type::size_M (size1_, size2_) + 1);
+            index1_data_.resize (layout_type::size1 (size1_, size2_) + 1);
             index2_data_.resize (capacity_);
             value_data_.resize (capacity_);
             index1_data_ [filled1_ - 1] = k_based (filled2_);
@@ -2720,8 +2720,8 @@
         }
         BOOST_UBLAS_INLINE
         const_pointer find_element (size_type i, size_type j) const {
-            size_type element1 (layout_type::index_M (i, j));
-            size_type element2 (layout_type::index_m (i, j));
+            size_type element1 (layout_type::element1 (i, size1_, j, size2_));
+            size_type element2 (layout_type::element2 (i, size1_, j, size2_));
             if (filled1_ <= element1 + 1)
                 return 0;
             vector_const_subiterator_type itv (index1_data_.begin () + element1);
@@ -2745,8 +2745,8 @@
         BOOST_UBLAS_INLINE
         reference operator () (size_type i, size_type j) {
 #ifndef BOOST_UBLAS_STRICT_MATRIX_SPARSE
-            size_type element1 (layout_type::index_M (i, j));
-            size_type element2 (layout_type::index_m (i, j));
+            size_type element1 (layout_type::element1 (i, size1_, j, size2_));
+            size_type element2 (layout_type::element2 (i, size1_, j, size2_));
             if (filled1_ <= element1 + 1)
                 return insert_element (i, j, value_type/*zero*/());
             pointer p = find_element (i, j);
@@ -2766,8 +2766,8 @@
             if (filled2_ >= capacity_)
                 reserve (2 * filled2_, true);
             BOOST_UBLAS_CHECK (filled2_ < capacity_, internal_logic ());
-            size_type element1 = layout_type::index_M (i, j);
-            size_type element2 = layout_type::index_m (i, j);
+            size_type element1 = layout_type::element1 (i, size1_, j, size2_);
+            size_type element2 = layout_type::element2 (i, size1_, j, size2_);
             while (filled1_ <= element1 + 1) {
                 index1_data_ [filled1_] = k_based (filled2_);
                 ++ filled1_;
@@ -2794,8 +2794,8 @@
         }
         BOOST_UBLAS_INLINE
         void erase_element (size_type i, size_type j) {
-            size_type element1 = layout_type::index_M (i, j);
-            size_type element2 = layout_type::index_m (i, j);
+            size_type element1 = layout_type::element1 (i, size1_, j, size2_);
+            size_type element2 = layout_type::element2 (i, size1_, j, size2_);
             if (element1 + 1 > filled1_)
                 return;
             vector_subiterator_type itv (index1_data_.begin () + element1);
@@ -2944,8 +2944,8 @@
             if (filled2_ >= capacity_)
                 reserve (2 * filled2_, true);
             BOOST_UBLAS_CHECK (filled2_ < capacity_, internal_logic ());
-            size_type element1 = layout_type::index_M (i, j);
-            size_type element2 = layout_type::index_m (i, j);
+            size_type element1 = layout_type::element1 (i, size1_, j, size2_);
+            size_type element2 = layout_type::element2 (i, size1_, j, size2_);
             while (filled1_ < element1 + 2) {
                 index1_data_ [filled1_] = k_based (filled2_);
                 ++ filled1_;
@@ -3001,8 +3001,8 @@
         // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.    
         const_iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) const {
             for (;;) {
-                array_size_type address1 (layout_type::index_M (i, j));
-                array_size_type address2 (layout_type::index_m (i, j));
+                array_size_type address1 (layout_type::address1 (i, size1_, j, size2_));
+                array_size_type address2 (layout_type::address2 (i, size1_, j, size2_));
                 vector_const_subiterator_type itv (index1_data_.begin () + (std::min) (filled1_ - 1, address1));
                 if (filled1_ <= address1 + 1)
                     return const_iterator1 (*this, rank, i, j, itv, index2_data_.begin () + filled2_);
@@ -3016,7 +3016,7 @@
                 if (it != it_end && zero_based (*it) == address2)
                     return const_iterator1 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == it_end)
                             return const_iterator1 (*this, rank, i, j, itv, it);
                         i = zero_based (*it);
@@ -3026,7 +3026,7 @@
                         ++ i;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == index2_data_.begin () + zero_based (*itv))
                             return const_iterator1 (*this, rank, i, j, itv, it);
                         i = zero_based (*(it - 1));
@@ -3041,8 +3041,8 @@
         // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.    
         iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) {
             for (;;) {
-                array_size_type address1 (layout_type::index_M (i, j));
-                array_size_type address2 (layout_type::index_m (i, j));
+                array_size_type address1 (layout_type::address1 (i, size1_, j, size2_));
+                array_size_type address2 (layout_type::address2 (i, size1_, j, size2_));
                 vector_subiterator_type itv (index1_data_.begin () + (std::min) (filled1_ - 1, address1));
                 if (filled1_ <= address1 + 1)
                     return iterator1 (*this, rank, i, j, itv, index2_data_.begin () + filled2_);
@@ -3056,7 +3056,7 @@
                 if (it != it_end && zero_based (*it) == address2)
                     return iterator1 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == it_end)
                             return iterator1 (*this, rank, i, j, itv, it);
                         i = zero_based (*it);
@@ -3066,7 +3066,7 @@
                         ++ i;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == index2_data_.begin () + zero_based (*itv))
                             return iterator1 (*this, rank, i, j, itv, it);
                         i = zero_based (*(it - 1));
@@ -3081,8 +3081,8 @@
         // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.    
         const_iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) const {
             for (;;) {
-                array_size_type address1 (layout_type::index_M (i, j));
-                array_size_type address2 (layout_type::index_m (i, j));
+                array_size_type address1 (layout_type::address1 (i, size1_, j, size2_));
+                array_size_type address2 (layout_type::address2 (i, size1_, j, size2_));
                 vector_const_subiterator_type itv (index1_data_.begin () + (std::min) (filled1_ - 1, address1));
                 if (filled1_ <= address1 + 1)
                     return const_iterator2 (*this, rank, i, j, itv, index2_data_.begin () + filled2_);
@@ -3096,7 +3096,7 @@
                 if (it != it_end && zero_based (*it) == address2)
                     return const_iterator2 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == it_end)
                             return const_iterator2 (*this, rank, i, j, itv, it);
                         j = zero_based (*it);
@@ -3106,7 +3106,7 @@
                         ++ j;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == index2_data_.begin () + zero_based (*itv))
                             return const_iterator2 (*this, rank, i, j, itv, it);
                         j = zero_based (*(it - 1));
@@ -3121,8 +3121,8 @@
         // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.    
         iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) {
             for (;;) {
-                array_size_type address1 (layout_type::index_M (i, j));
-                array_size_type address2 (layout_type::index_m (i, j));
+                array_size_type address1 (layout_type::address1 (i, size1_, j, size2_));
+                array_size_type address2 (layout_type::address2 (i, size1_, j, size2_));
                 vector_subiterator_type itv (index1_data_.begin () + (std::min) (filled1_ - 1, address1));
                 if (filled1_ <= address1 + 1)
                     return iterator2 (*this, rank, i, j, itv, index2_data_.begin () + filled2_);
@@ -3136,7 +3136,7 @@
                 if (it != it_end && zero_based (*it) == address2)
                     return iterator2 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == it_end)
                             return iterator2 (*this, rank, i, j, itv, it);
                         j = zero_based (*it);
@@ -3146,7 +3146,7 @@
                         ++ j;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == index2_data_.begin () + zero_based (*itv))
                             return iterator2 (*this, rank, i, j, itv, it);
                         j = zero_based (*(it - 1));
@@ -3187,7 +3187,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             const_iterator1 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     ++ it_;
                 else {
                     i_ = index1 () + 1;
@@ -3198,7 +3198,7 @@
             }
             BOOST_UBLAS_INLINE
             const_iterator1 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     -- it_;
                 else {
                     i_ = index1 () - 1;
@@ -3258,8 +3258,8 @@
             size_type index1 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index1 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
                 } else {
                     return i_;
                 }
@@ -3267,8 +3267,8 @@
             BOOST_UBLAS_INLINE
             size_type index2 () const {
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index2 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
                 } else {
                     return j_;
                 }
@@ -3339,7 +3339,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             iterator1 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     ++ it_;
                 else {
                     i_ = index1 () + 1;
@@ -3350,7 +3350,7 @@
             }
             BOOST_UBLAS_INLINE
             iterator1 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     -- it_;
                 else {
                     i_ = index1 () - 1;
@@ -3410,8 +3410,8 @@
             size_type index1 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index1 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
                 } else {
                     return i_;
                 }
@@ -3419,8 +3419,8 @@
             BOOST_UBLAS_INLINE
             size_type index2 () const {
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index2 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
                 } else {
                     return j_;
                 }
@@ -3496,7 +3496,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             const_iterator2 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     ++ it_;
                 else {
                     j_ = index2 () + 1;
@@ -3507,7 +3507,7 @@
             }
             BOOST_UBLAS_INLINE
             const_iterator2 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     -- it_;
                 else {
                     j_ = index2 () - 1;
@@ -3566,8 +3566,8 @@
             BOOST_UBLAS_INLINE
             size_type index1 () const {
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index1 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
                 } else {
                     return i_;
                 }
@@ -3576,8 +3576,8 @@
             size_type index2 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index2 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
                 } else {
                     return j_;
                 }
@@ -3648,7 +3648,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             iterator2 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     ++ it_;
                 else {
                     j_ = index2 () + 1;
@@ -3659,7 +3659,7 @@
             }
             BOOST_UBLAS_INLINE
             iterator2 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     -- it_;
                 else {
                     j_ = index2 ();
@@ -3718,8 +3718,8 @@
             BOOST_UBLAS_INLINE
             size_type index1 () const {
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index1 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
                 } else {
                     return i_;
                 }
@@ -3728,8 +3728,8 @@
             size_type index2 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index2 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_));
                 } else {
                     return j_;
                 }
@@ -3818,10 +3818,10 @@
 
     private:
         void storage_invariants () const {
-            BOOST_UBLAS_CHECK (layout_type::size_M (size1_, size2_) + 1 == index1_data_.size (), internal_logic ());
+            BOOST_UBLAS_CHECK (layout_type::size1 (size1_, size2_) + 1 == index1_data_.size (), internal_logic ());
             BOOST_UBLAS_CHECK (capacity_ == index2_data_.size (), internal_logic ());
             BOOST_UBLAS_CHECK (capacity_ == value_data_.size (), internal_logic ());
-            BOOST_UBLAS_CHECK (filled1_ > 0 && filled1_ <= layout_type::size_M (size1_, size2_) + 1, internal_logic ());
+            BOOST_UBLAS_CHECK (filled1_ > 0 && filled1_ <= layout_type::size1 (size1_, size2_) + 1, internal_logic ());
             BOOST_UBLAS_CHECK (filled2_ <= capacity_, internal_logic ());
             BOOST_UBLAS_CHECK (index1_data_ [filled1_ - 1] == k_based (filled2_), internal_logic ());
         }
@@ -4046,8 +4046,8 @@
         BOOST_UBLAS_INLINE
         const_pointer find_element (size_type i, size_type j) const {
             sort ();
-            size_type element1 (layout_type::index_M (i, j));
-            size_type element2 (layout_type::index_m (i, j));
+            size_type element1 (layout_type::element1 (i, size1_, j, size2_));
+            size_type element2 (layout_type::element2 (i, size1_, j, size2_));
             vector_const_subiterator_type itv_begin (detail::lower_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (element1), std::less<size_type> ()));
             vector_const_subiterator_type itv_end (detail::upper_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (element1), std::less<size_type> ()));
             if (itv_begin == itv_end)
@@ -4088,8 +4088,8 @@
             if (filled_ >= capacity_)
                 reserve (2 * filled_, true);
             BOOST_UBLAS_CHECK (filled_ < capacity_, internal_logic ());
-            size_type element1 = layout_type::index_M (i, j);
-            size_type element2 = layout_type::index_m (i, j);
+            size_type element1 = layout_type::element1 (i, size1_, j, size2_);
+            size_type element2 = layout_type::element2 (i, size1_, j, size2_);
             index1_data_ [filled_] = k_based (element1);
             index2_data_ [filled_] = k_based (element2);
             value_data_ [filled_] = t;
@@ -4105,8 +4105,8 @@
         }
         BOOST_UBLAS_INLINE
         void erase_element (size_type i, size_type j) {
-            size_type element1 = layout_type::index_M (i, j);
-            size_type element2 = layout_type::index_m (i, j);
+            size_type element1 = layout_type::element1 (i, size1_, j, size2_);
+            size_type element2 = layout_type::element2 (i, size1_, j, size2_);
             sort ();
             vector_subiterator_type itv_begin (detail::lower_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (element1), std::less<size_type> ()));
             vector_subiterator_type itv_end (detail::upper_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (element1), std::less<size_type> ()));
@@ -4285,8 +4285,8 @@
         // Back element insertion and erasure
         BOOST_UBLAS_INLINE
         void push_back (size_type i, size_type j, const_reference t) {
-            size_type element1 = layout_type::index_M (i, j);
-            size_type element2 = layout_type::index_m (i, j);
+            size_type element1 = layout_type::element1 (i, size1_, j, size2_);
+            size_type element2 = layout_type::element2 (i, size1_, j, size2_);
             // must maintain sort order
             BOOST_UBLAS_CHECK (sorted_ && 
                     (filled_ == 0 ||
@@ -4343,8 +4343,8 @@
         const_iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) const {
             sort ();
             for (;;) {
-                size_type address1 (layout_type::index_M (i, j));
-                size_type address2 (layout_type::index_m (i, j));
+                size_type address1 (layout_type::address1 (i, size1_, j, size2_));
+                size_type address2 (layout_type::address2 (i, size1_, j, size2_));
                 vector_const_subiterator_type itv_begin (detail::lower_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less<size_type> ()));
                 vector_const_subiterator_type itv_end (detail::upper_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less<size_type> ()));
 
@@ -4358,7 +4358,7 @@
                 if (it != it_end && zero_based (*it) == address2)
                     return const_iterator1 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == it_end)
                             return const_iterator1 (*this, rank, i, j, itv, it);
                         i = zero_based (*it);
@@ -4368,7 +4368,7 @@
                         ++ i;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == index2_data_.begin () + zero_based (*itv))
                             return const_iterator1 (*this, rank, i, j, itv, it);
                         i = zero_based (*(it - 1));
@@ -4384,8 +4384,8 @@
         iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) {
             sort ();
             for (;;) {
-                size_type address1 (layout_type::index_M (i, j));
-                size_type address2 (layout_type::index_m (i, j));
+                size_type address1 (layout_type::address1 (i, size1_, j, size2_));
+                size_type address2 (layout_type::address2 (i, size1_, j, size2_));
                 vector_subiterator_type itv_begin (detail::lower_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less<size_type> ()));
                 vector_subiterator_type itv_end (detail::upper_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less<size_type> ()));
 
@@ -4399,7 +4399,7 @@
                 if (it != it_end && zero_based (*it) == address2)
                     return iterator1 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == it_end)
                             return iterator1 (*this, rank, i, j, itv, it);
                         i = zero_based (*it);
@@ -4409,7 +4409,7 @@
                         ++ i;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == index2_data_.begin () + zero_based (*itv))
                             return iterator1 (*this, rank, i, j, itv, it);
                         i = zero_based (*(it - 1));
@@ -4425,8 +4425,8 @@
         const_iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) const {
             sort ();
             for (;;) {
-                size_type address1 (layout_type::index_M (i, j));
-                size_type address2 (layout_type::index_m (i, j));
+                size_type address1 (layout_type::address1 (i, size1_, j, size2_));
+                size_type address2 (layout_type::address2 (i, size1_, j, size2_));
                 vector_const_subiterator_type itv_begin (detail::lower_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less<size_type> ()));
                 vector_const_subiterator_type itv_end (detail::upper_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less<size_type> ()));
 
@@ -4440,7 +4440,7 @@
                 if (it != it_end && zero_based (*it) == address2)
                     return const_iterator2 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == it_end)
                             return const_iterator2 (*this, rank, i, j, itv, it);
                         j = zero_based (*it);
@@ -4450,7 +4450,7 @@
                         ++ j;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == index2_data_.begin () + zero_based (*itv))
                             return const_iterator2 (*this, rank, i, j, itv, it);
                         j = zero_based (*(it - 1));
@@ -4466,8 +4466,8 @@
         iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) {
             sort ();
             for (;;) {
-                size_type address1 (layout_type::index_M (i, j));
-                size_type address2 (layout_type::index_m (i, j));
+                size_type address1 (layout_type::address1 (i, size1_, j, size2_));
+                size_type address2 (layout_type::address2 (i, size1_, j, size2_));
                 vector_subiterator_type itv_begin (detail::lower_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less<size_type> ()));
                 vector_subiterator_type itv_end (detail::upper_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less<size_type> ()));
 
@@ -4481,7 +4481,7 @@
                 if (it != it_end && zero_based (*it) == address2)
                     return iterator2 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == it_end)
                             return iterator2 (*this, rank, i, j, itv, it);
                         j = zero_based (*it);
@@ -4491,7 +4491,7 @@
                         ++ j;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == index2_data_.begin () + zero_based (*itv))
                             return iterator2 (*this, rank, i, j, itv, it);
                         j = zero_based (*(it - 1));
@@ -4532,7 +4532,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             const_iterator1 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     ++ it_;
                 else {
                     i_ = index1 () + 1;
@@ -4543,7 +4543,7 @@
             }
             BOOST_UBLAS_INLINE
             const_iterator1 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     -- it_;
                 else {
                     i_ = index1 () - 1;
@@ -4603,8 +4603,8 @@
             size_type index1 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index1 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
                 } else {
                     return i_;
                 }
@@ -4612,8 +4612,8 @@
             BOOST_UBLAS_INLINE
             size_type index2 () const {
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index2 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
                 } else {
                     return j_;
                 }
@@ -4684,7 +4684,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             iterator1 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     ++ it_;
                 else {
                     i_ = index1 () + 1;
@@ -4695,7 +4695,7 @@
             }
             BOOST_UBLAS_INLINE
             iterator1 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     -- it_;
                 else {
                     i_ = index1 () - 1;
@@ -4755,8 +4755,8 @@
             size_type index1 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index1 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
                 } else {
                     return i_;
                 }
@@ -4764,8 +4764,8 @@
             BOOST_UBLAS_INLINE
             size_type index2 () const {
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index2 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
                 } else {
                     return j_;
                 }
@@ -4841,7 +4841,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             const_iterator2 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     ++ it_;
                 else {
                     j_ = index2 () + 1;
@@ -4852,7 +4852,7 @@
             }
             BOOST_UBLAS_INLINE
             const_iterator2 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     -- it_;
                 else {
                     j_ = index2 () - 1;
@@ -4911,8 +4911,8 @@
             BOOST_UBLAS_INLINE
             size_type index1 () const {
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index1 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
                 } else {
                     return i_;
                 }
@@ -4921,8 +4921,8 @@
             size_type index2 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index2 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
                 } else {
                     return j_;
                 }
@@ -4993,7 +4993,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             iterator2 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     ++ it_;
                 else {
                     j_ = index2 () + 1;
@@ -5004,7 +5004,7 @@
             }
             BOOST_UBLAS_INLINE
             iterator2 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     -- it_;
                 else {
                     j_ = index2 ();
@@ -5063,8 +5063,8 @@
             BOOST_UBLAS_INLINE
             size_type index1 () const {
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index1 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
                 } else {
                     return i_;
                 }
@@ -5073,8 +5073,8 @@
             size_type index2 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
+                    BOOST_UBLAS_CHECK (layout_type::index2 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_));
                 } else {
                     return j_;
                 }

Modified: boost/trunk/boost/numeric/ublas/operation_sparse.hpp
===================================================================
--- boost/trunk/boost/numeric/ublas/operation_sparse.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/numeric/ublas/operation_sparse.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -41,6 +41,12 @@
         // ISSUE why is there a dense vector here?
         vector<value_type> temporary (e2 ().size2 ());
         temporary.clear ();
+#if BOOST_UBLAS_TYPE_CHECK
+        matrix<value_type, row_major> cm (m.size1 (), m.size2 ());
+        typedef typename type_traits<value_type>::real_type real_type;
+        real_type merrorbound (norm_1 (m) + norm_1 (e1) * norm_1 (e2));
+        indexing_matrix_assign<scalar_assign> (cm, prod (e1, e2), row_major_tag ());
+#endif
         typename expression1_type::const_iterator1 it1 (e1 ().begin1 ());
         typename expression1_type::const_iterator1 it1_end (e1 ().end1 ());
         while (it1 != it1_end) {
@@ -80,6 +86,9 @@
             }
             ++ it1;
         }
+#if BOOST_UBLAS_TYPE_CHECK
+        BOOST_UBLAS_CHECK (norm_1 (m - cm) <= 2 * std::numeric_limits<real_type>::epsilon () * merrorbound, internal_logic ());
+#endif
         return m;
     }
 
@@ -100,6 +109,12 @@
         // ISSUE why is there a dense vector here?
         vector<value_type> temporary (e1 ().size1 ());
         temporary.clear ();
+#if BOOST_UBLAS_TYPE_CHECK
+        matrix<value_type, column_major> cm (m.size1 (), m.size2 ());
+        typedef typename type_traits<value_type>::real_type real_type;
+        real_type merrorbound (norm_1 (m) + norm_1 (e1) * norm_1 (e2));
+        indexing_matrix_assign<scalar_assign> (cm, prod (e1, e2), column_major_tag ());
+#endif
         typename expression2_type::const_iterator2 it2 (e2 ().begin2 ());
         typename expression2_type::const_iterator2 it2_end (e2 ().end2 ());
         while (it2 != it2_end) {
@@ -139,6 +154,9 @@
             }
             ++ it2;
         }
+#if BOOST_UBLAS_TYPE_CHECK
+        BOOST_UBLAS_CHECK (norm_1 (m - cm) <= 2 * std::numeric_limits<real_type>::epsilon () * merrorbound, internal_logic ());
+#endif
         return m;
     }
 

Modified: boost/trunk/boost/numeric/ublas/vector.hpp
===================================================================
--- boost/trunk/boost/numeric/ublas/vector.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/numeric/ublas/vector.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -989,7 +989,6 @@
         typedef const T &const_reference;
         typedef T &reference;
         typedef const vector_reference<const self_type> const_closure_type;
-        typedef vector_reference<self_type> closure_type;
         typedef dense_tag storage_category;
 
         // Construction and destruction

Modified: boost/trunk/boost/numeric/ublas/vector_expression.hpp
===================================================================
--- boost/trunk/boost/numeric/ublas/vector_expression.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/numeric/ublas/vector_expression.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -43,14 +43,14 @@
         typedef typename boost::mpl::if_<boost::is_const<E>,
                                           typename E::const_reference,
                                           typename E::reference>::type reference;
-        typedef E refered_type;
+        typedef E referred_type;
         typedef const self_type const_closure_type;
         typedef self_type closure_type;
         typedef typename E::storage_category storage_category;
 
         // Construction and destruction
         BOOST_UBLAS_INLINE
-        explicit vector_reference (refered_type &e):
+        explicit vector_reference (referred_type &e):
             e_ (e) {}
 
         // Accessors
@@ -62,11 +62,11 @@
     public:
         // Expression accessors - const correct
         BOOST_UBLAS_INLINE
-        const refered_type &expression () const {
+        const referred_type &expression () const {
             return e_;
         }
         BOOST_UBLAS_INLINE
-        refered_type &expression () {
+        referred_type &expression () {
             return e_;
         }
 
@@ -227,7 +227,7 @@
         }
 
     private:
-        refered_type &e_;
+        referred_type &e_;
     };
 
 

Modified: boost/trunk/boost/numeric/ublas/vector_of_vector.hpp
===================================================================
--- boost/trunk/boost/numeric/ublas/vector_of_vector.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/numeric/ublas/vector_of_vector.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -64,7 +64,7 @@
         generalized_vector_of_vector ():
             matrix_container<self_type> (),
             size1_ (0), size2_ (0), data_ (1) {
-            const size_type sizeM = layout_type::size_M (size1_, size2_);
+            const size_type sizeM = layout_type::size1 (size1_, size2_);
              // create size1+1 empty vector elements
             data_.insert_element (sizeM, vector_data_value_type ());
             storage_invariants ();
@@ -72,9 +72,9 @@
         BOOST_UBLAS_INLINE
         generalized_vector_of_vector (size_type size1, size_type size2, size_type non_zeros = 0):
             matrix_container<self_type> (),
-            size1_ (size1), size2_ (size2), data_ (layout_type::size_M (size1_, size2_) + 1) {
-            const size_type sizeM = layout_type::size_M (size1_, size2_);
-            const size_type sizem = layout_type::size_m (size1_, size2_);
+            size1_ (size1), size2_ (size2), data_ (layout_type::size1 (size1_, size2_) + 1) {
+            const size_type sizeM = layout_type::size1 (size1_, size2_);
+            const size_type sizem = layout_type::size2 (size1_, size2_);
             for (size_type i = 0; i < sizeM; ++ i) // create size1 vector elements
                 data_.insert_element (i, vector_data_value_type ()) .resize (sizem, false);
             data_.insert_element (sizeM, vector_data_value_type ());
@@ -90,9 +90,9 @@
         BOOST_UBLAS_INLINE
         generalized_vector_of_vector (const matrix_expression<AE> &ae, size_type non_zeros = 0):
             matrix_container<self_type> (),
-            size1_ (ae ().size1 ()), size2_ (ae ().size2 ()), data_ (layout_type::size_M (size1_, size2_) + 1) {
-            const size_type sizeM = layout_type::size_M (size1_, size2_);
-            const size_type sizem = layout_type::size_m (size1_, size2_);
+            size1_ (ae ().size1 ()), size2_ (ae ().size2 ()), data_ (layout_type::size1 (size1_, size2_) + 1) {
+            const size_type sizeM = layout_type::size1 (size1_, size2_);
+            const size_type sizem = layout_type::size2 (size1_, size2_);
             for (size_type i = 0; i < sizeM; ++ i) // create size1 vector elements
                 data_.insert_element (i, vector_data_value_type ()) .resize (sizem, false);
             data_.insert_element (sizeM, vector_data_value_type ());
@@ -130,11 +130,11 @@
         // Resizing
         BOOST_UBLAS_INLINE
         void resize (size_type size1, size_type size2, bool preserve = true) {
-            const size_type oldM = layout_type::size_M (size1_, size2_);
+            const size_type oldM = layout_type::size1 (size1_, size2_);
             size1_ = size1;
             size2_ = size2;
-            const size_type sizeM = layout_type::size_M (size1_, size2_);
-            const size_type sizem = layout_type::size_m (size1_, size2_);
+            const size_type sizeM = layout_type::size1 (size1_, size2_);
+            const size_type sizem = layout_type::size2 (size1_, size2_);
             data ().resize (sizeM + 1, preserve);
             if (preserve) {
                 for (size_type i = 0; (i <= oldM) && (i < sizeM); ++ i)
@@ -161,8 +161,8 @@
         }
         BOOST_UBLAS_INLINE
         const_pointer find_element (size_type i, size_type j) const {
-            const size_type elementM = layout_type::index_M (i, j);
-            const size_type elementm = layout_type::index_m (i, j);
+            const size_type elementM = layout_type::element1 (i, size1_, j, size2_);
+            const size_type elementm = layout_type::element2 (i, size1_, j, size2_);
             // optimise: check the storage_type and index directly if element always exists
             if (boost::is_convertible<typename array_type::storage_category, packed_tag>::value) {
                 return & (data () [elementM] [elementm]);
@@ -293,31 +293,31 @@
         // Element insertion and erasure
         BOOST_UBLAS_INLINE
         true_reference insert_element (size_type i, size_type j, const_reference t) {
-            const size_type elementM = layout_type::index_M (i, j);
-            const size_type elementm = layout_type::index_m (i, j);
+            const size_type elementM = layout_type::element1 (i, size1_, j, size2_);
+            const size_type elementm = layout_type::element2 (i, size1_, j, size2_);
             vector_data_value_type& vd (ref (data () [elementM]));
             storage_invariants ();
             return vd.insert_element (elementm, t);
         }
         BOOST_UBLAS_INLINE
         void append_element (size_type i, size_type j, const_reference t) {
-            const size_type elementM = layout_type::index_M (i, j);
-            const size_type elementm = layout_type::index_m (i, j);
+            const size_type elementM = layout_type::element1 (i, size1_, j, size2_);
+            const size_type elementm = layout_type::element2 (i, size1_, j, size2_);
             vector_data_value_type& vd (ref (data () [elementM]));
             storage_invariants ();
             return vd.append_element (elementm, t);
         }
         BOOST_UBLAS_INLINE
         void erase_element (size_type i, size_type j) {
-            vectoriterator_type itv (data ().find (layout_type::index_M (i, j)));
+            vectoriterator_type itv (data ().find (layout_type::element1 (i, size1_, j, size2_)));
             if (itv == data ().end ())
                 return;
-            (*itv).erase_element (layout_type::index_m (i, j));
+            (*itv).erase_element (layout_type::element2 (i, size1_, j, size2_));
             storage_invariants ();
         }
         BOOST_UBLAS_INLINE
         void clear () {
-            const size_type sizeM = layout_type::size_M (size1_, size2_);
+            const size_type sizeM = layout_type::size1 (size1_, size2_);
             // FIXME should clear data () if this is done via value_type/*zero*/() then it is not size preserving
             for (size_type i = 0; i < sizeM; ++ i)
                 ref (data () [i]).clear ();
@@ -334,7 +334,7 @@
 
         BOOST_UBLAS_INLINE
         true_reference at_element (size_type i, size_type j) {
-            return ref (ref (data () [layout_type::index_M (i, j)]) [layout_type::index_m (i, j)]);
+            return ref (ref (data () [layout_type::element1 (i, size1_, j, size2_)]) [layout_type::element2 (i, size1_, j, size2_)]);
         }
 
     public:
@@ -351,19 +351,19 @@
         // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.    
         const_iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) const {
             for (;;) {
-                const_vectoriterator_type itv (data ().find (layout_type::index_M (i, j)));
+                const_vectoriterator_type itv (data ().find (layout_type::address1 (i, size1_, j, size2_)));
                 const_vectoriterator_type itv_end (data ().end ());
                 if (itv == itv_end)
                     return const_iterator1 (*this, rank, i, j, itv_end, (*(-- itv)).end ());
 
-                const_subiterator_type it ((*itv).find (layout_type::index_m (i, j)));
+                const_subiterator_type it ((*itv).find (layout_type::address2 (i, size1_, j, size2_)));
                 const_subiterator_type it_end ((*itv).end ());
                 if (rank == 0)
                     return const_iterator1 (*this, rank, i, j, itv, it);
-                if (it != it_end && it.index () == layout_type::index_m (i, j))
+                if (it != it_end && it.index () == layout_type::address2 (i, size1_, j, size2_))
                     return const_iterator1 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == it_end)
                             return const_iterator1 (*this, rank, i, j, itv, it);
                         i = it.index ();
@@ -373,7 +373,7 @@
                         ++ i;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == (*itv).begin ())
                             return const_iterator1 (*this, rank, i, j, itv, it);
                         --it;
@@ -389,19 +389,19 @@
         // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.    
         iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) {
             for (;;) {
-                vectoriterator_type itv (data ().find (layout_type::index_M (i, j)));
+                vectoriterator_type itv (data ().find (layout_type::address1 (i, size1_, j, size2_)));
                 vectoriterator_type itv_end (data ().end ());
                 if (itv == itv_end)
                     return iterator1 (*this, rank, i, j, itv_end, (*(-- itv)).end ());
 
-                subiterator_type it ((*itv).find (layout_type::index_m (i, j)));
+                subiterator_type it ((*itv).find (layout_type::address2 (i, size1_, j, size2_)));
                 subiterator_type it_end ((*itv).end ());
                 if (rank == 0)
                     return iterator1 (*this, rank, i, j, itv, it);
-                if (it != it_end && it.index () == layout_type::index_m (i, j))
+                if (it != it_end && it.index () == layout_type::address2 (i, size1_, j, size2_))
                     return iterator1 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == it_end)
                             return iterator1 (*this, rank, i, j, itv, it);
                         i = it.index ();
@@ -411,7 +411,7 @@
                         ++ i;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_i ()) {
+                    if (layout_type::fast1 ()) {
                         if (it == (*itv).begin ())
                             return iterator1 (*this, rank, i, j, itv, it);
                         --it;
@@ -427,19 +427,19 @@
         // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.    
         const_iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) const {
             for (;;) {
-                const_vectoriterator_type itv (data ().find (layout_type::index_M (i, j)));
+                const_vectoriterator_type itv (data ().find (layout_type::address1 (i, size1_, j, size2_)));
                 const_vectoriterator_type itv_end (data ().end ());
                 if (itv == itv_end)
                     return const_iterator2 (*this, rank, i, j, itv_end, (*(-- itv)).end ());
 
-                const_subiterator_type it ((*itv).find (layout_type::index_m (i, j)));
+                const_subiterator_type it ((*itv).find (layout_type::address2 (i, size1_, j, size2_)));
                 const_subiterator_type it_end ((*itv).end ());
                 if (rank == 0)
                     return const_iterator2 (*this, rank, i, j, itv, it);
-                if (it != it_end && it.index () == layout_type::index_m (i, j))
+                if (it != it_end && it.index () == layout_type::address2 (i, size1_, j, size2_))
                     return const_iterator2 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == it_end)
                             return const_iterator2 (*this, rank, i, j, itv, it);
                         j = it.index ();
@@ -449,7 +449,7 @@
                         ++ j;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == (*itv).begin ())
                             return const_iterator2 (*this, rank, i, j, itv, it);
                         --it;
@@ -465,19 +465,19 @@
         // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.    
         iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) {
             for (;;) {
-                vectoriterator_type itv (data ().find (layout_type::index_M (i, j)));
+                vectoriterator_type itv (data ().find (layout_type::address1 (i, size1_, j, size2_)));
                 vectoriterator_type itv_end (data ().end ());
                 if (itv == itv_end)
                     return iterator2 (*this, rank, i, j, itv_end, (*(-- itv)).end ());
 
-                subiterator_type it ((*itv).find (layout_type::index_m (i, j)));
+                subiterator_type it ((*itv).find (layout_type::address2 (i, size1_, j, size2_)));
                 subiterator_type it_end ((*itv).end ());
                 if (rank == 0)
                     return iterator2 (*this, rank, i, j, itv, it);
-                if (it != it_end && it.index () == layout_type::index_m (i, j))
+                if (it != it_end && it.index () == layout_type::address2 (i, size1_, j, size2_))
                     return iterator2 (*this, rank, i, j, itv, it);
                 if (direction > 0) {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == it_end)
                             return iterator2 (*this, rank, i, j, itv, it);
                         j = it.index ();
@@ -487,7 +487,7 @@
                         ++ j;
                     }
                 } else /* if (direction < 0)  */ {
-                    if (layout_type::fast_j ()) {
+                    if (layout_type::fast2 ()) {
                         if (it == (*itv).begin ())
                             return iterator2 (*this, rank, i, j, itv, it);
                         --it;
@@ -529,7 +529,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             const_iterator1 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     ++ it_;
                 else {
                     const self_type &m = (*this) ();
@@ -546,7 +546,7 @@
             }
             BOOST_UBLAS_INLINE
             const_iterator1 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     -- it_;
                 else {
                     const self_type &m = (*this) ();
@@ -612,8 +612,8 @@
             size_type index1 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M (itv_.index (), it_.index ()) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M (itv_.index (), it_.index ());
+                    BOOST_UBLAS_CHECK (layout_type::index1 (itv_.index (), it_.index ()) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 (itv_.index (), it_.index ());
                 } else {
                     return i_;
                 }
@@ -622,8 +622,8 @@
             size_type index2 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m (itv_.index (), it_.index ()) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m (itv_.index (), it_.index ());
+                    BOOST_UBLAS_CHECK (layout_type::index2 (itv_.index (), it_.index ()) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 (itv_.index (), it_.index ());
                 } else {
                     return j_;
                 }
@@ -694,7 +694,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             iterator1 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     ++ it_;
                 else {
                     self_type &m = (*this) ();
@@ -711,7 +711,7 @@
             }
             BOOST_UBLAS_INLINE
             iterator1 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_i ())
+                if (rank_ == 1 && layout_type::fast1 ())
                     -- it_;
                 else {
                     self_type &m = (*this) ();
@@ -777,8 +777,8 @@
             size_type index1 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M (itv_.index (), it_.index ()) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M (itv_.index (), it_.index ());
+                    BOOST_UBLAS_CHECK (layout_type::index1 (itv_.index (), it_.index ()) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 (itv_.index (), it_.index ());
                 } else {
                     return i_;
                 }
@@ -787,8 +787,8 @@
             size_type index2 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m (itv_.index (), it_.index ()) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m (itv_.index (), it_.index ());
+                    BOOST_UBLAS_CHECK (layout_type::index2 (itv_.index (), it_.index ()) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 (itv_.index (), it_.index ());
                 } else {
                     return j_;
                 }
@@ -864,7 +864,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             const_iterator2 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     ++ it_;
                 else {
                     const self_type &m = (*this) ();
@@ -881,7 +881,7 @@
             }
             BOOST_UBLAS_INLINE
             const_iterator2 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     -- it_;
                 else {
                     const self_type &m = (*this) ();
@@ -947,8 +947,8 @@
             size_type index1 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M (itv_.index (), it_.index ()) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M (itv_.index (), it_.index ());
+                    BOOST_UBLAS_CHECK (layout_type::index1 (itv_.index (), it_.index ()) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 (itv_.index (), it_.index ());
                 } else {
                     return i_;
                 }
@@ -957,8 +957,8 @@
             size_type index2 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m (itv_.index (), it_.index ()) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m (itv_.index (), it_.index ());
+                    BOOST_UBLAS_CHECK (layout_type::index2 (itv_.index (), it_.index ()) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 (itv_.index (), it_.index ());
                 } else {
                     return j_;
                 }
@@ -1029,7 +1029,7 @@
             // Arithmetic
             BOOST_UBLAS_INLINE
             iterator2 &operator ++ () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     ++ it_;
                 else {
                     self_type &m = (*this) ();
@@ -1046,7 +1046,7 @@
             }
             BOOST_UBLAS_INLINE
             iterator2 &operator -- () {
-                if (rank_ == 1 && layout_type::fast_j ())
+                if (rank_ == 1 && layout_type::fast2 ())
                     -- it_;
                 else {
                     self_type &m = (*this) ();
@@ -1112,8 +1112,8 @@
             size_type index1 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_M (itv_.index (), it_.index ()) < (*this) ().size1 (), bad_index ());
-                    return layout_type::index_M (itv_.index (), it_.index ());
+                    BOOST_UBLAS_CHECK (layout_type::index1 (itv_.index (), it_.index ()) < (*this) ().size1 (), bad_index ());
+                    return layout_type::index1 (itv_.index (), it_.index ());
                 } else {
                     return i_;
                 }
@@ -1122,8 +1122,8 @@
             size_type index2 () const {
                 BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ());
                 if (rank_ == 1) {
-                    BOOST_UBLAS_CHECK (layout_type::index_m (itv_.index (), it_.index ()) < (*this) ().size2 (), bad_index ());
-                    return layout_type::index_m (itv_.index (), it_.index ());
+                    BOOST_UBLAS_CHECK (layout_type::index2 (itv_.index (), it_.index ()) < (*this) ().size2 (), bad_index ());
+                    return layout_type::index2 (itv_.index (), it_.index ());
                 } else {
                     return j_;
                 }
@@ -1213,7 +1213,7 @@
     private:
         void storage_invariants () const
         {
-            BOOST_UBLAS_CHECK (layout_type::size_M (size1_, size2_) + 1 == data_.size (), internal_logic ());
+            BOOST_UBLAS_CHECK (layout_type::size1 (size1_, size2_) + 1 == data_.size (), internal_logic ());
             BOOST_UBLAS_CHECK (data ().begin () != data ().end (), internal_logic ());
 
         }

Modified: boost/trunk/boost/optional/optional.hpp
===================================================================
--- boost/trunk/boost/optional/optional.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/optional/optional.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -133,7 +133,11 @@
 {
   private :
 
-    typedef BOOST_DEDUCED_TYPENAME detail::make_reference_content<T>::type internal_type ;
+    typedef
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+    BOOST_DEDUCED_TYPENAME
+#endif 
+    ::boost::detail::make_reference_content<T>::type internal_type ;
 
     typedef aligned_storage<internal_type> storage_type ;
 

Modified: boost/trunk/boost/parameter/aux_/arg_list.hpp
===================================================================
--- boost/trunk/boost/parameter/aux_/arg_list.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/parameter/aux_/arg_list.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,6 +32,9 @@
 
 namespace aux {
 
+// Tag type passed to MPL lambda.
+struct lambda_tag;
+
 //
 // Structures used to build the tuple of actual arguments.  The
 // tuple is a nested cons-style list of arg_list specializations
@@ -67,7 +70,7 @@
     // lookup given that default
     struct binding
     {
-        template<class KW, class Default>
+        template<class KW, class Default, class Reference>
         struct apply
         {
             typedef Default type;
@@ -137,9 +140,9 @@
     // was found if we match this overload, so unless that parameter
     // has a default, we indicate that the actual arguments don't
     // match the function's requirements.
-    template <class ParameterRequirements>
+    template <class ParameterRequirements, class ArgPack>
     static typename ParameterRequirements::has_default
-    satisfies(ParameterRequirements*);
+    satisfies(ParameterRequirements*, ArgPack*);
 
     // MPL sequence support
     typedef empty_arg_list type;   // convenience
@@ -221,13 +224,13 @@
     // lookup given that default
     struct binding
     {
-        template <class KW, class Default>
+        template <class KW, class Default, class Reference>
         struct apply
         {
           typedef typename mpl::eval_if<
                 boost::is_same<KW, key_type>
-              , mpl::identity<reference>
-              , mpl::apply_wrap2<typename Next::binding, KW, Default>
+              , mpl::if_<Reference, reference, value_type>
+              , mpl::apply_wrap3<typename Next::binding, KW, Default, Reference>
           >::type type;
         };
     };
@@ -297,7 +300,7 @@
     // Outer indexing operators that dispatch to the right node's
     // get() function.
     template <class KW>
-    typename mpl::apply_wrap2<binding, KW, void_>::type
+    typename mpl::apply_wrap3<binding, KW, void_, mpl::true_>::type
     operator[](keyword<KW> const& x) const
     {
         typename mpl::apply_wrap1<key_owner, KW>::type const& sublist = *this;
@@ -305,7 +308,7 @@
     }
 
     template <class KW, class Default>
-    typename mpl::apply_wrap2<binding, KW, Default&>::type
+    typename mpl::apply_wrap3<binding, KW, Default&, mpl::true_>::type
     operator[](default_<KW, Default> x) const
     {
         typename mpl::apply_wrap1<key_owner, KW>::type const& sublist = *this;
@@ -313,9 +316,10 @@
     }
 
     template <class KW, class F>
-    typename mpl::apply_wrap2<
+    typename mpl::apply_wrap3<
         binding,KW
       , typename result_of0<F>::type
+      , mpl::true_
     >::type
     operator[](lazy_default<KW,F> x) const
     {
@@ -381,10 +385,14 @@
     // compile-time computation and never really called, so a
     // declaration is enough.
     //
-    template <class HasDefault, class Predicate>
-    static typename mpl::apply1<Predicate, value_type>::type
+    template <class HasDefault, class Predicate, class ArgPack>
+    static typename mpl::apply_wrap2<
+        typename mpl::lambda<Predicate, lambda_tag>::type
+      , value_type, ArgPack
+    >::type
     satisfies(
         parameter_requirements<key_type,Predicate,HasDefault>*
+      , ArgPack*
     );
 
     // Builds an overload set including satisfies functions defined

Copied: boost/trunk/boost/parameter/aux_/cast.hpp (from rev 14034, boost/branches/upstream/current/boost/parameter/aux_/cast.hpp)

Modified: boost/trunk/boost/parameter/aux_/maybe.hpp
===================================================================
--- boost/trunk/boost/parameter/aux_/maybe.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/parameter/aux_/maybe.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,9 +9,10 @@
 # include <boost/mpl/identity.hpp>
 # include <boost/type_traits/is_reference.hpp>
 # include <boost/type_traits/add_reference.hpp>
-# include <boost/type_traits/add_const.hpp>
 # include <boost/optional.hpp>
 # include <boost/python/detail/referent_storage.hpp>
+# include <boost/type_traits/remove_cv.hpp>
+# include <boost/type_traits/add_const.hpp>
 
 namespace boost { namespace parameter { namespace aux {
 
@@ -20,14 +21,18 @@
 template <class T>
 struct maybe : maybe_base
 {
-    typedef typename mpl::if_<
-        is_reference<T>
-      , T
-      , typename add_reference<
-            typename add_const<T>::type
-        >::type
+    typedef typename add_reference<
+# if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+        T const
+# else 
+        typename add_const<T>::type
+# endif 
     >::type reference;
-
+    
+    typedef typename remove_cv<
+        BOOST_DEDUCED_TYPENAME remove_reference<reference>::type
+    >::type non_cv_value;
+        
     explicit maybe(T value)
       : value(value)
       , constructed(false)
@@ -40,7 +45,7 @@
     ~maybe()
     {
         if (constructed)
-            destroy((void(*)(reference))0);
+            this->destroy();
     }
 
     reference construct(reference value) const
@@ -48,24 +53,23 @@
         return value;
     }
 
-    template <class U, class V>
-    reference construct(U const& value, void(*)(V&)) const
+    template <class U>
+    reference construct2(U const& value) const
     {
-        new (m_storage.bytes) V(value);
+        new (m_storage.bytes) non_cv_value(value);
         constructed = true;
-        return *(V*)m_storage.bytes;
+        return *(non_cv_value*)m_storage.bytes;
     }
 
     template <class U>
     reference construct(U const& value) const
     {
-        return construct(value, (void(*)(reference))0);
+        return this->construct2(value);
     }
 
-    template <class U>
-    void destroy(void(*)(U&))
+    void destroy()
     {
-        ((U*)m_storage.bytes)->~U();
+        ((non_cv_value*)m_storage.bytes)->~non_cv_value();
     }
 
     typedef reference(maybe<T>::*safe_bool)() const;

Modified: boost/trunk/boost/parameter/aux_/overloads.hpp
===================================================================
--- boost/trunk/boost/parameter/aux_/overloads.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/parameter/aux_/overloads.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -44,26 +44,37 @@
 #define N BOOST_PP_ITERATION()
 
 #define BOOST_PARAMETER_open_list(z, n, text) \
-    aux::make_arg_list< \
-        BOOST_PP_CAT(PS, n), BOOST_PP_CAT(A, n), aux::tag_keyword_arg
+    aux::item< \
+        BOOST_PP_CAT(PS, n), BOOST_PP_CAT(A, n)
 
 #define BOOST_PARAMETER_close_list(z, n, text) > 
 
 #define BOOST_PARAMETER_arg_list(n) \
-    mpl::apply_wrap1< \
-    BOOST_PP_ENUM(N, BOOST_PARAMETER_open_list, _) \
-  , mpl::always<aux::empty_arg_list> \
-    BOOST_PP_REPEAT(N, BOOST_PARAMETER_close_list, _) \
-  , unnamed_list>
+    aux::make_arg_list< \
+        BOOST_PP_ENUM(N, BOOST_PARAMETER_open_list, _) \
+      , void_ \
+        BOOST_PP_REPEAT(N, BOOST_PARAMETER_close_list, _) \
+      , deduced_list \
+      , aux::tag_keyword_arg \
+    >
 
+#define BOOST_PARAMETER_arg_pack_init(z, n, limit) \
+    BOOST_PP_CAT(a, BOOST_PP_SUB(limit,n))
+
 template<BOOST_PP_ENUM_PARAMS(N, class A)>
-typename BOOST_PARAMETER_arg_list(N)::type
+typename mpl::first<
+    typename BOOST_PARAMETER_arg_list(N)::type
+>::type
 operator()(BOOST_PP_ENUM_BINARY_PARAMS(N, A, & a)) const
 {
-    typedef typename BOOST_PARAMETER_arg_list(N)::type arg_tuple;
+    typedef typename BOOST_PARAMETER_arg_list(N)::type result;
 
-    return arg_tuple(
-        BOOST_PP_ENUM_PARAMS(N, a)
+    typedef typename mpl::first<result>::type result_type;
+    typedef typename mpl::second<result>::type error;
+    error();
+
+    return result_type(
+        BOOST_PP_ENUM(N, BOOST_PARAMETER_arg_pack_init, BOOST_PP_DEC(N))
         BOOST_PP_ENUM_TRAILING_PARAMS(
             BOOST_PP_SUB(BOOST_PARAMETER_MAX_ARITY, N)
           , aux::void_reference() BOOST_PP_INTERCEPT

Modified: boost/trunk/boost/parameter/aux_/preprocessor/flatten.hpp
===================================================================
--- boost/trunk/boost/parameter/aux_/preprocessor/flatten.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/parameter/aux_/preprocessor/flatten.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,14 +9,16 @@
 # include <boost/preprocessor/tuple/rem.hpp>
 # include <boost/preprocessor/cat.hpp>
 # include <boost/preprocessor/seq/for_each.hpp>
+# include <boost/preprocessor/seq/for_each_i.hpp>
+# include <boost/preprocessor/identity.hpp>
 # include <boost/preprocessor/selection/max.hpp>
 # include <boost/preprocessor/arithmetic/sub.hpp>
 # include <boost/preprocessor/repetition/enum_trailing.hpp>
-
 # include <boost/parameter/aux_/preprocessor/for_each.hpp>
 
 # define BOOST_PARAMETER_FLATTEN_SPLIT_required required,
 # define BOOST_PARAMETER_FLATTEN_SPLIT_optional optional,
+# define BOOST_PARAMETER_FLATTEN_SPLIT_deduced deduced,
 
 # define BOOST_PARAMETER_FLATTEN_SPLIT(sub) \
     BOOST_PP_CAT(BOOST_PARAMETER_FLATTEN_SPLIT_, sub)
@@ -48,16 +50,18 @@
         ) \
     ))
 
-# define BOOST_PARAMETER_FLATTEN_SPEC_AUX(r, arity, max_arity, spec) \
+# define BOOST_PARAMETER_FLATTEN_SPEC_AUX(r, arity, max_arity, spec, transform) \
     BOOST_PARAMETER_FOR_EACH_R( \
         r \
       , arity \
       , BOOST_PARAMETER_FLATTEN_ARGS(spec) \
-      , (arity, max_arity, BOOST_PARAMETER_FLATTEN_QUALIFIER(spec)) \
+      , (arity, max_arity, transform(BOOST_PARAMETER_FLATTEN_QUALIFIER(spec))) \
       , BOOST_PARAMETER_FLATTEN_SPEC0 \
     )
 
-# define BOOST_PARAMETER_FLATTEN_SPEC(r, arities, spec) \
+# define BOOST_PARAMETER_FLATTEN_IDENTITY(x) x
+
+# define BOOST_PARAMETER_FLATTEN_SPEC_optional(r, arities, spec) \
     BOOST_PARAMETER_FLATTEN_SPEC_AUX( \
         r \
       , BOOST_PP_CAT( \
@@ -65,8 +69,38 @@
         )(arities) \
       , BOOST_PP_TUPLE_ELEM(3,2,arities) \
       , spec \
+      , BOOST_PARAMETER_FLATTEN_IDENTITY \
     )
 
+# define BOOST_PARAMETER_FLATTEN_SPEC_required(r, arities, spec) \
+    BOOST_PARAMETER_FLATTEN_SPEC_optional(r, arities, spec)
+
+# define BOOST_PARAMETER_FLATTEN_SPEC_AS_DEDUCED(x) BOOST_PP_CAT(deduced_,x)
+
+# define BOOST_PARAMETER_FLATTEN_SPEC_deduced_M(r, arities, n, spec) \
+    BOOST_PARAMETER_FLATTEN_SPEC_AUX( \
+        r \
+      , BOOST_PP_CAT( \
+            BOOST_PARAMETER_FLATTEN_ARITY_, BOOST_PARAMETER_FLATTEN_QUALIFIER(spec) \
+        )(arities) \
+      , BOOST_PP_TUPLE_ELEM(3,2,arities) \
+      , spec \
+      , BOOST_PARAMETER_FLATTEN_SPEC_AS_DEDUCED \
+    )
+
+# define BOOST_PARAMETER_FLATTEN_SPEC_deduced(r, arities, spec) \
+    BOOST_PP_SEQ_FOR_EACH_I_R( \
+        r \
+      , BOOST_PARAMETER_FLATTEN_SPEC_deduced_M \
+      , arities \
+      , BOOST_PARAMETER_FLATTEN_ARGS(spec) \
+    )
+
+# define BOOST_PARAMETER_FLATTEN_SPEC(r, arities, spec) \
+    BOOST_PP_CAT( \
+        BOOST_PARAMETER_FLATTEN_SPEC_, BOOST_PARAMETER_FLATTEN_QUALIFIER(spec) \
+    )(r, arities, spec)
+
 # define BOOST_PARAMETER_FLATTEN(optional_arity, required_arity, wanted_arity, specs) \
     BOOST_PP_SEQ_FOR_EACH( \
         BOOST_PARAMETER_FLATTEN_SPEC \

Modified: boost/trunk/boost/parameter/aux_/preprocessor/for_each.hpp
===================================================================
--- boost/trunk/boost/parameter/aux_/preprocessor/for_each.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/parameter/aux_/preprocessor/for_each.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,6 +14,7 @@
 # include <boost/preprocessor/repeat.hpp>
 # include <boost/preprocessor/punctuation/comma_if.hpp>
 # include <boost/preprocessor/for.hpp>
+# include <boost/preprocessor/repetition/deduce_r.hpp>
 
 # define BOOST_PARAMETER_FOR_EACH_head_aux2(x,y) (x,y), ~
 # define BOOST_PARAMETER_FOR_EACH_head_aux3(x,y,z) (x,y,z), ~

Modified: boost/trunk/boost/parameter/aux_/python/invoker.hpp
===================================================================
--- boost/trunk/boost/parameter/aux_/python/invoker.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/parameter/aux_/python/invoker.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -85,9 +85,9 @@
 template <class M, class R, class T, class Args>
 struct member_invoker<0, M, R, T, Args>
 {
-    static R execute()
+    static R execute(T& self)
     {
-        return M()(boost::type<R>());
+        return M()(boost::type<R>(), self);
     }
 };
 

Copied: boost/trunk/boost/parameter/aux_/set.hpp (from rev 14034, boost/branches/upstream/current/boost/parameter/aux_/set.hpp)

Modified: boost/trunk/boost/parameter/aux_/tagged_argument.hpp
===================================================================
--- boost/trunk/boost/parameter/aux_/tagged_argument.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/parameter/aux_/tagged_argument.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,11 +21,13 @@
 struct empty_arg_list;
 struct arg_list_tag;
 
+struct tagged_argument_base {};
+
 // Holds a reference to an argument of type Arg associated with
 // keyword Keyword
     
 template <class Keyword, class Arg>
-struct tagged_argument
+struct tagged_argument : tagged_argument_base
 {
     typedef Keyword key_type;
     typedef Arg value_type;
@@ -38,13 +40,13 @@
     // lookup given that default
     struct binding
     {
-        template <class KW, class Default>
+        template <class KW, class Default, class Reference>
         struct apply
         {
-          typedef typename mpl::if_<
+          typedef typename mpl::eval_if<
                 boost::is_same<KW, key_type>
-              , reference
-              , Default
+              , mpl::if_<Reference, reference, value_type>
+              , mpl::identity<Default>
           >::type type;
         };
     };
@@ -72,7 +74,7 @@
         return value;
     }
 
-# ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
+# if defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
     template <class KW, class Default>
     Default& get_with_default(default_<KW,Default> const& x, int) const
     {
@@ -86,7 +88,7 @@
     }
 
     template <class KW, class Default>
-    typename mpl::apply_wrap2<binding, KW, Default&>::type
+    typename mpl::apply_wrap3<binding, KW, Default&, mpl::true_>::type
     operator[](default_<KW,Default> const& x) const
     {
         return get_with_default(x, 0L);
@@ -106,9 +108,10 @@
     }
 
     template <class KW, class F>
-    typename mpl::apply_wrap2<
+    typename mpl::apply_wrap3<
         binding,KW
       , typename result_of0<F>::type
+      , mpl::true_
     >::type
     operator[](lazy_default<KW,F> const& x) const
     {
@@ -163,24 +166,13 @@
     typedef arg_list_tag tag; // For dispatching to sequence intrinsics
 };
 
-template <class K, class T>
-char is_tagged_argument_check(tagged_argument<K,T> const*);
-char(&is_tagged_argument_check(...))[2];
-
 // Defines a metafunction, is_tagged_argument, that identifies
-// tagged_argument specializations.
-// MAINTAINER NOTE: Not using BOOST_DETAIL_IS_XXX_DEF here because
-// we need to return true for tagged_argument<K,T> const.
+// tagged_argument specializations and their derived classes.
 template <class T>
 struct is_tagged_argument_aux
-{
-    enum { value =
-        sizeof(is_tagged_argument_check((T*)0)) == 1
-    };
+  : is_convertible<T*,tagged_argument_base const*>
+{};
 
-    typedef mpl::bool_<value> type;
-};
-
 template <class T>
 struct is_tagged_argument
   : mpl::and_<

Modified: boost/trunk/boost/parameter/binding.hpp
===================================================================
--- boost/trunk/boost/parameter/binding.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/parameter/binding.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,13 +9,36 @@
 # include <boost/mpl/and.hpp>
 # include <boost/parameter/aux_/result_of0.hpp>
 # include <boost/parameter/aux_/void.hpp>
-#  include <boost/type_traits/is_same.hpp>
+# include <boost/type_traits/is_same.hpp>
 
+# if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
+#  include <boost/mpl/eval_if.hpp>
+# endif
+
 namespace boost { namespace parameter { 
 
 // A metafunction that, given an argument pack, returns the type of
 // the parameter identified by the given keyword.  If no such
 // parameter has been specified, returns Default
+
+# if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) \
+  || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+template <class Parameters, class Keyword, class Default>
+struct binding0
+{
+    typedef typename mpl::apply_wrap3<
+        typename Parameters::binding,Keyword,Default,mpl::true_
+    >::type type;
+
+    BOOST_MPL_ASSERT_NOT((
+        mpl::and_<
+            is_same<Default, void_>
+          , is_same<type, void_>
+        >
+    ));
+};
+# endif
+
 template <class Parameters, class Keyword, class Default = void_>
 # if !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
 struct binding
@@ -23,9 +46,17 @@
 struct binding_eti
 # endif
 {
-    typedef typename mpl::apply_wrap2<
-        typename Parameters::binding,Keyword,Default
+# if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) \
+  || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+    typedef typename mpl::eval_if<
+        mpl::is_placeholder<Parameters>
+      , mpl::identity<int>
+      , binding0<Parameters,Keyword,Default>
     >::type type;
+# else
+    typedef typename mpl::apply_wrap3<
+        typename Parameters::binding,Keyword,Default,mpl::true_
+    >::type type;
 
     BOOST_MPL_ASSERT_NOT((
         mpl::and_<
@@ -33,6 +64,11 @@
           , is_same<type, void_>
         >
     ));
+# endif
+
+# if !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
+    BOOST_MPL_AUX_LAMBDA_SUPPORT(3,binding,(Parameters,Keyword,Default))
+# endif
 };
 
 # if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
@@ -44,6 +80,8 @@
       , mpl::identity<int>
       , binding_eti<Parameters, Keyword, Default>
     >::type type;
+
+    BOOST_MPL_AUX_LAMBDA_SUPPORT(3,binding,(Parameters,Keyword,Default))
 };
 # endif
 
@@ -54,10 +92,11 @@
 template <class Parameters, class Keyword, class DefaultFn>
 struct lazy_binding
 {
-  typedef typename mpl::apply_wrap2<
+  typedef typename mpl::apply_wrap3<
       typename Parameters::binding
     , Keyword
     , typename aux::result_of0<DefaultFn>::type
+    , mpl::true_
   >::type type;
 };
 

Copied: boost/trunk/boost/parameter/name.hpp (from rev 14034, boost/branches/upstream/current/boost/parameter/name.hpp)

Modified: boost/trunk/boost/parameter/parameters.hpp
===================================================================
--- boost/trunk/boost/parameter/parameters.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/parameter/parameters.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,6 +8,8 @@
 
 #include <boost/detail/is_xxx.hpp>
 
+#include <boost/type_traits/is_const.hpp>
+
 #include <boost/mpl/lambda.hpp>
 #include <boost/mpl/apply.hpp>
 #include <boost/mpl/always.hpp>
@@ -43,8 +45,19 @@
 #include <boost/parameter/aux_/tagged_argument.hpp>
 #include <boost/parameter/aux_/tag.hpp>
 #include <boost/parameter/aux_/template_keyword.hpp>
+#include <boost/parameter/aux_/set.hpp>
 #include <boost/parameter/config.hpp>
 
+namespace parameter_
+{
+  template <class T>
+  struct unmatched_argument
+  {
+      BOOST_MPL_ASSERT((boost::is_same<T,void>));
+      typedef int type;
+  }; 
+} // namespace parameter_
+
 namespace boost {
 
 template<class T> class reference_wrapper;
@@ -68,7 +81,7 @@
 // required<...>, wrapper, it is treated as though optional<k> were
 // specified.
 //
-// If a keyword k is specified with unnamed<...>, that keyword
+// If a keyword k is specified with deduced<...>, that keyword
 // will be automatically deduced from the argument list.
 //
 template <class Tag, class Predicate = aux::use_default>
@@ -85,21 +98,38 @@
     typedef Predicate predicate;
 };
 
-template <class Tag, class Predicate>
-struct unnamed
+template <class Tag>
+struct deduced
 {
     typedef Tag key_type;
-    typedef Predicate predicate;
 };
 
 namespace aux
 {
   // Defines metafunctions, is_required and is_optional, that
-  // identify required<...>, optional<...> and unnamed<...> specializations.
+  // identify required<...>, optional<...> and deduced<...> specializations.
   BOOST_DETAIL_IS_XXX_DEF(required, required, 2)
   BOOST_DETAIL_IS_XXX_DEF(optional, optional, 2)
-  BOOST_DETAIL_IS_XXX_DEF(unnamed, unnamed, 2)
+  BOOST_DETAIL_IS_XXX_DEF(deduced_aux, deduced, 1)
 
+  template <class S>
+  struct is_deduced0
+    : is_deduced_aux<
+          typename S::key_type
+      >::type
+  {};
+
+  template <class S>
+  struct is_deduced
+    : mpl::eval_if<
+          mpl::or_<
+              is_optional<S>, is_required<S>
+          >
+        , is_deduced0<S>
+        , mpl::false_
+      >::type
+  {};
+
   //
   // key_type, has_default, and predicate --
   //
@@ -109,27 +139,36 @@
   // argument type is required match.
   //
   // a ParameterSpec is a specialization of either keyword<...>,
-  // required<...>, optional<...> or unnamed<...>
+  // required<...>, optional<...>
   //
 
   // helper for key_type<...>, below.
   template <class T>
-  struct get_key_type
-  { typedef typename T::key_type type; };
+  struct get_tag_type0
+  {
+      typedef typename T::key_type type;
+  };
 
   template <class T>
-  struct key_type
+  struct get_tag_type
     : mpl::eval_if<
+          is_deduced_aux<typename T::key_type>
+        , get_tag_type0<typename T::key_type>
+        , mpl::identity<typename T::key_type>
+      >
+  {};
+
+  template <class T>
+  struct tag_type
+    : mpl::eval_if<
           mpl::or_<
               is_optional<T>
             , is_required<T>
-            , is_unnamed<T>
           >
-        , get_key_type<T>
+        , get_tag_type<T>
         , mpl::identity<T>
       >
-  {
-  };
+  {};
 
   template <class T>
   struct has_default
@@ -164,7 +203,6 @@
          mpl::or_<
               is_optional<T>
             , is_required<T>
-            , is_unnamed<T>
           >
         , get_predicate<T>
         , mpl::identity<mpl::always<mpl::true_> >
@@ -175,13 +213,13 @@
 
   // Converts a ParameterSpec into a specialization of
   // parameter_requirements.  We need to do this in order to get the
-  // key_type into the type in a way that can be conveniently matched
+  // tag_type into the type in a way that can be conveniently matched
   // by a satisfies(...) member function in arg_list.
   template <class ParameterSpec>
   struct as_parameter_requirements
   {
       typedef parameter_requirements<
-          typename key_type<ParameterSpec>::type
+          typename tag_type<ParameterSpec>::type
         , typename predicate<ParameterSpec>::type
         , typename has_default<ParameterSpec>::type
       > type;
@@ -195,27 +233,6 @@
       >
   {};
   
-  // Labels Arg with default keyword tag DefaultTag if it is not
-  // already a tagged_argument. If an unnamed spec that matches
-  // Arg exists in UnnamedList, labels Arg with that spec's
-  // keyword tag.
-  template <class Positional, class Arg, class UnnamedList, class TagFn>
-  struct as_tagged_argument
-    : mpl::eval_if<
-          is_named_argument<Arg>
-        , mpl::identity<mpl::pair<Arg, UnnamedList> >
-        , mpl::apply_wrap3<UnnamedList, Arg, Positional, TagFn>
-      >
-  {};
-  
-#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)  // ETI workaround
-  template <>
-  struct as_tagged_argument<int,int,int,int>
-  {
-      typedef int type;
-  };
-#endif
-
   // Returns mpl::true_ iff the given ParameterRequirements are
   // satisfied by ArgList.
   template <class ArgList, class ParameterRequirements>
@@ -224,18 +241,22 @@
 #if BOOST_WORKAROUND(BOOST_MSVC, == 1310)
       // VC7.1 can't handle the sizeof() implementation below,
       // so we use this instead.
-      typedef typename mpl::apply_wrap2<
+      typedef typename mpl::apply_wrap3<
           typename ArgList::binding
         , typename ParameterRequirements::keyword
         , void_
+        , mpl::false_
       >::type bound;
 
       typedef typename mpl::eval_if<
           is_same<bound, void_>
         , typename ParameterRequirements::has_default
-        , mpl::apply1<
-              typename ParameterRequirements::predicate
-            , typename remove_reference<bound>::type
+        , mpl::apply_wrap2<
+              typename mpl::lambda<
+                  typename ParameterRequirements::predicate, lambda_tag
+              >::type
+            , bound
+            , ArgList
           >
       >::type type;
 #else
@@ -243,7 +264,7 @@
           bool, value = (
               sizeof(
                   aux::to_yesno(
-                      ArgList::satisfies((ParameterRequirements*)0)
+                      ArgList::satisfies((ParameterRequirements*)0, (ArgList*)0)
                   )
               ) == sizeof(yes_tag)
           )
@@ -263,184 +284,399 @@
       >
   {};
 
-  // Helper for make_partial_arg_list, below.  Produce an arg_list
-  // node for the given ParameterSpec and ArgumentType, whose tail is
-  // determined by invoking the nullary metafunction TailFn.
-  template <class ParameterSpec, class ArgumentType, class TagFn, class TailFn>
-  struct make_arg_list
+  // Tags a deduced argument Arg with the keyword tag of Spec using TagFn.
+  // Returns the tagged argument and the mpl::set<> UsedArgs with the
+  // tag of Spec inserted.
+  template <class UsedArgs, class Spec, class Arg, class TagFn>
+  struct tag_deduced
   {
-      template <class UnnamedList>
-      struct apply
-      {
-          typedef typename as_tagged_argument<
-              ParameterSpec,ArgumentType,UnnamedList,TagFn
-          >::type tagged_result;
-
-          typedef arg_list<
-              typename mpl::first<tagged_result>::type
-            , typename mpl::apply_wrap1<
-                  TailFn, typename mpl::second<tagged_result>::type
-              >::type 
-          > type;
-      };
+      typedef mpl::pair<
+          typename mpl::apply_wrap2<TagFn, typename tag_type<Spec>::type, Arg>::type
+        , typename aux::insert_<UsedArgs, typename tag_type<Spec>::type>::type
+      > type;
   };
 
-  // Just like make_arg_list, except if ArgumentType is void_, the
-  // result is empty_arg_list.  Used to build arg_lists whose length
-  // depends on the number of non-default (void_) arguments passed to
-  // a class template.
   template <
-      class ParameterSpec
-    , class ArgumentType
+      class Argument
+    , class ArgumentPack
+    , class DeducedArgs
+    , class UsedArgs
     , class TagFn
-    , class TailFn
   >
-  struct make_partial_arg_list
+  struct deduce_tag;
+
+  // Tag type passed to MPL lambda.
+  struct lambda_tag;
+
+  // Helper for deduce_tag<> below.
+  template <
+      class Argument
+    , class ArgumentPack
+    , class DeducedArgs
+    , class UsedArgs
+    , class TagFn
+  >
+  struct deduce_tag0
   {
-      template <class UnnamedList>
-      struct apply
-      {
-        typedef typename mpl::eval_if<
-              is_same<ArgumentType, void_>
-            , mpl::identity<empty_arg_list>
-            , mpl::apply_wrap1<
-                  make_arg_list<ParameterSpec, ArgumentType, TagFn, TailFn>
-                , UnnamedList
-              >
-        >::type type;
-      };
+      typedef typename DeducedArgs::spec spec;
+
+      typedef typename mpl::apply_wrap2<
+          typename mpl::lambda<
+              typename spec::predicate, lambda_tag
+          >::type
+        , Argument
+        , ArgumentPack
+      >::type condition;
+
+      // Deduced parameter matches several arguments.
+
+      BOOST_MPL_ASSERT((
+          mpl::not_<mpl::and_<
+              condition
+            , aux::has_key_<UsedArgs, typename tag_type<spec>::type>
+          > >
+      ));
+
+      typedef typename mpl::eval_if<
+          condition
+        , tag_deduced<UsedArgs, spec, Argument, TagFn>
+        , deduce_tag<Argument, ArgumentPack, typename DeducedArgs::tail, UsedArgs, TagFn>
+      >::type type;
   };
 
-  // Generates:
+  // Tries to deduced a keyword tag for a given Argument.
+  // Returns an mpl::pair<> consisting of the tagged_argument<>, 
+  // and an mpl::set<> where the new tag has been inserted.
   //
-  //   make<
-  //       parameter_spec#0, argument_type#0
-  //     , make<
-  //           parameter_spec#1, argument_type#1
-  //         , ... mpl::identity<aux::empty_arg_list>
-  //    ...>
-  //   >
-#define BOOST_PARAMETER_make_arg_list(z, n, names)      \
-      BOOST_PP_SEQ_ELEM(0,names)<                       \
-          BOOST_PP_CAT(BOOST_PP_SEQ_ELEM(1,names), n),  \
-          BOOST_PP_CAT(BOOST_PP_SEQ_ELEM(2,names), n),  \
-          BOOST_PP_SEQ_ELEM(3,names),
+  //  Argument: The argument type to be tagged.
+  //
+  //  ArgumentPack: The ArgumentPack built so far.
+  //
+  //  DeducedArgs: A specialization of deduced_item<> (see below).
+  //               A list containing only the deduced ParameterSpecs.
+  //
+  //  UsedArgs: An mpl::set<> containing the keyword tags used so far.
+  //
+  //  TagFn: A metafunction class used to tag positional or deduced
+  //         arguments with a keyword tag.
 
-#define BOOST_PARAMETER_right_angle(z, n, text) >
+  template <
+      class Argument
+    , class ArgumentPack
+    , class DeducedArgs
+    , class UsedArgs
+    , class TagFn
+  >
+  struct deduce_tag
+  {
+      typedef typename mpl::eval_if<
+          is_same<DeducedArgs, void_>
+        , mpl::pair<void_, UsedArgs>
+        , deduce_tag0<Argument, ArgumentPack, DeducedArgs, UsedArgs, TagFn>
+      >::type type;
+  };
 
-#define BOOST_PARAMETER_build_arg_list(n, make, parameter_spec, argument_type, tag) \
-  BOOST_PP_REPEAT(                                                                  \
-      n, BOOST_PARAMETER_make_arg_list, (make)(parameter_spec)(argument_type)(tag)) \
-  mpl::always<aux::empty_arg_list>                                                  \
-  BOOST_PP_REPEAT(n, BOOST_PARAMETER_right_angle, _)
+  template <
+      class List
+    , class DeducedArgs
+    , class TagFn
+    , class Positional
+    , class UsedArgs
+    , class ArgumentPack
+    , class Error
+  >
+  struct make_arg_list_aux;
 
-  // Terminates an unnamed_list (below).
-  struct empty_unnamed_list
+  // Inserts Tagged::key_type into the UserArgs set.
+  // Extra indirection to lazily evaluate Tagged::key_type.
+  template <class UsedArgs, class Tagged>
+  struct insert_tagged
   {
-      template <class Arg, class Positional, class TagFn>
-      struct apply
-      {
-          // No unnamed predicate matched Arg, so we tag Arg with
-          // the DefaultTag.
+      typedef typename aux::insert_<
+          UsedArgs, typename Tagged::key_type
+      >::type type;
+  };
 
-          BOOST_MPL_ASSERT_NOT((is_unnamed<Positional>));
+  // Borland needs the insane extra-indirection workaround below
+  // so that it doesn't magically drop the const qualifier from
+  // the argument type.
 
-          typedef mpl::pair<
-              typename mpl::apply_wrap2<
-                  TagFn
-                , typename key_type<Positional>::type
-                , Arg
-              >::type
-            , empty_unnamed_list
-          > type;
-      };
+  template <
+      class List
+    , class DeducedArgs
+    , class TagFn
+    , class Positional
+    , class UsedArgs
+    , class ArgumentPack
+#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+    , class argument
+#endif
+    , class Error
+  >
+#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+  struct make_arg_list00
+#else
+  struct make_arg_list0
+#endif
+  {
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+      typedef typename List::arg argument;
+#endif
+      typedef typename List::spec parameter_spec;
+      typedef typename tag_type<parameter_spec>::type tag_;
+
+      typedef is_named_argument<argument> is_tagged;
+
+      // If this argument is either explicitly tagged or a deduced
+      // parameter, we turn off positional matching.
+      typedef mpl::and_<
+          mpl::not_<
+              mpl::or_<is_deduced<parameter_spec>, is_tagged> 
+          > 
+        , Positional
+      > positional;
+
+      // If this parameter is explicitly tagged we add it to the
+      // used-parmeters set. We only really need to add parameters
+      // that are deduced, but we would need a way to check if
+      // a given tag corresponds to a deduced parameter spec.
+      typedef typename mpl::eval_if<
+          is_tagged
+        , insert_tagged<UsedArgs, argument>
+        , mpl::identity<UsedArgs>
+      >::type used_args;
+
+      // If this parameter is neither explicitly tagged, nor
+      // positionally matched; deduce the tag from the deduced
+      // parameter specs.
+      typedef typename mpl::eval_if<
+          mpl::or_<is_tagged, positional>
+        , mpl::pair<void_, used_args>
+        , deduce_tag<argument, ArgumentPack, DeducedArgs, used_args, TagFn>
+      >::type deduced_data;
+
+      // If this parameter is explicitly tagged..
+      typedef typename mpl::eval_if<
+          is_tagged
+        , mpl::identity<argument>                        // .. just use it
+        , mpl::eval_if<                                  // .. else, if positional matching is turned on..
+                positional
+              , mpl::apply_wrap2<TagFn, tag_, argument>  // .. tag it positionally
+              , mpl::first<deduced_data>                 // .. else, use the deduced tag
+          >
+      >::type tagged;
+
+      // We build the arg_list incrementally as we go, prepending new
+      // nodes.
+
+      typedef typename mpl::if_<
+          mpl::and_<
+              is_same<Error, void_>
+            , is_same<tagged, void_>
+          >
+        , parameter_::unmatched_argument<argument>
+        , void_
+      >::type error;
+
+      typedef typename mpl::if_<
+          is_same<tagged, void_>
+        , ArgumentPack
+        , arg_list<tagged, ArgumentPack>
+      >::type argument_pack;
+
+      typedef typename make_arg_list_aux<
+          typename List::tail
+        , DeducedArgs
+        , TagFn
+        , positional
+        , typename deduced_data::second
+        , argument_pack
+        , error
+      >::type type;
   };
 
-  // Used by as_tagged_argument to match a given 
-  // argument with a list of unnamed specs.
+#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+  template <
+      class List
+    , class DeducedArgs
+    , class TagFn
+    , class Positional
+    , class UsedArgs
+    , class ArgumentPack
+    , class Error
+  >
+  struct make_arg_list0
+  {
+      typedef typename mpl::eval_if<
+          typename List::is_arg_const
+        , make_arg_list00<
+              List
+            , DeducedArgs
+            , TagFn
+            , Positional
+            , UsedArgs
+            , ArgumentPack
+            , typename List::arg const
+            , Error
+          >
+        , make_arg_list00<
+              List
+            , DeducedArgs
+            , TagFn
+            , Positional
+            , UsedArgs
+            , ArgumentPack
+            , typename List::arg
+            , Error
+          >
+      >::type type;
+  };
+#endif
+
+  // Returns an ArgumentPack where the list of arguments has
+  // been tagged with keyword tags.
   //
-  // ParameterSpec is an unnamed spec.
-  // Tail is either another unnamed_list specialization,
-  // or empty_unnamed_list.
-  template <class ParameterSpec, class Tail>
-  struct unnamed_list
+  //   List: A specialization of item<> (see below). Contains
+  //         both the ordered ParameterSpecs, and the given arguments.
+  //
+  //   DeducedArgs: A specialization of deduced_item<> (see below).
+  //                A list containing only the deduced ParameterSpecs.
+  //
+  //   TagFn: A metafunction class used to tag positional or deduced
+  //          arguments with a keyword tag.
+  //
+  //   Position: An mpl::bool_<> specialization indicating if positional
+  //             matching is to be performed.
+  //
+  //   DeducedSet: An mpl::set<> containing the keyword tags used so far.
+  //
+  //   ArgumentPack: The ArgumentPack built so far. This is initially an
+  //                 empty_arg_list and is built incrementally.
+  //
+
+  template <
+      class List
+    , class DeducedArgs
+    , class TagFn
+    , class Positional
+    , class DeducedSet
+    , class ArgumentPack
+    , class Error
+  >
+  struct make_arg_list_aux
   {
-      // Helper metafunction for apply below. Computes the result
-      // of Tail::apply. Returns a pair consisting of:
-      //
-      //  * the tagged argument
-      //  * the unnamed_list that is left after the tagging. Possibly
-      //    with one element removed.
-      template <class Arg, class Positional, class TagFn>
-      struct eval_tail
-      {
-          typedef typename mpl::apply_wrap3<
-              Tail, Arg, Positional, TagFn
-          >::type result;
+      typedef typename mpl::eval_if<
+          is_same<List, void_>
+        , mpl::identity<mpl::pair<ArgumentPack, Error> >
+        , make_arg_list0<List, DeducedArgs, TagFn, Positional, DeducedSet, ArgumentPack, Error>
+      >::type type;
+  };
 
-          typedef mpl::pair<
-              typename mpl::first<result>::type
-            , unnamed_list<ParameterSpec, typename mpl::second<result>::type>
-          > type;
-      };
+  // VC6.5 was choking on the default parameters for make_arg_list_aux, so
+  // this just forwards to that adding in the defaults.
+  template <
+      class List
+    , class DeducedArgs
+    , class TagFn
+    , class EmitErrors = mpl::true_
+  >
+  struct make_arg_list
+  {
+      typedef typename make_arg_list_aux<
+          List, DeducedArgs, TagFn, mpl::true_, aux::set0, empty_arg_list, void_
+      >::type type;
+  };
 
-      // If this keyword's predicate returns true for
-      // the given argument type, tag the argument with
-      // ParameterSpec::key_type. Otherwise try the tail.
-      template <class Arg, class Positional, class TagFn>
-      struct apply
-      {
-          typedef typename mpl::eval_if<
-              typename mpl::apply1<typename ParameterSpec::predicate, Arg>::type
-            , mpl::pair<
-                  typename mpl::apply_wrap2<
-                      TagFn, typename ParameterSpec::key_type, Arg
-                  >::type
-                , Tail
-              >
-            ,
-#if BOOST_WORKAROUND(__GNUC__, < 3)
-              typename unnamed_list<ParameterSpec, Tail>::template
+  // A parameter spec item typelist.
+  template <class Spec, class Arg, class Tail = void_>
+  struct item
+  {
+      typedef Spec spec;
+
+#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+      typedef is_const<Arg> is_arg_const;
 #endif
-              eval_tail<Arg, Positional, TagFn>
-          >::type type;
-      };
+
+      typedef Arg arg;
+      typedef Tail tail;
   };
 
-  // We need to build a list of all ParameterSpec's that specify an 
-  // unnamed argument. This list is used when trying to match an
-  // argument to an unnamed keyword.
+  template <class Spec, class Arg, class Tail>
+  struct make_item
+  {
+      typedef item<Spec, Arg, typename Tail::type> type;
+  };
 
-  template <class ParameterSpec, class TailFn>
-  struct make_unnamed_list
+  // Creates a item typelist.
+  template <class Spec, class Arg, class Tail>
+  struct make_items
   {
-      typedef unnamed_list<
-          ParameterSpec
-        , typename TailFn::type
-      > type;
+      typedef typename mpl::eval_if<
+          is_same<Arg, void_>
+        , mpl::identity<void_>
+        , make_item<Spec, Arg, Tail>
+      >::type type;
   };
 
-  template <class ParameterSpec, class TailFn>
-  struct make_partial_unnamed_list
-    : mpl::eval_if<
-          is_same<ParameterSpec, void_>
-        , mpl::identity<empty_unnamed_list>
+  // A typelist that stored deduced parameter specs.
+  template <class ParameterSpec, class Tail = void_>
+  struct deduced_item
+  {
+      typedef ParameterSpec spec;
+      typedef Tail tail;
+  };
+
+  // Evaluate Tail and construct deduced_item list.
+  template <class Spec, class Tail>
+  struct make_deduced_item
+  {
+      typedef deduced_item<Spec, typename Tail::type> type;
+  };
+
+  template <class Spec, class Tail>
+  struct make_deduced_items
+  {
+      typedef typename mpl::eval_if<
+          is_same<Spec, void_>
+        , mpl::identity<void_>
         , mpl::eval_if<
-              is_unnamed<ParameterSpec>
-            , make_unnamed_list<ParameterSpec, TailFn>
-            , TailFn
+              is_deduced<Spec>
+            , make_deduced_item<Spec, Tail>
+            , Tail
           >
-      >
-  {};
+      >::type type;
+  };
 
-#define BOOST_PARAMETER_make_unnamed_list(z, n, names)  \
+  // Generates:
+  //
+  //   make<
+  //       parameter_spec#0, argument_type#0
+  //     , make<
+  //           parameter_spec#1, argument_type#1
+  //         , ... mpl::identity<aux::empty_arg_list>
+  //    ...>
+  //   >
+#define BOOST_PARAMETER_make_arg_list(z, n, names)      \
       BOOST_PP_SEQ_ELEM(0,names)<                       \
+          BOOST_PP_CAT(BOOST_PP_SEQ_ELEM(1,names), n),  \
+          BOOST_PP_CAT(BOOST_PP_SEQ_ELEM(2,names), n), 
+
+#define BOOST_PARAMETER_right_angle(z, n, text) >
+
+#define BOOST_PARAMETER_build_arg_list(n, make, parameter_spec, argument_type)      \
+  BOOST_PP_REPEAT(                                                                  \
+      n, BOOST_PARAMETER_make_arg_list, (make)(parameter_spec)(argument_type))      \
+      mpl::identity<void_>                                                          \
+  BOOST_PP_REPEAT(n, BOOST_PARAMETER_right_angle, _)
+
+#define BOOST_PARAMETER_make_deduced_list(z, n, names)  \
+      BOOST_PP_SEQ_ELEM(0,names)<                       \
           BOOST_PP_CAT(BOOST_PP_SEQ_ELEM(1,names), n),
-   
-#define BOOST_PARAMETER_build_unnamed_list(n, make, parameter_spec)                 \
+
+#define BOOST_PARAMETER_build_deduced_list(n, make, parameter_spec)                 \
   BOOST_PP_REPEAT(                                                                  \
-      n, BOOST_PARAMETER_make_unnamed_list, (make)(parameter_spec))                 \
-  mpl::identity<aux::empty_unnamed_list>                                            \
+      n, BOOST_PARAMETER_make_deduced_list, (make)(parameter_spec))                 \
+  mpl::identity<void_>                                                              \
   BOOST_PP_REPEAT(n, BOOST_PARAMETER_right_angle, _)
 
   struct tag_keyword_arg
@@ -479,9 +715,9 @@
 {
 #undef BOOST_PARAMETER_TEMPLATE_ARGS
 
-    typedef typename BOOST_PARAMETER_build_unnamed_list(
-        BOOST_PARAMETER_MAX_ARITY, aux::make_partial_unnamed_list, PS
-    )::type unnamed_list;
+    typedef typename BOOST_PARAMETER_build_deduced_list(
+        BOOST_PARAMETER_MAX_ARITY, aux::make_deduced_items, PS
+    )::type deduced_list;
 
     // if the elements of NamedList match the criteria of overload
     // resolution, returns a type which can be constructed from
@@ -493,7 +729,7 @@
     // If NamedList satisfies the PS0, PS1, ..., this is a
     // metafunction returning parameters.  Otherwise it 
     // has no nested ::type.
-    template <class NamedList>
+    template <class ArgumentPackAndError>
     struct match_base
       : mpl::if_<
             // mpl::and_<
@@ -503,13 +739,18 @@
             //           ..., mpl::true_
             // ...> >
             
-# define BOOST_PARAMETER_satisfies(z, n, text)                                   \
+# define BOOST_PARAMETER_satisfies(z, n, text)                                      \
             mpl::and_<                                                              \
-                aux::satisfies_requirements_of<NamedList, BOOST_PP_CAT(PS, n)> ,
-      
-            BOOST_PP_REPEAT(BOOST_PARAMETER_MAX_ARITY, BOOST_PARAMETER_satisfies, _)
-            mpl::true_
-            BOOST_PP_REPEAT(BOOST_PARAMETER_MAX_ARITY, BOOST_PARAMETER_right_angle, _)
+                aux::satisfies_requirements_of<                                     \
+                    typename mpl::first<ArgumentPackAndError>::type                 \
+                  , BOOST_PP_CAT(PS, n)>                                            \
+                  ,
+            mpl::and_<
+                is_same<typename mpl::second<ArgumentPackAndError>::type, void_>
+              , BOOST_PP_REPEAT(BOOST_PARAMETER_MAX_ARITY, BOOST_PARAMETER_satisfies, _)
+                mpl::true_
+                BOOST_PP_REPEAT(BOOST_PARAMETER_MAX_ARITY, BOOST_PARAMETER_right_angle, _)
+            >
 
 # undef BOOST_PARAMETER_satisfies
 
@@ -531,15 +772,19 @@
         BOOST_PP_ENUM_BINARY_PARAMS(
             BOOST_PARAMETER_MAX_ARITY, class A, = void_ BOOST_PP_INTERCEPT
         )
-#endif            
+#endif
     >
     struct match
 # ifndef BOOST_NO_SFINAE
       : match_base<
-           typename mpl::apply_wrap1<BOOST_PARAMETER_build_arg_list(
-                BOOST_PARAMETER_MAX_ARITY, aux::make_partial_arg_list, PS, A
+            typename aux::make_arg_list<
+                typename BOOST_PARAMETER_build_arg_list(
+                    BOOST_PARAMETER_MAX_ARITY, aux::make_items, PS, A
+                )::type
+              , deduced_list
               , aux::tag_keyword_arg
-            ), unnamed_list>::type
+              , mpl::false_ // Don't emit errors when doing SFINAE
+            >::type
         >::type
     {};
 # else
@@ -551,7 +796,10 @@
 # endif
 
     // Metafunction that returns an ArgumentPack.
-    
+
+    // TODO, bind has to instantiate the error type in the result
+    // of make_arg_list.
+
     template <
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
         // Borland simply can't handle default arguments in member
@@ -566,10 +814,15 @@
     >
     struct bind
     {
-      typedef typename mpl::apply_wrap1<BOOST_PARAMETER_build_arg_list(
-            BOOST_PARAMETER_MAX_ARITY, aux::make_partial_arg_list, PS, A
+        typedef typename aux::make_arg_list<
+            typename BOOST_PARAMETER_build_arg_list(
+                BOOST_PARAMETER_MAX_ARITY, aux::make_items, PS, A
+            )::type
+          , deduced_list
           , aux::tag_template_keyword_arg
-        ), unnamed_list>::type type;
+        >::type result;
+
+        typedef typename mpl::first<result>::type type;
     };
 
     BOOST_PARAMETER_FORWARD_TYPEDEFS(BOOST_PARAMETER_MAX_ARITY, PS, parameter_spec)
@@ -579,23 +832,41 @@
     // labels the positional parameters and maintains whatever other
     // tags may have been specified by the caller.
     //
+    // !!!NOTE!!!
+    //
+    // The make_arg_list<> produces a reversed arg_list, so
+    // we need to pass the arguments to it's constructor
+    // reversed.
+    //
     aux::empty_arg_list operator()() const
     {
        return aux::empty_arg_list();
     }
 
     template<class A0>
-    typename mpl::apply_wrap1<
-        aux::make_arg_list<PS0,A0, aux::tag_keyword_arg, mpl::always<aux::empty_arg_list> >
-      , unnamed_list      
+    typename mpl::first<
+        typename aux::make_arg_list<
+            aux::item<
+                PS0,A0
+            >
+          , deduced_list
+          , aux::tag_keyword_arg
+        >::type
     >::type
     operator()(A0& a0) const
     {
-        typedef typename mpl::apply_wrap1<
-            aux::make_arg_list<PS0,A0,aux::tag_keyword_arg,mpl::always<aux::empty_arg_list> >
-          , unnamed_list
-        >::type result_type;
+        typedef typename aux::make_arg_list<
+            aux::item<
+                PS0,A0
+            >
+          , deduced_list
+          , aux::tag_keyword_arg
+        >::type result;
 
+        typedef typename mpl::first<result>::type result_type;
+        typedef typename mpl::second<result>::type error;
+        error();
+
         return result_type(
             a0
             // , void_(), void_(), void_() ...
@@ -606,31 +877,37 @@
     }
 
     template<class A0, class A1>
-    typename mpl::apply_wrap1<
-        aux::make_arg_list<
-            PS0,A0,aux::tag_keyword_arg
-          , aux::make_arg_list<
-                PS1,A1,aux::tag_keyword_arg
-              , mpl::always<aux::empty_arg_list>
+    typename mpl::first<
+        typename aux::make_arg_list<
+            aux::item<
+                PS0,A0
+              , aux::item<
+                    PS1,A1
+                >
             >
-        >
-      , unnamed_list
+          , deduced_list
+          , aux::tag_keyword_arg
+        >::type
     >::type
     operator()(A0& a0, A1& a1) const
     {
-        typedef typename mpl::apply_wrap1<
-            aux::make_arg_list<
-                PS0,A0,aux::tag_keyword_arg
-              , aux::make_arg_list<
-                    PS1,A1,aux::tag_keyword_arg
-                  , mpl::always<aux::empty_arg_list>
+        typedef typename aux::make_arg_list<
+            aux::item<
+                PS0,A0
+              , aux::item<
+                    PS1,A1
                 >
             >
-          , unnamed_list
-        >::type result_type;
+          , deduced_list
+          , aux::tag_keyword_arg
+        >::type result;
 
+        typedef typename mpl::first<result>::type result_type;
+        typedef typename mpl::second<result>::type error;
+        error();
+
         return result_type(
-            a0, a1
+            a1,a0
             // , void_(), void_() ...
             BOOST_PP_ENUM_TRAILING_PARAMS(
                 BOOST_PP_SUB(BOOST_PARAMETER_MAX_ARITY, 2)

Modified: boost/trunk/boost/parameter/preprocessor.hpp
===================================================================
--- boost/trunk/boost/parameter/preprocessor.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/parameter/preprocessor.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,6 +10,7 @@
 # include <boost/parameter/match.hpp>
 
 # include <boost/parameter/aux_/parenthesized_type.hpp>
+# include <boost/parameter/aux_/cast.hpp>
 # include <boost/parameter/aux_/preprocessor/flatten.hpp>
 
 # include <boost/preprocessor/repetition/repeat_from_to.hpp>
@@ -26,9 +27,15 @@
 # include <boost/preprocessor/seq/size.hpp>
 # include <boost/preprocessor/seq/enum.hpp>
 
+# include <boost/preprocessor/detail/is_nullary.hpp>
+
 # include <boost/mpl/always.hpp>
 # include <boost/mpl/apply_wrap.hpp>
 
+# if BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
+#  include <boost/type.hpp>
+# endif
+
 namespace boost { namespace parameter { namespace aux {
 
 #  ifndef BOOST_NO_SFINAE
@@ -45,13 +52,29 @@
     typedef mpl::always<mpl::true_> type;
 };
 
+#if BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x580))
+
+typedef void* voidstar;
+
 // A matching predicate is explicitly specified
 template <class Predicate>
+struct unwrap_predicate<voidstar (Predicate)>
+{
+    typedef Predicate type;
+};
+
+#else
+
+// A matching predicate is explicitly specified
+template <class Predicate>
 struct unwrap_predicate<void *(Predicate)>
 {
     typedef Predicate type;
 };
 
+#endif 
+
+
 // A type to which the argument is supposed to be convertible is
 // specified
 template <class Target>
@@ -74,6 +97,43 @@
 {};
 # endif 
 
+# if BOOST_WORKAROUND(BOOST_MSVC, == 1300)
+
+// Function template argument deduction does many of the same things
+// as type matching during partial specialization, so we call a
+// function template to "store" T into the type memory addressed by
+// void(*)(T).
+template <class T>
+msvc_store_type<T,void*(*)(void**(T))>
+msvc_store_predicate_type(void*(*)(void**(T)));
+
+template <class T>
+msvc_store_type<boost::is_convertible<mpl::_,T>,void*(*)(void*(T))>
+msvc_store_predicate_type(void*(*)(void*(T)));
+
+template <class FunctionType>
+struct unwrap_predicate
+{
+    static FunctionType f;
+
+    // We don't want the function to be evaluated, just instantiated,
+    // so protect it inside of sizeof.
+    enum { dummy = sizeof(msvc_store_predicate_type(f)) };
+
+    // Now pull the type out of the instantiated base class
+    typedef typename msvc_type_memory<FunctionType>::storage::type type;
+};
+
+template <>
+struct unwrap_predicate<void*(*)(void**)>
+{
+    typedef mpl::always<mpl::true_> type;
+};
+
+# endif
+
+# undef false_
+
 template <
     class Parameters
   , BOOST_PP_ENUM_BINARY_PARAMS(
@@ -82,16 +142,17 @@
 >
 struct argument_pack
 {
-    typedef typename mpl::apply_wrap1<
-        BOOST_PARAMETER_build_arg_list(
-            BOOST_PARAMETER_MAX_ARITY, aux::make_partial_arg_list
-          , typename Parameters::parameter_spec, A, aux::tag_keyword_arg
-        )
-      , typename Parameters::unnamed_list
+    typedef typename make_arg_list<
+        typename BOOST_PARAMETER_build_arg_list(
+            BOOST_PARAMETER_MAX_ARITY, make_items, typename Parameters::parameter_spec, A
+        )::type
+      , typename Parameters::deduced_list
+      , tag_keyword_arg
+      , mpl::false_
     >::type type;
 };
 
-# if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
+# if 1 //BOOST_WORKAROUND(BOOST_MSVC, < 1300)
 // Works around VC6 problem where it won't accept rvalues.
 template <class T>
 T& as_lvalue(T& value, long)
@@ -106,12 +167,118 @@
 }
 # endif
 
+
+# if BOOST_WORKAROUND(BOOST_MSVC, < 1300) \
+  || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+
+template <class Predicate, class T, class Args>
+struct apply_predicate
+{
+    BOOST_MPL_ASSERT((
+        mpl::and_<mpl::false_,T>
+    ));
+
+    typedef typename mpl::if_<
+        typename mpl::apply2<Predicate,T,Args>::type
+      , char
+      , int
+    >::type type;
+};
+
+template <class P>
+struct funptr_predicate
+{
+    static P p;
+
+    template <class T, class Args, class P0>
+    static typename apply_predicate<P0,T,Args>::type
+    check_predicate(type<T>, Args*, void**(*)(P0));
+
+    template <class T, class Args, class P0>
+    static typename mpl::if_<
+        is_convertible<T,P0>
+      , char
+      , int
+     >::type check_predicate(type<T>, Args*, void*(*)(P0));
+
+    template <class T, class Args>
+    struct apply
+    {
+        BOOST_STATIC_CONSTANT(bool, result = 
+            sizeof(check_predicate(boost::type<T>(), (Args*)0, &p)) == 1
+        );
+
+        typedef mpl::bool_<apply<T,Args>::result> type;
+    };
+};
+
+template <>
+struct funptr_predicate<void**>
+  : mpl::always<mpl::true_>
+{};
+
+# endif
+
 }}} // namespace boost::parameter::aux
 
+# if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+// From Paul Mensonides
+#  define BOOST_PARAMETER_IS_NULLARY(x) \
+    BOOST_PP_SPLIT(1, BOOST_PARAMETER_IS_NULLARY_C x BOOST_PP_COMMA() 0) \
+    /**/
+#  define BOOST_PARAMETER_IS_NULLARY_C() \
+    ~, 1 BOOST_PP_RPAREN() \
+    BOOST_PP_TUPLE_EAT(2) BOOST_PP_LPAREN() ~ \
+    /**/
+# else
+#  define BOOST_PARAMETER_IS_NULLARY(x) BOOST_PP_IS_NULLARY(x)
+# endif
+
+# define BOOST_PARAMETER_MEMBER_FUNCTION_CHECK_STATIC_static ()
+# define BOOST_PARAMETER_MEMBER_FUNCTION_IS_STATIC(name) \
+    BOOST_PARAMETER_IS_NULLARY( \
+        BOOST_PP_CAT(BOOST_PARAMETER_MEMBER_FUNCTION_CHECK_STATIC_,name) \
+    )
+
+# if !defined(BOOST_MSVC)
+#  define BOOST_PARAMETER_MEMBER_FUNCTION_STRIP_STATIC_static
+#  define BOOST_PARAMETER_MEMBER_FUNCTION_STRIP_STATIC(name) \
+    BOOST_PP_CAT(BOOST_PARAMETER_MEMBER_FUNCTION_STRIP_STATIC_, name)
+# else
+// Workaround for MSVC preprocessor.
+//
+// When stripping static from "static f", msvc will produce
+// " f". The leading whitespace doesn't go away when pasting
+// the token with something else, so this thing is a hack to
+// strip the whitespace.
+#  define BOOST_PARAMETER_MEMBER_FUNCTION_STRIP_STATIC_static (
+#  define BOOST_PARAMETER_MEMBER_FUNCTION_STRIP_STATIC_AUX(name) \
+    BOOST_PP_CAT(BOOST_PARAMETER_MEMBER_FUNCTION_STRIP_STATIC_, name))
+#  define BOOST_PARAMETER_MEMBER_FUNCTION_STRIP_STATIC(name) \
+    BOOST_PP_SEQ_HEAD( \
+        BOOST_PARAMETER_MEMBER_FUNCTION_STRIP_STATIC_AUX(name) \
+    )
+# endif
+
+# define BOOST_PARAMETER_MEMBER_FUNCTION_STATIC(name) \
+    BOOST_PP_EXPR_IF( \
+        BOOST_PARAMETER_MEMBER_FUNCTION_IS_STATIC(name) \
+      , static \
+    )
+
+# define BOOST_PARAMETER_MEMBER_FUNCTION_NAME(name) \
+    BOOST_PP_IF( \
+        BOOST_PARAMETER_MEMBER_FUNCTION_IS_STATIC(name) \
+      , BOOST_PARAMETER_MEMBER_FUNCTION_STRIP_STATIC \
+      , name BOOST_PP_TUPLE_EAT(1) \
+    )(name)
+
 // Calculates [begin, end) arity range.
 
 # define BOOST_PARAMETER_ARITY_RANGE_M_optional(state) state
+# define BOOST_PARAMETER_ARITY_RANGE_M_deduced_optional(state) state
 # define BOOST_PARAMETER_ARITY_RANGE_M_required(state) BOOST_PP_INC(state)
+# define BOOST_PARAMETER_ARITY_RANGE_M_deduced_required(state) BOOST_PP_INC(state)
 
 # define BOOST_PARAMETER_ARITY_RANGE_M(s, state, x) \
     BOOST_PP_CAT( \
@@ -197,24 +364,31 @@
 /**/
 
 # define BOOST_PARAMETER_FUNCTION_PARAMETERS_NAME(base) \
-    BOOST_PP_CAT(boost_param_parameters_, BOOST_PP_CAT(__LINE__, base))
+    BOOST_PP_CAT( \
+        boost_param_parameters_ \
+      , BOOST_PP_CAT(__LINE__, BOOST_PARAMETER_MEMBER_FUNCTION_NAME(base)) \
+    )
 
 // Produce a name for a result type metafunction for the function
 // named base
 # define BOOST_PARAMETER_FUNCTION_RESULT_NAME(base) \
-    BOOST_PP_CAT(boost_param_result_, BOOST_PP_CAT(__LINE__,base))
+    BOOST_PP_CAT( \
+        boost_param_result_ \
+      , BOOST_PP_CAT(__LINE__,BOOST_PARAMETER_MEMBER_FUNCTION_NAME(base)) \
+    )
 
 // Can't do boost_param_impl_ ## basee because base might start with an underscore
 // daniel: what? how is that relevant? the reason for using CAT() is to make sure
 // base is expanded. i'm not sure we need to here, but it's more stable to do it.
 # define BOOST_PARAMETER_IMPL(base) \
-    BOOST_PP_CAT(boost_param_impl,base)
+    BOOST_PP_CAT(boost_param_impl,BOOST_PARAMETER_MEMBER_FUNCTION_NAME(base))
 
 # define BOOST_PARAMETER_FUNCTION_FWD_FUNCTION00(z, n, r, data, elem) \
     BOOST_PP_IF( \
         n \
       , BOOST_PARAMETER_FUNCTION_FWD_FUNCTION_TEMPLATE_Z, BOOST_PP_TUPLE_EAT(2) \
     )(z,n) \
+    BOOST_PARAMETER_MEMBER_FUNCTION_STATIC(BOOST_PP_TUPLE_ELEM(7,3,data)) \
     inline \
     BOOST_PP_EXPR_IF(n, typename) \
         BOOST_PARAMETER_FUNCTION_RESULT_NAME(BOOST_PP_TUPLE_ELEM(7,3,data))<   \
@@ -227,7 +401,7 @@
             )(elem) \
         >::type \
     >::type \
-    BOOST_PP_TUPLE_ELEM(7,3,data)( \
+    BOOST_PARAMETER_MEMBER_FUNCTION_NAME(BOOST_PP_TUPLE_ELEM(7,3,data))( \
         BOOST_PP_IF( \
             n \
           , BOOST_PP_SEQ_FOR_EACH_I_R \
@@ -310,40 +484,86 @@
 /**/
 
 // Builds boost::parameter::parameters<> specialization
-# if !BOOST_WORKAROUND(BOOST_MSVC, <= 1300) && !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+#  define BOOST_PARAMETER_FUNCTION_PARAMETERS_QUALIFIER_optional(tag) \
+    optional<tag
+
+#  define BOOST_PARAMETER_FUNCTION_PARAMETERS_QUALIFIER_required(tag) \
+    required<tag
+
+#  define BOOST_PARAMETER_FUNCTION_PARAMETERS_QUALIFIER_deduced_optional(tag) \
+    optional<boost::parameter::deduced<tag>
+
+#  define BOOST_PARAMETER_FUNCTION_PARAMETERS_QUALIFIER_deduced_required(tag) \
+    required<boost::parameter::deduced<tag>
+
+# if !BOOST_WORKAROUND(BOOST_MSVC, < 1300) && !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+
+#  if BOOST_WORKAROUND(BOOST_MSVC, == 1300)
+#   define BOOST_PARAMETER_PREDICATE_TYPE(p) void*(*) (void* p)
+#  else
+#   define BOOST_PARAMETER_PREDICATE_TYPE(p) void p
+#  endif
+
 #  define BOOST_PARAMETER_FUNCTION_PARAMETERS_M(r,tag_namespace,i,elem) \
     BOOST_PP_COMMA_IF(i) \
-    boost::parameter::BOOST_PARAMETER_FN_ARG_QUALIFIER(elem)< \
+    boost::parameter::BOOST_PP_CAT( \
+        BOOST_PARAMETER_FUNCTION_PARAMETERS_QUALIFIER_ \
+      , BOOST_PARAMETER_FN_ARG_QUALIFIER(elem) \
+    )( \
         tag_namespace::BOOST_PARAMETER_FUNCTION_KEYWORD( \
             BOOST_PARAMETER_FN_ARG_KEYWORD(elem) \
         ) \
+    ) \
       , typename boost::parameter::aux::unwrap_predicate< \
-            void BOOST_PARAMETER_FN_ARG_PRED(elem) \
+            BOOST_PARAMETER_PREDICATE_TYPE(BOOST_PARAMETER_FN_ARG_PRED(elem)) \
         >::type \
     >
-# else
+# elif BOOST_WORKAROUND(BOOST_MSVC, < 1300)
 #  define BOOST_PARAMETER_FUNCTION_PARAMETERS_M(r,tag_namespace,i,elem) \
     BOOST_PP_COMMA_IF(i) \
-    boost::parameter::BOOST_PARAMETER_FN_ARG_QUALIFIER(elem)< \
+    boost::parameter::BOOST_PP_CAT( \
+        BOOST_PARAMETER_FUNCTION_PARAMETERS_QUALIFIER_ \
+      , BOOST_PARAMETER_FN_ARG_QUALIFIER(elem) \
+    )( \
         tag_namespace::BOOST_PARAMETER_FUNCTION_KEYWORD( \
             BOOST_PARAMETER_FN_ARG_KEYWORD(elem) \
         ) \
+    ) \
+      , boost::parameter::aux::funptr_predicate< \
+            void* BOOST_PARAMETER_FN_ARG_PRED(elem) \
+        > \
+    >
+# elif BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+#  define BOOST_PARAMETER_FUNCTION_PARAMETERS_M(r,tag_namespace,i,elem) \
+    BOOST_PP_COMMA_IF(i) \
+    boost::parameter::BOOST_PP_CAT( \
+        BOOST_PARAMETER_FUNCTION_PARAMETERS_QUALIFIER_ \
+      , BOOST_PARAMETER_FN_ARG_QUALIFIER(elem) \
+    )( \
+        tag_namespace::BOOST_PARAMETER_FUNCTION_KEYWORD( \
+            BOOST_PARAMETER_FN_ARG_KEYWORD(elem) \
+        ) \
+    ) \
       , boost::mpl::always<boost::mpl::true_> \
     >
 # endif
-/**/
 
 # define BOOST_PARAMETER_FUNCTION_PARAMETERS(tag_namespace, base, args)             \
-    template <class BoostParameterDummy>                                      \
-    struct BOOST_PP_CAT(BOOST_PP_CAT(boost_param_params_, __LINE__), base)          \
-      : boost::parameter::parameters<                                               \
+    template <class BoostParameterDummy>                                            \
+    struct BOOST_PP_CAT(                                                            \
+            BOOST_PP_CAT(boost_param_params_, __LINE__)                             \
+          , BOOST_PARAMETER_MEMBER_FUNCTION_NAME(base)                              \
+    ) : boost::parameter::parameters<                                               \
             BOOST_PP_SEQ_FOR_EACH_I(                                                \
                 BOOST_PARAMETER_FUNCTION_PARAMETERS_M, tag_namespace, args          \
             )                                                                       \
         >                                                                           \
     {};                                                                             \
                                                                                     \
-    typedef BOOST_PP_CAT(BOOST_PP_CAT(boost_param_params_, __LINE__), base)<int>
+    typedef BOOST_PP_CAT( \
+            BOOST_PP_CAT(boost_param_params_, __LINE__) \
+          , BOOST_PARAMETER_MEMBER_FUNCTION_NAME(base) \
+    )<int>
 
 // Defines result type metafunction
 # define BOOST_PARAMETER_FUNCTION_RESULT_ARG(z, _, i, x) \
@@ -391,6 +611,9 @@
       , BOOST_PP_TUPLE_ELEM(4, 3, state) \
     )
 
+# define BOOST_PARAMETER_FUNCTION_SPLIT_ARG_deduced_required(state, arg) \
+    BOOST_PARAMETER_FUNCTION_SPLIT_ARG_required(state, arg)
+
 # define BOOST_PARAMETER_FUNCTION_SPLIT_ARG_optional(state, arg) \
     ( \
         BOOST_PP_TUPLE_ELEM(4, 0, state) \
@@ -399,6 +622,9 @@
       , BOOST_PP_SEQ_PUSH_BACK(BOOST_PP_TUPLE_ELEM(4, 3, state), arg) \
     )
 
+# define BOOST_PARAMETER_FUNCTION_SPLIT_ARG_deduced_optional(state, arg) \
+    BOOST_PARAMETER_FUNCTION_SPLIT_ARG_optional(state, arg)
+
 # define BOOST_PARAMETER_FUNCTION_SPLIT_ARG(s, state, arg) \
     BOOST_PP_CAT( \
         BOOST_PARAMETER_FUNCTION_SPLIT_ARG_ \
@@ -414,7 +640,7 @@
     )
 
 # define BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION_ARG_NAME(keyword) \
-    BOOST_PP_CAT(keyword,_type)
+    BOOST_PP_CAT(BOOST_PP_CAT(keyword,_),type)
 
 // Helpers used as parameters to BOOST_PARAMETER_FUNCTION_DEFAULT_ARGUMENTS.
 # define BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION_TEMPLATE_ARG(r, _, arg) \
@@ -432,7 +658,10 @@
 
 // Produces a name for the dispatch functions.
 # define BOOST_PARAMETER_FUNCTION_DEFAULT_NAME(name) \
-    BOOST_PP_CAT(boost_param_default_, BOOST_PP_CAT(__LINE__, name))
+    BOOST_PP_CAT( \
+        boost_param_default_ \
+      , BOOST_PP_CAT(__LINE__, BOOST_PARAMETER_MEMBER_FUNCTION_NAME(name)) \
+    )
 
 // Helper macro used below to produce lists based on the keyword argument
 // names. macro is applied to every element. n is the number of
@@ -453,36 +682,89 @@
     )
 
 // Generates a keyword | default expression.
-# if !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
-#  define BOOST_PARAMETER_FUNCTION_DEFAULT_EVAL_DEFAULT(arg) \
-    BOOST_PARAMETER_FN_ARG_KEYWORD(arg) | BOOST_PARAMETER_FN_ARG_DEFAULT(arg)
-# else // For some reason, VC6 won't accept rvalues in this context.
-#  define BOOST_PARAMETER_FUNCTION_DEFAULT_EVAL_DEFAULT(arg) \
-    BOOST_PARAMETER_FN_ARG_KEYWORD(arg)  \
-      | boost::parameter::aux::as_lvalue(BOOST_PARAMETER_FN_ARG_DEFAULT(arg), 0L)
-# endif
+# define BOOST_PARAMETER_FUNCTION_DEFAULT_EVAL_DEFAULT(arg, tag_namespace) \
+    boost::parameter::keyword< \
+        tag_namespace::BOOST_PARAMETER_FN_ARG_KEYWORD(arg) \
+    >::get() | boost::parameter::aux::use_default_tag()
 
-# define BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION_BODY(name, n, split_args) \
+# define BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION_GET_ARG(arg, tag_ns) \
+    BOOST_PARAMETER_FUNCTION_CAST( \
+        args[ \
+            BOOST_PARAMETER_FUNCTION_DEFAULT_EVAL_DEFAULT( \
+                arg, tag_ns \
+            ) \
+        ] \
+      , BOOST_PARAMETER_FN_ARG_PRED(arg) \
+    )
+
+# define BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION_BODY(name, n, split_args, tag_namespace) \
     { \
         return BOOST_PARAMETER_FUNCTION_DEFAULT_NAME(name)( \
             (ResultType(*)())0 \
           , args \
+          , 0L \
             BOOST_PARAMETER_FUNCTION_DEFAULT_ARGUMENTS( \
                 BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION_PARAMETER \
               , n \
               , split_args \
             ) \
-          , args[ \
-                BOOST_PARAMETER_FUNCTION_DEFAULT_EVAL_DEFAULT( \
-                    BOOST_PP_SEQ_ELEM( \
-                        BOOST_PP_SUB(BOOST_PP_TUPLE_ELEM(4,2,split_args), n) \
-                      , BOOST_PP_TUPLE_ELEM(4,3,split_args) \
-                    ) \
+          , BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION_GET_ARG( \
+                BOOST_PP_SEQ_ELEM( \
+                    BOOST_PP_SUB(BOOST_PP_TUPLE_ELEM(4,2,split_args), n) \
+                  , BOOST_PP_TUPLE_ELEM(4,3,split_args) \
                 ) \
-            ] \
+              , tag_namespace \
+            ) \
         ); \
     }
 
+# define BOOST_PARAMETER_FUNCTION_DEFAULT_EVAL_ACTUAL_DEFAULT(arg) \
+    BOOST_PARAMETER_FUNCTION_CAST( \
+        boost::parameter::aux::as_lvalue(BOOST_PARAMETER_FN_ARG_DEFAULT(arg), 0L) \
+      , BOOST_PARAMETER_FN_ARG_PRED(arg) \
+    )
+
+# define BOOST_PARAMETER_FUNCTION_DEFAULT_EVAL_DEFAULT_BODY(name, n, split_args, tag_ns, const_) \
+    template < \
+        class ResultType \
+      , class Args \
+        BOOST_PARAMETER_FUNCTION_DEFAULT_ARGUMENTS( \
+            BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION_TEMPLATE_ARG \
+          , BOOST_PP_INC(n) \
+          , split_args \
+        ) \
+    > \
+    BOOST_PARAMETER_MEMBER_FUNCTION_STATIC(name) \
+    ResultType BOOST_PARAMETER_FUNCTION_DEFAULT_NAME(name)( \
+        ResultType(*)() \
+      , Args const& args \
+      , long \
+        BOOST_PARAMETER_FUNCTION_DEFAULT_ARGUMENTS( \
+            BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION_ARG \
+          , BOOST_PP_INC(n) \
+          , split_args \
+        ) \
+      , boost::parameter::aux::use_default_tag \
+    ) BOOST_PP_EXPR_IF(const_, const) \
+    { \
+        return BOOST_PARAMETER_FUNCTION_DEFAULT_NAME(name)( \
+            (ResultType(*)())0 \
+          , args \
+          , 0L \
+            BOOST_PARAMETER_FUNCTION_DEFAULT_ARGUMENTS( \
+                BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION_PARAMETER \
+              , BOOST_PP_INC(n) \
+              , split_args \
+            ) \
+          , BOOST_PARAMETER_FUNCTION_DEFAULT_EVAL_ACTUAL_DEFAULT( \
+                BOOST_PP_SEQ_ELEM( \
+                    BOOST_PP_SUB(BOOST_PP_TUPLE_ELEM(4,2,split_args), BOOST_PP_INC(n)) \
+                  , BOOST_PP_TUPLE_ELEM(4,3,split_args) \
+                ) \
+            ) \
+        ); \
+    }
+
 // Produces a forwarding layer in the default evaluation machine.
 //
 // data is a tuple:
@@ -493,49 +775,87 @@
 //
 //   (required_count, required_args, optional_count, required_args)
 //
-# define BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION(z, n, data) \
+
+
+// defines the actual function body for BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION below.
+# define BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION0(z, n, data) \
     template < \
         class ResultType \
       , class Args \
         BOOST_PARAMETER_FUNCTION_DEFAULT_ARGUMENTS( \
             BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION_TEMPLATE_ARG \
           , n \
-          , BOOST_PP_TUPLE_ELEM(3,1,data) \
+          , BOOST_PP_TUPLE_ELEM(5,1,data) \
         ) \
     > \
-    ResultType BOOST_PARAMETER_FUNCTION_DEFAULT_NAME(BOOST_PP_TUPLE_ELEM(3,0,data))( \
+    BOOST_PARAMETER_MEMBER_FUNCTION_STATIC(BOOST_PP_TUPLE_ELEM(5,0,data)) \
+    ResultType BOOST_PARAMETER_FUNCTION_DEFAULT_NAME(BOOST_PP_TUPLE_ELEM(5,0,data))( \
         ResultType(*)() \
       , Args const& args \
+      , int \
         BOOST_PARAMETER_FUNCTION_DEFAULT_ARGUMENTS( \
             BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION_ARG \
           , n \
-          , BOOST_PP_TUPLE_ELEM(3,1,data) \
+          , BOOST_PP_TUPLE_ELEM(5,1,data) \
         ) \
-    ) BOOST_PP_EXPR_IF(BOOST_PP_TUPLE_ELEM(3,2,data), const) \
+    ) BOOST_PP_EXPR_IF(BOOST_PP_TUPLE_ELEM(5,2,data), const) \
     BOOST_PP_IF( \
         n \
       , BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION_BODY \
-      , ; BOOST_PP_TUPLE_EAT(3) \
-    )(BOOST_PP_TUPLE_ELEM(3,0,data), n, BOOST_PP_TUPLE_ELEM(3,1,data))
+      , ; BOOST_PP_TUPLE_EAT(4) \
+    )( \
+        BOOST_PP_TUPLE_ELEM(5,0,data) \
+      , n \
+      , BOOST_PP_TUPLE_ELEM(5,1,data) \
+      , BOOST_PP_TUPLE_ELEM(5,3,data) \
+    )
 
-# define BOOST_PARAMETER_FUNCTION_DEFAULT_GET_ARG(r, _, arg) \
-    , args[BOOST_PARAMETER_FN_ARG_KEYWORD(arg)]
+# define BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION(z, n, data) \
+    BOOST_PP_IF( \
+        BOOST_PP_AND( \
+            BOOST_PP_NOT(n) \
+          , BOOST_PP_TUPLE_ELEM(5,4,data) \
+        ) \
+      , BOOST_PP_TUPLE_EAT(3) \
+      , BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION0 \
+    )(z, n, data) \
+    BOOST_PP_IF( \
+        BOOST_PP_EQUAL(n, BOOST_PP_TUPLE_ELEM(4,2,BOOST_PP_TUPLE_ELEM(5,1,data))) \
+      , BOOST_PP_TUPLE_EAT(5) \
+      , BOOST_PARAMETER_FUNCTION_DEFAULT_EVAL_DEFAULT_BODY \
+    )( \
+        BOOST_PP_TUPLE_ELEM(5,0,data) \
+      , n \
+      , BOOST_PP_TUPLE_ELEM(5,1,data) \
+      , BOOST_PP_TUPLE_ELEM(5,3,data) \
+      , BOOST_PP_TUPLE_ELEM(5,2,data) \
+    )
 
+# define BOOST_PARAMETER_FUNCTION_DEFAULT_GET_ARG(r, tag_ns, arg) \
+    , BOOST_PARAMETER_FUNCTION_CAST( \
+          args[ \
+              boost::parameter::keyword<tag_ns::BOOST_PARAMETER_FN_ARG_KEYWORD(arg)>::get() \
+          ] \
+        , BOOST_PARAMETER_FN_ARG_PRED(arg) \
+      )
+
 // Generates the function template that recives a ArgumentPack, and then
 // goes on to call the layers of overloads generated by 
 // BOOST_PARAMETER_FUNCTION_DEFAULT_LAYER.
-# define BOOST_PARAMETER_FUNCTION_INITIAL_DISPATCH_FUNCTION(name, split_args, const_) \
+# define BOOST_PARAMETER_FUNCTION_INITIAL_DISPATCH_FUNCTION(name, split_args, const_, tag_ns) \
     template <class Args> \
     typename BOOST_PARAMETER_FUNCTION_RESULT_NAME(name)<Args>::type \
+    BOOST_PARAMETER_MEMBER_FUNCTION_STATIC(name) \
     BOOST_PARAMETER_IMPL(name)(Args const& args) BOOST_PP_EXPR_IF(const_, const) \
     { \
         return BOOST_PARAMETER_FUNCTION_DEFAULT_NAME(name)( \
             (typename BOOST_PARAMETER_FUNCTION_RESULT_NAME(name)<Args>::type(*)())0 \
           , args \
+          , 0L \
  \
             BOOST_PP_SEQ_FOR_EACH( \
                 BOOST_PARAMETER_FUNCTION_DEFAULT_GET_ARG \
-              , ~ \
+              , tag_ns \
               , BOOST_PP_TUPLE_ELEM(4,1,split_args) \
             ) \
  \
@@ -543,15 +863,17 @@
     }
 
 // Helper for BOOST_PARAMETER_FUNCTION_DEFAULT_LAYER below.
-# define BOOST_PARAMETER_FUNCTION_DEFAULT_LAYER_AUX(name, split_args, skip_fwd_decl, const_) \
+# define BOOST_PARAMETER_FUNCTION_DEFAULT_LAYER_AUX( \
+    name, split_args, skip_fwd_decl, const_, tag_namespace \
+  ) \
     BOOST_PP_REPEAT_FROM_TO( \
-        skip_fwd_decl \
+        0 \
       , BOOST_PP_INC(BOOST_PP_TUPLE_ELEM(4, 2, split_args)) \
       , BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION \
-      , (name, split_args, const_) \
+      , (name, split_args, const_, tag_namespace, skip_fwd_decl) \
     ) \
  \
-    BOOST_PARAMETER_FUNCTION_INITIAL_DISPATCH_FUNCTION(name, split_args, const_) \
+    BOOST_PARAMETER_FUNCTION_INITIAL_DISPATCH_FUNCTION(name, split_args, const_, tag_namespace) \
 \
     template < \
         class ResultType \
@@ -562,9 +884,11 @@
           , split_args \
         ) \
     > \
+    BOOST_PARAMETER_MEMBER_FUNCTION_STATIC(name) \
     ResultType BOOST_PARAMETER_FUNCTION_DEFAULT_NAME(name)( \
         ResultType(*)() \
       , Args const& args \
+      , int \
         BOOST_PARAMETER_FUNCTION_DEFAULT_ARGUMENTS( \
             BOOST_PARAMETER_FUNCTION_DEFAULT_FUNCTION_ARG \
           , 0 \
@@ -574,9 +898,9 @@
 
 // Generates a bunch of forwarding functions that each extract
 // one more argument.
-# define BOOST_PARAMETER_FUNCTION_DEFAULT_LAYER(name, args, skip_fwd_decl, const_) \
+# define BOOST_PARAMETER_FUNCTION_DEFAULT_LAYER(name, args, skip_fwd_decl, const_, tag_ns) \
     BOOST_PARAMETER_FUNCTION_DEFAULT_LAYER_AUX( \
-        name, BOOST_PARAMETER_FUNCTION_SPLIT_ARGS(args), skip_fwd_decl, const_ \
+        name, BOOST_PARAMETER_FUNCTION_SPLIT_ARGS(args), skip_fwd_decl, const_, tag_ns \
     )
 /**/
 
@@ -597,7 +921,7 @@
       , BOOST_PARAMETER_FUNCTION_FWD_COMBINATIONS(args)                      \
     )                                                                        \
                                                                              \
-    BOOST_PARAMETER_FUNCTION_DEFAULT_LAYER(name, args, 0, 0)
+    BOOST_PARAMETER_FUNCTION_DEFAULT_LAYER(name, args, 0, 0, tag_namespace)
 
 // Defines a Boost.Parameter enabled function with the new syntax.
 # define BOOST_PARAMETER_FUNCTION(result, name, tag_namespace, args)    \
@@ -665,7 +989,7 @@
       , BOOST_PARAMETER_FUNCTION_FWD_COMBINATIONS(args)                      \
     )                                                                        \
                                                                              \
-    BOOST_PARAMETER_FUNCTION_DEFAULT_LAYER(name, args, 1, const_)
+    BOOST_PARAMETER_FUNCTION_DEFAULT_LAYER(name, args, 1, const_, tag_namespace)
 
 // Defines a Boost.Parameter enabled function with the new syntax.
 # define BOOST_PARAMETER_MEMBER_FUNCTION(result, name, tag_namespace, args)    \
@@ -806,7 +1130,7 @@
     )
 /**/
 
-# if !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
+# ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 #  define BOOST_PARAMETER_FUNCTION_FWD_COMBINATION(r, _, i, elem) \
     (BOOST_PP_IF( \
         BOOST_PARAMETER_FUNCTION_IS_KEYWORD_QUALIFIER( \
@@ -815,6 +1139,18 @@
       , (const ParameterArgumentType ## i)(ParameterArgumentType ## i) \
       , (const ParameterArgumentType ## i) \
     ))
+// MSVC6.5 lets us bind rvalues to T&.
+# elif BOOST_WORKAROUND(BOOST_MSVC, < 1300)
+#  define BOOST_PARAMETER_FUNCTION_FWD_COMBINATION(r, _, i, elem) \
+    (BOOST_PP_IF( \
+        BOOST_PARAMETER_FUNCTION_IS_KEYWORD_QUALIFIER( \
+            BOOST_PARAMETER_FN_ARG_NAME(elem) \
+        ) \
+      , (ParameterArgumentType ## i) \
+      , (const ParameterArgumentType ## i) \
+    ))
+// No partial ordering. This feature doesn't work.
+// This is exactly the same as for VC6.5, but we might change it later.
 # else
 #  define BOOST_PARAMETER_FUNCTION_FWD_COMBINATION(r, _, i, elem) \
     (BOOST_PP_IF( \

Modified: boost/trunk/boost/parameter/python.hpp
===================================================================
--- boost/trunk/boost/parameter/python.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/parameter/python.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,8 +22,10 @@
 # include <boost/mpl/next.hpp>
 # include <boost/mpl/begin_end.hpp>
 # include <boost/mpl/not.hpp>
+# include <boost/mpl/empty.hpp>
 # include <boost/python/def.hpp>
 # include <boost/python/make_constructor.hpp>
+# include <boost/python/init.hpp>
 # include <boost/python/to_python_converter.hpp>
 # include <boost/parameter/aux_/maybe.hpp>
 # include <boost/parameter/aux_/python/invoker.hpp>
@@ -323,7 +325,29 @@
       Def, Specs*, End, End, Invoker*)
   {}
 
-  template <class Class, class Options = int>
+  struct not_specified {};
+
+  template <class CallPolicies>
+  struct call_policies_as_options
+  {
+      call_policies_as_options(CallPolicies const& call_policies)
+        : call_policies(call_policies)
+      {}
+
+      CallPolicies const& policies() const
+      {
+          return call_policies;
+      }
+
+      char const* doc() const
+      {
+          return 0;
+      }
+
+      CallPolicies call_policies;
+  };
+
+  template <class Class, class Options = not_specified>
   struct def_class
   {
       def_class(Class& cl, char const* name, Options options = Options())
@@ -333,7 +357,7 @@
       {}
 
       template <class F>
-      void def(F f, int const*) const
+      void def(F f, not_specified const*) const
       {
           cl.def(name, f);
       }
@@ -351,7 +375,7 @@
       }
 
       template <class F, class Keywords>
-      void def(F f, Keywords const& keywords, int const*) const
+      void def(F f, Keywords const& keywords, not_specified const*) const
       {
           cl.def(name, f, keywords);
       }
@@ -373,11 +397,12 @@
       Options options;
   };
 
-  template <class Class>
+  template <class Class, class CallPolicies = boost::python::default_call_policies>
   struct def_init
   {
-      def_init(Class& cl)
+      def_init(Class& cl, CallPolicies call_policies = CallPolicies())
         : cl(cl)
+        , call_policies(call_policies)
       {}
 
       template <class F>
@@ -385,7 +410,7 @@
       {
           cl.def(
               "__init__"
-            , boost::python::make_constructor(f)
+            , boost::python::make_constructor(f, call_policies)
           );
       }
 
@@ -394,13 +419,12 @@
       {
           cl.def(
               "__init__"
-            , boost::python::make_constructor(
-                  f, boost::python::default_call_policies(), keywords
-              )
+            , boost::python::make_constructor(f, call_policies, keywords)
           );
       }
 
       Class& cl;
+      CallPolicies call_policies;
   };
 
   struct def_function
@@ -555,15 +579,32 @@
 
 } // namespace aux
 
-template <class Signature>
+template <class ParameterSpecs, class CallPolicies = boost::python::default_call_policies>
 struct init 
-  : boost::python::def_visitor<init<Signature> >
+  : boost::python::def_visitor<init<ParameterSpecs, CallPolicies> >
 {
+    init(CallPolicies call_policies = CallPolicies())
+      : call_policies(call_policies)
+    {}
+
+    template <class CallPolicies1>
+    init<ParameterSpecs, CallPolicies1> 
+    operator[](CallPolicies1 const& call_policies) const
+    {
+        return init<ParameterSpecs, CallPolicies1>(call_policies);
+    }
+
     template <class Class>
-    void visit(Class& cl) const
+    void visit_aux(Class& cl, mpl::true_) const
     {
+        cl.def(boost::python::init<>()[call_policies]);
+    }
+
+    template <class Class>
+    void visit_aux(Class& cl, mpl::false_) const
+    {
         typedef typename mpl::transform<
-            Signature
+            ParameterSpecs
           , aux::make_kw_spec<mpl::_>
           , mpl::back_inserter<mpl::vector0<> >
         >::type arg_specs;
@@ -576,30 +617,49 @@
         typedef typename mpl::shift_left<mpl::long_<1>, optional_arity>::type upper;
 
         aux::def_combinations(
-            aux::def_init<Class>(cl)
+            aux::def_init<Class, CallPolicies>(cl, call_policies)
           , (arg_specs*)0
           , mpl::long_<0>()
           , mpl::long_<upper::value>()
           , (aux::make_init_invoker<typename Class::wrapped_type>*)0
         );
     }
+
+    template <class Class>
+    void visit(Class& cl) const
+    {
+        visit_aux(cl, mpl::empty<ParameterSpecs>());
+    }
+
+    CallPolicies call_policies;
 };
 
-template <class Signature>
+template <class ParameterSpecs, class CallPolicies = boost::python::default_call_policies>
 struct call 
-  : boost::python::def_visitor<call<Signature> >
+  : boost::python::def_visitor<call<ParameterSpecs, CallPolicies> >
 {
+    call(CallPolicies const& call_policies = CallPolicies())
+      : call_policies(call_policies)
+    {}
+
+    template <class CallPolicies1>
+    call<ParameterSpecs, CallPolicies1>
+    operator[](CallPolicies1 const& call_policies) const
+    {
+        return call<ParameterSpecs, CallPolicies1>(call_policies);
+    }
+
     template <class Class>
     void visit(Class& cl) const
     {
         typedef mpl::iterator_range<
             typename mpl::next<
-                typename mpl::begin<Signature>::type
+                typename mpl::begin<ParameterSpecs>::type
             >::type
-          , typename mpl::end<Signature>::type
+          , typename mpl::end<ParameterSpecs>::type
         > arg_types;
 
-        typedef typename mpl::front<Signature>::type result_type;
+        typedef typename mpl::front<ParameterSpecs>::type result_type;
 
         typedef typename mpl::transform<
             arg_types
@@ -614,31 +674,35 @@
 
         typedef typename mpl::shift_left<mpl::long_<1>, optional_arity>::type upper;
 
+        typedef aux::call_policies_as_options<CallPolicies> options;
+
         aux::def_combinations(
-            aux::def_class<Class>(cl, "__call__")
+            aux::def_class<Class, options>(cl, "__call__", options(call_policies))
           , (arg_specs*)0
           , mpl::long_<0>()
           , mpl::long_<upper::value>()
           , (aux::make_call_invoker<typename Class::wrapped_type, result_type>*)0
         );
     }
+
+    CallPolicies call_policies;
 };
 
-template <class Fwd, class Signature>
+template <class Fwd, class ParameterSpecs>
 struct function 
-  : boost::python::def_visitor<function<Fwd, Signature> >
+  : boost::python::def_visitor<function<Fwd, ParameterSpecs> >
 {
     template <class Class, class Options>
     void visit(Class& cl, char const* name, Options const& options) const
     {
         typedef mpl::iterator_range<
             typename mpl::next<
-                typename mpl::begin<Signature>::type
+                typename mpl::begin<ParameterSpecs>::type
             >::type
-          , typename mpl::end<Signature>::type
+          , typename mpl::end<ParameterSpecs>::type
         > arg_types;
 
-        typedef typename mpl::front<Signature>::type result_type;
+        typedef typename mpl::front<ParameterSpecs>::type result_type;
 
         typedef typename mpl::transform<
             arg_types

Copied: boost/trunk/boost/parameter/value_type.hpp (from rev 14034, boost/branches/upstream/current/boost/parameter/value_type.hpp)

Modified: boost/trunk/boost/parameter.hpp
===================================================================
--- boost/trunk/boost/parameter.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/parameter.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,8 +9,11 @@
 #include <boost/parameter/parameters.hpp>
 #include <boost/parameter/keyword.hpp>
 #include <boost/parameter/binding.hpp>
+#include <boost/parameter/value_type.hpp>
 #include <boost/parameter/macros.hpp>
 #include <boost/parameter/match.hpp>
+#include <boost/parameter/name.hpp>
+#include <boost/parameter/preprocessor.hpp>
 
 #endif // BOOST_PARAMETER_050401_HPP
 

Modified: boost/trunk/boost/pending/container_traits.hpp
===================================================================
--- boost/trunk/boost/pending/container_traits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/pending/container_traits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -39,12 +39,6 @@
 #  endif
 #endif
 
-#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
-// Stay out of the way of concept checking class templates
-# define Container Container_
-# define AssociativeContainer AssociativeContainer_
-#endif
-
 // The content of this file is in 'graph_detail' because otherwise
 // there will be name clashes with 
 // sandbox/boost/sequence_algo/container_traits.hpp
@@ -416,10 +410,4 @@
 
 }} // namespace boost::graph_detail
 
-#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
-// Stay out of the way of concept checking class templates
-# undef Container
-# undef AssociativeContainer
-#endif
-
 #endif // BOOST_GRAPH_DETAIL_CONTAINER_TRAITS_H

Modified: boost/trunk/boost/pending/fibonacci_heap.hpp
===================================================================
--- boost/trunk/boost/pending/fibonacci_heap.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/pending/fibonacci_heap.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -140,6 +140,7 @@
       _right[t] = u;
       _left[_right[u]] = u;
     }
+    _p[u] = v;
   }
   // 41
   inline void rebuild_root_list(LinkIter new_roots, int& h)

Modified: boost/trunk/boost/pending/property_serialize.hpp
===================================================================
--- boost/trunk/boost/pending/property_serialize.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/pending/property_serialize.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,11 +8,8 @@
 
 #include <boost/pending/property.hpp>
 
-// Wierd, I get compilation errors if the following include is
-// removed, but it shouldn't be needed. Some kind of strange
-// include dependency in the serialization library.
-#include <boost/archive/text_iarchive.hpp>
 #include <boost/serialization/base_object.hpp>
+#include <boost/serialization/nvp.hpp>
 
 namespace boost {
   template<class Archive>
@@ -23,8 +20,8 @@
   serialize(Archive& ar, property<Tag, T, Base>& prop, 
             const unsigned int version) 
   {
-    ar & boost::serialization::base_object<Base>(prop);
-    ar & prop.m_value;
+    ar & serialization::make_nvp( "property_base" , boost::serialization::base_object<Base>(prop) );
+    ar & serialization::make_nvp( "property_value" , prop.m_value );
   }
 } // end namespace boost
 

Modified: boost/trunk/boost/pending/stringtok.hpp
===================================================================
--- boost/trunk/boost/pending/stringtok.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/pending/stringtok.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -63,15 +63,15 @@
  * This is the only part of the implementation that I don't like.
  * It can probably be improved upon by the reader...
 */
-namespace {
+
     inline bool
     isws (char c, char const * const wstr)
     {
         using namespace std;
         return (strchr(wstr,c) != NULL);
     }
-}
 
+
 namespace boost {
 
 /*****************************************************************

Modified: boost/trunk/boost/pool/detail/for.m4
===================================================================
--- boost/trunk/boost/pool/detail/for.m4	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/pool/detail/for.m4	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,8 @@
 m4_dnl 
 m4_dnl Copyright (C) 2000 Stephen Cleary
 m4_dnl 
-m4_dnl This file can be redistributed and/or modified under the terms found
-m4_dnl  in "copyright.html"
-m4_dnl This software and its documentation is provided "as is" without express or
-m4_dnl  implied warranty, and with no claim as to its suitability for any purpose.
+m4_dnl Distributed under the Boost Software License, Version 1.0. (See accompany-
+m4_dnl ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 m4_dnl
 m4_dnl See http://www.boost.org for updates, documentation, and revision history.
 m4_dnl 

Modified: boost/trunk/boost/pool/detail/pool_construct.bat
===================================================================
--- boost/trunk/boost/pool/detail/pool_construct.bat	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/pool/detail/pool_construct.bat	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,14 +2,11 @@
 rem
 rem Copyright (C) 2000, 2001 Stephen Cleary
 rem
-rem This file can be redistributed and/or modified under the terms found
-rem  in "copyright.html"
-rem This software and its documentation is provided "as is" without express or
-rem  implied warranty, and with no claim as to its suitability for any purpose.
-rem
-rem See http://www.boost.org for updates, documentation, and revision history.
-rem
+rem Distributed under the Boost Software License, Version 1.0. (See accompany-
+rem ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
+
+
 rem Check for Windows NT
 if %OS%==Windows_NT goto NT
 

Modified: boost/trunk/boost/pool/detail/pool_construct.m4
===================================================================
--- boost/trunk/boost/pool/detail/pool_construct.m4	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/pool/detail/pool_construct.m4	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,8 @@
 m4_dnl
 m4_dnl Copyright (C) 2000 Stephen Cleary
 m4_dnl
-m4_dnl This file can be redistributed and/or modified under the terms found
-m4_dnl  in "copyright.html"
-m4_dnl This software and its documentation is provided "as is" without express or
-m4_dnl  implied warranty, and with no claim as to its suitability for any purpose.
+m4_dnl Distributed under the Boost Software License, Version 1.0. (See accompany-
+m4_dnl ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 m4_dnl
 m4_dnl See http://www.boost.org for updates, documentation, and revision history.
 m4_dnl
@@ -42,10 +40,8 @@
 m4_dnl
 // Copyright (C) 2000 Stephen Cleary
 //
-// This file can be redistributed and/or modified under the terms found
-//  in "copyright.html"
-// This software and its documentation is provided "as is" without express or
-//  implied warranty, and with no claim as to its suitability for any purpose.
+// Distributed under the Boost Software License, Version 1.0. (See accompany-
+// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //
 // See http://www.boost.org for updates, documentation, and revision history.
 

Modified: boost/trunk/boost/pool/detail/pool_construct.sh
===================================================================
--- boost/trunk/boost/pool/detail/pool_construct.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/pool/detail/pool_construct.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,10 +2,8 @@
 #
 # Copyright (C) 2000 Stephen Cleary
 #
-# This file can be redistributed and/or modified under the terms found
-#  in "copyright.html"
-# This software and its documentation is provided "as is" without express or
-#  implied warranty, and with no claim as to its suitability for any purpose.
+# Distributed under the Boost Software License, Version 1.0. (See accompany-
+# ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # See http://www.boost.org for updates, documentation, and revision history.
 #

Modified: boost/trunk/boost/pool/detail/pool_construct_simple.bat
===================================================================
--- boost/trunk/boost/pool/detail/pool_construct_simple.bat	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/pool/detail/pool_construct_simple.bat	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,10 +2,8 @@
 rem
 rem Copyright (C) 2001 Stephen Cleary
 rem
-rem This file can be redistributed and/or modified under the terms found
-rem  in "copyright.html"
-rem This software and its documentation is provided "as is" without express or
-rem  implied warranty, and with no claim as to its suitability for any purpose.
+rem Distributed under the Boost Software License, Version 1.0. (See accompany-
+rem ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 rem
 rem See http://www.boost.org for updates, documentation, and revision history.
 rem

Modified: boost/trunk/boost/pool/detail/pool_construct_simple.m4
===================================================================
--- boost/trunk/boost/pool/detail/pool_construct_simple.m4	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/pool/detail/pool_construct_simple.m4	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,8 @@
 m4_dnl
 m4_dnl Copyright (C) 2001 Stephen Cleary
 m4_dnl
-m4_dnl This file can be redistributed and/or modified under the terms found
-m4_dnl  in "copyright.html"
-m4_dnl This software and its documentation is provided "as is" without express or
-m4_dnl  implied warranty, and with no claim as to its suitability for any purpose.
+m4_dnl Distributed under the Boost Software License, Version 1.0. (See accompany-
+m4_dnl ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 m4_dnl
 m4_dnl See http://www.boost.org for updates, documentation, and revision history.
 m4_dnl

Modified: boost/trunk/boost/pool/detail/pool_construct_simple.sh
===================================================================
--- boost/trunk/boost/pool/detail/pool_construct_simple.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/pool/detail/pool_construct_simple.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,10 +2,8 @@
 #
 # Copyright (C) 2001 Stephen Cleary
 #
-# This file can be redistributed and/or modified under the terms found
-#  in "copyright.html"
-# This software and its documentation is provided "as is" without express or
-#  implied warranty, and with no claim as to its suitability for any purpose.
+# Distributed under the Boost Software License, Version 1.0. (See accompany-
+# ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # See http://www.boost.org for updates, documentation, and revision history.
 #

Modified: boost/trunk/boost/pool/pool.hpp
===================================================================
--- boost/trunk/boost/pool/pool.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/pool/pool.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -502,7 +502,7 @@
   const size_type partition_size = alloc_size();
   const size_type total_req_size = n * requested_size;
   const size_type num_chunks = total_req_size / partition_size +
-      static_cast<bool>(total_req_size % partition_size);
+      ((total_req_size % partition_size) ? true : false);
 
   void * ret = store().malloc_n(num_chunks, partition_size);
 

Modified: boost/trunk/boost/program_options/positional_options.hpp
===================================================================
--- boost/trunk/boost/program_options/positional_options.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/program_options/positional_options.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -41,7 +41,7 @@
         add(const char* name, int max_count);
 
         /** Returns the maximum number of positional options that can
-            be present. Can return numeric_limits<unsigned>::max() to
+            be present. Can return (numeric_limits<unsigned>::max)() to
             indicate unlimited number. */
         unsigned max_total_count() const;
 

Modified: boost/trunk/boost/program_options/variables_map.hpp
===================================================================
--- boost/trunk/boost/program_options/variables_map.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/program_options/variables_map.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,6 +24,27 @@
     class value_semantic;
     class variables_map;
 
+    // forward declaration
+
+    /** Stores in 'm' all options that are defined in 'options'. 
+        If 'm' already has a non-defaulted value of an option, that value
+        is not changed, even if 'options' specify some value.        
+    */
+    BOOST_PROGRAM_OPTIONS_DECL void store(const basic_parsed_options<char>& options, variables_map& m,
+                    bool utf8 = false);
+
+    /** Stores in 'm' all options that are defined in 'options'. 
+        If 'm' already has a non-defaulted value of an option, that value
+        is not changed, even if 'options' specify some value.        
+        This is wide character variant.
+    */
+    BOOST_PROGRAM_OPTIONS_DECL void store(const basic_parsed_options<wchar_t>& options, 
+                    variables_map& m);
+
+
+    /** Runs all 'notify' function for options in 'm'. */
+    BOOST_PROGRAM_OPTIONS_DECL void notify(variables_map& m);
+
     /** Class holding value of option. Contains details about how the 
         value is set and allows to conveniently obtain the value.
     */
@@ -36,11 +57,16 @@
 
         /** If stored value if of type T, returns that value. Otherwise,
             throws boost::bad_any_cast exception. */
-        template<class T> const T& as() const;
+       template<class T>
+       const T& as() const {
+           return boost::any_cast<const T&>(v);
+       }
+       /** @overload */
+       template<class T>
+       T& as() {
+           return boost::any_cast<T&>(v);
+       }
 
-        /** @overload */
-        template<class T> T& as();
-
         /// Returns true if no value is stored.
         bool empty() const;
         /** Returns true if the value was not explicitly
@@ -61,10 +87,9 @@
         // be easily accessible, so we need to store semantic here.
         shared_ptr<const value_semantic> m_value_semantic;
 
-        friend BOOST_PROGRAM_OPTIONS_DECL void 
-        store(const basic_parsed_options<char>& options, 
+        friend void store(const basic_parsed_options<char>& options, 
               variables_map& m, bool);
-        friend BOOST_PROGRAM_OPTIONS_DECL void notify(variables_map& m);
+        friend void notify(variables_map& m);
     };
 
     /** Implements string->string mapping with convenient value casting
@@ -134,26 +159,7 @@
                           bool utf8);
     };
 
-    /** Stores in 'm' all options that are defined in 'options'. 
-        If 'm' already has a non-defaulted value of an option, that value
-        is not changed, even if 'options' specify some value.        
-    */
-    BOOST_PROGRAM_OPTIONS_DECL void store(const basic_parsed_options<char>& options, variables_map& m,
-                    bool utf8 = false);
 
-    /** Stores in 'm' all options that are defined in 'options'. 
-        If 'm' already has a non-defaulted value of an option, that value
-        is not changed, even if 'options' specify some value.        
-        This is wide character variant.
-    */
-    BOOST_PROGRAM_OPTIONS_DECL void store(const basic_parsed_options<wchar_t>& options, 
-                    variables_map& m);
-
-
-    /** Runs all 'notify' function for options in 'm'. */
-    BOOST_PROGRAM_OPTIONS_DECL void notify(variables_map& m);
-
-
     /*
      * Templates/inlines
      */
@@ -184,18 +190,6 @@
         return v;
     }
 
-
-    template<class T>
-    const T&
-    variable_value::as() const {
-        return boost::any_cast<const T&>(v);
-    }
-
-    template<class T>
-    T&
-    variable_value::as() {
-        return boost::any_cast<T&>(v);
-    }
 }}
 
 #endif

Modified: boost/trunk/boost/property_map.hpp
===================================================================
--- boost/trunk/boost/property_map.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/property_map.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,8 +14,6 @@
 #include <boost/detail/iterator.hpp>
 #include <boost/concept_check.hpp>
 #include <boost/concept_archetype.hpp>
-#include <boost/mpl/assert.hpp>
-#include <boost/type_traits/is_same.hpp>
 
 namespace boost {
 
@@ -242,7 +240,8 @@
       function_requires< ConvertibleConcept<Category, LvalueTag> >();
 
       typedef typename property_traits<PMap>::value_type value_type;
-      BOOST_MPL_ASSERT((boost::is_same<const value_type&, reference>));
+      typedef typename require_same<
+        const value_type&, reference>::type req;
 
       reference ref = pmap[k];
       ignore_unused_variable_warning(ref);
@@ -274,7 +273,9 @@
       boost::function_requires<ConvertibleConcept<Category, LvalueTag> >();
       
       typedef typename property_traits<PMap>::value_type value_type;
-      BOOST_MPL_ASSERT((boost::is_same<value_type&, reference>));
+      typedef typename require_same<
+        value_type&,
+        reference>::type req;
 
       reference ref = pmap[k];
       ignore_unused_variable_warning(ref);

Modified: boost/trunk/boost/property_map_iterator.hpp
===================================================================
--- boost/trunk/boost/property_map_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/property_map_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -63,7 +63,7 @@
 
 
     {
-      friend class iterator_core_access;
+      friend class boost::iterator_core_access;
 
       typedef iterator_adaptor< readable_pmap_iter< Iterator, ReadablePropertyMap >,
                                 Iterator,

Modified: boost/trunk/boost/ptr_container/detail/reversible_ptr_container.hpp
===================================================================
--- boost/trunk/boost/ptr_container/detail/reversible_ptr_container.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/ptr_container/detail/reversible_ptr_container.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -82,7 +82,11 @@
     class reversible_ptr_container 
     {
     private:
+#ifdef  __MWERKS__
+        enum { allow_null = Config::allow_null };
+#else
         BOOST_STATIC_CONSTANT( bool, allow_null = Config::allow_null );
+#endif        
         
         typedef BOOST_DEDUCED_TYPENAME Config::value_type Ty_;
 

Modified: boost/trunk/boost/ptr_container/ptr_map_adapter.hpp
===================================================================
--- boost/trunk/boost/ptr_container/ptr_map_adapter.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/ptr_container/ptr_map_adapter.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -452,7 +452,7 @@
             return this->single_transfer( first, last, from );
         }
 
-#ifdef BOOST_NO_SFINAE
+#if defined(BOOST_NO_SFINAE) || BOOST_WORKAROUND(__SUNPRO_CC, <= 0x580)
 #else    
 
         template< class PtrMapAdapter, class Range >
@@ -627,7 +627,7 @@
             return this->multi_transfer( first, last, from );
         }
 
-#ifdef BOOST_NO_SFINAE
+#if defined(BOOST_NO_SFINAE) || BOOST_WORKAROUND(__SUNPRO_CC, <= 0x580)        
 #else    
 
         template<  class PtrMapAdapter, class Range >

Modified: boost/trunk/boost/ptr_container/ptr_sequence_adapter.hpp
===================================================================
--- boost/trunk/boost/ptr_container/ptr_sequence_adapter.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/ptr_container/ptr_sequence_adapter.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -312,11 +312,6 @@
         template< class InputIterator >
         void assign( InputIterator first, InputIterator last ) // strong
         { 
-//#ifdef BOOST_NO_SFINAE
-//#else
-//            BOOST_STATIC_ASSERT(( boost::is_convertible< typename iterator_reference<InputIterator>::type,
-//                                                         reference_type >::value ));
-//#endif            
             base_type temp( first, last );
             this->swap( temp );
         }
@@ -355,7 +350,7 @@
                          iterator_category<InputIterator>::type() );
         } 
 
-#if defined(BOOST_NO_SFINAE) || defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
+#if defined(BOOST_NO_SFINAE) || BOOST_WORKAROUND(__SUNPRO_CC, <= 0x580)
 #else
         template< class Range >
         BOOST_DEDUCED_TYPENAME
@@ -397,7 +392,7 @@
             from.c_private().erase( object.base() );      // nothrow
         }
 
-#ifdef BOOST_NO_SFINAE
+#if defined(BOOST_NO_SFINAE) || BOOST_WORKAROUND(__SUNPRO_CC, <= 0x580)
 #else
         
         template< class PtrSeqAdapter, class Range >

Modified: boost/trunk/boost/ptr_container/ptr_set_adapter.hpp
===================================================================
--- boost/trunk/boost/ptr_container/ptr_set_adapter.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/ptr_container/ptr_set_adapter.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -308,7 +308,7 @@
             set_basic_clone_and_insert( first, last );
         }
 
-#if defined(BOOST_NO_SFINAE) || defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
+#if defined(BOOST_NO_SFINAE) || BOOST_WORKAROUND(__SUNPRO_CC, <= 0x580)
 #else    
         
         template< class Range >
@@ -337,7 +337,7 @@
             return this->single_transfer( first, last, from );
         }
 
-#ifdef BOOST_NO_SFINAE
+#if defined(BOOST_NO_SFINAE) || BOOST_WORKAROUND(__SUNPRO_CC, <= 0x580)
 #else    
 
         template< class PtrSetAdapter, class Range >
@@ -458,7 +458,7 @@
             set_basic_clone_and_insert( first, last );
         }
 
-#ifdef BOOST_NO_SFINAE
+#if defined(BOOST_NO_SFINAE) || BOOST_WORKAROUND(__SUNPRO_CC, <= 0x580)
 #else    
         
         template< class Range >
@@ -486,7 +486,7 @@
             return this->multi_transfer( first, last, from );
         }
 
-#ifdef BOOST_NO_SFINAE
+#if defined(BOOST_NO_SFINAE) || BOOST_WORKAROUND(__SUNPRO_CC, <= 0x580)
 #else    
         
         template< class PtrSetAdapter, class Range >

Modified: boost/trunk/boost/python/converter/builtin_converters.hpp
===================================================================
--- boost/trunk/boost/python/converter/builtin_converters.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/converter/builtin_converters.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,6 +7,7 @@
 # include <boost/python/detail/prefix.hpp>
 # include <boost/python/detail/none.hpp>
 # include <boost/python/handle.hpp>
+# include <boost/python/ssize_t.hpp>
 # include <boost/implicit_cast.hpp>
 # include <string>
 # include <complex>
@@ -115,9 +116,9 @@
 
 BOOST_PYTHON_TO_PYTHON_BY_VALUE(char, converter::do_return_to_python(x))
 BOOST_PYTHON_TO_PYTHON_BY_VALUE(char const*, converter::do_return_to_python(x))
-BOOST_PYTHON_TO_PYTHON_BY_VALUE(std::string, ::PyString_FromStringAndSize(x.data(),implicit_cast<Py_ssize_t>(x.size())))
+BOOST_PYTHON_TO_PYTHON_BY_VALUE(std::string, ::PyString_FromStringAndSize(x.data(),implicit_cast<ssize_t>(x.size())))
 #if defined(Py_USING_UNICODE) && !defined(BOOST_NO_STD_WSTRING)
-BOOST_PYTHON_TO_PYTHON_BY_VALUE(std::wstring, ::PyUnicode_FromWideChar(x.data(),implicit_cast<Py_ssize_t>(x.size())))
+BOOST_PYTHON_TO_PYTHON_BY_VALUE(std::wstring, ::PyUnicode_FromWideChar(x.data(),implicit_cast<ssize_t>(x.size())))
 # endif 
 BOOST_PYTHON_TO_PYTHON_BY_VALUE(float, ::PyFloat_FromDouble(x))
 BOOST_PYTHON_TO_PYTHON_BY_VALUE(double, ::PyFloat_FromDouble(x))

Modified: boost/trunk/boost/python/converter/implicit.hpp
===================================================================
--- boost/trunk/boost/python/converter/implicit.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/converter/implicit.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -29,8 +29,12 @@
     static void construct(PyObject* obj, rvalue_from_python_stage1_data* data)
     {
         void* storage = ((rvalue_from_python_storage<Target>*)data)->storage.bytes;
+
+        arg_from_python<Source> get_source(obj);
+        bool convertible = get_source.convertible();
+        BOOST_ASSERT(convertible);
         
-        new (storage) Target(extract<Source>(obj)());
+        new (storage) Target(get_source());
         
         // record successful construction
         data->convertible = storage;

Modified: boost/trunk/boost/python/detail/config.hpp
===================================================================
--- boost/trunk/boost/python/detail/config.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/detail/config.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -114,4 +114,24 @@
 # define BOOST_PYTHON_OFFSETOF offsetof
 #endif
 
+//  enable automatic library variant selection  ------------------------------// 
+
+#if !defined(BOOST_PYTHON_SOURCE) && !defined(BOOST_ALL_NO_LIB) && !defined(BOOST_PYTHON_NO_LIB)
+//
+// Set the name of our library, this will get undef'ed by auto_link.hpp
+// once it's done with it:
+//
+#define BOOST_LIB_NAME boost_python
+//
+// If we're importing code from a dll, then tell auto_link.hpp about it:
+//
+#ifdef BOOST_PYTHON_DYNAMIC_LIB
+#  define BOOST_DYN_LINK
+#endif
+//
+// And include the header that does the work:
+//
+#include <boost/config/auto_link.hpp>
+#endif  // auto-linking disabled
+
 #endif // CONFIG_DWA052200_H_

Modified: boost/trunk/boost/python/detail/python22_fixed.h
===================================================================
--- boost/trunk/boost/python/detail/python22_fixed.h	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/detail/python22_fixed.h	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,8 @@
 //    Copyright (c) 2001, 2002 Python Software Foundation; All Rights
 //    Reserved
 //
+// boostinspect:nolicense (don't complain about the lack of a Boost license)
+//
 // Changes from the original:
 //  1. #includes <unistd.h> for Python 2.2.1
 //  2. Provides missing extern "C" wrapper for  "iterobject.h" and  "descrobject.h".

Modified: boost/trunk/boost/python/detail/unwrap_wrapper.hpp
===================================================================
--- boost/trunk/boost/python/detail/unwrap_wrapper.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/detail/unwrap_wrapper.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,43 +6,29 @@
 
 # include <boost/python/detail/prefix.hpp>
 # include <boost/python/detail/is_wrapper.hpp>
-#  if defined(BOOST_PYTHON_NO_SFINAE)
-#   include <boost/mpl/eval_if.hpp>
-#   include <boost/mpl/identity.hpp>
-#  else 
-#   include <boost/python/detail/enable_if.hpp>
-#  endif 
+# include <boost/mpl/eval_if.hpp>
+# include <boost/mpl/identity.hpp>
 
 namespace boost { namespace python { namespace detail { 
 
-#  if defined(BOOST_PYTHON_NO_SFINAE)
 template <class T>
 struct unwrap_wrapper_helper
 {
     typedef typename T::_wrapper_wrapped_type_ type;
 };
-  
+
 template <class T>
-typename mpl::eval_if<is_wrapper<T>,unwrap_wrapper_helper<T>,mpl::identity<T> >::type*
-unwrap_wrapper(T*)
-{
-    return 0;
-}
-#  else 
+struct unwrap_wrapper_
+  : mpl::eval_if<is_wrapper<T>,unwrap_wrapper_helper<T>,mpl::identity<T> >
+{};
+
 template <class T>
-typename disable_if_ret<is_wrapper<T>,T*>::type
+typename unwrap_wrapper_<T>::type*
 unwrap_wrapper(T*)
 {
     return 0;
 }
 
-template <class T>
-T* unwrap_wrapper(wrapper<T>*)
-{
-    return 0;
-}
-#  endif 
-
 }}} // namespace boost::python::detail
 
 #endif // UNWRAP_WRAPPER_DWA2004723_HPP

Modified: boost/trunk/boost/python/detail/wrap_python.hpp
===================================================================
--- boost/trunk/boost/python/detail/wrap_python.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/detail/wrap_python.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -48,7 +48,7 @@
 #endif
 
 # include <pyconfig.h>
-# if defined(_SGI_COMPILER_VERSION) && _SGI_COMPILER_VERSION == 741
+# if defined(_SGI_COMPILER_VERSION) && _SGI_COMPILER_VERSION >= 740
 #  undef _POSIX_C_SOURCE
 #  undef _XOPEN_SOURCE
 # endif
@@ -141,12 +141,6 @@
 # include <Python.h>
 #endif
 
-#if PY_VERSION_HEX < 0x02050000
-typedef int Py_ssize_t;
-#define PY_SSIZE_T_MIN INT_MIN
-#define PY_SSIZE_T_MAX INT_MAX
-#endif
-
 #ifdef BOOST_PYTHON_ULONG_MAX_UNDEFINED
 # undef ULONG_MAX
 # undef BOOST_PYTHON_ULONG_MAX_UNDEFINED

Modified: boost/trunk/boost/python/docstring_options.hpp
===================================================================
--- boost/trunk/boost/python/docstring_options.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/docstring_options.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -62,7 +62,7 @@
         show_signatures_ = true;
       }
 
-      friend class objects::function;
+      friend struct objects::function;
 
   private:
       static volatile bool show_user_defined_;

Modified: boost/trunk/boost/python/exec.hpp
===================================================================
--- boost/trunk/boost/python/exec.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/exec.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,12 +17,14 @@
 // global and local are the global and local scopes respectively,
 // used during execution.
 object 
+BOOST_PYTHON_DECL 
 exec(str string, object global = object(), object local = object());
 
 // Execute python source code from file filename.
 // global and local are the global and local scopes respectively,
 // used during execution.
 object 
+BOOST_PYTHON_DECL 
 exec_file(str filename, object global = object(), object local = object());
 
 }

Modified: boost/trunk/boost/python/import.hpp
===================================================================
--- boost/trunk/boost/python/import.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/import.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,7 +14,7 @@
 {
 
 // Import the named module and return a reference to it.
-object import(str name);
+object BOOST_PYTHON_DECL import(str name);
 
 }
 }

Modified: boost/trunk/boost/python/list.hpp
===================================================================
--- boost/trunk/boost/python/list.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/list.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,6 +9,7 @@
 
 # include <boost/python/object.hpp>
 # include <boost/python/converter/pytype_object_mgr_traits.hpp>
+# include <boost/python/ssize_t.hpp>
 
 namespace boost { namespace python { 
 
@@ -24,11 +25,11 @@
     
       long index(object_cref value) const; // return index of first occurrence of value
 
-      void insert(Py_ssize_t index, object_cref); // insert object before index
+      void insert(ssize_t index, object_cref); // insert object before index
       void insert(object const& index, object_cref);
 
       object pop(); // remove and return item at index (default last)
-      object pop(Py_ssize_t index);
+      object pop(ssize_t index);
       object pop(object const& index);
 
       void remove(object_cref value); // remove first occurrence of value
@@ -86,7 +87,7 @@
     }
     
     template <class T>
-    void insert(Py_ssize_t index, T const& x) // insert object before index
+    void insert(ssize_t index, T const& x) // insert object before index
     {
         base::insert(index, object(x));
     }
@@ -98,7 +99,7 @@
     }
 
     object pop() { return base::pop(); }
-    object pop(Py_ssize_t index) { return base::pop(index); }
+    object pop(ssize_t index) { return base::pop(index); }
     
     template <class T>
     object pop(T const& index)

Modified: boost/trunk/boost/python/numeric.hpp
===================================================================
--- boost/trunk/boost/python/numeric.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/numeric.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,6 +17,8 @@
 
 namespace boost { namespace python { namespace numeric {
 
+class array;
+
 namespace aux
 {
   struct BOOST_PYTHON_DECL array_base : object
@@ -36,19 +38,20 @@
       void info() const;
       bool is_c_array() const;
       bool isbyteswapped() const;
-      object new_(object type) const;
+      array new_(object type) const;
       void sort();
       object trace(long offset = 0, long axis1 = 0, long axis2 = 1) const;
       object type() const;
       char typecode() const;
-      
-      object factory(object const& buffer=object()
-            , object const& type=object()
-            , object const& shape=object()
-            , bool copy = true
-            , bool savespace = false
-            , object typecode = object());
 
+      object factory(
+          object const& sequence = object()
+        , object const& typecode = object()
+        , bool copy = true
+        , bool savespace = false
+        , object type = object()
+        , object shape = object());
+
       object getflat() const;
       long getrank() const;
       object getshape() const;
@@ -106,7 +109,7 @@
     }
 
     template <class Type>
-    object new_(Type const& type_) const
+    array new_(Type const& type_) const
     {
         return base::new_(object(type_));
     }
@@ -162,43 +165,48 @@
         return base::factory();
     }
     
-    template <class Buffer>
-    object factory(Buffer const& buffer)
+    template <class Sequence>
+    object factory(Sequence const& sequence)
     {
-        return base::factory(object(buffer));
+        return base::factory(object(sequence));
     }
     
-    template <class Buffer, class Type>
+    template <class Sequence, class Typecode>
     object factory(
-        Buffer const& buffer
-        , Type const& type_)
+        Sequence const& sequence
+      , Typecode const& typecode_
+      , bool copy = true
+      , bool savespace = false
+    )
     {
-        return base::factory(object(buffer), object(type_));
+        return base::factory(object(sequence), object(typecode_), copy, savespace);
     }
 
-    template <class Buffer, class Type, class Shape>
+    template <class Sequence, class Typecode, class Type>
     object factory(
-        Buffer const& buffer
-        , Type const& type_
-        , Shape const& shape
-        , bool copy = true
-        , bool savespace = false)
+        Sequence const& sequence
+      , Typecode const& typecode_
+      , bool copy
+      , bool savespace
+      , Type const& type
+    )
     {
-        return base::factory(object(buffer), object(type_), object(shape), copy, savespace);
+        return base::factory(object(sequence), object(typecode_), copy, savespace, object(type));
     }
     
-    template <class Buffer, class Type, class Shape>
+    template <class Sequence, class Typecode, class Type, class Shape>
     object factory(
-        Buffer const& buffer
-        , Type const& type_
-        , Shape const& shape
-        , bool copy
-        , bool savespace
-        , char typecode)
+        Sequence const& sequence
+      , Typecode const& typecode_
+      , bool copy
+      , bool savespace
+      , Type const& type
+      , Shape const& shape
+    )
     {
-        return base::factory(object(buffer), object(type_), object(shape), copy, savespace, object(typecode));
+        return base::factory(object(sequence), object(typecode_), copy, savespace, object(type), object(shape));
     }
-
+    
 # define BOOST_PYTHON_ENUM_AS_OBJECT(z, n, x) object(BOOST_PP_CAT(x,n))
 # define BOOST_PP_LOCAL_MACRO(n)                                        \
     template <BOOST_PP_ENUM_PARAMS_Z(1, n, class T)>                    \
@@ -210,6 +218,7 @@
 # undef BOOST_PYTHON_AS_OBJECT
 
     static BOOST_PYTHON_DECL void set_module_and_type(char const* package_name = 0, char const* type_attribute_name = 0);
+    static BOOST_PYTHON_DECL std::string get_module_name();
 
  public: // implementation detail -- for internal use only
     BOOST_PYTHON_FORWARD_OBJECT_CONSTRUCTORS(array, base);

Modified: boost/trunk/boost/python/object/pointer_holder.hpp
===================================================================
--- boost/trunk/boost/python/object/pointer_holder.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/object/pointer_holder.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -179,7 +179,7 @@
                 BOOST_PP_REPEAT_1ST(N, BOOST_PYTHON_UNFORWARD_LOCAL, nil)
             ))
     {
-        python::detail::initialize_wrapper(self, &*this->m_p);
+        python::detail::initialize_wrapper(self, get_pointer(this->m_p));
     }
 
 # undef N

Modified: boost/trunk/boost/python/object.hpp
===================================================================
--- boost/trunk/boost/python/object.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/object.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
 #ifndef OBJECT_DWA2002612_HPP
 # define OBJECT_DWA2002612_HPP
 
-# include <boost/python/detail/prefix.hpp>
+# include <boost/python/ssize_t.hpp>
 # include <boost/python/object_core.hpp>
 # include <boost/python/object_attributes.hpp>
 # include <boost/python/object_items.hpp>
@@ -15,9 +15,9 @@
 
 namespace boost { namespace python {
 
-    inline Py_ssize_t len(object const& obj)
+    inline ssize_t len(object const& obj)
     {
-        Py_ssize_t result = PyObject_Length(obj.ptr());
+        ssize_t result = PyObject_Length(obj.ptr());
         if (PyErr_Occurred()) throw_error_already_set();
         return result;
     }

Modified: boost/trunk/boost/python/object_operators.hpp
===================================================================
--- boost/trunk/boost/python/object_operators.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/object_operators.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -73,17 +73,11 @@
 
 # define BOOST_PYTHON_COMPARE_OP(op, opid)                              \
 template <class L, class R>                                             \
-BOOST_PYTHON_BINARY_RETURN(bool) operator op(L const& l, R const& r)    \
+BOOST_PYTHON_BINARY_RETURN(object) operator op(L const& l, R const& r)    \
 {                                                                       \
-    return PyObject_RichCompareBool(                                    \
+    return PyObject_RichCompare(                                    \
         object(l).ptr(), object(r).ptr(), opid);                        \
 }
-BOOST_PYTHON_COMPARE_OP(>, Py_GT)
-BOOST_PYTHON_COMPARE_OP(>=, Py_GE)
-BOOST_PYTHON_COMPARE_OP(<, Py_LT)
-BOOST_PYTHON_COMPARE_OP(<=, Py_LE)
-BOOST_PYTHON_COMPARE_OP(==, Py_EQ)
-BOOST_PYTHON_COMPARE_OP(!=, Py_NE)
 # undef BOOST_PYTHON_COMPARE_OP
     
 # define BOOST_PYTHON_BINARY_OPERATOR(op)                               \
@@ -93,6 +87,12 @@
 {                                                                       \
     return object(l) op object(r);                                      \
 }
+BOOST_PYTHON_BINARY_OPERATOR(>)
+BOOST_PYTHON_BINARY_OPERATOR(>=)
+BOOST_PYTHON_BINARY_OPERATOR(<)
+BOOST_PYTHON_BINARY_OPERATOR(<=)
+BOOST_PYTHON_BINARY_OPERATOR(==)
+BOOST_PYTHON_BINARY_OPERATOR(!=)
 BOOST_PYTHON_BINARY_OPERATOR(+)
 BOOST_PYTHON_BINARY_OPERATOR(-)
 BOOST_PYTHON_BINARY_OPERATOR(*)

Modified: boost/trunk/boost/python/opaque_pointer_converter.hpp
===================================================================
--- boost/trunk/boost/python/opaque_pointer_converter.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/opaque_pointer_converter.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,4 @@
-// Copyright Gottfried Ganßauge 2003.
+// Copyright Gottfried Ganßauge 2003..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)
@@ -11,6 +11,7 @@
 # include <boost/python/detail/prefix.hpp>
 # include <boost/python/lvalue_from_pytype.hpp>
 # include <boost/python/to_python_converter.hpp>
+# include <boost/python/converter/registrations.hpp>
 # include <boost/python/detail/dealloc.hpp>
 # include <boost/python/detail/none.hpp>
 # include <boost/python/type_id.hpp>
@@ -44,9 +45,16 @@
 {
     opaque()
     {
-        type_object.tp_name = const_cast<char*>(type_id<Pointee*>().name());
-        converter::registry::insert(&extract, type_id<Pointee>());
-        converter::registry::insert(&wrap, type_id<Pointee*>());
+        if (type_object.tp_name == 0)
+        {
+            type_object.tp_name = const_cast<char*>(type_id<Pointee*>().name());
+            if (PyType_Ready (&type_object) < 0)
+            {
+                throw error_already_set();
+            }
+
+            this->register_self();
+        }
     }
     
     static opaque instance;
@@ -78,6 +86,18 @@
         }
     }
 
+    void register_self()
+    {
+        converter::registration const *existing =
+            converter::registry::query (type_id<Pointee*>());
+
+        if ((existing == 0) || (existing->m_to_python == 0))
+        {
+            converter::registry::insert(&extract, type_id<Pointee>());
+            converter::registry::insert(&wrap, type_id<Pointee*>());
+        }
+    }
+
     struct python_instance
     {
         PyObject_HEAD

Modified: boost/trunk/boost/python/operators.hpp
===================================================================
--- boost/trunk/boost/python/operators.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/operators.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,6 +18,7 @@
 # include <boost/python/other.hpp>
 # include <boost/lexical_cast.hpp>
 # include <boost/python/refcount.hpp>
+# include <boost/python/detail/unwrap_wrapper.hpp>
 # include <string>
 # include <complex>
 
@@ -169,7 +170,9 @@
       template <class L, class R>                           \
       struct apply                                          \
       {                                                     \
-          static inline PyObject* execute(L& l, R const& r) \
+          typedef typename unwrap_wrapper_<L>::type lhs;    \
+          typedef typename unwrap_wrapper_<R>::type rhs;    \
+          static PyObject* execute(lhs& l, rhs const& r)    \
           {                                                 \
               return detail::convert_result(expr);          \
           }                                                 \
@@ -183,7 +186,9 @@
       template <class L, class R>                           \
       struct apply                                          \
       {                                                     \
-          static inline PyObject* execute(R& r, L const& l) \
+          typedef typename unwrap_wrapper_<L>::type lhs;    \
+          typedef typename unwrap_wrapper_<R>::type rhs;    \
+          static PyObject* execute(rhs& r, lhs const& l)    \
           {                                                 \
               return detail::convert_result(expr);          \
           }                                                 \
@@ -271,8 +276,10 @@
       template <class L, class R>                               \
       struct apply                                              \
       {                                                         \
-          static inline PyObject*                               \
-          execute(back_reference<L&> l, R const& r)             \
+          typedef typename unwrap_wrapper_<L>::type lhs;        \
+          typedef typename unwrap_wrapper_<R>::type rhs;        \
+          static PyObject*                                      \
+          execute(back_reference<lhs&> l, rhs const& r)         \
           {                                                     \
               l.get() op r;                                     \
               return python::incref(l.source().ptr());          \
@@ -311,7 +318,8 @@
       template <class T>                                        \
       struct apply                                              \
       {                                                         \
-          static PyObject* execute(T& x)                        \
+          typedef typename unwrap_wrapper_<T>::type self_t;     \
+          static PyObject* execute(self_t& x)                   \
           {                                                     \
               return detail::convert_result(op(x));             \
           }                                                     \

Copied: boost/trunk/boost/python/ssize_t.hpp (from rev 14034, boost/branches/upstream/current/boost/python/ssize_t.hpp)

Modified: boost/trunk/boost/python/suite/indexing/indexing_suite.hpp
===================================================================
--- boost/trunk/boost/python/suite/indexing/indexing_suite.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/suite/indexing/indexing_suite.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,7 +18,7 @@
 
 namespace boost { namespace python {
                    
-    // indexing_suite class. This class is the protocol class for
+    // indexing_suite class. This class is the facade class for
     // the management of C++ containers intended to be integrated
     // to Python. The objective is make a C++ container look and
     // feel and behave exactly as we'd expect a Python container.

Modified: boost/trunk/boost/python/type_id.hpp
===================================================================
--- boost/trunk/boost/python/type_id.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/type_id.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -89,7 +89,7 @@
 }
 
 #  if (defined(__EDG_VERSION__) && __EDG_VERSION__ < 245) \
-   || (defined(__sgi) && defined(_COMPILER_VERSION) && _COMPILER_VERSION <= 741)
+   || (defined(__sgi) && defined(_COMPILER_VERSION) && _COMPILER_VERSION <= 744)
 // Older EDG-based compilers seems to mistakenly distinguish "int" from
 // "signed int", etc., but only in typeid() expressions. However
 // though int == signed int, the "signed" decoration is propagated

Modified: boost/trunk/boost/python/with_custodian_and_ward.hpp
===================================================================
--- boost/trunk/boost/python/with_custodian_and_ward.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/with_custodian_and_ward.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -90,7 +90,7 @@
         // check if either custodian or ward exceeds the arity
         // (this weird formulation avoids "always false" warnings
         // for arity_ = 0)
-        if ( std::max(custodian, ward) > arity_ )
+        if ( (std::max)(custodian, ward) > arity_ )
 #endif
         {
             PyErr_SetString(

Modified: boost/trunk/boost/python/wrapper.hpp
===================================================================
--- boost/trunk/boost/python/wrapper.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/python/wrapper.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,10 +14,10 @@
 template <class T>
 class wrapper : public detail::wrapper_base
 {
-#   if defined(BOOST_PYTHON_NO_SFINAE)
  public:
+    // Do not touch this implementation detail!
     typedef T _wrapper_wrapped_type_;
-#   endif 
+
  protected:
     override get_override(char const* name) const
     {

Deleted: boost/trunk/boost/range/as_array.hpp
===================================================================
--- boost/trunk/boost/range/as_array.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/as_array.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,45 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2006. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-
-#ifndef BOOST_RANGE_AS_ARRAY_HPP
-#define BOOST_RANGE_AS_ARRAY_HPP
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
-# pragma once
-#endif
-
-#include <boost/range/iterator_range.hpp>
-#include <boost/range/detail/str_types.hpp>
-
-namespace boost
-{
-
-    template< class R >
-    inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<R>::type > 
-    as_array( R& r )
-    {
-        return boost::make_iterator_range( r );
-    }
-
-#ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
-
-    template< class Range >
-    inline boost::iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<const Range>::type > 
-    as_array( const Range& r )
-    {
-        return boost::make_iterator_range( r );
-    }
-    
-#endif
-    
-}
-
-#endif
-

Deleted: boost/trunk/boost/range/as_literal.hpp
===================================================================
--- boost/trunk/boost/range/as_literal.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/as_literal.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,120 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2006. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-
-#ifndef BOOST_RANGE_DETAIL_AS_LITERAL_HPP
-#define BOOST_RANGE_DETAIL_AS_LITERAL_HPP
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
-# pragma once
-#endif
-
-#if BOOST_NO_FUNCTION_TEMPLATE_ORDERING
-#include <boost/range/detail/as_literal.hpp>
-#else
-
-#include <boost/range/iterator_range.hpp>
-#include <boost/range/detail/str_types.hpp>
-#include <cstring>
-#include <cwchar>
-
-namespace boost
-{
-    namespace range_detail
-    {
-        inline std::size_t length( const char* s )
-        {
-            return strlen( s );
-        }
-
-        inline std::size_t length( const wchar_t* s )
-        {
-            return wcslen( s );
-        }
-
-        //
-        // Remark: the compiler cannot choose between T* and T[sz]
-        // overloads, so we must put the T* internal to the
-        // unconstrained version.
-        // 
-
-        inline bool is_char_ptr( char* )
-        {
-            return true;
-        }
-        
-        inline bool is_char_ptr( const char* )
-        {
-            return true;
-        }
-
-        
-        inline bool is_char_ptr( wchar_t* )
-        {
-            return true;
-        }
-        
-        inline bool is_char_ptr( const wchar_t* )
-        {
-            return true;
-        }
-        
-        template< class T >
-        inline long is_char_ptr( T r )
-        {
-            return 0L;
-        }
-
-        template< class T >
-        inline iterator_range<T*> 
-        make_range( T* const r, bool )
-        {
-            return iterator_range<T*>( r, r + length(r) );
-        }
-
-        template< class T >
-        inline iterator_range<BOOST_DEDUCED_TYPENAME range_iterator<T>::type> 
-        make_range( T& r, long )
-        {
-            return boost::make_iterator_range( r );
-        }
-
-    }
-    
-    template< class Range >
-    inline iterator_range<BOOST_DEDUCED_TYPENAME range_iterator<Range>::type> 
-    as_literal( Range& r )
-    {
-        return range_detail::make_range( r, range_detail::is_char_ptr(r) );
-    }
-
-    template< class Range >
-    inline iterator_range<BOOST_DEDUCED_TYPENAME range_iterator<const Range>::type> 
-    as_literal( const Range& r )
-    {
-        return range_detail::make_range( r, range_detail::is_char_ptr(r) );
-    }
-
-    template< class Char, std::size_t sz >
-    inline iterator_range<Char*> as_literal( Char (&arr)[sz] )
-    {
-        return boost::make_iterator_range( arr, arr + sz - 1 );
-    }
-
-    
-    template< class Char, std::size_t sz >
-    inline iterator_range<const Char*> as_literal( const Char (&arr)[sz] )
-    {
-        return boost::make_iterator_range( arr, arr + sz - 1 );
-    }
-}
-
-#endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING
-
-#endif

Modified: boost/trunk/boost/range/begin.hpp
===================================================================
--- boost/trunk/boost/range/begin.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/begin.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,6 +15,7 @@
 # pragma once
 #endif
 
+#include <boost/type_traits/remove_const.hpp>
 #include <boost/range/config.hpp>
 
 #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
@@ -22,6 +23,7 @@
 #else
 
 #include <boost/range/iterator.hpp>
+#include <boost/range/const_iterator.hpp>
 
 namespace boost
 {
@@ -38,24 +40,32 @@
     //////////////////////////////////////////////////////////////////////
 
     template< typename C >
-    inline BOOST_DEDUCED_TYPENAME range_iterator<C>::type
-    range_begin( C& c )
+    inline BOOST_DEDUCED_TYPENAME range_const_iterator<C>::type
+    boost_range_begin( const C& c )
     {
         return c.begin();
     }
 
+    template< typename C >
+    inline BOOST_DEDUCED_TYPENAME range_iterator<
+                                                                        typename remove_const<C>::type >::type
+    boost_range_begin( C& c )
+    {
+        return c.begin();
+    }
+
     //////////////////////////////////////////////////////////////////////
     // pair
     //////////////////////////////////////////////////////////////////////
 
     template< typename Iterator >
-    inline Iterator range_begin( const std::pair<Iterator,Iterator>& p )
+    inline Iterator boost_range_begin( const std::pair<Iterator,Iterator>& p )
     {
         return p.first;
     }
 
     template< typename Iterator >
-    inline Iterator range_begin( std::pair<Iterator,Iterator>& p )
+    inline Iterator boost_range_begin( std::pair<Iterator,Iterator>& p )
     {
         return p.first;
     }
@@ -64,22 +74,66 @@
     // array
     //////////////////////////////////////////////////////////////////////
 
-    //
-    // May this be discarded? Or is it needed for bad compilers?
-    //
     template< typename T, std::size_t sz >
-    inline const T* range_begin( const T (&array)[sz] )
+    inline const T* boost_range_begin( const T (&array)[sz] )
     {
         return array;
     }
 
     template< typename T, std::size_t sz >
-    inline T* range_begin( T (&array)[sz] )
+    inline T* boost_range_begin( T (&array)[sz] )
     {
         return array;
     }
 
 
+    //////////////////////////////////////////////////////////////////////
+    // string
+    //////////////////////////////////////////////////////////////////////
+
+#if 1 || BOOST_WORKAROUND(__MWERKS__, <= 0x3204 ) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+// CW up to 9.3 and borland have troubles with function ordering
+    inline const char* boost_range_begin( const char* s )
+    {
+        return s;
+    }
+
+    inline char* boost_range_begin( char* s )
+    {
+        return s;
+    }
+
+    inline const wchar_t* boost_range_begin( const wchar_t* s )
+    {
+        return s;
+    }
+
+    inline wchar_t* boost_range_begin( wchar_t* s )
+    {
+        return s;
+    }
+#else
+    inline const char* boost_range_begin( const char*& s )
+    {
+        return s;
+    }
+
+    inline char* boost_range_begin( char*& s )
+    {
+        return s;
+    }
+
+    inline const wchar_t* boost_range_begin( const wchar_t*& s )
+    {
+        return s;
+    }
+
+    inline wchar_t* boost_range_begin( wchar_t*& s )
+    {
+        return s;
+    }
+#endif
+
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
     !BOOST_WORKAROUND(__GNUC__, < 3) \
     /**/
@@ -88,27 +142,44 @@
 
 
 template< class T >
-inline BOOST_DEDUCED_TYPENAME range_iterator<T>::type begin( T& r )
+inline BOOST_DEDUCED_TYPENAME range_iterator<
+                        typename remove_const<T>::type >::type begin( T& r )
 {
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
     !BOOST_WORKAROUND(__GNUC__, < 3) \
     /**/
     using namespace range_detail;
 #endif
-    return range_begin( r );
+    return boost_range_begin( r );
 }
 
 template< class T >
-inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type begin( const T& r )
+inline BOOST_DEDUCED_TYPENAME range_const_iterator<T>::type begin( const T& r )
 {
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
     !BOOST_WORKAROUND(__GNUC__, < 3) \
     /**/
     using namespace range_detail;
 #endif
-    return range_begin( r );
+    return boost_range_begin( r );
 }
 
+#if BOOST_WORKAROUND(__MWERKS__, <= 0x3003 ) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+// BCB and CW are not able to overload pointer when class overloads are also available.
+template<>
+inline range_const_iterator<const char*>::type begin<const char*>( const char*& r )
+{
+    return r;
+}
+
+template<>
+inline range_const_iterator<const wchar_t*>::type begin<const wchar_t*>( const wchar_t*& r )
+{
+    return r;
+}
+
+#endif
+
 } // namespace boost
 
 #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING
@@ -116,7 +187,7 @@
 namespace boost
 {
     template< class T >
-    inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type
+    inline BOOST_DEDUCED_TYPENAME range_const_iterator<T>::type
     const_begin( const T& r )
     {
         return boost::begin( r );
@@ -124,4 +195,3 @@
 }
 
 #endif
-

Deleted: boost/trunk/boost/range/category.hpp
===================================================================
--- boost/trunk/boost/range/category.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/category.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,29 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2006. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-
-#ifndef BOOST_RANGE_CATEGORY_HPP
-#define BOOST_RANGE_CATEGORY_HPP
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
-# pragma once
-#endif
-
-#include <boost/range/config.hpp>
-#include <boost/range/iterator.hpp>
-#include <boost/iterator/iterator_traits.hpp>
-
-namespace boost
-{
-    template< class T >
-    struct range_category : iterator_category< typename range_iterator<T>::type >
-    { };
-}
-
-#endif

Modified: boost/trunk/boost/range/const_iterator.hpp
===================================================================
--- boost/trunk/boost/range/const_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/const_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,7 +21,6 @@
 #include <boost/range/detail/const_iterator.hpp>
 #else
 
-#include <boost/type_traits/remove_const.hpp>
 #include <cstddef>
 #include <utility>
 
@@ -47,6 +46,12 @@
         typedef Iterator type;
     };
     
+    template< typename Iterator >
+    struct range_const_iterator< const std::pair<Iterator,Iterator> >
+    {
+        typedef Iterator type;
+    };
+
     //////////////////////////////////////////////////////////////////////////
     // array
     //////////////////////////////////////////////////////////////////////////
@@ -57,6 +62,64 @@
         typedef const T* type;
     };
 
+    template< typename T, std::size_t sz >
+    struct range_const_iterator< const T[sz] >
+    {
+        typedef const T* type;
+    };
+
+    //////////////////////////////////////////////////////////////////////////
+    // string
+    //////////////////////////////////////////////////////////////////////////
+
+    template<>
+    struct range_const_iterator< char* >
+    {
+        typedef const char* type;
+    };
+
+    template<>
+    struct range_const_iterator< wchar_t* >
+    {
+        typedef const wchar_t* type;
+    };
+
+    template<>
+    struct range_const_iterator< const char* >
+    {
+        typedef const char* type;
+    };
+
+    template<>
+    struct range_const_iterator< const wchar_t* >
+    {
+        typedef const wchar_t* type;
+    };
+
+    template<>
+    struct range_const_iterator< char* const >
+    {
+        typedef const char* type;
+    };
+
+    template<>
+    struct range_const_iterator< wchar_t* const >
+    {
+        typedef const wchar_t* type;
+    };
+
+    template<>
+    struct range_const_iterator< const char* const >
+    {
+        typedef const char* type;
+    };
+
+    template<>
+    struct range_const_iterator< const wchar_t* const >
+    {
+        typedef const wchar_t* type;
+    };
+
 } // namespace boost
 
 #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION

Modified: boost/trunk/boost/range/const_reverse_iterator.hpp
===================================================================
--- boost/trunk/boost/range/const_reverse_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/const_reverse_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,17 +15,22 @@
 # pragma once
 #endif
 
-#include <boost/range/reverse_iterator.hpp>
+#include <boost/range/config.hpp>
+#include <boost/range/const_iterator.hpp>
+#include <boost/iterator/reverse_iterator.hpp>
 
 namespace boost
 {
-    //
-    // This interface is deprecated, use range_reverse_iterator<const T>
-    //
+    //////////////////////////////////////////////////////////////////////////
+    // default
+    //////////////////////////////////////////////////////////////////////////
     
     template< typename C >
-    struct range_const_reverse_iterator : range_reverse_iterator<const C>
-    { };
+    struct range_const_reverse_iterator
+    {
+        typedef reverse_iterator< 
+            BOOST_DEDUCED_TYPENAME range_const_iterator<C>::type > type;
+    };
     
 } // namespace boost
 

Deleted: boost/trunk/boost/range/detail/as_literal.hpp
===================================================================
--- boost/trunk/boost/range/detail/as_literal.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/detail/as_literal.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,33 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2006. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-
-#ifndef BOOST_RANGE_AS_LITERAL_HPP
-#define BOOST_RANGE_AS_LITERAL_HPP
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
-# pragma once
-#endif
-
-#include <boost/range/detail/detail_str.hpp>
-#include <boost/range/iterator_range.hpp>
-
-namespace boost
-{
-    template< class Range >
-    inline iterator_range<BOOST_DEDUCED_TYPENAME range_iterator<Range>::type> 
-    as_literal( Range& r )
-    {
-        return ::boost::make_iterator_range( ::boost::range_detail::str_begin(r),
-                                             ::boost::range_detail::str_end(r) );
-    }
-
-}
-
-#endif

Modified: boost/trunk/boost/range/detail/begin.hpp
===================================================================
--- boost/trunk/boost/range/detail/begin.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/detail/begin.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,7 +13,7 @@
 
 #include <boost/config.hpp> // BOOST_MSVC
 #include <boost/detail/workaround.hpp>
-#include <boost/range/iterator.hpp>
+#include <boost/range/result_iterator.hpp>
 #include <boost/range/detail/common.hpp>
 #if BOOST_WORKAROUND(BOOST_MSVC, < 1310)
 # include <boost/range/value_type.hpp>
@@ -35,7 +35,7 @@
         struct range_begin<std_container_>
         {
             template< typename C >
-            static BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type fun( C& c )
+            static BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<C>::type fun( C& c )
             {
                 return c.begin();
             };
@@ -49,7 +49,7 @@
         struct range_begin<std_pair_>
         {
             template< typename P >
-            static BOOST_RANGE_DEDUCED_TYPENAME range_iterator<P>::type fun( const P& p )
+            static BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<P>::type fun( const P& p )
             {
                 return p.first;
             }
@@ -77,10 +77,51 @@
         #endif
         };
 
+        //////////////////////////////////////////////////////////////////////
+        // string
+        //////////////////////////////////////////////////////////////////////
+     
+        template<>
+        struct range_begin<char_ptr_>
+        {
+            static char* fun( char* s )
+            {
+                return s;
+            }
+        };
+
+        template<>
+        struct range_begin<const_char_ptr_>
+        {
+            static const char* fun( const char* s )
+            {
+                return s;
+            }
+        };
+        
+        template<>
+        struct range_begin<wchar_t_ptr_>
+        {
+            
+            static wchar_t* fun( wchar_t* s )
+            {
+                return s;
+            }
+        };
+
+        template<>
+        struct range_begin<const_wchar_t_ptr_>
+        {
+            static const wchar_t* fun( const wchar_t* s )
+            {
+                return s;
+            }
+        };
+
     } // namespace 'range_detail'
     
     template< typename C >
-    inline BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type 
+    inline BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<C>::type 
     begin( C& c )
     {
         return range_detail::range_begin< BOOST_RANGE_DEDUCED_TYPENAME range_detail::range<C>::type >::fun( c );

Modified: boost/trunk/boost/range/detail/common.hpp
===================================================================
--- boost/trunk/boost/range/detail/common.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/detail/common.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -114,4 +114,3 @@
 }
         
 #endif
-

Modified: boost/trunk/boost/range/detail/const_iterator.hpp
===================================================================
--- boost/trunk/boost/range/detail/const_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/detail/const_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -56,6 +56,58 @@
                     remove_extent<T>::type* type;
             };
         };
+        
+        template<>
+        struct range_const_iterator_<char_array_>
+        { 
+            template< typename T >
+            struct pts
+            {
+                typedef const BOOST_RANGE_DEDUCED_TYPENAME 
+                    remove_extent<T>::type* type;
+            };
+        };
+
+        template<>
+        struct range_const_iterator_<char_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef const char* type; 
+            };         
+        };
+        
+        template<>
+        struct range_const_iterator_<const_char_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef const char* type; 
+            };         
+        };
+
+        template<>
+        struct range_const_iterator_<wchar_t_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef const wchar_t* type; 
+            };         
+        };
+
+        template<>
+        struct range_const_iterator_<const_wchar_t_ptr_>
+        {
+             template< typename S >
+             struct pts
+             {
+                 typedef const wchar_t* type; 
+             };         
+         };
+
     } 
     
     template< typename C >

Deleted: boost/trunk/boost/range/detail/detail_str.hpp
===================================================================
--- boost/trunk/boost/range/detail/detail_str.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/detail/detail_str.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,376 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-
-#ifndef BOOST_RANGE_DETAIL_DETAIL_STR_HPP
-#define BOOST_RANGE_DETAIL_DETAIL_STR_HPP
-
-#include <boost/config.hpp> // BOOST_MSVC
-#include <boost/range/iterator.hpp>
-
-namespace boost 
-{
-    
-    namespace range_detail
-    {
-        //
-        // iterator
-        //
-        
-        template<>
-        struct range_iterator_<char_array_>
-        { 
-            template< typename T >
-            struct pts
-            {
-                 typedef BOOST_RANGE_DEDUCED_TYPENAME 
-                    remove_extent<T>::type* type;
-            };
-        };
-
-        template<>
-        struct range_iterator_<char_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef char* type; 
-            };         
-        };
-
-        template<>
-        struct range_iterator_<const_char_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef const char* type;
-            };         
-        };
-
-        template<>
-        struct range_iterator_<wchar_t_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef wchar_t* type; 
-            };         
-        };
-
-        template<>
-        struct range_iterator_<const_wchar_t_ptr_>
-        {
-             template< typename S >
-             struct pts
-             {
-                 typedef const wchar_t* type; 
-             };         
-        };
-
-
-        //
-        // const iterator
-        //
-
-        template<>
-        struct range_const_iterator_<char_array_>
-        { 
-            template< typename T >
-            struct pts
-            {
-                typedef const BOOST_RANGE_DEDUCED_TYPENAME 
-                    remove_extent<T>::type* type;
-            };
-        };
-
-        template<>
-        struct range_const_iterator_<char_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef const char* type; 
-            };         
-        };
-
-        template<>
-        struct range_const_iterator_<const_char_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef const char* type; 
-            };         
-        };
-
-        template<>
-        struct range_const_iterator_<wchar_t_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef const wchar_t* type; 
-            };         
-        };
-
-        template<>
-        struct range_const_iterator_<const_wchar_t_ptr_>
-        {
-             template< typename S >
-             struct pts
-             {
-                 typedef const wchar_t* type; 
-             };         
-        };
-    }
-}
-
-#include <boost/range/detail/begin.hpp>
-#include <boost/range/detail/end.hpp>
-#include <boost/range/detail/size_type>
-#include <boost/range/detail/value_type>
-#include <boost/range/detail/common.hpp>
-
-namespace boost 
-{
-    
-    namespace range_detail
-    {
-        //
-        // str_begin()
-        //
-        template<>
-        struct range_begin<char_ptr_>
-        {
-            static char* fun( char* s )
-            {
-                return s;
-            }
-        };
-
-        template<>
-        struct range_begin<const_char_ptr_>
-        {
-            static const char* fun( const char* s )
-            {
-                return s;
-            }
-        };
-        
-        template<>
-        struct range_begin<wchar_t_ptr_>
-        {
-            
-            static wchar_t* fun( wchar_t* s )
-            {
-                return s;
-            }
-        };
-
-        template<>
-        struct range_begin<const_wchar_t_ptr_>
-        {
-            static const wchar_t* fun( const wchar_t* s )
-            {
-                return s;
-            }
-        };
-        
-        template< typename C >
-        inline BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type 
-        str_begin( C& c )
-        {
-            return range_detail::range_begin< BOOST_RANGE_DEDUCED_TYPENAME 
-                range_detail::range<C>::type >::fun( c );
-        }
-
-        //
-        // str_end()
-        //
-
-        template<>
-        struct range_end<char_array_>
-        {
-            template< typename T, std::size_t sz >
-            static T* fun( T BOOST_RANGE_ARRAY_REF()[sz] )
-            {
-                return boost::range_detail::array_end( boost_range_array );
-            }
-        };
-        
-        template<>
-        struct range_end<wchar_t_array_>
-        {
-            template< typename T, std::size_t sz >
-            static T* fun( T BOOST_RANGE_ARRAY_REF()[sz] )
-            {
-                return boost::range_detail::array_end( boost_range_array );
-            }
-        };
-        
-        template<>
-        struct range_end<char_ptr_>
-        {
-            static char* fun( char* s )
-            {
-                return boost::range_detail::str_end( s );
-            }
-        };
-
-        template<>
-        struct range_end<const_char_ptr_>
-        {
-            static const char* fun( const char* s )
-            {
-                return boost::range_detail::str_end( s );
-            }
-        };
-
-        template<>
-        struct range_end<wchar_t_ptr_>
-        {
-            static wchar_t* fun( wchar_t* s )
-            {
-                return boost::range_detail::str_end( s );
-            }
-        };
-
-
-        template<>
-        struct range_end<const_wchar_t_ptr_>
-        {
-            static const wchar_t* fun( const wchar_t* s )
-            {
-                return boost::range_detail::str_end( s );
-            }
-        };
-
-        template< typename C >
-        inline BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type 
-        str_end( C& c )
-        {
-            return range_detail::range_end< BOOST_RANGE_DEDUCED_TYPENAME 
-                range_detail::range<C>::type >::fun( c );
-        }
-
-        //
-        // size_type
-        //
-
-        template<>
-        struct range_size_type_<char_array_>
-        { 
-            template< typename A >
-            struct pts
-            {
-                typedef std::size_t type;
-            };
-        };
-
-        template<>
-        struct range_size_type_<char_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef std::size_t type;
-            };         
-        };
-        
-        template<>
-        struct range_size_type_<const_char_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef std::size_t type;
-            };         
-        };
-        
-        template<>
-        struct range_size_type_<wchar_t_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef std::size_t type;
-            };         
-        };
-        
-        template<>
-        struct range_size_type_<const_wchar_t_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef std::size_t type;
-            };         
-        };  
-
-        //
-        // value_type
-        //
-        
-        template<>
-        struct range_value_type_<char_array_>
-        { 
-            template< typename T >
-            struct pts
-            {
-                typedef char type;
-            };
-        };
-
-        template<>
-        struct range_value_type_<char_ptr_>
-        {
-             template< typename S >
-             struct pts
-             {
-                 typedef char type; 
-             };         
-        };
-        
-        template<>
-        struct range_value_type_<const_char_ptr_>
-        {
-             template< typename S >
-             struct pts
-             {
-                 typedef const char type;
-             };         
-        };
-        
-        template<>
-        struct range_value_type_<wchar_t_ptr_>
-        {
-             template< typename S >
-             struct pts
-             {
-                 typedef wchar_t type;
-             };         
-        };
-        
-        template<>
-        struct range_value_type_<const_wchar_t_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef const wchar_t type;
-            };         
-        };
-
-    } // namespace 'range_detail'
-
-} // namespace 'boost'
-
-
-#endif

Modified: boost/trunk/boost/range/detail/end.hpp
===================================================================
--- boost/trunk/boost/range/detail/end.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/detail/end.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,7 +18,8 @@
 # include <boost/range/detail/vc6/end.hpp>
 #else
 # include <boost/range/detail/implementation_help.hpp>
-# include <boost/range/iterator.hpp>
+# include <boost/range/detail/implementation_help.hpp>
+# include <boost/range/result_iterator.hpp>
 # include <boost/range/detail/common.hpp>
 # if BOOST_WORKAROUND(BOOST_MSVC, < 1310)
 #  include <boost/range/detail/remove_extent.hpp>
@@ -39,7 +40,7 @@
         struct range_end<std_container_>
         {
             template< typename C >
-            static BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type 
+            static BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<C>::type 
             fun( C& c )
             {
                 return c.end();
@@ -54,7 +55,7 @@
         struct range_end<std_pair_>
         {
             template< typename P >
-            static BOOST_RANGE_DEDUCED_TYPENAME range_iterator<P>::type 
+            static BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<P>::type 
             fun( const P& p )
             {
                 return p.second;
@@ -82,11 +83,73 @@
             }
         #endif
         };
+
+                
+        template<>
+        struct range_end<char_array_>
+        {
+            template< typename T, std::size_t sz >
+            static T* fun( T BOOST_RANGE_ARRAY_REF()[sz] )
+            {
+                return boost::range_detail::array_end( boost_range_array );
+            }
+        };
         
+        template<>
+        struct range_end<wchar_t_array_>
+        {
+            template< typename T, std::size_t sz >
+            static T* fun( T BOOST_RANGE_ARRAY_REF()[sz] )
+            {
+                return boost::range_detail::array_end( boost_range_array );
+            }
+        };
+
+        //////////////////////////////////////////////////////////////////////
+        // string
+        //////////////////////////////////////////////////////////////////////
+        
+        template<>
+        struct range_end<char_ptr_>
+        {
+            static char* fun( char* s )
+            {
+                return boost::range_detail::str_end( s );
+            }
+        };
+
+        template<>
+        struct range_end<const_char_ptr_>
+        {
+            static const char* fun( const char* s )
+            {
+                return boost::range_detail::str_end( s );
+            }
+        };
+
+        template<>
+        struct range_end<wchar_t_ptr_>
+        {
+            static wchar_t* fun( wchar_t* s )
+            {
+                return boost::range_detail::str_end( s );
+            }
+        };
+
+
+        template<>
+        struct range_end<const_wchar_t_ptr_>
+        {
+            static const wchar_t* fun( const wchar_t* s )
+            {
+                return boost::range_detail::str_end( s );
+            }
+        };
+        
     } // namespace 'range_detail'
     
     template< typename C >
-    inline BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type 
+    inline BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<C>::type 
     end( C& c )
     {
         return range_detail::range_end< BOOST_RANGE_DEDUCED_TYPENAME range_detail::range<C>::type >::fun( c );

Modified: boost/trunk/boost/range/detail/implementation_help.hpp
===================================================================
--- boost/trunk/boost/range/detail/implementation_help.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/detail/implementation_help.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -43,7 +43,7 @@
 #else
         inline const wchar_t* str_end( const wchar_t* s, const wchar_t* )
         {
-            if( s == 0 && s[0] == 0 )
+            if( s == 0 || s[0] == 0 )
                 return s;
             while( *++s != 0 )
                 ;

Modified: boost/trunk/boost/range/detail/iterator.hpp
===================================================================
--- boost/trunk/boost/range/detail/iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/detail/iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -64,10 +64,60 @@
             };
         };
         
+        template<>
+        struct range_iterator_<char_array_>
+        { 
+            template< typename T >
+            struct pts
+            {
+                 typedef BOOST_RANGE_DEDUCED_TYPENAME 
+                    remove_extent<T>::type* type;
+            };
+        };
+
+        template<>
+        struct range_iterator_<char_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef char* type; 
+            };         
+        };
+        
+        template<>
+        struct range_iterator_<const_char_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef const char* type;
+            };         
+        };
+
+        template<>
+        struct range_iterator_<wchar_t_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef wchar_t* type; 
+            };         
+        };
+
+        template<>
+        struct range_iterator_<const_wchar_t_ptr_>
+        {
+             template< typename S >
+             struct pts
+             {
+                 typedef const wchar_t* type; 
+             };         
+         };
     } 
 
     template< typename C >
-    class range_mutable_iterator
+    class range_iterator
     {
         typedef BOOST_RANGE_DEDUCED_TYPENAME range_detail::range<C>::type c_type;
     public:

Modified: boost/trunk/boost/range/detail/size_type.hpp
===================================================================
--- boost/trunk/boost/range/detail/size_type.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/detail/size_type.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -54,7 +54,55 @@
             };
         };
 
-  
+        template<>
+        struct range_size_type_<char_array_>
+        { 
+            template< typename A >
+            struct pts
+            {
+                typedef std::size_t type;
+            };
+        };
+
+        template<>
+        struct range_size_type_<char_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef std::size_t type;
+            };         
+        };
+        
+        template<>
+        struct range_size_type_<const_char_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef std::size_t type;
+            };         
+        };
+        
+        template<>
+        struct range_size_type_<wchar_t_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef std::size_t type;
+            };         
+        };
+        
+        template<>
+        struct range_size_type_<const_wchar_t_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef std::size_t type;
+            };         
+        };  
     } 
     
     template< typename C >

Deleted: boost/trunk/boost/range/detail/str_types.hpp
===================================================================
--- boost/trunk/boost/range/detail/str_types.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/detail/str_types.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,38 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2006. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-
-#ifndef BOOST_RANGE_DETAIL_STR_TYPES_HPP
-#define BOOST_RANGE_DETAIL_STR_TYPES_HPP
-
-#include <boost/range/size_type.hpp>
-#include <boost/range/iterator.hpp>
-
-namespace boost
-{
-    template< class T >
-    struct range_mutable_iterator<T*>
-    {
-        typedef T* type;
-    };
-
-    template< class T >
-    struct range_const_iterator<T*>
-    {
-        typedef const T* type;
-    };
-
-    template< class T >
-    struct range_size<T*>
-    {
-       typedef std::size_t type;
-    };    
-}
-
-#endif

Modified: boost/trunk/boost/range/detail/value_type.hpp
===================================================================
--- boost/trunk/boost/range/detail/value_type.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/detail/value_type.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -56,6 +56,56 @@
             };
         };
         
+        template<>
+        struct range_value_type_<char_array_>
+        { 
+            template< typename T >
+            struct pts
+            {
+                typedef char type;
+            };
+        };
+
+        template<>
+        struct range_value_type_<char_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef char type; 
+            };         
+        };
+        
+        template<>
+        struct range_value_type_<const_char_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef const char type;
+            };         
+        };
+
+        template<>
+        struct range_value_type_<wchar_t_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef wchar_t type;
+            };         
+        };
+
+        template<>
+        struct range_value_type_<const_wchar_t_ptr_>
+        {
+             template< typename S >
+             struct pts
+             {
+                 typedef const wchar_t type;
+             };         
+         };
+
     } 
     
     template< typename C >

Modified: boost/trunk/boost/range/difference_type.hpp
===================================================================
--- boost/trunk/boost/range/difference_type.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/difference_type.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,14 +16,130 @@
 #endif
 
 #include <boost/range/config.hpp>
-#include <boost/range/iterator.hpp>
+#include <boost/range/const_iterator.hpp>
 #include <boost/iterator/iterator_traits.hpp>
 
 namespace boost
 {
-    template< class T >
-    struct range_difference : iterator_difference< typename range_iterator<T>::type >
-    { };
+        template< class T >
+        struct range_difference
+        {
+                typedef BOOST_DEDUCED_TYPENAME iterator_difference<
+                        BOOST_DEDUCED_TYPENAME range_const_iterator<T>::type >::type
+                                type;
+        };
 }
 
+//#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+//#include <boost/range/detail/difference_type.hpp>
+//#else
+
+/*
+#include <cstddef>
+#include <utility>
+
+namespace boost
+{
+    //////////////////////////////////////////////////////////////////////////
+    // default
+    //////////////////////////////////////////////////////////////////////////
+
+    template< typename C >
+    struct range_difference
+    {
+        typedef BOOST_DEDUCED_TYPENAME C::difference_type type;
+    };
+
+    //////////////////////////////////////////////////////////////////////////
+    // pair
+    //////////////////////////////////////////////////////////////////////////
+
+    template< typename Iterator >
+    struct range_difference< std::pair<Iterator,Iterator> >
+    {
+        typedef BOOST_DEDUCED_TYPENAME
+            iterator_difference<Iterator>::type type;
+    };
+
+    template< typename Iterator >
+    struct range_difference< const std::pair<Iterator,Iterator> >
+    {
+        typedef BOOST_DEDUCED_TYPENAME
+            iterator_difference<Iterator>::type type;
+    };
+
+
+    //////////////////////////////////////////////////////////////////////////
+    // array
+    //////////////////////////////////////////////////////////////////////////
+
+    template< typename T, std::size_t sz >
+    struct range_difference< T[sz] >
+    {
+        typedef std::ptrdiff_t type;
+    };
+
+    template< typename T, std::size_t sz >
+    struct range_difference< const T[sz] >
+    {
+        typedef std::ptrdiff_t type;
+    };
+
+    //////////////////////////////////////////////////////////////////////////
+    // string
+    //////////////////////////////////////////////////////////////////////////
+
+    template<>
+    struct range_difference< char* >
+    {
+        typedef std::ptrdiff_t type;
+    };
+
+    template<>
+    struct range_difference< wchar_t* >
+    {
+        typedef std::ptrdiff_t type;
+    };
+
+    template<>
+    struct range_difference< const char* >
+    {
+        typedef std::ptrdiff_t type;
+    };
+
+    template<>
+    struct range_difference< const wchar_t* >
+    {
+        typedef std::ptrdiff_t type;
+    };
+
+    template<>
+    struct range_difference< char* const >
+    {
+        typedef std::ptrdiff_t type;
+    };
+
+    template<>
+    struct range_difference< wchar_t* const >
+    {
+        typedef std::ptrdiff_t type;
+    };
+
+    template<>
+    struct range_difference< const char* const >
+    {
+        typedef std::ptrdiff_t type;
+    };
+
+    template<>
+    struct range_difference< const wchar_t* const >
+    {
+        typedef std::ptrdiff_t type;
+    };
+
+} // namespace boost
+
+#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+*/
+
 #endif

Deleted: boost/trunk/boost/range/distance.hpp
===================================================================
--- boost/trunk/boost/range/distance.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/distance.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,34 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2006. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-
-#ifndef BOOST_RANGE_DISTANCE_HPP
-#define BOOST_RANGE_DISTANCE_HPP
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
-# pragma once
-#endif
-
-#include <boost/range/begin.hpp>
-#include <boost/range/end.hpp>
-#include <boost/range/difference_type.hpp>
-
-namespace boost 
-{
-
-    template< class T >
-    inline BOOST_DEDUCED_TYPENAME range_difference<T>::type 
-    distance( const T& r )
-    {
-        return std::distance( boost::begin( r ), boost::end( r ) );
-    }
-
-} // namespace 'boost'
-
-#endif

Modified: boost/trunk/boost/range/empty.hpp
===================================================================
--- boost/trunk/boost/range/empty.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/empty.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,19 +16,52 @@
 #endif
 
 #include <boost/range/config.hpp>
+//#ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
+//#include <boost/range/detail/empty.hpp>
+//#else
+
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
 
 namespace boost 
 { 
+namespace range_detail 
+{
 
-    template< class T >
-    inline bool empty( const T& r )
-    {
-        return boost::begin( r ) == boost::end( r );
-    }
+        //////////////////////////////////////////////////////////////////////
+        // primary template
+        //////////////////////////////////////////////////////////////////////
 
+        template< typename C >
+        inline bool empty( const C& c )
+        {
+            return boost::begin( c ) == boost::end( c );
+        }
+
+        //////////////////////////////////////////////////////////////////////
+        // string
+        //////////////////////////////////////////////////////////////////////
+
+        inline bool empty( const char* const& s )
+        {
+            return s == 0 || s[0] == 0;
+        }
+
+        inline bool empty( const wchar_t* const& s )
+        {
+            return s == 0 || s[0] == 0;
+        }
+        
+} // namespace 'range_detail'
+
+template< class T >
+inline bool empty( const T& r )
+{
+    return range_detail::empty( r );
+}
+
 } // namepace 'boost'
 
+//#endif //  BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 
 #endif

Modified: boost/trunk/boost/range/end.hpp
===================================================================
--- boost/trunk/boost/range/end.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/end.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,6 +15,7 @@
 # pragma once
 #endif
 
+#include <boost/type_traits/remove_const.hpp>
 #include <boost/range/config.hpp>
 
 #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
@@ -38,25 +39,34 @@
         //////////////////////////////////////////////////////////////////////
         // primary template
         //////////////////////////////////////////////////////////////////////
+
         template< typename C >
-        inline BOOST_DEDUCED_TYPENAME range_iterator<C>::type
-        range_end( C& c )
+        inline BOOST_DEDUCED_TYPENAME range_const_iterator<C>::type
+        boost_range_end( const C& c )
         {
             return c.end();
         }
 
+        template< typename C >
+                inline BOOST_DEDUCED_TYPENAME range_iterator<
+                                        typename remove_const<C>::type >::type
+        boost_range_end( C& c )
+        {
+            return c.end();
+        }
+
         //////////////////////////////////////////////////////////////////////
         // pair
         //////////////////////////////////////////////////////////////////////
 
         template< typename Iterator >
-        inline Iterator range_end( const std::pair<Iterator,Iterator>& p )
+        inline Iterator boost_range_end( const std::pair<Iterator,Iterator>& p )
         {
             return p.second;
         }
 
         template< typename Iterator >
-        inline Iterator range_end( std::pair<Iterator,Iterator>& p )
+        inline Iterator boost_range_end( std::pair<Iterator,Iterator>& p )
         {
             return p.second;
         }
@@ -66,17 +76,64 @@
         //////////////////////////////////////////////////////////////////////
 
         template< typename T, std::size_t sz >
-        inline const T* range_end( const T (&array)[sz] )
+        inline const T* boost_range_end( const T (&array)[sz] )
         {
             return range_detail::array_end<T,sz>( array );
         }
 
         template< typename T, std::size_t sz >
-        inline T* range_end( T (&array)[sz] )
+        inline T* boost_range_end( T (&array)[sz] )
         {
             return range_detail::array_end<T,sz>( array );
         }
 
+        //////////////////////////////////////////////////////////////////////
+        // string
+        //////////////////////////////////////////////////////////////////////
+
+#if 1 || BOOST_WORKAROUND(__MWERKS__, <= 0x3204 ) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+// CW up to 9.3 and borland have troubles with function ordering
+        inline char* boost_range_end( char* s )
+        {
+            return range_detail::str_end( s );
+        }
+
+        inline wchar_t* boost_range_end( wchar_t* s )
+        {
+            return range_detail::str_end( s );
+        }
+
+        inline const char* boost_range_end( const char* s )
+        {
+            return range_detail::str_end( s );
+        }
+
+        inline const wchar_t* boost_range_end( const wchar_t* s )
+        {
+            return range_detail::str_end( s );
+        }
+#else
+        inline char* boost_range_end( char*& s )
+        {
+            return range_detail::str_end( s );
+        }
+
+        inline wchar_t* boost_range_end( wchar_t*& s )
+        {
+            return range_detail::str_end( s );
+        }
+
+        inline const char* boost_range_end( const char*& s )
+        {
+            return range_detail::str_end( s );
+        }
+
+        inline const wchar_t* boost_range_end( const wchar_t*& s )
+        {
+            return range_detail::str_end( s );
+        }
+#endif
+
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
     !BOOST_WORKAROUND(__GNUC__, < 3) \
     /**/
@@ -84,27 +141,46 @@
 #endif
 
 template< class T >
-inline BOOST_DEDUCED_TYPENAME range_iterator<T>::type end( T& r )
+inline BOOST_DEDUCED_TYPENAME range_iterator<
+                typename remove_const<T>::type >::type end( T& r )
 {
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
     !BOOST_WORKAROUND(__GNUC__, < 3) \
     /**/
     using namespace range_detail;
 #endif
-    return range_end( r );
+    return boost_range_end( r );
 }
 
 template< class T >
-inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type end( const T& r )
+inline BOOST_DEDUCED_TYPENAME range_const_iterator<T>::type end( const T& r )
 {
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
     !BOOST_WORKAROUND(__GNUC__, < 3) \
     /**/
     using namespace range_detail;
 #endif
-    return range_end( r );
+    return boost_range_end( r );
 }
 
+
+
+#if BOOST_WORKAROUND(__MWERKS__, <= 0x3003 ) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+// BCB and CW are not able to overload pointer when class overloads are also available.
+template<>
+inline range_const_iterator<const char*>::type end<const char*>( const char*& r )
+{
+    return range_detail::str_end( r );
+}
+
+template<>
+inline range_const_iterator<const wchar_t*>::type end<const wchar_t*>( const wchar_t*& r )
+{
+    return range_detail::str_end( r );
+}
+
+#endif
+
 } // namespace 'boost'
 
 
@@ -115,7 +191,7 @@
 namespace boost
 {
     template< class T >
-    inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type
+    inline BOOST_DEDUCED_TYPENAME range_const_iterator<T>::type
     const_end( const T& r )
     {
         return boost::end( r );
@@ -123,4 +199,3 @@
 }
 
 #endif
-

Modified: boost/trunk/boost/range/functions.hpp
===================================================================
--- boost/trunk/boost/range/functions.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/functions.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 // Boost.Range library
 //
-//  Copyright Thorsten Ottosen 2003-2006. Use, modification and
+//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
 //  distribution is subject to the Boost Software License, Version
 //  1.0. (See accompanying file LICENSE_1_0.txt or copy at
 //  http://www.boost.org/LICENSE_1_0.txt)
@@ -18,10 +18,8 @@
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
 #include <boost/range/size.hpp>
-#include <boost/range/distance.hpp>
 #include <boost/range/empty.hpp>
 #include <boost/range/rbegin.hpp>
 #include <boost/range/rend.hpp>
 
 #endif
-

Modified: boost/trunk/boost/range/iterator.hpp
===================================================================
--- boost/trunk/boost/range/iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,30 +11,118 @@
 #ifndef BOOST_RANGE_ITERATOR_HPP
 #define BOOST_RANGE_ITERATOR_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
+#if defined(_MSC_VER) && (_MSC_VER >= 1200)
 # pragma once
 #endif
 
 #include <boost/range/config.hpp>
-#include <boost/range/mutable_iterator.hpp>
-#include <boost/range/const_iterator.hpp>
-#include <boost/type_traits/is_const.hpp>
-#include <boost/type_traits/remove_const.hpp>
-#include <boost/mpl/eval_if.hpp>
 
+#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+#include <boost/range/detail/iterator.hpp>
+#else
+
+#include <boost/iterator/iterator_traits.hpp>
+#include <cstddef>
+#include <utility>
+
 namespace boost
 {
+    //////////////////////////////////////////////////////////////////////////
+    // default
+    //////////////////////////////////////////////////////////////////////////
+    
     template< typename C >
     struct range_iterator
     {
-        typedef BOOST_RANGE_DEDUCED_TYPENAME 
-            mpl::eval_if_c< is_const<C>::value, 
-                            range_const_iterator< typename remove_const<C>::type >,
-                            range_mutable_iterator<C> >::type type;
+        typedef BOOST_DEDUCED_TYPENAME C::iterator type;
     };
     
+    //////////////////////////////////////////////////////////////////////////
+    // pair
+    //////////////////////////////////////////////////////////////////////////
+
+    template< typename Iterator >
+    struct range_iterator< std::pair<Iterator,Iterator> >
+    {
+        typedef Iterator type;
+    };
+    
+    template< typename Iterator >
+    struct range_iterator< const std::pair<Iterator,Iterator> >
+    {
+        typedef Iterator type;
+    };
+
+    //////////////////////////////////////////////////////////////////////////
+    // array
+    //////////////////////////////////////////////////////////////////////////
+
+    template< typename T, std::size_t sz >
+    struct range_iterator< T[sz] >
+    {
+        typedef T* type;
+    };
+
+    template< typename T, std::size_t sz >
+    struct range_iterator< const T[sz] >
+    {
+        typedef const T* type;
+    };
+
+    //////////////////////////////////////////////////////////////////////////
+    // string
+    //////////////////////////////////////////////////////////////////////////
+
+    template<>
+    struct range_iterator< char* >
+    {
+        typedef char* type;
+    };
+
+    template<>
+    struct range_iterator< wchar_t* >
+    {
+        typedef wchar_t* type;
+    };
+
+    template<>
+    struct range_iterator< const char* >
+    {
+        typedef const char* type;
+    };
+
+    template<>
+    struct range_iterator< const wchar_t* >
+    {
+        typedef const wchar_t* type;
+    };
+
+    template<>
+    struct range_iterator< char* const >
+    {
+        typedef char* type;
+    };
+
+    template<>
+    struct range_iterator< wchar_t* const >
+    {
+        typedef wchar_t* type;
+    };
+
+    template<>
+    struct range_iterator< const char* const >
+    {
+        typedef const char* type;
+    };
+
+    template<>
+    struct range_iterator< const wchar_t* const >
+    {
+        typedef const wchar_t* type;
+    };
+
 } // namespace boost
 
-//#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 
 #endif

Modified: boost/trunk/boost/range/iterator_range.hpp
===================================================================
--- boost/trunk/boost/range/iterator_range.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/iterator_range.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,7 +23,7 @@
 
 #include <boost/detail/workaround.hpp>
 #include <boost/range/functions.hpp>
-#include <boost/range/iterator.hpp>
+#include <boost/range/result_iterator.hpp>
 #include <boost/range/difference_type.hpp>
 #include <boost/iterator/iterator_traits.hpp>    
 #include <boost/assert.hpp>
@@ -158,11 +158,8 @@
             //! iterator type
             typedef IteratorT iterator;
 
-            iterator_range() : m_Begin( iterator() ), m_End( iterator() )
-
-                 #ifndef NDEBUG
-            , singular( true )
-                #endif
+            iterator_range() : m_Begin( iterator() ), m_End( iterator() ), 
+                               singular( true )
             { }
 /*
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))  
@@ -181,57 +178,41 @@
             //! Constructor from a pair of iterators
             template< class Iterator >
             iterator_range( Iterator Begin, Iterator End ) : 
-                m_Begin(Begin), m_End(End)
-                #ifndef NDEBUG
-            , singular(false) 
-                 #endif
-            {}
+                m_Begin(Begin), m_End(End), singular(false) {}
 
             //! Constructor from a Range
             template< class Range >
             iterator_range( const Range& r ) : 
-                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) )
-                #ifndef NDEBUG
-            , singular(false) 
-                #endif
-            {}
-            
+                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) ), 
+                singular(false) {}
+
             //! Constructor from a Range
             template< class Range >
             iterator_range( Range& r ) : 
-                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) )
-                #ifndef NDEBUG
-            , singular(false) 
-                #endif
-            {}
+                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) ), 
+                singular(false) {}
 
             //! Constructor from a Range
             template< class Range >
             iterator_range( const Range& r, iterator_range_detail::const_range_tag ) : 
-                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) )
-                 #ifndef NDEBUG
-            , singular(false) 
-                #endif
-            {}
+                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) ), 
+                singular(false) {}
 
             //! Constructor from a Range
             template< class Range >
             iterator_range( Range& r, iterator_range_detail::range_tag ) : 
-                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) )
-                 #ifndef NDEBUG
-            , singular(false) 
-                #endif
-            {}
+                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) ), 
+                singular(false) {}
 
             #if !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
             this_type& operator=( const this_type& r )    
             {
                 m_Begin  = r.begin(); 
                 m_End    = r.end();
-
-                #ifndef NDEBUG
+                //
+                // remark: this need not necessarily be true, but it does no harm
+                //
                 singular = r.singular;
-                #endif
                 return *this;
             }
             #endif
@@ -241,9 +222,10 @@
             {
                 m_Begin  = r.begin(); 
                 m_End    = r.end();
-                #ifndef NDEBUG
-                singular = r.is_singular();
-                #endif
+                //
+                // remark: this need not necessarily be true, but it does no harm
+                //
+                singular = r.empty();
                 return *this;
             }
                                       
@@ -252,9 +234,7 @@
             {
                 m_Begin  = impl::adl_begin( r ); 
                 m_End    = impl::adl_end( r );
-                #ifndef NDEBUG
                 singular = false;
-                #endif
                 return *this;
             }
 
@@ -263,33 +243,37 @@
             {
                 m_Begin  = impl::adl_begin( r ); 
                 m_End    = impl::adl_end( r );
-                #ifndef NDEBUG    
                 singular = false;
-                #endif
                 return *this;
             }
 
             IteratorT begin() const 
             { 
-                BOOST_ASSERT( !is_singular() );
                 return m_Begin; 
             }
 
             IteratorT end() const 
             { 
-                BOOST_ASSERT( !is_singular() );
                 return m_End; 
             } 
 
             size_type size() const
             { 
-                BOOST_ASSERT( !is_singular() );
-                return m_End - m_Begin;
+                if( singular )
+                    return 0;
+
+#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x582))
+                return std::distance<IteratorT>( m_Begin, m_End );
+#else                
+                return std::distance( m_Begin, m_End );
+#endif                
             }
             
             bool empty() const
             {
-                BOOST_ASSERT( !is_singular() );
+                if( singular )
+                    return true;
+                
                 return m_Begin == m_End;
             }
 
@@ -308,8 +292,7 @@
 
             bool equal( const iterator_range& r ) const
             {
-                BOOST_ASSERT( !is_singular() );
-                return m_Begin == r.m_Begin && m_End == r.m_End;
+                return singular == r.singular && m_Begin == r.m_Begin && m_End == r.m_End;
             }
 
 
@@ -317,20 +300,17 @@
 
             bool operator==( const iterator_range& r ) const
             {
-                BOOST_ASSERT( !is_singular() );
                 return iterator_range_detail::equal( *this, r );
             }
 
             bool operator!=( const iterator_range& r ) const
             {
-                BOOST_ASSERT( !is_singular() );
                 return !operator==(r);
             }
 
            bool operator<( const iterator_range& r ) const
            {
-               BOOST_ASSERT( !is_singular() );
-               return iterator_range_detail::less_than( *this, r );
+                return iterator_range_detail::less_than( *this, r );
            }
 
 #endif            
@@ -351,20 +331,19 @@
     
            reference operator[]( size_type sz ) const
            {
+               //BOOST_STATIC_ASSERT( is_random_access );
                BOOST_ASSERT( sz < size() );
                return m_Begin[sz];
            }
 
            iterator_range& advance_begin( difference_type n )
            {
-               BOOST_ASSERT( !is_singular() );
                std::advance( m_Begin, n );
                return *this;
            }
            
            iterator_range& advance_end( difference_type n )
            {
-               BOOST_ASSERT( !is_singular() );
                std::advance( m_End, n );
                return *this;
            }
@@ -373,23 +352,24 @@
             // begin and end iterators
             IteratorT m_Begin;
             IteratorT m_End;
-
-            #ifndef NDEBUG
             bool      singular;
-            #endif
-
-            #ifndef NDEBUG
-        public:
-            bool is_singular() const
-            {
-                 return singular;
-            }
-            #endif
-
         };
 
 //  iterator range free-standing operators ---------------------------//
 
+#ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
+#else
+        template< class Iterator >
+        inline bool empty( const iterator_range<Iterator>& r )
+        {
+            //
+            // this will preserve the well-defined empty() even 
+            // though 'r' is singular.
+            //
+            return r.empty();
+        }
+#endif
+
 #ifndef BOOST_OLD_IOSTREAMS   
 
         //! iterator_range output operator
@@ -404,7 +384,7 @@
         {
             std::copy( r.begin(), r.end(), 
                        std::ostream_iterator< BOOST_DEDUCED_TYPENAME 
-                                              iterator_value<IteratorT>::type, 
+                                            iterator_value<IteratorT>::type, 
                                               Elem, Traits>(Os) );
             return Os;
         }
@@ -520,10 +500,10 @@
 #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 
         template< typename Range >
-        inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<Range>::type >
+        inline iterator_range< BOOST_DEDUCED_TYPENAME range_result_iterator<Range>::type >
         make_iterator_range( Range& r ) 
         {   
-            return iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<Range>::type >
+            return iterator_range< BOOST_DEDUCED_TYPENAME range_result_iterator<Range>::type >
                 ( boost::begin( r ), boost::end( r ) );
         }
         
@@ -542,10 +522,10 @@
         }
 
         template< class ForwardRange >
-        inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type >
+        inline iterator_range< BOOST_DEDUCED_TYPENAME range_const_iterator<ForwardRange>::type >
         make_iterator_range( const ForwardRange& r ) 
         {   
-           return iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type >
+           return iterator_range< BOOST_DEDUCED_TYPENAME range_const_iterator<ForwardRange>::type >
                 ( r, iterator_range_detail::const_range_tag() );
         }
 
@@ -554,19 +534,15 @@
         namespace iterator_range_detail
         {    
             template< class Range >
-            inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<Range>::type >
+            inline iterator_range< BOOST_DEDUCED_TYPENAME range_result_iterator<Range>::type >
             make_range_impl( Range& r, 
                              BOOST_DEDUCED_TYPENAME range_difference<Range>::type advance_begin,
                              BOOST_DEDUCED_TYPENAME range_difference<Range>::type advance_end )
             {
-                //
-                // Not worth the effort
-                //
-                //if( advance_begin == 0 && advance_end == 0 )
-                //    return make_iterator_range( r );
-                //
+                if( advance_begin == 0 && advance_end == 0 )
+                    return make_iterator_range( r );
 
-                BOOST_DEDUCED_TYPENAME range_iterator<Range>::type 
+                BOOST_DEDUCED_TYPENAME range_result_iterator<Range>::type 
                     new_begin = boost::begin( r ),
                     new_end   = boost::end( r );
                 std::advance( new_begin, advance_begin );
@@ -578,7 +554,7 @@
 #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 
         template< class Range >
-        inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<Range>::type >
+        inline iterator_range< BOOST_DEDUCED_TYPENAME range_result_iterator<Range>::type >
         make_iterator_range( Range& r, 
                     BOOST_DEDUCED_TYPENAME range_difference<Range>::type advance_begin,
                     BOOST_DEDUCED_TYPENAME range_difference<Range>::type advance_end )
@@ -600,7 +576,7 @@
         }
 
         template< class Range >
-        inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<const Range>::type >
+        inline iterator_range< BOOST_DEDUCED_TYPENAME range_const_iterator<Range>::type >
         make_iterator_range( const Range& r, 
                     BOOST_DEDUCED_TYPENAME range_difference<Range>::type advance_begin,
                     BOOST_DEDUCED_TYPENAME range_difference<Range>::type advance_end )
@@ -630,4 +606,3 @@
 #undef BOOST_OLD_IOSTREAMS
 
 #endif
-

Modified: boost/trunk/boost/range/metafunctions.hpp
===================================================================
--- boost/trunk/boost/range/metafunctions.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/metafunctions.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,15 +16,13 @@
 #endif
 
 #include <boost/range/iterator.hpp>
+#include <boost/range/const_iterator.hpp>
+#include <boost/range/value_type.hpp>
+#include <boost/range/size_type.hpp>
+#include <boost/range/difference_type.hpp>
 #include <boost/range/result_iterator.hpp>
 #include <boost/range/reverse_iterator.hpp>
 #include <boost/range/const_reverse_iterator.hpp>
 #include <boost/range/reverse_result_iterator.hpp>
-#include <boost/range/value_type.hpp>
-#include <boost/range/size_type.hpp>
-#include <boost/range/difference_type.hpp>
-#include <boost/range/category.hpp>
-#include <boost/range/reference.hpp>
-#include <boost/range/pointer.hpp>
 
 #endif

Deleted: boost/trunk/boost/range/mutable_iterator.hpp
===================================================================
--- boost/trunk/boost/range/mutable_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/mutable_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,64 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-
-#ifndef BOOST_RANGE_MUTABLE_ITERATOR_HPP
-#define BOOST_RANGE_MUTABLE_ITERATOR_HPP
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
-# pragma once
-#endif
-
-#include <boost/range/config.hpp>
-
-#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-#include <boost/range/detail/iterator.hpp>
-#else
-
-#include <boost/iterator/iterator_traits.hpp>
-#include <cstddef>
-#include <utility>
-
-namespace boost
-{
-    //////////////////////////////////////////////////////////////////////////
-    // default
-    //////////////////////////////////////////////////////////////////////////
-    
-    template< typename C >
-    struct range_mutable_iterator
-    {
-        typedef BOOST_DEDUCED_TYPENAME C::iterator type;
-    };
-    
-    //////////////////////////////////////////////////////////////////////////
-    // pair
-    //////////////////////////////////////////////////////////////////////////
-
-    template< typename Iterator >
-    struct range_mutable_iterator< std::pair<Iterator,Iterator> >
-    {
-        typedef Iterator type;
-    };
-
-    //////////////////////////////////////////////////////////////////////////
-    // array
-    //////////////////////////////////////////////////////////////////////////
-
-    template< typename T, std::size_t sz >
-    struct range_mutable_iterator< T[sz] >
-    {
-        typedef T* type;
-    };
-
-} // namespace boost
-
-#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-
-#endif

Deleted: boost/trunk/boost/range/pointer.hpp
===================================================================
--- boost/trunk/boost/range/pointer.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/pointer.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,29 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2006. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-
-#ifndef BOOST_RANGE_POINTER_TYPE_HPP
-#define BOOST_RANGE_POINTER_TYPE_HPP
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
-# pragma once
-#endif
-
-#include <boost/range/config.hpp>
-#include <boost/range/iterator.hpp>
-#include <boost/iterator/iterator_traits.hpp>
-
-namespace boost
-{
-    template< class T >
-    struct range_pointer : iterator_pointer< typename range_iterator<T>::type >
-    { };
-}
-
-#endif

Modified: boost/trunk/boost/range/rbegin.hpp
===================================================================
--- boost/trunk/boost/range/rbegin.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/rbegin.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,9 @@
 #endif
 
 #include <boost/range/end.hpp>
+#include <boost/range/reverse_result_iterator.hpp>
 #include <boost/range/reverse_iterator.hpp>
+#include <boost/range/const_reverse_iterator.hpp>
 
 namespace boost
 {
@@ -24,28 +26,30 @@
 #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 
 template< class C >
-inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type
+inline BOOST_DEDUCED_TYPENAME range_reverse_result_iterator<C>::type
 rbegin( C& c )
 {
-    return BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type( boost::end( c ) );
+    return BOOST_DEDUCED_TYPENAME range_reverse_result_iterator<C>::type( end( c ) );
 }
 
 #else
 
 template< class C >
-inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type
+inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<
+                                                                typename remove_const<C>::type >::type
 rbegin( C& c )
 {
-    typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type
+    typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator<
+                                                                typename remove_const<C>::type >::type
         iter_type;
     return iter_type( boost::end( c ) );
 }
 
 template< class C >
-inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<const C>::type
+inline BOOST_DEDUCED_TYPENAME range_const_reverse_iterator<C>::type
 rbegin( const C& c )
 {
-    typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator<const C>::type
+    typedef BOOST_DEDUCED_TYPENAME range_const_reverse_iterator<C>::type
         iter_type;
     return iter_type( boost::end( c ) );
 }
@@ -53,7 +57,7 @@
 #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 
 template< class T >
-inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<const T>::type
+inline BOOST_DEDUCED_TYPENAME range_const_reverse_iterator<T>::type
 const_rbegin( const T& r )
 {
     return boost::rbegin( r );
@@ -62,4 +66,3 @@
 } // namespace 'boost'
 
 #endif
-

Deleted: boost/trunk/boost/range/reference.hpp
===================================================================
--- boost/trunk/boost/range/reference.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/reference.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,29 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-
-#ifndef BOOST_RANGE_REFERENCE_TYPE_HPP
-#define BOOST_RANGE_REFERENCE_TYPE_HPP
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
-# pragma once
-#endif
-
-#include <boost/range/config.hpp>
-#include <boost/range/iterator.hpp>
-#include <boost/iterator/iterator_traits.hpp>
-
-namespace boost
-{
-    template< class T >
-    struct range_reference : iterator_reference< typename range_iterator<T>::type >
-    { };
-}
-
-#endif

Modified: boost/trunk/boost/range/rend.hpp
===================================================================
--- boost/trunk/boost/range/rend.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/rend.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,9 @@
 #endif
 
 #include <boost/range/begin.hpp>
+#include <boost/range/reverse_result_iterator.hpp>
 #include <boost/range/reverse_iterator.hpp>
+#include <boost/range/const_reverse_iterator.hpp>
 
 namespace boost
 {
@@ -24,28 +26,30 @@
 #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 
 template< class C >
-inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type
+inline BOOST_DEDUCED_TYPENAME range_reverse_result_iterator<C>::type
 rend( C& c )
 {
-    return BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type( boost::begin( c ) );
+    return BOOST_DEDUCED_TYPENAME range_reverse_result_iterator<C>::type( boost::begin( c ) );
 }
 
 #else
 
 template< class C >
-inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type
+inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<
+                                                                typename remove_const<C>::type >::type
 rend( C& c )
 {
-    typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type
+        typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator<
+                                                                typename remove_const<C>::type >::type
                iter_type;
     return iter_type( boost::begin( c ) );
 }
 
 template< class C >
-inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<const C>::type
+inline BOOST_DEDUCED_TYPENAME range_const_reverse_iterator<C>::type
 rend( const C& c )
 {
-    typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator<const C>::type
+    typedef BOOST_DEDUCED_TYPENAME range_const_reverse_iterator<C>::type
         iter_type;
     return iter_type( boost::begin( c ) );
 }
@@ -53,7 +57,7 @@
 #endif
 
 template< class T >
-inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<const T>::type
+inline BOOST_DEDUCED_TYPENAME range_const_reverse_iterator<T>::type
 const_rend( const T& r )
 {
     return boost::rend( r );
@@ -62,4 +66,3 @@
 } // namespace 'boost'
 
 #endif
-

Modified: boost/trunk/boost/range/result_iterator.hpp
===================================================================
--- boost/trunk/boost/range/result_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/result_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,19 +15,29 @@
 # pragma once
 #endif
 
+#include <boost/range/config.hpp>
 #include <boost/range/iterator.hpp>
+#include <boost/range/const_iterator.hpp>
+#include <boost/type_traits/is_const.hpp>
+#include <boost/mpl/if.hpp>
 
 namespace boost
 {
-    //
-    // This interface is deprecated, use range_iterator<T>
-    //
+    //////////////////////////////////////////////////////////////////////////
+    // default
+    //////////////////////////////////////////////////////////////////////////
     
     template< typename C >
-    struct range_result_iterator : range_iterator<C>
-    { };
+    struct range_result_iterator
+    {
+        typedef BOOST_RANGE_DEDUCED_TYPENAME 
+            mpl::if_< BOOST_DEDUCED_TYPENAME is_const<C>::type, 
+                      BOOST_DEDUCED_TYPENAME range_const_iterator<C>::type,
+                      BOOST_DEDUCED_TYPENAME range_iterator<C>::type >::type type;
+    };
     
 } // namespace boost
 
+//#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 
 #endif

Modified: boost/trunk/boost/range/reverse_result_iterator.hpp
===================================================================
--- boost/trunk/boost/range/reverse_result_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/reverse_result_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,17 +15,22 @@
 # pragma once
 #endif
 
-#include <boost/range/reverse_iterator.hpp>
+#include <boost/range/config.hpp>
+#include <boost/range/result_iterator.hpp>
+#include <boost/iterator/reverse_iterator.hpp>
 
 namespace boost
 {
-    //
-    // This interface is deprecated, use range_reverse_iterator<T>
-    //
+    //////////////////////////////////////////////////////////////////////////
+    // default
+    //////////////////////////////////////////////////////////////////////////
    
     template< typename C >
-    struct range_reverse_result_iterator : range_reverse_iterator<C>
-    { };
+    struct range_reverse_result_iterator
+    {
+        typedef reverse_iterator< 
+            BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<C>::type > type;
+    };
     
 } // namespace boost
 

Modified: boost/trunk/boost/range/size.hpp
===================================================================
--- boost/trunk/boost/range/size.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/size.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,19 +15,109 @@
 # pragma once
 #endif
 
-#include <boost/range/begin.hpp>
-#include <boost/range/end.hpp>
+#include <boost/range/config.hpp>
+
+#ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
+#include <boost/range/detail/size.hpp>
+#else
+
+#include <boost/range/detail/implementation_help.hpp>
 #include <boost/range/size_type.hpp>
+#include <cstddef>
+#include <iterator>
+#include <utility>
 
 namespace boost 
 {
 
-    template< class T >
-    inline BOOST_DEDUCED_TYPENAME range_size<T>::type size( const T& r )
-    {
-        return boost::end( r ) - boost::begin( r );
-    }
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))    
+namespace range_detail 
+{
+#endif
+        //////////////////////////////////////////////////////////////////////
+        // primary template
+        //////////////////////////////////////////////////////////////////////
+        
+        template< typename C >
+        inline BOOST_DEDUCED_TYPENAME C::size_type
+        boost_range_size(  const C& c )
+        {
+            return c.size(); 
+        }
 
+        //////////////////////////////////////////////////////////////////////
+        // pair
+        //////////////////////////////////////////////////////////////////////
+
+        template< typename Iterator >
+        inline std::size_t boost_range_size(  const std::pair<Iterator,Iterator>& p )
+        {
+            return std::distance( p.first, p.second );
+        }
+
+        //////////////////////////////////////////////////////////////////////
+        // array
+        //////////////////////////////////////////////////////////////////////
+
+        template< typename T, std::size_t sz >
+        inline std::size_t boost_range_size(  const T (&array)[sz] )
+        {
+            return range_detail::array_size<T,sz>( array ); 
+        }
+        
+        template< typename T, std::size_t sz >
+        inline std::size_t boost_range_size(  T (&array)[sz] )
+        {
+            return boost::range_detail::array_size<T,sz>( array );
+        }
+        
+        //////////////////////////////////////////////////////////////////////
+        // string
+        //////////////////////////////////////////////////////////////////////
+
+        inline std::size_t boost_range_size(  const char* const& s )
+        {
+            return boost::range_detail::str_size( s );
+        }
+
+        inline std::size_t boost_range_size(  const wchar_t* const& s )
+        {
+            return boost::range_detail::str_size( s );
+        }
+
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))                
+} // namespace 'range_detail'
+#endif
+
+template< class T >
+inline BOOST_DEDUCED_TYPENAME range_size<T>::type size(  const T& r )
+{
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))        
+    using namespace range_detail;
+#endif    
+    return boost_range_size( r );
+}
+
+
+#if BOOST_WORKAROUND(__MWERKS__, <= 0x3003 ) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+// BCB and CW are not able to overload pointer when class overloads are also available.
+inline range_size<const char*>::type size(  const char* r ) {
+    return range_detail::str_size( r );
+}
+inline range_size<char*>::type size(  char* r ) {
+    return range_detail::str_size( r );
+}
+inline range_size<const wchar_t*>::type size(  const wchar_t* r ) {
+    return range_detail::str_size( r );
+}
+inline range_size<wchar_t*>::type size(  wchar_t* r ) {
+    return range_detail::str_size( r );
+}
+#endif
+
+
 } // namespace 'boost'
 
+#endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING
+
 #endif

Modified: boost/trunk/boost/range/size_type.hpp
===================================================================
--- boost/trunk/boost/range/size_type.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/size_type.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,60 +16,158 @@
 #endif
 
 #include <boost/range/config.hpp>
+/*
+#include <boost/range/difference_type.hpp>
 
+namespace boost
+{
+        namespace range_detail
+        {
+                template< class T >
+                struct add_unsigned;
+
+                template<>
+                struct add_unsigned<short>
+                {
+                        typedef unsigned short type;
+                };
+
+                template<>
+                struct add_unsigned<int>
+                {
+                        typedef unsigned int type;
+                };
+
+                template<>
+                struct add_unsigned<long>
+                {
+                        typedef unsigned long type;
+                };
+
+#ifdef BOOST_HAS_LONG_LONG
+
+                template<>
+                struct add_unsigned<long long>
+                {
+                        typedef unsigned long long type;
+                };
+#endif
+
+        }
+
+        template< class T >
+        struct range_size
+        {
+                typedef BOOST_DEDUCED_TYPENAME range_detail::add_unsigned<
+                                        BOOST_DEDUCED_TYPENAME range_difference<T>::type >::type
+                        type;
+        };
+}
+*/
+
 #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 #include <boost/range/detail/size_type.hpp>
 #else
 
-#include <boost/type_traits/remove_const.hpp>
 #include <cstddef>
 #include <utility>
 
 namespace boost
 {
-    namespace detail
+    //////////////////////////////////////////////////////////////////////////
+    // default
+    //////////////////////////////////////////////////////////////////////////
+
+    template< typename C >
+    struct range_size
     {
+        typedef BOOST_DEDUCED_TYPENAME C::size_type type;
+    };
 
-        //////////////////////////////////////////////////////////////////////////
-        // default
-        //////////////////////////////////////////////////////////////////////////
-    
-        template< typename C >
-        struct range_size
-        {
-            typedef BOOST_DEDUCED_TYPENAME C::size_type type;
-        };
-    
-        //////////////////////////////////////////////////////////////////////////
-        // pair
-        //////////////////////////////////////////////////////////////////////////
-    
-        template< typename Iterator >
-        struct range_size< std::pair<Iterator,Iterator> >
-        {
-            typedef std::size_t type;
-        };
-    
-        //////////////////////////////////////////////////////////////////////////
-        // array
-        //////////////////////////////////////////////////////////////////////////
-    
-        template< typename T, std::size_t sz >
-        struct range_size< T[sz] >
-        {
-            typedef std::size_t type;
-        };
-    }
+    //////////////////////////////////////////////////////////////////////////
+    // pair
+    //////////////////////////////////////////////////////////////////////////
 
-    template< class T >
-    struct range_size : 
-        detail::range_size<T>
-    { };
+    template< typename Iterator >
+    struct range_size< std::pair<Iterator,Iterator> >
+    {
+        typedef std::size_t type;
+    };
 
-    template< class T >
-    struct range_size<const T > : range_size<T>
-    { };
-    
+    template< typename Iterator >
+    struct range_size< const std::pair<Iterator,Iterator> >
+    {
+        typedef std::size_t type;
+    };
+
+    //////////////////////////////////////////////////////////////////////////
+    // array
+    //////////////////////////////////////////////////////////////////////////
+
+    template< typename T, std::size_t sz >
+    struct range_size< T[sz] >
+    {
+        typedef std::size_t type;
+    };
+
+    template< typename T, std::size_t sz >
+    struct range_size< const T[sz] >
+    {
+        typedef std::size_t type;
+    };
+
+    //////////////////////////////////////////////////////////////////////////
+    // string
+    //////////////////////////////////////////////////////////////////////////
+
+    template<>
+    struct range_size< char* >
+    {
+        typedef std::size_t type;
+    };
+
+    template<>
+    struct range_size< wchar_t* >
+    {
+        typedef std::size_t type;
+    };
+
+    template<>
+    struct range_size< const char* >
+    {
+        typedef std::size_t type;
+    };
+
+    template<>
+    struct range_size< const wchar_t* >
+    {
+        typedef std::size_t type;
+    };
+
+    template<>
+    struct range_size< char* const >
+    {
+        typedef std::size_t type;
+    };
+
+    template<>
+    struct range_size< wchar_t* const >
+    {
+        typedef std::size_t type;
+    };
+
+    template<>
+    struct range_size< const char* const >
+    {
+        typedef std::size_t type;
+    };
+
+    template<>
+    struct range_size< const wchar_t* const >
+    {
+        typedef std::size_t type;
+    };
+
 } // namespace boost
 
 #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION

Modified: boost/trunk/boost/range/sub_range.hpp
===================================================================
--- boost/trunk/boost/range/sub_range.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/sub_range.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,6 +14,7 @@
 #include <boost/range/config.hpp>
 #include <boost/range/iterator_range.hpp>
 #include <boost/range/value_type.hpp>
+#include <boost/range/result_iterator.hpp>
 #include <boost/range/size_type.hpp>
 #include <boost/range/difference_type.hpp>
 #include <boost/assert.hpp>
@@ -22,18 +23,20 @@
 {
     
     template< class ForwardRange > 
-    class sub_range : public iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type > 
+    class sub_range : public iterator_range< BOOST_DEDUCED_TYPENAME range_result_iterator<ForwardRange>::type > 
     {
-        typedef BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type iterator_t;
+        typedef BOOST_DEDUCED_TYPENAME range_result_iterator<ForwardRange>::type iterator_t;
         typedef iterator_range< iterator_t  > base;
 
         typedef BOOST_DEDUCED_TYPENAME base::impl impl;
     public:
         typedef BOOST_DEDUCED_TYPENAME range_value<ForwardRange>::type            value_type;
-        typedef BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type         iterator;
-        typedef BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type   const_iterator;
+        typedef BOOST_DEDUCED_TYPENAME range_result_iterator<ForwardRange>::type  iterator;
+        typedef BOOST_DEDUCED_TYPENAME range_const_iterator<ForwardRange>::type   const_iterator;
         typedef BOOST_DEDUCED_TYPENAME range_difference<ForwardRange>::type       difference_type;
         typedef BOOST_DEDUCED_TYPENAME range_size<ForwardRange>::type             size_type;
+        typedef BOOST_DEDUCED_TYPENAME base::reference                            reference;
+        typedef BOOST_DEDUCED_TYPENAME iterator_reference<const_iterator>::type   const_reference;
 
     public:
         sub_range() : base() 
@@ -108,32 +111,32 @@
 
         
     public: // convenience
-        value_type& front()
+        reference front()
         {
             return base::front();
         }
 
-        const value_type& front() const
+        const_reference front() const
         {
             return base::front();
         }
 
-        value_type& back()
+        reference back()
         {
             return base::back();
         }
 
-        const value_type& back() const
+        const_reference back() const
         {
             return base::back();
         }
 
-        value_type& operator[]( size_type sz )
+        reference operator[]( size_type sz )
         {
             return base::operator[](sz);
         }
 
-        const value_type& operator[]( size_type sz ) const
+        const_reference operator[]( size_type sz ) const
         {
             return base::operator[](sz);
         }
@@ -165,4 +168,3 @@
 } // namespace 'boost'
 
 #endif
-

Modified: boost/trunk/boost/range/value_type.hpp
===================================================================
--- boost/trunk/boost/range/value_type.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/range/value_type.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,17 +18,129 @@
 #include <boost/range/config.hpp>
 #include <boost/range/iterator.hpp>
 
-//#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-//#include <boost/range/detail/value_type.hpp>
-//#else
+#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+#include <boost/range/detail/value_type.hpp>
+#else
 
 #include <boost/iterator/iterator_traits.hpp>
 
 namespace boost
 {
-    template< class T >
-    struct range_value : iterator_value< typename range_iterator<T>::type >
-    { };
+        template< class T >
+    struct range_value
+        {
+                typedef BOOST_DEDUCED_TYPENAME iterator_value<
+                        BOOST_DEDUCED_TYPENAME range_iterator<T>::type >::type
+                                type;
+        };
 }
 
+/*
+#include <cstddef>
+#include <utility>
+
+
+namespace boost
+{
+    //////////////////////////////////////////////////////////////////////////
+    // default
+    //////////////////////////////////////////////////////////////////////////
+
+    template< typename C >
+    struct range_value
+    {
+        typedef BOOST_DEDUCED_TYPENAME C::value_type type;
+    };
+
+    //////////////////////////////////////////////////////////////////////////
+    // pair
+    //////////////////////////////////////////////////////////////////////////
+
+    template< typename Iterator >
+    struct range_value< std::pair<Iterator,Iterator> >
+    {
+        typedef BOOST_DEDUCED_TYPENAME
+            iterator_value<Iterator>::type type;
+    };
+
+
+    template< typename Iterator >
+    struct range_value< const std::pair<Iterator,Iterator> >
+    {
+        typedef BOOST_DEDUCED_TYPENAME
+            iterator_value<Iterator>::type type;
+    };
+
+    //////////////////////////////////////////////////////////////////////////
+    // array
+    //////////////////////////////////////////////////////////////////////////
+
+    template< typename T, std::size_t sz >
+    struct range_value< T[sz] >
+    {
+        typedef T type;
+    };
+
+    template< typename T, std::size_t sz >
+    struct range_value< const T[sz] >
+    {
+        typedef const T type;
+    };
+
+    //////////////////////////////////////////////////////////////////////////
+    // string
+    //////////////////////////////////////////////////////////////////////////
+
+    template<>
+    struct range_value< char* >
+    {
+        typedef char type;
+    };
+
+    template<>
+    struct range_value< wchar_t* >
+    {
+        typedef wchar_t type;
+    };
+
+    template<>
+    struct range_value< const char* >
+    {
+        typedef const char type;
+    };
+
+    template<>
+    struct range_value< const wchar_t* >
+    {
+        typedef const wchar_t type;
+    };
+
+    template<>
+    struct range_value< char* const >
+    {
+        typedef char type;
+    };
+
+    template<>
+    struct range_value< wchar_t* const >
+    {
+        typedef wchar_t type;
+    };
+
+    template<>
+    struct range_value< const char* const >
+    {
+        typedef const char type;
+    };
+
+    template<>
+    struct range_value< const wchar_t* const >
+    {
+        typedef const wchar_t type;
+    };
+
+} // namespace boost
+*/
+#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+
 #endif

Modified: boost/trunk/boost/rational.hpp
===================================================================
--- boost/trunk/boost/rational.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/rational.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,6 +17,9 @@
 //    Nickolay Mladenov, for the implementation of operator+=
 
 //  Revision History
+//  20 Oct 06  Fix operator bool_type for CW 8.3 (Joaquín M López Muñoz)
+//  18 Oct 06  Use EXPLICIT_TEMPLATE_TYPE helper macros from Boost.Config
+//             (Joaquín M López Muñoz)
 //  27 Dec 05  Add Boolean conversion operator (Daryle Walker)
 //  28 Sep 02  Use _left versions of operators from operators.hpp
 //  05 Jul 01  Recode gcd(), avoiding std::swap (Helmut Zeisel)
@@ -48,6 +51,7 @@
 #include <cstdlib>               // for std::abs
 #include <boost/call_traits.hpp> // for boost::call_traits
 #include <boost/config.hpp>      // for BOOST_NO_STDC_NAMESPACE, BOOST_MSVC
+#include <boost/detail/workaround.hpp> // for BOOST_WORKAROUND
 
 namespace boost {
 
@@ -171,8 +175,20 @@
     bool operator!() const { return !num; }
 
     // Boolean conversion
+    
+#if BOOST_WORKAROUND(__MWERKS__,<=0x3003)
+    // The "ISO C++ Template Parser" option in CW 8.3 chokes on the
+    // following, hence we selectively disable that option for the
+    // offending memfun.
+#pragma parse_mfunc_templ off
+#endif
+
     operator bool_type() const { return operator !() ? 0 : &helper::parts; }
 
+#if BOOST_WORKAROUND(__MWERKS__,<=0x3003)
+#pragma parse_mfunc_templ reset
+#endif
+
     // Comparison operators
     bool operator< (const rational& r) const;
     bool operator== (const rational& r) const;
@@ -508,7 +524,8 @@
 
 // Type conversion
 template <typename T, typename IntType>
-inline T rational_cast(const rational<IntType>& src)
+inline T rational_cast(
+    const rational<IntType>& src BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(T))
 {
     return static_cast<T>(src.numerator())/src.denominator();
 }

Modified: boost/trunk/boost/regex/icu.hpp
===================================================================
--- boost/trunk/boost/regex/icu.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/regex/icu.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -277,8 +277,8 @@
    conv_type a(i), b(j);
    while(a != b)
    {
-	   v.push_back(*a);
-	   ++a;
+      v.push_back(*a);
+      ++a;
    }
    if(v.size())
       return u32regex(&*v.begin(), v.size(), opt);
@@ -297,8 +297,8 @@
    conv_type a(i), b(j);
    while(a != b)
    {
-	   v.push_back(*a);
-	   ++a;
+      v.push_back(*a);
+      ++a;
    }
    if(v.size())
       return u32regex(&*v.begin(), v.size(), opt);
@@ -315,8 +315,8 @@
    vector_type v;
    while(i != j)
    {
-	   v.push_back((UCHAR32)(*i));
-	   ++a;
+      v.push_back((UCHAR32)(*i));
+      ++a;
    }
    if(v.size())
       return u32regex(&*v.begin(), v.size(), opt);
@@ -880,7 +880,7 @@
 #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
    <OutputIterator>
 #endif
-	 (
+    (
       re_detail::do_regex_replace(
          re_detail::make_utf32_out(out, static_cast<mpl::int_<sizeof(*first)> const*>(0)),
          re_detail::make_utf32_seq(first, last, static_cast<mpl::int_<sizeof(*first)> const*>(0)),
@@ -902,7 +902,7 @@
 #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
    <OutputIterator>
 #endif
-	 (
+    (
       re_detail::do_regex_replace(
          re_detail::make_utf32_out(out, static_cast<mpl::int_<sizeof(*first)> const*>(0)),
          re_detail::make_utf32_seq(first, last, static_cast<mpl::int_<sizeof(*first)> const*>(0)),
@@ -924,7 +924,7 @@
 #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
    <OutputIterator>
 #endif
-	(
+   (
       re_detail::do_regex_replace(
          re_detail::make_utf32_out(out, static_cast<mpl::int_<sizeof(*first)> const*>(0)),
          re_detail::make_utf32_seq(first, last, static_cast<mpl::int_<sizeof(*first)> const*>(0)),

Modified: boost/trunk/boost/regex/pending/object_cache.hpp
===================================================================
--- boost/trunk/boost/regex/pending/object_cache.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/regex/pending/object_cache.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -35,16 +35,16 @@
 class object_cache
 {
 public:
-   typedef std::pair< ::boost::shared_ptr<Object>, Key const*> value_type;
+   typedef std::pair< ::boost::shared_ptr<Object const>, Key const*> value_type;
    typedef std::list<value_type> list_type;
    typedef typename list_type::iterator list_iterator;
    typedef std::map<Key, list_iterator> map_type;
    typedef typename map_type::iterator map_iterator;
    typedef typename list_type::size_type size_type;
-   static boost::shared_ptr<Object> get(const Key& k, size_type max_cache_size);
+   static boost::shared_ptr<Object const> get(const Key& k, size_type max_cache_size);
 
 private:
-   static boost::shared_ptr<Object> do_get(const Key& k, size_type max_cache_size);
+   static boost::shared_ptr<Object const> do_get(const Key& k, size_type max_cache_size);
 
    struct data
    {
@@ -58,7 +58,7 @@
 };
 
 template <class Key, class Object>
-boost::shared_ptr<Object> object_cache<Key, Object>::get(const Key& k, size_type max_cache_size)
+boost::shared_ptr<Object const> object_cache<Key, Object>::get(const Key& k, size_type max_cache_size)
 {
 #ifdef BOOST_HAS_THREADS
    static boost::static_mutex mut = BOOST_STATIC_MUTEX_INIT;
@@ -80,7 +80,7 @@
 }
 
 template <class Key, class Object>
-boost::shared_ptr<Object> object_cache<Key, Object>::do_get(const Key& k, size_type max_cache_size)
+boost::shared_ptr<Object const> object_cache<Key, Object>::do_get(const Key& k, size_type max_cache_size)
 {
    typedef typename object_cache<Key, Object>::data object_data;
    typedef typename map_type::size_type map_size_type;
@@ -115,7 +115,7 @@
    // if we get here then the item is not in the cache,
    // so create it:
    //
-   boost::shared_ptr<Object> result(new Object(k));
+   boost::shared_ptr<Object const> result(new Object(k));
    //
    // Add it to the list, and index it:
    //

Modified: boost/trunk/boost/regex/v4/basic_regex.hpp
===================================================================
--- boost/trunk/boost/regex/v4/basic_regex.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/regex/v4/basic_regex.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,14 +3,14 @@
  * Copyright (c) 1998-2004
  * John Maddock
  *
- * Use, modification and distribution are subject to the 
- * Boost Software License, Version 1.0. (See accompanying file 
- * LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ * Distributed under the Boost Software License, Version 1.0.
+ * (See accompanying file LICENSE_1_0.txt or copy at
+ * http://www.boost.org/LICENSE_1_0.txt)
  *
  */
 
  /*
-  *   LOCATION:    see http://www.boost.org for most recent version.
+  *   LOCATION:    see http://www.boost.org/ for most recent version.
   *   FILE         basic_regex.cpp
   *   VERSION      see <boost/version.hpp>
   *   DESCRIPTION: Declares template class basic_regex.
@@ -343,7 +343,7 @@
    //
    // getflags:
    // retained for backwards compatibility only, "flags"
-   // is now the prefered name:
+   // is now the preferred name:
    flag_type BOOST_REGEX_CALL getflags()const
    { 
       return flags();

Modified: boost/trunk/boost/regex/v4/basic_regex_creator.hpp
===================================================================
--- boost/trunk/boost/regex/v4/basic_regex_creator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/regex/v4/basic_regex_creator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1185,7 +1185,7 @@
          unsigned id = static_cast<re_repeat*>(pt)->id;
          if(id > sizeof(m_bad_repeats) * CHAR_BIT)
             return true;  // run out of bits, assume we can't traverse this one.
-		   static const boost::uintmax_t one = 1uL;
+         static const boost::uintmax_t one = 1uL;
          return m_bad_repeats & (one << id);
       }
    default:
@@ -1205,7 +1205,7 @@
    case syntax_element_long_set_rep:
       {
          unsigned id = static_cast<re_repeat*>(pt)->id;
-		   static const boost::uintmax_t one = 1uL;
+         static const boost::uintmax_t one = 1uL;
          if(id <= sizeof(m_bad_repeats) * CHAR_BIT)
             m_bad_repeats |= (one << id);
       }

Modified: boost/trunk/boost/regex/v4/basic_regex_parser.hpp
===================================================================
--- boost/trunk/boost/regex/v4/basic_regex_parser.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/regex/v4/basic_regex_parser.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -222,6 +222,11 @@
       }
    case regex_constants::syntax_open_set:
       return parse_set();
+   case regex_constants::syntax_newline:
+      if(this->flags() & regbase::newline_alt)
+         return parse_alt();
+      else
+         return parse_literal();
    default:
       return parse_literal();
    }
@@ -286,6 +291,11 @@
       return parse_alt();
    case regex_constants::syntax_open_set:
       return parse_set();
+   case regex_constants::syntax_newline:
+      if(this->flags() & regbase::newline_alt)
+         return parse_alt();
+      else
+         return parse_literal();
    case regex_constants::syntax_hash:
       //
       // If we have a mod_x flag set, then skip until
@@ -1220,17 +1230,17 @@
          char_set.add_range(start_range, end_range);
          if(this->m_traits.syntax_type(*m_position) == regex_constants::syntax_dash)
          {
-			   if(m_end == ++m_position)
-			   {
-				   fail(regex_constants::error_brack, m_position - m_base);
-				   return;
-			   }
-			   if(this->m_traits.syntax_type(*m_position) == regex_constants::syntax_close_set)
-			   {
+            if(m_end == ++m_position)
+            {
+               fail(regex_constants::error_brack, m_position - m_base);
+               return;
+            }
+            if(this->m_traits.syntax_type(*m_position) == regex_constants::syntax_close_set)
+            {
                // trailing - :
                --m_position;
                return;
-			   }
+            }
             fail(regex_constants::error_range, m_position - m_base);
             return;
          }

Modified: boost/trunk/boost/regex/v4/cpp_regex_traits.hpp
===================================================================
--- boost/trunk/boost/regex/v4/cpp_regex_traits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/regex/v4/cpp_regex_traits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -407,12 +407,12 @@
    typedef charT char_type;
    //cpp_regex_traits_implementation();
    cpp_regex_traits_implementation(const std::locale& l)
-      : cpp_regex_traits_char_layer<charT>(l), m_is(&m_sbuf)
+      : cpp_regex_traits_char_layer<charT>(l)
    {
       init();
    }
    cpp_regex_traits_implementation(const cpp_regex_traits_base<charT>& l)
-      : cpp_regex_traits_char_layer<charT>(l), m_is(&m_sbuf)
+      : cpp_regex_traits_char_layer<charT>(l)
    {
       init();
    }
@@ -439,8 +439,6 @@
    string_type lookup_collatename(const charT* p1, const charT* p2) const;
    string_type transform_primary(const charT* p1, const charT* p2) const;
    string_type transform(const charT* p1, const charT* p2) const;
-   re_detail::parser_buf<charT>   m_sbuf;            // buffer for parsing numbers.
-   std::basic_istream<charT>      m_is;              // stream for parsing numbers.
 private:
    std::map<int, std::string>     m_error_strings;   // error messages indexed by numberic ID
    std::map<string_type, char_class_type>  m_custom_class_names; // character class names
@@ -564,7 +562,7 @@
       // std::collate<wchar_t>::transform returns a different string!
       // So as a workaround, we'll truncate the string at the first NULL
       // which _seems_ to work....
-#if BOOST_WORKAROUND(__BORLANDC__, < 0x600)
+#if BOOST_WORKAROUND(__BORLANDC__, < 0x580)
       result.erase(result.find(charT(0)));
 #else
       //
@@ -816,7 +814,7 @@
 
 
 template <class charT>
-inline boost::shared_ptr<cpp_regex_traits_implementation<charT> > create_cpp_regex_traits(const std::locale& l BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(charT))
+inline boost::shared_ptr<const cpp_regex_traits_implementation<charT> > create_cpp_regex_traits(const std::locale& l BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(charT))
 {
    cpp_regex_traits_base<charT> key(l);
    return ::boost::object_cache<cpp_regex_traits_base<charT>, cpp_regex_traits_implementation<charT> >::get(key, 5);
@@ -954,7 +952,7 @@
    static std::string get_catalog_name();
 
 private:
-   boost::shared_ptr<re_detail::cpp_regex_traits_implementation<charT> > m_pimpl;
+   boost::shared_ptr<const re_detail::cpp_regex_traits_implementation<charT> > m_pimpl;
    //
    // catalog name handler:
    //
@@ -969,17 +967,21 @@
 template <class charT>
 int cpp_regex_traits<charT>::toi(const charT*& first, const charT* last, int radix)const
 {
+   re_detail::parser_buf<charT>   sbuf;            // buffer for parsing numbers.
+   std::basic_istream<charT>      is(&sbuf);       // stream for parsing numbers.
+
    // we do NOT want to parse any thousands separators inside the stream:
-   last = std::find(first, last, BOOST_USE_FACET(std::numpunct<charT>, m_pimpl->m_is.getloc()).thousands_sep());
-   m_pimpl->m_sbuf.pubsetbuf(const_cast<charT*>(static_cast<const charT*>(first)), static_cast<std::streamsize>(last-first));
-   m_pimpl->m_is.clear();
-   if(std::abs(radix) == 16) m_pimpl->m_is >> std::hex;
-   else if(std::abs(radix) == 8) m_pimpl->m_is >> std::oct;
-   else m_pimpl->m_is >> std::dec;
+   last = std::find(first, last, BOOST_USE_FACET(std::numpunct<charT>, is.getloc()).thousands_sep());
+
+   sbuf.pubsetbuf(const_cast<charT*>(static_cast<const charT*>(first)), static_cast<std::streamsize>(last-first));
+   is.clear();
+   if(std::abs(radix) == 16) is >> std::hex;
+   else if(std::abs(radix) == 8) is >> std::oct;
+   else is >> std::dec;
    int val;
-   if(m_pimpl->m_is >> val)
+   if(is >> val)
    {
-      first = first + ((last - first) - m_pimpl->m_sbuf.in_avail());
+      first = first + ((last - first) - sbuf.in_avail());
       return val;
    }
    else

Modified: boost/trunk/boost/regex/v4/match_results.hpp
===================================================================
--- boost/trunk/boost/regex/v4/match_results.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/regex/v4/match_results.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -94,7 +94,7 @@
       if(sub < m_subs.size())
       {
          const sub_match<BidiIterator>& s = m_subs[sub];
-         if(s.matched)
+         if(s.matched || (sub == 2))
          {
             return ::boost::re_detail::distance((BidiIterator)(m_base), (BidiIterator)(s.first));
          }

Modified: boost/trunk/boost/regex/v4/perl_matcher.hpp
===================================================================
--- boost/trunk/boost/regex/v4/perl_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/regex/v4/perl_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,7 +49,7 @@
 {
    return ((c >= (1 << CHAR_BIT)) ? true : map[c] & mask);
 }
-#if !defined(__HP_aCC)
+#if !defined(__hpux) // can't use WCHAR_MIN in pp-directive
 #if defined(WCHAR_MIN) && (WCHAR_MIN == 0) && !defined(BOOST_NO_INTRINSIC_WCHAR_T)
 inline bool can_start(wchar_t c, const unsigned char* map, unsigned char mask)
 {
@@ -427,9 +427,9 @@
    // matching flags in use:
    match_flag_type m_match_flags;
    // how many states we have examined so far:
-   difference_type state_count;
+   boost::uintmax_t state_count;
    // max number of states to examine before giving up:
-   difference_type max_state_count;
+   boost::uintmax_t max_state_count;
    // whether we should ignore case or not:
    bool icase;
    // set to true when (position == last), indicates that we may have a partial match:

Modified: boost/trunk/boost/regex/v4/perl_matcher_common.hpp
===================================================================
--- boost/trunk/boost/regex/v4/perl_matcher_common.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/regex/v4/perl_matcher_common.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -77,15 +77,67 @@
 template <class BidiIterator, class Allocator, class traits>
 void perl_matcher<BidiIterator, Allocator, traits>::estimate_max_state_count(std::random_access_iterator_tag*)
 {
-   static const difference_type k = 100000;
-   difference_type dist = boost::re_detail::distance(base, last);
-   traits_size_type states = static_cast<traits_size_type>(re.size());
+   //
+   // How many states should we allow our machine to visit before giving up?
+   // This is a heuristic: it takes the greater of O(N^2) and O(NS^2)
+   // where N is the length of the string, and S is the number of states
+   // in the machine.  It's tempting to up this to O(N^2S) or even O(N^2S^2)
+   // but these take unreasonably amounts of time to bale out in pathological
+   // cases.
+   //
+   // Calculate NS^2 first:
+   //
+   static const boost::uintmax_t k = 100000;
+   boost::uintmax_t dist = boost::re_detail::distance(base, last);
+   if(dist == 0)
+      dist = 1;
+   boost::uintmax_t states = re.size();
+   if(states == 0)
+      states = 1;
    states *= states;
-   difference_type lim = ((std::numeric_limits<difference_type>::max)() - k) / states;
-   if(dist >= lim)
-      max_state_count = (std::numeric_limits<difference_type>::max)();
-   else
-      max_state_count = k + states * dist;
+   if((std::numeric_limits<boost::uintmax_t>::max)() / dist < states)
+   {
+      max_state_count = (std::numeric_limits<boost::uintmax_t>::max)() - 2;
+      return;
+   }
+   states *= dist;
+   if((std::numeric_limits<boost::uintmax_t>::max)() - k < states)
+   {
+      max_state_count = (std::numeric_limits<boost::uintmax_t>::max)() - 2;
+      return;
+   }
+   states += k;
+
+   max_state_count = states;
+
+   //
+   // Now calculate N^2:
+   //
+   states = dist;
+   if((std::numeric_limits<boost::uintmax_t>::max)() / dist < states)
+   {
+      max_state_count = (std::numeric_limits<boost::uintmax_t>::max)() - 2;
+      return;
+   }
+   states *= dist;
+   if((std::numeric_limits<boost::uintmax_t>::max)() - k < states)
+   {
+      max_state_count = (std::numeric_limits<boost::uintmax_t>::max)() - 2;
+      return;
+   }
+   states += k;
+   //
+   // N^2 can be a very large number indeed, to prevent things getting out
+   // of control, cap the max states:
+   //
+   if(states > BOOST_REGEX_MAX_STATE_COUNT)
+      states = BOOST_REGEX_MAX_STATE_COUNT;
+   //
+   // If (the possibly capped) N^2 is larger than our first estimate,
+   // use this instead:
+   //
+   if(states > max_state_count)
+      max_state_count = states;
 }
 
 template <class BidiIterator, class Allocator, class traits>

Modified: boost/trunk/boost/regex/v4/perl_matcher_recursive.hpp
===================================================================
--- boost/trunk/boost/regex/v4/perl_matcher_recursive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/regex/v4/perl_matcher_recursive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -275,14 +275,12 @@
 #pragma warning(disable:4127 4244)
 #endif
    const re_repeat* rep = static_cast<const re_repeat*>(pstate);
-   if(next_count->get_id() != rep->id)
-   {
-      // we're moving to a different repeat from the last
-      // one, so set up a counter object and recurse:
-      repeater_count<BidiIterator> r(rep->id, &next_count, position);
-      return match_rep();
-   }
    //
+   // Always copy the repeat count, so that the state is restored
+   // when we exit this scope:
+   //
+   repeater_count<BidiIterator> r(rep->id, &next_count, position);
+   //
    // If we've had at least one repeat already, and the last one 
    // matched the NULL string then set the repeat count to
    // maximum:
@@ -478,7 +476,7 @@
          return true;
       if(count >= rep->max)
          return false;
-      if(position == last)
+      if(save_pos == last)
          return false;
       position = ++save_pos;
       ++count;
@@ -572,9 +570,9 @@
          return true;
       if(count >= rep->max)
          return false;
+      position = save_pos;
       if(position == last)
          return false;
-      position = save_pos;
       if(traits_inst.translate(*position, icase) == what)
       {
          ++position;
@@ -661,9 +659,9 @@
          return true;
       if(count >= rep->max)
          return false;
+      position = save_pos;
       if(position == last)
          return false;
-      position = save_pos;
       if(map[static_cast<unsigned char>(traits_inst.translate(*position, icase))])
       {
          ++position;
@@ -751,9 +749,9 @@
          return true;
       if(count >= rep->max)
          return false;
+      position = save_pos;
       if(position == last)
          return false;
-      position = save_pos;
       if(position != re_is_set_member(position, last, set, re.get_data(), icase))
       {
          ++position;

Modified: boost/trunk/boost/regex/v4/regex_token_iterator.hpp
===================================================================
--- boost/trunk/boost/regex/v4/regex_token_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/regex/v4/regex_token_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -66,11 +66,11 @@
       : end(last), re(*p), flags(f){ subs.push_back(sub); }
    regex_token_iterator_implementation(const regex_type* p, BidirectionalIterator last, const std::vector<int>& v, match_flag_type f)
       : end(last), re(*p), flags(f), subs(v){}
-#if !BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(55500))
+#if !BOOST_WORKAROUND(__HP_aCC, < 60700)
 #if (BOOST_WORKAROUND(__BORLANDC__, >= 0x560) && BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570)))\
       || BOOST_WORKAROUND(BOOST_MSVC, < 1300) \
       || BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) \
-      || BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(55500))
+      || BOOST_WORKAROUND(__HP_aCC, < 60700)
    template <class T>
    regex_token_iterator_implementation(const regex_type* p, BidirectionalIterator last, const T& submatches, match_flag_type f)
       : end(last), re(*p), flags(f)
@@ -110,6 +110,7 @@
          result.first = first;
          result.second = end;
          result.matched = (first != end);
+         N = -1;
          return true;
       }
       return false;
@@ -199,11 +200,11 @@
       if(!pdata->init(a))
          pdata.reset();
    }
-#if !BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(55500))
+#if !BOOST_WORKAROUND(__HP_aCC, < 60700)
 #if (BOOST_WORKAROUND(__BORLANDC__, >= 0x560) && BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570)))\
       || BOOST_WORKAROUND(BOOST_MSVC, < 1300) \
       || BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) \
-      || BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(55500))
+      || BOOST_WORKAROUND(__HP_aCC, < 60700)
    template <class T>
    regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b, const regex_type& re,
                         const T& submatches, match_flag_type m = match_default)

Modified: boost/trunk/boost/regex/v4/regex_traits_defaults.hpp
===================================================================
--- boost/trunk/boost/regex/v4/regex_traits_defaults.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/regex/v4/regex_traits_defaults.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -77,7 +77,7 @@
 {
    return false;
 }
-#ifndef __HP_aCC
+#ifndef __hpux // can't use WCHAR_MIN/MAX in pp-directives.
 #ifdef _MSC_VER 
 template<>
 inline bool is_combining<wchar_t>(wchar_t c)

Modified: boost/trunk/boost/regex/v4/u32regex_token_iterator.hpp
===================================================================
--- boost/trunk/boost/regex/v4/u32regex_token_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/regex/v4/u32regex_token_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -67,7 +67,7 @@
 #elif (BOOST_WORKAROUND(__BORLANDC__, >= 0x560) && BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570)))\
       || BOOST_WORKAROUND(BOOST_MSVC, < 1300) \
       || BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) \
-      || BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(55500))
+      || BOOST_WORKAROUND(__HP_aCC, < 60700)
    template <class T>
    u32regex_token_iterator_implementation(const regex_type* p, BidirectionalIterator last, const T& submatches, match_flag_type f)
       : end(last), re(*p), flags(f)
@@ -107,6 +107,7 @@
          result.first = first;
          result.second = end;
          result.matched = (first != end);
+         N = -1;
          return true;
       }
       return false;
@@ -199,7 +200,7 @@
 #elif (BOOST_WORKAROUND(__BORLANDC__, >= 0x560) && BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570)))\
       || BOOST_WORKAROUND(BOOST_MSVC, < 1300) \
       || BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) \
-      || BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(55500))
+      || BOOST_WORKAROUND(__HP_aCC, < 60700)
    template <class T>
    u32regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b, const regex_type& re,
                         const T& submatches, match_flag_type m = match_default)

Modified: boost/trunk/boost/regex/v4/w32_regex_traits.hpp
===================================================================
--- boost/trunk/boost/regex/v4/w32_regex_traits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/regex/v4/w32_regex_traits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -166,7 +166,7 @@
    {
       return ::boost::re_detail::w32_tolower(c, this->m_locale);
    }
-   bool isctype(boost::uint32_t mask, charT c)
+   bool isctype(boost::uint32_t mask, charT c)const
    {
       return ::boost::re_detail::w32_is(this->m_locale, mask, c);
    }
@@ -263,7 +263,7 @@
    {
       return m_lower_map[static_cast<unsigned char>(c)];
    }
-   bool isctype(boost::uint32_t mask, char c)
+   bool isctype(boost::uint32_t mask, char c)const
    {
       return m_type_map[static_cast<unsigned char>(c)] & mask;
    }
@@ -540,7 +540,7 @@
 
 
 template <class charT>
-boost::shared_ptr<w32_regex_traits_implementation<charT> > create_w32_regex_traits(::boost::re_detail::lcid_type l BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(charT))
+boost::shared_ptr<const w32_regex_traits_implementation<charT> > create_w32_regex_traits(::boost::re_detail::lcid_type l BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(charT))
 {
    // TODO: create a cache for previously constructed objects.
    return boost::object_cache< ::boost::re_detail::lcid_type, w32_regex_traits_implementation<charT> >::get(l, 5);
@@ -654,7 +654,7 @@
    static std::string get_catalog_name();
 
 private:
-   boost::shared_ptr<re_detail::w32_regex_traits_implementation<charT> > m_pimpl;
+   boost::shared_ptr<const re_detail::w32_regex_traits_implementation<charT> > m_pimpl;
    //
    // catalog name handler:
    //

Deleted: boost/trunk/boost/serialization/array.hpp
===================================================================
--- boost/trunk/boost/serialization/array.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/array.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,105 +0,0 @@
-#ifndef BOOST_SERIALIZATION_ARRAY_HPP
-#define BOOST_SERIALIZATION_ARRAY_HPP
-
-// (C) Copyright 2005 Matthias Troyer and Dave Abrahams
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#include <boost/serialization/nvp.hpp>
-#include <boost/serialization/split_free.hpp>
-#include <boost/serialization/wrapper.hpp>
-#include <boost/serialization/collection_size_type.hpp>
-#include <boost/archive/archive_exception.hpp>
-#include <boost/throw_exception.hpp>
-#include <iostream>
-
-namespace boost { namespace serialization {
-
-template<class T>
-class array
- : public wrapper_traits<array<T>, object_serializable, track_never>
-{
-public:    
-    explicit array(T* t, std::size_t s) :
-        m_t(t),
-        m_element_count(s)
-    {}
-    
-    // default implementation
-    template<class Archive>
-    void serialize(Archive &ar, const unsigned int) const
-    {
-      // default implemention does the loop
-      std::size_t c = count();
-      T * t = address();
-      while(0 < c--)
-            ar & make_nvp("item", *t++);
-    }
-    
-    T* address() const
-    {
-      return m_t;
-    }
-
-    std::size_t count() const
-    {
-      return m_element_count;
-    }
-    
-    
-private:
-    T* m_t;
-    std::size_t const m_element_count;
-};
-
-template<class T>
-inline
-#ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
-const
-#endif
-array<T> make_array( T* t, std::size_t s){
-    return array<T>(t, s);
-}
-
-/////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
-// T[N]
-
-/*
-
-template<class Archive, class U, std::size_t N>
-void save( Archive & ar, U const (& t)[N], const unsigned int file_version )
-{
-  const serialization::collection_size_type count(N);
-  ar << BOOST_SERIALIZATION_NVP(count);
-  if (N)
-    ar << serialization::make_array(&t[0],N);
-}
-
-template<class Archive, class U, std::size_t N>
-void load( Archive & ar, U (& t)[N], const unsigned int file_version )
-{
-  serialization::collection_size_type count;
-  ar >> BOOST_SERIALIZATION_NVP(count);
-  if(count > N)
-      boost::throw_exception(archive::archive_exception(
-        boost::archive::archive_exception::array_size_too_short
-      ));
-  if (N)
-    ar >> serialization::make_array(&t[0],count);
-}
-
-
-// split non-intrusive serialization function member into separate
-// non intrusive save/load member functions
-template<class Archive, class U, std::size_t N>
-inline void serialize( Archive & ar, U (& t)[N], const unsigned int file_version)
-{
-    boost::serialization::split_free(ar, t, file_version);
-}
-*/
-
-
-} } // end namespace boost::serialization
-
-#endif //BOOST_SERIALIZATION_ARRAY_HPP

Modified: boost/trunk/boost/serialization/base_object.hpp
===================================================================
--- boost/trunk/boost/serialization/base_object.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/base_object.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -37,46 +37,115 @@
 namespace boost {
 namespace serialization {
 
-namespace detail
-{
-// only register void casts if the types are polymorphic
-  template<class Base, class Derived>
-  struct base_register
-  {
-      static void const* execute(mpl::false_) { return 0; }
+namespace detail {
+    // metrowerks CodeWarrior
+    #if BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3206)) 
+        // only register void casts if the types are polymorphic
+        template<class Base, class Derived>
+        struct base_register{
+            struct nothing {
+                static const void_cast_detail::void_caster & invoke(){
+                    return static_cast<const void_cast_detail::void_caster &>(
+                        * static_cast<const void_cast_detail::void_caster *>(NULL)
+                    );
+                }
+            };
 
-      static void const* execute(mpl::true_)
-      {
-          return &void_cast_register((Derived const*)0, (Base const*)0);
-      }
-            
-      static void const* invoke()
-      {
-          typedef mpl::bool_<
-              type_info_implementation<Base>::type::is_polymorphic::value
-          > is_polymorphic;
-          
-          return execute(is_polymorphic());
-      }
-  };
+            // hold a reference to the void_cast_register and void_caster in the hope of 
+            // ensuring code instantiation for some compilers with over-zealous link time 
+            // optimiser. The compiler that demanded this was CW
+            struct reg{
+                typedef const void_cast_detail::void_caster & (* t_vcr)(
+                    const Derived *,
+                    const Base *
+                );
+                t_vcr m_vcr;
+                static const void_cast_detail::void_caster & invoke(){
+                    return  void_cast_register<const Derived, const Base>(
+                        static_cast<const Derived *>(NULL),
+                        static_cast<const Base *>(NULL)
+                    );
+                }
+                reg() :
+                    m_vcr(static_cast<t_vcr>(void_cast_register))
+                {
+                }
+            } m_reg;
 
-  // get the base type for a given derived type
-  // preserving the const-ness
-  template<class B, class D>
-  struct base_cast
-  {
-      typedef BOOST_DEDUCED_TYPENAME
-      mpl::if_<
-          is_const<D>,
-          const B,
-          B
-      >::type type;
-      BOOST_STATIC_ASSERT(is_const<type>::value == is_const<D>::value);
-  };
+            static const void_cast_detail::void_caster & invoke(){
+                typedef BOOST_DEDUCED_TYPENAME mpl::eval_if<
+                    BOOST_DEDUCED_TYPENAME type_info_implementation<Base>::type::is_polymorphic,
+                    mpl::identity<reg>,
+                    mpl::identity<nothing>
+                >::type typex;
+                return typex::invoke();
+            }
+
+            const void_cast_detail::void_caster & m_vc;
+            Derived & m_d;
+
+            base_register(Derived & d) :
+                m_vc(invoke()),
+                m_d(d)
+            {}
+            Base & get_base() const {
+                return m_d;
+            }
+        };
+    #else
+        // only register void casts if the types are polymorphic
+        template<class Base, class Derived>
+        struct base_register{
+            struct nothing {
+                static void invoke(){}
+            };
+            struct reg{
+                static void invoke(){
+                    void_cast_register<const Derived, const Base>(
+                        static_cast<const Derived *>(NULL),
+                        static_cast<const Base *>(NULL)
+                    );
+                }
+            };
+            static void invoke(){
+                typedef BOOST_DEDUCED_TYPENAME mpl::eval_if<
+                    BOOST_DEDUCED_TYPENAME type_info_implementation<Base>::type::is_polymorphic,
+                    mpl::identity<reg>,
+                    mpl::identity<nothing>
+                >::type typex;
+                typex::invoke();
+            }
+        };
+    #endif
+    // get the base type for a given derived type
+    // preserving the const-ness
+    template<class B, class D>
+    struct base_cast
+    {
+        typedef BOOST_DEDUCED_TYPENAME
+            mpl::if_<
+                is_const<D>,
+                const B,
+                B
+        >::type type;
+        BOOST_STATIC_ASSERT(is_const<type>::value == is_const<D>::value);
+    };
 } // namespace detail
 
-#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x560))
+// metrowerks CodeWarrior
+#if BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3206)) 
 template<class Base, class Derived>
+BOOST_DEDUCED_TYPENAME detail::base_cast<Base, Derived>::type & 
+base_object(Derived &d)
+{
+    BOOST_STATIC_ASSERT(( is_base_and_derived<Base,Derived>::value));
+    BOOST_STATIC_ASSERT(! is_pointer<Derived>::value);
+    typedef BOOST_DEDUCED_TYPENAME detail::base_cast<Base, Derived>::type type;
+    return detail::base_register<type, Derived>(d).get_base();
+}
+// BORLAND
+#elif BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x560))
+template<class Base, class Derived>
 const Base & 
 base_object(const Derived & d)
 {

Modified: boost/trunk/boost/serialization/binary_object.hpp
===================================================================
--- boost/trunk/boost/serialization/binary_object.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/binary_object.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -31,7 +31,6 @@
 #include <boost/serialization/level.hpp>
 #include <boost/serialization/split_member.hpp>
 #include <boost/serialization/nvp.hpp>
-#include <boost/serialization/wrapper.hpp>
 
 namespace boost {
 namespace serialization {
@@ -69,15 +68,6 @@
     return binary_object(t, size);
 }
 
-// this is a wrapper
-
-template <>
-struct is_wrapper<binary_object>
- : public mpl::true_
-{};
-
-
-
 } // namespace serialization
 } // boost
 

Deleted: boost/trunk/boost/serialization/collection_size_type.hpp
===================================================================
--- boost/trunk/boost/serialization/collection_size_type.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/collection_size_type.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,20 +0,0 @@
-#ifndef BOOST_SERIALIZATION_COLLECTION_SIZE_TYPE_HPP
-#define BOOST_SERIALIZATION_COLLECTION_SIZE_TYPE_HPP
-
-// (C) Copyright 2005 Matthias Troyer
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#include <boost/strong_typedef.hpp>
-#include <boost/serialization/level.hpp>
-
-namespace boost { namespace serialization {
-
-BOOST_STRONG_TYPEDEF(std::size_t, collection_size_type)
-
-} } // end namespace boost::serialization
-
-BOOST_CLASS_IMPLEMENTATION(boost::serialization::collection_size_type, primitive_type)
-
-#endif //BOOST_SERIALIZATION_COLLECTION_SIZE_TYPE_HPP

Modified: boost/trunk/boost/serialization/collections_load_imp.hpp
===================================================================
--- boost/trunk/boost/serialization/collections_load_imp.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/collections_load_imp.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -31,7 +31,6 @@
 #include <boost/serialization/access.hpp>
 #include <boost/serialization/nvp.hpp>
 #include <boost/serialization/detail/stack_constructor.hpp>
-#include <boost/serialization/collection_size_type.hpp>
 
 namespace boost{
 namespace serialization {
@@ -102,7 +101,7 @@
 class reserve_imp
 {
 public:
-    void operator()(Container &s, std::size_t count) const {
+    void operator()(Container &s, unsigned int count) const {
         s.reserve(count);
     }
 };
@@ -111,7 +110,7 @@
 class no_reserve_imp
 {
 public:
-    void operator()(Container & /* s */, std::size_t /* count */) const{}
+    void operator()(Container & /* s */, unsigned int /* count */) const{}
 };
 
 template<class Archive, class Container, class InputFunction, class R>
@@ -119,17 +118,16 @@
 {
     s.clear();
     // retrieve number of elements
-    collection_size_type count;
-    unsigned int item_version;
+    unsigned int count;
+    unsigned int item_version(0);
     ar >> BOOST_SERIALIZATION_NVP(count);
     if(3 < ar.get_library_version()){
         ar >> BOOST_SERIALIZATION_NVP(item_version);
     }
     R rx;
     rx(s, count);
-    std::size_t c = count;
     InputFunction ifunc;
-    while(c-- > 0){
+    while(count-- > 0){
         ifunc(ar, s, item_version);
     }
 }

Modified: boost/trunk/boost/serialization/collections_save_imp.hpp
===================================================================
--- boost/trunk/boost/serialization/collections_save_imp.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/collections_save_imp.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,7 +22,6 @@
 #include <boost/serialization/nvp.hpp>
 #include <boost/serialization/serialization.hpp>
 #include <boost/serialization/version.hpp>
-#include <boost/serialization/collection_size_type.hpp>
 
 namespace boost{
 namespace serialization {
@@ -36,7 +35,7 @@
 inline void save_collection(Archive & ar, const Container &s)
 {
     // record number of elements
-    collection_size_type const count(s.size());
+    unsigned int count = s.size();
     ar <<  BOOST_SERIALIZATION_NVP(count);
     // make sure the target type is registered so we can retrieve
     // the version when we load
@@ -47,8 +46,7 @@
         ar << BOOST_SERIALIZATION_NVP(item_version);
     }
     BOOST_DEDUCED_TYPENAME Container::const_iterator it = s.begin();
-    std::size_t c=count;
-    while(c-- > 0){
+    while(count-- > 0){
             // note borland emits a no-op without the explicit namespace
             boost::serialization::save_construct_data_adl(
                 ar, 

Modified: boost/trunk/boost/serialization/deque.hpp
===================================================================
--- boost/trunk/boost/serialization/deque.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/deque.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,41 +24,33 @@
 #include <boost/serialization/collections_load_imp.hpp>
 #include <boost/serialization/split_free.hpp>
 
-// function specializations must be defined in the appropriate
-// namespace - boost::serialization
-#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)
-#define STD _STLP_STD
-#else
-#define STD std
-#endif
-
 namespace boost { 
 namespace serialization {
 
 template<class Archive, class U, class Allocator>
 inline void save(
     Archive & ar,
-    const STD::deque<U, Allocator> &t,
+    const std::deque<U, Allocator> &t,
     const unsigned int /* file_version */
 ){
     boost::serialization::stl::save_collection<
-        Archive, STD::deque<U, Allocator> 
+        Archive, std::deque<U, Allocator> 
     >(ar, t);
 }
 
 template<class Archive, class U, class Allocator>
 inline void load(
     Archive & ar,
-    STD::deque<U, Allocator> &t,
+    std::deque<U, Allocator> &t,
     const unsigned int file_version
 ){
     boost::serialization::stl::load_collection<
         Archive,
-        STD::deque<U, Allocator>,
+        std::deque<U, Allocator>,
         boost::serialization::stl::archive_input_seq<
-            Archive, STD::deque<U, Allocator> 
+        Archive, std::deque<U, Allocator> 
         >,
-        boost::serialization::stl::no_reserve_imp<STD::deque<U, Allocator> >
+        boost::serialization::stl::no_reserve_imp<std::deque<U, Allocator> >
     >(ar, t);
 }
 
@@ -67,7 +59,7 @@
 template<class Archive, class U, class Allocator>
 inline void serialize(
     Archive & ar,
-    STD::deque<U, Allocator> &t,
+    std::deque<U, Allocator> &t,
     const unsigned int file_version
 ){
     boost::serialization::split_free(ar, t, file_version);
@@ -78,8 +70,6 @@
 
 #include <boost/serialization/collection_traits.hpp>
 
-BOOST_SERIALIZATION_COLLECTION_TRAITS(STD::deque)
+BOOST_SERIALIZATION_COLLECTION_TRAITS(std::deque)
 
-#undef STD
-
 #endif // BOOST_SERIALIZATION_DEQUE_HPP

Deleted: boost/trunk/boost/serialization/detail/get_data.hpp
===================================================================
--- boost/trunk/boost/serialization/detail/get_data.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/detail/get_data.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,55 +0,0 @@
-// (C) Copyright 2005 Matthias Troyer 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-//  See http://www.boost.org for updates, documentation, and revision history.
-
-#ifndef BOOST_SERIALIZATION_DETAIL_GET_DATA_HPP
-#define BOOST_SERIALIZATION_DETAIL_GET_DATA_HPP
-
-// MS compatible compilers support #pragma once
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
-# pragma once
-#endif
-
-#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)
-#define STD _STLP_STD
-#else
-#define STD std
-#endif
-
-
-#include <vector>
-#include <valarray>
-
-namespace boost { namespace serialization { namespace detail {
-
-template <class T, class Allocator>
-T* get_data(STD::vector<T,Allocator>& v)
-{
-  return &(v[0]);
-}
-
-template <class T, class Allocator>
-T* get_data(STD::vector<T,Allocator> const & v)
-{
-  return get_data(const_cast<STD::vector<T,Allocator>&>(v));
-}
-
-
-template <class T>
-T* get_data(STD::valarray<T>& v)
-{
-  return &(v[0]);
-}
-
-template <class T>
-const T* get_data(STD::valarray<T> const& v)
-{
-  return get_data(const_cast<STD::valarray<T>&>(v));
-}
-
-} } } //namespace boost::serialization::detail
-
-#endif // BOOST_SERIALIZATION_DETAIL_GET_DATA_HPP

Deleted: boost/trunk/boost/serialization/ephemeral.hpp
===================================================================
--- boost/trunk/boost/serialization/ephemeral.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/ephemeral.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,79 +0,0 @@
-#ifndef BOOST_SERIALIZATION_EPHEMERAL_HPP
-#define BOOST_SERIALIZATION_EPHEMERAL_HPP
-
-// MS compatible compilers support #pragma once
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
-# pragma once
-#endif
-
-/////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
-// ephemeral_object.hpp: interface for serialization system.
-
-// (C) Copyright 2002 Robert Ramey - http://www.rrsd.com . 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-//  See http://www.boost.org for updates, documentation, and revision history.
-
-#include <utility>
-
-#include <boost/config.hpp>
-#include <boost/detail/workaround.hpp>
-// supress noise
-#if BOOST_WORKAROUND(BOOST_MSVC, <= 1200)
-# pragma warning (disable : 4786) // too long name, harmless warning
-#endif
-
-#include <boost/mpl/integral_c.hpp>
-#include <boost/mpl/integral_c_tag.hpp>
-
-#include <boost/serialization/level.hpp>
-#include <boost/serialization/tracking.hpp>
-#include <boost/serialization/split_member.hpp>
-#include <boost/serialization/base_object.hpp>
-#include <boost/serialization/traits.hpp>
-#include <boost/serialization/wrapper.hpp>
-
-namespace boost {
-namespace serialization {
-
-template<class T>
-struct ephemeral_object : 
-    public wrapper_traits<ephemeral_object<T>, object_serializable, track_never>
-{
-    explicit ephemeral_object(T& t) :
-        val(t)
-    {}
-
-    T & value() const {
-        return val;
-    }
-
-    const T & const_value() const {
-        return val;
-    }
-
-    template<class Archive>
-    void serialize(Archive &ar, const unsigned int) const
-    {
-       ar & val;
-    }
-
-private:
-    T & val;
-};
-
-template<class T>
-inline
-#ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
-const
-#endif
-ephemeral_object<T> ephemeral(const char * name, T & t){
-    return ephemeral_object<T>(name, t);
-}
-
-} // seralization
-} // boost
-
-#endif // BOOST_SERIALIZATION_EPHEMERAL_HPP

Modified: boost/trunk/boost/serialization/export.hpp
===================================================================
--- boost/trunk/boost/serialization/export.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/export.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,20 +23,29 @@
 #include <utility>
 
 #include <boost/config.hpp>
+
+// if no archive headers have been included this is a no op
+// this is to permit BOOST_EXPORT etc to be included in a
+// file declaration header
+#if ! defined(BOOST_ARCHIVE_BASIC_ARCHIVE_HPP)
+#define BOOST_CLASS_EXPORT_GUID_ARCHIVE_LIST(T, K, ASEQ)
+
+#else
 #include <boost/static_assert.hpp>
 #include <boost/preprocessor/stringize.hpp>
+#include <boost/mpl/eval_if.hpp>
+#include <boost/mpl/or.hpp>
+#include <boost/mpl/empty.hpp>
+#include <boost/mpl/front.hpp>
+#include <boost/mpl/pop_front.hpp>
+#include <boost/mpl/void.hpp>
+#include <boost/mpl/identity.hpp>
 
-#include <boost/archive/detail/dynamically_initialized.hpp>
+#include <boost/archive/detail/known_archive_types.hpp>
 #include <boost/serialization/force_include.hpp>
 #include <boost/serialization/type_info_implementation.hpp>
 #include <boost/serialization/is_abstract.hpp>
-#include <boost/archive/detail/register_archive.hpp>
-#include <boost/mpl/assert.hpp>
-#include <boost/mpl/and.hpp>
-#include <boost/mpl/not.hpp>
 
-#include <iostream>
-
 namespace boost {
 namespace archive {
 namespace detail {
@@ -52,130 +61,189 @@
 BOOST_DLLEXPORT const basic_pointer_oserializer &
 instantiate_pointer_oserializer(Archive * ar, T *) BOOST_USED;
 
-template <class Archive, class Serializable>
-struct export_impl
+namespace export_impl
 {
-    static void enable_load(mpl::true_)
-    {
-        instantiate_pointer_iserializer((Archive*)0,(Serializable*)0);
-    }
+    struct nothing{
+        static void instantiate(){}
+    };
 
-    static void enable_save(mpl::true_)
-    {
-        instantiate_pointer_oserializer((Archive*)0,(Serializable*)0);
+    template<class Archive, class T>
+    struct archive {
+        struct i {
+            static void invoke(){
+                instantiate_pointer_iserializer(
+                    static_cast<Archive *>(NULL),
+                    static_cast<T *>(NULL)
+                );
+            }
+        };
+        struct o {
+            static void invoke(){
+                instantiate_pointer_oserializer(
+                    static_cast<Archive *>(NULL),
+                    static_cast<T *>(NULL)
+                );
+            }
+        };
+        static void instantiate(){
+            #if defined(__GNUC__) && (__GNUC__ >= 3)
+            BOOST_STATIC_ASSERT(
+                Archive::is_loading::value || Archive::is_saving::value
+            );
+            #endif
+            typedef BOOST_DEDUCED_TYPENAME mpl::eval_if<
+                BOOST_DEDUCED_TYPENAME Archive::is_saving,
+                mpl::identity<o>,
+            // else
+            BOOST_DEDUCED_TYPENAME mpl::eval_if<
+                BOOST_DEDUCED_TYPENAME Archive::is_loading,
+                mpl::identity<i>,
+            // else
+                mpl::identity<nothing>
+            > >::type typex;
+            typex::invoke();
+        }
+    };
+
+    template<class ASeq, class T>
+    struct for_each_archive {
+    private:
+        typedef BOOST_DEDUCED_TYPENAME mpl::pop_front<ASeq>::type tail;
+        typedef BOOST_DEDUCED_TYPENAME mpl::front<ASeq>::type head;
+    public:
+        static void instantiate(){
+            archive<head, T>::instantiate();
+            typedef BOOST_DEDUCED_TYPENAME mpl::eval_if<
+                mpl::empty<tail>,
+                mpl::identity<nothing>,
+                mpl::identity<for_each_archive<tail, T> >
+            >::type typex;
+            typex::instantiate();
+        }
+    };
+
+} // namespace export_impl
+
+// strictly conforming
+template<class T, class ASeq>
+struct export_generator {
+    export_generator(){
+        export_impl::for_each_archive<ASeq, T>::instantiate();
     }
-
-    inline static void enable_load(mpl::false_) {}
-    inline static void enable_save(mpl::false_) {}
+    static const export_generator instance;
 };
 
+template<class T, class ASeq>
+const export_generator<T, ASeq>
+    export_generator<T, ASeq>::instance;
+
+// instantiation of this template creates a static object.
 template<class T>
-struct guid_initializer
-{
-    typedef typename
-    boost::serialization::type_info_implementation<T>::type eti_type;
-    
-    static void export_register(const char *key)
-    {
+struct guid_initializer {
+    typedef BOOST_DEDUCED_TYPENAME boost::serialization::type_info_implementation<T>::type eti_type;
+    static void export_register(const char *key){
         eti_type::export_register(key);
     }
-    
-    static const guid_initializer& get_instance(char const* key)
-    {
-        static guid_initializer const instance(key);
-        return instance;
-    }
-    
-    BOOST_DLLEXPORT guid_initializer(const char *key = 0) BOOST_USED ;
+    static const guid_initializer instance;
+    guid_initializer(const char *key = 0) BOOST_USED ;
 };
 
-
 template<class T>
-BOOST_DLLEXPORT guid_initializer<T>::guid_initializer(const char *key)
-{
+guid_initializer<T>::guid_initializer(const char *key){
     if(0 != key)
         export_register(key);
-
-    // generates the statically-initialized objects whose constructors
-    // register the information allowing serialization of T objects
-    // through pointers to their base classes.
-    instantiate_ptr_serialization((T*)0, 0);
 }
 
+template<class T>
+const guid_initializer<T> guid_initializer<T>::instance;
 
-// On many platforms, naming a specialization of this template is
-// enough to cause its argument to be instantiated.
-template <void(*)()>
-struct instantiate_function {};
+// only gcc seems to be able to explicitly instantiate a static instance.
+// but all can instantiate a function that refers to a static instance
 
-template <class Archive, class Serializable>
-struct ptr_serialization_support
-{
-# ifdef BOOST_MSVC
-    virtual void instantiate();
-    
-# elif defined(__BORLANDC__)
-    
-    static void instantiate();
-    enum { x = sizeof(instantiate(),3) };
-    
-# else
-    
-    static void instantiate();
-    typedef instantiate_function<
-        &ptr_serialization_support::instantiate
-    > x;
+// the following optimization - inhibiting explicit instantiation for abstract
+// classes breaks msvc compliles
+template<class T, class ASeq>
+struct export_instance {
+    struct abstract {
+        static const export_generator<T, ASeq> *
+        invoke(){
+            return 0;
+        }
+    };
+    struct not_abstract {
+        static const export_generator<T, ASeq> *
+        invoke(){
+            return & export_generator<T, ASeq>::instance;
+        }
+    };
+};
 
-# endif
+template<class T, class ASeq>
+BOOST_DLLEXPORT
+std::pair<const export_generator<T, ASeq> *, const guid_initializer<T> *>
+export_instance_invoke() {
+    typedef BOOST_DEDUCED_TYPENAME mpl::eval_if<
+        serialization::is_abstract<T>,
+        mpl::identity<BOOST_DEDUCED_TYPENAME export_instance<T, ASeq>::abstract>,
+        mpl::identity<BOOST_DEDUCED_TYPENAME export_instance<T, ASeq>::not_abstract>
+    >::type typex;
+    return std::pair<const export_generator<T, ASeq> *, const guid_initializer<T> *>(
+        typex::invoke(),
+        & guid_initializer<T>::instance
+    );
+}
+
+template<class T, class ASeq>
+struct export_archives {
+    struct empty_archive_list {
+        static BOOST_DLLEXPORT
+        std::pair<const export_generator<T, ASeq> *, const guid_initializer<T> *>
+        invoke(){
+            return std::pair<const export_generator<T, ASeq> *,
+                             const guid_initializer<T> *>(0, 0);
+        }
+    };
+    struct non_empty_archive_list {
+        static BOOST_DLLEXPORT
+        std::pair<const export_generator<T, ASeq> *, const guid_initializer<T> *>
+        invoke(){
+            return export_instance_invoke<T, ASeq>();
+        }
+    };
 };
 
-template <class Archive, class Serializable>
-void ptr_serialization_support<Archive,Serializable>::instantiate()
-{
-    typedef mpl::not_<serialization::is_abstract<Serializable> > concrete;
-    
-    export_impl<Archive,Serializable>::enable_save(
-        mpl::and_<concrete, BOOST_DEDUCED_TYPENAME Archive::is_saving>());
-
-    export_impl<Archive,Serializable>::enable_load(
-        mpl::and_<concrete, BOOST_DEDUCED_TYPENAME Archive::is_loading>());
+template<class T, class ASeq>
+BOOST_DLLEXPORT
+std::pair<const export_generator<T, ASeq> *, const guid_initializer<T> *>
+export_archives_invoke(T &, ASeq &){
+    typedef BOOST_DEDUCED_TYPENAME mpl::eval_if<
+        mpl::empty<ASeq>,
+        mpl::identity<BOOST_DEDUCED_TYPENAME export_archives<T, ASeq>::empty_archive_list>,
+        mpl::identity<BOOST_DEDUCED_TYPENAME export_archives<T, ASeq>::non_empty_archive_list>
+    >::type typex;
+    return typex::invoke();
 }
 
 } // namespace detail
 } // namespace archive
 } // namespace boost
 
-#define BOOST_CLASS_EXPORT_GUID(T, K)                                               \
-namespace                                                                           \
-{                                                                                   \
-    ::boost::archive::detail::guid_initializer<T> const&                            \
-          BOOST_PP_CAT(boost_serialization_guid_initializer_, __LINE__)             \
-          = ::boost::archive::detail::guid_initializer<T>::get_instance(K);         \
-}
+#define BOOST_CLASS_EXPORT_GUID_ARCHIVE_LIST(T, K, ASEQ)         \
+    namespace boost {                                            \
+    namespace archive {                                          \
+    namespace detail {                                           \
+    template<>                                                   \
+    const guid_initializer< T >                                  \
+        guid_initializer< T >::instance(K);                      \
+    template                                                     \
+    BOOST_DLLEXPORT                                              \
+    std::pair<const export_generator<T, ASEQ> *, const guid_initializer< T > *> \
+    export_archives_invoke<T, ASEQ>(T &, ASEQ &);                \
+    } } }                                                        \
+    /**/
 
-#if BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3205))
+#endif
 
-// CodeWarrior fails to construct static members of class templates
-// when they are instantiated from within templates, so on that
-// compiler we ask users to specifically register base/derived class
-// relationships for exported classes.  On all other compilers, use of
-// this macro is entirely optional.
-# define BOOST_SERIALIZATION_MWERKS_BASE_AND_DERIVED(Base,Derived)                  \
-namespace                                                                           \
-{                                                                                   \
-  int BOOST_PP_CAT(boost_serialization_mwerks_init_, __LINE__) =                    \
-      (::boost::archive::detail::instantiate_ptr_serialization((Derived*)0,0), 3);  \
-  int BOOST_PP_CAT(boost_serialization_mwerks_init2_, __LINE__) = (                 \
-      ::boost::serialization::void_cast_register((Derived*)0,(Base*)0)              \
-    , 3);                                                                           \
-}
-
-#else
-
-# define BOOST_SERIALIZATION_MWERKS_BASE_AND_DERIVED(Base,Derived)
-
-#endif 
-
 // check for unnecessary export.  T isn't polymorphic so there is no
 // need to export it.
 #define BOOST_CLASS_EXPORT_CHECK(T)                              \
@@ -185,15 +253,28 @@
     );                                                           \
     /**/
 
+// the default list of archives types for which code id generated
+#define BOOST_CLASS_EXPORT_GUID(T, K)                            \
+    BOOST_CLASS_EXPORT_GUID_ARCHIVE_LIST(                        \
+        T,                                                       \
+        K,                                                       \
+        boost::archive::detail::known_archive_types::type        \
+    )                                                            \
+    /**/
+
 // the default exportable class identifier is the class name
+#define BOOST_CLASS_EXPORT_ARCHIVE_LIST(T, ASEQ)                 \
+    BOOST_CLASS_EXPORT_GUID_ARCHIVE_LIST(T, BOOST_PP_STRINGIZE(T), A)
+
+// the default exportable class identifier is the class name
 // the default list of archives types for which code id generated
 // are the originally included with this serialization system
-#define BOOST_CLASS_EXPORT(T)                   \
-    BOOST_CLASS_EXPORT_GUID(                    \
-        T,                                      \
-        BOOST_PP_STRINGIZE(T)                   \
-    )                                           \
+#define BOOST_CLASS_EXPORT(T)                                    \
+    BOOST_CLASS_EXPORT_GUID_ARCHIVE_LIST(                        \
+        T,                                                       \
+        BOOST_PP_STRINGIZE(T),                                   \
+        boost::archive::detail::known_archive_types::type        \
+    )                                                            \
     /**/
 
 #endif // BOOST_SERIALIZATION_EXPORT_HPP
-

Modified: boost/trunk/boost/serialization/hash_collections_load_imp.hpp
===================================================================
--- boost/trunk/boost/serialization/hash_collections_load_imp.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/hash_collections_load_imp.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -35,7 +35,7 @@
     s.clear();
     // retrieve number of elements
     unsigned int count;
-    unsigned int item_version;
+    unsigned int item_version(0);
     unsigned int bucket_count;;
     ar >> BOOST_SERIALIZATION_NVP(count);
     if(3 < ar.get_library_version()){

Modified: boost/trunk/boost/serialization/hash_map.hpp
===================================================================
--- boost/trunk/boost/serialization/hash_map.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/hash_map.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -26,15 +26,6 @@
 #include <boost/serialization/hash_collections_load_imp.hpp>
 #include <boost/serialization/split_free.hpp>
 
-// function specializations must be defined in the appropriate
-// namespace - boost::serialization
-/*
-#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)
-#define STD _STLP_STD
-#else
-#define STD BOOST_STD_EXTENSION_NAMESPACE
-#endif
-*/
 namespace boost { 
 namespace serialization {
 
@@ -180,7 +171,5 @@
 } // namespace serialization
 } // namespace boost
 
-//#undef STD
-
 #endif // BOOST_HAS_HASH
 #endif // BOOST_SERIALIZATION_HASH_MAP_HPP

Modified: boost/trunk/boost/serialization/hash_set.hpp
===================================================================
--- boost/trunk/boost/serialization/hash_set.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/hash_set.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,16 +24,6 @@
 #include <boost/serialization/hash_collections_load_imp.hpp>
 #include <boost/serialization/split_free.hpp>
 
-// function specializations must be defined in the appropriate
-// namespace - boost::serialization
-/*
-#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)
-#define std _STLP_std
-#else
-#define std BOOST_std_EXTENSION_NAMESPACE
-#endif
-*/
-
 namespace boost { 
 namespace serialization {
 
@@ -184,7 +174,5 @@
 BOOST_SERIALIZATION_COLLECTION_TRAITS(BOOST_STD_EXTENSION_NAMESPACE::hash_set)
 BOOST_SERIALIZATION_COLLECTION_TRAITS(BOOST_STD_EXTENSION_NAMESPACE::hash_multiset)
 
-//#undef STD
-
 #endif // BOOST_HAS_HASH
 #endif // BOOST_SERIALIZATION_HASH_SET_HPP

Modified: boost/trunk/boost/serialization/is_abstract.hpp
===================================================================
--- boost/trunk/boost/serialization/is_abstract.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/is_abstract.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,13 +23,16 @@
 namespace boost {
 namespace serialization {
     template<class T>
-    struct is_abstract
-#ifdef BOOST_NO_IS_ABSTRACT
-      : mpl::false_
-#else
-      : boost::is_abstract<T>
-#endif 
-    {};
+    struct is_abstract {
+        // default to false if not supported
+        #ifdef BOOST_NO_IS_ABSTRACT
+            typedef BOOST_DEDUCED_TYPENAME mpl::bool_<false> type;
+            BOOST_STATIC_CONSTANT(bool, value = false); 
+        #else
+            typedef BOOST_DEDUCED_TYPENAME boost::is_abstract<T>::type type;
+            BOOST_STATIC_CONSTANT(bool, value = type::value); 
+        #endif
+    };
 } // namespace serialization
 } // namespace boost
 
@@ -38,8 +41,12 @@
 namespace boost {                                     \
 namespace serialization {                             \
 template<>                                            \
-struct is_abstract< T > : mpl::true_ {};              \
-}}                                                    \
+struct is_abstract< T > {                             \
+    typedef mpl::bool_<true> type;                    \
+    BOOST_STATIC_CONSTANT(bool, value = true);        \
+};                                                    \
+}                                                     \
+}                                                     \
 /**/
 
 #endif //BOOST_SERIALIZATION_IS_ABSTRACT_CLASS_HPP

Modified: boost/trunk/boost/serialization/level.hpp
===================================================================
--- boost/trunk/boost/serialization/level.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/level.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -29,9 +29,9 @@
 #include <boost/mpl/int.hpp>
 #include <boost/mpl/integral_c.hpp>
 #include <boost/mpl/integral_c_tag.hpp>
+#include <boost/mpl/aux_/nttp_decl.hpp>
 
 #include <boost/serialization/level_enum.hpp>
-//#include <boost/serialization/traits.hpp>
 
 namespace boost {
 namespace serialization {
@@ -47,9 +47,11 @@
     };
 
     typedef mpl::integral_c_tag tag;
+    // note: at least one compiler complained w/o the full qualification
+    // on basic traits below
     typedef
         BOOST_DEDUCED_TYPENAME mpl::eval_if<
-            is_base_and_derived<basic_traits, T>,
+            is_base_and_derived<boost::serialization::basic_traits, T>,
             traits_class_level<T>,
         //else
         BOOST_DEDUCED_TYPENAME mpl::eval_if<
@@ -87,7 +89,7 @@
 };
 
 
-template<class T, enum level_type L>
+template<class T, BOOST_MPL_AUX_NTTP_DECL(int, L) >
 inline bool operator>=(implementation_level<T> t, enum level_type l)
 {
     return t.value >= (int)l;

Modified: boost/trunk/boost/serialization/list.hpp
===================================================================
--- boost/trunk/boost/serialization/list.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/list.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,21 +24,13 @@
 #include <boost/serialization/collections_load_imp.hpp>
 #include <boost/serialization/split_free.hpp>
 
-// function specializations must be defined in the appropriate
-// namespace - boost::serialization
-#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)
-#define STD _STLP_STD
-#else
-#define STD std
-#endif
-
 namespace boost { 
 namespace serialization {
 
 template<class Archive, class U, class Allocator>
 inline void save(
     Archive & ar,
-    const STD::list<U, Allocator> &t,
+    const std::list<U, Allocator> &t,
     const unsigned int /* file_version */
 ){
     boost::serialization::stl::save_collection<
@@ -50,7 +42,7 @@
 template<class Archive, class U, class Allocator>
 inline void load(
     Archive & ar,
-    STD::list<U, Allocator> &t,
+    std::list<U, Allocator> &t,
     const unsigned int /* file_version */
 ){
     boost::serialization::stl::load_collection<
@@ -60,7 +52,7 @@
             Archive, 
             std::list<U, Allocator> 
         >,
-        boost::serialization::stl::no_reserve_imp<STD::list<U, Allocator> >
+        boost::serialization::stl::no_reserve_imp<std::list<U, Allocator> >
     >(ar, t);
 }
 
@@ -69,7 +61,7 @@
 template<class Archive, class U, class Allocator>
 inline void serialize(
     Archive & ar,
-    STD::list<U, Allocator> & t,
+    std::list<U, Allocator> & t,
     const unsigned int file_version
 ){
     boost::serialization::split_free(ar, t, file_version);
@@ -80,7 +72,6 @@
 
 #include <boost/serialization/collection_traits.hpp>
 
-BOOST_SERIALIZATION_COLLECTION_TRAITS(STD::list)
-#undef STD
+BOOST_SERIALIZATION_COLLECTION_TRAITS(std::list)
 
 #endif // BOOST_SERIALIZATION_LIST_HPP

Modified: boost/trunk/boost/serialization/map.hpp
===================================================================
--- boost/trunk/boost/serialization/map.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/map.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -26,15 +26,6 @@
 #include <boost/serialization/collections_load_imp.hpp>
 #include <boost/serialization/split_free.hpp>
 
-// function specializations must be defined in the appropriate
-// namespace - boost::serialization
-/*
-#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)
-#define STD _STLP_STD
-#else
-#define STD std
-#endif
-*/
 namespace boost { 
 namespace serialization {
 
@@ -124,6 +115,4 @@
 } // serialization
 } // namespace boost
 
-//#undef STD
-
 #endif // BOOST_SERIALIZATION_MAP_HPP

Modified: boost/trunk/boost/serialization/nvp.hpp
===================================================================
--- boost/trunk/boost/serialization/nvp.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/nvp.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -33,7 +33,6 @@
 #include <boost/serialization/split_member.hpp>
 #include <boost/serialization/base_object.hpp>
 #include <boost/serialization/traits.hpp>
-#include <boost/serialization/wrapper.hpp>
 
 namespace boost {
 namespace serialization {
@@ -41,7 +40,7 @@
 template<class T>
 struct nvp : 
     public std::pair<const char *, T *>,
-    public wrapper_traits<nvp<T>, object_serializable, track_never>
+    public traits<nvp<T>, object_serializable, track_never>
 {
     explicit nvp(const char * name, T & t) :
         // note: redundant cast works around borland issue

Modified: boost/trunk/boost/serialization/set.hpp
===================================================================
--- boost/trunk/boost/serialization/set.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/set.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,14 +24,6 @@
 #include <boost/serialization/collections_load_imp.hpp>
 #include <boost/serialization/split_free.hpp>
 
-/*
-#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)
-#define STD _STLP_STD
-#else
-#define STD std
-#endif
-*/
-
 namespace boost { 
 namespace serialization {
 
@@ -124,6 +116,5 @@
 
 BOOST_SERIALIZATION_COLLECTION_TRAITS(std::set)
 BOOST_SERIALIZATION_COLLECTION_TRAITS(std::multiset)
-//#undef STD
 
 #endif // BOOST_SERIALIZATION_SET_HPP

Modified: boost/trunk/boost/serialization/slist.hpp
===================================================================
--- boost/trunk/boost/serialization/slist.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/slist.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -25,39 +25,33 @@
 #include <boost/serialization/split_free.hpp>
 #include <boost/serialization/nvp.hpp>
 
-#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)
-#define STD _STLP_STD
-#else
-#define STD BOOST_STD_EXTENSION_NAMESPACE
-#endif
-
 namespace boost { 
 namespace serialization {
 
 template<class Archive, class U, class Allocator>
 inline void save(
     Archive & ar,
-    const STD::slist<U, Allocator> &t,
+    const BOOST_STD_EXTENSION_NAMESPACE::slist<U, Allocator> &t,
     const unsigned int file_version
 ){
     boost::serialization::stl::save_collection<
         Archive,
-        STD::slist<U, Allocator> 
+        BOOST_STD_EXTENSION_NAMESPACE::slist<U, Allocator> 
     >(ar, t);
 }
 
 template<class Archive, class U, class Allocator>
 inline void load(
     Archive & ar,
-    STD::slist<U, Allocator> &t,
+    BOOST_STD_EXTENSION_NAMESPACE::slist<U, Allocator> &t,
     const unsigned int file_version
 ){
     // retrieve number of elements
     t.clear();
     // retrieve number of elements
-    collection_size_type count;
+    unsigned int count;
     ar >> BOOST_SERIALIZATION_NVP(count);
-    if(std::size_t(0) == count)
+    if(0 == count)
         return;
     unsigned int v;
     if(3 < ar.get_library_version()){
@@ -68,8 +62,7 @@
     t.push_front(u.reference());
     BOOST_DEDUCED_TYPENAME BOOST_STD_EXTENSION_NAMESPACE::slist<U, Allocator>::iterator last;
     last = t.begin();
-    std::size_t c = count;
-    while(--c > 0){
+    while(--count > 0){
         boost::serialization::detail::stack_construct<Archive, U> 
             u(ar, file_version);
         ar >> boost::serialization::make_nvp("item", u.reference());
@@ -83,7 +76,7 @@
 template<class Archive, class U, class Allocator>
 inline void serialize(
     Archive & ar,
-    STD::slist<U, Allocator> &t,
+    BOOST_STD_EXTENSION_NAMESPACE::slist<U, Allocator> &t,
     const unsigned int file_version
 ){
     boost::serialization::split_free(ar, t, file_version);
@@ -94,8 +87,7 @@
 
 #include <boost/serialization/collection_traits.hpp>
 
-BOOST_SERIALIZATION_COLLECTION_TRAITS(STD::slist)
-#undef STD
+BOOST_SERIALIZATION_COLLECTION_TRAITS(BOOST_STD_EXTENSION_NAMESPACE::slist)
 
 #endif  // BOOST_HAS_SLIST
 #endif  // BOOST_SERIALIZATION_SLIST_HPP

Modified: boost/trunk/boost/serialization/string.hpp
===================================================================
--- boost/trunk/boost/serialization/string.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/string.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -34,14 +34,6 @@
 #include <boost/serialization/collections_load_imp.hpp>
 #include <boost/serialization/split_free.hpp>
 
-// function specializations must be defined in the appropriate
-// namespace - boost::serialization
-#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)
-#define STD _STLP_STD
-#else
-#define STD std
-#endif
-
 namespace boost { 
 namespace serialization {
 
@@ -49,29 +41,29 @@
 template<class Archive, class U, class Allocator>
 inline void save(
     Archive & ar,
-    const STD::basic_string<U, Allocator> &t,
+    const std::basic_string<U, Allocator> &t,
     const unsigned int file_version
 ){
     boost::serialization::stl::save_collection<
-        Archive, STD::basic_string<U, Allocator> 
+        Archive, std::basic_string<U, Allocator> 
     >(ar, t);
 }
 
 template<class Archive, class U, class Allocator>
 inline void load(
     Archive & ar,
-    STD::basic_string<U, Allocator> &t,
+    std::basic_string<U, Allocator> &t,
     const unsigned int file_version
 ){
     boost::serialization::stl::load_collection<
         Archive,
-        STD::basic_string<U, Allocator>,
+        std::basic_string<U, Allocator>,
         boost::serialization::stl::archive_input_seq<
             Archive, 
-            STD::basic_string<U, Allocator> 
+            std::basic_string<U, Allocator> 
         >,
         boost::serialization::stl::reserve_imp<
-            STD::basic_string<U, Allocator> 
+            std::basic_string<U, Allocator> 
         >
     >(ar, t);
 }
@@ -81,7 +73,7 @@
 template<class Archive, class U, class Allocator>
 inline void serialize(
     Archive & ar,
-    STD::basic_string<U, Allocator> & t,
+    std::basic_string<U, Allocator> & t,
     const unsigned int file_version
 ){
     boost::serialization::split_free(ar, t, file_version);
@@ -92,8 +84,7 @@
 
 #include <boost/serialization/collection_traits.hpp>
 
-BOOST_SERIALIZATION_COLLECTION_TRAITS(STD::vector)
-#undef STD
+BOOST_SERIALIZATION_COLLECTION_TRAITS(std::vector)
 
 #endif
 

Modified: boost/trunk/boost/serialization/tracking.hpp
===================================================================
--- boost/trunk/boost/serialization/tracking.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/tracking.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -27,13 +27,15 @@
 
 #include <boost/type_traits/is_base_and_derived.hpp>
 #include <boost/type_traits/is_pointer.hpp>
-//#include <boost/serialization/traits.hpp>
 #include <boost/serialization/level.hpp>
 #include <boost/serialization/tracking_enum.hpp>
+//#include <boost/serialization/traits.hpp>
 
 namespace boost {
 namespace serialization {
 
+struct basic_traits;
+
 // default tracking level
 template<class T>
 struct tracking_level {
@@ -42,9 +44,11 @@
         typedef BOOST_DEDUCED_TYPENAME U::tracking type;
     };
     typedef mpl::integral_c_tag tag;
+    // note: at least one compiler complained w/o the full qualification
+    // on basic traits below
     typedef
         BOOST_DEDUCED_TYPENAME mpl::eval_if<
-            is_base_and_derived<basic_traits, T>,
+            is_base_and_derived<boost::serialization::basic_traits, T>,
             traits_class_tracking<T>,
         //else
         BOOST_DEDUCED_TYPENAME mpl::eval_if<

Modified: boost/trunk/boost/serialization/traits.hpp
===================================================================
--- boost/trunk/boost/serialization/traits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/traits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -28,7 +28,6 @@
 #include <boost/static_assert.hpp>
 
 #include <boost/mpl/int.hpp>
-#include <boost/mpl/bool.hpp>
 #include <boost/serialization/level_enum.hpp>
 #include <boost/serialization/tracking_enum.hpp>
 
@@ -46,8 +45,7 @@
     int Level, 
     int Tracking,
     unsigned int Version = 0,
-    class ETII = extended_type_info_impl< T >,
-    class Wrapper = mpl::false_
+    class ETII = extended_type_info_impl< T >
 >
 struct traits : public basic_traits {
     BOOST_STATIC_ASSERT(Version == 0 || Level >= object_class_info);
@@ -56,7 +54,6 @@
     typedef BOOST_DEDUCED_TYPENAME mpl::int_<Tracking> tracking;
     typedef BOOST_DEDUCED_TYPENAME mpl::int_<Version> version;
     typedef ETII type_info_implementation;
-    typedef Wrapper is_wrapper;
 };
 
 } // namespace serialization

Modified: boost/trunk/boost/serialization/type_info_implementation.hpp
===================================================================
--- boost/trunk/boost/serialization/type_info_implementation.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/type_info_implementation.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -29,8 +29,6 @@
 namespace boost {
 namespace serialization {
 
-struct basic_traits;
-
 // note that T and const T are folded into const T so that
 // there is only one table entry per type
 template<class T>
@@ -39,9 +37,11 @@
     struct traits_class_typeinfo_implementation {
       typedef BOOST_DEDUCED_TYPENAME U::type_info_implementation::type type;
     };
+    // note: at least one compiler complained w/o the full qualification
+    // on basic traits below
     typedef 
         BOOST_DEDUCED_TYPENAME mpl::eval_if<
-            is_base_and_derived<basic_traits, T>,
+            is_base_and_derived<boost::serialization::basic_traits, T>,
             traits_class_typeinfo_implementation<T>,
         //else
             mpl::identity<

Modified: boost/trunk/boost/serialization/utility.hpp
===================================================================
--- boost/trunk/boost/serialization/utility.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/utility.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,14 +23,6 @@
 #include <boost/type_traits/remove_const.hpp>
 #include <boost/serialization/nvp.hpp>
 
-// function specializations must be defined in the appropriate
-// namespace - boost::serialization
-#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)
-#define STD _STLP_STD
-#else
-#define STD std
-#endif
-
 namespace boost { 
 namespace serialization {
 
@@ -38,7 +30,7 @@
 template<class Archive, class F, class S>
 inline void serialize(
     Archive & ar,
-    STD::pair<F, S> & p,
+    std::pair<F, S> & p,
     const unsigned int /* file_version */
 ){
     // note: we remove any const-ness on the first argument.  The reason is that 
@@ -51,6 +43,5 @@
 
 } // serialization
 } // namespace boost
-#undef STD
 
 #endif // BOOST_SERIALIZATION_UTILITY_HPP

Deleted: boost/trunk/boost/serialization/valarray.hpp
===================================================================
--- boost/trunk/boost/serialization/valarray.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/valarray.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,74 +0,0 @@
-#ifndef BOOST_SERIALIZATION_VALARAY_HPP
-#define BOOST_SERIALIZATION_VALARAY_HPP
-
-// MS compatible compilers support #pragma once
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
-# pragma once
-#endif
-
-/////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
-// vector.hpp: serialization for stl vector templates
-
-// (C) Copyright 2005 Matthias Troyer . 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-//  See http://www.boost.org for updates, documentation, and revision history.
-
-#include <valarray>
-#include <boost/config.hpp>
-#include <boost/serialization/split_free.hpp>
-#include <boost/serialization/array.hpp>
-#include <boost/serialization/collection_size_type.hpp>
-#include <boost/serialization/detail/get_data.hpp>
-
-// function specializations must be defined in the appropriate
-// namespace - boost::serialization
-#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)
-#define STD _STLP_STD
-#else
-#define STD std
-#endif
-
-namespace boost { namespace serialization {
-
-/////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
-// valarray<T>
-
-template<class Archive, class U>
-void save( Archive & ar, const STD::valarray<U> &t, const unsigned int file_version )
-{
-  const collection_size_type count(t.size());
-  ar << BOOST_SERIALIZATION_NVP(count);
-  if (count)
-    ar << make_array(detail::get_data(t), t.size());
-}
-
-
-template<class Archive, class U>
-void load( Archive & ar, STD::valarray<U> &t,  const unsigned int file_version )
-{
-  collection_size_type count;
-  ar >> BOOST_SERIALIZATION_NVP(count);
-  t.resize(count);
-  if (count)
-    ar >> make_array(detail::get_data(t), t.size());
-}
-
-// split non-intrusive serialization function member into separate
-// non intrusive save/load member functions
-template<class Archive, class U>
-inline void serialize( Archive & ar, STD::valarray<U> & t, const unsigned int file_version)
-{
-    boost::serialization::split_free(ar, t, file_version);
-}
-
-} } // end namespace boost::serialization
-
-#include <boost/serialization/collection_traits.hpp>
-
-BOOST_SERIALIZATION_COLLECTION_TRAITS(STD::valarray)
-#undef STD
-
-#endif // BOOST_SERIALIZATION_VALARAY_HPP

Modified: boost/trunk/boost/serialization/vector.hpp
===================================================================
--- boost/trunk/boost/serialization/vector.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/vector.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,7 +10,6 @@
 // vector.hpp: serialization for stl vector templates
 
 // (C) Copyright 2002 Robert Ramey - http://www.rrsd.com . 
-// fast array serialization (C) Copyright 2005 Matthias Troyer 
 // Use, modification and distribution is subject to the Boost Software
 // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
@@ -25,35 +24,19 @@
 #include <boost/serialization/collections_save_imp.hpp>
 #include <boost/serialization/collections_load_imp.hpp>
 #include <boost/serialization/split_free.hpp>
-#include <boost/serialization/array.hpp>
-#include <boost/serialization/detail/get_data.hpp>
-#include <boost/detail/has_default_constructor.hpp>
-#include <boost/mpl/bool.hpp>
 
-// function specializations must be defined in the appropriate
-// namespace - boost::serialization
-#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)
-#define STD _STLP_STD
-#else
-#define STD std
-#endif
-
 namespace boost { 
 namespace serialization {
 
 /////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
 // vector<T>
-
-// the default versions
-
 template<class Archive, class U, class Allocator>
 inline void save(
     Archive & ar,
-    const STD::vector<U, Allocator> &t,
-    const unsigned int /* file_version */,
-    mpl::false_
+    const std::vector<U, Allocator> &t,
+    const unsigned int /* file_version */
 ){
-    boost::serialization::stl::save_collection<Archive, STD::vector<U, Allocator> >(
+    boost::serialization::stl::save_collection<Archive, std::vector<U, Allocator> >(
         ar, t
     );
 }
@@ -61,75 +44,25 @@
 template<class Archive, class U, class Allocator>
 inline void load(
     Archive & ar,
-    STD::vector<U, Allocator> &t,
-    const unsigned int /* file_version */,
-    mpl::false_
+    std::vector<U, Allocator> &t,
+    const unsigned int /* file_version */
 ){
     boost::serialization::stl::load_collection<
         Archive,
-        STD::vector<U, Allocator>,
+        std::vector<U, Allocator>,
         boost::serialization::stl::archive_input_seq<
-            Archive, STD::vector<U, Allocator> 
+            Archive, std::vector<U, Allocator> 
         >,
-        boost::serialization::stl::reserve_imp<STD::vector<U, Allocator> >
+        boost::serialization::stl::reserve_imp<std::vector<U, Allocator> >
     >(ar, t);
 }
 
-// the optimized versions
-
-template<class Archive, class U, class Allocator>
-inline void save(
-    Archive & ar,
-    const STD::vector<U, Allocator> &t,
-    const unsigned int /* file_version */,
-    mpl::true_
-){
-    const collection_size_type count(t.size());
-    ar << BOOST_SERIALIZATION_NVP(count);
-    if (!t.empty())
-      ar << make_array(detail::get_data(t),t.size());
-}
-
-template<class Archive, class U, class Allocator>
-inline void load(
-    Archive & ar,
-    STD::vector<U, Allocator> &t,
-    const unsigned int /* file_version */,
-    mpl::true_
-){
-    collection_size_type count(t.size());
-    ar >> BOOST_SERIALIZATION_NVP(count);
-    t.resize(count);
-    if (!t.empty())
-      ar >> make_array(detail::get_data(t),t.size());
-  }
-
-// dispatch to either default or optimized versions
-
-template<class Archive, class U, class Allocator>
-inline void save(
-    Archive & ar,
-    const STD::vector<U, Allocator> &t,
-    const unsigned int file_version
-){
-    save(ar,t,file_version, boost::detail::has_default_constructor<U>());
-}
-
-template<class Archive, class U, class Allocator>
-inline void load(
-    Archive & ar,
-    STD::vector<U, Allocator> &t,
-    const unsigned int file_version
-){
-    load(ar,t,file_version, boost::detail::has_default_constructor<U>());
-}
-
 // split non-intrusive serialization function member into separate
 // non intrusive save/load member functions
 template<class Archive, class U, class Allocator>
 inline void serialize(
     Archive & ar,
-    STD::vector<U, Allocator> & t,
+    std::vector<U, Allocator> & t,
     const unsigned int file_version
 ){
     boost::serialization::split_free(ar, t, file_version);
@@ -142,13 +75,13 @@
 template<class Archive, class Allocator>
 inline void save(
     Archive & ar,
-    const STD::vector<bool, Allocator> &t,
+    const std::vector<bool, Allocator> &t,
     const unsigned int /* file_version */
 ){
     // record number of elements
-    collection_size_type count = t.size();
+    unsigned int count = t.size();
     ar << BOOST_SERIALIZATION_NVP(count);
-    STD::vector<bool>::const_iterator it = t.begin();
+    std::vector<bool>::const_iterator it = t.begin();
     while(count-- > 0){
         bool tb = *it++;
         ar << boost::serialization::make_nvp("item", tb);
@@ -158,11 +91,11 @@
 template<class Archive, class Allocator>
 inline void load(
     Archive & ar,
-    STD::vector<bool, Allocator> &t,
+    std::vector<bool, Allocator> &t,
     const unsigned int /* file_version */
 ){
     // retrieve number of elements
-    collection_size_type count;
+    unsigned int count;
     ar >> BOOST_SERIALIZATION_NVP(count);
     t.clear();
     while(count-- > 0){
@@ -177,7 +110,7 @@
 template<class Archive, class Allocator>
 inline void serialize(
     Archive & ar,
-    STD::vector<bool, Allocator> & t,
+    std::vector<bool, Allocator> & t,
     const unsigned int file_version
 ){
     boost::serialization::split_free(ar, t, file_version);
@@ -190,7 +123,6 @@
 
 #include <boost/serialization/collection_traits.hpp>
 
-BOOST_SERIALIZATION_COLLECTION_TRAITS(STD::vector)
-#undef STD
+BOOST_SERIALIZATION_COLLECTION_TRAITS(std::vector)
 
 #endif // BOOST_SERIALIZATION_VECTOR_HPP

Modified: boost/trunk/boost/serialization/version.hpp
===================================================================
--- boost/trunk/boost/serialization/version.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/version.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,12 +22,14 @@
 #include <boost/mpl/identity.hpp>
 #include <boost/mpl/integral_c_tag.hpp>
 
+#include <boost/type_traits/is_base_and_derived.hpp>
 //#include <boost/serialization/traits.hpp>
-#include <boost/type_traits/is_base_and_derived.hpp>
 
 namespace boost { 
 namespace serialization {
 
+struct basic_traits;
+
 // default version number is 0. Override with higher version
 // when class definition changes.
 template<class T>
@@ -39,9 +41,11 @@
     };
 
     typedef mpl::integral_c_tag tag;
+    // note: at least one compiler complained w/o the full qualification
+    // on basic traits below
     typedef
         BOOST_DEDUCED_TYPENAME mpl::eval_if<
-            is_base_and_derived<basic_traits,T>,
+            is_base_and_derived<boost::serialization::basic_traits,T>,
             traits_class_version<T>,
             mpl::int_<0>
         >::type type;

Modified: boost/trunk/boost/serialization/void_cast.hpp
===================================================================
--- boost/trunk/boost/serialization/void_cast.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/void_cast.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -146,54 +146,27 @@
         return b;
     }
 
-    BOOST_DLLEXPORT void_caster_primitive() BOOST_USED;
-    
-    static BOOST_DLLEXPORT void_caster_primitive const& instance;
-
-    // Something we can use to force instantiation without generating
-    // warnings.
-    static void use(void_caster_primitive const&) {}
-    
- public:
-    // CodeWarrior fails to construct static members of class
-    // templates when they are instantiated from within templates, so
-    // we do everything with void_caster_primitive in terms of
-    // get_instance.  On CodeWarrior, the user must invoke
-    // BOOST_SERIALIZATION_MWERKS_BASE_AND_DERIVED to make this work
-    // (see boost/serialization/export.hpp).  On other compilers (and
-    // if the bug is fixed in a future version of CodeWarriror), the
-    // initialization of instance (above) obviates the need for
-    // BOOST_SERIALIZATION_MWERKS_BASE_AND_DERIVED.
-    static BOOST_DLLEXPORT void_caster_primitive const& get_instance()
-    {
-        static void_caster_primitive instance_;
-        
-        // refer to instance, causing it to be instantiated (and
-        // initialized at startup on working compilers)
-        use(instance);
-
-        return instance_;
-    }
+public:
+    static const void_caster_primitive instance;
+    void_caster_primitive() BOOST_USED;
 };
 
 template <class Derived, class Base>
-BOOST_DLLEXPORT void_caster_primitive<Derived, Base>::void_caster_primitive() :
+void_caster_primitive<Derived, Base>::void_caster_primitive() :
     void_caster( 
         * type_info_implementation<Derived>::type::get_instance(), 
         * type_info_implementation<Base>::type::get_instance() 
     )
 {
-    // calling get_instance() causes infinite recursion, and the
-    // instance reference isn't initialized yet, so we must pass this
-    // to static_register.  It *is* the same object as instance, but
-    // there's no way even to assert that here.
-    this->static_register(this);
+    this->static_register(& instance);
 }
 
-template <class Derived, class Base>
-BOOST_DLLEXPORT void_caster_primitive<Derived,Base> const&
-void_caster_primitive<Derived,Base>::instance
-= void_caster_primitive<Derived,Base>::get_instance();
+// the purpose of this class is to create to->from and from->to instances
+// of void_caster_primitive for each related pair of types.  This has to be
+// done a pre-execution time - hence the usage of static variable.
+template<class Derived, class Base>
+const void_caster_primitive<Derived, Base>
+    void_caster_primitive<Derived, Base>::instance;
 
 } // void_cast_detail 
 
@@ -214,8 +187,9 @@
     const Base * /* bnull = NULL */
 ){
     return void_cast_detail::void_caster_primitive<
-        const Derived, const Base
-    >::get_instance();
+        const Derived, 
+        const Base
+    >::instance;
 }
 
 } // namespace serialization

Modified: boost/trunk/boost/serialization/void_cast_fwd.hpp
===================================================================
--- boost/trunk/boost/serialization/void_cast_fwd.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/void_cast_fwd.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,14 +17,23 @@
 
 //  See http://www.boost.org for updates, documentation, and revision history.
 
+#include <boost/serialization/force_include.hpp>
+#include <boost/detail/workaround.hpp>
+
 namespace boost {
 namespace serialization {
 namespace void_cast_detail{
 class void_caster;
 } // namespace void_cast_detail
+
 template<class Derived, class Base>
 BOOST_DLLEXPORT 
-inline const void_cast_detail::void_caster & void_cast_register(
+// DMC doesn't allow export and inline, so supress the inline
+#if BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x849)) 
+#else
+inline 
+#endif
+const void_cast_detail::void_caster & void_cast_register(
     const Derived * dnull = NULL, 
     const Base * bnull = NULL
 ) BOOST_USED;

Deleted: boost/trunk/boost/serialization/wrapper.hpp
===================================================================
--- boost/trunk/boost/serialization/wrapper.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/serialization/wrapper.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,54 +0,0 @@
-#ifndef BOOST_SERIALIZATION_WRAPPER_HPP
-#define BOOST_SERIALIZATION_WRAPPER_HPP
-
-// (C) Copyright 2005-2006 Matthias Troyer
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#include <boost/serialization/traits.hpp>
-#include <boost/type_traits/is_base_and_derived.hpp>
-#include <boost/mpl/eval_if.hpp>
-
-namespace boost { namespace serialization {
-
-/// the base class for serialization wrappers
-///
-/// wrappers need to be treated differently at various places in the serialization library,
-/// e.g. saving of non-const wrappers has to be possible. Since partial specialization
-// is not supported by all compilers, we derive all wrappers from wrapper_traits. 
-
-template<
-    class T, 
-    int Level, 
-    int Tracking,
-    unsigned int Version = 0,
-    class ETII = extended_type_info_impl< T >
->
-struct wrapper_traits : public traits<T,Level,Tracking,Version,ETII,mpl::true_> 
-{};
-
-/// the is_wrapper type traits class. 
-
-namespace detail {
-template <class T>
-struct is_wrapper_member
-{
-  typedef BOOST_DEDUCED_TYPENAME T::is_wrapper type;
-};
-
-}
-
-
-template<class T>
-struct is_wrapper
- : mpl::eval_if<
-      is_base_and_derived<basic_traits,T>,
-      detail::is_wrapper_member<T>,
-      mpl::false_
-    >::type
-{};
- 
-} } // end namespace boost::serialization
-
-#endif //BOOST_SERIALIZATION_WRAPPER_HPP

Modified: boost/trunk/boost/shared_array.hpp
===================================================================
--- boost/trunk/boost/shared_array.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/shared_array.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,6 +20,8 @@
 #include <boost/detail/shared_array_nmt.hpp>
 #else
 
+#include <memory>             // TR1 cyclic inclusion fix
+
 #include <boost/assert.hpp>
 #include <boost/checked_delete.hpp>
 

Modified: boost/trunk/boost/shared_ptr.hpp
===================================================================
--- boost/trunk/boost/shared_ptr.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/shared_ptr.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -236,7 +236,7 @@
 #if !defined( BOOST_NO_SFINAE ) && !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION )
 
     template<class Ap>
-    shared_ptr( Ap r, typename boost::detail::sp_enable_if_auto_ptr<Ap, int>::type = 0 ): px( r.get() ), pn()
+    explicit shared_ptr( Ap r, typename boost::detail::sp_enable_if_auto_ptr<Ap, int>::type = 0 ): px( r.get() ), pn()
     {
         typename Ap::element_type * tmp = r.get();
         pn = boost::detail::shared_count( r );
@@ -323,10 +323,8 @@
 
     // implicit conversion to "bool"
 
-/*
+#if defined(__SUNPRO_CC) && BOOST_WORKAROUND(__SUNPRO_CC, <= 0x580)
 
-#if defined(__SUNPRO_CC) && BOOST_WORKAROUND(__SUNPRO_CC, <= 0x530)
-
     operator bool () const
     {
         return px != 0;
@@ -334,8 +332,6 @@
 
 #elif defined( _MANAGED )
 
-*/
-
     static void unspecified_bool( this_type*** )
     {
     }
@@ -347,8 +343,6 @@
         return px == 0? 0: unspecified_bool;
     }
 
-/*
-
 #elif \
     ( defined(__MWERKS__) && BOOST_WORKAROUND(__MWERKS__, < 0x3200) ) || \
     ( defined(__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ < 304) )
@@ -371,8 +365,6 @@
 
 #endif
 
-*/
-
     // operator! is redundant, but some compilers need it
 
     bool operator! () const // never throws
@@ -512,6 +504,9 @@
 
 #else
 
+// in STLport's no-iostreams mode no iostream symbols can be used
+#ifndef _STLP_NO_IOSTREAMS
+
 # if defined(BOOST_MSVC) && BOOST_WORKAROUND(BOOST_MSVC, < 1300 && __SGI_STL_PORT)
 // MSVC6 has problems finding std::basic_ostream through the using declaration in namespace _STL
 using std::basic_ostream;
@@ -524,8 +519,10 @@
     return os;
 }
 
-#endif
+#endif // _STLP_NO_IOSTREAMS
 
+#endif // __GNUC__ < 3
+
 // get_deleter (experimental)
 
 #if ( defined(__GNUC__) && BOOST_WORKAROUND(__GNUC__, < 3) ) || \

Modified: boost/trunk/boost/signals/detail/named_slot_map.hpp
===================================================================
--- boost/trunk/boost/signals/detail/named_slot_map.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/signals/detail/named_slot_map.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -60,7 +60,8 @@
   typedef const stored_group& first_argument_type;
   typedef const stored_group& second_argument_type;
 
-  group_bridge_compare(const Compare& c) : comp(c) {}
+  group_bridge_compare(const Compare& c) : comp(c) 
+  { }
 
   bool operator()(const stored_group& k1, const stored_group& k2) const
   {
@@ -92,14 +93,40 @@
                           connection_slot_pair,
                           forward_traversal_tag> inherited;
 public:
-  named_slot_map_iterator();
-  named_slot_map_iterator(const named_slot_map_iterator&);
-  named_slot_map_iterator& operator=(const named_slot_map_iterator&);
+  named_slot_map_iterator() : slot_assigned(false) 
+  { }
+  named_slot_map_iterator(const named_slot_map_iterator& other) 
+    : group(other.group), last_group(other.last_group),
+    slot_assigned(other.slot_assigned)
+  {
+    if (slot_assigned) slot_ = other.slot_;
+  }
+  named_slot_map_iterator& operator=(const named_slot_map_iterator& other) 
+  {
+    slot_assigned = other.slot_assigned;
+    group = other.group;
+    last_group = other.last_group;
+    if (slot_assigned) slot_ = other.slot_;
+    return *this;
+  }
+  connection_slot_pair& dereference() const 
+  {
+    return *slot_;
+  }
+  void increment() 
+  {
+    ++slot_;
+    if (slot_ == group->second.end()) {
+      ++group;
+      init_next_group();
+    }
+  }
+  bool equal(const named_slot_map_iterator& other) const {
+    return (group == other.group
+        && (group == last_group
+        || slot_ == other.slot_));
+  }
 
-  connection_slot_pair& dereference() const;
-  void increment();
-  bool equal(const named_slot_map_iterator& other) const;
-
 #if BOOST_WORKAROUND(_MSC_VER, <= 1400)
   void decrement();
   void advance(difference_type);

Modified: boost/trunk/boost/signals/signal_template.hpp
===================================================================
--- boost/trunk/boost/signals/signal_template.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/signals/signal_template.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -210,7 +210,7 @@
             BOOST_SIGNALS_NAMESPACE::connect_position at
               = BOOST_SIGNALS_NAMESPACE::at_back);
 
-#if BOOST_WORKAROUND(BOOST_MSVC, <= 0x1700)
+#if BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
     // MSVC 6.0 and 7.0 don't handle the is_convertible test well
     void disconnect(const group_type& group)
     {

Modified: boost/trunk/boost/spirit/core/primitives/impl/numerics.ipp
===================================================================
--- boost/trunk/boost/spirit/core/primitives/impl/numerics.ipp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/spirit/core/primitives/impl/numerics.ipp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -520,7 +520,6 @@
 
 #if (defined(BOOST_MSVC) && (BOOST_MSVC <= 1310))
 #pragma warning(pop)
-#pragma warning(disable:4127)
 #endif
 
     }   //  namespace impl

Modified: boost/trunk/boost/spirit/iterator/impl/position_iterator.ipp
===================================================================
--- boost/trunk/boost/spirit/iterator/impl/position_iterator.ipp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/spirit/iterator/impl/position_iterator.ipp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 /*=============================================================================
     Copyright (c) 2002 Juan Carlos Arevalo-Baeza
-    Copyright (c) 2002-2003 Hartmut Kaiser
+    Copyright (c) 2002-2006 Hartmut Kaiser
     Copyright (c) 2003 Giovanni Bajo
     http://spirit.sourceforge.net/
 
@@ -29,18 +29,18 @@
 //  newlines since no column tracking is needed.
 //
 ///////////////////////////////////////////////////////////////////////////////
-template <>
-class position_policy<file_position_without_column> {
+template <typename String>
+class position_policy<file_position_without_column_base<String> > {
 
 public:
-    void next_line(file_position_without_column& pos)
+    void next_line(file_position_without_column_base<String>& pos)
     {
         ++pos.line;
     }
 
     void set_tab_chars(unsigned int /*chars*/){}
-    void next_char(file_position_without_column& /*pos*/)    {}
-    void tabulation(file_position_without_column& /*pos*/)   {}
+    void next_char(file_position_without_column_base<String>& /*pos*/)    {}
+    void tabulation(file_position_without_column_base<String>& /*pos*/)   {}
 };
 
 ///////////////////////////////////////////////////////////////////////////////
@@ -54,15 +54,15 @@
 //  of position_iterator.
 //
 ///////////////////////////////////////////////////////////////////////////////
-template <>
-class position_policy<file_position> {
+template <typename String>
+class position_policy<file_position_base<String> > {
 
 public:
     position_policy()
         : m_CharsPerTab(4)
     {}
 
-    void next_line(file_position& pos)
+    void next_line(file_position_base<String>& pos)
     {
         ++pos.line;
         pos.column = 1;
@@ -73,12 +73,12 @@
         m_CharsPerTab = chars;
     }
 
-    void next_char(file_position& pos)
+    void next_char(file_position_base<String>& pos)
     {
         ++pos.column;
     }
 
-    void tabulation(file_position& pos)
+    void tabulation(file_position_base<String>& pos)
     {
         pos.column += m_CharsPerTab - (pos.column - 1) % m_CharsPerTab;
     }

Modified: boost/trunk/boost/spirit/iterator/position_iterator.hpp
===================================================================
--- boost/trunk/boost/spirit/iterator/position_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/spirit/iterator/position_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 /*=============================================================================
     Copyright (c) 2002 Juan Carlos Arevalo-Baeza
-    Copyright (c) 2002-2003 Hartmut Kaiser
+    Copyright (c) 2002-2006 Hartmut Kaiser
     Copyright (c) 2003 Giovanni Bajo
     http://spirit.sourceforge.net/
 
@@ -27,17 +27,18 @@
 //  and the line number
 //
 ///////////////////////////////////////////////////////////////////////////////
-struct file_position_without_column {
-    std::string file;
+template <typename String>
+struct file_position_without_column_base {
+    String file;
     int line;
 
-    file_position_without_column(std::string const& file_ = std::string(),
+    file_position_without_column_base(String const& file_ = String(),
                   int line_ = 1):
         file    (file_),
         line    (line_)
     {}
 
-    bool operator==(const file_position_without_column& fp) const
+    bool operator==(const file_position_without_column_base& fp) const
     { return line == fp.line && file == fp.file; }
 };
 
@@ -49,20 +50,20 @@
 //  line and column number
 //
 ///////////////////////////////////////////////////////////////////////////////
-struct file_position : public file_position_without_column {
+template <typename String>
+struct file_position_base : public file_position_without_column_base<String> {
     int column;
 
-    file_position(std::string const& file_ = std::string(),
-                  int line_ = 1, int column_ = 1):
-        file_position_without_column (file_, line_),
+    file_position_base(String const& file_ = String(),
+                       int line_ = 1, int column_ = 1):
+        file_position_without_column_base<String> (file_, line_),
         column                       (column_)
     {}
 
-    bool operator==(const file_position& fp) const
-    { return column == fp.column && line == fp.line && file == fp.file; }
+    bool operator==(const file_position_base& fp) const
+    { return column == fp.column && this->line == fp.line && this->file == fp.file; }
 };
 
-
 ///////////////////////////////////////////////////////////////////////////////
 //
 //  position_policy<>

Modified: boost/trunk/boost/spirit/iterator/position_iterator_fwd.hpp
===================================================================
--- boost/trunk/boost/spirit/iterator/position_iterator_fwd.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/spirit/iterator/position_iterator_fwd.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,6 @@
 /*=============================================================================
     Copyright (c) 2006 Tobias Schwinger
+    Copyright (c) 2002-2006 Hartmut Kaiser
     http://spirit.sourceforge.net/
 
     Use, modification and distribution is subject to the Boost Software
@@ -9,16 +10,29 @@
 #if !defined(BOOST_SPIRIT_POSITION_ITERATOR_FWD_HPP)
 #define BOOST_SPIRIT_POSITION_ITERATOR_FWD_HPP
 
+#include <string>
+#include <boost/detail/iterator.hpp> // for boost::detail::iterator_traits
 #include <boost/spirit/core/nil.hpp>
 
 namespace boost { namespace spirit {
 
-    struct file_position;
-    struct file_position_without_column;
+    template <typename String = std::string> 
+    struct file_position_base;
+    
+    typedef file_position_base<std::string> file_position;
 
+    template <typename String = std::string> 
+    struct file_position_without_column_base;
+
+    typedef file_position_without_column_base<std::string> file_position_without_column;
+
     template <
         typename ForwardIteratorT,
-        typename PositionT = file_position,
+        typename PositionT = file_position_base<
+            std::basic_string<
+                typename boost::detail::iterator_traits<ForwardIteratorT>::value_type
+            > 
+        >,
         typename SelfT = nil_t
     >
     class position_iterator;
@@ -26,7 +40,11 @@
     template
     <
         typename ForwardIteratorT,
-        typename PositionT = file_position
+        typename PositionT = file_position_base<
+            std::basic_string<
+                typename boost::detail::iterator_traits<ForwardIteratorT>::value_type
+            > 
+        >
     >
     class position_iterator2;
 

Modified: boost/trunk/boost/spirit/iterator/typeof.hpp
===================================================================
--- boost/trunk/boost/spirit/iterator/typeof.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/spirit/iterator/typeof.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -80,11 +80,13 @@
 BOOST_TYPEOF_REGISTER_TEMPLATE(boost::spirit::position_iterator,3)
 BOOST_TYPEOF_REGISTER_TEMPLATE(boost::spirit::position_iterator2,2)
 BOOST_TYPEOF_REGISTER_TEMPLATE(boost::spirit::position_policy,1)
+BOOST_TYPEOF_REGISTER_TEMPLATE(boost::spirit::file_position_base,1)
+BOOST_TYPEOF_REGISTER_TEMPLATE(boost::spirit::file_position_without_column_base,1)
+
 BOOST_TYPEOF_REGISTER_TYPE(boost::spirit::file_position)
+BOOST_TYPEOF_REGISTER_TYPE(boost::spirit::file_position_base<std::basic_string<wchar_t> >)
 BOOST_TYPEOF_REGISTER_TYPE(boost::spirit::file_position_without_column)
+BOOST_TYPEOF_REGISTER_TYPE(boost::spirit::file_position_without_column_base<std::basic_string<wchar_t> >)
 
-BOOST_TYPEOF_REGISTER_TEMPLATE(boost::spirit::position_iterator,1)
-BOOST_TYPEOF_REGISTER_TEMPLATE(boost::spirit::position_iterator2,1)
-
 #endif
 

Modified: boost/trunk/boost/spirit/phoenix/operators.hpp
===================================================================
--- boost/trunk/boost/spirit/phoenix/operators.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/spirit/phoenix/operators.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -239,7 +239,7 @@
 template <typename T>
 struct unary_operator<logical_not_op, T> {
 
-    typedef bool result_type;
+    typedef T const result_type;
     static result_type eval(T const& v)
     { return !v; }
 };

Modified: boost/trunk/boost/spirit/symbols/symbols.hpp
===================================================================
--- boost/trunk/boost/spirit/symbols/symbols.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/spirit/symbols/symbols.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -181,6 +181,8 @@
     symbol_inserter(SetT& set_)
     : set(set_) {}
 
+    typedef symbol_inserter const & result_type;
+
     template <typename IteratorT>
     symbol_inserter const&
     operator()(IteratorT first, IteratorT const& last, T const& data = T()) const

Modified: boost/trunk/boost/spirit/tree/ast.hpp
===================================================================
--- boost/trunk/boost/spirit/tree/ast.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/spirit/tree/ast.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -103,7 +103,9 @@
         {
             BOOST_SPIRIT_ASSERT(a.trees.size() == 1);
 
+#if !defined(BOOST_SPIRIT_USE_LIST_FOR_TREES)
             a.trees.begin()->children.reserve(a.trees.begin()->children.size() + b.trees.size());
+#endif
             std::copy(b.trees.begin(),
                  b.trees.end(),
                  std::back_insert_iterator<container_t>(
@@ -111,7 +113,9 @@
         }
         else
         {
+#if !defined(BOOST_SPIRIT_USE_LIST_FOR_TREES)
             a.trees.reserve(a.trees.size() + b.trees.size());
+#endif
             std::copy(b.trees.begin(),
                  b.trees.end(),
                  std::back_insert_iterator<container_t>(a.trees));

Modified: boost/trunk/boost/spirit/tree/impl/tree_to_xml.ipp
===================================================================
--- boost/trunk/boost/spirit/tree/impl/tree_to_xml.ipp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/spirit/tree/impl/tree_to_xml.ipp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -125,7 +125,7 @@
         {
         }
 
-        attribute (char const *key_, char const *value_) :
+        attribute (CharT const *key_, CharT const *value_) :
         key (key_), value(value_)
         {
         }

Modified: boost/trunk/boost/spirit/utility/rule_parser.hpp
===================================================================
--- boost/trunk/boost/spirit/utility/rule_parser.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/spirit/utility/rule_parser.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,6 +6,11 @@
     License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
     http://www.boost.org/LICENSE_1_0.txt)
 ==============================================================================*/
+// The comment below contains a unnamed 'namespace {', which is flagged by the
+// Boost inspect tool as a violation of common C++ programming rules. Since it's
+// in a comment, well, we switch it off :-P
+// boostinspect:nounnamed
+
 //
 // About:
 // =====

Modified: boost/trunk/boost/spirit/version.hpp
===================================================================
--- boost/trunk/boost/spirit/version.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/spirit/version.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -25,7 +25,7 @@
 //  This is the version of the current Spirit distribution
 //
 ///////////////////////////////////////////////////////////////////////////////
-#define SPIRIT_VERSION 0x1803
+#define SPIRIT_VERSION 0x1804
 #define SPIRIT_PIZZA_VERSION SPIRIT_DOUBLE_CHEESE  // :-)
 
 #endif // defined(SPIRIT_VERSION_HPP)

Modified: boost/trunk/boost/statechart/asynchronous_state_machine.hpp
===================================================================
--- boost/trunk/boost/statechart/asynchronous_state_machine.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/asynchronous_state_machine.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_ASYNCHRONOUS_STATE_MACHINE_HPP_INCLUDED
 #define BOOST_STATECHART_ASYNCHRONOUS_STATE_MACHINE_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/custom_reaction.hpp
===================================================================
--- boost/trunk/boost/statechart/custom_reaction.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/custom_reaction.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_CUSTOM_REACTION_HPP_INCLUDED
 #define BOOST_STATECHART_CUSTOM_REACTION_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/deep_history.hpp
===================================================================
--- boost/trunk/boost/statechart/deep_history.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/deep_history.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_DEEP_HISTORY_HPP_INCLUDED
 #define BOOST_STATECHART_DEEP_HISTORY_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////
@@ -44,8 +44,6 @@
     typedef typename DefaultState::context_type_list context_type_list;
     typedef typename DefaultState::orthogonal_position orthogonal_position;
 
-    typedef mpl::bool_< true > history_destination;
-
     static void deep_construct(
       const context_ptr_type & pContext,
       outermost_context_base_type & outermostContextBase )

Modified: boost/trunk/boost/statechart/deferral.hpp
===================================================================
--- boost/trunk/boost/statechart/deferral.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/deferral.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_DEFERRAL_HPP_INCLUDED
 #define BOOST_STATECHART_DEFERRAL_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/detail/avoid_unused_warning.hpp
===================================================================
--- boost/trunk/boost/statechart/detail/avoid_unused_warning.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/detail/avoid_unused_warning.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_DETAIL_AVOID_UNUSED_WARNING_HPP_INCLUDED
 #define BOOST_STATECHART_DETAIL_AVOID_UNUSED_WARNING_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/detail/constructor.hpp
===================================================================
--- boost/trunk/boost/statechart/detail/constructor.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/detail/constructor.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_DETAIL_CONSTRUCTOR_HPP_INCLUDED
 #define BOOST_STATECHART_DETAIL_CONSTRUCTOR_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/detail/counted_base.hpp
===================================================================
--- boost/trunk/boost/statechart/detail/counted_base.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/detail/counted_base.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_DETAIL_COUNTED_BASE_HPP_INCLUDED
 #define BOOST_STATECHART_DETAIL_COUNTED_BASE_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/detail/leaf_state.hpp
===================================================================
--- boost/trunk/boost/statechart/detail/leaf_state.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/detail/leaf_state.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_DETAIL_LEAF_STATE_HPP_INCLUDED
 #define BOOST_STATECHART_DETAIL_LEAF_STATE_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/detail/memory.hpp
===================================================================
--- boost/trunk/boost/statechart/detail/memory.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/detail/memory.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_DETAIL_MEMORY_HPP_INCLUDED
 #define BOOST_STATECHART_DETAIL_MEMORY_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/detail/node_state.hpp
===================================================================
--- boost/trunk/boost/statechart/detail/node_state.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/detail/node_state.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_DETAIL_NODE_STATE_HPP_INCLUDED
 #define BOOST_STATECHART_DETAIL_NODE_STATE_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/detail/rtti_policy.hpp
===================================================================
--- boost/trunk/boost/statechart/detail/rtti_policy.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/detail/rtti_policy.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_DETAIL_RTTI_POLICY_HPP_INCLUDED
 #define BOOST_STATECHART_DETAIL_RTTI_POLICY_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2006
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/detail/state_base.hpp
===================================================================
--- boost/trunk/boost/statechart/detail/state_base.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/detail/state_base.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_DETAIL_STATE_BASE_HPP_INCLUDED
 #define BOOST_STATECHART_DETAIL_STATE_BASE_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2006
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/event.hpp
===================================================================
--- boost/trunk/boost/statechart/event.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/event.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_EVENT_HPP_INCLUDED
 #define BOOST_STATECHART_EVENT_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/event_base.hpp
===================================================================
--- boost/trunk/boost/statechart/event_base.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/event_base.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_EVENT_BASE_HPP_INCLUDED
 #define BOOST_STATECHART_EVENT_BASE_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/event_processor.hpp
===================================================================
--- boost/trunk/boost/statechart/event_processor.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/event_processor.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_EVENT_PROCESSOR_INCLUDED
 #define BOOST_STATECHART_EVENT_PROCESSOR_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/exception_translator.hpp
===================================================================
--- boost/trunk/boost/statechart/exception_translator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/exception_translator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_EXCEPTION_TRANSLATOR_HPP_INCLUDED
 #define BOOST_STATECHART_EXCEPTION_TRANSLATOR_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/fifo_scheduler.hpp
===================================================================
--- boost/trunk/boost/statechart/fifo_scheduler.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/fifo_scheduler.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_FIFO_SCHEDULER_HPP_INCLUDED
 #define BOOST_STATECHART_FIFO_SCHEDULER_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////
@@ -50,7 +50,7 @@
     {
       processor_handle result;
       work_item item =
-        container_.create_processor< Processor >( result, *this );
+        container_.template create_processor< Processor >( result, *this );
       worker_.queue_work_item( item );
       return result;
     }
@@ -59,8 +59,8 @@
     processor_handle create_processor( Arg1 arg1 )
     {
       processor_handle result;
-      work_item item =
-        container_.create_processor< Processor >( result, *this, arg1 );
+      work_item item = container_.template create_processor< Processor >(
+        result, *this, arg1 );
       worker_.queue_work_item( item );
       return result;
     }
@@ -69,8 +69,8 @@
     processor_handle create_processor( Arg1 arg1, Arg2 arg2 )
     {
       processor_handle result;
-      work_item item =
-        container_.create_processor< Processor >( result, *this, arg1, arg2 );
+      work_item item = container_.template create_processor< Processor >(
+        result, *this, arg1, arg2 );
       worker_.queue_work_item( item );
       return result;
     }
@@ -79,7 +79,7 @@
     processor_handle create_processor( Arg1 arg1, Arg2 arg2, Arg3 arg3 )
     {
       processor_handle result;
-      work_item item = container_.create_processor< Processor >(
+      work_item item = container_.template create_processor< Processor >(
         result, *this, arg1, arg2, arg3 );
       worker_.queue_work_item( item );
       return result;
@@ -92,7 +92,7 @@
       Arg1 arg1, Arg2 arg2, Arg3 arg3, Arg4 arg4 )
     {
       processor_handle result;
-      work_item item = container_.create_processor< Processor >(
+      work_item item = container_.template create_processor< Processor >(
         result, *this, arg1, arg2, arg3, arg4 );
       worker_.queue_work_item( item );
       return result;
@@ -105,7 +105,7 @@
       Arg1 arg1, Arg2 arg2, Arg3 arg3, Arg4 arg4, Arg5 arg5 )
     {
       processor_handle result;
-      work_item item = container_.create_processor< Processor >(
+      work_item item = container_.template create_processor< Processor >(
         result, *this, arg1, arg2, arg3, arg4, arg5 );
       worker_.queue_work_item( item );
       return result;
@@ -118,7 +118,7 @@
       Arg1 arg1, Arg2 arg2, Arg3 arg3, Arg4 arg4, Arg5 arg5, Arg6 arg6 )
     {
       processor_handle result;
-      work_item item = container_.create_processor< Processor >(
+      work_item item = container_.template create_processor< Processor >(
         result, *this, arg1, arg2, arg3, arg4, arg5, arg6 );
       worker_.queue_work_item( item );
       return result;

Modified: boost/trunk/boost/statechart/fifo_worker.hpp
===================================================================
--- boost/trunk/boost/statechart/fifo_worker.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/fifo_worker.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_FIFO_WORKER_HPP_INCLUDED
 #define BOOST_STATECHART_FIFO_WORKER_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/history.hpp
===================================================================
--- boost/trunk/boost/statechart/history.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/history.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_HISTORY_HPP_INCLUDED
 #define BOOST_STATECHART_HISTORY_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/in_state_reaction.hpp
===================================================================
--- boost/trunk/boost/statechart/in_state_reaction.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/in_state_reaction.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_IN_STATE_REACTION_HPP_INCLUDED
 #define BOOST_STATECHART_IN_STATE_REACTION_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/null_exception_translator.hpp
===================================================================
--- boost/trunk/boost/statechart/null_exception_translator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/null_exception_translator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_NULL_EXCEPTION_TRANSLATOR_HPP_INCLUDED
 #define BOOST_STATECHART_NULL_EXCEPTION_TRANSLATOR_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/processor_container.hpp
===================================================================
--- boost/trunk/boost/statechart/processor_container.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/processor_container.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_PROCESSOR_CONTAINER_HPP_INCLUDED
 #define BOOST_STATECHART_PROCESSOR_CONTAINER_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2006
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/result.hpp
===================================================================
--- boost/trunk/boost/statechart/result.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/result.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_RESULT_HPP_INCLUDED
 #define BOOST_STATECHART_RESULT_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/shallow_history.hpp
===================================================================
--- boost/trunk/boost/statechart/shallow_history.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/shallow_history.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_SHALLOW_HISTORY_HPP_INCLUDED
 #define BOOST_STATECHART_SHALLOW_HISTORY_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////
@@ -44,8 +44,6 @@
     typedef typename DefaultState::context_type_list context_type_list;
     typedef typename DefaultState::orthogonal_position orthogonal_position;
 
-    typedef mpl::bool_< true > history_destination;
-
     static void deep_construct(
       const context_ptr_type & pContext,
       outermost_context_base_type & outermostContextBase )

Modified: boost/trunk/boost/statechart/simple_state.hpp
===================================================================
--- boost/trunk/boost/statechart/simple_state.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/simple_state.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_SIMPLE_STATE_HPP_INCLUDED
 #define BOOST_STATECHART_SIMPLE_STATE_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////
@@ -430,8 +430,6 @@
       inherited_deep_history,
       mpl::empty< inner_initial_list > >::type stores_deep_history;
 
-    typedef mpl::bool_< false > history_destination;
-
     void * operator new( std::size_t size )
     {
       return detail::allocate< MostDerived,
@@ -716,19 +714,6 @@
         possible_transition_contexts,
         termination_state_position >::type termination_state_type;
 
-      // If you receive a
-      // "use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>'" or
-      // similar compiler error here then you tried to make a transition to
-      // history from a state residing on the same level as the history
-      // connector (or from a direct or indirect inner state). Since the
-      // outer state has never been left no history has ever been saved.
-      BOOST_STATIC_ASSERT( (
-        mpl::or_<
-          mpl::not_< typename DestinationState::history_destination >,
-          mpl::not_< is_same<
-            typename DestinationState::context_type,
-            common_context_type > > >::value ) );
-
       termination_state_type & terminationState(
         context< termination_state_type >() );
       const typename

Modified: boost/trunk/boost/statechart/state.hpp
===================================================================
--- boost/trunk/boost/statechart/state.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/state.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_STATE_HPP_INCLUDED
 #define BOOST_STATECHART_STATE_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/state_machine.hpp
===================================================================
--- boost/trunk/boost/statechart/state_machine.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/state_machine.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_STATE_MACHINE_HPP_INCLUDED
 #define BOOST_STATECHART_STATE_MACHINE_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/termination.hpp
===================================================================
--- boost/trunk/boost/statechart/termination.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/termination.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_TERMINATION_HPP_INCLUDED
 #define BOOST_STATECHART_TERMINATION_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/statechart/transition.hpp
===================================================================
--- boost/trunk/boost/statechart/transition.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/statechart/transition.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_TRANSITION_HPP_INCLUDED
 #define BOOST_STATECHART_TRANSITION_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/test/detail/unit_test_parameters.hpp
===================================================================
--- boost/trunk/boost/test/detail/unit_test_parameters.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/test/detail/unit_test_parameters.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 //
 //  File        : $RCSfile: unit_test_parameters.hpp,v $
 //
-//  Version     : $Revision: 1.23 $
+//  Version     : $Revision: 1.23.2.1 $
 //
 //  Description : storage for unit test framework parameters information
 // ***************************************************************************
@@ -32,21 +32,21 @@
 
 namespace runtime_config {
 
-void                    init( int* argc, char** argv );
+void                    BOOST_TEST_DECL init( int* argc, char** argv );
 
-unit_test::log_level    log_level();
-bool                    no_result_code();
-unit_test::report_level report_level();
-const_string            test_to_run();
-const_string            break_exec_path();
-bool                    save_pattern();
-bool                    show_build_info();
-bool                    show_progress();
-bool                    catch_sys_errors();
-output_format           report_format();
-output_format           log_format();
-long                    detect_memory_leaks();
-int                     random_seed();
+unit_test::log_level    BOOST_TEST_DECL log_level();
+bool                    BOOST_TEST_DECL no_result_code();
+unit_test::report_level BOOST_TEST_DECL report_level();
+const_string            BOOST_TEST_DECL test_to_run();
+const_string            BOOST_TEST_DECL break_exec_path();
+bool                    BOOST_TEST_DECL save_pattern();
+bool                    BOOST_TEST_DECL show_build_info();
+bool                    BOOST_TEST_DECL show_progress();
+bool                    BOOST_TEST_DECL catch_sys_errors();
+output_format           BOOST_TEST_DECL report_format();
+output_format           BOOST_TEST_DECL log_format();
+long                    BOOST_TEST_DECL detect_memory_leaks();
+int                     BOOST_TEST_DECL random_seed();
 
 } // namespace runtime_config
 
@@ -62,6 +62,10 @@
 //  Revision History :
 //  
 //  $Log: unit_test_parameters.hpp,v $
+//  Revision 1.23.2.1  2006/11/13 20:06:57  jhunold
+//  Merge from HEAD:
+//  Added missing export declarations.
+//
 //  Revision 1.23  2006/01/30 07:29:49  rogeeff
 //  split memory leaks detection API in two to get more functions with better defined roles
 //

Modified: boost/trunk/boost/test/floating_point_comparison.hpp
===================================================================
--- boost/trunk/boost/test/floating_point_comparison.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/test/floating_point_comparison.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 //
 //  File        : $RCSfile: floating_point_comparison.hpp,v $
 //
-//  Version     : $Revision: 1.27 $
+//  Version     : $Revision: 1.26.2.2 $
 //
 //  Description : defines algoirthms for comparing 2 floating point values
 // ***************************************************************************
@@ -33,7 +33,7 @@
 // **************        floating_point_comparison_type        ************** //
 // ************************************************************************** //
 
-enum BOOST_TEST_DECL floating_point_comparison_type {
+enum floating_point_comparison_type {
     FPC_STRONG, // "Very close"   - equation 1' in docs, the default
     FPC_WEAK    // "Close enough" - equation 2' in docs.
 
@@ -243,7 +243,10 @@
 //  Revision History :
 //  
 //  $Log: floating_point_comparison.hpp,v $
-//  Revision 1.27  2006/05/22 17:39:43  johnmaddock
+//  Revision 1.26.2.2  2006/11/30 14:41:21  jhunold
+//  Merge from HEAD: Remove unnecessary export makro.
+//
+//  Revision 1.26.2.1  2006/05/22 17:39:12  johnmaddock
 //  Fix min/max guidelines violation.
 //
 //  Revision 1.26  2006/03/16 07:31:06  vladimir_prus
@@ -277,3 +280,4 @@
 // ***************************************************************************
 
 #endif // BOOST_FLOATING_POINT_COMAPARISON_HPP_071894GER
+

Modified: boost/trunk/boost/test/impl/exception_safety.ipp
===================================================================
--- boost/trunk/boost/test/impl/exception_safety.ipp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/test/impl/exception_safety.ipp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 //
 //  File        : $RCSfile: exception_safety.ipp,v $
 //
-//  Version     : $Revision: 1.7 $
+//  Version     : $Revision: 1.7.2.1 $
 //
 //  Description : Facilities to perform exception safety tests
 // ***************************************************************************
@@ -126,7 +126,7 @@
 
     // test observer interface
     virtual void        assertion_result( bool passed );
-    virtual int         priority() { return std::numeric_limits<int>::max(); } // we want this observer to run the last
+    virtual int         priority() { return (std::numeric_limits<int>::max)(); } // we want this observer to run the last
 
 private:
     void                failure_point();
@@ -540,6 +540,9 @@
 //  Revision History :
 //
 //  $Log: exception_safety.ipp,v $
+//  Revision 1.7.2.1  2006/07/27 11:48:49  gennaro_prota
+//  boost guidelines (mainly from inspect tool: tabs, license reference text, etc.); more to do...
+//
 //  Revision 1.7  2006/02/23 15:10:00  rogeeff
 //  vc70 out
 //

Modified: boost/trunk/boost/test/included/unit_test_framework.hpp
===================================================================
--- boost/trunk/boost/test/included/unit_test_framework.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/test/included/unit_test_framework.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,11 @@
-// deprecated
+//  (C) Copyright Gennadiy Rozental 2001-2005.
+//  Distributed under the Boost Software License, Version 1.0.
+//  (See accompanying file LICENSE_1_0.txt or copy at 
+//  http://www.boost.org/LICENSE_1_0.txt)
+
+//  See http://www.boost.org/libs/test/ for the library home page.
+
+
+
+// ******* deprecated *******
 #include <boost/test/included/unit_test.hpp>

Modified: boost/trunk/boost/test/output/compiler_log_formatter.hpp
===================================================================
--- boost/trunk/boost/test/output/compiler_log_formatter.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/test/output/compiler_log_formatter.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 //
 //  File        : $RCSfile: compiler_log_formatter.hpp,v $
 //
-//  Version     : $Revision: 1.2 $
+//  Version     : $Revision: 1.2.6.1 $
 //
 //  Description : contains compiler like Log formatter definition
 // ***************************************************************************
@@ -33,7 +33,7 @@
 // **************             compiler_log_formatter           ************** //
 // ************************************************************************** //
 
-class compiler_log_formatter : public unit_test_log_formatter {
+class BOOST_TEST_DECL compiler_log_formatter : public unit_test_log_formatter {
 public:
     // Formatter interface
     void    log_start( std::ostream&, counter_t test_cases_amount );
@@ -68,6 +68,10 @@
 //  Revision History :
 //  
 //  $Log: compiler_log_formatter.hpp,v $
+//  Revision 1.2.6.1  2006/11/13 20:06:57  jhunold
+//  Merge from HEAD:
+//  Added missing export declarations.
+//
 //  Revision 1.2  2005/02/20 08:27:08  rogeeff
 //  This a major update for Boost.Test framework. See release docs for complete list of fixes/updates
 //

Modified: boost/trunk/boost/test/parameterized_test.hpp
===================================================================
--- boost/trunk/boost/test/parameterized_test.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/test/parameterized_test.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 //
 //  File        : $RCSfile: parameterized_test.hpp,v $
 //
-//  Version     : $Revision: 1.7 $
+//  Version     : $Revision: 1.7.2.1 $
 //
 //  Description : generators and helper macros for parameterized tests
 // ***************************************************************************
@@ -88,7 +88,7 @@
             return (test_unit*)0;
 
         test_func_with_bound_param<ParamType> bound_test_func( m_test_func, *m_par_begin );
-        test_unit* res = new test_case( m_tc_name, bound_test_func );
+        ::boost::unit_test::test_unit* res = new test_case( m_tc_name, bound_test_func );
 
         ++m_par_begin;
 
@@ -181,6 +181,9 @@
 //  Revision History :
 //  
 //  $Log: parameterized_test.hpp,v $
+//  Revision 1.7.2.1  2006/10/19 09:23:04  johnmaddock
+//  Fix for VC6.
+//
 //  Revision 1.7  2006/01/28 08:57:02  rogeeff
 //  VC6.0 workaround removed
 //

Modified: boost/trunk/boost/test/test_tools.hpp
===================================================================
--- boost/trunk/boost/test/test_tools.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/test/test_tools.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 //
 //  File        : $RCSfile: test_tools.hpp,v $
 //
-//  Version     : $Revision: 1.60 $
+//  Version     : $Revision: 1.60.2.6 $
 //
 //  Description : contains definition for all test tools in test toolbox
 // ***************************************************************************
@@ -154,13 +154,20 @@
 
 //____________________________________________________________________________//
 
+// The argument version of the following macros are causing "Internal Compiler Errors"
+// on MSVC 6.5 when inlining is turned on (i.e. usually in release builds)
+#if BOOST_WORKAROUND(BOOST_MSVC, <=1200)
+#define BOOST_WARN_EQUAL( L, R ) BOOST_WARN( (L) == (R) )
+#define BOOST_CHECK_EQUAL( L, R ) BOOST_CHECK( (L) == (R) )
+#define BOOST_REQUIRE_EQUAL( L, R ) BOOST_REQUIRE( (L) == (R) )
+#else
 #define BOOST_WARN_EQUAL( L, R ) \
     BOOST_CHECK_WITH_ARGS_IMPL( ::boost::test_tools::tt_detail::equal_impl_frwd(), "", WARN, CHECK_EQUAL, (L)(R) )
 #define BOOST_CHECK_EQUAL( L, R ) \
     BOOST_CHECK_WITH_ARGS_IMPL( ::boost::test_tools::tt_detail::equal_impl_frwd(), "", CHECK, CHECK_EQUAL, (L)(R) )
 #define BOOST_REQUIRE_EQUAL( L, R ) \
     BOOST_CHECK_WITH_ARGS_IMPL( ::boost::test_tools::tt_detail::equal_impl_frwd(), "", REQUIRE, CHECK_EQUAL, (L)(R) )
-
+#endif
 //____________________________________________________________________________//
 
 #define BOOST_WARN_CLOSE( L, R, T ) \
@@ -317,7 +324,7 @@
 template<typename T, std::size_t N >
 struct print_log_value< T[N] > {
     void    operator()( std::ostream& ostr, T const* t )
-    {   
+    {
         ostr << t;
     }
 };
@@ -326,28 +333,28 @@
 //____________________________________________________________________________//
 
 template<>
-struct print_log_value<char> {
+struct BOOST_TEST_DECL print_log_value<char> {
     void    operator()( std::ostream& ostr, char t );
 };
 
 //____________________________________________________________________________//
 
 template<>
-struct print_log_value<unsigned char> {
+struct BOOST_TEST_DECL print_log_value<unsigned char> {
     void    operator()( std::ostream& ostr, unsigned char t );
 };
 
 //____________________________________________________________________________//
 
 template<>
-struct print_log_value<char const*> {
+struct BOOST_TEST_DECL print_log_value<char const*> {
     void    operator()( std::ostream& ostr, char const* t );
 };
 
 //____________________________________________________________________________//
 
 template<>
-struct print_log_value<wchar_t const*> {
+struct BOOST_TEST_DECL print_log_value<wchar_t const*> {
     void    operator()( std::ostream& ostr, wchar_t const* t );
 };
 
@@ -380,7 +387,7 @@
     return print_helper_t<T>( t );
 }
 
-#if BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x530)) 
+#if BOOST_WORKAROUND(__SUNPRO_CC, < 0x580) 
 template<typename T, std::size_t N>
 inline print_helper_t<T*> print_helper( T (&t)[N] )
 {
@@ -461,17 +468,17 @@
 //____________________________________________________________________________//
 
 template <class Left, class Right>
-predicate_result    equal_impl( Left const& left, Right const& right )
+predicate_result equal_impl( Left const& left, Right const& right )
 {
     return left == right;
 }
 
 //____________________________________________________________________________//
 
-predicate_result        equal_impl( char const* left, char const* right );
-inline predicate_result equal_impl( char* left, char const* right ) { return equal_impl( (char const*)left, (char const*)right ); }
-inline predicate_result equal_impl( char const* left, char* right ) { return equal_impl( (char const*)left, (char const*)right ); }
-inline predicate_result equal_impl( char* left, char* right )       { return equal_impl( (char const*)left, (char const*)right ); }
+predicate_result        BOOST_TEST_DECL equal_impl( char const* left, char const* right );
+inline predicate_result BOOST_TEST_DECL equal_impl( char* left, char const* right ) { return equal_impl( (char const*)left, (char const*)right ); }
+inline predicate_result BOOST_TEST_DECL equal_impl( char const* left, char* right ) { return equal_impl( (char const*)left, (char const*)right ); }
+inline predicate_result BOOST_TEST_DECL equal_impl( char* left, char* right )       { return equal_impl( (char const*)left, (char const*)right ); }
 
 #if !defined( BOOST_NO_CWCHAR )
 predicate_result        equal_impl( wchar_t const* left, wchar_t const* right );
@@ -481,8 +488,10 @@
 #endif
 
 //____________________________________________________________________________//
-
-struct BOOST_TEST_DECL equal_impl_frwd {
+//
+// Declaring this class as exported causes linker errors when building
+// the serialisation tests with VC6, disable this for now. (JM 2006/10/30)
+struct /*BOOST_TEST_DECL*/ equal_impl_frwd {
     template <typename Left, typename Right>
     inline predicate_result
     call_impl( Left const& left, Right const& right, mpl::false_ ) const
@@ -580,7 +589,7 @@
 
 //____________________________________________________________________________//
 
-bool is_defined_impl( const_string symbol_name, const_string symbol_value );
+bool BOOST_TEST_DECL is_defined_impl( const_string symbol_name, const_string symbol_value );
 
 //____________________________________________________________________________//
 
@@ -600,6 +609,25 @@
 //  Revision History :
 //
 //  $Log: test_tools.hpp,v $
+//  Revision 1.60.2.6  2006/12/16 15:02:16  speedsnail
+//  Merged from HEAD
+//
+//  Revision 1.60.2.5  2006/11/14 21:33:26  jhunold
+//  Merge from HEAD: Add missing export macros for print_log_value<>
+//
+//  Revision 1.60.2.4  2006/11/14 07:35:43  jhunold
+//  Merge from HEAD: Removed wrong export declarations.
+//
+//  Revision 1.60.2.3  2006/11/13 20:06:57  jhunold
+//  Merge from HEAD:
+//  Added missing export declarations.
+//
+//  Revision 1.60.2.2  2006/10/30 18:37:36  johnmaddock
+//  Patch for serialisation test failures.
+//
+//  Revision 1.60.2.1  2006/07/24 00:43:17  gennaro_prota
+//  Tentative fix for Sun C++ 5.8 (don't add more specialized print_helper function template)
+//
 //  Revision 1.60  2006/03/19 07:27:11  rogeeff
 //  avoid warning
 //
@@ -658,3 +686,4 @@
 // ***************************************************************************
 
 #endif // BOOST_TEST_TEST_TOOLS_HPP_012705GER
+

Modified: boost/trunk/boost/thread/barrier.hpp
===================================================================
--- boost/trunk/boost/thread/barrier.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread/barrier.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2002-2003
 // David Moore, William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_BARRIER_JDM030602_HPP
 #define BOOST_BARRIER_JDM030602_HPP
@@ -29,7 +24,16 @@
 
 private:
     mutex m_mutex;
+// disable warnings about non dll import
+// see: http://www.boost.org/more/separate_compilation.html#dlls
+#ifdef BOOST_MSVC
+#   pragma warning(push)
+#   pragma warning(disable: 4251 4231 4660 4275)
+#endif
     condition m_cond;
+#ifdef BOOST_MSVC
+#   pragma warning(pop)
+#endif
     unsigned int m_threshold;
     unsigned int m_count;
     unsigned int m_generation;

Modified: boost/trunk/boost/thread/condition.hpp
===================================================================
--- boost/trunk/boost/thread/condition.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread/condition.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_CONDITION_WEK070601_HPP
 #define BOOST_CONDITION_WEK070601_HPP
@@ -27,6 +22,12 @@
 namespace boost {
 
 struct xtime;
+// disable warnings about non dll import
+// see: http://www.boost.org/more/separate_compilation.html#dlls
+#ifdef BOOST_MSVC
+#   pragma warning(push)
+#   pragma warning(disable: 4251 4231 4660 4275)
+#endif
 
 namespace detail {
 
@@ -185,7 +186,9 @@
         return ret;
     }
 };
-
+#ifdef BOOST_MSVC
+#   pragma warning(pop)
+#endif
 } // namespace boost
 
 // Change Log:

Modified: boost/trunk/boost/thread/detail/config.hpp
===================================================================
--- boost/trunk/boost/thread/detail/config.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread/detail/config.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,19 +1,22 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_THREAD_CONFIG_WEK01032003_HPP
 #define BOOST_THREAD_CONFIG_WEK01032003_HPP
 
 #include <boost/config.hpp>
+#include <boost/detail/workaround.hpp>
 
+#if BOOST_WORKAROUND(__BORLANDC__, < 0x600)
+#  pragma warn -8008 // Condition always true/false
+#  pragma warn -8080 // Identifier declared but never used
+#  pragma warn -8057 // Parameter never used
+#  pragma warn -8066 // Unreachable code
+#endif
+
 // insist on threading support being available:
 #include <boost/config/requires_threads.hpp>
 

Modified: boost/trunk/boost/thread/detail/lock.hpp
===================================================================
--- boost/trunk/boost/thread/detail/lock.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread/detail/lock.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_XLOCK_WEK070601_HPP
 #define BOOST_XLOCK_WEK070601_HPP

Modified: boost/trunk/boost/thread/detail/read_write_lock.hpp
===================================================================
--- boost/trunk/boost/thread/detail/read_write_lock.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread/detail/read_write_lock.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,13 +5,8 @@
 // Copyright (C) 2001
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  David Moore makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_READ_WRITE_LOCK_JDM031002_HPP
 #define BOOST_READ_WRITE_LOCK_JDM031002_HPP

Modified: boost/trunk/boost/thread/detail/tss_hooks.hpp
===================================================================
--- boost/trunk/boost/thread/detail/tss_hooks.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread/detail/tss_hooks.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,7 +20,7 @@
         //Currently only implemented for Win32, but should
             //later be implemented for all platforms.
         //Used by Win32 implementation of Boost.Threads
-            //tss to peform cleanup.
+            //tss to perform cleanup.
         //Like the C runtime library atexit() function,
             //which it mimics, at_thread_exit() returns
             //zero if successful and a nonzero

Modified: boost/trunk/boost/thread/exceptions.hpp
===================================================================
--- boost/trunk/boost/thread/exceptions.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread/exceptions.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_THREAD_EXCEPTIONS_PDM070801_H
 #define BOOST_THREAD_EXCEPTIONS_PDM070801_H
@@ -36,8 +31,6 @@
 
     int native_error() const;
 
-    const char* message() const;
-
 private:
     int m_sys_err;
 };

Modified: boost/trunk/boost/thread/mutex.hpp
===================================================================
--- boost/trunk/boost/thread/mutex.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread/mutex.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_MUTEX_WEK070601_HPP
 #define BOOST_MUTEX_WEK070601_HPP
@@ -28,6 +23,12 @@
 namespace boost {
 
 struct xtime;
+// disable warnings about non dll import
+// see: http://www.boost.org/more/separate_compilation.html#dlls
+#ifdef BOOST_MSVC
+#   pragma warning(push)
+#   pragma warning(disable: 4251 4231 4660 4275)
+#endif
 
 class BOOST_THREAD_DECL mutex
     : private noncopyable
@@ -155,7 +156,9 @@
     threads::mac::detail::scoped_critical_region m_mutex_mutex;
 #endif
 };
-
+#ifdef BOOST_MSVC
+#   pragma warning(pop)
+#endif
 } // namespace boost
 
 // Change Log:

Modified: boost/trunk/boost/thread/once.hpp
===================================================================
--- boost/trunk/boost/thread/once.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread/once.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_ONCE_WEK080101_HPP
 #define BOOST_ONCE_WEK080101_HPP

Modified: boost/trunk/boost/thread/read_write_mutex.hpp
===================================================================
--- boost/trunk/boost/thread/read_write_mutex.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread/read_write_mutex.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C)  2002-2003
 // David Moore, William E. Kempf, Michael Glassford
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  David Moore makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 // A Boost::threads implementation of a synchronization
 //   primitive which can allow multiple readers or a single
@@ -16,6 +11,8 @@
 #ifndef BOOST_READ_WRITE_MUTEX_JDM030602_HPP
 #define BOOST_READ_WRITE_MUTEX_JDM030602_HPP
 
+#error Read Write Mutex is broken, do not include this header 
+
 #include <boost/thread/detail/config.hpp>
 
 #include <boost/utility.hpp>
@@ -27,7 +24,12 @@
 #include <boost/thread/condition.hpp>
 
 namespace boost {
-
+// disable warnings about non dll import
+// see: http://www.boost.org/more/separate_compilation.html#dlls
+#ifdef BOOST_MSVC
+#   pragma warning(push)
+#   pragma warning(disable: 4251 4231 4660 4275)
+#endif
 namespace read_write_scheduling_policy {
     enum read_write_scheduling_policy_enum
     {
@@ -53,7 +55,7 @@
     typedef detail::thread::scoped_timed_lock<Mutex> scoped_timed_lock;
 
     read_write_mutex_impl(read_write_scheduling_policy::read_write_scheduling_policy_enum sp);
-#if !BOOST_WORKAROUND(__BORLANDC__,<= 0x564)
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(582))
     ~read_write_mutex_impl();
 #endif
 
@@ -265,7 +267,9 @@
 
     detail::thread::read_write_mutex_impl<timed_mutex> m_impl; 
 };
-
+#ifdef BOOST_MSVC
+#   pragma warning(pop)
+#endif
 }    // namespace boost
 
 #endif

Modified: boost/trunk/boost/thread/recursive_mutex.hpp
===================================================================
--- boost/trunk/boost/thread/recursive_mutex.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread/recursive_mutex.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_RECURSIVE_MUTEX_WEK070601_HPP
 #define BOOST_RECURSIVE_MUTEX_WEK070601_HPP
@@ -28,7 +23,12 @@
 namespace boost {
 
 struct xtime;
-
+// disable warnings about non dll import
+// see: http://www.boost.org/more/separate_compilation.html#dlls
+#ifdef BOOST_MSVC
+#   pragma warning(push)
+#   pragma warning(disable: 4251 4231 4660 4275)
+#endif
 class BOOST_THREAD_DECL recursive_mutex
     : private noncopyable
 {
@@ -169,7 +169,9 @@
     std::size_t m_count;
 #endif
 };
-
+#ifdef BOOST_MSVC
+#   pragma warning(pop)
+#endif
 } // namespace boost
 
 #endif // BOOST_RECURSIVE_MUTEX_WEK070601_HPP

Modified: boost/trunk/boost/thread/thread.hpp
===================================================================
--- boost/trunk/boost/thread/thread.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread/thread.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_THREAD_WEK070601_HPP
 #define BOOST_THREAD_WEK070601_HPP
@@ -30,7 +25,12 @@
 namespace boost {
 
 struct xtime;
-
+// disable warnings about non dll import
+// see: http://www.boost.org/more/separate_compilation.html#dlls
+#ifdef BOOST_MSVC
+#   pragma warning(push)
+#   pragma warning(disable: 4251 4231 4660 4275)
+#endif
 class BOOST_THREAD_DECL thread : private noncopyable
 {
 public:
@@ -76,7 +76,9 @@
     std::list<thread*> m_threads;
     mutex m_mutex;
 };
-
+#ifdef BOOST_MSVC
+#   pragma warning(pop)
+#endif
 } // namespace boost
 
 // Change Log:

Modified: boost/trunk/boost/thread/tss.hpp
===================================================================
--- boost/trunk/boost/thread/tss.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread/tss.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
-// Copyright (C) 2001-2003
-// William E. Kempf
+// Copyright (C) 2001-2003 William E. Kempf
+// Copyright (C) 2006 Roland Schwarz
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_TSS_WEK070601_HPP
 #define BOOST_TSS_WEK070601_HPP
@@ -26,6 +21,13 @@
 
 namespace boost {
 
+// disable warnings about non dll import
+// see: http://www.boost.org/more/separate_compilation.html#dlls
+#ifdef BOOST_MSVC
+#   pragma warning(push)
+#   pragma warning(disable: 4251 4231 4660 4275)
+#endif
+
 namespace detail {
 
 class BOOST_THREAD_DECL tss : private noncopyable
@@ -44,6 +46,7 @@
         }
     }
 
+    ~tss();
     void* get() const;
     void set(void* value);
     void cleanup(void* p);
@@ -103,6 +106,10 @@
     detail::tss m_tss;
 };
 
+#ifdef BOOST_MSVC
+#   pragma warning(pop)
+#endif
+
 } // namespace boost
 
 #endif //BOOST_TSS_WEK070601_HPP

Modified: boost/trunk/boost/thread/xtime.hpp
===================================================================
--- boost/trunk/boost/thread/xtime.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread/xtime.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_XTIME_WEK070601_HPP
 #define BOOST_XTIME_WEK070601_HPP

Modified: boost/trunk/boost/thread.hpp
===================================================================
--- boost/trunk/boost/thread.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/thread.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+// Distributed under the Boost Software License, Version 1.0. (See accompanying 
+// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #if !defined(BOOST_THREAD_WEK01082003_HPP)
 #define BOOST_THREAD_WEK01082003_HPP

Modified: boost/trunk/boost/token_functions.hpp
===================================================================
--- boost/trunk/boost/token_functions.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/token_functions.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
 // accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
-// See http://www.boost.org/libs/tokenizer for documentation.
+// See http://www.boost.org/libs/tokenizer/ for documentation.
 
 // Revision History:
 // 01 Oct 2004   Joaquín M López Muñoz
@@ -74,7 +74,7 @@
   // character (backslash \), can be assigned to other characters.
 
   struct escaped_list_error : public std::runtime_error{
-    escaped_list_error(const std::string& what):std::runtime_error(what) { }
+    escaped_list_error(const std::string& what_arg):std::runtime_error(what_arg) { }
   };
   
 

Modified: boost/trunk/boost/tr1/array.hpp
===================================================================
--- boost/trunk/boost/tr1/array.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/tr1/array.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,7 +22,7 @@
 
 using ::boost::array;
 
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570))
+#if !BOOST_WORKAROUND(__BORLANDC__, < 0x0582)
 // [6.1.3.2] Tuple creation functions
 using ::boost::swap;
 #endif

Modified: boost/trunk/boost/tr1/complex.hpp
===================================================================
--- boost/trunk/boost/tr1/complex.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/tr1/complex.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -89,7 +89,7 @@
    return ct;
 }
 
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570)) && !BOOST_WORKAROUND(BOOST_MSVC, < 1310)
+#if !BOOST_WORKAROUND(__BORLANDC__, <=0x570) && !BOOST_WORKAROUND(BOOST_MSVC, < 1310)
 inline complex<double> polar(const char& rho, const char& theta = 0)
 { return ::std::polar(static_cast<double>(rho), static_cast<double>(theta)); }
 inline complex<double> polar(const unsigned char& rho, const unsigned char& theta = 0)
@@ -121,10 +121,10 @@
 #endif
 
 template<class T, class U> 
-inline complex<typename ::boost::tr1_detail::promote_to_real<T, U>::type> 
+inline complex<typename boost::tr1_detail::promote_to_real<T, U>::type> 
    polar(const T& rho, const U& theta)
 {
-   typedef typename ::boost::tr1_detail::promote_to_real<T, U>::type real_type;
+   typedef typename boost::tr1_detail::promote_to_real<T, U>::type real_type;
    return std::polar(static_cast<real_type>(rho), static_cast<real_type>(theta));
 }
 #endif
@@ -187,7 +187,7 @@
    pow (const complex<T>& x, const U& y)
 {
    typedef typename boost::tr1_detail::promote_to_real<T, U>::type real_type;
-   typedef complex<typename ::boost::tr1_detail::promote_to_real<T, U>::type> result_type;
+   typedef complex<typename boost::tr1_detail::promote_to_real<T, U>::type> result_type;
    typedef typename boost::mpl::if_<boost::is_same<result_type, complex<T> >, result_type const&, result_type>::type cast1_type;
    real_type r = y;
    cast1_type x1(x);
@@ -200,7 +200,7 @@
    pow (const T& x, const complex<U>& y)
 {
    typedef typename boost::tr1_detail::promote_to_real<T, U>::type real_type;
-   typedef complex<typename ::boost::tr1_detail::promote_to_real<T, U>::type> result_type;
+   typedef complex<typename boost::tr1_detail::promote_to_real<T, U>::type> result_type;
    typedef typename boost::mpl::if_<boost::is_same<result_type, complex<U> >, result_type const&, result_type>::type cast_type;
    real_type r = x;
    std::complex<real_type> x1(r);

Modified: boost/trunk/boost/tr1/detail/config.hpp
===================================================================
--- boost/trunk/boost/tr1/detail/config.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/tr1/detail/config.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -39,7 +39,7 @@
 #endif
 
 // Can't use BOOST_WORKAROUND here, it leads to recursive includes:
-#if defined(__BORLANDC__) && (__BORLANDC__ <= 0x600)
+#if (defined(__BORLANDC__) && (__BORLANDC__ <= 0x600)) || (defined(_MSC_VER) && (_MSC_VER < 1310))
 #  define BOOST_TR1_USE_OLD_TUPLE
 #endif
 

Modified: boost/trunk/boost/tr1/functional.hpp
===================================================================
--- boost/trunk/boost/tr1/functional.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/tr1/functional.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -72,8 +72,9 @@
 
 namespace std{ namespace tr1{
 
-   //using ::boost::is_bind_expression;
-   //using ::boost::is_placeholder;
+   // These aren't supported in this release but are in mainline cvs:
+   // using ::boost::is_bind_expression;
+   // using ::boost::is_placeholder;
    using ::boost::bind;
    namespace placeholders {
 #ifndef BOOST_BIND_NO_PLACEHOLDERS
@@ -98,9 +99,9 @@
 #include <boost/function.hpp>
 #include <boost/detail/workaround.hpp>
 
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570)) \
-	&& !BOOST_WORKAROUND(BOOST_MSVC, < 1310) \
-	&& !defined(BOOST_FUNCTION_NO_FUNCTION_TYPE_SYNTAX)
+#if !BOOST_WORKAROUND(__BORLANDC__, < 0x582) \
+    && !BOOST_WORKAROUND(BOOST_MSVC, < 1310) \
+    && !defined(BOOST_FUNCTION_NO_FUNCTION_TYPE_SYNTAX)
 namespace std{ namespace tr1{
 
    using ::boost::bad_function_call;

Modified: boost/trunk/boost/tr1/memory.hpp
===================================================================
--- boost/trunk/boost/tr1/memory.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/tr1/memory.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -42,7 +42,7 @@
 
    using ::boost::bad_weak_ptr;
    using ::boost::shared_ptr;
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570))
+#if !BOOST_WORKAROUND(__BORLANDC__, < 0x0582)
    using ::boost::swap;
 #endif
    using ::boost::static_pointer_cast;

Modified: boost/trunk/boost/tr1/random.hpp
===================================================================
--- boost/trunk/boost/tr1/random.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/tr1/random.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,7 +13,10 @@
 #else
 // Boost.Random:
 #include <boost/random.hpp>
-#include <boost/nondet_random.hpp>
+#ifndef __SUNPRO_CC
+    // Sunpros linker complains if we so much as include this...
+#   include <boost/nondet_random.hpp>
+#endif
 #include <boost/tr1/detail/functor2iterator.hpp>
 #include <boost/type_traits/is_fundamental.hpp>
 #include <boost/type_traits/is_same.hpp>
@@ -481,7 +484,7 @@
    // calculation of maximum value:
    //
    if((((std::numeric_limits<result_type>::max)() >> s1) < (m_b1.max)())
-      || (((std::numeric_limits<result_type>::max()) >> s2) < (m_b2.max)()))
+      || ((((std::numeric_limits<result_type>::max)()) >> s2) < (m_b2.max)()))
    {
       m_max = (std::numeric_limits<result_type>::max)();
       return;
@@ -517,7 +520,9 @@
 typedef discard_block<subtract_with_carry_01<float, 24, 10, 24>, 223, 24> ranlux3_01;
 typedef discard_block<subtract_with_carry_01<float, 24, 10, 24>, 389, 24> ranlux4_01;
 
+#ifndef __SUNPRO_CC
 using ::boost::random_device;
+#endif
 using ::boost::uniform_int;
 
 class bernoulli_distribution
@@ -573,3 +578,4 @@
 #endif
 
 #endif
+

Modified: boost/trunk/boost/tr1/regex.hpp
===================================================================
--- boost/trunk/boost/tr1/regex.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/tr1/regex.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -77,7 +77,7 @@
 using ::boost::wregex;
 #endif
 
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570))
+#if !BOOST_WORKAROUND(__BORLANDC__, < 0x0582)
 // [7.8.6] basic_regex swap
 using ::boost::swap;
 #endif

Copied: boost/trunk/boost/tr1/tr1/sun (from rev 14034, boost/branches/upstream/current/boost/tr1/tr1/sun)

Modified: boost/trunk/boost/tr1/tuple.hpp
===================================================================
--- boost/trunk/boost/tr1/tuple.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/tr1/tuple.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,3 @@
-//  (C) Copyright John Maddock 2005.
-//  Use, modification and distribution are subject to the
-//  Boost Software License, Version 1.0. (See accompanying file
 //  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_TR1_TUPLE_HPP_INCLUDED
@@ -41,7 +38,7 @@
    typedef typename boost::tuples::element<I,T>::type type;
 };
 
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570))
+#if !BOOST_WORKAROUND(__BORLANDC__, < 0x0582)
 // [6.1.3.4] Element access
 using ::boost::get;
 #endif

Modified: boost/trunk/boost/tr1/type_traits.hpp
===================================================================
--- boost/trunk/boost/tr1/type_traits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/tr1/type_traits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,8 +3,8 @@
 //  Boost Software License, Version 1.0. (See accompanying file
 //  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
-#ifndef BOOST_TR1_FUNCTIONAL_HPP_INCLUDED
-#  define BOOST_TR1_FUNCTIONAL_HPP_INCLUDED
+#ifndef BOOST_TR1_TYPE_TRAITS_HPP_INCLUDED
+#  define BOOST_TR1_TYPE_TRAITS_HPP_INCLUDED
 #  include <boost/tr1/detail/config.hpp>
 
 #ifdef BOOST_HAS_TR1_TYPE_TRAITS

Modified: boost/trunk/boost/tr1/utility.hpp
===================================================================
--- boost/trunk/boost/tr1/utility.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/tr1/utility.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -31,19 +31,19 @@
 template < int I, class T> struct tuple_element; // forward declaration
 
 #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-template <class T1, class T2> 
+template <class T1, class T2>
 struct tuple_size< ::std::pair<T1, T2> >
    : public ::boost::integral_constant< ::std::size_t, 2>
 {
 };
 
-template <class T1, class T2> 
+template <class T1, class T2>
 struct tuple_element<0, ::std::pair<T1, T2> >
 {
    typedef typename std::pair<T1, T2>::first_type type;
 };
 
-template <class T1, class T2> 
+template <class T1, class T2>
 struct tuple_element<1, std::pair<T1, T2> >
 {
    typedef typename std::pair<T1, T2>::second_type type;
@@ -61,29 +61,35 @@
    struct const_tuple_get_result
    {
       typedef typename boost::mpl::if_c<I==0, T1, T2>::type t1;
+# if BOOST_WORKAROUND( __BORLANDC__, BOOST_TESTED_AT( 0x582))
+      // I have absolutely no idea why add_const is not working here for Borland!
+      // It passes all other free-standing tests, some strange interaction going on
+      typedef typename boost::add_reference< const t1 >::type type;
+# else
       typedef typename boost::add_const<t1>::type t2;
       typedef typename boost::add_reference<t2>::type type;
+# endif
    };
 
-template<int I, class T1, class T2> 
+template<int I, class T1, class T2>
 inline typename tuple_detail::tuple_get_result<I,T1,T2>::type get(std::pair<T1, T2>& p, const ::boost::true_type&)
 {
    return p.first;
 }
 
-template<int I, class T1, class T2> 
+template<int I, class T1, class T2>
 inline typename tuple_detail::const_tuple_get_result<I,T1,T2>::type get(const std::pair<T1, T2>& p, const ::boost::true_type&)
 {
    return p.first;
 }
 
-template<int I, class T1, class T2> 
+template<int I, class T1, class T2>
 inline typename tuple_detail::tuple_get_result<I,T1,T2>::type get(std::pair<T1, T2>& p, const ::boost::false_type&)
 {
    return p.second;
 }
 
-template<int I, class T1, class T2> 
+template<int I, class T1, class T2>
 inline typename tuple_detail::const_tuple_get_result<I,T1,T2>::type get(const std::pair<T1, T2>& p, const ::boost::false_type&)
 {
    return p.second;

Modified: boost/trunk/boost/type_traits/add_pointer.hpp
===================================================================
--- boost/trunk/boost/type_traits/add_pointer.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/add_pointer.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -63,7 +63,7 @@
 
 } // namespace detail
 
-BOOST_TT_AUX_TYPE_TRAIT_DEF1(add_pointer,T,typename detail::add_pointer_impl<T>::type)
+BOOST_TT_AUX_TYPE_TRAIT_DEF1(add_pointer,T,typename boost::detail::add_pointer_impl<T>::type)
 
 } // namespace boost
 

Modified: boost/trunk/boost/type_traits/add_reference.hpp
===================================================================
--- boost/trunk/boost/type_traits/add_reference.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/add_reference.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -74,7 +74,7 @@
 
 } // namespace detail
 
-BOOST_TT_AUX_TYPE_TRAIT_DEF1(add_reference,T,typename detail::add_reference_impl<T>::type)
+BOOST_TT_AUX_TYPE_TRAIT_DEF1(add_reference,T,typename boost::detail::add_reference_impl<T>::type)
 
 // agurt, 07/mar/03: workaround Borland's ill-formed sensitivity to an additional
 // level of indirection, here

Modified: boost/trunk/boost/type_traits/aligned_storage.hpp
===================================================================
--- boost/trunk/boost/type_traits/aligned_storage.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/aligned_storage.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-//  (C) John Maddock 2005.
+//  Copyright (C) John Maddock 2005.
 //  Use, modification and distribution are subject to the Boost Software License,
 //  Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
 //  http://www.boost.org/LICENSE_1_0.txt).
@@ -10,3 +10,4 @@
 #  define BOOST_TT_ALIGNED_STORAGE_HPP_INCLUDED
 #  include <boost/aligned_storage.hpp>
 #endif // BOOST_TT_ALIGNED_STORAGE_HPP_INCLUDED
+

Modified: boost/trunk/boost/type_traits/alignment_of.hpp
===================================================================
--- boost/trunk/boost/type_traits/alignment_of.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/alignment_of.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -51,7 +51,7 @@
 {
     BOOST_STATIC_CONSTANT(std::size_t, value =
         (::boost::detail::alignment_logic<
-            sizeof(detail::alignment_of_hack<T>) - sizeof(T),
+            sizeof(::boost::detail::alignment_of_hack<T>) - sizeof(T),
             sizeof(T)
         >::value));
 };

Modified: boost/trunk/boost/type_traits/config.hpp
===================================================================
--- boost/trunk/boost/type_traits/config.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/config.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -34,7 +34,7 @@
     || defined(__ghs)                                               \
     || BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(53800))           \
     || BOOST_WORKAROUND(MPW_CPLUS, BOOST_TESTED_AT(0x890))          \
-    || BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x580)))       \
+    || BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x580)) )      \
     && defined(BOOST_NO_IS_ABSTRACT)
 
 #   define BOOST_TT_NO_CONFORMING_IS_CLASS_IMPLEMENTATION 1

Modified: boost/trunk/boost/type_traits/detail/bool_trait_def.hpp
===================================================================
--- boost/trunk/boost/type_traits/detail/bool_trait_def.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/detail/bool_trait_def.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,8 +8,8 @@
 // http://www.boost.org/LICENSE_1_0.txt)
 
 // $Source: /cvsroot/boost/boost/boost/type_traits/detail/bool_trait_def.hpp,v $
-// $Date: 2005/08/25 16:27:26 $
-// $Revision: 1.19 $
+// $Date: 2006/07/12 11:10:22 $
+// $Revision: 1.19.4.1 $
 
 #include <boost/type_traits/detail/template_arity_spec.hpp>
 #include <boost/type_traits/integral_constant.hpp>
@@ -17,6 +17,28 @@
 #include <boost/mpl/aux_/lambda_support.hpp>
 #include <boost/config.hpp>
 
+//
+// Unfortunately some libraries have started using this header without
+// cleaning up afterwards: so we'd better undef the macros just in case 
+// they've been defined already....
+//
+#ifdef BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL
+#undef BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL
+#undef BOOST_TT_AUX_BOOL_C_BASE
+#undef BOOST_TT_AUX_BOOL_TRAIT_DEF1
+#undef BOOST_TT_AUX_BOOL_TRAIT_DEF2
+#undef BOOST_TT_AUX_BOOL_TRAIT_SPEC1
+#undef BOOST_TT_AUX_BOOL_TRAIT_SPEC2
+#undef BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1
+#undef BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC2
+#undef BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1
+#undef BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2
+#undef BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_1
+#undef BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_2
+#undef BOOST_TT_AUX_BOOL_TRAIT_IMPL_PARTIAL_SPEC2_1
+#undef BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1
+#endif
+
 #if defined(__SUNPRO_CC) && (__SUNPRO_CC < 0x570)
 #   define BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \
     typedef ::boost::integral_constant<bool,C> type; \

Deleted: boost/trunk/boost/type_traits/floating_point_promotion.hpp
===================================================================
--- boost/trunk/boost/type_traits/floating_point_promotion.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/floating_point_promotion.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,61 +0,0 @@
-// Copyright 2005 Alexander Nasonov.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef FILE_boost_type_traits_floating_point_promotion_hpp_INCLUDED
-#define FILE_boost_type_traits_floating_point_promotion_hpp_INCLUDED
-
-#include <boost/config.hpp>
-
-// Should be the last #include
-#include <boost/type_traits/detail/type_trait_def.hpp>
-
-namespace boost {
-
-namespace type_traits { namespace detail {
-
-template<class T>
-struct floating_point_promotion
-{
-    typedef T type;
-};
-
-template<>
-struct floating_point_promotion<float>
-{
-    typedef double type;
-};
-
-template<>
-struct floating_point_promotion<float const>
-{
-    typedef double const type;
-};
-
-template<>
-struct floating_point_promotion<float volatile>
-{
-    typedef double volatile type;
-};
-
-template<>
-struct floating_point_promotion<float const volatile>
-{
-    typedef double const volatile type;
-};
-
-} }
-
-BOOST_TT_AUX_TYPE_TRAIT_DEF1(
-      floating_point_promotion
-    , T
-    , BOOST_DEDUCED_TYPENAME
-        boost::type_traits::detail::floating_point_promotion<T>::type
-    )
-}
-
-#include <boost/type_traits/detail/type_trait_undef.hpp>
-
-#endif // #ifndef FILE_boost_type_traits_floating_point_promotion_hpp_INCLUDED
-

Modified: boost/trunk/boost/type_traits/function_traits.hpp
===================================================================
--- boost/trunk/boost/type_traits/function_traits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/function_traits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -166,7 +166,7 @@
 
 template<typename Function>
 struct function_traits : 
-    public detail::function_traits_helper<typename add_pointer<Function>::type>
+    public detail::function_traits_helper<typename boost::add_pointer<Function>::type>
 {
 };
 

Modified: boost/trunk/boost/type_traits/integral_constant.hpp
===================================================================
--- boost/trunk/boost/type_traits/integral_constant.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/integral_constant.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,42 +19,7 @@
 #endif
 struct integral_constant : public mpl::integral_c<T, val>
 {
-   //BOOST_STATIC_CONSTANT(T, value = val);
-   //typedef T value_type;
    typedef integral_constant<T,val> type;
-
-#if 0
-   //
-   // everything that follows now, is MPL-compatibility code:
-   //
-   typedef ::boost::mpl::integral_c_tag tag;
-
-   // have to #ifdef here: some compilers don't like the 'val + 1' form (MSVC),
-   // while some other don't like 'value + 1' (Borland), and some don't like
-   // either
-#if BOOST_WORKAROUND(__EDG_VERSION__, <= 243)
-private:
-   BOOST_STATIC_CONSTANT(T, next_value = BOOST_MPL_AUX_STATIC_CAST(T, (val + 1)));
-   BOOST_STATIC_CONSTANT(T, prior_value = BOOST_MPL_AUX_STATIC_CAST(T, (val - 1)));
-public:
-   typedef integral_constant<T,next_value> next;
-   typedef integral_constant<T,prior_value> prior;
-#elif BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x561)) \
-   || BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(502)) \
-   || BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(53800))
-   typedef integral_constant<T, ( BOOST_MPL_AUX_STATIC_CAST(T, (val + 1)) )> next;
-   typedef integral_constant<T, ( BOOST_MPL_AUX_STATIC_CAST(T, (val - 1)) )> prior;
-#else
-   typedef integral_constant<T, ( BOOST_MPL_AUX_STATIC_CAST(T, (value + 1)) )> next;
-   typedef integral_constant<T, ( BOOST_MPL_AUX_STATIC_CAST(T, (value - 1)) )> prior;
-#endif
-
-   // enables uniform function call syntax for families of overloaded 
-   // functions that return objects of both arithmetic ('int', 'long',
-   // 'double', etc.) and wrapped integral types (for an example, see 
-   // "mpl/example/power.cpp")
-   operator T() const { return static_cast<T>(this->value); } 
-#endif
 };
 
 template<> struct integral_constant<bool,true> : public mpl::true_ 

Deleted: boost/trunk/boost/type_traits/integral_promotion.hpp
===================================================================
--- boost/trunk/boost/type_traits/integral_promotion.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/integral_promotion.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,195 +0,0 @@
-// Copyright 2005 Alexander Nasonov.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef FILE_boost_type_traits_integral_promotion_hpp_INCLUDED
-#define FILE_boost_type_traits_integral_promotion_hpp_INCLUDED
-
-#include <boost/config.hpp>
-
-#include <boost/mpl/eval_if.hpp>
-#include <boost/mpl/identity.hpp>
-#include <boost/type_traits/integral_constant.hpp>
-#include <boost/type_traits/is_const.hpp>
-#include <boost/type_traits/is_enum.hpp>
-#include <boost/type_traits/is_volatile.hpp>
-#include <boost/type_traits/remove_cv.hpp>
-
-// Should be the last #include
-#include <boost/type_traits/detail/type_trait_def.hpp>
-
-namespace boost {
-
-namespace type_traits { namespace detail {
-
-// 4.5/2
-template <class T> struct need_promotion : boost::is_enum<T> {};
-
-// 4.5/1
-template<> struct need_promotion<char              > : true_type {};
-template<> struct need_promotion<signed char       > : true_type {};
-template<> struct need_promotion<unsigned char     > : true_type {};
-template<> struct need_promotion<signed short int  > : true_type {};
-template<> struct need_promotion<unsigned short int> : true_type {};
-
-
-// Specializations for non-standard types.
-// Type is promoted if it's smaller then int.
-
-#define BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(T) \
-    template<> struct need_promotion<T>          \
-        : integral_constant<bool, (sizeof(T) < sizeof(int))> {};
-
-// Same set of integral types as in boost/type_traits/is_integral.hpp.
-// Please, keep in sync.
-#if (defined(BOOST_MSVC) && (BOOST_MSVC < 1300)) \
-    || (defined(BOOST_INTEL_CXX_VERSION) && defined(_MSC_VER) && (BOOST_INTEL_CXX_VERSION <= 600)) \
-    || (defined(__BORLANDC__) && (__BORLANDC__ == 0x600) && (_MSC_VER < 1300))
-// TODO: common macro for this #if. Or better yet, PP SEQ of non-standard types.
-BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(__int8          )
-BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(unsigned __int8 )
-BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(__int16         )
-BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(unsigned __int16)
-BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(__int32         )
-BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(unsigned __int32)
-#ifdef __BORLANDC__
-BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(unsigned __int64)
-BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(         __int64)
-#endif
-#endif
-
-#if defined(BOOST_HAS_LONG_LONG)
-BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(boost::ulong_long_type)
-BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(boost::long_long_type )
-#elif defined(BOOST_HAS_MS_INT64)
-BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(unsigned __int64)
-BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(         __int64)
-#endif
-
-#undef BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE
-
-
-#ifndef BOOST_NO_INTRINSIC_WCHAR_T
-// 4.5/2
-template<> struct need_promotion<wchar_t> : true_type {};
-#endif
-
-// 4.5/3 (integral bit-field) is not supported.
-
-// 4.5/4
-template<> struct need_promotion<bool> : true_type {};
-
-
-// Get promoted type by index and cv qualifiers.
-
-template<int Index, int IsConst, int IsVolatile> struct promote_from_index;
-
-#define BOOST_TT_AUX_PROMOTE_FROM_INDEX(N,T)                                   \
-    template<> struct promote_from_index<N,0,0> { typedef T type; };           \
-    template<> struct promote_from_index<N,0,1> { typedef T volatile type; };  \
-    template<> struct promote_from_index<N,1,0> { typedef T const type; };     \
-    template<> struct promote_from_index<N,1,1> { typedef T const volatile type; };
-
-
-BOOST_TT_AUX_PROMOTE_FROM_INDEX(1, int          )
-BOOST_TT_AUX_PROMOTE_FROM_INDEX(2, unsigned int )
-BOOST_TT_AUX_PROMOTE_FROM_INDEX(3, long         )
-BOOST_TT_AUX_PROMOTE_FROM_INDEX(4, unsigned long)
-
-
-// WARNING: integral promotions to non-standard types
-// long long and __int64 are not defined by the standard.
-// Additional specialisations and overloads shouldn't
-// introduce ambiguity, though.
-
-#if defined(BOOST_HAS_LONG_LONG)
-BOOST_TT_AUX_PROMOTE_FROM_INDEX(5, boost::long_long_type )
-BOOST_TT_AUX_PROMOTE_FROM_INDEX(6, boost::ulong_long_type)
-#elif defined(BOOST_HAS_MS_INT64)
-BOOST_TT_AUX_PROMOTE_FROM_INDEX(7, __int64         )
-BOOST_TT_AUX_PROMOTE_FROM_INDEX(8, unsigned __int64)
-#endif
-
-#undef BOOST_TT_AUX_PROMOTE_FROM_INDEX
-
-
-// Define BOOST_TT_AUX_PROMOTED_INDEX_TESTER:
-#if !defined(BOOST_MSVC)
-
-template<int N>
-struct sized_type_for_promotion
-{
-    typedef char (&type)[N];
-};
-
-#define BOOST_TT_AUX_PROMOTED_INDEX_TESTER(I,T) \
-    sized_type_for_promotion<I>::type promoted_index_tester(T);
-
-#else
-
-#define BOOST_TT_AUX_PROMOTED_INDEX_TESTER(I,T) \
-    char (&promoted_index_tester(T))[I];
-
-#endif
-
-BOOST_TT_AUX_PROMOTED_INDEX_TESTER(1, int          )
-BOOST_TT_AUX_PROMOTED_INDEX_TESTER(2, unsigned int )
-BOOST_TT_AUX_PROMOTED_INDEX_TESTER(3, long         )
-BOOST_TT_AUX_PROMOTED_INDEX_TESTER(4, unsigned long)
-
-#if defined(BOOST_HAS_LONG_LONG)
-BOOST_TT_AUX_PROMOTED_INDEX_TESTER(5, boost::long_long_type )
-BOOST_TT_AUX_PROMOTED_INDEX_TESTER(6, boost::ulong_long_type)
-#elif defined(BOOST_HAS_MS_INT64)
-BOOST_TT_AUX_PROMOTED_INDEX_TESTER(7, __int64         )
-BOOST_TT_AUX_PROMOTED_INDEX_TESTER(8, unsigned __int64)
-#endif
-
-#undef BOOST_TT_AUX_PROMOTED_INDEX_TESTER
-
-
-// Get an index of promoted type for type T.
-// Precondition: need_promotion<T>
-template<class T>
-struct promoted_index
-{
-    static T testee; // undefined
-    BOOST_STATIC_CONSTANT(int, value = sizeof(promoted_index_tester(+testee)) );
-    // Unary plus promotes testee                    LOOK HERE ---> ^
-};
-
-template<class T>
-struct integral_promotion_impl
-{
-    typedef BOOST_DEDUCED_TYPENAME promote_from_index<
-        (boost::type_traits::detail::promoted_index<T>::value)
-      , (boost::is_const<T>::value)
-      , (boost::is_volatile<T>::value)
-      >::type type;
-};
-
-template<class T>
-struct integral_promotion
-  : boost::mpl::eval_if<
-        need_promotion<BOOST_DEDUCED_TYPENAME remove_cv<T>::type>
-      , integral_promotion_impl<T>
-      , boost::mpl::identity<T>
-      >
-{
-};
-
-} }
-
-BOOST_TT_AUX_TYPE_TRAIT_DEF1(
-      integral_promotion
-    , T
-    , BOOST_DEDUCED_TYPENAME
-        boost::type_traits::detail::integral_promotion<T>::type
-    )
-}
-
-#include <boost/type_traits/detail/type_trait_undef.hpp>
-
-#endif // #ifndef FILE_boost_type_traits_integral_promotion_hpp_INCLUDED
-

Modified: boost/trunk/boost/type_traits/intrinsics.hpp
===================================================================
--- boost/trunk/boost/type_traits/intrinsics.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/intrinsics.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -85,21 +85,6 @@
 #   define BOOST_HAS_TYPE_TRAITS_INTRINSICS
 #endif
 
-#if defined(__DMC__) && (__DMC__ >= 0x848)
-// For Digital Mars C++, www.digitalmars.com
-#   define BOOST_IS_UNION(T) (__typeinfo(T) & 0x400)
-#   define BOOST_IS_POD(T) (__typeinfo(T) & 0x800)
-#   define BOOST_IS_EMPTY(T) (__typeinfo(T) & 0x1000)
-#   define BOOST_HAS_TRIVIAL_CONSTRUCTOR(T) (__typeinfo(T) & 0x10)
-#   define BOOST_HAS_TRIVIAL_COPY(T) (__typeinfo(T) & 0x20)
-#   define BOOST_HAS_TRIVIAL_ASSIGN(T) (__typeinfo(T) & 0x40)
-#   define BOOST_HAS_TRIVIAL_DESTRUCTOR(T) (__typeinfo(T) & 0x8)
-#   define BOOST_HAS_NOTHROW_CONSTRUCTOR(T) (__typeinfo(T) & 0x80)
-#   define BOOST_HAS_NOTHROW_COPY(T) (__typeinfo(T) & 0x100)
-#   define BOOST_HAS_NOTHROW_ASSIGN(T) (__typeinfo(T) & 0x200)
-#   define BOOST_HAS_VIRTUAL_DESTRUCTOR(T) (__typeinfo(T) & 0x4)
-#   define BOOST_HAS_TYPE_TRAITS_INTRINSICS
-#endif
 
 #ifndef BOOST_IS_UNION
 #   define BOOST_IS_UNION(T) false
@@ -150,4 +135,3 @@
 
 
 
-

Modified: boost/trunk/boost/type_traits/is_base_and_derived.hpp
===================================================================
--- boost/trunk/boost/type_traits/is_base_and_derived.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/is_base_and_derived.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -37,7 +37,7 @@
 This version detects ambiguous base classes and private base classes
 correctly, and was devised by Rani Sharoni.
 
-Explanation by Terje Slettebø and Rani Sharoni.
+Explanation by Terje Slettebo and Rani Sharoni.
 
 Let's take the multiple base class below as an example, and the following
 will also show why there's not a problem with private or ambiguous base
@@ -220,3 +220,4 @@
 #include <boost/type_traits/detail/bool_trait_undef.hpp>
 
 #endif // BOOST_TT_IS_BASE_AND_DERIVED_HPP_INCLUDED
+

Modified: boost/trunk/boost/type_traits/is_class.hpp
===================================================================
--- boost/trunk/boost/type_traits/is_class.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/is_class.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -116,7 +116,7 @@
 
 # ifdef __EDG_VERSION__
 BOOST_TT_AUX_BOOL_TRAIT_DEF1(
-    is_class,T, detail::is_class_impl<typename remove_cv<T>::type>::value)
+    is_class,T, detail::is_class_impl<typename boost::remove_cv<T>::type>::value)
 # else 
 BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_class,T,::boost::detail::is_class_impl<T>::value)
 # endif

Modified: boost/trunk/boost/type_traits/is_convertible.hpp
===================================================================
--- boost/trunk/boost/type_traits/is_convertible.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/is_convertible.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -340,7 +340,7 @@
 template <typename From, typename To>
 struct is_convertible_impl_dispatch_base
 {
-#ifndef __HP_aCC
+#if !BOOST_WORKAROUND(__HP_aCC, < 60700)
    typedef is_convertible_impl_select< 
       ::boost::is_arithmetic<From>::value, 
       ::boost::is_arithmetic<To>::value,
@@ -413,3 +413,4 @@
 #include <boost/type_traits/detail/bool_trait_undef.hpp>
 
 #endif // BOOST_TT_IS_CONVERTIBLE_HPP_INCLUDED
+

Modified: boost/trunk/boost/type_traits/is_integral.hpp
===================================================================
--- boost/trunk/boost/type_traits/is_integral.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/is_integral.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -41,8 +41,6 @@
 BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,wchar_t,true)
 #endif
 
-// Same set of integral types as in boost/type_traits/integral_promotion.hpp.
-// Please, keep in sync. -- Alexander Nasonov
 #if (defined(BOOST_MSVC) && (BOOST_MSVC < 1300)) \
     || (defined(BOOST_INTEL_CXX_VERSION) && defined(_MSC_VER) && (BOOST_INTEL_CXX_VERSION <= 600)) \
     || (defined(__BORLANDC__) && (__BORLANDC__ == 0x600) && (_MSC_VER < 1300))

Modified: boost/trunk/boost/type_traits/msvc/remove_all_extents.hpp
===================================================================
--- boost/trunk/boost/type_traits/msvc/remove_all_extents.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/msvc/remove_all_extents.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,8 +2,8 @@
 // Use, modification and distribution is subject to the Boost Software
 // License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
 
-#ifndef BOOST_TYPE_TRAITS_MSVC_REMOVE_EXTENT_HOLT_2004_0827
-#define BOOST_TYPE_TRAITS_MSVC_REMOVE_EXTENT_HOLT_2004_0827
+#ifndef BOOST_TYPE_TRAITS_MSVC_REMOVE_ALL_EXTENT_HOLT_2004_0827
+#define BOOST_TYPE_TRAITS_MSVC_REMOVE_ALL_EXTENT_HOLT_2004_0827
 
 #include <boost/type_traits/msvc/typeof.hpp>
 #include <boost/type_traits/is_array.hpp>

Deleted: boost/trunk/boost/type_traits/promote.hpp
===================================================================
--- boost/trunk/boost/type_traits/promote.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/promote.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,40 +0,0 @@
-// Copyright 2005 Alexander Nasonov.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef FILE_boost_type_traits_promote_hpp_INCLUDED
-#define FILE_boost_type_traits_promote_hpp_INCLUDED
-
-#include <boost/config.hpp>
-#include <boost/type_traits/integral_promotion.hpp>
-#include <boost/type_traits/floating_point_promotion.hpp>
-
-// Should be the last #include
-#include <boost/type_traits/detail/type_trait_def.hpp>
-
-namespace boost {
-
-namespace detail {
-
-template<class T>
-struct promote_impl
-  : integral_promotion<
-        BOOST_DEDUCED_TYPENAME floating_point_promotion<T>::type
-      >
-{
-};
-
-}
-
-BOOST_TT_AUX_TYPE_TRAIT_DEF1(
-      promote
-    , T
-    , BOOST_DEDUCED_TYPENAME boost::detail::promote_impl<T>::type
-    )
-}
-
-#include <boost/type_traits/detail/type_trait_undef.hpp>
-
-#endif // #ifndef FILE_boost_type_traits_promote_hpp_INCLUDED
-

Modified: boost/trunk/boost/type_traits/remove_const.hpp
===================================================================
--- boost/trunk/boost/type_traits/remove_const.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/remove_const.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -58,7 +58,7 @@
 
 // * convert a type T to non-const type - remove_const<T>
 
-BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_const,T,typename detail::remove_const_impl<T>::type)
+BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_const,T,typename boost::detail::remove_const_impl<T>::type)
 BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_const,T&,T&)
 #if !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS)
 BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_const,T const[N],T type[N])
@@ -67,7 +67,7 @@
 
 #elif !BOOST_WORKAROUND(BOOST_MSVC,<=1300)
 
-BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_const,T,typename detail::remove_const_impl<T>::type)
+BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_const,T,typename boost::detail::remove_const_impl<T>::type)
 
 #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 

Modified: boost/trunk/boost/type_traits/remove_pointer.hpp
===================================================================
--- boost/trunk/boost/type_traits/remove_pointer.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/remove_pointer.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,7 +32,7 @@
 
 #elif !BOOST_WORKAROUND(BOOST_MSVC,<=1300)
 
-BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_pointer,T,typename detail::remove_pointer_impl<T>::type)
+BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_pointer,T,typename boost::detail::remove_pointer_impl<T>::type)
 
 #endif
 

Modified: boost/trunk/boost/type_traits/remove_reference.hpp
===================================================================
--- boost/trunk/boost/type_traits/remove_reference.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/remove_reference.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -39,7 +39,7 @@
 
 #elif !BOOST_WORKAROUND(BOOST_MSVC,<=1300)
 
-BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_reference,T,typename detail::remove_reference_impl<T>::type)
+BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_reference,T,typename boost::detail::remove_reference_impl<T>::type)
 
 #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 

Modified: boost/trunk/boost/type_traits/remove_volatile.hpp
===================================================================
--- boost/trunk/boost/type_traits/remove_volatile.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/remove_volatile.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -57,7 +57,7 @@
 
 // * convert a type T to a non-volatile type - remove_volatile<T>
 
-BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_volatile,T,typename detail::remove_volatile_impl<T>::type)
+BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_volatile,T,typename boost::detail::remove_volatile_impl<T>::type)
 BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_volatile,T&,T&)
 #if !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS)
 BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_volatile,T volatile[N],T type[N])
@@ -66,7 +66,7 @@
 
 #elif !BOOST_WORKAROUND(BOOST_MSVC,<=1300)
 
-BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_volatile,T,typename detail::remove_volatile_impl<T>::type)
+BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_volatile,T,typename boost::detail::remove_volatile_impl<T>::type)
 
 #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 

Modified: boost/trunk/boost/type_traits/type_with_alignment.hpp
===================================================================
--- boost/trunk/boost/type_traits/type_with_alignment.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits/type_with_alignment.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -192,11 +192,11 @@
 template <std::size_t Align>
 class type_with_alignment
 {
-    typedef detail::lower_alignment<Align> t1;
+    typedef ::boost::detail::lower_alignment<Align> t1;
     typedef typename mpl::if_c<
           ::boost::detail::is_aligned< ::boost::alignment_of<t1>::value,Align >::value
         , t1
-        , detail::max_align
+        , ::boost::detail::max_align
         >::type align_t;
 
     BOOST_STATIC_CONSTANT(std::size_t, found = alignment_of<align_t>::value);

Modified: boost/trunk/boost/type_traits.hpp
===================================================================
--- boost/trunk/boost/type_traits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/type_traits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -70,11 +70,6 @@
 #include "boost/type_traits/type_with_alignment.hpp"
 #include "boost/type_traits/function_traits.hpp"
 #include "boost/type_traits/aligned_storage.hpp"
-#include "boost/type_traits/floating_point_promotion.hpp"
-#if !(defined(__sgi) && defined(__EDG_VERSION__) && (__EDG_VERSION__ == 238))
-#include "boost/type_traits/integral_promotion.hpp"
-#include "boost/type_traits/promote.hpp"
-#endif
 
 #include "boost/type_traits/ice.hpp"
 

Deleted: boost/trunk/boost/typeof/binding_workaround.hpp
===================================================================
--- boost/trunk/boost/typeof/binding_workaround.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/binding_workaround.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,42 +0,0 @@
-#ifndef BOOST_TYPEOF_BINDING_WORKAROUND_HPP_INCLUDED
-#define BOOST_TYPEOF_BINDING_WORKAROUND_HPP_INCLUDED
-
-// workarounds related to inability to bind to const T& 
-
-/* 
-MSVC 7.1-, from inside a template,
-can't bind a function pointer to const T& 
-*/
-
-#include <boost/detail/workaround.hpp>
-
-#if BOOST_WORKAROUND(BOOST_MSVC,==1310) && defined(BOOST_TYPEOF_EMULATION)
-
-#include <boost/utility/enable_if.hpp>
-#include <boost/type_traits/is_function.hpp>
-
-namespace boost { namespace type_of {
-
-    template<class V,class T> 
-        sizer<typename encode_type<V, T*>::type> encode(T*, 
-        typename enable_if<typename is_function<T>::type>::type* = 0);
-
-}}
-
-#elif BOOST_WORKAROUND(BOOST_MSVC,<=1310) && defined(BOOST_TYPEOF_NATIVE)
-
-#include <boost/utility/enable_if.hpp>
-#include <boost/type_traits/is_function.hpp>
-
-namespace boost { namespace type_of {
-
-    template<typename T>
-        char (*encode_start(T*))[encode_type<T*>::value];
-
-}}
-
-#endif
-
-//
-
-#endif//BOOST_TYPEOF_BINDING_WORKAROUND_HPP_INCLUDED

Modified: boost/trunk/boost/typeof/encode_decode.hpp
===================================================================
--- boost/trunk/boost/typeof/encode_decode.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/encode_decode.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,33 +1,53 @@
 // Copyright (C) 2004 Arkadiy Vertleyb
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+// Distributed under the Boost Software License, Version 1.0. (See accompanying
+// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
+// boostinspect:nounnamed
+
 #ifndef BOOST_TYPEOF_ENCODE_DECODE_HPP_INCLUDED
 #define BOOST_TYPEOF_ENCODE_DECODE_HPP_INCLUDED
 
 #include <boost/mpl/deref.hpp>
 #include <boost/mpl/next.hpp>
 
- namespace { namespace boost_typeof {
+#ifndef BOOST_TYPEOF_SUPPRESS_UNNAMED_NAMESPACE
 
-    template<class V, class Type_Not_Registered_With_Typeof_System> 
-    struct encode_type_impl;
-    
-    template<class T, class Iter> 
-    struct decode_type_impl
-    {
-        typedef int type;  // MSVC ETI workaround
-    };
-}}
+#   define BOOST_TYPEOF_BEGIN_ENCODE_NS namespace { namespace boost_typeof { 
+#   define BOOST_TYPEOF_END_ENCODE_NS }}
+#   define BOOST_TYPEOF_ENCODE_NS_QUALIFIER boost_typeof
 
+#else
+
+#   define BOOST_TYPEOF_BEGIN_ENCODE_NS namespace boost { namespace type_of { 
+#   define BOOST_TYPEOF_END_ENCODE_NS }} 
+#   define BOOST_TYPEOF_ENCODE_NS_QUALIFIER boost::type_of
+
+#   define BOOST_TYPEOF_TEXT "unnamed namespace is off"
+#   include <boost/typeof/message.hpp>
+
+#endif
+
+BOOST_TYPEOF_BEGIN_ENCODE_NS
+
+template<class V, class Type_Not_Registered_With_Typeof_System> 
+struct encode_type_impl;
+
+template<class T, class Iter> 
+struct decode_type_impl
+{
+    typedef int type;  // MSVC ETI workaround
+};
+
+BOOST_TYPEOF_END_ENCODE_NS
+
 namespace boost { namespace type_of {
 
-	template<class V, class T> 
-	struct encode_type : boost_typeof::encode_type_impl<V, T>
+    template<class V, class T> 
+    struct encode_type : BOOST_TYPEOF_ENCODE_NS_QUALIFIER::encode_type_impl<V, T>
     {};
 
     template<class Iter> 
-    struct decode_type : boost_typeof::decode_type_impl<
+    struct decode_type : BOOST_TYPEOF_ENCODE_NS_QUALIFIER::decode_type_impl<
         typename Iter::type,
         typename Iter::next
     >

Modified: boost/trunk/boost/typeof/encode_decode_params.hpp
===================================================================
--- boost/trunk/boost/typeof/encode_decode_params.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/encode_decode_params.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 // Copyright (C) 2005 Arkadiy Vertleyb
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+// Distributed under the Boost Software License, Version 1.0. (See accompanying
+// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_TYPEOF_ENCODE_DECODE_PARAMS_HPP_INCLUDED
 #define BOOST_TYPEOF_ENCODE_DECODE_PARAMS_HPP_INCLUDED
@@ -11,7 +11,7 @@
 // Assumes iter0 contains initial iterator
 
 #define BOOST_TYPEOF_DECODE_PARAM(z, n, text)   \
-	typedef boost::type_of::decode_type<iter##n> decode##n;     \
+    typedef boost::type_of::decode_type<iter##n> decode##n;     \
     typedef typename decode##n::type p##n;      \
     typedef typename decode##n::iter BOOST_PP_CAT(iter, BOOST_PP_INC(n));
 
@@ -21,14 +21,14 @@
 // The P0, P1, ... PN are encoded and added to V 
 
 #define BOOST_TYPEOF_ENCODE_PARAMS_BEGIN(z, n, text)\
-	typename boost::type_of::encode_type<
+    typename boost::type_of::encode_type<
 
 #define BOOST_TYPEOF_ENCODE_PARAMS_END(z, n, text)\
     , BOOST_PP_CAT(P, n)>::type
 
 #define BOOST_TYPEOF_ENCODE_PARAMS(n, ID)                   \
     BOOST_PP_REPEAT(n, BOOST_TYPEOF_ENCODE_PARAMS_BEGIN, ~) \
-	typename boost::type_of::push_back<V, boost::mpl::size_t<ID> >::type      \
+    typename boost::type_of::push_back<V, boost::mpl::size_t<ID> >::type      \
     BOOST_PP_REPEAT(n, BOOST_TYPEOF_ENCODE_PARAMS_END, ~)
 
 #endif//BOOST_TYPEOF_ENCODE_DECODE_PARAMS_HPP_INCLUDED

Copied: boost/trunk/boost/typeof/incr_registration_group.hpp (from rev 14034, boost/branches/upstream/current/boost/typeof/incr_registration_group.hpp)

Deleted: boost/trunk/boost/typeof/increment_registration_group.hpp
===================================================================
--- boost/trunk/boost/typeof/increment_registration_group.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/increment_registration_group.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,14 +0,0 @@
-// Copyright (C) 2004, 2005 Arkadiy Vertleyb
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
-
-// Inclusion of this file increments BOOST_TYPEOF_REGISTRATION_GROUP 
-// This method was suggested by Paul Mensonides
-
-#ifdef BOOST_TYPEOF_EMULATION
-#   undef BOOST_TYPEOF_REGISTRATION_GROUP
-
-#   include <boost/preprocessor/slot/counter.hpp>
-#   include BOOST_PP_UPDATE_COUNTER()
-#   define BOOST_TYPEOF_REGISTRATION_GROUP BOOST_PP_COUNTER
-#endif

Modified: boost/trunk/boost/typeof/int_encoding.hpp
===================================================================
--- boost/trunk/boost/typeof/int_encoding.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/int_encoding.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -68,9 +68,12 @@
     {};
 
     template<class V, class T, T n>
-    struct encode_integral : encode_size_t< V, (typename get_unsigned<T>::type)n > 
+    struct encode_integral : encode_size_t< V, (typename get_unsigned<T>::type)n,(((typename get_unsigned<T>::type)n)>=0x3fffffff) > 
     {};
 
+    template<class V, bool b>
+    struct encode_integral<V, bool, b> : encode_size_t< V, b?1:0, false>
+    {};
     ///////////////////////////
 
     template<std::size_t n, class Iter, bool overflow> 

Modified: boost/trunk/boost/typeof/integral_template_param.hpp
===================================================================
--- boost/trunk/boost/typeof/integral_template_param.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/integral_template_param.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 // Copyright (C) 2005 Arkadiy Vertleyb
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+// Distributed under the Boost Software License, Version 1.0. (See accompanying
+// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_TYPEOF_INTEGRAL_TEMPLATE_PARAM_HPP_INCLUDED
 #define BOOST_TYPEOF_INTEGRAL_TEMPLATE_PARAM_HPP_INCLUDED
@@ -55,14 +55,14 @@
 // INTEGRAL_PARAM "virtual functions" implementation
 
 #define BOOST_TYPEOF_INTEGRAL_PARAM_ENCODE(This, n)\
-	typedef typename boost::type_of::encode_integral<\
+    typedef typename boost::type_of::encode_integral<\
         BOOST_PP_CAT(V, n),\
         BOOST_TYPEOF_INTEGRAL_PARAM_GETTYPE(This),\
         BOOST_PP_CAT(P, n)\
     >::type BOOST_PP_CAT(V, BOOST_PP_INC(n)); 
 
 #define BOOST_TYPEOF_INTEGRAL_PARAM_DECODE(This, n)\
-	typedef boost::type_of::decode_integral<BOOST_TYPEOF_INTEGRAL_PARAM_GETTYPE(This), BOOST_PP_CAT(iter, n)> BOOST_PP_CAT(d, n);\
+    typedef boost::type_of::decode_integral<BOOST_TYPEOF_INTEGRAL_PARAM_GETTYPE(This), BOOST_PP_CAT(iter, n)> BOOST_PP_CAT(d, n);\
     static const BOOST_TYPEOF_INTEGRAL_PARAM_GETTYPE(This) BOOST_PP_CAT(P, n) = BOOST_PP_CAT(d, n)::value;\
     typedef typename BOOST_PP_CAT(d, n)::iter BOOST_PP_CAT(iter, BOOST_PP_INC(n));
 

Modified: boost/trunk/boost/typeof/modifiers.hpp
===================================================================
--- boost/trunk/boost/typeof/modifiers.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/modifiers.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 // Copyright (C) 2004 Arkadiy Vertleyb
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+// Distributed under the Boost Software License, Version 1.0. (See accompanying
+// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_TYPEOF_MODIFIERS_HPP_INCLUDED
 #define BOOST_TYPEOF_MODIFIERS_HPP_INCLUDED
@@ -16,14 +16,14 @@
     template<class V, class T> struct encode_type_impl<V, Fun(T)>\
     {\
         typedef\
-			typename boost::type_of::encode_type<\
+            typename boost::type_of::encode_type<\
             typename boost::type_of::push_back<\
             V\
-			, boost::mpl::size_t<ID> >::type\
+            , boost::mpl::size_t<ID> >::type\
             , T>::type\
             type;\
     };\
-	template<class Iter> struct decode_type_impl<boost::mpl::size_t<ID>, Iter>\
+    template<class Iter> struct decode_type_impl<boost::mpl::size_t<ID>, Iter>\
     {\
         typedef boost::type_of::decode_type<Iter> d1;\
         typedef Fun(typename d1::type) type;\
@@ -36,15 +36,15 @@
 #define BOOST_TYPEOF_pointer_fun(T) T*
 #define BOOST_TYPEOF_reference_fun(T) T&
 
-namespace { namespace boost_typeof {
+BOOST_TYPEOF_BEGIN_ENCODE_NS
 
-    BOOST_TYPEOF_modifier_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_TYPEOF_const_fun);
-    BOOST_TYPEOF_modifier_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_TYPEOF_volatile_fun);
-    BOOST_TYPEOF_modifier_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_TYPEOF_volatile_const_fun);
-    BOOST_TYPEOF_modifier_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_TYPEOF_pointer_fun);
-    BOOST_TYPEOF_modifier_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_TYPEOF_reference_fun);
+BOOST_TYPEOF_modifier_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_TYPEOF_const_fun);
+BOOST_TYPEOF_modifier_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_TYPEOF_volatile_fun);
+BOOST_TYPEOF_modifier_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_TYPEOF_volatile_const_fun);
+BOOST_TYPEOF_modifier_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_TYPEOF_pointer_fun);
+BOOST_TYPEOF_modifier_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_TYPEOF_reference_fun);
 
-}}
+BOOST_TYPEOF_END_ENCODE_NS
 
 #undef BOOST_TYPEOF_modifier_support
 #undef BOOST_TYPEOF_const_fun
@@ -64,13 +64,13 @@
             typename boost::type_of::push_back<\
             typename boost::type_of::push_back<\
             V\
-			, boost::mpl::size_t<ID> >::type\
-			, boost::mpl::size_t<N> >::type\
+            , boost::mpl::size_t<ID> >::type\
+            , boost::mpl::size_t<N> >::type\
             , T>::type\
         type;\
     };\
     template<class Iter>\
-	struct decode_type_impl<boost::mpl::size_t<ID>, Iter>\
+    struct decode_type_impl<boost::mpl::size_t<ID>, Iter>\
     {\
         enum{n = Iter::type::value};\
         typedef boost::type_of::decode_type<typename Iter::next> d;\
@@ -78,14 +78,14 @@
         typedef typename d::iter iter;\
     }
 
-namespace { namespace boost_typeof {
+BOOST_TYPEOF_BEGIN_ENCODE_NS
 
-    BOOST_TYPEOF_array_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_PP_EMPTY);
-    BOOST_TYPEOF_array_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_PP_IDENTITY(const));
-    BOOST_TYPEOF_array_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_PP_IDENTITY(volatile));
-    BOOST_TYPEOF_array_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_PP_IDENTITY(volatile const));
+BOOST_TYPEOF_array_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_PP_EMPTY);
+BOOST_TYPEOF_array_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_PP_IDENTITY(const));
+BOOST_TYPEOF_array_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_PP_IDENTITY(volatile));
+BOOST_TYPEOF_array_support(BOOST_TYPEOF_UNIQUE_ID(), BOOST_PP_IDENTITY(volatile const));
 
-}}
+BOOST_TYPEOF_END_ENCODE_NS
 
 #undef BOOST_TYPEOF_array_support
 

Modified: boost/trunk/boost/typeof/msvc/typeof_impl.hpp
===================================================================
--- boost/trunk/boost/typeof/msvc/typeof_impl.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/msvc/typeof_impl.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,6 +11,8 @@
 # include <boost/config.hpp>
 # include <boost/detail/workaround.hpp>
 # include <boost/mpl/int.hpp>
+# include <boost/type_traits/is_function.hpp>
+# include <boost/utility/enable_if.hpp>
 
 namespace boost
 {
@@ -145,8 +147,28 @@
             BOOST_TYPEOF_NEXT_INDEX(next);     
         };
 
+        template<class T>
+        struct sizer
+        {
+            typedef char(*type)[encode_type<T>::value];
+        };
+
+# ifdef BOOST_NO_SFINAE
+
         template<typename T>
-        char (*encode_start(T const&))[encode_type<T>::value];
+            typename sizer<T>::type encode_start(T const&);
+
+# else
+
+        template<typename T> typename disable_if<
+            typename is_function<T>::type, 
+            typename sizer<T>::type>::type encode_start(T const&);
+
+        template<typename T> typename enable_if<
+            typename is_function<T>::type, 
+            typename sizer<T>::type>::type encode_start(T&);
+
+# endif
     }
 }
 

Copied: boost/trunk/boost/typeof/native.hpp (from rev 14034, boost/branches/upstream/current/boost/typeof/native.hpp)

Modified: boost/trunk/boost/typeof/pointers_data_members.hpp
===================================================================
--- boost/trunk/boost/typeof/pointers_data_members.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/pointers_data_members.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,29 +10,30 @@
 
 #include BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP()
 
-namespace { namespace boost_typeof {
+BOOST_TYPEOF_BEGIN_ENCODE_NS
 
-	enum {PTR_DATA_MEM_ID = BOOST_TYPEOF_UNIQUE_ID()};
+enum {PTR_DATA_MEM_ID = BOOST_TYPEOF_UNIQUE_ID()};
 
-    template<class V, class P0, class P1> 
-    struct encode_type_impl<V, P0 P1::*>
-    {
-        typedef BOOST_TYPEOF_ENCODE_PARAMS(2, PTR_DATA_MEM_ID) type;
+template<class V, class P0, class P1> 
+struct encode_type_impl<V, P0 P1::*>
+{
+    typedef BOOST_TYPEOF_ENCODE_PARAMS(2, PTR_DATA_MEM_ID) type;
+};
+
+template<class Iter> 
+struct decode_type_impl<boost::mpl::size_t<PTR_DATA_MEM_ID>, Iter>
+{
+    typedef Iter iter0;
+    BOOST_TYPEOF_DECODE_PARAMS(2)
+
+    template<class T> struct workaround{
+        typedef p0 T::* type;
     };
 
-    template<class Iter> 
-	struct decode_type_impl<boost::mpl::size_t<PTR_DATA_MEM_ID>, Iter>
-    {
-        typedef Iter iter0;
-        BOOST_TYPEOF_DECODE_PARAMS(2)
+    typedef typename workaround<p1>::type type;
+    typedef iter2 iter;
+};
 
-        template<class T> struct workaround{
-            typedef p0 T::* type;
-        };
+BOOST_TYPEOF_END_ENCODE_NS
 
-        typedef typename workaround<p1>::type type;
-        typedef iter2 iter;
-    };
-}}
-
 #endif//BOOST_TYPEOF_POINTERS_DATA_MEMBERS_HPP_INCLUDED

Modified: boost/trunk/boost/typeof/register_functions.hpp
===================================================================
--- boost/trunk/boost/typeof/register_functions.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/register_functions.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,11 +32,12 @@
     VOLATILE_CONST_MEM_FUN_ID       = FUN_ID + 6 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY)
 };
 
-namespace { namespace boost_typeof {
+BOOST_TYPEOF_BEGIN_ENCODE_NS
 
-    # define BOOST_PP_ITERATION_LIMITS (0, BOOST_TYPEOF_LIMIT_FUNCTION_ARITY)
-    # define BOOST_PP_FILENAME_1 <boost/typeof/register_functions_iterate.hpp>
-    # include BOOST_PP_ITERATE()
-}}
+# define BOOST_PP_ITERATION_LIMITS (0, BOOST_TYPEOF_LIMIT_FUNCTION_ARITY)
+# define BOOST_PP_FILENAME_1 <boost/typeof/register_functions_iterate.hpp>
+# include BOOST_PP_ITERATE()
 
+BOOST_TYPEOF_END_ENCODE_NS
+
 #endif//BOOST_TYPEOF_REGISTER_FUNCTIONS_HPP_INCLUDED

Modified: boost/trunk/boost/typeof/register_functions_iterate.hpp
===================================================================
--- boost/trunk/boost/typeof/register_functions_iterate.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/register_functions_iterate.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 // Copyright (C) 2004 Arkadiy Vertleyb
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+// Distributed under the Boost Software License, Version 1.0. (See accompanying
+// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/typeof/encode_decode_params.hpp>
 
@@ -26,41 +26,41 @@
 
 #ifndef BOOST_TYPEOF_NO_FUNCTION_TYPES
 
-	// function references
+    // function references
 
-	template<class V, class R BOOST_PP_ENUM_TRAILING_PARAMS(n, class P)> 
-	struct encode_type_impl<V, R(&)(BOOST_PP_ENUM_PARAMS(n, P))>
-	{
-		typedef R BOOST_PP_CAT(P, n);
-		typedef BOOST_TYPEOF_ENCODE_PARAMS(BOOST_PP_INC(n), FUN_REF_ID + n) type;
-	};
+    template<class V, class R BOOST_PP_ENUM_TRAILING_PARAMS(n, class P)> 
+    struct encode_type_impl<V, R(&)(BOOST_PP_ENUM_PARAMS(n, P))>
+    {
+        typedef R BOOST_PP_CAT(P, n);
+        typedef BOOST_TYPEOF_ENCODE_PARAMS(BOOST_PP_INC(n), FUN_REF_ID + n) type;
+    };
 
-	template<class Iter>
-	struct decode_type_impl<boost::mpl::size_t<FUN_REF_ID + n>, Iter>
-	{
-		typedef Iter iter0;
-		BOOST_TYPEOF_DECODE_PARAMS(BOOST_PP_INC(n))
-		typedef BOOST_PP_CAT(p, n)(&type)(BOOST_PP_ENUM_PARAMS(n, p));
-		typedef BOOST_PP_CAT(iter, BOOST_PP_INC(n)) iter;
-	};
+    template<class Iter>
+    struct decode_type_impl<boost::mpl::size_t<FUN_REF_ID + n>, Iter>
+    {
+        typedef Iter iter0;
+        BOOST_TYPEOF_DECODE_PARAMS(BOOST_PP_INC(n))
+        typedef BOOST_PP_CAT(p, n)(&type)(BOOST_PP_ENUM_PARAMS(n, p));
+        typedef BOOST_PP_CAT(iter, BOOST_PP_INC(n)) iter;
+    };
 
-	// functions
+    // functions
 
-	template<class V, class R BOOST_PP_ENUM_TRAILING_PARAMS(n, class P)> 
-	struct encode_type_impl<V, R(BOOST_PP_ENUM_PARAMS(n, P))>
-	{
-		typedef R BOOST_PP_CAT(P, n);
-		typedef BOOST_TYPEOF_ENCODE_PARAMS(BOOST_PP_INC(n), FUN_ID + n) type;
-	};
+    template<class V, class R BOOST_PP_ENUM_TRAILING_PARAMS(n, class P)> 
+    struct encode_type_impl<V, R(BOOST_PP_ENUM_PARAMS(n, P))>
+    {
+        typedef R BOOST_PP_CAT(P, n);
+        typedef BOOST_TYPEOF_ENCODE_PARAMS(BOOST_PP_INC(n), FUN_ID + n) type;
+    };
 
-	template<class Iter>
-	struct decode_type_impl<boost::mpl::size_t<FUN_ID + n>, Iter>
-	{
-		typedef Iter iter0;
-		BOOST_TYPEOF_DECODE_PARAMS(BOOST_PP_INC(n))
-		typedef BOOST_PP_CAT(p, n)(type)(BOOST_PP_ENUM_PARAMS(n, p));
-		typedef BOOST_PP_CAT(iter, BOOST_PP_INC(n)) iter;
-	};
+    template<class Iter>
+    struct decode_type_impl<boost::mpl::size_t<FUN_ID + n>, Iter>
+    {
+        typedef Iter iter0;
+        BOOST_TYPEOF_DECODE_PARAMS(BOOST_PP_INC(n))
+        typedef BOOST_PP_CAT(p, n)(type)(BOOST_PP_ENUM_PARAMS(n, p));
+        typedef BOOST_PP_CAT(iter, BOOST_PP_INC(n)) iter;
+    };
 
 #endif//BOOST_TYPEOF_NO_FUNCTION_TYPES
 

Modified: boost/trunk/boost/typeof/template_encoding.hpp
===================================================================
--- boost/trunk/boost/typeof/template_encoding.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/template_encoding.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright (C) 2004 Arkadiy Vertleyb
 // Copyright (C) 2005 Peder Holt
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+// Distributed under the Boost Software License, Version 1.0. (See accompanying
+// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_TYPEOF_TEMPLATE_ENCODING_HPP_INCLUDED
 #define BOOST_TYPEOF_TEMPLATE_ENCODING_HPP_INCLUDED
@@ -128,14 +128,14 @@
         BOOST_TYPEOF_TYPEDEF_DECODED_TEMPLATE_TYPE)(Name,Params)
 
 #define BOOST_TYPEOF_REGISTER_TEMPLATE_IMPL(Name, Params, Size, ID)\
-    namespace { namespace boost_typeof {\
+    BOOST_TYPEOF_BEGIN_ENCODE_NS\
     BOOST_TYPEOF_REGISTER_TEMPLATE_TEMPLATE_IMPL(Name, Params, ID)\
     template<class V\
         BOOST_TYPEOF_SEQ_ENUM_TRAILING(Params, BOOST_TYPEOF_REGISTER_TEMPLATE_PARAM_PAIR)\
     >\
     struct encode_type_impl<V, Name<BOOST_PP_ENUM_PARAMS(Size, P)> >\
     {\
-		typedef typename boost::type_of::push_back<V, boost::mpl::size_t<ID> >::type V0;\
+        typedef typename boost::type_of::push_back<V, boost::mpl::size_t<ID> >::type V0;\
         BOOST_PP_SEQ_FOR_EACH_I(BOOST_TYPEOF_REGISTER_TEMPLATE_ENCODE_PARAM, ~, Params)\
         typedef BOOST_PP_CAT(V, Size) type;\
     };\
@@ -147,6 +147,6 @@
         BOOST_TYPEOF_TYPEDEF_DECODED_TYPE(Name, Params)\
         typedef BOOST_PP_CAT(iter, Size) iter;\
     };\
-    }}
+    BOOST_TYPEOF_END_ENCODE_NS
 
 #endif//BOOST_TYPEOF_TEMPLATE_ENCODING_HPP_INCLUDED

Modified: boost/trunk/boost/typeof/template_template_param.hpp
===================================================================
--- boost/trunk/boost/typeof/template_template_param.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/template_template_param.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright (C) 2005 Peder Holt
 // Copyright (C) 2005 Arkadiy Vertleyb
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+// Distributed under the Boost Software License, Version 1.0. (See accompanying
+// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_TYPEOF_TEMPLATE_TEMPLATE_PARAM_HPP_INCLUDED
 #define BOOST_TYPEOF_TEMPLATE_TEMPLATE_PARAM_HPP_INCLUDED
@@ -51,21 +51,21 @@
 ////////////////////////////
 // move to encode_decode?
 
-namespace { namespace boost_typeof { 
+BOOST_TYPEOF_BEGIN_ENCODE_NS
 
-	template<class V, class Type_Not_Registered_With_Typeof_System> struct encode_template_impl;
-    template<class T, class Iter> struct decode_template_impl;
+template<class V, class Type_Not_Registered_With_Typeof_System> struct encode_template_impl;
+template<class T, class Iter> struct decode_template_impl;
 
-}}
+BOOST_TYPEOF_END_ENCODE_NS
 
 namespace boost { namespace type_of { 
 
-	template<class V, class T> struct encode_template
-		: boost_typeof::encode_template_impl<V, T>
+    template<class V, class T> struct encode_template
+        : BOOST_TYPEOF_ENCODE_NS_QUALIFIER::encode_template_impl<V, T>
     {};
 
     template<class Iter> struct decode_template 
-        : boost_typeof::decode_template_impl<typename Iter::type, typename Iter::next>
+        : BOOST_TYPEOF_ENCODE_NS_QUALIFIER::decode_template_impl<typename Iter::type, typename Iter::next>
     {};
 }}
 
@@ -81,10 +81,10 @@
         BOOST_PP_ENUM_PARAMS(\
         BOOST_PP_SEQ_SIZE(Params),\
         P)> >\
-		: boost::type_of::push_back<V, boost::mpl::size_t<ID> >\
+        : boost::type_of::push_back<V, boost::mpl::size_t<ID> >\
     {\
     };\
-	template<class Iter> struct decode_template_impl<boost::mpl::size_t<ID>, Iter>\
+    template<class Iter> struct decode_template_impl<boost::mpl::size_t<ID>, Iter>\
     {\
         BOOST_PP_REPEAT(BOOST_PP_SEQ_SIZE(Params),BOOST_TYPEOF_TYPEDEF_INT_PN,_)\
         typedef Name<BOOST_TYPEOF_SEQ_ENUM(Params,BOOST_TYPEOF_PLACEHOLDER) > type;\

Modified: boost/trunk/boost/typeof/type_encoding.hpp
===================================================================
--- boost/trunk/boost/typeof/type_encoding.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/type_encoding.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 // Copyright (C) 2004 Arkadiy Vertleyb
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+// Distributed under the Boost Software License, Version 1.0. (See accompanying
+// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_TYPEOF_TYPE_ENCODING_HPP_INCLUDED
 #define BOOST_TYPEOF_TYPE_ENCODING_HPP_INCLUDED
@@ -8,18 +8,18 @@
 #define BOOST_TYPEOF_REGISTER_TYPE_IMPL(T, Id)                          \
                                                                         \
     template<class V> struct encode_type_impl<V, T >                    \
-		: boost::type_of::push_back<V, boost::mpl::size_t<Id> >                   \
+        : boost::type_of::push_back<V, boost::mpl::size_t<Id> >         \
     {};                                                                 \
-	template<class Iter> struct decode_type_impl<boost::mpl::size_t<Id>, Iter> \
+    template<class Iter> struct decode_type_impl<boost::mpl::size_t<Id>, Iter> \
     {                                                                   \
         typedef T type;                                                 \
         typedef Iter iter;                                              \
     };
 
 #define BOOST_TYPEOF_REGISTER_TYPE_EXPLICIT_ID(Type, Id)                \
-	namespace { namespace boost_typeof {					\
-        BOOST_TYPEOF_REGISTER_TYPE_IMPL(Type, Id)                       \
-    }}
+    BOOST_TYPEOF_BEGIN_ENCODE_NS                                        \
+    BOOST_TYPEOF_REGISTER_TYPE_IMPL(Type, Id)                           \
+    BOOST_TYPEOF_END_ENCODE_NS
 
 #define BOOST_TYPEOF_REGISTER_TYPE(Type)                                \
     BOOST_TYPEOF_REGISTER_TYPE_EXPLICIT_ID(Type, BOOST_TYPEOF_UNIQUE_ID())

Modified: boost/trunk/boost/typeof/type_template_param.hpp
===================================================================
--- boost/trunk/boost/typeof/type_template_param.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/type_template_param.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 // Copyright (C) 2005 Arkadiy Vertleyb
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+// Distributed under the Boost Software License, Version 1.0. (See accompanying
+// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_TYPEOF_TYPE_TEMPLATE_PARAM_HPP_INCLUDED
 #define BOOST_TYPEOF_TYPE_TEMPLATE_PARAM_HPP_INCLUDED
@@ -19,13 +19,13 @@
 // TYPE_PARAM "virtual functions" implementation
 
 #define BOOST_TYPEOF_TYPE_PARAM_ENCODE(This, n)\
-	typedef typename boost::type_of::encode_type<\
+    typedef typename boost::type_of::encode_type<\
         BOOST_PP_CAT(V, n),\
         BOOST_PP_CAT(P, n)\
     >::type BOOST_PP_CAT(V, BOOST_PP_INC(n)); 
 
 #define BOOST_TYPEOF_TYPE_PARAM_DECODE(This, n)\
-	typedef boost::type_of::decode_type< BOOST_PP_CAT(iter, n) > BOOST_PP_CAT(d, n);\
+    typedef boost::type_of::decode_type< BOOST_PP_CAT(iter, n) > BOOST_PP_CAT(d, n);\
     typedef typename BOOST_PP_CAT(d, n)::type BOOST_PP_CAT(P, n);\
     typedef typename BOOST_PP_CAT(d, n)::iter BOOST_PP_CAT(iter, BOOST_PP_INC(n));
 

Modified: boost/trunk/boost/typeof/typeof.hpp
===================================================================
--- boost/trunk/boost/typeof/typeof.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/typeof.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 // Copyright (C) 2004 Arkadiy Vertleyb
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+// Distributed under the Boost Software License, Version 1.0. (See accompanying
+// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_TYPEOF_TYPEOF_HPP_INCLUDED
 #define BOOST_TYPEOF_TYPEOF_HPP_INCLUDED
@@ -122,10 +122,11 @@
      BOOST_TYPEOF_REGISTRATION_GROUP * 0x10000 + __LINE__
 
 #define BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP()\
-     <boost/typeof/increment_registration_group.hpp>
+     <boost/typeof/incr_registration_group.hpp>
 
 #ifdef BOOST_TYPEOF_EMULATION
 #   define BOOST_TYPEOF_TEXT "using typeof emulation"
+#   include <boost/typeof/message.hpp>
 #   include <boost/typeof/typeof_impl.hpp>
 #   include <boost/typeof/type_encoding.hpp>
 #   include <boost/typeof/template_encoding.hpp>
@@ -136,32 +137,12 @@
 
 #elif defined(BOOST_TYPEOF_NATIVE)
 #   define BOOST_TYPEOF_TEXT "using native typeof"
-#   ifndef MSVC_TYPEOF_HACK
-
-        namespace boost { namespace type_of {
-            template<class T> T& ensure_obj(const T&);
-        }}
-
-#       define BOOST_TYPEOF(expr) BOOST_TYPEOF_KEYWORD(boost::type_of::ensure_obj(expr))
-#       define BOOST_TYPEOF_TPL BOOST_TYPEOF
-#       define BOOST_TYPEOF_NESTED_TYPEDEF_TPL(name,expr) \
-        struct name {\
-            typedef BOOST_TYPEOF_TPL(expr) type;\
-        };
-#       define BOOST_TYPEOF_NESTED_TYPEDEF(name,expr) \
-        struct name {\
-            typedef BOOST_TYPEOF(expr) type;\
-        };
-#   endif
-#   define BOOST_TYPEOF_REGISTER_TYPE(x)
-#   define BOOST_TYPEOF_REGISTER_TEMPLATE(x, params)
+#   include <boost/typeof/message.hpp>
+#   include <boost/typeof/native.hpp>
 #else
 #   error typeof configuration error
 #endif
 
-#include <boost/typeof/message.hpp>
-#include <boost/typeof/binding_workaround.hpp>
-
 // auto
 #define BOOST_AUTO(Var, Expr) BOOST_TYPEOF(Expr) Var = Expr
 #define BOOST_AUTO_TPL(Var, Expr) BOOST_TYPEOF_TPL(Expr) Var = Expr

Modified: boost/trunk/boost/typeof/typeof_impl.hpp
===================================================================
--- boost/trunk/boost/typeof/typeof_impl.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/typeof/typeof_impl.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 // Copyright (C) 2004, 2005 Arkadiy Vertleyb
 // Copyright (C) 2005 Peder Holt
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+// Distributed under the Boost Software License, Version 1.0. (See accompanying
+// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #ifndef BOOST_TYPEOF_TYPEOF_IMPL_HPP_INCLUDED
 #define BOOST_TYPEOF_TYPEOF_IMPL_HPP_INCLUDED
@@ -10,6 +10,8 @@
 #include <boost/preprocessor/repetition/enum.hpp>
 #include <boost/typeof/encode_decode.hpp>
 #include <boost/typeof/vector.hpp>
+#include <boost/type_traits/is_function.hpp>
+#include <boost/utility/enable_if.hpp>
 
 #define BOOST_TYPEOF_VECTOR(n) BOOST_PP_CAT(boost::type_of::vector, n)
 
@@ -26,13 +28,28 @@
 
         BOOST_PP_REPEAT(BOOST_TYPEOF_LIMIT_SIZE, BOOST_TYPEOF_sizer_item, ~)
     };
-
-    template<class V,class T> 
-    sizer<typename encode_type<V, T>::type> encode(const T&);
 }}
 
 #undef BOOST_TYPEOF_sizer_item
 
+//
+namespace boost { namespace type_of {   
+# ifdef BOOST_NO_SFINAE
+    template<class V, class T> 
+    sizer<typename encode_type<V, T>::type> encode(const T&);
+# else
+    template<class V, class T> 
+    typename enable_if<
+        typename is_function<T>::type,
+        sizer<typename encode_type<V, T>::type> >::type encode(T&);
+
+    template<class V, class T> 
+    typename disable_if<
+        typename is_function<T>::type,
+        sizer<typename encode_type<V, T>::type> >::type encode(const T&);
+# endif
+}}
+//
 namespace boost { namespace type_of {
 
     template<class V>
@@ -77,6 +94,18 @@
     BOOST_STATIC_CONSTANT(int,BOOST_PP_CAT(value,n) = sizeof(boost::type_of::encode<_typeof_start_vector>(expr).item ## n));\
     typedef boost::mpl::size_t<BOOST_PP_CAT(value,n)> BOOST_PP_CAT(item,n);
 
+#ifdef __DMC__
+#define BOOST_TYPEOF_NESTED_TYPEITEM_2(z,n,expr)\
+    typedef typename _typeof_encode_fraction<iteration>::BOOST_PP_CAT(item,n) BOOST_PP_CAT(item,n);
+
+#define BOOST_TYPEOF_FRACTIONTYPE()\
+    BOOST_PP_REPEAT(BOOST_TYPEOF_LIMIT_SIZE,BOOST_TYPEOF_NESTED_TYPEITEM_2,_)\
+    typedef _typeof_fraction_iter<Pos> fraction_type;
+#else
+#define BOOST_TYPEOF_FRACTIONTYPE()\
+    typedef _typeof_encode_fraction<iteration> fraction_type;
+#endif
+
 #define BOOST_TYPEOF_NESTED_TYPEDEF_IMPL(expr) \
         template<int _Typeof_Iteration>\
         struct _typeof_encode_fraction {\
@@ -89,10 +118,24 @@
             BOOST_STATIC_CONSTANT(int,pos=(Pos::value));\
             BOOST_STATIC_CONSTANT(int,iteration=(pos/BOOST_TYPEOF_LIMIT_SIZE));\
             BOOST_STATIC_CONSTANT(int,where=pos%BOOST_TYPEOF_LIMIT_SIZE);\
-            typedef typename boost::type_of::v_iter<_typeof_encode_fraction<iteration>,boost::mpl::int_<where> >::type type;\
+            BOOST_TYPEOF_FRACTIONTYPE();\
+            typedef typename boost::type_of::v_iter<fraction_type,boost::mpl::int_<where> >::type type;\
             typedef _typeof_fraction_iter<typename Pos::next> next;\
         };
 
+#ifdef __MWERKS__
+
+# define BOOST_TYPEOF_NESTED_TYPEDEF(name,expr) \
+template<typename T>\
+struct BOOST_PP_CAT(_typeof_template_,name) {\
+    BOOST_TYPEOF_NESTED_TYPEDEF_IMPL(expr)\
+    typedef typename boost::type_of::decode_type<_typeof_fraction_iter<boost::mpl::size_t<0> > >::type type;\
+};\
+typedef BOOST_PP_CAT(_typeof_template_,name)<int> name;
+
+# define BOOST_TYPEOF_NESTED_TYPEDEF_TPL(name,expr) BOOST_TYPEOF_NESTED_TYPEDEF(name,expr);
+
+#else
 # define BOOST_TYPEOF_NESTED_TYPEDEF_TPL(name,expr) \
     struct name {\
         BOOST_TYPEOF_NESTED_TYPEDEF_IMPL(expr)\
@@ -104,5 +147,6 @@
         BOOST_TYPEOF_NESTED_TYPEDEF_IMPL(expr)\
         typedef boost::type_of::decode_type<_typeof_fraction_iter<boost::mpl::size_t<0> > >::type type;\
     };
+#endif
 
 #endif//BOOST_TYPEOF_COMPLIANT_TYPEOF_IMPL_HPP_INCLUDED

Modified: boost/trunk/boost/utility/detail/result_of_iterate.hpp
===================================================================
--- boost/trunk/boost/utility/detail/result_of_iterate.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/utility/detail/result_of_iterate.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,21 +21,21 @@
 template<typename F BOOST_PP_COMMA_IF(BOOST_PP_ITERATION())
          BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),typename T)>
 struct result_of<F(BOOST_RESULT_OF_ARGS)>
-    : detail::result_of_impl<F, F(BOOST_RESULT_OF_ARGS)> {};
+    : detail::result_of<F, F(BOOST_RESULT_OF_ARGS)> {};
 #endif
 
 namespace detail {
 
 template<typename R,  typename FArgs BOOST_PP_COMMA_IF(BOOST_PP_ITERATION())
          BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),typename T)>
-struct result_of_impl<R (*)(BOOST_RESULT_OF_ARGS), FArgs>
+struct result_of<R (*)(BOOST_RESULT_OF_ARGS), FArgs>
 {
   typedef R type;
 };
 
 template<typename R,  typename FArgs BOOST_PP_COMMA_IF(BOOST_PP_ITERATION())
          BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),typename T)>
-struct result_of_impl<R (&)(BOOST_RESULT_OF_ARGS), FArgs>
+struct result_of<R (&)(BOOST_RESULT_OF_ARGS), FArgs>
 {
   typedef R type;
 };
@@ -45,7 +45,7 @@
 #if BOOST_PP_ITERATION() > 1 && !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x551))
 template<typename R, typename FArgs BOOST_PP_COMMA_IF(BOOST_PP_ITERATION())
          BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),typename T)>
-struct result_of_impl<R (T0::*)
+struct result_of<R (T0::*)
                      (BOOST_PP_ENUM_SHIFTED_PARAMS(BOOST_PP_ITERATION(),T)),
                  FArgs>
 {
@@ -54,7 +54,7 @@
 
 template<typename R, typename FArgs BOOST_PP_COMMA_IF(BOOST_PP_ITERATION())
          BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),typename T)>
-struct result_of_impl<R (T0::*)
+struct result_of<R (T0::*)
                      (BOOST_PP_ENUM_SHIFTED_PARAMS(BOOST_PP_ITERATION(),T))
                      const,
                  FArgs>
@@ -64,7 +64,7 @@
 
 template<typename R, typename FArgs BOOST_PP_COMMA_IF(BOOST_PP_ITERATION())
          BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),typename T)>
-struct result_of_impl<R (T0::*)
+struct result_of<R (T0::*)
                      (BOOST_PP_ENUM_SHIFTED_PARAMS(BOOST_PP_ITERATION(),T))
                      volatile,
                  FArgs>
@@ -74,7 +74,7 @@
 
 template<typename R, typename FArgs BOOST_PP_COMMA_IF(BOOST_PP_ITERATION())
          BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(),typename T)>
-struct result_of_impl<R (T0::*)
+struct result_of<R (T0::*)
                      (BOOST_PP_ENUM_SHIFTED_PARAMS(BOOST_PP_ITERATION(),T))
                      const volatile,
                  FArgs>

Modified: boost/trunk/boost/utility/result_of.hpp
===================================================================
--- boost/trunk/boost/utility/result_of.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/utility/result_of.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -39,8 +39,9 @@
 
 template<typename F, typename FArgs>
 struct get_result_of<F, FArgs, false>
-  : F::template result<FArgs>
-{};
+{
+  typedef typename F::template result<FArgs>::type type;
+};
 
 template<typename F>
 struct get_result_of<F, F(void), false>
@@ -49,7 +50,7 @@
 };
 
 template<typename F, typename FArgs>
-struct result_of_impl : get_result_of<F, FArgs, (has_result_type<F>::value)> {};
+struct result_of : get_result_of<F, FArgs, (has_result_type<F>::value)> {};
 
 } // end namespace detail
 

Modified: boost/trunk/boost/utility/value_init.hpp
===================================================================
--- boost/trunk/boost/utility/value_init.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/utility/value_init.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,4 @@
-// (C) 2002, Fernando Luis Cacciola Carballal.
+// Copyright 2002, Fernando Luis Cacciola Carballal.
 //
 // Distributed under the Boost Software License, Version 1.0. (See
 // accompanying file LICENSE_1_0.txt or copy at
@@ -40,7 +40,7 @@
 struct select_base
 {
   typedef typename
-    detail::if_true< ::boost::is_const<T>::value >
+    boost::detail::if_true< ::boost::is_const<T>::value >
       ::template then< const_T_base<T>, non_const_T_base<T> >::type type ;
 } ;
 

Modified: boost/trunk/boost/wave/cpp_context.hpp
===================================================================
--- boost/trunk/boost/wave/cpp_context.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpp_context.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -69,10 +69,6 @@
 //                      defaults to the
 //                          context_policies::default_preprocessing_hooks
 //                      type.
-//      WhitespaceT     The is the whitespace handling policy. This template 
-//                      parameter is optional and defaults to the
-//                          context_policies::eat_whitespace<token_type>
-//                      type.
 //
 ///////////////////////////////////////////////////////////////////////////////
 
@@ -140,7 +136,11 @@
         macros.init_predefined_macros(fname);
         includes.init_initial_path();
     }
-
+    
+// default copy constructor
+// default assignment operator
+// default destructor
+    
 // iterator interface
     iterator_type begin() 
     { 
@@ -153,19 +153,19 @@
         }
         return iterator_type(*this, first, last, position_type(fname.c_str())); 
     }
-	  iterator_type begin(
-		  target_iterator_type const &first_, 
-		  target_iterator_type const &last_) 
-	  { 
-		    std::string fname(filename);
-		    if (filename != "<Unknown>" && filename != "<stdin>") {
-			      using namespace boost::filesystem;
-			      path fpath(complete(path(filename)));
-			      fname = fpath.string();
-			      includes.set_current_directory(fname.c_str());
-		    }
-		    return iterator_type(*this, first_, last_, position_type(fname.c_str())); 
-	  }
+    iterator_type begin(
+        target_iterator_type const &first_, 
+        target_iterator_type const &last_) 
+    { 
+        std::string fname(filename);
+        if (filename != "<Unknown>" && filename != "<stdin>") {
+            using namespace boost::filesystem;
+            path fpath(complete(path(filename)));
+            fname = fpath.string();
+            includes.set_current_directory(fname.c_str());
+        }
+        return iterator_type(*this, first_, last_, position_type(fname.c_str())); 
+    }
     iterator_type end() const 
         { return iterator_type(); }
 
@@ -292,19 +292,19 @@
 //
 ///////////////////////////////////////////////////////////////////////////////
     template <typename IteratorT2>
-    token_type expand_tokensequence(IteratorT2 &first, IteratorT2 const &last, 
+    token_type expand_tokensequence(IteratorT2 &first_, IteratorT2 const &last_, 
         token_sequence_type &pending, token_sequence_type &expanded, 
         bool expand_undefined = false)
     {
-        return macros.expand_tokensequence(first, last, pending, expanded, 
+        return macros.expand_tokensequence(first_, last_, pending, expanded, 
             expand_undefined);
     }
 
     template <typename IteratorT2>
-    void expand_whole_tokensequence(IteratorT2 &first, IteratorT2 const &last, 
+    void expand_whole_tokensequence(IteratorT2 &first_, IteratorT2 const &last_, 
         token_sequence_type &expanded, bool expand_undefined = true)
     {
-        macros.expand_whole_tokensequence(expanded, first, last, 
+        macros.expand_whole_tokensequence(expanded, first_, last_, 
             expand_undefined);
 
     // remove any contained placeholder
@@ -321,13 +321,21 @@
         { return current_filename; }
 
 // maintain the list of known headers containing #pragma once 
-    bool has_pragma_once(std::string const &filename)
-        { return includes.has_pragma_once(filename); }
-    bool add_pragma_once_header(std::string const &filename,
+    bool has_pragma_once(std::string const &filename_)
+        { return includes.has_pragma_once(filename_); }
+    bool add_pragma_once_header(std::string const &filename_,
             std::string const& guard_name = "__BOOST_WAVE_PRAGMA_ONCE__")
-        { return includes.add_pragma_once_header(filename, guard_name); }
+        { return includes.add_pragma_once_header(filename_, guard_name); }
 #endif 
 
+// forwarding functions for the context policy hooks    
+    template <typename ContainerT>
+    bool interpret_pragma(ContainerT &pending, token_type const &option, 
+        ContainerT const &values, token_type const &act_token)
+    {
+        return hooks.interpret_pragma(*this, pending, option, values, act_token);
+    }
+    
 #if BOOST_WAVE_SERIALIZATION != 0
 public:
     BOOST_STATIC_CONSTANT(unsigned int, version = 0x10);

Modified: boost/trunk/boost/wave/cpp_exceptions.hpp
===================================================================
--- boost/trunk/boost/wave/cpp_exceptions.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpp_exceptions.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -13,12 +13,13 @@
 
 #include <exception>
 #include <string>
+#include <limits>
 
 #include <boost/assert.hpp>
 #include <boost/config.hpp>
 #include <boost/throw_exception.hpp>
-
 #include <boost/wave/wave_config.hpp>
+#include <boost/wave/cpp_throw.hpp>
 
 // this must occur after all of the includes and before any code appears
 #ifdef BOOST_HAS_ABI_HEADERS
@@ -26,78 +27,6 @@
 #endif
 
 ///////////////////////////////////////////////////////////////////////////////
-// helper macro for throwing exceptions
-#if !defined(BOOST_WAVE_THROW)
-#ifdef BOOST_NO_STRINGSTREAM
-#include <strstream>
-#define BOOST_WAVE_THROW(cls, code, msg, act_pos)                             \
-    {                                                                         \
-        using namespace boost::wave;                                          \
-        std::strstream stream;                                                \
-            stream << cls::severity_text(cls::code) << ": "                   \
-            << cls::error_text(cls::code);                                    \
-        if ((msg)[0] != 0) stream << ": " << (msg);                           \
-        stream << std::ends;                                                  \
-        std::string throwmsg = stream.str(); stream.freeze(false);            \
-        boost::throw_exception(cls(throwmsg.c_str(), cls::code,               \
-            (act_pos).get_line(), (act_pos).get_column(),                     \
-            (act_pos).get_file().c_str()));                                   \
-    }                                                                         \
-    /**/
-#else
-#include <sstream>
-#define BOOST_WAVE_THROW(cls, code, msg, act_pos)                             \
-    {                                                                         \
-        using namespace boost::wave;                                          \
-        std::stringstream stream;                                             \
-            stream << cls::severity_text(cls::code) << ": "                   \
-            << cls::error_text(cls::code);                                    \
-        if ((msg)[0] != 0) stream << ": " << (msg);                           \
-        stream << std::ends;                                                  \
-        boost::throw_exception(cls(stream.str().c_str(), cls::code,           \
-            (act_pos).get_line(), (act_pos).get_column(),                     \
-            (act_pos).get_file().c_str()));                                   \
-    }                                                                         \
-    /**/
-#endif // BOOST_NO_STRINGSTREAM
-#endif // BOOST_WAVE_THROW
-
-#if !defined(BOOST_WAVE_THROW_NAME)
-#ifdef BOOST_NO_STRINGSTREAM
-#include <strstream>
-#define BOOST_WAVE_THROW_NAME(cls, code, msg, act_pos, name)                  \
-    {                                                                         \
-        using namespace boost::wave;                                          \
-        std::strstream stream;                                                \
-            stream << cls::severity_text(cls::code) << ": "                   \
-            << cls::error_text(cls::code);                                    \
-        if ((msg)[0] != 0) stream << ": " << (msg);                           \
-        stream << std::ends;                                                  \
-        std::string throwmsg = stream.str(); stream.freeze(false);            \
-        boost::throw_exception(cls(throwmsg.c_str(), cls::code,               \
-            (act_pos).get_line(), (act_pos).get_column(),                     \
-            (act_pos).get_file().c_str(), (name)));                           \
-    }                                                                         \
-    /**/
-#else
-#include <sstream>
-#define BOOST_WAVE_THROW_NAME(cls, code, msg, act_pos, name)                  \
-    {                                                                         \
-        using namespace boost::wave;                                          \
-        std::stringstream stream;                                             \
-            stream << cls::severity_text(cls::code) << ": "                   \
-            << cls::error_text(cls::code);                                    \
-        if ((msg)[0] != 0) stream << ": " << (msg);                           \
-        stream << std::ends;                                                  \
-        boost::throw_exception(cls(stream.str().c_str(), cls::code,           \
-            (act_pos).get_line(), (act_pos).get_column(),                     \
-            (act_pos).get_file().c_str(), (name)));                           \
-    }                                                                         \
-    /**/
-#endif // BOOST_NO_STRINGSTREAM
-#endif // BOOST_WAVE_THROW
-
-///////////////////////////////////////////////////////////////////////////////
 namespace boost {
 namespace wave {
 
@@ -119,10 +48,10 @@
     {
         static char const *severity_text[] = 
         {
-            "remark",           // severity_remark
-            "warning",          // severity_warning
-            "error",            // severity_error
-            "fatal error",      // severity_fatal
+            "remark",               // severity_remark
+            "warning",              // severity_warning
+            "error",                // severity_error
+            "fatal error",          // severity_fatal
             "command line error"    // severity_commandline_error
         };
         BOOST_ASSERT(severity_remark <= level && 
@@ -171,7 +100,8 @@
 {
 public:
     enum error_code {
-        unexpected_error = 0,
+        no_error = 0,
+        unexpected_error,
         macro_redefinition,
         macro_insertion_error,
         bad_include_file,
@@ -184,11 +114,14 @@
         missing_matching_endif,
         ill_formed_operator,
         bad_define_statement,
+        bad_define_statement_va_args,
         too_few_macroarguments,
         too_many_macroarguments,
         empty_macroarguments,
         improperly_terminated_macro,
         bad_line_statement,
+        bad_line_number,
+        bad_line_filename,
         bad_undefine_statement,
         bad_macro_definition,
         illegal_redefinition,
@@ -253,6 +186,7 @@
         switch (get_errorcode()) {
         // these are the exceptions thrown during processing not supposed to 
         // produce any tokens on the context::iterator level
+        case preprocess_exception::no_error:        // just a placeholder
         case preprocess_exception::macro_redefinition:
         case preprocess_exception::macro_insertion_error:
         case preprocess_exception::bad_macro_definition:
@@ -269,7 +203,10 @@
         case preprocess_exception::missing_matching_endif:
         case preprocess_exception::unbalanced_if_endif:
         case preprocess_exception::bad_define_statement:
+        case preprocess_exception::bad_define_statement_va_args:
         case preprocess_exception::bad_line_statement:
+        case preprocess_exception::bad_line_number:
+        case preprocess_exception::bad_line_filename:
         case preprocess_exception::bad_undefine_statement:
         case preprocess_exception::division_by_zero:
         case preprocess_exception::integer_overflow:
@@ -303,6 +240,7 @@
     // error texts in this array must appear in the same order as the items in
     // the error enum above
         static char const *preprocess_exception_errors[] = {
+            "no error",                                 // no_error
             "unexpected error (should not happen)",     // unexpected_error
             "illegal macro redefinition",               // macro_redefinition
             "macro definition failed (out of memory?)", // macro_insertion_error
@@ -316,6 +254,8 @@
             "detected at least one missing #endif directive",   // missing_matching_endif
             "ill formed preprocessing operator",        // ill_formed_operator
             "ill formed #define directive",             // bad_define_statement
+            "__VA_ARGS__ can only appear in the "
+            "expansion of a C99 variadic macro",        // bad_define_statement_va_args
             "too few macro arguments",                  // too_few_macroarguments
             "too many macro arguments",                 // too_many_macroarguments
             "empty macro arguments are not supported in pure C++ mode, "
@@ -324,9 +264,14 @@
             "or replacement-list terminates in partial "
             "macro expansion (not supported yet)",      // improperly_terminated_macro
             "ill formed #line directive",               // bad_line_statement
+            "line number argument of #line directive "
+            "should consist out of decimal digits "
+            "only and must be in range of [1..INT_MAX]", // bad_line_number
+            "filename argument of #line directive should "
+            "be a narrow string literal",               // bad_line_filename
             "#undef may not be used on this predefined name",   // bad_undefine_statement
             "invalid macro definition",                 // bad_macro_definition
-            "this predefined name may not be redefined",    // illegal_redefinition
+            "this predefined name may not be redefined",        // illegal_redefinition
             "duplicate macro parameter name",           // duplicate_parameter_name
             "pasting the following two tokens does not "
             "give a valid preprocessing token",         // invalid_concat
@@ -341,24 +286,25 @@
             "qualified names are supported in C++0x mode only",  // unexpected_qualified_name
             "division by zero in preprocessor expression",       // division_by_zero
             "integer overflow in preprocessor expression",       // integer_overflow
-            "this macro name cannot be used as a as it is an operator in C++",  // illegal_operator_redefinition
+            "this cannot be used as a macro name as it is "
+            "an operator in C++",                       // illegal_operator_redefinition
             "ill formed integer literal or integer constant too large",   // ill_formed_integer_literal
             "ill formed character literal",             // ill_formed_character_literal
             "unbalanced #if/#endif in include file",    // unbalanced_if_endif
-            "character literal out of range",           // character_literal_out_of_range
+            "expression contains out of range character literal", // character_literal_out_of_range
             "could not open output file",               // could_not_open_output_file
             "incompatible state information",           // incompatible_config
             "illformed pragma message",                 // ill_formed_pragma_message
             "encountered #pragma message directive"     // pragma_message_directive
         };
-        BOOST_ASSERT(unexpected_error <= code && 
-            code <= last_error_number);
+        BOOST_ASSERT(no_error <= code && code <= last_error_number);
         return preprocess_exception_errors[code];
     }
 
     static util::severity severity_level(int code)
     {
         static util::severity preprocess_exception_severity[] = {
+            util::severity_remark,             // no_error
             util::severity_fatal,              // unexpected_error
             util::severity_warning,            // macro_redefinition
             util::severity_fatal,              // macro_insertion_error
@@ -372,11 +318,14 @@
             util::severity_error,              // missing_matching_endif
             util::severity_error,              // ill_formed_operator
             util::severity_error,              // bad_define_statement
+            util::severity_error,              // bad_define_statement_va_args
             util::severity_warning,            // too_few_macroarguments
             util::severity_warning,            // too_many_macroarguments
             util::severity_warning,            // empty_macroarguments
             util::severity_error,              // improperly_terminated_macro
             util::severity_warning,            // bad_line_statement
+            util::severity_warning,            // bad_line_number
+            util::severity_warning,            // bad_line_filename
             util::severity_warning,            // bad_undefine_statement
             util::severity_commandline_error,  // bad_macro_definition
             util::severity_warning,            // illegal_redefinition
@@ -402,8 +351,7 @@
             util::severity_warning,            // ill_formed_pragma_message
             util::severity_remark,             // pragma_message_directive
         };
-        BOOST_ASSERT(unexpected_error <= code && 
-            code <= last_error_number);
+        BOOST_ASSERT(no_error <= code && code <= last_error_number);
         return preprocess_exception_severity[code];
     }
     static char const *severity_text(int code)

Modified: boost/trunk/boost/wave/cpp_iteration_context.hpp
===================================================================
--- boost/trunk/boost/wave/cpp_iteration_context.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpp_iteration_context.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Copied: boost/trunk/boost/wave/cpp_throw.hpp (from rev 14034, boost/branches/upstream/current/boost/wave/cpp_throw.hpp)

Modified: boost/trunk/boost/wave/cpplexer/convert_trigraphs.hpp
===================================================================
--- boost/trunk/boost/wave/cpplexer/convert_trigraphs.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpplexer/convert_trigraphs.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/cpplexer/cpp_lex_interface.hpp
===================================================================
--- boost/trunk/boost/wave/cpplexer/cpp_lex_interface.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpplexer/cpp_lex_interface.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/cpplexer/cpp_lex_iterator.hpp
===================================================================
--- boost/trunk/boost/wave/cpplexer/cpp_lex_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpplexer/cpp_lex_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -53,14 +53,15 @@
 template <typename TokenT> 
 class lex_iterator_functor_shim 
 {
+    typedef typename TokenT::position_type  position_type;
+
 public:
     template <typename IteratorT>
     lex_iterator_functor_shim(IteratorT const &first, IteratorT const &last, 
-            typename TokenT::position_type const &pos, 
-            boost::wave::language_support language)
+            position_type const &pos, boost::wave::language_support language)
     :   functor_ptr(lex_input_interface<TokenT>
             ::new_lexer(first, last, pos, language)) 
-#if 0 != __DECCXX_VER
+#if 0 != __DECCXX_VER || BOOST_INTEL_CXX_VERSION >= 900
       , eof()
 #endif // 0 != __DECCXX_VER
     {}
@@ -75,7 +76,7 @@
         BOOST_ASSERT(0 != functor_ptr.get());
         return functor_ptr->get(); 
     }
-    void set_position(typename TokenT::position_type const &pos)
+    void set_position(position_type const &pos)
     {
         BOOST_ASSERT(0 != functor_ptr.get());
         functor_ptr->set_position(pos);

Modified: boost/trunk/boost/wave/cpplexer/cpp_lex_token.hpp
===================================================================
--- boost/trunk/boost/wave/cpplexer/cpp_lex_token.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpplexer/cpp_lex_token.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/cpplexer/cpplexer_exceptions.hpp
===================================================================
--- boost/trunk/boost/wave/cpplexer/cpplexer_exceptions.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpplexer/cpplexer_exceptions.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -109,7 +109,10 @@
     
     virtual char const *what() const throw() = 0;   // to be overloaded
     virtual char const *description() const throw() = 0;
-    
+    virtual int get_errorcode() const throw() = 0;
+    virtual int get_severity() const throw() = 0;
+    virtual bool is_recoverable() const throw() = 0;
+
     int line_no() const throw() { return line; }
     int column_no() const throw() { return column; }
     char const *file_name() const throw() { return filename; }
@@ -155,14 +158,29 @@
     {
         return buffer;
     }
-    util::severity get_severity() const
+    virtual int get_severity() const throw()
     {
         return level;
     }
-    int get_errorcode() const
+    virtual int get_errorcode() const throw()
     {
         return code;
     }
+    virtual bool is_recoverable() const throw()
+    {
+        switch (get_errorcode()) {
+        case lexing_exception::universal_char_invalid:
+        case lexing_exception::universal_char_base_charset:
+        case lexing_exception::universal_char_not_allowed:
+        case lexing_exception::invalid_long_long_literal:
+            return true;    // for now allow all exceptions to be recoverable
+            
+        case lexing_exception::unexpected_error:
+        default:
+            break;
+        }
+        return false;
+    }
     
     static char const *error_text(int code)
     {
@@ -205,6 +223,21 @@
 };
 
 ///////////////////////////////////////////////////////////////////////////////
+//
+//  The is_recoverable() function allows to decide, whether it is possible 
+//  simply to continue after a given exception was thrown by Wave.
+//
+//  This is kind of a hack to allow to recover from certain errors as long as 
+//  Wave doesn't provide better means of error recovery.
+//
+///////////////////////////////////////////////////////////////////////////////
+inline bool
+is_recoverable(lexing_exception const& e)
+{
+    return e.is_recoverable();
+}
+
+///////////////////////////////////////////////////////////////////////////////
 }   // namespace cpplexer
 }   // namespace wave
 }   // namespace boost 

Modified: boost/trunk/boost/wave/cpplexer/detect_include_guards.hpp
===================================================================
--- boost/trunk/boost/wave/cpplexer/detect_include_guards.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpplexer/detect_include_guards.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,7 +22,7 @@
     will work as well). The code allows for any whitespace, newline and single 
     '#' tokens before the #if/#ifndef and after the final #endif.
     
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/cpplexer/re2clex/aq.hpp
===================================================================
--- boost/trunk/boost/wave/cpplexer/re2clex/aq.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpplexer/re2clex/aq.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
     http://www.boost.org/
     
     Copyright (c) 2001 Daniel C. Nuffer.
-    Copyright (c) 2001-2006 Hartmut Kaiser. 
+    Copyright (c) 2001-2007 Hartmut Kaiser. 
     Distributed under the Boost Software License, Version 1.0. (See accompanying 
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/cpplexer/re2clex/cpp_re.hpp
===================================================================
--- boost/trunk/boost/wave/cpplexer/re2clex/cpp_re.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpplexer/re2clex/cpp_re.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/cpplexer/re2clex/cpp_re2c_lexer.hpp
===================================================================
--- boost/trunk/boost/wave/cpplexer/re2clex/cpp_re2c_lexer.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpplexer/re2clex/cpp_re2c_lexer.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -109,12 +109,11 @@
 inline
 lexer<IteratorT, PositionT>::lexer(IteratorT const &first, 
         IteratorT const &last, PositionT const &pos, 
-        boost::wave::language_support language) 
-:   filename(pos.get_file()), at_eof(false), language(language)
+        boost::wave::language_support language_) 
+:   filename(pos.get_file()), at_eof(false), language(language_)
 {
     using namespace std;        // some systems have memset in std
     memset(&scanner, '\0', sizeof(Scanner));
-    scanner.fd = -1;
     scanner.eol_offsets = aq_create();
     if (first != last) {
         scanner.first = scanner.act = (uchar *)&(*first);
@@ -126,23 +125,30 @@
     scanner.file_name = filename.c_str();
     
 #if BOOST_WAVE_SUPPORT_MS_EXTENSIONS != 0
-    scanner.enable_ms_extensions = 1;
+    scanner.enable_ms_extensions = true;
 #else
-    scanner.enable_ms_extensions = 0;
+    scanner.enable_ms_extensions = false;
 #endif
 
 #if BOOST_WAVE_SUPPORT_VARIADICS_PLACEMARKERS != 0
     scanner.act_in_c99_mode = boost::wave::need_c99(language);
 #endif
 
+#if BOOST_WAVE_SUPPORT_IMPORT_KEYWORD != 0
+    scanner.enable_import_keyword = !boost::wave::need_c99(language);
+#else
+    scanner.enable_import_keyword = false;
+#endif
+
     scanner.detect_pp_numbers = boost::wave::need_prefer_pp_numbers(language);
+    scanner.single_line_only = boost::wave::need_single_line(language);
 }
 
 template <typename IteratorT, typename PositionT>
 inline
 lexer<IteratorT, PositionT>::~lexer() 
 {
-    using namespace std;        // some systems have memset in std
+    using namespace std;        // some systems have free in std
     aq_terminate(scanner.eol_offsets);
     free(scanner.bot);
 }
@@ -319,20 +325,20 @@
     
     lex_functor(IteratorT const &first, IteratorT const &last, 
             PositionT const &pos, boost::wave::language_support language)
-    :   lexer(first, last, pos, language)
+    :   re2c_lexer(first, last, pos, language)
     {}
     virtual ~lex_functor() {}
     
 // get the next token from the input stream
-    token_type get() { return lexer.get(); }
-    void set_position(PositionT const &pos) { lexer.set_position(pos); }
+    token_type get() { return re2c_lexer.get(); }
+    void set_position(PositionT const &pos) { re2c_lexer.set_position(pos); }
 #if BOOST_WAVE_SUPPORT_PRAGMA_ONCE != 0
     bool has_include_guards(std::string& guard_name) const 
-        { return lexer.has_include_guards(guard_name); }
+        { return re2c_lexer.has_include_guards(guard_name); }
 #endif    
 
 private:
-    lexer<IteratorT, PositionT> lexer;
+    lexer<IteratorT, PositionT> re2c_lexer;
 };
 
 ///////////////////////////////////////////////////////////////////////////////
@@ -383,8 +389,8 @@
     IteratorT const &last, PositionT const &pos, 
     boost::wave::language_support language)
 {
-    return new re2clex::lex_functor<IteratorT, PositionT>(first, last, pos,
-        language);
+    using re2clex::lex_functor;
+    return new lex_functor<IteratorT, PositionT>(first, last, pos, language);
 }
 
 #undef BOOST_WAVE_RE2C_NEW_LEXER_INLINE

Modified: boost/trunk/boost/wave/cpplexer/re2clex/scanner.hpp
===================================================================
--- boost/trunk/boost/wave/cpplexer/re2clex/scanner.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpplexer/re2clex/scanner.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
     http://www.boost.org/
     
     Copyright (c) 2001 Daniel C. Nuffer.
-    Copyright (c) 2001-2006 Hartmut Kaiser. 
+    Copyright (c) 2001-2007 Hartmut Kaiser. 
     Distributed under the Boost Software License, Version 1.0. (See accompanying 
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -31,10 +31,9 @@
 typedef int (* ReportErrorProc)(struct Scanner const *, char const *, ...);
 
 typedef struct Scanner {
-    int    fd;      /* file descriptor */
-    uchar* first;   /* start of input buffer (if fd == -1) */
-    uchar* act;     /* act position of input buffer (if fd == -1) */
-    uchar* last;    /* end (one past last char) of input buffer (if fd == -1) */
+    uchar* first;   /* start of input buffer */
+    uchar* act;     /* act position of input buffer */
+    uchar* last;    /* end (one past last char) of input buffer */
     uchar* bot;     /* beginning of the current buffer */
     uchar* top;     /* top of the current buffer */
     uchar* eof;     /* when we read in the last buffer, will point 1 past the 
@@ -45,16 +44,18 @@
     uchar* lim;     /* used for YYLIMIT - points to the end of the buffer */
                     /* (lim == top) except for the last buffer, it points to
                        the end of the input (lim == eof - 1) */
-    unsigned int line;          /* current line being lexed */
+    unsigned int line;          /* current line being lex'ed */
     unsigned int column;        /* current token start column position */
     unsigned int curr_column;   /* current column position */
-    ReportErrorProc error_proc; /* if != 0 this function is called to 
+    ReportErrorProc error_proc; /* must be != 0, this function is called to 
                                    report an error */
-    char const *file_name;      /* name of the lexed file */
+    char const *file_name;      /* name of the lex'ed file */
     aq_queue eol_offsets;
-    int enable_ms_extensions;   /* enable MS extensions */
-    int act_in_c99_mode;        /* lexer works in C99 mode */
-    int detect_pp_numbers;      /* lexer should prefer to detect pp-numbers */
+    bool enable_ms_extensions;   /* enable MS extensions */
+    bool act_in_c99_mode;        /* lexer works in C99 mode */
+    bool detect_pp_numbers;      /* lexer should prefer to detect pp-numbers */
+    bool enable_import_keyword;  /* recognize import as a keyword */
+    bool single_line_only;       /* don't report missing eol's in C++ comments */
 } Scanner;
 
 ///////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/wave/cpplexer/token_cache.hpp
===================================================================
--- boost/trunk/boost/wave/cpplexer/token_cache.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpplexer/token_cache.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/cpplexer/validate_universal_char.hpp
===================================================================
--- boost/trunk/boost/wave/cpplexer/validate_universal_char.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/cpplexer/validate_universal_char.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -36,19 +36,16 @@
     universal_char_type_not_allowed_for_identifiers = 3
 };
 
-namespace {
-
-    ///////////////////////////////////////////////////////////////////////////
-    // 
-    //  is_range is a helper function for the classification by brute force 
-    //  below
-    //
-    ///////////////////////////////////////////////////////////////////////////
-    inline bool 
-    in_range(unsigned long ch, unsigned long l, unsigned long u)
-    {
-        return (l <= ch && ch <= u);
-    }
+///////////////////////////////////////////////////////////////////////////
+// 
+//  is_range is a helper function for the classification by brute force 
+//  below
+//
+///////////////////////////////////////////////////////////////////////////
+inline bool 
+in_range(unsigned long ch, unsigned long l, unsigned long u)
+{
+    return (l <= ch && ch <= u);
 }
 
 ///////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/wave/grammars/cpp_chlit_grammar.hpp
===================================================================
--- boost/trunk/boost/wave/grammars/cpp_chlit_grammar.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/grammars/cpp_chlit_grammar.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -90,8 +90,8 @@
                 else {
                 // calculate the new value (avoiding a warning regarding 
                 // shifting count >= size of the type)
-                    value <<= 8 * (sizeof(wchar_t)-1);
-                    value <<= 8;  
+                    value <<= CHAR_BIT * (sizeof(wchar_t)-1);
+                    value <<= CHAR_BIT;  
                     value |= character & masks[sizeof(wchar_t)-1];
                 }
             }
@@ -102,7 +102,7 @@
                 }
                 else {
                 // calculate the new value
-                    value <<= 8 * sizeof(char);
+                    value <<= CHAR_BIT * sizeof(char);
                     value |= character & masks[sizeof(char)-1];
                 }
             }
@@ -292,7 +292,7 @@
 template <typename TokenT>
 BOOST_WAVE_CHLITGRAMMAR_GEN_INLINE 
 unsigned int
-chlit_grammar_gen<TokenT>::evaluate(TokenT const &token)
+chlit_grammar_gen<TokenT>::evaluate(TokenT const &token, value_error &status)
 {
     using namespace boost::spirit;
     
@@ -309,25 +309,21 @@
     else {
     // range check
         if ('L' == token_val[0]) {
-        // recognised wide character
+        // recognized wide character
             if (g.overflow || 
                 result > (unsigned long)(std::numeric_limits<wchar_t>::max)()) 
             {
             // out of range
-                BOOST_WAVE_THROW(preprocess_exception, 
-                    character_literal_out_of_range, 
-                    token_val.c_str(), token.get_position());
+                status = error_character_overflow;
             }
         }
         else {
-        // recognised narrow ('normal') character
+        // recognized narrow ('normal') character
             if (g.overflow || 
                 result > (unsigned long)(std::numeric_limits<unsigned char>::max)()) 
             {
             // out of range
-                BOOST_WAVE_THROW(preprocess_exception, 
-                    character_literal_out_of_range, 
-                    token_val.c_str(), token.get_position());
+                status = error_character_overflow;
             }
         }
     }

Modified: boost/trunk/boost/wave/grammars/cpp_defined_grammar.hpp
===================================================================
--- boost/trunk/boost/wave/grammars/cpp_defined_grammar.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/grammars/cpp_defined_grammar.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/grammars/cpp_defined_grammar_gen.hpp
===================================================================
--- boost/trunk/boost/wave/grammars/cpp_defined_grammar_gen.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/grammars/cpp_defined_grammar_gen.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/grammars/cpp_expression_grammar.hpp
===================================================================
--- boost/trunk/boost/wave/grammars/cpp_expression_grammar.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/grammars/cpp_expression_grammar.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -83,7 +83,7 @@
 
 ///////////////////////////////////////////////////////////////////////////////
 //
-//  convert the given tokenvalue (integer literal) to a unsigned long
+//  convert the given token value (integer literal) to a unsigned long
 //
 ///////////////////////////////////////////////////////////////////////////////
     struct convert_intlit {
@@ -98,19 +98,20 @@
         boost::wave::grammars::closures::closure_value 
         operator()(TokenT const &token) const
         { 
-            typedef boost::wave::grammars::closures::closure_value return_t;
+            typedef boost::wave::grammars::closures::closure_value return_type;
             bool is_unsigned = false;
             unsigned long ul = intlit_grammar_gen<TokenT>::evaluate(token, 
                 is_unsigned);
 
-            return is_unsigned ? return_t(ul) : return_t(static_cast<long>(ul));
+            return is_unsigned ? 
+                return_type(ul) : return_type(static_cast<long>(ul));
         }
     };
     phoenix::function<convert_intlit> const as_intlit;
 
 ///////////////////////////////////////////////////////////////////////////////
 //
-//  convert the given tokenvalue (character literal) to a unsigned int
+//  convert the given token value (character literal) to a unsigned int
 //
 ///////////////////////////////////////////////////////////////////////////////
     struct convert_chlit {
@@ -125,15 +126,17 @@
         boost::wave::grammars::closures::closure_value 
         operator()(TokenT const &token) const
         { 
-            typedef boost::wave::grammars::closures::closure_value return_t;
-            return return_t(chlit_grammar_gen<TokenT>::evaluate(token));
+            typedef boost::wave::grammars::closures::closure_value return_type;
+            value_error status = error_noerror;
+            unsigned int value = chlit_grammar_gen<TokenT>::evaluate(token, status);
+            return return_type(value, status);
         }
     };
     phoenix::function<convert_chlit> const as_chlit;
 
 ////////////////////////////////////////////////////////////////////////////////
 //
-//  Handle the ?: operator with correct type propagation
+//  Handle the ?: operator with correct type and error propagation
 //
 ////////////////////////////////////////////////////////////////////////////////
     struct operator_questionmark {
@@ -148,12 +151,121 @@
         boost::wave::grammars::closures::closure_value 
         operator()(CondT const &cond, Arg1T &val1, Arg2T const &val2) const
         { 
-            typedef boost::wave::grammars::closures::closure_value return_t;
-            return return_t(val1.handle_questionmark(cond, val2));
+            return val1.handle_questionmark(cond, val2);
         }
     };
     phoenix::function<operator_questionmark> const questionmark;
+
+///////////////////////////////////////////////////////////////////////////////
+//
+//  Handle type conversion conserving error conditions
+//
+///////////////////////////////////////////////////////////////////////////////
+    struct operator_to_bool {
     
+        template <typename ArgT>
+        struct result { 
+        
+            typedef boost::wave::grammars::closures::closure_value type; 
+        };
+
+        template <typename ArgT>
+        boost::wave::grammars::closures::closure_value 
+        operator()(ArgT &val) const
+        { 
+            typedef boost::wave::grammars::closures::closure_value return_type;
+            return return_type(
+                boost::wave::grammars::closures::as_bool(val), val.is_valid());
+        }
+    };
+    phoenix::function<operator_to_bool> const to_bool;
+    
+///////////////////////////////////////////////////////////////////////////////
+//
+//  Handle explicit type conversion
+//
+///////////////////////////////////////////////////////////////////////////////
+    struct operator_as_bool {
+    
+        template <typename ArgT>
+        struct result { 
+        
+            typedef bool type; 
+        };
+
+        template <typename ArgT>
+        bool
+        operator()(ArgT &val) const
+        { 
+            return boost::wave::grammars::closures::as_bool(val);
+        }
+    };
+    phoenix::function<operator_as_bool> const as_bool;
+    
+///////////////////////////////////////////////////////////////////////////////
+//
+//  Handle closure value operators with proper error propagation
+//
+///////////////////////////////////////////////////////////////////////////////
+#define BOOST_WAVE_BINARYOP(op, optok)                                        \
+    struct operator_binary_ ## op {                                           \
+                                                                              \
+        template <typename Arg1T, typename Arg2T>                             \
+        struct result {                                                       \
+                                                                              \
+            typedef boost::wave::grammars::closures::closure_value type;      \
+        };                                                                    \
+                                                                              \
+        template <typename Arg1T, typename Arg2T>                             \
+        boost::wave::grammars::closures::closure_value                        \
+        operator()(Arg1T &val1, Arg2T &val2) const                            \
+        {                                                                     \
+            return val1 optok val2;                                           \
+        }                                                                     \
+    };                                                                        \
+    phoenix::function<operator_binary_ ## op> const binary_ ## op             \
+    /**/
+
+    BOOST_WAVE_BINARYOP(and, &&);
+    BOOST_WAVE_BINARYOP(or, ||);
+    
+    BOOST_WAVE_BINARYOP(bitand, &);
+    BOOST_WAVE_BINARYOP(bitor, |);
+    BOOST_WAVE_BINARYOP(bitxor, ^);
+    
+    BOOST_WAVE_BINARYOP(lesseq, <=);
+    BOOST_WAVE_BINARYOP(less, <);
+    BOOST_WAVE_BINARYOP(greater, >);
+    BOOST_WAVE_BINARYOP(greateq, >=);
+    BOOST_WAVE_BINARYOP(eq, ==);
+    BOOST_WAVE_BINARYOP(ne, !=);
+
+#undef BOOST_WAVE_BINARYOP
+
+///////////////////////////////////////////////////////////////////////////////
+#define BOOST_WAVE_UNARYOP(op, optok)                                         \
+    struct operator_unary_ ## op {                                            \
+                                                                              \
+        template <typename ArgT>                                              \
+        struct result {                                                       \
+                                                                              \
+            typedef boost::wave::grammars::closures::closure_value type;      \
+        };                                                                    \
+                                                                              \
+        template <typename ArgT>                                              \
+        boost::wave::grammars::closures::closure_value                        \
+        operator()(ArgT &val) const                                           \
+        {                                                                     \
+            return optok val;                                                 \
+        }                                                                     \
+    };                                                                        \
+    phoenix::function<operator_unary_ ## op> const unary_ ## op               \
+    /**/
+
+    BOOST_WAVE_UNARYOP(neg, !);
+    
+#undef BOOST_WAVE_UNARYOP
+
 }   // namespace impl
 
 ///////////////////////////////////////////////////////////////////////////////
@@ -236,7 +348,7 @@
 
             logical_or_exp 
                 =   logical_and_exp[logical_or_exp.val = arg1]
-                    >> *(   if_p(static_cast_<bool>(logical_or_exp.val))
+                    >> *(   if_p(impl::as_bool(logical_or_exp.val))
                             [
                                 // if one of the || operators is true, no more
                                 // evaluation is required
@@ -244,7 +356,7 @@
                                 >>  logical_and_exp_nocalc
                                     [
                                         logical_or_exp.val = 
-                                            static_cast_<bool>(logical_or_exp.val)
+                                            impl::to_bool(logical_or_exp.val)
                                     ]
                             ]
                             .else_p
@@ -253,7 +365,7 @@
                                 >>  logical_and_exp
                                     [
                                         logical_or_exp.val = 
-                                            logical_or_exp.val || arg1
+                                            impl::binary_or(logical_or_exp.val, arg1)
                                     ]
                             ]
                         )
@@ -261,13 +373,13 @@
 
             logical_and_exp
                 =   inclusive_or_exp[logical_and_exp.val = arg1]
-                    >> *(   if_p(static_cast_<bool>(logical_and_exp.val))
+                    >> *(   if_p(impl::as_bool(logical_and_exp.val))
                             [
                                 pattern_p(T_ANDAND, MainTokenMask)
                                 >>  inclusive_or_exp
                                     [
                                         logical_and_exp.val = 
-                                            logical_and_exp.val && arg1
+                                            impl::binary_and(logical_and_exp.val, arg1)
                                     ]
                             ]
                             .else_p
@@ -278,7 +390,7 @@
                                 >>  inclusive_or_exp_nocalc
                                     [
                                         logical_and_exp.val =
-                                            static_cast_<bool>(logical_and_exp.val)
+                                            impl::to_bool(logical_and_exp.val)
                                     ]
                             ]
                         )
@@ -290,8 +402,7 @@
                             >>  exclusive_or_exp
                                 [
                                     inclusive_or_exp.val = 
-                                          static_cast_<unsigned int>(inclusive_or_exp.val) 
-                                      |   static_cast_<unsigned int>(arg1)
+                                        impl::binary_bitor(inclusive_or_exp.val, arg1)
                                 ]
                         )
                 ;
@@ -302,8 +413,7 @@
                             >>  and_exp
                                 [
                                     exclusive_or_exp.val = 
-                                          static_cast_<unsigned int>(exclusive_or_exp.val)
-                                      ^   static_cast_<unsigned int>(arg1)
+                                        impl::binary_bitxor(exclusive_or_exp.val, arg1)
                                 ]
                         )
                 ;
@@ -314,8 +424,7 @@
                             >>  cmp_equality
                                 [
                                     and_exp.val = 
-                                          static_cast_<unsigned int>(and_exp.val)
-                                      &   static_cast_<unsigned int>(arg1)
+                                        impl::binary_bitand(and_exp.val, arg1)
                                 ]
                         )
                 ;
@@ -326,13 +435,13 @@
                             >>  cmp_relational
                                 [
                                     cmp_equality.val = 
-                                        cmp_equality.val == arg1
+                                        impl::binary_eq(cmp_equality.val, arg1)
                                 ]
                         |   pattern_p(T_NOTEQUAL, MainTokenMask)
                             >>  cmp_relational
                                 [
                                     cmp_equality.val = 
-                                        cmp_equality.val != arg1
+                                        impl::binary_ne(cmp_equality.val, arg1)
                                 ]
                         )
                 ;
@@ -343,25 +452,25 @@
                             >>  shift_exp
                                 [
                                     cmp_relational.val = 
-                                        cmp_relational.val <= arg1
+                                        impl::binary_lesseq(cmp_relational.val, arg1)
                                 ]
                         |   ch_p(T_GREATEREQUAL)
                             >>  shift_exp
                                 [
                                     cmp_relational.val = 
-                                        cmp_relational.val >= arg1
+                                        impl::binary_greateq(cmp_relational.val, arg1)
                                 ]
                         |   ch_p(T_LESS)
                             >>  shift_exp
                                 [
                                     cmp_relational.val = 
-                                        cmp_relational.val < arg1
+                                        impl::binary_less(cmp_relational.val, arg1)
                                 ]
                         |   ch_p(T_GREATER)
                             >>  shift_exp
                                 [
                                     cmp_relational.val = 
-                                        cmp_relational.val > arg1
+                                        impl::binary_greater(cmp_relational.val, arg1)
                                 ]
                         )
                 ;
@@ -432,7 +541,7 @@
                     ]
                 |   pattern_p(T_NOT, MainTokenMask) >> unary_exp
                     [
-                        unary_exp.val = !arg1
+                        unary_exp.val = impl::unary_neg(arg1)
                     ]
                 ;
 
@@ -444,11 +553,11 @@
                 ;
 
             constant
-                =   ch_p(T_INTLIT) 
+                =   ch_p(T_PP_NUMBER) 
                     [
                         constant.val = impl::as_intlit(arg1)
                     ]
-                |   ch_p(T_PP_NUMBER) 
+                |   ch_p(T_INTLIT) 
                     [
                         constant.val = impl::as_intlit(arg1)
                     ]
@@ -571,8 +680,8 @@
                 ;
 
             constant_nocalc
-                =   ch_p(T_INTLIT) 
-                |   ch_p(T_PP_NUMBER) 
+                =   ch_p(T_PP_NUMBER) 
+                |   ch_p(T_INTLIT) 
                 |   ch_p(T_CHARLIT) 
                 ;
 
@@ -638,7 +747,7 @@
     typename token_sequence_type::const_iterator const &first, 
     typename token_sequence_type::const_iterator const &last, 
     typename token_type::position_type const &act_pos,
-    bool if_block_status)
+    bool if_block_status, value_error &status)
 {
     using namespace boost::spirit;
     using namespace boost::wave;
@@ -699,14 +808,14 @@
             case T_NEWLINE:
             case T_EOF:
             case T_CPPCOMMENT:              // contains newline
-                return bool(result);        // expression is valid
+                return as_bool(result);     // expression is valid
                 
             default:
             // expression is illformed
                 if (if_block_status) {
                     string_type expression = as_string<string_type>(first, last);
                     if (0 == expression.size()) 
-                        expression = "empty expression";
+                        expression = "<empty expression>";
                     BOOST_WAVE_THROW(preprocess_exception, ill_formed_expression, 
                         expression.c_str(), act_pos);
                 }
@@ -719,24 +828,11 @@
         }
     }
 
-    if (closure_value::error_noerror != result.is_valid()) {
-    // division by zero occured
-        string_type expression = as_string<string_type>(first, last);
-        if (0 == expression.size()) 
-            expression = "empty expression";
-            
-        if (closure_value::error_division_by_zero == result.is_valid()) {
-            BOOST_WAVE_THROW(preprocess_exception, division_by_zero, 
-                expression.c_str(), act_pos);
-        }
-        else if (closure_value::error_overflow == result.is_valid()) {
-            BOOST_WAVE_THROW(preprocess_exception, integer_overflow,
-                expression.c_str(), act_pos);
-        }
-    }
+    if (error_noerror != result.is_valid()) // division or other error by zero occurred
+        status = result.is_valid();
     
 // token sequence is a valid expression
-    return bool(result);
+    return as_bool(result);
 }
 
 #undef BOOST_WAVE_EXPRGRAMMAR_GEN_INLINE

Modified: boost/trunk/boost/wave/grammars/cpp_expression_grammar_gen.hpp
===================================================================
--- boost/trunk/boost/wave/grammars/cpp_expression_grammar_gen.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/grammars/cpp_expression_grammar_gen.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -13,6 +13,7 @@
 
 #include <boost/wave/wave_config.hpp>
 #include <boost/wave/cpp_iteration_context.hpp>
+#include <boost/wave/grammars/cpp_value_error.hpp>
 
 #include <list>
 #include <boost/pool/pool_alloc.hpp>
@@ -54,7 +55,7 @@
         typename token_sequence_type::const_iterator const &first, 
         typename token_sequence_type::const_iterator const &last, 
         typename token_type::position_type const &tok,
-        bool if_block_status);
+        bool if_block_status, value_error &status);
 };
 
 ///////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/wave/grammars/cpp_expression_value.hpp
===================================================================
--- boost/trunk/boost/wave/grammars/cpp_expression_value.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/grammars/cpp_expression_value.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -28,6 +28,9 @@
 namespace grammars {
 namespace closures {
 
+class closure_value;
+inline bool as_bool(closure_value const& v);
+
 ///////////////////////////////////////////////////////////////////////////////
 //
 //  The closure_value class represents the closure type, which is used for the 
@@ -46,12 +49,6 @@
         is_bool = 3
     };
     
-    enum value_error {
-        error_noerror = 0x0,
-        error_division_by_zero = 0x1,
-        error_overflow = 0x2
-    };
-    
     closure_value(value_error valid_ = error_noerror) 
     : type(is_int), valid(valid_) 
     { value.i = 0; }
@@ -74,51 +71,51 @@
     value_type get_type() const { return type; }
     value_error is_valid() const { return valid; }
     
-// implicit conversion
-    operator int() const 
+// explicit conversion
+    friend int as_int(closure_value const& v)
     {
-        switch (type) {
-        case is_uint:   return value.ui;
-        case is_bool:   return value.b ? 1 : 0;
+        switch (v.type) {
+        case is_uint:   return v.value.ui;
+        case is_bool:   return v.value.b ? 1 : 0;
         case is_int:    break;
         }
-        return value.i;
+        return v.value.i;
     }
-    operator unsigned int() const 
+    friend unsigned int as_uint(closure_value const& v)
     {
-        switch (type) {
-        case is_uint:   return value.ui;
-        case is_bool:   return value.b ? 1 : 0;
+        switch (v.type) {
+        case is_uint:   return v.value.ui;
+        case is_bool:   return v.value.b ? 1 : 0;
         case is_int:    break;
         }
-        return value.i;
+        return v.value.i;
     }
-    operator long() const 
+    friend long as_long(closure_value const& v) 
     {
-        switch (type) {
-        case is_uint:   return value.ui;
-        case is_bool:   return value.b ? 1 : 0;
+        switch (v.type) {
+        case is_uint:   return v.value.ui;
+        case is_bool:   return v.value.b ? 1 : 0;
         case is_int:    break;
         }
-        return value.i;
+        return v.value.i;
     }
-    operator unsigned long() const 
+    friend unsigned long as_ulong(closure_value const& v)
     {
-        switch (type) {
-        case is_uint:   return value.ui;
-        case is_bool:   return value.b ? 1 : 0;
+        switch (v.type) {
+        case is_uint:   return v.value.ui;
+        case is_bool:   return v.value.b ? 1 : 0;
         case is_int:    break;
         }
-        return value.i;
+        return v.value.i;
     }
-    operator bool() const 
+    friend bool as_bool(closure_value const& v)
     {
-        switch (type) {
-        case is_uint:   return value.ui != 0;
-        case is_bool:   return value.b;
+        switch (v.type) {
+        case is_uint:   return v.value.ui != 0;
+        case is_bool:   return v.value.b;
         case is_int:    break;
         }
-        return value.i != 0.0;
+        return v.value.i != 0.0;
     }
 
 // assignment    
@@ -126,17 +123,17 @@
     {
         switch (rhs.get_type()) {
         case is_int:    
-            value.i = long(rhs); 
+            value.i = as_long(rhs); 
             type = is_int;
             break;
         
         case is_uint:   
-            value.ui = (unsigned long)(rhs); 
+            value.ui = as_ulong(rhs); 
             type = is_uint;
             break;
         
         case is_bool:   
-            value.b = bool(rhs);
+            value.b = as_bool(rhs);
             type = is_bool;
             break;
         }
@@ -187,11 +184,11 @@
             switch(rhs.type) {
             case is_bool:
                 {
-                    long result = value.i + long(rhs); 
+                    long result = value.i + as_long(rhs); 
                     if (rhs.value.i > 0L && value.i > result || 
                         rhs.value.i < 0L && value.i < result)
                     {
-                        valid = error_overflow;
+                        valid = error_integer_overflow;
                     }
                     else {
                         value.i = result;
@@ -205,7 +202,7 @@
                     if (rhs.value.i > 0L && value.i > result || 
                         rhs.value.i < 0L && value.i < result)
                     {
-                        valid = error_overflow;
+                        valid = error_integer_overflow;
                     }
                     else {
                         value.i = result;
@@ -217,7 +214,7 @@
                 {
                     unsigned long result = value.ui + rhs.value.ui; 
                     if (result < value.ui) {
-                        valid = error_overflow;
+                        valid = error_integer_overflow;
                     }
                     else {
                         value.ui = result;
@@ -230,9 +227,9 @@
             
         case is_uint:
             {
-                unsigned long result = value.ui + (unsigned long)(rhs); 
+                unsigned long result = value.ui + as_ulong(rhs); 
                 if (result < value.ui) {
-                    valid = error_overflow;
+                    valid = error_integer_overflow;
                 }
                 else {
                     value.ui = result;
@@ -241,7 +238,7 @@
             break;
             
         case is_bool:   
-            value.i = value.b + bool(rhs);
+            value.i = value.b + as_bool(rhs);
             type = is_int;
         }
         valid = (value_error)(valid | rhs.valid);
@@ -254,11 +251,11 @@
             switch(rhs.type) {
             case is_bool:
                 {
-                    long result = value.i - long(rhs); 
+                    long result = value.i - as_long(rhs); 
                     if (rhs.value.i > 0L && result > value.i || 
                         rhs.value.i < 0L && result < value.i)
                     {
-                        valid = error_overflow;
+                        valid = error_integer_overflow;
                     }
                     else {
                         value.i = result;
@@ -272,7 +269,7 @@
                     if (rhs.value.i > 0L && result > value.i || 
                         rhs.value.i < 0L && result < value.i)
                     {
-                        valid = error_overflow;
+                        valid = error_integer_overflow;
                     }
                     else {
                         value.i = result;
@@ -284,7 +281,7 @@
                 {
                     unsigned long result = value.ui - rhs.value.ui; 
                     if (result > value.ui) {
-                        valid = error_overflow;
+                        valid = error_integer_overflow;
                     }
                     else {
                         value.ui = result;
@@ -299,10 +296,10 @@
             switch(rhs.type) {
             case is_bool:
                 {
-                    unsigned long result = value.ui - (unsigned long)(rhs); 
+                    unsigned long result = value.ui - as_ulong(rhs); 
                     if (result > value.ui)
                     {
-                        valid = error_overflow;
+                        valid = error_integer_overflow;
                     }
                     else {
                         value.ui = result;
@@ -316,7 +313,7 @@
                     if (rhs.value.i > 0L && result > value.ui || 
                         rhs.value.i < 0L && result < value.ui)
                     {
-                        valid = error_overflow;
+                        valid = error_integer_overflow;
                     }
                     else {
                         value.ui = result;
@@ -328,7 +325,7 @@
                 {
                     unsigned long result = value.ui - rhs.value.ui; 
                     if (result > value.ui) {
-                        valid = error_overflow;
+                        valid = error_integer_overflow;
                     }
                     else {
                         value.ui = result;
@@ -339,7 +336,7 @@
             break;
 
         case is_bool:   
-            value.i = value.b - bool(rhs);
+            value.i = value.b - as_bool(rhs);
             type = is_int;
         }
         valid = (value_error)(valid | rhs.valid);
@@ -350,7 +347,7 @@
         switch (type) {
         case is_int:    
             switch(rhs.type) {
-            case is_bool:   value.i *= long(rhs); break;
+            case is_bool:   value.i *= as_long(rhs); break;
             case is_int:
                 {
                     long result = value.i * rhs.value.i; 
@@ -359,7 +356,7 @@
                          result / rhs.value.i != value.i)
                        )
                     {
-                        valid = error_overflow;
+                        valid = error_integer_overflow;
                     }
                     else {
                         value.i = result;
@@ -375,7 +372,7 @@
                          result / rhs.value.ui != value.ui)
                        )
                     {
-                        valid = error_overflow;
+                        valid = error_integer_overflow;
                     }
                     else {
                         value.ui = result;
@@ -388,14 +385,14 @@
             
         case is_uint:
             {
-                unsigned long rhs_val = (unsigned long)(rhs);
+                unsigned long rhs_val = as_ulong(rhs);
                 unsigned long result = value.ui * rhs_val; 
                 if (0 != value.ui && 0 != rhs_val &&
                     (result / value.ui != rhs_val ||
                       result / rhs_val != value.ui)
                     )
                 {
-                    valid = error_overflow;
+                    valid = error_integer_overflow;
                 }
                 else {
                     value.ui = result;
@@ -431,13 +428,13 @@
             switch(rhs.type) {
             case is_bool:   
             case is_int:
-                if (long(rhs) != 0) {
+                if (as_long(rhs) != 0) {
                     if (value.i == -value.i && -1 == rhs.value.i) {
                     // LONG_MIN / -1 on two's complement
-                        valid = error_overflow;
+                        valid = error_integer_overflow;
                     }
                     else {
-                        value.i /= long(rhs); 
+                        value.i /= as_long(rhs); 
                     }
                 }
                 else {
@@ -458,14 +455,14 @@
             break;
             
         case is_uint: 
-            if ((unsigned long)(rhs) != 0) 
-                value.ui /= (unsigned long)(rhs); 
+            if (as_ulong(rhs) != 0) 
+                value.ui /= as_ulong(rhs); 
             else
                 valid = error_division_by_zero;         // division by zero
             break;
 
         case is_bool:  
-            if (bool(rhs)) {
+            if (as_bool(rhs)) {
                 switch(rhs.type) {
                 case is_int:
                     value.i = (value.b ? 1 : 0) / rhs.value.i;
@@ -494,13 +491,13 @@
             switch(rhs.type) {
             case is_bool:   
             case is_int:
-                if (long(rhs) != 0) {
+                if (as_long(rhs) != 0) {
                     if (value.i == -value.i && -1 == rhs.value.i) {
                     // LONG_MIN % -1 on two's complement
-                        valid = error_overflow;
+                        valid = error_integer_overflow;
                     }
                     else {
-                        value.i %= long(rhs); 
+                        value.i %= as_long(rhs); 
                     }
                 }
                 else {
@@ -521,14 +518,14 @@
             break;
             
         case is_uint: 
-            if ((unsigned long)(rhs) != 0) 
-                value.ui %= (unsigned long)(rhs); 
+            if (as_ulong(rhs) != 0) 
+                value.ui %= as_ulong(rhs); 
             else
                 valid = error_division_by_zero;      // division by zero
             break;
 
         case is_bool:  
-            if (bool(rhs)) {
+            if (as_bool(rhs)) {
                 switch(rhs.type) {
                 case is_int:
                     value.i = (value.b ? 1 : 0) % rhs.value.i;
@@ -557,35 +554,35 @@
         switch (rhs.type) {
         case is_int:
             {
-                long value = long(rhs);
+                long value = as_long(rhs);
                 if (value != 0 && value == -value)
-                    return closure_value(-value, error_overflow);
+                    return closure_value(-value, error_integer_overflow);
                 return closure_value(-value, rhs.valid);
             }
             
-        case is_bool:   return closure_value(-long(rhs), rhs.valid); 
+        case is_bool:   return closure_value(-as_long(rhs), rhs.valid); 
         case is_uint:   break;
         }
 
-        long value = (unsigned long)(rhs);
+        long value = as_ulong(rhs);
         if (value != 0 && value == -value)
-            return closure_value(-value, error_overflow);
+            return closure_value(-value, error_integer_overflow);
         return closure_value(-value, rhs.valid);
     }
     friend closure_value 
     operator~ (closure_value const &rhs)
     {
-        return closure_value(~(unsigned long)(rhs), rhs.valid);
+        return closure_value(~as_ulong(rhs), rhs.valid);  
     }
     friend closure_value 
     operator! (closure_value const &rhs)
     {
         switch (rhs.type) {
-        case is_int:    return closure_value(!long(rhs), rhs.valid);
-        case is_bool:   return closure_value(!bool(rhs), rhs.valid); 
+        case is_int:    return closure_value(!as_long(rhs), rhs.valid);
+        case is_bool:   return closure_value(!as_bool(rhs), rhs.valid); 
         case is_uint:   break;
         }
-        return closure_value(!(unsigned long)(rhs), rhs.valid);
+        return closure_value(!as_ulong(rhs), rhs.valid);
     }
     
 // comparison
@@ -596,21 +593,21 @@
         switch (lhs.type) {
         case is_int:
             switch(rhs.type) {
-            case is_bool:   cmp = bool(lhs) == rhs.value.b; break;
+            case is_bool:   cmp = as_bool(lhs) == rhs.value.b; break;
             case is_int:    cmp = lhs.value.i == rhs.value.i; break;
             case is_uint:   cmp = lhs.value.ui == rhs.value.ui; break;
             }
             break;
             
-        case is_uint:   cmp = lhs.value.ui == (unsigned long)(rhs); break;
-        case is_bool:   cmp = lhs.value.b == bool(rhs); break;
+        case is_uint:   cmp = lhs.value.ui == as_ulong(rhs); break;
+        case is_bool:   cmp = lhs.value.b == as_bool(rhs); break;
         }
         return closure_value(cmp, (value_error)(lhs.valid | rhs.valid));
     }
     friend closure_value 
     operator!= (closure_value const &lhs, closure_value const &rhs)
     {
-        return closure_value(!bool(lhs == rhs), (value_error)(lhs.valid | rhs.valid));
+        return closure_value(!as_bool(lhs == rhs), (value_error)(lhs.valid | rhs.valid));
     }
     friend closure_value 
     operator> (closure_value const &lhs, closure_value const &rhs)
@@ -619,14 +616,14 @@
         switch (lhs.type) {
         case is_int:
             switch(rhs.type) {
-            case is_bool:   cmp = lhs.value.i > long(rhs); break;
+            case is_bool:   cmp = lhs.value.i > as_long(rhs); break;
             case is_int:    cmp = lhs.value.i > rhs.value.i; break;
             case is_uint:   cmp = lhs.value.ui > rhs.value.ui; break;
             }
             break;
             
-        case is_uint:   cmp = lhs.value.ui > (unsigned long)(rhs); break;
-        case is_bool:   cmp = lhs.value.b > bool(rhs); break;
+        case is_uint:   cmp = lhs.value.ui > as_ulong(rhs); break;
+        case is_bool:   cmp = lhs.value.b > as_bool(rhs); break;
         }
         return closure_value(cmp, (value_error)(lhs.valid | rhs.valid));
     }
@@ -637,26 +634,26 @@
         switch (lhs.type) {
         case is_int:
             switch(rhs.type) {
-            case is_bool:   cmp = lhs.value.i < long(rhs); break;
+            case is_bool:   cmp = lhs.value.i < as_long(rhs); break;
             case is_int:    cmp = lhs.value.i < rhs.value.i; break;
             case is_uint:   cmp = lhs.value.ui < rhs.value.ui; break;
             }
             break;
             
-        case is_uint:   cmp = lhs.value.ui < (unsigned long)(rhs); break;
-        case is_bool:   cmp = bool(lhs) < bool(rhs); break;
+        case is_uint:   cmp = lhs.value.ui < as_ulong(rhs); break;
+        case is_bool:   cmp = as_bool(lhs) < as_bool(rhs); break;
         }
         return closure_value(cmp, (value_error)(lhs.valid | rhs.valid));
     }
     friend closure_value 
     operator<= (closure_value const &lhs, closure_value const &rhs)
     {
-        return closure_value(!bool(lhs > rhs), (value_error)(lhs.valid | rhs.valid));
+        return closure_value(!as_bool(lhs > rhs), (value_error)(lhs.valid | rhs.valid));
     }
     friend closure_value 
     operator>= (closure_value const &lhs, closure_value const &rhs)
     {
-        return closure_value(!bool(lhs < rhs), (value_error)(lhs.valid | rhs.valid));
+        return closure_value(!as_bool(lhs < rhs), (value_error)(lhs.valid | rhs.valid));
     }
 
     closure_value &
@@ -669,7 +666,7 @@
             case is_bool:
             case is_int:
                 {
-                long shift_by = long(rhs);
+                long shift_by = as_long(rhs);
                     
                     if (shift_by > 64) 
                         shift_by = 64;
@@ -681,7 +678,7 @@
                 
             case is_uint:
                 {
-                unsigned long shift_by = (unsigned long)(rhs);
+                unsigned long shift_by = as_ulong(rhs);
                     
                     if (shift_by > 64) 
                         shift_by = 64;
@@ -699,7 +696,7 @@
             case is_bool:
             case is_int:
                 {
-                long shift_by = long(rhs);
+                long shift_by = as_long(rhs);
                     
                     if (shift_by > 64) 
                         shift_by = 64;
@@ -711,7 +708,7 @@
                 
             case is_uint:
                 {
-                unsigned long shift_by = (unsigned long)(rhs);
+                unsigned long shift_by = as_ulong(rhs);
                     
                     if (shift_by > 64) 
                         shift_by = 64;
@@ -734,7 +731,7 @@
             case is_bool:
             case is_int:
                 {
-                long shift_by = long(rhs);
+                long shift_by = as_long(rhs);
                     
                     if (shift_by > 64) 
                         shift_by = 64;
@@ -746,7 +743,7 @@
                 
             case is_uint:
                 {
-                unsigned long shift_by = (unsigned long)(rhs);
+                unsigned long shift_by = as_ulong(rhs);
                     
                     if (shift_by > 64) 
                         shift_by = 64;
@@ -764,7 +761,7 @@
             case is_bool:
             case is_int:
                 {
-                long shift_by = long(rhs);
+                long shift_by = as_long(rhs);
                     
                     if (shift_by > 64) 
                         shift_by = 64;
@@ -776,7 +773,7 @@
                 
             case is_uint:
                 {
-                unsigned long shift_by = (unsigned long)(rhs);
+                unsigned long shift_by = as_ulong(rhs);
                     
                     if (shift_by > 64) 
                         shift_by = 64;
@@ -793,17 +790,38 @@
     friend closure_value 
     operator|| (closure_value const &lhs, closure_value const &rhs)
     {
-        bool result = bool(lhs) || bool(rhs);
+        bool result = as_bool(lhs) || as_bool(rhs);
         return closure_value(result, (value_error)(lhs.valid | rhs.valid));
     }
     
     friend closure_value 
     operator&& (closure_value const &lhs, closure_value const &rhs)
     {
-        bool result = bool(lhs) && bool(rhs);
+        bool result = as_bool(lhs) && as_bool(rhs);
         return closure_value(result, (value_error)(lhs.valid | rhs.valid));
     }
 
+    friend closure_value 
+    operator| (closure_value const &lhs, closure_value const &rhs)
+    {
+        unsigned long result = as_ulong(lhs) | as_ulong(rhs);
+        return closure_value(result, (value_error)(lhs.valid | rhs.valid));
+    }
+    
+    friend closure_value 
+    operator& (closure_value const &lhs, closure_value const &rhs)
+    {
+        unsigned long result = as_ulong(lhs) & as_ulong(rhs);
+        return closure_value(result, (value_error)(lhs.valid | rhs.valid));
+    }
+
+    friend closure_value 
+    operator^ (closure_value const &lhs, closure_value const &rhs)
+    {
+        unsigned long result = as_ulong(lhs) ^ as_ulong(rhs);
+        return closure_value(result, (value_error)(lhs.valid | rhs.valid));
+    }
+    
     // handle the ?: operator
     closure_value &
     handle_questionmark(closure_value const &cond, closure_value const &val2)
@@ -811,19 +829,19 @@
         switch (type) {
         case is_int:
             switch (val2.type) {
-            case is_bool: value.b = bool(cond) ? value.b : bool(val2); break;
-            case is_int:  value.i = bool(cond) ? value.i : long(val2); break;
+            case is_bool: value.b = as_bool(cond) ? value.b : as_bool(val2); break;
+            case is_int:  value.i = as_bool(cond) ? value.i : as_long(val2); break;
             case is_uint: 
-                value.ui = bool(cond) ? value.ui : (unsigned long)(val2); 
+                value.ui = as_bool(cond) ? value.ui : as_ulong(val2); 
                 type = is_uint;   // changing type!
                 break;
             }
             break;
             
-        case is_uint:   value.ui = bool(cond) ? value.ui : (unsigned long)(val2); break;
-        case is_bool:   value.b = bool(cond) ? value.b : bool(val2); break;
+        case is_uint:   value.ui = as_bool(cond) ? value.ui : as_ulong(val2); break;
+        case is_bool:   value.b = as_bool(cond) ? value.b : as_bool(val2); break;
         }
-        valid = bool(cond) ? valid : val2.valid;
+        valid = as_bool(cond) ? valid : val2.valid;
         return *this;
     }
     
@@ -832,9 +850,9 @@
     operator<< (std::ostream &o, closure_value const &val)
     {
         switch (val.type) {
-        case is_int:    o << "int(" << long(val) << ")"; break;
-        case is_uint:   o << "unsigned int(" << (unsigned long)(val) << ")"; break;
-        case is_bool:   o << "bool(" << bool(val) << ")"; break;
+        case is_int:    o << "int(" << as_long(val) << ")"; break;
+        case is_uint:   o << "unsigned int(" << as_ulong(val) << ")"; break;
+        case is_bool:   o << "bool(" << as_bool(val) << ")"; break;
         }
         return o;
     }

Modified: boost/trunk/boost/wave/grammars/cpp_grammar.hpp
===================================================================
--- boost/trunk/boost/wave/grammars/cpp_grammar.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/grammars/cpp_grammar.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -90,6 +90,31 @@
 
 ///////////////////////////////////////////////////////////////////////////////
 //
+//  store_found_eoltokens
+//
+//      The store_found_eoltokens functor stores the token sequence of the 
+//      line ending for a particular pp directive
+//
+///////////////////////////////////////////////////////////////////////////////
+
+    template <typename ContainerT>
+    struct store_found_eoltokens {
+
+        store_found_eoltokens(ContainerT &found_eoltokens_) 
+        :   found_eoltokens(found_eoltokens_) {}
+        
+        template <typename IteratorT>
+        void operator()(IteratorT const &first, IteratorT const& last) const
+        {
+            std::copy(first, last, 
+                std::inserter(found_eoltokens, found_eoltokens.end()));
+        }
+        
+        ContainerT &found_eoltokens;
+    };
+
+///////////////////////////////////////////////////////////////////////////////
+//
 //  flush_underlying_parser
 //
 //      The flush_underlying_parser flushes the underlying
@@ -126,14 +151,15 @@
 
 ///////////////////////////////////////////////////////////////////////////////
 // Encapsulation of the C++ preprocessor grammar.
-template <typename TokenT>
+template <typename TokenT, typename ContainerT>
 struct cpp_grammar : 
-    public boost::spirit::grammar<cpp_grammar<TokenT> >
+    public boost::spirit::grammar<cpp_grammar<TokenT, ContainerT> >
 {
     typedef typename TokenT::position_type  position_type;
-    typedef cpp_grammar<position_type>      grammar_type;
+    typedef cpp_grammar<TokenT, ContainerT> grammar_type;
     typedef impl::store_found_eof           store_found_eof_type;
-    typedef impl::store_found_directive<TokenT> store_found_directive_type;
+    typedef impl::store_found_directive<TokenT>     store_found_directive_type;
+    typedef impl::store_found_eoltokens<ContainerT> store_found_eoltokens_type;
     
     template <typename ScannerT>
     struct definition
@@ -247,6 +273,7 @@
                     |   illformed
                     )
                     >> eol_tokens
+                       [ store_found_eoltokens_type(self.found_eoltokens) ]
 //  In parser debug mode it is useful not to flush the underlying stream
 //  to allow its investigation in the debugger and to see the correct
 //  output in the printed debug log..
@@ -576,9 +603,13 @@
 
     bool &found_eof;
     TokenT &found_directive;
+    ContainerT &found_eoltokens;
     
-    cpp_grammar(bool &found_eof_, TokenT &found_directive_)
-    :   found_eof(found_eof_), found_directive(found_directive_)
+    cpp_grammar(bool &found_eof_, TokenT &found_directive_, 
+            ContainerT &found_eoltokens_)
+    :   found_eof(found_eof_), 
+        found_directive(found_directive_),
+        found_eoltokens(found_eoltokens_)
     { 
         BOOST_SPIRIT_DEBUG_TRACE_GRAMMAR_NAME(*this, "cpp_grammar", 
             TRACE_CPP_GRAMMAR); 
@@ -679,20 +710,21 @@
 #define BOOST_WAVE_GRAMMAR_GEN_INLINE inline
 #endif 
 
-template <typename LexIteratorT>
+template <typename LexIteratorT, typename TokenContainerT>
 BOOST_WAVE_GRAMMAR_GEN_INLINE 
 boost::spirit::tree_parse_info<
-    LexIteratorT, typename cpp_grammar_gen<LexIteratorT>::node_factory_type
+    LexIteratorT, 
+    typename cpp_grammar_gen<LexIteratorT, TokenContainerT>::node_factory_type
 >
-cpp_grammar_gen<LexIteratorT>::parse_cpp_grammar (
+cpp_grammar_gen<LexIteratorT, TokenContainerT>::parse_cpp_grammar (
     LexIteratorT const &first, LexIteratorT const &last,
     position_type const &act_pos, bool &found_eof,
-    token_type &found_directive)
+    token_type &found_directive, token_container_type &found_eoltokens)
 {
     using namespace boost::spirit;
     using namespace boost::wave;
     
-    cpp_grammar<token_type> g(found_eof, found_directive);
+    cpp_grammar<token_type, TokenContainerT> g(found_eof, found_directive, found_eoltokens);
     tree_parse_info<LexIteratorT, node_factory_type> hit = 
         parsetree_parse<node_factory_type>(first, last, g);
     
@@ -704,12 +736,6 @@
     }
 #endif
 
-    if (!hit.match && token_id(found_directive) != T_EOF) {
-    // recognized invalid directive
-        BOOST_WAVE_THROW(preprocess_exception, ill_formed_directive, 
-            found_directive.get_value().c_str(), act_pos);
-    }
-
     return hit;
 }
 

Modified: boost/trunk/boost/wave/grammars/cpp_grammar_gen.hpp
===================================================================
--- boost/trunk/boost/wave/grammars/cpp_grammar_gen.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/grammars/cpp_grammar_gen.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -74,11 +74,12 @@
 //
 ///////////////////////////////////////////////////////////////////////////////
 
-template <typename LexIteratorT>
+template <typename LexIteratorT, typename TokenContainerT>
 struct BOOST_WAVE_DECL cpp_grammar_gen
 {
     typedef LexIteratorT                          iterator_type;
     typedef typename LexIteratorT::token_type     token_type;
+    typedef TokenContainerT                       token_container_type;
     typedef typename token_type::position_type    position_type;
     typedef boost::spirit::node_val_data_factory<
 //             boost::spirit::nil_t,
@@ -89,7 +90,7 @@
     static boost::spirit::tree_parse_info<iterator_type, node_factory_type> 
     parse_cpp_grammar (iterator_type const &first, iterator_type const &last,
         position_type const &act_pos, bool &found_eof, 
-        token_type &found_directive);
+        token_type &found_directive, token_container_type &found_eoltokens);
 };
 
 ///////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/wave/grammars/cpp_intlit_grammar.hpp
===================================================================
--- boost/trunk/boost/wave/grammars/cpp_intlit_grammar.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/grammars/cpp_intlit_grammar.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/grammars/cpp_literal_grammar_gen.hpp
===================================================================
--- boost/trunk/boost/wave/grammars/cpp_literal_grammar_gen.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/grammars/cpp_literal_grammar_gen.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -12,6 +12,7 @@
 #define CPP_LITERAL_GRAMMAR_GEN_HPP_67794A6C_468A_4AAB_A757_DEDDB182F5A0_INCLUDED
 
 #include <boost/wave/wave_config.hpp>
+#include <boost/wave/grammars/cpp_value_error.hpp>
 
 // this must occur after all of the includes and before any code appears
 #ifdef BOOST_HAS_ABI_HEADERS
@@ -56,7 +57,7 @@
 template <typename TokenT>
 struct BOOST_WAVE_DECL chlit_grammar_gen {
 
-    static unsigned int evaluate(TokenT const &tok);
+    static unsigned int evaluate(TokenT const &tok, value_error& status);
 };
 
 ///////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/wave/grammars/cpp_predef_macros_gen.hpp
===================================================================
--- boost/trunk/boost/wave/grammars/cpp_predef_macros_gen.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/grammars/cpp_predef_macros_gen.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/grammars/cpp_predef_macros_grammar.hpp
===================================================================
--- boost/trunk/boost/wave/grammars/cpp_predef_macros_grammar.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/grammars/cpp_predef_macros_grammar.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Copied: boost/trunk/boost/wave/grammars/cpp_value_error.hpp (from rev 14034, boost/branches/upstream/current/boost/wave/grammars/cpp_value_error.hpp)

Modified: boost/trunk/boost/wave/language_support.hpp
===================================================================
--- boost/trunk/boost/wave/language_support.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/language_support.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -154,6 +154,7 @@
 BOOST_WAVE_OPTION(prefer_pp_numbers)        // support_option_prefer_pp_numbers
 BOOST_WAVE_OPTION(emit_line_directives)     // support_option_emit_line_directives
 BOOST_WAVE_OPTION(single_line)              // support_option_single_line
+BOOST_WAVE_OPTION(convert_trigraphs)        // support_option_convert_trigraphs
 #if BOOST_WAVE_SUPPORT_PRAGMA_ONCE != 0
 BOOST_WAVE_OPTION(include_guard_detection)  // support_option_include_guard_detection
 #endif

Modified: boost/trunk/boost/wave/preprocessing_hooks.hpp
===================================================================
--- boost/trunk/boost/wave/preprocessing_hooks.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/preprocessing_hooks.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,13 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
 
-#if !defined(DEFAULT_PREPROCESSING_HOOKS_HPP_INCLUDED)
-#define DEFAULT_PREPROCESSING_HOOKS_HPP_INCLUDED
+#if !defined(PREPROCESSING_HOOKS_HPP_338DE478_A13C_4B63_9BA9_041C917793B8_INCLUDED)
+#define PREPROCESSING_HOOKS_HPP_338DE478_A13C_4B63_9BA9_041C917793B8_INCLUDED
 
 #include <boost/wave/wave_config.hpp>
 #include <vector>
@@ -30,140 +30,81 @@
 //  preprocessing hooks called from inside the preprocessing engine
 //
 ///////////////////////////////////////////////////////////////////////////////
-struct default_preprocessing_hooks 
-{
+struct default_preprocessing_hooks {
+
     ///////////////////////////////////////////////////////////////////////////
     //  
     //  The function 'expanding_function_like_macro' is called, whenever a 
     //  function-like macro is to be expanded.
     //
-    //  The parameter 'macrodef' marks the position, where the macro to expand 
+    //  The macroname parameter marks the position, where the macro to expand 
     //  is defined.
-    //
-    //  The parameter 'formal_args' holds the formal arguments used during the
+    //  The formal_args parameter holds the formal arguments used during the
     //  definition of the macro.
-    //
-    //  The parameter 'definition' holds the macro definition for the macro to 
+    //  The definition parameter holds the macro definition for the macro to 
     //  trace.
     //
-    //  The parameter 'macro_call' marks the position, where this macro invoked.
-    //
-    //  The parameter 'arguments' holds the macro arguments used during the 
+    //  The macro call parameter marks the position, where this macro invoked.
+    //  The arguments parameter holds the macro arguments used during the 
     //  invocation of the macro
     //
-    //  The parameters 'seqstart' and 'seqend' point into the input token 
-    //  stream allowing to access the whole token sequence comprising the macro
-    //  invocation (starting with the opening parenthesis and ending after the
-    //  closing one).
-    //
     ///////////////////////////////////////////////////////////////////////////
-
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS
-    // old signature
     template <typename TokenT, typename ContainerT>
     void expanding_function_like_macro(
-        TokenT const& macrodef, std::vector<TokenT> const& formal_args, 
-        ContainerT const& definition,
-        TokenT const& macrocall, std::vector<ContainerT> const& arguments) 
+        TokenT const &macrodef, std::vector<TokenT> const &formal_args, 
+        ContainerT const &definition,
+        TokenT const &macrocall, std::vector<ContainerT> const &arguments) 
     {}
-#else
-    // new signature
-    template <typename ContextT, typename TokenT, typename ContainerT, typename IteratorT>
-    void expanding_function_like_macro(ContextT const& ctx,
-        TokenT const& macrodef, std::vector<TokenT> const& formal_args, 
-        ContainerT const& definition,
-        TokenT const& macrocall, std::vector<ContainerT> const& arguments,
-        IteratorT const& seqstart, IteratorT const& seqend) 
-    {}
-#endif
 
     ///////////////////////////////////////////////////////////////////////////
     //  
     //  The function 'expanding_object_like_macro' is called, whenever a 
     //  object-like macro is to be expanded .
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
-    //  The parameter 'macro' marks the position, where the macro to expand 
+    //  The macroname parameter marks the position, where the macro to expand 
     //  is defined.
-    //
-    //  The definition 'definition' holds the macro definition for the macro to 
+    //  The definition parameter holds the macro definition for the macro to 
     //  trace.
     //
-    //  The parameter 'macrocall' marks the position, where this macro invoked.
+    //  The macro call parameter marks the position, where this macro invoked.
     //
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS
-    // old signature
     template <typename TokenT, typename ContainerT>
-    void expanding_object_like_macro(TokenT const& macro, 
-        ContainerT const& definition, TokenT const& macrocall)
+    void expanding_object_like_macro(TokenT const &macro, 
+        ContainerT const &definition, TokenT const &macrocall)
     {}
-#else
-    // new signature
-    template <typename ContextT, typename TokenT, typename ContainerT>
-    void expanding_object_like_macro(ContextT const& ctx, TokenT const& macro, 
-        ContainerT const& definition, TokenT const& macrocall)
-    {}
-#endif
 
     ///////////////////////////////////////////////////////////////////////////
     //  
     //  The function 'expanded_macro' is called, whenever the expansion of a 
     //  macro is finished but before the rescanning process starts.
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
     //  The parameter 'result' contains the token sequence generated as the 
     //  result of the macro expansion.
     //
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS
-    // old signature
     template <typename ContainerT>
-    void expanded_macro(ContainerT const& result)
+    void expanded_macro(ContainerT const &result)
     {}
-#else
-    // new signature
-    template <typename ContextT, typename ContainerT>
-    void expanded_macro(ContextT const& ctx, ContainerT const& result)
-    {}
-#endif
 
     ///////////////////////////////////////////////////////////////////////////
     //  
     //  The function 'rescanned_macro' is called, whenever the rescanning of a 
     //  macro is finished.
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
     //  The parameter 'result' contains the token sequence generated as the 
     //  result of the rescanning.
     //
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS
-    // old signature
     template <typename ContainerT>
-    void rescanned_macro(ContainerT const& result)
+    void rescanned_macro(ContainerT const &result)
     {}
-#else
-    // new signature
-    template <typename ContextT, typename ContainerT>
-    void rescanned_macro(ContextT const& ctx, ContainerT const& result)
-    {}
-#endif
 
     ///////////////////////////////////////////////////////////////////////////
     //  
     //  The function 'found_include_directive' is called, whenever a #include
     //  directive was located.
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
     //  The parameter 'filename' contains the (expanded) file name found after 
     //  the #include directive. This has the format '<file>', '"file"' or 
     //  'file'.
@@ -176,28 +117,15 @@
     //  preprocessing constant was defined to something != 0.
     //
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS
-    // old signature
     void 
-    found_include_directive(std::string const& filename, bool include_next) 
+    found_include_directive(std::string const &filename, bool include_next) 
     {}
-#else
-    // new signature
-    template <typename ContextT>
-    void 
-    found_include_directive(ContextT const& ctx, std::string const& filename, 
-        bool include_next) 
-    {}
-#endif
     
     ///////////////////////////////////////////////////////////////////////////
     //  
     //  The function 'opened_include_file' is called, whenever a file referred 
     //  by an #include directive was successfully located and opened.
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
     //  The parameter 'filename' contains the file system path of the 
     //  opened file (this is relative to the directory of the currently 
     //  processed file or a absolute path depending on the paths given as the
@@ -209,42 +137,20 @@
     //  found as a result of a #include <...> directive.
     //  
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS
-    // old signature
     void 
-    opened_include_file(std::string const& relname, std::string const& absname, 
+    opened_include_file(std::string const &relname, std::string const &absname, 
         std::size_t include_depth, bool is_system_include) 
     {}
-#else
-    // new signature
-    template <typename ContextT>
-    void 
-    opened_include_file(ContextT const& ctx, std::string const& relname, 
-        std::string const& absname, bool is_system_include) 
-    {}
-#endif
     
     ///////////////////////////////////////////////////////////////////////////
     //  
     //  The function 'returning_from_include_file' is called, whenever an
     //  included file is about to be closed after it's processing is complete.
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS
-    // old signature
     void
     returning_from_include_file() 
     {}
-#else
-    // new signature
-    template <typename ContextT>
-    void
-    returning_from_include_file(ContextT const& ctx) 
-    {}
-#endif
 
     ///////////////////////////////////////////////////////////////////////////
     //  
@@ -276,9 +182,9 @@
     ///////////////////////////////////////////////////////////////////////////
     template <typename ContextT, typename ContainerT>
     bool 
-    interpret_pragma(ContextT const& ctx, ContainerT &pending, 
-        typename ContextT::token_type const& option, ContainerT const& values, 
-        typename ContextT::token_type const& act_token)
+    interpret_pragma(ContextT const &ctx, ContainerT &pending, 
+        typename ContextT::token_type const &option, ContainerT const &values, 
+        typename ContextT::token_type const &act_token)
     {
         return false;
     }
@@ -288,9 +194,6 @@
     //  The function 'defined_macro' is called, whenever a macro was defined
     //  successfully.
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
     //  The parameter 'name' is a reference to the token holding the macro name.
     //
     //  The parameter 'is_functionlike' is set to true, whenever the newly 
@@ -304,55 +207,29 @@
     //  replacement sequence (definition part) of the newly defined macro.
     //
     //  The parameter 'is_predefined' is set to true for all macros predefined 
-    //  during the initialization phase of the library.
+    //  during the initialisation phase of the library.
     //
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
-    // old signature
     template <typename TokenT, typename ParametersT, typename DefinitionT>
     void
-    defined_macro(TokenT const& macro_name, bool is_functionlike, 
-        ParametersT const& parameters, DefinitionT const& definition, 
+    defined_macro(TokenT const &macro_name, bool is_functionlike, 
+        ParametersT const &parameters, DefinitionT const &definition, 
         bool is_predefined)
     {}
-#else
-    // new signature
-    template <
-        typename ContextT, typename TokenT, typename ParametersT, 
-        typename DefinitionT
-    >
-    void
-    defined_macro(ContextT const& ctx, TokenT const& macro_name, 
-        bool is_functionlike, ParametersT const& parameters, 
-        DefinitionT const& definition, bool is_predefined)
-    {}
-#endif
-
+    
     ///////////////////////////////////////////////////////////////////////////
     //
     //  The function 'undefined_macro' is called, whenever a macro definition
     //  was removed successfully.
     //  
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
     //  The parameter 'name' holds the name of the macro, which definition was 
     //  removed.
     //
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
-    // old signature
     template <typename TokenT>
     void
-    undefined_macro(TokenT const& macro_name)
+    undefined_macro(TokenT const &macro_name)
     {}
-#else
-    // new signature
-    template <typename ContextT, typename TokenT>
-    void
-    undefined_macro(ContextT const& ctx, TokenT const& macro_name)
-    {}
-#endif
     
     ///////////////////////////////////////////////////////////////////////////
     //
@@ -360,67 +237,33 @@
     //  directive was encountered, but before the corresponding action is 
     //  executed.
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
     //  The parameter 'directive' is a reference to the token holding the 
     //  preprocessing directive.
     //
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
-    // old signature
     template <typename TokenT>
     void
     found_directive(TokenT const& directive)
     {}
-#else
-    // new signature
-    template <typename ContextT, typename TokenT>
-    void
-    found_directive(ContextT const& ctx, TokenT const& directive)
-    {}
-#endif
 
     ///////////////////////////////////////////////////////////////////////////
     //
     //  The function 'evaluated_conditional_expression' is called, whenever a 
     //  conditional preprocessing expression was evaluated (the expression
-    //  given to a #if, #elif, #ifdef or #ifndef directive)
+    //  given to a #if, #ifdef or #ifndef directive)
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
-    //  The parameter 'directive' is a reference to the token holding the 
-    //  corresponding preprocessing directive.
-    //
     //  The parameter 'expression' holds the non-expanded token sequence
     //  comprising the evaluated expression.
     //
     //  The parameter expression_value contains the result of the evaluation of
     //  the expression in the current preprocessing context.
     //
-    //  The return value defines, whether the given expression has to be 
-    //  evaluated again, allowing to decide which of the conditional branches
-    //  should be expanded. You need to return 'true' from this hook function 
-    //  to force the expression to be re-evaluated.
-    //
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
-    // old signature
     template <typename ContainerT>
     void
     evaluated_conditional_expression(ContainerT const& expression, 
         bool expression_value)
     {}
-#else
-    // new signature
-    template <typename ContextT, typename TokenT, typename ContainerT>
-    bool
-    evaluated_conditional_expression(ContextT const& ctx, 
-        TokenT const& directive, ContainerT const& expression, 
-        bool expression_value)
-    { return false; }         // ok to continue, do not re-evaluate expression
-#endif
     
     ///////////////////////////////////////////////////////////////////////////
     //
@@ -428,25 +271,14 @@
     //  skipped due to a false preprocessor condition (code fragments to be
     //  skipped inside the not evaluated conditional #if/#else/#endif branches).
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
     //  The parameter 'token' refers to the token to be skipped.
+    //  
     //
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
-    // old signature
     template <typename TokenT>
     void
     skipped_token(TokenT const& token)
     {}
-#else
-    // new signature
-    template <typename ContextT, typename TokenT>
-    void
-    skipped_token(ContextT const& ctx, TokenT const& token)
-    {}
-#endif
 
     ///////////////////////////////////////////////////////////////////////////
     //
@@ -489,4 +321,4 @@
 #include BOOST_ABI_SUFFIX
 #endif
 
-#endif // !defined(DEFAULT_PREPROCESSING_HOOKS_HPP_INCLUDED)
+#endif // !defined(PREPROCESSING_HOOKS_HPP_338DE478_A13C_4B63_9BA9_041C917793B8_INCLUDED)

Modified: boost/trunk/boost/wave/token_ids.hpp
===================================================================
--- boost/trunk/boost/wave/token_ids.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/token_ids.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -307,17 +307,17 @@
 #undef BASEID_FROM_TOKEN
 #define BASEID_FROM_TOKEN(tok)                                                \
     boost::wave::token_id(((tok) & ~boost::wave::ExtTokenTypeMask))           \
-  /**/
+    /**/
 #define BASE_TOKEN(tok)                                                       \
     boost::wave::token_id((tok) & boost::wave::MainTokenMask)                 \
-  /**/
+    /**/
 #define CATEGORY_FROM_TOKEN(tok) ((tok) & boost::wave::TokenTypeMask)
 #define EXTCATEGORY_FROM_TOKEN(tok) ((tok) & boost::wave::ExtTokenTypeMask)
-#define IS_CATEGORY(tok, cat)    \
-    ((CATEGORY_FROM_TOKEN(tok) == (cat)) ? true : false) \
+#define IS_CATEGORY(tok, cat)                                                 \
+    ((CATEGORY_FROM_TOKEN(tok) == (cat)) ? true : false)                      \
     /**/
-#define IS_EXTCATEGORY(tok, cat)    \
-    ((EXTCATEGORY_FROM_TOKEN(tok) == (cat)) ? true : false) \
+#define IS_EXTCATEGORY(tok, cat)                                              \
+    ((EXTCATEGORY_FROM_TOKEN(tok) == (cat)) ? true : false)                   \
     /**/
 
 ///////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/wave/util/cpp_ifblock.hpp
===================================================================
--- boost/trunk/boost/wave/util/cpp_ifblock.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/cpp_ifblock.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/util/cpp_include_paths.hpp
===================================================================
--- boost/trunk/boost/wave/util/cpp_include_paths.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/cpp_include_paths.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/util/cpp_iterator.hpp
===================================================================
--- boost/trunk/boost/wave/util/cpp_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/cpp_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -155,7 +155,7 @@
         ++begin;
         
 // parse the macro definition
-position_type act_pos("command line", 0);
+position_type act_pos("<command line>", 0);
 boost::spirit::tree_parse_info<lexer_type> hit = 
     predef_macros_type::parse_predefined_macro(
         lexer_type(begin, end, position_type(), language), lexer_type());
@@ -217,10 +217,13 @@
     static result_type const eof;
 
 private:
+// type of a token sequence
+    typedef typename ContextT::token_sequence_type      token_sequence_type;
+
     typedef typename ContextT::lexer_type               lexer_type;
     typedef typename result_type::string_type           string_type;
     typedef typename result_type::position_type         position_type;
-    typedef boost::wave::grammars::cpp_grammar_gen<lexer_type> 
+    typedef boost::wave::grammars::cpp_grammar_gen<lexer_type, token_sequence_type> 
         cpp_grammar_type;
 
 //  iteration context related types (an iteration context represents a current
@@ -240,9 +243,6 @@
     typedef typename parse_tree_match_type::parse_node_t parse_node_value_type; // node_val_data<>
     typedef typename parse_tree_match_type::container_t  parse_tree_type;       // parse_node_type::children_t
 
-// type of a token sequence
-    typedef typename ContextT::token_sequence_type      token_sequence_type;
-
 public:
     template <typename IteratorT>
     pp_iterator_functor(ContextT &ctx_, IteratorT const &first_, 
@@ -282,8 +282,8 @@
     template <typename IteratorT>
     bool can_ignore_pp_directive(IteratorT &it);
     bool dispatch_directive(tree_parse_info_type const &hit,
-        result_type const& found_directive);
-    void replace_undefined_identifiers(token_sequence_type &expanded);
+        result_type const& found_directive,
+        token_sequence_type const& found_eoltokens);
 
     void on_include(string_type const &s, bool is_system, bool include_next);
     void on_include(typename parse_tree_type::const_iterator const &begin,
@@ -292,24 +292,21 @@
     void on_define(parse_node_type const &node);
     void on_undefine(result_type const &t);
     
-    void on_ifdef(result_type const& found_directive,
-        typename parse_tree_type::const_iterator const &begin,
+    void on_ifdef(typename parse_tree_type::const_iterator const &begin,
         typename parse_tree_type::const_iterator const &end);
-    void on_ifndef(result_type const& found_directive,
-        typename parse_tree_type::const_iterator const &begin,
+    void on_ifndef(typename parse_tree_type::const_iterator const &begin,
         typename parse_tree_type::const_iterator const &end);
     void on_else();
     void on_endif();
-    void on_illformed(typename result_type::string_type const &s);
+    void on_illformed(typename result_type::string_type s);
         
     void on_line(typename parse_tree_type::const_iterator const &begin,
         typename parse_tree_type::const_iterator const &end);
-    void on_if(result_type const& found_directive,
-        typename parse_tree_type::const_iterator const &begin,
+    void on_if(typename parse_tree_type::const_iterator const &begin,
         typename parse_tree_type::const_iterator const &end);
-    void on_elif(result_type const& found_directive,
-        typename parse_tree_type::const_iterator const &begin,
-        typename parse_tree_type::const_iterator const &end);
+    void on_elif(typename parse_tree_type::const_iterator const &begin,
+        typename parse_tree_type::const_iterator const &end,
+        token_sequence_type const& found_eoltokens);
     void on_error(typename parse_tree_type::const_iterator const &begin,
         typename parse_tree_type::const_iterator const &end);
 #if BOOST_WAVE_SUPPORT_WARNING_DIRECTIVE != 0
@@ -364,12 +361,8 @@
 {
     if (iter_ctx->first == iter_ctx->last && ctx.get_iteration_depth() > 0) {
     // call the include policy trace function
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
         ctx.get_hooks().returning_from_include_file();
-#else
-        ctx.get_hooks().returning_from_include_file(ctx);
-#endif
-
+        
     // restore the previous iteration context after finishing the preprocessing 
     // of the included file
         BOOST_WAVE_STRINGTYPE oldfile = iter_ctx->real_filename;
@@ -418,7 +411,7 @@
 //      throws a preprocess_exception, if appropriate
 //
 ///////////////////////////////////////////////////////////////////////////////
-namespace {
+namespace impl {
 
     //  It may be necessary to emit a #line directive either 
     //  - when comments need to be preserved: if the current token is not a 
@@ -473,7 +466,7 @@
     
 // if there were skipped any newlines, we must emit a #line directive
     if ((must_emit_line_directive || (was_seen_newline && skipped_newline)) && 
-        consider_emitting_line_directive(ctx, id)) 
+        impl::consider_emitting_line_directive(ctx, id)) 
     {
     // must emit a #line directive
         if (need_emit_line_directives(ctx.get_language()) && emit_line_directive()) 
@@ -485,15 +478,17 @@
     }
     
 // cleanup of certain tokens required
-    seen_newline = skipped_newline;
+    seen_newline = false;
     switch (static_cast<unsigned int>(id)) {
     case T_NONREPLACABLE_IDENTIFIER:
         act_token.set_token_id(T_IDENTIFIER);
+        id = T_IDENTIFIER;
         break;
 
-    case T_GENERATEDNEWLINE:      // was generated by emit_line_directive()
-        act_token.set_token_id(T_NEWLINE);
+    case T_GENERATEDNEWLINE:  // was generated by emit_line_directive()
+        act_token.set_token_id(id = T_NEWLINE);
         ++iter_ctx->emitted_lines;
+        seen_newline = true;
         break;
         
     case T_NEWLINE:
@@ -502,9 +497,13 @@
         ++iter_ctx->emitted_lines;
         break;
 
-    case T_PP_NUMBER:
+    case T_CCOMMENT:          // will come here only if whitespace is preserved
+        iter_ctx->emitted_lines += 
+            context_policies::util::ccomment_count_newlines(act_token);
+        break;
+        
+    case T_PP_NUMBER:        // re-tokenize the pp-number
         {
-        // re-tokenize the pp-number
             token_sequence_type rescanned;
             
             std::string pp_number(act_token.get_value().c_str());
@@ -526,7 +525,9 @@
         seen_newline = true;
         break;
 
-    default:
+    default:    // make sure whitespace at line begin keeps seen_newline status
+        if (IS_CATEGORY(id, WhiteSpaceTokenType))
+            seen_newline = skipped_newline;
         break;
     }
 
@@ -590,7 +591,7 @@
                 ++iter_ctx->first;
 
             // now make sure this line has a newline
-                if (!seen_newline && 
+                if ((!seen_newline || act_pos.get_column() > 1) && 
                     !(support_option_single_line & get_support_options(ctx.get_language()))) 
                 {
                 // warn, if this file does not end with a newline
@@ -608,11 +609,7 @@
                 
                 if (!ctx.get_if_block_status()) {
                 // skip this token because of the disabled #if block
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
                     ctx.get_hooks().skipped_token(act_token);
-#else
-                    ctx.get_hooks().skipped_token(ctx, act_token);
-#endif
                     continue;
                 }
                 return act_token; 
@@ -643,38 +640,28 @@
                 }
 
             // next token
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
                 ctx.get_hooks().skipped_token(act_token);
-#else
-                ctx.get_hooks().skipped_token(ctx, act_token);
-#endif
                 ++iter_ctx->first;
             }
             
         } while ((iter_ctx->first != iter_ctx->last) || 
                  (returned_from_include_file = returned_from_include()));
+
+    // overall eof reached
+        if (ctx.get_if_block_depth() > 0 &&
+            !(support_option_single_line & get_support_options(ctx.get_language()))) 
+        {
+        // missing endif directive(s)
+            BOOST_WAVE_THROW(preprocess_exception, missing_matching_endif, "", 
+                act_pos);
+        }
     }
+    else {
+        act_token = eof;            // this is the last token
+    }
     
-//    if (returned_from_include_file) {
-//    // if there was an '#include' statement on the last line of the main file 
-//    // we have to return an additional newline token
-//        seen_newline = true;
-//        
-//        whitespace.shift_tokens(T_NEWLINE);  // whitespace controller
-//        return act_token = result_type(T_NEWLINE, 
-//            typename result_type::string_type("\n"), 
-//            cpp_grammar_type::pos_of_newline);
-//    }
-    
-// overall eof reached
-    if (ctx.get_if_block_depth() > 0) {
-    // missing endif directive(s)
-        BOOST_WAVE_THROW(preprocess_exception, missing_matching_endif, "", 
-            act_pos);
-    }
-
     whitespace.shift_tokens(T_EOF);     // whitespace controller
-    return act_token = eof;             // return eof token
+    return act_token;                   // return eof token
 }
 
 ///////////////////////////////////////////////////////////////////////////////
@@ -779,6 +766,7 @@
         // if there are pending tokens in the queue, return the first one
             act_token = pending_queue.front();
             pending_queue.pop_front();
+            act_pos = act_token.get_position();
         }
         else if (!unput_queue.empty()
               || T_IDENTIFIER == id 
@@ -799,7 +787,6 @@
         id = token_id(act_token);
         
     } while (T_PLACEHOLDER == id);
-
     return act_token;
 }
 
@@ -808,7 +795,7 @@
 //  pp_directive(): recognize a preprocessor directive
 //
 ///////////////////////////////////////////////////////////////////////////////
-namespace {
+namespace impl {
 
     template <typename ContexT, typename IteratorT>
     bool next_token_is_pp_directive(ContexT &ctx, IteratorT &it, IteratorT const &end)
@@ -822,13 +809,8 @@
                 break;          // skip leading whitespace
             if (IS_CATEGORY(id, EOLTokenType))
                 break;          // do not enter a new line
-
-            // this token get's skipped
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
-            ctx.get_hooks().skipped_token(*it);   
-#else
-            ctx.get_hooks().skipped_token(ctx, *it);
-#endif
+                
+            ctx.get_hooks().skipped_token(*it);   // this token get's skipped
         }
         BOOST_ASSERT(it == end || id != T_UNKNOWN);
         return it != end && IS_CATEGORY(id, PPTokenType);
@@ -838,23 +820,15 @@
     bool pp_is_last_on_line(ContexT &ctx, IteratorT &it, IteratorT const &end)
     {
         using namespace boost::wave;
-        // this token get's skipped
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
-        ctx.get_hooks().skipped_token(*it);
-#else
-        ctx.get_hooks().skipped_token(ctx, *it);
-#endif
+        
+        ctx.get_hooks().skipped_token(*it);     // this token get's skipped
 
         for (++it; it != end; ++it) {
             token_id id = token_id(*it);
             if (T_CPPCOMMENT == id || T_NEWLINE == id ||
                 context_policies::util::ccomment_has_newline(*it)) 
             {
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
                 ctx.get_hooks().skipped_token(*it);
-#else
-                ctx.get_hooks().skipped_token(ctx, *it);
-#endif
                 ++it;           // skip eol/C/C++ comment
                 return true;    // no more significant tokens on this line
             }
@@ -862,12 +836,7 @@
             if (!IS_CATEGORY(id, WhiteSpaceTokenType))
                 break;
 
-            // this token get's skipped
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
-            ctx.get_hooks().skipped_token(*it);
-#else
-            ctx.get_hooks().skipped_token(ctx, *it);
-#endif
+            ctx.get_hooks().skipped_token(*it);   // this token get's skipped
         }
         return false;
     }
@@ -880,11 +849,7 @@
         for (/**/; it != end; ++it) {
         token_id id = token_id(*it);
         
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
             ctx.get_hooks().skipped_token(*it);
-#else
-            ctx.get_hooks().skipped_token(ctx, *it);
-#endif
             if (T_CPPCOMMENT == id || T_NEWLINE == id ||
                 context_policies::util::ccomment_has_newline(*it)) 
             {
@@ -928,16 +893,20 @@
             break;
 
         case T_PP_ELSE:         // #else
+        case T_PP_ENDIF:        // #endif
             {
             // handle this directive
-                on_else();
+                if (T_PP_ELSE == token_id(*it))
+                    on_else();
+                else
+                    on_endif();
 
             // make sure, there are no (non-whitespace) tokens left on this line                
                 string_type value ((*it).get_value());
-                if (!pp_is_last_on_line(ctx, it, iter_ctx->last)) {
+                if (!impl::pp_is_last_on_line(ctx, it, iter_ctx->last)) {
                 // enable error recovery (start over with the next line)
+                    impl::skip_to_eol(ctx, it, iter_ctx->last);
                     seen_newline = true;
-                    skip_to_eol(ctx, it, iter_ctx->last);
                     iter_ctx->first = it;
                 
                 // report an invalid #else directive
@@ -951,10 +920,6 @@
             }
             return true;
               
-        case T_PP_ENDIF:        // #endif
-            on_endif();
-            break;
-
         default:                // #something else
             on_illformed((*it).get_value());
             break;
@@ -964,7 +929,7 @@
 // start over with the next line, if only possible
     if (can_exit) {
         string_type value ((*it).get_value());
-        if (!skip_to_eol(ctx, it, iter_ctx->last)) {
+        if (!impl::skip_to_eol(ctx, it, iter_ctx->last)) {
         // The line doesn't end with an eol but eof token.
             seen_newline = true;    // allow to resume after warning
             iter_ctx->first = it;
@@ -991,10 +956,10 @@
 // test, if the next non-whitespace token is a pp directive
 lexer_type it = iter_ctx->first;
 
-    if (!next_token_is_pp_directive(ctx, it, iter_ctx->last)) {
+    if (!impl::next_token_is_pp_directive(ctx, it, iter_ctx->last)) {
     // eventually skip null pp directive (no need to do it via the parser)
         if (it != iter_ctx->last && T_POUND == BASE_TOKEN(token_id(*it))) {
-            if (pp_is_last_on_line(ctx, it, iter_ctx->last)) {
+            if (impl::pp_is_last_on_line(ctx, it, iter_ctx->last)) {
             // start over with the next line
                 seen_newline = true;
                 iter_ctx->first = it;
@@ -1026,9 +991,10 @@
 // found a pp directive, so try to identify it, start with the pp_token
 bool found_eof = false;
 result_type found_directive;
+token_sequence_type found_eoltokens;
 
 tree_parse_info_type hit = cpp_grammar_type::parse_cpp_grammar(
-    it, iter_ctx->last, act_pos, found_eof, found_directive);
+    it, iter_ctx->last, act_pos, found_eof, found_directive, found_eoltokens);
 
     if (hit.match) {
     // position the iterator past the matched sequence to allow 
@@ -1039,7 +1005,7 @@
 
     // found a valid pp directive, dispatch to the correct function to handle 
     // the found pp directive
-    bool result = dispatch_directive (hit, found_directive);
+    bool result = dispatch_directive (hit, found_directive, found_eoltokens);
     
         if (found_eof) {
         // The line was terminated with an end of file token.
@@ -1050,6 +1016,18 @@
         }
         return result;
     }
+    else if (token_id(found_directive) != T_EOF) {
+    // recognized invalid directive
+        impl::skip_to_eol(ctx, it, iter_ctx->last);
+        seen_newline = true;
+        
+        string_type str(boost::wave::util::impl::as_string<string_type>(
+            iter_ctx->first, it));
+        iter_ctx->first = it;
+
+    // report the ill formed directive
+        on_illformed(str);
+    }
     return false;
 }
 
@@ -1061,7 +1039,8 @@
 template <typename ContextT> 
 inline bool
 pp_iterator_functor<ContextT>::dispatch_directive(
-    tree_parse_info_type const &hit, result_type const& found_directive)
+    tree_parse_info_type const &hit, result_type const& found_directive,
+    token_sequence_type const& found_eoltokens)
 {
     using namespace cpplexer;
     using namespace boost::spirit;
@@ -1082,11 +1061,7 @@
 token_id id = token_id(found_directive);
 
     // call preprocessing hook
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
     ctx.get_hooks().found_directive(found_directive);     
-#else
-    ctx.get_hooks().found_directive(ctx, found_directive);     
-#endif
     
     switch (static_cast<unsigned int>(id)) {
     case T_PP_QHEADER:      // #include "..."
@@ -1121,19 +1096,19 @@
         break;
 
     case T_PP_IFDEF:        // #ifdef
-        on_ifdef(found_directive, begin_child_it, end_child_it);
+        on_ifdef(begin_child_it, end_child_it);
         break;
 
     case T_PP_IFNDEF:       // #ifndef
-        on_ifndef(found_directive, begin_child_it, end_child_it);
+        on_ifndef(begin_child_it, end_child_it);
         break;
 
     case T_PP_IF:           // #if
-        on_if(found_directive, begin_child_it, end_child_it);
+        on_if(begin_child_it, end_child_it);
         break;
 
     case T_PP_ELIF:         // #elif
-        on_elif(found_directive, begin_child_it, end_child_it);
+        on_elif(begin_child_it, end_child_it, found_eoltokens);
         break;
 
     case T_PP_ELSE:         // #else
@@ -1227,11 +1202,7 @@
 #endif
 
 // call the include policy trace function
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
     ctx.get_hooks().found_include_directive(f, include_next);
-#else
-    ctx.get_hooks().found_include_directive(ctx, f, include_next);
-#endif
 
     file_path = util::impl::unescape_lit(file_path);
     if (!ctx.find_include_file (file_path, dir_path, is_system, current_name)) {
@@ -1260,13 +1231,8 @@
             act_pos, boost::wave::enable_prefer_pp_numbers(ctx.get_language())));
 
     // call the include policy trace function
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
         ctx.get_hooks().opened_include_file(dir_path, file_path,
             ctx.get_iteration_depth(), is_system);
-#else
-        ctx.get_hooks().opened_include_file(ctx, dir_path, file_path,
-            is_system);
-#endif
 
     // store current file position
         iter_ctx->filename = act_pos.get_file();
@@ -1295,7 +1261,7 @@
 //
 ///////////////////////////////////////////////////////////////////////////////
 
-namespace {
+namespace impl {
 
     // trim all whitespace from the beginning and the end of the given string
     template <typename StringT>
@@ -1334,7 +1300,7 @@
         false);
 
 // now, include the file
-string_type s (trim_whitespace(boost::wave::util::impl::as_string(expanded)));
+string_type s (impl::trim_whitespace(boost::wave::util::impl::as_string(expanded)));
 bool is_system = '<' == s[0] && '>' == s[s.size()-1];
 
     if (!is_system && !('\"' == s[0] && '\"' == s[s.size()-1])) {
@@ -1375,7 +1341,7 @@
 #if BOOST_WAVE_SUPPORT_VARIADICS_PLACEMARKERS != 0
         if (boost::wave::need_variadics(ctx.get_language())) {
         // test whether ellipsis are given, and if yes, if these are placed as the
-        // last argument
+        // last argument, test if __VA_ARGS__ is used as a macro parameter name
             using namespace cpplexer;
             typedef typename std::vector<result_type>::iterator 
                 parameter_iterator_t;
@@ -1392,6 +1358,12 @@
                 }
                 if (T_ELLIPSIS == token_id(*pit)) 
                     seen_ellipses = true;
+
+                // can't use __VA_ARGS__ as a argument name
+                if ("__VA_ARGS__" == (*pit).get_value()) {
+                    BOOST_WAVE_THROW(preprocess_exception, bad_define_statement_va_args, 
+                        macroname.get_value().c_str(), (*pit).get_position());
+                }
             }
             
         // if there wasn't an ellipsis, then there shouldn't be a __VA_ARGS__ 
@@ -1412,7 +1384,7 @@
                 }
                 if (seen_va_args) {
                 // must not have seen __VA_ARGS__ placeholder
-                    BOOST_WAVE_THROW(preprocess_exception, bad_define_statement, 
+                    BOOST_WAVE_THROW(preprocess_exception, bad_define_statement_va_args, 
                         macroname.get_value().c_str(), act_token.get_position());
                 }
             }
@@ -1466,7 +1438,6 @@
 template <typename ContextT> 
 inline void  
 pp_iterator_functor<ContextT>::on_ifdef(
-    result_type const& found_directive,
     typename parse_tree_type::const_iterator const &begin,
     typename parse_tree_type::const_iterator const &end)
 {
@@ -1477,17 +1448,9 @@
         make_ref_transform_iterator((*begin).children.end(), get_value),
         std::inserter(toexpand, toexpand.end()));
 
-bool is_defined = false;
+bool is_defined = ctx.is_defined_macro(toexpand.begin(), toexpand.end());
 
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
-    is_defined = ctx.is_defined_macro(toexpand.begin(), toexpand.end());
     ctx.get_hooks().evaluated_conditional_expression(toexpand, is_defined);
-#else
-    do {
-        is_defined = ctx.is_defined_macro(toexpand.begin(), toexpand.end());
-    } while (ctx.get_hooks().evaluated_conditional_expression(ctx, 
-             found_directive, toexpand, is_defined));
-#endif
     ctx.enter_if_block(is_defined);
 }
 
@@ -1499,7 +1462,6 @@
 template <typename ContextT> 
 inline void  
 pp_iterator_functor<ContextT>::on_ifndef(
-    result_type const& found_directive,
     typename parse_tree_type::const_iterator const &begin,
     typename parse_tree_type::const_iterator const &end)
 {
@@ -1510,17 +1472,9 @@
         make_ref_transform_iterator((*begin).children.end(), get_value),
         std::inserter(toexpand, toexpand.end()));
 
-bool is_defined = false;
+bool is_defined = ctx.is_defined_macro(toexpand.begin(), toexpand.end());
 
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
-    is_defined = ctx.is_defined_macro(toexpand.begin(), toexpand.end());
     ctx.get_hooks().evaluated_conditional_expression(toexpand, is_defined);
-#else
-    do {
-        is_defined = ctx.is_defined_macro(toexpand.begin(), toexpand.end());
-    } while (ctx.get_hooks().evaluated_conditional_expression(ctx, 
-             found_directive, toexpand, is_defined));
-#endif
     ctx.enter_if_block(!is_defined);
 }
 
@@ -1557,29 +1511,6 @@
 }
 
 ///////////////////////////////////////////////////////////////////////////////
-//  replace all remaining (== undefined) identifiers with an integer literal '0'
-template <typename ContextT> 
-inline void  
-pp_iterator_functor<ContextT>::replace_undefined_identifiers(
-    token_sequence_type &expanded)
-{
-    typename token_sequence_type::iterator exp_end = expanded.end();
-    for (typename token_sequence_type::iterator exp_it = expanded.begin();
-         exp_it != exp_end; ++exp_it)
-    {
-        using namespace boost::wave;
-        
-        token_id id = token_id(*exp_it);
-        if (IS_CATEGORY(id, IdentifierTokenType) ||
-            IS_CATEGORY(id, KeywordTokenType))
-        {
-            (*exp_it).set_token_id(T_INTLIT);
-            (*exp_it).set_value("0");
-        }
-    }
-}
-
-///////////////////////////////////////////////////////////////////////////////
 //  
 //  on_if(): handle #if directives
 //
@@ -1587,50 +1518,79 @@
 template <typename ContextT> 
 inline void  
 pp_iterator_functor<ContextT>::on_if(
-    result_type const& found_directive,
     typename parse_tree_type::const_iterator const &begin,
     typename parse_tree_type::const_iterator const &end)
 {
 // preprocess the given sequence into the provided list
 get_token_value<result_type, parse_node_type> get_value;
+token_sequence_type expanded;
 token_sequence_type toexpand;
 
     std::copy(make_ref_transform_iterator(begin, get_value), 
         make_ref_transform_iterator(end, get_value),
         std::inserter(toexpand, toexpand.end()));
 
-bool if_status = false;
+    typename token_sequence_type::iterator begin2 = toexpand.begin();
+    ctx.expand_whole_tokensequence(begin2, toexpand.end(), expanded);
 
-    do {
-    token_sequence_type expanded;
-
-        typename token_sequence_type::iterator begin2 = toexpand.begin();
-        ctx.expand_whole_tokensequence(begin2, toexpand.end(), expanded);
-
-    // replace all remaining (== undefined) identifiers with an integer literal '0'
-        replace_undefined_identifiers(expanded);
+// replace all remaining (== undefined) identifiers with an integer literal '0'
+    typename token_sequence_type::iterator exp_end = expanded.end();
+    for (typename token_sequence_type::iterator exp_it = expanded.begin();
+         exp_it != exp_end; ++exp_it)
+    {
+        using namespace boost::wave;
+        
+        token_id id = token_id(*exp_it);
+        if (IS_CATEGORY(id, IdentifierTokenType) ||
+            IS_CATEGORY(id, KeywordTokenType))
+        {
+            (*exp_it).set_token_id(T_INTLIT);
+            (*exp_it).set_value("0");
+        }
+    }
     
 #if BOOST_WAVE_DUMP_CONDITIONAL_EXPRESSIONS != 0
-        {
-            string_type outstr(boost::wave::util::impl::as_string(toexpand));
-            outstr += "(" + boost::wave::util::impl::as_string(expanded) + ")";
-            BOOST_WAVE_DUMP_CONDITIONAL_EXPRESSIONS_OUT << "#if " << outstr 
-                << std::endl;
-        }
+    {
+        string_type outstr(boost::wave::util::impl::as_string(toexpand));
+        outstr += "(" + boost::wave::util::impl::as_string(expanded) + ")";
+        BOOST_WAVE_DUMP_CONDITIONAL_EXPRESSIONS_OUT << "#if " << outstr 
+            << std::endl;
+    }
 #endif
 
-    // parse the expression and enter the #if block
-        if_status = grammars::expression_grammar_gen<result_type>::
-                evaluate(expanded.begin(), expanded.end(), act_pos,
-                    ctx.get_if_block_status());
+// parse the expression and enter the #if block
+grammars::value_error status = grammars::error_noerror;
+bool if_status = grammars::expression_grammar_gen<result_type>::
+            evaluate(expanded.begin(), expanded.end(), act_pos,
+                ctx.get_if_block_status(), status);
                 
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
-    } while (ctx.get_hooks().evaluated_conditional_expression(toexpand, 
-             if_status), false);
-#else
-    } while (ctx.get_hooks().evaluated_conditional_expression(ctx, 
-             found_directive, toexpand, if_status));
-#endif
+    ctx.get_hooks().evaluated_conditional_expression(toexpand, if_status);
+    if (grammars::error_noerror != status) {
+    // division or other error by zero occurred
+        string_type expression = util::impl::as_string(expanded);
+        if (0 == expression.size()) 
+            expression = "<empty expression>";
+            
+        if (grammars::error_division_by_zero & status) {
+            BOOST_WAVE_THROW(preprocess_exception, division_by_zero, 
+                expression.c_str(), act_pos);
+        }
+        if (grammars::error_integer_overflow & status) {
+        // we may validly continue 
+            ctx.enter_if_block(if_status);
+            BOOST_WAVE_THROW(preprocess_exception, integer_overflow, 
+                expression.c_str(), act_pos);
+            return;
+        }
+        if (grammars::error_character_overflow & status) {
+        // we may validly continue 
+            ctx.enter_if_block(if_status);
+            BOOST_WAVE_THROW(preprocess_exception, 
+                character_literal_out_of_range, expression.c_str(), act_pos);
+            return;
+        }
+    }
+
     ctx.enter_if_block(if_status);
 }
 
@@ -1642,61 +1602,108 @@
 template <typename ContextT> 
 inline void  
 pp_iterator_functor<ContextT>::on_elif(
-    result_type const& found_directive,
     typename parse_tree_type::const_iterator const &begin,
-    typename parse_tree_type::const_iterator const &end)
+    typename parse_tree_type::const_iterator const &end,
+    token_sequence_type const& found_eoltokens)
 {
+// preprocess the given sequence into the provided list
+get_token_value<result_type, parse_node_type> get_value;
+token_sequence_type toexpand;
+
+    std::copy(make_ref_transform_iterator(begin, get_value), 
+        make_ref_transform_iterator(end, get_value),
+        std::inserter(toexpand, toexpand.end()));
+
+// check current if block status
     if (ctx.get_if_block_some_part_status()) {
         if (!ctx.enter_elif_block(false)) {
         // #else without matching #if
             BOOST_WAVE_THROW(preprocess_exception, missing_matching_if, "#elif", 
                 act_pos);
         }
+
+    // skip all the expression and the trailing whitespace
+    typename token_sequence_type::iterator begin2 = toexpand.begin();
+    typename token_sequence_type::const_iterator begin3 = found_eoltokens.begin();
+
+        impl::skip_to_eol(ctx, begin2, toexpand.end());
+        impl::skip_to_eol(ctx, begin3, found_eoltokens.end());
         return;     // one of previous #if/#elif was true, so don't enter this #elif 
     }
             
 // preprocess the given sequence into the provided list
-get_token_value<result_type, parse_node_type> get_value;
-token_sequence_type toexpand;
+token_sequence_type expanded;
 
-    std::copy(make_ref_transform_iterator(begin, get_value), 
-        make_ref_transform_iterator(end, get_value),
-        std::inserter(toexpand, toexpand.end()));
-
-bool if_status = false;
-
-    do {
-    token_sequence_type expanded;
-
-        typename token_sequence_type::iterator begin2 = toexpand.begin();
-        ctx.expand_whole_tokensequence(begin2, toexpand.end(), expanded);
+    typename token_sequence_type::iterator begin2 = toexpand.begin();
+    ctx.expand_whole_tokensequence(begin2, toexpand.end(), expanded);
     
-    // replace all remaining (== undefined) identifiers with an integer literal '0'
-        replace_undefined_identifiers(expanded);
+// replace all remaining (== undefined) identifiers with an integer literal '0'
+    typename token_sequence_type::iterator exp_end = expanded.end();
+    for (typename token_sequence_type::iterator exp_it = expanded.begin();
+         exp_it != exp_end; ++exp_it)
+    {
+        using namespace boost::wave;
+        
+        token_id id = token_id(*exp_it);
+        if (IS_CATEGORY(id, IdentifierTokenType) ||
+            IS_CATEGORY(id, KeywordTokenType))
+        {
+            (*exp_it).set_token_id(T_INTLIT);
+            (*exp_it).set_value("0");
+        }
+    }
 
 #if BOOST_WAVE_DUMP_CONDITIONAL_EXPRESSIONS != 0
-        {
-            string_type outstr(boost::wave::util::impl::as_string(toexpand));
-            outstr += "(" + boost::wave::util::impl::as_string(expanded) + ")";
-            BOOST_WAVE_DUMP_CONDITIONAL_EXPRESSIONS_OUT << "#elif " << outstr << std::endl;
-        }
+    {
+        string_type outstr(boost::wave::util::impl::as_string(toexpand));
+        outstr += "(" + boost::wave::util::impl::as_string(expanded) + ")";
+        BOOST_WAVE_DUMP_CONDITIONAL_EXPRESSIONS_OUT << "#elif " << outstr << std::endl;
+    }
 #endif
 
 // parse the expression and enter the #elif block
-        if_status = grammars::expression_grammar_gen<result_type>::
+grammars::value_error status = grammars::error_noerror;
+bool if_status = grammars::expression_grammar_gen<result_type>::
             evaluate(expanded.begin(), expanded.end(), act_pos,
-                ctx.get_if_block_status());
+                ctx.get_if_block_status(), status);
                 
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
-    } while (ctx.get_hooks().evaluated_conditional_expression(toexpand, 
-             if_status), false);
-#else
-    } while (ctx.get_hooks().evaluated_conditional_expression(ctx, 
-             found_directive, toexpand, if_status));
-#endif
-    
+    ctx.get_hooks().evaluated_conditional_expression(toexpand, if_status);
+    if (grammars::error_noerror != status) {
+    // division or other error by zero occurred
+        string_type expression = util::impl::as_string(expanded);
+        if (0 == expression.size()) 
+            expression = "<empty expression>";
+            
+        if (grammars::error_division_by_zero & status) {
+            BOOST_WAVE_THROW(preprocess_exception, division_by_zero, 
+                expression.c_str(), act_pos);
+        }
+        if (grammars::error_integer_overflow & status) {
+        // we validly may continue
+            if (!ctx.enter_elif_block(if_status)) { 
+            // #elif without matching #if
+                BOOST_WAVE_THROW(preprocess_exception, missing_matching_if, 
+                    "#elif", act_pos);
+            }
+            BOOST_WAVE_THROW(preprocess_exception, integer_overflow,
+                expression.c_str(), act_pos);
+            return;
+        }
+        if (grammars::error_character_overflow & status) {
+        // we validly may continue
+            if (!ctx.enter_elif_block(if_status)) { 
+            // #elif without matching #if
+                BOOST_WAVE_THROW(preprocess_exception, missing_matching_if, 
+                    "#elif", act_pos);
+            }
+            BOOST_WAVE_THROW(preprocess_exception, 
+                character_literal_out_of_range, expression.c_str(), act_pos);
+            return;
+        }
+    }
+
     if (!ctx.enter_elif_block(if_status)) { 
-    // #else without matching #if
+    // #elif without matching #if
         BOOST_WAVE_THROW(preprocess_exception, missing_matching_if, "#elif", 
             act_pos);
     }
@@ -1710,9 +1717,16 @@
 template <typename ContextT> 
 inline void  
 pp_iterator_functor<ContextT>::on_illformed(
-    typename result_type::string_type const &s)
+    typename result_type::string_type s)
 {
     BOOST_ASSERT(ctx.get_if_block_status());
+    
+    // some messages have more than one newline at the end
+    typename string_type::size_type p = s.find_last_not_of('\n');
+    if (string_type::npos != p)
+        s = s.substr(0, p+1);
+
+    // throw the exception
     BOOST_WAVE_THROW(preprocess_exception, ill_formed_directive, s.c_str(), 
         act_pos);
 }
@@ -1723,35 +1737,53 @@
 //
 ///////////////////////////////////////////////////////////////////////////////
 
-namespace {
+namespace impl {
 
     template <typename IteratorT, typename StringT>
     bool retrieve_line_info (IteratorT first, IteratorT const &last,
-        int &line, StringT &file)
+        int &line, StringT &file, 
+        boost::wave::preprocess_exception::error_code& error)
     {
         using namespace boost::wave;
-        if (T_PP_NUMBER == token_id(*first)) {
+        token_id id = token_id(*first);
+        if (T_PP_NUMBER == id || T_INTLIT == id) {
         // extract line number
             using namespace std;    // some systems have atoi in namespace std
-            line = atoi((*first).get_value().c_str());
-            
+            line = (unsigned int)atoi((*first).get_value().c_str());
+            if (0 == line)
+                error = preprocess_exception::bad_line_number;
+
+        // re-extract line number with spirit to diagnose overflow
+            using namespace boost::spirit;
+            if (!parse((*first).get_value().c_str(), int_p).full)
+                error = preprocess_exception::bad_line_number;
+                
         // extract file name (if it is given)
             while (++first != last && IS_CATEGORY(*first, WhiteSpaceTokenType)) 
                 /**/;   // skip whitespace
                 
             if (first != last) {
-                if (T_STRINGLIT != token_id(*first)) 
+                if (T_STRINGLIT != token_id(*first)) {
+                    error = preprocess_exception::bad_line_filename;
                     return false;
-
+                }
+                
             StringT const &file_lit = (*first).get_value();
             
-                if ('L' == file_lit[0])
+                if ('L' == file_lit[0]) {
+                    error = preprocess_exception::bad_line_filename;
                     return false;       // shouldn't be a wide character string 
-                    
+                }
+                
                 file = file_lit.substr(1, file_lit.size()-2);
+
+            // test if there is other junk on this line
+                while (++first != last && IS_CATEGORY(*first, WhiteSpaceTokenType)) 
+                    /**/;   // skip whitespace
             }
-            return true;
+            return first == last;
         }
+        error = preprocess_exception::bad_line_statement;
         return false;
     }
 }
@@ -1781,9 +1813,10 @@
 // try to interpret the #line body as a number followed by an optional
 // string literal
 int line = 0;
+preprocess_exception::error_code error = preprocess_exception::no_error;
 string_type file_name;
 
-    if (!retrieve_line_info(first, last, line, file_name)) {
+    if (!impl::retrieve_line_info(first, last, line, file_name, error)) {
     // preprocess the body of this #line message
     token_sequence_type toexpand;
 
@@ -1793,11 +1826,12 @@
         typename token_sequence_type::iterator begin2 = toexpand.begin();
         ctx.expand_whole_tokensequence(begin2, toexpand.end(), 
             expanded, false);
-            
-        if (!retrieve_line_info(expanded.begin(), expanded.end(), line, 
-            file_name))
+
+        error = preprocess_exception::no_error;
+        if (!impl::retrieve_line_info(expanded.begin(), expanded.end(), 
+            line, file_name, error))
         {
-            BOOST_WAVE_THROW(preprocess_exception, bad_line_statement, 
+            BOOST_WAVE_THROW_VAR(preprocess_exception, error, 
                 boost::wave::util::impl::as_string(expanded).c_str(), act_pos)
         }
     }
@@ -1806,17 +1840,22 @@
     BOOST_ASSERT(unput_queue.empty());
     BOOST_ASSERT(pending_queue.empty());
 
+// make sure error recovery starts on the next line
+    must_emit_line_directive = true;
+    
+// diagnose possible error in detected line directive
+    if (error != preprocess_exception::no_error) {
+        BOOST_WAVE_THROW_VAR(preprocess_exception, error, 
+            boost::wave::util::impl::as_string(expanded).c_str(), act_pos)
+    }    
+
+// set new line number/filename only if ok
     if (!file_name.empty()) {    // reuse current file name 
         using boost::wave::util::impl::unescape_lit;
         act_pos.set_file(unescape_lit(file_name).c_str());
     }
     act_pos.set_line(line);
-    
-//typename result_type::position_type nextline_pos = act_pos;
-//    
-//    nextline_pos.set_line(nextline_pos.get_line() + 1);
     iter_ctx->first.set_position(act_pos);
-    must_emit_line_directive = true;
 }
 
 ///////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/wave/util/cpp_macromap.hpp
===================================================================
--- boost/trunk/boost/wave/util/cpp_macromap.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/cpp_macromap.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -250,6 +250,13 @@
         BOOST_WAVE_THROW_NAME(macro_handling_exception, illegal_redefinition, 
             name.get_value().c_str(), main_pos, name.get_value().c_str());
     }
+    if (boost::wave::need_variadics(ctx.get_language()) && 
+        "__VA_ARGS__" == name.get_value()) 
+    {
+    // can't use __VA_ARGS__ as a macro name
+        BOOST_WAVE_THROW_NAME(macro_handling_exception, bad_define_statement_va_args, 
+            name.get_value().c_str(), main_pos, name.get_value().c_str());
+    }
     if (AltExtTokenType == (token_id(name) & ExtTokenOnlyMask)) {
     // exclude special operator names
         BOOST_WAVE_THROW_NAME(macro_handling_exception, 
@@ -318,15 +325,9 @@
     std::swap((*p.first).second->macrodefinition, definition);
     
 // call the context supplied preprocessing hook
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
     ctx.get_hooks().defined_macro(name, has_parameters, 
         (*p.first).second->macroparameters, 
         (*p.first).second->macrodefinition, is_predefined);
-#else
-    ctx.get_hooks().defined_macro(ctx, name, has_parameters, 
-        (*p.first).second->macroparameters, 
-        (*p.first).second->macrodefinition, is_predefined);
-#endif
     return true;
 }
 
@@ -435,11 +436,7 @@
         current_macros->erase(it);
         
     // call the context supplied preprocessing hook function
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
         ctx.get_hooks().undefined_macro(token);
-#else
-        ctx.get_hooks().undefined_macro(ctx, token);
-#endif
         return true;
     }
     else if (impl::is_special_macroname(name)) {
@@ -1124,10 +1121,6 @@
     // called as a function-like macro 
         impl::skip_to_token(first, last, T_LEFTPAREN);
         
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS == 0
-        IteratorT seqstart = first;
-#endif
-
         if (macro_def.is_functionlike) {
         // defined as a function-like macro
         
@@ -1169,30 +1162,18 @@
             }
                 
         // inject tracing support
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
             ctx.get_hooks().expanding_function_like_macro(
                 macro_def.macroname, macro_def.macroparameters, 
                 macro_def.macrodefinition, curr_token, arguments);
-#else
-            ctx.get_hooks().expanding_function_like_macro(
-                ctx, macro_def.macroname, macro_def.macroparameters, 
-                macro_def.macrodefinition, curr_token, arguments,
-                seqstart, first);
-#endif
-
+        
         // expand the replacement list of this macro
             expand_replacement_list(macro_def, arguments, expand_operator_defined,
                 replacement_list);
         }
         else {
         // defined as an object-like macro
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
             ctx.get_hooks().expanding_object_like_macro(
                 macro_def.macroname, macro_def.macrodefinition, curr_token);
-#else
-            ctx.get_hooks().expanding_object_like_macro(
-                ctx, macro_def.macroname, macro_def.macrodefinition, curr_token);
-#endif
 
         bool found = false;
         impl::find_concat_operator concat_tag(found);
@@ -1223,13 +1204,8 @@
         }
         else {
         // defined as an object-like macro (expand it)
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
             ctx.get_hooks().expanding_object_like_macro(
                 macro_def.macroname, macro_def.macrodefinition, curr_token);
-#else
-            ctx.get_hooks().expanding_object_like_macro(
-                ctx, macro_def.macroname, macro_def.macrodefinition, curr_token);
-#endif
 
         bool found = false;
         impl::find_concat_operator concat_tag(found);
@@ -1250,20 +1226,12 @@
 // rescan the replacement list
 ContainerT expanded_list;
 
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
     ctx.get_hooks().expanded_macro(replacement_list);
-#else
-    ctx.get_hooks().expanded_macro(ctx, replacement_list);
-#endif
     
     rescan_replacement_list(curr_token, macro_def, replacement_list, 
         expanded_list, expand_operator_defined, first, last);
     
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS != 0
     ctx.get_hooks().rescanned_macro(expanded_list);  
-#else
-    ctx.get_hooks().rescanned_macro(ctx, expanded_list);  
-#endif
     expanded.splice(expanded.end(), expanded_list);
     return true;        // rescan is required
 }
@@ -1344,8 +1312,10 @@
         parse_operator_defined(start, last, result);
     
     if (!hit.hit) {
+        string_type msg ("defined(): ");
+        msg = msg + util::impl::as_string<string_type>(first, last);
         BOOST_WAVE_THROW(preprocess_exception, ill_formed_expression, 
-            "defined()", main_pos);
+            msg.c_str(), main_pos);
     }
     impl::assign_iterator<IteratorT>::do_(first, hit.stop);
 
@@ -1493,8 +1463,13 @@
     typedef typename ContextT::lexer_type lexer_type;
     
     std::string value_to_test(new_value.c_str());
+
+    boost::wave::language_support lang = 
+        boost::wave::enable_prefer_pp_numbers(ctx.get_language());
+    lang = boost::wave::enable_single_line(lang);
+    
     lexer_type it = lexer_type(value_to_test.begin(), value_to_test.end(), pos, 
-        boost::wave::enable_prefer_pp_numbers(ctx.get_language()));
+        lang);
     lexer_type end = lexer_type();
     for (/**/; it != end && T_EOF != token_id(*it); ++it) 
         rescanned.push_back(*it);
@@ -1674,7 +1649,7 @@
 defined_macros_type *current_scope = scope ? scope : current_macros;
 
 // first, add the static macros
-position_type pos;
+position_type pos("<built-in>");
 
 #if BOOST_WAVE_SUPPORT_VARIADICS_PLACEMARKERS != 0
     if (boost::wave::need_c99(ctx.get_language())) {

Modified: boost/trunk/boost/wave/util/cpp_macromap_predef.hpp
===================================================================
--- boost/trunk/boost/wave/util/cpp_macromap_predef.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/cpp_macromap_predef.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/util/cpp_macromap_utils.hpp
===================================================================
--- boost/trunk/boost/wave/util/cpp_macromap_utils.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/cpp_macromap_utils.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -235,7 +235,8 @@
 const_iterator_type first2 = new_definition.begin();
 const_iterator_type last2 = new_definition.end();
     
-    while (first1 != last1 && token_equals(*first1, *first2)) {
+    while (first1 != last1 && first2 != last2 && token_equals(*first1, *first2)) 
+    {
     // skip whitespace, if both sequences have a whitespace next
     token_id id1 = next_token<const_iterator_type>::peek(first1, last1, false);
     token_id id2 = next_token<const_iterator_type>::peek(first2, last2, false);
@@ -279,8 +280,9 @@
 const_iterator_type first1 = parameters.begin();
 const_iterator_type last1 = parameters.end();
 const_iterator_type first2 = new_parameters.begin();
+const_iterator_type last2 = new_parameters.end();
 
-    while (first1 != last1) {
+    while (first1 != last1 && first2 != last2) {
     // parameters are different, if the corresponding tokens are different
         using namespace boost::wave;
         if (token_id(*first1) != token_id(*first2) ||
@@ -291,7 +293,7 @@
         ++first1;
         ++first2;
     }
-    return (first1 == last1) ? true : false;
+    return (first1 == last1 && first2 == last2) ? true : false;
 }
 
 ///////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/wave/util/file_position.hpp
===================================================================
--- boost/trunk/boost/wave/util/file_position.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/file_position.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/util/functor_input.hpp
===================================================================
--- boost/trunk/boost/wave/util/functor_input.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/functor_input.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/util/insert_whitespace_detection.hpp
===================================================================
--- boost/trunk/boost/wave/util/insert_whitespace_detection.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/insert_whitespace_detection.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -223,7 +223,7 @@
         case T_FLOATLIT:
             return impl::handle_floatlit(prev, beforeprev); 
         case T_STRINGLIT:
-            if (TOKEN_FROM_ID('L', UnknownTokenType) == prev)       // 'L'
+            if (TOKEN_FROM_ID('L', IdentifierTokenType) == prev)       // 'L'
                 return true;
             break;
         case T_LEFTBRACE_ALT:
@@ -313,6 +313,11 @@
                 IS_CATEGORY(prev, KeywordTokenType))
                 return true;
             break;
+            
+        case T_STAR:
+            if (T_STAR == prev)
+                return false;     // '*****' do not need to be separated
+            break;
         }
 
     // else, handle operators separately

Modified: boost/trunk/boost/wave/util/interpret_pragma.hpp
===================================================================
--- boost/trunk/boost/wave/util/interpret_pragma.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/interpret_pragma.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -126,9 +126,7 @@
             }
             
         // decode the option (call the context_policy hook)
-            if (!ctx.get_hooks().interpret_pragma(
-                  ctx, pending, option, values, act_token)) 
-            {
+            if (!ctx.interpret_pragma(pending, option, values, act_token)) {
             // unknown #pragma option 
             string_type option_str ((*it).get_value());
 

Modified: boost/trunk/boost/wave/util/iteration_context.hpp
===================================================================
--- boost/trunk/boost/wave/util/iteration_context.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/iteration_context.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/util/macro_definition.hpp
===================================================================
--- boost/trunk/boost/wave/util/macro_definition.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/macro_definition.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/util/macro_helpers.hpp
===================================================================
--- boost/trunk/boost/wave/util/macro_helpers.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/macro_helpers.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/util/pattern_parser.hpp
===================================================================
--- boost/trunk/boost/wave/util/pattern_parser.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/pattern_parser.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/util/symbol_table.hpp
===================================================================
--- boost/trunk/boost/wave/util/symbol_table.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/symbol_table.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/util/time_conversion_helper.hpp
===================================================================
--- boost/trunk/boost/wave/util/time_conversion_helper.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/time_conversion_helper.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/util/transform_iterator.hpp
===================================================================
--- boost/trunk/boost/wave/util/transform_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/transform_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/util/unput_queue_iterator.hpp
===================================================================
--- boost/trunk/boost/wave/util/unput_queue_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/util/unput_queue_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/wave_config.hpp
===================================================================
--- boost/trunk/boost/wave/wave_config.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/wave_config.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2005 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -164,10 +164,17 @@
 #if !defined(BOOST_WAVE_STRINGTYPE)
 
 #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) || \
-    BOOST_WORKAROUND(__MWERKS__, < 0x3200)
-// VC7 isn't able to compile the flex_string class, fallback to std::string 
-// CW upto 8.3 chokes as well *sigh*
+    BOOST_WORKAROUND(__MWERKS__, < 0x3200) || \
+    (defined(__DECCXX) && defined(__alpha)) || \
+    defined(BOOST_WAVE_STRINGTYPE_USE_STDSTRING)
+    
+// VC7 isn't able to compile the flex_string class, fall back to std::string 
+// CW up to 8.3 chokes as well *sigh*
+// Tru64/CXX has linker problems when using flex_string
 #define BOOST_WAVE_STRINGTYPE std::string
+#if !defined(BOOST_WAVE_STRINGTYPE_USE_STDSTRING)
+#define BOOST_WAVE_STRINGTYPE_USE_STDSTRING 1
+#endif
 
 #else
 // use the following, if you have a fast std::allocator<char>
@@ -393,26 +400,4 @@
 #endif  // auto-linking disabled
 #endif  // BOOST_VERSION
 
-///////////////////////////////////////////////////////////////////////////////
-//  Compatibility macros 
-//  (ensure interface compatibility to older Wave versions)
-///////////////////////////////////////////////////////////////////////////////
-
-///////////////////////////////////////////////////////////////////////////////
-//  The preprocessing hook signatures changed after the Boost V1.34.0 release
-//
-//  To use the preprocessing hook signatures as released with Boost V1.34.0 
-//  you need to define the BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS 
-//  constant to something not equal zero.
-//
-//  To force using the new interface define this constant to zero.
-//
-#if !defined(BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS)
-#if BOOST_VERSION < 103500  // before Boost V1.35.0
-#define BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS 1
-#else
-#define BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS 0
-#endif
-#endif
-
 #endif // !defined(WAVE_CONFIG_HPP_F143F90A_A63F_4B27_AC41_9CA4F14F538D_INCLUDED)

Modified: boost/trunk/boost/wave/wave_config_constant.hpp
===================================================================
--- boost/trunk/boost/wave/wave_config_constant.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/wave_config_constant.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2005 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/wave/wave_version.hpp
===================================================================
--- boost/trunk/boost/wave/wave_version.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/wave_version.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -16,11 +16,11 @@
 //  BOOST_WAVE_VERSION & 0x0000FF is the sub-minor version
 //  BOOST_WAVE_VERSION & 0x00FF00 is the minor version
 //  BOOST_WAVE_VERSION & 0xFF0000 is the major version
-#define BOOST_WAVE_VERSION                 0x010205
+#define BOOST_WAVE_VERSION                 0x010204
 
 //  The following defines contain the same information as above
 #define BOOST_WAVE_VERSION_MAJOR           1
 #define BOOST_WAVE_VERSION_MINOR           2
-#define BOOST_WAVE_VERSION_SUBMINOR        5
+#define BOOST_WAVE_VERSION_SUBMINOR        4
 
 #endif // !defined(WAVE_VERSION_H_9D79ABDB_AC54_4C0A_89B1_F70A2DCFE21E_INCLUDED)

Modified: boost/trunk/boost/wave/whitespace_handling.hpp
===================================================================
--- boost/trunk/boost/wave/whitespace_handling.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave/whitespace_handling.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     http://www.boost.org/
 
     Copyright (c) 2003 Paul Mensonides
-    Copyright (c) 2001-2006 Hartmut Kaiser. 
+    Copyright (c) 2001-2007 Hartmut Kaiser. 
     Distributed under the Boost Software License, Version 1.0. (See accompanying 
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -29,20 +29,40 @@
 
 namespace util {
     ///////////////////////////////////////////////////////////////////////////
+    //  This function returns true if the given C style comment contains at 
+    //  least one newline
     template <typename TokenT>
     bool ccomment_has_newline(TokenT const& token)
     {
         using namespace boost::wave;
 
-        if (T_CCOMMENT == token_id(token)) {
-            if (TokenT::string_type::npos != 
-                token.get_value().find_first_of("\n"))
-            {
-                return true;
-            }
+        if (T_CCOMMENT == token_id(token) &&
+            TokenT::string_type::npos != token.get_value().find_first_of("\n"))
+        {
+            return true;
         }
         return false;
     }
+
+    ///////////////////////////////////////////////////////////////////////////
+    //  This function returns the number of newlines in the given C style 
+    //  comment 
+    template <typename TokenT>
+    int ccomment_count_newlines(TokenT const& token)
+    {
+        using namespace boost::wave;
+        int newlines = 0;
+        if (T_CCOMMENT == token_id(token)) {
+        typename TokenT::string_type const& value = token.get_value();
+        typename TokenT::string_type::size_type p = value.find_first_of("\n");
+
+            while (TokenT::string_type::npos != p) {
+                ++newlines;
+                p = value.find_first_of("\n", p+1);
+            } 
+        }
+        return newlines;
+    }
 }
 
 ///////////////////////////////////////////////////////////////////////////////
@@ -133,9 +153,10 @@
     }
 
     if (T_CCOMMENT == id) {
-        if (util::ccomment_has_newline(token))
+        if (util::ccomment_has_newline(token)) {
             skipped_newline = true;
-
+            state = &eat_whitespace::newline_2nd;
+        }
         if (preserve_comments) {
             state = &eat_whitespace::general;
             return false;

Modified: boost/trunk/boost/wave.hpp
===================================================================
--- boost/trunk/boost/wave.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/wave.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/boost/xpressive/basic_regex.hpp
===================================================================
--- boost/trunk/boost/xpressive/basic_regex.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/basic_regex.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -88,7 +88,7 @@
     template<typename Xpr>
     basic_regex<BidiIter> &operator =(Xpr const &xpr)
     {
-        detail::static_compile(xpr, this->impl_.get());
+        detail::static_compile(xpr, *this->impl_.get());
         return *this;
     }
 
@@ -168,7 +168,15 @@
     /// INTERNAL ONLY
     basic_regex(string_type const &);
 
+    // used from parser, via core_access
     /// INTERNAL ONLY
+    explicit basic_regex(detail::regex_impl<BidiIter> const &that)
+      : impl_()
+    {
+        this->impl_.tracking_copy(that);
+    }
+
+    /// INTERNAL ONLY
     bool match_(detail::state_type<BidiIter> &state) const
     {
         return this->impl_->xpr_->match(state);

Modified: boost/trunk/boost/xpressive/detail/core/access.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/access.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/access.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,7 +13,7 @@
 # pragma once
 #endif
 
-#include <boost/shared_ptr.hpp>
+#include <vector>
 #include <boost/xpressive/detail/detail_fwd.hpp>
 #include <boost/xpressive/detail/dynamic/matchable.hpp>
 
@@ -26,6 +26,12 @@
 template<typename BidiIter>
 struct core_access
 {
+    // BUGBUG give basic_regex move semantics!
+    static basic_regex<BidiIter> make_regex(regex_impl<BidiIter> const &impl)
+    {
+        return basic_regex<BidiIter>(impl);
+    }
+
     static std::size_t get_hidden_mark_count(basic_regex<BidiIter> const &rex)
     {
         return rex.impl_->hidden_mark_count_;

Modified: boost/trunk/boost/xpressive/detail/core/adaptor.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/adaptor.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/adaptor.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,11 +13,11 @@
 # pragma once
 #endif
 
-#include <boost/ref.hpp>
-#include <boost/implicit_cast.hpp>
-#include <boost/intrusive_ptr.hpp>
+#include <boost/shared_ptr.hpp>
+#include <boost/call_traits.hpp>
 #include <boost/xpressive/detail/detail_fwd.hpp>
 #include <boost/xpressive/detail/dynamic/matchable.hpp>
+#include <boost/xpressive/detail/core/state.hpp>
 
 namespace boost { namespace xpressive { namespace detail
 {
@@ -27,26 +27,29 @@
 //
 //   wrap a static xpression in a matchable interface so it can be stored
 //   in and invoked from a basic_regex object.
-template<typename Xpr, typename Base>
+template<typename Xpr, typename BidiIter>
 struct xpression_adaptor
-  : Base // either matchable or matchable_ex
+  : matchable<BidiIter>
 {
-    typedef typename Base::iterator_type iterator_type;
-    typedef typename iterator_value<iterator_type>::type char_type;
+    typedef typename iterator_value<BidiIter>::type char_type;
 
     Xpr xpr_;
 
-    xpression_adaptor(Xpr const &xpr)
+    xpression_adaptor(typename call_traits<Xpr>::param_type xpr)
       : xpr_(xpr)
     {
     }
 
-    virtual bool match(state_type<iterator_type> &state) const
+    bool match(state_type<BidiIter> &state) const
     {
-        typedef typename unwrap_reference<Xpr const>::type xpr_type;
-        return implicit_cast<xpr_type &>(this->xpr_).match(state);
+        return this->xpr_.match(state);
     }
 
+    std::size_t get_width(state_type<BidiIter> *state) const
+    {
+        return this->xpr_.get_width(state);
+    }
+
     void link(xpression_linker<char_type> &linker) const
     {
         this->xpr_.link(linker);
@@ -64,10 +67,10 @@
 ///////////////////////////////////////////////////////////////////////////////
 // make_adaptor
 //
-template<typename Base, typename Xpr>
-inline intrusive_ptr<Base const> make_adaptor(Xpr const &xpr)
+template<typename BidiIter, typename Xpr>
+inline shared_ptr<matchable<BidiIter> const> make_adaptor(Xpr const &xpr)
 {
-    return intrusive_ptr<Base const>(new xpression_adaptor<Xpr, Base>(xpr));
+    return shared_ptr<matchable<BidiIter> const>(new xpression_adaptor<Xpr, BidiIter>(xpr));
 }
 
 }}} // namespace boost::xpressive::detail

Modified: boost/trunk/boost/xpressive/detail/core/linker.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/linker.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/linker.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -140,81 +140,67 @@
     }
 
     template<typename Matcher>
-    void accept(Matcher const &, xpression_base const *)
+    void link(Matcher const &, xpression_base const *)
     {
-        // no-node
+        // no-op
     }
 
-    void accept(repeat_begin_matcher const &, xpression_base const *next)
+    void link(repeat_begin_matcher const &, xpression_base const *next)
     {
         this->back_stack_.push(next);
     }
 
     template<bool Greedy>
-    void accept(repeat_end_matcher<Greedy> const &matcher, xpression_base const *)
+    void link(repeat_end_matcher<Greedy> const &matcher, xpression_base const *)
     {
         matcher.back_ = this->back_stack_.top();
         this->back_stack_.pop();
     }
 
     template<typename Alternates, typename Traits>
-    void accept(alternate_matcher<Alternates, Traits> const &matcher, xpression_base const *next)
+    void link(alternate_matcher<Alternates, Traits> const &matcher, xpression_base const *next)
     {
-        xpression_peeker<Char> peeker(matcher.bset_, this->get_traits<Traits>());
-        this->alt_link(matcher.alternates_, next, &peeker);
+        xpression_peeker<Char> peeker(&matcher.bset_, this->get_traits<Traits>());
+        this->alt_link(matcher.alternates_, next, peeker);
     }
 
-    void accept(alternate_end_matcher const &matcher, xpression_base const *)
+    void link(alternate_end_matcher const &matcher, xpression_base const *)
     {
         matcher.back_ = this->back_stack_.top();
         this->back_stack_.pop();
     }
 
-    template<typename Xpr, bool Greedy>
-    void accept(optional_matcher<Xpr, Greedy> const &matcher, xpression_base const *next)
-    {
-        this->back_stack_.push(next);
-        matcher.xpr_.link(*this);
-    }
-
-    template<typename Xpr, bool Greedy>
-    void accept(optional_mark_matcher<Xpr, Greedy> const &matcher, xpression_base const *next)
-    {
-        this->back_stack_.push(next);
-        matcher.xpr_.link(*this);
-    }
-
     template<typename Xpr>
-    void accept(keeper_matcher<Xpr> const &matcher, xpression_base const *)
+    void link(keeper_matcher<Xpr> const &matcher, xpression_base const *)
     {
-        matcher.xpr_.link(*this);
+        get_pointer(matcher.xpr_)->link(*this);
     }
 
     template<typename Xpr>
-    void accept(lookahead_matcher<Xpr> const &matcher, xpression_base const *)
+    void link(lookahead_matcher<Xpr> const &matcher, xpression_base const *)
     {
-        matcher.xpr_.link(*this);
+        get_pointer(matcher.xpr_)->link(*this);
     }
 
     template<typename Xpr>
-    void accept(lookbehind_matcher<Xpr> const &matcher, xpression_base const *)
+    void link(lookbehind_matcher<Xpr> const &matcher, xpression_base const *)
     {
-        matcher.xpr_.link(*this);
+        get_pointer(matcher.xpr_)->link(*this);
     }
 
     template<typename Xpr, bool Greedy>
-    void accept(simple_repeat_matcher<Xpr, Greedy> const &matcher, xpression_base const *)
+    void link(simple_repeat_matcher<Xpr, Greedy> const &matcher, xpression_base const *)
     {
         matcher.xpr_.link(*this);
     }
 
     // for use by alt_link_pred below
     template<typename Xpr>
-    void alt_branch_link(Xpr const &xpr, xpression_base const *next, xpression_peeker<Char> *peeker)
+    void alt_branch_link(Xpr const &xpr, xpression_base const *next, xpression_peeker<Char> &peeker)
     {
         this->back_stack_.push(next);
-        xpr.link(*this);
-        xpr.peek(*peeker);
+        get_pointer(xpr)->link(*this);
+        get_pointer(xpr)->peek(peeker);
     }
 
 private:
@@ -224,14 +210,14 @@
     //
     struct alt_link_pred
     {
-        xpression_linker<Char> *linker_;
-        xpression_peeker<Char> *peeker_;
+        xpression_linker<Char> &linker_;
+        xpression_peeker<Char> &peeker_;
         xpression_base const *next_;
 
         alt_link_pred
         (
-            xpression_linker<Char> *linker
-          , xpression_peeker<Char> *peeker
+            xpression_linker<Char> &linker
+          , xpression_peeker<Char> &peeker
           , xpression_base const *next
         )
           : linker_(linker)
@@ -243,19 +229,22 @@
         template<typename Xpr>
         void operator ()(Xpr const &xpr) const
         {
-            this->linker_->alt_branch_link(xpr, this->next_, this->peeker_);
+            this->linker_.alt_branch_link(xpr, this->next_, this->peeker_);
         }
+
+    private:
+        alt_link_pred &operator =(alt_link_pred const &);
     };
 
     template<typename BidiIter>
     void alt_link
     (
-        alternates_vector<BidiIter> const &alternates
+        std::vector<shared_ptr<matchable<BidiIter> const> > const &alternates
       , xpression_base const *next
-      , xpression_peeker<Char> *peeker
+      , xpression_peeker<Char> &peeker
     )
     {
-        std::for_each(alternates.begin(), alternates.end(), alt_link_pred(this, peeker, next));
+        std::for_each(alternates.begin(), alternates.end(), alt_link_pred(*this, peeker, next));
     }
 
     template<typename Alternates>
@@ -263,10 +252,10 @@
     (
         fusion::sequence_base<Alternates> const &alternates
       , xpression_base const *next
-      , xpression_peeker<Char> *peeker
+      , xpression_peeker<Char> &peeker
     )
     {
-        fusion::for_each(alternates.cast(), alt_link_pred(this, peeker, next));
+        fusion::for_each(alternates.cast(), alt_link_pred(*this, peeker, next));
     }
 
     template<typename Traits>

Modified: boost/trunk/boost/xpressive/detail/core/matcher/action_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/action_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/action_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -26,7 +26,7 @@
     //
     template<typename Action>
     struct action_matcher
-      : quant_style<quant_none, 0, false>
+      : quant_style<quant_none, mpl::size_t<0>, mpl::false_>
     {
         Action *action_ptr_;
 
@@ -42,7 +42,7 @@
 
         action_matcher &operator =(action_matcher const &)
         {
-            return *this; // no-node
+            return *this; // no-op
         }
 
         template<typename BidiIter, typename Next>

Modified: boost/trunk/boost/xpressive/detail/core/matcher/alternate_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/alternate_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/alternate_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,6 +13,8 @@
 # pragma once
 #endif
 
+#include <vector>
+
 #include <boost/version.hpp>
 #if BOOST_VERSION <= 103200
 // WORKAROUND for Fusion bug in Boost 1.32
@@ -23,6 +25,9 @@
 }}
 #endif
 
+#include <boost/shared_ptr.hpp>
+#include <boost/spirit/fusion/sequence/range.hpp>
+#include <boost/spirit/fusion/algorithm/for_each.hpp>
 #include <boost/xpressive/detail/detail_fwd.hpp>
 #include <boost/xpressive/detail/core/quant_style.hpp>
 #include <boost/xpressive/detail/core/state.hpp>
@@ -42,51 +47,126 @@
     template<typename BidiIter, typename Next>
     struct alt_match_pred
     {
+        state_type<BidiIter> &state_;
+
         alt_match_pred(state_type<BidiIter> &state)
-          : state_(&state)
+          : state_(state)
         {
         }
 
         template<typename Xpr>
         bool operator ()(Xpr const &xpr) const
         {
-            return xpr.BOOST_NESTED_TEMPLATE push_match<Next>(*this->state_);
+            return get_pointer(xpr)->BOOST_NESTED_TEMPLATE push_match<Next>(this->state_);
         }
 
     private:
-        state_type<BidiIter> *state_;
+        alt_match_pred &operator =(alt_match_pred const &);
     };
 
     ///////////////////////////////////////////////////////////////////////////////
     // alt_match
     //
-    template<typename BidiIter, typename Next>
+    template<typename BidiIter>
     inline bool alt_match
     (
-        alternates_vector<BidiIter> const &alts, state_type<BidiIter> &state, Next const &
+        std::vector<shared_ptr<matchable<BidiIter> const> > const &alternates
+      , state_type<BidiIter> &state
+      , matchable<BidiIter> const &
     )
     {
-        return detail::any(alts.begin(), alts.end(), alt_match_pred<BidiIter, Next>(state));
+        typedef alt_match_pred<BidiIter, matchable<BidiIter> > alt_match_pred;
+        return detail::any(alternates.begin(), alternates.end(), alt_match_pred(state));
     }
 
-    template<typename Head, typename Tail, typename BidiIter, typename Next>
+    template<typename BidiIter, typename Next, typename Alternates>
     inline bool alt_match
     (
-        alternates_list<Head, Tail> const &alts, state_type<BidiIter> &state, Next const &
+        fusion::sequence_base<Alternates> const &alternates
+      , state_type<BidiIter> &state
+      , Next const &
     )
     {
-        return fusion::any(alts, alt_match_pred<BidiIter, Next>(state));
+        typedef alt_match_pred<BidiIter, Next> alt_match_pred;
+        return fusion::any(alternates.cast(), alt_match_pred(state));
     }
 
     ///////////////////////////////////////////////////////////////////////////////
+    // make_range
+    template<typename Begin, typename End>
+    inline fusion::range<Begin, End> make_range(Begin const &begin, End const &end)
+    {
+        return fusion::range<Begin, End>(begin, end);
+    }
+
+    ///////////////////////////////////////////////////////////////////////////////
+    // alt_get_width_pred
+    //
+    template<typename BidiIter>
+    struct alt_get_width_pred
+    {
+        state_type<BidiIter> *state_;
+        std::size_t *width_;
+
+        alt_get_width_pred(state_type<BidiIter> *state, std::size_t *width)
+          : state_(state)
+          , width_(width)
+        {
+        }
+
+        template<typename Xpr>
+        void operator ()(Xpr const &xpr) const
+        {
+            if(*this->width_ != unknown_width())
+            {
+                std::size_t that_width = get_pointer(xpr)->get_width(this->state_);
+                if(*this->width_ != that_width)
+                {
+                    *this->width_ = unknown_width();
+                }
+            }
+        }
+    };
+
+    ///////////////////////////////////////////////////////////////////////////////
+    // alt_get_width
+    //
+    template<typename BidiIter>
+    inline std::size_t alt_get_width
+    (
+        std::vector<shared_ptr<matchable<BidiIter> const> > const &alternates
+      , state_type<BidiIter> *state
+    )
+    {
+        typedef alt_get_width_pred<BidiIter> alt_get_width_pred;
+        std::size_t width = alternates.front()->get_width(state);
+        std::for_each(alternates.begin() + 1, alternates.end(), alt_get_width_pred(state, &width));
+        return width;
+    }
+
+    template<typename BidiIter, typename Alternates>
+    inline std::size_t alt_get_width
+    (
+        fusion::sequence_base<Alternates> const &alternates
+      , state_type<BidiIter> *state
+    )
+    {
+        typedef alt_get_width_pred<BidiIter> alt_get_width_pred;
+        std::size_t width = (*fusion::begin(alternates.cast())).get_width(state);
+        fusion::for_each
+        (
+            make_range(fusion::next(fusion::begin(alternates.cast())), fusion::end(alternates.cast()))
+          , alt_get_width_pred(state, &width)
+        );
+        return width;
+    }
+
+    ///////////////////////////////////////////////////////////////////////////////
     // alternate_matcher
+    //
     template<typename Alternates, typename Traits>
     struct alternate_matcher
-      : quant_style<
-            Alternates::width != unknown_width::value && Alternates::pure ? quant_fixed_width : quant_variable_width
-          , Alternates::width
-          , Alternates::pure
-        >
+      : quant_style_auto<width_of<Alternates>, is_pure<Alternates> >
     {
         typedef Alternates alternates_type;
         typedef typename Traits::char_type char_type;
@@ -111,13 +191,10 @@
             return detail::alt_match(this->alternates_, state, next);
         }
 
-        detail::width get_width() const
+        template<typename BidiIter>
+        std::size_t get_width(state_type<BidiIter> *state) const
         {
-            // Only called when constructing static regexes, and this is a
-            // set of same-width alternates where the widths are known at compile
-            // time, as in: sregex rx = +(_ | 'a' | _n);
-            BOOST_MPL_ASSERT_RELATION(unknown_width::value, !=, Alternates::width);
-            return Alternates::width;
+            return detail::alt_get_width(this->alternates_, state);
         }
 
     private:

Modified: boost/trunk/boost/xpressive/detail/core/matcher/epsilon_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/epsilon_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/epsilon_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -33,6 +33,37 @@
         }
     };
 
+    ///////////////////////////////////////////////////////////////////////////////
+    // epsilon_mark_matcher
+    //
+    struct epsilon_mark_matcher
+      : quant_style<quant_none, mpl::size_t<0>, mpl::false_>
+    {
+        int mark_number_; // signed because it could be negative
+
+        epsilon_mark_matcher(int mark_number)
+          : mark_number_(mark_number)
+        {
+        }
+
+        template<typename BidiIter, typename Next>
+        bool match(state_type<BidiIter> &state, Next const &next) const
+        {
+            sub_match_impl<BidiIter> &br = state.sub_match(this->mark_number_);
+
+            bool old_matched = br.matched;
+            br.matched = false;
+
+            if(next.match(state))
+            {
+                return true;
+            }
+
+            br.matched = old_matched;
+            return false;
+        }
+    };
+
 }}}
 
 #endif

Modified: boost/trunk/boost/xpressive/detail/core/matcher/keeper_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/keeper_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/keeper_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,23 +24,25 @@
 
     ///////////////////////////////////////////////////////////////////////////////
     // keeper_matcher
-    //  Xpr can be either a static_xpression, or a shared_matchable
+    //       Xpr can be either a static_xpression, or a shared_ptr<matchable>
     template<typename Xpr>
     struct keeper_matcher
-      : quant_style<quant_variable_width, unknown_width::value, Xpr::pure>
+      : quant_style_auto<width_of<Xpr>, is_pure<Xpr> >
     {
-        keeper_matcher(Xpr const &xpr, bool pure = Xpr::pure)
+        keeper_matcher(Xpr const &xpr, bool do_save = !is_pure<Xpr>::value)
           : xpr_(xpr)
-          , pure_(pure)
+          , do_save_(do_save)
         {
         }
 
         template<typename BidiIter, typename Next>
         bool match(state_type<BidiIter> &state, Next const &next) const
         {
-            return Xpr::pure || this->pure_
-              ? this->match_(state, next, mpl::true_())
-              : this->match_(state, next, mpl::false_());
+            // Note that if is_pure<Xpr>::value is true, the compiler can tell which
+            // branch to take.
+            return is_pure<Xpr>::value || !this->do_save_
+                ? this->match_(state, next, mpl::true_())
+                : this->match_(state, next, mpl::false_());
         }
 
         template<typename BidiIter, typename Next>
@@ -49,7 +51,7 @@
             BidiIter const tmp = state.cur_;
 
             // matching xpr is guaranteed to not produce side-effects, don't bother saving state
-            if(!this->xpr_.match(state))
+            if(!get_pointer(this->xpr_)->match(state))
             {
                 return false;
             }
@@ -70,7 +72,7 @@
             // matching xpr could produce side-effects, save state
             memento<BidiIter> mem = save_sub_matches(state);
 
-            if(!this->xpr_.match(state))
+            if(!get_pointer(this->xpr_)->match(state))
             {
                 reclaim_sub_matches(mem, state);
                 return false;
@@ -87,7 +89,7 @@
         }
 
         Xpr xpr_;
-        bool pure_; // false if matching xpr_ could modify the sub-matches
+        bool do_save_; // true if matching xpr_ could modify the sub-matches
     };
 
 }}}

Modified: boost/trunk/boost/xpressive/detail/core/matcher/lookahead_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/lookahead_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/lookahead_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -27,25 +27,26 @@
 
     ///////////////////////////////////////////////////////////////////////////////
     // lookahead_matcher
-    //   Xpr can be either a static_xpression, or a shared_matchable
+    //   Xpr can be either a static_xpression, or a shared_ptr<matchable>
     //
     template<typename Xpr>
     struct lookahead_matcher
-      : quant_style<quant_none, 0, Xpr::pure>
+      : quant_style<quant_none, mpl::size_t<0>, is_pure<Xpr> >
     {
-        lookahead_matcher(Xpr const &xpr, bool no, bool pure = Xpr::pure)
+        lookahead_matcher(Xpr const &xpr, bool no = false, bool do_save = !is_pure<Xpr>::value)
           : xpr_(xpr)
           , not_(no)
-          , pure_(pure)
+          , do_save_(do_save)
         {
         }
 
         template<typename BidiIter, typename Next>
         bool match(state_type<BidiIter> &state, Next const &next) const
         {
-            return Xpr::pure || this->pure_
-              ? this->match_(state, next, mpl::true_())
-              : this->match_(state, next, mpl::false_());
+            // Note that if is_pure<Xpr>::value is true, the compiler can optimize this.
+            return is_pure<Xpr>::value || !this->do_save_
+                ? this->match_(state, next, mpl::true_())
+                : this->match_(state, next, mpl::false_());
         }
 
         template<typename BidiIter, typename Next>
@@ -59,7 +60,7 @@
                 save_restore<bool> partial_match(state.found_partial_match_);
                 detail::ignore_unused(&partial_match);
 
-                if(this->xpr_.match(state))
+                if(get_pointer(this->xpr_)->match(state))
                 {
                     state.cur_ = tmp;
                     return false;
@@ -71,7 +72,7 @@
             }
             else
             {
-                if(!this->xpr_.match(state))
+                if(!get_pointer(this->xpr_)->match(state))
                 {
                     return false;
                 }
@@ -100,7 +101,7 @@
                 save_restore<bool> partial_match(state.found_partial_match_);
                 detail::ignore_unused(&partial_match);
 
-                if(this->xpr_.match(state))
+                if(get_pointer(this->xpr_)->match(state))
                 {
                     restore_sub_matches(mem, state);
                     state.cur_ = tmp;
@@ -115,7 +116,7 @@
             }
             else
             {
-                if(!this->xpr_.match(state))
+                if(!get_pointer(this->xpr_)->match(state))
                 {
                     reclaim_sub_matches(mem, state);
                     return false;
@@ -135,7 +136,7 @@
 
         Xpr xpr_;
         bool not_;
-        bool pure_; // false if matching xpr_ could modify the sub-matches
+        bool do_save_; // true if matching xpr_ could modify the sub-matches
     };
 
 }}}

Modified: boost/trunk/boost/xpressive/detail/core/matcher/lookbehind_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/lookbehind_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/lookbehind_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -27,28 +27,44 @@
 {
 
     ///////////////////////////////////////////////////////////////////////////////
+    // get_width
+    //
+    template<typename Xpr>
+    inline std::size_t get_width(Xpr const &xpr)
+    {
+        return xpr.get_width(static_cast<state_type<char const *>*>(0));
+    }
+
+    template<typename BidiIter>
+    inline std::size_t get_width(shared_ptr<matchable<BidiIter> const> const &xpr)
+    {
+        return xpr->get_width(0);
+    }
+
+    ///////////////////////////////////////////////////////////////////////////////
     // lookbehind_matcher
-    //   Xpr can be either a static_xpression or a shared_matchable
+    //   Xpr can be either a static_xpression, or a shared_ptr<matchable>
     template<typename Xpr>
     struct lookbehind_matcher
-      : quant_style<quant_none, 0, Xpr::pure>
+      : quant_style<quant_none, mpl::size_t<0>, is_pure<Xpr> >
     {
-        lookbehind_matcher(Xpr const &xpr, std::size_t width, bool no, bool pure = Xpr::pure)
+        lookbehind_matcher(Xpr const &xpr, bool no = false, bool do_save = !is_pure<Xpr>::value)
           : xpr_(xpr)
           , not_(no)
-          , pure_(pure)
-          , width_(width)
+          , do_save_(do_save)
+          , width_(detail::get_width(xpr))
         {
-            detail::ensure(!is_unknown(this->width_), regex_constants::error_badlookbehind,
+            detail::ensure(this->width_ != unknown_width(), regex_constants::error_badlookbehind,
                 "Variable-width look-behind assertions are not supported");
         }
 
         template<typename BidiIter, typename Next>
         bool match(state_type<BidiIter> &state, Next const &next) const
         {
-            return Xpr::pure || this->pure_
-              ? this->match_(state, next, mpl::true_())
-              : this->match_(state, next, mpl::false_());
+            // Note that if is_pure<Xpr>::value is true, the compiler can optimize this.
+            return is_pure<Xpr>::value || !this->do_save_
+                ? this->match_(state, next, mpl::true_())
+                : this->match_(state, next, mpl::false_());
         }
 
         template<typename BidiIter, typename Next>
@@ -64,7 +80,7 @@
 
             if(this->not_)
             {
-                if(this->xpr_.match(state))
+                if(get_pointer(this->xpr_)->match(state))
                 {
                     BOOST_ASSERT(state.cur_ == tmp);
                     return false;
@@ -77,7 +93,7 @@
             }
             else
             {
-                if(!this->xpr_.match(state))
+                if(!get_pointer(this->xpr_)->match(state))
                 {
                     state.cur_ = tmp;
                     return false;
@@ -113,7 +129,7 @@
                 save_restore<bool> partial_match(state.found_partial_match_);
                 detail::ignore_unused(&partial_match);
 
-                if(this->xpr_.match(state))
+                if(get_pointer(this->xpr_)->match(state))
                 {
                     restore_sub_matches(mem, state);
                     BOOST_ASSERT(state.cur_ == tmp);
@@ -129,7 +145,7 @@
             }
             else
             {
-                if(!this->xpr_.match(state))
+                if(!get_pointer(this->xpr_)->match(state))
                 {
                     state.cur_ = tmp;
                     reclaim_sub_matches(mem, state);
@@ -150,7 +166,7 @@
 
         Xpr xpr_;
         bool not_;
-        bool pure_; // false if matching xpr_ could modify the sub-matches
+        bool do_save_; // true if matching xpr_ could modify the sub-matches
         std::size_t width_;
     };
 

Modified: boost/trunk/boost/xpressive/detail/core/matcher/mark_begin_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/mark_begin_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/mark_begin_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,7 +24,7 @@
     // mark_begin_matcher
     //
     struct mark_begin_matcher
-      : quant_style<quant_fixed_width, 0, false>
+      : quant_style<quant_fixed_width, mpl::size_t<0>, mpl::false_>
     {
         int mark_number_; // signed because it could be negative
 

Modified: boost/trunk/boost/xpressive/detail/core/matcher/mark_end_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/mark_end_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/mark_end_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,7 +24,7 @@
     // mark_end_matcher
     //
     struct mark_end_matcher
-      : quant_style<quant_none, 0, false>
+      : quant_style<quant_none, mpl::size_t<0>, mpl::false_>
     {
         int mark_number_;
 

Modified: boost/trunk/boost/xpressive/detail/core/matcher/mark_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/mark_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/mark_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,15 +22,12 @@
 namespace boost { namespace xpressive { namespace detail
 {
 
-    // TODO: the mark matcher is acually a fixed-width matcher, but the width is
-    // not known until pattern match time. 
-
     ///////////////////////////////////////////////////////////////////////////////
     // mark_matcher
     //
     template<typename Traits, bool ICase>
     struct mark_matcher
-      : quant_style_variable_width
+      : quant_style_fixed_unknown_width
     {
         typedef mpl::bool_<ICase> icase_type;
         int mark_number_;
@@ -41,7 +38,7 @@
         }
 
         template<typename BidiIter, typename Next>
-        bool match(state_type<BidiIter> &state, Next const &next) const
+            bool match(state_type<BidiIter> &state, Next const &next) const
         {
             BOOST_ASSERT(this->mark_number_ < static_cast<int>(state.mark_count_));
             sub_match_impl<BidiIter> const &br = state.sub_match(this->mark_number_);
@@ -71,6 +68,17 @@
             state.cur_ = tmp;
             return false;
         }
+
+        template<typename BidiIter>
+        std::size_t get_width(state_type<BidiIter> *state) const
+        {
+            if(0 == state)
+            {
+                return unknown_width();
+            }
+            sub_match_impl<BidiIter> &br = state->sub_match(this->mark_number_);
+            return br.matched ? static_cast<std::size_t>(std::distance(br.first, br.second)) : 1U;
+        }
     };
 
 }}}

Deleted: boost/trunk/boost/xpressive/detail/core/matcher/optional_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/optional_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/optional_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,121 +0,0 @@
-///////////////////////////////////////////////////////////////////////////////
-// optional_matcher.hpp
-//
-//  Copyright 2004 Eric Niebler. Distributed under the Boost
-//  Software License, Version 1.0. (See accompanying file
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef BOOST_XPRESSIVE_DETAIL_CORE_MATCHER_OPTIONAL_MATCHER_HPP_EAN_10_04_2005
-#define BOOST_XPRESSIVE_DETAIL_CORE_MATCHER_OPTIONAL_MATCHER_HPP_EAN_10_04_2005
-
-// MS compatible compilers support #pragma once
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
-# pragma once
-#endif
-
-#include <boost/mpl/bool.hpp>
-#include <boost/xpressive/detail/detail_fwd.hpp>
-#include <boost/xpressive/detail/core/quant_style.hpp>
-#include <boost/xpressive/detail/core/state.hpp>
-
-namespace boost { namespace xpressive { namespace detail
-{
-
-    ///////////////////////////////////////////////////////////////////////////////
-    // optional_matcher
-    template<typename Xpr, bool Greedy>
-    struct optional_matcher
-      : quant_style<quant_variable_width, unknown_width::value, Xpr::pure>
-    {
-        Xpr xpr_;
-
-        explicit optional_matcher(Xpr const &xpr)
-          : xpr_(xpr)
-        {
-        }
-
-        template<typename BidiIter, typename Next>
-        bool match(state_type<BidiIter> &state, Next const &next) const
-        {
-            return this->match_(state, next, mpl::bool_<Greedy>());
-        }
-
-    private:
-        template<typename BidiIter, typename Next>
-        bool match_(state_type<BidiIter> &state, Next const &next, mpl::true_) const // Greedy
-        {
-            return this->xpr_.BOOST_NESTED_TEMPLATE push_match<Next>(state)
-                || next.match(state);
-        }
-
-        template<typename BidiIter, typename Next>
-        bool match_(state_type<BidiIter> &state, Next const &next, mpl::false_) const // Non-greedy
-        {
-            return next.match(state)
-                || this->xpr_.BOOST_NESTED_TEMPLATE push_match<Next>(state);
-        }
-
-        optional_matcher &operator =(optional_matcher const &);
-    };
-
-    ///////////////////////////////////////////////////////////////////////////////
-    // optional_mark_matcher
-    template<typename BidiIter, typename Next>
-    inline bool match_next(state_type<BidiIter> &state, Next const &next, int mark_number)
-    {
-        sub_match_impl<BidiIter> &br = state.sub_match(mark_number);
-
-        bool old_matched = br.matched;
-        br.matched = false;
-
-        if(next.match(state))
-        {
-            return true;
-        }
-
-        br.matched = old_matched;
-        return false;
-    }
-
-    ///////////////////////////////////////////////////////////////////////////////
-    // optional_mark_matcher
-    template<typename Xpr, bool Greedy>
-    struct optional_mark_matcher
-      : quant_style<quant_variable_width, unknown_width::value, Xpr::pure>
-    {
-        Xpr xpr_;
-        int mark_number_;
-
-        explicit optional_mark_matcher(Xpr const &xpr, int mark_number)
-          : xpr_(xpr)
-          , mark_number_(mark_number)
-        {
-        }
-
-        template<typename BidiIter, typename Next>
-        bool match(state_type<BidiIter> &state, Next const &next) const
-        {
-            return this->match_(state, next, mpl::bool_<Greedy>());
-        }
-
-    private:
-        template<typename BidiIter, typename Next>
-        bool match_(state_type<BidiIter> &state, Next const &next, mpl::true_) const // Greedy
-        {
-            return this->xpr_.BOOST_NESTED_TEMPLATE push_match<Next>(state)
-                || match_next(state, next, this->mark_number_);
-        }
-
-        template<typename BidiIter, typename Next>
-        bool match_(state_type<BidiIter> &state, Next const &next, mpl::false_) const // Non-greedy
-        {
-            return match_next(state, next, this->mark_number_)
-                || this->xpr_.BOOST_NESTED_TEMPLATE push_match<Next>(state);
-        }
-
-        optional_mark_matcher &operator =(optional_mark_matcher const &);
-    };
-
-}}}
-
-#endif

Modified: boost/trunk/boost/xpressive/detail/core/matcher/regex_byref_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/regex_byref_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/regex_byref_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,7 +32,7 @@
     //
     template<typename BidiIter>
     struct regex_byref_matcher
-      : quant_style<quant_variable_width, unknown_width::value, false>
+      : quant_style<quant_variable_width, unknown_width, mpl::false_>
     {
         // avoid cyclic references by holding a weak_ptr to the
         // regex_impl struct
@@ -59,7 +59,7 @@
             ensure(this->pimpl_->xpr_, regex_constants::error_badref, "bad regex reference");
 
             // wrap the static xpression in a matchable interface
-            xpression_adaptor<reference_wrapper<Next const>, matchable<BidiIter> > adaptor(boost::cref(next));
+            xpression_adaptor<Next const &, BidiIter> adaptor(next);
             return push_context_match(*this->pimpl_, state, adaptor);
         }
     };

Modified: boost/trunk/boost/xpressive/detail/core/matcher/regex_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/regex_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/regex_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -30,7 +30,7 @@
     //
     template<typename BidiIter>
     struct regex_matcher
-      : quant_style<quant_variable_width, unknown_width::value, false>
+      : quant_style<quant_variable_width, unknown_width, mpl::false_>
     {
         regex_impl<BidiIter> impl_;
 
@@ -53,7 +53,7 @@
             BOOST_MPL_ASSERT((is_static_xpression<Next>));
 
             // wrap the static xpression in a matchable interface
-            xpression_adaptor<reference_wrapper<Next const>, matchable<BidiIter> > adaptor(boost::cref(next));
+            xpression_adaptor<Next const &, BidiIter> adaptor(next);
             return push_context_match(this->impl_, state, adaptor);
         }
     };

Modified: boost/trunk/boost/xpressive/detail/core/matcher/repeat_begin_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/repeat_begin_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/repeat_begin_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -30,7 +30,7 @@
     // repeat_begin_matcher
     //
     struct repeat_begin_matcher
-      : quant_style<quant_variable_width, unknown_width::value, false>
+      : quant_style<quant_variable_width, unknown_width, mpl::false_>
     {
         int mark_number_;
 

Modified: boost/trunk/boost/xpressive/detail/core/matcher/repeat_end_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/repeat_end_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/repeat_end_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -26,7 +26,7 @@
     //
     template<bool Greedy>
     struct repeat_end_matcher
-      : quant_style<quant_none, 0, false>
+      : quant_style<quant_none, mpl::size_t<0>, mpl::false_>
     {
         typedef mpl::bool_<Greedy> greedy_type;
         int mark_number_;

Modified: boost/trunk/boost/xpressive/detail/core/matcher/simple_repeat_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/simple_repeat_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/simple_repeat_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -64,19 +64,15 @@
 
         Xpr xpr_;
         unsigned int min_, max_;
-        std::size_t width_;
 
-        simple_repeat_matcher(Xpr const &xpr, unsigned int min, unsigned int max, std::size_t width)
+        simple_repeat_matcher(Xpr const &xpr, unsigned int min, unsigned int max)
           : xpr_(xpr)
           , min_(min)
           , max_(max)
-          , width_(width)
         {
             // it is the job of the parser to make sure this never happens
             BOOST_ASSERT(min <= max);
             BOOST_ASSERT(0 != max);
-            BOOST_ASSERT(0 != width && unknown_width() != width);
-            BOOST_ASSERT(Xpr::width == unknown_width() || Xpr::width == width);
         }
 
         template<typename BidiIter, typename Next>
@@ -91,10 +87,16 @@
         template<typename BidiIter, typename Next>
         bool match_(state_type<BidiIter> &state, Next const &next, greedy_slow_tag) const
         {
-            int const diff = -static_cast<int>(Xpr::width == unknown_width::value ? this->width_ : Xpr::width);
+            int const diff = -static_cast<int>(this->xpr_.get_width(&state));
+            BOOST_ASSERT(diff != -static_cast<int>(unknown_width()));
             unsigned int matches = 0;
             BidiIter const tmp = state.cur_;
 
+            if(0 == diff)
+            {
+                return this->xpr_.match(state) && next.match(state);
+            }
+
             // greedily match as much as we can
             while(matches < this->max_ && this->xpr_.match(state))
             {
@@ -129,6 +131,11 @@
             BidiIter const tmp = state.cur_;
             unsigned int matches = 0;
 
+            if(0 == this->xpr_.get_width(&state))
+            {
+                return this->xpr_.match(state) && next.match(state);
+            }
+
             for(; matches < this->min_; ++matches)
             {
                 if(!this->xpr_.match(state))
@@ -181,13 +188,14 @@
             }
         }
 
-        detail::width get_width() const
+        template<typename BidiIter>
+        std::size_t get_width(state_type<BidiIter> *state) const
         {
             if(this->min_ != this->max_)
             {
-                return unknown_width::value;
+                return unknown_width();
             }
-            return this->min_ * this->width_;
+            return this->min_ * this->xpr_.get_width(state);
         }
 
     private:

Modified: boost/trunk/boost/xpressive/detail/core/matcher/string_matcher.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matcher/string_matcher.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matcher/string_matcher.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -75,7 +75,8 @@
             return false;
         }
 
-        detail::width get_width() const
+        template<typename BidiIter>
+        std::size_t get_width(state_type<BidiIter> *) const
         {
             return this->str_.size();
         }

Modified: boost/trunk/boost/xpressive/detail/core/matchers.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/matchers.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/matchers.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -33,7 +33,6 @@
 #include <boost/xpressive/detail/core/matcher/mark_begin_matcher.hpp>
 #include <boost/xpressive/detail/core/matcher/mark_end_matcher.hpp>
 #include <boost/xpressive/detail/core/matcher/mark_matcher.hpp>
-#include <boost/xpressive/detail/core/matcher/optional_matcher.hpp>
 #include <boost/xpressive/detail/core/matcher/posix_charset_matcher.hpp>
 #include <boost/xpressive/detail/core/matcher/range_matcher.hpp>
 #include <boost/xpressive/detail/core/matcher/regex_byref_matcher.hpp>

Modified: boost/trunk/boost/xpressive/detail/core/optimize.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/optimize.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/optimize.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,12 +11,11 @@
 #include <string>
 #include <utility>
 #include <boost/mpl/bool.hpp>
-#include <boost/intrusive_ptr.hpp>
 #include <boost/iterator/iterator_traits.hpp>
 #include <boost/xpressive/detail/core/finder.hpp>
-#include <boost/xpressive/detail/core/linker.hpp>
 #include <boost/xpressive/detail/core/peeker.hpp>
 #include <boost/xpressive/detail/core/regex_impl.hpp>
+#include <boost/xpressive/detail/utility/hash_peek_bitset.hpp>
 
 namespace boost { namespace xpressive { namespace detail
 {
@@ -25,50 +24,20 @@
 // optimize_regex
 //
 template<typename BidiIter, typename Traits>
-intrusive_ptr<finder<BidiIter> > optimize_regex
-(
-    xpression_peeker<typename iterator_value<BidiIter>::type> const &peeker
-  , Traits const &traits
-  , mpl::false_
-)
+inline void optimize_regex(regex_impl<BidiIter> &impl, Traits const &traits, mpl::true_)
 {
-    if(peeker.line_start())
-    {
-        return intrusive_ptr<finder<BidiIter> >
-        (
-            new line_start_finder<BidiIter, Traits>(traits)
-        );
-    }
-    else if(256 != peeker.bitset().count())
-    {
-        return intrusive_ptr<finder<BidiIter> >
-        (
-            new hash_peek_finder<BidiIter, Traits>(peeker.bitset())
-        );
-    }
-
-    return intrusive_ptr<finder<BidiIter> >();
-}
-
-///////////////////////////////////////////////////////////////////////////////
-// optimize_regex
-//
-template<typename BidiIter, typename Traits>
-intrusive_ptr<finder<BidiIter> > optimize_regex
-(
-    xpression_peeker<typename iterator_value<BidiIter>::type> const &peeker
-  , Traits const &traits
-  , mpl::true_
-)
-{
     typedef typename iterator_value<BidiIter>::type char_type;
 
+    // optimization: get the peek chars OR the boyer-moore search string
+    hash_peek_bitset<char_type> bset;
+    xpression_peeker<char_type> peeker(&bset, traits);
+    impl.xpr_->peek(peeker);
+
     // if we have a leading string literal, initialize a boyer-moore struct with it
     std::pair<std::basic_string<char_type> const *, bool> str = peeker.get_string();
     if(0 != str.first)
     {
-        BOOST_ASSERT(1 == peeker.bitset().count());
-        return intrusive_ptr<finder<BidiIter> >
+        impl.finder_.reset
         (
             new boyer_moore_finder<BidiIter, Traits>
             (
@@ -79,35 +48,49 @@
             )
         );
     }
-
-    return optimize_regex<BidiIter>(peeker, traits, mpl::false_());
+    else if(peeker.line_start())
+    {
+        impl.finder_.reset
+        (
+            new line_start_finder<BidiIter, Traits>(traits)
+        );
+    }
+    else if(256 != bset.count())
+    {
+        impl.finder_.reset
+        (
+            new hash_peek_finder<BidiIter, Traits>(bset)
+        );
+    }
 }
 
 ///////////////////////////////////////////////////////////////////////////////
-// common_compile
+// optimize_regex
 //
 template<typename BidiIter, typename Traits>
-void common_compile
-(
-    intrusive_ptr<matchable_ex<BidiIter> const> const &regex
-  , regex_impl<BidiIter> &impl
-  , Traits const &traits
-)
+inline void optimize_regex(regex_impl<BidiIter> &impl, Traits const &traits, mpl::false_)
 {
     typedef typename iterator_value<BidiIter>::type char_type;
 
-    // "link" the regex
-    xpression_linker<char_type> linker(traits);
-    regex->link(linker);
-
-    // "peek" into the compiled regex to see if there are optimization opportunities
+    // optimization: get the peek chars OR the line start finder
     hash_peek_bitset<char_type> bset;
-    xpression_peeker<char_type> peeker(bset, traits);
-    regex->peek(peeker);
+    xpression_peeker<char_type> peeker(&bset, traits);
+    impl.xpr_->peek(peeker);
 
-    // optimization: get the peek chars OR the boyer-moore search string
-    impl.finder_ = optimize_regex<BidiIter>(peeker, traits, is_random<BidiIter>());
-    impl.xpr_ = regex;
+    if(peeker.line_start())
+    {
+        impl.finder_.reset
+        (
+            new line_start_finder<BidiIter, Traits>(traits)
+        );
+    }
+    else if(256 != bset.count())
+    {
+        impl.finder_.reset
+        (
+            new hash_peek_finder<BidiIter, Traits>(bset)
+        );
+    }
 }
 
 }}} // namespace boost::xpressive

Modified: boost/trunk/boost/xpressive/detail/core/peeker.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/peeker.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/peeker.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -34,19 +34,19 @@
 //   tell whether or not to keep looking for a peek optimization
 template<typename Matcher>
 struct peek_next 
-  : mpl::bool_<Matcher::width == 0>
+    : mpl::equal_to<typename Matcher::width, mpl::size_t<0> >
 {
 };
 
 template<>
 struct peek_next<mark_begin_matcher>
-  : mpl::true_
+    : mpl::true_
 {
 };
 
 template<>
 struct peek_next<repeat_begin_matcher>
-  : mpl::true_
+    : mpl::true_
 {
 };
 
@@ -57,7 +57,7 @@
 struct xpression_peeker
 {
     template<typename Traits>
-    xpression_peeker(hash_peek_bitset<Char> &bset, Traits const &traits)
+    explicit xpression_peeker(hash_peek_bitset<Char> *bset, Traits const &traits)
       : bset_(bset)
       , str_(0)
       , str_icase_(false)
@@ -80,91 +80,58 @@
         return this->line_start_;
     }
 
-    hash_peek_bitset<Char> const &bitset() const
-    {
-        return this->bset_;
-    }
-
     ///////////////////////////////////////////////////////////////////////////////
     // modifiers
     void fail(bool do_fail = true)
     {
         if(do_fail)
         {
-            this->bset_.set_all();
+            this->bset_->set_all();
         }
     }
 
-    template<typename Matcher>
-    peek_next<Matcher> accept(Matcher const &)
+    template<typename Xpr>
+    peek_next<Xpr> peek(Xpr const &)
     {
-        this->fail(!peek_next<Matcher>::value);
-        return peek_next<Matcher>();
+        this->fail(!peek_next<Xpr>::value);
+        return peek_next<Xpr>();
     }
 
     template<typename Traits>
-    mpl::true_ accept(assert_bol_matcher<Traits> const &)
+    mpl::true_ peek(assert_bol_matcher<Traits> const &)
     {
         this->line_start_ = true;
         return mpl::true_();
     }
 
     template<typename Traits, bool ICase>
-    mpl::false_ accept(literal_matcher<Traits, ICase, false> const &xpr)
+    mpl::false_ peek(literal_matcher<Traits, ICase, false> const &xpr)
     {
-        this->bset_.set_char(xpr.ch_, ICase, this->get_traits_<Traits>());
+        this->bset_->set_char(xpr.ch_, ICase, this->get_traits_<Traits>());
         return mpl::false_();
     }
 
     template<typename Traits, bool ICase>
-    mpl::false_ accept(string_matcher<Traits, ICase> const &xpr)
+    mpl::false_ peek(string_matcher<Traits, ICase> const &xpr)
     {
-        this->bset_.set_char(xpr.str_[0], ICase, this->get_traits_<Traits>());
+        this->bset_->set_char(xpr.str_[0], ICase, this->get_traits_<Traits>());
         this->str_ = &xpr.str_;
         this->str_icase_ = ICase;
         return mpl::false_();
     }
 
     template<typename Alternates, typename Traits>
-    mpl::false_ accept(alternate_matcher<Alternates, Traits> const &xpr)
+    mpl::false_ peek(alternate_matcher<Alternates, Traits> const &xpr)
     {
         BOOST_ASSERT(0 != xpr.bset_.count());
-        this->bset_.set_bitset(xpr.bset_);
+        this->bset_->set_bitset(xpr.bset_);
         return mpl::false_();
     }
 
-    template<typename Xpr, bool Greedy>
-    mpl::false_ accept(optional_matcher<Xpr, Greedy> const &xpr)
-    {
-        this->fail();  // a union of xpr and next
-        return mpl::false_();
-    }
-
-    template<typename Xpr, bool Greedy>
-    mpl::false_ accept(optional_mark_matcher<Xpr, Greedy> const &xpr)
-    {
-        this->fail();  // a union of xpr and next
-        return mpl::false_();
-    }
-
-    //template<typename Xpr, bool Greedy>
-    //mpl::true_ accept(optional_matcher<Xpr, Greedy> const &xpr)
-    //{
-    //    xpr.xpr_.peek(*this);  // a union of xpr and next
-    //    return mpl::true_();
-    //}
-
-    //template<typename Xpr, bool Greedy>
-    //mpl::true_ accept(optional_mark_matcher<Xpr, Greedy> const &xpr)
-    //{
-    //    xpr.xpr_.peek(*this);  // a union of xpr and next
-    //    return mpl::true_();
-    //}
-
     template<typename Traits>
-    mpl::false_ accept(posix_charset_matcher<Traits> const &xpr)
+    mpl::false_ peek(posix_charset_matcher<Traits> const &xpr)
     {
-        this->bset_.set_class(xpr.mask_, xpr.not_, this->get_traits_<Traits>());
+        this->bset_->set_class(xpr.mask_, xpr.not_, this->get_traits_<Traits>());
         return mpl::false_();
     }
 
@@ -173,22 +140,22 @@
 
     template<bool ICase, typename Traits>
     typename enable_if<is_char_8bit<Traits>, mpl::false_>::type
-    accept(charset_matcher<Traits, ICase, basic_chset<Char> > const &xpr)
+    peek(charset_matcher<Traits, ICase, basic_chset<Char> > const &xpr)
     {
         BOOST_ASSERT(0 != xpr.charset_.base().count());
-        this->bset_.set_charset(xpr.charset_, ICase);
+        this->bset_->set_charset(xpr.charset_, ICase);
         return mpl::false_();
     }
 
     template<typename Traits, bool ICase>
-    mpl::false_ accept(range_matcher<Traits, ICase> const &xpr)
+    mpl::false_ peek(range_matcher<Traits, ICase> const &xpr)
     {
-        this->bset_.set_range(xpr.ch_min_, xpr.ch_max_, xpr.not_, ICase, this->get_traits_<Traits>());
+        this->bset_->set_range(xpr.ch_min_, xpr.ch_max_, xpr.not_, ICase, this->get_traits_<Traits>());
         return mpl::false_();
     }
 
     template<typename Xpr, bool Greedy>
-    mpl::false_ accept(simple_repeat_matcher<Xpr, Greedy> const &xpr)
+    mpl::false_ peek(simple_repeat_matcher<Xpr, Greedy> const &xpr)
     {
         0 != xpr.min_ ? xpr.xpr_.peek(*this) : this->fail(); // could be a union of xpr and next
         return mpl::false_();
@@ -217,7 +184,7 @@
         return *static_cast<Traits const *>(this->traits_);
     }
 
-    hash_peek_bitset<Char> &bset_;
+    hash_peek_bitset<Char> *bset_;
     std::basic_string<Char> const *str_;
     bool str_icase_;
     bool line_start_;

Modified: boost/trunk/boost/xpressive/detail/core/quant_style.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/quant_style.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/quant_style.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,7 +18,6 @@
 #include <boost/mpl/if.hpp>
 #include <boost/mpl/and.hpp>
 #include <boost/mpl/not_equal_to.hpp>
-#include <boost/xpressive/detail/utility/width.hpp>
 #include <boost/xpressive/detail/detail_fwd.hpp>
 
 #if defined(NDEBUG) & defined(BOOST_XPR_DEBUG_STACK)
@@ -49,9 +48,9 @@
 ///////////////////////////////////////////////////////////////////////////////
 // is_xpr
 //
-template<typename Xpr>
+template<typename T>
 struct is_xpr
-  : is_base_and_derived<xpression_base, Xpr>
+  : is_base_and_derived<xpression_base, T>
 {
 };
 
@@ -61,6 +60,7 @@
 enum quant_enum
 {
     quant_none,
+    quant_auto,
     quant_fixed_width,
     quant_variable_width
 };
@@ -68,22 +68,18 @@
 ///////////////////////////////////////////////////////////////////////////////
 // quant_style
 //
-template<quant_enum QuantStyle, std::size_t Width = unknown_width::value, bool Pure = true>
+template<quant_enum QuantStyle, typename Width = unknown_width, typename Pure = mpl::true_>
 struct quant_style
   : xpression_base
 {
-    // Which quantification strategy to use?
-    BOOST_STATIC_CONSTANT(quant_enum, quant = QuantStyle);
+    typedef mpl::int_<QuantStyle> quant;   // Which quantification strategy to use?
+    typedef Width width;                   // how many characters this matcher consumes
+    typedef Pure pure;                     // whether this matcher has observable side-effects
 
-    // how many characters this matcher consumes
-    BOOST_STATIC_CONSTANT(std::size_t, width = Width);
-
-    // whether this matcher has observable side-effects
-    BOOST_STATIC_CONSTANT(bool, pure = Pure);
-
-    static detail::width get_width()
+    template<typename BidiIter>
+    static std::size_t get_width(state_type<BidiIter> *)
     {
-        return width;
+        return Width::value;
     }
 };
 
@@ -109,7 +105,7 @@
 //  for when the sub-expression has a fixed width that is known at compile time
 template<std::size_t Width>
 struct quant_style_fixed_width
-  : quant_style<quant_fixed_width, Width>
+  : quant_style<quant_fixed_width, mpl::size_t<Width> >
 {
 };
 
@@ -117,19 +113,45 @@
 // quant_style_assertion
 //  a zero-width assertion.
 struct quant_style_assertion
-  : quant_style<quant_none, 0>
+  : quant_style<quant_none, mpl::size_t<0> >
 {
 };
 
 ///////////////////////////////////////////////////////////////////////////////
+// quant_style_auto
+//  automatically pick the quantification style based on width and purity
+template<typename Width, typename Pure>
+struct quant_style_auto
+  : quant_style<quant_auto, Width, Pure>
+{
+};
+
+///////////////////////////////////////////////////////////////////////////////
 // quant_type
 //
-template<typename Matcher>
+template<typename Matcher, typename QuantStyle = typename Matcher::quant>
 struct quant_type
-  : mpl::int_<Matcher::quant>
+  : QuantStyle
 {
 };
 
+///////////////////////////////////////////////////////////////////////////////
+// when the quant_type is auto, determine the quant type from the width and purity
+template<typename Matcher>
+struct quant_type<Matcher, mpl::int_<quant_auto> >
+  : mpl::if_
+    <
+        mpl::and_
+        <
+            mpl::not_equal_to<typename Matcher::width, unknown_width>
+          , typename Matcher::pure
+        >
+      , mpl::int_<quant_fixed_width>
+      , mpl::int_<quant_variable_width>
+    >::type
+{
+};
+
 }}} // namespace boost::xpressive::detail
 
 #endif

Modified: boost/trunk/boost/xpressive/detail/core/regex_impl.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/regex_impl.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/regex_impl.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,53 +13,26 @@
 # pragma once
 #endif
 
-#include <boost/intrusive_ptr.hpp>
+#include <vector>
+#include <boost/noncopyable.hpp>
 #include <boost/xpressive/detail/detail_fwd.hpp>
-#include <boost/xpressive/detail/dynamic/matchable.hpp>
 #include <boost/xpressive/detail/utility/tracking_ptr.hpp>
-#include <boost/xpressive/detail/utility/counted_base.hpp>
 
 namespace boost { namespace xpressive { namespace detail
 {
 
 ///////////////////////////////////////////////////////////////////////////////
 // finder
+//
 template<typename BidiIter>
 struct finder
-  : counted_base<finder<BidiIter> >
+  : noncopyable
 {
     virtual ~finder() {}
     virtual bool operator ()(state_type<BidiIter> &state) const = 0;
 };
 
 ///////////////////////////////////////////////////////////////////////////////
-// traits
-struct traits
-  : counted_base<traits>
-{
-    virtual ~traits() {}
-};
-
-///////////////////////////////////////////////////////////////////////////////
-// traits_holder
-template<typename Traits>
-struct traits_holder
-  : traits
-{
-    explicit traits_holder(Traits const &traits)
-      : traits_(traits)
-    {
-    }
-
-    Traits const &traits() const
-    {
-        return this->traits_;
-    }
-private:
-    Traits traits_;
-};
-
-///////////////////////////////////////////////////////////////////////////////
 // regex_impl
 //
 template<typename BidiIter>
@@ -111,26 +84,17 @@
         std::swap(this->hidden_mark_count_, that.hidden_mark_count_);
     }
 
-    intrusive_ptr<matchable_ex<BidiIter> const> xpr_;
-    intrusive_ptr<traits const> traits_;
-    intrusive_ptr<finder<BidiIter> > finder_;
+    shared_ptr<matchable<BidiIter> const>  xpr_;
+    shared_ptr<void const> traits_;
+    shared_ptr<finder<BidiIter> > finder_;
     std::size_t mark_count_;
     std::size_t hidden_mark_count_;
 
     #ifdef BOOST_XPRESSIVE_DEBUG_CYCLE_TEST
     static int instances;
     #endif
-
-private:
-    regex_impl &operator =(regex_impl const &);
 };
 
-template<typename BidiIter>
-void swap(regex_impl<BidiIter> &left, regex_impl<BidiIter> &right)
-{
-    left.swap(right);
-}
-
 #ifdef BOOST_XPRESSIVE_DEBUG_CYCLE_TEST
 template<typename BidiIter>
 int regex_impl<BidiIter>::instances = 0;

Modified: boost/trunk/boost/xpressive/detail/core/state.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/state.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/state.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,6 +13,7 @@
 # pragma once
 #endif
 
+#include <boost/shared_ptr.hpp>
 #include <boost/noncopyable.hpp>
 #include <boost/xpressive/detail/detail_fwd.hpp>
 #include <boost/xpressive/detail/core/access.hpp>
@@ -49,7 +50,7 @@
     matchable<BidiIter> const *next_ptr_;
 
     // A pointer to the current traits object
-    detail::traits const *traits_;
+    void const *traits_;
 };
 
 ///////////////////////////////////////////////////////////////////////////////
@@ -240,7 +241,7 @@
     template<typename Traits>
     Traits const &get_traits() const
     {
-        return static_cast<traits_holder<Traits> const *>(this->context_.traits_)->traits();
+        return *static_cast<Traits const *>(this->context_.traits_);
     }
 
 private:
@@ -306,7 +307,7 @@
 {
     typedef core_access<BidiIter> access;
     nested_results<BidiIter> &nested = access::get_nested_results(*state.context_.results_ptr_);
-    std::size_t count = nested.size() - mem.nested_results_count_;
+    std::size_t count = state.context_.results_ptr_->nested_results().size() - mem.nested_results_count_;
     state.extras_.results_cache_.reclaim_last_n(nested, count);
     std::copy(mem.old_sub_matches_, mem.old_sub_matches_ + state.mark_count_, state.sub_matches_);
     state.extras_.sub_match_stack_.unwind_to(mem.old_sub_matches_);

Modified: boost/trunk/boost/xpressive/detail/core/sub_match_impl.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/core/sub_match_impl.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/core/sub_match_impl.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,10 +18,6 @@
 namespace boost { namespace xpressive { namespace detail
 {
 
-// TODO: sub_match_impl is a POD IFF BidiIter is POD. Pool allocation
-// of them can be made more efficient if they are. Or maybe all they
-// need is trivial constructor/destructor. (???)
-
 ///////////////////////////////////////////////////////////////////////////////
 // sub_match_impl
 //

Modified: boost/trunk/boost/xpressive/detail/detail_fwd.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/detail_fwd.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/detail_fwd.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,6 @@
 #include <climits> // for INT_MAX
 #include <boost/mpl/bool.hpp>
 #include <boost/mpl/size_t.hpp>
-#include <boost/shared_ptr.hpp>
 #include <boost/xpressive/xpressive_fwd.hpp>
 
 namespace boost { namespace xpressive { namespace detail
@@ -89,6 +88,9 @@
     struct posix_charset_matcher;
 
     template<typename BidiIter>
+    struct alternates_factory;
+
+    template<typename BidiIter>
     struct sequence;
 
     template<typename Traits, bool ICase>
@@ -133,16 +135,10 @@
     template<typename Action>
     struct action_matcher;
 
-    template<typename Xpr, bool Greedy>
-    struct optional_matcher;
-
-    template<typename Xpr, bool Greedy>
-    struct optional_mark_matcher;
-
     template<typename Xpr>
     struct is_modifiable;
 
-    template<typename Head, typename Tail>
+    template<typename Alternates>
     struct alternates_list;
 
     template<typename Modifier>
@@ -164,6 +160,8 @@
 
     struct epsilon_matcher;
 
+    struct epsilon_mark_matcher;
+
     template<typename BidiIter>
     struct nested_results;
 
@@ -186,7 +184,7 @@
     struct word_boundary;
 
     template<typename BidiIter, typename Matcher>
-    sequence<BidiIter> make_dynamic(Matcher const &matcher);
+    sequence<BidiIter> make_dynamic_xpression(Matcher const &matcher);
 
     template<typename Char>
     struct xpression_linker;
@@ -239,18 +237,9 @@
     template<typename BidiIter>
     struct matchable;
 
-    template<typename BidiIter>
-    struct matchable_ex;
-
     template<typename Matcher, typename BidiIter>
     struct dynamic_xpression;
 
-    template<typename BidiIter>
-    struct shared_matchable;
-
-    template<typename BidiIter>
-    struct alternates_vector;
-
     template<typename Matcher, typename Next>
     struct static_xpression;
 
@@ -321,37 +310,17 @@
 
     template<typename Matcher>
     static_xpression<Matcher> const
-    make_static(Matcher const &matcher);
+    make_static_xpression(Matcher const &matcher);
 
     template<typename Matcher, typename Next>
     static_xpression<Matcher, Next> const
-    make_static(Matcher const &matcher, Next const &next);
+    make_static_xpression(Matcher const &matcher, Next const &next);
 
     int get_mark_number(mark_tag const &);
 
     template<typename Xpr, typename BidiIter>
-    void static_compile(Xpr const &xpr, shared_ptr<regex_impl<BidiIter> > const &impl);
+    void static_compile(Xpr const &xpr, regex_impl<BidiIter> &impl);
 
-    struct quant_spec;
-
-    template<typename BidiIter, typename Xpr>
-    void make_simple_repeat(quant_spec const &spec, sequence<BidiIter> &seq, Xpr const &xpr);
-
-    template<typename BidiIter>
-    void make_simple_repeat(quant_spec const &spec, sequence<BidiIter> &seq);
-
-    template<typename BidiIter>
-    void make_repeat(quant_spec const &spec, sequence<BidiIter> &seq, int mark_nbr);
-
-    template<typename BidiIter>
-    void make_repeat(quant_spec const &spec, sequence<BidiIter> &seq);
-
-    template<typename BidiIter>
-    void make_optional(quant_spec const &spec, sequence<BidiIter> &seq);
-
-    template<typename BidiIter>
-    void make_optional(quant_spec const &spec, sequence<BidiIter> &seq, int mark_nbr);
-
 }}} // namespace boost::xpressive::detail
 
 /// INTERNAL ONLY

Modified: boost/trunk/boost/xpressive/detail/dynamic/dynamic.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/dynamic/dynamic.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/dynamic/dynamic.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,18 +13,15 @@
 # pragma once
 #endif
 
-#include <vector>
+#include <list>
 #include <utility>
 #include <algorithm>
 #include <boost/assert.hpp>
 #include <boost/mpl/int.hpp>
 #include <boost/mpl/assert.hpp>
-#include <boost/type_traits/is_same.hpp>
-#include <boost/iterator/transform_iterator.hpp>
 #include <boost/xpressive/detail/detail_fwd.hpp>
 #include <boost/xpressive/detail/core/quant_style.hpp>
 #include <boost/xpressive/detail/dynamic/matchable.hpp>
-#include <boost/xpressive/detail/dynamic/sequence.hpp>
 #include <boost/xpressive/detail/core/icase.hpp>
 
 namespace boost { namespace xpressive { namespace detail
@@ -32,143 +29,258 @@
 
 ///////////////////////////////////////////////////////////////////////////////
 // invalid_xpression
+//
 template<typename BidiIter>
 struct invalid_xpression
-  : matchable_ex<BidiIter>
+  : matchable<BidiIter>
 {
     invalid_xpression()
-      : matchable_ex<BidiIter>()
+      : matchable<BidiIter>()
     {
-        intrusive_ptr_add_ref(this); // keep alive forever
     }
-
+    
     bool match(state_type<BidiIter> &) const
     {
         BOOST_ASSERT(false);
         return false;
     }
+
+    std::size_t get_width(state_type<BidiIter> *) const
+    {
+        return 0;
+    }
+
+    static void noop(matchable<BidiIter> const *)
+    {
+    }
 };
 
 ///////////////////////////////////////////////////////////////////////////////
 // get_invalid_xpression
+//
 template<typename BidiIter>
-inline shared_matchable<BidiIter> const &get_invalid_xpression()
+inline shared_ptr<matchable<BidiIter> const> const &get_invalid_xpression()
 {
     static invalid_xpression<BidiIter> const invalid_xpr;
-    static intrusive_ptr<matchable_ex<BidiIter> const> const invalid_ptr(&invalid_xpr);
-    static shared_matchable<BidiIter> const invalid_matchable(invalid_ptr);
-    return invalid_matchable;
+
+    static shared_ptr<matchable<BidiIter> const> const invalid_ptr
+    (
+        static_cast<matchable<BidiIter> const *>(&invalid_xpr)
+      , &invalid_xpression<BidiIter>::noop
+    );
+
+    return invalid_ptr;
 }
 
 ///////////////////////////////////////////////////////////////////////////////
 // dynamic_xpression
+//
 template<typename Matcher, typename BidiIter>
 struct dynamic_xpression
   : Matcher
-  , matchable_ex<BidiIter>
+  , matchable<BidiIter>
 {
     typedef typename iterator_value<BidiIter>::type char_type;
 
+    shared_ptr<matchable<BidiIter> const> next_;
+
     dynamic_xpression(Matcher const &matcher = Matcher())
       : Matcher(matcher)
       , next_(get_invalid_xpression<BidiIter>())
     {
     }
 
-    virtual bool match(state_type<BidiIter> &state) const
+    bool match(state_type<BidiIter> &state) const
     {
-        return this->Matcher::match(state, *this->next_.matchable());
+        return this->Matcher::match(state, *this->next_);
     }
 
-    virtual void link(xpression_linker<char_type> &linker) const
+    std::size_t get_width(state_type<BidiIter> *state) const
     {
-        linker.accept(*static_cast<Matcher const *>(this), this->next_.matchable().get());
-        this->next_.link(linker);
+        std::size_t this_width = this->Matcher::get_width(state);
+        if(this_width == unknown_width())
+            return unknown_width();
+        std::size_t that_width = this->next_->get_width(state);
+        if(that_width == unknown_width())
+            return unknown_width();
+        return this_width + that_width;
     }
 
-    virtual void peek(xpression_peeker<char_type> &peeker) const
+    void link(xpression_linker<char_type> &linker) const
     {
-        this->peek_next_(peeker.accept(*static_cast<Matcher const *>(this)), peeker);
+        linker.link(*static_cast<Matcher const *>(this), this->next_.get());
+        this->next_->link(linker);
     }
 
-    virtual void repeat(quant_spec const &spec, sequence<BidiIter> &seq) const
+    void peek(xpression_peeker<char_type> &peeker) const
     {
-        this->repeat_(spec, seq, quant_type<Matcher>(), is_same<Matcher, mark_begin_matcher>());
+        this->peek_next_(peeker.peek(*static_cast<Matcher const *>(this)), peeker);
     }
 
-private:
-    friend struct sequence<BidiIter>;
-
-    void peek_next_(mpl::true_, xpression_peeker<char_type> &peeker) const
+    sequence<BidiIter> quantify
+    (
+        quant_spec const &spec
+      , std::size_t &hidden_mark_count
+      , sequence<BidiIter> seq
+      , alternates_factory<BidiIter> const &factory
+    ) const
     {
-        this->next_.peek(peeker);
+        return this->quantify_(spec, hidden_mark_count, seq, quant_type<Matcher>(), factory, this);
     }
 
-    void peek_next_(mpl::false_, xpression_peeker<char_type> &) const
+    bool is_quantifiable() const
     {
-        // no-node
+        return quant_type<Matcher>::value != (int)quant_none;
     }
 
-    void repeat_(quant_spec const &, sequence<BidiIter> &, mpl::int_<quant_none>, mpl::false_) const
-    {
-        BOOST_ASSERT(false); // should never get here
-        throw regex_error(regex_constants::error_badrepeat, "expression cannot be quantified");
-    }
+private:
 
-    void repeat_(quant_spec const &spec, sequence<BidiIter> &seq, mpl::int_<quant_fixed_width>, mpl::false_) const
+    void peek_next_(mpl::true_, xpression_peeker<char_type> &peeker) const
     {
-        if(this->next_ == get_invalid_xpression<BidiIter>())
-        {
-            make_simple_repeat(spec, seq, matcher_wrapper<Matcher>(*this));
-        }
-        else
-        {
-            this->repeat_(spec, seq, mpl::int_<quant_variable_width>(), mpl::false_());
-        }
+        this->next_->peek(peeker);
     }
 
-    void repeat_(quant_spec const &spec, sequence<BidiIter> &seq, mpl::int_<quant_variable_width>, mpl::false_) const
+    void peek_next_(mpl::false_, xpression_peeker<char_type> &) const
     {
-        if(!is_unknown(seq.width()) && seq.pure())
-        {
-            make_simple_repeat(spec, seq);
-        }
-        else
-        {
-            make_repeat(spec, seq);
-        }
+        // no-op
     }
 
-    void repeat_(quant_spec const &spec, sequence<BidiIter> &seq, mpl::int_<quant_fixed_width>, mpl::true_) const
-    {
-        make_repeat(spec, seq, this->mark_number_);
-    }
+    sequence<BidiIter> quantify_
+    (
+        quant_spec const &
+      , std::size_t &
+      , sequence<BidiIter>
+      , mpl::int_<quant_none>
+      , alternates_factory<BidiIter> const &
+      , void const *
+    ) const;
 
-    shared_matchable<BidiIter> next_;
+    sequence<BidiIter> quantify_
+    (
+        quant_spec const &
+      , std::size_t &
+      , sequence<BidiIter>
+      , mpl::int_<quant_fixed_width>
+      , alternates_factory<BidiIter> const &
+      , void const *
+    ) const;
+
+    sequence<BidiIter> quantify_
+    (
+        quant_spec const &
+      , std::size_t &
+      , sequence<BidiIter>
+      , mpl::int_<quant_variable_width>
+      , alternates_factory<BidiIter> const &
+      , void const *
+    ) const;
+
+    sequence<BidiIter> quantify_
+    (
+        quant_spec const &
+      , std::size_t &
+      , sequence<BidiIter>
+      , mpl::int_<quant_fixed_width>
+      , alternates_factory<BidiIter> const &
+      , mark_begin_matcher const *
+    ) const;
 };
 
 ///////////////////////////////////////////////////////////////////////////////
-// make_dynamic
+// make_dynamic_xpression
+//
 template<typename BidiIter, typename Matcher>
-inline sequence<BidiIter> make_dynamic(Matcher const &matcher)
+inline sequence<BidiIter> make_dynamic_xpression(Matcher const &matcher)
 {
     typedef dynamic_xpression<Matcher, BidiIter> xpression_type;
-    intrusive_ptr<xpression_type> xpr(new xpression_type(matcher));
-    return sequence<BidiIter>(xpr);
+    std::auto_ptr<xpression_type> xpr(new xpression_type(matcher));
+
+    sequence<BidiIter> seq;
+    seq.second = &xpr->next_;
+    seq.first = xpr;
+
+    return seq;
 }
 
 ///////////////////////////////////////////////////////////////////////////////
-// alternates_vector
+// alternates_factory
+//
 template<typename BidiIter>
-struct alternates_vector
-  : std::vector<shared_matchable<BidiIter> >
+struct alternates_factory
 {
-    BOOST_STATIC_CONSTANT(std::size_t, width = unknown_width::value);
-    BOOST_STATIC_CONSTANT(bool, pure = false);
+    typedef std::vector<shared_ptr<matchable<BidiIter> const> > alternates_vector;
+
+    virtual ~alternates_factory() {}
+
+    virtual std::pair<sequence<BidiIter>, alternates_vector *>
+    operator ()() const = 0;
 };
 
+template<typename BidiIter, typename Traits>
+struct alternates_factory_impl
+  : alternates_factory<BidiIter>
+{
+    typedef typename alternates_factory<BidiIter>::alternates_vector alternates_vector;
+
+    std::pair<sequence<BidiIter>, alternates_vector *>
+    operator ()() const
+    {
+        typedef alternate_matcher<alternates_vector, Traits> alternate_matcher;
+        typedef dynamic_xpression<alternate_matcher, BidiIter> alternate_xpression;
+        shared_ptr<alternate_xpression> alt_xpr(new alternate_xpression);
+        sequence<BidiIter> seq(alt_xpr, &alt_xpr->next_);
+        return std::make_pair(seq, &alt_xpr->alternates_);
+    }
+};
+
 ///////////////////////////////////////////////////////////////////////////////
+// alternates_to_matchable
+//
+template<typename BidiIter>
+inline sequence<BidiIter> alternates_to_matchable
+(
+    std::list<sequence<BidiIter> > const &alternates
+  , alternates_factory<BidiIter> const &factory
+)
+{
+    BOOST_ASSERT(0 != alternates.size());
+
+    // If there is only 1 alternate, just return it.
+    if(1 == alternates.size())
+    {
+        return alternates.front();
+    }
+
+    typedef std::vector<shared_ptr<matchable<BidiIter> const> > alternates_vector;
+    std::pair<sequence<BidiIter>, alternates_vector *> result = factory();
+
+    // through the wonders of reference counting, all alternates can share an end_alternate
+    typedef dynamic_xpression<alternate_end_matcher, BidiIter> alternate_end_xpression;
+    shared_ptr<alternate_end_xpression> end_alt_xpr(new alternate_end_xpression);
+
+    // terminate each alternate with an alternate_end_matcher
+    result.second->reserve(alternates.size());
+    typedef std::list<sequence<BidiIter> > alternates_list;
+    typename alternates_list::const_iterator begin = alternates.begin(), end = alternates.end();
+    for(; begin != end; ++begin)
+    {
+        if(!begin->is_empty())
+        {
+            result.second->push_back(begin->first);
+            *begin->second = end_alt_xpr;
+        }
+        else
+        {
+            result.second->push_back(end_alt_xpr);
+        }
+    }
+
+    return result.first;
+}
+
+///////////////////////////////////////////////////////////////////////////////
 // matcher_wrapper
+//
 template<typename Matcher>
 struct matcher_wrapper
   : Matcher
@@ -187,141 +299,138 @@
     template<typename Char>
     void link(xpression_linker<Char> &linker) const
     {
-        linker.accept(*static_cast<Matcher const *>(this), 0);
+        linker.link(*static_cast<Matcher const *>(this), 0);
     }
 
     template<typename Char>
     void peek(xpression_peeker<Char> &peeker) const
     {
-        peeker.accept(*static_cast<Matcher const *>(this));
+        peeker.peek(*static_cast<Matcher const *>(this));
     }
 };
 
 //////////////////////////////////////////////////////////////////////////
-// make_simple_repeat
-template<typename BidiIter, typename Xpr>
-inline void
-make_simple_repeat(quant_spec const &spec, sequence<BidiIter> &seq, Xpr const &xpr)
+// dynamic_xpression::quantify_
+//
+//   unquantifiable
+template<typename Matcher, typename BidiIter>
+inline sequence<BidiIter> dynamic_xpression<Matcher, BidiIter>::quantify_
+(
+    quant_spec const &
+  , std::size_t &
+  , sequence<BidiIter>
+  , mpl::int_<quant_none>
+  , alternates_factory<BidiIter> const &
+  , void const *
+) const
 {
-    if(spec.greedy_)
-    {
-        simple_repeat_matcher<Xpr, true> quant(xpr, spec.min_, spec.max_, seq.width().value());
-        seq = make_dynamic<BidiIter>(quant);
-    }
-    else
-    {
-        simple_repeat_matcher<Xpr, false> quant(xpr, spec.min_, spec.max_, seq.width().value());
-        seq = make_dynamic<BidiIter>(quant);
-    }
+    BOOST_ASSERT(false); // should never get here
+    throw regex_error(regex_constants::error_badrepeat, "expression cannot be quantified");
 }
 
-//////////////////////////////////////////////////////////////////////////
-// make_simple_repeat
-template<typename BidiIter>
-inline void
-make_simple_repeat(quant_spec const &spec, sequence<BidiIter> &seq)
+//   fixed-width matchers
+template<typename Matcher, typename BidiIter>
+inline sequence<BidiIter> dynamic_xpression<Matcher, BidiIter>::quantify_
+(
+    quant_spec const &spec
+  , std::size_t &hidden_mark_count
+  , sequence<BidiIter> seq
+  , mpl::int_<quant_fixed_width>
+  , alternates_factory<BidiIter> const &factory
+  , void const *
+) const
 {
-    seq += make_dynamic<BidiIter>(true_matcher());
-    make_simple_repeat(spec, seq, seq.xpr());
-}
-
-//////////////////////////////////////////////////////////////////////////
-// make_optional
-template<typename BidiIter>
-inline void
-make_optional(quant_spec const &spec, sequence<BidiIter> &seq)
-{
-    typedef shared_matchable<BidiIter> xpr_type;
-    seq += make_dynamic<BidiIter>(alternate_end_matcher());
-    if(spec.greedy_)
+    if(this->next_ != get_invalid_xpression<BidiIter>())
     {
-        optional_matcher<xpr_type, true> opt(seq.xpr());
-        seq = make_dynamic<BidiIter>(opt);
+        return this->quantify_(spec, hidden_mark_count, seq, mpl::int_<quant_variable_width>(), factory, this);
     }
-    else
-    {
-        optional_matcher<xpr_type, false> opt(seq.xpr());
-        seq = make_dynamic<BidiIter>(opt);
-    }
-}
 
-//////////////////////////////////////////////////////////////////////////
-// make_optional
-template<typename BidiIter>
-inline void
-make_optional(quant_spec const &spec, sequence<BidiIter> &seq, int mark_nbr)
-{
-    typedef shared_matchable<BidiIter> xpr_type;
-    seq += make_dynamic<BidiIter>(alternate_end_matcher());
+    typedef matcher_wrapper<Matcher> xpr_type;
+
     if(spec.greedy_)
     {
-        optional_mark_matcher<xpr_type, true> opt(seq.xpr(), mark_nbr);
-        seq = make_dynamic<BidiIter>(opt);
+        simple_repeat_matcher<xpr_type, true> quant(*this, spec.min_, spec.max_);
+        return make_dynamic_xpression<BidiIter>(quant);
     }
     else
     {
-        optional_mark_matcher<xpr_type, false> opt(seq.xpr(), mark_nbr);
-        seq = make_dynamic<BidiIter>(opt);
+        simple_repeat_matcher<xpr_type, false> quant(*this, spec.min_, spec.max_);
+        return make_dynamic_xpression<BidiIter>(quant);
     }
 }
 
-//////////////////////////////////////////////////////////////////////////
-// make_repeat
-template<typename BidiIter>
-inline void
-make_repeat(quant_spec const &spec, sequence<BidiIter> &seq)
+//   variable-width, no mark
+template<typename Matcher, typename BidiIter>
+inline sequence<BidiIter> dynamic_xpression<Matcher, BidiIter>::quantify_
+(
+    quant_spec const &spec
+  , std::size_t &hidden_mark_count
+  , sequence<BidiIter> seq
+  , mpl::int_<quant_variable_width>
+  , alternates_factory<BidiIter> const &factory
+  , void const *
+) const
 {
-    // only bother creating a repeater if max is greater than one
-    if(1 < spec.max_)
-    {
-        // create a hidden mark so this expression can be quantified
-        int mark_nbr = -static_cast<int>(++*spec.hidden_mark_count_);
-        seq = make_dynamic<BidiIter>(mark_begin_matcher(mark_nbr)) + seq
-            + make_dynamic<BidiIter>(mark_end_matcher(mark_nbr));
-        make_repeat(spec, seq, mark_nbr);
-        return;
-    }
-
-    // if min is 0, the repeat must be made optional
-    if(0 == spec.min_)
-    {
-        make_optional(spec, seq);
-    }
+    // create a hidden mark so this expression can be quantified
+    int mark_nbr = -static_cast<int>(++hidden_mark_count);
+    mark_begin_matcher mark_begin(mark_nbr);
+    mark_end_matcher mark_end(mark_nbr);
+    sequence<BidiIter> new_seq = make_dynamic_xpression<BidiIter>(mark_begin);
+    new_seq += seq;
+    new_seq += make_dynamic_xpression<BidiIter>(mark_end);
+    return new_seq.first->quantify(spec, hidden_mark_count, new_seq, factory);
 }
 
-//////////////////////////////////////////////////////////////////////////
-// make_repeat
-template<typename BidiIter>
-inline void
-make_repeat(quant_spec const &spec, sequence<BidiIter> &seq, int mark_nbr)
+//   variable-width with mark
+template<typename Matcher, typename BidiIter>
+inline sequence<BidiIter> dynamic_xpression<Matcher, BidiIter>::quantify_
+(
+    quant_spec const &spec
+  , std::size_t &
+  , sequence<BidiIter> seq
+  , mpl::int_<quant_fixed_width>
+  , alternates_factory<BidiIter> const &factory
+  , mark_begin_matcher const *
+) const
 {
     BOOST_ASSERT(spec.max_); // we should never get here if max is 0
+    int mark_number = this->mark_number_;
 
-    // only bother creating a repeater if max is greater than one
+    // only bother creating a quantifier if max is greater than one
     if(1 < spec.max_)
     {
-        // TODO: statically bind the repeat matchers to the mark matchers for better perf
         unsigned int min = spec.min_ ? spec.min_ : 1U;
-        repeat_begin_matcher repeat_begin(mark_nbr);
+        detail::sequence<BidiIter> seq_quant;
+        // TODO: statically bind the repeat_begin_matcher to the mark_begin for better perf
+        seq_quant += make_dynamic_xpression<BidiIter>(repeat_begin_matcher(mark_number));
+        // TODO: statically bind the mark_end to the quantifier_end for better perf
         if(spec.greedy_)
         {
-            repeat_end_matcher<true> repeat_end(mark_nbr, min, spec.max_);
-            seq = make_dynamic<BidiIter>(repeat_begin) + seq
-                + make_dynamic<BidiIter>(repeat_end);
+            repeat_end_matcher<true> end_quant(mark_number, min, spec.max_);
+            seq += make_dynamic_xpression<BidiIter>(end_quant);
         }
         else
         {
-            repeat_end_matcher<false> repeat_end(mark_nbr, min, spec.max_);
-            seq = make_dynamic<BidiIter>(repeat_begin) + seq
-                + make_dynamic<BidiIter>(repeat_end);
+            repeat_end_matcher<false> end_quant(mark_number, min, spec.max_);
+            seq += make_dynamic_xpression<BidiIter>(end_quant);
         }
+        seq_quant += seq;
+        seq = seq_quant;
     }
 
-    // if min is 0, the repeat must be made optional
+    // if min is 0, the quant must be made alternate with an empty matcher.
     if(0 == spec.min_)
     {
-        make_optional(spec, seq, mark_nbr);
+        epsilon_mark_matcher mark(mark_number);
+        std::list<sequence<BidiIter> > alts;
+        alts.push_back(make_dynamic_xpression<BidiIter>(mark));
+        alts.push_back(seq);
+        if(spec.greedy_)
+            alts.reverse();
+        seq = alternates_to_matchable(alts, factory);
     }
+
+    return seq;
 }
 
 }}} // namespace boost::xpressive::detail

Modified: boost/trunk/boost/xpressive/detail/dynamic/matchable.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/dynamic/matchable.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/dynamic/matchable.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,64 +13,109 @@
 # pragma once
 #endif
 
+#include <utility>
 #include <boost/assert.hpp>
+#include <boost/shared_ptr.hpp>
 #include <boost/mpl/assert.hpp>
-#include <boost/intrusive_ptr.hpp>
 #include <boost/type_traits/is_same.hpp>
+#include <boost/xpressive/detail/core/state.hpp>
 #include <boost/xpressive/detail/core/quant_style.hpp>
-#include <boost/xpressive/detail/utility/counted_base.hpp>
-#include <boost/xpressive/detail/detail_fwd.hpp>
 #include <boost/xpressive/regex_error.hpp>
 
 namespace boost { namespace xpressive { namespace detail
 {
 
+template<typename BidiIter>
+struct matchable;
+
+///////////////////////////////////////////////////////////////////////////////
+// sequence
+//
+template<typename BidiIter>
+struct sequence
+  : std::pair
+    <
+        shared_ptr<matchable<BidiIter> const>
+      , shared_ptr<matchable<BidiIter> const> *
+    >
+{
+    typedef shared_ptr<matchable<BidiIter> const> matchable_ptr_t;
+    typedef std::pair<matchable_ptr_t, matchable_ptr_t *> base_t;
+
+    explicit sequence(matchable_ptr_t head = matchable_ptr_t(), matchable_ptr_t *tail_ptr = 0)
+      : base_t(head, tail_ptr)
+    {
+    }
+
+    bool is_empty() const
+    {
+        return !this->first;
+    }
+
+    sequence &operator +=(sequence that)
+    {
+        if(is_empty())
+        {
+            *this = that;
+        }
+        else if(!that.is_empty())
+        {
+            *this->second = that.first;
+            this->second = that.second;
+        }
+        return *this;
+    }
+};
+
 //////////////////////////////////////////////////////////////////////////
 // quant_spec
+//
 struct quant_spec
 {
     unsigned int min_;
     unsigned int max_;
     bool greedy_;
-    std::size_t *hidden_mark_count_;
 };
 
 ///////////////////////////////////////////////////////////////////////////////
 // matchable
+//
 template<typename BidiIter>
 struct matchable
   : xpression_base
 {
-    typedef BidiIter iterator_type;
-    typedef typename iterator_value<iterator_type>::type char_type;
+    typedef typename iterator_value<BidiIter>::type char_type;
+
     virtual ~matchable() {}
+
     virtual bool match(state_type<BidiIter> &state) const = 0;
-};
 
-///////////////////////////////////////////////////////////////////////////////
-// matchable_ex
-template<typename BidiIter>
-struct matchable_ex
-  : matchable<BidiIter>
-  , counted_base<matchable_ex<BidiIter> >
-{
-    typedef BidiIter iterator_type;
-    typedef typename iterator_value<iterator_type>::type char_type;
+    virtual std::size_t get_width(state_type<BidiIter> *state) const = 0;
 
-    virtual void link(xpression_linker<char_type> &) const
-    {
-    }
+    virtual void link(xpression_linker<char_type> &) const {}
 
     virtual void peek(xpression_peeker<char_type> &peeker) const
     {
         peeker.fail();
     }
 
-    virtual void repeat(quant_spec const &, sequence<BidiIter> &) const
+    virtual sequence<BidiIter> quantify
+    (
+        quant_spec const & //spec
+      , std::size_t & //hidden_mark_count
+      , sequence<BidiIter> //seq
+      , alternates_factory<BidiIter> const &//factory
+    ) const
     {
         throw regex_error(regex_constants::error_badrepeat, "expression cannot be quantified");
     }
 
+    virtual bool is_quantifiable() const
+    {
+        BOOST_ASSERT(false);
+        throw regex_error(regex_constants::error_internal, "internal error, sorry!");
+    }
+
     ///////////////////////////////////////////////////////////////////////////////////////////////
     // The following 4 functions (push_match, top_match, pop_match and skip_match) are
     // used to implement looping and branching across the matchers. Call push_match to record
@@ -85,18 +130,18 @@
     template<typename Top>
     bool push_match(state_type<BidiIter> &state) const
     {
-        BOOST_MPL_ASSERT((is_same<Top, matchable_ex<BidiIter> >));
+        BOOST_MPL_ASSERT((is_same<Top, matchable<BidiIter> >));
         return this->match(state);
     }
 
     static bool top_match(state_type<BidiIter> &state, xpression_base const *top)
     {
-        return static_cast<matchable_ex<BidiIter> const *>(top)->match(state);
+        return static_cast<matchable<BidiIter> const *>(top)->match(state);
     }
 
     static bool pop_match(state_type<BidiIter> &state, xpression_base const *top)
     {
-        return static_cast<matchable_ex<BidiIter> const *>(top)->match(state);
+        return static_cast<matchable<BidiIter> const *>(top)->match(state);
     }
 
     bool skip_match(state_type<BidiIter> &state) const
@@ -105,70 +150,6 @@
     }
 };
 
-///////////////////////////////////////////////////////////////////////////////
-// shared_matchable
-template<typename BidiIter>
-struct shared_matchable
-{
-    typedef BidiIter iterator_type;
-    typedef typename iterator_value<BidiIter>::type char_type;
-    typedef intrusive_ptr<matchable_ex<BidiIter> const> matchable_ptr;
-
-    BOOST_STATIC_CONSTANT(std::size_t, width = unknown_width::value);
-    BOOST_STATIC_CONSTANT(bool, pure = false);
-
-    shared_matchable(matchable_ptr const &xpr = matchable_ptr())
-      : xpr_(xpr)
-    {
-    }
-
-    bool operator !() const
-    {
-        return !this->xpr_;
-    }
-
-    friend bool operator ==(shared_matchable<BidiIter> const &left, shared_matchable<BidiIter> const &right)
-    {
-        return left.xpr_ == right.xpr_;
-    }
-
-    friend bool operator !=(shared_matchable<BidiIter> const &left, shared_matchable<BidiIter> const &right)
-    {
-        return left.xpr_ != right.xpr_;
-    }
-
-    matchable_ptr const &matchable() const
-    {
-        return this->xpr_;
-    }
-
-    bool match(state_type<BidiIter> &state) const
-    {
-        return this->xpr_->match(state);
-    }
-
-    void link(xpression_linker<char_type> &linker) const
-    {
-        this->xpr_->link(linker);
-    }
-
-    void peek(xpression_peeker<char_type> &peeker) const
-    {
-        this->xpr_->peek(peeker);
-    }
-
-    // BUGBUG yuk! 
-    template<typename Top>
-    bool push_match(state_type<BidiIter> &state) const
-    {
-        BOOST_MPL_ASSERT((is_same<Top, matchable_ex<BidiIter> >));
-        return this->match(state);
-    }
-
-private:
-    matchable_ptr xpr_;
-};
-
 }}} // namespace boost::xpressive::detail
 
 #endif

Modified: boost/trunk/boost/xpressive/detail/dynamic/parser.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/dynamic/parser.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/dynamic/parser.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -58,12 +58,12 @@
     if(0 != (regex_constants::icase_ & flags))
     {
         literal_matcher<Traits, true, false> matcher(ch, traits);
-        return make_dynamic<BidiIter>(matcher);
+        return make_dynamic_xpression<BidiIter>(matcher);
     }
     else
     {
         literal_matcher<Traits, false, false> matcher(ch, traits);
-        return make_dynamic<BidiIter>(matcher);
+        return make_dynamic_xpression<BidiIter>(matcher);
     }
 }
 
@@ -91,16 +91,16 @@
     switch(((int)not_dot_newline | not_dot_null) & flags)
     {
     case not_dot_null:
-        return make_dynamic<BidiIter>(literal_matcher(char_type(0), traits));
+        return make_dynamic_xpression<BidiIter>(literal_matcher(char_type(0), traits));
 
     case not_dot_newline:
-        return make_dynamic<BidiIter>(literal_matcher(newline, traits));
+        return make_dynamic_xpression<BidiIter>(literal_matcher(newline, traits));
 
     case (int)not_dot_newline | not_dot_null:
-        return make_dynamic<BidiIter>(s);
+        return make_dynamic_xpression<BidiIter>(s);
 
     default:
-        return make_dynamic<BidiIter>(any_matcher());
+        return make_dynamic_xpression<BidiIter>(any_matcher());
     }
 }
 
@@ -127,12 +127,12 @@
     if(0 != (regex_constants::icase_ & flags))
     {
         string_matcher<Traits, true> matcher(literal, traits);
-        return make_dynamic<BidiIter>(matcher);
+        return make_dynamic_xpression<BidiIter>(matcher);
     }
     else
     {
         string_matcher<Traits, false> matcher(literal, traits);
-        return make_dynamic<BidiIter>(matcher);
+        return make_dynamic_xpression<BidiIter>(matcher);
     }
 }
 
@@ -150,14 +150,14 @@
     typedef typename iterator_value<BidiIter>::type char_type;
     if(0 != (regex_constants::icase_ & flags))
     {
-        return make_dynamic<BidiIter>
+        return make_dynamic_xpression<BidiIter>
         (
             mark_matcher<Traits, true>(mark_nbr, traits)
         );
     }
     else
     {
-        return make_dynamic<BidiIter>
+        return make_dynamic_xpression<BidiIter>
         (
             mark_matcher<Traits, false>(mark_nbr, traits)
         );
@@ -232,13 +232,13 @@
         {
             charset_matcher<Traits, true, charset_type> matcher(charset);
             merge_charset(matcher.charset_, chset, traits);
-            return make_dynamic<BidiIter>(matcher);
+            return make_dynamic_xpression<BidiIter>(matcher);
         }
         else
         {
             charset_matcher<Traits, false, charset_type> matcher(charset);
             merge_charset(matcher.charset_, chset, traits);
-            return make_dynamic<BidiIter>(matcher);
+            return make_dynamic_xpression<BidiIter>(matcher);
         }
     }
 
@@ -247,7 +247,7 @@
     {
         BOOST_ASSERT(0 != chset.posix_yes());
         posix_charset_matcher<Traits> matcher(chset.posix_yes(), chset.is_inverted());
-        return make_dynamic<BidiIter>(matcher);
+        return make_dynamic_xpression<BidiIter>(matcher);
     }
 
     // default, slow
@@ -256,12 +256,12 @@
         if(icase)
         {
             charset_matcher<Traits, true> matcher(chset);
-            return make_dynamic<BidiIter>(matcher);
+            return make_dynamic_xpression<BidiIter>(matcher);
         }
         else
         {
             charset_matcher<Traits, false> matcher(chset);
-            return make_dynamic<BidiIter>(matcher);
+            return make_dynamic_xpression<BidiIter>(matcher);
         }
     }
 }
@@ -279,7 +279,7 @@
 )
 {
     posix_charset_matcher<Traits> charset(m, no);
-    return make_dynamic<BidiIter>(charset);
+    return make_dynamic_xpression<BidiIter>(charset);
 }
 
 ///////////////////////////////////////////////////////////////////////////////
@@ -294,12 +294,12 @@
 {
     if(0 != (regex_constants::single_line & flags))
     {
-        return detail::make_dynamic<BidiIter>(detail::assert_bos_matcher());
+        return detail::make_dynamic_xpression<BidiIter>(detail::assert_bos_matcher());
     }
     else
     {
         detail::assert_bol_matcher<Traits> matcher(traits);
-        return detail::make_dynamic<BidiIter>(matcher);
+        return detail::make_dynamic_xpression<BidiIter>(matcher);
     }
 }
 
@@ -315,12 +315,12 @@
 {
     if(0 != (regex_constants::single_line & flags))
     {
-        return detail::make_dynamic<BidiIter>(detail::assert_eos_matcher());
+        return detail::make_dynamic_xpression<BidiIter>(detail::assert_eos_matcher());
     }
     else
     {
         detail::assert_eol_matcher<Traits> matcher(traits);
-        return detail::make_dynamic<BidiIter>(matcher);
+        return detail::make_dynamic_xpression<BidiIter>(matcher);
     }
 }
 
@@ -331,7 +331,7 @@
 inline sequence<BidiIter> make_assert_word(Cond, Traits const &traits)
 {
     typedef typename iterator_value<BidiIter>::type char_type;
-    return detail::make_dynamic<BidiIter>
+    return detail::make_dynamic_xpression<BidiIter>
     (
         detail::assert_word_matcher<Cond, Traits>(traits)
     );

Modified: boost/trunk/boost/xpressive/detail/dynamic/parser_traits.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/dynamic/parser_traits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/dynamic/parser_traits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -350,8 +350,8 @@
         case BOOST_XPR_CHAR_(char_type, '-'): if(false == (set = !set)) break; // else fall-through
         default: throw regex_error(error_paren, "unknown pattern modifier");
         }
-        while(detail::ensure(++begin != end, error_paren, "incomplete extension"), true);
-        BOOST_UNREACHABLE_RETURN(token_no_mark);
+        while(detail::ensure(++begin != end, error_paren, "incomplete extension"));
+        return token_no_mark;
     }
 
     ///////////////////////////////////////////////////////////////////////////////

Deleted: boost/trunk/boost/xpressive/detail/dynamic/sequence.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/dynamic/sequence.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/dynamic/sequence.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,175 +0,0 @@
-///////////////////////////////////////////////////////////////////////////////
-// sequence.hpp
-//
-//  Copyright 2004 Eric Niebler. Distributed under the Boost
-//  Software License, Version 1.0. (See accompanying file
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef BOOST_XPRESSIVE_DETAIL_DYNAMIC_SEQUENCE_HPP_EAN_04_10_2006
-#define BOOST_XPRESSIVE_DETAIL_DYNAMIC_SEQUENCE_HPP_EAN_04_10_2006
-
-// MS compatible compilers support #pragma once
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
-# pragma once
-#endif
-
-#include <boost/assert.hpp>
-#include <boost/intrusive_ptr.hpp>
-#include <boost/xpressive/detail/utility/width.hpp>
-#include <boost/xpressive/detail/detail_fwd.hpp>
-
-namespace boost { namespace xpressive { namespace detail
-{
-
-///////////////////////////////////////////////////////////////////////////////
-// sequence
-template<typename BidiIter>
-struct sequence
-{
-    sequence()
-      : pure_(true)
-      , width_(0)
-      , quant_(quant_none)
-      , head_()
-      , tail_(0)
-      , alt_end_xpr_()
-      , alternates_(0)
-    {
-    }
-
-    template<typename Matcher>
-    sequence(intrusive_ptr<dynamic_xpression<Matcher, BidiIter> > const &xpr)
-      : pure_(Matcher::pure)
-      , width_(xpr->Matcher::get_width())
-      , quant_(Matcher::quant)
-      , head_(xpr)
-      , tail_(&xpr->next_)
-      , alt_end_xpr_()
-      , alternates_(0)
-    {
-    }
-
-    template<typename Traits>
-    sequence(intrusive_ptr<dynamic_xpression<alternate_matcher<alternates_vector<BidiIter>, Traits>, BidiIter> > const &xpr)
-      : pure_(true)
-      , width_(0)
-      , quant_(quant_none)
-      , head_(xpr)
-      , tail_(&xpr->next_)
-      , alt_end_xpr_()
-      , alternates_(&xpr->alternates_)
-    {
-    }
-
-    bool empty() const
-    {
-        return !this->head_;
-    }
-
-    sequence<BidiIter> &operator +=(sequence<BidiIter> const &that)
-    {
-        if(this->empty())
-        {
-            *this = that;
-        }
-        else if(!that.empty())
-        {
-            *this->tail_ = that.head_;
-            this->tail_ = that.tail_;
-            // keep track of sequence width and purity
-            this->width_ += that.width_;
-            this->pure_ = this->pure_ && that.pure_;
-            this->set_quant_();
-        }
-        return *this;
-    }
-
-    sequence<BidiIter> &operator |=(sequence<BidiIter> that)
-    {
-        BOOST_ASSERT(!this->empty());
-        BOOST_ASSERT(0 != this->alternates_);
-
-        // Keep track of width and purity
-        if(this->alternates_->empty())
-        {
-            this->width_ = that.width_;
-            this->pure_ = that.pure_;
-        }
-        else
-        {
-            this->width_ |= that.width_;
-            this->pure_ = this->pure_ && that.pure_;
-        }
-
-        // through the wonders of reference counting, all alternates_ can share an end_alternate
-        if(!this->alt_end_xpr_)
-        {
-            this->alt_end_xpr_ = new alt_end_xpr_type;
-        }
-
-        // terminate each alternate with an alternate_end_matcher
-        that += sequence(this->alt_end_xpr_);
-        this->alternates_->push_back(that.head_);
-        this->set_quant_();
-        return *this;
-    }
-
-    void repeat(quant_spec const &spec)
-    {
-        this->xpr().matchable()->repeat(spec, *this);
-    }
-
-    shared_matchable<BidiIter> const &xpr() const
-    {
-        return this->head_;
-    }
-
-    detail::width width() const
-    {
-        return this->width_;
-    }
-
-    bool pure() const
-    {
-        return this->pure_;
-    }
-
-    quant_enum quant() const
-    {
-        return this->quant_;
-    }
-
-private:
-    typedef dynamic_xpression<alternate_end_matcher, BidiIter> alt_end_xpr_type;
-
-    void set_quant_()
-    {
-        this->quant_ = (!is_unknown(this->width_) && this->pure_)
-          ? (!this->width_ ? quant_none : quant_fixed_width)
-          : quant_variable_width;
-    }
-
-    bool pure_;
-    detail::width width_;
-    quant_enum quant_;
-    shared_matchable<BidiIter> head_;
-    shared_matchable<BidiIter> *tail_;
-    intrusive_ptr<alt_end_xpr_type> alt_end_xpr_;
-    alternates_vector<BidiIter> *alternates_;
-};
-
-template<typename BidiIter>
-inline sequence<BidiIter> operator +(sequence<BidiIter> left, sequence<BidiIter> const &right)
-{
-    return left += right;
-}
-
-template<typename BidiIter>
-inline sequence<BidiIter> operator |(sequence<BidiIter> left, sequence<BidiIter> const &right)
-{
-    return left |= right;
-}
-
-}}} // namespace boost::xpressive::detail
-
-#endif

Modified: boost/trunk/boost/xpressive/detail/static/as_xpr.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/as_xpr.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/as_xpr.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -70,7 +70,7 @@
     ///////////////////////////////////////////////////////////////////////////////
     // as_matcher
     template<typename Matcher, bool IsXpr = is_xpr<Matcher>::value>
-    struct as_matcher
+    struct as_matcher_type
     {
         typedef Matcher type;
 
@@ -81,7 +81,7 @@
     };
 
     template<typename Literal>
-    struct as_matcher<Literal, false>
+    struct as_matcher_type<Literal, false>
     {
         typedef typename mpl::eval_if
         <
@@ -97,7 +97,7 @@
     };
 
     template<typename BidiIter>
-    struct as_matcher<basic_regex<BidiIter>, false>
+    struct as_matcher_type<basic_regex<BidiIter>, false>
     {
         typedef regex_placeholder<BidiIter, false> type;
 
@@ -110,7 +110,7 @@
     };
 
     template<typename BidiIter>
-    struct as_matcher<reference_wrapper<basic_regex<BidiIter> const>, false>
+    struct as_matcher_type<reference_wrapper<basic_regex<BidiIter> const>, false>
     {
         typedef regex_placeholder<BidiIter, false> type;
 
@@ -122,27 +122,6 @@
         }
     };
 
-    template<typename Matcher>
-    struct as_matcher<Matcher &, true>
-      : as_matcher<Matcher, true>
-    {};
-
-    template<typename Matcher>
-    struct as_matcher<Matcher const, true>
-      : as_matcher<Matcher, true>
-    {};
-
-    template<typename Matcher>
-    struct as_matcher<Matcher &, false>
-      : as_matcher<Matcher, false>
-    {};
-
-    template<typename Matcher>
-    struct as_matcher<Matcher const, false>
-      : as_matcher<Matcher, false>
-    {};
-
-
     ///////////////////////////////////////////////////////////////////////////////
     // as_xpr_type
     //
@@ -150,7 +129,7 @@
     struct as_xpr_type<Xpr, true> // is_op == true
     {
         typedef Xpr type;
-        typedef Xpr const &reference;
+        typedef Xpr const &const_reference;
 
         static Xpr const &call(Xpr const &xpr)
         {
@@ -163,15 +142,15 @@
     {
         typedef proto::unary_op
         <
-            typename as_matcher<Xpr>::type
+            typename as_matcher_type<Xpr>::type
           , proto::noop_tag
         > type;
 
-        typedef type const reference;
+        typedef type const const_reference;
 
         static type const call(Xpr const &xpr)
         {
-            return proto::noop(detail::as_matcher<Xpr>::call(xpr));
+            return proto::noop(detail::as_matcher_type<Xpr>::call(xpr));
         }
     };
 
@@ -185,7 +164,7 @@
     // as_xpr (from a literal to an xpression)
     //
     template<typename Xpr>
-    inline typename detail::as_xpr_type<Xpr>::reference
+    inline typename detail::as_xpr_type<Xpr>::const_reference
     as_xpr(Xpr const &xpr)
     {
         return detail::as_xpr_type<Xpr>::call(xpr);

Modified: boost/trunk/boost/xpressive/detail/static/compile.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/compile.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/compile.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,27 +32,30 @@
     ///////////////////////////////////////////////////////////////////////////////
     // static_compile_impl2
     template<typename Xpr, typename BidiIter, typename Traits>
-    void static_compile_impl2(Xpr const &xpr, shared_ptr<regex_impl<BidiIter> > const &impl, Traits const &traits)
+    void static_compile_impl2(Xpr const &xpr, regex_impl<BidiIter> &impl, Traits const &traits)
     {
-        impl->tracking_clear();
-        impl->traits_ = new traits_holder<Traits>(traits);
-
-        // "compile" the regex and wrap it in an xpression_adaptor.
-        xpression_visitor<BidiIter, mpl::false_, Traits> visitor(traits, impl);
-        intrusive_ptr<matchable_ex<BidiIter> const> adxpr = make_adaptor<matchable_ex<BidiIter> >(
+        typedef typename iterator_value<BidiIter>::type char_type;
+        // "compile" the regex and wrap it in an xpression_adaptor
+        xpression_visitor<BidiIter, mpl::false_, Traits> visitor(traits, impl.shared_from_this());
+        visitor.impl().traits_.reset(new Traits(visitor.traits()));
+        visitor.impl().xpr_ = make_adaptor<BidiIter>(
             proto::compile(xpr, end_xpression(), visitor, seq_tag()));
 
-        // Link and optimize the regex
-        common_compile(adxpr, *impl, visitor.traits());
+        // "link" the regex
+        xpression_linker<char_type> linker(visitor.traits());
+        visitor.impl().xpr_->link(linker);
 
-        // References changed, update dependencies.
-        impl->tracking_update();
+        // optimization: get the peek chars OR the boyer-moore search string
+        optimize_regex(visitor.impl(), visitor.traits(), is_random<BidiIter>());
+
+        // copy the implementation
+        impl.tracking_copy(visitor.impl());
     }
 
     ///////////////////////////////////////////////////////////////////////////////
     // static_compile_impl1
     template<typename Xpr, typename BidiIter>
-    void static_compile_impl1(Xpr const &xpr, shared_ptr<regex_impl<BidiIter> > const &impl)
+    void static_compile_impl1(Xpr const &xpr, regex_impl<BidiIter> &impl)
     {
         // use default traits
         typedef typename iterator_value<BidiIter>::type char_type;
@@ -67,7 +70,7 @@
     void static_compile_impl1
     (
         proto::binary_op<locale_modifier<Locale>, Xpr, modifier_tag> const &xpr
-      , shared_ptr<regex_impl<BidiIter> > const &impl
+      , regex_impl<BidiIter> &impl
     )
     {
         // use specified traits
@@ -78,7 +81,7 @@
     ///////////////////////////////////////////////////////////////////////////////
     // static_compile
     template<typename Xpr, typename BidiIter>
-    void static_compile(Xpr const &xpr, shared_ptr<regex_impl<BidiIter> > const &impl)
+    void static_compile(Xpr const &xpr, regex_impl<BidiIter> &impl)
     {
         static_compile_impl1(xpr, impl);
     }

Modified: boost/trunk/boost/xpressive/detail/static/is_pure.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/is_pure.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/is_pure.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,175 +13,237 @@
 # pragma once
 #endif
 
+#include <vector>
+#include <boost/ref.hpp>
+#include <boost/shared_ptr.hpp>
+#include <boost/mpl/and.hpp>
 #include <boost/mpl/bool.hpp>
+#include <boost/mpl/fold.hpp>
+#include <boost/mpl/lambda.hpp>
 #include <boost/mpl/assert.hpp>
+#include <boost/mpl/not_equal_to.hpp>
+#include <boost/mpl/transform_view.hpp>
 #include <boost/xpressive/detail/detail_fwd.hpp>
 #include <boost/xpressive/detail/static/as_xpr.hpp>
 #include <boost/xpressive/detail/static/width_of.hpp>
 
-///////////////////////////////////////////////////////////////////////////////
-// equivalent to mpl::and_<X, Y>
-#define BOOST_XPR_AND_PURE_(X, Y)                                                                   \
-    mpl::bool_<X::value && Y::value>
-
 namespace boost { namespace xpressive { namespace detail
 {
     ///////////////////////////////////////////////////////////////////////////////
     // use_simple_repeat
     //
-    template<typename Node>
+    template<typename Xpr>
     struct use_simple_repeat;
 
     ///////////////////////////////////////////////////////////////////////////////
     // is_pure
     //
-    template<typename Node>
+    template<typename Xpr>
     struct is_pure;
 
-    template<typename Node>
-    struct is_pure<Node &>
-      : is_pure<Node>
-    {};
+    template<>
+    struct is_pure<no_next>
+      : mpl::true_
+    {
+    };
 
-    template<typename Node>
-    struct is_pure<Node const>
-      : is_pure<Node>
-    {};
-
     template<typename Matcher>
     struct is_pure<proto::unary_op<Matcher, proto::noop_tag> >
-      : mpl::bool_<as_matcher<Matcher>::type::pure>
-    {};
+      : as_matcher_type<Matcher>::type::pure
+    {
+    };
 
     template<typename Left, typename Right>
     struct is_pure<proto::binary_op<Left, Right, proto::right_shift_tag> >
-      : BOOST_XPR_AND_PURE_(is_pure<Left>, is_pure<Right>)
-    {};
+      : mpl::and_<is_pure<Left>, is_pure<Right> >
+    {
+    };
 
     template<typename Left, typename Right>
     struct is_pure<proto::binary_op<Left, Right, proto::bitor_tag> >
-      : BOOST_XPR_AND_PURE_(is_pure<Left>, is_pure<Right>)
-    {};
+      : mpl::and_<is_pure<Left>, is_pure<Right> >
+    {
+    };
 
     template<typename Right>
-    struct is_pure<proto::binary_op<mark_tag const, Right, proto::assign_tag> >
+    struct is_pure<proto::binary_op<mark_tag, Right, proto::assign_tag> >
       : mpl::false_
-    {};
+    {
+    };
 
     template<typename Right>
-    struct is_pure<proto::binary_op<set_initializer_type const, Right, proto::assign_tag> >
+    struct is_pure<proto::binary_op<set_initializer_type, Right, proto::assign_tag> >
       : mpl::true_
-    {};
+    {
+    };
 
-    template<typename Modifier, typename Node>
-    struct is_pure<proto::binary_op<Modifier, Node, modifier_tag> >
-      : is_pure<Node>
-    {};
+    template<typename Modifier, typename Xpr>
+    struct is_pure<proto::binary_op<Modifier, Xpr, modifier_tag> >
+      : is_pure<Xpr>
+    {
+    };
 
-    template<typename Node, bool Positive>
-    struct is_pure<proto::unary_op<Node, lookahead_tag<Positive> > >
-      : is_pure<Node>
-    {};
+    template<typename Xpr, bool Positive>
+    struct is_pure<proto::unary_op<Xpr, lookahead_tag<Positive> > >
+      : is_pure<Xpr>
+    {
+    };
 
-    template<typename Node, bool Positive>
-    struct is_pure<proto::unary_op<Node, lookbehind_tag<Positive> > >
-      : is_pure<Node>
-    {};
+    template<typename Xpr, bool Positive>
+    struct is_pure<proto::unary_op<Xpr, lookbehind_tag<Positive> > >
+      : is_pure<Xpr>
+    {
+    };
 
-    template<typename Node>
-    struct is_pure<proto::unary_op<Node, keeper_tag> >
-      : is_pure<Node>
-    {};
+    template<typename Xpr>
+    struct is_pure<proto::unary_op<Xpr, keeper_tag> >
+      : is_pure<Xpr>
+    {
+    };
 
+    template<typename Matcher, typename Next>
+    struct is_pure<static_xpression<Matcher, Next> >
+      : mpl::and_<typename Matcher::pure, is_pure<Next> >::type
+    {
+    };
+
+    template<typename BidiIter>
+    struct is_pure<shared_ptr<matchable<BidiIter> const> >
+      : mpl::false_
+    {
+    };
+
+    template<typename BidiIter>
+    struct is_pure<std::vector<shared_ptr<matchable<BidiIter> const> > >
+        : mpl::false_
+    {
+    };
+
+    //template<typename BidiIter>
+    //struct is_pure<basic_regex<BidiIter> >
+    //    : mpl::false_
+    //{
+    //};
+
+    template<typename BidiIter>
+    struct is_pure<proto::unary_op<basic_regex<BidiIter>, proto::noop_tag> >
+      : mpl::false_
+    {
+    };
+
+    template<typename BidiIter>
+    struct is_pure<proto::unary_op<reference_wrapper<basic_regex<BidiIter> const>, proto::noop_tag> >
+      : mpl::false_
+    {
+    };
+
     // when complementing a set or an assertion, the purity is that of the set (true) or the assertion
-    template<typename Node>
-    struct is_pure<proto::unary_op<Node, proto::complement_tag> >
-      : is_pure<Node>
-    {};
+    template<typename Op>
+    struct is_pure<proto::unary_op<Op, proto::complement_tag> >
+      : is_pure<Op>
+    {
+    };
 
     // The comma is used in list-initialized sets, which are pure
     template<typename Left, typename Right>
     struct is_pure<proto::binary_op<Left, Right, proto::comma_tag> >
       : mpl::true_
-    {};
+    {
+    };
 
     // The subscript operator[] is used for sets, as in set['a' | range('b','h')]
     // It is also used for actions, which by definition have side-effects and thus are impure
     template<typename Left, typename Right>
     struct is_pure<proto::binary_op<Left, Right, proto::subscript_tag> >
-      : mpl::false_
-    {};
-
-    template<typename Right>
-    struct is_pure<proto::binary_op<set_initializer_type const, Right, proto::subscript_tag> >
-      : mpl::true_
+      : is_same<Left, set_initializer_type>
     {
         // If Left is "set" then make sure that Right is pure
-        BOOST_MPL_ASSERT((is_pure<Right>));
+        BOOST_MPL_ASSERT
+        ((
+            mpl::or_
+            <
+                mpl::not_<is_same<Left, set_initializer_type> >
+              , is_pure<Right>
+            >
+        ));
     };
 
     // Quantified expressions are pure IFF they use the simple_repeat_matcher
-    template<typename Node>
-    struct is_pure<proto::unary_op<Node, proto::unary_plus_tag> >
-      : use_simple_repeat<Node>
-    {};
 
-    template<typename Node>
-    struct is_pure<proto::unary_op<Node, proto::unary_star_tag> >
-      : use_simple_repeat<Node>
-    {};
+    template<typename Op>
+    struct is_pure<proto::unary_op<Op, proto::unary_plus_tag> >
+      : use_simple_repeat<Op>
+    {
+    };
 
-    template<typename Node>
-    struct is_pure<proto::unary_op<Node, proto::logical_not_tag> >
-      : use_simple_repeat<Node>
-    {};
+    template<typename Op>
+    struct is_pure<proto::unary_op<Op, proto::unary_star_tag> >
+      : use_simple_repeat<Op>
+    {
+    };
 
-    template<typename Node, uint_t Min, uint_t Max>
-    struct is_pure<proto::unary_op<Node, generic_quant_tag<Min, Max> > >
-      : use_simple_repeat<Node>
-    {};
+    template<typename Op>
+    struct is_pure<proto::unary_op<Op, proto::logical_not_tag> >
+      : use_simple_repeat<Op>
+    {
+    };
 
-    template<typename Node>
-    struct is_pure<proto::unary_op<Node, proto::unary_minus_tag> >
-      : is_pure<Node>
-    {};
+    template<typename Op, uint_t Min, uint_t Max>
+    struct is_pure<proto::unary_op<Op, generic_quant_tag<Min, Max> > >
+      : use_simple_repeat<Op>
+    {
+    };
 
+    template<typename Op>
+    struct is_pure<proto::unary_op<Op, proto::unary_minus_tag> >
+      : is_pure<Op>
+    {
+    };
+
+    template<typename Alternates>
+    struct is_pure<alternates_list<Alternates> >
+      : mpl::fold
+        <
+            mpl::transform_view<Alternates, is_pure<mpl::_1> >
+          , mpl::true_
+          , mpl::and_<mpl::_1, mpl::_2>
+        >::type
+    {
+    };
+
+
     ///////////////////////////////////////////////////////////////////////////////
     // use_simple_repeat
-    //  TODO this doesn't optimize +(_ >> "hello")
-    template<typename Node>
+    // BUGBUG this doesn't handle +(_ >> s1) correctly, right?
+    template<typename Xpr>
     struct use_simple_repeat
-      : mpl::bool_<width_of<Node>::value != unknown_width::value && is_pure<Node>::value>
+      : mpl::and_<mpl::not_equal_to<width_of<Xpr>, unknown_width>, is_pure<Xpr> >
     {
-        // should never try to repeat something of 0-width
-        BOOST_MPL_ASSERT_RELATION(0, !=, width_of<Node>::value);
+        // should never try to quantify something of 0-width
+        BOOST_MPL_ASSERT((mpl::not_equal_to<width_of<Xpr>, mpl::size_t<0> >));
     };
 
-    template<bool B, quant_enum Q> struct use_simple_repeat_helper : mpl::false_ {};
-    template<> struct use_simple_repeat_helper<true, quant_fixed_width> : mpl::true_ {};
-
     template<typename Matcher>
     struct use_simple_repeat<proto::unary_op<Matcher, proto::noop_tag> >
-      : use_simple_repeat_helper<as_matcher<Matcher>::type::pure, as_matcher<Matcher>::type::quant>
+      : mpl::and_
+        <
+            mpl::equal_to
+            <
+                quant_type<typename as_matcher_type<Matcher>::type>
+              , mpl::int_<quant_fixed_width>
+            >
+          , typename as_matcher_type<Matcher>::type::pure
+        >
     {
-        BOOST_MPL_ASSERT_RELATION(0, !=, as_matcher<Matcher>::type::width);
+        BOOST_MPL_ASSERT_RELATION(0, !=, as_matcher_type<Matcher>::type::width::value);
     };
 
-    template<typename Node>
-    struct use_simple_repeat<Node &>
-      : use_simple_repeat<Node>
-    {};
+    template<typename Op, typename Arg>
+    struct is_pure<proto::op_proxy<Op, Arg> >
+      : is_pure<Op>
+    {
+    };
 
-    template<typename Node>
-    struct use_simple_repeat<Node const>
-      : use_simple_repeat<Node>
-    {};
-
-    template<typename Node, typename Arg>
-    struct is_pure<proto::op_proxy<Node, Arg> >
-      : is_pure<Node>
-    {};
-
 }}} // namespace boost::xpressive::detail
 
 #endif

Modified: boost/trunk/boost/xpressive/detail/static/placeholders.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/placeholders.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/placeholders.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -56,7 +56,7 @@
 // mark_placeholder
 //
 struct mark_placeholder
-  : quant_style_variable_width
+  : quant_style_fixed_unknown_width
 {
     int mark_number_;
 
@@ -71,7 +71,7 @@
 //
 template<typename BidiIter, bool ByRef>
 struct regex_placeholder
-  : quant_style<quant_variable_width, unknown_width::value, false>
+  : quant_style<quant_variable_width, unknown_width, mpl::false_>
 {
     shared_ptr<regex_impl<BidiIter> > impl_;
 
@@ -153,7 +153,7 @@
 // self_placeholder
 //
 struct self_placeholder
-  : quant_style<quant_variable_width, unknown_width::value, false>
+  : quant_style<quant_variable_width, unknown_width, mpl::false_>
 {
 };
 

Modified: boost/trunk/boost/xpressive/detail/static/productions/alt_compilers.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/productions/alt_compilers.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/productions/alt_compilers.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,58 +21,28 @@
 {
 
     ///////////////////////////////////////////////////////////////////////////////
-    // alternates_list
-    //   a fusion-compatible sequence of alternate expressions, that also keeps
-    //   track of the list's width and purity.
-    template<typename Head, typename Tail>
-    struct alternates_list
-      : fusion::cons<Head, Tail>
-    {
-        BOOST_STATIC_CONSTANT(std::size_t, width = Head::width == Tail::width ? Head::width : unknown_width::value);
-        BOOST_STATIC_CONSTANT(bool, pure = Head::pure && Tail::pure);
-
-        alternates_list(Head const &head, Tail const &tail)
-          : fusion::cons<Head, Tail>(head, tail)
-        {
-        }
-    };
-
-    template<typename Head>
-    struct alternates_list<Head, fusion::nil>
-      : fusion::cons<Head, fusion::nil>
-    {
-        BOOST_STATIC_CONSTANT(std::size_t, width = Head::width);
-        BOOST_STATIC_CONSTANT(bool, pure = Head::pure);
-
-        alternates_list(Head const &head, fusion::nil const &tail)
-          : fusion::cons<Head, fusion::nil>(head, tail)
-        {
-        }
-    };
-
-    ///////////////////////////////////////////////////////////////////////////////
     // alt_branch
     //   Describes how to construct an alternate xpression
     struct alt_branch
     {
-        typedef fusion::nil state_type;
+        typedef boost::fusion::nil state_type;
 
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         struct apply
         {
             typedef static_xpression
             <
-                alternate_matcher<Node, typename Visitor::traits_type>
+                alternate_matcher<alternates_list<Op>, typename Visitor::traits_type>
               , State
             > type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &state, Visitor &)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &)
         {
-            typedef typename Visitor::traits_type traits_type;
-            return make_static(alternate_matcher<Node, traits_type>(node), state);
+            typedef alternate_matcher<alternates_list<Op>, typename Visitor::traits_type> alt_matcher;
+            return make_static_xpression(alt_matcher(op), state);
         }
     };
 
@@ -82,17 +52,17 @@
     {
         typedef alternate_end_xpression state_type;
 
-        template<typename Node, typename State, typename>
+        template<typename Op, typename State, typename>
         struct apply
         {
-            typedef alternates_list<Node, State> type;
+            typedef boost::fusion::cons<Op, State> type;
         };
 
-        template<typename Node, typename State>
-        static alternates_list<Node, State>
-        call(Node const &node, State const &state, dont_care)
+        template<typename Op, typename State>
+        static boost::fusion::cons<Op, State>
+        call(Op const &op, State const &state, dont_care)
         {
-            return alternates_list<Node, State>(node, state);
+            return boost::fusion::make_cons(op, state);
         }
     };
 
@@ -117,7 +87,7 @@
     // production for alternates in alternate
     template<>
     struct compiler<bitor_tag, xpressive::detail::alt_tag, void>
-      : reverse_fold_compiler<xpressive::detail::alt_tag>
+      : fold_compiler<bitor_tag, xpressive::detail::alt_tag>
     {
     };
 

Modified: boost/trunk/boost/xpressive/detail/static/productions/charset_transforms.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/productions/charset_transforms.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/productions/charset_transforms.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -118,14 +118,14 @@
             typedef proto::unary_op<matcher_type, proto::noop_tag> type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &, Visitor &visitor, bool complement = false)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &, Visitor &visitor, bool complement = false)
         {
-            typedef typename apply<Node, State, Visitor>::matcher_type matcher_type;
+            typedef typename apply<Op, State, Visitor>::matcher_type matcher_type;
             matcher_type matcher;
             // Walks the tree and fills in the charset
-            proto::compile(proto::right(node), make_charset_state(matcher, visitor.traits()), visitor, set_tag());
+            proto::compile(proto::right(op), make_charset_state(matcher, visitor.traits()), visitor, set_tag());
             if(complement)
             {
                 matcher.charset_.inverse();

Modified: boost/trunk/boost/xpressive/detail/static/productions/complement_compiler.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/productions/complement_compiler.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/productions/complement_compiler.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,13 +24,13 @@
     ///////////////////////////////////////////////////////////////////////////////
     // complement
     //   the result of applying operator~ to various expressions
-    template<typename Node, typename Visitor>
+    template<typename Op, typename Visitor>
     struct complement
     {
         // If your compile breaks here, then you are applying the complement operator ~
         // to something that does not support it. For instance, ~(_ >> 'a') will trigger this
         // assertion because the sub-expression (_ >> 'a') has no complement.
-        BOOST_MPL_ASSERT((never_true<Node>));
+        BOOST_MPL_ASSERT((never_true<Op>));
     };
 
     ///////////////////////////////////////////////////////////////////////////////
@@ -40,9 +40,9 @@
     {
         typedef proto::unary_op<literal_placeholder<Char, !Not>, proto::noop_tag> type;
 
-        static type const call(proto::unary_op<literal_placeholder<Char, Not>, proto::noop_tag> const &node, Visitor &)
+        static type const call(proto::unary_op<literal_placeholder<Char, Not>, proto::noop_tag> const &op, Visitor &)
         {
-            literal_placeholder<Char, !Not> literal = proto::arg(node).ch_;
+            literal_placeholder<Char, !Not> literal = proto::arg(op).ch_;
             return proto::noop(literal);
         }
     };
@@ -54,9 +54,9 @@
     {
         typedef proto::unary_op<literal_placeholder<Char, true>, proto::noop_tag> type;
 
-        static type const call(proto::unary_op<Char, proto::noop_tag> const &node, Visitor &)
+        static type const call(proto::unary_op<Char, proto::noop_tag> const &op, Visitor &)
         {
-            literal_placeholder<Char, true> literal = proto::arg(node);
+            literal_placeholder<Char, true> literal = proto::arg(op);
             return proto::noop(literal);
         }
     };
@@ -68,9 +68,9 @@
     {
         typedef proto::unary_op<set_matcher<Traits, Size>, proto::noop_tag> type;
 
-        static type const call(proto::unary_op<set_matcher<Traits, Size>, proto::noop_tag> const &node, Visitor &)
+        static type const call(proto::unary_op<set_matcher<Traits, Size>, proto::noop_tag> const &op, Visitor &)
         {
-            set_matcher<Traits, Size> set = proto::arg(node);
+            set_matcher<Traits, Size> set = proto::arg(op);
             set.complement();
             return proto::noop(set);
         }
@@ -83,9 +83,9 @@
     {
         typedef proto::unary_op<posix_charset_placeholder, proto::noop_tag> type;
 
-        static type const call(proto::unary_op<posix_charset_placeholder, proto::noop_tag> const &node, Visitor &)
+        static type const call(proto::unary_op<posix_charset_placeholder, proto::noop_tag> const &op, Visitor &)
         {
-            posix_charset_placeholder posix = proto::arg(node);
+            posix_charset_placeholder posix = proto::arg(op);
             posix.not_ = !posix.not_;
             return proto::noop(posix);
         }
@@ -93,19 +93,19 @@
 
     ///////////////////////////////////////////////////////////////////////////////
     //
-    template<typename Node, typename Visitor>
-    struct complement<proto::binary_op<set_initializer_type const, Node, proto::subscript_tag>, Visitor>
+    template<typename Op, typename Visitor>
+    struct complement<proto::binary_op<set_initializer_type, Op, proto::subscript_tag>, Visitor>
     {
         typedef typename charset_transform::BOOST_NESTED_TEMPLATE apply
         <
-            proto::binary_op<set_initializer_type const, Node, proto::subscript_tag>
+            proto::binary_op<set_initializer_type, Op, proto::subscript_tag>
           , dont_care
           , Visitor
         >::type type;
 
-        static type call(proto::binary_op<set_initializer_type const, Node, proto::subscript_tag> const &node, Visitor &visitor)
+        static type call(proto::binary_op<set_initializer_type, Op, proto::subscript_tag> const &op, Visitor &visitor)
         {
-            return charset_transform::call(node, dont_care(), visitor, true);
+            return charset_transform::call(op, dont_care(), visitor, true);
         }
     };
 
@@ -124,9 +124,9 @@
 
         typedef proto::unary_op<set_matcher, proto::noop_tag> type;
 
-        static type const call(proto::binary_op<Left, Right, proto::comma_tag> const &node, Visitor &visitor)
+        static type const call(proto::binary_op<Left, Right, proto::comma_tag> const &op, Visitor &visitor)
         {
-            set_matcher set(proto::compile(node, dont_care(), visitor, lst_tag()));
+            set_matcher set(proto::compile(op, dont_care(), visitor, lst_tag()));
             set.complement();
             return proto::noop(set);
         }
@@ -134,27 +134,27 @@
 
     ///////////////////////////////////////////////////////////////////////////////
     //
-    template<typename Node, typename Visitor>
-    struct complement<proto::unary_op<Node, lookahead_tag<true> >, Visitor>
+    template<typename Op, typename Visitor>
+    struct complement<proto::unary_op<Op, lookahead_tag<true> >, Visitor>
     {
-        typedef proto::unary_op<Node, lookahead_tag<false> > type;
+        typedef proto::unary_op<Op, lookahead_tag<false> > type;
 
-        static type call(proto::unary_op<Node, lookahead_tag<true> > const &node, Visitor &)
+        static type call(proto::unary_op<Op, lookahead_tag<true> > const &op, Visitor &)
         {
-            return proto::make_op<lookahead_tag<false> >(proto::arg(node));
+            return proto::make_op<lookahead_tag<false> >(proto::arg(op));
         }
     };
 
     ///////////////////////////////////////////////////////////////////////////////
     //
-    template<typename Node, typename Visitor>
-    struct complement<proto::unary_op<Node, lookbehind_tag<true> >, Visitor>
+    template<typename Op, typename Visitor>
+    struct complement<proto::unary_op<Op, lookbehind_tag<true> >, Visitor>
     {
-        typedef proto::unary_op<Node, lookbehind_tag<false> > type;
+        typedef proto::unary_op<Op, lookbehind_tag<false> > type;
 
-        static type call(proto::unary_op<Node, lookbehind_tag<true> > const &node, Visitor &)
+        static type call(proto::unary_op<Op, lookbehind_tag<true> > const &op, Visitor &)
         {
-            return proto::make_op<lookbehind_tag<false> >(proto::arg(node));
+            return proto::make_op<lookbehind_tag<false> >(proto::arg(op));
         }
     };
 
@@ -183,22 +183,22 @@
           , proto::right_shift_tag
         > type;
 
-        static type call(logical_newline_xpression const &node, Visitor &)
+        static type call(logical_newline_xpression const &op, Visitor &)
         {
-            return proto::make_op<lookahead_tag<false> >(node) >> proto::noop(any_matcher());
+            return proto::make_op<lookahead_tag<false> >(op) >> proto::noop(any_matcher());
         }
     };
 
     ///////////////////////////////////////////////////////////////////////////////
-    // complementing a complement is a no-node
+    // complementing a complement is a no-op
     template<typename Arg, typename Visitor>
     struct complement<proto::unary_op<Arg, proto::complement_tag>, Visitor>
     {
         typedef Arg type;
 
-        static Arg const &call(proto::unary_op<Arg, proto::complement_tag> const &node, Visitor &)
+        static Arg const &call(proto::unary_op<Arg, proto::complement_tag> const &op, Visitor &)
         {
-            return proto::arg(node);
+            return proto::arg(op);
         }
     };
 
@@ -209,39 +209,29 @@
     {
         typedef proto::unary_op<range_placeholder<Char>, proto::noop_tag> type;
 
-        static type const call(proto::unary_op<range_placeholder<Char>, proto::noop_tag> const &node, Visitor &)
+        static type const call(proto::unary_op<range_placeholder<Char>, proto::noop_tag> const &op, Visitor &)
         {
-            range_placeholder<Char> rng = proto::arg(node);
+            range_placeholder<Char> rng = proto::arg(op);
             rng.not_ = !rng.not_;
             return proto::noop(rng);
         }
     };
 
-    template<typename Node, typename Visitor>
-    struct complement<Node &, Visitor>
-      : complement<Node, Visitor>
-    {};
-
-    template<typename Node, typename Visitor>
-    struct complement<Node const, Visitor>
-      : complement<Node, Visitor>
-    {};
-
     ///////////////////////////////////////////////////////////////////////////////
     // complement_transform
     struct complement_transform
     {
-        template<typename Node, typename, typename Visitor>
+        template<typename Op, typename, typename Visitor>
         struct apply
         {
-            typedef typename complement<typename proto::arg_type<Node>::type, Visitor>::type type;
+            typedef typename complement<typename proto::arg_type<Op>::type, Visitor>::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename complement<typename proto::arg_type<Node>::type, Visitor>::type
-        call(Node const &node, State const &, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename complement<typename proto::arg_type<Op>::type, Visitor>::type
+        call(Op const &op, State const &, Visitor &visitor)
         {
-            return complement<typename proto::arg_type<Node>::type, Visitor>::call(proto::arg(node), visitor);
+            return complement<typename proto::arg_type<Op>::type, Visitor>::call(proto::arg(op), visitor);
         }
     };
 

Modified: boost/trunk/boost/xpressive/detail/static/productions/independent_compiler.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/productions/independent_compiler.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/productions/independent_compiler.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -31,17 +31,17 @@
     {
         typedef true_xpression state_type;
 
-        template<typename Node, typename State, typename>
+        template<typename Op, typename State, typename>
         struct apply
         {
-            typedef static_xpression<lookahead_matcher<Node>, State> type;
+            typedef static_xpression<lookahead_matcher<Op>, State> type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static static_xpression<lookahead_matcher<Node>, State>
-        call(Node const &node, State const &state, Visitor &)
+        template<typename Op, typename State, typename Visitor>
+        static static_xpression<lookahead_matcher<Op>, State>
+        call(Op const &op, State const &state, Visitor &)
         {
-            return make_static(lookahead_matcher<Node>(node, !Positive), state);
+            return make_static_xpression(lookahead_matcher<Op>(op, !Positive), state);
         }
     };
 
@@ -52,36 +52,37 @@
     {
         typedef true_xpression state_type;
 
-        template<typename Node, typename State, typename>
+        template<typename Op, typename State, typename>
         struct apply
         {
-            typedef static_xpression<lookbehind_matcher<Node>, State> type;
+            typedef static_xpression<lookbehind_matcher<Op>, State> type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static static_xpression<lookbehind_matcher<Node>, State>
-        call(Node const &node, State const &state, Visitor &)
+        template<typename Op, typename State, typename Visitor>
+        static static_xpression<lookbehind_matcher<Op>, State>
+        call(Op const &op, State const &state, Visitor &)
         {
-            std::size_t width = node.get_width().value();
-            return make_static(lookbehind_matcher<Node>(node, width, !Positive), state);
+            return make_static_xpression(lookbehind_matcher<Op>(op, !Positive), state);
         }
     };
 
+    ///////////////////////////////////////////////////////////////////////////////
+    // keeper_branch
     struct keeper_branch
     {
         typedef true_xpression state_type;
 
-        template<typename Node, typename State, typename>
+        template<typename Op, typename State, typename>
         struct apply
         {
-            typedef static_xpression<keeper_matcher<Node>, State> type;
+            typedef static_xpression<keeper_matcher<Op>, State> type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static static_xpression<keeper_matcher<Node>, State>
-        call(Node const &node, State const &state, Visitor &)
+        template<typename Op, typename State, typename Visitor>
+        static static_xpression<keeper_matcher<Op>, State>
+        call(Op const &op, State const &state, Visitor &)
         {
-            return make_static(keeper_matcher<Node>(node), state);
+            return make_static_xpression(keeper_matcher<Op>(op), state);
         }
     };
 
@@ -90,25 +91,38 @@
 
 namespace boost { namespace proto
 {
+    // ericne, 28/nov/05: CW9_4 doesn't like partial specializations of the form:
+    //   template<bool F> struct foo<bar<F> >
+    template<>
+    struct compiler<xpressive::detail::lookahead_tag<true>, xpressive::detail::seq_tag, void>
+      : branch_compiler<xpressive::detail::lookahead_branch<true>, xpressive::detail::ind_tag>
+    {
+    };
 
-    template<bool Positive>
-    struct compiler<xpressive::detail::lookahead_tag<Positive>, xpressive::detail::seq_tag, void>
-      : branch_compiler<xpressive::detail::lookahead_branch<Positive>, xpressive::detail::ind_tag>
+    template<>
+    struct compiler<xpressive::detail::lookahead_tag<false>, xpressive::detail::seq_tag, void>
+      : branch_compiler<xpressive::detail::lookahead_branch<false>, xpressive::detail::ind_tag>
     {
     };
 
-    template<bool Positive>
-    struct compiler<xpressive::detail::lookbehind_tag<Positive>, xpressive::detail::seq_tag, void>
-      : branch_compiler<xpressive::detail::lookbehind_branch<Positive>, xpressive::detail::ind_tag>
+    template<>
+    struct compiler<xpressive::detail::lookbehind_tag<true>, xpressive::detail::seq_tag, void>
+      : branch_compiler<xpressive::detail::lookbehind_branch<true>, xpressive::detail::ind_tag>
     {
     };
 
     template<>
+    struct compiler<xpressive::detail::lookbehind_tag<false>, xpressive::detail::seq_tag, void>
+      : branch_compiler<xpressive::detail::lookbehind_branch<false>, xpressive::detail::ind_tag>
+    {
+    };
+
+    template<>
     struct compiler<xpressive::detail::keeper_tag, xpressive::detail::seq_tag, void>
       : branch_compiler<xpressive::detail::keeper_branch, xpressive::detail::ind_tag>
     {
     };
-
+    
     template<typename OpTag>
     struct compiler<OpTag, xpressive::detail::ind_tag, void>
       : transform_compiler<arg_transform, xpressive::detail::seq_tag>

Modified: boost/trunk/boost/xpressive/detail/static/productions/marker_compiler.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/productions/marker_compiler.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/productions/marker_compiler.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -28,7 +28,7 @@
       : proto::conditional_compiler
         <
             is_marker_predicate
-          , proto::transform_compiler<marker_replace_transform, seq_tag>
+          , proto::transform_compiler<marker_assign_transform, seq_tag>
           , proto::branch_compiler<list_branch, lst_tag>
         >
     {

Modified: boost/trunk/boost/xpressive/detail/static/productions/marker_transform.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/productions/marker_transform.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/productions/marker_transform.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,49 +17,34 @@
 {
     ///////////////////////////////////////////////////////////////////////////////
     // is_marker
-    template<typename Node>
+    template<typename Op>
     struct is_marker
       : mpl::false_
     {};
 
     // (s1= ...) is a marker
-    template<typename Node>
-    struct is_marker<proto::binary_op<mark_tag const, Node, proto::assign_tag> >
+    template<typename Op>
+    struct is_marker<proto::binary_op<mark_tag, Op, proto::assign_tag> >
       : mpl::true_
     {};
 
-    template<typename Node>
-    struct is_marker<proto::binary_op<mark_tag const &, Node, proto::assign_tag> >
-      : mpl::true_
-    {};
-
-    template<typename Node>
-    struct is_marker<Node &>
-      : is_marker<Node>
-    {};
-
-    template<typename Node>
-    struct is_marker<Node const>
-      : is_marker<Node>
-    {};
-
     ///////////////////////////////////////////////////////////////////////////////
     // is_marker_predicate
     struct is_marker_predicate
     {
-        template<typename Node, typename, typename>
+        template<typename Op, typename, typename>
         struct apply
-          : is_marker<Node>
+          : is_marker<Op>
         {
         };
     };
 
     ///////////////////////////////////////////////////////////////////////////////
-    // marker_insert_transform
+    // marker_transform
     //   Insert mark tags before and after the expression
-    struct marker_insert_transform
+    struct marker_transform
     {
-        template<typename Node, typename, typename>
+        template<typename Op, typename, typename>
         struct apply
         {
             typedef proto::binary_op
@@ -67,7 +52,7 @@
                 proto::unary_op<mark_begin_matcher, proto::noop_tag>
               , proto::binary_op
                 <
-                    Node
+                    Op
                   , proto::unary_op<mark_end_matcher, proto::noop_tag>
                   , proto::right_shift_tag
                 >
@@ -75,9 +60,9 @@
             > type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &, Visitor &visitor, int mark_nbr = 0)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &, Visitor &visitor, int mark_nbr = 0)
         {
             // if we're inserting a mark, and we're not being told the mark number,
             // we're inserting a hidden mark ... so grab the next hidden mark number.
@@ -87,26 +72,20 @@
             }
 
             return proto::noop(mark_begin_matcher(mark_nbr))
-                >> (node >> proto::noop(mark_end_matcher(mark_nbr)));
+                >> (op >> proto::noop(mark_end_matcher(mark_nbr)));
         }
     };
 
     ///////////////////////////////////////////////////////////////////////////////
-    // marker_replace_transform
-    struct marker_replace_transform
-      : proto::compose_transforms<proto::right_transform, marker_insert_transform>
+    // marker_assign_transform
+    struct marker_assign_transform
+      : proto::compose_transforms<proto::right_transform, marker_transform>
     {
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &state, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &visitor)
         {
-            return marker_insert_transform::call
-            (
-                proto::right(node)
-              , state
-              , visitor
-              , proto::arg(proto::left(node)).mark_number_
-            );
+            return marker_transform::call(proto::right(op), state, visitor, proto::arg(proto::left(op)).mark_number_);
         }
     };
 

Modified: boost/trunk/boost/xpressive/detail/static/productions/modify_compiler.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/productions/modify_compiler.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/productions/modify_compiler.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,12 +36,12 @@
     // modify_compiler
     struct modify_compiler
     {
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         struct apply
         {
-            typedef typename proto::left_type<Node>::type modifier_type;
+            typedef typename proto::left_type<Op>::type modifier_type;
             typedef typename modifier_type::BOOST_NESTED_TEMPLATE apply<Visitor>::type visitor_type;
-            typedef typename proto::right_type<Node>::type op_type;
+            typedef typename proto::right_type<Op>::type op_type;
 
             typedef typename proto::compiler<typename proto::tag_type<op_type>::type, seq_tag>::
                 BOOST_NESTED_TEMPLATE apply
@@ -52,16 +52,16 @@
             >::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &state, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &visitor)
         {
-            typedef typename apply<Node, State, Visitor>::visitor_type new_visitor_type;
-            new_visitor_type new_visitor(proto::left(node).call(visitor));
+            typedef typename apply<Op, State, Visitor>::visitor_type new_visitor_type;
+            new_visitor_type new_visitor(proto::left(op).call(visitor));
             new_visitor.swap(visitor);
             scoped_swap<Visitor, new_visitor_type> const undo = {&visitor, &new_visitor};
             detail::ignore_unused(&undo);
-            return proto::compile(proto::right(node), state, new_visitor, seq_tag());
+            return proto::compile(proto::right(op), state, new_visitor, seq_tag());
         }
     };
 

Modified: boost/trunk/boost/xpressive/detail/static/productions/noop_compiler.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/productions/noop_compiler.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/productions/noop_compiler.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,20 +21,20 @@
     {
         ///////////////////////////////////////////////////////////////////////////////
         // transformation that happens to leaf nodes in the parse tree
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         struct apply
         {
-            typedef typename as_matcher<typename proto::arg_type<Node>::type>::type matcher1;
+            typedef typename as_matcher_type<typename proto::arg_type<Op>::type>::type matcher1;
             typedef typename Visitor::BOOST_NESTED_TEMPLATE apply<matcher1>::type matcher2;
             typedef static_xpression<matcher2, State> type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &state, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &visitor)
         {
-            typedef typename proto::arg_type<Node>::type arg_type;
-            return make_static(visitor.call(as_matcher<arg_type>::call(proto::arg(node))), state);
+            typedef typename proto::arg_type<Op>::type arg_type;
+            return make_static_xpression(visitor.call(as_matcher_type<arg_type>::call(proto::arg(op))), state);
         }
     };
 

Modified: boost/trunk/boost/xpressive/detail/static/productions/productions.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/productions/productions.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/productions/productions.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -35,10 +35,10 @@
     //
     struct is_set_initializer_predicate
     {
-        template<typename Node, typename, typename>
+        template<typename Op, typename, typename>
         struct apply
         {
-            typedef typename is_same<typename proto::left_type<Node>::type, set_initializer_type const>::type type;
+            typedef typename is_same<typename proto::left_type<Op>::type, set_initializer_type>::type type;
         };
     };
 
@@ -46,22 +46,22 @@
     //
     struct action_transform
     {
-        template<typename Node, typename, typename>
+        template<typename Op, typename, typename>
         struct apply
         {
             typedef proto::binary_op
             <
-                typename proto::left_type<Node>::type
-              , typename proto::right_type<Node>::type
+                typename proto::left_type<Op>::type
+              , typename proto::right_type<Op>::type
               , proto::right_shift_tag
             > type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &, Visitor &)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &, Visitor &)
         {
-            return proto::left(node) >> proto::right(node);
+            return proto::left(op) >> proto::right(op);
         }
     };
 
@@ -84,10 +84,17 @@
 // misc regex compiler productions
 namespace boost { namespace proto
 {
+    template<typename BidiIter>
+    struct value_type<xpressive::basic_regex<BidiIter> >
+    {
+        // store regex objects in the parse tree by reference
+        typedef reference_wrapper<xpressive::basic_regex<BidiIter> const> type;
+    };
+
     // production for sequences in sequence
     template<>
     struct compiler<right_shift_tag, xpressive::detail::seq_tag, void>
-      : reverse_fold_compiler<xpressive::detail::seq_tag>
+      : fold_compiler<right_shift_tag, xpressive::detail::seq_tag>
     {
     };
 

Modified: boost/trunk/boost/xpressive/detail/static/productions/quant_compilers.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/productions/quant_compilers.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/productions/quant_compilers.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,9 +24,9 @@
     typedef proto::unary_op<epsilon_matcher, proto::noop_tag> nil_op;
 
     ///////////////////////////////////////////////////////////////////////////////
-    // repeater_compiler
+    // generic_quant_compiler
     template<bool Greedy, uint_t Min, uint_t Max>
-    struct repeater_compiler
+    struct generic_quant_compiler
       : proto::conditional_compiler
         <
             use_simple_repeat_predicate
@@ -36,7 +36,7 @@
                 proto::compose_transforms
                 <
                     proto::arg_transform
-                  , repeater_transform<Greedy, Min, Max>
+                  , repeater_if_transform<Greedy, Min, Max>
                 >
               , seq_tag
             >
@@ -46,44 +46,32 @@
 
     // degenerate case, foo{0,0} becomes nil
     template<bool Greedy>
-    struct repeater_compiler<Greedy, 0, 0>
+    struct generic_quant_compiler<Greedy, 0, 0>
       : proto::transform_compiler<proto::always_transform<nil_op>, seq_tag>
     {
     };
 
     // degenerate case, foo{1,1} becomes foo
     template<bool Greedy>
-    struct repeater_compiler<Greedy, 1, 1>
+    struct generic_quant_compiler<Greedy, 1, 1>
       : proto::transform_compiler<proto::identity_transform, seq_tag>
     {
     };
 
-    // foo{0,1} or !foo uses the optional transforms
-    template<bool Greedy>
-    struct repeater_compiler<Greedy, 0, 1>
-      : proto::conditional_compiler
-        <
-            is_marker_or_repeater_predicate
-          , proto::branch_compiler<optional_mark_branch<Greedy>, ind_tag>
-          , proto::branch_compiler<optional_branch<Greedy>, ind_tag>
-        >
-    {
-    };
-
     ///////////////////////////////////////////////////////////////////////////////
-    // min_repeater_compiler
-    struct min_repeater_compiler
+    // non_greedy_compiler
+    struct non_greedy_compiler
     {
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         struct apply
         {
-            typedef typename proto::arg_type<Node>::type arg_type;
+            typedef typename proto::arg_type<Op>::type arg_type;
 
             // Did you apply operator- to something that wasn't a quantifier?
             BOOST_MPL_ASSERT((is_greedy_quant<arg_type>));
 
             typedef typename proto::tag_type<arg_type>::type tag_type;
-            typedef repeater_compiler
+            typedef generic_quant_compiler
             <
                 false
               , min_type<tag_type>::type::value
@@ -98,12 +86,12 @@
             >::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &state, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &visitor)
         {
-            typedef typename apply<Node, State, Visitor>::compiler_type compiler_type;
-            return compiler_type::call(proto::arg(node), state, visitor);
+            typedef typename apply<Op, State, Visitor>::compiler_type compiler_type;
+            return compiler_type::call(proto::arg(op), state, visitor);
         }
     };
 
@@ -116,35 +104,35 @@
     // production for one or more quant
     template<>
     struct compiler<unary_plus_tag, xpressive::detail::seq_tag, void>
-      : xpressive::detail::repeater_compiler<true, 1, UINT_MAX-1>
+      : xpressive::detail::generic_quant_compiler<true, 1, UINT_MAX-1>
     {
     };
 
     // production for zero or more quant
     template<>
     struct compiler<unary_star_tag, xpressive::detail::seq_tag, void>
-      : xpressive::detail::repeater_compiler<true, 0, UINT_MAX-1>
+      : xpressive::detail::generic_quant_compiler<true, 0, UINT_MAX-1>
     {
     };
 
     // production for optional
     template<>
     struct compiler<logical_not_tag, xpressive::detail::seq_tag, void>
-      : xpressive::detail::repeater_compiler<true, 0, 1>
+      : xpressive::detail::generic_quant_compiler<true, 0, 1>
     {
     };
 
     // production for generic quantifiers
     template<unsigned int Min, unsigned int Max>
     struct compiler<xpressive::detail::generic_quant_tag<Min, Max>, xpressive::detail::seq_tag, void>
-      : xpressive::detail::repeater_compiler<true, Min, Max>
+      : xpressive::detail::generic_quant_compiler<true, Min, Max>
     {
     };
 
     // production for non-greedy quantifiers
     template<>
     struct compiler<unary_minus_tag, xpressive::detail::seq_tag, void>
-      : xpressive::detail::min_repeater_compiler
+      : xpressive::detail::non_greedy_compiler
     {
     };
 

Modified: boost/trunk/boost/xpressive/detail/static/productions/quant_traits.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/productions/quant_traits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/productions/quant_traits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -61,10 +61,11 @@
 
     struct use_simple_repeat_predicate
     {
-        template<typename Node, typename, typename>
+        template<typename Op, typename, typename>
         struct apply
-          : use_simple_repeat<typename proto::arg_type<Node>::type>
-        {};
+          : use_simple_repeat<typename proto::arg_type<Op>::type>
+        {
+        };
     };
 
     ///////////////////////////////////////////////////////////////////////////////
@@ -72,33 +73,26 @@
     template<typename Xpr>
     struct is_greedy_quant
       : mpl::false_
-    {};
+    {
+    };
 
-    template<typename Node, typename Tag>
-    struct is_greedy_quant<proto::unary_op<Node, Tag> >
+    template<typename Op, typename Tag>
+    struct is_greedy_quant<proto::unary_op<Op, Tag> >
       : mpl::or_
         <
             is_same<Tag, proto::unary_plus_tag>
           , is_same<Tag, proto::unary_star_tag>
           , is_same<Tag, proto::logical_not_tag>
         >
-    {};
+    {
+    };
 
-    template<typename Node, uint_t Min, uint_t Max>
-    struct is_greedy_quant<proto::unary_op<Node, generic_quant_tag<Min, Max> > >
+    template<typename Op, uint_t Min, uint_t Max>
+    struct is_greedy_quant<proto::unary_op<Op, generic_quant_tag<Min, Max> > >
       : mpl::true_
-    {};
+    {
+    };
 
-    template<typename Xpr>
-    struct is_greedy_quant<Xpr &>
-      : is_greedy_quant<Xpr>
-    {};
-
-    template<typename Xpr>
-    struct is_greedy_quant<Xpr const>
-      : is_greedy_quant<Xpr>
-    {};
-
 }}}
 
 #ifdef BOOST_MSVC

Modified: boost/trunk/boost/xpressive/detail/static/productions/quant_transforms.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/productions/quant_transforms.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/productions/quant_transforms.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,7 +8,6 @@
 #ifndef BOOST_XPRESSIVE_DETAIL_STATIC_PRODUCTIONS_QUANT_TRANSFORMS_HPP_EAN_10_04_2005
 #define BOOST_XPRESSIVE_DETAIL_STATIC_PRODUCTIONS_QUANT_TRANSFORMS_HPP_EAN_10_04_2005
 
-#include <boost/mpl/or.hpp>
 #include <boost/mpl/size_t.hpp>
 #include <boost/mpl/assert.hpp>
 #include <boost/mpl/not_equal_to.hpp>
@@ -20,102 +19,34 @@
 
 namespace boost { namespace xpressive { namespace detail
 {
-    typedef proto::unary_op<repeat_begin_matcher, proto::noop_tag> repeat_tag;
 
     ///////////////////////////////////////////////////////////////////////////////
-    // is_repeater
-    template<typename Node>
-    struct is_repeater
-      : mpl::false_
-    {};
-
-    template<typename Node>
-    struct is_repeater<proto::binary_op<repeat_tag, Node, proto::right_shift_tag> >
-      : mpl::true_
-    {};
-
-    ///////////////////////////////////////////////////////////////////////////////
-    // is_marker_or_repeater_predicate
-    struct is_marker_or_repeater_predicate
-    {
-        template<typename Node, typename, typename>
-        struct apply
-        {
-            typedef typename proto::arg_type<Node>::type op_type;
-            typedef typename mpl::or_<is_marker<op_type>, is_repeater<op_type> >::type type;
-        };
-    };
-
-    ///////////////////////////////////////////////////////////////////////////////
     // simple_repeat_branch
     template<bool Greedy, uint_t Min, uint_t Max>
     struct simple_repeat_branch
     {
         typedef true_xpression state_type;
 
-        template<typename Node, typename State, typename>
+        template<typename Op, typename State, typename>
         struct apply
         {
-            typedef static_xpression<simple_repeat_matcher<Node, Greedy>, State> type;
+            typedef static_xpression<simple_repeat_matcher<Op, Greedy>, State> type;
         };
 
-        template<typename Node, typename State>
-        static static_xpression<simple_repeat_matcher<Node, Greedy>, State>
-        call(Node const &node, State const &state, dont_care)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &)
         {
-            std::size_t width = node.get_width().value();
-            return make_static(simple_repeat_matcher<Node, Greedy>(node, Min, Max, width), state);
+            return make_static_xpression(simple_repeat_matcher<Op, Greedy>(op, Min, Max), state);
         }
     };
 
     ///////////////////////////////////////////////////////////////////////////////
-    // optional_branch
-    template<bool Greedy>
-    struct optional_branch
-    {
-        typedef alternate_end_xpression state_type;
-
-        template<typename Node, typename State, typename>
-        struct apply
-        {
-            typedef static_xpression<optional_matcher<Node, Greedy>, State> type;
-        };
-
-        template<typename Node, typename State>
-        static static_xpression<optional_matcher<Node, Greedy>, State>
-        call(Node const &node, State const &state, dont_care)
-        {
-            return make_static(optional_matcher<Node, Greedy>(node), state);
-        }
-    };
-
-    ///////////////////////////////////////////////////////////////////////////////
-    // optional_mark_branch
-    template<bool Greedy>
-    struct optional_mark_branch
-    {
-        typedef alternate_end_xpression state_type;
-
-        template<typename Node, typename State, typename>
-        struct apply
-        {
-            typedef static_xpression<optional_mark_matcher<Node, Greedy>, State> type;
-        };
-
-        template<typename Node, typename State>
-        static static_xpression<optional_mark_matcher<Node, Greedy>, State>
-        call(Node const &node, State const &state, dont_care)
-        {
-            return make_static(optional_mark_matcher<Node, Greedy>(node, node.mark_number_), state);
-        }
-    };
-
-    ///////////////////////////////////////////////////////////////////////////////
-    // repeater_insert_transform
+    // repeater_transform
     template<bool Greedy, uint_t Min, uint_t Max>
-    struct repeater_insert_transform
+    struct repeater_transform
     {
-        template<typename Node, typename, typename>
+        template<typename Op, typename, typename>
         struct apply
         {
             typedef proto::binary_op
@@ -123,7 +54,7 @@
                 proto::unary_op<repeat_begin_matcher, proto::noop_tag>
               , proto::binary_op
                 <
-                    Node
+                    Op
                   , proto::unary_op<repeat_end_matcher<Greedy>, proto::noop_tag>
                   , proto::right_shift_tag
                 >
@@ -131,66 +62,124 @@
             > type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &, Visitor &)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &, Visitor &)
         {
             // Get the mark_number from the begin_mark_matcher
-            int mark_number = proto::arg(proto::left(node)).mark_number_;
+            int mark_number = proto::arg(proto::left(op)).mark_number_;
             BOOST_ASSERT(0 != mark_number);
 
             return proto::noop(repeat_begin_matcher(mark_number))
-                >> (node >> proto::noop(repeat_end_matcher<Greedy>(mark_number, Min, Max)));
+                >> (op >> proto::noop(repeat_end_matcher<Greedy>(mark_number, Min, Max)));
         }
     };
 
-    template<bool Greedy>
+    template<typename Op>
+    epsilon_mark_matcher make_eps(Op const &op, epsilon_mark_matcher *)
+    {
+        return epsilon_mark_matcher(proto::arg(proto::left(op)).mark_number_);
+    }
+
+    template<typename Op>
+    epsilon_matcher make_eps(Op const &op, epsilon_matcher *)
+    {
+        return epsilon_matcher();
+    }
+
+    ///////////////////////////////////////////////////////////////////////////////
+    // optional_transform
+    //   make alternate with epsilon_mark_matcher
+    template<bool Greedy, typename Epsilon>
     struct optional_transform
     {
-        template<typename Node, typename, typename>
+        template<typename Op, typename, typename>
         struct apply
         {
-            typedef proto::unary_op<Node, proto::logical_not_tag> type;
+            typedef proto::binary_op
+            <
+                Op
+              , proto::unary_op<Epsilon, proto::noop_tag>
+              , proto::bitor_tag
+            > type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &, Visitor &)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &, Visitor &)
         {
-            return !node;
+            return op | proto::noop(make_eps(op, (Epsilon *)0));
         }
     };
 
+    template<typename Epsilon>
+    struct optional_transform<false, Epsilon>
+    {
+        template<typename Op, typename, typename>
+        struct apply
+        {
+            typedef proto::binary_op
+            <
+                proto::unary_op<Epsilon, proto::noop_tag>
+              , Op
+              , proto::bitor_tag
+            > type;
+        };
+
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &, Visitor &)
+        {
+            return proto::noop(make_eps(op, (Epsilon *)0)) | op;
+        }
+    };
+
     ///////////////////////////////////////////////////////////////////////////////
-    // repeater_transform
+    // marker_if_transform
+    //   Insert marker matchers before and after the expression
+    typedef proto::conditional_transform<
+        is_marker_predicate
+      , marker_assign_transform
+      , marker_transform
+    > marker_if_transform;
+
+    ///////////////////////////////////////////////////////////////////////////////
+    // repeater_if_transform
     //   Insert repeat and marker matcher before and after the expression
     template<bool Greedy, uint_t Min, uint_t Max>
-    struct repeater_transform
+    struct repeater_if_transform
       : proto::compose_transforms
         <
-            proto::conditional_transform
-            <
-                is_marker_predicate
-              , marker_replace_transform
-              , marker_insert_transform
-            >
-          , repeater_insert_transform<Greedy, Min, Max>
+            marker_if_transform
+          , repeater_transform<Greedy, Min, Max>
         >
     {
     };
 
-    // transform *foo to !+foo
+    // transform *foo to (+foo | nil)
     template<bool Greedy, uint_t Max>
-    struct repeater_transform<Greedy, 0, Max>
+    struct repeater_if_transform<Greedy, 0, Max>
       : proto::compose_transforms
         <
-            repeater_transform<Greedy, 1, Max>
-          , optional_transform<Greedy>
+            repeater_if_transform<Greedy, 1, Max>
+          , optional_transform<Greedy, epsilon_mark_matcher>
         >
     {
-        BOOST_MPL_ASSERT_RELATION(1, <, Max);
     };
 
+    // transform !(foo) to (foo | nil), with care to make sure
+    // that !(s1= foo) sets s1 to null if foo doesn't match.
+    template<bool Greedy>
+    struct repeater_if_transform<Greedy, 0, 1>
+      : proto::conditional_transform
+        <
+            is_marker_predicate
+          , optional_transform<Greedy, epsilon_mark_matcher>
+          , optional_transform<Greedy, epsilon_matcher>
+        >
+    {
+    };
+
 }}}
 
 #endif

Modified: boost/trunk/boost/xpressive/detail/static/productions/set_compilers.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/productions/set_compilers.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/productions/set_compilers.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,10 +32,10 @@
             typedef State type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static State const &call(Node const &node, State const &state, Visitor &)
+        template<typename Op, typename State, typename Visitor>
+        static State const &call(Op const &op, State const &state, Visitor &)
         {
-            return state.set(set_branch::get_matcher(node)), state;
+            return state.set(set_branch::get_matcher(op)), state;
         }
 
     private:
@@ -53,17 +53,17 @@
     {
         typedef int state_type; // not used
 
-        template<typename Node, typename State, typename>
+        template<typename Op, typename State, typename>
         struct apply
         {
-            typedef static_xpression<Node, State> type;
+            typedef static_xpression<Op, State> type;
         };
 
-        template<typename Node, typename State>
-        static static_xpression<Node, State>
-        call(Node const &node, State const &state, dont_care)
+        template<typename Op, typename State>
+        static static_xpression<Op, State>
+        call(Op const &op, State const &state, dont_care)
         {
-            return make_static(node, state);
+            return make_static_xpression(op, state);
         }
     };
 
@@ -77,12 +77,12 @@
             typedef typename State::next_type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         static typename State::next_type
-        call(Node const &node, State const &state, Visitor &visitor)
+        call(Op const &op, State const &state, Visitor &visitor)
         {
             typedef typename Visitor::char_type char_type;
-            char_type ch = char_cast<char_type>(proto::arg(node), visitor.traits());
+            char_type ch = char_cast<char_type>(proto::arg(op), visitor.traits());
             return state.push_back(ch, visitor.traits());
         }
     };
@@ -91,20 +91,20 @@
     // list_assign_compiler
     struct list_assign_compiler
     {
-        template<typename Node, typename, typename Visitor>
+        template<typename Op, typename, typename Visitor>
         struct apply
         {
             typedef typename Visitor::traits_type traits_type;
             typedef set_matcher<traits_type, 1> type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &, Visitor &visitor)
         {
             typedef typename Visitor::char_type char_type;
-            char_type ch = char_cast<char_type>(proto::arg(proto::right(node)), visitor.traits());
-            return typename apply<Node, State, Visitor>::type(ch, visitor.traits());
+            char_type ch = char_cast<char_type>(proto::arg(proto::right(op)), visitor.traits());
+            return typename apply<Op, State, Visitor>::type(ch, visitor.traits());
         }
     };
 
@@ -117,7 +117,7 @@
     // compilers for sets such as set['a' | range('a','z')]
     template<>
     struct compiler<bitor_tag, xpressive::detail::set_tag, void>
-      : reverse_fold_compiler<xpressive::detail::set_tag>
+      : fold_compiler<bitor_tag, xpressive::detail::set_tag>
     {
     };
 
@@ -150,7 +150,7 @@
 
     template<>
     struct compiler<comma_tag, xpressive::detail::lst_tag, void>
-      : fold_compiler<xpressive::detail::lst_tag>
+      : fold_compiler<comma_tag, xpressive::detail::lst_tag, false>
     {
     };
 

Modified: boost/trunk/boost/xpressive/detail/static/productions/visitor.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/productions/visitor.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/productions/visitor.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -28,26 +28,28 @@
     struct xpression_visitor_base
     {
         explicit xpression_visitor_base(shared_ptr<regex_impl<BidiIter> > const &self)
-          : self_(self)
+          : impl_()
+          , self_(self)
         {
         }
 
-        void swap(xpression_visitor_base<BidiIter> &that)
+        void swap(xpression_visitor_base &that)
         {
+            this->impl_.swap(that.impl_);
             this->self_.swap(that.self_);
         }
 
         int get_hidden_mark()
         {
-            return -(int)(++this->self_->hidden_mark_count_);
+            return -(int)(++this->impl_.hidden_mark_count_);
         }
 
         void mark_number(int mark_number)
         {
             if(0 < mark_number)
             {
-                this->self_->mark_count_ =
-                    (std::max)(this->self_->mark_count_, (std::size_t)mark_number);
+                this->impl_.mark_count_ =
+                    (std::max)(this->impl_.mark_count_, (std::size_t)mark_number);
             }
         }
 
@@ -56,18 +58,24 @@
             return this->self_;
         }
 
+        regex_impl<BidiIter> &impl()
+        {
+            return this->impl_;
+        }
+
     protected:
 
         template<typename Matcher>
         void visit_(Matcher const &)
         {
+            // no-op
         }
 
         template<bool ByRef>
         void visit_(regex_placeholder<BidiIter, ByRef> const &rex)
         {
             // when visiting an embedded regex, track the references
-            this->self_->track_reference(*rex.impl_);
+            this->impl_.track_reference(rex.impl_);
         }
 
         void visit_(mark_placeholder const &backref)
@@ -83,6 +91,8 @@
         }
 
     private:
+
+        regex_impl<BidiIter> impl_;
         shared_ptr<regex_impl<BidiIter> > self_;
     };
 

Modified: boost/trunk/boost/xpressive/detail/static/regex_operators.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/regex_operators.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/regex_operators.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,9 +20,6 @@
 namespace boost { namespace xpressive
 {
 
-// BUGBUG store by reference here!!!
-
-
 ///////////////////////////////////////////////////////////////////////////////
 // operator +
 template<typename BidiIter>
@@ -70,8 +67,8 @@
     proto::is_op<Right>
   , proto::binary_op
     <
-        proto::unary_op<basic_regex<BidiIter> const &, proto::noop_tag>
-      , typename proto::as_op<Right>::reference
+        proto::unary_op<basic_regex<BidiIter>, proto::noop_tag>
+      , proto::unary_op<Right, proto::noop_tag>
       , proto::right_shift_tag
     >
 >::type
@@ -88,8 +85,8 @@
     proto::is_op<Left>
   , proto::binary_op
     <
-        typename proto::as_op<Left>::reference
-      , proto::unary_op<basic_regex<BidiIter> const &, proto::noop_tag>
+        proto::unary_op<Left, proto::noop_tag>
+      , proto::unary_op<basic_regex<BidiIter>, proto::noop_tag>
       , proto::right_shift_tag
     >
 >::type
@@ -103,8 +100,8 @@
 template<typename BidiIter>
 inline proto::binary_op
 <
-    proto::unary_op<basic_regex<BidiIter> const &, proto::noop_tag>
-  , proto::unary_op<basic_regex<BidiIter> const &, proto::noop_tag>
+    proto::unary_op<basic_regex<BidiIter>, proto::noop_tag>
+  , proto::unary_op<basic_regex<BidiIter>, proto::noop_tag>
   , proto::right_shift_tag
 >
 operator >>(basic_regex<BidiIter> const &left, basic_regex<BidiIter> const &right)
@@ -120,8 +117,8 @@
     proto::is_op<Right>
   , proto::binary_op
     <
-        proto::unary_op<basic_regex<BidiIter> const &, proto::noop_tag>
-      , typename proto::as_op<Right>::reference
+        proto::unary_op<basic_regex<BidiIter>, proto::noop_tag>
+      , proto::unary_op<Right, proto::noop_tag>
       , proto::bitor_tag
     >
 >::type
@@ -138,8 +135,8 @@
     proto::is_op<Left>
   , proto::binary_op
     <
-        typename proto::as_op<Left>::reference
-      , proto::unary_op<basic_regex<BidiIter> const &, proto::noop_tag>
+        proto::unary_op<Left, proto::noop_tag>
+      , proto::unary_op<basic_regex<BidiIter>, proto::noop_tag>
       , proto::bitor_tag
     >
 >::type
@@ -153,8 +150,8 @@
 template<typename BidiIter>
 inline proto::binary_op
 <
-    proto::unary_op<basic_regex<BidiIter> const &, proto::noop_tag>
-  , proto::unary_op<basic_regex<BidiIter> const &, proto::noop_tag>
+    proto::unary_op<basic_regex<BidiIter>, proto::noop_tag>
+  , proto::unary_op<basic_regex<BidiIter>, proto::noop_tag>
   , proto::bitor_tag
 >
 operator |(basic_regex<BidiIter> const &left, basic_regex<BidiIter> const &right)

Modified: boost/trunk/boost/xpressive/detail/static/static.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/static.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/static.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,7 +18,6 @@
 #include <boost/xpressive/detail/core/state.hpp>
 #include <boost/xpressive/detail/core/linker.hpp>
 #include <boost/xpressive/detail/core/peeker.hpp>
-#include <boost/xpressive/detail/utility/width.hpp>
 
 // Random thoughts:
 // - must support indirect repeat counts {$n,$m}
@@ -134,15 +133,6 @@
 {
     Next next_;
 
-    BOOST_STATIC_CONSTANT(bool, pure = Matcher::pure && Next::pure);
-    BOOST_STATIC_CONSTANT(
-        std::size_t
-      , width = 
-            Matcher::width != unknown_width::value && Next::width != unknown_width::value
-          ? Matcher::width + Next::width
-          : unknown_width::value
-    );
-
     static_xpression(Matcher const &matcher = Matcher(), Next const &next = Next())
       : Matcher(matcher)
       , next_(next)
@@ -178,7 +168,7 @@
     template<typename Char>
     void link(xpression_linker<Char> &linker) const
     {
-        linker.accept(*static_cast<Matcher const *>(this), &this->next_);
+        linker.link(*static_cast<Matcher const *>(this), &this->next_);
         this->next_.link(linker);
     }
 
@@ -186,16 +176,25 @@
     template<typename Char>
     void peek(xpression_peeker<Char> &peeker) const
     {
-        this->peek_next_(peeker.accept(*static_cast<Matcher const *>(this)), peeker);
+        this->peek_next_(peeker.peek(*static_cast<Matcher const *>(this)), peeker);
     }
 
     // for getting xpression width
-    detail::width get_width() const
+    template<typename BidiIter>
+    std::size_t get_width(state_type<BidiIter> *state) const
     {
-        return this->get_width_(mpl::size_t<width>());
+        // BUGBUG this gets called from the simple_repeat_matcher::match(), so this is slow.
+        // or will the compiler be able to optimize this all away?
+        std::size_t this_width = this->Matcher::get_width(state);
+        if(this_width == unknown_width())
+            return unknown_width();
+        std::size_t that_width = this->next_.get_width(state);
+        if(that_width == unknown_width())
+            return unknown_width();
+        return this_width + that_width;
     }
 
-private:
+private: // hide this
 
     static_xpression &operator =(static_xpression const &);
 
@@ -206,38 +205,37 @@
     }
 
     template<typename Char>
-    void peek_next_(mpl::false_, xpression_peeker<Char> &) const
+    static void peek_next_(mpl::false_, xpression_peeker<Char> &)
     {
-        // no-node
+        // no-op
     }
 
-    template<std::size_t Width>
-    detail::width get_width_(mpl::size_t<Width>) const
-    {
-        return Width;
-    }
-
-    detail::width get_width_(unknown_width) const
-    {
-        // Should only be called in contexts where the width is
-        // known to be fixed.
-        return this->Matcher::get_width() + this->next_.get_width();
-    }
+    using Matcher::width;
+    using Matcher::pure;
 };
 
+// syntactic sugar so this xpression can be treated the same as
+// (a smart pointer to) a dynamic xpression from templates
+template<typename Matcher, typename Next>
+inline static_xpression<Matcher, Next> const *
+get_pointer(static_xpression<Matcher, Next> const &xpr)
+{
+    return &xpr;
+}
+
 ///////////////////////////////////////////////////////////////////////////////
-// make_static
+// make_static_xpression
 //
 template<typename Matcher>
 inline static_xpression<Matcher> const
-make_static(Matcher const &matcher)
+make_static_xpression(Matcher const &matcher)
 {
     return static_xpression<Matcher>(matcher);
 }
 
 template<typename Matcher, typename Next>
 inline static_xpression<Matcher, Next> const
-make_static(Matcher const &matcher, Next const &next)
+make_static_xpression(Matcher const &matcher, Next const &next)
 {
     return static_xpression<Matcher, Next>(matcher, next);
 }
@@ -248,9 +246,6 @@
 struct no_next
   : xpression_base
 {
-    BOOST_STATIC_CONSTANT(std::size_t, width = 0);
-    BOOST_STATIC_CONSTANT(bool, pure = true);
-
     template<typename Char>
     void link(xpression_linker<Char> &) const
     {
@@ -262,13 +257,29 @@
         peeker.fail();
     }
 
-    detail::width get_width() const
+    template<typename BidiIter>
+    static std::size_t get_width(state_type<BidiIter> *)
     {
         return 0;
     }
 };
 
 ///////////////////////////////////////////////////////////////////////////////
+// alternates_list
+//
+template<typename Alternates>
+struct alternates_list
+  : Alternates
+{
+    alternates_list(Alternates const &alternates)
+      : Alternates(alternates)
+    {
+    }
+private:
+    alternates_list &operator =(alternates_list const &);
+};
+
+///////////////////////////////////////////////////////////////////////////////
 // get_mark_number
 //
 inline int get_mark_number(mark_tag const &mark)

Modified: boost/trunk/boost/xpressive/detail/static/width_of.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/static/width_of.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/static/width_of.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,174 +13,255 @@
 # pragma once
 #endif
 
+#include <vector>
+#include <boost/ref.hpp>
+#include <boost/shared_ptr.hpp>
+#include <boost/mpl/if.hpp>
+#include <boost/mpl/fold.hpp>
+#include <boost/mpl/plus.hpp>
+#include <boost/mpl/front.hpp>
+#include <boost/mpl/times.hpp>
 #include <boost/mpl/assert.hpp>
+#include <boost/mpl/lambda.hpp>
 #include <boost/mpl/size_t.hpp>
+#include <boost/mpl/logical.hpp>
+#include <boost/mpl/identity.hpp>
+#include <boost/mpl/equal_to.hpp>
+#include <boost/mpl/transform_view.hpp>
 #include <boost/type_traits/is_same.hpp>
 #include <boost/xpressive/detail/detail_fwd.hpp>
 #include <boost/xpressive/detail/static/as_xpr.hpp>
 
-///////////////////////////////////////////////////////////////////////////////
-// add widths
-#define BOOST_XPR_ADD_WIDTH_(X, Y)                                                                  \
-    mpl::size_t                                                                                     \
-    <                                                                                               \
-        X::value == unknown_width::value || Y::value == unknown_width::value                        \
-      ? unknown_width::value                                                                        \
-      : X::value + Y::value                                                                         \
-    >
+namespace boost { namespace xpressive { namespace detail
+{
+    ///////////////////////////////////////////////////////////////////////////////
+    // add_width
+    template<typename X, typename Y>
+    struct add_width
+      : mpl::eval_if
+        <
+            mpl::or_
+            <
+                mpl::equal_to<X, unknown_width>
+              , mpl::equal_to<Y, unknown_width>
+            >
+          , mpl::identity<unknown_width>
+          , mpl::plus<X, Y>
+        >::type
+    {
+    };
 
-///////////////////////////////////////////////////////////////////////////////
-// multiply widths
-#define BOOST_XPR_MULT_WIDTH_(X, Y)                                                                 \
-    mpl::size_t                                                                                     \
-    <                                                                                               \
-        X::value == unknown_width::value || Y::value == unknown_width::value                        \
-      ? unknown_width::value                                                                        \
-      : X::value * Y::value                                                                         \
-    >
+    ///////////////////////////////////////////////////////////////////////////////
+    // mult_width
+    template<typename X, typename Y>
+    struct mult_width
+      : mpl::eval_if
+        <
+            mpl::or_
+            <
+                mpl::equal_to<X, unknown_width>
+              , mpl::equal_to<Y, unknown_width>
+            >
+          , mpl::identity<unknown_width>
+          , mpl::times<X, Y>
+        >::type
+    {
+    };
 
-///////////////////////////////////////////////////////////////////////////////
-// check widths for equality
-#define BOOST_XPR_EQUAL_WIDTH_(X, Y)                                                                \
-    mpl::size_t                                                                                     \
-    <                                                                                               \
-        X::value == Y::value                                                                        \
-      ? X::value                                                                                    \
-      : unknown_width::value                                                                        \
-    >
+    ///////////////////////////////////////////////////////////////////////////////
+    // equal_width
+    template<typename X, typename Y>
+    struct equal_width
+      : mpl::if_
+        <
+            mpl::equal_to<X, Y>
+          , X
+          , unknown_width
+        >::type
+    {
+    };
 
-namespace boost { namespace xpressive { namespace detail
-{
     ///////////////////////////////////////////////////////////////////////////////
     // width_of
     //
-    template<typename Node>
+    template<typename Xpr>
     struct width_of;
 
-    template<typename Node>
-    struct width_of<Node &>
-      : width_of<Node>
-    {};
+    template<>
+    struct width_of<no_next>
+      : mpl::size_t<0>
+    {
+    };
 
-    template<typename Node>
-    struct width_of<Node const>
-      : width_of<Node>
-    {};
-
     template<typename Matcher>
     struct width_of<proto::unary_op<Matcher, proto::noop_tag> >
-      : mpl::size_t<as_matcher<Matcher>::type::width>
-    {};
+      : as_matcher_type<Matcher>::type::width
+    {
+    };
 
     template<typename Left, typename Right>
     struct width_of<proto::binary_op<Left, Right, proto::right_shift_tag> >
-      : BOOST_XPR_ADD_WIDTH_(width_of<Left>, width_of<Right>)
-    {};
+      : add_width<width_of<Left>, width_of<Right> >
+    {
+    };
 
     template<typename Left, typename Right>
     struct width_of<proto::binary_op<Left, Right, proto::bitor_tag> >
-      : BOOST_XPR_EQUAL_WIDTH_(width_of<Left>, width_of<Right>)
-    {};
+      : equal_width<width_of<Left>, width_of<Right> >
+    {
+    };
 
     template<typename Right>
-    struct width_of<proto::binary_op<mark_tag const, Right, proto::assign_tag> >
+    struct width_of<proto::binary_op<mark_tag, Right, proto::assign_tag> >
       : width_of<Right>
-    {};
+    {
+    };
 
     template<typename Right>
-    struct width_of<proto::binary_op<set_initializer_type const, Right, proto::assign_tag> >
+    struct width_of<proto::binary_op<set_initializer_type, Right, proto::assign_tag> >
       : mpl::size_t<1>
-    {};
+    {
+    };
 
-    template<typename Modifier, typename Node>
-    struct width_of<proto::binary_op<Modifier, Node, modifier_tag> >
-      : width_of<Node>
-    {};
+    template<typename Modifier, typename Xpr>
+    struct width_of<proto::binary_op<Modifier, Xpr, modifier_tag> >
+      : width_of<Xpr>
+    {
+    };
 
-    template<typename Node, bool Positive>
-    struct width_of<proto::unary_op<Node, lookahead_tag<Positive> > >
+    template<typename Xpr, bool Positive>
+    struct width_of<proto::unary_op<Xpr, lookahead_tag<Positive> > >
       : mpl::size_t<0>
-    {};
+    {
+    };
 
-    template<typename Node, bool Positive>
-    struct width_of<proto::unary_op<Node, lookbehind_tag<Positive> > >
+    template<typename Xpr, bool Positive>
+    struct width_of<proto::unary_op<Xpr, lookbehind_tag<Positive> > >
       : mpl::size_t<0>
-    {};
+    {
+    };
 
-    // keep() is used to turn off backtracking, so they should only be used
-    // for things that are variable-width (eg. quantified)
-    template<typename Node>
-    struct width_of<proto::unary_op<Node, keeper_tag> >
+    template<typename Xpr>
+    struct width_of<proto::unary_op<Xpr, keeper_tag> >
+      : width_of<Xpr>
+    {
+    };
+
+    template<typename Matcher, typename Next>
+    struct width_of<static_xpression<Matcher, Next> >
+      : add_width<typename Matcher::width, width_of<Next> >
+    {
+    };
+
+    template<typename BidiIter>
+    struct width_of<shared_ptr<matchable<BidiIter> const> >
       : unknown_width
     {
-        // If this assert fires, you put something that doesn't require backtracking
-        // in a keep(). In that case, the keep() is not necessary and you should just
-        // remove it.
-        BOOST_MPL_ASSERT_RELATION(width_of<Node>::value, ==, unknown_width::value);
     };
 
-    template<typename Node>
-    struct width_of<proto::unary_op<Node, proto::unary_plus_tag> >
+    template<typename BidiIter>
+    struct width_of<std::vector<shared_ptr<matchable<BidiIter> const> > >
       : unknown_width
-    {};
+    {
+    };
 
-    template<typename Node>
-    struct width_of<proto::unary_op<Node, proto::unary_star_tag> >
+    template<typename BidiIter>
+    struct width_of<proto::unary_op<basic_regex<BidiIter>, proto::noop_tag> >
       : unknown_width
-    {};
+    {
+    };
 
-    template<typename Node>
-    struct width_of<proto::unary_op<Node, proto::logical_not_tag> >
+    template<typename BidiIter>
+    struct width_of<proto::unary_op<reference_wrapper<basic_regex<BidiIter> const>, proto::noop_tag> >
       : unknown_width
-    {};
+    {
+    };
 
-    template<typename Node, uint_t Min, uint_t Max>
-    struct width_of<proto::unary_op<Node, generic_quant_tag<Min, Max> > >
+    template<typename Op>
+    struct width_of<proto::unary_op<Op, proto::unary_plus_tag> >
       : unknown_width
-    {};
+    {
+    };
 
-    template<typename Node, uint_t Count>
-    struct width_of<proto::unary_op<Node, generic_quant_tag<Count, Count> > >
-      : BOOST_XPR_MULT_WIDTH_(width_of<Node>, mpl::size_t<Count>)
-    {};
+    template<typename Op>
+    struct width_of<proto::unary_op<Op, proto::unary_star_tag> >
+      : unknown_width
+    {
+    };
 
-    template<typename Node>
-    struct width_of<proto::unary_op<Node, proto::unary_minus_tag> >
-      : width_of<Node>
-    {};
+    template<typename Op>
+    struct width_of<proto::unary_op<Op, proto::logical_not_tag> >
+      : unknown_width
+    {
+    };
 
+    template<typename Op, uint_t Min, uint_t Max>
+    struct width_of<proto::unary_op<Op, generic_quant_tag<Min, Max> > >
+      : mpl::if_c<Min==Max, mult_width<width_of<Op>, mpl::size_t<Min> >, unknown_width>::type
+    {
+    };
+
+    template<typename Op>
+    struct width_of<proto::unary_op<Op, proto::unary_minus_tag> >
+      : width_of<Op>
+    {
+    };
+
     // when complementing a set or an assertion, the width is that of the set (1) or the assertion (0)
-    template<typename Node>
-    struct width_of<proto::unary_op<Node, proto::complement_tag> >
-      : width_of<Node>
-    {};
+    template<typename Op>
+    struct width_of<proto::unary_op<Op, proto::complement_tag> >
+      : width_of<Op>
+    {
+    };
 
     // The comma is used in list-initialized sets, and the width of sets are 1
     template<typename Left, typename Right>
     struct width_of<proto::binary_op<Left, Right, proto::comma_tag> >
       : mpl::size_t<1>
-    {};
+    {
+    };
 
     // The subscript operator[] is used for sets, as in set['a' | range('b','h')], 
     // or for actions as in (any >> expr)[ action ]
     template<typename Left, typename Right>
     struct width_of<proto::binary_op<Left, Right, proto::subscript_tag> >
-      : width_of<Left>
-    {};
-
-    template<typename Right>
-    struct width_of<proto::binary_op<set_initializer_type const, Right, proto::subscript_tag> >
-      : mpl::size_t<1>
+      : mpl::if_<is_same<Left, set_initializer_type>, mpl::size_t<1>, width_of<Left> >::type
     {
         // If Left is "set" then make sure that Right has a width_of 1
-        BOOST_MPL_ASSERT_RELATION(1, ==, width_of<Right>::value);
+        BOOST_MPL_ASSERT
+        ((
+            mpl::or_
+            <
+                mpl::not_<is_same<Left, set_initializer_type> >
+              , mpl::equal_to<width_of<Right>, mpl::size_t<1> >
+            >
+        ));
     };
 
-    template<typename Node, typename Arg>
-    struct width_of<proto::op_proxy<Node, Arg> >
-      : width_of<Node>
-    {};
+    // The width of a list of alternates is N if all the alternates have width N, otherwise unknown_width
+    template<typename Widths>
+    struct alt_width_of
+      : mpl::fold
+        <
+            Widths
+          , typename mpl::front<Widths>::type
+          , equal_width<mpl::_1, mpl::_2>
+        >::type
+    {
+    };
 
+    template<typename Alternates>
+    struct width_of<alternates_list<Alternates> >
+      : alt_width_of<mpl::transform_view<Alternates, width_of<mpl::_1> > >
+    {
+    };
+
+    template<typename Op, typename Arg>
+    struct width_of<proto::op_proxy<Op, Arg> >
+      : width_of<Op>
+    {
+    };
+
 }}} // namespace boost::xpressive::detail
 
 #endif

Deleted: boost/trunk/boost/xpressive/detail/utility/counted_base.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/utility/counted_base.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/utility/counted_base.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,84 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005, Eric Niebler 2006
-// Distributed under the Boost Software License, Version 1.0. (See accompany-
-// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_XPRESSIVE_DETAIL_UTILITY_COUNTED_BASE_HPP_EAN_04_16_2006
-#define BOOST_XPRESSIVE_DETAIL_UTILITY_COUNTED_BASE_HPP_EAN_04_16_2006
-
-#include <boost/assert.hpp>
-#include <boost/checked_delete.hpp>
-#include <boost/detail/atomic_count.hpp>
-
-namespace boost { namespace xpressive { namespace detail
-{
-    template<typename Derived>
-    struct counted_base_access;
-
-    //////////////////////////////////////////////////////////////////////////////
-    // counted_base
-    template<typename Derived>
-    struct counted_base
-    {
-        long use_count() const
-        {
-            return this->count_;
-        }
-
-    protected:
-        counted_base()
-          : count_(0)
-        {
-        }
-
-        counted_base(counted_base<Derived> const &)
-          : count_(0)
-        {
-        }
-
-        counted_base &operator =(counted_base<Derived> const &)
-        {
-            return *this;
-        }
-
-    private:
-        friend struct counted_base_access<Derived>;
-        mutable boost::detail::atomic_count count_;
-    };
-
-    //////////////////////////////////////////////////////////////////////////////
-    // counted_base_access
-    template<typename Derived>
-    struct counted_base_access
-    {
-        static void add_ref(counted_base<Derived> const *that)
-        {
-            ++that->count_;
-        }
-
-        static void release(counted_base<Derived> const *that)
-        {
-            BOOST_ASSERT(0 < that->count_);
-            if(0 == --that->count_)
-            {
-                boost::checked_delete(static_cast<Derived const *>(that));
-            }
-        }
-    };
-
-    template<typename Derived>
-    inline void intrusive_ptr_add_ref(counted_base<Derived> const *that)
-    {
-        counted_base_access<Derived>::add_ref(that);
-    }
-
-    template<typename Derived>
-    inline void intrusive_ptr_release(counted_base<Derived> const *that)
-    {
-        counted_base_access<Derived>::release(that);
-    }
-
-}}} // namespace boost::xpressive::detail
-
-#endif

Modified: boost/trunk/boost/xpressive/detail/utility/tracking_ptr.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/utility/tracking_ptr.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/utility/tracking_ptr.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,14 +20,12 @@
 #include <functional>
 #include <boost/config.hpp>
 #include <boost/assert.hpp>
-#include <boost/weak_ptr.hpp>
 #include <boost/shared_ptr.hpp>
 #include <boost/mpl/assert.hpp>
-#include <boost/intrusive_ptr.hpp>
-#include <boost/detail/atomic_count.hpp>
+#include <boost/enable_shared_from_this.hpp>
+#include <boost/type_traits/is_base_and_derived.hpp>
 #include <boost/iterator/iterator_facade.hpp>
 #include <boost/iterator/filter_iterator.hpp>
-#include <boost/type_traits/is_base_and_derived.hpp>
 
 namespace boost { namespace xpressive { namespace detail
 {
@@ -44,14 +42,14 @@
 //  removes from the set the weak_ptrs that have expired.
 template<typename Derived>
 struct weak_iterator
-  : iterator_facade
+  : boost::iterator_facade
     <
         weak_iterator<Derived>
-      , shared_ptr<Derived> const
+      , boost::shared_ptr<Derived> const
       , std::forward_iterator_tag
     >
 {
-    typedef std::set<weak_ptr<Derived> > set_type;
+    typedef std::set<boost::weak_ptr<Derived> > set_type;
     typedef typename set_type::iterator base_iterator;
 
     weak_iterator()
@@ -70,9 +68,9 @@
     }
 
 private:
-    friend class iterator_core_access;
+    friend class boost::iterator_core_access;
 
-    shared_ptr<Derived> const &dereference() const
+    boost::shared_ptr<Derived> const &dereference() const
     {
         return this->cur_;
     }
@@ -101,24 +99,38 @@
         this->cur_.reset();
     }
 
-    shared_ptr<Derived> cur_;
+    boost::shared_ptr<Derived> cur_;
     base_iterator iter_;
     set_type *set_;
 };
 
 ///////////////////////////////////////////////////////////////////////////////
+// reference_deleter
+//
+template<typename Derived>
+struct reference_deleter
+{
+    void operator ()(void *pv) const
+    {
+        typedef enable_reference_tracking<Derived> impl_type;
+        impl_type *pimpl = static_cast<impl_type *>(pv);
+        pimpl->refs_.clear();
+    }
+};
+
+///////////////////////////////////////////////////////////////////////////////
 // filter_self
 //  for use with a filter_iterator to filter a node out of a list of dependencies
 template<typename Derived>
 struct filter_self
-  : std::unary_function<shared_ptr<Derived>, bool>
+  : std::unary_function<boost::shared_ptr<Derived>, bool>
 {
     filter_self(enable_reference_tracking<Derived> *self)
       : self_(self)
     {
     }
 
-    bool operator ()(shared_ptr<Derived> const &that) const
+    bool operator ()(boost::shared_ptr<Derived> const &that) const
     {
         return this->self_ != that.get();
     }
@@ -128,38 +140,24 @@
 };
 
 ///////////////////////////////////////////////////////////////////////////////
-// swap without bringing in std::swap -- must be found by ADL.
-template<typename T>
-void adl_swap(T &t1, T &t2)
-{
-    swap(t1, t2);
-}
-
-///////////////////////////////////////////////////////////////////////////////
 // enable_reference_tracking
 //   inherit from this type to enable reference tracking for a type. You can
 //   then use tracking_ptr (below) as a holder for derived objects.
 //
 template<typename Derived>
 struct enable_reference_tracking
+  : enable_shared_from_this<Derived>
 {
+    typedef enable_reference_tracking<Derived> this_type;
     typedef std::set<shared_ptr<Derived> > references_type;
     typedef std::set<weak_ptr<Derived> > dependents_type;
 
     void tracking_copy(Derived const &that)
     {
-        if(&this->derived_() != &that)
-        {
-            this->raw_copy_(that);
-            this->tracking_update();
-        }
+        this->derived_() = that;
+        this->tracking_update();
     }
 
-    void tracking_clear()
-    {
-        this->raw_copy_(Derived());
-    }
-
     // called automatically as a result of a tracking_copy(). Must be called explicitly
     // if you change the references without calling tracking_copy().
     void tracking_update()
@@ -170,37 +168,22 @@
         this->update_dependents_();
     }
 
-    void track_reference(enable_reference_tracking<Derived> &that)
+    void tracking_clear()
     {
+        this->derived_() = Derived();
+    }
+
+    void track_reference(shared_ptr<Derived> const &that)
+    {
         // avoid some unbounded memory growth in certain circumstances by
         // opportunistically removing stale dependencies from "that"
-        that.purge_stale_deps_();
+        that->purge_stale_deps_();
         // add "that" as a reference
-        this->refs_.insert(that.self_);
+        this->refs_.insert(that);
         // also inherit that's references
-        this->refs_.insert(that.refs_.begin(), that.refs_.end());
+        this->refs_.insert(that->refs_.begin(), that->refs_.end());
     }
 
-    long use_count() const
-    {
-        return this->cnt_;
-    }
-
-    void add_ref()
-    {
-        ++this->cnt_;
-    }
-
-    void release()
-    {
-        BOOST_ASSERT(0 < this->cnt_);
-        if(0 == --this->cnt_)
-        {
-            this->refs_.clear();
-            this->self_.reset();
-        }
-    }
-
     //{{AFX_DEBUG
     #ifdef BOOST_XPRESSIVE_DEBUG_TRACKING_POINTER
     friend std::ostream &operator <<(std::ostream &sout, enable_reference_tracking<Derived> const &that)
@@ -216,22 +199,20 @@
     enable_reference_tracking()
       : refs_()
       , deps_()
-      , self_()
-      , cnt_(0)
     {
     }
 
     enable_reference_tracking(enable_reference_tracking<Derived> const &that)
       : refs_()
       , deps_()
-      , self_()
-      , cnt_(0)
     {
         this->operator =(that);
     }
 
     enable_reference_tracking<Derived> &operator =(enable_reference_tracking<Derived> const &that)
     {
+        // BUGBUG derived classes will need to do something special to make their
+        // assignment operators exception-safe. Can we make this easier?
         references_type(that.refs_).swap(this->refs_);
         return *this;
     }
@@ -242,21 +223,23 @@
     }
 
 private:
+
     friend struct tracking_ptr<Derived>;
+    friend struct reference_deleter<Derived>;
 
     Derived &derived_()
     {
         return *static_cast<Derived *>(this);
     }
 
-    void raw_copy_(Derived that)
+    bool has_deps_() const
     {
-        detail::adl_swap(this->derived_(), that);
+        return !this->deps_.empty();
     }
 
-    bool has_deps_() const
+    shared_ptr<void> get_ref_deleter_()
     {
-        return !this->deps_.empty();
+        return shared_ptr<void>(static_cast<void*>(this), reference_deleter<Derived>());
     }
 
     void update_references_()
@@ -265,8 +248,11 @@
         typename references_type::iterator end = this->refs_.end();
         for(; cur != end; ++cur)
         {
-            // for each reference, add this as a dependency
-            (*cur)->track_dependency_(*this);
+            if(this != cur->get()) // not necessary, but avoids a call to shared_from_this()
+            {
+                // for each reference, add this as a dependency
+                (*cur)->track_dependency_(this->shared_from_this());
+            }
         }
     }
 
@@ -275,32 +261,35 @@
         // called whenever this regex object changes (i.e., is assigned to). it walks
         // the list of dependent regexes and updates *their* lists of references,
         // thereby spreading out the reference counting responsibility evenly.
-        weak_iterator<Derived> cur(this->deps_.begin(), &this->deps_);
-        weak_iterator<Derived> end(this->deps_.end(), &this->deps_);
-
-        for(; cur != end; ++cur)
+        if(!this->refs_.empty())
         {
-            (*cur)->track_reference(*this);
+            weak_iterator<Derived> cur(this->deps_.begin(), &this->deps_);
+            weak_iterator<Derived> end(this->deps_.end(), &this->deps_);
+
+            for(; cur != end; ++cur)
+            {
+                (*cur)->track_reference(this->shared_from_this());
+            }
         }
     }
 
-    void track_dependency_(enable_reference_tracking<Derived> &dep)
+    void track_dependency_(shared_ptr<Derived> const &dep)
     {
-        if(this == &dep) // never add ourself as a dependency
-            return;
+        if(this != dep.get()) // never add ourself as a dependency
+        {
+            // add dep as a dependency
+            this->deps_.insert(dep);
 
-        // add dep as a dependency
-        this->deps_.insert(dep.self_);
+            filter_self<Derived> not_self(this);
+            weak_iterator<Derived> begin(dep->deps_.begin(), &dep->deps_);
+            weak_iterator<Derived> end(dep->deps_.end(), &dep->deps_);
 
-        filter_self<Derived> not_self(this);
-        weak_iterator<Derived> begin(dep.deps_.begin(), &dep.deps_);
-        weak_iterator<Derived> end(dep.deps_.end(), &dep.deps_);
-
-        // also inherit dep's dependencies
-        this->deps_.insert(
-            make_filter_iterator(not_self, begin, end)
-          , make_filter_iterator(not_self, end, end)
-        );
+            // also inherit dep's dependencies
+            this->deps_.insert(
+                boost::make_filter_iterator(not_self, begin, end)
+              , boost::make_filter_iterator(not_self, end, end)
+            );
+        }
     }
 
     void purge_stale_deps_()
@@ -320,22 +309,8 @@
 
     references_type refs_;
     dependents_type deps_;
-    shared_ptr<Derived> self_;
-    boost::detail::atomic_count cnt_;
 };
 
-template<typename Derived>
-inline void intrusive_ptr_add_ref(enable_reference_tracking<Derived> *p)
-{
-    p->add_ref();
-}
-
-template<typename Derived>
-inline void intrusive_ptr_release(enable_reference_tracking<Derived> *p)
-{
-    p->release();
-}
-
 //{{AFX_DEBUG
 #ifdef BOOST_XPRESSIVE_DEBUG_TRACKING_POINTER
 ///////////////////////////////////////////////////////////////////////////////
@@ -344,7 +319,7 @@
 template<typename Derived>
 inline void enable_reference_tracking<Derived>::dump_(std::ostream &sout) const
 {
-    shared_ptr<Derived> this_ = this->self_;
+    shared_ptr<Derived const> this_ = this->shared_from_this();
     sout << "0x" << (void*)this << " cnt=" << this_.use_count()-1 << " refs={";
     typename references_type::const_iterator cur1 = this->refs_.begin();
     typename references_type::const_iterator end1 = this->refs_.end();
@@ -377,16 +352,23 @@
 template<typename Type>
 struct tracking_ptr
 {
-	BOOST_MPL_ASSERT((is_base_and_derived<enable_reference_tracking<Type>, Type>));
+private:
+    struct dummy_ { int n_; };
+    BOOST_MPL_ASSERT((is_base_and_derived<enable_reference_tracking<Type>, Type>));
+
+public:
+
     typedef Type element_type;
 
     tracking_ptr()
-      : impl_()
+      : data_()
+      , refs_()
     {
     }
 
     tracking_ptr(tracking_ptr<element_type> const &that)
-      : impl_()
+      : data_()
+      , refs_()
     {
         this->operator =(that);
     }
@@ -395,97 +377,111 @@
     {
         // Note: the copy-and-swap idiom doesn't work here if has_deps_()==true
         // because it invalidates references to the element_type object.
-        if(this != &that)
+
+        if(that)
         {
-            if(that)
+            if(that.has_deps_() || this->has_deps_())
             {
-                if(that.has_deps_() || this->has_deps_())
-                {
-                    this->fork_(); // deep copy, forks data if necessary
-                    this->impl_->tracking_copy(*that);
-                }
-                else
-                {
-                    this->impl_ = that.impl_; // shallow, copy-on-write
-                }
+                this->tracking_copy(*that.data_); // deep copy, forks data if necessary
             }
-            else if(*this)
+            else
             {
-                this->impl_->tracking_clear();
+                this->refs_ = that.refs_; // shallow, copy-on-write
+                this->data_ = that.data_;
             }
         }
+        else if(*this)
+        {
+            this->data_->tracking_clear();
+        }
+
         return *this;
     }
 
     // NOTE: this does *not* do tracking. Can't provide a non-throwing swap that tracks references
     void swap(tracking_ptr<element_type> &that) // throw()
     {
-        this->impl_.swap(that.impl_);
+        this->data_.swap(that.data_);
+        this->refs_.swap(that.refs_);
     }
 
-    // calling this forces this->impl_ to fork.
+    // deep copy, forces a fork and calls update() to update all the
+    // dependents and references.
+    void tracking_copy(element_type const &that)
+    {
+        this->get_(false)->tracking_copy(that);
+    }
+
+    // calling this forces this->data_ to fork.
     shared_ptr<element_type> const &get() const
     {
-        if(intrusive_ptr<element_type> impl = this->fork_())
-        {
-            this->impl_->tracking_copy(*impl);
-        }
-        return this->impl_->self_;
+        return this->get_(true); // copy == true
     }
 
-    #if defined(__SUNPRO_CC) && BOOST_WORKAROUND(__SUNPRO_CC, <= 0x530)
-    typedef bool unspecified_bool_type;
-    #else
-    typedef typename intrusive_ptr<element_type>::unspecified_bool_type unspecified_bool_type;
-    #endif
-
     // smart-pointer operators
-    operator unspecified_bool_type() const
+    operator int dummy_::*() const
     {
-        return this->impl_;
+        return this->data_ ? &dummy_::n_ : 0;
     }
 
     bool operator !() const
     {
-        return !this->impl_;
+        return !this->data_;
     }
 
     // Since this does not un-share the data, it returns a ptr-to-const
     element_type const *operator ->() const
     {
-        return get_pointer(this->impl_);
+        return this->data_.get();
     }
 
     // Since this does not un-share the data, it returns a ref-to-const
     element_type const &operator *() const
     {
-        return *this->impl_;
+        return *this->data_;
     }
 
 private:
 
-    // calling this forces impl_ to fork.
-    intrusive_ptr<element_type> fork_() const
+    // calling this forces data_ to fork. if 'copy' is true, then
+    // the old data is copied into the fork.
+    shared_ptr<element_type> const &get_(bool copy) const
     {
-        intrusive_ptr<element_type> impl;
-        if(!this->impl_ || 1 != this->impl_->use_count())
+        if(!*this)
         {
-            impl = this->impl_;
+            this->data_.reset(new element_type);
+            this->refs_ = this->data_->get_ref_deleter_();
+        }
+        else if(!this->unique_())
+        {
             BOOST_ASSERT(!this->has_deps_());
-            shared_ptr<element_type> simpl(new element_type);
-            this->impl_ = get_pointer(simpl->self_ = simpl);
+            shared_ptr<element_type> new_data(new element_type);
+            if(copy)
+            {
+                new_data->tracking_copy(*this->data_);
+            }
+            this->data_.swap(new_data);
+            this->refs_ = this->data_->get_ref_deleter_();
         }
-        return impl;
+
+        return this->data_;
     }
 
+    // are we the only holders of this data?
+    bool unique_() const
+    {
+        return this->refs_.unique();
+    }
+
     // does anybody have a dependency on us?
     bool has_deps_() const
     {
-        return this->impl_ && this->impl_->has_deps_();
+        return this->data_ && this->data_->has_deps_();
     }
 
     // mutable to allow lazy initialization
-    mutable intrusive_ptr<element_type> impl_;
+    mutable shared_ptr<element_type> data_;
+    mutable shared_ptr<void> refs_;
 };
 
 }}} // namespace boost::xpressive::detail

Deleted: boost/trunk/boost/xpressive/detail/utility/width.hpp
===================================================================
--- boost/trunk/boost/xpressive/detail/utility/width.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/detail/utility/width.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,94 +0,0 @@
-///////////////////////////////////////////////////////////////////////////////
-// width.hpp
-//
-//  Copyright 2004 Eric Niebler. Distributed under the Boost
-//  Software License, Version 1.0. (See accompanying file
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef BOOST_XPRESSIVE_DETAIL_UTILITY_WIDTH_HPP_EAN_04_07_2006
-#define BOOST_XPRESSIVE_DETAIL_UTILITY_WIDTH_HPP_EAN_04_07_2006
-
-// MS compatible compilers support #pragma once
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
-# pragma once
-#endif
-
-#include <climits> // for INT_MAX
-#include <boost/mpl/size_t.hpp>
-
-namespace boost { namespace xpressive { namespace detail
-{
-
-typedef mpl::size_t<INT_MAX / 2 - 1> unknown_width;
-struct width;
-bool is_unknown(width const &that);
-
-///////////////////////////////////////////////////////////////////////////////
-// width
-struct width
-{
-    width(std::size_t value = 0)
-      : value_(value)
-    {
-    }
-
-    bool operator !() const
-    {
-        return !this->value_;
-    }
-
-    width &operator +=(width const &that)
-    {
-        this->value_ =
-            !is_unknown(*this) && !is_unknown(that)
-          ? this->value_ + that.value_
-          : unknown_width();
-        return *this;
-    }
-
-    width &operator |=(width const &that)
-    {
-        this->value_ = 
-            this->value_ == that.value_
-          ? this->value_
-          : unknown_width();
-        return *this;
-    }
-
-    std::size_t value() const
-    {
-        return this->value_;
-    }
-
-private:
-    std::size_t value_;
-};
-
-inline bool is_unknown(width const &that)
-{
-    return unknown_width::value == that.value();
-}
-
-inline bool operator ==(width const &left, width const &right)
-{
-    return left.value() == right.value();
-}
-
-inline bool operator !=(width const &left, width const &right)
-{
-    return left.value() != right.value();
-}
-
-inline width operator +(width left, width const &right)
-{
-    return left += right;
-}
-
-inline width operator |(width left, width const &right)
-{
-    return left |= right;
-}
-
-}}} // namespace boost::xpressive::detail
-
-#endif

Modified: boost/trunk/boost/xpressive/match_results.hpp
===================================================================
--- boost/trunk/boost/xpressive/match_results.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/match_results.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,7 +18,7 @@
 
 #include <iterator>
 #include <boost/assert.hpp>
-#include <boost/intrusive_ptr.hpp>
+#include <boost/shared_ptr.hpp>
 #include <boost/iterator_adaptors.hpp>
 #if BOOST_ITERATOR_ADAPTORS_VERSION >= 0x0200
 # include <boost/iterator/filter_iterator.hpp>
@@ -31,7 +31,6 @@
 #include <boost/xpressive/detail/core/action_state.hpp>
 #include <boost/xpressive/detail/utility/literals.hpp>
 #include <boost/xpressive/detail/utility/algorithm.hpp>
-#include <boost/xpressive/detail/utility/counted_base.hpp>
 
 namespace boost { namespace xpressive { namespace detail
 {
@@ -41,7 +40,6 @@
 //
 template<typename BidiIter>
 struct results_extras
-  : counted_base<results_extras<BidiIter> >
 {
     sequence_stack<sub_match_impl<BidiIter> > sub_match_stack_;
     results_cache<BidiIter> results_cache_;
@@ -434,7 +432,7 @@
     {
         if(!this->extras_ptr_)
         {
-            this->extras_ptr_ = new extras_type;
+            this->extras_ptr_.reset(new extras_type);
         }
 
         return *this->extras_ptr_;
@@ -452,6 +450,13 @@
         this->suffix_.first = (*this)[ 0 ].second;
         this->suffix_.second = end;
         this->suffix_.matched = this->suffix_.first != this->suffix_.second;
+
+        typename nested_results_type::iterator ibegin = this->nested_results_.begin();
+        typename nested_results_type::iterator iend = this->nested_results_.end();
+        for( ; ibegin != iend; ++ibegin )
+        {
+            ibegin->set_prefix_suffix_(begin, end);
+        }
     }
 
     /// INTERNAL ONLY
@@ -464,6 +469,13 @@
     void set_base_(BidiIter base)
     {
         this->base_ = base;
+
+        typename nested_results_type::iterator ibegin = this->nested_results_.begin();
+        typename nested_results_type::iterator iend = this->nested_results_.end();
+        for( ; ibegin != iend; ++ibegin )
+        {
+            ibegin->set_base_(base);
+        }
     }
 
     regex_id_type regex_id_;
@@ -473,7 +485,7 @@
     sub_match<BidiIter> suffix_;
     nested_results_type nested_results_;
     detail::action_state action_state_;
-    intrusive_ptr<extras_type> extras_ptr_;
+    shared_ptr<extras_type> extras_ptr_;
 };
 
 ///////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/boost/xpressive/proto/arg_traits.hpp
===================================================================
--- boost/trunk/boost/xpressive/proto/arg_traits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/proto/arg_traits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 ///////////////////////////////////////////////////////////////////////////////
 /// \file arg_traits.hpp
-/// Contains definitions for arg_type\<\>, left_type\<\>,
+/// Contains definitions for value_type\<\>, arg_type\<\>, left_type\<\>,
 /// right_type\<\>, tag_type\<\>, and the helper functions arg(), left(),
 /// and right().
 //
@@ -13,153 +13,109 @@
 
 #include <boost/call_traits.hpp>
 #include <boost/xpressive/proto/proto_fwd.hpp>
-#include <boost/xpressive/proto/op_tags.hpp>
 
-#ifdef BOOST_PROTO_FUSION_V2
-# include <boost/fusion/sequence/intrinsic/at.hpp>
-# define BOOST_PROTO_AT(n, s) fusion::at_c<n>(s)
-#else
-# include <boost/spirit/fusion/sequence/at.hpp>
-# define BOOST_PROTO_AT(n, s) fusion::at<n>(s)
-#endif
-
 namespace boost { namespace proto
 {
 
     ///////////////////////////////////////////////////////////////////////////////
-    // argument type extractors
-    template<typename Node>
-    struct arg_type
+    // value_type
+    //  specialize this to control how user-defined types are stored in the parse tree
+    template<typename T>
+    struct value_type
     {
-        typedef typename remove_reference<typename Node::arg_type>::type type;
-        typedef typename add_reference<typename add_const<type>::type>::type reference;
+        typedef typename boost::call_traits<T>::value_type type;
     };
 
-    template<typename Node, typename Param>
-    struct arg_type<op_proxy<Node, Param> >
+    template<>
+    struct value_type<fusion::void_t>
     {
-        typedef typename remove_reference<typename Node::arg_type>::type type;
-        typedef typename add_const<type>::type reference;
+        typedef fusion::void_t type;
     };
 
-    template<typename Node>
-    struct arg_type<Node &>
-      : arg_type<Node>
-    {};
-
     ///////////////////////////////////////////////////////////////////////////////
     // argument type extractors
-    template<typename Node>
-    struct left_type
+    template<typename Op>
+    struct arg_type
     {
-        typedef typename remove_reference<typename Node::left_type>::type type;
-        typedef typename add_reference<typename add_const<type>::type>::type reference;
+        typedef typename Op::arg_type type;
+        typedef type const &const_reference;
     };
 
-    template<typename Node, typename Param>
-    struct left_type<op_proxy<Node, Param> >
+    template<typename Op, typename Param>
+    struct arg_type<op_proxy<Op, Param> >
     {
-        typedef typename remove_reference<typename Node::left_type>::type type;
-        typedef typename add_const<type>::type reference;
+        typedef typename Op::arg_type type;
+        typedef type const const_reference;
     };
 
-    template<typename Node>
-    struct left_type<Node &>
-      : left_type<Node>
-    {};
-
     ///////////////////////////////////////////////////////////////////////////////
     // argument type extractors
-    template<typename Node>
-    struct right_type
+    template<typename Op>
+    struct left_type
     {
-        typedef typename remove_reference<typename Node::right_type>::type type;
-        typedef typename add_reference<typename add_const<type>::type>::type reference;
+        typedef typename Op::left_type type;
+        typedef type const &const_reference;
     };
 
-    template<typename Node, typename Param>
-    struct right_type<op_proxy<Node, Param> >
+    template<typename Op, typename Param>
+    struct left_type<op_proxy<Op, Param> >
     {
-        typedef typename remove_reference<typename Node::right_type>::type type;
-        typedef typename add_const<type>::type reference;
+        typedef typename Op::left_type type;
+        typedef type const const_reference;
     };
 
-    template<typename Node>
-    struct right_type<Node &>
-      : right_type<Node>
-    {};
-
     ///////////////////////////////////////////////////////////////////////////////
-    // tag extractor
-    template<typename Node, bool IsOp>
-    struct tag_type
+    // argument type extractors
+    template<typename Op>
+    struct right_type
     {
-        typedef typename Node::tag_type type;
+        typedef typename Op::right_type type;
+        typedef type const &const_reference;
     };
 
-    template<typename Node, typename Param>
-    struct tag_type<op_proxy<Node, Param>, true>
+    template<typename Op, typename Param>
+    struct right_type<op_proxy<Op, Param> >
     {
-        typedef typename Node::tag_type type;
+        typedef typename Op::right_type type;
+        typedef type const const_reference;
     };
 
-    template<typename Node>
-    struct tag_type<Node, false>
-    {
-        typedef noop_tag type;
-    };
-
-    template<typename Node>
-    struct tag_type<Node &, true>
-      : tag_type<Node, true>
-    {};
-
     ///////////////////////////////////////////////////////////////////////////////
-    // is_unary
-    template<typename Node>
-    struct is_unary
-      : boost::is_base_and_derived<unary_tag, typename tag_type<Node>::type>
+    // tag extractor
+    template<typename Op>
+    struct tag_type
     {
+        typedef typename Op::tag_type type;
     };
 
-    ///////////////////////////////////////////////////////////////////////////////
-    // is_binary
-    template<typename Node>
-    struct is_binary
-      : boost::is_base_and_derived<binary_tag, typename tag_type<Node>::type>
+    template<typename Op, typename Param>
+    struct tag_type<op_proxy<Op, Param> >
     {
+        typedef typename Op::tag_type type;
     };
 
     ///////////////////////////////////////////////////////////////////////////////
-    // is_nary
-    template<typename Node>
-    struct is_nary
-      : boost::is_base_and_derived<nary_tag, typename tag_type<Node>::type>
-    {
-    };
-
-    ///////////////////////////////////////////////////////////////////////////////
     // arg
-    template<typename Node>
-    inline typename arg_type<Node>::reference arg(Node const &node)
+    template<typename Op>
+    inline typename arg_type<Op>::const_reference arg(Op const &op)
     {
-        return node.cast().child.val;
+        return op.cast().arg;
     }
 
     ///////////////////////////////////////////////////////////////////////////////
     // left
-    template<typename Node>
-    inline typename left_type<Node>::reference left(Node const &node)
+    template<typename Op>
+    inline typename left_type<Op>::const_reference left(Op const &op)
     {
-        return BOOST_PROTO_AT(0, node.cast().children).val;
+        return op.cast().left;
     }
 
     ///////////////////////////////////////////////////////////////////////////////
     // right
-    template<typename Node>
-    inline typename right_type<Node>::reference right(Node const &node)
+    template<typename Op>
+    inline typename right_type<Op>::const_reference right(Op const &op)
     {
-        return BOOST_PROTO_AT(1, node.cast().children).val;
+        return op.cast().right;
     }
 
 }}

Modified: boost/trunk/boost/xpressive/proto/compiler/branch.hpp
===================================================================
--- boost/trunk/boost/xpressive/proto/compiler/branch.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/proto/compiler/branch.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,15 +23,15 @@
     template<typename Lambda, typename DomainTag>
     struct branch_compiler
     {
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         struct apply
         {
-            typedef proto::compiler<typename tag_type<Node>::type, DomainTag> compiler_type;
+            typedef proto::compiler<typename tag_type<Op>::type, DomainTag> compiler_type;
 
             // Compile the branch
             typedef typename compiler_type::BOOST_NESTED_TEMPLATE apply
-            <
-                Node
+             <
+                Op
               , typename Lambda::state_type
               , Visitor
             >::type branch_type;
@@ -45,13 +45,13 @@
             >::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &state, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &visitor)
         {
             return Lambda::call
             (
-                proto::compile(node, typename Lambda::state_type(), visitor, DomainTag())
+                proto::compile(op, typename Lambda::state_type(), visitor, DomainTag())
               , state
               , visitor
             );

Modified: boost/trunk/boost/xpressive/proto/compiler/conditional.hpp
===================================================================
--- boost/trunk/boost/xpressive/proto/compiler/conditional.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/proto/compiler/conditional.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,30 +22,30 @@
     template<typename Predicate, typename IfCompiler, typename ElseCompiler>
     struct conditional_compiler
     {
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         struct apply
         {
             typedef typename boost::mpl::if_
             <
-                typename Predicate::BOOST_NESTED_TEMPLATE apply<Node, State, Visitor>::type
+                typename Predicate::BOOST_NESTED_TEMPLATE apply<Op, State, Visitor>::type
               , IfCompiler
               , ElseCompiler
             >::type compiler_type;
 
             typedef typename compiler_type::BOOST_NESTED_TEMPLATE apply
             <
-                Node
+                Op
               , State
               , Visitor
             >::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &state, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &visitor)
         {
-            typedef typename apply<Node, State, Visitor>::compiler_type compiler_type;
-            return compiler_type::call(node, state, visitor);
+            typedef typename apply<Op, State, Visitor>::compiler_type compiler_type;
+            return compiler_type::call(op, state, visitor);
         }
     };
 

Modified: boost/trunk/boost/xpressive/proto/compiler/error.hpp
===================================================================
--- boost/trunk/boost/xpressive/proto/compiler/error.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/proto/compiler/error.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,7 +19,7 @@
     // error_compiler
     struct error_compiler
     {
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         struct apply
         {
             typedef void type;

Modified: boost/trunk/boost/xpressive/proto/compiler/fold.hpp
===================================================================
--- boost/trunk/boost/xpressive/proto/compiler/fold.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/proto/compiler/fold.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,44 +18,44 @@
 
     ///////////////////////////////////////////////////////////////////////////////
     // fold_compiler
-    //  Compiles the left side and passes the result as state while compiling the right.
+    //  Compiles the right side and passes the result as state while compiling the left.
     //  This is useful for serializing a tree.
-    template<typename DomainTag>
+    template<typename OpTag, typename DomainTag, bool RightFirst>
     struct fold_compiler
     {
         // sample compiler implementation for sequencing
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         struct apply
         {
-            typedef typename right_type<Node>::type right_type;
-            typedef typename left_type<Node>::type left_type;
+            typedef typename right_type<Op>::type right_type;
+            typedef typename left_type<Op>::type left_type;
 
             // compile the right branch
-            typedef typename compiler<typename tag_type<left_type>::type, DomainTag>::
+            typedef typename compiler<typename tag_type<right_type>::type, DomainTag>::
                 BOOST_NESTED_TEMPLATE apply
             <
-                left_type
+                right_type
               , State
               , Visitor
-            >::type left_compiled_type;
+            >::type right_compiled_type;
 
             // forward the result of the right branch to the left
-            typedef typename compiler<typename tag_type<right_type>::type, DomainTag>::
+            typedef typename compiler<typename tag_type<left_type>::type, DomainTag>::
                 BOOST_NESTED_TEMPLATE apply
             <
-                right_type
-              , left_compiled_type
+                left_type
+              , right_compiled_type
               , Visitor
             >::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &state, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &visitor)
         {
             return proto::compile(
-                proto::right(node)
-              , proto::compile(proto::left(node), state, visitor, DomainTag())
+                proto::left(op)
+              , proto::compile(proto::right(op), state, visitor, DomainTag())
               , visitor
               , DomainTag()
             );
@@ -63,45 +63,45 @@
     };
 
     ///////////////////////////////////////////////////////////////////////////////
-    // reverse_fold_compiler
-    //  Compiles the right side and passes the result as state while compiling the left.
+    // fold_compiler
+    //  Compiles the left side and passes the result as state while compiling the right.
     //  This is useful for serializing a tree.
-    template<typename DomainTag>
-    struct reverse_fold_compiler
+    template<typename OpTag, typename DomainTag>
+    struct fold_compiler<OpTag, DomainTag, false>
     {
         // sample compiler implementation for sequencing
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         struct apply
         {
-            typedef typename right_type<Node>::type right_type;
-            typedef typename left_type<Node>::type left_type;
+            typedef typename right_type<Op>::type right_type;
+            typedef typename left_type<Op>::type left_type;
 
             // compile the right branch
-            typedef typename compiler<typename tag_type<right_type>::type, DomainTag>::
+            typedef typename compiler<typename tag_type<left_type>::type, DomainTag>::
                 BOOST_NESTED_TEMPLATE apply
             <
-                right_type
+                left_type
               , State
               , Visitor
-            >::type right_compiled_type;
+            >::type left_compiled_type;
 
             // forward the result of the right branch to the left
-            typedef typename compiler<typename tag_type<left_type>::type, DomainTag>::
+            typedef typename compiler<typename tag_type<right_type>::type, DomainTag>::
                 BOOST_NESTED_TEMPLATE apply
             <
-                left_type
-              , right_compiled_type
+                right_type
+              , left_compiled_type
               , Visitor
             >::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &state, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &visitor)
         {
             return proto::compile(
-                proto::left(node)
-              , proto::compile(proto::right(node), state, visitor, DomainTag())
+                proto::right(op)
+              , proto::compile(proto::left(op), state, visitor, DomainTag())
               , visitor
               , DomainTag()
             );

Deleted: boost/trunk/boost/xpressive/proto/compiler/pass_through.hpp
===================================================================
--- boost/trunk/boost/xpressive/proto/compiler/pass_through.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/proto/compiler/pass_through.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,135 +0,0 @@
-///////////////////////////////////////////////////////////////////////////////
-/// \file pass_through.hpp
-/// 
-//
-//  Copyright 2004 Eric Niebler. Distributed under the Boost
-//  Software License, Version 1.0. (See accompanying file
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef BOOST_PROTO_COMPILER_PASS_THROUGH_HPP_EAN_04_23_2006
-#define BOOST_PROTO_COMPILER_PASS_THROUGH_HPP_EAN_04_23_2006
-
-#include <boost/utility/enable_if.hpp>
-#include <boost/type_traits/is_same.hpp>
-#include <boost/xpressive/proto/proto_fwd.hpp>
-
-namespace boost { namespace proto
-{
-    ///////////////////////////////////////////////////////////////////////////////
-    // pass_through_compiler
-    template<typename DomainTag>
-    struct pass_through_compiler
-    {
-        // compile_helper
-        template<typename Node, typename State, typename Visitor, typename EnableIf = void>
-        struct compile_helper
-        {
-            typedef typename compile_result<Node, State, Visitor, DomainTag>::type type;
-
-            static type const &call(type const &node, State const &state, Visitor &visitor, int)
-            {
-                return node;
-            }
-
-            static type const call(Node const &node, State const &state, Visitor &visitor, ...)
-            {
-                return proto::compile(node, state, visitor, DomainTag());
-            }
-        };
-
-        template<typename Node, typename State, typename Visitor>
-        struct compile_helper<Node, State, Visitor, typename disable_if<is_op<Node> >::type>
-        {
-            typedef Node type;
-
-            static Node const &call(Node const &node, State const &state, Visitor &visitor, int)
-            {
-                return node;
-            }
-        };
-
-        // apply_helper
-        template<typename Node, typename State, typename Visitor, typename EnableIf>
-        struct apply_helper;
-
-        // is_unary apply
-        template<typename Node, typename State, typename Visitor>
-        struct apply_helper<Node, State, Visitor, typename enable_if<is_unary<Node> >::type>
-        {
-            typedef typename arg_type<Node>::type arg_type;
-            typedef compile_helper<arg_type, State, Visitor> compiler_type;
-            typedef typename compiler_type::type new_arg_type;
-            typedef unary_op<new_arg_type, typename tag_type<Node>::type> type;
-            typedef typename mpl::if_<is_same<Node, type>, Node const &, type const>::type const_reference;
-
-            static type const &call(type const &node, State const &state, Visitor &visitor, int)
-            {
-                return node; // pass-through, no recompilation necessary.
-            }
-
-            static type const call(Node const &node, State const &state, Visitor &visitor, ...)
-            {
-                return proto::make_op<typename tag_type<Node>::type>(
-                    compiler_type::call(proto::arg(node), state, visitor, 0)
-                );
-            }
-        };
-
-        // is_binary apply
-        template<typename Node, typename State, typename Visitor>
-        struct apply_helper<Node, State, Visitor, typename enable_if<is_binary<Node> >::type>
-        {
-            typedef typename left_type<Node>::type left_type;
-            typedef typename right_type<Node>::type right_type;
-            typedef compile_helper<left_type, State, Visitor> left_compiler_type;
-            typedef compile_helper<right_type, State, Visitor> right_compiler_type;
-            typedef typename left_compiler_type::type new_left_type;
-            typedef typename right_compiler_type::type new_right_type;
-            typedef binary_op<new_left_type, new_right_type, typename tag_type<Node>::type> type;
-            typedef typename mpl::if_<is_same<Node, type>, Node const &, type const>::type const_reference;
-
-            static type const &call(type const &node, State const &state, Visitor &visitor, int)
-            {
-                return node; // pass-through, no recompilation necessary.
-            }
-
-            static type const call(Node const &node, State const &state, Visitor &visitor, ...)
-            {
-                return proto::make_op<typename tag_type<Node>::type>(
-                    left_compiler_type::call(proto::left(node), state, visitor, 0)
-                  , right_compiler_type::call(proto::right(node), state, visitor, 0)
-                );
-            }
-        };
-
-        // is_nary apply
-        template<typename Node, typename State, typename Visitor>
-        struct apply_helper<Node, State, Visitor, typename enable_if<is_nary<Node> >::type>
-        {
-            // BUGBUG handle nary_op here
-            typedef Node type;
-            typedef Node const &const_reference;
-
-            static Node const &call(Node const &node, State const &, Visitor &, int)
-            {
-                return node;
-            }
-        };
-
-        template<typename Node, typename State, typename Visitor>
-        struct apply
-          : apply_helper<Node, State, Visitor, void>
-        {
-        };
-
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::const_reference
-        call(Node const &node, State const &state, Visitor &visitor)
-        {
-            return apply<Node, State, Visitor>::call(node, state, visitor, 0);
-        }
-    };
-
-}}
-
-#endif

Modified: boost/trunk/boost/xpressive/proto/compiler/switch.hpp
===================================================================
--- boost/trunk/boost/xpressive/proto/compiler/switch.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/proto/compiler/switch.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,29 +24,29 @@
     template<typename Lambda, typename Map>
     struct switch_compiler
     {
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         struct apply
         {
             typedef typename boost::mpl::at
             <
                 Map
-              , typename Lambda::BOOST_NESTED_TEMPLATE apply<Node, State, Visitor>::type
+              , typename Lambda::BOOST_NESTED_TEMPLATE apply<Op, State, Visitor>::type
             >::type compiler_type;
             
             typedef typename compiler_type::BOOST_NESTED_TEMPLATE apply
             <
-                Node
+                Op
               , State
               , Visitor
             >::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &state, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &visitor)
         {
-            typedef typename apply<Node, State, Visitor>::compiler_type compiler_type;
-            return compiler_type::call(node, state, visitor);
+            typedef typename apply<Op, State, Visitor>::compiler_type compiler_type;
+            return compiler_type::call(op, state, visitor);
         }
     };
 

Modified: boost/trunk/boost/xpressive/proto/compiler/transform.hpp
===================================================================
--- boost/trunk/boost/xpressive/proto/compiler/transform.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/proto/compiler/transform.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,8 +5,8 @@
 /// transformation is forwarded to the specified compiler, or to the
 /// default compiler for the resulting expression is no compiler is
 /// specified. Also included are some basic transforms, such as one that
-/// extracts the operand of a unary node, the left and right operands of
-/// a binary node, and a way to compose multiple transforms into one.
+/// extracts the operand of a unary op, the left and right operands of
+/// a binary op, and a way to compose multiple transforms into one.
 //
 //  Copyright 2004 Eric Niebler. Distributed under the Boost
 //  Software License, Version 1.0. (See accompanying file
@@ -29,22 +29,22 @@
     template<typename Lambda, typename DomainTag, typename Compiler>
     struct transform_compiler
     {
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         struct apply
         {
             typedef typename Compiler::BOOST_NESTED_TEMPLATE apply
             <
-                typename Lambda::BOOST_NESTED_TEMPLATE apply<Node, State, Visitor>::type
+                typename Lambda::BOOST_NESTED_TEMPLATE apply<Op, State, Visitor>::type
               , State
               , Visitor
             >::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &state, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &visitor)
         {
-            return Compiler::call(Lambda::call(node, state, visitor), state, visitor);
+            return Compiler::call(Lambda::call(op, state, visitor), state, visitor);
         }
     };
 
@@ -54,12 +54,12 @@
     template<typename Lambda, typename DomainTag>
     struct transform_compiler<Lambda, DomainTag, void>
     {
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         struct apply
         {
             typedef typename Lambda::BOOST_NESTED_TEMPLATE apply
             <
-                Node
+                Op
               , State
               , Visitor
             >::type trans_type;
@@ -74,11 +74,11 @@
             >::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &state, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &visitor)
         {
-            return proto::compile(Lambda::call(node, state, visitor), state, visitor, DomainTag());
+            return proto::compile(Lambda::call(op, state, visitor), state, visitor, DomainTag());
         }
     };
 
@@ -87,16 +87,16 @@
     //   pass through without doing a transform
     struct identity_transform
     {
-        template<typename Node, typename, typename>
+        template<typename Op, typename, typename>
         struct apply
         {
-            typedef Node type;
+            typedef Op type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static Node const &call(Node const &node, State const &, Visitor &)
+        template<typename Op, typename State, typename Visitor>
+        static Op const &call(Op const &op, State const &, Visitor &)
         {
-            return node;
+            return op;
         }
     };
 
@@ -104,17 +104,17 @@
     // arg_transform
     struct arg_transform
     {
-        template<typename Node, typename, typename>
+        template<typename Op, typename, typename>
         struct apply
         {
-            typedef typename arg_type<Node>::type type;
+            typedef typename arg_type<Op>::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename arg_type<Node>::reference
-        call(Node const &node, State const &, Visitor &)
+        template<typename Op, typename State, typename Visitor>
+        static typename arg_type<Op>::const_reference
+        call(Op const &op, State const &, Visitor &)
         {
-            return proto::arg(node);
+            return proto::arg(op);
         }
     };
 
@@ -122,17 +122,17 @@
     // left_transform
     struct left_transform
     {
-        template<typename Node, typename, typename>
+        template<typename Op, typename, typename>
         struct apply
         {
-            typedef typename left_type<Node>::type type;
+            typedef typename left_type<Op>::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename left_type<Node>::reference
-        call(Node const &node, State const &, Visitor &)
+        template<typename Op, typename State, typename Visitor>
+        static typename left_type<Op>::const_reference
+        call(Op const &op, State const &, Visitor &)
         {
-            return proto::left(node);
+            return proto::left(op);
         }
     };
 
@@ -140,17 +140,17 @@
     // right_transform
     struct right_transform
     {
-        template<typename Node, typename, typename>
+        template<typename Op, typename, typename>
         struct apply
         {
-            typedef typename right_type<Node>::type type;
+            typedef typename right_type<Op>::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename right_type<Node>::reference
-        call(Node const &node, State const &, Visitor &)
+        template<typename Op, typename State, typename Visitor>
+        static typename right_type<Op>::const_reference
+        call(Op const &op, State const &, Visitor &)
         {
-            return proto::right(node);
+            return proto::right(op);
         }
     };
 
@@ -160,17 +160,17 @@
     template<typename Tag>
     struct unary_op_transform
     {
-        template<typename Node, typename, typename>
+        template<typename Op, typename, typename>
         struct apply
         {
-            typedef unary_op<Node, Tag> type;
+            typedef unary_op<Op, Tag> type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static unary_op<Node, Tag>
-        call(Node const &node, State const &, Visitor &)
+        template<typename Op, typename State, typename Visitor>
+        static unary_op<Op, Tag>
+        call(Op const &op, State const &, Visitor &)
         {
-            return proto::make_op<Tag>(node);
+            return proto::make_op<Tag>(op);
         }
     };
 
@@ -180,22 +180,22 @@
     template<typename First, typename Second>
     struct compose_transforms
     {
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         struct apply
         {
             typedef typename Second::BOOST_NESTED_TEMPLATE apply
             <
-                typename First::BOOST_NESTED_TEMPLATE apply<Node, State, Visitor>::type
+                typename First::BOOST_NESTED_TEMPLATE apply<Op, State, Visitor>::type
               , State
               , Visitor
             >::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &state, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &visitor)
         {
-            return Second::call(First::call(node, state, visitor), state, visitor);
+            return Second::call(First::call(op, state, visitor), state, visitor);
         }
     };
 
@@ -205,29 +205,29 @@
     template<typename Predicate, typename IfTransform, typename ElseTransform>
     struct conditional_transform
     {
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         struct apply
         {
             typedef typename boost::mpl::if_
             <
-                typename Predicate::BOOST_NESTED_TEMPLATE apply<Node, State, Visitor>::type
+                typename Predicate::BOOST_NESTED_TEMPLATE apply<Op, State, Visitor>::type
               , IfTransform
               , ElseTransform
             >::type transform_type;
 
             typedef typename transform_type::BOOST_NESTED_TEMPLATE apply
             <
-                Node
+                Op
               , State
               , Visitor
             >::type type;
         };
 
-        template<typename Node, typename State, typename Visitor>
-        static typename apply<Node, State, Visitor>::type
-        call(Node const &node, State const &state, Visitor &visitor)
+        template<typename Op, typename State, typename Visitor>
+        static typename apply<Op, State, Visitor>::type
+        call(Op const &op, State const &state, Visitor &visitor)
         {
-            return apply<Node, State, Visitor>::transform_type::call(node, state, visitor);
+            return apply<Op, State, Visitor>::transform_type::call(op, state, visitor);
         }
     };
 
@@ -240,9 +240,9 @@
             typedef Always type;
         };
 
-        template<typename Node, typename State, typename Visitor>
+        template<typename Op, typename State, typename Visitor>
         static Always
-        call(Node const &, State const &, Visitor &)
+        call(Op const &, State const &, Visitor &)
         {
             return Always();
         }

Deleted: boost/trunk/boost/xpressive/proto/fusion.hpp
===================================================================
--- boost/trunk/boost/xpressive/proto/fusion.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/proto/fusion.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,383 +0,0 @@
-///////////////////////////////////////////////////////////////////////////////
-/// \file fusion.hpp
-/// Make a binary proto parse tree a valid Fusion sequence
-//
-//  Copyright 2004 Eric Niebler. Distributed under the Boost
-//  Software License, Version 1.0. (See accompanying file
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef BOOST_PROTO_FUSION_HPP_EAN_04_29_2006
-#define BOOST_PROTO_FUSION_HPP_EAN_04_29_2006
-
-#include <boost/xpressive/proto/proto.hpp>
-#include <boost/type_traits/remove_cv.hpp>
-#include <boost/type_traits/remove_reference.hpp>
-
-#ifdef BOOST_PROTO_FUSION_V2
-# include <boost/fusion/support/tags.hpp>
-# include <boost/fusion/support/is_view.hpp>
-# include <boost/fusion/support/category_of.hpp>
-# include <boost/fusion/sequence/container/list/cons.hpp>
-#else
-# include <boost/spirit/fusion/sequence/cons.hpp>
-#endif
-
-namespace boost { namespace proto
-{
-    template<typename OpTag>
-    struct expand_left_tag
-    {};
-
-    template<typename OpTag, typename Node, typename State = fusion::nil>
-    struct expand_left_view
-      : compile_result<Node, State, mpl::void_, expand_left_tag<OpTag> >
-    {};
-
-    template<typename OpTag, typename Node, typename State>
-    typename expand_left_view<OpTag, Node, State>::type
-    expand_left(Node const &node, State const &state)
-    {
-        mpl::void_ null;
-        return compile(node, state, null, expand_left_tag<OpTag>());
-    }
-
-    template<typename OpTag, typename Node>
-    typename expand_left_view<OpTag, Node>::type
-    expand_left(Node const &node)
-    {
-        return expand_left<OpTag>(node, fusion::nil());
-    }
-
-    struct binary_tree_iterator_tag;
-
-    template<typename Cons>
-    struct binary_tree_iterator
-      : fusion::iterator_base<binary_tree_iterator<Cons> >
-    {
-        typedef binary_tree_iterator_tag tag;   // for Fusion 1
-        typedef binary_tree_iterator_tag ftag;  // for Fusion 2
-        #ifdef BOOST_PROTO_FUSION_V2
-        typedef fusion::forward_traversal_tag category;
-        #else
-        typedef mpl::forward_iterator_tag category;
-        #endif
-
-        typedef typename Cons::car_type car_type;
-        typedef typename Cons::cdr_type cdr_type;
-
-        explicit binary_tree_iterator(Cons const &cons_)
-          : cons(cons_)
-        {}
-
-        car_type car() const { return this->cons.car; };
-        cdr_type const &cdr() const { return this->cons.cdr; };
-
-    private:
-        Cons cons;
-    };
-
-    namespace binary_tree_detail
-    {
-        template<typename DomainTag>
-        struct expand_left_compiler
-        {
-            template<typename Node, typename State, typename Visitor>
-            struct apply
-              : compile_result<
-                    typename left_type<Node>::type
-                  , fusion::cons<Node const &, State>
-                  , Visitor
-                  , DomainTag
-                >
-            {};
-
-            template<typename Node, typename State, typename Visitor>
-            static typename apply<Node, State, Visitor>::type
-            call(Node const &node, State const &state, Visitor &visitor)
-            {
-                return proto::compile(
-                    proto::left(node)
-                  , fusion::cons<Node const &, State>(node, state)
-                  , visitor
-                  , DomainTag()
-                );
-            }
-        };
-
-        struct cons_ref_compiler
-        {
-            template<typename Node, typename State, typename Visitor>
-            struct apply
-            {
-                typedef fusion::cons<Node const &, State> type;
-            };
-
-            template<typename Node, typename State, typename Visitor>
-            static fusion::cons<Node const &, State>
-            call(Node const &node, State const &state, Visitor &)
-            {
-                return fusion::cons<Node const &, State>(node, state);
-            }
-        };
-
-        template<typename Sequence>
-        struct begin_impl
-        {
-            typedef typename tag_type<Sequence>::type tag_type;
-            typedef binary_tree_iterator<typename expand_left_view<tag_type, Sequence>::type> type;
-
-            static type call(Sequence const &node)
-            {
-                return type(expand_left<tag_type>(node));
-            }
-        };
-
-        struct end_impl
-        {
-            typedef binary_tree_iterator<fusion::nil> type;
-
-            template<typename Sequence>
-            static type call(Sequence const &)
-            {
-                return type(fusion::nil());
-            }
-        };
-
-        template<typename Iterator>
-        struct value_impl
-          : remove_cv<typename remove_reference<typename Iterator::car_type>::type>
-        {};
-
-        // discards the old head, expands the right child of the new head
-        // and pushes the result to the head of the list.
-        template<typename Iterator, typename Parents = typename Iterator::cdr_type>
-        struct next_impl
-        {
-            typedef typename value_impl<Parents>::type node_type;
-            typedef typename tag_type<node_type>::type tag_type;
-            typedef typename right_type<node_type>::type right_type;
-            typedef binary_tree_iterator<
-                typename expand_left_view<tag_type, right_type, typename Parents::cdr_type>::type
-            > type;
-
-            static type call(Iterator const &it)
-            {
-                return type(expand_left<tag_type>(proto::right(it.cdr().car), it.cdr().cdr));
-            }
-        };
-
-        template<typename Iterator>
-        struct next_impl<Iterator, fusion::nil> // no more parents, end of tree traversal
-          : end_impl
-        {};
-
-        template<typename Iterator>
-        struct deref_impl
-        {
-            typedef typename Iterator::car_type type;
-
-            static type call(Iterator const &it)
-            {
-                return it.car();
-            }
-        };
-    } // namespace binary_tree_detail
-
-    template<typename OpTag>
-    struct compiler<OpTag, expand_left_tag<OpTag> >
-      : binary_tree_detail::expand_left_compiler<expand_left_tag<OpTag> >
-    {};
-
-    template<typename OpTag, typename OtherOpTag>
-    struct compiler<OtherOpTag, expand_left_tag<OpTag> >
-      : binary_tree_detail::cons_ref_compiler
-    {};
-
-}}
-
-#ifdef BOOST_PROTO_FUSION_V2
-
-namespace boost { namespace fusion { namespace extension
-{
-    template<typename OpTag>
-    struct is_sequence_impl<proto::tag<OpTag> >
-    {
-        template<typename T>
-        struct apply : mpl::true_ {};
-    };
-
-    template<typename OpTag>
-    struct is_view_impl<proto::tag<OpTag> >
-    {
-        template<typename T>
-        struct apply : mpl::false_ {};
-    };
-
-    template<typename OpTag>
-    struct category_of_impl<proto::tag<OpTag> >
-    {
-        template<typename T>
-        struct apply
-        {
-            typedef forward_sequence_tag type;
-        };
-    };
-
-    template<typename OpTag>
-    struct begin_impl<proto::tag<OpTag> >
-    {
-        template<typename Sequence>
-        struct apply
-          : proto::binary_tree_detail::begin_impl<Sequence>
-        {};
-    };
-
-    template<typename OpTag>
-    struct end_impl<proto::tag<OpTag> >
-    {
-        template<typename Sequence>
-        struct apply
-          : proto::binary_tree_detail::end_impl
-        {};
-    };
-
-    template<>
-    struct value_of_impl<proto::binary_tree_iterator_tag>
-    {
-        template<typename Iterator>
-        struct apply
-          : proto::binary_tree_detail::value_impl<Iterator>
-        {};
-    };
-
-    template<>
-    struct deref_impl<proto::binary_tree_iterator_tag>
-    {
-        template<typename Iterator>
-        struct apply
-          : proto::binary_tree_detail::deref_impl<Iterator>
-        {};
-    };
-
-    template<>
-    struct next_impl<proto::binary_tree_iterator_tag>
-    {
-        template<typename Iterator>
-        struct apply
-          : proto::binary_tree_detail::next_impl<Iterator>
-        {};
-    };
-
-}}}
-
-namespace boost { namespace mpl
-{
-    template<typename OpTag>
-    struct begin_impl<proto::tag<OpTag> >
-      : fusion::extension::begin_impl<proto::tag<OpTag> >
-    {
-    };
-
-    template<typename OpTag>
-    struct end_impl<proto::tag<OpTag> >
-      : fusion::extension::end_impl<proto::tag<OpTag> >
-    {
-    };
-
-    template<typename Cons>
-    struct next<proto::binary_tree_iterator<Cons> >
-      : proto::binary_tree_detail::next_impl<proto::binary_tree_iterator<Cons> >
-    {
-    };
-
-    template<typename Cons>
-    struct deref<proto::binary_tree_iterator<Cons> >
-      : proto::binary_tree_detail::value_impl<proto::binary_tree_iterator<Cons> >
-    {
-    };
-
-}} // namespace boost::mpl
-
-
-#else
-
-namespace boost { namespace fusion { namespace meta
-{
-    template<typename OpTag>
-    struct begin_impl<proto::tag<OpTag> >
-    {
-        template<typename Sequence>
-        struct apply
-          : proto::binary_tree_detail::begin_impl<Sequence>
-        {};
-    };
-
-    template<typename OpTag>
-    struct end_impl<proto::tag<OpTag> >
-    {
-        template<typename Sequence>
-        struct apply
-          : proto::binary_tree_detail::end_impl
-        {};
-    };
-
-    template<>
-    struct value_impl<proto::binary_tree_iterator_tag>
-    {
-        template<typename Iterator>
-        struct apply
-          : proto::binary_tree_detail::value_impl<Iterator>
-        {};
-    };
-
-    template<>
-    struct next_impl<proto::binary_tree_iterator_tag>
-    {
-        template<typename Iterator>
-        struct apply
-          : proto::binary_tree_detail::next_impl<Iterator>
-        {};
-    };
-
-    template<>
-    struct deref_impl<proto::binary_tree_iterator_tag>
-    {
-        template<typename Iterator>
-        struct apply
-          : proto::binary_tree_detail::deref_impl<Iterator>
-        {};
-    };
-
-}}}
-
-namespace boost { namespace mpl
-{
-    template<typename OpTag>
-    struct begin_impl<proto::tag<OpTag> >
-      : fusion::meta::begin_impl<proto::tag<OpTag> >
-    {
-    };
-
-    template<typename OpTag>
-    struct end_impl<proto::tag<OpTag> >
-      : fusion::meta::end_impl<proto::tag<OpTag> >
-    {
-    };
-
-    template<typename Cons>
-    struct next<proto::binary_tree_iterator<Cons> >
-      : proto::binary_tree_detail::next_impl<proto::binary_tree_iterator<Cons> >
-    {
-    };
-
-    template<typename Cons>
-    struct deref<proto::binary_tree_iterator<Cons> >
-      : proto::binary_tree_detail::value_impl<proto::binary_tree_iterator<Cons> >
-    {
-    };
-
-}} // namespace boost::mpl
-
-#endif
-
-#endif

Modified: boost/trunk/boost/xpressive/proto/op_base.hpp
===================================================================
--- boost/trunk/boost/xpressive/proto/op_base.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/proto/op_base.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 ///////////////////////////////////////////////////////////////////////////////
-/// /file op_base.hpp
-/// Contains definitions of unary_op/</>, binary_op/</> and nary_op/</>,
-/// as well as the is_op/</> and the make_op() helper function.
+/// \file op_base.hpp
+/// Contains definitions of unary_op\<\>, binary_op\<\> and nary_op\<\>,
+/// as well as the is_op\<\> and the make_op() helper function.
 //
 //  Copyright 2004 Eric Niebler. Distributed under the Boost
 //  Software License, Version 1.0. (See accompanying file
@@ -10,12 +10,10 @@
 #ifndef BOOST_PROTO_OP_BASE_HPP_EAN_04_01_2005
 #define BOOST_PROTO_OP_BASE_HPP_EAN_04_01_2005
 
-#include <boost/ref.hpp>
 #include <boost/mpl/if.hpp>
 #include <boost/mpl/or.hpp>
 #include <boost/preprocessor/arithmetic/inc.hpp>
 #include <boost/preprocessor/facilities/intercept.hpp>
-#include <boost/preprocessor/punctuation/paren.hpp>
 #include <boost/preprocessor/repetition/enum_params.hpp>
 #include <boost/preprocessor/repetition/enum_trailing_params.hpp>
 #include <boost/preprocessor/repetition/enum_binary_params.hpp>
@@ -23,31 +21,17 @@
 #include <boost/preprocessor/repetition/repeat.hpp>
 #include <boost/preprocessor/repetition/repeat_from_to.hpp>
 #include <boost/type_traits/is_same.hpp>
-#include <boost/type_traits/remove_reference.hpp>
 #include <boost/type_traits/is_base_and_derived.hpp>
+#include <boost/spirit/fusion/sequence/tuple.hpp>
 #include <boost/xpressive/proto/proto_fwd.hpp>
 #include <boost/xpressive/proto/arg_traits.hpp>
 
-#ifdef BOOST_PROTO_FUSION_V2
-# include <boost/fusion/tuple.hpp>
-# include <boost/fusion/support/sequence_base.hpp>
-# include <boost/fusion/sequence/view/single_view.hpp>
-# include <boost/fusion/sequence/container/vector/vector10.hpp>
-# define BOOST_PROTO_VECTOR2 fusion::vector2
-#else
-# include <boost/spirit/fusion/sequence/detail/sequence_base.hpp>
-# include <boost/spirit/fusion/sequence/tuple.hpp>
-# include <boost/spirit/fusion/sequence/single_view.hpp>
-# include <boost/spirit/fusion/sequence/tuple10.hpp>
-# define BOOST_PROTO_VECTOR2 fusion::tuple2
-#endif
-
 namespace boost { namespace proto
 {
 
     ///////////////////////////////////////////////////////////////////////////////
     // op_root
-    struct op_root : fusion::sequence_root
+    struct op_root
     {
     };
 
@@ -56,106 +40,94 @@
     template<typename T>
     struct is_proxy
       : mpl::false_
-    {};
+    {
+    };
 
-    template<typename Node, typename Param>
-    struct is_proxy<op_proxy<Node, Param> >
+    template<typename Op, typename Param>
+    struct is_proxy<op_proxy<Op, Param> >
       : mpl::true_
-    {};
+    {
+    };
 
     ///////////////////////////////////////////////////////////////////////////////
     // is_op
     template<typename T>
     struct is_op
       : mpl::or_<is_proxy<T>, is_base_and_derived<op_root, T> >
-    {};
+    {
+    };
 
-    template<typename T>
-    struct is_op<T &>
-      : is_op<T>
-    {};
-
     ///////////////////////////////////////////////////////////////////////////////
     // as_op
-    template<typename Node>
-    struct as_op<Node, true>
+    template<typename Op>
+    struct as_op<Op, true>
     {
-        typedef typename Node::type type;
-        typedef typename Node::reference reference;
+        typedef typename Op::type type;
 
-        static reference make(Node const &node)
+        static typename Op::const_reference make(Op const &op)
         {
-            return node.cast();
+            return op.cast();
         }
     };
 
     template<typename T>
     struct as_op<T, false>
     {
-        typedef unary_op<typename call_traits<T>::param_type, noop_tag> type;
-        typedef type const reference;
+        typedef unary_op<T, noop_tag> type;
 
-        static reference make(T const &t)
+        static type const make(T const &t)
         {
-            return type(t);
+            return noop(t);
         }
     };
 
 // These operators must be members.
 #define BOOST_PROTO_DEFINE_MEMBER_OPS()                                                         \
     template<typename Arg>                                                                      \
-    binary_op<reference, typename as_op<Arg>::reference, assign_tag> const                      \
+    binary_op<Op, typename as_op<Arg>::type, assign_tag> const                                  \
     operator =(Arg const &arg) const                                                            \
     {                                                                                           \
-        return binary_op<reference, typename as_op<Arg>::reference, assign_tag>(                \
-            this->cast(), as_op<Arg>::make(arg));                                               \
+        return make_op<assign_tag>(this->cast(), as_op<Arg>::make(arg));                        \
     }                                                                                           \
     template<typename Arg>                                                                      \
-    binary_op<reference, typename as_op<Arg>::reference, subscript_tag> const                   \
+    binary_op<Op, typename as_op<Arg>::type, subscript_tag> const                               \
     operator [](Arg const &arg) const                                                           \
     {                                                                                           \
-        return binary_op<reference, typename as_op<Arg>::reference, subscript_tag>(             \
-            this->cast(), as_op<Arg>::make(arg));                                               \
+        return make_op<subscript_tag>(this->cast(), as_op<Arg>::make(arg));                     \
     }                                                                                           \
-    nary_op<reference> operator ()() const                                                      \
+    nary_op<Op> operator ()() const                                                             \
     {                                                                                           \
-        return nary_op<reference>(this->cast());                                                \
+        return nary_op<Op>(this->cast());                                                       \
     }                                                                                           \
     BOOST_PP_REPEAT_FROM_TO(1, BOOST_PP_INC(BOOST_PROTO_MAX_ARITY), BOOST_PROTO_FUN_OP, _)
 
-#define BOOST_PROTO_AS_OP_FUN(z, n, _)                                                          \
-    , as_op<BOOST_PP_CAT(A, n)>::make(BOOST_PP_CAT(a, n))
-
 #define BOOST_PROTO_FUN_OP(z, n, _)                                                             \
     template<BOOST_PP_ENUM_PARAMS_Z(z, n, typename A)>                                          \
-    nary_op<reference                                                                           \
-        BOOST_PP_ENUM_TRAILING_BINARY_PARAMS_Z(                                                 \
-            z, n, typename as_op<A, >::reference BOOST_PP_INTERCEPT)>                           \
+    nary_op<Op BOOST_PP_ENUM_TRAILING_PARAMS_Z(z, n, A)>                                        \
     operator ()(BOOST_PP_ENUM_BINARY_PARAMS_Z(z, n, A, const &a)) const                         \
     {                                                                                           \
-        return nary_op<reference                                                                \
-            BOOST_PP_ENUM_TRAILING_BINARY_PARAMS_Z(                                             \
-                z, n, typename as_op<A, >::reference BOOST_PP_INTERCEPT)>                       \
-            (this->cast() BOOST_PP_REPEAT_ ## z(n, BOOST_PROTO_AS_OP_FUN, _));                  \
+        return nary_op<Op BOOST_PP_ENUM_TRAILING_PARAMS_Z(z, n, A)>                             \
+            (this->cast() BOOST_PP_ENUM_TRAILING_PARAMS_Z(z, n, a));                            \
     }
 
-    template<typename Tag>
-    struct tag
-    {};
-
     ///////////////////////////////////////////////////////////////////////////////
     // op_base
-    template<typename Node>
+    template<typename Op>
     struct op_base : op_root
     {
-        typedef Node type;
-        typedef type const &reference;
+        typedef Op type;
+        typedef type const &const_reference;
 
-        reference cast() const
+        Op &cast()
         {
-            return *static_cast<Node const *>(this);
+            return *static_cast<Op *>(this);
         }
 
+        Op const &cast() const
+        {
+            return *static_cast<Op const *>(this);
+        }
+
         BOOST_PROTO_DEFINE_MEMBER_OPS()
     };
 
@@ -164,118 +136,47 @@
     template<typename Arg, typename Tag>
     struct unary_op : op_base<unary_op<Arg, Tag> >
     {
-        typedef Arg arg_type;
+        typedef typename value_type<Arg>::type arg_type;
         typedef Tag tag_type;
-        typedef tag<Tag> ftag; // for Fusion-2 compatibility
-        typedef tag<Tag> tag;  // for Fusion-1 compatibility
 
-        typedef fusion::single_view<arg_type> arg_view;
-        arg_view child;
+        arg_type arg;
 
         unary_op()
-          : child()
+          : arg()
         {}
 
-        explicit unary_op(typename call_traits<arg_type>::param_type arg)
-          : child(arg_view(arg))
+        explicit unary_op(typename call_traits<Arg>::param_type arg_)
+          : arg(arg_)
         {}
 
-        unary_op(unary_op<Arg, Tag> const &that)
-          : child(that.child)
-        {}
-
-        template<typename OtherArg>
-        unary_op(unary_op<OtherArg, Tag> const &that)
-          : child(arg_view(proto::arg(that)))
-        {}
-
-        using op_base<unary_op>::operator =;
+        using op_base<unary_op<Arg, Tag> >::operator =;
     };
 
-    struct binary_segmented_view_tag;
-
-    // A segmented view of a binary proto parse tree
-    template<typename Node>
-    struct binary_segmented_view
-      : fusion::sequence_base<binary_segmented_view<Node> >
-    {
-        typedef Node node_type;
-        typedef typename remove_reference<Node>::type::children_type const &children_type;
-        typedef binary_segmented_view_tag tag;
-        typedef binary_segmented_view_tag ftag;
-
-        explicit binary_segmented_view(typename call_traits<Node>::param_type node)
-          : val(node)
-        {}
-
-        Node node() const
-        {
-            return this->val;
-        }
-
-        children_type children() const
-        {
-            return this->val.children;
-        }
-
-        Node val;
-    };
-
-    template<typename Node>
-    binary_segmented_view<Node const &> make_segmented_view(Node const &node)
-    {
-        return binary_segmented_view<Node const &>(node);
-    }
-
     ///////////////////////////////////////////////////////////////////////////////
     // binary_op
     template<typename Left, typename Right, typename Tag>
     struct binary_op : op_base<binary_op<Left, Right, Tag> >
     {
-        typedef Left left_type;
-        typedef Right right_type;
-        typedef typename tag_type<left_type>::type left_tag;
-        typedef typename tag_type<right_type>::type right_tag;
+        typedef typename value_type<Left>::type left_type;
+        typedef typename value_type<Right>::type right_type;
         typedef Tag tag_type;
-        typedef tag<Tag> ftag; // for Fusion-2 compatibility
-        typedef tag<Tag> tag;  // for Fusion-1 compatibility
 
-        typedef typename mpl::if_<
-            is_same<Tag, left_tag>
-          , binary_segmented_view<left_type>
-          , fusion::single_view<left_type>
-        >::type left_view;
+        left_type left;
+        right_type right;
 
-        typedef typename mpl::if_<
-            is_same<Tag, right_tag>
-          , binary_segmented_view<right_type>
-          , fusion::single_view<right_type>
-        >::type right_view;
-
-        typedef BOOST_PROTO_VECTOR2<left_view, right_view> children_type;
-        children_type children;
-
         binary_op()
-          : children()
+          : left()
+          , right()
         {}
 
         binary_op(
-            typename call_traits<Left>::param_type left
-          , typename call_traits<Right>::param_type right
-        )
-          : children(left_view(left), right_view(right))
+            typename call_traits<Left>::param_type left_
+          , typename call_traits<Right>::param_type right_)
+          : left(left_)
+          , right(right_)
         {}
 
-        binary_op(binary_op<Left, Right, Tag> const &that)
-          : children(that.children)
-        {}
-
-        template<typename OtherLeft, typename OtherRight>
-        binary_op(binary_op<OtherLeft, OtherRight, Tag> const &that)
-          : children(left_view(proto::left(that)), right_view(proto::right(that)))
-        {}
-
-        using op_base<binary_op>::operator =;
+        using op_base<binary_op<Left, Right, Tag> >::operator =;
     };
 
     ///////////////////////////////////////////////////////////////////////////////
@@ -285,11 +186,10 @@
       : op_base<nary_op<Fun, BOOST_PP_ENUM_PARAMS(BOOST_PROTO_MAX_ARITY, A)> >
     {
         typedef function_tag tag_type;
-        typedef tag<function_tag> ftag; // for Fusion-2 compatibility
-        typedef tag<function_tag> tag;  // for Fusion-1 compatibility
         typedef Fun functor_type;
         typedef fusion::tuple<
-            BOOST_PP_ENUM_PARAMS(BOOST_PROTO_MAX_ARITY, A)
+            BOOST_PP_ENUM_BINARY_PARAMS(
+                BOOST_PROTO_MAX_ARITY, typename value_type<A, >::type BOOST_PP_INTERCEPT)
         > args_type;
 
         functor_type functor;
@@ -312,35 +212,24 @@
 
     #undef BOOST_PROTO_NARY_OP_CTOR
 
-        nary_op(nary_op const &that)
-          : functor(that.functor)
-          , args(that.args)
-        {}
-
-        template<typename OtherFun, BOOST_PP_ENUM_PARAMS(BOOST_PROTO_MAX_ARITY, typename O)>
-        nary_op(nary_op<OtherFun, BOOST_PP_ENUM_PARAMS(BOOST_PROTO_MAX_ARITY, O)> const &that)
-          : functor(that.functor)
-          , args(that.args)
-        {}
-
-        using op_base<nary_op>::operator =;
+        using op_base<nary_op<Fun, BOOST_PP_ENUM_PARAMS(BOOST_PROTO_MAX_ARITY, A)> >::operator =;
     };
 
     ///////////////////////////////////////////////////////////////////////////////
     // op_proxy
-    template<typename Node, typename Param>
+    template<typename Op, typename Param>
     struct op_proxy
     {
-        typedef Node type;
-        typedef type const reference;
+        typedef Op type;
+        typedef type const const_reference;
         Param param_;
 
-        Node const cast() const
+        Op const cast() const
         {
-            return Node(this->param_);
+            return Op(this->param_);
         }
 
-        operator Node const() const
+        operator Op const() const
         {
             return this->cast();
         }
@@ -348,18 +237,18 @@
         BOOST_PROTO_DEFINE_MEMBER_OPS()
     };
 
-    template<typename Node>
-    struct op_proxy<Node, void>
+    template<typename Op>
+    struct op_proxy<Op, void>
     {
-        typedef Node type;
-        typedef type const reference;
+        typedef Op type;
+        typedef type const const_reference;
 
-        Node const cast() const
+        Op const cast() const
         {
-            return Node();
+            return Op();
         }
 
-        operator Node const() const
+        operator Op const() const
         {
             return this->cast();
         }
@@ -368,51 +257,23 @@
     };
 
     ///////////////////////////////////////////////////////////////////////////////
-    // make_op (unary)
-    template<typename Node, typename Arg>
-    unary_op<Arg, Node> const
+    // make_op
+    template<typename Op, typename Arg>
+    unary_op<Arg, Op> const
     make_op(Arg const &arg)
     {
-        return unary_op<Arg, Node>(arg);
+        return unary_op<Arg, Op>(arg);
     }
 
-    template<typename Node, typename Arg>
-    unary_op<Arg &, Node> const
-    make_op(reference_wrapper<Arg> const &arg)
-    {
-        return unary_op<Arg &, Node>(arg.get());
-    }
-
     ///////////////////////////////////////////////////////////////////////////////
-    // make_op (binary)
-    template<typename Node, typename Left, typename Right>
-    binary_op<Left, Right, Node> const
+    // make_op
+    template<typename Op, typename Left, typename Right>
+    binary_op<Left, Right, Op> const
     make_op(Left const &left, Right const &right)
     {
-        return binary_op<Left, Right, Node>(left, right);
+        return binary_op<Left, Right, Op>(left, right);
     }
 
-    template<typename Node, typename Left, typename Right>
-    binary_op<Left &, Right, Node> const
-    make_op(reference_wrapper<Left> const &left, Right const &right)
-    {
-        return binary_op<Left &, Right, Node>(left.get(), right);
-    }
-
-    template<typename Node, typename Left, typename Right>
-    binary_op<Left, Right &, Node> const
-    make_op(Left const &left, reference_wrapper<Right> const &right)
-    {
-        return binary_op<Left, Right &, Node>(left, right.get());
-    }
-
-    template<typename Node, typename Left, typename Right>
-    binary_op<Left &, Right &, Node> const
-    make_op(reference_wrapper<Left> const &left, reference_wrapper<Right> const &right)
-    {
-        return binary_op<Left &, Right &, Node>(left.get(), right.get());
-    }
-
 }}
 
 #endif

Modified: boost/trunk/boost/xpressive/proto/op_tags.hpp
===================================================================
--- boost/trunk/boost/xpressive/proto/op_tags.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/proto/op_tags.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -71,6 +71,30 @@
 
     struct function_tag : nary_tag {};
 
+    ///////////////////////////////////////////////////////////////////////////////
+    // is_unary
+    template<typename Tag>
+    struct is_unary
+      : boost::is_base_and_derived<unary_tag, Tag>
+    {
+    };
+
+    ///////////////////////////////////////////////////////////////////////////////
+    // is_binary
+    template<typename Tag>
+    struct is_binary
+      : boost::is_base_and_derived<binary_tag, Tag>
+    {
+    };
+
+    ///////////////////////////////////////////////////////////////////////////////
+    // is_nary
+    template<typename Tag>
+    struct is_nary
+      : boost::is_base_and_derived<nary_tag, Tag>
+    {
+    };
+
 }}
 
 #endif

Modified: boost/trunk/boost/xpressive/proto/operators.hpp
===================================================================
--- boost/trunk/boost/xpressive/proto/operators.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/proto/operators.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -25,7 +25,7 @@
     struct unary_op_generator
     {
         typedef unary_op<
-            typename as_op<Arg>::reference
+            typename as_op<Arg>::type
           , Tag
         > type;
     };
@@ -36,8 +36,8 @@
     struct binary_op_generator
     {
         typedef binary_op<
-            typename as_op<Left>::reference
-          , typename as_op<Right>::reference
+            typename as_op<Left>::type
+          , typename as_op<Right>::type
           , Tag
         > type;
     };
@@ -45,31 +45,29 @@
     ///////////////////////////////////////////////////////////////////////////////
     // unary operators
     template<typename Arg>
-    typename as_op<Arg>::reference
+    unary_op<Arg, noop_tag> const
     noop(Arg const &arg)
     {
-        BOOST_MPL_ASSERT_NOT((is_op<Arg>));
-        return as_op<Arg>::make(arg);
+        return make_op<noop_tag>(arg);
     }
 
-#define BOOST_PROTO_UNARY_OP(node, tag)                                                         \
+#define BOOST_PROTO_UNARY_OP(op, tag)                                                           \
     template<typename Arg>                                                                      \
     inline typename lazy_enable_if<is_op<Arg>, unary_op_generator<Arg, tag> >::type const       \
-    operator node(Arg const &arg)                                                               \
+    operator op(Arg const &arg)                                                                 \
     {                                                                                           \
-        return typename unary_op_generator<Arg, tag>::type(as_op<Arg>::make(arg));              \
+        return make_op<tag>(as_op<Arg>::make(arg));                                             \
     }
 
-#define BOOST_PROTO_BINARY_OP(node, tag)                                                        \
+#define BOOST_PROTO_BINARY_OP(op, tag)                                                          \
     template<typename Left, typename Right>                                                     \
     inline typename lazy_enable_if<                                                             \
         mpl::or_<is_op<Left>, is_op<Right> >                                                    \
       , binary_op_generator<Left, Right, tag>                                                   \
     >::type const                                                                               \
-    operator node(Left const &left, Right const &right)                                         \
+    operator op(Left const &left, Right const &right)                                           \
     {                                                                                           \
-        return typename binary_op_generator<Left, Right, tag>::type(                            \
-            as_op<Left>::make(left), as_op<Right>::make(right));                                \
+        return make_op<tag>(as_op<Left>::make(left), as_op<Right>::make(right));                \
     }
 
     BOOST_PROTO_UNARY_OP(+, unary_plus_tag)
@@ -122,14 +120,14 @@
     inline typename lazy_enable_if<is_op<Arg>, unary_op_generator<Arg, post_inc_tag> >::type const
     operator ++(Arg const &arg, int)
     {
-        return typename unary_op_generator<Arg, post_inc_tag>::type(arg.cast());
+        return make_op<post_inc_tag>(arg.cast());
     }
 
     template<typename Arg>
     inline typename lazy_enable_if<is_op<Arg>, unary_op_generator<Arg, post_dec_tag> >::type const
     operator --(Arg const &arg, int)
     {
-        return typename unary_op_generator<Arg, post_dec_tag>::type(arg.cast());
+        return make_op<post_dec_tag>(arg.cast());
     }
 
 }}

Modified: boost/trunk/boost/xpressive/proto/proto.hpp
===================================================================
--- boost/trunk/boost/xpressive/proto/proto.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/proto/proto.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,49 +19,26 @@
 {
     ///////////////////////////////////////////////////////////////////////////////
     // compile_result
-    template<typename Node, typename State, typename Visitor, typename DomainTag>
+    template<typename Op, typename State, typename Visitor, typename DomainTag>
     struct compile_result
     {
-        typedef typename as_op<Node>::type op_type;
-        typedef compiler<typename tag_type<op_type>::type, DomainTag> compiler;
-        typedef typename compiler::BOOST_NESTED_TEMPLATE apply<op_type, State, Visitor>::type type;
+        typedef typename as_op<Op>::type op_type;
+        typedef typename tag_type<op_type>::type tag_type;
+        typedef compiler<tag_type, DomainTag> compiler_type;
+        typedef typename compiler_type::BOOST_NESTED_TEMPLATE apply<op_type, State, Visitor>::type type;
     };
 
     ///////////////////////////////////////////////////////////////////////////////
     // compile
-    template<typename Node, typename State, typename Visitor, typename DomainTag>
-    typename compile_result<Node, State, Visitor, DomainTag>::type const
-    compile(Node const &node, State const &state, Visitor &visitor, DomainTag)
+    template<typename Op, typename State, typename Visitor, typename DomainTag>
+    typename compile_result<Op, State, Visitor, DomainTag>::type const
+    compile(Op const &op, State const &state, Visitor &visitor, DomainTag)
     {
-        typedef typename as_op<Node>::type op_type;
+        typedef typename as_op<Op>::type op_type;
         typedef compiler<typename tag_type<op_type>::type, DomainTag> compiler;
-        return compiler::call(as_op<Node>::make(node), state, visitor);
+        return compiler::call(as_op<Op>::make(op), state, visitor);
     }
 
-    ///////////////////////////////////////////////////////////////////////////////
-    // literal, for storing and naming proto-ified constants.
-    template<typename T>
-    struct literal
-      : unary_op<T, proto::noop_tag>
-    {
-        literal(T const &t)
-          : unary_op<T, noop_tag>(t)
-        {}
-
-        template<typename U>
-        literal(literal<U> const &that)
-          : unary_op<T, noop_tag>(that.arg)
-        {}
-    };
-
-    ///////////////////////////////////////////////////////////////////////////////
-    // lit(), for creating proto literals
-    template<typename T>
-    literal<T> lit(T const &t)
-    {
-        return literal<T>(t);
-    }
-
 }} // namespace boost::proto
 
 #endif

Modified: boost/trunk/boost/xpressive/proto/proto_fwd.hpp
===================================================================
--- boost/trunk/boost/xpressive/proto/proto_fwd.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/proto/proto_fwd.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,26 +11,15 @@
 
 #include <boost/mpl/bool.hpp>
 #include <boost/mpl/apply_fwd.hpp>
+#include <boost/spirit/fusion/sequence/tuple_forward.hpp>
 #include <boost/preprocessor/repetition/enum_params_with_a_default.hpp>
 
-#ifdef BOOST_PROTO_FUSION_V2
-# include <boost/fusion/tuple/tuple_fwd.hpp>
-# define FUSION_MAX_TUPLE_SIZE FUSION_MAX_VECTOR_SIZE
-#else
-# include <boost/spirit/fusion/sequence/tuple_forward.hpp>
-#endif
-
 #ifndef BOOST_PROTO_MAX_ARITY
 # define BOOST_PROTO_MAX_ARITY FUSION_MAX_TUPLE_SIZE
 #endif
 
 namespace boost { namespace proto
 {
-    #ifdef BOOST_PROTO_FUSION_V2
-    typedef fusion::void_ void_;
-    #else
-    typedef fusion::void_t void_;
-    #endif
 
     ///////////////////////////////////////////////////////////////////////////////
     // Operator tags
@@ -95,22 +84,34 @@
     template<typename Tag>
     struct is_nary;
 
-    template<typename Arg, typename Node>
+    template<typename Arg, typename Op>
     struct unary_op;
 
-    template<typename Left, typename Right, typename Node>
+    template<typename Left, typename Right, typename Op>
     struct binary_op;
 
-    template<typename Node, typename Param = void>
+    template<typename Op, typename Param = void>
     struct op_proxy;
 
     template
     <
         typename Fun
-      , BOOST_PP_ENUM_PARAMS_WITH_A_DEFAULT(BOOST_PROTO_MAX_ARITY, typename A, void_)
+      , BOOST_PP_ENUM_PARAMS_WITH_A_DEFAULT(BOOST_PROTO_MAX_ARITY, typename A, fusion::void_t)
     >
     struct nary_op;
 
+    template<typename Op, typename Arg>
+    unary_op<Arg, Op> const
+    make_op(Arg const &arg);
+
+    template<typename Op, typename Left, typename Right>
+    binary_op<Left, Right, Op> const
+    make_op(Left const &left, Right const &right);
+
+    template<typename Arg>
+    unary_op<Arg, noop_tag> const
+    noop(Arg const &arg);
+
     struct op_root;
 
     template<typename T>
@@ -122,42 +123,30 @@
     template<typename T, bool IsOp = is_op<T>::value>
     struct as_op;
 
-    template<typename Node>
+    template<typename Op>
     struct op_base;
 
-    template<typename Node, typename Arg>
-    unary_op<Arg, Node> const
-    make_op(Arg const &arg);
+    template<typename T>
+    struct value_type;
 
-    template<typename Node, typename Left, typename Right>
-    binary_op<Left, Right, Node> const
-    make_op(Left const &left, Right const &right);
-
-    template<typename Arg>
-    typename as_op<Arg>::reference
-    noop(Arg const &arg);
-
-    template<typename Node>
+    template<typename Op>
     struct arg_type;
 
-    template<typename Node>
+    template<typename Op>
     struct left_type;
 
-    template<typename Node>
+    template<typename Op>
     struct right_type;
 
-    template<typename Node, bool IsOp = is_op<Node>::value>
+    template<typename Op>
     struct tag_type;
 
     template<typename OpTag, typename DomainTag, typename Dummy = void>
     struct compiler;
 
-    template<typename DomainTag>
+    template<typename OpTag, typename DomainTag, bool RightFirst = true>
     struct fold_compiler;
 
-    template<typename DomainTag>
-    struct reverse_fold_compiler;
-
     template<typename Lambda, typename DomainTag, typename Compiler = void>
     struct transform_compiler;
 
@@ -170,9 +159,6 @@
     template<typename Lambda, typename Map>
     struct switch_compiler;
 
-    template<typename DomainTag>
-    struct pass_through_compiler;
-
     struct error_compiler;
 
     struct identity_transform;
@@ -192,21 +178,21 @@
     template<typename Predicate, typename IfTransform, typename ElseTransform = identity_transform>
     struct conditional_transform;
 
-    template<typename Node>
-    typename arg_type<Node>::const_reference arg(Node const &node);
+    template<typename Op>
+    typename arg_type<Op>::const_reference arg(Op const &op);
 
-    template<typename Node>
-    typename left_type<Node>::const_reference left(Node const &node);
+    template<typename Op>
+    typename left_type<Op>::const_reference left(Op const &op);
 
-    template<typename Node>
-    typename right_type<Node>::const_reference right(Node const &node);
+    template<typename Op>
+    typename right_type<Op>::const_reference right(Op const &op);
 
-    template<typename Node, typename State, typename Visitor, typename DomainTag>
+    template<typename Op, typename State, typename Visitor, typename DomainTag>
     struct compile_result;
 
-    template<typename Node, typename State, typename Visitor, typename DomainTag>
-    typename compile_result<Node, State, Visitor, DomainTag>::type const
-    compile(Node const &node, State const &state, Visitor &visitor, DomainTag tag_type);
+    template<typename Op, typename State, typename Visitor, typename DomainTag>
+    typename compile_result<Op, State, Visitor, DomainTag>::type const
+    compile(Op const &op, State const &state, Visitor &visitor, DomainTag tag_type);
 
 }} // namespace boost::proto
 

Modified: boost/trunk/boost/xpressive/regex_algorithms.hpp
===================================================================
--- boost/trunk/boost/xpressive/regex_algorithms.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/regex_algorithms.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,8 +15,6 @@
 #endif
 
 #include <iterator>
-#include <boost/range/end.hpp>
-#include <boost/range/begin.hpp>
 #include <boost/xpressive/detail/detail_fwd.hpp>
 #include <boost/xpressive/detail/core/state.hpp>
 #include <boost/xpressive/detail/utility/save_restore.hpp>
@@ -82,7 +80,6 @@
 }
 
 /// \overload
-///
 template<typename OtherBidiIter, typename BidiIter>
 inline bool regex_match
 (
@@ -98,7 +95,6 @@
 }
 
 /// \overload
-///
 template<typename Char>
 inline bool regex_match
 (
@@ -114,41 +110,19 @@
 }
 
 /// \overload
-///
-template<typename BidiRange, typename BidiIter>
+template<typename Char, typename Traits, typename Alloc>
 inline bool regex_match
 (
-    BidiRange &rng
-  , match_results<BidiIter> &what
-  , basic_regex<BidiIter> const &re
+    std::basic_string<Char, Traits, Alloc> const &str
+  , match_results<typename std::basic_string<Char, Traits, Alloc>::const_iterator> &what
+  , basic_regex<typename std::basic_string<Char, Traits, Alloc>::const_iterator> const &re
   , regex_constants::match_flag_type flags = regex_constants::match_default
 )
 {
-    // Note that the result iterator of the range must be convertible
-    // to BidiIter here.
-    BidiIter begin = boost::begin(rng), end = boost::end(rng);
-    return regex_match(begin, end, what, re, flags);
+    return regex_match(str.begin(), str.end(), what, re, flags);
 }
 
 /// \overload
-///
-template<typename BidiRange, typename BidiIter>
-inline bool regex_match
-(
-    BidiRange const &rng
-  , match_results<BidiIter> &what
-  , basic_regex<BidiIter> const &re
-  , regex_constants::match_flag_type flags = regex_constants::match_default
-)
-{
-    // Note that the result iterator of the range must be convertible
-    // to BidiIter here.
-    BidiIter begin = boost::begin(rng), end = boost::end(rng);
-    return regex_match(begin, end, what, re, flags);
-}
-
-/// \overload
-///
 template<typename Char>
 inline bool regex_match
 (
@@ -163,36 +137,20 @@
 }
 
 /// \overload
-///
-template<typename BidiRange, typename BidiIter>
+template<typename Char, typename Traits, typename Alloc>
 inline bool regex_match
 (
-    BidiRange &rng
-  , basic_regex<BidiIter> const &re
+    std::basic_string<Char, Traits, Alloc> const &str
+  , basic_regex<typename std::basic_string<Char, Traits, Alloc>::const_iterator> const &re
   , regex_constants::match_flag_type flags = regex_constants::match_default
 )
 {
     // BUGBUG this is inefficient
-    match_results<BidiIter> what;
-    return regex_match(rng, what, re, flags);
+    match_results<typename std::basic_string<Char, Traits, Alloc>::const_iterator> what;
+    return regex_match(str, what, re, flags);
 }
 
-/// \overload
-///
-template<typename BidiRange, typename BidiIter>
-inline bool regex_match
-(
-    BidiRange const &rng
-  , basic_regex<BidiIter> const &re
-  , regex_constants::match_flag_type flags = regex_constants::match_default
-)
-{
-    // BUGBUG this is inefficient
-    match_results<BidiIter> what;
-    return regex_match(rng, what, re, flags);
-}
 
-
 ///////////////////////////////////////////////////////////////////////////////
 // regex_search
 ///////////////////////////////////////////////////////////////////////////////
@@ -352,7 +310,6 @@
 }
 
 /// \overload
-///
 template<typename OtherBidiIter, typename BidiIter>
 inline bool regex_search
 (
@@ -368,7 +325,6 @@
 }
 
 /// \overload
-///
 template<typename Char>
 inline bool regex_search
 (
@@ -384,41 +340,19 @@
 }
 
 /// \overload
-///
-template<typename BidiRange, typename BidiIter>
+template<typename Char, typename Traits, typename Alloc>
 inline bool regex_search
 (
-    BidiRange &rng
-  , match_results<BidiIter> &what
-  , basic_regex<BidiIter> const &re
+    std::basic_string<Char, Traits, Alloc> const &str
+  , match_results<typename std::basic_string<Char, Traits, Alloc>::const_iterator> &what
+  , basic_regex<typename std::basic_string<Char, Traits, Alloc>::const_iterator> const &re
   , regex_constants::match_flag_type flags = regex_constants::match_default
 )
 {
-    // Note that the result iterator of the range must be convertible
-    // to BidiIter here.
-    BidiIter begin = boost::begin(rng), end = boost::end(rng);
-    return regex_search(begin, end, what, re, flags);
+    return regex_search(str.begin(), str.end(), what, re, flags);
 }
 
 /// \overload
-///
-template<typename BidiRange, typename BidiIter>
-inline bool regex_search
-(
-    BidiRange const &rng
-  , match_results<BidiIter> &what
-  , basic_regex<BidiIter> const &re
-  , regex_constants::match_flag_type flags = regex_constants::match_default
-)
-{
-    // Note that the result iterator of the range must be convertible
-    // to BidiIter here.
-    BidiIter begin = boost::begin(rng), end = boost::end(rng);
-    return regex_search(begin, end, what, re, flags);
-}
-
-/// \overload
-///
 template<typename Char>
 inline bool regex_search
 (
@@ -433,36 +367,20 @@
 }
 
 /// \overload
-///
-template<typename BidiRange, typename BidiIter>
+template<typename Char, typename Traits, typename Alloc>
 inline bool regex_search
 (
-    BidiRange &rng
-  , basic_regex<BidiIter> const &re
+    std::basic_string<Char, Traits, Alloc> const &str
+  , basic_regex<typename std::basic_string<Char, Traits, Alloc>::const_iterator> const &re
   , regex_constants::match_flag_type flags = regex_constants::match_default
 )
 {
     // BUGBUG this is inefficient
-    match_results<BidiIter> what;
-    return regex_search(rng, what, re, flags);
+    match_results<typename std::basic_string<Char, Traits, Alloc>::const_iterator> what;
+    return regex_search(str, what, re, flags);
 }
 
-/// \overload
-///
-template<typename BidiRange, typename BidiIter>
-inline bool regex_search
-(
-    BidiRange const &rng
-  , basic_regex<BidiIter> const &re
-  , regex_constants::match_flag_type flags = regex_constants::match_default
-)
-{
-    // BUGBUG this is inefficient
-    match_results<BidiIter> what;
-    return regex_search(rng, what, re, flags);
-}
 
-
 ///////////////////////////////////////////////////////////////////////////////
 // regex_replace
 ///////////////////////////////////////////////////////////////////////////////
@@ -550,7 +468,6 @@
 }
 
 /// \overload
-///
 template<typename Char>
 inline std::basic_string<Char> regex_replace
 (

Modified: boost/trunk/boost/xpressive/regex_compiler.hpp
===================================================================
--- boost/trunk/boost/xpressive/regex_compiler.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/regex_compiler.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -100,29 +100,37 @@
         string_iterator begin = pat.begin(), end = pat.end();
 
         // at the top level, a regex is a sequence of alternates
-        detail::sequence<BidiIter> seq = this->parse_alternates(begin, end);
+        alternates_list alternates;
+        this->parse_alternates(begin, end, alternates);
         detail::ensure(begin == end, regex_constants::error_paren, "mismatched parenthesis");
 
-        // terminate the sequence
-        seq += detail::make_dynamic<BidiIter>(detail::end_matcher());
+        // convert the alternates list to the appropriate matcher and terminate the sequence
+        detail::sequence<BidiIter> seq = detail::alternates_to_matchable(alternates, alternates_factory());
+        seq += detail::make_dynamic_xpression<BidiIter>(detail::end_matcher());
 
+        // fill in the back-pointers by visiting the regex parse tree
+        detail::xpression_linker<char_type> linker(this->rxtraits());
+        seq.first->link(linker);
+
         // bundle the regex information into a regex_impl object
-        basic_regex<BidiIter> rex;
-        shared_ptr<detail::regex_impl<BidiIter> > const &impl = detail::core_access<BidiIter>::get_regex_impl(rex);
-        detail::common_compile(seq.xpr().matchable(), *impl, this->rxtraits());
+        detail::regex_impl<BidiIter> impl;
+        impl.xpr_ = seq.first;
+        impl.traits_.reset(new RegexTraits(this->rxtraits()));
+        impl.mark_count_ = this->mark_count_;
+        impl.hidden_mark_count_ = this->hidden_mark_count_;
 
-        impl->traits_ = new detail::traits_holder<RegexTraits>(this->rxtraits());
-        impl->mark_count_ = this->mark_count_;
-        impl->hidden_mark_count_ = this->hidden_mark_count_;
+        // optimization: get the peek chars OR the boyer-moore search string
+        detail::optimize_regex(impl, this->rxtraits(), detail::is_random<BidiIter>());
 
-        return rex;
+        return detail::core_access<BidiIter>::make_regex(impl);
     }
 
 private:
 
     typedef typename string_type::const_iterator string_iterator;
+    typedef std::list<detail::sequence<BidiIter> > alternates_list;
     typedef detail::escape_value<char_type, char_class_type> escape_value;
-    typedef detail::alternate_matcher<detail::alternates_vector<BidiIter>, RegexTraits> alternate_matcher;
+    typedef detail::alternates_factory_impl<BidiIter, traits_type> alternates_factory;
 
     ///////////////////////////////////////////////////////////////////////////
     // reset
@@ -153,27 +161,19 @@
     ///////////////////////////////////////////////////////////////////////////
     // parse_alternates
     /// INTERNAL ONLY
-    detail::sequence<BidiIter> parse_alternates(string_iterator &begin, string_iterator end)
+    void parse_alternates(string_iterator &begin, string_iterator end, alternates_list &alternates)
     {
         using namespace regex_constants;
-        int count = 0;
-        string_iterator tmp = begin;
-        detail::sequence<BidiIter> seq;
+        string_iterator old_begin;
 
-        do switch(++count)
+        do
         {
-        case 1:
-            seq = this->parse_sequence(tmp, end);
-            break;
-        case 2:
-            seq = detail::make_dynamic<BidiIter>(alternate_matcher()) | seq;
-            // fall-through
-        default:
-            seq |= this->parse_sequence(tmp, end);
+            alternates.push_back(this->parse_sequence(begin, end));
+            old_begin = begin;
         }
-        while((begin = tmp) != end && token_alternate == this->traits_.get_token(tmp, end));
+        while(begin != end && token_alternate == this->traits_.get_token(begin, end));
 
-        return seq;
+        begin = old_begin;
     }
 
     ///////////////////////////////////////////////////////////////////////////
@@ -187,6 +187,7 @@
         bool lookahead = false;
         bool lookbehind = false;
         bool negative = false;
+        std::size_t old_mark_count = this->mark_count_;
 
         detail::sequence<BidiIter> seq, seq_end;
         string_iterator tmp = string_iterator();
@@ -208,19 +209,19 @@
             negative = true; // fall-through
         case token_positive_lookahead:
             lookahead = true;
-            seq_end = detail::make_dynamic<BidiIter>(detail::true_matcher());
+            seq_end = detail::make_dynamic_xpression<BidiIter>(detail::true_matcher());
             break;
 
         case token_negative_lookbehind:
             negative = true; // fall-through
         case token_positive_lookbehind:
             lookbehind = true;
-            seq_end = detail::make_dynamic<BidiIter>(detail::true_matcher());
+            seq_end = detail::make_dynamic_xpression<BidiIter>(detail::true_matcher());
             break;
 
         case token_independent_sub_expression:
             keeper = true;
-            seq_end = detail::make_dynamic<BidiIter>(detail::true_matcher());
+            seq_end = detail::make_dynamic_xpression<BidiIter>(detail::true_matcher());
             break;
 
         case token_comment:
@@ -238,14 +239,14 @@
 
         default:
             mark_nbr = static_cast<int>(++this->mark_count_);
-            seq = detail::make_dynamic<BidiIter>(detail::mark_begin_matcher(mark_nbr));
-            seq_end = detail::make_dynamic<BidiIter>(detail::mark_end_matcher(mark_nbr));
+            seq = detail::make_dynamic_xpression<BidiIter>(detail::mark_begin_matcher(mark_nbr));
+            seq_end = detail::make_dynamic_xpression<BidiIter>(detail::mark_end_matcher(mark_nbr));
             break;
         }
 
         // alternates
-        seq += this->parse_alternates(begin, end);
-        seq += seq_end;
+        alternates_list alternates;
+        this->parse_alternates(begin, end, alternates);
         detail::ensure
         (
             begin != end && token_group_end == this->traits_.get_token(begin, end)
@@ -253,21 +254,26 @@
           , "mismatched parenthesis"
         );
 
-        typedef detail::shared_matchable<BidiIter> xpr_type;
+        seq += detail::alternates_to_matchable(alternates, alternates_factory());
+        seq += seq_end;
+
+        typedef shared_ptr<detail::matchable<BidiIter> const> xpr_type;
+        bool do_save = (this->mark_count_ != old_mark_count);
+
         if(lookahead)
         {
-            detail::lookahead_matcher<xpr_type> lookahead(seq.xpr(), negative, seq.pure());
-            seq = detail::make_dynamic<BidiIter>(lookahead);
+            detail::lookahead_matcher<xpr_type> lookahead(seq.first, negative, do_save);
+            seq = detail::make_dynamic_xpression<BidiIter>(lookahead);
         }
         else if(lookbehind)
         {
-            detail::lookbehind_matcher<xpr_type> lookbehind(seq.xpr(), seq.width().value(), negative, seq.pure());
-            seq = detail::make_dynamic<BidiIter>(lookbehind);
+            detail::lookbehind_matcher<xpr_type> lookbehind(seq.first, negative, do_save);
+            seq = detail::make_dynamic_xpression<BidiIter>(lookbehind);
         }
         else if(keeper) // independent sub-expression
         {
-            detail::keeper_matcher<xpr_type> keeper(seq.xpr(), seq.pure());
-            seq = detail::make_dynamic<BidiIter>(keeper);
+            detail::keeper_matcher<xpr_type> keeper(seq.first, do_save);
+            seq = detail::make_dynamic_xpression<BidiIter>(keeper);
         }
 
         // restore the modifiers
@@ -314,10 +320,10 @@
             return detail::make_any_xpression<BidiIter>(this->traits_.flags(), this->rxtraits());
 
         case token_assert_begin_sequence:
-            return detail::make_dynamic<BidiIter>(detail::assert_bos_matcher());
+            return detail::make_dynamic_xpression<BidiIter>(detail::assert_bos_matcher());
 
         case token_assert_end_sequence:
-            return detail::make_dynamic<BidiIter>(detail::assert_eos_matcher());
+            return detail::make_dynamic_xpression<BidiIter>(detail::assert_eos_matcher());
 
         case token_assert_begin_line:
             return detail::make_assert_begin_line<BidiIter>(this->traits_.flags(), this->rxtraits());
@@ -400,11 +406,11 @@
     detail::sequence<BidiIter> parse_quant(string_iterator &begin, string_iterator end)
     {
         BOOST_ASSERT(begin != end);
-        detail::quant_spec spec = { 0, 0, false, &this->hidden_mark_count_ };
+        detail::quant_spec spec = { 0, 0, false };
         detail::sequence<BidiIter> seq = this->parse_atom(begin, end);
 
         // BUGBUG this doesn't handle the degenerate (?:)+ correctly
-        if(!seq.empty() && begin != end && detail::quant_none != seq.quant())
+        if(!seq.is_empty() && begin != end && seq.first->is_quantifiable())
         {
             if(this->traits_.get_quant_spec(begin, end, spec))
             {
@@ -416,7 +422,7 @@
                 }
                 else
                 {
-                    seq.repeat(spec);
+                    seq = seq.first->quantify(spec, this->hidden_mark_count_, seq, alternates_factory());
                 }
             }
         }
@@ -436,7 +442,7 @@
             detail::sequence<BidiIter> seq_quant = this->parse_quant(begin, end);
 
             // did we find a quantified atom?
-            if(seq_quant.empty())
+            if(seq_quant.is_empty())
                 break;
 
             // chain it to the end of the xpression sequence
@@ -460,7 +466,7 @@
 
         for(string_iterator prev = begin, tmp = ++begin; begin != end; prev = begin, begin = tmp)
         {
-            detail::quant_spec spec = { 0, 0, false, &this->hidden_mark_count_ };
+            detail::quant_spec spec;
             if(this->traits_.get_quant_spec(tmp, end, spec))
             {
                 if(literal.size() != 1)

Modified: boost/trunk/boost/xpressive/regex_constants.hpp
===================================================================
--- boost/trunk/boost/xpressive/regex_constants.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/regex_constants.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -133,7 +133,7 @@
                                         ///<
     match_partial           = 1 << 11,  ///< Specifies that if no match can be found, then it is
                                         ///< acceptable to return a match [from, last) where
-                                        ///< from != last, if there exists some sequence of characters
+                                        ///< from!=last, if there exists some sequence of characters
                                         ///< [from,to) of which [from,last) is a prefix, and which
                                         ///< would result in a full match.
                                         ///<
@@ -195,9 +195,9 @@
                                 ///<
     error_brack,                ///< The expression contained mismatched [ and ].
                                 ///<
-    error_paren,                ///< The expression contained mismatched ( and ).
+    error_paren,                ///< The expression contained mismatched (and).
                                 ///<
-    error_brace,                ///< The expression contained mismatched { and }.
+    error_brace,                ///< The expression contained mismatched { and }
                                 ///<
     error_badbrace,             ///< The expression contained an invalid range in a {} expression.
                                 ///<

Modified: boost/trunk/boost/xpressive/regex_iterator.hpp
===================================================================
--- boost/trunk/boost/xpressive/regex_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/regex_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,11 +16,9 @@
 #endif
 
 #include <boost/noncopyable.hpp>
-#include <boost/intrusive_ptr.hpp>
 #include <boost/iterator/iterator_traits.hpp>
 #include <boost/xpressive/detail/detail_fwd.hpp>
 #include <boost/xpressive/detail/core/access.hpp>
-#include <boost/xpressive/detail/utility/counted_base.hpp>
 
 namespace boost { namespace xpressive { namespace detail
 {
@@ -30,7 +28,7 @@
 //
 template<typename BidiIter>
 struct regex_iterator_impl
-  : counted_base<regex_iterator_impl<BidiIter> >
+  : private noncopyable
 {
     typedef detail::core_access<BidiIter> access;
 
@@ -198,16 +196,19 @@
     /// INTERNAL ONLY
     void fork_()
     {
-        if(1 != this->impl_->use_count())
+        if(!this->impl_.unique())
         {
-            this->impl_ = new impl_type_
+            this->impl_.reset
             (
-                this->impl_->state_.begin_
-              , this->impl_->state_.cur_
-              , this->impl_->state_.end_
-              , this->impl_->rex_
-              , this->impl_->flags_
-              , this->impl_->not_null_
+                new impl_type_
+                (
+                    this->impl_->state_.begin_
+                  , this->impl_->state_.cur_
+                  , this->impl_->state_.end_
+                  , this->impl_->rex_
+                  , this->impl_->flags_
+                  , this->impl_->not_null_
+                )
             );
         }
     }
@@ -215,14 +216,14 @@
     /// INTERNAL ONLY
     void next_()
     {
-        BOOST_ASSERT(this->impl_ && 1 == this->impl_->use_count());
+        BOOST_ASSERT(this->impl_ && this->impl_.unique());
         if(!this->impl_->next())
         {
-            this->impl_ = 0;
+            this->impl_.reset();
         }
     }
 
-    intrusive_ptr<impl_type_> impl_;
+    shared_ptr<impl_type_> impl_;
 };
 
 }} // namespace boost::xpressive

Modified: boost/trunk/boost/xpressive/regex_primitives.hpp
===================================================================
--- boost/trunk/boost/xpressive/regex_primitives.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/regex_primitives.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -546,7 +546,6 @@
 }
 
 /// \overload
-///
 template<unsigned int Count, typename Xpr2>
 inline proto::unary_op
 <

Modified: boost/trunk/boost/xpressive/regex_token_iterator.hpp
===================================================================
--- boost/trunk/boost/xpressive/regex_token_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/regex_token_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -29,7 +29,7 @@
 //
 template<typename BidiIter>
 struct regex_token_iterator_impl
-  : counted_base<regex_token_iterator_impl<BidiIter> >
+  : private noncopyable
 {
     typedef typename iterator_value<BidiIter>::type  char_type;
 
@@ -251,18 +251,21 @@
     /// INTERNAL ONLY
     void fork_()
     {
-        if(1 != this->impl_->use_count())
+        if(!this->impl_.unique())
         {
-            intrusive_ptr<impl_type_> clone = new impl_type_
+            shared_ptr<impl_type_> clone
             (
-                this->impl_->iter_.state_.begin_
-              , this->impl_->iter_.state_.cur_
-              , this->impl_->iter_.state_.end_
-              , this->impl_->iter_.rex_
-              , this->impl_->iter_.flags_
-              , this->impl_->subs_
-              , this->impl_->n_
-              , this->impl_->iter_.not_null_
+                new impl_type_
+                (
+                    this->impl_->iter_.state_.begin_
+                  , this->impl_->iter_.state_.cur_
+                  , this->impl_->iter_.state_.end_
+                  , this->impl_->iter_.rex_
+                  , this->impl_->iter_.flags_
+                  , this->impl_->subs_
+                  , this->impl_->n_
+                  , this->impl_->iter_.not_null_
+                )
             );
 
             // only copy the match_results struct if we have to. Note: if the next call
@@ -280,14 +283,14 @@
     /// INTERNAL ONLY
     void next_()
     {
-        BOOST_ASSERT(this->impl_ && 1 == this->impl_->use_count());
+        BOOST_ASSERT(this->impl_ && this->impl_.unique());
         if(!this->impl_->next())
         {
-            this->impl_ = 0;
+            this->impl_.reset();
         }
     }
 
-    intrusive_ptr<impl_type_> impl_;
+    shared_ptr<impl_type_> impl_;
 };
 
 }} // namespace boost::xpressive

Modified: boost/trunk/boost/xpressive/sub_match.hpp
===================================================================
--- boost/trunk/boost/xpressive/sub_match.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/sub_match.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -107,14 +107,12 @@
     }
 
     /// \overload
-    ///
     int compare(sub_match const &sub) const
     {
         return this->str().compare(sub.str());
     }
 
     /// \overload
-    ///
     int compare(value_type const *ptr) const
     {
         return this->str().compare(ptr);

Modified: boost/trunk/boost/xpressive/traits/cpp_regex_traits.hpp
===================================================================
--- boost/trunk/boost/xpressive/traits/cpp_regex_traits.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/traits/cpp_regex_traits.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -169,7 +169,7 @@
       , mask_cast<std::ctype_base::xdigit>::value
     };
 
-    inline int log2(umaskex_t i)
+    inline int mylog2(umaskex_t i)
     {
         return "\0\0\1\0\2\0\0\0\3"[i & 0xf]
              + "\0\4\5\0\6\0\0\0\7"[(i & 0xf0) >> 04]
@@ -206,7 +206,7 @@
             umaskex_t tmp = mask & ~non_std_ctype_masks;
             for(umaskex_t i; 0 != (i = (tmp & (~tmp+1))); tmp &= ~i)
             {
-                std::ctype_base::mask m = (std::ctype_base::mask)(umask_t)std_masks[log2(i)];
+                std::ctype_base::mask m = (std::ctype_base::mask)(umask_t)std_masks[mylog2(i)];
                 if(ct.is(m, ch))
                 {
                     return true;

Modified: boost/trunk/boost/xpressive/traits/detail/c_ctype.hpp
===================================================================
--- boost/trunk/boost/xpressive/traits/detail/c_ctype.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/traits/detail/c_ctype.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -60,13 +60,13 @@
 template<typename FwdIter>
 inline std::string classname_a(FwdIter begin, FwdIter end)
 {
-	std::string name(begin, end);
-	for(std::size_t i = 0; i < name.size(); ++i)
-	{
-		using namespace std;
-		name[i] = tolower(static_cast<unsigned char>(name[i]));
-	}
-	return name;
+    std::string name(begin, end);
+    for(std::size_t i = 0; i < name.size(); ++i)
+    {
+        using namespace std;
+        name[i] = tolower(static_cast<unsigned char>(name[i]));
+    }
+    return name;
 }
 
 #ifndef BOOST_XPRESSIVE_NO_WREGEX
@@ -76,13 +76,13 @@
 template<typename FwdIter>
 inline std::wstring classname_w(FwdIter begin, FwdIter end)
 {
-	std::wstring name(begin, end);
-	for(std::size_t i = 0; i < name.size(); ++i)
-	{
-		using namespace std;
-		name[i] = towlower(name[i]);
-	}
-	return name;
+    std::wstring name(begin, end);
+    for(std::size_t i = 0; i < name.size(); ++i)
+    {
+        using namespace std;
+        name[i] = towlower(name[i]);
+    }
+    return name;
 }
 #endif
 

Modified: boost/trunk/boost/xpressive/xpressive_fwd.hpp
===================================================================
--- boost/trunk/boost/xpressive/xpressive_fwd.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/xpressive_fwd.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,6 +36,8 @@
 
 namespace boost { namespace xpressive
 {
+    template<typename Char, typename Impl>
+    struct regex_traits;
 
     template<typename Char>
     struct cpp_regex_traits;

Modified: boost/trunk/boost/xpressive/xpressive_typeof.hpp
===================================================================
--- boost/trunk/boost/xpressive/xpressive_typeof.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost/xpressive/xpressive_typeof.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -72,8 +72,6 @@
 BOOST_TYPEOF_REGISTER_TEMPLATE(boost::xpressive::detail::mark_matcher, (typename)(bool))
 BOOST_TYPEOF_REGISTER_TEMPLATE(boost::xpressive::detail::repeat_end_matcher, (bool))
 BOOST_TYPEOF_REGISTER_TEMPLATE(boost::xpressive::detail::alternate_matcher, (typename)(typename))
-BOOST_TYPEOF_REGISTER_TEMPLATE(boost::xpressive::detail::optional_matcher, (typename)(bool))
-BOOST_TYPEOF_REGISTER_TEMPLATE(boost::xpressive::detail::optional_mark_matcher, (typename)(bool))
 BOOST_TYPEOF_REGISTER_TEMPLATE(boost::xpressive::detail::simple_repeat_matcher, (typename)(bool))
 BOOST_TYPEOF_REGISTER_TEMPLATE(boost::xpressive::detail::regex_byref_matcher, (typename))
 BOOST_TYPEOF_REGISTER_TEMPLATE(boost::xpressive::detail::regex_matcher, (typename))

Modified: boost/trunk/boost-build.jam
===================================================================
--- boost/trunk/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,12 +6,4 @@
 #~ LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 BOOST_ROOT = $(.boost-build-file:D) ;
-if --v2 in $(ARGV)
-{
-    JAMFILE = [Bb]uild.jam [Jj]amfile.v2 ;
-    boost-build tools/build/v2 ;
-}
-else
-{
-    boost-build tools/build/v1 ;
-}    
+boost-build tools/build/v2 ;

Modified: boost/trunk/boost.css
===================================================================
--- boost/trunk/boost.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/boost.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+/*=============================================================================
+    Copyright 2002 William E. Kempf
+    Distributed under the Boost Software License, Version 1.0. (See accompany-
+    ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+=============================================================================*/
+
 H1
 {
     FONT-SIZE: 200%;
@@ -56,4 +62,4 @@
 .function-semantics
 {
     CLEAR: left;
-}
+}
\ No newline at end of file

Modified: boost/trunk/configure
===================================================================
--- boost/trunk/configure	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/configure	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,12 @@
 #!/bin/sh
-# Copyright 2005 Douglas Gregor.
+# Copyright (C) 2005, 2006 Douglas Gregor.
+# Copyright (C) 2006 The Trustees of Indiana University
+#
 # Distributed under the Boost Software License, Version 1.0.
 # (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
+
+# boostinspect:notab - Tabs are required for the Makefile.
+
 BJAM=""
 TOOLSET=""
 BJAM_CONFIG=""
@@ -27,7 +32,7 @@
 
     -help | --help | -h)
       want_help=yes ;;
-        
+
     -prefix=* | --prefix=*)
       PREFIX=`expr "x$option" : "x-*prefix=\(.*\)"`
       ;;
@@ -61,6 +66,10 @@
       ICU_ROOT=`expr "x$option" : "x-*with-icu=\(.*\)"`
       ;;
 
+    -without-icu | --without-icu )
+      flag_icu=no
+      ;;
+
     -with-libraries=* | --with-libraries=* )
       library_list=`expr "x$option" : "x-*with-libraries=\(.*\)"`
       if test "$library_list" != "all"; then
@@ -70,7 +79,7 @@
           do
               LIBS="$LIBS --with-$library"
 
-              if test $library == python; then
+              if test $library = python; then
                   requested_python=yes
               fi
           done
@@ -90,7 +99,7 @@
       do
           LIBS="$LIBS --without-$library"
 
-          if test $library == python; then
+          if test $library = python; then
               flag_no_python=yes
           fi
       done
@@ -145,9 +154,12 @@
                             library names or "all"
                             [all]
   --without-libraries=list  build all libraries except the ones listed []
-  --with-icu                enable Unicode/ICU support in Regex [disabled]
+  --with-icu                enable Unicode/ICU support in Regex 
+                            [automatically detected]
+  --without-icu             disable Unicode/ICU support in Regex
   --with-icu=DIR            specify the root of the ICU library installation
-                            and enable Unicode/ICU support in Regex [disabled] 
+                            and enable Unicode/ICU support in Regex
+                            [automatically detected]
   --with-python=PYTHON      specify the Python executable [python]
   --with-python-root=DIR    specify the root of the Python installation
                             [automatically detected]
@@ -172,14 +184,14 @@
 my_dir="."
 
 # Determine the toolset, if not already decided
-if test "x$TOOLSET" == x; then
+if test "x$TOOLSET" = x; then
   TOOLSET=`$my_dir/tools/jam/src/build.sh --guess-toolset`
 fi
 
 rm -f config.log
 
 # Build bjam
-if test "x$BJAM" == x; then
+if test "x$BJAM" = x; then
   echo -n "Building Boost.Jam with toolset $TOOLSET... "
   pwd=`pwd`
   cd "$my_dir/tools/jam/src" && ./build.sh "$TOOLSET" > config.log 2>&1
@@ -192,7 +204,7 @@
 # TBD: Turn BJAM into an absolute path
 
 # If there is a list of libraries 
-if test "x$flag_show_libraries" == xyes; then
+if test "x$flag_show_libraries" = xyes; then
   libraries=`$BJAM -d0 --show-libraries`
   cat <<EOF
 
@@ -210,56 +222,101 @@
 fi
 
 # Setup paths
-if test "x$EPREFIX" == x; then
+if test "x$EPREFIX" = x; then
   EPREFIX=$PREFIX
 fi
 
-if test "x$LIBDIR" == x; then
+if test "x$LIBDIR" = x; then
   LIBDIR="$EPREFIX/lib"
 fi
 
-if test "x$INCLUDEDIR" == x; then
+if test "x$INCLUDEDIR" = x; then
   INCLUDEDIR="$PREFIX/include"
 fi
 
 # Find Python
-if test "x$flag_no_python" == x; then
-    if test "x$PYTHON_VERSION" == x; then
+if test "x$flag_no_python" = x; then
+  result=`$PYTHON -c "exit" > /dev/null 2>&1`
+  if [ "$?" -ne "0" ]; then
+    flag_no_python=yes
+  fi
+fi
+
+if test "x$flag_no_python" = x; then
+    if test "x$PYTHON_VERSION" = x; then
         echo -n "Detecting Python version... "
         PYTHON_VERSION=`$PYTHON -c "import sys; print (\"%d.%d\" % (sys.version_info[0], sys.version_info[1]))"`
         echo $PYTHON_VERSION
     fi
 
-    if test "x$PYTHON_ROOT" == x; then
+    if test "x$PYTHON_ROOT" = x; then
         echo -n "Detecting Python root... "
         PYTHON_ROOT=`$PYTHON -c "import sys; print sys.prefix"`
         echo $PYTHON_ROOT
     fi    
-
-    BJAM_CONFIG="$BJAM_CONFIG -sPYTHON_ROOT=$PYTHON_ROOT -sPYTHON_VERSION=$PYTHON_VERSION"
 fi
 
 # Configure ICU
 echo -n "Unicode/ICU support for Boost.Regex?... "
-if test "x$flag_icu" == xyes; then
-  if test "x$ICU_ROOT" == x; then
-    BJAM_CONFIG="$BJAM_CONFIG -sHAVE_ICU=1"
-    echo "yes."
+if test "x$flag_icu" != xno; then
+  if test "x$ICU_ROOT" = x; then
+    COMMON_ICU_PATHS="/usr /usr/local /sw"
+    for p in $COMMON_ICU_PATHS; do
+      if test -r $p/include/unicode/utypes.h; then
+        ICU_ROOT=$p
+      fi
+    done
+  
+    if test "x$ICU_ROOT" = x; then
+      echo "not found."
+    else      
+      BJAM_CONFIG="$BJAM_CONFIG -sICU_PATH=$ICU_ROOT"
+      echo "$ICU_ROOT"
+    fi
   else
     BJAM_CONFIG="$BJAM_CONFIG -sICU_PATH=$ICU_ROOT"
     echo "$ICU_ROOT"
   fi
 else
-  echo "no."
+  echo "disabled."
 fi
 
+# Backup the user's existing user-config.jam
+JAM_CONFIG_OUT="user-config.jam"
+if test -r "user-config.jam"; then
+  counter=1
+ 
+  while test -r "user-config.jam.$counter"; do
+    counter=`expr $counter + 1`
+  done
 
+  echo "Backing up existing Boost.Build configuration in user-config.jam.$counter"
+  mv "user-config.jam" "user-config.jam.$counter"
+fi
 
+# Generate user-config.jam
+echo "Generating Boost.Build configuration in user-config.jam..."
+cat > user-config.jam <<EOF
+# Boost.Build Configuration
+# Automatically generated by Boost configure 
+
+# Compiler configuration
+using $TOOLSET ; 
+EOF
+
+#  - Python configuration
+if test "x$flag_no_python" = x; then
+  cat >> user-config.jam <<EOF
+
+# Python configuration
+using python : $PYTHON_VERSION : $PYTHON_ROOT ;
+EOF
+fi
+
 # Generate the Makefile
 echo "Generating Makefile..."
 cat > Makefile <<EOF
 BJAM=$BJAM
-TOOLSET=$TOOLSET
 BJAM_CONFIG=$BJAM_CONFIG
 PREFIX=$PREFIX
 EPREFIX=$EPREFIX
@@ -268,22 +325,22 @@
 LIBS=$LIBS
 
 all: .dummy
-	@echo "\$(BJAM) \$(BJAM_CONFIG) -sTOOLS=\$(TOOLSET) \$(LIBS)"
-	@\$(BJAM) \$(BJAM_CONFIG) -sTOOLS=\$(TOOLSET) \$(LIBS) || \\
+	@echo "\$(BJAM) \$(BJAM_CONFIG) --user-config=user-config.jam \$(LIBS)"
+	@\$(BJAM) \$(BJAM_CONFIG) --user-config=user-config.jam \$(LIBS) || \\
 	echo "Not all Boost libraries built properly."
 
 clean: .dummy
-	rm -rf bin
+	rm -rf bin.v2
 
 distclean: clean
 	rm -rf Makefile config.log
 
 check: .dummy
-	@cd status && ../\$(BJAM) \$(BJAM_CONFIG) -sTOOLS=\$(TOOLSET) test || echo "Some Boost regression tests failed. This is normal."
+	@cd status && ../\$(BJAM) \$(BJAM_CONFIG) --user-config=user-config.jam test || echo "Some Boost regression tests failed. This is normal."
 
 install: .dummy
-	@echo "\$(BJAM) \$(BJAM_CONFIG) --prefix=\$(PREFIX) --exec-prefix=\$(EPREFIX) --libdir=\$(LIBDIR) --includedir=\$(INCLUDEDIR) -sTOOLS=\$(TOOLSET) \$(LIBS) install"
-	@\$(BJAM) \$(BJAM_CONFIG) --prefix=\$(PREFIX) --exec-prefix=\$(EPREFIX) --libdir=\$(LIBDIR) --includedir=\$(INCLUDEDIR) -sTOOLS=\$(TOOLSET) \$(LIBS) install || echo "Not all Boost libraries built properly."
+	@echo "\$(BJAM) \$(BJAM_CONFIG) --user-config=user-config.jam --prefix=\$(PREFIX) --exec-prefix=\$(EPREFIX) --libdir=\$(LIBDIR) --includedir=\$(INCLUDEDIR) \$(LIBS) install"
+	@\$(BJAM) \$(BJAM_CONFIG) --user-config=user-config.jam --prefix=\$(PREFIX) --exec-prefix=\$(EPREFIX) --libdir=\$(LIBDIR) --includedir=\$(INCLUDEDIR) \$(LIBS) install || echo "Not all Boost libraries built properly."
 
 .dummy:
 

Modified: boost/trunk/debian/changelog
===================================================================
--- boost/trunk/debian/changelog	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/debian/changelog	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+boost (1.33.1+1.34.0-cvs20070216-1) experimental; urgency=low
+
+  * New upstream snapshot version.
+
+ -- Domenico Andreoli <cavok at debian.org>  Fri, 16 Feb 2007 17:33:50 +0100
+
 boost (1.33.1+1.34.0-cvs20060531-1) experimental; urgency=low
 
   * New upstream snapshot version.

Modified: boost/trunk/doc/Jamfile.v2
===================================================================
--- boost/trunk/doc/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+# Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+#
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
+
 project boost/doc ;
 import boostbook : boostbook ;
 

Modified: boost/trunk/doc/html/CopyConstructible.html
===================================================================
--- boost/trunk/doc/html/CopyConstructible.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/CopyConstructible.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/CopyConstructible.html">
   </head>
   <body>

Modified: boost/trunk/doc/html/any.html
===================================================================
--- boost/trunk/doc/html/any.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/any.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/any.html">
   </head>
   <body>

Modified: boost/trunk/doc/html/array.html
===================================================================
--- boost/trunk/doc/html/array.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/array.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/array.html">
   </head>
   <body>

Copied: boost/trunk/doc/html/bbv2 (from rev 14034, boost/branches/upstream/current/doc/html/bbv2)

Copied: boost/trunk/doc/html/bbv2.html (from rev 14034, boost/branches/upstream/current/doc/html/bbv2.html)

Copied: boost/trunk/doc/html/boost_math/gcd_lcm.html (from rev 14034, boost/branches/upstream/current/doc/html/boost_math/gcd_lcm.html)

Deleted: boost/trunk/doc/html/boost_math/greatest_common_divisor_and_least_common_multiple.html
===================================================================
--- boost/trunk/doc/html/boost_math/greatest_common_divisor_and_least_common_multiple.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/boost_math/greatest_common_divisor_and_least_common_multiple.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-  <head>
-    <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_math/greatest_common_divisor_and_least_common_multiple.html">
-  </head>
-  <body>
-    Automatic redirection failed, please go to
-    <a href="http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_math/greatest_common_divisor_and_least_common_multiple.html">http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_math/greatest_common_divisor_and_least_common_multiple.html</a>
-  </body>
-</html>
-

Modified: boost/trunk/doc/html/boost_math/inverse_complex.html
===================================================================
--- boost/trunk/doc/html/boost_math/inverse_complex.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/boost_math/inverse_complex.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_math/inverse_complex.html">
   </head>
   <body>

Copied: boost/trunk/doc/html/boost_math/math_special_functions.html (from rev 14034, boost/branches/upstream/current/doc/html/boost_math/math_special_functions.html)

Copied: boost/trunk/doc/html/boost_math/octonions.html (from rev 14034, boost/branches/upstream/current/doc/html/boost_math/octonions.html)

Copied: boost/trunk/doc/html/boost_math/quaternions.html (from rev 14034, boost/branches/upstream/current/doc/html/boost_math/quaternions.html)

Modified: boost/trunk/doc/html/boost_math.html
===================================================================
--- boost/trunk/doc/html/boost_math.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/boost_math.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_math.html">
   </head>
   <body>

Modified: boost/trunk/doc/html/boost_staticassert.html
===================================================================
--- boost/trunk/doc/html/boost_staticassert.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/boost_staticassert.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_staticassert.html">
   </head>
   <body>

Modified: boost/trunk/doc/html/boost_tr1.html
===================================================================
--- boost/trunk/doc/html/boost_tr1.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/boost_tr1.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,12 +1,11 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Chapter 15. Boost.TR1</title>
-<link rel="stylesheet" href="boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.2">
-<link rel="start" href="index.html" title="The Boost C++ Libraries"><!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_tr1.html">
   </head>
   <body>

Modified: boost/trunk/doc/html/boost_typetraits/background.html
===================================================================
--- boost/trunk/doc/html/boost_typetraits/background.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/boost_typetraits/background.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_typetraits/background.html">
   </head>
   <body>

Modified: boost/trunk/doc/html/boost_typetraits.html
===================================================================
--- boost/trunk/doc/html/boost_typetraits.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/boost_typetraits.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_typetraits.html">
   </head>
   <body>

Modified: boost/trunk/doc/html/boostbook.css
===================================================================
--- boost/trunk/doc/html/boostbook.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/boostbook.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,9 +2,8 @@
     Copyright (c) 2004 Joel de Guzman
     http://spirit.sourceforge.net/
 
-    Use, modification and distribution is subject to the Boost Software
-    License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-    http://www.boost.org/LICENSE_1_0.txt)
+    Distributed under the Boost Software License, Version 1.0. (See accompany-
+    ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
 
 /*=============================================================================
@@ -509,3 +508,12 @@
             font-weight: bold;
         }
     }
+
+/*=============================================================================
+    Images
+=============================================================================*/
+
+    span.inlinemediaobject img
+    {
+        vertical-align: middle;
+    }
\ No newline at end of file

Modified: boost/trunk/doc/html/boostbook.html
===================================================================
--- boost/trunk/doc/html/boostbook.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/boostbook.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boostbook.html">
   </head>
   <body>

Copied: boost/trunk/doc/html/date_time (from rev 14034, boost/branches/upstream/current/doc/html/date_time)

Modified: boost/trunk/doc/html/date_time.html
===================================================================
--- boost/trunk/doc/html/date_time.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/date_time.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/date_time.html">
   </head>
   <body>

Copied: boost/trunk/doc/html/docutils.css (from rev 14034, boost/branches/upstream/current/doc/html/docutils.css)

Copied: boost/trunk/doc/html/foreach.html (from rev 14034, boost/branches/upstream/current/doc/html/foreach.html)

Modified: boost/trunk/doc/html/function.html
===================================================================
--- boost/trunk/doc/html/function.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/function.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/function.html">
   </head>
   <body>

Modified: boost/trunk/doc/html/functionN.html
===================================================================
--- boost/trunk/doc/html/functionN.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/functionN.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/functionN.html">
   </head>
   <body>

Modified: boost/trunk/doc/html/hash.html
===================================================================
--- boost/trunk/doc/html/hash.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/hash.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,19 @@
+
+<!--
+Copyright Daniel James 2005 - 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)
+-->
+
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
+    <title>Redirect to generated documentation</title>
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/hash.html">
   </head>
   <body>

Copied: boost/trunk/doc/html/jam (from rev 14034, boost/branches/upstream/current/doc/html/jam)

Copied: boost/trunk/doc/html/jam.html (from rev 14034, boost/branches/upstream/current/doc/html/jam.html)

Modified: boost/trunk/doc/html/lambda.html
===================================================================
--- boost/trunk/doc/html/lambda.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/lambda.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/lambda.html">
   </head>
   <body>

Modified: boost/trunk/doc/html/program_options.html
===================================================================
--- boost/trunk/doc/html/program_options.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/program_options.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/program_options.html">
   </head>
   <body>

Modified: boost/trunk/doc/html/ref.html
===================================================================
--- boost/trunk/doc/html/ref.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/ref.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/ref.html">
   </head>
   <body>

Modified: boost/trunk/doc/html/reference.css
===================================================================
--- boost/trunk/doc/html/reference.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/reference.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+/*============================================================================
+    Copyright 2003-2004 Douglas Gregor
+    Distributed under the Boost Software License, Version 1.0. (See accompany-
+    ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+============================================================================*/
+
 PRE.synopsis { 
   background-color: #e0ffff;
   border: thin solid blue;
@@ -2,2 +8,2 @@
   padding: 1em
-}
+}
\ No newline at end of file

Modified: boost/trunk/doc/html/signals.html
===================================================================
--- boost/trunk/doc/html/signals.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/signals.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/signals.html">
   </head>
   <body>

Modified: boost/trunk/doc/html/string_algo.html
===================================================================
--- boost/trunk/doc/html/string_algo.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/string_algo.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/string_algo.html">
   </head>
   <body>

Copied: boost/trunk/doc/html/thread.html (from rev 14034, boost/branches/upstream/current/doc/html/thread.html)

Deleted: boost/trunk/doc/html/threads.html
===================================================================
--- boost/trunk/doc/html/threads.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/threads.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-  <head>
-    <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/threads.html">
-  </head>
-  <body>
-    Automatic redirection failed, please go to
-    <a href="http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/threads.html">http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/threads.html</a>
-  </body>
-</html>

Modified: boost/trunk/doc/html/tribool.html
===================================================================
--- boost/trunk/doc/html/tribool.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/tribool.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/tribool.html">
   </head>
   <body>

Copied: boost/trunk/doc/html/typeof.html (from rev 14034, boost/branches/upstream/current/doc/html/typeof.html)

Modified: boost/trunk/doc/html/variant.html
===================================================================
--- boost/trunk/doc/html/variant.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/variant.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/variant.html">
   </head>
   <body>

Modified: boost/trunk/doc/html/who_s_using_boost_.html
===================================================================
--- boost/trunk/doc/html/who_s_using_boost_.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/html/who_s_using_boost_.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
+  <!-- Copyright (C) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+
+      Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file LICENSE_1_0.txt or copy at
+      http://www.boost.org/LICENSE_1_0.txt) -->
     <meta http-equiv="refresh" content="0; URL=http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/who_s_using_boost_.html">
   </head>
   <body>

Copied: boost/trunk/doc/html/xpressive.html (from rev 14034, boost/branches/upstream/current/doc/html/xpressive.html)

Modified: boost/trunk/doc/src/boost.xml
===================================================================
--- boost/trunk/doc/src/boost.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/doc/src/boost.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,14 +1,31 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE boostbook PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
+<!-- Copyright (C) 2002 Douglas Gregor
+
+    Distributed under the Boost Software License, Version 1.0.
+    (See accompanying file LICENSE_1_0.txt or copy at
+    http://www.boost.org/LICENSE_1_0.txt) -->
 <boostbook xmlns:xi="http://www.w3.org/2001/XInclude"
-           last-revision="$Date: 2006/04/06 18:26:53 $">
-  <title>The Boost C++ Libraries</title>
+           last-revision="$Date: 2006/11/03 19:57:40 $">
+  <title>The Boost C++ Libraries BoostBook Documentation Subset</title>
 
-  <part id="libraries">
-    <title>The Boost C++ Libraries</title>
+  <preface id="about">
+    <title>What's Included in This Document</title>
+
+    <para>This document represents only a subset of the full Boost
+    documentation: that part which is generated from BoostBook or
+    QuickBook sources.  Eventually all Boost libraries may use these
+    formats, but in the meantime, much of Boost's documentation is not
+    available here.  Please
+    see <ulink
+    url="http://www.boost.org/libs">http://www.boost.org/libs</ulink>
+    for complete documentation.
+    </para>
+
     <para>
-      Documentation for some libraries is available in alternative formats:
+      Documentation for some of the libraries described in this document is
+      available in alternative formats:
        <itemizedlist>
          <listitem>
            <simpara><ulink url="http://www.boost.org/doc/boost-doc-html.tar.gz">HTML (tarred, gzipped)</ulink></simpara>
@@ -32,6 +49,11 @@
        </itemizedlist>
     </para>
 
+  </preface>
+
+  <part id="libraries">
+    <title>The Boost C++ Libraries (BoostBook Subset)</title>
+
     <xi:include href="../../libs/any/doc/any.xml"/>
     <xi:include href="../../libs/array/doc/array.xml"/>
 

Modified: boost/trunk/index.htm
===================================================================
--- boost/trunk/index.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/index.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -247,7 +247,7 @@
                               efficient</a> directory iteration.</li>
 
                               <li>Addition of a <a href=
-                              "libs/filesystem/doc/convenience.htm#basic_recursive_directory_iterator">
+                              "libs/filesystem/doc/tr2_proposal.html#Class-template-basic_recursive_directory_iterator">
                               recursive directory iterator</a>.</li>
                             </ul>
                           </li>
@@ -257,7 +257,7 @@
                           Library</a>:</span> Boost.Function now implements a
                           small buffer optimization, which can drastically
                           improve the performance when copying or
-                          construction Boost.Function objects storing small
+                          constructing Boost.Function objects storing small
                           function objects. For instance,
                           <code>bind(&amp;X:foo, &amp;x, _1, _2)</code>
                           requires no heap allocation when placed into a
@@ -297,7 +297,7 @@
                               from Aaron Windsor.</li>
 
                               <li><a href=
-                              "libs/graph/doc/lengauer_tarjan_dominator_tree.htm">
+                              "libs/graph/doc/lengauer_tarjan_dominator.htm">
                               <tt>lengauer_tarjan_dominator_tree</tt></a>,
                               from JongSoo Park.</li>
 
@@ -308,7 +308,7 @@
                               University.</li>
 
                               <li><a href=
-                              "sorted_erdos_renyi_generator.html"><tt>sorted_erdos_renyi_iterator</tt></a>,
+                              "libs/graph/doc/sorted_erdos_renyi_gen.html"><tt>sorted_erdos_renyi_iterator</tt></a>,
                               from Jeremiah Willcock of Indiana
                               University.</li>
 
@@ -330,6 +330,14 @@
                               <tt>vis.initialize_vertex</tt> for each vertex
                               during initialization.</li>
 
+			      <li><b>Note:</b> the name of the
+			      compiled library for the <a
+			      href="libs/graph/doc/read_graphviz.html">GraphViz
+			      reader</a> has changed to
+			      <code>boost_graph</code> (from
+			      <code>bgl-viz</code>) to match Boost
+			      conventions.</li>
+
                               <li>See the <a href=
                               "libs/graph/doc/history.html#1.34.0">complete
                               revision history</a> for more information.</li>
@@ -338,29 +346,15 @@
 
                           <li><span class="library"><a href=
                           "libs/multi_array/index.html">MultiArray
-                          Library</a>:</span> 
-			    <ul>
-			      <li>Boost.MultiArray now by default
-                              provides range-checking for
-			      <code>operator[]</code>. Range checking can be
-			      disabled by defining the macro
-			      <code>BOOST_DISABLE_ASSERTS</code> before 
-			      including <tt>multi_array.hpp</tt>.</li> 
+                          Library</a>:</span> Boost.MultiArray now by default
+                          provides range-checking for
+                          <code>operator[]</code>. Range checking can be
+                          disabled by defining the macro
+                          <code>BOOST_DISABLE_ASSERTS</code> before including
+                          <tt>multi_array.hpp</tt>. A bug in
+                          <code>multi_array::resize()</code> related
+                          to storage orders was fixed.</li>
 
-			      <li> A bug in
-			      <code>multi_array::resize()</code> related
-			      to storage orders was fixed.</li>
-
-			      <li><code>multi_array::resize()</code>
-			      can now be called with a model of
-			      the <code>Collection</code> concept to
-			      specify the new extents.</li>
-
-			      <li>A bug in the comparison routine for
-			      view iterators was fixed.</li>
-			    </ul>
-                          </li>
-
                           <li>
                             <span class="library"><a href=
                             "libs/multi_index/doc/index.html">Multi-index
@@ -468,6 +462,11 @@
                             </ul>
                           </li>
 
+                      <li><span class="library"><a href=
+                      "doc/html/signals.html">Signals Library</a>:</span>
+                      More improvements to signal invocation performance from
+                      Robert Zeh.</li>
+
                           <li>
                             <span class="library"><a href=
                             "libs/smart_ptr/smart_ptr.htm">Smart
@@ -507,7 +506,7 @@
                             </ul>                          
                           <li>
                             <span class="library"><a href=
-                            "libs/wave/doc/index.html">Wave
+                            "libs/wave/index.html">Wave
                             Library</a>:</span>
 
                             <ul>
@@ -546,15 +545,16 @@
                               (macro tables et.al.).</li>
 
                               <li>The overall performance has been improved by upto 
-                              30-40%, depending on the concrete files to process. </li>
+                              40-60%, depending on the concrete files to process. </li>
 
                               <li>Support for new pragmas has been added allowing to 
-							   control certain library features from inside the 
-							   preprocessed sources (partial output redirection, 
-							   control of generated whitespace and #line directives).</li>
+                               control certain library features from inside the 
+                               preprocessed sources (partial output redirection, 
+                               control of generated whitespace and #line directives).</li>
 
                               <li>Optional support for #pragma message &quot;...&quot; 
-							   has been added. </li>
+                               has been added. </li>
+                               
                               <li>This version also includes a number of bug
                               fixes and usage improvements. For a complete
                               list of changes, see the libraries <a href=
@@ -780,7 +780,7 @@
                                 Files</a></li>
 
                                 <li><a href=
-                                "more/getting_started.html#CVS">Main
+                                "more/cvs.html">Main
                                 CVS</a></li>
 
                                 <li><a href=
@@ -850,7 +850,7 @@
                           <div class="sidecell" id="footer">
                             <div class="sidecell-0">
                               <div id="revised">
-                                <p>Revised $Date: 2006/05/26 14:51:17 $</p>
+                                <p>Revised $Date: 2007/01/07 22:26:52 $</p>
                               </div>
 
                               <div id="copyright">

Deleted: boost/trunk/libs/algorithm/minmax/example/Jamfile
===================================================================
--- boost/trunk/libs/algorithm/minmax/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/minmax/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,14 +0,0 @@
-#  Boost.Minmax Library Example Jamfile
-#
-#  Copyright (C) 2002--2004, Herve Bronnimann
-#
-# Use, modification, and distribution is subject to the Boost Software
-# License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-#
-
-subproject libs/algorithm/minmax/example ;
-
-exe minmax_ex : minmax_ex.cpp ;
-exe minmax_timer : minmax_timer.cpp ;
-

Deleted: boost/trunk/libs/algorithm/minmax/test/Jamfile
===================================================================
--- boost/trunk/libs/algorithm/minmax/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/minmax/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,33 +0,0 @@
-# Boost.Minmax Library Test Jamfile
-#
-# Copyright (C) 2002--2004, Herve Bronnimann
-#
-# Use, modification, and distribution is subject to the Boost Software
-# License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-#
-
-subproject libs/algorithm/minmax/test ;
-
-# bring in rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-  test-suite algorithm/minmax
-        : [ run
-                minmax_element_test.cpp
-              : :
-                :
-                : minmax_element
-            ]
-          [ run
-                minmax_test.cpp
-              : :
-                :
-                : minmax
-            ]
-  ;
-}

Modified: boost/trunk/libs/algorithm/string/doc/concept.xml
===================================================================
--- boost/trunk/libs/algorithm/string/doc/concept.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/string/doc/concept.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
 "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section id="string_algo.concept" last-revision="$Date: 2004/07/16 09:06:39 $">
+
+<!-- Copyright (c) 2002-2006 Pavol Droba.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
+
+<section id="string_algo.concept" last-revision="$Date: 2006/08/16 07:10:47 $">
     <title>Concepts</title>
 
     <using-namespace name="boost"/>

Modified: boost/trunk/libs/algorithm/string/doc/credits.xml
===================================================================
--- boost/trunk/libs/algorithm/string/doc/credits.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/string/doc/credits.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
 "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section id="string_algo.credits" last-revision="$Date: 2004/08/03 17:28:02 $">
+
+<!-- Copyright (c) 2002-2006 Pavol Droba.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
+
+<section id="string_algo.credits" last-revision="$Date: 2006/08/16 07:10:48 $">
     <title>Credits</title>
     <section id="string_algo.ack">
         <title>Acknowledgments</title>

Modified: boost/trunk/libs/algorithm/string/doc/design.xml
===================================================================
--- boost/trunk/libs/algorithm/string/doc/design.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/string/doc/design.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,13 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
 "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section id="string_algo.design" last-revision="$Date: 2005/05/14 19:11:09 $">
+
+<!-- Copyright (c) 2002-2006 Pavol Droba.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
+<section id="string_algo.design" last-revision="$Date: 2006/08/16 07:10:48 $">
     <title>Design Topics</title>
 
     <using-namespace name="boost"/>

Modified: boost/trunk/libs/algorithm/string/doc/environment.xml
===================================================================
--- boost/trunk/libs/algorithm/string/doc/environment.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/string/doc/environment.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
 "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section id="string_algo.env" last-revision="$Date: 2004/07/15 21:47:21 $">
+
+
+<!-- Copyright (c) 2002-2006 Pavol Droba.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
+<section id="string_algo.env" last-revision="$Date: 2006/08/16 07:10:48 $">
     <title>Environment</title>
     <section>
         <title>Build</title>

Deleted: boost/trunk/libs/algorithm/string/doc/external_concepts.html
===================================================================
--- boost/trunk/libs/algorithm/string/doc/external_concepts.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/string/doc/external_concepts.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,38 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><title> Concepts and External Concepts </title><meta http-equiv="Content-Type"content="text/html; charset=iso-8859-1"></head> <body><table  ><tr  ><td  ><img src="../../../../boost.png" width="100%" border="0"></td><td  ><h1  >Concepts and External Concepts</h1></td></tr></table><p  >Generic programming in C++ is characterized by the use of function and class templates where
-                the template parameter(s) must satisfy certain requirements.Often these
-                requirements are so important that we give them a name: we call
-                such a set of type requirements a <b>concept</b>. We say that a type <i>
-                conforms to a concept</i> or that it <i>is a model of a concept</i> if it
-                satisfies all of those requirements. The concept can be specified as a set
-                of member functions with well-defined semantics
-                and a set of nested typedefs with well-defined properties.</p><p  >Often it much more flexible to provide free-standing functions and typedefs
-            which provides the exact same semantics (but a different syntax) as
-            specified
-            by the concept. This allows generic code to treat different types <i> as if
-            </i> they fulfilled the concept. In this case we say that the concept has
-            been <b> externalized </b> or that the new requirements constitutes an <b>external
-            concept </b>. We say that a type <i> conforms to an external concept </i>
-            or that it <i> is a model of an external concept </i>. A concept may exist
-            without a corresponding external concept and conversely.</p><p  >Whenever a concept specifies a member function, the corresponding  external
-            concept
-            must specify a free-standing function of the same name, same return type and
-            the same argument list except there is an extra first argument which must
-            be of the type (or a reference to that type) that is to fulfill the external
-            concept. If the corresonding member function has any cv-qulifiers, the
-            first argument must have the same cv-qualifiers. Whenever a concept
-            specifies a nested typedef, the corresponding external concept
-            specifies a <b>type-generator</b>, that is, a type with a nested typedef
-            named <code>type</code>. The type-generator has the name as the nested typedef with
-            <code>_of</code> appended.
-            The converse relationship of an external concept and its corresponding concept
-            also holds.</p><p  ><b  ><i  >Example:</i></b></p><p  >A type <code>T</code> fulfills the FooConcept if it
-            has the follwing public members:</p><code> void T::foo( int ) const; <br>
-                 int T::bar(); <br> 
-               typedef <i>implementation defined </i> foo_type;</code><p  >The corresponding external concept is the ExternalFooConcept.</p><p  >A type <code>T</code> fullfills the ExternalFooConcept if these
-            free-standing functions and type-generators exists:</p><code>void foo( const T&, int ); <br>
-                int bar( T& ); <br>
-             foo_type_of< T >::type;</code> <br> <br><hr size="1" ><h3  >Literature</h3><ul  ><li  > <a href="http://www.boost.org/more/generic_programming.html#type_generator" target="_self" >Type Generators</a> </li><li  > <a href="http://www.boost.org/more/generic_programming.html#concept" target="_self" >Concepts</a> </li><li  > <a href="http://www.sgi.com/tech/stl/stl_introduction.html" target="_self" >Concepts and SGI STL</a> </li></ul><hr size="1" ><p  >&copy; Thorsten Ottosen 2003-2004 (nesotto_AT_cs.auc.dk).
-    Permission to copy, use, modify, sell and distribute this software is granted provided this copyright notice appears
-     in all copies. This software is provided "as is" without express or implied warranty, and with no
-         claim as to its suitability for any purpose.</p><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br></body></html>
- <!-- Copyright Dezide Aps 2003-2004 -->
\ No newline at end of file

Modified: boost/trunk/libs/algorithm/string/doc/intro.xml
===================================================================
--- boost/trunk/libs/algorithm/string/doc/intro.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/string/doc/intro.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,13 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
 "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section id="string_algo.intro" last-revision="$Date: 2004/07/15 21:47:21 $">
+
+<!-- Copyright (c) 2002-2006 Pavol Droba.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
+<section id="string_algo.intro" last-revision="$Date: 2006/08/16 07:10:48 $">
     <title>Introduction</title>
 
     <para>

Modified: boost/trunk/libs/algorithm/string/doc/quickref.xml
===================================================================
--- boost/trunk/libs/algorithm/string/doc/quickref.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/string/doc/quickref.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,13 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
 "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section id="string_algo.quickref" last-revision="$Date: 2006/03/20 13:08:13 $">
+
+<!-- Copyright (c) 2002-2006 Pavol Droba.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
+<section id="string_algo.quickref" last-revision="$Date: 2006/08/16 07:10:48 $">
     <title>Quick Reference</title>
 
     <using-namespace name="boost"/>

Modified: boost/trunk/libs/algorithm/string/doc/rationale.xml
===================================================================
--- boost/trunk/libs/algorithm/string/doc/rationale.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/string/doc/rationale.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
 "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section id="string_algo.rationale" last-revision="$Date: 2004/07/16 09:06:39 $">
+
+<!-- Copyright (c) 2002-2006 Pavol Droba.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
+
+<section id="string_algo.rationale" last-revision="$Date: 2006/08/16 07:10:48 $">
     <title>Rationale</title>
 
     <using-namespace name="boost"/>

Modified: boost/trunk/libs/algorithm/string/doc/release_notes.xml
===================================================================
--- boost/trunk/libs/algorithm/string/doc/release_notes.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/string/doc/release_notes.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,13 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
 "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section id="string_algo.release_notes" last-revision="$Date: 2005/04/15 21:05:00 $">
+
+<!-- Copyright (c) 2002-2006 Pavol Droba.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
+<section id="string_algo.release_notes" last-revision="$Date: 2006/08/16 07:10:48 $">
     <title>Release Notes</title>
 
     <itemizedlist>

Modified: boost/trunk/libs/algorithm/string/doc/string_algo.xml
===================================================================
--- boost/trunk/libs/algorithm/string/doc/string_algo.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/string/doc/string_algo.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
 "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
+
+<!-- Copyright (c) 2002-2006 Pavol Droba.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
 <library name="String Algorithms" dirname="algorithm/string" xmlns:xi="http://www.w3.org/2001/XInclude" 
-    id="string_algo" last-revision="$Date: 2005/04/15 21:05:00 $">
+    id="string_algo" last-revision="$Date: 2006/08/16 07:10:48 $">
     <libraryinfo>
         <author>
             <firstname>Pavol</firstname>

Modified: boost/trunk/libs/algorithm/string/doc/usage.xml
===================================================================
--- boost/trunk/libs/algorithm/string/doc/usage.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/string/doc/usage.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,13 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
 "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section id="string_algo.usage" last-revision="$Date: 2005/12/08 03:14:31 $">
+
+<!-- Copyright (c) 2002-2006 Pavol Droba.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
+<section id="string_algo.usage" last-revision="$Date: 2007/01/30 07:58:35 $">
     <title>Usage</title>
 
     <using-namespace name="boost"/>
@@ -283,9 +289,9 @@
     // aBC
     
     typedef split_iterator&lt;string::iterator&gt; string_split_iterator;
-    for(string_find_iterator It=
+    for(string_split_iterator It=
         make_split_iterator(str1, first_finder("-*-", is_iequal()));
-        It!=string_find_iterator();
+        It!=string_split_iterator();
         ++It)
     {
         cout &lt;&lt; copy_range&lt;std::string&gt;(*It) &lt;&lt; endl;

Deleted: boost/trunk/libs/algorithm/string/example/Jamfile
===================================================================
--- boost/trunk/libs/algorithm/string/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/string/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,75 +0,0 @@
-#  Boost string_algo library examples Jamfile  ---------------------------------
-#
-#  Copyright Pavol Droba 2002-2003. Use, modification and
-#  distribution is subject to the Boost Software License, Version
-#  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-#  http://www.boost.org/LICENSE_1_0.txt)
-#
-#  See http://www.boost.org for updates, documentation, and revision history.
-
-subproject libs/algorithm/string/example ;
-
-exe conv_example
-    :
-    conv_example.cpp
-    :
-    <include>$(BOOST_ROOT)     
-    :
-    ;
-
-exe predicate_example
-    :
-    predicate_example.cpp
-    :
-    <include>$(BOOST_ROOT)     
-    :
-    ;
-
-exe find_example
-    :
-    find_example.cpp 
-    :
-    <include>$(BOOST_ROOT)     
-    :
-    ;
-
-exe replace_example
-    :
-    replace_example.cpp
-    :
-    <include>$(BOOST_ROOT)     
-    :
-    ;
-
-exe rle_example
-    :
-    rle_example.cpp
-    :
-    <include>$(BOOST_ROOT)     
-    :
-    ;
-
-exe trim_example
-    :
-    trim_example.cpp
-    :
-    <include>$(BOOST_ROOT)
-    :
-    ;
-
-exe regex_example
-    :
-    regex_example.cpp
-    <lib>../../../regex/build/boost_regex
-    :
-    <include>$(BOOST_ROOT)     
-    :
-    ;
-
-exe split_example
-    :
-    split_example.cpp
-    :
-    <include>$(BOOST_ROOT)
-    :
-    ;

Modified: boost/trunk/libs/algorithm/string/index.html
===================================================================
--- boost/trunk/libs/algorithm/string/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/string/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+
+<!-- Copyright (c) 2002-2006 Pavol Droba.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
 <html>
 <head>
 <meta http-equiv="refresh" content="0; URL=../../../doc/html/string_algo.html">
@@ -4,6 +10,11 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="../../../doc/html/string_algo.html">../../doc/html/string_algo.html</a>
+<a href="../../../doc/html/string_algo.html">../../doc/html/string_algo.html</a> 
+&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
-</html>
+</html>
\ No newline at end of file

Deleted: boost/trunk/libs/algorithm/string/test/Jamfile
===================================================================
--- boost/trunk/libs/algorithm/string/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/algorithm/string/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,85 +0,0 @@
-#  Boost string_algo library test suite Jamfile  ----------------------------
-#
-#  Copyright Pavol Droba 2002-2003. Use, modification and
-#  distribution is subject to the Boost Software License, Version
-#  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-#  http://www.boost.org/LICENSE_1_0.txt)
-#
-#  See http://www.boost.org for updates, documentation, and revision history.
-
-subproject libs/algorithm/string/test ;
-
-# bring in rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-    test-suite algorithm/string
-        : [ run 
-                trim_test.cpp
-              : :
-                :
-                std::locale-support
-                std::facet-support
-                : trim
-            ]
-          [ run 
-                conv_test.cpp
-              : :
-                :
-                std::locale-support
-                std::facet-support
-                : conv
-            ]
-          [ run 
-                predicate_test.cpp
-              : :
-                :
-                std::locale-support
-                std::facet-support
-                : predicate
-            ]
-          [ run 
-                find_test.cpp
-              : :
-                :
-                std::locale-support
-                std::facet-support
-                : find
-            ]
-          [ run
-                split_test.cpp
-              : :
-                :
-                std::locale-support
-                std::facet-support
-                : split
-            ]
-          [ run
-                join_test.cpp
-              : :
-                :
-                std::locale-support
-                std::facet-support
-                : join
-            ]
-          [ run 
-                replace_test.cpp
-              : :
-                :
-                std::locale-support
-                std::facet-support
-                : replace
-            ]
-          [ run 
-                regex_test.cpp
-                <lib>../../../regex/build/boost_regex
-              : :
-                :   
-                : regex
-            ]
-        ;
-}
-

Modified: boost/trunk/libs/any/any_test.cpp
===================================================================
--- boost/trunk/libs/any/any_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/any/any_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -46,8 +46,7 @@
         { "converting assignment operator", test_converting_assign },
         { "failed custom keyword cast",     test_bad_cast          },
         { "swap member function",           test_swap              },
-        { "copying operations on a null",   test_null_copying      },
-        { "cast to reference types",        test_cast_to_reference }
+        { "copying operations on a null",   test_null_copying      }
     };
 
     const test_case_iterator begin = test_cases;
@@ -187,42 +186,6 @@
         check_true(copied.empty(), "empty on copied");
         check_true(assigned.empty(), "empty on copied");
     }
-
-    void test_cast_to_reference()
-    {
-        any a(137);
-        const any b(a);
-
-        int &                ra    = any_cast<int &>(a);
-        int const &          ra_c  = any_cast<int const &>(a);
-        int volatile &       ra_v  = any_cast<int volatile &>(a);
-        int const volatile & ra_cv = any_cast<int const volatile&>(a);
-
-        check_true(
-            &ra == &ra_c && &ra == &ra_v && &ra == &ra_cv,
-            "cv references to same obj");
-
-        int const &          rb_c  = any_cast<int const &>(b);
-        int const volatile & rb_cv = any_cast<int const volatile &>(b);
-
-        check_true(&rb_c == &rb_cv, "cv references to copied const obj");
-        check_true(&ra != &rb_c, "copies hold different objects");
-
-        ++ra;
-        int incremented = any_cast<int>(a);
-        check_true(incremented == 138, "increment by reference changes value");
-
-        TEST_CHECK_THROW(
-            any_cast<char &>(a),
-            bad_any_cast,
-            "any_cast to incorrect reference type");
-
-        TEST_CHECK_THROW(
-            any_cast<const char &>(b),
-            bad_any_cast,
-            "any_cast to incorrect const reference type");
-    }
-
 }
 
 // Copyright Kevlin Henney, 2000, 2001. All rights reserved.

Modified: boost/trunk/libs/any/index.html
===================================================================
--- boost/trunk/libs/any/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/any/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,5 +5,10 @@
 <body>
 Automatic redirection failed, please go to
 <a href="../../doc/html/any.html">../../doc/html/any.html</a>
+<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p> Distributed under the Boost Software 
+License, Version 1.0. (See accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
+www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
-</html>
+</html>
\ No newline at end of file

Deleted: boost/trunk/libs/any/test/Jamfile
===================================================================
--- boost/trunk/libs/any/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/any/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,23 +0,0 @@
-#  Copyright Vladimur Prus 2005. Use, modification and
-#  distribution is subject to the Boost Software License, Version
-#  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-#  http://www.boost.org/LICENSE_1_0.txt)
-#
-# For more information, see http://www.boost.org/libs/any
-#
-
-subproject libs/any/test ;
-
-import testing ;
-
-rule any-test ( sources + )
-{
-    return [ run $(sources) : : : <include>$(BOOST_ROOT) ] ;
-}
-
-test-suite any :
-    [ any-test ../any_test.cpp ]
-    [ compile-fail any_cast_cv_failed.cpp ]
-    ;
-
-

Modified: boost/trunk/libs/any/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/any/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/any/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,7 +8,7 @@
 
 test-suite any :
     [ run ../any_test.cpp ]
-    [ compile-fail any_cast_cv_failed.cpp ]
+    [ run any_to_ref_test.cpp ../../test/build//boost_test_exec_monitor ]
     ;
 
 

Deleted: boost/trunk/libs/any/test/any_cast_cv_failed.cpp
===================================================================
--- boost/trunk/libs/any/test/any_cast_cv_failed.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/any/test/any_cast_cv_failed.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,14 +0,0 @@
-// Copyright 2006 Alexander Nasonov.
-//
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#include <boost/any.hpp>
-
-int main()
-{
-    boost::any const a;
-    boost::any_cast<int&>(a);
-}
-

Copied: boost/trunk/libs/any/test/any_to_ref_test.cpp (from rev 14034, boost/branches/upstream/current/libs/any/test/any_to_ref_test.cpp)

Copied: boost/trunk/libs/array/array0.cpp (from rev 14034, boost/branches/upstream/current/libs/array/array0.cpp)

Modified: boost/trunk/libs/array/doc/array.xml
===================================================================
--- boost/trunk/libs/array/doc/array.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/array/doc/array.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<library name="Array" dirname="array" id="array" last-revision="$Date: 2005/12/08 03:15:09 $">
+<library name="Array" dirname="array" id="array" last-revision="$Date: 2006/12/01 11:34:43 $">
   <libraryinfo>
     <author>
       <firstname>Nicolai</firstname>
@@ -17,11 +17,11 @@
     </copyright>
    
     <legalnotice>
-      <para>Permission to copy, use, modify, sell and distribute this
-      software is granted provided this copyright notice appears in
-      all copies. This software is provided "as is" without express or
-      implied warranty, and with no claim as to its suitability for
-      any purpose.</para>
+      <para>Distributed under the Boost Software License, Version 1.0.
+      (See accompanying file <filename>LICENSE_1_0.txt</filename> or copy at 
+      <ulink
+      url="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</ulink>)
+      </para>
     </legalnotice>
 
     <librarypurpose>STL compliant container wrapper for arrays of constant size</librarypurpose>

Modified: boost/trunk/libs/array/index.html
===================================================================
--- boost/trunk/libs/array/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/array/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,10 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="../../doc/html/array.html">../../doc/html/array.html</a>
+<a href="../../doc/html/array.html">../../doc/html/array.html</a> &nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
-</html>
+</html>
\ No newline at end of file

Modified: boost/trunk/libs/assign/doc/index.html
===================================================================
--- boost/trunk/libs/assign/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/assign/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -37,7 +37,7 @@
             <li>Function <a href="#list_of"><code>list_of()</code></a>    
             <li>Function <a href="#map_list_of"><code>map_list_of()</code></a> 
             <li>Function <a href="#tuple_list_of"><code>tuple_list_of()</code></a>
-            <li>Functions <a href="#repeat"><code>repeat()</code> and <code>repeat_fun()</code> </a> 
+            <li>Functions <a href="#repeat"><code>repeat()</code>, <code>repeat_fun()</code> and <code>range()</code> </a> 
             <li>Functions <a href="#ref_list_of"><code>ref_list_of()</code> and <code>cref_list_of()</code></a>    
             <li>A <a href="#complicated">"complicated"</a> example    
             <li>Functions <a href="#ptr_push_back"><code>ptr_push_back(), ptr_push_front()</code>, 
@@ -50,7 +50,7 @@
         <li><a href="#headers">Headers</a> </li>
         <li><a href="#std">Standard containers</a> </li>
         <li>Functions <a href="#list_of_ref"><code>list_of()</code> and <code>map_list_of()</code></a></li>
-        <li>Functions <a href="#repeat_ref"><code>repeat()</code> and <code>repeat_fun()</code> </a>  
+        <li>Functions <a href="#repeat_ref"><code>repeat()</code>, <code>repeat_fun()</code> and <code>range()</code> </a>  
         <li>Class <a href="#list_inserter"><code>list_inserter</code></a></li>
         <li>Function <a href="#make_list_inserter"><code>make_list_inserter()</code></a></li>
         <li><a href="#limit"> Customizing</a> argument list sizes</li>   
@@ -118,7 +118,7 @@
         <li>Function <a href="#list_of"><code>list_of()</code></a>    
         <li>Function <a href="#map_list_of"><code>map_list_of()</code></a> 
         <li>Function <a href="#tuple_list_of"><code>tuple_list_of()</code></a>   
-        <li>Functions <a href="#repeat"><code>repeat()</code> and <code>repeat_fun()</code> </a> 
+        <li>Functions <a href="#repeat"><code>repeat()</code>, <code>repeat_fun()</code> and <code>range()</code> </a> 
         <li>Functions <a href="#ref_list_of"><code>ref_list_of()</code> and <code>cref_list_of()</code></a>
         <li>A <a href="#complicated">"complicated"</a> example    
         <li>Functions <a href="#ptr_push_back"><code>ptr_push_back(), ptr_push_front()</code>, <code>ptr_insert()</code> and <code>ptr_map_insert()</code></a>
@@ -336,7 +336,7 @@
     </pre>
 </blockquote>
 
-<h3>Functions <code>repeat()</code> and <code>repeat_fun()</code> <a name="repeat"></h3> 
+<h3>Functions <code>repeat()</code>, <code>repeat_fun()</code> and <code>range()</code> <a name="repeat"></h3> 
 <p>
 Sometimes it is too irritating to repeat the same value many times. This is 
 where <code>repeat()</code> can be handy:
@@ -406,6 +406,38 @@
 The only requirement of the second argument to <code>repeat_fun()</code> is that 
 it is a nullary function. </p>
 
+<p>
+If you just need to insert an iterator-range somewhere in the list, the member function <code>range()</code> provides just what you want.
+It is based on <a href="../../range/index.html">Boost.Range</a>, so you can pass all the ranges supported by that library. For example
+<blockquote><pre><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>list_inserter</span><span class=special>.</span><span class=identifier>hpp</span><span class=special>&gt;</span> <span class=comment>// for 'push_back()'</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>list_of</span><span class=special>.</span><span class=identifier>hpp</span><span class=special>&gt;</span>       <span class=comment>// for 'list_of()' and 'ref_list_of()'</span>
+<span class=preprocessor>#include</span> <span class=special>&lt;</span><span class=identifier>boost</span><span class=special>/</span><span class=identifier>assert</span><span class=special>.</span><span class=identifier>hpp</span><span class=special>&gt;</span>
+
+<span class=keyword>using</span> <span class=keyword>namespace</span> <span class=identifier>std</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=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>v2</span><span class=special>;</span>
+    <span class=identifier>v</span>  <span class=special>=</span> <span class=identifier>list_of</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=identifier>v2</span> <span class=special>=</span> <span class=identifier>list_of</span><span class=special>(</span><span class=number>0</span><span class=special>).</span><span class=identifier>range</span><span class=special>(</span><span class=identifier>v</span><span class=special>).</span><span class=identifier>range</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=number>4</span><span class=special>);</span>
+    <span class=comment>// v2 = [0,1,2,3,1,2,3,4]</span>
+    <span class=identifier>BOOST_ASSERT</span><span class=special>(</span> <span class=identifier>v2</span><span class=special>.</span><span class=identifier>size</span><span class=special>()</span> <span class=special>==</span> <span class=number>8u</span> <span class=special>);</span>
+
+    <span class=identifier>push_back</span><span class=special>(</span> <span class=identifier>v</span> <span class=special>).</span><span class=identifier>range</span><span class=special>(</span><span class=identifier>v2</span><span class=special>)(</span><span class=number>5</span><span class=special>);</span>
+    <span class=comment>// v = [1,2,3,0,1,2,3,1,2,3,4,5]</span>
+    <span class=identifier>BOOST_ASSERT</span><span class=special>(</span> <span class=identifier>v</span><span class=special>.</span><span class=identifier>size</span><span class=special>()</span> <span class=special>==</span> <span class=number>12u</span> <span class=special>);</span> 
+
+    <span class=comment>//
+    // create a list of references, some coming from a container, others from the stack 
+    //</span>
+    <span class=keyword>int</span> <span class=identifier>x</span> <span class=special>=</span> <span class=number>0</span><span class=special>;</span>
+    <span class=keyword>int</span> <span class=identifier>y</span> <span class=special>=</span> <span class=number>1</span><span class=special>;</span>
+    <span class=identifier>BOOST_ASSERT</span><span class=special>(</span> <span class=identifier>ref_list_of</span><span class=special>&lt;</span><span class=number>10</span><span class=special>&gt;(</span><span class=identifier>x</span><span class=special>).</span><span class=identifier>range</span><span class=special>(</span><span class=identifier>v2</span><span class=special>)(</span><span class=identifier>y</span><span class=special>).</span><span class=identifier>size</span><span class=special>()</span> <span class=special>==</span> <span class=number>10u</span> <span class=special>);</span>
+<span class=special>}</span></pre>
+</blockquote>
+As you can see, one can also pass two iterators if that is more appropriate.
+The last example also introduces list of references. More about that below.
+</p>
 <h3>Functions <code>ref_list_of()</code> and <code>cref_list_of()</code> <a name="ref_list_of"></h3>
 
 When you need to create an anonymous range of values and speed is essential, 
@@ -917,11 +949,12 @@
 <span class=special>} </span><span class=comment>// namespace 'assign'</span>
 <span class=special>} </span><span class=comment>// namespace 'boost'</span>  </pre></blockquote>
 
-  <h3>Functions <code>repeat()</code> and 
-     <code>repeat_fun()</code> <a name="repeat_ref"> </h3>
+  <h3>Functions <code>repeat()</code>, 
+     <code>repeat_fun()</code> and <code>range()</code> <a name="repeat_ref"> </h3>
   <p>
-      These two function exist both as free-standing functions and as member functions of the object returned by 
-      <code>list_of()</code> and of <code>list_inserter</code>. The free-standing versions are used to create a
+      These first two function exist both as free-standing functions and as member functions of the object returned by 
+      <code>list_of()</code> and of <code>list_inserter</code>. 
+      The free-standing versions are used to create a
       hook for <code>operator,()</code> so we can call the functions in the middle of a comma-list. The member functions
       are used when we need to call the functions in the middle of a parenthesis-list. In both cases we have that
       <ul>
@@ -931,6 +964,16 @@
       </ul>
       
   </p>
+  <p>
+  The function <code>range()</code> only exists as a member function. The following two overloads are provided:
+  <blockquote>
+      <pre><span class=keyword>template</span><span class=special>&lt;</span> <span class=keyword>class</span> <span class=identifier>SinglePassIterator</span> <span class=special>&gt;</span>
+<span class=identifier>Implementation</span><span class=special>-</span><span class=identifier>defined</span> <span class=identifier>range</span><span class=special>(</span> <span class=identifier>SinglePassIterator</span> <span class=identifier>first</span><span class=special>,</span> <span class=identifier>SinglePassIterator</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=identifier>Implementation</span><span class=special>-</span><span class=identifier>defined</span> <span class=identifier>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></pre>
+  </blockquote>
+  </p>
       
   <h3><a name="list_inserter">Class <code>list_inserter</code></a></h3> 
   

Modified: boost/trunk/libs/assign/doc/style.css
===================================================================
--- boost/trunk/libs/assign/doc/style.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/assign/doc/style.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,10 @@
+/*
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+*/
+
 pre{
   BORDER-RIGHT: gray 1pt solid;
   PADDING-RIGHT: 2pt;

Modified: boost/trunk/libs/assign/index.html
===================================================================
--- boost/trunk/libs/assign/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/assign/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,7 +11,11 @@
 <body>
 Automatic redirection failed, please go to
 <a href="doc/index.html">doc/index.html</a>
+  <p>
+  Copyright © 2003-2006 Thorsten Ottosen. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt)
+  </p>
 </body>
 </html></body>
+
 </html>
 

Deleted: boost/trunk/libs/assign/test/Jamfile
===================================================================
--- boost/trunk/libs/assign/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/assign/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,40 +0,0 @@
-# Boost.Assign library
-#
-#  Copyright Thorsten Ottosen 2003-2005. Use, modification and
-#  distribution is subject to the Boost Software License, Version
-#  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-#  http://www.boost.org/LICENSE_1_0.txt)
-#
-# For more information, see http://www.boost.org/libs/assign/
-#
-
-subproject libs/assign/test ;
-
-import testing ;
-
-rule assign-test ( name )
-{
-    return [
-        run $(name).cpp
-        <lib>../../test/build/boost_unit_test_framework
-        : : : <include>$(BOOST_ROOT)
-        ] ;
-}
-
-test-suite assign :
-    [ assign-test basic ]
-    [ assign-test std ]
-    [ assign-test list_of ]
-    [ assign-test ptr_list_of ]
-    [ assign-test static_list_of ]
-    [ assign-test tuple_list_of ]
-    [ assign-test list_inserter ]
-    [ assign-test ptr_list_inserter ]
-    [ assign-test ptr_map_inserter ]
-    [ assign-test list_of_workaround ]
-    [ assign-test email_example ]
-    [ assign-test my_vector_example ]
-    [ assign-test multi_index_container ]      
-    ;
-
-

Modified: boost/trunk/libs/assign/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/assign/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/assign/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,7 +11,7 @@
 rule assign-test ( name )
 {
     return [
-        run $(name).cpp /boost/test//boost_unit_test_framework ]
+        run $(name).cpp /boost/test//boost_unit_test_framework/<link>static ]
         ;
 }
 

Deleted: boost/trunk/libs/assign/test/TODO
===================================================================
--- boost/trunk/libs/assign/test/TODO	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/assign/test/TODO	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,34 +0,0 @@
-0. add description of empty () for list_of(), list_inserter.
-1. add repeat description
-
-3. docs may mention whether hash_map/set can be used
-   as well as upcoming boost::unordered_map/set.
-
-  Maybe exotic containers as circular_buffer and/or
-  multi index container can be shown in example as well.
-
-4. update docs wrt member function addresses + std namespace
-5. update email example to use a local functor
-
-6: find conversion problem in g++ with nested list_of().
-7. add repeat etc to header overview.
-
-8. Consider optimising generic_list to store only references
-   to the object in the list. Even if compound objects are 
-   stored, then maybe tuples of opetional<T&> can be stored
-   and construction deferred until the conversion to a 
-   container is needed. A special iterator could construct
-   the objects on demand
-   
-9. The decay problem should be solved once and for all by something like
-
-   template< class T >
-   generic_list< decay_array<T>::type > list_of( const T& );
-   
-   or decay_traits<T>::type
-   
-10. Consider adding list_of and iterable_list_of to complement each other.
-    However, for tight code, list_of<7> works pretty well and provides
-    random_access iterators. recursive_list_of(2)(6);
-    
-11. make begin()/end() const members

Modified: boost/trunk/libs/assign/test/ptr_map_inserter.cpp
===================================================================
--- boost/trunk/libs/assign/test/ptr_map_inserter.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/assign/test/ptr_map_inserter.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -27,9 +27,9 @@
 // 
 struct abstract_base
 {
-	virtual ~abstract_base() {}
-	virtual void foo() = 0;
-	virtual abstract_base* clone() const = 0;
+    virtual ~abstract_base() {}
+    virtual void foo() = 0;
+    virtual abstract_base* clone() const = 0;
 };
 
 struct implementation : abstract_base
@@ -49,11 +49,11 @@
     implementation( int, std::string, int, std::string )
     { }
 
-	virtual void foo() {}
-	virtual abstract_base* clone() const
-	{
-		return new implementation( *this );
-	}
+    virtual void foo() {}
+    virtual abstract_base* clone() const
+    {
+        return new implementation( *this );
+    }
 };
 
 

Modified: boost/trunk/libs/assign/test/static_list_of.cpp
===================================================================
--- boost/trunk/libs/assign/test/static_list_of.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/assign/test/static_list_of.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,7 +17,6 @@
 #endif
 
 #include <boost/assign/list_of.hpp>
-#include <boost/array.hpp>
 #include <boost/test/test_tools.hpp>
 #include <algorithm>
 #include <iostream>
@@ -74,10 +73,6 @@
     print( ref_list_of<8>(a)(b)(c)(d)(e)(f)(g)(h) );
     print( cref_list_of<8>(a)(b)(c)(d)(e)(f)(g)(h) );
 
-    boost::array<int,4> array = cref_list_of<4>(1)(2)(3)(4);
-
-    BOOST_CHECK_EQUAL( array[0], 1 );
-    BOOST_CHECK_EQUAL( array[3], 4 );
     //
     //print( cref_list_of<5>( "foo" )( "bar" )( "foobar" ) );
     //

Modified: boost/trunk/libs/bind/bind.html
===================================================================
--- boost/trunk/libs/bind/bind.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/bind/bind.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -890,9 +890,8 @@
 			<br>
 			<br>
 			<small>Copyright © 2001, 2002 by Peter Dimov and Multi Media Ltd. Copyright 
-				2003-2005 Peter Dimov. Permission to copy, use, modify, sell and distribute 
-				this document is granted provided this copyright notice appears in all copies. 
-				This document is provided "as is" without express or implied warranty, and with 
-				no claim as to its suitability for any purpose.</small></p>
+				2003-2005 Peter Dimov. Distributed under the Boost Software License, Version 
+				1.0. See accompanying file <A href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</A> or 
+				copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>.</small></p>
 	</body>
 </html>

Modified: boost/trunk/libs/bind/doc/ref.xml
===================================================================
--- boost/trunk/libs/bind/doc/ref.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/bind/doc/ref.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<library name="Ref" dirname="ref" id="ref" last-revision="$Date: 2004/07/09 00:56:42 $">
+<library name="Ref" dirname="ref" id="ref" last-revision="$Date: 2006/11/10 18:27:05 $">
   <libraryinfo>
     <author>
       <firstname>Jaakko</firstname>
@@ -38,11 +38,9 @@
     </copyright>
 
     <legalnotice>
-      <para>Permission to copy, use, modify, sell and distribute this
-      software is granted provided this copyright notice appears in
-      all copies.  This software is provided "as is" without express
-      or implied warranty, and with no claim as to its suitability for
-      any purpose.
+      <para>Subject to the Boost Software License, Version 1.0. See 
+      accompanying file <filename>LICENSE_1_0.txt</filename> or copy at
+      <ulink url="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</ulink>.
       </para>
     </legalnotice>
 

Modified: boost/trunk/libs/bind/index.html
===================================================================
--- boost/trunk/libs/bind/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/bind/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,3 +8,9 @@
 <a href="mem_fn.html">mem_fn.html</a>.
 </body>
 </html>
+<!--
+	© Copyright Beman Dawes, 2001
+	Distributed under the Boost Software License, Version 1.0.
+	See accompanying file LICENSE_1_0.txt or copy at
+	http://www.boost.org/LICENSE_1_0.txt
+-->

Modified: boost/trunk/libs/bind/mem_fn.html
===================================================================
--- boost/trunk/libs/bind/mem_fn.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/bind/mem_fn.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -399,9 +399,8 @@
 			<br>
 			<br>
 			<small>Copyright © 2001, 2002 by Peter Dimov and Multi Media Ltd. Copyright 
-				2003-2005 Peter Dimov. Permission to copy, use, modify, sell and distribute 
-				this document is granted provided this copyright notice appears in all copies. 
-				This document is provided "as is" without express or implied warranty, and with 
-				no claim as to its suitability for any purpose.</small></p>
+				2003-2005 Peter Dimov. Distributed under the Boost Software License, Version 
+				1.0. See accompanying file <A href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</A> or 
+				copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>.</small></p>
 	</body>
 </html>

Modified: boost/trunk/libs/bind/ref.html
===================================================================
--- boost/trunk/libs/bind/ref.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/bind/ref.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,3 +7,9 @@
 <a href="../../doc/html/ref.html">../../doc/html/ref.html</a>
 </body>
 </html>
+<!--
+	© Copyright Beman Dawes, 2001
+	Distributed under the Boost Software License, Version 1.0.
+	See accompanying file LICENSE_1_0.txt or copy at
+	http://www.boost.org/LICENSE_1_0.txt
+-->

Deleted: boost/trunk/libs/bind/test/Jamfile
===================================================================
--- boost/trunk/libs/bind/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/bind/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,42 +0,0 @@
-#  Boost.Bind Library test Jamfile
-#
-#  Copyright (c) 2003-2006 Peter Dimov
-#
-#  Permission to copy, use, modify, sell and distribute this software
-#  is granted provided this copyright notice appears in all copies.
-#  This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
-
-subproject libs/bind/test ;
-
-# bring in rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : bind ;
-
-{
-    test-suite "bind"
-        : [ run bind_test.cpp ]
-          [ run bind_dm_test.cpp ]
-          [ run bind_eq_test.cpp ]
-          [ run bind_const_test.cpp ]
-          [ run bind_cv_test.cpp ]
-          [ run bind_stateful_test.cpp ]
-          [ run bind_dm2_test.cpp ]
-          [ run bind_not_test.cpp ]
-          [ run bind_rel_test.cpp ]
-          [ run bind_function_test.cpp ]
-          [ run bind_lookup_problem_test.cpp ]
-          [ run bind_rv_sp_test.cpp ]
-          [ compile bind_unary_addr.cpp ]
-          [ run bind_dm3_test.cpp ]
-          [ run bind_visit_test.cpp ]
-          [ run mem_fn_test.cpp ]
-          [ run mem_fn_void_test.cpp ]
-          [ run mem_fn_derived_test.cpp ]
-          [ run mem_fn_eq_test.cpp ]
-          [ run mem_fn_dm_test.cpp ]
-          [ run mem_fn_rv_test.cpp ]
-        ;
-}

Modified: boost/trunk/libs/bind/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/bind/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/bind/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,10 +2,9 @@
 #
 #  Copyright (c) 2003-2006 Peter Dimov
 #
-#  Permission to copy, use, modify, sell and distribute this software
-#  is granted provided this copyright notice appears in all copies.
-#  This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+#  Distributed under the Boost Software License, Version 1.0. (See
+#  accompanying file LICENSE_1_0.txt or copy at
+#  http://www.boost.org/LICENSE_1_0.txt)
 
 # bring in rules for testing
 import testing ;

Modified: boost/trunk/libs/compatibility/generate_cpp_c_headers.py
===================================================================
--- boost/trunk/libs/compatibility/generate_cpp_c_headers.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/compatibility/generate_cpp_c_headers.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,11 +20,9 @@
 # Python is available at:
 #   http://www.python.org/
 #
-# Copyright (c) 2001 Ralf W. Grosse-Kunstleve. Permission to copy,
-# use, modify, sell and distribute this script is granted provided this
-# copyright notice appears in all copies. This document is provided "as
-# is" without express or implied warranty, and with no claim as to its
-# suitability for any purpose.
+# Copyright (c) 2001 Ralf W. Grosse-Kunstleve.
+# Distributed under the Boost Software License, Version 1.0. (See accompany-
+# ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # Revision history:
 #   16 Apr 01 moved to boost CVS tree (R.W. Grosse-Kunstleve)

Modified: boost/trunk/libs/compatibility/index.html
===================================================================
--- boost/trunk/libs/compatibility/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/compatibility/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,84 +1,99 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0//EN"
-"http://www.w3.org/TR/REC-html40/strict.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<title>Boost.Compatibilty library</title>
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<div>
+  <title>Boost.Compatibilty library</title>
+</head>
 
-<img src="../../boost.png"
-     alt="boost.png (6897 bytes)"
-     align="center"
-     width="277" height="86">
+<body>
+  <div>
+    <img src="../../boost.png" alt="boost.png (6897 bytes)" align="middle"
+    width="277" height="86">
+    <hr>
 
-<hr>
-<h1>Boost.Compatibilty library</h1>
+    <h1>Boost.Compatibilty library</h1>
 
-<p>
-This library provides workarounds which allow the other Boost libraries
-to be used on otherwise non-conforming platforms. We hope that it will
-be possible to remove this library at some time in the future as
-standard library suppliers become more conforming.
+    <p>This library provides workarounds which allow the other Boost
+    libraries to be used on otherwise non-conforming platforms. We hope that
+    it will be possible to remove this library at some time in the future as
+    standard library suppliers become more conforming.</p>
 
-<h2>
-Missing C++ standard library CXX headers (e.g &lt;cstdio&gt;) workaround</h2>
+    <h2>Missing C++ standard library CXX headers (e.g &lt;cstdio&gt;)
+    workaround</h2>
 
-<p>
-The Python script:
-<tt><a href="generate_cpp_c_headers.py">generate_cpp_c_headers.py</a> </tt>creates a full set of C++ C header files
-(e.g. &lt;cstdio&gt;) that are missing on some platforms.
-The header files created by this script reside in the directory <tt><a href="../../boost/compatibility/cpp_c_headers/">boost/compatibility/cpp_c_headers</a></tt>.
-To use the header files, add this directory to the include
-file search path. For example:
-
-<pre>
+    <p>The Python script: <tt><a href=
+    "generate_cpp_c_headers.py">generate_cpp_c_headers.py</a></tt> creates a
+    full set of C++ C header files (e.g. &lt;cstdio&gt;) that are missing on
+    some platforms. The header files created by this script reside in the
+    directory <tt><a href=
+    "../../boost/compatibility/cpp_c_headers/">boost/compatibility/cpp_c_headers</a></tt>.
+    To use the header files, add this directory to the include file search
+    path. For example:</p>
+    <pre>
 cxx -I/usr/local/boost/boost/compatibility/cpp_c_headers ...
 </pre>
 
-<p>
-Supported platforms are:
-<ul>
-<li>Compaq Alpha, RedHat 6.2 Linux, Compaq C++ V6.3 (cxx)
-<li>Compaq Alpha, Tru64 Unix V5.0, Compaq C++ V6.2 (cxx)
-<li>Silicon Graphics, IRIX 6.5, MIPSpro Compilers: Version 7.3.1.1m (CC)
-</ul>
+    <p>Supported platforms are:</p>
 
-<p>
-There are more powerful alternatives to using
-the Boost.Compatibility library CXX headers, e.g.
-<a href="http://www.stlport.org/">STLport</a> or
-<a href="http://www.fnal.gov/docs/working-groups/fpcltf/Pkg/ISOcxx/doc/0ISOcxx.html">ISOCXX</a>.
-However, in contrast to these alternatives, the
-<tt>generate_cpp_c_headers.py</tt> script is very light-weight (less
-than 100 non-comment lines of Python code), much less ambitious,
-significantly easier to maintain and therefore more suitable as an interim workaround.
+    <ul>
+      <li>Compaq Alpha, RedHat 6.2 Linux, Compaq C++ V6.3 (cxx)</li>
 
-<p>
-Contributed by Ralf W. Grosse-Kunstleve.
+      <li>Compaq Alpha, Tru64 Unix V5.0, Compaq C++ V6.2 (cxx)</li>
 
-<h2>
-Missing C++ standard library &lt;limits&gt; header workaround <a href="../../boost/limits.hpp">boost/limits.hpp</a></h2>
-<p>Several Boost libraries require the standard library's &lt;limits&gt; header,
-yet this header is not always supplied by non-conforming compilers and
-libraries.&nbsp; Header <a href="../../boost/limits.hpp">boost/limits.hpp</a>
-simply includes the standard library &lt;limits&gt; header if available,
-otherwise includes <a href="../../boost/detail/limits.hpp">boost/detail/limits.hpp</a>.&nbsp;
-BOOST_NO_LIMITS from <a href="../config/config.htm">boost/config.hpp</a> is used
-to determine &lt;limits&gt; availability.
-<p>Note also the test program <a href="../config/test/limits_test.cpp">limits_test.cpp</a>
+      <li>Silicon Graphics, IRIX 6.5, MIPSpro Compilers: Version 7.3.1.1m
+      (CC)</li>
+    </ul>
 
-<p>
-Contributed by Jens Maurer.
+    <p>There are more powerful alternatives to using the Boost.Compatibility
+    library CXX headers, e.g. <a href="http://www.stlport.org/">STLport</a>
+    or <a href=
+    "http://www.fnal.gov/docs/working-groups/fpcltf/Pkg/ISOcxx/doc/0ISOcxx.html">
+    ISOCXX</a>. However, in contrast to these alternatives, the
+    <tt>generate_cpp_c_headers.py</tt> script is very light-weight (less than
+    100 non-comment lines of Python code), much less ambitious, significantly
+    easier to maintain and therefore more suitable as an interim
+    workaround.</p>
 
-<p>
-&nbsp;
+    <p>Contributed by Ralf W. Grosse-Kunstleve.</p>
 
-<hr>
-&copy; Copyright Ralf W. Grosse-Kunstleve 2001. Permission to copy,
-use, modify, sell and distribute this document is granted provided this
-copyright notice appears in all copies. This document is provided "as
-is" without express or implied warranty, and with no claim as to its
-suitability for any purpose.
+    <h2>Missing C++ standard library &lt;limits&gt; header workaround
+    <a href="../../boost/limits.hpp">boost/limits.hpp</a></h2>
 
-<p>
-Updated: April 16, 2001
-</div>
+    <p>Several Boost libraries require the standard library's &lt;limits&gt;
+    header, yet this header is not always supplied by non-conforming
+    compilers and libraries.&nbsp; Header <a href=
+    "../../boost/limits.hpp">boost/limits.hpp</a> simply includes the
+    standard library &lt;limits&gt; header if available, otherwise includes
+    <a href=
+    "../../boost/detail/limits.hpp">boost/detail/limits.hpp</a>.&nbsp;
+    BOOST_NO_LIMITS from <a href="../config/config.htm">boost/config.hpp</a>
+    is used to determine &lt;limits&gt; availability.</p>
+
+    <p>Note also the test program <a href=
+    "../config/test/limits_test.cpp">limits_test.cpp</a></p>
+
+    <p>Contributed by Jens Maurer.</p>
+
+    <p>&nbsp;<br clear="all"></p>
+    <hr>
+
+    <p><a href="http://validator.w3.org/check?uri=referer"><img border="0"
+    src="http://www.w3.org/Icons/valid-html401" alt=
+    "Valid HTML 4.01 Transitional" height="31" width="88"></a></p>
+
+    <p>Revised 
+    <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->01 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38508" --></p>
+
+    <p><i>&copy; Copyright Ralf W. Grosse-Kunstleve 2001</i></p>
+
+    <p><i>Distributed under the Boost Software License, Version 1.0. (See
+    accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+    copy at <a href=
+    "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+  </div>
+</body>
+</html>

Modified: boost/trunk/libs/compose/index.htm
===================================================================
--- boost/trunk/libs/compose/index.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/compose/index.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,6 +6,12 @@
   <p>This library was deprecated in favor of the <a
     href="../bind/bind.html">Bind</a> or <a
     href="../lambda/index.html">Lambda</a> libraries and has been
-    removed from Boost.</p> 
+    removed from Boost.&nbsp;</p> 
+  <hr>
+  <p>© Copyright Doug Gregor, 2003</p>
+  <p>Distributed under the Boost Software License, Version 1.0. (See 
+  accompanying file <a href="../../LICENSE_1_0.txt">
+  LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
+  www.boost.org/LICENSE_1_0.txt</a>)</p>
   </body>
-</html>
+</html>
\ No newline at end of file

Deleted: boost/trunk/libs/concept_check/Jamfile
===================================================================
--- boost/trunk/libs/concept_check/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,22 +0,0 @@
-subproject libs/concept_check ;
-
-import testing ;
-
-test-suite concept_check
-  : [ run stl_concept_covering.cpp ]
-    [ run stl_concept_check.cpp ]
-    [ run concept_check_test.cpp  ]
-    [ run class_concept_check_test.cpp ]
-    [ compile-fail concept_check_fail_expected.cpp ]
-    [ compile-fail class_concept_fail_expected.cpp ]
-      
-    [ run where.cpp ]
-    [ compile-fail where_fail.cpp ]
-      
-      # Backward compatibility tests
-    [ run old_concept_pass.cpp ]
-    [ compile-fail function_requires_fail.cpp ]
-    [ compile-fail old_concept_function_fail.cpp ]
-    [ compile-fail old_concept_class_fail.cpp ]
-  ;
-

Modified: boost/trunk/libs/concept_check/Jamfile.v2
===================================================================
--- boost/trunk/libs/concept_check/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,21 +1,13 @@
-
+# Copyright David Abrahams, Jeremy Siek, Vladimir Prus
+# 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)
 import testing ;
 
 test-suite concept_check
   : [ run stl_concept_covering.cpp ]
-    [ run stl_concept_check.cpp ]
     [ run concept_check_test.cpp  ]
     [ run class_concept_check_test.cpp ]
     [ compile-fail concept_check_fail_expected.cpp ]
     [ compile-fail class_concept_fail_expected.cpp ]
-      
-    [ run where.cpp ]
-    [ compile-fail where_fail.cpp ]
-      
-      # Backward compatibility tests
-    [ run old_concept_pass.cpp ]
-    [ compile-fail function_requires_fail.cpp ]
-    [ compile-fail old_concept_function_fail.cpp ]
-    [ compile-fail old_concept_class_fail.cpp ]
   ;
-

Modified: boost/trunk/libs/concept_check/class_concept_check_test.cpp
===================================================================
--- boost/trunk/libs/concept_check/class_concept_check_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/class_concept_check_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,17 +18,17 @@
 
 class class_requires_test
 {
-    BOOST_CONCEPT_ASSERT((boost::EqualityComparable<int>));
-    typedef int* int_ptr; typedef const int* const_int_ptr;
-    BOOST_CONCEPT_ASSERT((boost::EqualOp<int_ptr,const_int_ptr>));
-    BOOST_CONCEPT_ASSERT((boost::UnaryFunction<foo,bool,int>));
-    BOOST_CONCEPT_ASSERT((boost::BinaryFunction<bar,bool,int,char>));
+  BOOST_CLASS_REQUIRE(int, boost, EqualityComparableConcept);
+  typedef int* int_ptr; typedef const int* const_int_ptr;
+  BOOST_CLASS_REQUIRE2(int_ptr, const_int_ptr, boost, EqualOpConcept);
+  BOOST_CLASS_REQUIRE3(foo, bool, int, boost, UnaryFunctionConcept);
+  BOOST_CLASS_REQUIRE4(bar, bool, int, char, boost, BinaryFunctionConcept);
 };
 
 int
 main()
 {
-    class_requires_test x;
-    boost::ignore_unused_variable_warning(x);
-    return 0;
+  class_requires_test x;
+  boost::ignore_unused_variable_warning(x);
+  return 0;
 }

Modified: boost/trunk/libs/concept_check/class_concept_fail_expected.cpp
===================================================================
--- boost/trunk/libs/concept_check/class_concept_fail_expected.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/class_concept_fail_expected.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,4 @@
-// (C) Copyright Jeremy Siek, David Abrahams 2000-2006.
+// (C) Copyright Jeremy Siek 2000.
 // Distributed under the Boost Software License, Version 1.0. (See
 // accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
@@ -11,22 +11,21 @@
 /*
 
   This file verifies that class_requires of the Boost Concept Checking
-  Library catches errors when it is supposed to.
+  Library catches errors when it is suppose to.
 
 */
 
 struct foo { };
 
-template <class T>
 class class_requires_test
 {
-    BOOST_CONCEPT_ASSERT((boost::EqualityComparable<foo>));
+  BOOST_CLASS_REQUIRE(foo, boost, EqualityComparableConcept);
 };
 
 int
 main()
 {
-    class_requires_test<int> x;
-    (void)x; // suppress unused variable warning
-    return 0;
+  class_requires_test x;
+  (void)x; // suppress unused variable warning
+  return 0;
 }

Modified: boost/trunk/libs/concept_check/concept_check.htm
===================================================================
--- boost/trunk/libs/concept_check/concept_check.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/concept_check.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -238,9 +238,9 @@
 
 <pre>
 boost/concept_check.hpp: In method `void LessThanComparableConcept
-  &lt;_List_iterator&lt;int,int &amp;,int *&gt; &gt;::~LessThanComparableConcept()':
+  &lt;_List_iterator&lt;int,int &amp;,int *&gt; &gt;::constraints()':
 boost/concept_check.hpp:334:   instantiated from `RandomAccessIteratorConcept
-  &lt;_List_iterator&lt;int,int &amp;,int *&gt; &gt;::~RandomAccessIteratorConcept()'
+  &lt;_List_iterator&lt;int,int &amp;,int *&gt; &gt;::constraints()'
 bad_error_eg.cpp:6:   instantiated from `stable_sort&lt;_List_iterator
   &lt;int,int &amp;,int *&gt; &gt;(_List_iterator&lt;int,int &amp;,int *&gt;, 
   _List_iterator&lt;int,int &amp;,int *&gt;)'
@@ -260,9 +260,10 @@
 RandomAccessIterator</a>).
 <LI> The error message is now much shorter and does not reveal
   internal STL functions.
-<LI> The presence of <tt>concept_check.hpp</tt> in the error message
-  alerts the user to the fact that the error lies in the user code and
-  not in the library implementation.
+<LI> The presence of <tt>concept_check.hpp</tt> and
+  <tt>constraints()</tt> in the error message alerts the user to the
+  fact that the error lies in the user code and not in the library
+  implementation.
 </UL>
 
 <h2><a name="history">History</a></h2>

Modified: boost/trunk/libs/concept_check/concept_check_fail_expected.cpp
===================================================================
--- boost/trunk/libs/concept_check/concept_check_fail_expected.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/concept_check_fail_expected.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,4 @@
-// (C) Copyright Jeremy Siek, David Abrahams 2000-2006.
+// (C) Copyright Jeremy Siek 2000.
 // Distributed under the Boost Software License, Version 1.0. (See
 // accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
@@ -11,8 +11,8 @@
 
 /*
 
-  This file verifies that BOOST_CONCEPT_ASSERT catches errors in
-  function context.
+  This file verifies that function_requires() of the Boost Concept
+  Checking Library catches errors when it is suppose to.
 
 */
 
@@ -21,6 +21,6 @@
 int
 main()
 {
-    BOOST_CONCEPT_ASSERT((boost::EqualityComparable<foo>));
-    return 0;
+  boost::function_requires< boost::EqualityComparableConcept<foo> >();
+  return 0;
 }

Modified: boost/trunk/libs/concept_check/concept_check_test.cpp
===================================================================
--- boost/trunk/libs/concept_check/concept_check_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/concept_check_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -25,76 +25,76 @@
   // Basic Concepts
   {
     typedef default_constructible_archetype<> foo;
-    function_requires< DefaultConstructible<foo> >();
+    function_requires< DefaultConstructibleConcept<foo> >();
   }
   {
     typedef assignable_archetype<> foo;
-    function_requires< Assignable<foo> >();
+    function_requires< AssignableConcept<foo> >();
   }
   {
     typedef copy_constructible_archetype<> foo;
-    function_requires< CopyConstructible<foo> >();
+    function_requires< CopyConstructibleConcept<foo> >();
   }
   {
     typedef sgi_assignable_archetype<> foo;
-    function_requires< SGIAssignable<foo> >();
+    function_requires< SGIAssignableConcept<foo> >();
   }
   {
     typedef copy_constructible_archetype<> foo;
     typedef convertible_to_archetype<foo> convertible_to_foo;
-    function_requires< Convertible<convertible_to_foo, foo> >();
+    function_requires< ConvertibleConcept<convertible_to_foo, foo> >();
   }
   {
-    function_requires< Convertible<boolean_archetype, bool> >();
+    function_requires< ConvertibleConcept<boolean_archetype, bool> >();
   }
   {
     typedef equality_comparable_archetype<> foo;
-    function_requires< EqualityComparable<foo> >();
+    function_requires< EqualityComparableConcept<foo> >();
   }
   {
     typedef less_than_comparable_archetype<> foo;
-    function_requires< LessThanComparable<foo> >();
+    function_requires< LessThanComparableConcept<foo> >();
   }
   {
     typedef comparable_archetype<> foo;
-    function_requires< Comparable<foo> >();
+    function_requires< ComparableConcept<foo> >();
   }
   {
     typedef equal_op_first_archetype<> First;
     typedef equal_op_second_archetype<> Second;
-    function_requires< EqualOp<First, Second> >();
+    function_requires< EqualOpConcept<First, Second> >();
   }
   {
     typedef not_equal_op_first_archetype<> First;
     typedef not_equal_op_second_archetype<> Second;
-    function_requires< NotEqualOp<First, Second> >();
+    function_requires< NotEqualOpConcept<First, Second> >();
   }
   {
     typedef less_than_op_first_archetype<> First;
     typedef less_than_op_second_archetype<> Second;
-    function_requires< LessThanOp<First, Second> >();
+    function_requires< LessThanOpConcept<First, Second> >();
   }
   {
     typedef less_equal_op_first_archetype<> First;
     typedef less_equal_op_second_archetype<> Second;
-    function_requires< LessEqualOp<First, Second> >();
+    function_requires< LessEqualOpConcept<First, Second> >();
   }
   {
     typedef greater_than_op_first_archetype<> First;
     typedef greater_than_op_second_archetype<> Second;
-    function_requires< GreaterThanOp<First, Second> >();
+    function_requires< GreaterThanOpConcept<First, Second> >();
   }
   {
     typedef greater_equal_op_first_archetype<> First;
     typedef greater_equal_op_second_archetype<> Second;
-    function_requires< GreaterEqualOp<First, Second> >();
+    function_requires< GreaterEqualOpConcept<First, Second> >();
   }
 
   {
     typedef copy_constructible_archetype<> Return;
     typedef plus_op_first_archetype<Return> First;
     typedef plus_op_second_archetype<Return> Second;
-    function_requires< PlusOp<Return, First, Second> >();
+    function_requires< PlusOpConcept<Return, First, Second> >();
   }
 
   //===========================================================================
@@ -102,70 +102,70 @@
 
   {
     typedef generator_archetype<null_archetype<> > foo;
-    function_requires< Generator<foo, null_archetype<> > >();
+    function_requires< GeneratorConcept<foo, null_archetype<> > >();
   }
 #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
   {
-    function_requires< Generator< void_generator_archetype, void > >();
+    function_requires< GeneratorConcept< void_generator_archetype, void > >();
   }
 #endif
   {
     typedef unary_function_archetype<int, int> F;
-    function_requires< UnaryFunction<F, int, int> >();
+    function_requires< UnaryFunctionConcept<F, int, int> >();
   }
   {
     typedef binary_function_archetype<int, int, int> F;
-    function_requires< BinaryFunction<F, int, int, int> >();
+    function_requires< BinaryFunctionConcept<F, int, int, int> >();
   }
   {
     typedef unary_predicate_archetype<int> F;
-    function_requires< UnaryPredicate<F, int> >();
+    function_requires< UnaryPredicateConcept<F, int> >();
   }
   {
     typedef binary_predicate_archetype<int, int> F;
-    function_requires< BinaryPredicate<F, int, int> >();
+    function_requires< BinaryPredicateConcept<F, int, int> >();
   }
 
   //===========================================================================
   // Iterator Concepts
   {
     typedef input_iterator_archetype<null_archetype<> > Iter;
-    function_requires< InputIterator<Iter> >();
+    function_requires< InputIteratorConcept<Iter> >();
   }
   {
     typedef output_iterator_archetype<int> Iter;
-    function_requires< OutputIterator<Iter, int> >();
+    function_requires< OutputIteratorConcept<Iter, int> >();
   }
   {
     typedef input_output_iterator_archetype<int> Iter;
-    function_requires< InputIterator<Iter> >();
-    function_requires< OutputIterator<Iter, int> >();
+    function_requires< InputIteratorConcept<Iter> >();
+    function_requires< OutputIteratorConcept<Iter, int> >();
   }
   {
     typedef forward_iterator_archetype<null_archetype<> > Iter;
-    function_requires< ForwardIterator<Iter> >();
+    function_requires< ForwardIteratorConcept<Iter> >();
   }
   {
     typedef mutable_forward_iterator_archetype<assignable_archetype<> > Iter;
-    function_requires< Mutable_ForwardIterator<Iter> >();
+    function_requires< Mutable_ForwardIteratorConcept<Iter> >();
   }
   {
     typedef bidirectional_iterator_archetype<null_archetype<> > Iter;
-    function_requires< BidirectionalIterator<Iter> >();
+    function_requires< BidirectionalIteratorConcept<Iter> >();
   }
   {
     typedef mutable_bidirectional_iterator_archetype<assignable_archetype<> > 
       Iter;
-    function_requires< Mutable_BidirectionalIterator<Iter> >();
+    function_requires< Mutable_BidirectionalIteratorConcept<Iter> >();
   }
   {
     typedef random_access_iterator_archetype<null_archetype<> > Iter;
-    function_requires< RandomAccessIterator<Iter> >();
+    function_requires< RandomAccessIteratorConcept<Iter> >();
   }
   {
     typedef mutable_random_access_iterator_archetype<assignable_archetype<> > 
       Iter;
-    function_requires< Mutable_RandomAccessIterator<Iter> >();
+    function_requires< Mutable_RandomAccessIteratorConcept<Iter> >();
   }
 
   //===========================================================================

Deleted: boost/trunk/libs/concept_check/fake_sort.hpp
===================================================================
--- boost/trunk/libs/concept_check/fake_sort.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/fake_sort.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,27 +0,0 @@
-// 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)
-#ifndef BOOST_LIBS_CONCEPT_CHECK_FAKE_SORT_DWA2006430_HPP
-# define BOOST_LIBS_CONCEPT_CHECK_FAKE_SORT_DWA2006430_HPP
-
-# include <boost/detail/iterator.hpp>
-# include <boost/concept/where.hpp>
-# include <boost/concept_check.hpp>
-
-namespace fake
-{
-  using namespace boost;
-  
-  template<typename RanIter>
-  BOOST_CONCEPT_WHERE(
-      ((Mutable_RandomAccessIterator<RanIter>))
-      ((LessThanComparable<typename Mutable_RandomAccessIterator<RanIter>::value_type>))
-    
-    , (void))
-      sort(RanIter,RanIter)
-  {
- 
-  }
-}
-
-#endif // BOOST_LIBS_CONCEPT_CHECK_FAKE_SORT_DWA2006430_HPP

Deleted: boost/trunk/libs/concept_check/function_requires_fail.cpp
===================================================================
--- boost/trunk/libs/concept_check/function_requires_fail.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/function_requires_fail.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,26 +0,0 @@
-// (C) Copyright Jeremy Siek 2000.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#ifdef NDEBUG
-#  undef NDEBUG
-#endif
-
-#include <boost/concept_check.hpp>
-
-/*
-
-  This file verifies that function_requires() of the Boost Concept
-  Checking Library catches errors when it is suppose to.
-
-*/
-
-struct foo { };
-
-int
-main()
-{
-    boost::function_requires< boost::EqualityComparable<foo> >();
-    return 0;
-}

Modified: boost/trunk/libs/concept_check/index.html
===================================================================
--- boost/trunk/libs/concept_check/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,10 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="concept_check.htm">concept_check.htm</a>.
+<a href="concept_check.htm">concept_check.htm</a>.&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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: boost/trunk/libs/concept_check/old_concept_class_fail.cpp
===================================================================
--- boost/trunk/libs/concept_check/old_concept_class_fail.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/old_concept_class_fail.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,28 +0,0 @@
-// (C) Copyright Jeremy Siek, David Abrahams 2000-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)
-//
-// Change Log:
-// 20 Jan 2001 - Added warning suppression (David Abrahams)
-
-#include "old_concepts.hpp"
-
-// This file verifies that concepts written the old way still catch
-// errors in class context.  This is not expected to work on compilers
-// without SFINAE support.
-
-struct foo { };
-
-class class_requires_test
-{
-  BOOST_CLASS_REQUIRE(foo, old, EqualityComparableConcept);
-};
-
-int
-main()
-{
-  class_requires_test x;
-  (void)x; // suppress unused variable warning
-  return 0;
-}

Deleted: boost/trunk/libs/concept_check/old_concept_function_fail.cpp
===================================================================
--- boost/trunk/libs/concept_check/old_concept_function_fail.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/old_concept_function_fail.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,23 +0,0 @@
-// (C) Copyright Jeremy Siek 2000.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#ifdef NDEBUG
-#  undef NDEBUG
-#endif
-
-#include "old_concepts.hpp"
-
-// This file verifies that concepts written the old way still catch
-// errors in function context.  This is not expected to work on
-// compilers without SFINAE support.
-
-struct foo { };
-
-int
-main()
-{
-    boost::function_requires< old::EqualityComparableConcept<foo> >();
-    return 0;
-}

Deleted: boost/trunk/libs/concept_check/old_concept_pass.cpp
===================================================================
--- boost/trunk/libs/concept_check/old_concept_pass.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/old_concept_pass.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,34 +0,0 @@
-// (C) Copyright Jeremy Siek, David Abrahams 2000-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)
-
-#include <boost/concept_check.hpp>
-#include "old_concepts.hpp"
-
-// This test verifies that use of the old-style concept checking
-// classes still compiles (but not that it detects constraint
-// violations).  We check them with the old-style macros just for
-// completeness, since those macros stranslate into
-// BOOST_CONCEPT_ASSERTs.
-
-struct foo { bool operator()(int) { return true; } };
-struct bar { bool operator()(int, char) { return true; } };
-
-
-class class_requires_test
-{
-  BOOST_CLASS_REQUIRE(int, old, EqualityComparableConcept);
-  typedef int* int_ptr; typedef const int* const_int_ptr;
-  BOOST_CLASS_REQUIRE2(int_ptr, const_int_ptr, old, EqualOpConcept);
-  BOOST_CLASS_REQUIRE3(foo, bool, int, old, UnaryFunctionConcept);
-  BOOST_CLASS_REQUIRE4(bar, bool, int, char, old, BinaryFunctionConcept);
-};
-
-int
-main()
-{
-    class_requires_test x;
-    boost::ignore_unused_variable_warning(x);
-    return 0;
-}

Deleted: boost/trunk/libs/concept_check/old_concepts.hpp
===================================================================
--- boost/trunk/libs/concept_check/old_concepts.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/old_concepts.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,67 +0,0 @@
-// Copyright Jeremy Siek, David Abrahams 2000-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)
-#ifndef BOOST_LIBS_CONCEPT_CHECK_OLD_CONCEPTS_DWA2006428_HPP
-# define BOOST_LIBS_CONCEPT_CHECK_OLD_CONCEPTS_DWA2006428_HPP
-
-#include <boost/concept_check.hpp>
-
-namespace old
-{
-  template <class TT>
-  void require_boolean_expr(const TT& t) {
-    bool x = t;
-    boost::ignore_unused_variable_warning(x);
-  }
-  
-  template <class TT>
-  struct EqualityComparableConcept
-  {
-    void constraints() {
-        boost::require_boolean_expr(a == b);
-        boost::require_boolean_expr(a != b);
-    }
-    TT a, b;
-  };
-
-  template <class Func, class Return, class Arg>
-  struct UnaryFunctionConcept
-  {
-    // required in case any of our template args are const-qualified:
-    UnaryFunctionConcept();
-    
-    void constraints() {
-      r = f(arg); // require operator()
-    }
-    Func f;
-    Arg arg;
-    Return r;
-  };
-
-  template <class Func, class Return, class First, class Second>
-  struct BinaryFunctionConcept
-  {
-    void constraints() { 
-      r = f(first, second); // require operator()
-    }
-    Func f;
-    First first;
-    Second second;
-    Return r;
-  };
-
-#define DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(OP,NAME) \
-  template <class First, class Second> \
-  struct NAME { \
-    void constraints() { (void)constraints_(); } \
-    bool constraints_() {  \
-      return  a OP b; \
-    } \
-    First a; \
-    Second b; \
-  }
-
-  DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(==, EqualOpConcept);
-}
-
-#endif // BOOST_LIBS_CONCEPT_CHECK_OLD_CONCEPTS_DWA2006428_HPP

Modified: boost/trunk/libs/concept_check/stl_concept_check.cpp
===================================================================
--- boost/trunk/libs/concept_check/stl_concept_check.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/stl_concept_check.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,7 +20,7 @@
 #include <vector>
 #include <list>
 #include <deque>
-#if 0
+#ifndef BOOST_NO_SLIST
 #include <slist>
 #endif
 
@@ -43,27 +43,27 @@
   typedef std::list<int> List;
 
   // VC++ missing pointer and const_pointer typedefs
-  function_requires< Mutable_RandomAccessContainer<Vector> >();
-  function_requires< BackInsertionSequence<Vector> >();
+  function_requires< Mutable_RandomAccessContainerConcept<Vector> >();
+  function_requires< BackInsertionSequenceConcept<Vector> >();
 
 #if !(defined(__GNUC__) && defined(BOOST_HIDE_EXPECTED_ERRORS))
 #if !(defined(__sgi) && defined(BOOST_HIDE_EXPECTED_ERRORS))
   // old deque iterator missing n + iter operation
-  function_requires< Mutable_RandomAccessContainer<Deque> >();
+  function_requires< Mutable_RandomAccessContainerConcept<Deque> >();
 #endif
   // warnings about signed and unsigned in old deque version
-  function_requires< FrontInsertionSequence<Deque> >();
-  function_requires< BackInsertionSequence<Deque> >();
+  function_requires< FrontInsertionSequenceConcept<Deque> >();
+  function_requires< BackInsertionSequenceConcept<Deque> >();
 #endif
 
   // VC++ missing pointer and const_pointer typedefs
-  function_requires< Mutable_ReversibleContainer<List> >();
-  function_requires< FrontInsertionSequence<List> >();
-  function_requires< BackInsertionSequence<List> >();
+  function_requires< Mutable_ReversibleContainerConcept<List> >();
+  function_requires< FrontInsertionSequenceConcept<List> >();
+  function_requires< BackInsertionSequenceConcept<List> >();
 
-#if 0
+#ifndef BOOST_NO_SLIST
   typedef BOOST_STD_EXTENSION_NAMESPACE::slist<int> SList;
-  function_requires< FrontInsertionSequence<SList> >();
+  function_requires< FrontInsertionSequenceConcept<SList> >();
 #endif
 
   typedef std::set<int> Set;
@@ -71,21 +71,21 @@
   typedef std::map<int,int> Map;
   typedef std::multimap<int,int> MultiMap;
 
-  function_requires< SortedAssociativeContainer<Set> >();
-  function_requires< SimpleAssociativeContainer<Set> >();
-  function_requires< UniqueAssociativeContainer<Set> >();
+  function_requires< SortedAssociativeContainerConcept<Set> >();
+  function_requires< SimpleAssociativeContainerConcept<Set> >();
+  function_requires< UniqueAssociativeContainerConcept<Set> >();
 
-  function_requires< SortedAssociativeContainer<MultiSet> >();
-  function_requires< SimpleAssociativeContainer<MultiSet> >();
-  function_requires< MultipleAssociativeContainer<MultiSet> >();
+  function_requires< SortedAssociativeContainerConcept<MultiSet> >();
+  function_requires< SimpleAssociativeContainerConcept<MultiSet> >();
+  function_requires< MultipleAssociativeContainerConcept<MultiSet> >();
 
-  function_requires< SortedAssociativeContainer<Map> >();
-  function_requires< UniqueAssociativeContainer<Map> >();
-  function_requires< PairAssociativeContainer<Map> >();
+  function_requires< SortedAssociativeContainerConcept<Map> >();
+  function_requires< UniqueAssociativeContainerConcept<Map> >();
+  function_requires< PairAssociativeContainerConcept<Map> >();
 
-  function_requires< SortedAssociativeContainer<MultiMap> >();
-  function_requires< MultipleAssociativeContainer<MultiMap> >();
-  function_requires< PairAssociativeContainer<MultiMap> >();
+  function_requires< SortedAssociativeContainerConcept<MultiMap> >();
+  function_requires< MultipleAssociativeContainerConcept<MultiMap> >();
+  function_requires< PairAssociativeContainerConcept<MultiMap> >();
 #endif
 
   return 0;

Modified: boost/trunk/libs/concept_check/stl_concept_covering.cpp
===================================================================
--- boost/trunk/libs/concept_check/stl_concept_covering.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/stl_concept_covering.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -177,7 +177,7 @@
     typedef equal_op_first_archetype<> Left;
     typedef input_iterator_archetype<Left> InIter;
     InIter in;
-    function_requires< InputIterator<InIter> >();
+    function_requires< InputIteratorConcept<InIter> >();
     equal_op_second_archetype<> value(dummy_cons);
     std::iterator_traits<InIter>::difference_type
       n = std::count(in, in, value);

Deleted: boost/trunk/libs/concept_check/where.cpp
===================================================================
--- boost/trunk/libs/concept_check/where.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/where.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +0,0 @@
-// 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)
-#include <vector>
-#undef NDEBUG
-#include "fake_sort.hpp"
-
-int main()
-{
-  std::vector<int> v;
-  fake::sort(v.begin(), v.end());
-  return 0;
-}

Deleted: boost/trunk/libs/concept_check/where_fail.cpp
===================================================================
--- boost/trunk/libs/concept_check/where_fail.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/concept_check/where_fail.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +0,0 @@
-// 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)
-#include <list>
-#undef NDEBUG
-#include "fake_sort.hpp"
-
-int main()
-{
-  std::list<int> v;
-  fake::sort(v.begin(), v.end());
-  return 0;
-}

Modified: boost/trunk/libs/config/config.htm
===================================================================
--- boost/trunk/libs/config/config.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/config.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -863,12 +863,11 @@
          <tr>
             <td valign="top" width="48%">BOOST_HAS_HASH</td>
             <td valign="top" width="15%">Standard library</td>
-            <td valign="top" width="37%">The C++ implementation provides the (SGI) hash_set and
-               hash_map classes. When defined,
-              BOOST_HASH_SET_HEADER and BOOST_HASH_LIST_HEADER will contain the names of the header
-              needed to access hash_set and hash_map; BOOST_STD_EXTENSION_NAMESPACE
-              will provide the namespace in which the two class templates
-              reside.</td>
+            <td valign="top" width="37%">The C++ implementation provides the (SGI) hash_set 
+               and hash_map classes. When defined, BOOST_HASH_SET_HEADER and 
+               BOOST_HASH_LIST_HEADER will contain the names of the header needed to access 
+               hash_set and hash_map; BOOST_STD_EXTENSION_NAMESPACE will provide the namespace 
+               in which the two class templates reside.</td>
          </tr>
          <TR>
             <TD vAlign="top" width="48%">BOOST_HAS_LOG1P</TD>
@@ -954,12 +953,10 @@
          <tr>
             <td valign="top" width="48%">BOOST_HAS_SLIST</td>
             <td valign="top" width="15%">Standard library</td>
-            <td valign="top" width="37%">The C++ implementation
-              provides the (SGI) slist class. When defined,
-              BOOST_SLIST_HEADER will contain the name of the header
-              needed to access slist and BOOST_STD_EXTENSION_NAMESPACE
-              will provide the namespace in which slist
-              resides.</td>
+            <td valign="top" width="37%">The C++ implementation provides the (SGI) slist 
+               class. When defined, BOOST_SLIST_HEADER will contain the name of the header 
+               needed to access slist and BOOST_STD_EXTENSION_NAMESPACE will provide the 
+               namespace in which slist resides.</td>
          </tr>
          <tr>
             <td valign="top" width="48%">BOOST_HAS_STLP_USE_FACET</td>
@@ -1146,16 +1143,19 @@
             </td>
          </tr>
          <tr>
-           <td>BOOST_HASH_MAP_HEADER</td>
-           <td>The header to include to get the SGI hash_map class. This macro is only available if BOOST_HAS_HASH is defined.</td>
+            <td>BOOST_HASH_MAP_HEADER</td>
+            <td>The header to include to get the SGI hash_map class. This macro is only 
+               available if BOOST_HAS_HASH is defined.</td>
          </tr>
          <tr>
-           <td>BOOST_HASH_SET_HEADER</td>
-           <td>The header to include to get the SGI hash_set class. This macro is only available if BOOST_HAS_HASH is defined.</td>
+            <td>BOOST_HASH_SET_HEADER</td>
+            <td>The header to include to get the SGI hash_set class. This macro is only 
+               available if BOOST_HAS_HASH is defined.</td>
          </tr>
          <tr>
-           <td>BOOST_SLIST_HEADER</td>
-           <td>The header to include to get the SGI slist class. This macro is only available if BOOST_HAS_SLIST is defined.</td>
+            <td>BOOST_SLIST_HEADER</td>
+            <td>The header to include to get the SGI slist class. This macro is only available 
+               if BOOST_HAS_SLIST is defined.</td>
          </tr>
          <tr>
             <td>BOOST_STD_EXTENSION_NAMESPACE</td>
@@ -1665,9 +1665,11 @@
          members, past and present, have contributed fixes to boost's configuration.</p>
       <p>&nbsp;</p>
       <hr>
-      <p>© Beman Dawes 2001</p>
-      <p>© Vesa Karvonen 2001</p>
-      <p>© John Maddock 2001</p>
+      <p>Copyright&nbsp;Beman Dawes 2001</p>
+      <p>Copyright&nbsp;Vesa Karvonen 2001</p>
+      <p>Copyright&nbsp;John Maddock 2001</p>
+      <P>Distributed under the Boost Software License, Version 1.0. (See accompanying file <A href="../../LICENSE_1_0.txt">
+            LICENSE_1_0.txt</A> or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</A>).</P>
       <p>&nbsp;</p>
       <p>&nbsp;</p>
       <p>&nbsp;</p>
@@ -1675,3 +1677,4 @@
       <p>&nbsp;</p>
    </body>
 </html>
+

Modified: boost/trunk/libs/config/index.html
===================================================================
--- boost/trunk/libs/config/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,14 @@
 <html>
-<head>
-<meta http-equiv="refresh" content="0; URL=config.htm">
-</head>
-<body>
-Automatic redirection failed, please go to
-<a href="config.htm">config.htm</a>.
-</body>
-</html>
\ No newline at end of file
+   <head>
+      <meta http-equiv="refresh" content="0; URL=config.htm">
+   </head>
+   <body>
+      <P>
+         Automatic redirection failed, please go to <a href="config.htm">config.htm</a>.
+      </P>
+      <P>Copyright&nbsp;John Maddock 2001</P>
+      <P>Distributed under the Boost Software License, Version 1.0. (See accompanying file <A href="../../LICENSE_1_0.txt">
+            LICENSE_1_0.txt</A> or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</A>).</P>
+   </body>
+</html>
+

Deleted: boost/trunk/libs/config/test/Jamfile
===================================================================
--- boost/trunk/libs/config/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,327 +0,0 @@
-#
-# Regression test Jamfile for boost configuration setup.
-# *** DO NOT EDIT THIS FILE BY HAND ***
-# This file was automatically generated on Wed Feb 15 14:14:07 2006
-#  by libs/config/tools/generate.cpp
-# Copyright John Maddock.
-#
-# If you need to alter build preferences then set them in
-# the template defined in options.jam.
-#
-subproject libs/config/test ;
-# bring in the rules for testing
-import testing ./options ;
-
-run config_info.cpp <template>config_options ;
-run math_info.cpp <template>config_options : : : <borland><*><runtime-link>static ;
-run config_test.cpp <template>config_options ;
-run limits_test.cpp <template>config_test_options ;
-run abi/abi_test.cpp abi/main.cpp <template>config_options ;
-
-test-suite "BOOST_HAS_TWO_ARG_USE_FACET" : 
-[ run has_2arg_use_facet_pass.cpp <template>config_options ]
-[ compile-fail has_2arg_use_facet_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_BETHREADS" : 
-[ run has_bethreads_pass.cpp <template>config_options ]
-[ compile-fail has_bethreads_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_CLOCK_GETTIME" : 
-[ run has_clock_gettime_pass.cpp <template>config_options ]
-[ compile-fail has_clock_gettime_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_DIRENT_H" : 
-[ run has_dirent_h_pass.cpp <template>config_options ]
-[ compile-fail has_dirent_h_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_EXPM1" : 
-[ run has_expm1_pass.cpp <template>config_options ]
-[ compile-fail has_expm1_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_FTIME" : 
-[ run has_ftime_pass.cpp <template>config_options ]
-[ compile-fail has_ftime_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_GETTIMEOFDAY" : 
-[ run has_gettimeofday_pass.cpp <template>config_options ]
-[ compile-fail has_gettimeofday_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_HASH" : 
-[ run has_hash_pass.cpp <template>config_options ]
-[ compile-fail has_hash_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_LOG1P" : 
-[ run has_log1p_pass.cpp <template>config_options ]
-[ compile-fail has_log1p_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_LONG_LONG" : 
-[ run has_long_long_pass.cpp <template>config_options ]
-[ compile-fail has_long_long_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_MACRO_USE_FACET" : 
-[ run has_macro_use_facet_pass.cpp <template>config_options ]
-[ compile-fail has_macro_use_facet_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_MS_INT64" : 
-[ run has_ms_int64_pass.cpp <template>config_options ]
-[ compile-fail has_ms_int64_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_NANOSLEEP" : 
-[ run has_nanosleep_pass.cpp <template>config_options ]
-[ compile-fail has_nanosleep_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_NL_TYPES_H" : 
-[ run has_nl_types_h_pass.cpp <template>config_options ]
-[ compile-fail has_nl_types_h_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_NRVO" : 
-[ run has_nrvo_pass.cpp <template>config_options ]
-[ compile-fail has_nrvo_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_PARTIAL_STD_ALLOCATOR" : 
-[ run has_part_alloc_pass.cpp <template>config_options ]
-[ compile-fail has_part_alloc_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_PTHREADS" : 
-[ run has_pthreads_pass.cpp <template>config_options ]
-[ compile-fail has_pthreads_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_PTHREAD_DELAY_NP" : 
-[ run has_pthread_delay_np_pass.cpp <template>config_options ]
-[ compile-fail has_pthread_delay_np_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_PTHREAD_MUTEXATTR_SETTYPE" : 
-[ run has_pthread_ma_st_pass.cpp <template>config_options ]
-[ compile-fail has_pthread_ma_st_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_PTHREAD_YIELD" : 
-[ run has_pthread_yield_pass.cpp <template>config_options ]
-[ compile-fail has_pthread_yield_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_SCHED_YIELD" : 
-[ run has_sched_yield_pass.cpp <template>config_options ]
-[ compile-fail has_sched_yield_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_SGI_TYPE_TRAITS" : 
-[ run has_sgi_type_traits_pass.cpp <template>config_options ]
-[ compile-fail has_sgi_type_traits_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_SIGACTION" : 
-[ run has_sigaction_pass.cpp <template>config_options ]
-[ compile-fail has_sigaction_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_SLIST" : 
-[ run has_slist_pass.cpp <template>config_options ]
-[ compile-fail has_slist_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_STDINT_H" : 
-[ run has_stdint_h_pass.cpp <template>config_options ]
-[ compile-fail has_stdint_h_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_STLP_USE_FACET" : 
-[ run has_stlp_use_facet_pass.cpp <template>config_options ]
-[ compile-fail has_stlp_use_facet_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_ARRAY" : 
-[ run has_tr1_array_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_array_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_BIND" : 
-[ run has_tr1_bind_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_bind_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_COMPLEX_OVERLOADS" : 
-[ run has_tr1_complex_over_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_complex_over_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_COMPLEX_INVERSE_TRIG" : 
-[ run has_tr1_complex_trig_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_complex_trig_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_FUNCTION" : 
-[ run has_tr1_function_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_function_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_HASH" : 
-[ run has_tr1_hash_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_hash_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_MEM_FN" : 
-[ run has_tr1_mem_fn_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_mem_fn_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_RANDOM" : 
-[ run has_tr1_random_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_random_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_REFERENCE_WRAPPER" : 
-[ run has_tr1_ref_wrap_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_ref_wrap_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_REGEX" : 
-[ run has_tr1_regex_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_regex_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_RESULT_OF" : 
-[ run has_tr1_result_of_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_result_of_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_SHARED_PTR" : 
-[ run has_tr1_shared_ptr_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_shared_ptr_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_TUPLE" : 
-[ run has_tr1_tuple_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_tuple_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_TYPE_TRAITS" : 
-[ run has_tr1_type_traits_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_type_traits_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_UNORDERED_MAP" : 
-[ run has_tr1_unordered_map_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_unordered_map_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_UNORDERED_SET" : 
-[ run has_tr1_unordered_set_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_unordered_set_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_TR1_UTILITY" : 
-[ run has_tr1_utility_pass.cpp <template>config_options ]
-[ compile-fail has_tr1_utility_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_UNISTD_H" : 
-[ run has_unistd_h_pass.cpp <template>config_options ]
-[ compile-fail has_unistd_h_fail.cpp <template>config_options ] ;
-test-suite "BOOST_MSVC6_MEMBER_TEMPLATES" : 
-[ run has_vc6_mem_templ_pass.cpp <template>config_options ]
-[ compile-fail has_vc6_mem_templ_fail.cpp <template>config_options ] ;
-test-suite "BOOST_MSVC_STD_ITERATOR" : 
-[ run has_vc_iterator_pass.cpp <template>config_options ]
-[ compile-fail has_vc_iterator_fail.cpp <template>config_options ] ;
-test-suite "BOOST_HAS_WINTHREADS" : 
-[ run has_winthreads_pass.cpp <template>config_options ]
-[ compile-fail has_winthreads_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP" : 
-[ run no_arg_dep_lookup_pass.cpp <template>config_options ]
-[ compile-fail no_arg_dep_lookup_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS" : 
-[ run no_array_type_spec_pass.cpp <template>config_options ]
-[ compile-fail no_array_type_spec_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_AUTO_PTR" : 
-[ run no_auto_ptr_pass.cpp <template>config_options ]
-[ compile-fail no_auto_ptr_fail.cpp <template>config_options ] ;
-test-suite "BOOST_BCB_PARTIAL_SPECIALIZATION_BUG" : 
-[ run no_bcb_partial_spec_pass.cpp <template>config_options ]
-[ compile-fail no_bcb_partial_spec_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_CTYPE_FUNCTIONS" : 
-[ run no_ctype_functions_pass.cpp <template>config_options ]
-[ compile-fail no_ctype_functions_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_CV_SPECIALIZATIONS" : 
-[ run no_cv_spec_pass.cpp <template>config_options ]
-[ compile-fail no_cv_spec_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_CV_VOID_SPECIALIZATIONS" : 
-[ run no_cv_void_spec_pass.cpp <template>config_options ]
-[ compile-fail no_cv_void_spec_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_CWCHAR" : 
-[ run no_cwchar_pass.cpp <template>config_options ]
-[ compile-fail no_cwchar_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_CWCTYPE" : 
-[ run no_cwctype_pass.cpp <template>config_options ]
-[ compile-fail no_cwctype_fail.cpp <template>config_options ] ;
-test-suite "BOOST_DEDUCED_TYPENAME" : 
-[ run no_ded_typename_pass.cpp <template>config_options ]
-[ compile-fail no_ded_typename_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_DEPENDENT_NESTED_DERIVATIONS" : 
-[ run no_dep_nested_class_pass.cpp <template>config_options ]
-[ compile-fail no_dep_nested_class_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_DEPENDENT_TYPES_IN_TEMPLATE_VALUE_PARAMETERS" : 
-[ run no_dep_val_param_pass.cpp <template>config_options ]
-[ compile-fail no_dep_val_param_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_EXCEPTIONS" : 
-[ run no_exceptions_pass.cpp <template>config_options ]
-[ compile-fail no_exceptions_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_EXCEPTION_STD_NAMESPACE" : 
-[ run no_excep_std_pass.cpp <template>config_options ]
-[ compile-fail no_excep_std_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_EXPLICIT_FUNCTION_TEMPLATE_ARGUMENTS" : 
-[ run no_exp_func_tem_arg_pass.cpp <template>config_options ]
-[ compile-fail no_exp_func_tem_arg_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_FUNCTION_TEMPLATE_ORDERING" : 
-[ run no_func_tmp_order_pass.cpp <template>config_options ]
-[ compile-fail no_func_tmp_order_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_MS_INT64_NUMERIC_LIMITS" : 
-[ run no_i64_limits_pass.cpp <template>config_options ]
-[ compile-fail no_i64_limits_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_INCLASS_MEMBER_INITIALIZATION" : 
-[ run no_inline_memb_init_pass.cpp <template>config_options ]
-[ compile-fail no_inline_memb_init_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_INTEGRAL_INT64_T" : 
-[ run no_integral_int64_t_pass.cpp <template>config_options ]
-[ compile-fail no_integral_int64_t_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_IS_ABSTRACT" : 
-[ run no_is_abstract_pass.cpp <template>config_options ]
-[ compile-fail no_is_abstract_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS" : 
-[ run no_iter_construct_pass.cpp <template>config_options ]
-[ compile-fail no_iter_construct_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_LIMITS" : 
-[ run no_limits_pass.cpp <template>config_options ]
-[ compile-fail no_limits_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS" : 
-[ run no_limits_const_exp_pass.cpp <template>config_options ]
-[ compile-fail no_limits_const_exp_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_LONG_LONG_NUMERIC_LIMITS" : 
-[ run no_ll_limits_pass.cpp <template>config_options ]
-[ compile-fail no_ll_limits_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_MEMBER_FUNCTION_SPECIALIZATIONS" : 
-[ run no_mem_func_spec_pass.cpp <template>config_options ]
-[ compile-fail no_mem_func_spec_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_MEMBER_TEMPLATES" : 
-[ run no_mem_templates_pass.cpp <template>config_options ]
-[ compile-fail no_mem_templates_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_MEMBER_TEMPLATE_FRIENDS" : 
-[ run no_mem_templ_frnds_pass.cpp <template>config_options ]
-[ compile-fail no_mem_templ_frnds_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_MEMBER_TEMPLATE_KEYWORD" : 
-[ run no_mem_tem_keyword_pass.cpp <template>config_options ]
-[ compile-fail no_mem_tem_keyword_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_POINTER_TO_MEMBER_TEMPLATE_PARAMETERS" : 
-[ run no_mem_tem_pnts_pass.cpp <template>config_options ]
-[ compile-fail no_mem_tem_pnts_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_OPERATORS_IN_NAMESPACE" : 
-[ run no_ops_in_namespace_pass.cpp <template>config_options ]
-[ compile-fail no_ops_in_namespace_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION" : 
-[ run no_partial_spec_pass.cpp <template>config_options ]
-[ compile-fail no_partial_spec_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_PRIVATE_IN_AGGREGATE" : 
-[ run no_priv_aggregate_pass.cpp <template>config_options ]
-[ compile-fail no_priv_aggregate_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_POINTER_TO_MEMBER_CONST" : 
-[ run no_ptr_mem_const_pass.cpp <template>config_options ]
-[ compile-fail no_ptr_mem_const_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_UNREACHABLE_RETURN_DETECTION" : 
-[ run no_ret_det_pass.cpp <template>config_options ]
-[ compile-fail no_ret_det_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_SFINAE" : 
-[ run no_sfinae_pass.cpp <template>config_options ]
-[ compile-fail no_sfinae_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_STRINGSTREAM" : 
-[ run no_sstream_pass.cpp <template>config_options ]
-[ compile-fail no_sstream_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_STDC_NAMESPACE" : 
-[ run no_stdc_namespace_pass.cpp <template>config_options ]
-[ compile-fail no_stdc_namespace_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_STD_ALLOCATOR" : 
-[ run no_std_allocator_pass.cpp <template>config_options ]
-[ compile-fail no_std_allocator_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_STD_DISTANCE" : 
-[ run no_std_distance_pass.cpp <template>config_options ]
-[ compile-fail no_std_distance_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_STD_ITERATOR" : 
-[ run no_std_iterator_pass.cpp <template>config_options ]
-[ compile-fail no_std_iterator_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_STD_ITERATOR_TRAITS" : 
-[ run no_std_iter_traits_pass.cpp <template>config_options ]
-[ compile-fail no_std_iter_traits_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_STD_LOCALE" : 
-[ run no_std_locale_pass.cpp <template>config_options ]
-[ compile-fail no_std_locale_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_STD_MESSAGES" : 
-[ run no_std_messages_pass.cpp <template>config_options ]
-[ compile-fail no_std_messages_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_STD_MIN_MAX" : 
-[ run no_std_min_max_pass.cpp <template>config_options ]
-[ compile-fail no_std_min_max_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_STD_OUTPUT_ITERATOR_ASSIGN" : 
-[ run no_std_oi_assign_pass.cpp <template>config_options ]
-[ compile-fail no_std_oi_assign_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_STD_USE_FACET" : 
-[ run no_std_use_facet_pass.cpp <template>config_options ]
-[ compile-fail no_std_use_facet_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_STD_WSTREAMBUF" : 
-[ run no_std_wstreambuf_pass.cpp <template>config_options ]
-[ compile-fail no_std_wstreambuf_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_STD_WSTRING" : 
-[ run no_std_wstring_pass.cpp <template>config_options ]
-[ compile-fail no_std_wstring_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_SWPRINTF" : 
-[ run no_swprintf_pass.cpp <template>config_options ]
-[ compile-fail no_swprintf_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_TEMPLATE_TEMPLATES" : 
-[ run no_template_template_pass.cpp <template>config_options ]
-[ compile-fail no_template_template_fail.cpp <template>config_options ] ;
-test-suite "BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL" : 
-[ run no_using_breaks_adl_pass.cpp <template>config_options ]
-[ compile-fail no_using_breaks_adl_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_USING_DECLARATION_OVERLOADS_FROM_TYPENAME_BASE" : 
-[ run no_using_decl_overld_pass.cpp <template>config_options ]
-[ compile-fail no_using_decl_overld_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_USING_TEMPLATE" : 
-[ run no_using_template_pass.cpp <template>config_options ]
-[ compile-fail no_using_template_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_VOID_RETURNS" : 
-[ run no_void_returns_pass.cpp <template>config_options ]
-[ compile-fail no_void_returns_fail.cpp <template>config_options ] ;
-test-suite "BOOST_NO_INTRINSIC_WCHAR_T" : 
-[ run no_wchar_t_pass.cpp <template>config_options ]
-[ compile-fail no_wchar_t_fail.cpp <template>config_options ] ;
-

Modified: boost/trunk/libs/config/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/config/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,9 @@
 # This file was automatically generated on Wed Feb 15 14:14:07 2006
 #  by libs/config/tools/generate.cpp
 # Copyright John Maddock.
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # If you need to alter build preferences then set them in
 # the template defined in options_v2.jam.
@@ -324,3 +327,4 @@
 [ run no_wchar_t_pass.cpp ]
 [ compile-fail no_wchar_t_fail.cpp ] ;
 
+

Modified: boost/trunk/libs/config/test/boost_no_mem_tem_pnts.ipp
===================================================================
--- boost/trunk/libs/config/test/boost_no_mem_tem_pnts.ipp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/boost_no_mem_tem_pnts.ipp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,4 @@
-//  (C) Joaquín M López Muñoz 2004.
+//  Copyright (C) Joaquín M López Muñoz 2004.
 //  Use, modification and distribution are subject to the
 //  Boost Software License, Version 1.0. (See accompanying file
 //  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -47,3 +47,4 @@
 
 
 
+

Modified: boost/trunk/libs/config/test/config_info.cpp
===================================================================
--- boost/trunk/libs/config/test/config_info.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/config_info.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -890,6 +890,7 @@
    // then defect and feature macros:
    PRINT_MACRO(BOOST_DISABLE_THREADS);
    PRINT_MACRO(BOOST_DISABLE_WIN32);
+   PRINT_MACRO(BOOST_HAS_THREADS);
 
    // BEGIN GENERATED BLOCK DO NOT EDIT THIS!!!!!!
    PRINT_MACRO(BOOST_BCB_PARTIAL_SPECIALIZATION_BUG);
@@ -1036,3 +1037,4 @@
 
 
 
+

Deleted: boost/trunk/libs/config/test/link/Jamfile
===================================================================
--- boost/trunk/libs/config/test/link/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/link/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,38 +0,0 @@
-# copyright John Maddock 2003
-
-subproject libs/config/test/link ;
-
-dll link_test : link_test.cpp 
-    : 
-    <runtime-link>dynamic
-    <define>BOOST_DYN_LINK=1
-    <sysinclude>$(BOOST_ROOT)
-    # make sure the names of the libraries are correctly named:
-    common-variant-tag
-    : 
-        debug release
-    ;
-
-lib link_test : link_test.cpp 
-    : 
-    <sysinclude>$(BOOST_ROOT)
-    # make sure the names of the libraries are correctly named:
-    common-variant-tag
-    : 
-        debug release
-    ;
-
-stage stage/lib : <lib>link_test <dll>link_test
-    :
-        # copy to a path rooted at BOOST_ROOT:
-        <locate>$(BOOST_ROOT)
-        # make sure the names of the libraries are correctly named:
-        common-variant-tag
-        # add this target to the "stage" and "all" psuedo-targets:
-        <target>stage
-        <target>all
-    :
-        debug release
-    ;
-
-

Modified: boost/trunk/libs/config/test/link/Jamfile.v2
===================================================================
--- boost/trunk/libs/config/test/link/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/link/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,7 @@
 # copyright John Maddock 2003
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 lib link_test : link_test.cpp 
     : <link>shared <runtime-link>shared 
@@ -10,3 +13,4 @@
     : 
         debug release
     ;
+

Modified: boost/trunk/libs/config/test/link/bc_gen.sh
===================================================================
--- boost/trunk/libs/config/test/link/bc_gen.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/link/bc_gen.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #! /bin/bash
 
+# copyright John Maddock 2005
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 libname=""
 src=""
 header=""
@@ -205,6 +210,10 @@
 	
 	
 	cat > $out << EOF
+# copyright John Maddock 2005
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # auto generated makefile for C++ Builder
 #
@@ -272,3 +281,6 @@
 
 
 
+
+
+

Modified: boost/trunk/libs/config/test/link/borland.mak
===================================================================
--- boost/trunk/libs/config/test/link/borland.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/link/borland.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2005
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # auto generated makefile for C++ Builder
 #
@@ -37,31 +41,31 @@
 
 ALL_HEADER=
 
-all : borland borland\liblink_test-borland-s-1_31 borland\liblink_test-borland-s-1_31.lib borland\liblink_test-borland-s-1_31.exe borland\liblink_test-borland-mt-s-1_31 borland\liblink_test-borland-mt-s-1_31.lib borland\liblink_test-borland-mt-s-1_31.exe borland\link_test-borland-mt-1_31 borland\link_test-borland-mt-1_31.lib borland\link_test-borland-mt-1_31.exe borland\link_test-borland-1_31 borland\link_test-borland-1_31.lib borland\link_test-borland-1_31.exe borland\liblink_test-borland-mt-1_31 borland\liblink_test-borland-mt-1_31.lib borland\liblink_test-borland-mt-1_31.exe borland\liblink_test-borland-1_31 borland\liblink_test-borland-1_31.lib borland\liblink_test-borland-1_31.exe borland\liblink_test-borland-sd-1_31 borland\liblink_test-borland-sd-1_31.lib borland\liblink_test-borland-sd-1_31.exe borland\liblink_test-borland-mt-sd-1_31 borland\liblink_test-borland-mt-sd-1_31.lib borland\liblink_test-borland-mt-sd-1_31.exe borland\link_test-borland-mt-d-1_31 borland\link_test-borland-mt-d-1_31.lib borland\link_test-borland-mt-d-1_31.exe borland\link_test-borland-d-1_31 borland\link_test-borland-d-1_31.lib borland\link_test-borland-d-1_31.exe borland\liblink_test-borland-mt-d-1_31 borland\liblink_test-borland-mt-d-1_31.lib borland\liblink_test-borland-mt-d-1_31.exe borland\liblink_test-borland-d-1_31 borland\liblink_test-borland-d-1_31.lib borland\liblink_test-borland-d-1_31.exe
+all : borland borland\liblink_test-borland-s-1_34 borland\liblink_test-borland-s-1_34.lib borland\liblink_test-borland-s-1_34.exe borland\liblink_test-borland-mt-s-1_34 borland\liblink_test-borland-mt-s-1_34.lib borland\liblink_test-borland-mt-s-1_34.exe borland\link_test-borland-mt-1_34 borland\link_test-borland-mt-1_34.lib borland\link_test-borland-mt-1_34.exe borland\link_test-borland-1_34 borland\link_test-borland-1_34.lib borland\link_test-borland-1_34.exe borland\liblink_test-borland-mt-1_34 borland\liblink_test-borland-mt-1_34.lib borland\liblink_test-borland-mt-1_34.exe borland\liblink_test-borland-1_34 borland\liblink_test-borland-1_34.lib borland\liblink_test-borland-1_34.exe borland\liblink_test-borland-sd-1_34 borland\liblink_test-borland-sd-1_34.lib borland\liblink_test-borland-sd-1_34.exe borland\liblink_test-borland-mt-sd-1_34 borland\liblink_test-borland-mt-sd-1_34.lib borland\liblink_test-borland-mt-sd-1_34.exe borland\link_test-borland-mt-d-1_34 borland\link_test-borland-mt-d-1_34.lib borland\link_test-borland-mt-d-1_34.exe borland\link_test-borland-d-1_34 borland\link_test-borland-d-1_34.lib borland\link_test-borland-d-1_34.exe borland\liblink_test-borland-mt-d-1_34 borland\liblink_test-borland-mt-d-1_34.lib borland\liblink_test-borland-mt-d-1_34.exe borland\liblink_test-borland-d-1_34 borland\liblink_test-borland-d-1_34.lib borland\liblink_test-borland-d-1_34.exe
 
-clean :  liblink_test-borland-s-1_31_clean liblink_test-borland-mt-s-1_31_clean link_test-borland-mt-1_31_clean link_test-borland-1_31_clean liblink_test-borland-mt-1_31_clean liblink_test-borland-1_31_clean liblink_test-borland-sd-1_31_clean liblink_test-borland-mt-sd-1_31_clean link_test-borland-mt-d-1_31_clean link_test-borland-d-1_31_clean liblink_test-borland-mt-d-1_31_clean liblink_test-borland-d-1_31_clean
+clean :  liblink_test-borland-s-1_34_clean liblink_test-borland-mt-s-1_34_clean link_test-borland-mt-1_34_clean link_test-borland-1_34_clean liblink_test-borland-mt-1_34_clean liblink_test-borland-1_34_clean liblink_test-borland-sd-1_34_clean liblink_test-borland-mt-sd-1_34_clean link_test-borland-mt-d-1_34_clean link_test-borland-d-1_34_clean liblink_test-borland-mt-d-1_34_clean liblink_test-borland-d-1_34_clean
 
 install : all
-	copy borland\liblink_test-borland-s-1_31.lib $(BCROOT)\lib
-	copy borland\liblink_test-borland-mt-s-1_31.lib $(BCROOT)\lib
-	copy borland\link_test-borland-mt-1_31.lib $(BCROOT)\lib
-	copy borland\link_test-borland-mt-1_31.dll $(BCROOT)\bin
-	copy borland\link_test-borland-mt-1_31.tds $(BCROOT)\bin
-	copy borland\link_test-borland-1_31.lib $(BCROOT)\lib
-	copy borland\link_test-borland-1_31.dll $(BCROOT)\bin
-	copy borland\link_test-borland-1_31.tds $(BCROOT)\bin
-	copy borland\liblink_test-borland-mt-1_31.lib $(BCROOT)\lib
-	copy borland\liblink_test-borland-1_31.lib $(BCROOT)\lib
-	copy borland\liblink_test-borland-sd-1_31.lib $(BCROOT)\lib
-	copy borland\liblink_test-borland-mt-sd-1_31.lib $(BCROOT)\lib
-	copy borland\link_test-borland-mt-d-1_31.lib $(BCROOT)\lib
-	copy borland\link_test-borland-mt-d-1_31.dll $(BCROOT)\bin
-	copy borland\link_test-borland-mt-d-1_31.tds $(BCROOT)\bin
-	copy borland\link_test-borland-d-1_31.lib $(BCROOT)\lib
-	copy borland\link_test-borland-d-1_31.dll $(BCROOT)\bin
-	copy borland\link_test-borland-d-1_31.tds $(BCROOT)\bin
-	copy borland\liblink_test-borland-mt-d-1_31.lib $(BCROOT)\lib
-	copy borland\liblink_test-borland-d-1_31.lib $(BCROOT)\lib
+	copy borland\liblink_test-borland-s-1_34.lib $(BCROOT)\lib
+	copy borland\liblink_test-borland-mt-s-1_34.lib $(BCROOT)\lib
+	copy borland\link_test-borland-mt-1_34.lib $(BCROOT)\lib
+	copy borland\link_test-borland-mt-1_34.dll $(BCROOT)\bin
+	copy borland\link_test-borland-mt-1_34.tds $(BCROOT)\bin
+	copy borland\link_test-borland-1_34.lib $(BCROOT)\lib
+	copy borland\link_test-borland-1_34.dll $(BCROOT)\bin
+	copy borland\link_test-borland-1_34.tds $(BCROOT)\bin
+	copy borland\liblink_test-borland-mt-1_34.lib $(BCROOT)\lib
+	copy borland\liblink_test-borland-1_34.lib $(BCROOT)\lib
+	copy borland\liblink_test-borland-sd-1_34.lib $(BCROOT)\lib
+	copy borland\liblink_test-borland-mt-sd-1_34.lib $(BCROOT)\lib
+	copy borland\link_test-borland-mt-d-1_34.lib $(BCROOT)\lib
+	copy borland\link_test-borland-mt-d-1_34.dll $(BCROOT)\bin
+	copy borland\link_test-borland-mt-d-1_34.tds $(BCROOT)\bin
+	copy borland\link_test-borland-d-1_34.lib $(BCROOT)\lib
+	copy borland\link_test-borland-d-1_34.dll $(BCROOT)\bin
+	copy borland\link_test-borland-d-1_34.tds $(BCROOT)\bin
+	copy borland\liblink_test-borland-mt-d-1_34.lib $(BCROOT)\lib
+	copy borland\liblink_test-borland-d-1_34.lib $(BCROOT)\lib
 
 borland :
 	- at mkdir borland
@@ -69,357 +73,357 @@
 
 ########################################################
 #
-# section for liblink_test-borland-s-1_31.lib
+# section for liblink_test-borland-s-1_34.lib
 #
 ########################################################
-borland\liblink_test-borland-s-1_31\link_test.obj: link_test.cpp $(ALL_HEADER)
+borland\liblink_test-borland-s-1_34\link_test.obj: link_test.cpp $(ALL_HEADER)
 	bcc32 @&&|
--c $(INCLUDES) -tWM- -D_NO_VCL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8037 -w-8057 -DSTRICT; -I$(BCROOT)\include;../../../../ $(CXXFLAGS) -oborland\liblink_test-borland-s-1_31\link_test.obj link_test.cpp
+-c $(INCLUDES) -tWM- -D_NO_VCL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8037 -w-8057 -DSTRICT; -I$(BCROOT)\include;../../../../ $(CXXFLAGS) -oborland\liblink_test-borland-s-1_34\link_test.obj link_test.cpp
 |
 
-borland\liblink_test-borland-s-1_31 : 
-	- at mkdir borland\liblink_test-borland-s-1_31
+borland\liblink_test-borland-s-1_34 : 
+	- at mkdir borland\liblink_test-borland-s-1_34
 
-liblink_test-borland-s-1_31_clean :
-	del borland\liblink_test-borland-s-1_31\*.obj
-	del borland\liblink_test-borland-s-1_31\*.il?
-	del borland\liblink_test-borland-s-1_31\*.csm
-	del borland\liblink_test-borland-s-1_31\*.tds
+liblink_test-borland-s-1_34_clean :
+	del borland\liblink_test-borland-s-1_34\*.obj
+	del borland\liblink_test-borland-s-1_34\*.il?
+	del borland\liblink_test-borland-s-1_34\*.csm
+	del borland\liblink_test-borland-s-1_34\*.tds
 
-borland\liblink_test-borland-s-1_31.lib : borland\liblink_test-borland-s-1_31\link_test.obj
+borland\liblink_test-borland-s-1_34.lib : borland\liblink_test-borland-s-1_34\link_test.obj
 	tlib @&&|
-/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-s-1_31.lib"  "borland\liblink_test-borland-s-1_31\link_test.obj"
+/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-s-1_34.lib"  "borland\liblink_test-borland-s-1_34\link_test.obj"
 |
 
-borland\liblink_test-borland-s-1_31.exe : main.cpp borland\liblink_test-borland-s-1_31.lib
-	bcc32 $(INCLUDES) -tWM- -D_NO_VCL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8037 -w-8057 -DSTRICT; -I$(BCROOT)\include;../../../../ /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-s-1_31.exe main.cpp
-   echo running test progam borland\liblink_test-borland-s-1_31.exe
-   borland\liblink_test-borland-s-1_31.exe
+borland\liblink_test-borland-s-1_34.exe : main.cpp borland\liblink_test-borland-s-1_34.lib
+	bcc32 $(INCLUDES) -tWM- -D_NO_VCL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8037 -w-8057 -DSTRICT; -I$(BCROOT)\include;../../../../ /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-s-1_34.exe main.cpp
+   echo running test progam borland\liblink_test-borland-s-1_34.exe
+   borland\liblink_test-borland-s-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-borland-mt-s-1_31.lib
+# section for liblink_test-borland-mt-s-1_34.lib
 #
 ########################################################
-borland\liblink_test-borland-mt-s-1_31\link_test.obj: link_test.cpp $(ALL_HEADER)
+borland\liblink_test-borland-mt-s-1_34\link_test.obj: link_test.cpp $(ALL_HEADER)
 	bcc32 @&&|
--c $(INCLUDES) -tWM -D_NO_VCL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ $(CXXFLAGS) -oborland\liblink_test-borland-mt-s-1_31\link_test.obj link_test.cpp
+-c $(INCLUDES) -tWM -D_NO_VCL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ $(CXXFLAGS) -oborland\liblink_test-borland-mt-s-1_34\link_test.obj link_test.cpp
 |
 
-borland\liblink_test-borland-mt-s-1_31 : 
-	- at mkdir borland\liblink_test-borland-mt-s-1_31
+borland\liblink_test-borland-mt-s-1_34 : 
+	- at mkdir borland\liblink_test-borland-mt-s-1_34
 
-liblink_test-borland-mt-s-1_31_clean :
-	del borland\liblink_test-borland-mt-s-1_31\*.obj
-	del borland\liblink_test-borland-mt-s-1_31\*.il?
-	del borland\liblink_test-borland-mt-s-1_31\*.csm
-	del borland\liblink_test-borland-mt-s-1_31\*.tds
+liblink_test-borland-mt-s-1_34_clean :
+	del borland\liblink_test-borland-mt-s-1_34\*.obj
+	del borland\liblink_test-borland-mt-s-1_34\*.il?
+	del borland\liblink_test-borland-mt-s-1_34\*.csm
+	del borland\liblink_test-borland-mt-s-1_34\*.tds
 
-borland\liblink_test-borland-mt-s-1_31.lib : borland\liblink_test-borland-mt-s-1_31\link_test.obj
+borland\liblink_test-borland-mt-s-1_34.lib : borland\liblink_test-borland-mt-s-1_34\link_test.obj
 	tlib @&&|
-/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-mt-s-1_31.lib"  "borland\liblink_test-borland-mt-s-1_31\link_test.obj"
+/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-mt-s-1_34.lib"  "borland\liblink_test-borland-mt-s-1_34\link_test.obj"
 |
 
-borland\liblink_test-borland-mt-s-1_31.exe : main.cpp borland\liblink_test-borland-mt-s-1_31.lib
-	bcc32 $(INCLUDES) -tWM -D_NO_VCL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-mt-s-1_31.exe main.cpp
-   echo running test progam borland\liblink_test-borland-mt-s-1_31.exe
-   borland\liblink_test-borland-mt-s-1_31.exe
+borland\liblink_test-borland-mt-s-1_34.exe : main.cpp borland\liblink_test-borland-mt-s-1_34.lib
+	bcc32 $(INCLUDES) -tWM -D_NO_VCL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-mt-s-1_34.exe main.cpp
+   echo running test progam borland\liblink_test-borland-mt-s-1_34.exe
+   borland\liblink_test-borland-mt-s-1_34.exe
 
 ########################################################
 #
-# section for link_test-borland-mt-1_31.lib
+# section for link_test-borland-mt-1_34.lib
 #
 ########################################################
-borland\link_test-borland-mt-1_31\link_test.obj: link_test.cpp $(ALL_HEADER)
+borland\link_test-borland-mt-1_34\link_test.obj: link_test.cpp $(ALL_HEADER)
 	bcc32 @&&|
--c $(INCLUDES) -tWD -tWM -tWR -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -DBOOST_DYN_LINK -oborland\link_test-borland-mt-1_31\link_test.obj link_test.cpp
+-c $(INCLUDES) -tWD -tWM -tWR -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -DBOOST_DYN_LINK -oborland\link_test-borland-mt-1_34\link_test.obj link_test.cpp
 |
 
-borland\link_test-borland-mt-1_31 :
-	- at mkdir borland\link_test-borland-mt-1_31
+borland\link_test-borland-mt-1_34 :
+	- at mkdir borland\link_test-borland-mt-1_34
 
-link_test-borland-mt-1_31_clean :
-	del borland\link_test-borland-mt-1_31\*.obj
-	del borland\link_test-borland-mt-1_31\*.il?
-	del borland\link_test-borland-mt-1_31\*.csm
-	del borland\link_test-borland-mt-1_31\*.tds
+link_test-borland-mt-1_34_clean :
+	del borland\link_test-borland-mt-1_34\*.obj
+	del borland\link_test-borland-mt-1_34\*.il?
+	del borland\link_test-borland-mt-1_34\*.csm
+	del borland\link_test-borland-mt-1_34\*.tds
 	del borland\*.tds
 
-borland\link_test-borland-mt-1_31.lib : borland\link_test-borland-mt-1_31\link_test.obj
+borland\link_test-borland-mt-1_34.lib : borland\link_test-borland-mt-1_34\link_test.obj
 	bcc32 @&&|
--lw-dup -lw-dpl -tWD -tWM -tWR -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; -eborland\link_test-borland-mt-1_31.dll $(XLFLAGS)  borland\link_test-borland-mt-1_31\link_test.obj $(LIBS)
+-lw-dup -lw-dpl -tWD -tWM -tWR -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; -eborland\link_test-borland-mt-1_34.dll $(XLFLAGS)  borland\link_test-borland-mt-1_34\link_test.obj $(LIBS)
 |
-	implib -w borland\link_test-borland-mt-1_31.lib borland\link_test-borland-mt-1_31.dll
+	implib -w borland\link_test-borland-mt-1_34.lib borland\link_test-borland-mt-1_34.dll
 
-borland\link_test-borland-mt-1_31.exe : main.cpp borland\link_test-borland-mt-1_31.lib
-	bcc32 $(INCLUDES) -tWD -tWM -tWR -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -DBOOST_DYN_LINK -L./borland -e./borland/link_test-borland-mt-1_31.exe main.cpp
-   echo running test program borland\link_test-borland-mt-1_31.exe
-   borland\link_test-borland-mt-1_31.exe
+borland\link_test-borland-mt-1_34.exe : main.cpp borland\link_test-borland-mt-1_34.lib
+	bcc32 $(INCLUDES) -tWD -tWM -tWR -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -DBOOST_DYN_LINK -L./borland -e./borland/link_test-borland-mt-1_34.exe main.cpp
+   echo running test program borland\link_test-borland-mt-1_34.exe
+   borland\link_test-borland-mt-1_34.exe
 
 ########################################################
 #
-# section for link_test-borland-1_31.lib
+# section for link_test-borland-1_34.lib
 #
 ########################################################
-borland\link_test-borland-1_31\link_test.obj: link_test.cpp $(ALL_HEADER)
+borland\link_test-borland-1_34\link_test.obj: link_test.cpp $(ALL_HEADER)
 	bcc32 @&&|
--c $(INCLUDES) -tWD -tWR -tWM- -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -DBOOST_DYN_LINK -oborland\link_test-borland-1_31\link_test.obj link_test.cpp
+-c $(INCLUDES) -tWD -tWR -tWM- -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -DBOOST_DYN_LINK -oborland\link_test-borland-1_34\link_test.obj link_test.cpp
 |
 
-borland\link_test-borland-1_31 :
-	- at mkdir borland\link_test-borland-1_31
+borland\link_test-borland-1_34 :
+	- at mkdir borland\link_test-borland-1_34
 
-link_test-borland-1_31_clean :
-	del borland\link_test-borland-1_31\*.obj
-	del borland\link_test-borland-1_31\*.il?
-	del borland\link_test-borland-1_31\*.csm
-	del borland\link_test-borland-1_31\*.tds
+link_test-borland-1_34_clean :
+	del borland\link_test-borland-1_34\*.obj
+	del borland\link_test-borland-1_34\*.il?
+	del borland\link_test-borland-1_34\*.csm
+	del borland\link_test-borland-1_34\*.tds
 	del borland\*.tds
 
-borland\link_test-borland-1_31.lib : borland\link_test-borland-1_31\link_test.obj
+borland\link_test-borland-1_34.lib : borland\link_test-borland-1_34\link_test.obj
 	bcc32 @&&|
--lw-dup -lw-dpl -tWD -tWR -tWM- -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; -eborland\link_test-borland-1_31.dll $(XLFLAGS)  borland\link_test-borland-1_31\link_test.obj $(LIBS)
+-lw-dup -lw-dpl -tWD -tWR -tWM- -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; -eborland\link_test-borland-1_34.dll $(XLFLAGS)  borland\link_test-borland-1_34\link_test.obj $(LIBS)
 |
-	implib -w borland\link_test-borland-1_31.lib borland\link_test-borland-1_31.dll
+	implib -w borland\link_test-borland-1_34.lib borland\link_test-borland-1_34.dll
 
-borland\link_test-borland-1_31.exe : main.cpp borland\link_test-borland-1_31.lib
-	bcc32 $(INCLUDES) -tWD -tWR -tWM- -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -DBOOST_DYN_LINK -L./borland -e./borland/link_test-borland-1_31.exe main.cpp
-   echo running test program borland\link_test-borland-1_31.exe
-   borland\link_test-borland-1_31.exe
+borland\link_test-borland-1_34.exe : main.cpp borland\link_test-borland-1_34.lib
+	bcc32 $(INCLUDES) -tWD -tWR -tWM- -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -DBOOST_DYN_LINK -L./borland -e./borland/link_test-borland-1_34.exe main.cpp
+   echo running test program borland\link_test-borland-1_34.exe
+   borland\link_test-borland-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-borland-mt-1_31.lib
+# section for liblink_test-borland-mt-1_34.lib
 #
 ########################################################
-borland\liblink_test-borland-mt-1_31\link_test.obj: link_test.cpp $(ALL_HEADER)
+borland\liblink_test-borland-mt-1_34\link_test.obj: link_test.cpp $(ALL_HEADER)
 	bcc32 @&&|
--c $(INCLUDES) -tWD -tWM -tWR -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -oborland\liblink_test-borland-mt-1_31\link_test.obj link_test.cpp
+-c $(INCLUDES) -tWD -tWM -tWR -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -oborland\liblink_test-borland-mt-1_34\link_test.obj link_test.cpp
 |
 
-borland\liblink_test-borland-mt-1_31 : 
-	- at mkdir borland\liblink_test-borland-mt-1_31
+borland\liblink_test-borland-mt-1_34 : 
+	- at mkdir borland\liblink_test-borland-mt-1_34
 
-liblink_test-borland-mt-1_31_clean :
-	del borland\liblink_test-borland-mt-1_31\*.obj
-	del borland\liblink_test-borland-mt-1_31\*.il?
-	del borland\liblink_test-borland-mt-1_31\*.csm
-	del borland\liblink_test-borland-mt-1_31\*.tds
+liblink_test-borland-mt-1_34_clean :
+	del borland\liblink_test-borland-mt-1_34\*.obj
+	del borland\liblink_test-borland-mt-1_34\*.il?
+	del borland\liblink_test-borland-mt-1_34\*.csm
+	del borland\liblink_test-borland-mt-1_34\*.tds
 
-borland\liblink_test-borland-mt-1_31.lib : borland\liblink_test-borland-mt-1_31\link_test.obj
+borland\liblink_test-borland-mt-1_34.lib : borland\liblink_test-borland-mt-1_34\link_test.obj
 	tlib @&&|
-/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-mt-1_31.lib"  "borland\liblink_test-borland-mt-1_31\link_test.obj"
+/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-mt-1_34.lib"  "borland\liblink_test-borland-mt-1_34\link_test.obj"
 |
 
-borland\liblink_test-borland-mt-1_31.exe : main.cpp borland\liblink_test-borland-mt-1_31.lib
-	bcc32 $(INCLUDES) -tWD -tWM -tWR -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-mt-1_31.exe main.cpp
-   echo running test progam borland\liblink_test-borland-mt-1_31.exe
-   borland\liblink_test-borland-mt-1_31.exe
+borland\liblink_test-borland-mt-1_34.exe : main.cpp borland\liblink_test-borland-mt-1_34.lib
+	bcc32 $(INCLUDES) -tWD -tWM -tWR -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-mt-1_34.exe main.cpp
+   echo running test progam borland\liblink_test-borland-mt-1_34.exe
+   borland\liblink_test-borland-mt-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-borland-1_31.lib
+# section for liblink_test-borland-1_34.lib
 #
 ########################################################
-borland\liblink_test-borland-1_31\link_test.obj: link_test.cpp $(ALL_HEADER)
+borland\liblink_test-borland-1_34\link_test.obj: link_test.cpp $(ALL_HEADER)
 	bcc32 @&&|
--c $(INCLUDES) -tWD -tWR -tWM- -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -oborland\liblink_test-borland-1_31\link_test.obj link_test.cpp
+-c $(INCLUDES) -tWD -tWR -tWM- -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -oborland\liblink_test-borland-1_34\link_test.obj link_test.cpp
 |
 
-borland\liblink_test-borland-1_31 : 
-	- at mkdir borland\liblink_test-borland-1_31
+borland\liblink_test-borland-1_34 : 
+	- at mkdir borland\liblink_test-borland-1_34
 
-liblink_test-borland-1_31_clean :
-	del borland\liblink_test-borland-1_31\*.obj
-	del borland\liblink_test-borland-1_31\*.il?
-	del borland\liblink_test-borland-1_31\*.csm
-	del borland\liblink_test-borland-1_31\*.tds
+liblink_test-borland-1_34_clean :
+	del borland\liblink_test-borland-1_34\*.obj
+	del borland\liblink_test-borland-1_34\*.il?
+	del borland\liblink_test-borland-1_34\*.csm
+	del borland\liblink_test-borland-1_34\*.tds
 
-borland\liblink_test-borland-1_31.lib : borland\liblink_test-borland-1_31\link_test.obj
+borland\liblink_test-borland-1_34.lib : borland\liblink_test-borland-1_34\link_test.obj
 	tlib @&&|
-/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-1_31.lib"  "borland\liblink_test-borland-1_31\link_test.obj"
+/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-1_34.lib"  "borland\liblink_test-borland-1_34\link_test.obj"
 |
 
-borland\liblink_test-borland-1_31.exe : main.cpp borland\liblink_test-borland-1_31.lib
-	bcc32 $(INCLUDES) -tWD -tWR -tWM- -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-1_31.exe main.cpp
-   echo running test progam borland\liblink_test-borland-1_31.exe
-   borland\liblink_test-borland-1_31.exe
+borland\liblink_test-borland-1_34.exe : main.cpp borland\liblink_test-borland-1_34.lib
+	bcc32 $(INCLUDES) -tWD -tWR -tWM- -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -O2 -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-1_34.exe main.cpp
+   echo running test progam borland\liblink_test-borland-1_34.exe
+   borland\liblink_test-borland-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-borland-sd-1_31.lib
+# section for liblink_test-borland-sd-1_34.lib
 #
 ########################################################
-borland\liblink_test-borland-sd-1_31\link_test.obj: link_test.cpp $(ALL_HEADER)
+borland\liblink_test-borland-sd-1_34\link_test.obj: link_test.cpp $(ALL_HEADER)
 	bcc32 @&&|
--c $(INCLUDES) -tWM- -D_NO_VCL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8037 -w-8057 -DSTRICT; -I$(BCROOT)\include;../../../../ $(CXXFLAGS) -oborland\liblink_test-borland-sd-1_31\link_test.obj link_test.cpp
+-c $(INCLUDES) -tWM- -D_NO_VCL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8037 -w-8057 -DSTRICT; -I$(BCROOT)\include;../../../../ $(CXXFLAGS) -oborland\liblink_test-borland-sd-1_34\link_test.obj link_test.cpp
 |
 
-borland\liblink_test-borland-sd-1_31 : 
-	- at mkdir borland\liblink_test-borland-sd-1_31
+borland\liblink_test-borland-sd-1_34 : 
+	- at mkdir borland\liblink_test-borland-sd-1_34
 
-liblink_test-borland-sd-1_31_clean :
-	del borland\liblink_test-borland-sd-1_31\*.obj
-	del borland\liblink_test-borland-sd-1_31\*.il?
-	del borland\liblink_test-borland-sd-1_31\*.csm
-	del borland\liblink_test-borland-sd-1_31\*.tds
+liblink_test-borland-sd-1_34_clean :
+	del borland\liblink_test-borland-sd-1_34\*.obj
+	del borland\liblink_test-borland-sd-1_34\*.il?
+	del borland\liblink_test-borland-sd-1_34\*.csm
+	del borland\liblink_test-borland-sd-1_34\*.tds
 
-borland\liblink_test-borland-sd-1_31.lib : borland\liblink_test-borland-sd-1_31\link_test.obj
+borland\liblink_test-borland-sd-1_34.lib : borland\liblink_test-borland-sd-1_34\link_test.obj
 	tlib @&&|
-/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-sd-1_31.lib"  "borland\liblink_test-borland-sd-1_31\link_test.obj"
+/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-sd-1_34.lib"  "borland\liblink_test-borland-sd-1_34\link_test.obj"
 |
 
-borland\liblink_test-borland-sd-1_31.exe : main.cpp borland\liblink_test-borland-sd-1_31.lib
-	bcc32 $(INCLUDES) -tWM- -D_NO_VCL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8037 -w-8057 -DSTRICT; -I$(BCROOT)\include;../../../../ /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-sd-1_31.exe main.cpp
-   echo running test progam borland\liblink_test-borland-sd-1_31.exe
-   borland\liblink_test-borland-sd-1_31.exe
+borland\liblink_test-borland-sd-1_34.exe : main.cpp borland\liblink_test-borland-sd-1_34.lib
+	bcc32 $(INCLUDES) -tWM- -D_NO_VCL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8037 -w-8057 -DSTRICT; -I$(BCROOT)\include;../../../../ /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-sd-1_34.exe main.cpp
+   echo running test progam borland\liblink_test-borland-sd-1_34.exe
+   borland\liblink_test-borland-sd-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-borland-mt-sd-1_31.lib
+# section for liblink_test-borland-mt-sd-1_34.lib
 #
 ########################################################
-borland\liblink_test-borland-mt-sd-1_31\link_test.obj: link_test.cpp $(ALL_HEADER)
+borland\liblink_test-borland-mt-sd-1_34\link_test.obj: link_test.cpp $(ALL_HEADER)
 	bcc32 @&&|
--c $(INCLUDES) -tWM -D_NO_VCL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ $(CXXFLAGS) -oborland\liblink_test-borland-mt-sd-1_31\link_test.obj link_test.cpp
+-c $(INCLUDES) -tWM -D_NO_VCL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ $(CXXFLAGS) -oborland\liblink_test-borland-mt-sd-1_34\link_test.obj link_test.cpp
 |
 
-borland\liblink_test-borland-mt-sd-1_31 : 
-	- at mkdir borland\liblink_test-borland-mt-sd-1_31
+borland\liblink_test-borland-mt-sd-1_34 : 
+	- at mkdir borland\liblink_test-borland-mt-sd-1_34
 
-liblink_test-borland-mt-sd-1_31_clean :
-	del borland\liblink_test-borland-mt-sd-1_31\*.obj
-	del borland\liblink_test-borland-mt-sd-1_31\*.il?
-	del borland\liblink_test-borland-mt-sd-1_31\*.csm
-	del borland\liblink_test-borland-mt-sd-1_31\*.tds
+liblink_test-borland-mt-sd-1_34_clean :
+	del borland\liblink_test-borland-mt-sd-1_34\*.obj
+	del borland\liblink_test-borland-mt-sd-1_34\*.il?
+	del borland\liblink_test-borland-mt-sd-1_34\*.csm
+	del borland\liblink_test-borland-mt-sd-1_34\*.tds
 
-borland\liblink_test-borland-mt-sd-1_31.lib : borland\liblink_test-borland-mt-sd-1_31\link_test.obj
+borland\liblink_test-borland-mt-sd-1_34.lib : borland\liblink_test-borland-mt-sd-1_34\link_test.obj
 	tlib @&&|
-/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-mt-sd-1_31.lib"  "borland\liblink_test-borland-mt-sd-1_31\link_test.obj"
+/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-mt-sd-1_34.lib"  "borland\liblink_test-borland-mt-sd-1_34\link_test.obj"
 |
 
-borland\liblink_test-borland-mt-sd-1_31.exe : main.cpp borland\liblink_test-borland-mt-sd-1_31.lib
-	bcc32 $(INCLUDES) -tWM -D_NO_VCL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-mt-sd-1_31.exe main.cpp
-   echo running test progam borland\liblink_test-borland-mt-sd-1_31.exe
-   borland\liblink_test-borland-mt-sd-1_31.exe
+borland\liblink_test-borland-mt-sd-1_34.exe : main.cpp borland\liblink_test-borland-mt-sd-1_34.lib
+	bcc32 $(INCLUDES) -tWM -D_NO_VCL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-mt-sd-1_34.exe main.cpp
+   echo running test progam borland\liblink_test-borland-mt-sd-1_34.exe
+   borland\liblink_test-borland-mt-sd-1_34.exe
 
 ########################################################
 #
-# section for link_test-borland-mt-d-1_31.lib
+# section for link_test-borland-mt-d-1_34.lib
 #
 ########################################################
-borland\link_test-borland-mt-d-1_31\link_test.obj: link_test.cpp $(ALL_HEADER)
+borland\link_test-borland-mt-d-1_34\link_test.obj: link_test.cpp $(ALL_HEADER)
 	bcc32 @&&|
--c $(INCLUDES) -tWD -tWM -tWR -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -DBOOST_DYN_LINK -oborland\link_test-borland-mt-d-1_31\link_test.obj link_test.cpp
+-c $(INCLUDES) -tWD -tWM -tWR -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -DBOOST_DYN_LINK -oborland\link_test-borland-mt-d-1_34\link_test.obj link_test.cpp
 |
 
-borland\link_test-borland-mt-d-1_31 :
-	- at mkdir borland\link_test-borland-mt-d-1_31
+borland\link_test-borland-mt-d-1_34 :
+	- at mkdir borland\link_test-borland-mt-d-1_34
 
-link_test-borland-mt-d-1_31_clean :
-	del borland\link_test-borland-mt-d-1_31\*.obj
-	del borland\link_test-borland-mt-d-1_31\*.il?
-	del borland\link_test-borland-mt-d-1_31\*.csm
-	del borland\link_test-borland-mt-d-1_31\*.tds
+link_test-borland-mt-d-1_34_clean :
+	del borland\link_test-borland-mt-d-1_34\*.obj
+	del borland\link_test-borland-mt-d-1_34\*.il?
+	del borland\link_test-borland-mt-d-1_34\*.csm
+	del borland\link_test-borland-mt-d-1_34\*.tds
 	del borland\*.tds
 
-borland\link_test-borland-mt-d-1_31.lib : borland\link_test-borland-mt-d-1_31\link_test.obj
+borland\link_test-borland-mt-d-1_34.lib : borland\link_test-borland-mt-d-1_34\link_test.obj
 	bcc32 @&&|
--lw-dup -lw-dpl -tWD -tWM -tWR -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; -eborland\link_test-borland-mt-d-1_31.dll $(XLFLAGS)  borland\link_test-borland-mt-d-1_31\link_test.obj $(LIBS)
+-lw-dup -lw-dpl -tWD -tWM -tWR -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; -eborland\link_test-borland-mt-d-1_34.dll $(XLFLAGS)  borland\link_test-borland-mt-d-1_34\link_test.obj $(LIBS)
 |
-	implib -w borland\link_test-borland-mt-d-1_31.lib borland\link_test-borland-mt-d-1_31.dll
+	implib -w borland\link_test-borland-mt-d-1_34.lib borland\link_test-borland-mt-d-1_34.dll
 
-borland\link_test-borland-mt-d-1_31.exe : main.cpp borland\link_test-borland-mt-d-1_31.lib
-	bcc32 $(INCLUDES) -tWD -tWM -tWR -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -DBOOST_DYN_LINK -L./borland -e./borland/link_test-borland-mt-d-1_31.exe main.cpp
-   echo running test program borland\link_test-borland-mt-d-1_31.exe
-   borland\link_test-borland-mt-d-1_31.exe
+borland\link_test-borland-mt-d-1_34.exe : main.cpp borland\link_test-borland-mt-d-1_34.lib
+	bcc32 $(INCLUDES) -tWD -tWM -tWR -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -DBOOST_DYN_LINK -L./borland -e./borland/link_test-borland-mt-d-1_34.exe main.cpp
+   echo running test program borland\link_test-borland-mt-d-1_34.exe
+   borland\link_test-borland-mt-d-1_34.exe
 
 ########################################################
 #
-# section for link_test-borland-d-1_31.lib
+# section for link_test-borland-d-1_34.lib
 #
 ########################################################
-borland\link_test-borland-d-1_31\link_test.obj: link_test.cpp $(ALL_HEADER)
+borland\link_test-borland-d-1_34\link_test.obj: link_test.cpp $(ALL_HEADER)
 	bcc32 @&&|
--c $(INCLUDES) -tWD -tWR -tWM- -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -DBOOST_DYN_LINK -oborland\link_test-borland-d-1_31\link_test.obj link_test.cpp
+-c $(INCLUDES) -tWD -tWR -tWM- -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -DBOOST_DYN_LINK -oborland\link_test-borland-d-1_34\link_test.obj link_test.cpp
 |
 
-borland\link_test-borland-d-1_31 :
-	- at mkdir borland\link_test-borland-d-1_31
+borland\link_test-borland-d-1_34 :
+	- at mkdir borland\link_test-borland-d-1_34
 
-link_test-borland-d-1_31_clean :
-	del borland\link_test-borland-d-1_31\*.obj
-	del borland\link_test-borland-d-1_31\*.il?
-	del borland\link_test-borland-d-1_31\*.csm
-	del borland\link_test-borland-d-1_31\*.tds
+link_test-borland-d-1_34_clean :
+	del borland\link_test-borland-d-1_34\*.obj
+	del borland\link_test-borland-d-1_34\*.il?
+	del borland\link_test-borland-d-1_34\*.csm
+	del borland\link_test-borland-d-1_34\*.tds
 	del borland\*.tds
 
-borland\link_test-borland-d-1_31.lib : borland\link_test-borland-d-1_31\link_test.obj
+borland\link_test-borland-d-1_34.lib : borland\link_test-borland-d-1_34\link_test.obj
 	bcc32 @&&|
--lw-dup -lw-dpl -tWD -tWR -tWM- -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; -eborland\link_test-borland-d-1_31.dll $(XLFLAGS)  borland\link_test-borland-d-1_31\link_test.obj $(LIBS)
+-lw-dup -lw-dpl -tWD -tWR -tWM- -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; -eborland\link_test-borland-d-1_34.dll $(XLFLAGS)  borland\link_test-borland-d-1_34\link_test.obj $(LIBS)
 |
-	implib -w borland\link_test-borland-d-1_31.lib borland\link_test-borland-d-1_31.dll
+	implib -w borland\link_test-borland-d-1_34.lib borland\link_test-borland-d-1_34.dll
 
-borland\link_test-borland-d-1_31.exe : main.cpp borland\link_test-borland-d-1_31.lib
-	bcc32 $(INCLUDES) -tWD -tWR -tWM- -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -DBOOST_DYN_LINK -L./borland -e./borland/link_test-borland-d-1_31.exe main.cpp
-   echo running test program borland\link_test-borland-d-1_31.exe
-   borland\link_test-borland-d-1_31.exe
+borland\link_test-borland-d-1_34.exe : main.cpp borland\link_test-borland-d-1_34.lib
+	bcc32 $(INCLUDES) -tWD -tWR -tWM- -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -DBOOST_DYN_LINK -L./borland -e./borland/link_test-borland-d-1_34.exe main.cpp
+   echo running test program borland\link_test-borland-d-1_34.exe
+   borland\link_test-borland-d-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-borland-mt-d-1_31.lib
+# section for liblink_test-borland-mt-d-1_34.lib
 #
 ########################################################
-borland\liblink_test-borland-mt-d-1_31\link_test.obj: link_test.cpp $(ALL_HEADER)
+borland\liblink_test-borland-mt-d-1_34\link_test.obj: link_test.cpp $(ALL_HEADER)
 	bcc32 @&&|
--c $(INCLUDES) -tWD -tWM -tWR -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -oborland\liblink_test-borland-mt-d-1_31\link_test.obj link_test.cpp
+-c $(INCLUDES) -tWD -tWM -tWR -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -oborland\liblink_test-borland-mt-d-1_34\link_test.obj link_test.cpp
 |
 
-borland\liblink_test-borland-mt-d-1_31 : 
-	- at mkdir borland\liblink_test-borland-mt-d-1_31
+borland\liblink_test-borland-mt-d-1_34 : 
+	- at mkdir borland\liblink_test-borland-mt-d-1_34
 
-liblink_test-borland-mt-d-1_31_clean :
-	del borland\liblink_test-borland-mt-d-1_31\*.obj
-	del borland\liblink_test-borland-mt-d-1_31\*.il?
-	del borland\liblink_test-borland-mt-d-1_31\*.csm
-	del borland\liblink_test-borland-mt-d-1_31\*.tds
+liblink_test-borland-mt-d-1_34_clean :
+	del borland\liblink_test-borland-mt-d-1_34\*.obj
+	del borland\liblink_test-borland-mt-d-1_34\*.il?
+	del borland\liblink_test-borland-mt-d-1_34\*.csm
+	del borland\liblink_test-borland-mt-d-1_34\*.tds
 
-borland\liblink_test-borland-mt-d-1_31.lib : borland\liblink_test-borland-mt-d-1_31\link_test.obj
+borland\liblink_test-borland-mt-d-1_34.lib : borland\liblink_test-borland-mt-d-1_34\link_test.obj
 	tlib @&&|
-/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-mt-d-1_31.lib"  "borland\liblink_test-borland-mt-d-1_31\link_test.obj"
+/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-mt-d-1_34.lib"  "borland\liblink_test-borland-mt-d-1_34\link_test.obj"
 |
 
-borland\liblink_test-borland-mt-d-1_31.exe : main.cpp borland\liblink_test-borland-mt-d-1_31.lib
-	bcc32 $(INCLUDES) -tWD -tWM -tWR -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-mt-d-1_31.exe main.cpp
-   echo running test progam borland\liblink_test-borland-mt-d-1_31.exe
-   borland\liblink_test-borland-mt-d-1_31.exe
+borland\liblink_test-borland-mt-d-1_34.exe : main.cpp borland\liblink_test-borland-mt-d-1_34.lib
+	bcc32 $(INCLUDES) -tWD -tWM -tWR -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-mt-d-1_34.exe main.cpp
+   echo running test progam borland\liblink_test-borland-mt-d-1_34.exe
+   borland\liblink_test-borland-mt-d-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-borland-d-1_31.lib
+# section for liblink_test-borland-d-1_34.lib
 #
 ########################################################
-borland\liblink_test-borland-d-1_31\link_test.obj: link_test.cpp $(ALL_HEADER)
+borland\liblink_test-borland-d-1_34\link_test.obj: link_test.cpp $(ALL_HEADER)
 	bcc32 @&&|
--c $(INCLUDES) -tWD -tWR -tWM- -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -oborland\liblink_test-borland-d-1_31\link_test.obj link_test.cpp
+-c $(INCLUDES) -tWD -tWR -tWM- -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; $(CXXFLAGS) -oborland\liblink_test-borland-d-1_34\link_test.obj link_test.cpp
 |
 
-borland\liblink_test-borland-d-1_31 : 
-	- at mkdir borland\liblink_test-borland-d-1_31
+borland\liblink_test-borland-d-1_34 : 
+	- at mkdir borland\liblink_test-borland-d-1_34
 
-liblink_test-borland-d-1_31_clean :
-	del borland\liblink_test-borland-d-1_31\*.obj
-	del borland\liblink_test-borland-d-1_31\*.il?
-	del borland\liblink_test-borland-d-1_31\*.csm
-	del borland\liblink_test-borland-d-1_31\*.tds
+liblink_test-borland-d-1_34_clean :
+	del borland\liblink_test-borland-d-1_34\*.obj
+	del borland\liblink_test-borland-d-1_34\*.il?
+	del borland\liblink_test-borland-d-1_34\*.csm
+	del borland\liblink_test-borland-d-1_34\*.tds
 
-borland\liblink_test-borland-d-1_31.lib : borland\liblink_test-borland-d-1_31\link_test.obj
+borland\liblink_test-borland-d-1_34.lib : borland\liblink_test-borland-d-1_34\link_test.obj
 	tlib @&&|
-/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-d-1_31.lib"  "borland\liblink_test-borland-d-1_31\link_test.obj"
+/P128 /C /u /a $(XSFLAGS) "borland\liblink_test-borland-d-1_34.lib"  "borland\liblink_test-borland-d-1_34\link_test.obj"
 |
 
-borland\liblink_test-borland-d-1_31.exe : main.cpp borland\liblink_test-borland-d-1_31.lib
-	bcc32 $(INCLUDES) -tWD -tWR -tWM- -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-d-1_31.exe main.cpp
-   echo running test progam borland\liblink_test-borland-d-1_31.exe
-   borland\liblink_test-borland-d-1_31.exe
+borland\liblink_test-borland-d-1_34.exe : main.cpp borland\liblink_test-borland-d-1_34.lib
+	bcc32 $(INCLUDES) -tWD -tWR -tWM- -DBOOST_REGEX_STATIC_LINK -D_NO_VCL -D_RTLDLL -v -Ve -Vx -w-inl -w-aus -w-rch -w-8012 -w-8057 -w-8037 -DSTRICT; -I$(BCROOT)\include;../../../../ -L$(BCROOT)\lib;$(BCROOT)\lib\release; /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -L./borland -e./borland/liblink_test-borland-d-1_34.exe main.cpp
+   echo running test progam borland\liblink_test-borland-d-1_34.exe
+   borland\liblink_test-borland-d-1_34.exe
 

Modified: boost/trunk/libs/config/test/link/common.sh
===================================================================
--- boost/trunk/libs/config/test/link/common.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/link/common.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2005
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # locate all the header dependencies:
 header=""
@@ -5,8 +9,11 @@
 # locate all the source files:
 src=link_test.cpp
 
-boost_version=$(grep 'define.*BOOST_LIB_VERSION' ../../../boost/version.hpp | sed 's/.*"\([^"]*\)".*/\1/')
+boost_version=$(grep 'define.*BOOST_LIB_VERSION' ../../../../boost/version.hpp | sed 's/.*"\([^"]*\)".*/\1/')
 
 
 
 
+
+
+

Modified: boost/trunk/libs/config/test/link/vc6-stlport.mak
===================================================================
--- boost/trunk/libs/config/test/link/vc6-stlport.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/link/vc6-stlport.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2005
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # auto generated makefile for VC6+STLPort
 #
@@ -42,26 +46,26 @@
 
 ALL_HEADER=
 
-all : main_dir liblink_test-vc6-stlport-mt-s-1_31_dir ./vc6-stlport/liblink_test-vc6-stlport-mt-s-1_31.lib ./vc6-stlport/liblink_test-vc6-stlport-mt-s-1_31.exe liblink_test-vc6-stlport-mt-sgd-1_31_dir ./vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_31.lib ./vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_31.exe link_test-vc6-stlport-mt-gd-1_31_dir ./vc6-stlport/link_test-vc6-stlport-mt-gd-1_31.lib ./vc6-stlport/link_test-vc6-stlport-mt-gd-1_31.exe link_test-vc6-stlport-mt-1_31_dir ./vc6-stlport/link_test-vc6-stlport-mt-1_31.lib ./vc6-stlport/link_test-vc6-stlport-mt-1_31.exe liblink_test-vc6-stlport-mt-1_31_dir ./vc6-stlport/liblink_test-vc6-stlport-mt-1_31.lib ./vc6-stlport/liblink_test-vc6-stlport-mt-1_31.exe liblink_test-vc6-stlport-mt-gd-1_31_dir ./vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_31.lib ./vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_31.exe link_test-vc6-stlport-mt-pgd-1_31_dir ./vc6-stlport/link_test-vc6-stlport-mt-pgd-1_31.lib ./vc6-stlport/link_test-vc6-stlport-mt-pgd-1_31.exe liblink_test-vc6-stlport-mt-spgd-1_31_dir ./vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_31.lib ./vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_31.exe liblink_test-vc6-stlport-mt-pgd-1_31_dir ./vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_31.lib ./vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_31.exe
+all : main_dir liblink_test-vc6-stlport-mt-s-1_34_dir ./vc6-stlport/liblink_test-vc6-stlport-mt-s-1_34.lib ./vc6-stlport/liblink_test-vc6-stlport-mt-s-1_34.exe liblink_test-vc6-stlport-mt-sgd-1_34_dir ./vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_34.lib ./vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_34.exe link_test-vc6-stlport-mt-gd-1_34_dir ./vc6-stlport/link_test-vc6-stlport-mt-gd-1_34.lib ./vc6-stlport/link_test-vc6-stlport-mt-gd-1_34.exe link_test-vc6-stlport-mt-1_34_dir ./vc6-stlport/link_test-vc6-stlport-mt-1_34.lib ./vc6-stlport/link_test-vc6-stlport-mt-1_34.exe liblink_test-vc6-stlport-mt-1_34_dir ./vc6-stlport/liblink_test-vc6-stlport-mt-1_34.lib ./vc6-stlport/liblink_test-vc6-stlport-mt-1_34.exe liblink_test-vc6-stlport-mt-gd-1_34_dir ./vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_34.lib ./vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_34.exe link_test-vc6-stlport-mt-pgd-1_34_dir ./vc6-stlport/link_test-vc6-stlport-mt-pgd-1_34.lib ./vc6-stlport/link_test-vc6-stlport-mt-pgd-1_34.exe liblink_test-vc6-stlport-mt-spgd-1_34_dir ./vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_34.lib ./vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_34.exe liblink_test-vc6-stlport-mt-pgd-1_34_dir ./vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_34.lib ./vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_34.exe
 
-clean :  liblink_test-vc6-stlport-mt-s-1_31_clean liblink_test-vc6-stlport-mt-sgd-1_31_clean link_test-vc6-stlport-mt-gd-1_31_clean link_test-vc6-stlport-mt-1_31_clean liblink_test-vc6-stlport-mt-1_31_clean liblink_test-vc6-stlport-mt-gd-1_31_clean link_test-vc6-stlport-mt-pgd-1_31_clean liblink_test-vc6-stlport-mt-spgd-1_31_clean liblink_test-vc6-stlport-mt-pgd-1_31_clean
+clean :  liblink_test-vc6-stlport-mt-s-1_34_clean liblink_test-vc6-stlport-mt-sgd-1_34_clean link_test-vc6-stlport-mt-gd-1_34_clean link_test-vc6-stlport-mt-1_34_clean liblink_test-vc6-stlport-mt-1_34_clean liblink_test-vc6-stlport-mt-gd-1_34_clean link_test-vc6-stlport-mt-pgd-1_34_clean liblink_test-vc6-stlport-mt-spgd-1_34_clean liblink_test-vc6-stlport-mt-pgd-1_34_clean
 
 install : stlport_check all
-	copy vc6-stlport\liblink_test-vc6-stlport-mt-s-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6-stlport\link_test-vc6-stlport-mt-gd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6-stlport\link_test-vc6-stlport-mt-gd-1_31.dll "$(MSVCDIR)\bin"
-	copy vc6-stlport\link_test-vc6-stlport-mt-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6-stlport\link_test-vc6-stlport-mt-1_31.dll "$(MSVCDIR)\bin"
-	copy vc6-stlport\liblink_test-vc6-stlport-mt-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6-stlport\link_test-vc6-stlport-mt-pgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6-stlport\link_test-vc6-stlport-mt-pgd-1_31.dll "$(MSVCDIR)\bin"
-	copy vc6-stlport\link_test-vc6-stlport-mt-pgd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_31.pdb "$(MSVCDIR)\lib"
+	copy vc6-stlport\liblink_test-vc6-stlport-mt-s-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6-stlport\link_test-vc6-stlport-mt-gd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6-stlport\link_test-vc6-stlport-mt-gd-1_34.dll "$(MSVCDIR)\bin"
+	copy vc6-stlport\link_test-vc6-stlport-mt-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6-stlport\link_test-vc6-stlport-mt-1_34.dll "$(MSVCDIR)\bin"
+	copy vc6-stlport\liblink_test-vc6-stlport-mt-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6-stlport\link_test-vc6-stlport-mt-pgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6-stlport\link_test-vc6-stlport-mt-pgd-1_34.dll "$(MSVCDIR)\bin"
+	copy vc6-stlport\link_test-vc6-stlport-mt-pgd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_34.pdb "$(MSVCDIR)\lib"
 
 main_dir :
 	@if not exist "vc6-stlport\$(NULL)" mkdir vc6-stlport
@@ -72,217 +76,217 @@
 
 ########################################################
 #
-# section for liblink_test-vc6-stlport-mt-s-1_31.lib
+# section for liblink_test-vc6-stlport-mt-s-1_34.lib
 #
 ########################################################
-vc6-stlport/liblink_test-vc6-stlport-mt-s-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB  $(CXXFLAGS) -Y- -Fo./vc6-stlport/liblink_test-vc6-stlport-mt-s-1_31/ -Fdvc6-stlport/liblink_test-vc6-stlport-mt-s-1_31.pdb link_test.cpp
+vc6-stlport/liblink_test-vc6-stlport-mt-s-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB  $(CXXFLAGS) -Y- -Fo./vc6-stlport/liblink_test-vc6-stlport-mt-s-1_34/ -Fdvc6-stlport/liblink_test-vc6-stlport-mt-s-1_34.pdb link_test.cpp
 
-liblink_test-vc6-stlport-mt-s-1_31_dir :
-	@if not exist "vc6-stlport\liblink_test-vc6-stlport-mt-s-1_31\$(NULL)" mkdir vc6-stlport\liblink_test-vc6-stlport-mt-s-1_31
+liblink_test-vc6-stlport-mt-s-1_34_dir :
+	@if not exist "vc6-stlport\liblink_test-vc6-stlport-mt-s-1_34\$(NULL)" mkdir vc6-stlport\liblink_test-vc6-stlport-mt-s-1_34
 
-liblink_test-vc6-stlport-mt-s-1_31_clean :
-	del vc6-stlport\liblink_test-vc6-stlport-mt-s-1_31\*.obj
-	del vc6-stlport\liblink_test-vc6-stlport-mt-s-1_31\*.idb
-	del vc6-stlport\liblink_test-vc6-stlport-mt-s-1_31\*.exp
-	del vc6-stlport\liblink_test-vc6-stlport-mt-s-1_31\*.pch
+liblink_test-vc6-stlport-mt-s-1_34_clean :
+	del vc6-stlport\liblink_test-vc6-stlport-mt-s-1_34\*.obj
+	del vc6-stlport\liblink_test-vc6-stlport-mt-s-1_34\*.idb
+	del vc6-stlport\liblink_test-vc6-stlport-mt-s-1_34\*.exp
+	del vc6-stlport\liblink_test-vc6-stlport-mt-s-1_34\*.pch
 
-./vc6-stlport/liblink_test-vc6-stlport-mt-s-1_31.lib : vc6-stlport/liblink_test-vc6-stlport-mt-s-1_31/link_test.obj
-	link -lib /nologo /out:vc6-stlport/liblink_test-vc6-stlport-mt-s-1_31.lib $(XSFLAGS)  vc6-stlport/liblink_test-vc6-stlport-mt-s-1_31/link_test.obj
+./vc6-stlport/liblink_test-vc6-stlport-mt-s-1_34.lib : vc6-stlport/liblink_test-vc6-stlport-mt-s-1_34/link_test.obj
+	link -lib /nologo /out:vc6-stlport/liblink_test-vc6-stlport-mt-s-1_34.lib $(XSFLAGS)  vc6-stlport/liblink_test-vc6-stlport-mt-s-1_34/link_test.obj
 
-./vc6-stlport/liblink_test-vc6-stlport-mt-s-1_31.exe : main.cpp ./vc6-stlport/liblink_test-vc6-stlport-mt-s-1_31.lib
-	cl $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/liblink_test-vc6-stlport-mt-s-1_31.exe main.cpp /link /LIBPATH:./vc6-stlport
-   vc6-stlport\liblink_test-vc6-stlport-mt-s-1_31.exe
+./vc6-stlport/liblink_test-vc6-stlport-mt-s-1_34.exe : main.cpp ./vc6-stlport/liblink_test-vc6-stlport-mt-s-1_34.lib
+	cl $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/liblink_test-vc6-stlport-mt-s-1_34.exe main.cpp /link /LIBPATH:./vc6-stlport
+   vc6-stlport\liblink_test-vc6-stlport-mt-s-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc6-stlport-mt-sgd-1_31.lib
+# section for liblink_test-vc6-stlport-mt-sgd-1_34.lib
 #
 ########################################################
-vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX  $(CXXFLAGS) -Y- -Fo./vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_31/ -Fdvc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_31.pdb link_test.cpp
+vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX  $(CXXFLAGS) -Y- -Fo./vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_34/ -Fdvc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_34.pdb link_test.cpp
 
-liblink_test-vc6-stlport-mt-sgd-1_31_dir :
-	@if not exist "vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_31\$(NULL)" mkdir vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_31
+liblink_test-vc6-stlport-mt-sgd-1_34_dir :
+	@if not exist "vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_34\$(NULL)" mkdir vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_34
 
-liblink_test-vc6-stlport-mt-sgd-1_31_clean :
-	del vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_31\*.obj
-	del vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_31\*.idb
-	del vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_31\*.exp
-	del vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_31\*.pch
+liblink_test-vc6-stlport-mt-sgd-1_34_clean :
+	del vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_34\*.obj
+	del vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_34\*.idb
+	del vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_34\*.exp
+	del vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_34\*.pch
 
-./vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_31.lib : vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_31/link_test.obj
-	link -lib /nologo /out:vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_31.lib $(XSFLAGS)  vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_31/link_test.obj
+./vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_34.lib : vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_34/link_test.obj
+	link -lib /nologo /out:vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_34.lib $(XSFLAGS)  vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_34/link_test.obj
 
-./vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_31.exe : main.cpp ./vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_31.lib
-	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_31.exe main.cpp /link /LIBPATH:./vc6-stlport
-   vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_31.exe
+./vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_34.exe : main.cpp ./vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_34.lib
+	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/liblink_test-vc6-stlport-mt-sgd-1_34.exe main.cpp /link /LIBPATH:./vc6-stlport
+   vc6-stlport\liblink_test-vc6-stlport-mt-sgd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc6-stlport-mt-gd-1_31.lib
+# section for link_test-vc6-stlport-mt-gd-1_34.lib
 #
 ########################################################
-vc6-stlport/link_test-vc6-stlport-mt-gd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  $(CXXFLAGS) -Y- -Fo./vc6-stlport/link_test-vc6-stlport-mt-gd-1_31/ -Fdvc6-stlport/link_test-vc6-stlport-mt-gd-1_31.pdb link_test.cpp
+vc6-stlport/link_test-vc6-stlport-mt-gd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  $(CXXFLAGS) -Y- -Fo./vc6-stlport/link_test-vc6-stlport-mt-gd-1_34/ -Fdvc6-stlport/link_test-vc6-stlport-mt-gd-1_34.pdb link_test.cpp
 
-link_test-vc6-stlport-mt-gd-1_31_dir :
-	@if not exist "vc6-stlport\link_test-vc6-stlport-mt-gd-1_31\$(NULL)" mkdir vc6-stlport\link_test-vc6-stlport-mt-gd-1_31
+link_test-vc6-stlport-mt-gd-1_34_dir :
+	@if not exist "vc6-stlport\link_test-vc6-stlport-mt-gd-1_34\$(NULL)" mkdir vc6-stlport\link_test-vc6-stlport-mt-gd-1_34
 
-link_test-vc6-stlport-mt-gd-1_31_clean :
-	del vc6-stlport\link_test-vc6-stlport-mt-gd-1_31\*.obj
-	del vc6-stlport\link_test-vc6-stlport-mt-gd-1_31\*.idb
-	del vc6-stlport\link_test-vc6-stlport-mt-gd-1_31\*.exp
-	del vc6-stlport\link_test-vc6-stlport-mt-gd-1_31\*.pch
+link_test-vc6-stlport-mt-gd-1_34_clean :
+	del vc6-stlport\link_test-vc6-stlport-mt-gd-1_34\*.obj
+	del vc6-stlport\link_test-vc6-stlport-mt-gd-1_34\*.idb
+	del vc6-stlport\link_test-vc6-stlport-mt-gd-1_34\*.exp
+	del vc6-stlport\link_test-vc6-stlport-mt-gd-1_34\*.pch
 
-./vc6-stlport/link_test-vc6-stlport-mt-gd-1_31.lib : vc6-stlport/link_test-vc6-stlport-mt-gd-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc6-stlport/link_test-vc6-stlport-mt-gd-1_31.pdb" /debug /machine:I386 /out:"vc6-stlport/link_test-vc6-stlport-mt-gd-1_31.dll" /implib:"vc6-stlport/link_test-vc6-stlport-mt-gd-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc6-stlport/link_test-vc6-stlport-mt-gd-1_31/link_test.obj
+./vc6-stlport/link_test-vc6-stlport-mt-gd-1_34.lib : vc6-stlport/link_test-vc6-stlport-mt-gd-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc6-stlport/link_test-vc6-stlport-mt-gd-1_34.pdb" /debug /machine:I386 /out:"vc6-stlport/link_test-vc6-stlport-mt-gd-1_34.dll" /implib:"vc6-stlport/link_test-vc6-stlport-mt-gd-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc6-stlport/link_test-vc6-stlport-mt-gd-1_34/link_test.obj
 
-./vc6-stlport/link_test-vc6-stlport-mt-gd-1_31.exe : main.cpp ./vc6-stlport/link_test-vc6-stlport-mt-gd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/link_test-vc6-stlport-mt-gd-1_31.exe main.cpp /link /LIBPATH:./vc6-stlport
-   vc6-stlport\link_test-vc6-stlport-mt-gd-1_31.exe
+./vc6-stlport/link_test-vc6-stlport-mt-gd-1_34.exe : main.cpp ./vc6-stlport/link_test-vc6-stlport-mt-gd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/link_test-vc6-stlport-mt-gd-1_34.exe main.cpp /link /LIBPATH:./vc6-stlport
+   vc6-stlport\link_test-vc6-stlport-mt-gd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc6-stlport-mt-1_31.lib
+# section for link_test-vc6-stlport-mt-1_34.lib
 #
 ########################################################
-vc6-stlport/link_test-vc6-stlport-mt-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /I$(STLPORT_PATH)\stlport /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  $(CXXFLAGS) -Y- -Fo./vc6-stlport/link_test-vc6-stlport-mt-1_31/ -Fdvc6-stlport/link_test-vc6-stlport-mt-1_31.pdb link_test.cpp
+vc6-stlport/link_test-vc6-stlport-mt-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /I$(STLPORT_PATH)\stlport /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  $(CXXFLAGS) -Y- -Fo./vc6-stlport/link_test-vc6-stlport-mt-1_34/ -Fdvc6-stlport/link_test-vc6-stlport-mt-1_34.pdb link_test.cpp
 
-link_test-vc6-stlport-mt-1_31_dir :
-	@if not exist "vc6-stlport\link_test-vc6-stlport-mt-1_31\$(NULL)" mkdir vc6-stlport\link_test-vc6-stlport-mt-1_31
+link_test-vc6-stlport-mt-1_34_dir :
+	@if not exist "vc6-stlport\link_test-vc6-stlport-mt-1_34\$(NULL)" mkdir vc6-stlport\link_test-vc6-stlport-mt-1_34
 
-link_test-vc6-stlport-mt-1_31_clean :
-	del vc6-stlport\link_test-vc6-stlport-mt-1_31\*.obj
-	del vc6-stlport\link_test-vc6-stlport-mt-1_31\*.idb
-	del vc6-stlport\link_test-vc6-stlport-mt-1_31\*.exp
-	del vc6-stlport\link_test-vc6-stlport-mt-1_31\*.pch
+link_test-vc6-stlport-mt-1_34_clean :
+	del vc6-stlport\link_test-vc6-stlport-mt-1_34\*.obj
+	del vc6-stlport\link_test-vc6-stlport-mt-1_34\*.idb
+	del vc6-stlport\link_test-vc6-stlport-mt-1_34\*.exp
+	del vc6-stlport\link_test-vc6-stlport-mt-1_34\*.pch
 
-./vc6-stlport/link_test-vc6-stlport-mt-1_31.lib : vc6-stlport/link_test-vc6-stlport-mt-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc6-stlport/link_test-vc6-stlport-mt-1_31.pdb" /debug /machine:I386 /out:"vc6-stlport/link_test-vc6-stlport-mt-1_31.dll" /implib:"vc6-stlport/link_test-vc6-stlport-mt-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc6-stlport/link_test-vc6-stlport-mt-1_31/link_test.obj
+./vc6-stlport/link_test-vc6-stlport-mt-1_34.lib : vc6-stlport/link_test-vc6-stlport-mt-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc6-stlport/link_test-vc6-stlport-mt-1_34.pdb" /debug /machine:I386 /out:"vc6-stlport/link_test-vc6-stlport-mt-1_34.dll" /implib:"vc6-stlport/link_test-vc6-stlport-mt-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc6-stlport/link_test-vc6-stlport-mt-1_34/link_test.obj
 
-./vc6-stlport/link_test-vc6-stlport-mt-1_31.exe : main.cpp ./vc6-stlport/link_test-vc6-stlport-mt-1_31.lib
-	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /I$(STLPORT_PATH)\stlport /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/link_test-vc6-stlport-mt-1_31.exe main.cpp /link /LIBPATH:./vc6-stlport
-   vc6-stlport\link_test-vc6-stlport-mt-1_31.exe
+./vc6-stlport/link_test-vc6-stlport-mt-1_34.exe : main.cpp ./vc6-stlport/link_test-vc6-stlport-mt-1_34.lib
+	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /I$(STLPORT_PATH)\stlport /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/link_test-vc6-stlport-mt-1_34.exe main.cpp /link /LIBPATH:./vc6-stlport
+   vc6-stlport\link_test-vc6-stlport-mt-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc6-stlport-mt-1_31.lib
+# section for liblink_test-vc6-stlport-mt-1_34.lib
 #
 ########################################################
-vc6-stlport/liblink_test-vc6-stlport-mt-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  $(CXXFLAGS) -Y- -Fo./vc6-stlport/liblink_test-vc6-stlport-mt-1_31/ -Fdvc6-stlport/liblink_test-vc6-stlport-mt-1_31.pdb link_test.cpp
+vc6-stlport/liblink_test-vc6-stlport-mt-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  $(CXXFLAGS) -Y- -Fo./vc6-stlport/liblink_test-vc6-stlport-mt-1_34/ -Fdvc6-stlport/liblink_test-vc6-stlport-mt-1_34.pdb link_test.cpp
 
-liblink_test-vc6-stlport-mt-1_31_dir :
-	@if not exist "vc6-stlport\liblink_test-vc6-stlport-mt-1_31\$(NULL)" mkdir vc6-stlport\liblink_test-vc6-stlport-mt-1_31
+liblink_test-vc6-stlport-mt-1_34_dir :
+	@if not exist "vc6-stlport\liblink_test-vc6-stlport-mt-1_34\$(NULL)" mkdir vc6-stlport\liblink_test-vc6-stlport-mt-1_34
 
-liblink_test-vc6-stlport-mt-1_31_clean :
-	del vc6-stlport\liblink_test-vc6-stlport-mt-1_31\*.obj
-	del vc6-stlport\liblink_test-vc6-stlport-mt-1_31\*.idb
-	del vc6-stlport\liblink_test-vc6-stlport-mt-1_31\*.exp
-	del vc6-stlport\liblink_test-vc6-stlport-mt-1_31\*.pch
+liblink_test-vc6-stlport-mt-1_34_clean :
+	del vc6-stlport\liblink_test-vc6-stlport-mt-1_34\*.obj
+	del vc6-stlport\liblink_test-vc6-stlport-mt-1_34\*.idb
+	del vc6-stlport\liblink_test-vc6-stlport-mt-1_34\*.exp
+	del vc6-stlport\liblink_test-vc6-stlport-mt-1_34\*.pch
 
-./vc6-stlport/liblink_test-vc6-stlport-mt-1_31.lib : vc6-stlport/liblink_test-vc6-stlport-mt-1_31/link_test.obj
-	link -lib /nologo /out:vc6-stlport/liblink_test-vc6-stlport-mt-1_31.lib $(XSFLAGS)  vc6-stlport/liblink_test-vc6-stlport-mt-1_31/link_test.obj
+./vc6-stlport/liblink_test-vc6-stlport-mt-1_34.lib : vc6-stlport/liblink_test-vc6-stlport-mt-1_34/link_test.obj
+	link -lib /nologo /out:vc6-stlport/liblink_test-vc6-stlport-mt-1_34.lib $(XSFLAGS)  vc6-stlport/liblink_test-vc6-stlport-mt-1_34/link_test.obj
 
-./vc6-stlport/liblink_test-vc6-stlport-mt-1_31.exe : main.cpp ./vc6-stlport/liblink_test-vc6-stlport-mt-1_31.lib
-	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/liblink_test-vc6-stlport-mt-1_31.exe main.cpp /link /LIBPATH:./vc6-stlport
-   vc6-stlport\liblink_test-vc6-stlport-mt-1_31.exe
+./vc6-stlport/liblink_test-vc6-stlport-mt-1_34.exe : main.cpp ./vc6-stlport/liblink_test-vc6-stlport-mt-1_34.lib
+	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/liblink_test-vc6-stlport-mt-1_34.exe main.cpp /link /LIBPATH:./vc6-stlport
+   vc6-stlport\liblink_test-vc6-stlport-mt-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc6-stlport-mt-gd-1_31.lib
+# section for liblink_test-vc6-stlport-mt-gd-1_34.lib
 #
 ########################################################
-vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  $(CXXFLAGS) -Y- -Fo./vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_31/ -Fdvc6-stlport/liblink_test-vc6-stlport-mt-gd-1_31.pdb link_test.cpp
+vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  $(CXXFLAGS) -Y- -Fo./vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_34/ -Fdvc6-stlport/liblink_test-vc6-stlport-mt-gd-1_34.pdb link_test.cpp
 
-liblink_test-vc6-stlport-mt-gd-1_31_dir :
-	@if not exist "vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_31\$(NULL)" mkdir vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_31
+liblink_test-vc6-stlport-mt-gd-1_34_dir :
+	@if not exist "vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_34\$(NULL)" mkdir vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_34
 
-liblink_test-vc6-stlport-mt-gd-1_31_clean :
-	del vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_31\*.obj
-	del vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_31\*.idb
-	del vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_31\*.exp
-	del vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_31\*.pch
+liblink_test-vc6-stlport-mt-gd-1_34_clean :
+	del vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_34\*.obj
+	del vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_34\*.idb
+	del vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_34\*.exp
+	del vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_34\*.pch
 
-./vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_31.lib : vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_31/link_test.obj
-	link -lib /nologo /out:vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_31.lib $(XSFLAGS)  vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_31/link_test.obj
+./vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_34.lib : vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_34/link_test.obj
+	link -lib /nologo /out:vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_34.lib $(XSFLAGS)  vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_34/link_test.obj
 
-./vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_31.exe : main.cpp ./vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_31.exe main.cpp /link /LIBPATH:./vc6-stlport
-   vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_31.exe
+./vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_34.exe : main.cpp ./vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/liblink_test-vc6-stlport-mt-gd-1_34.exe main.cpp /link /LIBPATH:./vc6-stlport
+   vc6-stlport\liblink_test-vc6-stlport-mt-gd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc6-stlport-mt-pgd-1_31.lib
+# section for link_test-vc6-stlport-mt-pgd-1_34.lib
 #
 ########################################################
-vc6-stlport/link_test-vc6-stlport-mt-pgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  $(CXXFLAGS) -Y- -Fo./vc6-stlport/link_test-vc6-stlport-mt-pgd-1_31/ -Fdvc6-stlport/link_test-vc6-stlport-mt-pgd-1_31.pdb link_test.cpp
+vc6-stlport/link_test-vc6-stlport-mt-pgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  $(CXXFLAGS) -Y- -Fo./vc6-stlport/link_test-vc6-stlport-mt-pgd-1_34/ -Fdvc6-stlport/link_test-vc6-stlport-mt-pgd-1_34.pdb link_test.cpp
 
-link_test-vc6-stlport-mt-pgd-1_31_dir :
-	@if not exist "vc6-stlport\link_test-vc6-stlport-mt-pgd-1_31\$(NULL)" mkdir vc6-stlport\link_test-vc6-stlport-mt-pgd-1_31
+link_test-vc6-stlport-mt-pgd-1_34_dir :
+	@if not exist "vc6-stlport\link_test-vc6-stlport-mt-pgd-1_34\$(NULL)" mkdir vc6-stlport\link_test-vc6-stlport-mt-pgd-1_34
 
-link_test-vc6-stlport-mt-pgd-1_31_clean :
-	del vc6-stlport\link_test-vc6-stlport-mt-pgd-1_31\*.obj
-	del vc6-stlport\link_test-vc6-stlport-mt-pgd-1_31\*.idb
-	del vc6-stlport\link_test-vc6-stlport-mt-pgd-1_31\*.exp
-	del vc6-stlport\link_test-vc6-stlport-mt-pgd-1_31\*.pch
+link_test-vc6-stlport-mt-pgd-1_34_clean :
+	del vc6-stlport\link_test-vc6-stlport-mt-pgd-1_34\*.obj
+	del vc6-stlport\link_test-vc6-stlport-mt-pgd-1_34\*.idb
+	del vc6-stlport\link_test-vc6-stlport-mt-pgd-1_34\*.exp
+	del vc6-stlport\link_test-vc6-stlport-mt-pgd-1_34\*.pch
 
-./vc6-stlport/link_test-vc6-stlport-mt-pgd-1_31.lib : vc6-stlport/link_test-vc6-stlport-mt-pgd-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc6-stlport/link_test-vc6-stlport-mt-pgd-1_31.pdb" /debug /machine:I386 /out:"vc6-stlport/link_test-vc6-stlport-mt-pgd-1_31.dll" /implib:"vc6-stlport/link_test-vc6-stlport-mt-pgd-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc6-stlport/link_test-vc6-stlport-mt-pgd-1_31/link_test.obj
+./vc6-stlport/link_test-vc6-stlport-mt-pgd-1_34.lib : vc6-stlport/link_test-vc6-stlport-mt-pgd-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc6-stlport/link_test-vc6-stlport-mt-pgd-1_34.pdb" /debug /machine:I386 /out:"vc6-stlport/link_test-vc6-stlport-mt-pgd-1_34.dll" /implib:"vc6-stlport/link_test-vc6-stlport-mt-pgd-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc6-stlport/link_test-vc6-stlport-mt-pgd-1_34/link_test.obj
 
-./vc6-stlport/link_test-vc6-stlport-mt-pgd-1_31.exe : main.cpp ./vc6-stlport/link_test-vc6-stlport-mt-pgd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/link_test-vc6-stlport-mt-pgd-1_31.exe main.cpp /link /LIBPATH:./vc6-stlport
-   vc6-stlport\link_test-vc6-stlport-mt-pgd-1_31.exe
+./vc6-stlport/link_test-vc6-stlport-mt-pgd-1_34.exe : main.cpp ./vc6-stlport/link_test-vc6-stlport-mt-pgd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/link_test-vc6-stlport-mt-pgd-1_34.exe main.cpp /link /LIBPATH:./vc6-stlport
+   vc6-stlport\link_test-vc6-stlport-mt-pgd-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc6-stlport-mt-spgd-1_31.lib
+# section for liblink_test-vc6-stlport-mt-spgd-1_34.lib
 #
 ########################################################
-vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D__STL_DEBUG /D_STLP_DEBUG /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX  $(CXXFLAGS) -Y- -Fo./vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_31/ -Fdvc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_31.pdb link_test.cpp
+vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D__STL_DEBUG /D_STLP_DEBUG /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX  $(CXXFLAGS) -Y- -Fo./vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_34/ -Fdvc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_34.pdb link_test.cpp
 
-liblink_test-vc6-stlport-mt-spgd-1_31_dir :
-	@if not exist "vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_31\$(NULL)" mkdir vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_31
+liblink_test-vc6-stlport-mt-spgd-1_34_dir :
+	@if not exist "vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_34\$(NULL)" mkdir vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_34
 
-liblink_test-vc6-stlport-mt-spgd-1_31_clean :
-	del vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_31\*.obj
-	del vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_31\*.idb
-	del vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_31\*.exp
-	del vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_31\*.pch
+liblink_test-vc6-stlport-mt-spgd-1_34_clean :
+	del vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_34\*.obj
+	del vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_34\*.idb
+	del vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_34\*.exp
+	del vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_34\*.pch
 
-./vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_31.lib : vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_31/link_test.obj
-	link -lib /nologo /out:vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_31.lib $(XSFLAGS)  vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_31/link_test.obj
+./vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_34.lib : vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_34/link_test.obj
+	link -lib /nologo /out:vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_34.lib $(XSFLAGS)  vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_34/link_test.obj
 
-./vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_31.exe : main.cpp ./vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_31.lib
-	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D__STL_DEBUG /D_STLP_DEBUG /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_31.exe main.cpp /link /LIBPATH:./vc6-stlport
-   vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_31.exe
+./vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_34.exe : main.cpp ./vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_34.lib
+	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D__STL_DEBUG /D_STLP_DEBUG /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/liblink_test-vc6-stlport-mt-spgd-1_34.exe main.cpp /link /LIBPATH:./vc6-stlport
+   vc6-stlport\liblink_test-vc6-stlport-mt-spgd-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc6-stlport-mt-pgd-1_31.lib
+# section for liblink_test-vc6-stlport-mt-pgd-1_34.lib
 #
 ########################################################
-vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  $(CXXFLAGS) -Y- -Fo./vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_31/ -Fdvc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_31.pdb link_test.cpp
+vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  $(CXXFLAGS) -Y- -Fo./vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_34/ -Fdvc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_34.pdb link_test.cpp
 
-liblink_test-vc6-stlport-mt-pgd-1_31_dir :
-	@if not exist "vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_31\$(NULL)" mkdir vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_31
+liblink_test-vc6-stlport-mt-pgd-1_34_dir :
+	@if not exist "vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_34\$(NULL)" mkdir vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_34
 
-liblink_test-vc6-stlport-mt-pgd-1_31_clean :
-	del vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_31\*.obj
-	del vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_31\*.idb
-	del vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_31\*.exp
-	del vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_31\*.pch
+liblink_test-vc6-stlport-mt-pgd-1_34_clean :
+	del vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_34\*.obj
+	del vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_34\*.idb
+	del vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_34\*.exp
+	del vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_34\*.pch
 
-./vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_31.lib : vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_31/link_test.obj
-	link -lib /nologo /out:vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_31.lib $(XSFLAGS)  vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_31/link_test.obj
+./vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_34.lib : vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_34/link_test.obj
+	link -lib /nologo /out:vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_34.lib $(XSFLAGS)  vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_34/link_test.obj
 
-./vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_31.exe : main.cpp ./vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_31.exe main.cpp /link /LIBPATH:./vc6-stlport
-   vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_31.exe
+./vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_34.exe : main.cpp ./vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6-stlport/liblink_test-vc6-stlport-mt-pgd-1_34.exe main.cpp /link /LIBPATH:./vc6-stlport
+   vc6-stlport\liblink_test-vc6-stlport-mt-pgd-1_34.exe
 

Modified: boost/trunk/libs/config/test/link/vc6.mak
===================================================================
--- boost/trunk/libs/config/test/link/vc6.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/link/vc6.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2005
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # auto generated makefile for VC6 compiler
 #
@@ -38,25 +42,25 @@
 
 ALL_HEADER=
 
-all : main_dir liblink_test-vc6-s-1_31_dir ./vc6/liblink_test-vc6-s-1_31.lib ./vc6/liblink_test-vc6-s-1_31.exe liblink_test-vc6-mt-s-1_31_dir ./vc6/liblink_test-vc6-mt-s-1_31.lib ./vc6/liblink_test-vc6-mt-s-1_31.exe liblink_test-vc6-sgd-1_31_dir ./vc6/liblink_test-vc6-sgd-1_31.lib ./vc6/liblink_test-vc6-sgd-1_31.exe liblink_test-vc6-mt-sgd-1_31_dir ./vc6/liblink_test-vc6-mt-sgd-1_31.lib ./vc6/liblink_test-vc6-mt-sgd-1_31.exe link_test-vc6-mt-gd-1_31_dir ./vc6/link_test-vc6-mt-gd-1_31.lib ./vc6/link_test-vc6-mt-gd-1_31.exe link_test-vc6-mt-1_31_dir ./vc6/link_test-vc6-mt-1_31.lib ./vc6/link_test-vc6-mt-1_31.exe liblink_test-vc6-mt-1_31_dir ./vc6/liblink_test-vc6-mt-1_31.lib ./vc6/liblink_test-vc6-mt-1_31.exe liblink_test-vc6-mt-gd-1_31_dir ./vc6/liblink_test-vc6-mt-gd-1_31.lib ./vc6/liblink_test-vc6-mt-gd-1_31.exe
+all : main_dir liblink_test-vc6-s-1_34_dir ./vc6/liblink_test-vc6-s-1_34.lib ./vc6/liblink_test-vc6-s-1_34.exe liblink_test-vc6-mt-s-1_34_dir ./vc6/liblink_test-vc6-mt-s-1_34.lib ./vc6/liblink_test-vc6-mt-s-1_34.exe liblink_test-vc6-sgd-1_34_dir ./vc6/liblink_test-vc6-sgd-1_34.lib ./vc6/liblink_test-vc6-sgd-1_34.exe liblink_test-vc6-mt-sgd-1_34_dir ./vc6/liblink_test-vc6-mt-sgd-1_34.lib ./vc6/liblink_test-vc6-mt-sgd-1_34.exe link_test-vc6-mt-gd-1_34_dir ./vc6/link_test-vc6-mt-gd-1_34.lib ./vc6/link_test-vc6-mt-gd-1_34.exe link_test-vc6-mt-1_34_dir ./vc6/link_test-vc6-mt-1_34.lib ./vc6/link_test-vc6-mt-1_34.exe liblink_test-vc6-mt-1_34_dir ./vc6/liblink_test-vc6-mt-1_34.lib ./vc6/liblink_test-vc6-mt-1_34.exe liblink_test-vc6-mt-gd-1_34_dir ./vc6/liblink_test-vc6-mt-gd-1_34.lib ./vc6/liblink_test-vc6-mt-gd-1_34.exe
 
-clean :  liblink_test-vc6-s-1_31_clean liblink_test-vc6-mt-s-1_31_clean liblink_test-vc6-sgd-1_31_clean liblink_test-vc6-mt-sgd-1_31_clean link_test-vc6-mt-gd-1_31_clean link_test-vc6-mt-1_31_clean liblink_test-vc6-mt-1_31_clean liblink_test-vc6-mt-gd-1_31_clean
+clean :  liblink_test-vc6-s-1_34_clean liblink_test-vc6-mt-s-1_34_clean liblink_test-vc6-sgd-1_34_clean liblink_test-vc6-mt-sgd-1_34_clean link_test-vc6-mt-gd-1_34_clean link_test-vc6-mt-1_34_clean liblink_test-vc6-mt-1_34_clean liblink_test-vc6-mt-gd-1_34_clean
 
 install : all
-	copy vc6\liblink_test-vc6-s-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6\liblink_test-vc6-mt-s-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6\liblink_test-vc6-sgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6\liblink_test-vc6-sgd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc6\liblink_test-vc6-mt-sgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6\liblink_test-vc6-mt-sgd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc6\link_test-vc6-mt-gd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6\link_test-vc6-mt-gd-1_31.dll "$(MSVCDIR)\bin"
-	copy vc6\link_test-vc6-mt-gd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc6\link_test-vc6-mt-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6\link_test-vc6-mt-1_31.dll "$(MSVCDIR)\bin"
-	copy vc6\liblink_test-vc6-mt-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6\liblink_test-vc6-mt-gd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc6\liblink_test-vc6-mt-gd-1_31.pdb "$(MSVCDIR)\lib"
+	copy vc6\liblink_test-vc6-s-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6\liblink_test-vc6-mt-s-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6\liblink_test-vc6-sgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6\liblink_test-vc6-sgd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc6\liblink_test-vc6-mt-sgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6\liblink_test-vc6-mt-sgd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc6\link_test-vc6-mt-gd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6\link_test-vc6-mt-gd-1_34.dll "$(MSVCDIR)\bin"
+	copy vc6\link_test-vc6-mt-gd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc6\link_test-vc6-mt-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6\link_test-vc6-mt-1_34.dll "$(MSVCDIR)\bin"
+	copy vc6\liblink_test-vc6-mt-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6\liblink_test-vc6-mt-gd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc6\liblink_test-vc6-mt-gd-1_34.pdb "$(MSVCDIR)\lib"
 
 main_dir :
 	@if not exist "vc6\$(NULL)" mkdir vc6
@@ -64,193 +68,193 @@
 
 ########################################################
 #
-# section for liblink_test-vc6-s-1_31.lib
+# section for liblink_test-vc6-s-1_34.lib
 #
 ########################################################
-vc6/liblink_test-vc6-s-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /ML /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD $(CXXFLAGS) -Y- -Fo./vc6/liblink_test-vc6-s-1_31/ -Fdvc6/liblink_test-vc6-s-1_31.pdb link_test.cpp
+vc6/liblink_test-vc6-s-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /ML /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD $(CXXFLAGS) -Y- -Fo./vc6/liblink_test-vc6-s-1_34/ -Fdvc6/liblink_test-vc6-s-1_34.pdb link_test.cpp
 
-liblink_test-vc6-s-1_31_dir :
-	@if not exist "vc6\liblink_test-vc6-s-1_31\$(NULL)" mkdir vc6\liblink_test-vc6-s-1_31
+liblink_test-vc6-s-1_34_dir :
+	@if not exist "vc6\liblink_test-vc6-s-1_34\$(NULL)" mkdir vc6\liblink_test-vc6-s-1_34
 
-liblink_test-vc6-s-1_31_clean :
-	del vc6\liblink_test-vc6-s-1_31\*.obj
-	del vc6\liblink_test-vc6-s-1_31\*.idb
-	del vc6\liblink_test-vc6-s-1_31\*.exp
-	del vc6\liblink_test-vc6-s-1_31\*.pch
+liblink_test-vc6-s-1_34_clean :
+	del vc6\liblink_test-vc6-s-1_34\*.obj
+	del vc6\liblink_test-vc6-s-1_34\*.idb
+	del vc6\liblink_test-vc6-s-1_34\*.exp
+	del vc6\liblink_test-vc6-s-1_34\*.pch
 
-./vc6/liblink_test-vc6-s-1_31.lib : vc6/liblink_test-vc6-s-1_31/link_test.obj
-	link -lib /nologo /out:vc6/liblink_test-vc6-s-1_31.lib $(XSFLAGS)  vc6/liblink_test-vc6-s-1_31/link_test.obj
+./vc6/liblink_test-vc6-s-1_34.lib : vc6/liblink_test-vc6-s-1_34/link_test.obj
+	link -lib /nologo /out:vc6/liblink_test-vc6-s-1_34.lib $(XSFLAGS)  vc6/liblink_test-vc6-s-1_34/link_test.obj
 
-./vc6/liblink_test-vc6-s-1_31.exe : main.cpp ./vc6/liblink_test-vc6-s-1_31.lib
-	cl $(INCLUDES) /nologo /ML /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/liblink_test-vc6-s-1_31.exe main.cpp /link /LIBPATH:./vc6
-   vc6\liblink_test-vc6-s-1_31.exe
+./vc6/liblink_test-vc6-s-1_34.exe : main.cpp ./vc6/liblink_test-vc6-s-1_34.lib
+	cl $(INCLUDES) /nologo /ML /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/liblink_test-vc6-s-1_34.exe main.cpp /link /LIBPATH:./vc6
+   vc6\liblink_test-vc6-s-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc6-mt-s-1_31.lib
+# section for liblink_test-vc6-mt-s-1_34.lib
 #
 ########################################################
-vc6/liblink_test-vc6-mt-s-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD  $(CXXFLAGS) -Y- -Fo./vc6/liblink_test-vc6-mt-s-1_31/ -Fdvc6/liblink_test-vc6-mt-s-1_31.pdb link_test.cpp
+vc6/liblink_test-vc6-mt-s-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD  $(CXXFLAGS) -Y- -Fo./vc6/liblink_test-vc6-mt-s-1_34/ -Fdvc6/liblink_test-vc6-mt-s-1_34.pdb link_test.cpp
 
-liblink_test-vc6-mt-s-1_31_dir :
-	@if not exist "vc6\liblink_test-vc6-mt-s-1_31\$(NULL)" mkdir vc6\liblink_test-vc6-mt-s-1_31
+liblink_test-vc6-mt-s-1_34_dir :
+	@if not exist "vc6\liblink_test-vc6-mt-s-1_34\$(NULL)" mkdir vc6\liblink_test-vc6-mt-s-1_34
 
-liblink_test-vc6-mt-s-1_31_clean :
-	del vc6\liblink_test-vc6-mt-s-1_31\*.obj
-	del vc6\liblink_test-vc6-mt-s-1_31\*.idb
-	del vc6\liblink_test-vc6-mt-s-1_31\*.exp
-	del vc6\liblink_test-vc6-mt-s-1_31\*.pch
+liblink_test-vc6-mt-s-1_34_clean :
+	del vc6\liblink_test-vc6-mt-s-1_34\*.obj
+	del vc6\liblink_test-vc6-mt-s-1_34\*.idb
+	del vc6\liblink_test-vc6-mt-s-1_34\*.exp
+	del vc6\liblink_test-vc6-mt-s-1_34\*.pch
 
-./vc6/liblink_test-vc6-mt-s-1_31.lib : vc6/liblink_test-vc6-mt-s-1_31/link_test.obj
-	link -lib /nologo /out:vc6/liblink_test-vc6-mt-s-1_31.lib $(XSFLAGS)  vc6/liblink_test-vc6-mt-s-1_31/link_test.obj
+./vc6/liblink_test-vc6-mt-s-1_34.lib : vc6/liblink_test-vc6-mt-s-1_34/link_test.obj
+	link -lib /nologo /out:vc6/liblink_test-vc6-mt-s-1_34.lib $(XSFLAGS)  vc6/liblink_test-vc6-mt-s-1_34/link_test.obj
 
-./vc6/liblink_test-vc6-mt-s-1_31.exe : main.cpp ./vc6/liblink_test-vc6-mt-s-1_31.lib
-	cl $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/liblink_test-vc6-mt-s-1_31.exe main.cpp /link /LIBPATH:./vc6
-   vc6\liblink_test-vc6-mt-s-1_31.exe
+./vc6/liblink_test-vc6-mt-s-1_34.exe : main.cpp ./vc6/liblink_test-vc6-mt-s-1_34.lib
+	cl $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/liblink_test-vc6-mt-s-1_34.exe main.cpp /link /LIBPATH:./vc6
+   vc6\liblink_test-vc6-mt-s-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc6-sgd-1_31.lib
+# section for liblink_test-vc6-sgd-1_34.lib
 #
 ########################################################
-vc6/liblink_test-vc6-sgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MLd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_DEBUG /D_MBCS /D_LIB /FD /GX   $(CXXFLAGS) -Y- -Fo./vc6/liblink_test-vc6-sgd-1_31/ -Fdvc6/liblink_test-vc6-sgd-1_31.pdb link_test.cpp
+vc6/liblink_test-vc6-sgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MLd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_DEBUG /D_MBCS /D_LIB /FD /GX   $(CXXFLAGS) -Y- -Fo./vc6/liblink_test-vc6-sgd-1_34/ -Fdvc6/liblink_test-vc6-sgd-1_34.pdb link_test.cpp
 
-liblink_test-vc6-sgd-1_31_dir :
-	@if not exist "vc6\liblink_test-vc6-sgd-1_31\$(NULL)" mkdir vc6\liblink_test-vc6-sgd-1_31
+liblink_test-vc6-sgd-1_34_dir :
+	@if not exist "vc6\liblink_test-vc6-sgd-1_34\$(NULL)" mkdir vc6\liblink_test-vc6-sgd-1_34
 
-liblink_test-vc6-sgd-1_31_clean :
-	del vc6\liblink_test-vc6-sgd-1_31\*.obj
-	del vc6\liblink_test-vc6-sgd-1_31\*.idb
-	del vc6\liblink_test-vc6-sgd-1_31\*.exp
-	del vc6\liblink_test-vc6-sgd-1_31\*.pch
+liblink_test-vc6-sgd-1_34_clean :
+	del vc6\liblink_test-vc6-sgd-1_34\*.obj
+	del vc6\liblink_test-vc6-sgd-1_34\*.idb
+	del vc6\liblink_test-vc6-sgd-1_34\*.exp
+	del vc6\liblink_test-vc6-sgd-1_34\*.pch
 
-./vc6/liblink_test-vc6-sgd-1_31.lib : vc6/liblink_test-vc6-sgd-1_31/link_test.obj
-	link -lib /nologo /out:vc6/liblink_test-vc6-sgd-1_31.lib $(XSFLAGS)  vc6/liblink_test-vc6-sgd-1_31/link_test.obj
+./vc6/liblink_test-vc6-sgd-1_34.lib : vc6/liblink_test-vc6-sgd-1_34/link_test.obj
+	link -lib /nologo /out:vc6/liblink_test-vc6-sgd-1_34.lib $(XSFLAGS)  vc6/liblink_test-vc6-sgd-1_34/link_test.obj
 
-./vc6/liblink_test-vc6-sgd-1_31.exe : main.cpp ./vc6/liblink_test-vc6-sgd-1_31.lib
-	cl $(INCLUDES) /nologo /MLd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_DEBUG /D_MBCS /D_LIB /FD /GX   /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/liblink_test-vc6-sgd-1_31.exe main.cpp /link /LIBPATH:./vc6
-   vc6\liblink_test-vc6-sgd-1_31.exe
+./vc6/liblink_test-vc6-sgd-1_34.exe : main.cpp ./vc6/liblink_test-vc6-sgd-1_34.lib
+	cl $(INCLUDES) /nologo /MLd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_DEBUG /D_MBCS /D_LIB /FD /GX   /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/liblink_test-vc6-sgd-1_34.exe main.cpp /link /LIBPATH:./vc6
+   vc6\liblink_test-vc6-sgd-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc6-mt-sgd-1_31.lib
+# section for liblink_test-vc6-mt-sgd-1_34.lib
 #
 ########################################################
-vc6/liblink_test-vc6-mt-sgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /FD /GX  $(CXXFLAGS) -Y- -Fo./vc6/liblink_test-vc6-mt-sgd-1_31/ -Fdvc6/liblink_test-vc6-mt-sgd-1_31.pdb link_test.cpp
+vc6/liblink_test-vc6-mt-sgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /FD /GX  $(CXXFLAGS) -Y- -Fo./vc6/liblink_test-vc6-mt-sgd-1_34/ -Fdvc6/liblink_test-vc6-mt-sgd-1_34.pdb link_test.cpp
 
-liblink_test-vc6-mt-sgd-1_31_dir :
-	@if not exist "vc6\liblink_test-vc6-mt-sgd-1_31\$(NULL)" mkdir vc6\liblink_test-vc6-mt-sgd-1_31
+liblink_test-vc6-mt-sgd-1_34_dir :
+	@if not exist "vc6\liblink_test-vc6-mt-sgd-1_34\$(NULL)" mkdir vc6\liblink_test-vc6-mt-sgd-1_34
 
-liblink_test-vc6-mt-sgd-1_31_clean :
-	del vc6\liblink_test-vc6-mt-sgd-1_31\*.obj
-	del vc6\liblink_test-vc6-mt-sgd-1_31\*.idb
-	del vc6\liblink_test-vc6-mt-sgd-1_31\*.exp
-	del vc6\liblink_test-vc6-mt-sgd-1_31\*.pch
+liblink_test-vc6-mt-sgd-1_34_clean :
+	del vc6\liblink_test-vc6-mt-sgd-1_34\*.obj
+	del vc6\liblink_test-vc6-mt-sgd-1_34\*.idb
+	del vc6\liblink_test-vc6-mt-sgd-1_34\*.exp
+	del vc6\liblink_test-vc6-mt-sgd-1_34\*.pch
 
-./vc6/liblink_test-vc6-mt-sgd-1_31.lib : vc6/liblink_test-vc6-mt-sgd-1_31/link_test.obj
-	link -lib /nologo /out:vc6/liblink_test-vc6-mt-sgd-1_31.lib $(XSFLAGS)  vc6/liblink_test-vc6-mt-sgd-1_31/link_test.obj
+./vc6/liblink_test-vc6-mt-sgd-1_34.lib : vc6/liblink_test-vc6-mt-sgd-1_34/link_test.obj
+	link -lib /nologo /out:vc6/liblink_test-vc6-mt-sgd-1_34.lib $(XSFLAGS)  vc6/liblink_test-vc6-mt-sgd-1_34/link_test.obj
 
-./vc6/liblink_test-vc6-mt-sgd-1_31.exe : main.cpp ./vc6/liblink_test-vc6-mt-sgd-1_31.lib
-	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /FD /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/liblink_test-vc6-mt-sgd-1_31.exe main.cpp /link /LIBPATH:./vc6
-   vc6\liblink_test-vc6-mt-sgd-1_31.exe
+./vc6/liblink_test-vc6-mt-sgd-1_34.exe : main.cpp ./vc6/liblink_test-vc6-mt-sgd-1_34.lib
+	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /FD /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/liblink_test-vc6-mt-sgd-1_34.exe main.cpp /link /LIBPATH:./vc6
+   vc6\liblink_test-vc6-mt-sgd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc6-mt-gd-1_31.lib
+# section for link_test-vc6-mt-gd-1_34.lib
 #
 ########################################################
-vc6/link_test-vc6-mt-gd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /D_DEBUG /DBOOST_DYN_LINK /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX  $(CXXFLAGS) -Y- -Fo./vc6/link_test-vc6-mt-gd-1_31/ -Fdvc6/link_test-vc6-mt-gd-1_31.pdb link_test.cpp
+vc6/link_test-vc6-mt-gd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /D_DEBUG /DBOOST_DYN_LINK /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX  $(CXXFLAGS) -Y- -Fo./vc6/link_test-vc6-mt-gd-1_34/ -Fdvc6/link_test-vc6-mt-gd-1_34.pdb link_test.cpp
 
-link_test-vc6-mt-gd-1_31_dir :
-	@if not exist "vc6\link_test-vc6-mt-gd-1_31\$(NULL)" mkdir vc6\link_test-vc6-mt-gd-1_31
+link_test-vc6-mt-gd-1_34_dir :
+	@if not exist "vc6\link_test-vc6-mt-gd-1_34\$(NULL)" mkdir vc6\link_test-vc6-mt-gd-1_34
 
-link_test-vc6-mt-gd-1_31_clean :
-	del vc6\link_test-vc6-mt-gd-1_31\*.obj
-	del vc6\link_test-vc6-mt-gd-1_31\*.idb
-	del vc6\link_test-vc6-mt-gd-1_31\*.exp
-	del vc6\link_test-vc6-mt-gd-1_31\*.pch
+link_test-vc6-mt-gd-1_34_clean :
+	del vc6\link_test-vc6-mt-gd-1_34\*.obj
+	del vc6\link_test-vc6-mt-gd-1_34\*.idb
+	del vc6\link_test-vc6-mt-gd-1_34\*.exp
+	del vc6\link_test-vc6-mt-gd-1_34\*.pch
 
-./vc6/link_test-vc6-mt-gd-1_31.lib : vc6/link_test-vc6-mt-gd-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc6/link_test-vc6-mt-gd-1_31.pdb" /debug /machine:I386 /out:"vc6/link_test-vc6-mt-gd-1_31.dll" /implib:"vc6/link_test-vc6-mt-gd-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc6/link_test-vc6-mt-gd-1_31/link_test.obj
+./vc6/link_test-vc6-mt-gd-1_34.lib : vc6/link_test-vc6-mt-gd-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc6/link_test-vc6-mt-gd-1_34.pdb" /debug /machine:I386 /out:"vc6/link_test-vc6-mt-gd-1_34.dll" /implib:"vc6/link_test-vc6-mt-gd-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc6/link_test-vc6-mt-gd-1_34/link_test.obj
 
-./vc6/link_test-vc6-mt-gd-1_31.exe : main.cpp ./vc6/link_test-vc6-mt-gd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /D_DEBUG /DBOOST_DYN_LINK /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/link_test-vc6-mt-gd-1_31.exe main.cpp /link /LIBPATH:./vc6
-   vc6\link_test-vc6-mt-gd-1_31.exe
+./vc6/link_test-vc6-mt-gd-1_34.exe : main.cpp ./vc6/link_test-vc6-mt-gd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /D_DEBUG /DBOOST_DYN_LINK /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/link_test-vc6-mt-gd-1_34.exe main.cpp /link /LIBPATH:./vc6
+   vc6\link_test-vc6-mt-gd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc6-mt-1_31.lib
+# section for link_test-vc6-mt-1_34.lib
 #
 ########################################################
-vc6/link_test-vc6-mt-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  $(CXXFLAGS) -Y- -Fo./vc6/link_test-vc6-mt-1_31/ -Fdvc6/link_test-vc6-mt-1_31.pdb link_test.cpp
+vc6/link_test-vc6-mt-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  $(CXXFLAGS) -Y- -Fo./vc6/link_test-vc6-mt-1_34/ -Fdvc6/link_test-vc6-mt-1_34.pdb link_test.cpp
 
-link_test-vc6-mt-1_31_dir :
-	@if not exist "vc6\link_test-vc6-mt-1_31\$(NULL)" mkdir vc6\link_test-vc6-mt-1_31
+link_test-vc6-mt-1_34_dir :
+	@if not exist "vc6\link_test-vc6-mt-1_34\$(NULL)" mkdir vc6\link_test-vc6-mt-1_34
 
-link_test-vc6-mt-1_31_clean :
-	del vc6\link_test-vc6-mt-1_31\*.obj
-	del vc6\link_test-vc6-mt-1_31\*.idb
-	del vc6\link_test-vc6-mt-1_31\*.exp
-	del vc6\link_test-vc6-mt-1_31\*.pch
+link_test-vc6-mt-1_34_clean :
+	del vc6\link_test-vc6-mt-1_34\*.obj
+	del vc6\link_test-vc6-mt-1_34\*.idb
+	del vc6\link_test-vc6-mt-1_34\*.exp
+	del vc6\link_test-vc6-mt-1_34\*.pch
 
-./vc6/link_test-vc6-mt-1_31.lib : vc6/link_test-vc6-mt-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc6/link_test-vc6-mt-1_31.pdb" /debug /machine:I386 /out:"vc6/link_test-vc6-mt-1_31.dll" /implib:"vc6/link_test-vc6-mt-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc6/link_test-vc6-mt-1_31/link_test.obj
+./vc6/link_test-vc6-mt-1_34.lib : vc6/link_test-vc6-mt-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc6/link_test-vc6-mt-1_34.pdb" /debug /machine:I386 /out:"vc6/link_test-vc6-mt-1_34.dll" /implib:"vc6/link_test-vc6-mt-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc6/link_test-vc6-mt-1_34/link_test.obj
 
-./vc6/link_test-vc6-mt-1_31.exe : main.cpp ./vc6/link_test-vc6-mt-1_31.lib
-	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/link_test-vc6-mt-1_31.exe main.cpp /link /LIBPATH:./vc6
-   vc6\link_test-vc6-mt-1_31.exe
+./vc6/link_test-vc6-mt-1_34.exe : main.cpp ./vc6/link_test-vc6-mt-1_34.lib
+	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/link_test-vc6-mt-1_34.exe main.cpp /link /LIBPATH:./vc6
+   vc6\link_test-vc6-mt-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc6-mt-1_31.lib
+# section for liblink_test-vc6-mt-1_34.lib
 #
 ########################################################
-vc6/liblink_test-vc6-mt-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  $(CXXFLAGS) -Y- -Fo./vc6/liblink_test-vc6-mt-1_31/ -Fdvc6/liblink_test-vc6-mt-1_31.pdb link_test.cpp
+vc6/liblink_test-vc6-mt-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  $(CXXFLAGS) -Y- -Fo./vc6/liblink_test-vc6-mt-1_34/ -Fdvc6/liblink_test-vc6-mt-1_34.pdb link_test.cpp
 
-liblink_test-vc6-mt-1_31_dir :
-	@if not exist "vc6\liblink_test-vc6-mt-1_31\$(NULL)" mkdir vc6\liblink_test-vc6-mt-1_31
+liblink_test-vc6-mt-1_34_dir :
+	@if not exist "vc6\liblink_test-vc6-mt-1_34\$(NULL)" mkdir vc6\liblink_test-vc6-mt-1_34
 
-liblink_test-vc6-mt-1_31_clean :
-	del vc6\liblink_test-vc6-mt-1_31\*.obj
-	del vc6\liblink_test-vc6-mt-1_31\*.idb
-	del vc6\liblink_test-vc6-mt-1_31\*.exp
-	del vc6\liblink_test-vc6-mt-1_31\*.pch
+liblink_test-vc6-mt-1_34_clean :
+	del vc6\liblink_test-vc6-mt-1_34\*.obj
+	del vc6\liblink_test-vc6-mt-1_34\*.idb
+	del vc6\liblink_test-vc6-mt-1_34\*.exp
+	del vc6\liblink_test-vc6-mt-1_34\*.pch
 
-./vc6/liblink_test-vc6-mt-1_31.lib : vc6/liblink_test-vc6-mt-1_31/link_test.obj
-	link -lib /nologo /out:vc6/liblink_test-vc6-mt-1_31.lib $(XSFLAGS)  vc6/liblink_test-vc6-mt-1_31/link_test.obj
+./vc6/liblink_test-vc6-mt-1_34.lib : vc6/liblink_test-vc6-mt-1_34/link_test.obj
+	link -lib /nologo /out:vc6/liblink_test-vc6-mt-1_34.lib $(XSFLAGS)  vc6/liblink_test-vc6-mt-1_34/link_test.obj
 
-./vc6/liblink_test-vc6-mt-1_31.exe : main.cpp ./vc6/liblink_test-vc6-mt-1_31.lib
-	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/liblink_test-vc6-mt-1_31.exe main.cpp /link /LIBPATH:./vc6
-   vc6\liblink_test-vc6-mt-1_31.exe
+./vc6/liblink_test-vc6-mt-1_34.exe : main.cpp ./vc6/liblink_test-vc6-mt-1_34.lib
+	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/liblink_test-vc6-mt-1_34.exe main.cpp /link /LIBPATH:./vc6
+   vc6\liblink_test-vc6-mt-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc6-mt-gd-1_31.lib
+# section for liblink_test-vc6-mt-gd-1_34.lib
 #
 ########################################################
-vc6/liblink_test-vc6-mt-gd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX  $(CXXFLAGS) -Y- -Fo./vc6/liblink_test-vc6-mt-gd-1_31/ -Fdvc6/liblink_test-vc6-mt-gd-1_31.pdb link_test.cpp
+vc6/liblink_test-vc6-mt-gd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX  $(CXXFLAGS) -Y- -Fo./vc6/liblink_test-vc6-mt-gd-1_34/ -Fdvc6/liblink_test-vc6-mt-gd-1_34.pdb link_test.cpp
 
-liblink_test-vc6-mt-gd-1_31_dir :
-	@if not exist "vc6\liblink_test-vc6-mt-gd-1_31\$(NULL)" mkdir vc6\liblink_test-vc6-mt-gd-1_31
+liblink_test-vc6-mt-gd-1_34_dir :
+	@if not exist "vc6\liblink_test-vc6-mt-gd-1_34\$(NULL)" mkdir vc6\liblink_test-vc6-mt-gd-1_34
 
-liblink_test-vc6-mt-gd-1_31_clean :
-	del vc6\liblink_test-vc6-mt-gd-1_31\*.obj
-	del vc6\liblink_test-vc6-mt-gd-1_31\*.idb
-	del vc6\liblink_test-vc6-mt-gd-1_31\*.exp
-	del vc6\liblink_test-vc6-mt-gd-1_31\*.pch
+liblink_test-vc6-mt-gd-1_34_clean :
+	del vc6\liblink_test-vc6-mt-gd-1_34\*.obj
+	del vc6\liblink_test-vc6-mt-gd-1_34\*.idb
+	del vc6\liblink_test-vc6-mt-gd-1_34\*.exp
+	del vc6\liblink_test-vc6-mt-gd-1_34\*.pch
 
-./vc6/liblink_test-vc6-mt-gd-1_31.lib : vc6/liblink_test-vc6-mt-gd-1_31/link_test.obj
-	link -lib /nologo /out:vc6/liblink_test-vc6-mt-gd-1_31.lib $(XSFLAGS)  vc6/liblink_test-vc6-mt-gd-1_31/link_test.obj
+./vc6/liblink_test-vc6-mt-gd-1_34.lib : vc6/liblink_test-vc6-mt-gd-1_34/link_test.obj
+	link -lib /nologo /out:vc6/liblink_test-vc6-mt-gd-1_34.lib $(XSFLAGS)  vc6/liblink_test-vc6-mt-gd-1_34/link_test.obj
 
-./vc6/liblink_test-vc6-mt-gd-1_31.exe : main.cpp ./vc6/liblink_test-vc6-mt-gd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/liblink_test-vc6-mt-gd-1_31.exe main.cpp /link /LIBPATH:./vc6
-   vc6\liblink_test-vc6-mt-gd-1_31.exe
+./vc6/liblink_test-vc6-mt-gd-1_34.exe : main.cpp ./vc6/liblink_test-vc6-mt-gd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc6/liblink_test-vc6-mt-gd-1_34.exe main.cpp /link /LIBPATH:./vc6
+   vc6\liblink_test-vc6-mt-gd-1_34.exe
 

Modified: boost/trunk/libs/config/test/link/vc7-stlport.mak
===================================================================
--- boost/trunk/libs/config/test/link/vc7-stlport.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/link/vc7-stlport.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2005
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # auto generated makefile for VC6+STLPort
 #
@@ -42,26 +46,26 @@
 
 ALL_HEADER=
 
-all : main_dir liblink_test-vc7-stlport-mt-s-1_31_dir ./vc7-stlport/liblink_test-vc7-stlport-mt-s-1_31.lib ./vc7-stlport/liblink_test-vc7-stlport-mt-s-1_31.exe liblink_test-vc7-stlport-mt-sgd-1_31_dir ./vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_31.lib ./vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_31.exe link_test-vc7-stlport-mt-gd-1_31_dir ./vc7-stlport/link_test-vc7-stlport-mt-gd-1_31.lib ./vc7-stlport/link_test-vc7-stlport-mt-gd-1_31.exe link_test-vc7-stlport-mt-1_31_dir ./vc7-stlport/link_test-vc7-stlport-mt-1_31.lib ./vc7-stlport/link_test-vc7-stlport-mt-1_31.exe liblink_test-vc7-stlport-mt-1_31_dir ./vc7-stlport/liblink_test-vc7-stlport-mt-1_31.lib ./vc7-stlport/liblink_test-vc7-stlport-mt-1_31.exe liblink_test-vc7-stlport-mt-gd-1_31_dir ./vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_31.lib ./vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_31.exe link_test-vc7-stlport-mt-pgd-1_31_dir ./vc7-stlport/link_test-vc7-stlport-mt-pgd-1_31.lib ./vc7-stlport/link_test-vc7-stlport-mt-pgd-1_31.exe liblink_test-vc7-stlport-mt-spgd-1_31_dir ./vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_31.lib ./vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_31.exe liblink_test-vc7-stlport-mt-pgd-1_31_dir ./vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_31.lib ./vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_31.exe
+all : main_dir liblink_test-vc7-stlport-mt-s-1_34_dir ./vc7-stlport/liblink_test-vc7-stlport-mt-s-1_34.lib ./vc7-stlport/liblink_test-vc7-stlport-mt-s-1_34.exe liblink_test-vc7-stlport-mt-sgd-1_34_dir ./vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_34.lib ./vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_34.exe link_test-vc7-stlport-mt-gd-1_34_dir ./vc7-stlport/link_test-vc7-stlport-mt-gd-1_34.lib ./vc7-stlport/link_test-vc7-stlport-mt-gd-1_34.exe link_test-vc7-stlport-mt-1_34_dir ./vc7-stlport/link_test-vc7-stlport-mt-1_34.lib ./vc7-stlport/link_test-vc7-stlport-mt-1_34.exe liblink_test-vc7-stlport-mt-1_34_dir ./vc7-stlport/liblink_test-vc7-stlport-mt-1_34.lib ./vc7-stlport/liblink_test-vc7-stlport-mt-1_34.exe liblink_test-vc7-stlport-mt-gd-1_34_dir ./vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_34.lib ./vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_34.exe link_test-vc7-stlport-mt-pgd-1_34_dir ./vc7-stlport/link_test-vc7-stlport-mt-pgd-1_34.lib ./vc7-stlport/link_test-vc7-stlport-mt-pgd-1_34.exe liblink_test-vc7-stlport-mt-spgd-1_34_dir ./vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_34.lib ./vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_34.exe liblink_test-vc7-stlport-mt-pgd-1_34_dir ./vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_34.lib ./vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_34.exe
 
-clean :  liblink_test-vc7-stlport-mt-s-1_31_clean liblink_test-vc7-stlport-mt-sgd-1_31_clean link_test-vc7-stlport-mt-gd-1_31_clean link_test-vc7-stlport-mt-1_31_clean liblink_test-vc7-stlport-mt-1_31_clean liblink_test-vc7-stlport-mt-gd-1_31_clean link_test-vc7-stlport-mt-pgd-1_31_clean liblink_test-vc7-stlport-mt-spgd-1_31_clean liblink_test-vc7-stlport-mt-pgd-1_31_clean
+clean :  liblink_test-vc7-stlport-mt-s-1_34_clean liblink_test-vc7-stlport-mt-sgd-1_34_clean link_test-vc7-stlport-mt-gd-1_34_clean link_test-vc7-stlport-mt-1_34_clean liblink_test-vc7-stlport-mt-1_34_clean liblink_test-vc7-stlport-mt-gd-1_34_clean link_test-vc7-stlport-mt-pgd-1_34_clean liblink_test-vc7-stlport-mt-spgd-1_34_clean liblink_test-vc7-stlport-mt-pgd-1_34_clean
 
 install : stlport_check all
-	copy vc7-stlport\liblink_test-vc7-stlport-mt-s-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7-stlport\link_test-vc7-stlport-mt-gd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7-stlport\link_test-vc7-stlport-mt-gd-1_31.dll "$(MSVCDIR)\bin"
-	copy vc7-stlport\link_test-vc7-stlport-mt-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7-stlport\link_test-vc7-stlport-mt-1_31.dll "$(MSVCDIR)\bin"
-	copy vc7-stlport\liblink_test-vc7-stlport-mt-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7-stlport\link_test-vc7-stlport-mt-pgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7-stlport\link_test-vc7-stlport-mt-pgd-1_31.dll "$(MSVCDIR)\bin"
-	copy vc7-stlport\link_test-vc7-stlport-mt-pgd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_31.pdb "$(MSVCDIR)\lib"
+	copy vc7-stlport\liblink_test-vc7-stlport-mt-s-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7-stlport\link_test-vc7-stlport-mt-gd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7-stlport\link_test-vc7-stlport-mt-gd-1_34.dll "$(MSVCDIR)\bin"
+	copy vc7-stlport\link_test-vc7-stlport-mt-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7-stlport\link_test-vc7-stlport-mt-1_34.dll "$(MSVCDIR)\bin"
+	copy vc7-stlport\liblink_test-vc7-stlport-mt-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7-stlport\link_test-vc7-stlport-mt-pgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7-stlport\link_test-vc7-stlport-mt-pgd-1_34.dll "$(MSVCDIR)\bin"
+	copy vc7-stlport\link_test-vc7-stlport-mt-pgd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_34.pdb "$(MSVCDIR)\lib"
 
 main_dir :
 	@if not exist "vc7-stlport\$(NULL)" mkdir vc7-stlport
@@ -72,217 +76,217 @@
 
 ########################################################
 #
-# section for liblink_test-vc7-stlport-mt-s-1_31.lib
+# section for liblink_test-vc7-stlport-mt-s-1_34.lib
 #
 ########################################################
-vc7-stlport/liblink_test-vc7-stlport-mt-s-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB  $(CXXFLAGS) -Y- -Fo./vc7-stlport/liblink_test-vc7-stlport-mt-s-1_31/ -Fdvc7-stlport/liblink_test-vc7-stlport-mt-s-1_31.pdb link_test.cpp
+vc7-stlport/liblink_test-vc7-stlport-mt-s-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB  $(CXXFLAGS) -Y- -Fo./vc7-stlport/liblink_test-vc7-stlport-mt-s-1_34/ -Fdvc7-stlport/liblink_test-vc7-stlport-mt-s-1_34.pdb link_test.cpp
 
-liblink_test-vc7-stlport-mt-s-1_31_dir :
-	@if not exist "vc7-stlport\liblink_test-vc7-stlport-mt-s-1_31\$(NULL)" mkdir vc7-stlport\liblink_test-vc7-stlport-mt-s-1_31
+liblink_test-vc7-stlport-mt-s-1_34_dir :
+	@if not exist "vc7-stlport\liblink_test-vc7-stlport-mt-s-1_34\$(NULL)" mkdir vc7-stlport\liblink_test-vc7-stlport-mt-s-1_34
 
-liblink_test-vc7-stlport-mt-s-1_31_clean :
-	del vc7-stlport\liblink_test-vc7-stlport-mt-s-1_31\*.obj
-	del vc7-stlport\liblink_test-vc7-stlport-mt-s-1_31\*.idb
-	del vc7-stlport\liblink_test-vc7-stlport-mt-s-1_31\*.exp
-	del vc7-stlport\liblink_test-vc7-stlport-mt-s-1_31\*.pch
+liblink_test-vc7-stlport-mt-s-1_34_clean :
+	del vc7-stlport\liblink_test-vc7-stlport-mt-s-1_34\*.obj
+	del vc7-stlport\liblink_test-vc7-stlport-mt-s-1_34\*.idb
+	del vc7-stlport\liblink_test-vc7-stlport-mt-s-1_34\*.exp
+	del vc7-stlport\liblink_test-vc7-stlport-mt-s-1_34\*.pch
 
-./vc7-stlport/liblink_test-vc7-stlport-mt-s-1_31.lib : vc7-stlport/liblink_test-vc7-stlport-mt-s-1_31/link_test.obj
-	link -lib /nologo /out:vc7-stlport/liblink_test-vc7-stlport-mt-s-1_31.lib $(XSFLAGS)  vc7-stlport/liblink_test-vc7-stlport-mt-s-1_31/link_test.obj
+./vc7-stlport/liblink_test-vc7-stlport-mt-s-1_34.lib : vc7-stlport/liblink_test-vc7-stlport-mt-s-1_34/link_test.obj
+	link -lib /nologo /out:vc7-stlport/liblink_test-vc7-stlport-mt-s-1_34.lib $(XSFLAGS)  vc7-stlport/liblink_test-vc7-stlport-mt-s-1_34/link_test.obj
 
-./vc7-stlport/liblink_test-vc7-stlport-mt-s-1_31.exe : main.cpp ./vc7-stlport/liblink_test-vc7-stlport-mt-s-1_31.lib
-	cl $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/liblink_test-vc7-stlport-mt-s-1_31.exe main.cpp /link /LIBPATH:./vc7-stlport
-   vc7-stlport\liblink_test-vc7-stlport-mt-s-1_31.exe
+./vc7-stlport/liblink_test-vc7-stlport-mt-s-1_34.exe : main.cpp ./vc7-stlport/liblink_test-vc7-stlport-mt-s-1_34.lib
+	cl $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/liblink_test-vc7-stlport-mt-s-1_34.exe main.cpp /link /LIBPATH:./vc7-stlport
+   vc7-stlport\liblink_test-vc7-stlport-mt-s-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc7-stlport-mt-sgd-1_31.lib
+# section for liblink_test-vc7-stlport-mt-sgd-1_34.lib
 #
 ########################################################
-vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_31/ -Fdvc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_31.pdb link_test.cpp
+vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_34/ -Fdvc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_34.pdb link_test.cpp
 
-liblink_test-vc7-stlport-mt-sgd-1_31_dir :
-	@if not exist "vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_31\$(NULL)" mkdir vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_31
+liblink_test-vc7-stlport-mt-sgd-1_34_dir :
+	@if not exist "vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_34\$(NULL)" mkdir vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_34
 
-liblink_test-vc7-stlport-mt-sgd-1_31_clean :
-	del vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_31\*.obj
-	del vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_31\*.idb
-	del vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_31\*.exp
-	del vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_31\*.pch
+liblink_test-vc7-stlport-mt-sgd-1_34_clean :
+	del vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_34\*.obj
+	del vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_34\*.idb
+	del vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_34\*.exp
+	del vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_34\*.pch
 
-./vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_31.lib : vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_31/link_test.obj
-	link -lib /nologo /out:vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_31.lib $(XSFLAGS)  vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_31/link_test.obj
+./vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_34.lib : vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_34/link_test.obj
+	link -lib /nologo /out:vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_34.lib $(XSFLAGS)  vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_34/link_test.obj
 
-./vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_31.exe : main.cpp ./vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_31.lib
-	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_31.exe main.cpp /link /LIBPATH:./vc7-stlport
-   vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_31.exe
+./vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_34.exe : main.cpp ./vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_34.lib
+	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/liblink_test-vc7-stlport-mt-sgd-1_34.exe main.cpp /link /LIBPATH:./vc7-stlport
+   vc7-stlport\liblink_test-vc7-stlport-mt-sgd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc7-stlport-mt-gd-1_31.lib
+# section for link_test-vc7-stlport-mt-gd-1_34.lib
 #
 ########################################################
-vc7-stlport/link_test-vc7-stlport-mt-gd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7-stlport/link_test-vc7-stlport-mt-gd-1_31/ -Fdvc7-stlport/link_test-vc7-stlport-mt-gd-1_31.pdb link_test.cpp
+vc7-stlport/link_test-vc7-stlport-mt-gd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7-stlport/link_test-vc7-stlport-mt-gd-1_34/ -Fdvc7-stlport/link_test-vc7-stlport-mt-gd-1_34.pdb link_test.cpp
 
-link_test-vc7-stlport-mt-gd-1_31_dir :
-	@if not exist "vc7-stlport\link_test-vc7-stlport-mt-gd-1_31\$(NULL)" mkdir vc7-stlport\link_test-vc7-stlport-mt-gd-1_31
+link_test-vc7-stlport-mt-gd-1_34_dir :
+	@if not exist "vc7-stlport\link_test-vc7-stlport-mt-gd-1_34\$(NULL)" mkdir vc7-stlport\link_test-vc7-stlport-mt-gd-1_34
 
-link_test-vc7-stlport-mt-gd-1_31_clean :
-	del vc7-stlport\link_test-vc7-stlport-mt-gd-1_31\*.obj
-	del vc7-stlport\link_test-vc7-stlport-mt-gd-1_31\*.idb
-	del vc7-stlport\link_test-vc7-stlport-mt-gd-1_31\*.exp
-	del vc7-stlport\link_test-vc7-stlport-mt-gd-1_31\*.pch
+link_test-vc7-stlport-mt-gd-1_34_clean :
+	del vc7-stlport\link_test-vc7-stlport-mt-gd-1_34\*.obj
+	del vc7-stlport\link_test-vc7-stlport-mt-gd-1_34\*.idb
+	del vc7-stlport\link_test-vc7-stlport-mt-gd-1_34\*.exp
+	del vc7-stlport\link_test-vc7-stlport-mt-gd-1_34\*.pch
 
-./vc7-stlport/link_test-vc7-stlport-mt-gd-1_31.lib : vc7-stlport/link_test-vc7-stlport-mt-gd-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc7-stlport/link_test-vc7-stlport-mt-gd-1_31.pdb" /debug /machine:I386 /out:"vc7-stlport/link_test-vc7-stlport-mt-gd-1_31.dll" /implib:"vc7-stlport/link_test-vc7-stlport-mt-gd-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc7-stlport/link_test-vc7-stlport-mt-gd-1_31/link_test.obj
+./vc7-stlport/link_test-vc7-stlport-mt-gd-1_34.lib : vc7-stlport/link_test-vc7-stlport-mt-gd-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc7-stlport/link_test-vc7-stlport-mt-gd-1_34.pdb" /debug /machine:I386 /out:"vc7-stlport/link_test-vc7-stlport-mt-gd-1_34.dll" /implib:"vc7-stlport/link_test-vc7-stlport-mt-gd-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc7-stlport/link_test-vc7-stlport-mt-gd-1_34/link_test.obj
 
-./vc7-stlport/link_test-vc7-stlport-mt-gd-1_31.exe : main.cpp ./vc7-stlport/link_test-vc7-stlport-mt-gd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/link_test-vc7-stlport-mt-gd-1_31.exe main.cpp /link /LIBPATH:./vc7-stlport
-   vc7-stlport\link_test-vc7-stlport-mt-gd-1_31.exe
+./vc7-stlport/link_test-vc7-stlport-mt-gd-1_34.exe : main.cpp ./vc7-stlport/link_test-vc7-stlport-mt-gd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/link_test-vc7-stlport-mt-gd-1_34.exe main.cpp /link /LIBPATH:./vc7-stlport
+   vc7-stlport\link_test-vc7-stlport-mt-gd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc7-stlport-mt-1_31.lib
+# section for link_test-vc7-stlport-mt-1_34.lib
 #
 ########################################################
-vc7-stlport/link_test-vc7-stlport-mt-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /I$(STLPORT_PATH)\stlport /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  $(CXXFLAGS) -Y- -Fo./vc7-stlport/link_test-vc7-stlport-mt-1_31/ -Fdvc7-stlport/link_test-vc7-stlport-mt-1_31.pdb link_test.cpp
+vc7-stlport/link_test-vc7-stlport-mt-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /I$(STLPORT_PATH)\stlport /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  $(CXXFLAGS) -Y- -Fo./vc7-stlport/link_test-vc7-stlport-mt-1_34/ -Fdvc7-stlport/link_test-vc7-stlport-mt-1_34.pdb link_test.cpp
 
-link_test-vc7-stlport-mt-1_31_dir :
-	@if not exist "vc7-stlport\link_test-vc7-stlport-mt-1_31\$(NULL)" mkdir vc7-stlport\link_test-vc7-stlport-mt-1_31
+link_test-vc7-stlport-mt-1_34_dir :
+	@if not exist "vc7-stlport\link_test-vc7-stlport-mt-1_34\$(NULL)" mkdir vc7-stlport\link_test-vc7-stlport-mt-1_34
 
-link_test-vc7-stlport-mt-1_31_clean :
-	del vc7-stlport\link_test-vc7-stlport-mt-1_31\*.obj
-	del vc7-stlport\link_test-vc7-stlport-mt-1_31\*.idb
-	del vc7-stlport\link_test-vc7-stlport-mt-1_31\*.exp
-	del vc7-stlport\link_test-vc7-stlport-mt-1_31\*.pch
+link_test-vc7-stlport-mt-1_34_clean :
+	del vc7-stlport\link_test-vc7-stlport-mt-1_34\*.obj
+	del vc7-stlport\link_test-vc7-stlport-mt-1_34\*.idb
+	del vc7-stlport\link_test-vc7-stlport-mt-1_34\*.exp
+	del vc7-stlport\link_test-vc7-stlport-mt-1_34\*.pch
 
-./vc7-stlport/link_test-vc7-stlport-mt-1_31.lib : vc7-stlport/link_test-vc7-stlport-mt-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc7-stlport/link_test-vc7-stlport-mt-1_31.pdb" /debug /machine:I386 /out:"vc7-stlport/link_test-vc7-stlport-mt-1_31.dll" /implib:"vc7-stlport/link_test-vc7-stlport-mt-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc7-stlport/link_test-vc7-stlport-mt-1_31/link_test.obj
+./vc7-stlport/link_test-vc7-stlport-mt-1_34.lib : vc7-stlport/link_test-vc7-stlport-mt-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc7-stlport/link_test-vc7-stlport-mt-1_34.pdb" /debug /machine:I386 /out:"vc7-stlport/link_test-vc7-stlport-mt-1_34.dll" /implib:"vc7-stlport/link_test-vc7-stlport-mt-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc7-stlport/link_test-vc7-stlport-mt-1_34/link_test.obj
 
-./vc7-stlport/link_test-vc7-stlport-mt-1_31.exe : main.cpp ./vc7-stlport/link_test-vc7-stlport-mt-1_31.lib
-	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /I$(STLPORT_PATH)\stlport /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/link_test-vc7-stlport-mt-1_31.exe main.cpp /link /LIBPATH:./vc7-stlport
-   vc7-stlport\link_test-vc7-stlport-mt-1_31.exe
+./vc7-stlport/link_test-vc7-stlport-mt-1_34.exe : main.cpp ./vc7-stlport/link_test-vc7-stlport-mt-1_34.lib
+	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /I$(STLPORT_PATH)\stlport /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/link_test-vc7-stlport-mt-1_34.exe main.cpp /link /LIBPATH:./vc7-stlport
+   vc7-stlport\link_test-vc7-stlport-mt-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc7-stlport-mt-1_31.lib
+# section for liblink_test-vc7-stlport-mt-1_34.lib
 #
 ########################################################
-vc7-stlport/liblink_test-vc7-stlport-mt-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  $(CXXFLAGS) -Y- -Fo./vc7-stlport/liblink_test-vc7-stlport-mt-1_31/ -Fdvc7-stlport/liblink_test-vc7-stlport-mt-1_31.pdb link_test.cpp
+vc7-stlport/liblink_test-vc7-stlport-mt-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  $(CXXFLAGS) -Y- -Fo./vc7-stlport/liblink_test-vc7-stlport-mt-1_34/ -Fdvc7-stlport/liblink_test-vc7-stlport-mt-1_34.pdb link_test.cpp
 
-liblink_test-vc7-stlport-mt-1_31_dir :
-	@if not exist "vc7-stlport\liblink_test-vc7-stlport-mt-1_31\$(NULL)" mkdir vc7-stlport\liblink_test-vc7-stlport-mt-1_31
+liblink_test-vc7-stlport-mt-1_34_dir :
+	@if not exist "vc7-stlport\liblink_test-vc7-stlport-mt-1_34\$(NULL)" mkdir vc7-stlport\liblink_test-vc7-stlport-mt-1_34
 
-liblink_test-vc7-stlport-mt-1_31_clean :
-	del vc7-stlport\liblink_test-vc7-stlport-mt-1_31\*.obj
-	del vc7-stlport\liblink_test-vc7-stlport-mt-1_31\*.idb
-	del vc7-stlport\liblink_test-vc7-stlport-mt-1_31\*.exp
-	del vc7-stlport\liblink_test-vc7-stlport-mt-1_31\*.pch
+liblink_test-vc7-stlport-mt-1_34_clean :
+	del vc7-stlport\liblink_test-vc7-stlport-mt-1_34\*.obj
+	del vc7-stlport\liblink_test-vc7-stlport-mt-1_34\*.idb
+	del vc7-stlport\liblink_test-vc7-stlport-mt-1_34\*.exp
+	del vc7-stlport\liblink_test-vc7-stlport-mt-1_34\*.pch
 
-./vc7-stlport/liblink_test-vc7-stlport-mt-1_31.lib : vc7-stlport/liblink_test-vc7-stlport-mt-1_31/link_test.obj
-	link -lib /nologo /out:vc7-stlport/liblink_test-vc7-stlport-mt-1_31.lib $(XSFLAGS)  vc7-stlport/liblink_test-vc7-stlport-mt-1_31/link_test.obj
+./vc7-stlport/liblink_test-vc7-stlport-mt-1_34.lib : vc7-stlport/liblink_test-vc7-stlport-mt-1_34/link_test.obj
+	link -lib /nologo /out:vc7-stlport/liblink_test-vc7-stlport-mt-1_34.lib $(XSFLAGS)  vc7-stlport/liblink_test-vc7-stlport-mt-1_34/link_test.obj
 
-./vc7-stlport/liblink_test-vc7-stlport-mt-1_31.exe : main.cpp ./vc7-stlport/liblink_test-vc7-stlport-mt-1_31.lib
-	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/liblink_test-vc7-stlport-mt-1_31.exe main.cpp /link /LIBPATH:./vc7-stlport
-   vc7-stlport\liblink_test-vc7-stlport-mt-1_31.exe
+./vc7-stlport/liblink_test-vc7-stlport-mt-1_34.exe : main.cpp ./vc7-stlport/liblink_test-vc7-stlport-mt-1_34.lib
+	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/liblink_test-vc7-stlport-mt-1_34.exe main.cpp /link /LIBPATH:./vc7-stlport
+   vc7-stlport\liblink_test-vc7-stlport-mt-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc7-stlport-mt-gd-1_31.lib
+# section for liblink_test-vc7-stlport-mt-gd-1_34.lib
 #
 ########################################################
-vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_31/ -Fdvc7-stlport/liblink_test-vc7-stlport-mt-gd-1_31.pdb link_test.cpp
+vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_34/ -Fdvc7-stlport/liblink_test-vc7-stlport-mt-gd-1_34.pdb link_test.cpp
 
-liblink_test-vc7-stlport-mt-gd-1_31_dir :
-	@if not exist "vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_31\$(NULL)" mkdir vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_31
+liblink_test-vc7-stlport-mt-gd-1_34_dir :
+	@if not exist "vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_34\$(NULL)" mkdir vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_34
 
-liblink_test-vc7-stlport-mt-gd-1_31_clean :
-	del vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_31\*.obj
-	del vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_31\*.idb
-	del vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_31\*.exp
-	del vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_31\*.pch
+liblink_test-vc7-stlport-mt-gd-1_34_clean :
+	del vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_34\*.obj
+	del vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_34\*.idb
+	del vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_34\*.exp
+	del vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_34\*.pch
 
-./vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_31.lib : vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_31/link_test.obj
-	link -lib /nologo /out:vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_31.lib $(XSFLAGS)  vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_31/link_test.obj
+./vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_34.lib : vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_34/link_test.obj
+	link -lib /nologo /out:vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_34.lib $(XSFLAGS)  vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_34/link_test.obj
 
-./vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_31.exe : main.cpp ./vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_31.exe main.cpp /link /LIBPATH:./vc7-stlport
-   vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_31.exe
+./vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_34.exe : main.cpp ./vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/liblink_test-vc7-stlport-mt-gd-1_34.exe main.cpp /link /LIBPATH:./vc7-stlport
+   vc7-stlport\liblink_test-vc7-stlport-mt-gd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc7-stlport-mt-pgd-1_31.lib
+# section for link_test-vc7-stlport-mt-pgd-1_34.lib
 #
 ########################################################
-vc7-stlport/link_test-vc7-stlport-mt-pgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7-stlport/link_test-vc7-stlport-mt-pgd-1_31/ -Fdvc7-stlport/link_test-vc7-stlport-mt-pgd-1_31.pdb link_test.cpp
+vc7-stlport/link_test-vc7-stlport-mt-pgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7-stlport/link_test-vc7-stlport-mt-pgd-1_34/ -Fdvc7-stlport/link_test-vc7-stlport-mt-pgd-1_34.pdb link_test.cpp
 
-link_test-vc7-stlport-mt-pgd-1_31_dir :
-	@if not exist "vc7-stlport\link_test-vc7-stlport-mt-pgd-1_31\$(NULL)" mkdir vc7-stlport\link_test-vc7-stlport-mt-pgd-1_31
+link_test-vc7-stlport-mt-pgd-1_34_dir :
+	@if not exist "vc7-stlport\link_test-vc7-stlport-mt-pgd-1_34\$(NULL)" mkdir vc7-stlport\link_test-vc7-stlport-mt-pgd-1_34
 
-link_test-vc7-stlport-mt-pgd-1_31_clean :
-	del vc7-stlport\link_test-vc7-stlport-mt-pgd-1_31\*.obj
-	del vc7-stlport\link_test-vc7-stlport-mt-pgd-1_31\*.idb
-	del vc7-stlport\link_test-vc7-stlport-mt-pgd-1_31\*.exp
-	del vc7-stlport\link_test-vc7-stlport-mt-pgd-1_31\*.pch
+link_test-vc7-stlport-mt-pgd-1_34_clean :
+	del vc7-stlport\link_test-vc7-stlport-mt-pgd-1_34\*.obj
+	del vc7-stlport\link_test-vc7-stlport-mt-pgd-1_34\*.idb
+	del vc7-stlport\link_test-vc7-stlport-mt-pgd-1_34\*.exp
+	del vc7-stlport\link_test-vc7-stlport-mt-pgd-1_34\*.pch
 
-./vc7-stlport/link_test-vc7-stlport-mt-pgd-1_31.lib : vc7-stlport/link_test-vc7-stlport-mt-pgd-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc7-stlport/link_test-vc7-stlport-mt-pgd-1_31.pdb" /debug /machine:I386 /out:"vc7-stlport/link_test-vc7-stlport-mt-pgd-1_31.dll" /implib:"vc7-stlport/link_test-vc7-stlport-mt-pgd-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc7-stlport/link_test-vc7-stlport-mt-pgd-1_31/link_test.obj
+./vc7-stlport/link_test-vc7-stlport-mt-pgd-1_34.lib : vc7-stlport/link_test-vc7-stlport-mt-pgd-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc7-stlport/link_test-vc7-stlport-mt-pgd-1_34.pdb" /debug /machine:I386 /out:"vc7-stlport/link_test-vc7-stlport-mt-pgd-1_34.dll" /implib:"vc7-stlport/link_test-vc7-stlport-mt-pgd-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc7-stlport/link_test-vc7-stlport-mt-pgd-1_34/link_test.obj
 
-./vc7-stlport/link_test-vc7-stlport-mt-pgd-1_31.exe : main.cpp ./vc7-stlport/link_test-vc7-stlport-mt-pgd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/link_test-vc7-stlport-mt-pgd-1_31.exe main.cpp /link /LIBPATH:./vc7-stlport
-   vc7-stlport\link_test-vc7-stlport-mt-pgd-1_31.exe
+./vc7-stlport/link_test-vc7-stlport-mt-pgd-1_34.exe : main.cpp ./vc7-stlport/link_test-vc7-stlport-mt-pgd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/link_test-vc7-stlport-mt-pgd-1_34.exe main.cpp /link /LIBPATH:./vc7-stlport
+   vc7-stlport\link_test-vc7-stlport-mt-pgd-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc7-stlport-mt-spgd-1_31.lib
+# section for liblink_test-vc7-stlport-mt-spgd-1_34.lib
 #
 ########################################################
-vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D__STL_DEBUG /D_STLP_DEBUG /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_31/ -Fdvc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_31.pdb link_test.cpp
+vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D__STL_DEBUG /D_STLP_DEBUG /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_34/ -Fdvc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_34.pdb link_test.cpp
 
-liblink_test-vc7-stlport-mt-spgd-1_31_dir :
-	@if not exist "vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_31\$(NULL)" mkdir vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_31
+liblink_test-vc7-stlport-mt-spgd-1_34_dir :
+	@if not exist "vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_34\$(NULL)" mkdir vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_34
 
-liblink_test-vc7-stlport-mt-spgd-1_31_clean :
-	del vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_31\*.obj
-	del vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_31\*.idb
-	del vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_31\*.exp
-	del vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_31\*.pch
+liblink_test-vc7-stlport-mt-spgd-1_34_clean :
+	del vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_34\*.obj
+	del vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_34\*.idb
+	del vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_34\*.exp
+	del vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_34\*.pch
 
-./vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_31.lib : vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_31/link_test.obj
-	link -lib /nologo /out:vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_31.lib $(XSFLAGS)  vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_31/link_test.obj
+./vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_34.lib : vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_34/link_test.obj
+	link -lib /nologo /out:vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_34.lib $(XSFLAGS)  vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_34/link_test.obj
 
-./vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_31.exe : main.cpp ./vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_31.lib
-	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D__STL_DEBUG /D_STLP_DEBUG /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_31.exe main.cpp /link /LIBPATH:./vc7-stlport
-   vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_31.exe
+./vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_34.exe : main.cpp ./vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_34.lib
+	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D__STL_DEBUG /D_STLP_DEBUG /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/liblink_test-vc7-stlport-mt-spgd-1_34.exe main.cpp /link /LIBPATH:./vc7-stlport
+   vc7-stlport\liblink_test-vc7-stlport-mt-spgd-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc7-stlport-mt-pgd-1_31.lib
+# section for liblink_test-vc7-stlport-mt-pgd-1_34.lib
 #
 ########################################################
-vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_31/ -Fdvc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_31.pdb link_test.cpp
+vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_34/ -Fdvc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_34.pdb link_test.cpp
 
-liblink_test-vc7-stlport-mt-pgd-1_31_dir :
-	@if not exist "vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_31\$(NULL)" mkdir vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_31
+liblink_test-vc7-stlport-mt-pgd-1_34_dir :
+	@if not exist "vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_34\$(NULL)" mkdir vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_34
 
-liblink_test-vc7-stlport-mt-pgd-1_31_clean :
-	del vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_31\*.obj
-	del vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_31\*.idb
-	del vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_31\*.exp
-	del vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_31\*.pch
+liblink_test-vc7-stlport-mt-pgd-1_34_clean :
+	del vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_34\*.obj
+	del vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_34\*.idb
+	del vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_34\*.exp
+	del vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_34\*.pch
 
-./vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_31.lib : vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_31/link_test.obj
-	link -lib /nologo /out:vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_31.lib $(XSFLAGS)  vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_31/link_test.obj
+./vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_34.lib : vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_34/link_test.obj
+	link -lib /nologo /out:vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_34.lib $(XSFLAGS)  vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_34/link_test.obj
 
-./vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_31.exe : main.cpp ./vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_31.exe main.cpp /link /LIBPATH:./vc7-stlport
-   vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_31.exe
+./vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_34.exe : main.cpp ./vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7-stlport/liblink_test-vc7-stlport-mt-pgd-1_34.exe main.cpp /link /LIBPATH:./vc7-stlport
+   vc7-stlport\liblink_test-vc7-stlport-mt-pgd-1_34.exe
 

Modified: boost/trunk/libs/config/test/link/vc7.mak
===================================================================
--- boost/trunk/libs/config/test/link/vc7.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/link/vc7.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2005
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # auto generated makefile for VC6 compiler
 #
@@ -38,25 +42,25 @@
 
 ALL_HEADER=
 
-all : main_dir liblink_test-vc7-s-1_31_dir ./vc7/liblink_test-vc7-s-1_31.lib ./vc7/liblink_test-vc7-s-1_31.exe liblink_test-vc7-mt-s-1_31_dir ./vc7/liblink_test-vc7-mt-s-1_31.lib ./vc7/liblink_test-vc7-mt-s-1_31.exe liblink_test-vc7-sgd-1_31_dir ./vc7/liblink_test-vc7-sgd-1_31.lib ./vc7/liblink_test-vc7-sgd-1_31.exe liblink_test-vc7-mt-sgd-1_31_dir ./vc7/liblink_test-vc7-mt-sgd-1_31.lib ./vc7/liblink_test-vc7-mt-sgd-1_31.exe link_test-vc7-mt-gd-1_31_dir ./vc7/link_test-vc7-mt-gd-1_31.lib ./vc7/link_test-vc7-mt-gd-1_31.exe link_test-vc7-mt-1_31_dir ./vc7/link_test-vc7-mt-1_31.lib ./vc7/link_test-vc7-mt-1_31.exe liblink_test-vc7-mt-1_31_dir ./vc7/liblink_test-vc7-mt-1_31.lib ./vc7/liblink_test-vc7-mt-1_31.exe liblink_test-vc7-mt-gd-1_31_dir ./vc7/liblink_test-vc7-mt-gd-1_31.lib ./vc7/liblink_test-vc7-mt-gd-1_31.exe
+all : main_dir liblink_test-vc7-s-1_34_dir ./vc7/liblink_test-vc7-s-1_34.lib ./vc7/liblink_test-vc7-s-1_34.exe liblink_test-vc7-mt-s-1_34_dir ./vc7/liblink_test-vc7-mt-s-1_34.lib ./vc7/liblink_test-vc7-mt-s-1_34.exe liblink_test-vc7-sgd-1_34_dir ./vc7/liblink_test-vc7-sgd-1_34.lib ./vc7/liblink_test-vc7-sgd-1_34.exe liblink_test-vc7-mt-sgd-1_34_dir ./vc7/liblink_test-vc7-mt-sgd-1_34.lib ./vc7/liblink_test-vc7-mt-sgd-1_34.exe link_test-vc7-mt-gd-1_34_dir ./vc7/link_test-vc7-mt-gd-1_34.lib ./vc7/link_test-vc7-mt-gd-1_34.exe link_test-vc7-mt-1_34_dir ./vc7/link_test-vc7-mt-1_34.lib ./vc7/link_test-vc7-mt-1_34.exe liblink_test-vc7-mt-1_34_dir ./vc7/liblink_test-vc7-mt-1_34.lib ./vc7/liblink_test-vc7-mt-1_34.exe liblink_test-vc7-mt-gd-1_34_dir ./vc7/liblink_test-vc7-mt-gd-1_34.lib ./vc7/liblink_test-vc7-mt-gd-1_34.exe
 
-clean :  liblink_test-vc7-s-1_31_clean liblink_test-vc7-mt-s-1_31_clean liblink_test-vc7-sgd-1_31_clean liblink_test-vc7-mt-sgd-1_31_clean link_test-vc7-mt-gd-1_31_clean link_test-vc7-mt-1_31_clean liblink_test-vc7-mt-1_31_clean liblink_test-vc7-mt-gd-1_31_clean
+clean :  liblink_test-vc7-s-1_34_clean liblink_test-vc7-mt-s-1_34_clean liblink_test-vc7-sgd-1_34_clean liblink_test-vc7-mt-sgd-1_34_clean link_test-vc7-mt-gd-1_34_clean link_test-vc7-mt-1_34_clean liblink_test-vc7-mt-1_34_clean liblink_test-vc7-mt-gd-1_34_clean
 
 install : all
-	copy vc7\liblink_test-vc7-s-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7\liblink_test-vc7-mt-s-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7\liblink_test-vc7-sgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7\liblink_test-vc7-sgd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc7\liblink_test-vc7-mt-sgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7\liblink_test-vc7-mt-sgd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc7\link_test-vc7-mt-gd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7\link_test-vc7-mt-gd-1_31.dll "$(MSVCDIR)\bin"
-	copy vc7\link_test-vc7-mt-gd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc7\link_test-vc7-mt-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7\link_test-vc7-mt-1_31.dll "$(MSVCDIR)\bin"
-	copy vc7\liblink_test-vc7-mt-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7\liblink_test-vc7-mt-gd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc7\liblink_test-vc7-mt-gd-1_31.pdb "$(MSVCDIR)\lib"
+	copy vc7\liblink_test-vc7-s-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7\liblink_test-vc7-mt-s-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7\liblink_test-vc7-sgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7\liblink_test-vc7-sgd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc7\liblink_test-vc7-mt-sgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7\liblink_test-vc7-mt-sgd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc7\link_test-vc7-mt-gd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7\link_test-vc7-mt-gd-1_34.dll "$(MSVCDIR)\bin"
+	copy vc7\link_test-vc7-mt-gd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc7\link_test-vc7-mt-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7\link_test-vc7-mt-1_34.dll "$(MSVCDIR)\bin"
+	copy vc7\liblink_test-vc7-mt-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7\liblink_test-vc7-mt-gd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc7\liblink_test-vc7-mt-gd-1_34.pdb "$(MSVCDIR)\lib"
 
 main_dir :
 	@if not exist "vc7\$(NULL)" mkdir vc7
@@ -64,193 +68,193 @@
 
 ########################################################
 #
-# section for liblink_test-vc7-s-1_31.lib
+# section for liblink_test-vc7-s-1_34.lib
 #
 ########################################################
-vc7/liblink_test-vc7-s-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /ML /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD $(CXXFLAGS) -Y- -Fo./vc7/liblink_test-vc7-s-1_31/ -Fdvc7/liblink_test-vc7-s-1_31.pdb link_test.cpp
+vc7/liblink_test-vc7-s-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /ML /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD $(CXXFLAGS) -Y- -Fo./vc7/liblink_test-vc7-s-1_34/ -Fdvc7/liblink_test-vc7-s-1_34.pdb link_test.cpp
 
-liblink_test-vc7-s-1_31_dir :
-	@if not exist "vc7\liblink_test-vc7-s-1_31\$(NULL)" mkdir vc7\liblink_test-vc7-s-1_31
+liblink_test-vc7-s-1_34_dir :
+	@if not exist "vc7\liblink_test-vc7-s-1_34\$(NULL)" mkdir vc7\liblink_test-vc7-s-1_34
 
-liblink_test-vc7-s-1_31_clean :
-	del vc7\liblink_test-vc7-s-1_31\*.obj
-	del vc7\liblink_test-vc7-s-1_31\*.idb
-	del vc7\liblink_test-vc7-s-1_31\*.exp
-	del vc7\liblink_test-vc7-s-1_31\*.pch
+liblink_test-vc7-s-1_34_clean :
+	del vc7\liblink_test-vc7-s-1_34\*.obj
+	del vc7\liblink_test-vc7-s-1_34\*.idb
+	del vc7\liblink_test-vc7-s-1_34\*.exp
+	del vc7\liblink_test-vc7-s-1_34\*.pch
 
-./vc7/liblink_test-vc7-s-1_31.lib : vc7/liblink_test-vc7-s-1_31/link_test.obj
-	link -lib /nologo /out:vc7/liblink_test-vc7-s-1_31.lib $(XSFLAGS)  vc7/liblink_test-vc7-s-1_31/link_test.obj
+./vc7/liblink_test-vc7-s-1_34.lib : vc7/liblink_test-vc7-s-1_34/link_test.obj
+	link -lib /nologo /out:vc7/liblink_test-vc7-s-1_34.lib $(XSFLAGS)  vc7/liblink_test-vc7-s-1_34/link_test.obj
 
-./vc7/liblink_test-vc7-s-1_31.exe : main.cpp ./vc7/liblink_test-vc7-s-1_31.lib
-	cl $(INCLUDES) /nologo /ML /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/liblink_test-vc7-s-1_31.exe main.cpp /link /LIBPATH:./vc7
-   vc7\liblink_test-vc7-s-1_31.exe
+./vc7/liblink_test-vc7-s-1_34.exe : main.cpp ./vc7/liblink_test-vc7-s-1_34.lib
+	cl $(INCLUDES) /nologo /ML /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/liblink_test-vc7-s-1_34.exe main.cpp /link /LIBPATH:./vc7
+   vc7\liblink_test-vc7-s-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc7-mt-s-1_31.lib
+# section for liblink_test-vc7-mt-s-1_34.lib
 #
 ########################################################
-vc7/liblink_test-vc7-mt-s-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD  $(CXXFLAGS) -Y- -Fo./vc7/liblink_test-vc7-mt-s-1_31/ -Fdvc7/liblink_test-vc7-mt-s-1_31.pdb link_test.cpp
+vc7/liblink_test-vc7-mt-s-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD  $(CXXFLAGS) -Y- -Fo./vc7/liblink_test-vc7-mt-s-1_34/ -Fdvc7/liblink_test-vc7-mt-s-1_34.pdb link_test.cpp
 
-liblink_test-vc7-mt-s-1_31_dir :
-	@if not exist "vc7\liblink_test-vc7-mt-s-1_31\$(NULL)" mkdir vc7\liblink_test-vc7-mt-s-1_31
+liblink_test-vc7-mt-s-1_34_dir :
+	@if not exist "vc7\liblink_test-vc7-mt-s-1_34\$(NULL)" mkdir vc7\liblink_test-vc7-mt-s-1_34
 
-liblink_test-vc7-mt-s-1_31_clean :
-	del vc7\liblink_test-vc7-mt-s-1_31\*.obj
-	del vc7\liblink_test-vc7-mt-s-1_31\*.idb
-	del vc7\liblink_test-vc7-mt-s-1_31\*.exp
-	del vc7\liblink_test-vc7-mt-s-1_31\*.pch
+liblink_test-vc7-mt-s-1_34_clean :
+	del vc7\liblink_test-vc7-mt-s-1_34\*.obj
+	del vc7\liblink_test-vc7-mt-s-1_34\*.idb
+	del vc7\liblink_test-vc7-mt-s-1_34\*.exp
+	del vc7\liblink_test-vc7-mt-s-1_34\*.pch
 
-./vc7/liblink_test-vc7-mt-s-1_31.lib : vc7/liblink_test-vc7-mt-s-1_31/link_test.obj
-	link -lib /nologo /out:vc7/liblink_test-vc7-mt-s-1_31.lib $(XSFLAGS)  vc7/liblink_test-vc7-mt-s-1_31/link_test.obj
+./vc7/liblink_test-vc7-mt-s-1_34.lib : vc7/liblink_test-vc7-mt-s-1_34/link_test.obj
+	link -lib /nologo /out:vc7/liblink_test-vc7-mt-s-1_34.lib $(XSFLAGS)  vc7/liblink_test-vc7-mt-s-1_34/link_test.obj
 
-./vc7/liblink_test-vc7-mt-s-1_31.exe : main.cpp ./vc7/liblink_test-vc7-mt-s-1_31.lib
-	cl $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/liblink_test-vc7-mt-s-1_31.exe main.cpp /link /LIBPATH:./vc7
-   vc7\liblink_test-vc7-mt-s-1_31.exe
+./vc7/liblink_test-vc7-mt-s-1_34.exe : main.cpp ./vc7/liblink_test-vc7-mt-s-1_34.lib
+	cl $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/liblink_test-vc7-mt-s-1_34.exe main.cpp /link /LIBPATH:./vc7
+   vc7\liblink_test-vc7-mt-s-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc7-sgd-1_31.lib
+# section for liblink_test-vc7-sgd-1_34.lib
 #
 ########################################################
-vc7/liblink_test-vc7-sgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MLd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1   $(CXXFLAGS) -Y- -Fo./vc7/liblink_test-vc7-sgd-1_31/ -Fdvc7/liblink_test-vc7-sgd-1_31.pdb link_test.cpp
+vc7/liblink_test-vc7-sgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MLd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1   $(CXXFLAGS) -Y- -Fo./vc7/liblink_test-vc7-sgd-1_34/ -Fdvc7/liblink_test-vc7-sgd-1_34.pdb link_test.cpp
 
-liblink_test-vc7-sgd-1_31_dir :
-	@if not exist "vc7\liblink_test-vc7-sgd-1_31\$(NULL)" mkdir vc7\liblink_test-vc7-sgd-1_31
+liblink_test-vc7-sgd-1_34_dir :
+	@if not exist "vc7\liblink_test-vc7-sgd-1_34\$(NULL)" mkdir vc7\liblink_test-vc7-sgd-1_34
 
-liblink_test-vc7-sgd-1_31_clean :
-	del vc7\liblink_test-vc7-sgd-1_31\*.obj
-	del vc7\liblink_test-vc7-sgd-1_31\*.idb
-	del vc7\liblink_test-vc7-sgd-1_31\*.exp
-	del vc7\liblink_test-vc7-sgd-1_31\*.pch
+liblink_test-vc7-sgd-1_34_clean :
+	del vc7\liblink_test-vc7-sgd-1_34\*.obj
+	del vc7\liblink_test-vc7-sgd-1_34\*.idb
+	del vc7\liblink_test-vc7-sgd-1_34\*.exp
+	del vc7\liblink_test-vc7-sgd-1_34\*.pch
 
-./vc7/liblink_test-vc7-sgd-1_31.lib : vc7/liblink_test-vc7-sgd-1_31/link_test.obj
-	link -lib /nologo /out:vc7/liblink_test-vc7-sgd-1_31.lib $(XSFLAGS)  vc7/liblink_test-vc7-sgd-1_31/link_test.obj
+./vc7/liblink_test-vc7-sgd-1_34.lib : vc7/liblink_test-vc7-sgd-1_34/link_test.obj
+	link -lib /nologo /out:vc7/liblink_test-vc7-sgd-1_34.lib $(XSFLAGS)  vc7/liblink_test-vc7-sgd-1_34/link_test.obj
 
-./vc7/liblink_test-vc7-sgd-1_31.exe : main.cpp ./vc7/liblink_test-vc7-sgd-1_31.lib
-	cl $(INCLUDES) /nologo /MLd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1   /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/liblink_test-vc7-sgd-1_31.exe main.cpp /link /LIBPATH:./vc7
-   vc7\liblink_test-vc7-sgd-1_31.exe
+./vc7/liblink_test-vc7-sgd-1_34.exe : main.cpp ./vc7/liblink_test-vc7-sgd-1_34.lib
+	cl $(INCLUDES) /nologo /MLd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1   /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/liblink_test-vc7-sgd-1_34.exe main.cpp /link /LIBPATH:./vc7
+   vc7\liblink_test-vc7-sgd-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc7-mt-sgd-1_31.lib
+# section for liblink_test-vc7-mt-sgd-1_34.lib
 #
 ########################################################
-vc7/liblink_test-vc7-mt-sgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7/liblink_test-vc7-mt-sgd-1_31/ -Fdvc7/liblink_test-vc7-mt-sgd-1_31.pdb link_test.cpp
+vc7/liblink_test-vc7-mt-sgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7/liblink_test-vc7-mt-sgd-1_34/ -Fdvc7/liblink_test-vc7-mt-sgd-1_34.pdb link_test.cpp
 
-liblink_test-vc7-mt-sgd-1_31_dir :
-	@if not exist "vc7\liblink_test-vc7-mt-sgd-1_31\$(NULL)" mkdir vc7\liblink_test-vc7-mt-sgd-1_31
+liblink_test-vc7-mt-sgd-1_34_dir :
+	@if not exist "vc7\liblink_test-vc7-mt-sgd-1_34\$(NULL)" mkdir vc7\liblink_test-vc7-mt-sgd-1_34
 
-liblink_test-vc7-mt-sgd-1_31_clean :
-	del vc7\liblink_test-vc7-mt-sgd-1_31\*.obj
-	del vc7\liblink_test-vc7-mt-sgd-1_31\*.idb
-	del vc7\liblink_test-vc7-mt-sgd-1_31\*.exp
-	del vc7\liblink_test-vc7-mt-sgd-1_31\*.pch
+liblink_test-vc7-mt-sgd-1_34_clean :
+	del vc7\liblink_test-vc7-mt-sgd-1_34\*.obj
+	del vc7\liblink_test-vc7-mt-sgd-1_34\*.idb
+	del vc7\liblink_test-vc7-mt-sgd-1_34\*.exp
+	del vc7\liblink_test-vc7-mt-sgd-1_34\*.pch
 
-./vc7/liblink_test-vc7-mt-sgd-1_31.lib : vc7/liblink_test-vc7-mt-sgd-1_31/link_test.obj
-	link -lib /nologo /out:vc7/liblink_test-vc7-mt-sgd-1_31.lib $(XSFLAGS)  vc7/liblink_test-vc7-mt-sgd-1_31/link_test.obj
+./vc7/liblink_test-vc7-mt-sgd-1_34.lib : vc7/liblink_test-vc7-mt-sgd-1_34/link_test.obj
+	link -lib /nologo /out:vc7/liblink_test-vc7-mt-sgd-1_34.lib $(XSFLAGS)  vc7/liblink_test-vc7-mt-sgd-1_34/link_test.obj
 
-./vc7/liblink_test-vc7-mt-sgd-1_31.exe : main.cpp ./vc7/liblink_test-vc7-mt-sgd-1_31.lib
-	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/liblink_test-vc7-mt-sgd-1_31.exe main.cpp /link /LIBPATH:./vc7
-   vc7\liblink_test-vc7-mt-sgd-1_31.exe
+./vc7/liblink_test-vc7-mt-sgd-1_34.exe : main.cpp ./vc7/liblink_test-vc7-mt-sgd-1_34.lib
+	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/liblink_test-vc7-mt-sgd-1_34.exe main.cpp /link /LIBPATH:./vc7
+   vc7\liblink_test-vc7-mt-sgd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc7-mt-gd-1_31.lib
+# section for link_test-vc7-mt-gd-1_34.lib
 #
 ########################################################
-vc7/link_test-vc7-mt-gd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /D_DEBUG /DBOOST_DYN_LINK /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7/link_test-vc7-mt-gd-1_31/ -Fdvc7/link_test-vc7-mt-gd-1_31.pdb link_test.cpp
+vc7/link_test-vc7-mt-gd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /D_DEBUG /DBOOST_DYN_LINK /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7/link_test-vc7-mt-gd-1_34/ -Fdvc7/link_test-vc7-mt-gd-1_34.pdb link_test.cpp
 
-link_test-vc7-mt-gd-1_31_dir :
-	@if not exist "vc7\link_test-vc7-mt-gd-1_31\$(NULL)" mkdir vc7\link_test-vc7-mt-gd-1_31
+link_test-vc7-mt-gd-1_34_dir :
+	@if not exist "vc7\link_test-vc7-mt-gd-1_34\$(NULL)" mkdir vc7\link_test-vc7-mt-gd-1_34
 
-link_test-vc7-mt-gd-1_31_clean :
-	del vc7\link_test-vc7-mt-gd-1_31\*.obj
-	del vc7\link_test-vc7-mt-gd-1_31\*.idb
-	del vc7\link_test-vc7-mt-gd-1_31\*.exp
-	del vc7\link_test-vc7-mt-gd-1_31\*.pch
+link_test-vc7-mt-gd-1_34_clean :
+	del vc7\link_test-vc7-mt-gd-1_34\*.obj
+	del vc7\link_test-vc7-mt-gd-1_34\*.idb
+	del vc7\link_test-vc7-mt-gd-1_34\*.exp
+	del vc7\link_test-vc7-mt-gd-1_34\*.pch
 
-./vc7/link_test-vc7-mt-gd-1_31.lib : vc7/link_test-vc7-mt-gd-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc7/link_test-vc7-mt-gd-1_31.pdb" /debug /machine:I386 /out:"vc7/link_test-vc7-mt-gd-1_31.dll" /implib:"vc7/link_test-vc7-mt-gd-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc7/link_test-vc7-mt-gd-1_31/link_test.obj
+./vc7/link_test-vc7-mt-gd-1_34.lib : vc7/link_test-vc7-mt-gd-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc7/link_test-vc7-mt-gd-1_34.pdb" /debug /machine:I386 /out:"vc7/link_test-vc7-mt-gd-1_34.dll" /implib:"vc7/link_test-vc7-mt-gd-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc7/link_test-vc7-mt-gd-1_34/link_test.obj
 
-./vc7/link_test-vc7-mt-gd-1_31.exe : main.cpp ./vc7/link_test-vc7-mt-gd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /D_DEBUG /DBOOST_DYN_LINK /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/link_test-vc7-mt-gd-1_31.exe main.cpp /link /LIBPATH:./vc7
-   vc7\link_test-vc7-mt-gd-1_31.exe
+./vc7/link_test-vc7-mt-gd-1_34.exe : main.cpp ./vc7/link_test-vc7-mt-gd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /D_DEBUG /DBOOST_DYN_LINK /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/link_test-vc7-mt-gd-1_34.exe main.cpp /link /LIBPATH:./vc7
+   vc7\link_test-vc7-mt-gd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc7-mt-1_31.lib
+# section for link_test-vc7-mt-1_34.lib
 #
 ########################################################
-vc7/link_test-vc7-mt-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  $(CXXFLAGS) -Y- -Fo./vc7/link_test-vc7-mt-1_31/ -Fdvc7/link_test-vc7-mt-1_31.pdb link_test.cpp
+vc7/link_test-vc7-mt-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  $(CXXFLAGS) -Y- -Fo./vc7/link_test-vc7-mt-1_34/ -Fdvc7/link_test-vc7-mt-1_34.pdb link_test.cpp
 
-link_test-vc7-mt-1_31_dir :
-	@if not exist "vc7\link_test-vc7-mt-1_31\$(NULL)" mkdir vc7\link_test-vc7-mt-1_31
+link_test-vc7-mt-1_34_dir :
+	@if not exist "vc7\link_test-vc7-mt-1_34\$(NULL)" mkdir vc7\link_test-vc7-mt-1_34
 
-link_test-vc7-mt-1_31_clean :
-	del vc7\link_test-vc7-mt-1_31\*.obj
-	del vc7\link_test-vc7-mt-1_31\*.idb
-	del vc7\link_test-vc7-mt-1_31\*.exp
-	del vc7\link_test-vc7-mt-1_31\*.pch
+link_test-vc7-mt-1_34_clean :
+	del vc7\link_test-vc7-mt-1_34\*.obj
+	del vc7\link_test-vc7-mt-1_34\*.idb
+	del vc7\link_test-vc7-mt-1_34\*.exp
+	del vc7\link_test-vc7-mt-1_34\*.pch
 
-./vc7/link_test-vc7-mt-1_31.lib : vc7/link_test-vc7-mt-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc7/link_test-vc7-mt-1_31.pdb" /debug /machine:I386 /out:"vc7/link_test-vc7-mt-1_31.dll" /implib:"vc7/link_test-vc7-mt-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc7/link_test-vc7-mt-1_31/link_test.obj
+./vc7/link_test-vc7-mt-1_34.lib : vc7/link_test-vc7-mt-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc7/link_test-vc7-mt-1_34.pdb" /debug /machine:I386 /out:"vc7/link_test-vc7-mt-1_34.dll" /implib:"vc7/link_test-vc7-mt-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc7/link_test-vc7-mt-1_34/link_test.obj
 
-./vc7/link_test-vc7-mt-1_31.exe : main.cpp ./vc7/link_test-vc7-mt-1_31.lib
-	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/link_test-vc7-mt-1_31.exe main.cpp /link /LIBPATH:./vc7
-   vc7\link_test-vc7-mt-1_31.exe
+./vc7/link_test-vc7-mt-1_34.exe : main.cpp ./vc7/link_test-vc7-mt-1_34.lib
+	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/link_test-vc7-mt-1_34.exe main.cpp /link /LIBPATH:./vc7
+   vc7\link_test-vc7-mt-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc7-mt-1_31.lib
+# section for liblink_test-vc7-mt-1_34.lib
 #
 ########################################################
-vc7/liblink_test-vc7-mt-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  $(CXXFLAGS) -Y- -Fo./vc7/liblink_test-vc7-mt-1_31/ -Fdvc7/liblink_test-vc7-mt-1_31.pdb link_test.cpp
+vc7/liblink_test-vc7-mt-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  $(CXXFLAGS) -Y- -Fo./vc7/liblink_test-vc7-mt-1_34/ -Fdvc7/liblink_test-vc7-mt-1_34.pdb link_test.cpp
 
-liblink_test-vc7-mt-1_31_dir :
-	@if not exist "vc7\liblink_test-vc7-mt-1_31\$(NULL)" mkdir vc7\liblink_test-vc7-mt-1_31
+liblink_test-vc7-mt-1_34_dir :
+	@if not exist "vc7\liblink_test-vc7-mt-1_34\$(NULL)" mkdir vc7\liblink_test-vc7-mt-1_34
 
-liblink_test-vc7-mt-1_31_clean :
-	del vc7\liblink_test-vc7-mt-1_31\*.obj
-	del vc7\liblink_test-vc7-mt-1_31\*.idb
-	del vc7\liblink_test-vc7-mt-1_31\*.exp
-	del vc7\liblink_test-vc7-mt-1_31\*.pch
+liblink_test-vc7-mt-1_34_clean :
+	del vc7\liblink_test-vc7-mt-1_34\*.obj
+	del vc7\liblink_test-vc7-mt-1_34\*.idb
+	del vc7\liblink_test-vc7-mt-1_34\*.exp
+	del vc7\liblink_test-vc7-mt-1_34\*.pch
 
-./vc7/liblink_test-vc7-mt-1_31.lib : vc7/liblink_test-vc7-mt-1_31/link_test.obj
-	link -lib /nologo /out:vc7/liblink_test-vc7-mt-1_31.lib $(XSFLAGS)  vc7/liblink_test-vc7-mt-1_31/link_test.obj
+./vc7/liblink_test-vc7-mt-1_34.lib : vc7/liblink_test-vc7-mt-1_34/link_test.obj
+	link -lib /nologo /out:vc7/liblink_test-vc7-mt-1_34.lib $(XSFLAGS)  vc7/liblink_test-vc7-mt-1_34/link_test.obj
 
-./vc7/liblink_test-vc7-mt-1_31.exe : main.cpp ./vc7/liblink_test-vc7-mt-1_31.lib
-	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/liblink_test-vc7-mt-1_31.exe main.cpp /link /LIBPATH:./vc7
-   vc7\liblink_test-vc7-mt-1_31.exe
+./vc7/liblink_test-vc7-mt-1_34.exe : main.cpp ./vc7/liblink_test-vc7-mt-1_34.lib
+	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/liblink_test-vc7-mt-1_34.exe main.cpp /link /LIBPATH:./vc7
+   vc7\liblink_test-vc7-mt-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc7-mt-gd-1_31.lib
+# section for liblink_test-vc7-mt-gd-1_34.lib
 #
 ########################################################
-vc7/liblink_test-vc7-mt-gd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7/liblink_test-vc7-mt-gd-1_31/ -Fdvc7/liblink_test-vc7-mt-gd-1_31.pdb link_test.cpp
+vc7/liblink_test-vc7-mt-gd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc7/liblink_test-vc7-mt-gd-1_34/ -Fdvc7/liblink_test-vc7-mt-gd-1_34.pdb link_test.cpp
 
-liblink_test-vc7-mt-gd-1_31_dir :
-	@if not exist "vc7\liblink_test-vc7-mt-gd-1_31\$(NULL)" mkdir vc7\liblink_test-vc7-mt-gd-1_31
+liblink_test-vc7-mt-gd-1_34_dir :
+	@if not exist "vc7\liblink_test-vc7-mt-gd-1_34\$(NULL)" mkdir vc7\liblink_test-vc7-mt-gd-1_34
 
-liblink_test-vc7-mt-gd-1_31_clean :
-	del vc7\liblink_test-vc7-mt-gd-1_31\*.obj
-	del vc7\liblink_test-vc7-mt-gd-1_31\*.idb
-	del vc7\liblink_test-vc7-mt-gd-1_31\*.exp
-	del vc7\liblink_test-vc7-mt-gd-1_31\*.pch
+liblink_test-vc7-mt-gd-1_34_clean :
+	del vc7\liblink_test-vc7-mt-gd-1_34\*.obj
+	del vc7\liblink_test-vc7-mt-gd-1_34\*.idb
+	del vc7\liblink_test-vc7-mt-gd-1_34\*.exp
+	del vc7\liblink_test-vc7-mt-gd-1_34\*.pch
 
-./vc7/liblink_test-vc7-mt-gd-1_31.lib : vc7/liblink_test-vc7-mt-gd-1_31/link_test.obj
-	link -lib /nologo /out:vc7/liblink_test-vc7-mt-gd-1_31.lib $(XSFLAGS)  vc7/liblink_test-vc7-mt-gd-1_31/link_test.obj
+./vc7/liblink_test-vc7-mt-gd-1_34.lib : vc7/liblink_test-vc7-mt-gd-1_34/link_test.obj
+	link -lib /nologo /out:vc7/liblink_test-vc7-mt-gd-1_34.lib $(XSFLAGS)  vc7/liblink_test-vc7-mt-gd-1_34/link_test.obj
 
-./vc7/liblink_test-vc7-mt-gd-1_31.exe : main.cpp ./vc7/liblink_test-vc7-mt-gd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/liblink_test-vc7-mt-gd-1_31.exe main.cpp /link /LIBPATH:./vc7
-   vc7\liblink_test-vc7-mt-gd-1_31.exe
+./vc7/liblink_test-vc7-mt-gd-1_34.exe : main.cpp ./vc7/liblink_test-vc7-mt-gd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc7/liblink_test-vc7-mt-gd-1_34.exe main.cpp /link /LIBPATH:./vc7
+   vc7\liblink_test-vc7-mt-gd-1_34.exe
 

Modified: boost/trunk/libs/config/test/link/vc71-stlport.mak
===================================================================
--- boost/trunk/libs/config/test/link/vc71-stlport.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/link/vc71-stlport.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2005
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # auto generated makefile for VC6+STLPort
 #
@@ -42,26 +46,26 @@
 
 ALL_HEADER=
 
-all : main_dir liblink_test-vc71-stlport-mt-s-1_31_dir ./vc71-stlport/liblink_test-vc71-stlport-mt-s-1_31.lib ./vc71-stlport/liblink_test-vc71-stlport-mt-s-1_31.exe liblink_test-vc71-stlport-mt-sgd-1_31_dir ./vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_31.lib ./vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_31.exe link_test-vc71-stlport-mt-gd-1_31_dir ./vc71-stlport/link_test-vc71-stlport-mt-gd-1_31.lib ./vc71-stlport/link_test-vc71-stlport-mt-gd-1_31.exe link_test-vc71-stlport-mt-1_31_dir ./vc71-stlport/link_test-vc71-stlport-mt-1_31.lib ./vc71-stlport/link_test-vc71-stlport-mt-1_31.exe liblink_test-vc71-stlport-mt-1_31_dir ./vc71-stlport/liblink_test-vc71-stlport-mt-1_31.lib ./vc71-stlport/liblink_test-vc71-stlport-mt-1_31.exe liblink_test-vc71-stlport-mt-gd-1_31_dir ./vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_31.lib ./vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_31.exe link_test-vc71-stlport-mt-pgd-1_31_dir ./vc71-stlport/link_test-vc71-stlport-mt-pgd-1_31.lib ./vc71-stlport/link_test-vc71-stlport-mt-pgd-1_31.exe liblink_test-vc71-stlport-mt-spgd-1_31_dir ./vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_31.lib ./vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_31.exe liblink_test-vc71-stlport-mt-pgd-1_31_dir ./vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_31.lib ./vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_31.exe
+all : main_dir liblink_test-vc71-stlport-mt-s-1_34_dir ./vc71-stlport/liblink_test-vc71-stlport-mt-s-1_34.lib ./vc71-stlport/liblink_test-vc71-stlport-mt-s-1_34.exe liblink_test-vc71-stlport-mt-sgd-1_34_dir ./vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_34.lib ./vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_34.exe link_test-vc71-stlport-mt-gd-1_34_dir ./vc71-stlport/link_test-vc71-stlport-mt-gd-1_34.lib ./vc71-stlport/link_test-vc71-stlport-mt-gd-1_34.exe link_test-vc71-stlport-mt-1_34_dir ./vc71-stlport/link_test-vc71-stlport-mt-1_34.lib ./vc71-stlport/link_test-vc71-stlport-mt-1_34.exe liblink_test-vc71-stlport-mt-1_34_dir ./vc71-stlport/liblink_test-vc71-stlport-mt-1_34.lib ./vc71-stlport/liblink_test-vc71-stlport-mt-1_34.exe liblink_test-vc71-stlport-mt-gd-1_34_dir ./vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_34.lib ./vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_34.exe link_test-vc71-stlport-mt-pgd-1_34_dir ./vc71-stlport/link_test-vc71-stlport-mt-pgd-1_34.lib ./vc71-stlport/link_test-vc71-stlport-mt-pgd-1_34.exe liblink_test-vc71-stlport-mt-spgd-1_34_dir ./vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_34.lib ./vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_34.exe liblink_test-vc71-stlport-mt-pgd-1_34_dir ./vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_34.lib ./vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_34.exe
 
-clean :  liblink_test-vc71-stlport-mt-s-1_31_clean liblink_test-vc71-stlport-mt-sgd-1_31_clean link_test-vc71-stlport-mt-gd-1_31_clean link_test-vc71-stlport-mt-1_31_clean liblink_test-vc71-stlport-mt-1_31_clean liblink_test-vc71-stlport-mt-gd-1_31_clean link_test-vc71-stlport-mt-pgd-1_31_clean liblink_test-vc71-stlport-mt-spgd-1_31_clean liblink_test-vc71-stlport-mt-pgd-1_31_clean
+clean :  liblink_test-vc71-stlport-mt-s-1_34_clean liblink_test-vc71-stlport-mt-sgd-1_34_clean link_test-vc71-stlport-mt-gd-1_34_clean link_test-vc71-stlport-mt-1_34_clean liblink_test-vc71-stlport-mt-1_34_clean liblink_test-vc71-stlport-mt-gd-1_34_clean link_test-vc71-stlport-mt-pgd-1_34_clean liblink_test-vc71-stlport-mt-spgd-1_34_clean liblink_test-vc71-stlport-mt-pgd-1_34_clean
 
 install : stlport_check all
-	copy vc71-stlport\liblink_test-vc71-stlport-mt-s-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71-stlport\link_test-vc71-stlport-mt-gd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71-stlport\link_test-vc71-stlport-mt-gd-1_31.dll "$(MSVCDIR)\bin"
-	copy vc71-stlport\link_test-vc71-stlport-mt-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71-stlport\link_test-vc71-stlport-mt-1_31.dll "$(MSVCDIR)\bin"
-	copy vc71-stlport\liblink_test-vc71-stlport-mt-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71-stlport\link_test-vc71-stlport-mt-pgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71-stlport\link_test-vc71-stlport-mt-pgd-1_31.dll "$(MSVCDIR)\bin"
-	copy vc71-stlport\link_test-vc71-stlport-mt-pgd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_31.pdb "$(MSVCDIR)\lib"
+	copy vc71-stlport\liblink_test-vc71-stlport-mt-s-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71-stlport\link_test-vc71-stlport-mt-gd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71-stlport\link_test-vc71-stlport-mt-gd-1_34.dll "$(MSVCDIR)\bin"
+	copy vc71-stlport\link_test-vc71-stlport-mt-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71-stlport\link_test-vc71-stlport-mt-1_34.dll "$(MSVCDIR)\bin"
+	copy vc71-stlport\liblink_test-vc71-stlport-mt-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71-stlport\link_test-vc71-stlport-mt-pgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71-stlport\link_test-vc71-stlport-mt-pgd-1_34.dll "$(MSVCDIR)\bin"
+	copy vc71-stlport\link_test-vc71-stlport-mt-pgd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_34.pdb "$(MSVCDIR)\lib"
 
 main_dir :
 	@if not exist "vc71-stlport\$(NULL)" mkdir vc71-stlport
@@ -72,217 +76,217 @@
 
 ########################################################
 #
-# section for liblink_test-vc71-stlport-mt-s-1_31.lib
+# section for liblink_test-vc71-stlport-mt-s-1_34.lib
 #
 ########################################################
-vc71-stlport/liblink_test-vc71-stlport-mt-s-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB  $(CXXFLAGS) -Y- -Fo./vc71-stlport/liblink_test-vc71-stlport-mt-s-1_31/ -Fdvc71-stlport/liblink_test-vc71-stlport-mt-s-1_31.pdb link_test.cpp
+vc71-stlport/liblink_test-vc71-stlport-mt-s-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB  $(CXXFLAGS) -Y- -Fo./vc71-stlport/liblink_test-vc71-stlport-mt-s-1_34/ -Fdvc71-stlport/liblink_test-vc71-stlport-mt-s-1_34.pdb link_test.cpp
 
-liblink_test-vc71-stlport-mt-s-1_31_dir :
-	@if not exist "vc71-stlport\liblink_test-vc71-stlport-mt-s-1_31\$(NULL)" mkdir vc71-stlport\liblink_test-vc71-stlport-mt-s-1_31
+liblink_test-vc71-stlport-mt-s-1_34_dir :
+	@if not exist "vc71-stlport\liblink_test-vc71-stlport-mt-s-1_34\$(NULL)" mkdir vc71-stlport\liblink_test-vc71-stlport-mt-s-1_34
 
-liblink_test-vc71-stlport-mt-s-1_31_clean :
-	del vc71-stlport\liblink_test-vc71-stlport-mt-s-1_31\*.obj
-	del vc71-stlport\liblink_test-vc71-stlport-mt-s-1_31\*.idb
-	del vc71-stlport\liblink_test-vc71-stlport-mt-s-1_31\*.exp
-	del vc71-stlport\liblink_test-vc71-stlport-mt-s-1_31\*.pch
+liblink_test-vc71-stlport-mt-s-1_34_clean :
+	del vc71-stlport\liblink_test-vc71-stlport-mt-s-1_34\*.obj
+	del vc71-stlport\liblink_test-vc71-stlport-mt-s-1_34\*.idb
+	del vc71-stlport\liblink_test-vc71-stlport-mt-s-1_34\*.exp
+	del vc71-stlport\liblink_test-vc71-stlport-mt-s-1_34\*.pch
 
-./vc71-stlport/liblink_test-vc71-stlport-mt-s-1_31.lib : vc71-stlport/liblink_test-vc71-stlport-mt-s-1_31/link_test.obj
-	link -lib /nologo /out:vc71-stlport/liblink_test-vc71-stlport-mt-s-1_31.lib $(XSFLAGS)  vc71-stlport/liblink_test-vc71-stlport-mt-s-1_31/link_test.obj
+./vc71-stlport/liblink_test-vc71-stlport-mt-s-1_34.lib : vc71-stlport/liblink_test-vc71-stlport-mt-s-1_34/link_test.obj
+	link -lib /nologo /out:vc71-stlport/liblink_test-vc71-stlport-mt-s-1_34.lib $(XSFLAGS)  vc71-stlport/liblink_test-vc71-stlport-mt-s-1_34/link_test.obj
 
-./vc71-stlport/liblink_test-vc71-stlport-mt-s-1_31.exe : main.cpp ./vc71-stlport/liblink_test-vc71-stlport-mt-s-1_31.lib
-	cl $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/liblink_test-vc71-stlport-mt-s-1_31.exe main.cpp /link /LIBPATH:./vc71-stlport
-   vc71-stlport\liblink_test-vc71-stlport-mt-s-1_31.exe
+./vc71-stlport/liblink_test-vc71-stlport-mt-s-1_34.exe : main.cpp ./vc71-stlport/liblink_test-vc71-stlport-mt-s-1_34.lib
+	cl $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/liblink_test-vc71-stlport-mt-s-1_34.exe main.cpp /link /LIBPATH:./vc71-stlport
+   vc71-stlport\liblink_test-vc71-stlport-mt-s-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc71-stlport-mt-sgd-1_31.lib
+# section for liblink_test-vc71-stlport-mt-sgd-1_34.lib
 #
 ########################################################
-vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_31/ -Fdvc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_31.pdb link_test.cpp
+vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_34/ -Fdvc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_34.pdb link_test.cpp
 
-liblink_test-vc71-stlport-mt-sgd-1_31_dir :
-	@if not exist "vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_31\$(NULL)" mkdir vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_31
+liblink_test-vc71-stlport-mt-sgd-1_34_dir :
+	@if not exist "vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_34\$(NULL)" mkdir vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_34
 
-liblink_test-vc71-stlport-mt-sgd-1_31_clean :
-	del vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_31\*.obj
-	del vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_31\*.idb
-	del vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_31\*.exp
-	del vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_31\*.pch
+liblink_test-vc71-stlport-mt-sgd-1_34_clean :
+	del vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_34\*.obj
+	del vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_34\*.idb
+	del vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_34\*.exp
+	del vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_34\*.pch
 
-./vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_31.lib : vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_31/link_test.obj
-	link -lib /nologo /out:vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_31.lib $(XSFLAGS)  vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_31/link_test.obj
+./vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_34.lib : vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_34/link_test.obj
+	link -lib /nologo /out:vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_34.lib $(XSFLAGS)  vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_34/link_test.obj
 
-./vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_31.exe : main.cpp ./vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_31.lib
-	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_31.exe main.cpp /link /LIBPATH:./vc71-stlport
-   vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_31.exe
+./vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_34.exe : main.cpp ./vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_34.lib
+	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/liblink_test-vc71-stlport-mt-sgd-1_34.exe main.cpp /link /LIBPATH:./vc71-stlport
+   vc71-stlport\liblink_test-vc71-stlport-mt-sgd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc71-stlport-mt-gd-1_31.lib
+# section for link_test-vc71-stlport-mt-gd-1_34.lib
 #
 ########################################################
-vc71-stlport/link_test-vc71-stlport-mt-gd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71-stlport/link_test-vc71-stlport-mt-gd-1_31/ -Fdvc71-stlport/link_test-vc71-stlport-mt-gd-1_31.pdb link_test.cpp
+vc71-stlport/link_test-vc71-stlport-mt-gd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71-stlport/link_test-vc71-stlport-mt-gd-1_34/ -Fdvc71-stlport/link_test-vc71-stlport-mt-gd-1_34.pdb link_test.cpp
 
-link_test-vc71-stlport-mt-gd-1_31_dir :
-	@if not exist "vc71-stlport\link_test-vc71-stlport-mt-gd-1_31\$(NULL)" mkdir vc71-stlport\link_test-vc71-stlport-mt-gd-1_31
+link_test-vc71-stlport-mt-gd-1_34_dir :
+	@if not exist "vc71-stlport\link_test-vc71-stlport-mt-gd-1_34\$(NULL)" mkdir vc71-stlport\link_test-vc71-stlport-mt-gd-1_34
 
-link_test-vc71-stlport-mt-gd-1_31_clean :
-	del vc71-stlport\link_test-vc71-stlport-mt-gd-1_31\*.obj
-	del vc71-stlport\link_test-vc71-stlport-mt-gd-1_31\*.idb
-	del vc71-stlport\link_test-vc71-stlport-mt-gd-1_31\*.exp
-	del vc71-stlport\link_test-vc71-stlport-mt-gd-1_31\*.pch
+link_test-vc71-stlport-mt-gd-1_34_clean :
+	del vc71-stlport\link_test-vc71-stlport-mt-gd-1_34\*.obj
+	del vc71-stlport\link_test-vc71-stlport-mt-gd-1_34\*.idb
+	del vc71-stlport\link_test-vc71-stlport-mt-gd-1_34\*.exp
+	del vc71-stlport\link_test-vc71-stlport-mt-gd-1_34\*.pch
 
-./vc71-stlport/link_test-vc71-stlport-mt-gd-1_31.lib : vc71-stlport/link_test-vc71-stlport-mt-gd-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc71-stlport/link_test-vc71-stlport-mt-gd-1_31.pdb" /debug /machine:I386 /out:"vc71-stlport/link_test-vc71-stlport-mt-gd-1_31.dll" /implib:"vc71-stlport/link_test-vc71-stlport-mt-gd-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc71-stlport/link_test-vc71-stlport-mt-gd-1_31/link_test.obj
+./vc71-stlport/link_test-vc71-stlport-mt-gd-1_34.lib : vc71-stlport/link_test-vc71-stlport-mt-gd-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc71-stlport/link_test-vc71-stlport-mt-gd-1_34.pdb" /debug /machine:I386 /out:"vc71-stlport/link_test-vc71-stlport-mt-gd-1_34.dll" /implib:"vc71-stlport/link_test-vc71-stlport-mt-gd-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc71-stlport/link_test-vc71-stlport-mt-gd-1_34/link_test.obj
 
-./vc71-stlport/link_test-vc71-stlport-mt-gd-1_31.exe : main.cpp ./vc71-stlport/link_test-vc71-stlport-mt-gd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/link_test-vc71-stlport-mt-gd-1_31.exe main.cpp /link /LIBPATH:./vc71-stlport
-   vc71-stlport\link_test-vc71-stlport-mt-gd-1_31.exe
+./vc71-stlport/link_test-vc71-stlport-mt-gd-1_34.exe : main.cpp ./vc71-stlport/link_test-vc71-stlport-mt-gd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/link_test-vc71-stlport-mt-gd-1_34.exe main.cpp /link /LIBPATH:./vc71-stlport
+   vc71-stlport\link_test-vc71-stlport-mt-gd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc71-stlport-mt-1_31.lib
+# section for link_test-vc71-stlport-mt-1_34.lib
 #
 ########################################################
-vc71-stlport/link_test-vc71-stlport-mt-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /I$(STLPORT_PATH)\stlport /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  $(CXXFLAGS) -Y- -Fo./vc71-stlport/link_test-vc71-stlport-mt-1_31/ -Fdvc71-stlport/link_test-vc71-stlport-mt-1_31.pdb link_test.cpp
+vc71-stlport/link_test-vc71-stlport-mt-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /I$(STLPORT_PATH)\stlport /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  $(CXXFLAGS) -Y- -Fo./vc71-stlport/link_test-vc71-stlport-mt-1_34/ -Fdvc71-stlport/link_test-vc71-stlport-mt-1_34.pdb link_test.cpp
 
-link_test-vc71-stlport-mt-1_31_dir :
-	@if not exist "vc71-stlport\link_test-vc71-stlport-mt-1_31\$(NULL)" mkdir vc71-stlport\link_test-vc71-stlport-mt-1_31
+link_test-vc71-stlport-mt-1_34_dir :
+	@if not exist "vc71-stlport\link_test-vc71-stlport-mt-1_34\$(NULL)" mkdir vc71-stlport\link_test-vc71-stlport-mt-1_34
 
-link_test-vc71-stlport-mt-1_31_clean :
-	del vc71-stlport\link_test-vc71-stlport-mt-1_31\*.obj
-	del vc71-stlport\link_test-vc71-stlport-mt-1_31\*.idb
-	del vc71-stlport\link_test-vc71-stlport-mt-1_31\*.exp
-	del vc71-stlport\link_test-vc71-stlport-mt-1_31\*.pch
+link_test-vc71-stlport-mt-1_34_clean :
+	del vc71-stlport\link_test-vc71-stlport-mt-1_34\*.obj
+	del vc71-stlport\link_test-vc71-stlport-mt-1_34\*.idb
+	del vc71-stlport\link_test-vc71-stlport-mt-1_34\*.exp
+	del vc71-stlport\link_test-vc71-stlport-mt-1_34\*.pch
 
-./vc71-stlport/link_test-vc71-stlport-mt-1_31.lib : vc71-stlport/link_test-vc71-stlport-mt-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc71-stlport/link_test-vc71-stlport-mt-1_31.pdb" /debug /machine:I386 /out:"vc71-stlport/link_test-vc71-stlport-mt-1_31.dll" /implib:"vc71-stlport/link_test-vc71-stlport-mt-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc71-stlport/link_test-vc71-stlport-mt-1_31/link_test.obj
+./vc71-stlport/link_test-vc71-stlport-mt-1_34.lib : vc71-stlport/link_test-vc71-stlport-mt-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc71-stlport/link_test-vc71-stlport-mt-1_34.pdb" /debug /machine:I386 /out:"vc71-stlport/link_test-vc71-stlport-mt-1_34.dll" /implib:"vc71-stlport/link_test-vc71-stlport-mt-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc71-stlport/link_test-vc71-stlport-mt-1_34/link_test.obj
 
-./vc71-stlport/link_test-vc71-stlport-mt-1_31.exe : main.cpp ./vc71-stlport/link_test-vc71-stlport-mt-1_31.lib
-	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /I$(STLPORT_PATH)\stlport /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/link_test-vc71-stlport-mt-1_31.exe main.cpp /link /LIBPATH:./vc71-stlport
-   vc71-stlport\link_test-vc71-stlport-mt-1_31.exe
+./vc71-stlport/link_test-vc71-stlport-mt-1_34.exe : main.cpp ./vc71-stlport/link_test-vc71-stlport-mt-1_34.lib
+	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /I$(STLPORT_PATH)\stlport /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/link_test-vc71-stlport-mt-1_34.exe main.cpp /link /LIBPATH:./vc71-stlport
+   vc71-stlport\link_test-vc71-stlport-mt-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc71-stlport-mt-1_31.lib
+# section for liblink_test-vc71-stlport-mt-1_34.lib
 #
 ########################################################
-vc71-stlport/liblink_test-vc71-stlport-mt-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  $(CXXFLAGS) -Y- -Fo./vc71-stlport/liblink_test-vc71-stlport-mt-1_31/ -Fdvc71-stlport/liblink_test-vc71-stlport-mt-1_31.pdb link_test.cpp
+vc71-stlport/liblink_test-vc71-stlport-mt-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  $(CXXFLAGS) -Y- -Fo./vc71-stlport/liblink_test-vc71-stlport-mt-1_34/ -Fdvc71-stlport/liblink_test-vc71-stlport-mt-1_34.pdb link_test.cpp
 
-liblink_test-vc71-stlport-mt-1_31_dir :
-	@if not exist "vc71-stlport\liblink_test-vc71-stlport-mt-1_31\$(NULL)" mkdir vc71-stlport\liblink_test-vc71-stlport-mt-1_31
+liblink_test-vc71-stlport-mt-1_34_dir :
+	@if not exist "vc71-stlport\liblink_test-vc71-stlport-mt-1_34\$(NULL)" mkdir vc71-stlport\liblink_test-vc71-stlport-mt-1_34
 
-liblink_test-vc71-stlport-mt-1_31_clean :
-	del vc71-stlport\liblink_test-vc71-stlport-mt-1_31\*.obj
-	del vc71-stlport\liblink_test-vc71-stlport-mt-1_31\*.idb
-	del vc71-stlport\liblink_test-vc71-stlport-mt-1_31\*.exp
-	del vc71-stlport\liblink_test-vc71-stlport-mt-1_31\*.pch
+liblink_test-vc71-stlport-mt-1_34_clean :
+	del vc71-stlport\liblink_test-vc71-stlport-mt-1_34\*.obj
+	del vc71-stlport\liblink_test-vc71-stlport-mt-1_34\*.idb
+	del vc71-stlport\liblink_test-vc71-stlport-mt-1_34\*.exp
+	del vc71-stlport\liblink_test-vc71-stlport-mt-1_34\*.pch
 
-./vc71-stlport/liblink_test-vc71-stlport-mt-1_31.lib : vc71-stlport/liblink_test-vc71-stlport-mt-1_31/link_test.obj
-	link -lib /nologo /out:vc71-stlport/liblink_test-vc71-stlport-mt-1_31.lib $(XSFLAGS)  vc71-stlport/liblink_test-vc71-stlport-mt-1_31/link_test.obj
+./vc71-stlport/liblink_test-vc71-stlport-mt-1_34.lib : vc71-stlport/liblink_test-vc71-stlport-mt-1_34/link_test.obj
+	link -lib /nologo /out:vc71-stlport/liblink_test-vc71-stlport-mt-1_34.lib $(XSFLAGS)  vc71-stlport/liblink_test-vc71-stlport-mt-1_34/link_test.obj
 
-./vc71-stlport/liblink_test-vc71-stlport-mt-1_31.exe : main.cpp ./vc71-stlport/liblink_test-vc71-stlport-mt-1_31.lib
-	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/liblink_test-vc71-stlport-mt-1_31.exe main.cpp /link /LIBPATH:./vc71-stlport
-   vc71-stlport\liblink_test-vc71-stlport-mt-1_31.exe
+./vc71-stlport/liblink_test-vc71-stlport-mt-1_34.exe : main.cpp ./vc71-stlport/liblink_test-vc71-stlport-mt-1_34.lib
+	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/liblink_test-vc71-stlport-mt-1_34.exe main.cpp /link /LIBPATH:./vc71-stlport
+   vc71-stlport\liblink_test-vc71-stlport-mt-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc71-stlport-mt-gd-1_31.lib
+# section for liblink_test-vc71-stlport-mt-gd-1_34.lib
 #
 ########################################################
-vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_31/ -Fdvc71-stlport/liblink_test-vc71-stlport-mt-gd-1_31.pdb link_test.cpp
+vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_34/ -Fdvc71-stlport/liblink_test-vc71-stlport-mt-gd-1_34.pdb link_test.cpp
 
-liblink_test-vc71-stlport-mt-gd-1_31_dir :
-	@if not exist "vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_31\$(NULL)" mkdir vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_31
+liblink_test-vc71-stlport-mt-gd-1_34_dir :
+	@if not exist "vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_34\$(NULL)" mkdir vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_34
 
-liblink_test-vc71-stlport-mt-gd-1_31_clean :
-	del vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_31\*.obj
-	del vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_31\*.idb
-	del vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_31\*.exp
-	del vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_31\*.pch
+liblink_test-vc71-stlport-mt-gd-1_34_clean :
+	del vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_34\*.obj
+	del vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_34\*.idb
+	del vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_34\*.exp
+	del vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_34\*.pch
 
-./vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_31.lib : vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_31/link_test.obj
-	link -lib /nologo /out:vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_31.lib $(XSFLAGS)  vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_31/link_test.obj
+./vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_34.lib : vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_34/link_test.obj
+	link -lib /nologo /out:vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_34.lib $(XSFLAGS)  vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_34/link_test.obj
 
-./vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_31.exe : main.cpp ./vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_31.exe main.cpp /link /LIBPATH:./vc71-stlport
-   vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_31.exe
+./vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_34.exe : main.cpp ./vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/liblink_test-vc71-stlport-mt-gd-1_34.exe main.cpp /link /LIBPATH:./vc71-stlport
+   vc71-stlport\liblink_test-vc71-stlport-mt-gd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc71-stlport-mt-pgd-1_31.lib
+# section for link_test-vc71-stlport-mt-pgd-1_34.lib
 #
 ########################################################
-vc71-stlport/link_test-vc71-stlport-mt-pgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71-stlport/link_test-vc71-stlport-mt-pgd-1_31/ -Fdvc71-stlport/link_test-vc71-stlport-mt-pgd-1_31.pdb link_test.cpp
+vc71-stlport/link_test-vc71-stlport-mt-pgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71-stlport/link_test-vc71-stlport-mt-pgd-1_34/ -Fdvc71-stlport/link_test-vc71-stlport-mt-pgd-1_34.pdb link_test.cpp
 
-link_test-vc71-stlport-mt-pgd-1_31_dir :
-	@if not exist "vc71-stlport\link_test-vc71-stlport-mt-pgd-1_31\$(NULL)" mkdir vc71-stlport\link_test-vc71-stlport-mt-pgd-1_31
+link_test-vc71-stlport-mt-pgd-1_34_dir :
+	@if not exist "vc71-stlport\link_test-vc71-stlport-mt-pgd-1_34\$(NULL)" mkdir vc71-stlport\link_test-vc71-stlport-mt-pgd-1_34
 
-link_test-vc71-stlport-mt-pgd-1_31_clean :
-	del vc71-stlport\link_test-vc71-stlport-mt-pgd-1_31\*.obj
-	del vc71-stlport\link_test-vc71-stlport-mt-pgd-1_31\*.idb
-	del vc71-stlport\link_test-vc71-stlport-mt-pgd-1_31\*.exp
-	del vc71-stlport\link_test-vc71-stlport-mt-pgd-1_31\*.pch
+link_test-vc71-stlport-mt-pgd-1_34_clean :
+	del vc71-stlport\link_test-vc71-stlport-mt-pgd-1_34\*.obj
+	del vc71-stlport\link_test-vc71-stlport-mt-pgd-1_34\*.idb
+	del vc71-stlport\link_test-vc71-stlport-mt-pgd-1_34\*.exp
+	del vc71-stlport\link_test-vc71-stlport-mt-pgd-1_34\*.pch
 
-./vc71-stlport/link_test-vc71-stlport-mt-pgd-1_31.lib : vc71-stlport/link_test-vc71-stlport-mt-pgd-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc71-stlport/link_test-vc71-stlport-mt-pgd-1_31.pdb" /debug /machine:I386 /out:"vc71-stlport/link_test-vc71-stlport-mt-pgd-1_31.dll" /implib:"vc71-stlport/link_test-vc71-stlport-mt-pgd-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc71-stlport/link_test-vc71-stlport-mt-pgd-1_31/link_test.obj
+./vc71-stlport/link_test-vc71-stlport-mt-pgd-1_34.lib : vc71-stlport/link_test-vc71-stlport-mt-pgd-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc71-stlport/link_test-vc71-stlport-mt-pgd-1_34.pdb" /debug /machine:I386 /out:"vc71-stlport/link_test-vc71-stlport-mt-pgd-1_34.dll" /implib:"vc71-stlport/link_test-vc71-stlport-mt-pgd-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc71-stlport/link_test-vc71-stlport-mt-pgd-1_34/link_test.obj
 
-./vc71-stlport/link_test-vc71-stlport-mt-pgd-1_31.exe : main.cpp ./vc71-stlport/link_test-vc71-stlport-mt-pgd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/link_test-vc71-stlport-mt-pgd-1_31.exe main.cpp /link /LIBPATH:./vc71-stlport
-   vc71-stlport\link_test-vc71-stlport-mt-pgd-1_31.exe
+./vc71-stlport/link_test-vc71-stlport-mt-pgd-1_34.exe : main.cpp ./vc71-stlport/link_test-vc71-stlport-mt-pgd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_DYN_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/link_test-vc71-stlport-mt-pgd-1_34.exe main.cpp /link /LIBPATH:./vc71-stlport
+   vc71-stlport\link_test-vc71-stlport-mt-pgd-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc71-stlport-mt-spgd-1_31.lib
+# section for liblink_test-vc71-stlport-mt-spgd-1_34.lib
 #
 ########################################################
-vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D__STL_DEBUG /D_STLP_DEBUG /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_31/ -Fdvc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_31.pdb link_test.cpp
+vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D__STL_DEBUG /D_STLP_DEBUG /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_34/ -Fdvc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_34.pdb link_test.cpp
 
-liblink_test-vc71-stlport-mt-spgd-1_31_dir :
-	@if not exist "vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_31\$(NULL)" mkdir vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_31
+liblink_test-vc71-stlport-mt-spgd-1_34_dir :
+	@if not exist "vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_34\$(NULL)" mkdir vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_34
 
-liblink_test-vc71-stlport-mt-spgd-1_31_clean :
-	del vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_31\*.obj
-	del vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_31\*.idb
-	del vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_31\*.exp
-	del vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_31\*.pch
+liblink_test-vc71-stlport-mt-spgd-1_34_clean :
+	del vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_34\*.obj
+	del vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_34\*.idb
+	del vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_34\*.exp
+	del vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_34\*.pch
 
-./vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_31.lib : vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_31/link_test.obj
-	link -lib /nologo /out:vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_31.lib $(XSFLAGS)  vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_31/link_test.obj
+./vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_34.lib : vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_34/link_test.obj
+	link -lib /nologo /out:vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_34.lib $(XSFLAGS)  vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_34/link_test.obj
 
-./vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_31.exe : main.cpp ./vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_31.lib
-	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D__STL_DEBUG /D_STLP_DEBUG /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_31.exe main.cpp /link /LIBPATH:./vc71-stlport
-   vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_31.exe
+./vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_34.exe : main.cpp ./vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_34.lib
+	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /D__STL_DEBUG /D_STLP_DEBUG /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/liblink_test-vc71-stlport-mt-spgd-1_34.exe main.cpp /link /LIBPATH:./vc71-stlport
+   vc71-stlport\liblink_test-vc71-stlport-mt-spgd-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc71-stlport-mt-pgd-1_31.lib
+# section for liblink_test-vc71-stlport-mt-pgd-1_34.lib
 #
 ########################################################
-vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_31/ -Fdvc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_31.pdb link_test.cpp
+vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_34/ -Fdvc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_34.pdb link_test.cpp
 
-liblink_test-vc71-stlport-mt-pgd-1_31_dir :
-	@if not exist "vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_31\$(NULL)" mkdir vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_31
+liblink_test-vc71-stlport-mt-pgd-1_34_dir :
+	@if not exist "vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_34\$(NULL)" mkdir vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_34
 
-liblink_test-vc71-stlport-mt-pgd-1_31_clean :
-	del vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_31\*.obj
-	del vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_31\*.idb
-	del vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_31\*.exp
-	del vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_31\*.pch
+liblink_test-vc71-stlport-mt-pgd-1_34_clean :
+	del vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_34\*.obj
+	del vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_34\*.idb
+	del vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_34\*.exp
+	del vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_34\*.pch
 
-./vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_31.lib : vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_31/link_test.obj
-	link -lib /nologo /out:vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_31.lib $(XSFLAGS)  vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_31/link_test.obj
+./vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_34.lib : vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_34/link_test.obj
+	link -lib /nologo /out:vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_34.lib $(XSFLAGS)  vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_34/link_test.obj
 
-./vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_31.exe : main.cpp ./vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_31.exe main.cpp /link /LIBPATH:./vc71-stlport
-   vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_31.exe
+./vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_34.exe : main.cpp ./vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I$(STLPORT_PATH)\stlport /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D__STL_DEBUG /D_STLP_DEBUG /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71-stlport/liblink_test-vc71-stlport-mt-pgd-1_34.exe main.cpp /link /LIBPATH:./vc71-stlport
+   vc71-stlport\liblink_test-vc71-stlport-mt-pgd-1_34.exe
 

Modified: boost/trunk/libs/config/test/link/vc71.mak
===================================================================
--- boost/trunk/libs/config/test/link/vc71.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/link/vc71.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2005
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # auto generated makefile for VC6 compiler
 #
@@ -38,25 +42,25 @@
 
 ALL_HEADER=
 
-all : main_dir liblink_test-vc71-s-1_31_dir ./vc71/liblink_test-vc71-s-1_31.lib ./vc71/liblink_test-vc71-s-1_31.exe liblink_test-vc71-mt-s-1_31_dir ./vc71/liblink_test-vc71-mt-s-1_31.lib ./vc71/liblink_test-vc71-mt-s-1_31.exe liblink_test-vc71-sgd-1_31_dir ./vc71/liblink_test-vc71-sgd-1_31.lib ./vc71/liblink_test-vc71-sgd-1_31.exe liblink_test-vc71-mt-sgd-1_31_dir ./vc71/liblink_test-vc71-mt-sgd-1_31.lib ./vc71/liblink_test-vc71-mt-sgd-1_31.exe link_test-vc71-mt-gd-1_31_dir ./vc71/link_test-vc71-mt-gd-1_31.lib ./vc71/link_test-vc71-mt-gd-1_31.exe link_test-vc71-mt-1_31_dir ./vc71/link_test-vc71-mt-1_31.lib ./vc71/link_test-vc71-mt-1_31.exe liblink_test-vc71-mt-1_31_dir ./vc71/liblink_test-vc71-mt-1_31.lib ./vc71/liblink_test-vc71-mt-1_31.exe liblink_test-vc71-mt-gd-1_31_dir ./vc71/liblink_test-vc71-mt-gd-1_31.lib ./vc71/liblink_test-vc71-mt-gd-1_31.exe
+all : main_dir liblink_test-vc71-s-1_34_dir ./vc71/liblink_test-vc71-s-1_34.lib ./vc71/liblink_test-vc71-s-1_34.exe liblink_test-vc71-mt-s-1_34_dir ./vc71/liblink_test-vc71-mt-s-1_34.lib ./vc71/liblink_test-vc71-mt-s-1_34.exe liblink_test-vc71-sgd-1_34_dir ./vc71/liblink_test-vc71-sgd-1_34.lib ./vc71/liblink_test-vc71-sgd-1_34.exe liblink_test-vc71-mt-sgd-1_34_dir ./vc71/liblink_test-vc71-mt-sgd-1_34.lib ./vc71/liblink_test-vc71-mt-sgd-1_34.exe link_test-vc71-mt-gd-1_34_dir ./vc71/link_test-vc71-mt-gd-1_34.lib ./vc71/link_test-vc71-mt-gd-1_34.exe link_test-vc71-mt-1_34_dir ./vc71/link_test-vc71-mt-1_34.lib ./vc71/link_test-vc71-mt-1_34.exe liblink_test-vc71-mt-1_34_dir ./vc71/liblink_test-vc71-mt-1_34.lib ./vc71/liblink_test-vc71-mt-1_34.exe liblink_test-vc71-mt-gd-1_34_dir ./vc71/liblink_test-vc71-mt-gd-1_34.lib ./vc71/liblink_test-vc71-mt-gd-1_34.exe
 
-clean :  liblink_test-vc71-s-1_31_clean liblink_test-vc71-mt-s-1_31_clean liblink_test-vc71-sgd-1_31_clean liblink_test-vc71-mt-sgd-1_31_clean link_test-vc71-mt-gd-1_31_clean link_test-vc71-mt-1_31_clean liblink_test-vc71-mt-1_31_clean liblink_test-vc71-mt-gd-1_31_clean
+clean :  liblink_test-vc71-s-1_34_clean liblink_test-vc71-mt-s-1_34_clean liblink_test-vc71-sgd-1_34_clean liblink_test-vc71-mt-sgd-1_34_clean link_test-vc71-mt-gd-1_34_clean link_test-vc71-mt-1_34_clean liblink_test-vc71-mt-1_34_clean liblink_test-vc71-mt-gd-1_34_clean
 
 install : all
-	copy vc71\liblink_test-vc71-s-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71\liblink_test-vc71-mt-s-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71\liblink_test-vc71-sgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71\liblink_test-vc71-sgd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc71\liblink_test-vc71-mt-sgd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71\liblink_test-vc71-mt-sgd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc71\link_test-vc71-mt-gd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71\link_test-vc71-mt-gd-1_31.dll "$(MSVCDIR)\bin"
-	copy vc71\link_test-vc71-mt-gd-1_31.pdb "$(MSVCDIR)\lib"
-	copy vc71\link_test-vc71-mt-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71\link_test-vc71-mt-1_31.dll "$(MSVCDIR)\bin"
-	copy vc71\liblink_test-vc71-mt-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71\liblink_test-vc71-mt-gd-1_31.lib "$(MSVCDIR)\lib"
-	copy vc71\liblink_test-vc71-mt-gd-1_31.pdb "$(MSVCDIR)\lib"
+	copy vc71\liblink_test-vc71-s-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71\liblink_test-vc71-mt-s-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71\liblink_test-vc71-sgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71\liblink_test-vc71-sgd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc71\liblink_test-vc71-mt-sgd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71\liblink_test-vc71-mt-sgd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc71\link_test-vc71-mt-gd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71\link_test-vc71-mt-gd-1_34.dll "$(MSVCDIR)\bin"
+	copy vc71\link_test-vc71-mt-gd-1_34.pdb "$(MSVCDIR)\lib"
+	copy vc71\link_test-vc71-mt-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71\link_test-vc71-mt-1_34.dll "$(MSVCDIR)\bin"
+	copy vc71\liblink_test-vc71-mt-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71\liblink_test-vc71-mt-gd-1_34.lib "$(MSVCDIR)\lib"
+	copy vc71\liblink_test-vc71-mt-gd-1_34.pdb "$(MSVCDIR)\lib"
 
 main_dir :
 	@if not exist "vc71\$(NULL)" mkdir vc71
@@ -64,193 +68,193 @@
 
 ########################################################
 #
-# section for liblink_test-vc71-s-1_31.lib
+# section for liblink_test-vc71-s-1_34.lib
 #
 ########################################################
-vc71/liblink_test-vc71-s-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /ML /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD $(CXXFLAGS) -Y- -Fo./vc71/liblink_test-vc71-s-1_31/ -Fdvc71/liblink_test-vc71-s-1_31.pdb link_test.cpp
+vc71/liblink_test-vc71-s-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /ML /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD $(CXXFLAGS) -Y- -Fo./vc71/liblink_test-vc71-s-1_34/ -Fdvc71/liblink_test-vc71-s-1_34.pdb link_test.cpp
 
-liblink_test-vc71-s-1_31_dir :
-	@if not exist "vc71\liblink_test-vc71-s-1_31\$(NULL)" mkdir vc71\liblink_test-vc71-s-1_31
+liblink_test-vc71-s-1_34_dir :
+	@if not exist "vc71\liblink_test-vc71-s-1_34\$(NULL)" mkdir vc71\liblink_test-vc71-s-1_34
 
-liblink_test-vc71-s-1_31_clean :
-	del vc71\liblink_test-vc71-s-1_31\*.obj
-	del vc71\liblink_test-vc71-s-1_31\*.idb
-	del vc71\liblink_test-vc71-s-1_31\*.exp
-	del vc71\liblink_test-vc71-s-1_31\*.pch
+liblink_test-vc71-s-1_34_clean :
+	del vc71\liblink_test-vc71-s-1_34\*.obj
+	del vc71\liblink_test-vc71-s-1_34\*.idb
+	del vc71\liblink_test-vc71-s-1_34\*.exp
+	del vc71\liblink_test-vc71-s-1_34\*.pch
 
-./vc71/liblink_test-vc71-s-1_31.lib : vc71/liblink_test-vc71-s-1_31/link_test.obj
-	link -lib /nologo /out:vc71/liblink_test-vc71-s-1_31.lib $(XSFLAGS)  vc71/liblink_test-vc71-s-1_31/link_test.obj
+./vc71/liblink_test-vc71-s-1_34.lib : vc71/liblink_test-vc71-s-1_34/link_test.obj
+	link -lib /nologo /out:vc71/liblink_test-vc71-s-1_34.lib $(XSFLAGS)  vc71/liblink_test-vc71-s-1_34/link_test.obj
 
-./vc71/liblink_test-vc71-s-1_31.exe : main.cpp ./vc71/liblink_test-vc71-s-1_31.lib
-	cl $(INCLUDES) /nologo /ML /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/liblink_test-vc71-s-1_31.exe main.cpp /link /LIBPATH:./vc71
-   vc71\liblink_test-vc71-s-1_31.exe
+./vc71/liblink_test-vc71-s-1_34.exe : main.cpp ./vc71/liblink_test-vc71-s-1_34.lib
+	cl $(INCLUDES) /nologo /ML /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/liblink_test-vc71-s-1_34.exe main.cpp /link /LIBPATH:./vc71
+   vc71\liblink_test-vc71-s-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc71-mt-s-1_31.lib
+# section for liblink_test-vc71-mt-s-1_34.lib
 #
 ########################################################
-vc71/liblink_test-vc71-mt-s-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD  $(CXXFLAGS) -Y- -Fo./vc71/liblink_test-vc71-mt-s-1_31/ -Fdvc71/liblink_test-vc71-mt-s-1_31.pdb link_test.cpp
+vc71/liblink_test-vc71-mt-s-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD  $(CXXFLAGS) -Y- -Fo./vc71/liblink_test-vc71-mt-s-1_34/ -Fdvc71/liblink_test-vc71-mt-s-1_34.pdb link_test.cpp
 
-liblink_test-vc71-mt-s-1_31_dir :
-	@if not exist "vc71\liblink_test-vc71-mt-s-1_31\$(NULL)" mkdir vc71\liblink_test-vc71-mt-s-1_31
+liblink_test-vc71-mt-s-1_34_dir :
+	@if not exist "vc71\liblink_test-vc71-mt-s-1_34\$(NULL)" mkdir vc71\liblink_test-vc71-mt-s-1_34
 
-liblink_test-vc71-mt-s-1_31_clean :
-	del vc71\liblink_test-vc71-mt-s-1_31\*.obj
-	del vc71\liblink_test-vc71-mt-s-1_31\*.idb
-	del vc71\liblink_test-vc71-mt-s-1_31\*.exp
-	del vc71\liblink_test-vc71-mt-s-1_31\*.pch
+liblink_test-vc71-mt-s-1_34_clean :
+	del vc71\liblink_test-vc71-mt-s-1_34\*.obj
+	del vc71\liblink_test-vc71-mt-s-1_34\*.idb
+	del vc71\liblink_test-vc71-mt-s-1_34\*.exp
+	del vc71\liblink_test-vc71-mt-s-1_34\*.pch
 
-./vc71/liblink_test-vc71-mt-s-1_31.lib : vc71/liblink_test-vc71-mt-s-1_31/link_test.obj
-	link -lib /nologo /out:vc71/liblink_test-vc71-mt-s-1_31.lib $(XSFLAGS)  vc71/liblink_test-vc71-mt-s-1_31/link_test.obj
+./vc71/liblink_test-vc71-mt-s-1_34.lib : vc71/liblink_test-vc71-mt-s-1_34/link_test.obj
+	link -lib /nologo /out:vc71/liblink_test-vc71-mt-s-1_34.lib $(XSFLAGS)  vc71/liblink_test-vc71-mt-s-1_34/link_test.obj
 
-./vc71/liblink_test-vc71-mt-s-1_31.exe : main.cpp ./vc71/liblink_test-vc71-mt-s-1_31.lib
-	cl $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/liblink_test-vc71-mt-s-1_31.exe main.cpp /link /LIBPATH:./vc71
-   vc71\liblink_test-vc71-mt-s-1_31.exe
+./vc71/liblink_test-vc71-mt-s-1_34.exe : main.cpp ./vc71/liblink_test-vc71-mt-s-1_34.lib
+	cl $(INCLUDES) /nologo /MT /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /D_MT /DWIN32 /DNDEBUG /D_MBCS /D_LIB /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/liblink_test-vc71-mt-s-1_34.exe main.cpp /link /LIBPATH:./vc71
+   vc71\liblink_test-vc71-mt-s-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc71-sgd-1_31.lib
+# section for liblink_test-vc71-sgd-1_34.lib
 #
 ########################################################
-vc71/liblink_test-vc71-sgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MLd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1   $(CXXFLAGS) -Y- -Fo./vc71/liblink_test-vc71-sgd-1_31/ -Fdvc71/liblink_test-vc71-sgd-1_31.pdb link_test.cpp
+vc71/liblink_test-vc71-sgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MLd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1   $(CXXFLAGS) -Y- -Fo./vc71/liblink_test-vc71-sgd-1_34/ -Fdvc71/liblink_test-vc71-sgd-1_34.pdb link_test.cpp
 
-liblink_test-vc71-sgd-1_31_dir :
-	@if not exist "vc71\liblink_test-vc71-sgd-1_31\$(NULL)" mkdir vc71\liblink_test-vc71-sgd-1_31
+liblink_test-vc71-sgd-1_34_dir :
+	@if not exist "vc71\liblink_test-vc71-sgd-1_34\$(NULL)" mkdir vc71\liblink_test-vc71-sgd-1_34
 
-liblink_test-vc71-sgd-1_31_clean :
-	del vc71\liblink_test-vc71-sgd-1_31\*.obj
-	del vc71\liblink_test-vc71-sgd-1_31\*.idb
-	del vc71\liblink_test-vc71-sgd-1_31\*.exp
-	del vc71\liblink_test-vc71-sgd-1_31\*.pch
+liblink_test-vc71-sgd-1_34_clean :
+	del vc71\liblink_test-vc71-sgd-1_34\*.obj
+	del vc71\liblink_test-vc71-sgd-1_34\*.idb
+	del vc71\liblink_test-vc71-sgd-1_34\*.exp
+	del vc71\liblink_test-vc71-sgd-1_34\*.pch
 
-./vc71/liblink_test-vc71-sgd-1_31.lib : vc71/liblink_test-vc71-sgd-1_31/link_test.obj
-	link -lib /nologo /out:vc71/liblink_test-vc71-sgd-1_31.lib $(XSFLAGS)  vc71/liblink_test-vc71-sgd-1_31/link_test.obj
+./vc71/liblink_test-vc71-sgd-1_34.lib : vc71/liblink_test-vc71-sgd-1_34/link_test.obj
+	link -lib /nologo /out:vc71/liblink_test-vc71-sgd-1_34.lib $(XSFLAGS)  vc71/liblink_test-vc71-sgd-1_34/link_test.obj
 
-./vc71/liblink_test-vc71-sgd-1_31.exe : main.cpp ./vc71/liblink_test-vc71-sgd-1_31.lib
-	cl $(INCLUDES) /nologo /MLd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1   /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/liblink_test-vc71-sgd-1_31.exe main.cpp /link /LIBPATH:./vc71
-   vc71\liblink_test-vc71-sgd-1_31.exe
+./vc71/liblink_test-vc71-sgd-1_34.exe : main.cpp ./vc71/liblink_test-vc71-sgd-1_34.lib
+	cl $(INCLUDES) /nologo /MLd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1   /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/liblink_test-vc71-sgd-1_34.exe main.cpp /link /LIBPATH:./vc71
+   vc71\liblink_test-vc71-sgd-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc71-mt-sgd-1_31.lib
+# section for liblink_test-vc71-mt-sgd-1_34.lib
 #
 ########################################################
-vc71/liblink_test-vc71-mt-sgd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71/liblink_test-vc71-mt-sgd-1_31/ -Fdvc71/liblink_test-vc71-mt-sgd-1_31.pdb link_test.cpp
+vc71/liblink_test-vc71-mt-sgd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71/liblink_test-vc71-mt-sgd-1_34/ -Fdvc71/liblink_test-vc71-mt-sgd-1_34.pdb link_test.cpp
 
-liblink_test-vc71-mt-sgd-1_31_dir :
-	@if not exist "vc71\liblink_test-vc71-mt-sgd-1_31\$(NULL)" mkdir vc71\liblink_test-vc71-mt-sgd-1_31
+liblink_test-vc71-mt-sgd-1_34_dir :
+	@if not exist "vc71\liblink_test-vc71-mt-sgd-1_34\$(NULL)" mkdir vc71\liblink_test-vc71-mt-sgd-1_34
 
-liblink_test-vc71-mt-sgd-1_31_clean :
-	del vc71\liblink_test-vc71-mt-sgd-1_31\*.obj
-	del vc71\liblink_test-vc71-mt-sgd-1_31\*.idb
-	del vc71\liblink_test-vc71-mt-sgd-1_31\*.exp
-	del vc71\liblink_test-vc71-mt-sgd-1_31\*.pch
+liblink_test-vc71-mt-sgd-1_34_clean :
+	del vc71\liblink_test-vc71-mt-sgd-1_34\*.obj
+	del vc71\liblink_test-vc71-mt-sgd-1_34\*.idb
+	del vc71\liblink_test-vc71-mt-sgd-1_34\*.exp
+	del vc71\liblink_test-vc71-mt-sgd-1_34\*.pch
 
-./vc71/liblink_test-vc71-mt-sgd-1_31.lib : vc71/liblink_test-vc71-mt-sgd-1_31/link_test.obj
-	link -lib /nologo /out:vc71/liblink_test-vc71-mt-sgd-1_31.lib $(XSFLAGS)  vc71/liblink_test-vc71-mt-sgd-1_31/link_test.obj
+./vc71/liblink_test-vc71-mt-sgd-1_34.lib : vc71/liblink_test-vc71-mt-sgd-1_34/link_test.obj
+	link -lib /nologo /out:vc71/liblink_test-vc71-mt-sgd-1_34.lib $(XSFLAGS)  vc71/liblink_test-vc71-mt-sgd-1_34/link_test.obj
 
-./vc71/liblink_test-vc71-mt-sgd-1_31.exe : main.cpp ./vc71/liblink_test-vc71-mt-sgd-1_31.lib
-	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/liblink_test-vc71-mt-sgd-1_31.exe main.cpp /link /LIBPATH:./vc71
-   vc71\liblink_test-vc71-mt-sgd-1_31.exe
+./vc71/liblink_test-vc71-mt-sgd-1_34.exe : main.cpp ./vc71/liblink_test-vc71-mt-sgd-1_34.lib
+	cl $(INCLUDES) /nologo /MTd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DWIN32 /D_MT /D_DEBUG /D_MBCS /D_LIB /FD /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/liblink_test-vc71-mt-sgd-1_34.exe main.cpp /link /LIBPATH:./vc71
+   vc71\liblink_test-vc71-mt-sgd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc71-mt-gd-1_31.lib
+# section for link_test-vc71-mt-gd-1_34.lib
 #
 ########################################################
-vc71/link_test-vc71-mt-gd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /D_DEBUG /DBOOST_DYN_LINK /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71/link_test-vc71-mt-gd-1_31/ -Fdvc71/link_test-vc71-mt-gd-1_31.pdb link_test.cpp
+vc71/link_test-vc71-mt-gd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /D_DEBUG /DBOOST_DYN_LINK /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71/link_test-vc71-mt-gd-1_34/ -Fdvc71/link_test-vc71-mt-gd-1_34.pdb link_test.cpp
 
-link_test-vc71-mt-gd-1_31_dir :
-	@if not exist "vc71\link_test-vc71-mt-gd-1_31\$(NULL)" mkdir vc71\link_test-vc71-mt-gd-1_31
+link_test-vc71-mt-gd-1_34_dir :
+	@if not exist "vc71\link_test-vc71-mt-gd-1_34\$(NULL)" mkdir vc71\link_test-vc71-mt-gd-1_34
 
-link_test-vc71-mt-gd-1_31_clean :
-	del vc71\link_test-vc71-mt-gd-1_31\*.obj
-	del vc71\link_test-vc71-mt-gd-1_31\*.idb
-	del vc71\link_test-vc71-mt-gd-1_31\*.exp
-	del vc71\link_test-vc71-mt-gd-1_31\*.pch
+link_test-vc71-mt-gd-1_34_clean :
+	del vc71\link_test-vc71-mt-gd-1_34\*.obj
+	del vc71\link_test-vc71-mt-gd-1_34\*.idb
+	del vc71\link_test-vc71-mt-gd-1_34\*.exp
+	del vc71\link_test-vc71-mt-gd-1_34\*.pch
 
-./vc71/link_test-vc71-mt-gd-1_31.lib : vc71/link_test-vc71-mt-gd-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc71/link_test-vc71-mt-gd-1_31.pdb" /debug /machine:I386 /out:"vc71/link_test-vc71-mt-gd-1_31.dll" /implib:"vc71/link_test-vc71-mt-gd-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc71/link_test-vc71-mt-gd-1_31/link_test.obj
+./vc71/link_test-vc71-mt-gd-1_34.lib : vc71/link_test-vc71-mt-gd-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc71/link_test-vc71-mt-gd-1_34.pdb" /debug /machine:I386 /out:"vc71/link_test-vc71-mt-gd-1_34.dll" /implib:"vc71/link_test-vc71-mt-gd-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc71/link_test-vc71-mt-gd-1_34/link_test.obj
 
-./vc71/link_test-vc71-mt-gd-1_31.exe : main.cpp ./vc71/link_test-vc71-mt-gd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /D_DEBUG /DBOOST_DYN_LINK /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/link_test-vc71-mt-gd-1_31.exe main.cpp /link /LIBPATH:./vc71
-   vc71\link_test-vc71-mt-gd-1_31.exe
+./vc71/link_test-vc71-mt-gd-1_34.exe : main.cpp ./vc71/link_test-vc71-mt-gd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /D_DEBUG /DBOOST_DYN_LINK /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/link_test-vc71-mt-gd-1_34.exe main.cpp /link /LIBPATH:./vc71
+   vc71\link_test-vc71-mt-gd-1_34.exe
 
 ########################################################
 #
-# section for link_test-vc71-mt-1_31.lib
+# section for link_test-vc71-mt-1_34.lib
 #
 ########################################################
-vc71/link_test-vc71-mt-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  $(CXXFLAGS) -Y- -Fo./vc71/link_test-vc71-mt-1_31/ -Fdvc71/link_test-vc71-mt-1_31.pdb link_test.cpp
+vc71/link_test-vc71-mt-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  $(CXXFLAGS) -Y- -Fo./vc71/link_test-vc71-mt-1_34/ -Fdvc71/link_test-vc71-mt-1_34.pdb link_test.cpp
 
-link_test-vc71-mt-1_31_dir :
-	@if not exist "vc71\link_test-vc71-mt-1_31\$(NULL)" mkdir vc71\link_test-vc71-mt-1_31
+link_test-vc71-mt-1_34_dir :
+	@if not exist "vc71\link_test-vc71-mt-1_34\$(NULL)" mkdir vc71\link_test-vc71-mt-1_34
 
-link_test-vc71-mt-1_31_clean :
-	del vc71\link_test-vc71-mt-1_31\*.obj
-	del vc71\link_test-vc71-mt-1_31\*.idb
-	del vc71\link_test-vc71-mt-1_31\*.exp
-	del vc71\link_test-vc71-mt-1_31\*.pch
+link_test-vc71-mt-1_34_clean :
+	del vc71\link_test-vc71-mt-1_34\*.obj
+	del vc71\link_test-vc71-mt-1_34\*.idb
+	del vc71\link_test-vc71-mt-1_34\*.exp
+	del vc71\link_test-vc71-mt-1_34\*.pch
 
-./vc71/link_test-vc71-mt-1_31.lib : vc71/link_test-vc71-mt-1_31/link_test.obj
-	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc71/link_test-vc71-mt-1_31.pdb" /debug /machine:I386 /out:"vc71/link_test-vc71-mt-1_31.dll" /implib:"vc71/link_test-vc71-mt-1_31.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc71/link_test-vc71-mt-1_31/link_test.obj
+./vc71/link_test-vc71-mt-1_34.lib : vc71/link_test-vc71-mt-1_34/link_test.obj
+	link kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /pdb:"vc71/link_test-vc71-mt-1_34.pdb" /debug /machine:I386 /out:"vc71/link_test-vc71-mt-1_34.dll" /implib:"vc71/link_test-vc71-mt-1_34.lib" /LIBPATH:$(STLPORT_PATH)\lib $(XLFLAGS)  vc71/link_test-vc71-mt-1_34/link_test.obj
 
-./vc71/link_test-vc71-mt-1_31.exe : main.cpp ./vc71/link_test-vc71-mt-1_31.lib
-	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/link_test-vc71-mt-1_31.exe main.cpp /link /LIBPATH:./vc71
-   vc71\link_test-vc71-mt-1_31.exe
+./vc71/link_test-vc71-mt-1_34.exe : main.cpp ./vc71/link_test-vc71-mt-1_34.lib
+	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_DYN_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/link_test-vc71-mt-1_34.exe main.cpp /link /LIBPATH:./vc71
+   vc71\link_test-vc71-mt-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc71-mt-1_31.lib
+# section for liblink_test-vc71-mt-1_34.lib
 #
 ########################################################
-vc71/liblink_test-vc71-mt-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  $(CXXFLAGS) -Y- -Fo./vc71/liblink_test-vc71-mt-1_31/ -Fdvc71/liblink_test-vc71-mt-1_31.pdb link_test.cpp
+vc71/liblink_test-vc71-mt-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  $(CXXFLAGS) -Y- -Fo./vc71/liblink_test-vc71-mt-1_34/ -Fdvc71/liblink_test-vc71-mt-1_34.pdb link_test.cpp
 
-liblink_test-vc71-mt-1_31_dir :
-	@if not exist "vc71\liblink_test-vc71-mt-1_31\$(NULL)" mkdir vc71\liblink_test-vc71-mt-1_31
+liblink_test-vc71-mt-1_34_dir :
+	@if not exist "vc71\liblink_test-vc71-mt-1_34\$(NULL)" mkdir vc71\liblink_test-vc71-mt-1_34
 
-liblink_test-vc71-mt-1_31_clean :
-	del vc71\liblink_test-vc71-mt-1_31\*.obj
-	del vc71\liblink_test-vc71-mt-1_31\*.idb
-	del vc71\liblink_test-vc71-mt-1_31\*.exp
-	del vc71\liblink_test-vc71-mt-1_31\*.pch
+liblink_test-vc71-mt-1_34_clean :
+	del vc71\liblink_test-vc71-mt-1_34\*.obj
+	del vc71\liblink_test-vc71-mt-1_34\*.idb
+	del vc71\liblink_test-vc71-mt-1_34\*.exp
+	del vc71\liblink_test-vc71-mt-1_34\*.pch
 
-./vc71/liblink_test-vc71-mt-1_31.lib : vc71/liblink_test-vc71-mt-1_31/link_test.obj
-	link -lib /nologo /out:vc71/liblink_test-vc71-mt-1_31.lib $(XSFLAGS)  vc71/liblink_test-vc71-mt-1_31/link_test.obj
+./vc71/liblink_test-vc71-mt-1_34.lib : vc71/liblink_test-vc71-mt-1_34/link_test.obj
+	link -lib /nologo /out:vc71/liblink_test-vc71-mt-1_34.lib $(XSFLAGS)  vc71/liblink_test-vc71-mt-1_34/link_test.obj
 
-./vc71/liblink_test-vc71-mt-1_31.exe : main.cpp ./vc71/liblink_test-vc71-mt-1_31.lib
-	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/liblink_test-vc71-mt-1_31.exe main.cpp /link /LIBPATH:./vc71
-   vc71\liblink_test-vc71-mt-1_31.exe
+./vc71/liblink_test-vc71-mt-1_34.exe : main.cpp ./vc71/liblink_test-vc71-mt-1_34.lib
+	cl $(INCLUDES) /nologo /MD /W3 /GX /O2 /GB /GF /Gy /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /DNDEBUG /DWIN32 /D_WINDOWS /D_MBCS /D_USRDLL /FD  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/liblink_test-vc71-mt-1_34.exe main.cpp /link /LIBPATH:./vc71
+   vc71\liblink_test-vc71-mt-1_34.exe
 
 ########################################################
 #
-# section for liblink_test-vc71-mt-gd-1_31.lib
+# section for liblink_test-vc71-mt-gd-1_34.lib
 #
 ########################################################
-vc71/liblink_test-vc71-mt-gd-1_31/link_test.obj: link_test.cpp $(ALL_HEADER)
-	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71/liblink_test-vc71-mt-gd-1_31/ -Fdvc71/liblink_test-vc71-mt-gd-1_31.pdb link_test.cpp
+vc71/liblink_test-vc71-mt-gd-1_34/link_test.obj: link_test.cpp $(ALL_HEADER)
+	cl /c $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  $(CXXFLAGS) -Y- -Fo./vc71/liblink_test-vc71-mt-gd-1_34/ -Fdvc71/liblink_test-vc71-mt-gd-1_34.pdb link_test.cpp
 
-liblink_test-vc71-mt-gd-1_31_dir :
-	@if not exist "vc71\liblink_test-vc71-mt-gd-1_31\$(NULL)" mkdir vc71\liblink_test-vc71-mt-gd-1_31
+liblink_test-vc71-mt-gd-1_34_dir :
+	@if not exist "vc71\liblink_test-vc71-mt-gd-1_34\$(NULL)" mkdir vc71\liblink_test-vc71-mt-gd-1_34
 
-liblink_test-vc71-mt-gd-1_31_clean :
-	del vc71\liblink_test-vc71-mt-gd-1_31\*.obj
-	del vc71\liblink_test-vc71-mt-gd-1_31\*.idb
-	del vc71\liblink_test-vc71-mt-gd-1_31\*.exp
-	del vc71\liblink_test-vc71-mt-gd-1_31\*.pch
+liblink_test-vc71-mt-gd-1_34_clean :
+	del vc71\liblink_test-vc71-mt-gd-1_34\*.obj
+	del vc71\liblink_test-vc71-mt-gd-1_34\*.idb
+	del vc71\liblink_test-vc71-mt-gd-1_34\*.exp
+	del vc71\liblink_test-vc71-mt-gd-1_34\*.pch
 
-./vc71/liblink_test-vc71-mt-gd-1_31.lib : vc71/liblink_test-vc71-mt-gd-1_31/link_test.obj
-	link -lib /nologo /out:vc71/liblink_test-vc71-mt-gd-1_31.lib $(XSFLAGS)  vc71/liblink_test-vc71-mt-gd-1_31/link_test.obj
+./vc71/liblink_test-vc71-mt-gd-1_34.lib : vc71/liblink_test-vc71-mt-gd-1_34/link_test.obj
+	link -lib /nologo /out:vc71/liblink_test-vc71-mt-gd-1_34.lib $(XSFLAGS)  vc71/liblink_test-vc71-mt-gd-1_34/link_test.obj
 
-./vc71/liblink_test-vc71-mt-gd-1_31.exe : main.cpp ./vc71/liblink_test-vc71-mt-gd-1_31.lib
-	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/liblink_test-vc71-mt-gd-1_31.exe main.cpp /link /LIBPATH:./vc71
-   vc71\liblink_test-vc71-mt-gd-1_31.exe
+./vc71/liblink_test-vc71-mt-gd-1_34.exe : main.cpp ./vc71/liblink_test-vc71-mt-gd-1_34.lib
+	cl $(INCLUDES) /nologo /MDd /W3 /Gm /GX /Zi /Od /I..\..\..\..\ /DBOOST_REGEX_STATIC_LINK /D_DEBUG /DWIN32 /D_WINDOWS /D_MBCS /DUSRDLL /FD /GX /RTC1  /DBOOST_LIB_DIAGNOSTIC=1 $(CXXFLAGS) -o ./vc71/liblink_test-vc71-mt-gd-1_34.exe main.cpp /link /LIBPATH:./vc71
+   vc71\liblink_test-vc71-mt-gd-1_34.exe
 

Modified: boost/trunk/libs/config/test/link/vc_gen.sh
===================================================================
--- boost/trunk/libs/config/test/link/vc_gen.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/link/vc_gen.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
 #! /bin/bash
+# copyright John Maddock 2005
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 libname=""
 src=""
@@ -179,6 +183,10 @@
 	vc6_gen_lib
 	
 	cat > $out << EOF
+# copyright John Maddock 2005
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # auto generated makefile for VC6 compiler
 #
@@ -287,6 +295,10 @@
 	vc6_gen_lib
 	
 	cat > $out << EOF
+# copyright John Maddock 2005
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # auto generated makefile for VC6+STLPort
 #
@@ -407,3 +419,6 @@
 
 
 
+
+
+

Modified: boost/trunk/libs/config/test/math_info.cpp
===================================================================
--- boost/trunk/libs/config/test/math_info.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/math_info.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -81,9 +81,9 @@
    std::cout << 
       "    is_specialized       = " << std::numeric_limits<T>::is_specialized << std::endl;
    std::cout << 
-      "    min()                = " << std::setprecision(std::numeric_limits<T>::digits10 + 2) << (std::numeric_limits<T>::min)() << std::endl;
+      "    min" "()                = " << std::setprecision(std::numeric_limits<T>::digits10 + 2) << (std::numeric_limits<T>::min)() << std::endl;
    std::cout << 
-      "    max()                = " << std::setprecision(std::numeric_limits<T>::digits10 + 2) << (std::numeric_limits<T>::max)() << std::endl;
+      "    max" "()                = " << std::setprecision(std::numeric_limits<T>::digits10 + 2) << (std::numeric_limits<T>::max)() << std::endl;
    std::cout << 
       "    digits               = " << std::numeric_limits<T>::digits << std::endl;
    std::cout << 
@@ -355,3 +355,4 @@
 
 
 
+

Modified: boost/trunk/libs/config/test/options.jam
===================================================================
--- boost/trunk/libs/config/test/options.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/options.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,7 @@
 # copyright John Maddock 2003
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #
 # this template defines the options common to
@@ -20,3 +23,4 @@
      <template>config_options
    ;
  
+

Modified: boost/trunk/libs/config/test/options_v2.jam
===================================================================
--- boost/trunk/libs/config/test/options_v2.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/test/options_v2.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,7 @@
 # copyright John Maddock 2003
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 project
     : requirements 
@@ -6,4 +9,4 @@
      <threading>multi
    ;
    
-local test-requirements = <library>../../test/build//boost_test_exec_monitor  ;
\ No newline at end of file
+local test-requirements = <library>../../test/build//boost_test_exec_monitor  ;

Deleted: boost/trunk/libs/config/tools/Jamfile
===================================================================
--- boost/trunk/libs/config/tools/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/tools/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +0,0 @@
-# Copyright John Maddock.
-
-subproject libs/config/tools ;
-# bring in the rules for testing
-import testing  ;
-
-run generate.cpp 
-   <lib>../../regex/build/boost_regex 
-   <lib>../../filesystem/build/boost_filesystem
-   : : $(BOOST_ROOT)  ;
-

Modified: boost/trunk/libs/config/tools/configure.in
===================================================================
--- boost/trunk/libs/config/tools/configure.in	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/tools/configure.in	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # the following variables contain our macro definitions:
 #
@@ -456,3 +460,4 @@
 
 
 
+

Modified: boost/trunk/libs/config/tools/generate.cpp
===================================================================
--- boost/trunk/libs/config/tools/generate.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/config/tools/generate.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -96,6 +96,9 @@
       "# This file was automatically generated on " << std::ctime(&t);
    ofs << "#  by libs/config/tools/generate.cpp\n"
       "# Copyright John Maddock.\n"
+      "# Use, modification and distribution are subject to the \n"
+      "# Boost Software License, Version 1.0. (See accompanying file \n"
+      "# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n"
       "#\n# If you need to alter build preferences then set them in\n"
       "# the template defined in options.jam.\n#\n"
       "subproject libs/config/test ;\n"
@@ -117,6 +120,9 @@
       "# This file was automatically generated on " << std::ctime(&t);
    ofs << "#  by libs/config/tools/generate.cpp\n"
       "# Copyright John Maddock.\n"
+      "# Use, modification and distribution are subject to the \n"
+      "# Boost Software License, Version 1.0. (See accompanying file \n"
+      "# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n"
       "#\n# If you need to alter build preferences then set them in\n"
       "# the template defined in options_v2.jam.\n#\n"
       "path-constant DOT : . ;\n"
@@ -297,3 +303,4 @@
    write_config_info();
    return 0;
 }
+

Deleted: boost/trunk/libs/conversion/test/Jamfile
===================================================================
--- boost/trunk/libs/conversion/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/conversion/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,34 +0,0 @@
-# Signals library
-
-# Copyright (C) 2001-2003 Douglas Gregor
-
-# Permission to copy, use, sell and distribute this software is granted
-# provided this copyright notice appears in all copies. Permission to modify
-# the code and to distribute modified code is granted provided this copyright
-# notice appears in all copies, and a notice that the code was modified is
-# included with the copyright notice. This software is provided "as is"
-# without express or implied warranty, and with no claim as to its suitability
-# for any purpose.
-
-# For more information, see http://www.boost.org/
-
-
-# Testing Jamfile autogenerated from XML source
-subproject libs/conversion/test ;
-
-# bring in rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-  test-suite conversion
-      : [ run implicit_cast.cpp ]
-        [ compile-fail implicit_cast_fail.cpp ]
-        [ run ../cast_test.cpp ]
-	[ run ../numeric_cast_test.cpp ]
-        [ run ../lexical_cast_test.cpp <lib>../../test/build/boost_unit_test_framework ]
-      ;
-}
-      

Modified: boost/trunk/libs/conversion/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/conversion/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/conversion/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,7 +20,7 @@
     [ compile-fail implicit_cast_fail.cpp ]
     [ run ../cast_test.cpp ]
     [ run ../numeric_cast_test.cpp ]    
-    [ run ../lexical_cast_test.cpp ../../test/build//boost_unit_test_framework ]
+    [ run ../lexical_cast_test.cpp ../../test/build//boost_unit_test_framework/<link>static ]
   ;
 
-      
\ No newline at end of file
+      

Deleted: boost/trunk/libs/date_time/build/Jamfile
===================================================================
--- boost/trunk/libs/date_time/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,51 +0,0 @@
-# Copyright (c) 2002-2005 CrystalClear Software, Inc.
-# Use, modification and distribution is subject to the 
-# Boost Software License, Version 1.0. (See accompanying
-# file LICENSE-1.0 or http://www.boost.org/LICENSE-1.0)
-#
-# Boost.date_time build 
-#
-# Declares the following targets:
-#   1. libboost_date_time, a library to be linked with all
-#      Boost.date_time modules
-#
-# declare the location of this subproject relative to the root
-subproject libs/date_time/build ;
-
-
-# Base names of the source files for libboost_date_time
-CPP_SOURCES =
-    greg_month greg_weekday date_generators ;
-
-dll boost_date_time 
-    : ../src/gregorian/$(CPP_SOURCES).cpp    
-    : 
-      <sysinclude>$(BOOST_ROOT) 
-      <runtime-link>dynamic
-      <define>BOOST_ALL_DYN_LINK=1
-      <define>USE_DATE_TIME_PRE_1_33_FACET_IO 
-      # the common names rule ensures that the library will
-      # be named according to the rules used by the install
-      # and auto-link features:
-      common-variant-tag 
-    : debug release     ;
-
-lib boost_date_time : ../src/gregorian/$(CPP_SOURCES).cpp
-    : 
-      <sysinclude>$(BOOST_ROOT) 
-      <define>BOOST_DATE_TIME_STATIC_LINK
-      <define>USE_DATE_TIME_PRE_1_33_FACET_IO 
-      # the common names rule ensures that the library will
-      # be named according to the rules used by the install
-      # and auto-link features:
-      common-variant-tag 
-    : 
-      debug 
-      release 
-      <runtime-link>static 
-    ;
-
-install date_time lib
-    : <dll>boost_date_time <lib>boost_date_time
-    ;
-

Modified: boost/trunk/libs/date_time/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/date_time/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
-#  (C) Copyright  2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears
-#  in all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright (c) 2002-2005 CrystalClear Software, Inc.
+# Use, modification and distribution is subject to the 
+# Boost Software License, Version 1.0. (See accompanying
+# file LICENSE-1.0 or http://www.boost.org/LICENSE-1.0)
 #
-#
 # Boost.date_time build and test Jamfile
 #
 #  Based on boost.python Jamfile

Modified: boost/trunk/libs/date_time/doc/index.html
===================================================================
--- boost/trunk/libs/date_time/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,5 +5,9 @@
 <body>
 Automatic redirection failed, please go to
 <a href="../../../doc/html/date_time.html">../../../doc/html/date_time.html</a>
+<p>© Copyright CrystalClear Software, Inc 2003-2006</p>
+<p> Use, modification, and distribution are subject to the Boost Software 
+License, Version 1.0. (See accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
+www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
 </html>

Deleted: boost/trunk/libs/date_time/example/Jamfile
===================================================================
--- boost/trunk/libs/date_time/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,109 +0,0 @@
-subproject libs/date_time/example ;
-
-local DATE_TIME_PROPERTIES = <define>BOOST_DATE_TIME_STATIC_LINK ;
-
-
-exe dates_as_strings : <lib>../build/boost_date_time
-                    gregorian/dates_as_strings.cpp
-                  : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES)  
-                  ;
-
-exe days_alive : <lib>../build/boost_date_time
-                  gregorian/days_alive.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) 
-                ;
-
-exe days_till_new_year : <lib>../build/boost_date_time
-                  gregorian/days_till_new_year.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) 
-                ;
-
-exe days_between_new_years : <lib>../build/boost_date_time
-                  gregorian/days_between_new_years.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) 
-                ;
-
-exe find_last_day_of_months : <lib>../build/boost_date_time
-                  gregorian/find_last_day_of_months.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) 
-                ;
-
-exe month_add : <lib>../build/boost_date_time
-                  gregorian/month_add.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) 
-                ;
-
-exe localization : gregorian/localization.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) 
-                ;
-
-exe print_holidays : <lib>../build/boost_date_time
-                  gregorian/print_holidays.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) 
-                ;
-
-exe print_month : <lib>../build/boost_date_time
-                  gregorian/print_month.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) 
-                ;
-
-exe period_calc : <lib>../build/boost_date_time
-                  gregorian/period_calc.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) 
-                ;
-
-exe days_since_year_start : <lib>../build/boost_date_time
-                  gregorian/days_since_year_start.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) 
-                ;
-
-exe local_utc_conversion : <lib>../build/boost_date_time
-                  posix_time/local_utc_conversion.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) <define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG  
-                ;
-
-exe print_hours : <lib>../build/boost_date_time
-                  posix_time/print_hours.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) <define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG  
-                ;
-
-exe time_math : <lib>../build/boost_date_time
-                  posix_time/time_math.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) <define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG  
-                ;
-
-exe time_periods : <lib>../build/boost_date_time
-                  posix_time/time_periods.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) <define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG  
-                ;
-
-exe simple_time_zone : <lib>../build/boost_date_time
-                  local_time/simple_time_zone.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) 
-                ;
-
-exe calc_rules : <lib>../build/boost_date_time
-                  local_time/calc_rules.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) 
-                ;
-
-exe seconds_since_epoch : <lib>../build/boost_date_time
-                  local_time/seconds_since_epoch.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) 
-                ;
-
-exe flight : <lib>../build/boost_date_time
-                  local_time/flight.cpp
-                : <include>$(BOOST_ROOT) $(DATE_TIME_PROPERTIES) 
-                ;
-
-exe io_tutorial : tutorial/io_tutorial.cpp
-                : <include>$(BOOST_ROOT)
-                ;
-
-# Copyright (c) 2002-2005
-# CrystalClear Software, Inc.
-# Subject to the Boost Software License, Version 1.0. 
-# (See accompanying file LICENSE-1.0 or 
-# http://www.boost.org/LICENSE-1.0)
-

Modified: boost/trunk/libs/date_time/example/gregorian/Jamfile.v2
===================================================================
--- boost/trunk/libs/date_time/example/gregorian/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/example/gregorian/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright (c) 2002-2006 CrystalClear Software, Inc.
+# Use, modification and distribution is subject to the 
+# Boost Software License, Version 1.0. (See accompanying
+# file LICENSE-1.0 or http://www.boost.org/LICENSE-1.0)
+#
 
 project
     : requirements <library>../../build/boost_date_time

Modified: boost/trunk/libs/date_time/example/posix_time/Jamfile.v2
===================================================================
--- boost/trunk/libs/date_time/example/posix_time/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/example/posix_time/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright (c) 2002-2005 CrystalClear Software, Inc.
+# Use, modification and distribution is subject to the 
+# Boost Software License, Version 1.0. (See accompanying
+# file LICENSE-1.0 or http://www.boost.org/LICENSE-1.0)
 
 project
     : requirements <library>../../build/boost_date_time

Modified: boost/trunk/libs/date_time/index.html
===================================================================
--- boost/trunk/libs/date_time/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,5 +5,9 @@
 <body>
 Automatic redirection failed, please go to
 <a href="../../doc/html/date_time.html">../../doc/html/date_time.html</a>
+<p>© Copyright CrystalClear Software, 2003</p>
+<p> Use, modification, and distribution are subject to the Boost Software 
+License, Version 1.0. (See accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
+www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
 </html>

Modified: boost/trunk/libs/date_time/src/gregorian/date_generators.cpp
===================================================================
--- boost/trunk/libs/date_time/src/gregorian/date_generators.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/src/gregorian/date_generators.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
  * Boost Software License, Version 1.0. (See accompanying
  * file LICENSE-1.0 or http://www.boost.org/LICENSE-1.0)
  * Author: Jeff Garland, Bart Garst 
- * $Date: 2003/11/23 03:37:47 $
+ * $Date: 2006/07/03 15:19:58 $
  */
 
 
@@ -20,7 +20,7 @@
     "third", "fourth", "fifth"};
     
   //! Returns nth arg as string. 1 -> "first", 2 -> "second", max is 5.
-  BOOST_DATE_TIME_DECL const char* nth_as_str(const int ele)
+  BOOST_DATE_TIME_DECL const char* nth_as_str(int ele)
   {
     if(ele >= 1 || ele <= 5) {
       return _nth_as_str[ele];

Deleted: boost/trunk/libs/date_time/test/Jamfile
===================================================================
--- boost/trunk/libs/date_time/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,245 +0,0 @@
-
-# Testing Jamfile 
-subproject libs/date_time/test ;
-
-# bring in rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-local DATE_TIME_DYNAMIC_PROPERTIES = <define>BOOST_ALL_DYN_LINK <runtime-link>dynamic <define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG <define>BOOST_ALL_NO_LIB ;
-local DATE_TIME_PROPERTIES = <define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG <define>BOOST_DATE_TIME_STATIC_LINK std::locale-support <define>BOOST_ALL_NO_LIB ;
-
-
-{
-  # look in BOOST_ROOT for sources first, just in this Jamfile
-  local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-
-   test-suite date_time_core
-     : 
-    [ run testint_adapter.cpp ]
-    [ run testtime_resolution_traits.cpp ]
-    [ run testwrapping_int.cpp ]
-    [ run testconstrained_value.cpp ]
-    [ run testgregorian_calendar.cpp ]
-    [ run testgeneric_period.cpp ]
-   ; 
-
-   test-suite date_time_gregorian
-     : 
-   [ run gregorian/testdate.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) ]
-   [ run gregorian/testdate_duration.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) ]
-   [ run gregorian/testgreg_durations.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) ]
-   [ run gregorian/testperiod.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) ]
-   [ run gregorian/testdate_iterator.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) ]
-   [ run gregorian/testformatters.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) ]
-###  streaming
-   [ run gregorian/testdate_facet_new.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) ]
-   [ run gregorian/testdate_input_facet.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) ]
-###
-   [ run gregorian/testgenerators.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) ]
-   [ run gregorian/testgreg_cal.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) ]
-   [ run gregorian/testgreg_day.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) ]     
-   [ run gregorian/testgreg_month.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) ]
-   [ run gregorian/testgreg_year.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) ]
- ;
-test-suite date_time_gregorian_dll
-     : 
-   [ run gregorian/testdate.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES) : testdate_dll ]
-   [ run gregorian/testdate_duration.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES) : testdate_duration_dll ]
-   [ run gregorian/testperiod.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES) : testperiod_dll ]
-   [ run gregorian/testdate_iterator.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES) : testdate_iterator_dll ]
-   [ run gregorian/testformatters.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES) : testformatters_dll ]
-###  streaming 
-   [ run gregorian/testdate_facet_new.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES) : testdate_facet_new_dll ]
-   [ run gregorian/testdate_input_facet.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES) : testdate_input_facet_dll ]
-###
-   [ run gregorian/testgenerators.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES) : testgenerators_dll ]
-   [ run gregorian/testgreg_cal.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES) : testgreg_cal_dll ]
-   [ run gregorian/testgreg_day.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES) : testgreg_day_dll ]     
-   [ run gregorian/testgreg_month.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES) : testgreg_month_dll ]
-   [ run gregorian/testgreg_year.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES) : testgreg_year_dll ]
-   [ run gregorian/testgreg_durations.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES) : testgreg_durations_dll ]
-  ;
-
-   test-suite date_time_posixtime
-     : 
-   [ run posix_time/testfiletime_functions.cpp
-     <lib>../build/boost_date_time
-    : : :  $(DATE_TIME_PROPERTIES) ]
-   [ run posix_time/testlocal_adjustor.cpp
-     <lib>../build/boost_date_time
-    : : :  $(DATE_TIME_PROPERTIES) ]
-   [ run posix_time/testc_local_adjustor.cpp
-     <lib>../build/boost_date_time
-    : : :  $(DATE_TIME_PROPERTIES) ]
-   [ run posix_time/testclock.cpp
-     <lib>../build/boost_date_time
-    : : :  $(DATE_TIME_PROPERTIES) ]
-   [ run posix_time/testdst_rules.cpp
-     <lib>../build/boost_date_time
-    : : :  $(DATE_TIME_PROPERTIES) ]
-   [ run posix_time/testduration.cpp
-     <lib>../build/boost_date_time
-    : : :  $(DATE_TIME_PROPERTIES) ]
-   [ run posix_time/testiterator.cpp
-     <lib>../build/boost_date_time
-    : : :  $(DATE_TIME_PROPERTIES) ]
-   [ run posix_time/testparse_time.cpp
-     <lib>../build/boost_date_time 
-    : : :  $(DATE_TIME_PROPERTIES) ]
-   [ run posix_time/testtime_period.cpp
-     <lib>../build/boost_date_time
-    : : :  $(DATE_TIME_PROPERTIES) ]
-   [ run posix_time/testtime.cpp
-     <lib>../build/boost_date_time
-    : : :  $(DATE_TIME_PROPERTIES) ]
-   [ run posix_time/testmicrosec_time_clock.cpp
-     <lib>../build/boost_date_time
-    : : : $(DATE_TIME_PROPERTIES) ]
-   [ run posix_time/testtime_formatters.cpp
-     <lib>../build/boost_date_time
-    : : : $(DATE_TIME_PROPERTIES) ]
-   [ run posix_time/testgreg_duration_operators.cpp
-     <lib>../build/boost_date_time
-    : : :  $(DATE_TIME_PROPERTIES) ]
-### streaming
-   [ run posix_time/testtime_facet.cpp
-     <lib>../build/boost_date_time
-    : : :  $(DATE_TIME_PROPERTIES) ]
-   [ run posix_time/testtime_input_facet.cpp
-     <lib>../build/boost_date_time
-    : : :  $(DATE_TIME_PROPERTIES) ]
-###
-
- ;
-
-
-   test-suite date_time_wide_streaming
-    :
-   [ run gregorian/testgreg_wstream.cpp
-     <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) <define>USE_DATE_TIME_PRE_1_33_FACET_IO : testgreg_wstream ]
-   [ run posix_time/testtime_wstream.cpp
-     <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES) <define>USE_DATE_TIME_PRE_1_33_FACET_IO : testtime_wstream ]
- ;
-
-   test-suite date_time_pre_133_facet 
-    :
-   [ run gregorian/testfacet.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES)  <define>USE_DATE_TIME_PRE_1_33_FACET_IO : testfacet_dll ]
-   # this next test is commented out because it crashes on VC6 (cause unknown):
-#  [ run gregorian/testparse_date.cpp <dll>../build/boost_date_time : : : $(DATE_TIME_DYNAMIC_PROPERTIES)  <define>USE_DATE_TIME_PRE_1_33_FACET_IO : testparse_date_dll ]
-   [ run gregorian/testfacet.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES)  <define>USE_DATE_TIME_PRE_1_33_FACET_IO  ]
-   [ run gregorian/testparse_date.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES)  <define>USE_DATE_TIME_PRE_1_33_FACET_IO ]
-
-   [ run posix_time/teststreams.cpp <lib>../build/boost_date_time : : : $(DATE_TIME_PROPERTIES)  <define>USE_DATE_TIME_PRE_1_33_FACET_IO ]
- ;
-
-local DATE_TIME_PROPERTIES = <define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG <define>BOOST_DATE_TIME_STATIC_LINK std::locale-support <define>BOOST_ALL_NO_LIB ;
-
-   test-suite date_time_localtime
-     : 
-    [ run local_time/testdst_transition_day_rule.cpp
-      <lib>../build/boost_date_time
-     : : : $(DATE_TIME_PROPERTIES) ]
-   [ run local_time/testcustom_time_zone.cpp
-     <lib>../build/boost_date_time
-    : : : $(DATE_TIME_PROPERTIES) ]
-   [ run local_time/testposix_time_zone.cpp
-     <lib>../build/boost_date_time
-    : : : $(DATE_TIME_PROPERTIES) ]
-   [ run local_time/testwcustom_time_zone.cpp
-     <lib>../build/boost_date_time
-    : : : $(DATE_TIME_PROPERTIES) ]
-   [ run local_time/testwposix_time_zone.cpp
-     <lib>../build/boost_date_time
-    : : : $(DATE_TIME_PROPERTIES) ]
-   [ run local_time/testtz_database.cpp
-     <lib>../build/boost_date_time
-    : : : $(DATE_TIME_PROPERTIES) ]
-   [ run local_time/testlocal_time.cpp
-     <lib>../build/boost_date_time
-    : : : $(DATE_TIME_PROPERTIES) ]
-   [ run local_time/testlocal_time_iterator.cpp
-     <lib>../build/boost_date_time
-    : : :  $(DATE_TIME_PROPERTIES) ]
-   [ run local_time/testlocal_time_period.cpp
-     <lib>../build/boost_date_time
-    : : :  $(DATE_TIME_PROPERTIES) ]
-### streaming
-   [ run local_time/testlocal_time_facet.cpp
-     <lib>../build/boost_date_time
-    : : : $(DATE_TIME_PROPERTIES) ]
-   [ run local_time/testlocal_time_input_facet.cpp
-     <lib>../build/boost_date_time
-    : : : $(DATE_TIME_PROPERTIES) ]
-###
-   [ run local_time/testclocks.cpp
-     <lib>../build/boost_date_time
-    : : : $(DATE_TIME_PROPERTIES) ]
- ;
-
-import ../../../libs/serialization/build/serialization ;
-
- local DATE_TIME_PROPERTIES =  <define>BOOST_DATE_TIME_STATIC_LINK <define>BOOST_ALL_NO_LIB  <define>USE_DATE_TIME_PRE_1_33_FACET_IO
-    std::locale-support toolset::require-boost-spirit-support ;
- local DATE_TIME_DYNAMIC_PROPERTIES = <define>BOOST_ALL_DYN_LINK <runtime-link>dynamic <define>USE_DATE_TIME_PRE_1_33_FACET_IO <define>BOOST_ALL_NO_LIB 
-    std::locale-support toolset::require-boost-spirit-support toolset::require-shared-libraries-support ;
-
- test-suite date_time_serialization
-   :
- # xml archive tests
- [ run gregorian/testgreg_serialize.cpp
-   <lib>../build/boost_date_time
-   <lib>@boost/libs/serialization/build/boost_serialization
-   : : : $(DATE_TIME_PROPERTIES)  <define>DATE_TIME_XML_SERIALIZE
-   : testgreg_serialize_xml ]
- [ run posix_time/testtime_serialize.cpp
-   <lib>../build/boost_date_time
-   <lib>@boost/libs/serialization/build/boost_serialization
-   : : : $(DATE_TIME_PROPERTIES)
-<define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG
-<define>DATE_TIME_XML_SERIALIZE
-   : testtime_serialize_xml_std_config ]
- [ run posix_time/testtime_serialize.cpp
-   <lib>../build/boost_date_time
-   <lib>@boost/libs/serialization/build/boost_serialization
-   : : : $(DATE_TIME_PROPERTIES)  <define>DATE_TIME_XML_SERIALIZE
-   : testtime_serialize_xml ]
-
- # text archive tests
- [ run gregorian/testgreg_serialize.cpp
-   <lib>../build/boost_date_time
-   <lib>@boost/libs/serialization/build/boost_serialization
-   : : : $(DATE_TIME_PROPERTIES)
-   : testgreg_serialize ]
- [ run gregorian/testgreg_serialize.cpp
-   <dll>../build/boost_date_time
-   <dll>@boost/libs/serialization/build/boost_serialization
-   : : : $(DATE_TIME_DYNAMIC_PROPERTIES)
-   : testgreg_serialize_dll ]
- [ run posix_time/testtime_serialize.cpp
-   <lib>../build/boost_date_time
-   <lib>@boost/libs/serialization/build/boost_serialization
-   : : : $(DATE_TIME_PROPERTIES)
-<define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG
-   : testtime_serialize_std_config ]
- [ run posix_time/testtime_serialize.cpp
-   <lib>../build/boost_date_time
-   <lib>@boost/libs/serialization/build/boost_serialization
-   : : : $(DATE_TIME_PROPERTIES)
-   : testtime_serialize ]
- ;
-
-
-}
-
-# Copyright (c) 2000-2006
-# CrystalClear Software, Inc.
-# Subject to the Boost Software License, Version 1.0. 
-# (See accompanying file LICENSE-1.0 or 
-# http://www.boost.org/LICENSE-1.0)
-
-
-
-

Modified: boost/trunk/libs/date_time/test/gregorian/testdate_facet_new.cpp
===================================================================
--- boost/trunk/libs/date_time/test/gregorian/testdate_facet_new.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/test/gregorian/testdate_facet_new.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
  * Boost Software License, Version 1.0. (See accompanying
  * file LICENSE-1.0 or http://www.boost.org/LICENSE-1.0)
  * Author: Jeff Garland, Bart Garst
- * $Date: 2005/06/16 13:23:38 $
+ * $Date: 2006/06/12 14:44:27 $
  */
 
 #include "boost/date_time/gregorian/gregorian.hpp"
@@ -112,8 +112,10 @@
     {
       date_facet* datefacet = new date_facet();
       datefacet->format(date_facet::standard_format_specifier);
+      std::cout.imbue(std::locale(std::locale::classic(), datefacet));
       teststreaming("default classic date", d, std::string("10/13/04"),
                     std::locale(std::locale::classic(), datefacet));
+      std::cout << "default classic date output: " << d << std::endl;
     }
     {
       date_facet* datefacet = new date_facet();

Modified: boost/trunk/libs/date_time/test/gregorian/testperiod.cpp
===================================================================
--- boost/trunk/libs/date_time/test/gregorian/testperiod.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/test/gregorian/testperiod.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -50,12 +50,8 @@
   //   std::cout << to_string(p1.begin()) <<"--" 
   //             << to_string(p1.last()) << std::endl;
   check("shift", p1 == shifted);
+  
 
-  //expand the date period  
-  date_period p10(date(2000,Jan,5),date(2000,Jan,8));
-  p10.expand(days(2)); //from 2000-Jan-01--2000-Jan-04
-  check("expand", p10 == date_period(date(2000,Jan,3),date(2000,Jan,10)));
-
   //intersection tests
   date_period i1(date(2000,Jan,5), date(2000,Jan,10));
   date_period i2(date(2000,Jan,1), date(2000,Jan,7));

Modified: boost/trunk/libs/date_time/test/testgeneric_period.cpp
===================================================================
--- boost/trunk/libs/date_time/test/testgeneric_period.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/test/testgeneric_period.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -38,14 +38,7 @@
   return i + dt.get_rep();
 }
 
-//! this operator is needed because period adds a duration_rep to a point_rep
-template<class int_type>
-inline
-int_type operator-(int i, duration_type<int_type> dt){
-  return i - dt.get_rep();
-}
 
-
 int main(){
   using namespace boost::date_time;
   typedef period<int, duration_type<int> > a_period;
@@ -264,18 +257,5 @@
     check("is_null p1 (not)", p1.is_null());
     check("is_null p2 (not)", !p2.is_null());
   }
-
-  {
-    a_period p1(1,2); // length should be 1
-    p1.shift(duration_type<int>(1));
-    a_period p2(2,3); // shifted result
-    check("shift", p1 == p2);
-  }
-  {
-    a_period p1(5,duration_type<int>(3)); 
-    a_period p2(3,10); // expanded result
-    p1.expand(duration_type<int>(2)); //from 2000-Jan-01--2000-Jan-04
-    check("expand", p1 == p2);
-  } 
   return printTestStats();
 }

Modified: boost/trunk/libs/date_time/xmldoc/Jamfile.v2
===================================================================
--- boost/trunk/libs/date_time/xmldoc/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/xmldoc/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright (c) 2002-2006 CrystalClear Software, Inc.
+# Use, modification and distribution is subject to the 
+# Boost Software License, Version 1.0. (See accompanying
+# file LICENSE-1.0 or http://www.boost.org/LICENSE-1.0)
+#
 
 import boostbook : boostbook ;
 import toolset ;

Modified: boost/trunk/libs/date_time/xmldoc/README
===================================================================
--- boost/trunk/libs/date_time/xmldoc/README	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/xmldoc/README	2007-02-16 16:48:35 UTC (rev 14035)
@@ -31,3 +31,8 @@
 
 If you use '<link linkend="top">top</link>' the link will automatically
 go to the top of the page it ends up in.
+
+# Copyright (c) 2002-2006 CrystalClear Software, Inc.
+# Use, modification and distribution is subject to the 
+# Boost Software License, Version 1.0. (See accompanying
+# file LICENSE-1.0 or http://www.boost.org/LICENSE-1.0)

Modified: boost/trunk/libs/date_time/xmldoc/buildinfo.xml
===================================================================
--- boost/trunk/libs/date_time/xmldoc/buildinfo.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/xmldoc/buildinfo.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,7 +21,7 @@
   <anchor id="overview" />
   <bridgehead renderas="sect3">Overview</bridgehead>
   <para>
-    The library has several functions that require the creation of a library file. The Jamfile in the build directory will produce a "static" library (libboost_date_time) and a "dynamic/shared" library (boost_date_time) that contains these functions. 
+    The library has a few functions that require the creation of a library file (mostly to_string, from_string functions).  Most library users can make effective use of the library WITHOUT building the library, but simply including the required headers. If the library is needed, the Jamfile in the build directory will produce a "static" library (libboost_date_time) and a "dynamic/shared" library (boost_date_time) that contains these functions. 
   </para>
   
   <anchor id="compile_options" />
@@ -41,31 +41,64 @@
   <anchor id="portability" />
   <bridgehead renderas="sect3">Compiler/Portability Notes</bridgehead>
   <para>
-    The Boost Date-Time library has been built and tested with many compilers. However, some compilers and standard libraries have issues. While some of these issues can be worked around, others are difficult to work around. The following compilers fully support all aspects of the library:
+    The Boost Date-Time library has been built and tested with many compilers and platforms. However, some compilers and standard libraries have issues. While some of these issues can be worked around, others are difficult to work around. The following compilers are known to fully support all aspects of the library:
     <itemizedlist mark="bullet">
-      <listitem>GCC 3.2 - 3.4, 4.0 on Linux</listitem>
-      <listitem>GCC 3.3 on Darwin</listitem>
-      <listitem>GCC 3.3 on Solaris</listitem>
+      <listitem>Codewarrior 9.4 Windows</listitem>
+      <listitem>GCC 3.2 - 3.4, 4.x on Linux</listitem>
+      <listitem>GCC 3.3, 4.x on Darwin</listitem>
+      <listitem>GCC 3.3 - 3.4, 4.x on Solaris</listitem>
+      <listitem>GCC 3.3, 4.x  on HP-UX</listitem>
+      <listitem>QCC 3.3.5 on QNX</listitem>
+      <listitem>MSVC 7.1 Windows </listitem>
+      <listitem>Intel 8.1-9.x Linux and Windows</listitem>
+    </itemizedlist>
+  </para>
+
+  <para>
+     Unfortunately, the VC8 compiler has some issues with date-time code.  
+     The most serious issue is a memory leak which was introduced into the
+     VC8 standard library basic_stream code.  Date-time has code has been changed
+     to avoid this as much as possible, but if you are using the legacy IO option 
+     (NOT the default with VC8) then the issue can still arise.  See the
+
+     <ulink url="http://lists.boost.org/Archives/boost/2006/02/101122.php">mailing list archive</ulink> for more details.
+  </para>
+
+  <para>
+     In addition to the problem above, some versions of the VC8 library have limited 
+     the range of allowed 
+     values in the <code>std::tm</code> structure to positive values.  This was a new 
+     restriction added in the VC8.  The effect is that dates prior to the year
+     1900 will cause exceptions.  There is, unfortunately, no easy workaround for 
+     this issue.  Note that the new 64bit version of the VC8 compiler
+     does not appear to have this limitation.  
+  </para>
+
+  <para>
+    These compilers support all aspects of the library except <code>wstring/wstream</code> 
+    output.
+    <itemizedlist mark="bullet">
+      <listitem>MinGW 3.2, 3.4, 3.5 *</listitem>
       <listitem>GCC 3.2 (cygwin) *</listitem>
-      <listitem>MinGW 3.2 *</listitem>
-      <listitem>MSVC 7.1 </listitem>
-      <listitem>Intel 8.1 Linux and Windows</listitem>
     </itemizedlist>
-    * These compilers do not support the <code>wstring/wstream</code> aspects of the <code>date_time</code> library.
   </para>
+
   <para>
     In particular, a lack of support for standard locales limits the ability of the library to support iostream based input output. For these compilers a set of more limited string based input-output is provided. Some compilers/standard libraries with this limitation include: 
     <itemizedlist mark="bullet">
-      <listitem>GCC 2.9x on Linux</listitem>
-      <listitem>Borland 5.1.1 and 5.6</listitem>
-      <listitem>MSVC 7.0</listitem>
-      <listitem>MSVC 6 SP5 </listitem>
+      <listitem>Borland 5.6</listitem>
     </itemizedlist>
   </para>
+
   <para>
-  Metrowerks Code Warrior 9.4 has some input I/O limitations, but is otherwise
-  fully supported.
+    Official support for some older compilers has now been dropped.  This includes:
+    <itemizedlist mark="bullet">
+      <listitem>GCC 2.9x</listitem>
+      <listitem>Borland 5.1.1</listitem>
+      <listitem>MSVC 7.0 and 6 SP5 </listitem>
+    </itemizedlist>
   </para>
+
   <bridgehead renderas="sect5">Visual Studio &amp; STLPort</bridgehead>
   <para>There is a known issue with Visual Studio (7.0 &amp; 7.1) and STLPort. The build errors typically make reference to a type issue or 'no acceptable conversion' and are attempting to instantiate a template with <code>wchar_t</code>. The default build of STLPort does not support <code>wchar_t</code>. There are two possible workarounds for this issue. The simplest is the user can build date_time with no wide stream/string etc. The other is to rebuild STLPort with wchar_t support.
   </para>
@@ -110,10 +143,11 @@
       <listitem><ulink url="../../libs/tokenizer/index.html">boost.tokenizer</ulink> </listitem>
       <listitem><ulink url="../../libs/integer/cstdint.htm">boost.integer(cstdint)</ulink> </listitem>
       <listitem><ulink url="../../libs/utility/operators.htm">boost.operators</ulink> </listitem>
-      <listitem><ulink url="../../libs/conversion/lexical_cast.htm">boost::lexical_cast </ulink> </listitem>
-      <listitem><ulink url="../../libs/smart_ptr/smart_ptr.htm">boost::smart_ptr </ulink> </listitem>
+      <listitem><ulink url="../../libs/conversion/lexical_cast.htm">boost.lexical_cast </ulink> </listitem>
+      <listitem><ulink url="../../libs/smart_ptr/smart_ptr.htm">boost.smart_ptr (local time only)</ulink> </listitem>
       <listitem><ulink url="../../libs/algorithm/string/">boost::string_algorithms </ulink> </listitem>
+      <listitem><ulink url="../../libs/algorithm/serialize/">boost::serialize (serialization code only) </ulink> </listitem>
     </itemizedlist>
-    so at least these libraries need to be installed. 
+    so these libraries need to be installed. 
   </para>
 </section>

Modified: boost/trunk/libs/date_time/xmldoc/changes.xml
===================================================================
--- boost/trunk/libs/date_time/xmldoc/changes.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/xmldoc/changes.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN" 
 "../../../tools/boostbook/dtd/boostbook.dtd">
 
-<!-- Copyright (c) 2001-2005 CrystalClear Software, Inc.
+<!-- Copyright (c) 2001-2006 CrystalClear Software, Inc.
      Subject to the Boost Software License, Version 1.0. 
      (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
 -->
@@ -12,6 +12,70 @@
   
   <!-- if each new change tgroup has a "Bug Fix" as the first "Type", the columns will line up nicely -->
 
+  <bridgehead renderas="sect3">Changes from Boost 1.33 to 1.34 (date_time 1.04 to 1.05)</bridgehead>
+  <informaltable frame="all">
+    <tgroup cols="2">
+      <thead>
+	<row>
+	  <entry>Type</entry>
+	  <entry>Description</entry>
+	</row>
+      </thead>
+      <tbody>
+        <row>
+          <entry>Bug Fix</entry>
+          <entry>Fix a problem with potential linking error with multiple definitions due
+                 to I/O code.
+          </entry>
+        </row>
+
+        <row>
+          <entry>Bug Fix</entry>
+          <entry>Fix regression errors that showed up under FreeBSD with GCC and the 
+                 LANG environment set to russian -- changed parser to use classic 
+                 locale instead of blank locale.
+          </entry>
+        </row>
+
+        <row>
+          <entry>Bug Fix</entry>
+          <entry>Changes for tracker issue 1178092 -- change in convert_to_lower to make 
+                 local a const static and speed up parsing.
+          </entry>
+        </row>
+
+        <row>
+          <entry>Bug Fix</entry>
+          <entry>Patches from Ulrich Eckhardt to fix support for EVC++ 4.
+          </entry>
+        </row>
+
+        <row>
+          <entry>Feature</entry>
+          <entry>Reduce the usage of basic_stringstream as much a possible to work around 
+                 a bug in the VC8 standard library. See 
+                 <ulink url="http://lists.boost.org/Archives/boost/2006/02/101122.php">mailing list archive</ulink> 
+                 for more information.
+          </entry>
+        </row>
+
+        <row>
+          <entry>Bug Fix</entry>
+          <entry>
+          </entry>
+        </row>
+
+        <row>
+          <entry>Bug Fix</entry>
+          <entry>
+          </entry>
+        </row>
+
+      </tbody>
+    </tgroup>
+  </informaltable>
+
+
   <bridgehead renderas="sect3">Changes from Boost 1.32 to 1.33 (date_time 1.03 to 1.04)</bridgehead>
   <informaltable frame="all">
     <tgroup cols="2">

Modified: boost/trunk/libs/date_time/xmldoc/date_class.xml
===================================================================
--- boost/trunk/libs/date_time/xmldoc/date_class.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/xmldoc/date_class.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -39,7 +39,7 @@
   </para>
 
   <para>
-    The construction of a date ensures validates all input such that it is not possible to
+    The construction of a date validates all input so that it is not possible to
     construct and 'invalid' date.  That is 2001-Feb-29 cannot be constructed as a date. 
     Various exceptions derived from std::out_of_range are thrown to indicate which aspect 
     of the date input is invalid.  Note that the

Modified: boost/trunk/libs/date_time/xmldoc/date_time_docs_howto.html
===================================================================
--- boost/trunk/libs/date_time/xmldoc/date_time_docs_howto.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/xmldoc/date_time_docs_howto.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -27,12 +27,12 @@
     <li><A href="#xsl_mods">Making further changes to the date_time_fo_stylesheet</A></li>
   </ol>
   <hr>
-  <A name="exclusive_html"><h3>Building Exclusive Date Time HTML Documentation</h3></A>
+  <h3><a name="exclusive_html">Building Exclusive Date Time HTML Documentation</a></h3>
   <p>No modifications are necessary to build an exclusive set of date time html documentation. Simply run bjam:<br>
   <div class="screen">bjam --v2 date_time_doc</div><br>
-  The resulting html can be found in <font class="fname">xmldoc/html</font>. NOTE: the stylesheet may not be present. It can be copied from the <font class="fname">$BOOST_ROOT/doc/html</font> directory.</p>
+  The resulting html can be found in <font class="fname">xmldoc/html</font>. NOTE: the stylesheet may not be present. It can be copied from the <font class="fname">$BOOST_ROOT/doc/html</font> directory.<br />
   <hr>
-  <a name="exclusive_pdf"><h3>Building Exclusive Date Time PDF</h3></a>
+  <h3><a name="exclusive_pdf">Building Exclusive Date Time PDF</a></h3>
   <p><strong>Prerequisite:</strong> bjam must be able to build documentation for 'fo' output (necessary aditions must have been added to <font class="fname">user-config.jam</font>).</p>
 
   <p>Necessary modifications to build the date time pdf are:
@@ -51,10 +51,10 @@
     <div class="screen">bjam --v2 date_time_doc fo</div></li>
     <li>Build the pdf.<div class="screen">fop ../../../bin.v2/libs/date_time/.../exclusive_date_time.fo date_time.pdf</div></li>
   </ol>
-  </p>
+  <br />
 					<p><strong>BUILD ERRORS:</strong> During the fo->pdf step, an error stating that an id already exists may appear. This error appears to be introduced during the xml->fo step. There are two possible workarounds for this (depending on where the duplicated id apears). If the duplicate id appears in the reference section, find the offending id and change it manually (ex: "id2534038" -> "id2534039"). If the id appears in the documentation generated from the xml, change one of the anchor names in one of the xml files. <strong>Note:</strong> This does not mean there is an error in the xml. The anchor and link that is known to have an effect is <font class="fname">date_input_facet_intro</font> (change the 'd' to a 'f', or back, should do the trick).</p>
   <hr>
-  <a name="doxy_ref"><h3>Generating Date Time Doxygen Reference</h3></a>
+  <h3><a name="doxy_ref">Generating Date Time Doxygen Reference</a></h3>
   <p>Each doxygen reference file must be built, copied, and modified seperately. The steps to build all four <font class="fname">*.boostbook</font> reference files are:
   <ol>
     <li>Generate the <font class="fname">*.boostbook</font> files.</li>
@@ -68,15 +68,18 @@
           local_time_autodoc
 cp ../../../bin.v2/libs/.../*.boostbook .
 ./ref_tag_fix.pl</pre></div>
-    </p>
+    <br />
     <hr>
-    <a name="xsl_mods"><h3>Making further changes to the date_time_fo_stylesheet</h3></a>
+    <h3><a name="xsl_mods">Making further changes to the date_time_fo_stylesheet</a></h3>
     <p>The stylesheet currently sets the left, right, and bottom margins. It also reduces the font-size for table cells that have the &#060;screen&#062; tags in them. The font-size reduction is accomplished by breaking the entire string (between the &#060;screen&#062; tags) into segments delimited by '\n'. Each of these segment's lengths are checked and the longest segment is used in calculating the amount of font-size reduction.</p>
     <p>There are two variables used in adjusting the font-size: <font class="fname">char-per-cell</font> &#038; <font class="fname">min-reduction</font>. These hold the number of characters that can fit into a cell and the minimum percentage of reduction allowed (expressed as an integer).</p>
     <p>Determining the number of characters that will fit into a cell is not the most gracefull of operations. Simply put, the minimum reduction must be set to 100 (no reduction allowed) and the pdf must be built. From there the number of characters that will fit must be manually counted.</p>
     <hr>
     <div><p class="copyright">Copyright &#169; 2001-2005 CrystalClear Software, Inc</p></div>
     <div class="legalnotice">
-      <p>Subject to the Boost Software License, Version 1.0. <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</ahref="http://www.boost.org/LICENSE_1_0.txt"></p></div>
+		<p>Distributed under the Boost Software License, Version 1.0.
+       (See accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+        copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
+    </div>
   </body>
 </html>

Modified: boost/trunk/libs/date_time/xmldoc/exclusive_date_time.xml
===================================================================
--- boost/trunk/libs/date_time/xmldoc/exclusive_date_time.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/xmldoc/exclusive_date_time.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE boostbook PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
+
+<!-- Copyright (c) 2001-2006 CrystalClear Software, Inc.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
+
 <boostbook xmlns:xi="http://www.w3.org/2001/XInclude"
-           last-revision="$Date: 2005/05/08 18:55:39 $">
+           last-revision="$Date: 2006/07/20 15:54:33 $">
     <title>The Boost Date Time Library</title>
    <xi:include href="./date_time.xml"/>
 </boostbook>

Modified: boost/trunk/libs/date_time/xmldoc/license.xml
===================================================================
--- boost/trunk/libs/date_time/xmldoc/license.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/xmldoc/license.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 <?xml version="1.0" encoding="utf-8"?>
 
+<!-- Copyright (c) 2001-2006 CrystalClear Software, Inc.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
 <section id="date_time.license">
   <title>Boost Date-Time Library License</title>
   <bridgehead renderas="sect2">Boost Date-Time Library License</bridgehead>

Modified: boost/trunk/libs/date_time/xmldoc/motivation.xml
===================================================================
--- boost/trunk/libs/date_time/xmldoc/motivation.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/xmldoc/motivation.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 <?xml version="1.0" encoding="utf-8"?>
 
+<!-- Copyright (c) 2001-2006 CrystalClear Software, Inc.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
 <section id="Motivation">
   <title>Motivation</title>
 

Modified: boost/trunk/libs/date_time/xmldoc/usage_examples.xml
===================================================================
--- boost/trunk/libs/date_time/xmldoc/usage_examples.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/date_time/xmldoc/usage_examples.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,8 +16,8 @@
     for more details.
 
     <programlisting><emphasis role="keyword">using namespace</emphasis> boost::gregorian;
-    date weekstart(<emphasis role="number">2002</emphasis>,Feb,<emphasis role="number">1</emphasis>);
-    date weekend  = weekstart + week(<emphasis role="number">1</emphasis>);
+    date week_start(<emphasis role="number">2002</emphasis>,Feb,<emphasis role="number">1</emphasis>);
+    date week_finish  = week_start + week(<emphasis role="number">1</emphasis>);
     date d2 = d1 + days(<emphasis role="number">5</emphasis>);
     date today = day_clock::local_day();
     if (d2 &gt;= today) {} <emphasis role="comment">//date comparison operators</emphasis> 
@@ -26,8 +26,8 @@
     <emphasis role="keyword">if</emphasis> (thisWeek.contains(today)) {}<emphasis role="comment">//do something 
 
     //iterate and print the week</emphasis>
-    day_iterator itr(weekstart);
-    <emphasis role="keyword">while</emphasis> (itr &lt;= weekend) {
+    day_iterator itr(week_start);
+    <emphasis role="keyword">while</emphasis> (itr &lt;= week_finish) {
      std::cout &lt;&lt; (*itr) &lt;&lt; std::endl;
      ++itr;
     }  

Deleted: boost/trunk/libs/disjoint_sets/Jamfile
===================================================================
--- boost/trunk/libs/disjoint_sets/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/disjoint_sets/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-subproject libs/dynamic_bitset ;
-
-unit-test disjoint_set_test
-    : disjoint_set_test.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-

Modified: boost/trunk/libs/disjoint_sets/bibliography.html
===================================================================
--- boost/trunk/libs/disjoint_sets/bibliography.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/disjoint_sets/bibliography.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,51 +1,59 @@
-<HTML>
-<!--
-  -- Copyright (c) Jeremy Siek 2000
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
-<Head>
-<Title>Boost Utility Library: Bibliography</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
-	ALINK="#ff0000"> 
-<IMG SRC="../../boost.png" 
-     ALT="C++ Boost" width="277" height="86"> 
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
-<BR Clear>
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
+  <title>Boost Utility Library: Bibliography</title>
+</head>
 
-<H2>Bibliography</H2>
+<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
+"#FF0000">
+  <img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br clear="none">
 
-<DL COMPACT>
+  <h2>Bibliography</h2>
 
-<P></P><DT><A NAME="tarjan83:_data_struct_network_algo">1</A>
-<DD>
-R.&nbsp;E. Tarjan.
-<BR><EM>Data Structures and Network Algorithms</EM>.
-<BR>Society for Industrial and Applied Mathematics, 1983.
+  <dl compact>
+    <dt><a name="tarjan83:_data_struct_network_algo" id=
+    "tarjan83:_data_struct_network_algo">1</a></dt>
 
-<P></P><DT><A NAME="clr90">2</A>
-<DD>
-T.&nbsp;Cormen, C.&nbsp;Leiserson, and R.&nbsp;Rivest.
-<BR><EM>Introduction to Algorithms</EM>.
-<BR>McGraw-Hill, 1990.
+    <dd>R.&nbsp;E. Tarjan.<br>
+    <em>Data Structures and Network Algorithms</em>.<br>
+    Society for Industrial and Applied Mathematics, 1983.</dd>
 
+    <dt>&nbsp;</dt>
 
-</DL>
+    <dt><a name="clr90" id="clr90">2</a></dt>
 
-<br>
-<HR>
-<TABLE>
-<TR valign=top>
-<TD nowrap>Copyright &copy 2000</TD><TD>
-<a HREF="../../people/jeremy_siek.htm">Jeremy Siek</a>, Univ.of Notre Dame (<A HREF="mailto:jsiek at lsc.nd.edu">jsiek at lsc.nd.edu</A>)
-</TD></TR></TABLE>
+    <dd>T.&nbsp;Cormen, C.&nbsp;Leiserson, and R.&nbsp;Rivest.<br>
+    <em>Introduction to Algorithms</em>.<br>
+    McGraw-Hill, 1990.</dd>
+  </dl><br>
+  <hr>
 
-</BODY>
-</HTML> 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->01
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38508" --></p>
+
+  <table summary="">
+    <tr valign="top">
+      <td nowrap><i>Copyright &copy; 2000</i></td>
+
+      <td><i><a href="../../people/jeremy_siek.htm">Jeremy Siek</a>, Univ.of
+      Notre Dame (<a href=
+      "mailto:jsiek at lsc.nd.edu">jsiek at lsc.nd.edu</a>)</i></td>
+    </tr>
+  </table>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/disjoint_sets/disjoint_sets.html
===================================================================
--- boost/trunk/libs/disjoint_sets/disjoint_sets.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/disjoint_sets/disjoint_sets.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,89 +1,76 @@
-<HTML>
-<!--
-  -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
-<Head>
-<Title>Boost Disjoint Sets</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
-	ALINK="#ff0000"> 
-<IMG SRC="../../boost.png" 
-     ALT="C++ Boost" width="277" height="86"> 
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
-<BR Clear>
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
+  <title>Boost Disjoint Sets</title>
+</head>
 
-<H1><A NAME="sec:disjoint-sets"></A>
-Disjoint Sets
-</H1>
+<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
+"#FF0000">
+  <img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br clear="none">
 
-<P>
-
-<H2>
-</h2>
-<PRE>
+  <h1><a name="sec:disjoint-sets" id="sec:disjoint-sets"></a> Disjoint
+  Sets</h1>
+  <pre>
 disjoint_sets&lt;Rank, Parent, FindCompress&gt;
-</PRE>
+</pre>
 
-<P>
-This is class that provides disjoint sets operations with <I>union by
-rank</I> and <I>path compression</I>. A disjoint-sets data structure
-maintains a collection <i>S = {S<sub>1</sub>, S<sub>2</sub>, ...,
-S<sub>k</sub>}</i> of disjoint sets. Each set is identified by a
-<I>representative</I> which is some member of of the set. Sets are
-represented by rooted trees which are encoded in the <TT>Parent</TT>
-property map. Two heuristics: &quot;union by rank&quot; and
-&quot;path compression&quot; are used to speed up the
-operations&nbsp;[<a
-href="./bibliography.html#tarjan83:_data_struct_network_algo">1</a>, <a
-href="./bibliography.html#clr90">2</a>].
+  <p>This is class that provides disjoint sets operations with <i>union by
+  rank</i> and <i>path compression</i>. A disjoint-sets data structure
+  maintains a collection <i>S = {S<sub>1</sub>, S<sub>2</sub>, ...,
+  S<sub>k</sub>}</i> of disjoint sets. Each set is identified by a
+  <i>representative</i> which is some member of of the set. Sets are
+  represented by rooted trees which are encoded in the <tt>Parent</tt>
+  property map. Two heuristics: "union by rank" and "path compression" are
+  used to speed up the operations&nbsp;[<a href=
+  "./bibliography.html#tarjan83:_data_struct_network_algo">1</a>, <a href=
+  "./bibliography.html#clr90">2</a>].</p>
 
-<P>
+  <h3>Where Defined</h3><a href=
+  "../../boost/pending/disjoint_sets.hpp"><tt>boost/disjoint_sets.hpp</tt></a>
 
-<h3>Where Defined</h3>
+  <h3>Template Parameters</h3>
 
-<a href="../../boost/pending/disjoint_sets.hpp"><tt>boost/disjoint_sets.hpp</tt></a>
+  <table border summary="">
+    <tr>
+      <td><tt>Rank</tt></td>
 
-<H3>Template Parameters</H3>
+      <td>must be a model of <a href=
+      "../property_map/ReadWritePropertyMap.html">ReadWritePropertyMap</a>
+      with an integer value type and a key type equal to the set's element
+      type.</td>
+    </tr>
 
-<P>
-<TABLE border>
-<TR><TD><TT>Rank</TT></TD> <TD>must be a model of <a
-href="../property_map/ReadWritePropertyMap.html">ReadWritePropertyMap</a>
-with an integer value type and a key type equal to the set's element
-type.</TD>
-</TR>
-<TR><TD><TT>Parent</TT></TD> <TD>must be a model of <a
-href="../property_map/ReadWritePropertyMap.html">ReadWritePropertyMap</a>
-and the key and value type the same as the set's element type.</TD>
-</TR>
-<TR><TD><TT>FindCompress</TT></TD>
-<TD>should be one of the find representative and
-   path compress function objects.</TD>
-</TR>
-</TABLE>
-<P>
+    <tr>
+      <td><tt>Parent</tt></td>
 
-<H3>Example</H3>
+      <td>must be a model of <a href=
+      "../property_map/ReadWritePropertyMap.html">ReadWritePropertyMap</a>
+      and the key and value type the same as the set's element type.</td>
+    </tr>
 
-<P>
-A typical usage pattern for <TT>disjoint_sets</TT> can be seen in the
-<a
-href="../graph/doc/kruskal_min_spanning_tree.html"><TT>kruskal_minimum_spanning_tree()</TT></a>
-algorithm.  In this example, we call <TT>link()</TT> instead of
-<TT>union_set()</TT> because <TT>u</TT> and <TT>v</TT> were obtained
-from <TT>find_set()</TT> and therefore are already the representatives
-for their sets.
+    <tr>
+      <td><tt>FindCompress</tt></td>
 
-<P>
-<PRE>
+      <td>should be one of the find representative and path compress function
+      objects.</td>
+    </tr>
+  </table>
+
+  <h3>Example</h3>
+
+  <p>A typical usage pattern for <tt>disjoint_sets</tt> can be seen in the
+  <a href=
+  "../graph/doc/kruskal_min_spanning_tree.html"><tt>kruskal_minimum_spanning_tree()</tt></a>
+  algorithm. In this example, we call <tt>link()</tt> instead of
+  <tt>union_set()</tt> because <tt>u</tt> and <tt>v</tt> were obtained from
+  <tt>find_set()</tt> and therefore are already the representatives for their
+  sets.</p>
+  <pre>
   ...
   disjoint_sets&lt;Rank, Parent, FindCompress&gt; dsets(rank, p);
   
@@ -100,269 +87,223 @@
       dsets.link(u, v);
     }
   }
-</PRE>
+</pre>
 
-<P>
+  <h3>Members</h3>
 
-<H3>Members</H3>
+  <table border summary="">
+    <tr>
+      <th>Member</th>
 
-<P>
+      <th>Description</th>
+    </tr>
 
-<table border>
-<tr>
-<th>Member</th><th>Description</th>
-</tr>
+    <tr>
+      <td><tt>disjoint_sets(Rank r, Parent p)</tt></td>
 
-<tr> 
-<td><tt>
-disjoint_sets(Rank r, Parent p)
-</tt></td>
-<td>
-Constructor.
-</td>
-</tr>
+      <td>Constructor.</td>
+    </tr>
 
-<tr>
-<td><tt>
-disjoint_sets(const disjoint_sets&amp; x)
-</tt></td>
-<td>
-Copy constructor.
-</td>
-</tr>
+    <tr>
+      <td><tt>disjoint_sets(const disjoint_sets&amp; x)</tt></td>
 
-<tr>
-<td><tt>
-template &lt;class Element&gt;<br>
-void make_set(Element x)
-</tt></td>
-<td>
-Creates a singleton set containing Element <TT>x</TT>.
-</td>
-</tr>
+      <td>Copy constructor.</td>
+    </tr>
 
-<tr>
-<td><tt>
-template &lt;class Element&gt;<br>
-void link(Element x, Element y)
-</tt></td>
-<td>
-Union the two sets <I>represented</I> by element <TT>x</TT> and <TT>y</TT>.
-</td>
-</tr>
+    <tr>
+      <td><tt>template &lt;class Element&gt;<br>
+      void make_set(Element x)</tt></td>
 
-<tr>
-<td><tt>
-template &lt;class Element&gt;<br>
-void union_set(Element x, Element y)
-</tt></td>
-<td>
-Union the two sets that <I>contain</I> elements <TT>x</TT> and <TT>y</TT>.
-This is equivalent to <TT>link(find_set(x),find_set(y))</TT>.
-</td>
-</tr>
+      <td>Creates a singleton set containing Element <tt>x</tt>.</td>
+    </tr>
 
-<tr>
-<td><tt>
-template &lt;class Element&gt;<br>
-Element find_set(Element x)
-</tt></td>
-<td>
-Return the representative for the set containing element <TT>x</TT>.
-</td>
-</tr>
+    <tr>
+      <td><tt>template &lt;class Element&gt;<br>
+      void link(Element x, Element y)</tt></td>
 
-<tr>
-<td><tt>
-template &lt;class ElementIterator&gt;<br>
-std::size_t count_sets(ElementIterator first, ElementIterator last)
-</tt></td>
-<td>
-Returns the number of disjoint sets.
-</td>
-</tr>
+      <td>Union the two sets <i>represented</i> by element <tt>x</tt> and
+      <tt>y</tt>.</td>
+    </tr>
 
-<tr>
-<td><tt>
-template &lt;class ElementIterator&gt;<br>
-void compress_sets(ElementIterator first, ElementIterator last)
-</tt></td>
-<td>
-Flatten the parents tree so that the parent of every element is
-its representative.
-</td>
-</tr>
+    <tr>
+      <td><tt>template &lt;class Element&gt;<br>
+      void union_set(Element x, Element y)</tt></td>
 
-</table>
+      <td>Union the two sets that <i>contain</i> elements <tt>x</tt> and
+      <tt>y</tt>. This is equivalent to
+      <tt>link(find_set(x),find_set(y))</tt>.</td>
+    </tr>
 
-<p>
+    <tr>
+      <td><tt>template &lt;class Element&gt;<br>
+      Element find_set(Element x)</tt></td>
 
-<H3>Complexity</H3>
+      <td>Return the representative for the set containing element
+      <tt>x</tt>.</td>
+    </tr>
 
-<P>
-The time complexity is <i>O(m alpha(m,n))</i>, where <i>alpha</i> is
-the inverse Ackermann's function, <i>m</i> is the number of
-disjoint-set operations (<TT>make_set()</TT>, <TT>find_set()</TT>, and
-<TT>link()</TT> and <i>n</i> is the number of elements. The
-<i>alpha</i> function grows very slowly, much more slowly than the
-<i>log</i> function.
+    <tr>
+      <td><tt>template &lt;class ElementIterator&gt;<br>
+      std::size_t count_sets(ElementIterator first, ElementIterator
+      last)</tt></td>
 
-<P>
+      <td>Returns the number of disjoint sets.</td>
+    </tr>
 
-<h3>See Also</h3>
+    <tr>
+      <td><tt>template &lt;class ElementIterator&gt;<br>
+      void compress_sets(ElementIterator first, ElementIterator
+      last)</tt></td>
 
-<a href="../graph/doc/incremental_components.html"><tt>incremental_connected_components()</tt></a>
+      <td>Flatten the parents tree so that the parent of every element is its
+      representative.</td>
+    </tr>
+  </table>
 
+  <h3>Complexity</h3>
 
-<hr>
+  <p>The time complexity is <i>O(m alpha(m,n))</i>, where <i>alpha</i> is the
+  inverse Ackermann's function, <i>m</i> is the number of disjoint-set
+  operations (<tt>make_set()</tt>, <tt>find_set()</tt>, and <tt>link()</tt>
+  and <i>n</i> is the number of elements. The <i>alpha</i> function grows
+  very slowly, much more slowly than the <i>log</i> function.</p>
 
-<H2>
-</h2>
-<PRE>
+  <h3>See Also</h3><a href=
+  "../graph/doc/incremental_components.html"><tt>incremental_connected_components()</tt></a>
+  <hr>
+  <pre>
 disjoint_sets_with_storage&lt;ID,InverseID,FindCompress&gt;
-</PRE>
+</pre>
 
-<P>
-This class manages the storage for the rank and parent properties
-internally. The storage is in arrays, which are indexed by element ID,
-hence the requirement for the <TT>ID</TT> and <TT>InverseID</TT>
-functors.  The rank and parent properties are initialized during
-construction so the each element is in a set by itself (so it is not
-necessary to initialize objects of this class with the <a
-href="../graph/doc/incremental_components.html#sec:initialize-incremental-components"><TT>initialize_incremental_components()</TT></a>
-function). This class is especially useful when computing the
-(dynamic) connected components of an <TT>edge_list</TT> graph which
-does not provide a place to store vertex properties.
+  <p>This class manages the storage for the rank and parent properties
+  internally. The storage is in arrays, which are indexed by element ID,
+  hence the requirement for the <tt>ID</tt> and <tt>InverseID</tt> functors.
+  The rank and parent properties are initialized during construction so the
+  each element is in a set by itself (so it is not necessary to initialize
+  objects of this class with the <a href=
+  "../graph/doc/incremental_components.html#sec:initialize-incremental-components">
+  <tt>initialize_incremental_components()</tt></a> function). This class is
+  especially useful when computing the (dynamic) connected components of an
+  <tt>edge_list</tt> graph which does not provide a place to store vertex
+  properties.</p>
 
-<P>
+  <h3>Template Parameters</h3>
 
-<H3>Template Parameters</H3>
+  <table border summary="">
+    <tr>
+      <th>Parameter</th>
 
-<TABLE border>
-<TR>
-<th>Parameter</th><th>Description</th><th>Default</th>
-</tr>
+      <th>Description</th>
 
-<TR>
-<TD><TT>ID</TT></TD>
-<TD>must be a model of <a href="../property_map/ReadablePropertyMap.html">ReadablePropertyMap</a>
- that maps elements to integers between zero 0 and N, the total
- number of elements in the sets.</TD>
-<TD><TT>boost::identity_property_map</TT></TD>
-</TR>
+      <th>Default</th>
+    </tr>
 
-<TR>
-<TD><TT>InverseID</TT></TD>
-<TD>must be a model of <a href="../property_map/ReadablePropertyMap.html">ReadablePropertyMap</a> that maps integers to elements.</TD>
-<TD><TT>boost::identity_property_map</TT></TD>
-</TR>
+    <tr>
+      <td><tt>ID</tt></td>
 
-<TR><TD><TT>FindCompress</TT></TD>
-<TD>should be one of the find representative and
-   path compress function objects.</TD>
-<TD><TT>representative_with_full_path_compression</TT></TD>
-</TR>
+      <td>must be a model of <a href=
+      "../property_map/ReadablePropertyMap.html">ReadablePropertyMap</a> that
+      maps elements to integers between zero 0 and N, the total number of
+      elements in the sets.</td>
 
-</TABLE>
-<P>
+      <td><tt>boost::identity_property_map</tt></td>
+    </tr>
 
-<H3>Members</H3>
+    <tr>
+      <td><tt>InverseID</tt></td>
 
-<P>
-This class has all of the members in <TT>disjoint_sets</TT> as well as
-the following members.
+      <td>must be a model of <a href=
+      "../property_map/ReadablePropertyMap.html">ReadablePropertyMap</a> that
+      maps integers to elements.</td>
 
-<P>
- 
-<P> <P>
- <PRE>
+      <td><tt>boost::identity_property_map</tt></td>
+    </tr>
+
+    <tr>
+      <td><tt>FindCompress</tt></td>
+
+      <td>should be one of the find representative and path compress function
+      objects.</td>
+
+      <td><tt>representative_with_full_path_compression</tt></td>
+    </tr>
+  </table>
+
+  <h3>Members</h3>
+
+  <p>This class has all of the members in <tt>disjoint_sets</tt> as well as
+  the following members.</p>
+  <pre>
 disjoint_sets_with_storage(size_type n = 0,
                            ID id = ID(),
                            InverseID inv = InverseID())
-</PRE>
-Constructor.
-<P>
-
-<P> <P>
- <PRE>
+</pre>Constructor.
+  <pre>
 template &lt;class ElementIterator&gt;
 void disjoint_sets_with_storage::
   normalize_sets(ElementIterator first, ElementIterator last)
-</PRE>
-This rearranges the representatives such that the representative
-of each set is the element with the smallest ID.  
-<BR>
-Postcondition: <TT>v &gt;= parent[v]</TT> 
-<BR>
-Precondition: the disjoint sets structure must be compressed. 
-<BR>
-<P>
- 
-<P>
+</pre>This rearranges the representatives such that the representative of
+each set is the element with the smallest ID.<br>
+  Postcondition: <tt>v &gt;= parent[v]</tt><br>
+  Precondition: the disjoint sets structure must be compressed.<br>
+  <hr>
 
-
-
-
-<hr>
-
-<H2><A NAME="sec:representative-with-path-halving"></A>
-</h2>
-<PRE>
+  <h2><a name="sec:representative-with-path-halving" id=
+  "sec:representative-with-path-halving"></a></h2>
+  <pre>
 representative_with_path_halving&lt;Parent&gt;
-</PRE>
+</pre>
 
-<P>
-This is a functor which finds the representative vertex for the same
-component as the element <TT>x</TT>. While traversing up the
-representative tree, the functor also applies the path halving
-technique to shorten the height of the tree.
-
-<P>
- 
-<P> <PRE>
+  <p>This is a functor which finds the representative vertex for the same
+  component as the element <tt>x</tt>. While traversing up the representative
+  tree, the functor also applies the path halving technique to shorten the
+  height of the tree.</p>
+  <pre>
 Element operator()(Parent p, Element x)
-</PRE> 
-<P>
+</pre>
+  <hr>
 
-
-
-<hr>
-
-<H2>
-<A NAME="sec:representative-with-full-path-compression"></A>
-<BR>
-</h2>
-<PRE>
+  <h2><a name="sec:representative-with-full-path-compression" id=
+  "sec:representative-with-full-path-compression"></a><br></h2>
+  <pre>
 representative_with_full_path_compression&lt;Parent&gt;
-</PRE>
+</pre>
 
-<P>
-This is a functor which finds the representative element for the set
-that element <TT>x</TT> belongs to.
-
-<P>
- 
-<P> <PRE>
+  <p>This is a functor which finds the representative element for the set
+  that element <tt>x</tt> belongs to.</p>
+  <pre>
 Element operator()(Parent p, Element x)
-</PRE> 
-<P>
+</pre>
 
-<P>
+  <p><br></p>
+  <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<br>
-<HR>
-<TABLE>
-<TR valign=top>
-<TD nowrap>Copyright &copy 2000</TD><TD>
-<a HREF="../../people/jeremy_siek.htm">Jeremy Siek</a>,
-Univ.of Notre Dame (<A
-HREF="mailto:jsiek at lsc.nd.edu">jsiek at lsc.nd.edu</A>)<br>
-<A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Univ.of Notre Dame (<A HREF="mailto:llee1 at lsc.nd.edu">llee1 at lsc.nd.edu</A>)<br>
-<A HREF=http://www.lsc.nd.edu/~lums>Andrew Lumsdaine</A>,
-Univ.of Notre Dame (<A
-HREF="mailto:lums at lsc.nd.edu">lums at lsc.nd.edu</A>)
-</TD></TR></TABLE>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->01
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38508" --></p>
 
-</BODY>
-</HTML> 
+  <table summary="">
+    <tr valign="top">
+      <td nowrap><i>Copyright &copy; 2000</i></td>
+
+      <td><i><a href="../../people/jeremy_siek.htm">Jeremy Siek</a>, Univ.of
+      Notre Dame (<a href="mailto:jsiek at lsc.nd.edu">jsiek at lsc.nd.edu</a>)<br>
+      <a href="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</a>,
+      Univ.of Notre Dame (<a href=
+      "mailto:llee1 at lsc.nd.edu">llee1 at lsc.nd.edu</a>)<br>
+      <a href="http://www.lsc.nd.edu/~lums">Andrew Lumsdaine</a>, Univ.of
+      Notre Dame (<a href=
+      "mailto:lums at lsc.nd.edu">lums at lsc.nd.edu</a>)</i></td>
+    </tr>
+  </table>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/disjoint_sets/index.html
===================================================================
--- boost/trunk/libs/disjoint_sets/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/disjoint_sets/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,11 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="disjoint_sets.html">disjoint_sets.html</a>.
+<a href="disjoint_sets.html">disjoint_sets.html</a>.&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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: boost/trunk/libs/dynamic_bitset/Jamfile
===================================================================
--- boost/trunk/libs/dynamic_bitset/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/dynamic_bitset/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,21 +0,0 @@
-subproject libs/dynamic_bitset ;
-
-unit-test dyn_bitset_unit_tests1
-    : dyn_bitset_unit_tests1.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-unit-test dyn_bitset_unit_tests2
-    : dyn_bitset_unit_tests2.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-unit-test dyn_bitset_unit_tests3
-    : dyn_bitset_unit_tests3.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-unit-test dyn_bitset_unit_tests4
-    : dyn_bitset_unit_tests4.cpp
-    : <include>$(BOOST_ROOT)
-    ;

Modified: boost/trunk/libs/dynamic_bitset/Jamfile.v2
===================================================================
--- boost/trunk/libs/dynamic_bitset/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/dynamic_bitset/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
+#
+#              Copyright Vladimir Prus 2004
+#
+# Distributed under the Boost Software License, Version 1.0.
+#     (See accompanying file LICENSE_1_0.txt or copy at
+#           http://www.boost.org/LICENSE_1_0.txt)
 
+
 test-suite dynamic_bitset :
 
     [ run dyn_bitset_unit_tests1.cpp ]

Modified: boost/trunk/libs/dynamic_bitset/bitset_test.hpp
===================================================================
--- boost/trunk/libs/dynamic_bitset/bitset_test.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/dynamic_bitset/bitset_test.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -645,11 +645,19 @@
   // to_string()
   static void to_string(const Bitset& b)
   {
+    // Construct a string object of the appropriate type and initializes
+    // it to a string of length N characters. Each character is determined
+    // by the value of its corresponding bit position in b. Character
+    // position N - 1 corresponds to bit position zero. Sebsequent
+    // decreasing character positions correspond to increasing bit
+    // positions. Bit value zero becomes the charactet 0, bit value one
+    // becomes the character 1.
     std::string str;
     boost::to_string(b, str);
+    std::size_t N = b.size();
     BOOST_CHECK(str.size() == b.size());
-    for (std::size_t i = 0; i < b.size(); ++i)
-      BOOST_CHECK(str[b.size() - 1 - i] ==(b.test(i)? '1':'0'));
+    for (std::size_t I = 0; I < b.size(); ++I)
+      BOOST_CHECK(b[I] == 0 ? (str[N - 1 - I] == '0') : (str[N - 1 - I] == '1'));
   }
 
   static void count(const Bitset& b)
@@ -958,7 +966,8 @@
 
     bool did_throw = false;
     try {
-      s << b;
+      static_cast<void>
+          (s << b);
     }
 #if defined BOOST_OLD_IOSTREAMS
     catch(...) {
@@ -1033,7 +1042,8 @@
     const std::ios::iostate except = is.exceptions();
     bool has_stream_exceptions = true;
     try {
-      is >> b;
+      static_cast<void>
+          (is >> b);
     }
     catch(const std::ios::failure &) {
       did_throw = true;

Modified: boost/trunk/libs/dynamic_bitset/dyn_bitset_unit_tests3.cpp
===================================================================
--- boost/trunk/libs/dynamic_bitset/dyn_bitset_unit_tests3.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/dynamic_bitset/dyn_bitset_unit_tests3.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -58,11 +58,6 @@
     Tests::to_ulong(b);
   }
   {
-    std::string str(ul_width - 1, '1');
-    boost::dynamic_bitset<Block> b(str);
-    Tests::to_ulong(b);
-  }
-  {
     std::string ul_str(ul_width, '1');
     boost::dynamic_bitset<Block> b(ul_str);
     Tests::to_ulong(b);

Deleted: boost/trunk/libs/dynamic_bitset/example/Jamfile
===================================================================
--- boost/trunk/libs/dynamic_bitset/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/dynamic_bitset/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,20 +0,0 @@
-exe timing_tests
-    : timing_tests.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe example1
-    : example1.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe example2
-    : example2.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe example3
-    : example3.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-

Modified: boost/trunk/libs/dynamic_bitset/index.html
===================================================================
--- boost/trunk/libs/dynamic_bitset/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/dynamic_bitset/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,24 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
-<html>
-<head>
-<meta http-equiv=refresh content="0; URL=dynamic_bitset.html">
-<title>Automatic redirection</title>
-</head>
-<body>
-Automatic redirection failed, please go to
-<a href="dynamic_bitset.html">dynamic_bitset.html</a>.
-</body>
+<!--
+                    Copyright  Beman  Dawes 2002
+                    Copyright Gennaro Prota 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)
+
+-->
+
+
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+  <head>
+    <meta http-equiv="refresh" content="0; URL=dynamic_bitset.html" />
+    <title></title>
+  </head>
+  <body>
+    Automatic redirection failed, please go to <a href=
+    "dynamic_bitset.html">dynamic_bitset.html</a>.
+  </body>
+
 </html>

Modified: boost/trunk/libs/expected_results.xml
===================================================================
--- boost/trunk/libs/expected_results.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/expected_results.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,7 @@
 <?xml version="1.0" encoding="utf-8"?>
-<expected-failures><toolset name="mingw-3_3_1"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<expected-failures>
+<toolset name="mingw-3_3_1">
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
 <library name="algorithm/string"><test-result test-name="container" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/><test-result test-name="container" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
 <library name="assign"><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
 <library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
@@ -52,1329 +54,2345 @@
 <library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/><test-result test-name="test_pool_alloc" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/><test-result test-name="timer_test" result="success"/></library>
-</toolset><toolset name="mingw-3_4_2"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="container" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
-<library name="assign"><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
-<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtime_wstream_std_config" result="fail"/><test-result test-name="testwrapping_int" result="success"/></library>
+</toolset>
+<toolset name="mingw-3_4_2">
+<toolset-alias name="gcc-3.4.2_mingw"/>
+<toolset-alias name="gcc-mingw-3.4.2"/>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="fail"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="fail"/><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="fail"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="fail"/></library>
+<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="code_converter_test" result="fail"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="fail"/><test-result test-name="zlib_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="fail"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="fail"/></library>
+<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
+<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_codecvt_null" result="fail"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="fail"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_codecvt_null" result="fail"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="fail"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="testwave" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/></library>
+<library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/><test-result test-name="crc_test" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/><test-result test-name="function_test" result="success"/></library>
+<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="success"/><test-result test-name="test_pool_alloc" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="mingw-stlport">
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="fail"/><test-result test-name="testdate_facet_new_dll" result="fail"/><test-result test-name="testdate_input_facet" result="fail"/><test-result test-name="testdate_input_facet_dll" result="fail"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="fail"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="fail"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="fail"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="fail"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="fail"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
 <library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="fail"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="zlib_test" result="success"/></library>
 <library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
 <library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
 <library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
 <library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
 <library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
 <library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
 <library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
 <library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
-<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
-<library name="python"><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="fail"/><test-result test-name="ptr_map" result="fail"/><test-result test-name="ptr_set" result="fail"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="fail"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="fail"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="fail"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
 <library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
-<library name="range"><test-result test-name="array_test" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
-<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="fail"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="fail"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="fail"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="fail"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="fail"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="fail"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="fail"/><test-result test-name="test_codecvt_null" result="fail"/><test-result test-name="test_const" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="fail"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="fail"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="fail"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="fail"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="fail"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="fail"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="fail"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="fail"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="fail"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="fail"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="fail"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="fail"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="fail"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="fail"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="fail"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="fail"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="fail"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="fail"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="fail"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="fail"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="fail"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="fail"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="fail"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="fail"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="fail"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="fail"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="fail"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="fail"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="fail"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="fail"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="fail"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="fail"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="fail"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="fail"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_warchive" result="fail"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="fail"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="fail"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="fail"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="fail"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="fail"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="fail"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="fail"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="fail"/><test-result test-name="test_utf8_codecvt" result="fail"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="fail"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="fail"/><test-result test-name="test_void_cast" result="success"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="fail"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="fail"/><test-result test-name="regex_regress_dll" result="fail"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="fail"/><test-result test-name="test_array_xml_archive_dll" result="fail"/><test-result test-name="test_array_xml_warchive" result="fail"/><test-result test-name="test_array_xml_warchive_dll" result="fail"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="fail"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="fail"/><test-result test-name="test_variant_xml_archive_dll" result="fail"/><test-result test-name="test_variant_xml_warchive" result="fail"/><test-result test-name="test_variant_xml_warchive_dll" result="fail"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
 <library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
-<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
-<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
-<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
-<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
 <library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="fail"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/></library>
 <library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
 <library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="fail"/><test-result test-name="array4" result="fail"/><test-result test-name="array5" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/></library>
+<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="vc-7_1">
+<toolset-alias name="msvc-7.1"/>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
+<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="zlib_test" result="success"/></library>
+<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
+<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="fail"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="fail"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="fail"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="fail"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="testwave" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/></library>
+<library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/><test-result test-name="crc_test" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/><test-result test-name="function_test" result="success"/></library>
+<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="success"/><test-result test-name="test_pool_alloc" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="vc-8_0">
+<toolset-alias name="msvc-8.0"/>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="fail"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="fail"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
+<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="zlib_test" result="success"/></library>
+<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
+<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="fail"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="fail"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="fail"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="fail"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="fail"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="fail"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="fail"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="fail"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="fail"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="testwave" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/></library>
+<library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/><test-result test-name="crc_test" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/><test-result test-name="function_test" result="success"/></library>
+<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="success"/><test-result test-name="test_pool_alloc" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="como-4_3_3-vc7_1">
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="fail"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="fail"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="fail"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="fail"/><test-result test-name="testdate_facet_new" result="fail"/><test-result test-name="testdate_facet_new_dll" result="fail"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="fail"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="fail"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="fail"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="fail"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="fail"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="fail"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="fail"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="fail"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="fail"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="fail"/><test-result test-name="testlocal_time_facet" result="fail"/><test-result test-name="testlocal_time_input_facet" result="fail"/><test-result test-name="testmicrosec_time_clock" result="fail"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="fail"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="fail"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="fail"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="fail"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtz_database" result="fail"/><test-result test-name="testwrapping_int" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="fail"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="fail"/></library>
+<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="fail"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="bzip2_test" result="fail"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="fail"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="gzip_test" result="fail"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="fail"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="fail"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="fail"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="zlib_test" result="fail"/></library>
+<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
+<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="fail"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="fail"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="fail"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="fail"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="fail"/><test-result test-name="args" result="fail"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="fail"/><test-result test-name="back_reference" result="fail"/><test-result test-name="bases" result="fail"/><test-result test-name="ben_scott1" result="fail"/><test-result test-name="bienstman1" result="fail"/><test-result test-name="bienstman2" result="fail"/><test-result test-name="bienstman3" result="fail"/><test-result test-name="borrowed" result="fail"/><test-result test-name="builtin_converters" result="fail"/><test-result test-name="callbacks" result="fail"/><test-result test-name="const_argument" result="fail"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="fail"/><test-result test-name="data_members" result="fail"/><test-result test-name="defaults" result="fail"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="fail"/><test-result test-name="docstring" result="fail"/><test-result test-name="embedding" result="fail"/><test-result test-name="enum" result="fail"/><test-result test-name="exception_translator" result="fail"/><test-result test-name="extract" result="fail"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="fail"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="fail"/><test-result test-name="iterator" result="fail"/><test-result test-name="keywords" result="fail"/><test-result test-name="list" result="fail"/><test-result test-name="long" result="fail"/><test-result test-name="map_indexing_suite" result="fail"/><test-result test-name="minimal" result="fail"/><test-result test-name="multi_arg_constructor" result="fail"/><test-result test-name="nested" result="fail"/><test-result test-name="numpy" result="fail"/><test-result test-name="object" result="fail"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="fail"/><test-result test-name="opaque" result="fail"/><test-result test-name="operators" result="fail"/><test-result test-name="pearu1" result="fail"/><test-result test-name="pickle1" result="fail"/><test-result test-name="pickle2" result="fail"/><test-result test-name="pickle3" result="fail"/><test-result test-name="pickle4" result="fail"/><test-result test-name="pointee" result="fail"/><test-result test-name="pointer_type_id_test" result="fail"/><test-result test-name="pointer_vector" result="fail"/><test-result test-name="polymorphism" result="fail"/><test-result test-name="polymorphism2" result="fail"/><test-result test-name="polymorphism2_auto_ptr" result="fail"/><test-result test-name="properties" result="fail"/><test-result test-name="raw_ctor" result="fail"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="fail"/><test-result test-name="select_arg_to_python_test" result="fail"/><test-result test-name="select_from_python_test" result="fail"/><test-result test-name="select_holder" result="fail"/><test-result test-name="shared_ptr" result="fail"/><test-result test-name="slice" result="fail"/><test-result test-name="staticmethod" result="fail"/><test-result test-name="str" result="fail"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="fail"/><test-result test-name="try" result="fail"/><test-result test-name="tuple" result="fail"/><test-result test-name="upcast" result="fail"/><test-result test-name="vector_indexing_suite" result="fail"/><test-result test-name="virtual_functions" result="fail"/><test-result test-name="wrapper_held_type" result="fail"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="fail"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="fail"/><test-result test-name="grep" result="fail"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="fail"/><test-result test-name="partial_regex_match" result="fail"/><test-result test-name="regex_grep_example_1" result="fail"/><test-result test-name="regex_grep_example_2" result="fail"/><test-result test-name="regex_grep_example_3" result="fail"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="fail"/><test-result test-name="regex_match_example" result="fail"/><test-result test-name="regex_merge_example" result="fail"/><test-result test-name="regex_replace_example" result="fail"/><test-result test-name="regex_search_example" result="fail"/><test-result test-name="regex_split_example_1" result="fail"/><test-result test-name="regex_split_example_2" result="fail"/><test-result test-name="regex_timer" result="fail"/><test-result test-name="regex_token_iterator_eg_1" result="fail"/><test-result test-name="regex_token_iterator_eg_2" result="fail"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="fail"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="fail"/><test-result test-name="static_mutex_test" result="fail"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="fail"/><test-result test-name="test_array_text_archive" result="fail"/><test-result test-name="test_array_xml_archive" result="fail"/><test-result test-name="test_binary_binary_archive" result="fail"/><test-result test-name="test_binary_text_archive" result="fail"/><test-result test-name="test_binary_xml_archive" result="fail"/><test-result test-name="test_class_info_load_binary_archive" result="fail"/><test-result test-name="test_class_info_load_text_archive" result="fail"/><test-result test-name="test_class_info_load_xml_archive" result="fail"/><test-result test-name="test_class_info_save_binary_archive" result="fail"/><test-result test-name="test_class_info_save_text_archive" result="fail"/><test-result test-name="test_class_info_save_xml_archive" result="fail"/><test-result test-name="test_codecvt_null" result="fail"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="fail"/><test-result test-name="test_contained_class_text_archive" result="fail"/><test-result test-name="test_contained_class_xml_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_text_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="fail"/><test-result test-name="test_delete_pointer_binary_archive" result="fail"/><test-result test-name="test_delete_pointer_text_archive" result="fail"/><test-result test-name="test_delete_pointer_xml_archive" result="fail"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_auto_ptr" result="fail"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_fast_archive" result="fail"/><test-result test-name="test_demo_pimpl" result="fail"/><test-result test-name="test_demo_polymorphic" result="fail"/><test-result test-name="test_demo_portable_archive" result="fail"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_xml" result="fail"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_demo_xml_save" result="fail"/><test-result test-name="test_deque_binary_archive" result="fail"/><test-result test-name="test_deque_text_archive" result="fail"/><test-result test-name="test_deque_xml_archive" result="fail"/><test-result test-name="test_derived_binary_archive" result="fail"/><test-result test-name="test_derived_class_binary_archive" result="fail"/><test-result test-name="test_derived_class_ptr_binary_archive" result="fail"/><test-result test-name="test_derived_class_ptr_text_archive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_archive" result="fail"/><test-result test-name="test_derived_class_text_archive" result="fail"/><test-result test-name="test_derived_class_xml_archive" result="fail"/><test-result test-name="test_derived_text_archive" result="fail"/><test-result test-name="test_derived_xml_archive" result="fail"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_diamond_xml_archive" result="fail"/><test-result test-name="test_exported_binary_archive" result="fail"/><test-result test-name="test_exported_text_archive" result="fail"/><test-result test-name="test_exported_xml_archive" result="fail"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="fail"/><test-result test-name="test_list_ptrs_binary_archive" result="fail"/><test-result test-name="test_list_ptrs_text_archive" result="fail"/><test-result test-name="test_list_ptrs_xml_archive" result="fail"/><test-result test-name="test_list_text_archive" result="fail"/><test-result test-name="test_list_xml_archive" result="fail"/><test-result test-name="test_map_binary_archive" result="fail"/><test-result test-name="test_map_text_archive" result="fail"/><test-result test-name="test_map_xml_archive" result="fail"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="fail"/><test-result test-name="test_multiple_ptrs_text_archive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_archive" result="fail"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor_text_archive" result="fail"/><test-result test-name="test_non_default_ctor_xml_archive" result="fail"/><test-result test-name="test_non_intrusive_binary_archive" result="fail"/><test-result test-name="test_non_intrusive_text_archive" result="fail"/><test-result test-name="test_non_intrusive_xml_archive" result="fail"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="fail"/><test-result test-name="test_no_rtti_text_archive" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="fail"/><test-result test-name="test_null_ptr_text_archive" result="fail"/><test-result test-name="test_null_ptr_xml_archive" result="fail"/><test-result test-name="test_nvp_binary_archive" result="fail"/><test-result test-name="test_nvp_text_archive" result="fail"/><test-result test-name="test_nvp_xml_archive" result="fail"/><test-result test-name="test_object_binary_archive" result="fail"/><test-result test-name="test_object_text_archive" result="fail"/><test-result test-name="test_object_xml_archive" result="fail"/><test-result test-name="test_optional_binary_archive" result="fail"/><test-result test-name="test_optional_text_archive" result="fail"/><test-result test-name="test_optional_xml_archive" result="fail"/><test-result test-name="test_polymorphic_binary_archive" result="fail"/><test-result test-name="test_polymorphic_text_archive" result="fail"/><test-result test-name="test_polymorphic_xml_archive" result="fail"/><test-result test-name="test_primitive_binary_archive" result="fail"/><test-result test-name="test_primitive_text_archive" result="fail"/><test-result test-name="test_primitive_xml_archive" result="fail"/><test-result test-name="test_private_ctor" result="fail"/><test-result test-name="test_recursion_binary_archive" result="fail"/><test-result test-name="test_recursion_text_archive" result="fail"/><test-result test-name="test_recursion_xml_archive" result="fail"/><test-result test-name="test_registered_binary_archive" result="fail"/><test-result test-name="test_registered_text_archive" result="fail"/><test-result test-name="test_registered_xml_archive" result="fail"/><test-result test-name="test_reset_object_address" result="fail"/><test-result test-name="test_set_binary_archive" result="fail"/><test-result test-name="test_set_text_archive" result="fail"/><test-result test-name="test_set_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_132_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_132_text_archive" result="fail"/><test-result test-name="test_shared_ptr_132_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_text_archive" result="fail"/><test-result test-name="test_shared_ptr_xml_archive" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="fail"/><test-result test-name="test_simple_class_ptr_binary_archive" result="fail"/><test-result test-name="test_simple_class_ptr_text_archive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_archive" result="fail"/><test-result test-name="test_simple_class_text_archive" result="fail"/><test-result test-name="test_simple_class_xml_archive" result="fail"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="fail"/><test-result test-name="test_split_text_archive" result="fail"/><test-result test-name="test_split_xml_archive" result="fail"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="fail"/><test-result test-name="test_tracking_text_archive" result="fail"/><test-result test-name="test_tracking_xml_archive" result="fail"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="fail"/><test-result test-name="test_unregistered_text_archive" result="fail"/><test-result test-name="test_unregistered_xml_archive" result="fail"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="fail"/><test-result test-name="test_variant_text_archive" result="fail"/><test-result test-name="test_variant_xml_archive" result="fail"/><test-result test-name="test_vector_binary_archive" result="fail"/><test-result test-name="test_vector_text_archive" result="fail"/><test-result test-name="test_vector_xml_archive" result="fail"/><test-result test-name="test_void_cast" result="success"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="fail"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="fail"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="fail"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="fail"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="fail"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="fail"/><test-result test-name="test_barrier_lib" result="fail"/><test-result test-name="test_condition" result="fail"/><test-result test-name="test_condition_lib" result="fail"/><test-result test-name="test_mutex" result="fail"/><test-result test-name="test_mutex_lib" result="fail"/><test-result test-name="test_once" result="fail"/><test-result test-name="test_once_lib" result="fail"/><test-result test-name="test_thread" result="fail"/><test-result test-name="test_thread_lib" result="fail"/><test-result test-name="test_tss" result="fail"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="fail"/><test-result test-name="test_xtime_lib" result="fail"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="fail"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/></library>
+<library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="fail"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
-</toolset><toolset name="vc-7_1"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="container" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/><test-result test-name="container" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/><test-result test-name="container" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
-<library name="assign"><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
-<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
-<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/></library>
-<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
-<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
-<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
-<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
-<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
-<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
-<library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
-<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
-<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
-<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
-<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
-<library name="python"><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/></library>
-<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
-<library name="range"><test-result test-name="array_test" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="workaround_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="workaround_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
-<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_void_cast" result="success"/></library>
-<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
-<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
-<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
-<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="fail"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
-<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
-<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
-<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
-<library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
-<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_test" result="success"/><test-result test-name="any_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
-<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
-<library name="crc"><test-result test-name="crc_test" result="success"/><test-result test-name="crc_test" result="success"/><test-result test-name="crc_test" result="success"/></library>
-<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
-<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/><test-result test-name="disjoint_set_test" result="success"/><test-result test-name="disjoint_set_test" result="success"/></library>
-<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
-<library name="functional"><test-result test-name="function_test" result="success"/><test-result test-name="function_test" result="success"/><test-result test-name="function_test" result="success"/></library>
-<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/><test-result test-name="property_map_cc" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
-<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
-<library name="pool"><test-result test-name="test_pool_alloc" result="success"/><test-result test-name="test_pool_alloc" result="success"/><test-result test-name="test_pool_alloc" result="success"/></library>
-<library name="timer"><test-result test-name="timer_test" result="success"/><test-result test-name="timer_test" result="success"/><test-result test-name="timer_test" result="success"/></library>
-</toolset><toolset name="gcc-3.3.3-linux"><library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
-<library name="mpl"><test-result test-name="lambda_args" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="always" result="success"/><test-result test-name="next" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="map" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="size" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="set" result="success"/><test-result test-name="back" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="if" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="front" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="int" result="success"/><test-result test-name="count" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="partition" result="success"/></library>
-<library name="bind"><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
-<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/></library>
-<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
+</toolset>
+<toolset name="mingw-3_4_4">
+<toolset-alias name="gcc-3.4.5_mingw"/>
+<toolset-alias name="gcc-mingw-3.4.5"/>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/></library>
-<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/></library>
-<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
-<library name="range"><test-result test-name="string_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
-<library name="date_time"><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
-<library name="signals"><test-result test-name="signal_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="container" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/></library>
-<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="fail"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="fail"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
-<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/></library>
-<library name="filesystem"><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
-<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
-<library name="random"><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/></library>
-<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="args" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/></library>
-<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/></library>
-<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/></library>
-<library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="fail"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="numeric/interval"><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="add" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="det" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="cmp_lex" result="success"/></library>
-<library name="utility"><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/></library>
-<library name="multi_array"><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="access" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="fail_criterator" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/></library>
-<library name="optional"><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/></library>
-<library name="program_options"><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test_dll" result="success"/></library>
-<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
-<library name="tokenizer"><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/></library>
-<library name="lambda"><test-result test-name="bll_and_function" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/></library>
-<library name="config"><test-result test-name="config_info" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="code_converter_test" result="fail"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="fail"/><test-result test-name="zlib_test" result="success"/></library>
+<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
+<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_codecvt_null" result="fail"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="fail"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/></library>
+<library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/></library>
+<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="mingw-3_4_4-stlport-5_0">
+<toolset-alias name="gcc-3.4.5_mingw_stlport5"/>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="fail"/><test-result test-name="testdate_facet_new_dll" result="fail"/><test-result test-name="testdate_input_facet" result="fail"/><test-result test-name="testdate_input_facet_dll" result="fail"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="fail"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="fail"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="fail"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="fail"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="fail"/></library>
+<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="fail"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="zlib_test" result="success"/></library>
+<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
+<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="fail"/><test-result test-name="ptr_map" result="fail"/><test-result test-name="ptr_set" result="fail"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="fail"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="fail"/><test-result test-name="regex_regress_dll" result="fail"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="fail"/><test-result test-name="test_array_xml_archive_dll" result="fail"/><test-result test-name="test_array_xml_warchive" result="fail"/><test-result test-name="test_array_xml_warchive_dll" result="fail"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="fail"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="fail"/><test-result test-name="test_variant_xml_archive_dll" result="fail"/><test-result test-name="test_variant_xml_warchive" result="fail"/><test-result test-name="test_variant_xml_warchive_dll" result="fail"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="fail"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/></library>
+<library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
-<library name="integer"><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
-<library name="rational"><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="functional"><test-result test-name="function_test" result="success"/></library>
-<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
-<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-</toolset><toolset name="gcc-3.1-linux"><library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
-<library name="mpl"><test-result test-name="lambda_args" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="always" result="success"/><test-result test-name="next" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="map" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="size" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="set" result="success"/><test-result test-name="back" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="if" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="front" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="int" result="success"/><test-result test-name="count" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="partition" result="success"/></library>
-<library name="bind"><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
-<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/></library>
-<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="gcc-3_4_3-sunos">
+<toolset-alias name="gcc-3.4.3_sunos"/>
+<library name="test"><test-result test-name="class_properties_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/></library>
+<library name="regex"><test-result test-name="regex_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/></library>
+<library name="date_time"><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_const_pass" result="success"/></library>
+<library name="filesystem"><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="large_file_support_test" result="success"/></library>
+<library name="graph"><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="property_iter" result="success"/></library>
+<library name="program_options"><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="python"><test-result test-name="embedding" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="result" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="args" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="try" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="object" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="str" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="map_indexing_suite" result="success"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_thread" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier_lib" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="success"/><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="test_re2c_lexer" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="find" result="success"/><test-result test-name="split" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="regex" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/></library>
+<library name="bind"><test-result test-name="bind_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/></library>
+<library name="conversion"><test-result test-name="implicit_cast" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
+<library name="concept_check"><test-result test-name="stl_concept_covering" result="fail"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="class_concept_check_test" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/></library>
-<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/></library>
-<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
-<library name="range"><test-result test-name="string_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
-<library name="date_time"><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
-<library name="signals"><test-result test-name="signal_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="fail"/><test-result test-name="conv" result="success"/><test-result test-name="container" result="success"/><test-result test-name="replace" result="fail"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/></library>
-<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
-<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/></library>
-<library name="filesystem"><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
-<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="function"><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="function_30" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_float_test" result="fail"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_unit_test" result="success"/><test-result test-name="ios_state_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="zlib_test" result="success"/></library>
+<library name="iterator"><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_io_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="fail"/><test-result test-name="quaternion_test" result="fail"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/></library>
+<library name="mpl"><test-result test-name="for_each" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="constructors" result="success"/><test-result test-name="access" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="concept_checks" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="udt_example_0" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="integer" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="concepts" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="ptr_vector" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="indirect_fun" result="success"/></library>
 <library name="random"><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/></library>
-<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="fail"/><test-result test-name="minimal" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="args" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/></library>
-<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/></library>
-<library name="thread"><test-result test-name="test_condition_lib" result="fail"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="fail"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_read_write_mutex_lib" result="fail"/><test-result test-name="test_once_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="fail"/><test-result test-name="test_thread_lib" result="fail"/><test-result test-name="test_xtime_lib" result="fail"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_read_write_mutex" result="success"/></library>
-<library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="fail"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="numeric/interval"><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="add" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="det" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="cmp_lex" result="success"/></library>
-<library name="utility"><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/></library>
-<library name="multi_array"><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="access" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="fail_criterator" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/></library>
-<library name="optional"><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/></library>
-<library name="program_options"><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test_dll" result="success"/></library>
-<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="fail"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="fail"/><test-result test-name="add_const_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
-<library name="tokenizer"><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/></library>
-<library name="lambda"><test-result test-name="bll_and_function" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/></library>
-<library name="config"><test-result test-name="config_info" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
+<library name="range"><test-result test-name="array" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/></library>
+<library name="spirit"><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="config"><test-result test-name="config_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
+<library name="tuple"><test-result test-name="tuple_test_bench" result="success"/><test-result test-name="io_test" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="tru64cxx65-042">
+<toolset-alias name="hp_cxx-65_042_tru64"/>
+<library name="test"><test-result test-name="class_properties_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/></library>
+<library name="regex"><test-result test-name="regex_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="concept_check" result="fail"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/></library>
+<library name="date_time"><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="fail"/><test-result test-name="test_variant_text_archive_dll" result="fail"/><test-result test-name="test_variant_text_warchive" result="fail"/><test-result test-name="test_variant_text_warchive_dll" result="fail"/><test-result test-name="test_variant_binary_archive" result="fail"/><test-result test-name="test_variant_binary_archive_dll" result="fail"/><test-result test-name="test_variant_xml_archive" result="fail"/><test-result test-name="test_variant_xml_archive_dll" result="fail"/><test-result test-name="test_variant_xml_warchive" result="fail"/><test-result test-name="test_variant_xml_warchive_dll" result="fail"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_const_pass" result="success"/></library>
+<library name="filesystem"><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="operations_test" result="fail"/><test-result test-name="operations_test_dll" result="fail"/><test-result test-name="fstream_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="large_file_support_test" result="success"/></library>
+<library name="graph"><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="fail"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dijkstra_heap_performance" result="fail"/><test-result test-name="relaxed_heap_test" result="fail"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="fail"/><test-result test-name="layout_test" result="fail"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="isomorphism" result="fail"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="fail"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="property_iter" result="success"/></library>
+<library name="program_options"><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="python"><test-result test-name="embedding" result="fail"/><test-result test-name="destroy_test" result="success"/><test-result test-name="pointer_type_id_test" result="fail"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="pointee" result="fail"/><test-result test-name="result" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="select_from_python_test" result="fail"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="object_manager" result="fail"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="select_holder" result="fail"/><test-result test-name="select_arg_to_python_test" result="fail"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="crossmod_exception" result="fail"/><test-result test-name="injected" result="fail"/><test-result test-name="properties" result="fail"/><test-result test-name="return_arg" result="fail"/><test-result test-name="staticmethod" result="fail"/><test-result test-name="shared_ptr" result="fail"/><test-result test-name="andreas_beyer" result="fail"/><test-result test-name="polymorphism" result="fail"/><test-result test-name="polymorphism2" result="fail"/><test-result test-name="wrapper_held_type" result="fail"/><test-result test-name="polymorphism2_auto_ptr" result="fail"/><test-result test-name="auto_ptr" result="fail"/><test-result test-name="minimal" result="fail"/><test-result test-name="args" result="fail"/><test-result test-name="raw_ctor" result="fail"/><test-result test-name="numpy" result="fail"/><test-result test-name="enum" result="fail"/><test-result test-name="exception_translator" result="fail"/><test-result test-name="pearu1" result="fail"/><test-result test-name="try" result="fail"/><test-result test-name="const_argument" result="fail"/><test-result test-name="keywords" result="fail"/><test-result test-name="builtin_converters" result="fail"/><test-result test-name="test_pointer_adoption" result="fail"/><test-result test-name="operators" result="fail"/><test-result test-name="callbacks" result="fail"/><test-result test-name="defaults" result="fail"/><test-result test-name="object" result="fail"/><test-result test-name="list" result="fail"/><test-result test-name="long" result="fail"/><test-result test-name="dict" result="fail"/><test-result test-name="tuple" result="fail"/><test-result test-name="str" result="fail"/><test-result test-name="slice" result="fail"/><test-result test-name="virtual_functions" result="fail"/><test-result test-name="back_reference" result="fail"/><test-result test-name="implicit" result="fail"/><test-result test-name="data_members" result="fail"/><test-result test-name="ben_scott1" result="fail"/><test-result test-name="bienstman1" result="fail"/><test-result test-name="bienstman2" result="fail"/><test-result test-name="bienstman3" result="fail"/><test-result test-name="multi_arg_constructor" result="fail"/><test-result test-name="iterator" result="fail"/><test-result test-name="extract" result="fail"/><test-result test-name="opaque" result="fail"/><test-result test-name="pickle1" result="fail"/><test-result test-name="pickle2" result="fail"/><test-result test-name="pickle3" result="fail"/><test-result test-name="pickle4" result="fail"/><test-result test-name="nested" result="fail"/><test-result test-name="docstring" result="fail"/><test-result test-name="vector_indexing_suite" result="fail"/><test-result test-name="pointer_vector" result="fail"/><test-result test-name="map_indexing_suite" result="fail"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="fail"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="fail"/></library>
+<library name="thread"><test-result test-name="test_thread" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier_lib" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="fail"/><test-result test-name="test_slex_lexer" result="fail"/><test-result test-name="test_re2c_lexer" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="find" result="success"/><test-result test-name="split" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="regex" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_of" result="fail"/><test-result test-name="ptr_list_of" result="fail"/><test-result test-name="static_list_of" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="list_inserter" result="fail"/><test-result test-name="ptr_list_inserter" result="fail"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/></library>
+<library name="bind"><test-result test-name="bind_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/></library>
+<library name="conversion"><test-result test-name="implicit_cast" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
+<library name="concept_check"><test-result test-name="stl_concept_covering" result="fail"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="class_concept_check_test" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="fail"/><test-result test-name="format_test3" result="fail"/><test-result test-name="format_test_wstring" result="success"/></library>
+<library name="function"><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="function_30" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_unit_test" result="fail"/><test-result test-name="ios_state_test" result="fail"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="zlib_test" result="success"/></library>
+<library name="iterator"><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_io_test" result="fail"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/></library>
+<library name="mpl"><test-result test-name="for_each" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="constructors" result="success"/><test-result test-name="access" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="concept_checks" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="udt_example_0" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="det" result="fail"/><test-result test-name="fmod" result="success"/><test-result test-name="mul" result="fail"/><test-result test-name="overflow" result="fail"/><test-result test-name="pi" result="fail"/><test-result test-name="pow" result="fail"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="test_float" result="fail"/><test-result test-name="integer" result="fail"/></library>
+<library name="numeric/ublas"><test-result test-name="test1" result="fail"/><test-result test-name="test2" result="fail"/><test-result test-name="test3" result="fail"/><test-result test-name="test4" result="fail"/><test-result test-name="test5" result="fail"/><test-result test-name="test6" result="fail"/><test-result test-name="placement_new" result="success"/><test-result test-name="concepts" result="fail"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="ptr_vector" result="fail"/><test-result test-name="ptr_list" result="fail"/><test-result test-name="ptr_deque" result="fail"/><test-result test-name="ptr_set" result="fail"/><test-result test-name="ptr_map" result="fail"/><test-result test-name="ptr_array" result="fail"/><test-result test-name="tree_test" result="fail"/><test-result test-name="incomplete_type_test" result="fail"/><test-result test-name="view_example" result="fail"/><test-result test-name="iterator_test" result="fail"/><test-result test-name="tut1" result="fail"/><test-result test-name="indirect_fun" result="fail"/></library>
+<library name="random"><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/></library>
+<library name="range"><test-result test-name="array" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/></library>
+<library name="spirit"><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="variant_test1" result="fail"/><test-result test-name="variant_test2" result="fail"/><test-result test-name="variant_test3" result="fail"/><test-result test-name="variant_test4" result="fail"/><test-result test-name="variant_test5" result="fail"/><test-result test-name="variant_test6" result="fail"/><test-result test-name="variant_test7" result="fail"/><test-result test-name="variant_test8" result="fail"/><test-result test-name="recursive_variant_test" result="fail"/><test-result test-name="variant_reference_test" result="fail"/><test-result test-name="variant_comparison_test" result="fail"/><test-result test-name="variant_visit_test" result="fail"/></library>
+<library name="config"><test-result test-name="config_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
-<library name="integer"><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
-<library name="rational"><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/></library>
-<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
+<library name="tuple"><test-result test-name="tuple_test_bench" result="success"/><test-result test-name="io_test" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="gcc-4.0.1-osf1">
+<toolset-alias name="gcc-4_0_3_tru64"/>
+<library name="test"><test-result test-name="class_properties_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/></library>
+<library name="regex"><test-result test-name="regex_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/></library>
+<library name="date_time"><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_const_pass" result="success"/></library>
+<library name="filesystem"><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="operations_test" result="fail"/><test-result test-name="operations_test_dll" result="fail"/><test-result test-name="fstream_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="large_file_support_test" result="success"/></library>
+<library name="graph"><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="property_iter" result="success"/></library>
+<library name="program_options"><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="python"><test-result test-name="embedding" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="result" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="args" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="try" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="object" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="str" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="map_indexing_suite" result="success"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_thread" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier_lib" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="success"/><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="test_re2c_lexer" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="find" result="success"/><test-result test-name="split" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="regex" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/></library>
+<library name="bind"><test-result test-name="bind_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/></library>
+<library name="conversion"><test-result test-name="implicit_cast" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
+<library name="concept_check"><test-result test-name="stl_concept_covering" result="fail"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="class_concept_check_test" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
+<library name="function"><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="function_30" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_unit_test" result="success"/><test-result test-name="ios_state_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="zlib_test" result="success"/></library>
+<library name="iterator"><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_io_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/></library>
+<library name="mpl"><test-result test-name="for_each" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="constructors" result="success"/><test-result test-name="access" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="concept_checks" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="udt_example_0" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="det" result="fail"/><test-result test-name="fmod" result="success"/><test-result test-name="mul" result="fail"/><test-result test-name="overflow" result="fail"/><test-result test-name="pi" result="fail"/><test-result test-name="pow" result="fail"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="test_float" result="fail"/><test-result test-name="integer" result="fail"/></library>
+<library name="numeric/ublas"><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="concepts" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="ptr_vector" result="success"/><test-result test-name="ptr_list" result="fail"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="indirect_fun" result="success"/></library>
+<library name="random"><test-result test-name="random_test" result="fail"/><test-result test-name="random_demo" result="success"/></library>
+<library name="range"><test-result test-name="array" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/></library>
+<library name="spirit"><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="config"><test-result test-name="config_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="fail"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
+<library name="tuple"><test-result test-name="tuple_test_bench" result="success"/><test-result test-name="io_test" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="cw-9_5-darwin">
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet" result="fail"/><test-result test-name="testdate_input_facet_dll" result="fail"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
+<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="zlib_test" result="success"/></library>
+<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
+<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="fail"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="fail"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="fail"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="fail"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="fail"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="fail"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="fail"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="fail"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="fail"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="fail"/><test-result test-name="test_class_info_load_text_archive_dll" result="fail"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_class_info_load_text_warchive_dll" result="fail"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="fail"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="fail"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="fail"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="fail"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="fail"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="fail"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="fail"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="fail"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="fail"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="fail"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="fail"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="fail"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="fail"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="fail"/><test-result test-name="test_demo_dll" result="fail"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_exception_dll" result="fail"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="fail"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="fail"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_shared_ptr_dll" result="fail"/><test-result test-name="test_demo_xml" result="fail"/><test-result test-name="test_demo_xml_dll" result="fail"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_demo_xml_load_dll" result="fail"/><test-result test-name="test_demo_xml_save" result="fail"/><test-result test-name="test_demo_xml_save_dll" result="fail"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="fail"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="fail"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="fail"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="fail"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="fail"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="fail"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="fail"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="fail"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="fail"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="fail"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="fail"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_diamond_binary_archive_dll" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_diamond_text_archive_dll" result="fail"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_text_warchive_dll" result="fail"/><test-result test-name="test_diamond_xml_archive" result="fail"/><test-result test-name="test_diamond_xml_archive_dll" result="fail"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_diamond_xml_warchive_dll" result="fail"/><test-result test-name="test_exported_binary_archive" result="fail"/><test-result test-name="test_exported_binary_archive_dll" result="fail"/><test-result test-name="test_exported_text_archive" result="fail"/><test-result test-name="test_exported_text_archive_dll" result="fail"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_exported_text_warchive_dll" result="fail"/><test-result test-name="test_exported_xml_archive" result="fail"/><test-result test-name="test_exported_xml_archive_dll" result="fail"/><test-result test-name="test_exported_xml_warchive" result="fail"/><test-result test-name="test_exported_xml_warchive_dll" result="fail"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="fail"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="fail"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="fail"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="fail"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="fail"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="fail"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="fail"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="fail"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="fail"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="fail"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="fail"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="fail"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_mi_binary_archive_dll" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_mi_text_archive_dll" result="fail"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_text_warchive_dll" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_mi_xml_archive_dll" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_mi_xml_warchive_dll" result="fail"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_mult_archive_types_dll" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="fail"/><test-result test-name="test_no_rtti_binary_archive" result="fail"/><test-result test-name="test_no_rtti_binary_archive_dll" result="fail"/><test-result test-name="test_no_rtti_text_archive" result="fail"/><test-result test-name="test_no_rtti_text_archive_dll" result="fail"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_no_rtti_text_warchive_dll" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="fail"/><test-result test-name="test_no_rtti_xml_archive_dll" result="fail"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="fail"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="fail"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="fail"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="fail"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="fail"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="fail"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="fail"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="fail"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="fail"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="fail"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="fail"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="fail"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="fail"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="fail"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="fail"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="fail"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="fail"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="fail"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="fail"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="fail"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="fail"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="fail"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="fail"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="fail"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="fail"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="fail"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="fail"/><test-result test-name="test_registered_binary_archive" result="fail"/><test-result test-name="test_registered_binary_archive_dll" result="fail"/><test-result test-name="test_registered_text_archive" result="fail"/><test-result test-name="test_registered_text_archive_dll" result="fail"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_registered_text_warchive_dll" result="fail"/><test-result test-name="test_registered_xml_archive" result="fail"/><test-result test-name="test_registered_xml_archive_dll" result="fail"/><test-result test-name="test_registered_xml_warchive" result="fail"/><test-result test-name="test_registered_xml_warchive_dll" result="fail"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="fail"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="fail"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="fail"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="fail"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_text_archive" result="fail"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_text_archive" result="fail"/><test-result test-name="test_shared_ptr_text_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="fail"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="fail"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="fail"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="fail"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="fail"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="fail"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="fail"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="fail"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="fail"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="fail"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="fail"/><test-result test-name="test_unregistered_binary_archive_dll" result="fail"/><test-result test-name="test_unregistered_text_archive" result="fail"/><test-result test-name="test_unregistered_text_archive_dll" result="fail"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_unregistered_text_warchive_dll" result="fail"/><test-result test-name="test_unregistered_xml_archive" result="fail"/><test-result test-name="test_unregistered_xml_archive_dll" result="fail"/><test-result test-name="test_unregistered_xml_warchive" result="fail"/><test-result test-name="test_unregistered_xml_warchive_dll" result="fail"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="fail"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="fail"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="fail"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="fail"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="fail"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="fail"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="fail"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="fail"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="fail"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="fail"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="testwave" result="fail"/></library>
+<library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-</toolset><toolset name="gcc-3.3.4-linux"><library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
-<library name="mpl"><test-result test-name="lambda_args" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="always" result="success"/><test-result test-name="next" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="map" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="size" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="set" result="success"/><test-result test-name="back" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="if" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="front" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="int" result="success"/><test-result test-name="count" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="partition" result="success"/></library>
-<library name="bind"><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
-<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/></library>
-<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/></library>
+<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="gcc-4_0-darwin">
+<toolset-alias name="darwin-4.0.1"/>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/></library>
-<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/></library>
-<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
-<library name="range"><test-result test-name="string_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
-<library name="date_time"><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
-<library name="signals"><test-result test-name="signal_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="container" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/></library>
-<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
-<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/></library>
-<library name="filesystem"><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
-<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
-<library name="random"><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/></library>
-<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="args" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/></library>
-<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/></library>
-<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/></library>
-<library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="fail"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="numeric/interval"><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="add" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="det" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="cmp_lex" result="success"/></library>
-<library name="utility"><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/></library>
-<library name="multi_array"><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="access" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="fail_criterator" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/></library>
-<library name="optional"><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/></library>
-<library name="program_options"><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test_dll" result="success"/></library>
-<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
-<library name="tokenizer"><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/></library>
-<library name="lambda"><test-result test-name="bll_and_function" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/></library>
-<library name="config"><test-result test-name="config_info" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="zlib_test" result="success"/></library>
+<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
+<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="testwave" result="success"/></library>
+<library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/></library>
+<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="qcc-3.3.5-cpp">
+<toolset-alias name="qcc-3.3.5_cpp"/>
+<library name="test"><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="errors_handling_test" result="success"/></library>
+<library name="regex"><test-result test-name="captures_test" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="regex_timer" result="success"/></library>
+<library name="date_time"><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/></library>
+<library name="serialization"><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_not_serializable" result="success"/></library>
+<library name="filesystem"><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
+<library name="graph"><test-result test-name="king_ordering" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="adj_list_cc" result="success"/></library>
+<library name="program_options"><test-result test-name="winmain_dll" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="options_description_test" result="success"/></library>
+<library name="python"><test-result test-name="select_from_python_test" result="fail"/><test-result test-name="upcast" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="embedding" result="fail"/><test-result test-name="object_fail1" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="map_indexing_suite" result="fail"/><test-result test-name="pointer_vector" result="fail"/><test-result test-name="vector_indexing_suite" result="fail"/><test-result test-name="docstring" result="fail"/><test-result test-name="nested" result="fail"/><test-result test-name="pickle4" result="fail"/><test-result test-name="pickle3" result="fail"/><test-result test-name="pickle2" result="fail"/><test-result test-name="pickle1" result="fail"/><test-result test-name="opaque" result="fail"/><test-result test-name="extract" result="fail"/><test-result test-name="iterator" result="fail"/><test-result test-name="multi_arg_constructor" result="fail"/><test-result test-name="bienstman3" result="fail"/><test-result test-name="bienstman2" result="fail"/><test-result test-name="bienstman1" result="fail"/><test-result test-name="ben_scott1" result="fail"/><test-result test-name="data_members" result="fail"/><test-result test-name="implicit" result="fail"/><test-result test-name="back_reference" result="fail"/><test-result test-name="virtual_functions" result="fail"/><test-result test-name="slice" result="fail"/><test-result test-name="str" result="fail"/><test-result test-name="tuple" result="fail"/><test-result test-name="dict" result="fail"/><test-result test-name="long" result="fail"/><test-result test-name="list" result="fail"/><test-result test-name="object" result="fail"/><test-result test-name="defaults" result="fail"/><test-result test-name="callbacks" result="fail"/><test-result test-name="operators" result="fail"/><test-result test-name="test_pointer_adoption" result="fail"/><test-result test-name="builtin_converters" result="fail"/><test-result test-name="keywords" result="fail"/><test-result test-name="const_argument" result="fail"/><test-result test-name="try" result="fail"/><test-result test-name="pearu1" result="fail"/><test-result test-name="exception_translator" result="fail"/><test-result test-name="enum" result="fail"/><test-result test-name="numpy" result="fail"/><test-result test-name="raw_ctor" result="fail"/><test-result test-name="args" result="fail"/><test-result test-name="minimal" result="fail"/><test-result test-name="auto_ptr" result="fail"/><test-result test-name="polymorphism2_auto_ptr" result="fail"/><test-result test-name="wrapper_held_type" result="fail"/><test-result test-name="polymorphism2" result="fail"/><test-result test-name="polymorphism" result="fail"/><test-result test-name="andreas_beyer" result="fail"/><test-result test-name="shared_ptr" result="fail"/><test-result test-name="staticmethod" result="fail"/><test-result test-name="return_arg" result="fail"/><test-result test-name="properties" result="fail"/><test-result test-name="injected" result="fail"/><test-result test-name="crossmod_exception" result="fail"/></library>
+<library name="signals"><test-result test-name="trackable_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex_lib" result="fail"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_mutex" result="fail"/><test-result test-name="test_thread" result="success"/></library>
+<library name="wave"><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="testwave" result="fail"/></library>
+<library name="any"><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/></library>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="assign"><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="basic" result="success"/></library>
+<library name="bind"><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
+<library name="conversion"><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="format"><test-result test-name="format_test_wstring" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test1" result="success"/></library>
+<library name="function"><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="function_test_fail1" result="success"/></library>
+<library name="functional/hash"><test-result test-name="link_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_number_test" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="wide_stream_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="mapped_file_test" result="fail"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="gzip_test" result="success"/></library>
+<library name="iterator"><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="fail"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/></library>
+<library name="mpl"><test-result test-name="for_each" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="resize" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="access" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_cbracket" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="udt_example_0" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="bounds_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="test_float" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="det" result="success"/><test-result test-name="add" result="success"/><test-result test-name="integer" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test3" result="fail"/><test-result test-name="test2" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="concepts" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/></library>
+<library name="parameter"><test-result test-name="tutorial" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="basics" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="indirect_fun" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_vector" result="success"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="fail"/></library>
+<library name="range"><test-result test-name="extension_mechanism" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="string" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="array" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/></library>
+<library name="spirit"><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="partial_specializations" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="constructors" result="success"/></library>
+<library name="utility"><test-result test-name="value_init_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="checked_delete_test" result="success"/></library>
+<library name="variant"><test-result test-name="variant_visit_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test1" result="success"/></library>
+<library name="config"><test-result test-name="config_link_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_test" result="fail"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="test_thread_fail1" result="success"/></library>
+<library name="array"><test-result test-name="array5" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array1" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
-<library name="integer"><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/></library>
+<library name="integer"><test-result test-name="integer_traits_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/></library>
+<library name="lambda"><test-result test-name="switch_construct" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="member_pointer_test" result="fail"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="fail"/></library>
 <library name="rational"><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/></library>
+<library name="tokenizer"><test-result test-name="simple_example_5" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="examples" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="preprocessor"><test-result test-name="tuple" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="list" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="control" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="array" result="success"/><test-result test-name="arithmetic" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="qcc-3.3.5-gpp">
+<toolset-alias name="qcc-3.3.5_gpp"/>
+<library name="test"><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="token_iterator_test" result="fail"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="errors_handling_test" result="success"/></library>
+<library name="regex"><test-result test-name="captures_test" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="regex_timer" result="success"/></library>
+<library name="date_time"><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testclocks" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/></library>
+<library name="serialization"><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="fail"/><test-result test-name="test_polymorphic_text_warchive_dll" result="fail"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="fail"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="fail"/><test-result test-name="test_optional_text_warchive_dll" result="fail"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="fail"/><test-result test-name="test_optional_xml_warchive_dll" result="fail"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="fail"/><test-result test-name="test_vector_text_warchive_dll" result="fail"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="fail"/><test-result test-name="test_vector_xml_warchive_dll" result="fail"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="fail"/><test-result test-name="test_variant_text_warchive_dll" result="fail"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="fail"/><test-result test-name="test_variant_xml_warchive_dll" result="fail"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_unregistered_text_warchive_dll" result="fail"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="fail"/><test-result test-name="test_unregistered_xml_warchive_dll" result="fail"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="fail"/><test-result test-name="test_tracking_text_warchive_dll" result="fail"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="fail"/><test-result test-name="test_tracking_xml_warchive_dll" result="fail"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="fail"/><test-result test-name="test_split_text_warchive_dll" result="fail"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="fail"/><test-result test-name="test_split_xml_warchive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="fail"/><test-result test-name="test_simple_class_text_warchive_dll" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="fail"/><test-result test-name="test_simple_class_xml_warchive_dll" result="fail"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="fail"/><test-result test-name="test_set_text_warchive_dll" result="fail"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="fail"/><test-result test-name="test_set_xml_warchive_dll" result="fail"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_registered_text_warchive_dll" result="fail"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="fail"/><test-result test-name="test_registered_xml_warchive_dll" result="fail"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="fail"/><test-result test-name="test_recursion_text_warchive_dll" result="fail"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="fail"/><test-result test-name="test_recursion_xml_warchive_dll" result="fail"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="fail"/><test-result test-name="test_nvp_text_warchive_dll" result="fail"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="fail"/><test-result test-name="test_nvp_xml_warchive_dll" result="fail"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="fail"/><test-result test-name="test_null_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="fail"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="fail"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="fail"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="fail"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="fail"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="fail"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_no_rtti_text_warchive_dll" result="fail"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="fail"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_text_warchive_dll" result="fail"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_mi_xml_warchive_dll" result="fail"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_map_text_warchive_dll" result="fail"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="fail"/><test-result test-name="test_map_xml_warchive_dll" result="fail"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="fail"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="fail"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="fail"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="fail"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="fail"/><test-result test-name="test_list_text_warchive_dll" result="fail"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="fail"/><test-result test-name="test_list_xml_warchive_dll" result="fail"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="fail"/><test-result test-name="test_primitive_text_warchive_dll" result="fail"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="fail"/><test-result test-name="test_primitive_xml_warchive_dll" result="fail"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="fail"/><test-result test-name="test_object_text_warchive_dll" result="fail"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="fail"/><test-result test-name="test_object_xml_warchive_dll" result="fail"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_class_info_load_text_warchive_dll" result="fail"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="fail"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="fail"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="fail"/><test-result test-name="test_class_info_save_text_warchive_dll" result="fail"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="fail"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="fail"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_exported_text_warchive_dll" result="fail"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="fail"/><test-result test-name="test_exported_xml_warchive_dll" result="fail"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_text_warchive_dll" result="fail"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_diamond_xml_warchive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="fail"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="fail"/><test-result test-name="test_derived_class_text_warchive_dll" result="fail"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="fail"/><test-result test-name="test_derived_class_xml_warchive_dll" result="fail"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="fail"/><test-result test-name="test_derived_text_warchive_dll" result="fail"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="fail"/><test-result test-name="test_derived_xml_warchive_dll" result="fail"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="fail"/><test-result test-name="test_deque_text_warchive_dll" result="fail"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="fail"/><test-result test-name="test_deque_xml_warchive_dll" result="fail"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="fail"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="fail"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="fail"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="fail"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="fail"/><test-result test-name="test_contained_class_text_warchive_dll" result="fail"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="fail"/><test-result test-name="test_contained_class_xml_warchive_dll" result="fail"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="fail"/><test-result test-name="test_binary_text_warchive_dll" result="fail"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="fail"/><test-result test-name="test_binary_xml_warchive_dll" result="fail"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="fail"/><test-result test-name="test_array_text_warchive_dll" result="fail"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="fail"/><test-result test-name="test_array_xml_warchive_dll" result="fail"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_codecvt_null" result="fail"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="fail"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_not_serializable" result="success"/></library>
+<library name="filesystem"><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
+<library name="graph"><test-result test-name="king_ordering" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="graphviz_test" result="fail"/><test-result test-name="graph" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="adj_list_cc" result="success"/></library>
+<library name="program_options"><test-result test-name="winmain_dll" result="success"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="options_description_test" result="success"/></library>
+<library name="python"><test-result test-name="select_from_python_test" result="fail"/><test-result test-name="upcast" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="embedding" result="fail"/><test-result test-name="object_fail1" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="map_indexing_suite" result="fail"/><test-result test-name="pointer_vector" result="fail"/><test-result test-name="vector_indexing_suite" result="fail"/><test-result test-name="docstring" result="fail"/><test-result test-name="nested" result="fail"/><test-result test-name="pickle4" result="fail"/><test-result test-name="pickle3" result="fail"/><test-result test-name="pickle2" result="fail"/><test-result test-name="pickle1" result="fail"/><test-result test-name="opaque" result="fail"/><test-result test-name="extract" result="fail"/><test-result test-name="iterator" result="fail"/><test-result test-name="multi_arg_constructor" result="fail"/><test-result test-name="bienstman3" result="fail"/><test-result test-name="bienstman2" result="fail"/><test-result test-name="bienstman1" result="fail"/><test-result test-name="ben_scott1" result="fail"/><test-result test-name="data_members" result="fail"/><test-result test-name="implicit" result="fail"/><test-result test-name="back_reference" result="fail"/><test-result test-name="virtual_functions" result="fail"/><test-result test-name="slice" result="fail"/><test-result test-name="str" result="fail"/><test-result test-name="tuple" result="fail"/><test-result test-name="dict" result="fail"/><test-result test-name="long" result="fail"/><test-result test-name="list" result="fail"/><test-result test-name="object" result="fail"/><test-result test-name="defaults" result="fail"/><test-result test-name="callbacks" result="fail"/><test-result test-name="operators" result="fail"/><test-result test-name="test_pointer_adoption" result="fail"/><test-result test-name="builtin_converters" result="fail"/><test-result test-name="keywords" result="fail"/><test-result test-name="const_argument" result="fail"/><test-result test-name="try" result="fail"/><test-result test-name="pearu1" result="fail"/><test-result test-name="exception_translator" result="fail"/><test-result test-name="enum" result="fail"/><test-result test-name="numpy" result="fail"/><test-result test-name="raw_ctor" result="fail"/><test-result test-name="args" result="fail"/><test-result test-name="minimal" result="fail"/><test-result test-name="auto_ptr" result="fail"/><test-result test-name="polymorphism2_auto_ptr" result="fail"/><test-result test-name="wrapper_held_type" result="fail"/><test-result test-name="polymorphism2" result="fail"/><test-result test-name="polymorphism" result="fail"/><test-result test-name="andreas_beyer" result="fail"/><test-result test-name="shared_ptr" result="fail"/><test-result test-name="staticmethod" result="fail"/><test-result test-name="return_arg" result="fail"/><test-result test-name="properties" result="fail"/><test-result test-name="injected" result="fail"/><test-result test-name="crossmod_exception" result="fail"/></library>
+<library name="signals"><test-result test-name="trackable_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex_lib" result="fail"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_mutex" result="fail"/><test-result test-name="test_thread" result="success"/></library>
+<library name="wave"><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="testwave" result="fail"/></library>
+<library name="any"><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/></library>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="assign"><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="basic" result="success"/></library>
+<library name="bind"><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
+<library name="conversion"><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="format"><test-result test-name="format_test_wstring" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test1" result="success"/></library>
+<library name="function"><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="function_test_fail1" result="success"/></library>
+<library name="functional/hash"><test-result test-name="link_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_number_test" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="wide_stream_test" result="fail"/><test-result test-name="tee_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="mapped_file_test" result="fail"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="code_converter_test" result="fail"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="gzip_test" result="success"/></library>
+<library name="iterator"><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="fail"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/></library>
+<library name="mpl"><test-result test-name="for_each" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="resize" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="access" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_cbracket" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="udt_example_0" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="bounds_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="test_float" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="det" result="success"/><test-result test-name="add" result="success"/><test-result test-name="integer" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="concepts" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/></library>
+<library name="parameter"><test-result test-name="tutorial" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="basics" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="indirect_fun" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_vector" result="success"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="fail"/></library>
+<library name="range"><test-result test-name="extension_mechanism" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="string" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="array" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/></library>
+<library name="spirit"><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="partial_specializations" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="constructors" result="success"/></library>
+<library name="utility"><test-result test-name="value_init_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="checked_delete_test" result="success"/></library>
+<library name="variant"><test-result test-name="variant_visit_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test1" result="success"/></library>
+<library name="config"><test-result test-name="config_link_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_test" result="fail"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="test_thread_fail1" result="success"/></library>
+<library name="array"><test-result test-name="array5" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array1" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="fail"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
-<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
+<library name="integer"><test-result test-name="integer_traits_test" result="fail"/><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/></library>
+<library name="lambda"><test-result test-name="switch_construct" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
-<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-</toolset><toolset name="gcc-3.3.5-linux"><library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
-<library name="mpl"><test-result test-name="lambda_args" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="always" result="success"/><test-result test-name="next" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="map" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="size" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="set" result="success"/><test-result test-name="back" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="if" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="front" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="int" result="success"/><test-result test-name="count" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="partition" result="success"/></library>
-<library name="bind"><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
-<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/></library>
-<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
+<library name="rational"><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/></library>
+<library name="tokenizer"><test-result test-name="simple_example_5" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="examples" result="success"/></library>
+<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="preprocessor"><test-result test-name="tuple" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="list" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="control" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="array" result="success"/><test-result test-name="arithmetic" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="tru64cxx71-006">
+<toolset-alias name="hp_cxx-71_006_tru64"/>
+<library name="test"><test-result test-name="class_properties_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/></library>
+<library name="regex"><test-result test-name="regex_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="concept_check" result="fail"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/></library>
+<library name="date_time"><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_const_pass" result="success"/></library>
+<library name="filesystem"><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="operations_test" result="fail"/><test-result test-name="operations_test_dll" result="fail"/><test-result test-name="fstream_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="large_file_support_test" result="success"/></library>
+<library name="graph"><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="property_iter" result="success"/></library>
+<library name="program_options"><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="python"><test-result test-name="embedding" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="result" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="polymorphism" result="fail"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="args" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="try" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="object" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="str" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pointer_vector" result="fail"/><test-result test-name="map_indexing_suite" result="success"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="fail"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="fail"/></library>
+<library name="thread"><test-result test-name="test_thread" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier_lib" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="fail"/><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="test_re2c_lexer" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="find" result="success"/><test-result test-name="split" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="regex" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/></library>
+<library name="bind"><test-result test-name="bind_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/></library>
+<library name="conversion"><test-result test-name="implicit_cast" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
+<library name="concept_check"><test-result test-name="stl_concept_covering" result="fail"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="class_concept_check_test" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/></library>
-<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/></library>
-<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
-<library name="range"><test-result test-name="string_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
-<library name="date_time"><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
-<library name="signals"><test-result test-name="signal_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="container" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/></library>
-<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
-<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/></library>
-<library name="filesystem"><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
-<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="function"><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="function_30" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_unit_test" result="success"/><test-result test-name="ios_state_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/></library>
+<library name="iterator"><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_io_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/></library>
+<library name="mpl"><test-result test-name="for_each" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="if" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="constructors" result="success"/><test-result test-name="access" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="concept_checks" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="udt_example_0" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="det" result="fail"/><test-result test-name="fmod" result="success"/><test-result test-name="mul" result="fail"/><test-result test-name="overflow" result="fail"/><test-result test-name="pi" result="fail"/><test-result test-name="pow" result="fail"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="test_float" result="fail"/><test-result test-name="integer" result="fail"/></library>
+<library name="numeric/ublas"><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="concepts" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="ptr_vector" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="indirect_fun" result="success"/></library>
 <library name="random"><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/></library>
-<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="args" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/></library>
-<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/></library>
-<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/></library>
-<library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="fail"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="numeric/interval"><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="add" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="det" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="cmp_lex" result="success"/></library>
-<library name="utility"><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/></library>
-<library name="multi_array"><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="access" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="fail_criterator" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/></library>
-<library name="optional"><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/></library>
-<library name="program_options"><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test_dll" result="success"/></library>
-<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
-<library name="tokenizer"><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/></library>
-<library name="lambda"><test-result test-name="bll_and_function" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/></library>
-<library name="config"><test-result test-name="config_info" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
-<library name="timer"><test-result test-name="timer_test" result="success"/></library>
+<library name="range"><test-result test-name="array" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="fail"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/></library>
+<library name="spirit"><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="config"><test-result test-name="config_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
-<library name="integer"><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
-<library name="rational"><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/></library>
-<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
-<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
-<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-</toolset><toolset name="gcc-2.95.3-stlport-4.5.3-linux"><library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="fail"/></library>
-<library name="mpl"><test-result test-name="lambda_args" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="always" result="success"/><test-result test-name="next" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="has_xxx" result="fail"/><test-result test-name="set_c" result="fail"/><test-result test-name="advance" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="map" result="fail"/><test-result test-name="same_as" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="size" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="set" result="fail"/><test-result test-name="back" result="success"/><test-result test-name="as_sequence" result="fail"/><test-result test-name="copy" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="if" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="is_sequence" result="fail"/><test-result test-name="at" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="front" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="int" result="success"/><test-result test-name="count" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="partition" result="success"/></library>
-<library name="bind"><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
-<library name="math"><test-result test-name="common_factor_test" result="fail"/><test-result test-name="special_functions_test" result="fail"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="octonion_test" result="fail"/><test-result test-name="quaternion_test" result="fail"/></library>
-<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
+<library name="tuple"><test-result test-name="tuple_test_bench" result="success"/><test-result test-name="io_test" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="gcc-3.4.4-osf1">
+<toolset-alias name="gcc-3_4_4_tru64"/>
+<library name="test"><test-result test-name="class_properties_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/></library>
+<library name="regex"><test-result test-name="regex_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/></library>
+<library name="date_time"><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_const_pass" result="success"/></library>
+<library name="filesystem"><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="operations_test" result="fail"/><test-result test-name="operations_test_dll" result="fail"/><test-result test-name="fstream_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="large_file_support_test" result="success"/></library>
+<library name="graph"><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="property_iter" result="success"/></library>
+<library name="program_options"><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="python"><test-result test-name="embedding" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="result" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="args" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="try" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="object" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="str" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="map_indexing_suite" result="success"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_thread" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier_lib" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="success"/><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="test_re2c_lexer" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="find" result="success"/><test-result test-name="split" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="regex" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/></library>
+<library name="bind"><test-result test-name="bind_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/></library>
+<library name="conversion"><test-result test-name="implicit_cast" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
+<library name="concept_check"><test-result test-name="stl_concept_covering" result="fail"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="class_concept_check_test" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/></library>
-<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/></library>
-<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
-<library name="range"><test-result test-name="string_test" result="fail"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_range" result="fail"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="array_test" result="fail"/><test-result test-name="iterator_pair_test" result="fail"/><test-result test-name="sub_range" result="fail"/><test-result test-name="const_ranges" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
-<library name="date_time"><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="fail"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="fail"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_year_dll" result="fail"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
-<library name="signals"><test-result test-name="signal_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="trim" result="fail"/><test-result test-name="find" result="fail"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="fail"/><test-result test-name="container" result="fail"/><test-result test-name="replace" result="fail"/><test-result test-name="split" result="fail"/><test-result test-name="predicate" result="fail"/></library>
-<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="fail"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
-<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_xml_archive" result="fail"/><test-result test-name="test_primitive_xml_archive" result="fail"/><test-result test-name="test_simple_class_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="fail"/><test-result test-name="test_exported_xml_warchive" result="fail"/><test-result test-name="test_tracking_xml_archive" result="fail"/><test-result test-name="test_list_ptrs_binary_archive" result="fail"/><test-result test-name="test_split_binary_archive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_text_archive" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_demo_portable_archive" result="fail"/><test-result test-name="test_null_ptr_xml_warchive" result="fail"/><test-result test-name="test_traits_pass" result="fail"/><test-result test-name="test_unregistered_xml_warchive" result="fail"/><test-result test-name="test_nvp_text_archive" result="fail"/><test-result test-name="test_polymorphic_text_archive" result="fail"/><test-result test-name="test_object_binary_archive" result="fail"/><test-result test-name="test_class_info_save_xml_archive" result="fail"/><test-result test-name="test_delete_pointer_binary_archive" result="fail"/><test-result test-name="test_derived_class_ptr_binary_archive" result="fail"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor_xml_warchive" result="fail"/><test-result test-name="test_class_info_save_text_warchive" result="fail"/><test-result test-name="test_array_text_archive" result="fail"/><test-result test-name="test_set_text_warchive" result="fail"/><test-result test-name="test_deque_text_archive" result="fail"/><test-result test-name="test_simple_class_text_warchive" result="fail"/><test-result test-name="test_null_ptr_xml_archive" result="fail"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_list_ptrs_xml_warchive" result="fail"/><test-result test-name="test_no_rtti_text_archive" result="fail"/><test-result test-name="test_diamond_xml_archive" result="fail"/><test-result test-name="test_map_text_archive" result="fail"/><test-result test-name="test_optional_text_archive" result="fail"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_list_xml_warchive" result="fail"/><test-result test-name="test_derived_binary_archive" result="fail"/><test-result test-name="test_contained_class_xml_warchive" result="fail"/><test-result test-name="test_list_text_warchive" result="fail"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_object_xml_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="fail"/><test-result test-name="test_nvp_text_warchive" result="fail"/><test-result test-name="test_optional_binary_archive" result="fail"/><test-result test-name="test_unregistered_xml_archive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_delete_pointer_text_warchive" result="fail"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_delete_pointer_text_archive" result="fail"/><test-result test-name="test_vector_text_archive" result="fail"/><test-result test-name="test_deque_xml_archive" result="fail"/><test-result test-name="test_polymorphic_text_warchive" result="fail"/><test-result test-name="test_smart_cast" result="fail"/><test-result test-name="test_nvp_xml_warchive" result="fail"/><test-result test-name="test_polymorphic_xml_warchive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_archive" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_vector_text_warchive" result="fail"/><test-result test-name="test_exported_binary_archive" result="fail"/><test-result test-name="test_iterators_base64" result="fail"/><test-result test-name="test_no_rtti_binary_archive" result="fail"/><test-result test-name="test_class_info_load_xml_archive" result="fail"/><test-result test-name="test_polymorphic_binary_archive" result="fail"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_array_xml_warchive" result="fail"/><test-result test-name="test_contained_class_text_warchive" result="fail"/><test-result test-name="test_deque_xml_warchive" result="fail"/><test-result test-name="test_contained_class_xml_archive" result="fail"/><test-result test-name="test_optional_text_warchive" result="fail"/><test-result test-name="test_array_binary_archive" result="fail"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_text_archive" result="fail"/><test-result test-name="test_split_text_archive" result="fail"/><test-result test-name="test_map_xml_warchive" result="fail"/><test-result test-name="test_optional_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive" result="fail"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_primitive_text_archive" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="fail"/><test-result test-name="test_derived_class_ptr_text_archive" result="fail"/><test-result test-name="test_recursion_binary_archive" result="fail"/><test-result test-name="test_tracking_binary_archive" result="fail"/><test-result test-name="test_class_info_save_text_archive" result="fail"/><test-result test-name="test_simple_class_text_archive" result="fail"/><test-result test-name="test_registered_binary_archive" result="fail"/><test-result test-name="test_derived_text_warchive" result="fail"/><test-result test-name="test_nvp_xml_archive" result="fail"/><test-result test-name="test_array_xml_archive" result="fail"/><test-result test-name="test_demo_fast_archive" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_delete_pointer_xml_warchive" result="fail"/><test-result test-name="test_vector_xml_warchive" result="fail"/><test-result test-name="test_registered_text_archive" result="fail"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_const" result="success"/><test-result test-name="test_demo_auto_ptr" result="fail"/><test-result test-name="test_derived_class_text_archive" result="fail"/><test-result test-name="test_private_ctor" result="fail"/><test-result test-name="test_object_text_archive" result="fail"/><test-result test-name="test_iterators" result="fail"/><test-result test-name="test_exported_xml_archive" result="fail"/><test-result test-name="test_split_text_warchive" result="fail"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="fail"/><test-result test-name="test_demo_xml_save" result="fail"/><test-result test-name="test_void_cast" result="fail"/><test-result test-name="test_delete_pointer_xml_archive" result="fail"/><test-result test-name="test_tracking_text_warchive" result="fail"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_tracking_text_archive" result="fail"/><test-result test-name="test_list_binary_archive" result="fail"/><test-result test-name="test_split_xml_archive" result="fail"/><test-result test-name="test_registered_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive" result="fail"/><test-result test-name="test_split_xml_warchive" result="fail"/><test-result test-name="test_binary_text_archive" result="fail"/><test-result test-name="test_recursion_text_archive" result="fail"/><test-result test-name="test_derived_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="fail"/><test-result test-name="test_set_xml_archive" result="fail"/><test-result test-name="test_non_intrusive_text_warchive" result="fail"/><test-result test-name="test_demo_pimpl" result="fail"/><test-result test-name="test_vector_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor_xml_archive" result="fail"/><test-result test-name="test_primitive_xml_warchive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_class_info_save_xml_warchive" result="fail"/><test-result test-name="test_simple_class_xml_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="fail"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="fail"/><test-result test-name="test_codecvt_null" result="fail"/><test-result test-name="test_registered_xml_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_binary_archive" result="fail"/><test-result test-name="test_multiple_ptrs_text_warchive" result="fail"/><test-result test-name="test_unregistered_binary_archive" result="fail"/><test-result test-name="test_derived_class_xml_warchive" result="fail"/><test-result test-name="test_object_xml_warchive" result="fail"/><test-result test-name="test_class_info_load_text_archive" result="fail"/><test-result test-name="test_binary_binary_archive" result="fail"/><test-result test-name="test_demo_xml" result="fail"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_map_xml_archive" result="fail"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_static_warning" result="fail"/><test-result test-name="test_derived_text_archive" result="fail"/><test-result test-name="test_non_intrusive_text_archive" result="fail"/><test-result test-name="test_class_info_load_binary_archive" result="fail"/><test-result test-name="test_derived_class_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_tracking_xml_warchive" result="fail"/><test-result test-name="test_binary_text_warchive" result="fail"/><test-result test-name="test_recursion_xml_archive" result="fail"/><test-result test-name="test_derived_class_binary_archive" result="fail"/><test-result test-name="test_class_info_save_binary_archive" result="fail"/><test-result test-name="test_derived_class_text_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="fail"/><test-result test-name="test_utf8_codecvt" result="fail"/><test-result test-name="test_non_intrusive_xml_archive" result="fail"/><test-result test-name="test_binary_xml_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="fail"/><test-result test-name="test_recursion_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_archive" result="fail"/><test-result test-name="test_set_binary_archive" result="fail"/><test-result test-name="test_deque_binary_archive" result="fail"/><test-result test-name="test_set_text_archive" result="fail"/><test-result test-name="test_list_xml_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_text_archive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_archive" result="fail"/><test-result test-name="test_optional_xml_archive" result="fail"/><test-result test-name="test_array_text_warchive" result="fail"/><test-result test-name="test_vector_xml_archive" result="fail"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_null_ptr_text_warchive" result="fail"/><test-result test-name="test_recursion_text_warchive" result="fail"/><test-result test-name="test_exported_text_archive" result="fail"/><test-result test-name="test_multiple_ptrs_text_archive" result="fail"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_null_ptr_text_archive" result="fail"/><test-result test-name="test_unregistered_text_archive" result="fail"/><test-result test-name="test_nvp_binary_archive" result="fail"/><test-result test-name="test_object_text_warchive" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="fail"/><test-result test-name="test_class_info_load_xml_warchive" result="fail"/><test-result test-name="test_map_binary_archive" result="fail"/><test-result test-name="test_primitive_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor_text_archive" result="fail"/><test-result test-name="test_derived_xml_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_text_warchive" result="fail"/><test-result test-name="test_binary_xml_archive" result="fail"/><test-result test-name="test_non_intrusive_xml_warchive" result="fail"/><test-result test-name="test_deque_text_warchive" result="fail"/><test-result test-name="test_non_intrusive_binary_archive" result="fail"/><test-result test-name="test_primitive_text_warchive" result="fail"/><test-result test-name="test_list_ptrs_text_archive" result="fail"/><test-result test-name="test_list_ptrs_text_warchive" result="fail"/><test-result test-name="test_demo_polymorphic" result="fail"/><test-result test-name="test_list_ptrs_xml_archive" result="fail"/><test-result test-name="test_derived_class_ptr_text_warchive" result="fail"/><test-result test-name="test_contained_class_binary_archive" result="fail"/><test-result test-name="test_list_text_archive" result="fail"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_polymorphic_xml_archive" result="fail"/><test-result test-name="test_contained_class_text_archive" result="fail"/><test-result test-name="test_set_xml_warchive" result="fail"/></library>
-<library name="filesystem"><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
-<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
-<library name="random"><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/></library>
-<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="fail"/><test-result test-name="minimal" result="success"/><test-result test-name="polymorphism" result="fail"/><test-result test-name="args" result="fail"/><test-result test-name="extract" result="fail"/><test-result test-name="auto_ptr" result="fail"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="fail"/><test-result test-name="test_pointer_adoption" result="fail"/><test-result test-name="try" result="fail"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="fail"/><test-result test-name="implicit" result="fail"/><test-result test-name="vector_indexing_suite" result="fail"/><test-result test-name="pickle1" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="fail"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="data_members" result="fail"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="fail"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="fail"/><test-result test-name="exception_translator" result="fail"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="fail"/><test-result test-name="builtin_converters" result="fail"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="fail"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="fail"/><test-result test-name="iterator" result="fail"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="enum" result="fail"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="fail"/><test-result test-name="callbacks" result="fail"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/></library>
-<library name="spirit"><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="match_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="chset_tests" result="fail"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="chset_tests_debug" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="action_tests" result="fail"/></library>
-<library name="thread"><test-result test-name="test_condition_lib" result="fail"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="fail"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_read_write_mutex_lib" result="fail"/><test-result test-name="test_once_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="fail"/><test-result test-name="test_thread_lib" result="fail"/><test-result test-name="test_xtime_lib" result="fail"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_read_write_mutex" result="success"/></library>
-<library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="fail"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="fail"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="fail"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="fail"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="numeric/interval"><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="add" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="det" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="cmp_lex" result="success"/></library>
-<library name="utility"><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="result_of_test" result="fail"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/></library>
-<library name="multi_array"><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="resize" result="fail"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="assign_to_array" result="fail"/><test-result test-name="range1" result="success"/><test-result test-name="iterators" result="fail"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="compare" result="fail"/><test-result test-name="index_bases" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="stl_interaction" result="fail"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="constructors" result="fail"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="assign" result="fail"/><test-result test-name="concept_checks" result="fail"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="access" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="fail_criterator" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_conv_iterators" result="fail"/><test-result test-name="test_capacity" result="fail"/><test-result test-name="test_copy_assignment" result="fail"/><test-result test-name="test_range" result="fail"/><test-result test-name="test_projection" result="fail"/><test-result test-name="test_iterators" result="fail"/><test-result test-name="test_special_set_ops" result="fail"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_composite_key" result="fail"/><test-result test-name="test_modifiers" result="fail"/><test-result test-name="test_basic" result="fail"/><test-result test-name="test_mpl_ops" result="fail"/><test-result test-name="test_special_list_ops" result="fail"/><test-result test-name="test_comparison" result="fail"/><test-result test-name="test_update" result="fail"/><test-result test-name="test_list_ops" result="fail"/><test-result test-name="test_safe_mode" result="fail"/><test-result test-name="test_set_ops" result="fail"/></library>
-<library name="optional"><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/></library>
-<library name="program_options"><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="positional_options_test" result="fail"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="options_description_test" result="fail"/><test-result test-name="parsers_test" result="fail"/><test-result test-name="cmdline_test" result="fail"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="winmain_dll" result="fail"/><test-result test-name="variable_map_test" result="fail"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="winmain" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/></library>
-<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="fail"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="fail"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
-<library name="tokenizer"><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/></library>
-<library name="lambda"><test-result test-name="bll_and_function" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="member_pointer_test" result="fail"/><test-result test-name="control_structures" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/></library>
-<library name="config"><test-result test-name="config_info" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
+<library name="function"><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="function_30" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_unit_test" result="success"/><test-result test-name="ios_state_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/></library>
+<library name="iterator"><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_io_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/></library>
+<library name="mpl"><test-result test-name="for_each" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="if" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="constructors" result="success"/><test-result test-name="access" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="concept_checks" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="udt_example_0" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="det" result="fail"/><test-result test-name="fmod" result="success"/><test-result test-name="mul" result="fail"/><test-result test-name="overflow" result="fail"/><test-result test-name="pi" result="fail"/><test-result test-name="pow" result="fail"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="test_float" result="fail"/><test-result test-name="integer" result="fail"/></library>
+<library name="numeric/ublas"><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="concepts" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="ptr_vector" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="indirect_fun" result="success"/></library>
+<library name="random"><test-result test-name="random_test" result="fail"/><test-result test-name="random_demo" result="success"/></library>
+<library name="range"><test-result test-name="array" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/></library>
+<library name="spirit"><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="config"><test-result test-name="config_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="limits_test" result="fail"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
+<library name="tuple"><test-result test-name="tuple_test_bench" result="success"/><test-result test-name="io_test" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="acc0605">
+<toolset-alias name="acc"/>
+<library name="test"><test-result test-name="class_properties_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="errors_handling_test" result="fail"/><test-result test-name="online_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/></library>
+<library name="regex"><test-result test-name="regex_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="static_mutex_test" result="fail"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="concept_check" result="fail"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="fail"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/></library>
+<library name="date_time"><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_input_facet" result="fail"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet_dll" result="fail"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_input_facet" result="fail"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testparse_date" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testlocal_time" result="fail"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="fail"/><test-result test-name="testclocks" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="fail"/><test-result test-name="test_variant_text_archive_dll" result="fail"/><test-result test-name="test_variant_text_warchive" result="fail"/><test-result test-name="test_variant_text_warchive_dll" result="fail"/><test-result test-name="test_variant_binary_archive" result="fail"/><test-result test-name="test_variant_binary_archive_dll" result="fail"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="fail"/><test-result test-name="test_demo_portable_archive_dll" result="fail"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_const_pass" result="success"/></library>
+<library name="filesystem"><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="large_file_support_test" result="success"/></library>
+<library name="graph"><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="fail"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="layout_test" result="fail"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="property_iter" result="success"/></library>
+<library name="program_options"><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_thread" result="fail"/><test-result test-name="test_mutex" result="fail"/><test-result test-name="test_condition" result="fail"/><test-result test-name="test_tss" result="fail"/><test-result test-name="test_once" result="fail"/><test-result test-name="test_xtime" result="fail"/><test-result test-name="test_barrier" result="fail"/><test-result test-name="test_thread_lib" result="fail"/><test-result test-name="test_mutex_lib" result="fail"/><test-result test-name="test_condition_lib" result="fail"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_once_lib" result="fail"/><test-result test-name="test_xtime_lib" result="fail"/><test-result test-name="test_barrier_lib" result="fail"/></library>
+<library name="wave"><test-result test-name="testwave" result="fail"/><test-result test-name="test_slex_lexer" result="fail"/><test-result test-name="test_re2c_lexer" result="fail"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="find" result="success"/><test-result test-name="split" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="regex" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/></library>
+<library name="bind"><test-result test-name="bind_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/></library>
+<library name="conversion"><test-result test-name="implicit_cast" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
+<library name="concept_check"><test-result test-name="stl_concept_covering" result="fail"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="class_concept_check_test" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="fail"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="fail"/><test-result test-name="format_test3" result="fail"/><test-result test-name="format_test_wstring" result="success"/></library>
+<library name="function"><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="function_30" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_unit_test" result="success"/><test-result test-name="ios_state_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="fail"/><test-result test-name="component_access_test" result="fail"/><test-result test-name="compose_test" result="fail"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="fail"/><test-result test-name="direct_adapter_test" result="fail"/><test-result test-name="example_test" result="fail"/><test-result test-name="file_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="filtering_stream_test" result="fail"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="fail"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="fail"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="fail"/><test-result test-name="restrict_test" result="fail"/><test-result test-name="seekable_file_test" result="fail"/><test-result test-name="seekable_filter_test" result="fail"/><test-result test-name="stdio_filter_test" result="fail"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="fail"/><test-result test-name="wide_stream_test" result="success"/></library>
+<library name="iterator"><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_traits_test" result="fail"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="fail"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_io_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/></library>
+<library name="mpl"><test-result test-name="for_each" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="fail"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="fail"/><test-result test-name="insert_range" result="fail"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="fail"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="fail"/><test-result test-name="stable_partition" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="constructors" result="success"/><test-result test-name="access" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="concept_checks" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="traits_test" result="fail"/><test-result test-name="converter_test" result="fail"/><test-result test-name="udt_support_test" result="fail"/><test-result test-name="numeric_cast_test" result="fail"/><test-result test-name="udt_example_0" result="fail"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="det" result="fail"/><test-result test-name="fmod" result="success"/><test-result test-name="mul" result="fail"/><test-result test-name="overflow" result="fail"/><test-result test-name="pi" result="fail"/><test-result test-name="pow" result="fail"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="test_float" result="fail"/><test-result test-name="integer" result="fail"/></library>
+<library name="numeric/ublas"><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="concepts" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="ptr_vector" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="indirect_fun" result="success"/></library>
+<library name="random"><test-result test-name="random_test" result="fail"/><test-result test-name="random_demo" result="success"/></library>
+<library name="range"><test-result test-name="array" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/></library>
+<library name="spirit"><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="fail"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="config"><test-result test-name="config_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
-<library name="integer"><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
-<library name="rational"><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/></library>
-<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
-<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="pool"><test-result test-name="test_pool_alloc" result="fail"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
-<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-</toolset><toolset name="gcc-3.4.2-linux"><library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
+<library name="tuple"><test-result test-name="tuple_test_bench" result="success"/><test-result test-name="io_test" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="gcc-4.0.2-linux">
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="any"><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/></library>
 <library name="mpl"><test-result test-name="lambda_args" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="always" result="success"/><test-result test-name="next" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="map" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="size" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="set" result="success"/><test-result test-name="back" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="if" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="front" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="int" result="success"/><test-result test-name="count" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="partition" result="success"/></library>
-<library name="bind"><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
+<library name="bind"><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
 <library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/></library>
-<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="fail"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
+<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/></library>
+<library name="wave"><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="testwave" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="floyd_warshall_test" result="success"/></library>
 <library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/></library>
-<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
-<library name="range"><test-result test-name="string_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
-<library name="date_time"><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
+<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
+<library name="range"><test-result test-name="std_container" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="string" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="partial_workaround" result="success"/></library>
+<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
+<library name="date_time"><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
 <library name="signals"><test-result test-name="signal_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="link_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_deque_test" result="success"/></library>
 <library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="container" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/></library>
-<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/></library>
+<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
-<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/></library>
-<library name="filesystem"><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="static_assert"><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/></library>
+<library name="iostreams"><test-result test-name="counter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="bzip2_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="operations_test_dll" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
 <library name="random"><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/></library>
-<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="args" result="success"/><test-result test-name="extract" result="fail"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pickle1" result="fail"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="fail"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="fail"/><test-result test-name="pickle4" result="fail"/><test-result test-name="data_members" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="fail"/><test-result test-name="exception_translator" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="success"/><test-result test-name="builtin_converters" result="fail"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="fail"/><test-result test-name="enum" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/></library>
-<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/></library>
-<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/></library>
+<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="args" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/></library>
+<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="primitives_tests" result="success"/></library>
+<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/></library>
 <library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
 <library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
 <library name="numeric/interval"><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="add" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="det" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="cmp_lex" result="success"/></library>
 <library name="utility"><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="member_templates" result="success"/><test-result test-name="partial_specializations" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="namespace_disambiguation" result="success"/></library>
 <library name="multi_array"><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="access" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="fail_criterator" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/><test-result test-name="sfinae" result="success"/></library>
 <library name="optional"><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/></library>
 <library name="program_options"><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test_dll" result="success"/></library>
-<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="tree_test" result="success"/></library>
+<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/></library>
 <library name="lambda"><test-result test-name="bll_and_function" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/></library>
 <library name="config"><test-result test-name="config_info" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
 <library name="rational"><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-</toolset><toolset name="gcc-3.2.3-linux"><library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+</toolset>
+<toolset name="intel-9.0-linux">
+<toolset-alias name="intel-linux-9.0"/>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="any"><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/></library>
 <library name="mpl"><test-result test-name="lambda_args" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="always" result="success"/><test-result test-name="next" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="map" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="size" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="set" result="success"/><test-result test-name="back" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="if" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="front" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="int" result="success"/><test-result test-name="count" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="partition" result="success"/></library>
-<library name="bind"><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
+<library name="bind"><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
 <library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/></library>
-<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="fail"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
+<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/></library>
+<library name="wave"><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="testwave" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="floyd_warshall_test" result="success"/></library>
 <library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/></library>
-<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
-<library name="range"><test-result test-name="string_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
-<library name="date_time"><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
+<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
+<library name="range"><test-result test-name="std_container" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="string" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="partial_workaround" result="success"/></library>
+<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
+<library name="date_time"><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
 <library name="signals"><test-result test-name="signal_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="link_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_deque_test" result="success"/></library>
 <library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="container" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/></library>
-<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/></library>
+<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
-<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/></library>
-<library name="filesystem"><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="static_assert"><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/></library>
+<library name="iostreams"><test-result test-name="counter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="bzip2_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="operations_test_dll" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
 <library name="random"><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/></library>
-<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="args" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/></library>
-<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/></library>
-<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/></library>
-<library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="fail"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
+<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="primitives_tests" result="success"/></library>
+<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/></library>
+<library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
 <library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
 <library name="numeric/interval"><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="add" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="det" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="cmp_lex" result="success"/></library>
 <library name="utility"><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="member_templates" result="success"/><test-result test-name="partial_specializations" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="namespace_disambiguation" result="success"/></library>
 <library name="multi_array"><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="access" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="fail_criterator" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/><test-result test-name="sfinae" result="success"/></library>
 <library name="optional"><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/></library>
 <library name="program_options"><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test_dll" result="success"/></library>
-<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="tree_test" result="success"/></library>
+<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/></library>
 <library name="lambda"><test-result test-name="bll_and_function" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/></library>
 <library name="config"><test-result test-name="config_info" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
 <library name="rational"><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-</toolset><toolset name="intel-8.0-linux"><library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+</toolset>
+<toolset name="gcc-3.2.3-linux">
+<toolset-alias name="gcc-3.2.3_linux"/>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="any"><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/></library>
 <library name="mpl"><test-result test-name="lambda_args" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="always" result="success"/><test-result test-name="next" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="map" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="size" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="set" result="success"/><test-result test-name="back" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="if" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="front" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="int" result="success"/><test-result test-name="count" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="partition" result="success"/></library>
-<library name="bind"><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
+<library name="bind"><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
 <library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/></library>
-<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
+<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/></library>
+<library name="wave"><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="testwave" result="fail"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="floyd_warshall_test" result="success"/></library>
 <library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/></library>
-<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
-<library name="range"><test-result test-name="string_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
-<library name="date_time"><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
+<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
+<library name="range"><test-result test-name="std_container" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="string" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="partial_workaround" result="success"/></library>
+<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
+<library name="date_time"><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
 <library name="signals"><test-result test-name="signal_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="link_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_deque_test" result="success"/></library>
 <library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="container" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/></library>
-<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/></library>
+<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
-<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="fail"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="fail"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="fail"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="fail"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/></library>
-<library name="filesystem"><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="static_assert"><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/></library>
+<library name="iostreams"><test-result test-name="counter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="bzip2_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="operations_test_dll" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
 <library name="random"><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/></library>
-<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="pointer_type_id_test" result="success"/></library>
-<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/></library>
-<library name="thread"><test-result test-name="test_condition_lib" result="fail"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="fail"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_read_write_mutex_lib" result="fail"/><test-result test-name="test_once_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="fail"/><test-result test-name="test_thread_lib" result="fail"/><test-result test-name="test_xtime_lib" result="fail"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_read_write_mutex" result="success"/></library>
-<library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
+<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="args" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/></library>
+<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="primitives_tests" result="success"/></library>
+<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/></library>
+<library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="fail"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
 <library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
 <library name="numeric/interval"><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="add" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="det" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="cmp_lex" result="success"/></library>
 <library name="utility"><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="member_templates" result="success"/><test-result test-name="partial_specializations" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="no_disambiguation" result="fail"/><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="namespace_disambiguation" result="success"/></library>
 <library name="multi_array"><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="access" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="fail_criterator" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/><test-result test-name="sfinae" result="success"/></library>
 <library name="optional"><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/></library>
 <library name="program_options"><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test_dll" result="success"/></library>
-<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="tree_test" result="success"/></library>
+<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/></library>
 <library name="lambda"><test-result test-name="bll_and_function" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/></library>
 <library name="config"><test-result test-name="config_info" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
 <library name="rational"><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-</toolset><toolset name="gcc-3.4.3-linux"><library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+</toolset>
+<toolset name="gcc-3.3.6-linux">
+<toolset-alias name="gcc-3.3.6_linux"/>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="any"><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/></library>
+<library name="mpl"><test-result test-name="lambda_args" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="always" result="success"/><test-result test-name="next" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="map" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="size" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="set" result="success"/><test-result test-name="back" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="if" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="front" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="int" result="success"/><test-result test-name="count" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="bind"><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/></library>
+<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="errors_handling_test" result="success"/></library>
+<library name="wave"><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="testwave" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="testwave" result="fail"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="adj_list_cc" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="function_test_fail1" result="success"/></library>
+<library name="range"><test-result test-name="std_container" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="string" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="string" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="array" result="success"/></library>
+<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="regex_timer" result="success"/></library>
+<library name="date_time"><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/></library>
+<library name="signals"><test-result test-name="signal_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="trackable_test" result="success"/><test-result test-name="trackable_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="link_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="link_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_number_test" result="success"/></library>
+<library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="basic" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/></library>
+<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/><test-result test-name="format_test_wstring" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test1" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="static_assert"><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_not_serializable" result="success"/></library>
+<library name="iostreams"><test-result test-name="counter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="gzip_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="operations_test_dll" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
+<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/><test-result test-name="variant_visit_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test1" result="success"/></library>
+<library name="random"><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
+<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="args" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="str" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="long" result="success"/><test-result test-name="list" result="success"/><test-result test-name="object" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="try" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="args" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="crossmod_exception" result="success"/></library>
+<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/></library>
+<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_thread" result="success"/></library>
+<library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="fail"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="concepts" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="bounds_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="add" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="det" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="det" result="success"/><test-result test-name="add" result="success"/><test-result test-name="integer" result="success"/></library>
+<library name="utility"><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="checked_delete_test" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="member_templates" result="success"/><test-result test-name="partial_specializations" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="constructors" result="success"/></library>
+<library name="multi_array"><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="access" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="access" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_cbracket" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="basics" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/></library>
+<library name="program_options"><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="options_description_test" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_vector" result="success"/></library>
+<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="tokenizer"><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="examples" result="success"/></library>
+<library name="lambda"><test-result test-name="bll_and_function" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/></library>
+<library name="config"><test-result test-name="config_info" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="test_thread_fail1" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="list" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="control" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="array" result="success"/><test-result test-name="arithmetic" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/><test-result test-name="timer_test" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/><test-result test-name="crc_test" result="success"/></library>
+<library name="integer"><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_traits_test" result="success"/><test-result test-name="integer_traits_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/></library>
+<library name="rational"><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/></library>
+<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/><test-result test-name="function_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="success"/><test-result test-name="test_pool_alloc" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/><test-result test-name="array5" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array1" result="success"/></library>
+</toolset>
+<toolset name="intel-8.1-linux">
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="any"><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/></library>
 <library name="mpl"><test-result test-name="lambda_args" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="always" result="success"/><test-result test-name="next" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="map" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="size" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="set" result="success"/><test-result test-name="back" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="if" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="front" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="int" result="success"/><test-result test-name="count" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="partition" result="success"/></library>
-<library name="bind"><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
+<library name="bind"><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
 <library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/></library>
-<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="fail"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
+<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/></library>
+<library name="wave"><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="testwave" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="floyd_warshall_test" result="success"/></library>
 <library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/></library>
-<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
-<library name="range"><test-result test-name="string_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
-<library name="date_time"><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
+<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
+<library name="range"><test-result test-name="std_container" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="string" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="partial_workaround" result="success"/></library>
+<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
+<library name="date_time"><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
 <library name="signals"><test-result test-name="signal_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="link_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_deque_test" result="success"/></library>
 <library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="container" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/></library>
-<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/></library>
+<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
-<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/></library>
-<library name="filesystem"><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="static_assert"><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/></library>
+<library name="iostreams"><test-result test-name="counter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="bzip2_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="operations_test_dll" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
 <library name="random"><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/></library>
-<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="args" result="success"/><test-result test-name="extract" result="fail"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pickle1" result="fail"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="fail"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="fail"/><test-result test-name="pickle4" result="fail"/><test-result test-name="data_members" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="fail"/><test-result test-name="exception_translator" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="success"/><test-result test-name="builtin_converters" result="fail"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="fail"/><test-result test-name="enum" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/></library>
-<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/></library>
-<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/></library>
+<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="primitives_tests" result="success"/></library>
+<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/></library>
 <library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
 <library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
 <library name="numeric/interval"><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="add" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="det" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="cmp_lex" result="success"/></library>
 <library name="utility"><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="member_templates" result="success"/><test-result test-name="partial_specializations" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="namespace_disambiguation" result="success"/></library>
 <library name="multi_array"><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="access" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="fail_criterator" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/><test-result test-name="sfinae" result="success"/></library>
 <library name="optional"><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/></library>
 <library name="program_options"><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test_dll" result="success"/></library>
-<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="tree_test" result="success"/></library>
+<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/></library>
 <library name="lambda"><test-result test-name="bll_and_function" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/></library>
 <library name="config"><test-result test-name="config_info" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
 <library name="rational"><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-</toolset><toolset name="intel-8.1-linux"><library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+</toolset>
+<toolset name="gcc-3.4.4-linux">
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="any"><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/></library>
+<library name="mpl"><test-result test-name="lambda_args" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="always" result="success"/><test-result test-name="next" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="map" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="size" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="set" result="success"/><test-result test-name="back" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="if" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="front" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="int" result="success"/><test-result test-name="count" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="bind"><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/></library>
+<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="errors_handling_test" result="success"/></library>
+<library name="wave"><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="testwave" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="testwave" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="adj_list_cc" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="function_test_fail1" result="success"/></library>
+<library name="range"><test-result test-name="std_container" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="string" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="string" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="array" result="success"/></library>
+<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="regex_timer" result="success"/></library>
+<library name="date_time"><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/></library>
+<library name="signals"><test-result test-name="signal_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="trackable_test" result="success"/><test-result test-name="trackable_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="link_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="link_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_number_test" result="success"/></library>
+<library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="basic" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/></library>
+<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/><test-result test-name="format_test_wstring" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test1" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="static_assert"><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_not_serializable" result="success"/></library>
+<library name="iostreams"><test-result test-name="counter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="gzip_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="operations_test_dll" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
+<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/><test-result test-name="variant_visit_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test1" result="success"/></library>
+<library name="random"><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
+<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="args" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="str" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="long" result="success"/><test-result test-name="list" result="success"/><test-result test-name="object" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="try" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="args" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="crossmod_exception" result="success"/></library>
+<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/></library>
+<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_thread" result="success"/></library>
+<library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="success"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="concepts" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="bounds_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="add" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="det" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="det" result="success"/><test-result test-name="add" result="success"/><test-result test-name="integer" result="success"/></library>
+<library name="utility"><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="checked_delete_test" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="member_templates" result="success"/><test-result test-name="partial_specializations" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="constructors" result="success"/></library>
+<library name="multi_array"><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="access" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="access" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_cbracket" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="basics" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/></library>
+<library name="program_options"><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="options_description_test" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_vector" result="success"/></library>
+<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="tokenizer"><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="examples" result="success"/></library>
+<library name="lambda"><test-result test-name="bll_and_function" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/></library>
+<library name="config"><test-result test-name="config_info" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="test_thread_fail1" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="list" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="control" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="array" result="success"/><test-result test-name="arithmetic" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/><test-result test-name="timer_test" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/><test-result test-name="crc_test" result="success"/></library>
+<library name="integer"><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_traits_test" result="success"/><test-result test-name="integer_traits_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/></library>
+<library name="rational"><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/></library>
+<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/><test-result test-name="function_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="success"/><test-result test-name="test_pool_alloc" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/><test-result test-name="array5" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array1" result="success"/></library>
+</toolset>
+<toolset name="gcc-4.0.1-linux">
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="any"><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/></library>
 <library name="mpl"><test-result test-name="lambda_args" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="always" result="success"/><test-result test-name="next" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="map" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="size" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="set" result="success"/><test-result test-name="back" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="if" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="front" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="int" result="success"/><test-result test-name="count" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="partition" result="success"/></library>
-<library name="bind"><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
+<library name="bind"><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
 <library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="special_functions_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_test" result="success"/></library>
-<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
+<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/></library>
+<library name="wave"><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="testwave" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="floyd_warshall_test" result="success"/></library>
 <library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/></library>
-<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
-<library name="range"><test-result test-name="string_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
-<library name="date_time"><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
+<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
+<library name="range"><test-result test-name="std_container" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="string" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="partial_workaround" result="success"/></library>
+<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
+<library name="date_time"><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
 <library name="signals"><test-result test-name="signal_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="link_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_deque_test" result="success"/></library>
 <library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="container" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/></library>
-<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
-<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="fail"/></library>
-<library name="static_assert"><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
-<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="fail"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="fail"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_text_warchive" result="fail"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive" result="fail"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="fail"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="fail"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="fail"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="fail"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="fail"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="fail"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_const" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_split_text_warchive" result="fail"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="fail"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="fail"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="fail"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="fail"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_array_text_warchive" result="fail"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="fail"/><test-result test-name="test_recursion_text_warchive" result="fail"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_object_text_warchive" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="fail"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_deque_text_warchive" result="fail"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="fail"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="fail"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="fail"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/></library>
-<library name="filesystem"><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="find" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="predicate" result="success"/></library>
+<library name="assign"><test-result test-name="my_vector_example" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
+<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="static_assert"><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_void_cast_dll" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/></library>
+<library name="iostreams"><test-result test-name="counter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="bzip2_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="operations_test_dll" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
-<library name="random"><test-result test-name="random_test" result="fail"/><test-result test-name="random_demo" result="success"/></library>
-<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="args" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/></library>
-<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/></library>
-<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/></library>
+<library name="random"><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/></library>
+<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="args" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/></library>
+<library name="spirit"><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="while_tests_debug" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="action_tests" result="success"/><test-result test-name="primitives_tests" result="success"/></library>
+<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/></library>
 <library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
 <library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
 <library name="numeric/interval"><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="add" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="det" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="cmp_lex" result="success"/></library>
 <library name="utility"><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="member_templates" result="success"/><test-result test-name="partial_specializations" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="namespace_disambiguation" result="success"/></library>
 <library name="multi_array"><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="access" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="fail_criterator" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_basic" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_update" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/><test-result test-name="sfinae" result="success"/></library>
 <library name="optional"><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/></library>
 <library name="program_options"><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="winmain_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test_dll" result="success"/></library>
-<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_list" result="fail"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="view_example" result="success"/><test-result test-name="tree_test" result="success"/></library>
+<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/></library>
 <library name="lambda"><test-result test-name="bll_and_function" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/></library>
-<library name="config"><test-result test-name="config_info" result="success"/><test-result test-name="limits_test" result="fail"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
+<library name="config"><test-result test-name="config_info" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_test" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
 <library name="rational"><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-</toolset><toolset name="gcc-2.95.3-linux"><library name="io"><test-result test-name="ios_state_test" result="fail"/><test-result test-name="ios_state_unit_test" result="fail"/></library>
-<library name="mpl"><test-result test-name="lambda_args" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="always" result="success"/><test-result test-name="next" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="zip_view" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="has_xxx" result="fail"/><test-result test-name="set_c" result="fail"/><test-result test-name="advance" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="map" result="fail"/><test-result test-name="same_as" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="size" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="set" result="fail"/><test-result test-name="back" result="success"/><test-result test-name="as_sequence" result="fail"/><test-result test-name="copy" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="if" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="is_sequence" result="fail"/><test-result test-name="at" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="front" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="int" result="success"/><test-result test-name="count" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="partition" result="success"/></library>
-<library name="bind"><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
-<library name="math"><test-result test-name="common_factor_test" result="fail"/><test-result test-name="special_functions_test" result="fail"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="octonion_test" result="fail"/><test-result test-name="quaternion_test" result="fail"/></library>
-<library name="test"><test-result test-name="test_case_template_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="basic_cstring_test" result="fail"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
+</toolset>
+<toolset name="borland-5.6.4">
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="fail"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="fail"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="fail"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="fail"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="fail"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="fail"/><test-result test-name="testdate_facet_new_dll" result="fail"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="fail"/><test-result test-name="testlocal_time_facet" result="fail"/><test-result test-name="testlocal_time_input_facet" result="fail"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="fail"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="fail"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="fail"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtz_database" result="fail"/><test-result test-name="testwrapping_int" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="layout_test" result="success"/></library>
-<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_io_test" result="fail"/><test-result test-name="tribool_rename_test" result="success"/></library>
-<library name="function"><test-result test-name="function_30" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/></library>
-<library name="range"><test-result test-name="string_test" result="fail"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_range" result="fail"/><test-result test-name="reversible_range_test" result="fail"/><test-result test-name="array_test" result="fail"/><test-result test-name="iterator_pair_test" result="fail"/><test-result test-name="sub_range" result="fail"/><test-result test-name="const_ranges" result="fail"/><test-result test-name="std_container_test" result="fail"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="regex_grep_example_2" result="success"/></library>
-<library name="date_time"><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testfacet" result="fail"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testtime_wstream_std_config" result="fail"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testgreg_cal" result="success"/></library>
-<library name="signals"><test-result test-name="signal_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="algorithm/minmax"><test-result test-name="minmax_element" result="success"/><test-result test-name="minmax" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="trim" result="fail"/><test-result test-name="find" result="fail"/><test-result test-name="regex" result="fail"/><test-result test-name="conv" result="fail"/><test-result test-name="container" result="fail"/><test-result test-name="replace" result="fail"/><test-result test-name="split" result="fail"/><test-result test-name="predicate" result="fail"/></library>
-<library name="assign"><test-result test-name="my_vector_example" result="fail"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="email_example" result="fail"/></library>
-<library name="smart_ptr"><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="fail"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/></library>
-<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="fail"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test" result="success"/></library>
-<library name="serialization"><test-result test-name="test_cyclic_ptrs_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_xml_archive" result="fail"/><test-result test-name="test_primitive_xml_archive" result="fail"/><test-result test-name="test_simple_class_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="fail"/><test-result test-name="test_exported_xml_warchive" result="fail"/><test-result test-name="test_tracking_xml_archive" result="fail"/><test-result test-name="test_list_ptrs_binary_archive" result="fail"/><test-result test-name="test_split_binary_archive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_text_archive" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_demo_portable_archive" result="fail"/><test-result test-name="test_null_ptr_xml_warchive" result="fail"/><test-result test-name="test_traits_pass" result="fail"/><test-result test-name="test_unregistered_xml_warchive" result="fail"/><test-result test-name="test_nvp_text_archive" result="fail"/><test-result test-name="test_polymorphic_text_archive" result="fail"/><test-result test-name="test_object_binary_archive" result="fail"/><test-result test-name="test_class_info_save_xml_archive" result="fail"/><test-result test-name="test_delete_pointer_binary_archive" result="fail"/><test-result test-name="test_derived_class_ptr_binary_archive" result="fail"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor_xml_warchive" result="fail"/><test-result test-name="test_class_info_save_text_warchive" result="fail"/><test-result test-name="test_array_text_archive" result="fail"/><test-result test-name="test_set_text_warchive" result="fail"/><test-result test-name="test_deque_text_archive" result="fail"/><test-result test-name="test_simple_class_text_warchive" result="fail"/><test-result test-name="test_null_ptr_xml_archive" result="fail"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_list_ptrs_xml_warchive" result="fail"/><test-result test-name="test_no_rtti_text_archive" result="fail"/><test-result test-name="test_diamond_xml_archive" result="fail"/><test-result test-name="test_map_text_archive" result="fail"/><test-result test-name="test_optional_text_archive" result="fail"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_list_xml_warchive" result="fail"/><test-result test-name="test_derived_binary_archive" result="fail"/><test-result test-name="test_contained_class_xml_warchive" result="fail"/><test-result test-name="test_list_text_warchive" result="fail"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_object_xml_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="fail"/><test-result test-name="test_nvp_text_warchive" result="fail"/><test-result test-name="test_optional_binary_archive" result="fail"/><test-result test-name="test_unregistered_xml_archive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_delete_pointer_text_warchive" result="fail"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_delete_pointer_text_archive" result="fail"/><test-result test-name="test_vector_text_archive" result="fail"/><test-result test-name="test_deque_xml_archive" result="fail"/><test-result test-name="test_polymorphic_text_warchive" result="fail"/><test-result test-name="test_smart_cast" result="fail"/><test-result test-name="test_nvp_xml_warchive" result="fail"/><test-result test-name="test_polymorphic_xml_warchive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_archive" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_vector_text_warchive" result="fail"/><test-result test-name="test_exported_binary_archive" result="fail"/><test-result test-name="test_iterators_base64" result="fail"/><test-result test-name="test_no_rtti_binary_archive" result="fail"/><test-result test-name="test_class_info_load_xml_archive" result="fail"/><test-result test-name="test_polymorphic_binary_archive" result="fail"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_array_xml_warchive" result="fail"/><test-result test-name="test_contained_class_text_warchive" result="fail"/><test-result test-name="test_deque_xml_warchive" result="fail"/><test-result test-name="test_contained_class_xml_archive" result="fail"/><test-result test-name="test_optional_text_warchive" result="fail"/><test-result test-name="test_array_binary_archive" result="fail"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_text_archive" result="fail"/><test-result test-name="test_split_text_archive" result="fail"/><test-result test-name="test_map_xml_warchive" result="fail"/><test-result test-name="test_optional_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive" result="fail"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_primitive_text_archive" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="fail"/><test-result test-name="test_derived_class_ptr_text_archive" result="fail"/><test-result test-name="test_recursion_binary_archive" result="fail"/><test-result test-name="test_tracking_binary_archive" result="fail"/><test-result test-name="test_class_info_save_text_archive" result="fail"/><test-result test-name="test_simple_class_text_archive" result="fail"/><test-result test-name="test_registered_binary_archive" result="fail"/><test-result test-name="test_derived_text_warchive" result="fail"/><test-result test-name="test_nvp_xml_archive" result="fail"/><test-result test-name="test_array_xml_archive" result="fail"/><test-result test-name="test_demo_fast_archive" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_delete_pointer_xml_warchive" result="fail"/><test-result test-name="test_vector_xml_warchive" result="fail"/><test-result test-name="test_registered_text_archive" result="fail"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_const" result="fail"/><test-result test-name="test_demo_auto_ptr" result="fail"/><test-result test-name="test_derived_class_text_archive" result="fail"/><test-result test-name="test_private_ctor" result="fail"/><test-result test-name="test_object_text_archive" result="fail"/><test-result test-name="test_iterators" result="fail"/><test-result test-name="test_exported_xml_archive" result="fail"/><test-result test-name="test_split_text_warchive" result="fail"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="fail"/><test-result test-name="test_demo_xml_save" result="fail"/><test-result test-name="test_void_cast" result="fail"/><test-result test-name="test_delete_pointer_xml_archive" result="fail"/><test-result test-name="test_tracking_text_warchive" result="fail"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_tracking_text_archive" result="fail"/><test-result test-name="test_list_binary_archive" result="fail"/><test-result test-name="test_split_xml_archive" result="fail"/><test-result test-name="test_registered_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive" result="fail"/><test-result test-name="test_split_xml_warchive" result="fail"/><test-result test-name="test_binary_text_archive" result="fail"/><test-result test-name="test_recursion_text_archive" result="fail"/><test-result test-name="test_derived_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="fail"/><test-result test-name="test_set_xml_archive" result="fail"/><test-result test-name="test_non_intrusive_text_warchive" result="fail"/><test-result test-name="test_demo_pimpl" result="fail"/><test-result test-name="test_vector_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor_xml_archive" result="fail"/><test-result test-name="test_primitive_xml_warchive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_class_info_save_xml_warchive" result="fail"/><test-result test-name="test_simple_class_xml_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="fail"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="fail"/><test-result test-name="test_codecvt_null" result="fail"/><test-result test-name="test_registered_xml_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_binary_archive" result="fail"/><test-result test-name="test_multiple_ptrs_text_warchive" result="fail"/><test-result test-name="test_unregistered_binary_archive" result="fail"/><test-result test-name="test_derived_class_xml_warchive" result="fail"/><test-result test-name="test_object_xml_warchive" result="fail"/><test-result test-name="test_class_info_load_text_archive" result="fail"/><test-result test-name="test_binary_binary_archive" result="fail"/><test-result test-name="test_demo_xml" result="fail"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_map_xml_archive" result="fail"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_static_warning" result="fail"/><test-result test-name="test_derived_text_archive" result="fail"/><test-result test-name="test_non_intrusive_text_archive" result="fail"/><test-result test-name="test_class_info_load_binary_archive" result="fail"/><test-result test-name="test_derived_class_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_tracking_xml_warchive" result="fail"/><test-result test-name="test_binary_text_warchive" result="fail"/><test-result test-name="test_recursion_xml_archive" result="fail"/><test-result test-name="test_derived_class_binary_archive" result="fail"/><test-result test-name="test_class_info_save_binary_archive" result="fail"/><test-result test-name="test_derived_class_text_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="fail"/><test-result test-name="test_utf8_codecvt" result="fail"/><test-result test-name="test_non_intrusive_xml_archive" result="fail"/><test-result test-name="test_binary_xml_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="fail"/><test-result test-name="test_recursion_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_archive" result="fail"/><test-result test-name="test_set_binary_archive" result="fail"/><test-result test-name="test_deque_binary_archive" result="fail"/><test-result test-name="test_set_text_archive" result="fail"/><test-result test-name="test_list_xml_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_text_archive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_archive" result="fail"/><test-result test-name="test_optional_xml_archive" result="fail"/><test-result test-name="test_array_text_warchive" result="fail"/><test-result test-name="test_vector_xml_archive" result="fail"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_null_ptr_text_warchive" result="fail"/><test-result test-name="test_recursion_text_warchive" result="fail"/><test-result test-name="test_exported_text_archive" result="fail"/><test-result test-name="test_multiple_ptrs_text_archive" result="fail"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_null_ptr_text_archive" result="fail"/><test-result test-name="test_unregistered_text_archive" result="fail"/><test-result test-name="test_nvp_binary_archive" result="fail"/><test-result test-name="test_object_text_warchive" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="fail"/><test-result test-name="test_class_info_load_xml_warchive" result="fail"/><test-result test-name="test_map_binary_archive" result="fail"/><test-result test-name="test_primitive_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor_text_archive" result="fail"/><test-result test-name="test_derived_xml_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_text_warchive" result="fail"/><test-result test-name="test_binary_xml_archive" result="fail"/><test-result test-name="test_non_intrusive_xml_warchive" result="fail"/><test-result test-name="test_deque_text_warchive" result="fail"/><test-result test-name="test_non_intrusive_binary_archive" result="fail"/><test-result test-name="test_primitive_text_warchive" result="fail"/><test-result test-name="test_list_ptrs_text_archive" result="fail"/><test-result test-name="test_list_ptrs_text_warchive" result="fail"/><test-result test-name="test_demo_polymorphic" result="fail"/><test-result test-name="test_list_ptrs_xml_archive" result="fail"/><test-result test-name="test_derived_class_ptr_text_warchive" result="fail"/><test-result test-name="test_contained_class_binary_archive" result="fail"/><test-result test-name="test_list_text_archive" result="fail"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_polymorphic_xml_archive" result="fail"/><test-result test-name="test_contained_class_text_archive" result="fail"/><test-result test-name="test_set_xml_warchive" result="fail"/></library>
-<library name="filesystem"><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="fstream_test" result="fail"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="convenience_test" result="success"/></library>
-<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
-<library name="random"><test-result test-name="random_test" result="success"/><test-result test-name="random_demo" result="success"/></library>
-<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="crossmod_exception" result="fail"/><test-result test-name="minimal" result="success"/><test-result test-name="polymorphism" result="fail"/><test-result test-name="args" result="fail"/><test-result test-name="extract" result="fail"/><test-result test-name="auto_ptr" result="fail"/><test-result test-name="defaults" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="slice" result="fail"/><test-result test-name="test_pointer_adoption" result="fail"/><test-result test-name="try" result="fail"/><test-result test-name="object_manager" result="success"/><test-result test-name="long" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="virtual_functions" result="fail"/><test-result test-name="implicit" result="fail"/><test-result test-name="vector_indexing_suite" result="fail"/><test-result test-name="pickle1" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="pickle2" result="fail"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="data_members" result="fail"/><test-result test-name="injected" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="polymorphism2" result="fail"/><test-result test-name="staticmethod" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="list" result="fail"/><test-result test-name="exception_translator" result="fail"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="object" result="fail"/><test-result test-name="builtin_converters" result="fail"/><test-result test-name="numpy" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="fail"/><test-result test-name="return_arg" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="opaque" result="fail"/><test-result test-name="iterator" result="fail"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="enum" result="fail"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="str" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="map_indexing_suite" result="fail"/><test-result test-name="callbacks" result="fail"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="nested" result="success"/></library>
-<library name="spirit"><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="match_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="chset_tests" result="fail"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="chset_tests_debug" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="action_tests" result="fail"/></library>
-<library name="thread"><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/></library>
-<library name="iterator"><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="is_convertible_fail" result="fail"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="fail"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_traits_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="fail"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="numeric/ublas"><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/><test-result test-name="concepts" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="fail"/><test-result test-name="udt_support_test" result="fail"/><test-result test-name="converter_test" result="fail"/><test-result test-name="traits_test" result="fail"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="numeric/interval"><test-result test-name="cmp_set" result="fail"/><test-result test-name="cmp" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="cmp_exn" result="fail"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp_tribool" result="fail"/><test-result test-name="add" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="det" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="cmp_lex" result="fail"/></library>
-<library name="utility"><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="result_of_test" result="fail"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/></library>
-<library name="multi_array"><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="resize" result="fail"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="assign_to_array" result="fail"/><test-result test-name="range1" result="success"/><test-result test-name="iterators" result="fail"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="compare" result="fail"/><test-result test-name="index_bases" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="stl_interaction" result="fail"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="constructors" result="fail"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="assign" result="fail"/><test-result test-name="concept_checks" result="fail"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="access" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="fail_criterator" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_conv_iterators" result="fail"/><test-result test-name="test_capacity" result="fail"/><test-result test-name="test_copy_assignment" result="fail"/><test-result test-name="test_range" result="fail"/><test-result test-name="test_projection" result="fail"/><test-result test-name="test_iterators" result="fail"/><test-result test-name="test_special_set_ops" result="fail"/><test-result test-name="test_key_extractors" result="fail"/><test-result test-name="test_composite_key" result="fail"/><test-result test-name="test_modifiers" result="fail"/><test-result test-name="test_basic" result="fail"/><test-result test-name="test_mpl_ops" result="fail"/><test-result test-name="test_special_list_ops" result="fail"/><test-result test-name="test_comparison" result="fail"/><test-result test-name="test_update" result="fail"/><test-result test-name="test_list_ops" result="fail"/><test-result test-name="test_safe_mode" result="fail"/><test-result test-name="test_set_ops" result="fail"/></library>
-<library name="optional"><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/></library>
-<library name="program_options"><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="positional_options_test" result="fail"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="options_description_test" result="fail"/><test-result test-name="parsers_test" result="fail"/><test-result test-name="cmdline_test" result="fail"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="winmain_dll" result="fail"/><test-result test-name="variable_map_test" result="fail"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="winmain" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/></library>
-<library name="type_traits"><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="tricky_is_enum_test" result="fail"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="udt_specialisations" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="add_const_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="is_union_test" result="success"/></library>
-<library name="tokenizer"><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/></library>
-<library name="lambda"><test-result test-name="bll_and_function" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/><test-result test-name="member_pointer_test" result="fail"/><test-result test-name="control_structures" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/></library>
-<library name="config"><test-result test-name="config_info" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="list" result="success"/><test-result test-name="array" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="control" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="debug" result="success"/></library>
-<library name="timer"><test-result test-name="timer_test" result="success"/></library>
-<library name="crc"><test-result test-name="crc_test" result="success"/></library>
-<library name="integer"><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
-<library name="rational"><test-result test-name="rational_test" result="fail"/><test-result test-name="rational_example" result="success"/></library>
-<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="functional"><test-result test-name="function_test" result="success"/></library>
-<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="pool"><test-result test-name="test_pool_alloc" result="fail"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
-<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-</toolset><toolset name="borland-5_6_4"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="container" result="fail"/><test-result test-name="conv" result="fail"/><test-result test-name="find" result="fail"/><test-result test-name="predicate" result="fail"/><test-result test-name="regex" result="fail"/><test-result test-name="replace" result="fail"/><test-result test-name="split" result="fail"/><test-result test-name="trim" result="fail"/></library>
-<library name="assign"><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="fail"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
-<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtime_wstream_std_config" result="fail"/><test-result test-name="testwrapping_int" result="success"/></library>
-<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="fail"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="fail"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="fail"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="fail"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="fail"/><test-result test-name="lib_function_test" result="fail"/><test-result test-name="mem_fun_cxx98" result="fail"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="fail"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="fail"/><test-result test-name="sum_avg_portable" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="fail"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="fail"/><test-result test-name="betweenness_centrality_test" result="fail"/><test-result test-name="bfs" result="fail"/><test-result test-name="bfs_cc" result="fail"/><test-result test-name="bundled_properties" result="fail"/><test-result test-name="copy" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="fail"/><test-result test-name="dijkstra_cc" result="fail"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="fail"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="fail"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="fail"/><test-result test-name="transitive_closure_test" result="fail"/><test-result test-name="vector_graph_cc" result="fail"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="fail"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="fail"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="fail"/><test-result test-name="lib_function_test" result="fail"/><test-result test-name="mem_fun_cxx98" result="fail"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="fail"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="fail"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="fail"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="fail"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="fail"/><test-result test-name="betweenness_centrality_test" result="fail"/><test-result test-name="bfs" result="fail"/><test-result test-name="bfs_cc" result="fail"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="fail"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="fail"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="fail"/><test-result test-name="dijkstra_cc" result="fail"/><test-result test-name="dijkstra_heap_performance" result="fail"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="fail"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="fail"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="fail"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="fail"/><test-result test-name="layout_test" result="fail"/><test-result test-name="property_iter" result="fail"/><test-result test-name="relaxed_heap_test" result="fail"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="fail"/><test-result test-name="transitive_closure_test" result="fail"/><test-result test-name="vector_graph_cc" result="fail"/></library>
 <library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="fail"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="fail"/><test-result test-name="flush_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="fail"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/></library>
 <library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="fail"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="fail"/><test-result test-name="is_convertible_fail" result="fail"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="fail"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="fail"/></library>
 <library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
 <library name="math"><test-result test-name="common_factor_test" result="fail"/><test-result test-name="octonion_test" result="fail"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="fail"/><test-result test-name="special_functions_test" result="fail"/></library>
 <library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="fail"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="fail"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="fail"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="fail"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="fail"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="fail"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="fail"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="fail"/><test-result test-name="set_c" result="fail"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="fail"/></library>
 <library name="multi_array"><test-result test-name="access" result="fail"/><test-result test-name="assign" result="fail"/><test-result test-name="assign_to_array" result="fail"/><test-result test-name="compare" result="fail"/><test-result test-name="concept_checks" result="fail"/><test-result test-name="constructors" result="fail"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="fail"/><test-result test-name="iterators" result="fail"/><test-result test-name="range1" result="fail"/><test-result test-name="reshape" result="fail"/><test-result test-name="resize" result="fail"/><test-result test-name="slice" result="fail"/><test-result test-name="stl_interaction" result="fail"/><test-result test-name="storage_order" result="fail"/></library>
-<library name="multi_index"><test-result test-name="test_basic" result="fail"/><test-result test-name="test_capacity" result="fail"/><test-result test-name="test_comparison" result="fail"/><test-result test-name="test_composite_key" result="fail"/><test-result test-name="test_conv_iterators" result="fail"/><test-result test-name="test_copy_assignment" result="fail"/><test-result test-name="test_iterators" result="fail"/><test-result test-name="test_key_extractors" result="fail"/><test-result test-name="test_list_ops" result="fail"/><test-result test-name="test_modifiers" result="fail"/><test-result test-name="test_mpl_ops" result="fail"/><test-result test-name="test_projection" result="fail"/><test-result test-name="test_range" result="fail"/><test-result test-name="test_safe_mode" result="fail"/><test-result test-name="test_set_ops" result="fail"/><test-result test-name="test_special_list_ops" result="fail"/><test-result test-name="test_special_set_ops" result="fail"/><test-result test-name="test_update" result="fail"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="fail"/><test-result test-name="converter_test" result="fail"/><test-result test-name="numeric_cast_test" result="fail"/><test-result test-name="traits_test" result="fail"/><test-result test-name="udt_support_test" result="fail"/></library>
-<library name="numeric/interval"><test-result test-name="add" result="fail"/><test-result test-name="cmp" result="fail"/><test-result test-name="cmp_exn" result="fail"/><test-result test-name="cmp_exp" result="fail"/><test-result test-name="cmp_lex" result="fail"/><test-result test-name="cmp_set" result="fail"/><test-result test-name="cmp_tribool" result="fail"/><test-result test-name="det" result="fail"/><test-result test-name="fmod" result="fail"/><test-result test-name="integer" result="fail"/><test-result test-name="mul" result="fail"/><test-result test-name="overflow" result="fail"/><test-result test-name="pi" result="fail"/><test-result test-name="pow" result="fail"/><test-result test-name="test_float" result="fail"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="fail"/><test-result test-name="test_capacity" result="fail"/><test-result test-name="test_comparison" result="fail"/><test-result test-name="test_composite_key" result="fail"/><test-result test-name="test_conv_iterators" result="fail"/><test-result test-name="test_copy_assignment" result="fail"/><test-result test-name="test_hash_ops" result="fail"/><test-result test-name="test_iterators" result="fail"/><test-result test-name="test_key_extractors" result="fail"/><test-result test-name="test_list_ops" result="fail"/><test-result test-name="test_modifiers" result="fail"/><test-result test-name="test_mpl_ops" result="fail"/><test-result test-name="test_observers" result="fail"/><test-result test-name="test_projection" result="fail"/><test-result test-name="test_range" result="fail"/><test-result test-name="test_safe_mode" result="fail"/><test-result test-name="test_serialization" result="fail"/><test-result test-name="test_set_ops" result="fail"/><test-result test-name="test_special_list_ops" result="fail"/><test-result test-name="test_special_set_ops" result="fail"/><test-result test-name="test_update" result="fail"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="fail"/><test-result test-name="converter_test" result="fail"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="fail"/><test-result test-name="udt_example_0" result="fail"/><test-result test-name="udt_support_test" result="fail"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="fail"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="fail"/><test-result test-name="mul" result="fail"/><test-result test-name="overflow" result="fail"/><test-result test-name="pi" result="fail"/><test-result test-name="pow" result="fail"/><test-result test-name="test_float" result="fail"/></library>
 <library name="numeric/ublas"><test-result test-name="concepts" result="fail"/><test-result test-name="placement_new" result="fail"/><test-result test-name="test1" result="fail"/><test-result test-name="test2" result="fail"/><test-result test-name="test3" result="fail"/><test-result test-name="test4" result="fail"/><test-result test-name="test5" result="fail"/><test-result test-name="test6" result="fail"/></library>
 <library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="fail"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
 <library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="fail"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="fail"/><test-result test-name="ptr_deque" result="fail"/><test-result test-name="ptr_list" result="fail"/><test-result test-name="ptr_map" result="fail"/><test-result test-name="ptr_set" result="fail"/><test-result test-name="ptr_vector" result="fail"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="fail"/><test-result test-name="view_example" result="fail"/></library>
 <library name="python"><test-result test-name="destroy_test" result="fail"/><test-result test-name="if_else" result="fail"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="result" result="fail"/><test-result test-name="string_literal" result="fail"/></library>
 <library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="fail"/></library>
-<library name="range"><test-result test-name="array_test" result="fail"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
-<library name="serialization"><test-result test-name="test_array_binary_archive" result="fail"/><test-result test-name="test_array_text_archive" result="fail"/><test-result test-name="test_array_text_warchive" result="fail"/><test-result test-name="test_array_xml_archive" result="fail"/><test-result test-name="test_array_xml_warchive" result="fail"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_fast_archive" result="fail"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="fail"/><test-result test-name="test_no_rtti_text_archive" result="fail"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="fail"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="fail"/><test-result test-name="test_set_xml_archive" result="fail"/><test-result test-name="test_set_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_void_cast" result="success"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="fail"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="fail"/><test-result test-name="test_const_load_fail1_nvp" result="fail"/><test-result test-name="test_const_load_fail2" result="fail"/><test-result test-name="test_const_load_fail2_nvp" result="fail"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="fail"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="fail"/><test-result test-name="test_no_rtti_binary_archive_dll" result="fail"/><test-result test-name="test_no_rtti_text_archive" result="fail"/><test-result test-name="test_no_rtti_text_archive_dll" result="fail"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_no_rtti_text_warchive_dll" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="fail"/><test-result test-name="test_no_rtti_xml_archive_dll" result="fail"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="fail"/><test-result test-name="test_set_binary_archive_dll" result="fail"/><test-result test-name="test_set_text_archive" result="fail"/><test-result test-name="test_set_text_archive_dll" result="fail"/><test-result test-name="test_set_text_warchive" result="fail"/><test-result test-name="test_set_text_warchive_dll" result="fail"/><test-result test-name="test_set_xml_archive" result="fail"/><test-result test-name="test_set_xml_archive_dll" result="fail"/><test-result test-name="test_set_xml_warchive" result="fail"/><test-result test-name="test_set_xml_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
 <library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="fail"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
-<library name="spirit"><test-result test-name="action_tests" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="chset_tests" result="fail"/><test-result test-name="chset_tests_debug" result="fail"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="file_iterator_tests" result="fail"/><test-result test-name="file_iterator_tests_debug" result="fail"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="fail"/><test-result test-name="fixed_size_queue_tests_debug" result="fail"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="match_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="position_iterator_tests" result="fail"/><test-result test-name="position_iterator_tests_debug" result="fail"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/></library>
-<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="fail"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
-<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
-<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
-<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="fail"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="fail"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="remove_bounds_test" result="fail"/><test-result test-name="remove_const_test" result="fail"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_pointer_test" result="fail"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="fail"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="fail"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="fail"/><test-result test-name="tricky_is_enum_test" result="fail"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="char_strings_test" result="fail"/><test-result test-name="char_strings_test_debug" result="fail"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="fail"/><test-result test-name="chset_tests_debug" result="fail"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="file_iterator_tests" result="fail"/><test-result test-name="file_iterator_tests_debug" result="fail"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="fail"/><test-result test-name="fixed_size_queue_tests_debug" result="fail"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="grammar_def_test" result="fail"/><test-result test-name="grammar_def_test_debug" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="group_match_bug" result="fail"/><test-result test-name="group_match_bug_debug" result="fail"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="if_p_int_as_condition_test" result="fail"/><test-result test-name="if_p_int_as_condition_test_debug" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="match_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="position_iterator_tests" result="fail"/><test-result test-name="position_iterator_tests_debug" result="fail"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="symbols_add_null" result="fail"/><test-result test-name="symbols_add_null_debug" result="fail"/><test-result test-name="symbols_find_null" result="fail"/><test-result test-name="symbols_find_null_debug" result="fail"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="fail"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="fail"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="fail"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="fail"/><test-result test-name="extent_test" result="fail"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="fail"/><test-result test-name="is_base_of_test" result="fail"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="fail"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="fail"/><test-result test-name="remove_all_extents_test" result="fail"/><test-result test-name="remove_bounds_test" result="fail"/><test-result test-name="remove_const_test" result="fail"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="fail"/><test-result test-name="remove_pointer_test" result="fail"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="fail"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="fail"/><test-result test-name="tricky_function_type_test" result="fail"/><test-result test-name="tricky_incomplete_type_test" result="fail"/><test-result test-name="tricky_is_enum_test" result="fail"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="fail"/><test-result test-name="dummy_arg_disambiguation" result="fail"/><test-result test-name="lazy" result="fail"/><test-result test-name="lazy_test" result="fail"/><test-result test-name="member_templates" result="fail"/><test-result test-name="namespace_disambiguation" result="fail"/><test-result test-name="no_disambiguation" result="fail"/><test-result test-name="partial_specializations" result="fail"/></library>
 <library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="fail"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="fail"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="fail"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="fail"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="fail"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="fail"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="fail"/></library>
+<library name="wave"><test-result test-name="testwave" result="fail"/><test-result test-name="test_re2c_lexer" result="fail"/><test-result test-name="test_slex_lexer" result="fail"/></library>
 <library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="fail"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
 <library name="lambda"><test-result test-name="algorithm_test" result="fail"/><test-result test-name="bind_tests_advanced" result="fail"/><test-result test-name="bind_tests_simple" result="fail"/><test-result test-name="bind_tests_simple_f_refs" result="fail"/><test-result test-name="bll_and_function" result="fail"/><test-result test-name="constructor_tests" result="fail"/><test-result test-name="control_structures" result="fail"/><test-result test-name="exception_test" result="fail"/><test-result test-name="extending_rt_traits" result="fail"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="fail"/><test-result test-name="member_pointer_test" result="fail"/><test-result test-name="operator_tests_simple" result="fail"/><test-result test-name="phoenix_control_structures" result="fail"/><test-result test-name="switch_construct" result="fail"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="fail"/><test-result test-name="array4" result="fail"/><test-result test-name="array5" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="fail"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
-</toolset><toolset name="cw-8_3"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="container" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
-<library name="assign"><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
-<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
+</toolset>
+<toolset name="cw-8_3">
+<toolset-alias name="cw-8.3"/>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="fail"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="fail"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="fail"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="fail"/><test-result test-name="testdate_facet_new" result="fail"/><test-result test-name="testdate_facet_new_dll" result="fail"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="fail"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="fail"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="fail"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="fail"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="fail"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="fail"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="fail"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="fail"/><test-result test-name="lib_function_test" result="fail"/><test-result test-name="mem_fun_cxx98" result="fail"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="fail"/><test-result test-name="lib_function_test" result="fail"/><test-result test-name="mem_fun_cxx98" result="fail"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
 <library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/></library>
 <library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="fail"/><test-result test-name="is_convertible_fail" result="fail"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
 <library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
 <library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
 <library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="fail"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="fail"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="fail"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="fail"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
 <library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
 <library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="fail"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
-<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="fail"/><test-result test-name="placement_new" result="fail"/><test-result test-name="test1" result="fail"/><test-result test-name="test2" result="fail"/><test-result test-name="test3" result="fail"/><test-result test-name="test4" result="fail"/><test-result test-name="test5" result="fail"/><test-result test-name="test6" result="fail"/></library>
 <library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
 <library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="fail"/></library>
-<library name="python"><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
 <library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="fail"/></library>
-<library name="range"><test-result test-name="array_test" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
-<library name="serialization"><test-result test-name="test_array_binary_archive" result="fail"/><test-result test-name="test_array_text_archive" result="fail"/><test-result test-name="test_array_text_warchive" result="fail"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_fast_archive" result="fail"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_xml" result="fail"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_demo_xml_save" result="fail"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="fail"/><test-result test-name="test_exported_text_archive" result="fail"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_exported_xml_archive" result="fail"/><test-result test-name="test_exported_xml_warchive" result="fail"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="fail"/><test-result test-name="test_no_rtti_text_archive" result="fail"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="fail"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_registered_binary_archive" result="fail"/><test-result test-name="test_registered_text_archive" result="fail"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_registered_xml_archive" result="fail"/><test-result test-name="test_registered_xml_warchive" result="fail"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_text_archive" result="fail"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="fail"/><test-result test-name="test_unregistered_text_archive" result="fail"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_unregistered_xml_archive" result="fail"/><test-result test-name="test_unregistered_xml_warchive" result="fail"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_void_cast" result="success"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_fast_archive" result="fail"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_xml" result="fail"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_demo_xml_save" result="fail"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_xml_archive" result="fail"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_exported_binary_archive" result="fail"/><test-result test-name="test_exported_text_archive" result="fail"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_exported_xml_archive" result="fail"/><test-result test-name="test_exported_xml_warchive" result="fail"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="fail"/><test-result test-name="test_no_rtti_text_archive" result="fail"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="fail"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_registered_binary_archive" result="fail"/><test-result test-name="test_registered_text_archive" result="fail"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_registered_xml_archive" result="fail"/><test-result test-name="test_registered_xml_warchive" result="fail"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_132_text_archive" result="fail"/><test-result test-name="test_shared_ptr_132_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_132_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_text_archive" result="fail"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="fail"/><test-result test-name="test_unregistered_text_archive" result="fail"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_unregistered_xml_archive" result="fail"/><test-result test-name="test_unregistered_xml_warchive" result="fail"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_void_cast" result="success"/></library>
 <library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="fail"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
-<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
-<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
-<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
-<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="fail"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="fail"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="fail"/><test-result test-name="alignment_of_test" result="fail"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="fail"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="fail"/><test-result test-name="dummy_arg_disambiguation" result="fail"/><test-result test-name="lazy" result="fail"/><test-result test-name="lazy_test" result="fail"/><test-result test-name="member_templates" result="fail"/><test-result test-name="namespace_disambiguation" result="fail"/><test-result test-name="no_disambiguation" result="fail"/><test-result test-name="partial_specializations" result="fail"/></library>
 <library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="fail"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="fail"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="fail"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/></library>
 <library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="fail"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
 <library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="fail"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="fail"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
-</toolset><toolset name="iw-7_1-vc6"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="container" result="success"/><test-result test-name="conv" result="fail"/><test-result test-name="find" result="fail"/><test-result test-name="predicate" result="fail"/><test-result test-name="regex" result="fail"/><test-result test-name="replace" result="fail"/><test-result test-name="split" result="fail"/><test-result test-name="trim" result="fail"/></library>
-<library name="assign"><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
-<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="date_time"><test-result test-name="testclock" result="fail"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="fail"/><test-result test-name="testdate" result="fail"/><test-result test-name="testdate_dll" result="fail"/><test-result test-name="testdate_duration" result="fail"/><test-result test-name="testdate_duration_dll" result="fail"/><test-result test-name="testdate_iterator" result="fail"/><test-result test-name="testdate_iterator_dll" result="fail"/><test-result test-name="testdst_rules" result="fail"/><test-result test-name="testduration" result="fail"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="fail"/><test-result test-name="testformatters" result="fail"/><test-result test-name="testformatters_dll" result="fail"/><test-result test-name="testgenerators" result="fail"/><test-result test-name="testgenerators_dll" result="fail"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="fail"/><test-result test-name="testgreg_cal_dll" result="fail"/><test-result test-name="testgreg_day" result="fail"/><test-result test-name="testgreg_day_dll" result="fail"/><test-result test-name="testgreg_durations" result="fail"/><test-result test-name="testgreg_duration_operators" result="fail"/><test-result test-name="testgreg_month" result="fail"/><test-result test-name="testgreg_month_dll" result="fail"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="fail"/><test-result test-name="testgreg_year_dll" result="fail"/><test-result test-name="testint_adapter" result="fail"/><test-result test-name="testiterator" result="fail"/><test-result test-name="testlocal_adjustor" result="fail"/><test-result test-name="testmicrosec_time_clock" result="fail"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="testparse_time" result="fail"/><test-result test-name="testperiod" result="fail"/><test-result test-name="testperiod_dll" result="fail"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="fail"/><test-result test-name="testtime_formatters" result="fail"/><test-result test-name="testtime_period" result="fail"/><test-result test-name="testtime_resolution_traits" result="fail"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtime_wstream_std_config" result="fail"/><test-result test-name="testwrapping_int" result="success"/></library>
-<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/></library>
-<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="fail"/><test-result test-name="format_test3" result="fail"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="function"><test-result test-name="allocator_test" result="fail"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="fail"/><test-result test-name="std_bind_portable" result="fail"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="fail"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+</toolset>
+<toolset name="dmc-8_44b-stlport-4_5_3">
+<library name="algorithm/minmax"><test-result test-name="minmax" result="fail"/><test-result test-name="minmax_element" result="fail"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="fail"/><test-result test-name="find" result="fail"/><test-result test-name="predicate" result="fail"/><test-result test-name="regex" result="fail"/><test-result test-name="replace" result="fail"/><test-result test-name="split" result="fail"/><test-result test-name="trim" result="fail"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="fail"/></library>
+<library name="assign"><test-result test-name="basic" result="fail"/><test-result test-name="email_example" result="fail"/><test-result test-name="list_inserter" result="fail"/><test-result test-name="list_of" result="fail"/><test-result test-name="list_of_workaround" result="fail"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="my_vector_example" result="fail"/><test-result test-name="ptr_list_inserter" result="fail"/><test-result test-name="ptr_list_of" result="fail"/><test-result test-name="static_list_of" result="fail"/><test-result test-name="std" result="fail"/><test-result test-name="tuple_list_of" result="fail"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="fail"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="fail"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="fail"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="fail"/></library>
+<library name="date_time"><test-result test-name="testclock" result="fail"/><test-result test-name="testclocks" result="fail"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="fail"/><test-result test-name="testc_local_adjustor" result="fail"/><test-result test-name="testdate" result="fail"/><test-result test-name="testdate_dll" result="fail"/><test-result test-name="testdate_duration" result="fail"/><test-result test-name="testdate_duration_dll" result="fail"/><test-result test-name="testdate_facet_new" result="fail"/><test-result test-name="testdate_facet_new_dll" result="fail"/><test-result test-name="testdate_input_facet" result="fail"/><test-result test-name="testdate_input_facet_dll" result="fail"/><test-result test-name="testdate_iterator" result="fail"/><test-result test-name="testdate_iterator_dll" result="fail"/><test-result test-name="testdst_rules" result="fail"/><test-result test-name="testdst_transition_day_rule" result="fail"/><test-result test-name="testduration" result="fail"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="fail"/><test-result test-name="testformatters" result="fail"/><test-result test-name="testformatters_dll" result="fail"/><test-result test-name="testgenerators" result="fail"/><test-result test-name="testgenerators_dll" result="fail"/><test-result test-name="testgeneric_period" result="fail"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="fail"/><test-result test-name="testgreg_cal_dll" result="fail"/><test-result test-name="testgreg_day" result="fail"/><test-result test-name="testgreg_day_dll" result="fail"/><test-result test-name="testgreg_durations" result="fail"/><test-result test-name="testgreg_durations_dll" result="fail"/><test-result test-name="testgreg_duration_operators" result="fail"/><test-result test-name="testgreg_month" result="fail"/><test-result test-name="testgreg_month_dll" result="fail"/><test-result test-name="testgreg_serialize" result="fail"/><test-result test-name="testgreg_serialize_xml" result="fail"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="fail"/><test-result test-name="testgreg_year_dll" result="fail"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="fail"/><test-result test-name="testlocal_adjustor" result="fail"/><test-result test-name="testlocal_time" result="fail"/><test-result test-name="testlocal_time_facet" result="fail"/><test-result test-name="testlocal_time_input_facet" result="fail"/><test-result test-name="testmicrosec_time_clock" result="fail"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="testparse_time" result="fail"/><test-result test-name="testperiod" result="fail"/><test-result test-name="testperiod_dll" result="fail"/><test-result test-name="testposix_time_zone" result="fail"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="fail"/><test-result test-name="testtime_facet" result="fail"/><test-result test-name="testtime_formatters" result="fail"/><test-result test-name="testtime_input_facet" result="fail"/><test-result test-name="testtime_period" result="fail"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="fail"/><test-result test-name="testtime_serialize_std_config" result="fail"/><test-result test-name="testtime_serialize_xml" result="fail"/><test-result test-name="testtime_serialize_xml_std_config" result="fail"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtz_database" result="fail"/><test-result test-name="testwrapping_int" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="fail"/><test-result test-name="dyn_bitset_unit_tests2" result="fail"/><test-result test-name="dyn_bitset_unit_tests3" result="fail"/><test-result test-name="dyn_bitset_unit_tests4" result="fail"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="fail"/><test-result test-name="default_name_check_test" result="fail"/><test-result test-name="fstream_test" result="fail"/><test-result test-name="large_file_support_test" result="fail"/><test-result test-name="operations_test" result="fail"/><test-result test-name="operations_test_dll" result="fail"/><test-result test-name="path_test" result="fail"/><test-result test-name="path_test_dll" result="fail"/></library>
+<library name="format"><test-result test-name="format_test1" result="fail"/><test-result test-name="format_test2" result="fail"/><test-result test-name="format_test3" result="fail"/><test-result test-name="format_test_wstring" result="fail"/></library>
+<library name="function"><test-result test-name="allocator_test" result="fail"/><test-result test-name="contains2_test" result="fail"/><test-result test-name="contains_test" result="fail"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="fail"/><test-result test-name="function_arith_portable" result="fail"/><test-result test-name="function_n_test" result="fail"/><test-result test-name="function_ref_cxx98" result="fail"/><test-result test-name="function_ref_portable" result="fail"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="fail"/><test-result test-name="lib_function_test" result="fail"/><test-result test-name="mem_fun_cxx98" result="fail"/><test-result test-name="mem_fun_portable" result="fail"/><test-result test-name="stateless_test" result="fail"/><test-result test-name="std_bind_cxx98" result="fail"/><test-result test-name="std_bind_portable" result="fail"/><test-result test-name="sum_avg_cxx98" result="fail"/><test-result test-name="sum_avg_portable" result="fail"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="fail"/><test-result test-name="hash_custom_test" result="fail"/><test-result test-name="hash_deque_test" result="fail"/><test-result test-name="hash_float_test" result="fail"/><test-result test-name="hash_function_pointer_test" result="fail"/><test-result test-name="hash_list_test" result="fail"/><test-result test-name="hash_map_test" result="fail"/><test-result test-name="hash_number_test" result="fail"/><test-result test-name="hash_pointer_test" result="fail"/><test-result test-name="hash_range_test" result="fail"/><test-result test-name="hash_set_test" result="fail"/><test-result test-name="hash_string_test" result="fail"/><test-result test-name="hash_value_array_test" result="fail"/><test-result test-name="hash_vector_test" result="fail"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="fail"/><test-result test-name="adj_list_cc" result="fail"/><test-result test-name="adj_matrix_cc" result="fail"/><test-result test-name="astar_search_test" result="fail"/><test-result test-name="bellman-test" result="fail"/><test-result test-name="betweenness_centrality_test" result="fail"/><test-result test-name="bfs" result="fail"/><test-result test-name="bfs_cc" result="fail"/><test-result test-name="biconnected_components_test" result="fail"/><test-result test-name="bundled_properties" result="fail"/><test-result test-name="copy" result="fail"/><test-result test-name="cuthill_mckee_ordering" result="fail"/><test-result test-name="dag_longest_paths" result="fail"/><test-result test-name="dfs" result="fail"/><test-result test-name="dfs_cc" result="fail"/><test-result test-name="dijkstra_cc" result="fail"/><test-result test-name="dijkstra_heap_performance" result="fail"/><test-result test-name="edge_list_cc" result="fail"/><test-result test-name="filtered_graph_cc" result="fail"/><test-result test-name="floyd_warshall_test" result="fail"/><test-result test-name="graph" result="fail"/><test-result test-name="graphviz_test" result="fail"/><test-result test-name="graph_concepts" result="fail"/><test-result test-name="gursoy_atun_layout_test" result="fail"/><test-result test-name="isomorphism" result="fail"/><test-result test-name="king_ordering" result="fail"/><test-result test-name="layout_test" result="fail"/><test-result test-name="property_iter" result="fail"/><test-result test-name="relaxed_heap_test" result="fail"/><test-result test-name="reverse_graph_cc" result="fail"/><test-result test-name="sequential_vertex_coloring" result="fail"/><test-result test-name="subgraph" result="fail"/><test-result test-name="transitive_closure_test" result="fail"/><test-result test-name="vector_graph_cc" result="fail"/></library>
 <library name="io"><test-result test-name="ios_state_test" result="fail"/><test-result test-name="ios_state_unit_test" result="fail"/></library>
-<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
-<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
-<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="fail"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="fail"/><test-result test-name="special_functions_test" result="fail"/></library>
-<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
-<library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
-<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="fail"/></library>
-<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
-<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
-<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
-<library name="python"><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/></library>
-<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="fail"/></library>
-<library name="range"><test-result test-name="array_test" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
-<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_void_cast" result="success"/></library>
-<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
-<library name="spirit"><test-result test-name="action_tests" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
-<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="fail"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
-<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
-<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="fail"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="fail"/><test-result test-name="is_integral_test" result="fail"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
-<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
-<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="fail"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
-<library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="fail"/><test-result test-name="limits_test" result="fail"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
-<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="fail"/><test-result test-name="auto_close_test" result="fail"/><test-result test-name="buffer_size_test" result="fail"/><test-result test-name="code_converter_test" result="fail"/><test-result test-name="component_access_test" result="fail"/><test-result test-name="compose_test" result="fail"/><test-result test-name="copy_test" result="fail"/><test-result test-name="counter_test" result="fail"/><test-result test-name="direct_adapter_test" result="fail"/><test-result test-name="example_test" result="fail"/><test-result test-name="file_descriptor_test" result="fail"/><test-result test-name="file_test" result="fail"/><test-result test-name="filtering_stream_test" result="fail"/><test-result test-name="finite_state_filter_test" result="fail"/><test-result test-name="flush_test" result="fail"/><test-result test-name="invert_test" result="fail"/><test-result test-name="line_filter_test" result="fail"/><test-result test-name="mapped_file_test" result="fail"/><test-result test-name="newline_test" result="fail"/><test-result test-name="null_test" result="fail"/><test-result test-name="pipeline_test" result="fail"/><test-result test-name="positioning_test" result="fail"/><test-result test-name="regex_filter_test" result="fail"/><test-result test-name="restrict_test" result="fail"/><test-result test-name="seekable_file_test" result="fail"/><test-result test-name="seekable_filter_test" result="fail"/><test-result test-name="stdio_filter_test" result="fail"/><test-result test-name="symmetric_filter_test" result="fail"/><test-result test-name="tee_test" result="fail"/><test-result test-name="wide_stream_test" result="fail"/></library>
+<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="fail"/><test-result test-name="filter_iterator_test" result="fail"/><test-result test-name="indirect_iterator_test" result="fail"/><test-result test-name="indirect_iter_member_types" result="fail"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="fail"/><test-result test-name="is_convertible_fail" result="fail"/><test-result test-name="is_lvalue_iterator" result="fail"/><test-result test-name="is_readable_iterator" result="fail"/><test-result test-name="iterator_adaptor_cc" result="fail"/><test-result test-name="iterator_adaptor_test" result="fail"/><test-result test-name="iterator_archetype_cc" result="fail"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="fail"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="fail"/><test-result test-name="pointee" result="fail"/><test-result test-name="reverse_iterator_test" result="fail"/><test-result test-name="transform_iterator_test" result="fail"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="fail"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="fail"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="fail"/><test-result test-name="octonion_test" result="fail"/><test-result test-name="quaternion_mult_incl_test" result="fail"/><test-result test-name="quaternion_test" result="fail"/><test-result test-name="special_functions_test" result="fail"/></library>
+<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="fail"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="fail"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="fail"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="fail"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="fail"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="access" result="fail"/><test-result test-name="assign" result="fail"/><test-result test-name="assign_to_array" result="fail"/><test-result test-name="compare" result="fail"/><test-result test-name="concept_checks" result="fail"/><test-result test-name="constructors" result="fail"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="fail"/><test-result test-name="iterators" result="fail"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="fail"/><test-result test-name="resize" result="fail"/><test-result test-name="slice" result="fail"/><test-result test-name="stl_interaction" result="fail"/><test-result test-name="storage_order" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="fail"/><test-result test-name="test_capacity" result="fail"/><test-result test-name="test_comparison" result="fail"/><test-result test-name="test_composite_key" result="fail"/><test-result test-name="test_conv_iterators" result="fail"/><test-result test-name="test_copy_assignment" result="fail"/><test-result test-name="test_hash_ops" result="fail"/><test-result test-name="test_iterators" result="fail"/><test-result test-name="test_key_extractors" result="fail"/><test-result test-name="test_list_ops" result="fail"/><test-result test-name="test_modifiers" result="fail"/><test-result test-name="test_mpl_ops" result="fail"/><test-result test-name="test_observers" result="fail"/><test-result test-name="test_projection" result="fail"/><test-result test-name="test_range" result="fail"/><test-result test-name="test_safe_mode" result="fail"/><test-result test-name="test_serialization" result="fail"/><test-result test-name="test_set_ops" result="fail"/><test-result test-name="test_special_list_ops" result="fail"/><test-result test-name="test_special_set_ops" result="fail"/><test-result test-name="test_update" result="fail"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="fail"/><test-result test-name="converter_test" result="fail"/><test-result test-name="numeric_cast_test" result="fail"/><test-result test-name="traits_test" result="fail"/><test-result test-name="udt_example_0" result="fail"/><test-result test-name="udt_support_test" result="fail"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="fail"/><test-result test-name="cmp" result="fail"/><test-result test-name="cmp_exn" result="fail"/><test-result test-name="cmp_exp" result="fail"/><test-result test-name="cmp_lex" result="fail"/><test-result test-name="cmp_set" result="fail"/><test-result test-name="cmp_tribool" result="fail"/><test-result test-name="det" result="fail"/><test-result test-name="fmod" result="fail"/><test-result test-name="integer" result="fail"/><test-result test-name="mul" result="fail"/><test-result test-name="overflow" result="fail"/><test-result test-name="pi" result="fail"/><test-result test-name="pow" result="fail"/><test-result test-name="test_float" result="fail"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="fail"/><test-result test-name="placement_new" result="fail"/><test-result test-name="test1" result="fail"/><test-result test-name="test2" result="fail"/><test-result test-name="test3" result="fail"/><test-result test-name="test4" result="fail"/><test-result test-name="test5" result="fail"/><test-result test-name="test6" result="fail"/></library>
+<library name="optional"><test-result test-name="optional_test" result="fail"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="fail"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="fail"/><test-result test-name="macros" result="fail"/><test-result test-name="sfinae" result="fail"/><test-result test-name="tutorial" result="fail"/><test-result test-name="unwrap_cv_reference" result="fail"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="fail"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="options_description_test" result="fail"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="fail"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test" result="fail"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="fail"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="fail"/><test-result test-name="winmain_dll" result="fail"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="fail"/><test-result test-name="property_map_cc" result="fail"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="fail"/><test-result test-name="indirect_fun" result="fail"/><test-result test-name="iterator_test" result="fail"/><test-result test-name="ptr_array" result="fail"/><test-result test-name="ptr_deque" result="fail"/><test-result test-name="ptr_list" result="fail"/><test-result test-name="ptr_map" result="fail"/><test-result test-name="ptr_set" result="fail"/><test-result test-name="ptr_vector" result="fail"/><test-result test-name="tree_test" result="fail"/><test-result test-name="tut1" result="fail"/><test-result test-name="view_example" result="fail"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="fail"/><test-result test-name="args" result="fail"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="fail"/><test-result test-name="back_reference" result="fail"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="fail"/><test-result test-name="bienstman1" result="fail"/><test-result test-name="bienstman2" result="fail"/><test-result test-name="bienstman3" result="fail"/><test-result test-name="borrowed" result="fail"/><test-result test-name="builtin_converters" result="fail"/><test-result test-name="callbacks" result="fail"/><test-result test-name="const_argument" result="fail"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="fail"/><test-result test-name="data_members" result="fail"/><test-result test-name="defaults" result="fail"/><test-result test-name="destroy_test" result="fail"/><test-result test-name="dict" result="fail"/><test-result test-name="docstring" result="fail"/><test-result test-name="embedding" result="fail"/><test-result test-name="enum" result="fail"/><test-result test-name="exception_translator" result="fail"/><test-result test-name="extract" result="fail"/><test-result test-name="if_else" result="fail"/><test-result test-name="implicit" result="fail"/><test-result test-name="indirect_traits_test" result="fail"/><test-result test-name="injected" result="fail"/><test-result test-name="iterator" result="fail"/><test-result test-name="keywords" result="fail"/><test-result test-name="list" result="fail"/><test-result test-name="long" result="fail"/><test-result test-name="map_indexing_suite" result="fail"/><test-result test-name="minimal" result="fail"/><test-result test-name="multi_arg_constructor" result="fail"/><test-result test-name="nested" result="fail"/><test-result test-name="numpy" result="fail"/><test-result test-name="object" result="fail"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="fail"/><test-result test-name="opaque" result="fail"/><test-result test-name="operators" result="fail"/><test-result test-name="pearu1" result="fail"/><test-result test-name="pickle1" result="fail"/><test-result test-name="pickle2" result="fail"/><test-result test-name="pickle3" result="fail"/><test-result test-name="pickle4" result="fail"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="fail"/><test-result test-name="pointer_vector" result="fail"/><test-result test-name="polymorphism" result="fail"/><test-result test-name="polymorphism2" result="fail"/><test-result test-name="polymorphism2_auto_ptr" result="fail"/><test-result test-name="properties" result="fail"/><test-result test-name="raw_ctor" result="fail"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="fail"/><test-result test-name="select_arg_to_python_test" result="fail"/><test-result test-name="select_from_python_test" result="fail"/><test-result test-name="select_holder" result="fail"/><test-result test-name="shared_ptr" result="fail"/><test-result test-name="slice" result="fail"/><test-result test-name="staticmethod" result="fail"/><test-result test-name="str" result="fail"/><test-result test-name="string_literal" result="fail"/><test-result test-name="test_pointer_adoption" result="fail"/><test-result test-name="try" result="fail"/><test-result test-name="tuple" result="fail"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="fail"/><test-result test-name="virtual_functions" result="fail"/><test-result test-name="wrapper_held_type" result="fail"/></library>
+<library name="random"><test-result test-name="random_demo" result="fail"/><test-result test-name="random_test" result="fail"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="fail"/><test-result test-name="array" result="fail"/><test-result test-name="const_ranges" result="fail"/><test-result test-name="extension_mechanism" result="fail"/><test-result test-name="iterator_pair" result="fail"/><test-result test-name="iterator_range" result="fail"/><test-result test-name="partial_workaround" result="fail"/><test-result test-name="reversible_range" result="fail"/><test-result test-name="std_container" result="fail"/><test-result test-name="string" result="fail"/><test-result test-name="sub_range" result="fail"/></library>
+<library name="regex"><test-result test-name="captures_example" result="fail"/><test-result test-name="credit_card_example" result="fail"/><test-result test-name="grep" result="fail"/><test-result test-name="icu_example" result="fail"/><test-result test-name="mfc_example" result="fail"/><test-result test-name="partial_regex_grep" result="fail"/><test-result test-name="partial_regex_match" result="fail"/><test-result test-name="regex_grep_example_1" result="fail"/><test-result test-name="regex_grep_example_2" result="fail"/><test-result test-name="regex_grep_example_3" result="fail"/><test-result test-name="regex_grep_example_4" result="fail"/><test-result test-name="regex_iterator_example" result="fail"/><test-result test-name="regex_match_example" result="fail"/><test-result test-name="regex_merge_example" result="fail"/><test-result test-name="regex_replace_example" result="fail"/><test-result test-name="regex_search_example" result="fail"/><test-result test-name="regex_split_example_1" result="fail"/><test-result test-name="regex_split_example_2" result="fail"/><test-result test-name="regex_timer" result="fail"/><test-result test-name="regex_token_iterator_eg_1" result="fail"/><test-result test-name="regex_token_iterator_eg_2" result="fail"/><test-result test-name="bad_expression_test" result="fail"/><test-result test-name="captures_test" result="fail"/><test-result test-name="collate_info" result="fail"/><test-result test-name="concept_check" result="fail"/><test-result test-name="icu_concept_check" result="fail"/><test-result test-name="object_cache_test" result="fail"/><test-result test-name="posix_api_check" result="fail"/><test-result test-name="posix_api_check_cpp" result="fail"/><test-result test-name="recursion_test" result="fail"/><test-result test-name="regex_config_info" result="fail"/><test-result test-name="regex_dll_config_info" result="fail"/><test-result test-name="regex_regress" result="fail"/><test-result test-name="regex_regress_dll" result="fail"/><test-result test-name="static_mutex_test" result="fail"/><test-result test-name="unicode_iterator_test" result="fail"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="fail"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="fail"/><test-result test-name="test_array_binary_archive_dll" result="fail"/><test-result test-name="test_array_text_archive" result="fail"/><test-result test-name="test_array_text_archive_dll" result="fail"/><test-result test-name="test_array_text_warchive" result="fail"/><test-result test-name="test_array_text_warchive_dll" result="fail"/><test-result test-name="test_array_xml_archive" result="fail"/><test-result test-name="test_array_xml_archive_dll" result="fail"/><test-result test-name="test_array_xml_warchive" result="fail"/><test-result test-name="test_array_xml_warchive_dll" result="fail"/><test-result test-name="test_binary_binary_archive" result="fail"/><test-result test-name="test_binary_binary_archive_dll" result="fail"/><test-result test-name="test_binary_text_archive" result="fail"/><test-result test-name="test_binary_text_archive_dll" result="fail"/><test-result test-name="test_binary_text_warchive" result="fail"/><test-result test-name="test_binary_text_warchive_dll" result="fail"/><test-result test-name="test_binary_xml_archive" result="fail"/><test-result test-name="test_binary_xml_archive_dll" result="fail"/><test-result test-name="test_binary_xml_warchive" result="fail"/><test-result test-name="test_binary_xml_warchive_dll" result="fail"/><test-result test-name="test_class_info_load_binary_archive" result="fail"/><test-result test-name="test_class_info_load_binary_archive_dll" result="fail"/><test-result test-name="test_class_info_load_text_archive" result="fail"/><test-result test-name="test_class_info_load_text_archive_dll" result="fail"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_class_info_load_text_warchive_dll" result="fail"/><test-result test-name="test_class_info_load_xml_archive" result="fail"/><test-result test-name="test_class_info_load_xml_archive_dll" result="fail"/><test-result test-name="test_class_info_load_xml_warchive" result="fail"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="fail"/><test-result test-name="test_class_info_save_binary_archive" result="fail"/><test-result test-name="test_class_info_save_binary_archive_dll" result="fail"/><test-result test-name="test_class_info_save_text_archive" result="fail"/><test-result test-name="test_class_info_save_text_archive_dll" result="fail"/><test-result test-name="test_class_info_save_text_warchive" result="fail"/><test-result test-name="test_class_info_save_text_warchive_dll" result="fail"/><test-result test-name="test_class_info_save_xml_archive" result="fail"/><test-result test-name="test_class_info_save_xml_archive_dll" result="fail"/><test-result test-name="test_class_info_save_xml_warchive" result="fail"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="fail"/><test-result test-name="test_codecvt_null" result="fail"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="fail"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="fail"/><test-result test-name="test_contained_class_binary_archive_dll" result="fail"/><test-result test-name="test_contained_class_text_archive" result="fail"/><test-result test-name="test_contained_class_text_archive_dll" result="fail"/><test-result test-name="test_contained_class_text_warchive" result="fail"/><test-result test-name="test_contained_class_text_warchive_dll" result="fail"/><test-result test-name="test_contained_class_xml_archive" result="fail"/><test-result test-name="test_contained_class_xml_archive_dll" result="fail"/><test-result test-name="test_contained_class_xml_warchive" result="fail"/><test-result test-name="test_contained_class_xml_warchive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_text_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="fail"/><test-result test-name="test_delete_pointer_binary_archive" result="fail"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="fail"/><test-result test-name="test_delete_pointer_text_archive" result="fail"/><test-result test-name="test_delete_pointer_text_archive_dll" result="fail"/><test-result test-name="test_delete_pointer_text_warchive" result="fail"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="fail"/><test-result test-name="test_delete_pointer_xml_archive" result="fail"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="fail"/><test-result test-name="test_delete_pointer_xml_warchive" result="fail"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="fail"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_auto_ptr" result="fail"/><test-result test-name="test_demo_auto_ptr_dll" result="fail"/><test-result test-name="test_demo_dll" result="fail"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_exception_dll" result="fail"/><test-result test-name="test_demo_fast_archive" result="fail"/><test-result test-name="test_demo_fast_archive_dll" result="fail"/><test-result test-name="test_demo_pimpl" result="fail"/><test-result test-name="test_demo_pimpl_dll" result="fail"/><test-result test-name="test_demo_polymorphic" result="fail"/><test-result test-name="test_demo_polymorphic_dll" result="fail"/><test-result test-name="test_demo_portable_archive" result="fail"/><test-result test-name="test_demo_portable_archive_dll" result="fail"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_shared_ptr_dll" result="fail"/><test-result test-name="test_demo_xml" result="fail"/><test-result test-name="test_demo_xml_dll" result="fail"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_demo_xml_load_dll" result="fail"/><test-result test-name="test_demo_xml_save" result="fail"/><test-result test-name="test_demo_xml_save_dll" result="fail"/><test-result test-name="test_deque_binary_archive" result="fail"/><test-result test-name="test_deque_binary_archive_dll" result="fail"/><test-result test-name="test_deque_text_archive" result="fail"/><test-result test-name="test_deque_text_archive_dll" result="fail"/><test-result test-name="test_deque_text_warchive" result="fail"/><test-result test-name="test_deque_text_warchive_dll" result="fail"/><test-result test-name="test_deque_xml_archive" result="fail"/><test-result test-name="test_deque_xml_archive_dll" result="fail"/><test-result test-name="test_deque_xml_warchive" result="fail"/><test-result test-name="test_deque_xml_warchive_dll" result="fail"/><test-result test-name="test_derived_binary_archive" result="fail"/><test-result test-name="test_derived_binary_archive_dll" result="fail"/><test-result test-name="test_derived_class_binary_archive" result="fail"/><test-result test-name="test_derived_class_binary_archive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_binary_archive" result="fail"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_text_archive" result="fail"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_text_warchive" result="fail"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_xml_archive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_derived_class_text_archive" result="fail"/><test-result test-name="test_derived_class_text_archive_dll" result="fail"/><test-result test-name="test_derived_class_text_warchive" result="fail"/><test-result test-name="test_derived_class_text_warchive_dll" result="fail"/><test-result test-name="test_derived_class_xml_archive" result="fail"/><test-result test-name="test_derived_class_xml_archive_dll" result="fail"/><test-result test-name="test_derived_class_xml_warchive" result="fail"/><test-result test-name="test_derived_class_xml_warchive_dll" result="fail"/><test-result test-name="test_derived_text_archive" result="fail"/><test-result test-name="test_derived_text_archive_dll" result="fail"/><test-result test-name="test_derived_text_warchive" result="fail"/><test-result test-name="test_derived_text_warchive_dll" result="fail"/><test-result test-name="test_derived_xml_archive" result="fail"/><test-result test-name="test_derived_xml_archive_dll" result="fail"/><test-result test-name="test_derived_xml_warchive" result="fail"/><test-result test-name="test_derived_xml_warchive_dll" result="fail"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_diamond_binary_archive_dll" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_diamond_text_archive_dll" result="fail"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_text_warchive_dll" result="fail"/><test-result test-name="test_diamond_xml_archive" result="fail"/><test-result test-name="test_diamond_xml_archive_dll" result="fail"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_diamond_xml_warchive_dll" result="fail"/><test-result test-name="test_exported_binary_archive" result="fail"/><test-result test-name="test_exported_binary_archive_dll" result="fail"/><test-result test-name="test_exported_text_archive" result="fail"/><test-result test-name="test_exported_text_archive_dll" result="fail"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_exported_text_warchive_dll" result="fail"/><test-result test-name="test_exported_xml_archive" result="fail"/><test-result test-name="test_exported_xml_archive_dll" result="fail"/><test-result test-name="test_exported_xml_warchive" result="fail"/><test-result test-name="test_exported_xml_warchive_dll" result="fail"/><test-result test-name="test_inclusion" result="fail"/><test-result test-name="test_iterators" result="fail"/><test-result test-name="test_iterators_base64" result="fail"/><test-result test-name="test_list_binary_archive" result="fail"/><test-result test-name="test_list_binary_archive_dll" result="fail"/><test-result test-name="test_list_ptrs_binary_archive" result="fail"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="fail"/><test-result test-name="test_list_ptrs_text_archive" result="fail"/><test-result test-name="test_list_ptrs_text_archive_dll" result="fail"/><test-result test-name="test_list_ptrs_text_warchive" result="fail"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="fail"/><test-result test-name="test_list_ptrs_xml_archive" result="fail"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="fail"/><test-result test-name="test_list_ptrs_xml_warchive" result="fail"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="fail"/><test-result test-name="test_list_text_archive" result="fail"/><test-result test-name="test_list_text_archive_dll" result="fail"/><test-result test-name="test_list_text_warchive" result="fail"/><test-result test-name="test_list_text_warchive_dll" result="fail"/><test-result test-name="test_list_xml_archive" result="fail"/><test-result test-name="test_list_xml_archive_dll" result="fail"/><test-result test-name="test_list_xml_warchive" result="fail"/><test-result test-name="test_list_xml_warchive_dll" result="fail"/><test-result test-name="test_map_binary_archive" result="fail"/><test-result test-name="test_map_binary_archive_dll" result="fail"/><test-result test-name="test_map_text_archive" result="fail"/><test-result test-name="test_map_text_archive_dll" result="fail"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_map_text_warchive_dll" result="fail"/><test-result test-name="test_map_xml_archive" result="fail"/><test-result test-name="test_map_xml_archive_dll" result="fail"/><test-result test-name="test_map_xml_warchive" result="fail"/><test-result test-name="test_map_xml_warchive_dll" result="fail"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_mi_binary_archive_dll" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_mi_text_archive_dll" result="fail"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_text_warchive_dll" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_mi_xml_archive_dll" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_mi_xml_warchive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_text_archive" result="fail"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_text_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_xml_archive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="fail"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_mult_archive_types_dll" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor_text_archive" result="fail"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="fail"/><test-result test-name="test_non_intrusive_binary_archive" result="fail"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="fail"/><test-result test-name="test_non_intrusive_text_archive" result="fail"/><test-result test-name="test_non_intrusive_text_archive_dll" result="fail"/><test-result test-name="test_non_intrusive_text_warchive" result="fail"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="fail"/><test-result test-name="test_non_intrusive_xml_archive" result="fail"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="fail"/><test-result test-name="test_non_intrusive_xml_warchive" result="fail"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="fail"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="fail"/><test-result test-name="test_no_rtti_binary_archive_dll" result="fail"/><test-result test-name="test_no_rtti_text_archive" result="fail"/><test-result test-name="test_no_rtti_text_archive_dll" result="fail"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_no_rtti_text_warchive_dll" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="fail"/><test-result test-name="test_no_rtti_xml_archive_dll" result="fail"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="fail"/><test-result test-name="test_null_ptr_binary_archive_dll" result="fail"/><test-result test-name="test_null_ptr_text_archive" result="fail"/><test-result test-name="test_null_ptr_text_archive_dll" result="fail"/><test-result test-name="test_null_ptr_text_warchive" result="fail"/><test-result test-name="test_null_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_null_ptr_xml_archive" result="fail"/><test-result test-name="test_null_ptr_xml_archive_dll" result="fail"/><test-result test-name="test_null_ptr_xml_warchive" result="fail"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_nvp_binary_archive" result="fail"/><test-result test-name="test_nvp_binary_archive_dll" result="fail"/><test-result test-name="test_nvp_text_archive" result="fail"/><test-result test-name="test_nvp_text_archive_dll" result="fail"/><test-result test-name="test_nvp_text_warchive" result="fail"/><test-result test-name="test_nvp_text_warchive_dll" result="fail"/><test-result test-name="test_nvp_xml_archive" result="fail"/><test-result test-name="test_nvp_xml_archive_dll" result="fail"/><test-result test-name="test_nvp_xml_warchive" result="fail"/><test-result test-name="test_nvp_xml_warchive_dll" result="fail"/><test-result test-name="test_object_binary_archive" result="fail"/><test-result test-name="test_object_binary_archive_dll" result="fail"/><test-result test-name="test_object_text_archive" result="fail"/><test-result test-name="test_object_text_archive_dll" result="fail"/><test-result test-name="test_object_text_warchive" result="fail"/><test-result test-name="test_object_text_warchive_dll" result="fail"/><test-result test-name="test_object_xml_archive" result="fail"/><test-result test-name="test_object_xml_archive_dll" result="fail"/><test-result test-name="test_object_xml_warchive" result="fail"/><test-result test-name="test_object_xml_warchive_dll" result="fail"/><test-result test-name="test_optional_binary_archive" result="fail"/><test-result test-name="test_optional_binary_archive_dll" result="fail"/><test-result test-name="test_optional_text_archive" result="fail"/><test-result test-name="test_optional_text_archive_dll" result="fail"/><test-result test-name="test_optional_text_warchive" result="fail"/><test-result test-name="test_optional_text_warchive_dll" result="fail"/><test-result test-name="test_optional_xml_archive" result="fail"/><test-result test-name="test_optional_xml_archive_dll" result="fail"/><test-result test-name="test_optional_xml_warchive" result="fail"/><test-result test-name="test_optional_xml_warchive_dll" result="fail"/><test-result test-name="test_polymorphic_binary_archive" result="fail"/><test-result test-name="test_polymorphic_binary_archive_dll" result="fail"/><test-result test-name="test_polymorphic_text_archive" result="fail"/><test-result test-name="test_polymorphic_text_archive_dll" result="fail"/><test-result test-name="test_polymorphic_text_warchive" result="fail"/><test-result test-name="test_polymorphic_text_warchive_dll" result="fail"/><test-result test-name="test_polymorphic_xml_archive" result="fail"/><test-result test-name="test_polymorphic_xml_archive_dll" result="fail"/><test-result test-name="test_polymorphic_xml_warchive" result="fail"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="fail"/><test-result test-name="test_primitive_binary_archive" result="fail"/><test-result test-name="test_primitive_binary_archive_dll" result="fail"/><test-result test-name="test_primitive_text_archive" result="fail"/><test-result test-name="test_primitive_text_archive_dll" result="fail"/><test-result test-name="test_primitive_text_warchive" result="fail"/><test-result test-name="test_primitive_text_warchive_dll" result="fail"/><test-result test-name="test_primitive_xml_archive" result="fail"/><test-result test-name="test_primitive_xml_archive_dll" result="fail"/><test-result test-name="test_primitive_xml_warchive" result="fail"/><test-result test-name="test_primitive_xml_warchive_dll" result="fail"/><test-result test-name="test_private_ctor" result="fail"/><test-result test-name="test_private_ctor_dll" result="fail"/><test-result test-name="test_recursion_binary_archive" result="fail"/><test-result test-name="test_recursion_binary_archive_dll" result="fail"/><test-result test-name="test_recursion_text_archive" result="fail"/><test-result test-name="test_recursion_text_archive_dll" result="fail"/><test-result test-name="test_recursion_text_warchive" result="fail"/><test-result test-name="test_recursion_text_warchive_dll" result="fail"/><test-result test-name="test_recursion_xml_archive" result="fail"/><test-result test-name="test_recursion_xml_archive_dll" result="fail"/><test-result test-name="test_recursion_xml_warchive" result="fail"/><test-result test-name="test_recursion_xml_warchive_dll" result="fail"/><test-result test-name="test_registered_binary_archive" result="fail"/><test-result test-name="test_registered_binary_archive_dll" result="fail"/><test-result test-name="test_registered_text_archive" result="fail"/><test-result test-name="test_registered_text_archive_dll" result="fail"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_registered_text_warchive_dll" result="fail"/><test-result test-name="test_registered_xml_archive" result="fail"/><test-result test-name="test_registered_xml_archive_dll" result="fail"/><test-result test-name="test_registered_xml_warchive" result="fail"/><test-result test-name="test_registered_xml_warchive_dll" result="fail"/><test-result test-name="test_reset_object_address" result="fail"/><test-result test-name="test_reset_object_address_dll" result="fail"/><test-result test-name="test_set_binary_archive" result="fail"/><test-result test-name="test_set_binary_archive_dll" result="fail"/><test-result test-name="test_set_text_archive" result="fail"/><test-result test-name="test_set_text_archive_dll" result="fail"/><test-result test-name="test_set_text_warchive" result="fail"/><test-result test-name="test_set_text_warchive_dll" result="fail"/><test-result test-name="test_set_xml_archive" result="fail"/><test-result test-name="test_set_xml_archive_dll" result="fail"/><test-result test-name="test_set_xml_warchive" result="fail"/><test-result test-name="test_set_xml_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_text_archive" result="fail"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_text_archive" result="fail"/><test-result test-name="test_shared_ptr_text_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="fail"/><test-result test-name="test_simple_class_binary_archive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_binary_archive" result="fail"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_text_archive" result="fail"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_text_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_xml_archive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_simple_class_text_archive" result="fail"/><test-result test-name="test_simple_class_text_archive_dll" result="fail"/><test-result test-name="test_simple_class_text_warchive" result="fail"/><test-result test-name="test_simple_class_text_warchive_dll" result="fail"/><test-result test-name="test_simple_class_xml_archive" result="fail"/><test-result test-name="test_simple_class_xml_archive_dll" result="fail"/><test-result test-name="test_simple_class_xml_warchive" result="fail"/><test-result test-name="test_simple_class_xml_warchive_dll" result="fail"/><test-result test-name="test_smart_cast" result="fail"/><test-result test-name="test_split_binary_archive" result="fail"/><test-result test-name="test_split_binary_archive_dll" result="fail"/><test-result test-name="test_split_text_archive" result="fail"/><test-result test-name="test_split_text_archive_dll" result="fail"/><test-result test-name="test_split_text_warchive" result="fail"/><test-result test-name="test_split_text_warchive_dll" result="fail"/><test-result test-name="test_split_xml_archive" result="fail"/><test-result test-name="test_split_xml_archive_dll" result="fail"/><test-result test-name="test_split_xml_warchive" result="fail"/><test-result test-name="test_split_xml_warchive_dll" result="fail"/><test-result test-name="test_static_warning" result="fail"/><test-result test-name="test_tracking_binary_archive" result="fail"/><test-result test-name="test_tracking_binary_archive_dll" result="fail"/><test-result test-name="test_tracking_text_archive" result="fail"/><test-result test-name="test_tracking_text_archive_dll" result="fail"/><test-result test-name="test_tracking_text_warchive" result="fail"/><test-result test-name="test_tracking_text_warchive_dll" result="fail"/><test-result test-name="test_tracking_xml_archive" result="fail"/><test-result test-name="test_tracking_xml_archive_dll" result="fail"/><test-result test-name="test_tracking_xml_warchive" result="fail"/><test-result test-name="test_tracking_xml_warchive_dll" result="fail"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="fail"/><test-result test-name="test_unregistered_binary_archive" result="fail"/><test-result test-name="test_unregistered_binary_archive_dll" result="fail"/><test-result test-name="test_unregistered_text_archive" result="fail"/><test-result test-name="test_unregistered_text_archive_dll" result="fail"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_unregistered_text_warchive_dll" result="fail"/><test-result test-name="test_unregistered_xml_archive" result="fail"/><test-result test-name="test_unregistered_xml_archive_dll" result="fail"/><test-result test-name="test_unregistered_xml_warchive" result="fail"/><test-result test-name="test_unregistered_xml_warchive_dll" result="fail"/><test-result test-name="test_utf8_codecvt" result="fail"/><test-result test-name="test_variant_binary_archive" result="fail"/><test-result test-name="test_variant_binary_archive_dll" result="fail"/><test-result test-name="test_variant_text_archive" result="fail"/><test-result test-name="test_variant_text_archive_dll" result="fail"/><test-result test-name="test_variant_text_warchive" result="fail"/><test-result test-name="test_variant_text_warchive_dll" result="fail"/><test-result test-name="test_variant_xml_archive" result="fail"/><test-result test-name="test_variant_xml_archive_dll" result="fail"/><test-result test-name="test_variant_xml_warchive" result="fail"/><test-result test-name="test_variant_xml_warchive_dll" result="fail"/><test-result test-name="test_vector_binary_archive" result="fail"/><test-result test-name="test_vector_binary_archive_dll" result="fail"/><test-result test-name="test_vector_text_archive" result="fail"/><test-result test-name="test_vector_text_archive_dll" result="fail"/><test-result test-name="test_vector_text_warchive" result="fail"/><test-result test-name="test_vector_text_warchive_dll" result="fail"/><test-result test-name="test_vector_xml_archive" result="fail"/><test-result test-name="test_vector_xml_archive_dll" result="fail"/><test-result test-name="test_vector_xml_warchive" result="fail"/><test-result test-name="test_vector_xml_warchive_dll" result="fail"/><test-result test-name="test_void_cast" result="fail"/><test-result test-name="test_void_cast_dll" result="fail"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="fail"/><test-result test-name="deletion_test" result="fail"/><test-result test-name="ordering_test" result="fail"/><test-result test-name="signal_n_test" result="fail"/><test-result test-name="signal_test" result="fail"/><test-result test-name="trackable_test" result="fail"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="fail"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="fail"/><test-result test-name="smart_ptr_test" result="fail"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="char_strings_test" result="fail"/><test-result test-name="char_strings_test_debug" result="fail"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="fail"/><test-result test-name="chset_tests_debug" result="fail"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="file_iterator_tests" result="fail"/><test-result test-name="file_iterator_tests_debug" result="fail"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="fail"/><test-result test-name="fixed_size_queue_tests_debug" result="fail"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="grammar_def_test" result="fail"/><test-result test-name="grammar_def_test_debug" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="group_match_bug" result="fail"/><test-result test-name="group_match_bug_debug" result="fail"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="if_p_int_as_condition_test" result="fail"/><test-result test-name="if_p_int_as_condition_test_debug" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="match_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="owi_mt_tests" result="fail"/><test-result test-name="owi_st_tests" result="fail"/><test-result test-name="owi_st_tests_debug" result="fail"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="position_iterator_tests" result="fail"/><test-result test-name="position_iterator_tests_debug" result="fail"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="symbols_add_null" result="fail"/><test-result test-name="symbols_add_null_debug" result="fail"/><test-result test-name="symbols_find_null" result="fail"/><test-result test-name="symbols_find_null_debug" result="fail"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="fail"/><test-result test-name="auto_unit_test_test" result="fail"/><test-result test-name="auto_unit_test_test_mult" result="fail"/><test-result test-name="basic_cstring_test" result="fail"/><test-result test-name="boost_check_equal_str" result="fail"/><test-result test-name="class_properties_test" result="fail"/><test-result test-name="custom_exception_test" result="fail"/><test-result test-name="errors_handling_test" result="fail"/><test-result test-name="fixed_mapping_test" result="fail"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="fail"/><test-result test-name="online_test" result="fail"/><test-result test-name="output_test_stream_test" result="fail"/><test-result test-name="parameterized_test_test" result="fail"/><test-result test-name="result_report_test" result="fail"/><test-result test-name="test_case_template_test" result="fail"/><test-result test-name="test_fp_comparisons" result="fail"/><test-result test-name="test_tools_test" result="fail"/><test-result test-name="token_iterator_test" result="fail"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="fail"/><test-result test-name="test_barrier_lib" result="fail"/><test-result test-name="test_condition" result="fail"/><test-result test-name="test_condition_lib" result="fail"/><test-result test-name="test_mutex" result="fail"/><test-result test-name="test_mutex_lib" result="fail"/><test-result test-name="test_once" result="fail"/><test-result test-name="test_once_lib" result="fail"/><test-result test-name="test_thread" result="fail"/><test-result test-name="test_thread_lib" result="fail"/><test-result test-name="test_tss" result="fail"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="fail"/><test-result test-name="test_xtime_lib" result="fail"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="fail"/><test-result test-name="add_cv_test" result="fail"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="fail"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="fail"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="fail"/><test-result test-name="is_base_of_test" result="fail"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="fail"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="fail"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="fail"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="fail"/><test-result test-name="dummy_arg_disambiguation" result="fail"/><test-result test-name="lazy" result="fail"/><test-result test-name="lazy_test" result="fail"/><test-result test-name="member_templates" result="fail"/><test-result test-name="namespace_disambiguation" result="fail"/><test-result test-name="no_disambiguation" result="fail"/><test-result test-name="partial_specializations" result="fail"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="fail"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="fail"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="fail"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="fail"/><test-result test-name="next_prior_test" result="fail"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="fail"/><test-result test-name="operators_test" result="fail"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="fail"/><test-result test-name="result_of_test" result="fail"/><test-result test-name="shared_iterator_test" result="fail"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="recursive_variant_test" result="fail"/><test-result test-name="variant_comparison_test" result="fail"/><test-result test-name="variant_reference_test" result="fail"/><test-result test-name="variant_test1" result="fail"/><test-result test-name="variant_test2" result="fail"/><test-result test-name="variant_test3" result="fail"/><test-result test-name="variant_test4" result="fail"/><test-result test-name="variant_test5" result="fail"/><test-result test-name="variant_test6" result="fail"/><test-result test-name="variant_test7" result="fail"/><test-result test-name="variant_test8" result="fail"/><test-result test-name="variant_visit_test" result="fail"/></library>
+<library name="wave"><test-result test-name="testwave" result="fail"/><test-result test-name="test_re2c_lexer" result="fail"/><test-result test-name="test_slex_lexer" result="fail"/></library>
+<library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="fail"/><test-result test-name="config_test" result="fail"/><test-result test-name="limits_test" result="fail"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="fail"/><test-result test-name="bind_tests_advanced" result="fail"/><test-result test-name="bind_tests_simple" result="fail"/><test-result test-name="bind_tests_simple_f_refs" result="fail"/><test-result test-name="bll_and_function" result="fail"/><test-result test-name="constructor_tests" result="fail"/><test-result test-name="control_structures" result="fail"/><test-result test-name="exception_test" result="fail"/><test-result test-name="extending_rt_traits" result="fail"/><test-result test-name="is_instance_of_test" result="fail"/><test-result test-name="lambda_cast_test" result="fail"/><test-result test-name="member_pointer_test" result="fail"/><test-result test-name="operator_tests_simple" result="fail"/><test-result test-name="phoenix_control_structures" result="fail"/><test-result test-name="switch_construct" result="fail"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
-<library name="crc"><test-result test-name="crc_test" result="success"/></library>
-<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="fail"/></library>
-<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
-<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
-<library name="functional"><test-result test-name="function_test" result="success"/></library>
-<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
-<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="fail"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="fail"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="fail"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="fail"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="fail"/><test-result test-name="simple_example_1" result="fail"/><test-result test-name="simple_example_2" result="fail"/><test-result test-name="simple_example_3" result="fail"/><test-result test-name="simple_example_4" result="fail"/><test-result test-name="simple_example_5" result="fail"/></library>
+<library name="functional"><test-result test-name="function_test" result="fail"/></library>
+<library name="tuple"><test-result test-name="io_test" result="fail"/><test-result test-name="tuple_test_bench" result="fail"/></library>
+<library name="rational"><test-result test-name="rational_example" result="fail"/><test-result test-name="rational_test" result="fail"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="fail"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
-</toolset><toolset name="iw-7_1-vc6-stlp-4_5_3"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="container" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
-<library name="assign"><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
-<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="date_time"><test-result test-name="testclock" result="fail"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="fail"/><test-result test-name="testdate" result="fail"/><test-result test-name="testdate_dll" result="fail"/><test-result test-name="testdate_duration" result="fail"/><test-result test-name="testdate_duration_dll" result="fail"/><test-result test-name="testdate_iterator" result="fail"/><test-result test-name="testdate_iterator_dll" result="fail"/><test-result test-name="testdst_rules" result="fail"/><test-result test-name="testduration" result="fail"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="fail"/><test-result test-name="testformatters" result="fail"/><test-result test-name="testformatters_dll" result="fail"/><test-result test-name="testgenerators" result="fail"/><test-result test-name="testgenerators_dll" result="fail"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="fail"/><test-result test-name="testgreg_cal_dll" result="fail"/><test-result test-name="testgreg_day" result="fail"/><test-result test-name="testgreg_day_dll" result="fail"/><test-result test-name="testgreg_durations" result="fail"/><test-result test-name="testgreg_duration_operators" result="fail"/><test-result test-name="testgreg_month" result="fail"/><test-result test-name="testgreg_month_dll" result="fail"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="fail"/><test-result test-name="testgreg_year_dll" result="fail"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="fail"/><test-result test-name="testlocal_adjustor" result="fail"/><test-result test-name="testmicrosec_time_clock" result="fail"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="testparse_time" result="fail"/><test-result test-name="testperiod" result="fail"/><test-result test-name="testperiod_dll" result="fail"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="fail"/><test-result test-name="testtime_formatters" result="fail"/><test-result test-name="testtime_period" result="fail"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtime_wstream_std_config" result="fail"/><test-result test-name="testwrapping_int" result="success"/></library>
+</toolset>
+<toolset name="vc-6_5">
+<toolset-alias name="msvc"/>
+<toolset-alias name="msvc-6.5"/>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="fail"/><test-result test-name="find" result="fail"/><test-result test-name="predicate" result="fail"/><test-result test-name="regex" result="fail"/><test-result test-name="replace" result="fail"/><test-result test-name="split" result="fail"/><test-result test-name="trim" result="fail"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="fail"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="fail"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="fail"/><test-result test-name="ptr_list_of" result="fail"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="fail"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="fail"/><test-result test-name="bind_dm_test" result="fail"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="fail"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="fail"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="fail"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="fail"/><test-result test-name="testdate_facet_new_dll" result="fail"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="fail"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="fail"/><test-result test-name="testlocal_time_facet" result="fail"/><test-result test-name="testlocal_time_input_facet" result="fail"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="fail"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="fail"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="fail"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="fail"/><test-result test-name="testtime_serialize_xml_std_config" result="fail"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtz_database" result="fail"/><test-result test-name="testwrapping_int" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/></library>
-<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="fail"/><test-result test-name="format_test3" result="fail"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="fail"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
-<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="fail"/></library>
-<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
-<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
-<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="fail"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="fail"/><test-result test-name="special_functions_test" result="fail"/></library>
-<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
-<library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
-<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="fail"/></library>
-<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
-<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
-<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
-<library name="python"><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/></library>
-<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="fail"/></library>
-<library name="range"><test-result test-name="array_test" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="fail"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
-<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="fail"/><test-result test-name="test_array_xml_archive" result="fail"/><test-result test-name="test_array_xml_warchive" result="fail"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="fail"/><test-result test-name="test_binary_xml_archive" result="fail"/><test-result test-name="test_binary_xml_warchive" result="fail"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_class_info_load_xml_archive" result="fail"/><test-result test-name="test_class_info_load_xml_warchive" result="fail"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="fail"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="fail"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="fail"/><test-result test-name="test_contained_class_xml_archive" result="fail"/><test-result test-name="test_contained_class_xml_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="fail"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="fail"/><test-result test-name="test_delete_pointer_xml_archive" result="fail"/><test-result test-name="test_delete_pointer_xml_warchive" result="fail"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_xml" result="fail"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="fail"/><test-result test-name="test_deque_xml_archive" result="fail"/><test-result test-name="test_deque_xml_warchive" result="fail"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_archive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="fail"/><test-result test-name="test_derived_class_xml_archive" result="fail"/><test-result test-name="test_derived_class_xml_warchive" result="fail"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="fail"/><test-result test-name="test_derived_xml_archive" result="fail"/><test-result test-name="test_derived_xml_warchive" result="fail"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_xml_archive" result="fail"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_exported_xml_archive" result="fail"/><test-result test-name="test_exported_xml_warchive" result="fail"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="fail"/><test-result test-name="test_list_ptrs_xml_archive" result="fail"/><test-result test-name="test_list_ptrs_xml_warchive" result="fail"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="fail"/><test-result test-name="test_list_xml_archive" result="fail"/><test-result test-name="test_list_xml_warchive" result="fail"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_map_xml_archive" result="fail"/><test-result test-name="test_map_xml_warchive" result="fail"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_archive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="fail"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor_xml_warchive" result="fail"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="fail"/><test-result test-name="test_non_intrusive_xml_archive" result="fail"/><test-result test-name="test_non_intrusive_xml_warchive" result="fail"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="fail"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="fail"/><test-result test-name="test_null_ptr_xml_archive" result="fail"/><test-result test-name="test_null_ptr_xml_warchive" result="fail"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="fail"/><test-result test-name="test_nvp_xml_archive" result="fail"/><test-result test-name="test_nvp_xml_warchive" result="fail"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="fail"/><test-result test-name="test_object_xml_archive" result="fail"/><test-result test-name="test_object_xml_warchive" result="fail"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="fail"/><test-result test-name="test_optional_xml_archive" result="fail"/><test-result test-name="test_optional_xml_warchive" result="fail"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="fail"/><test-result test-name="test_polymorphic_xml_archive" result="fail"/><test-result test-name="test_polymorphic_xml_warchive" result="fail"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="fail"/><test-result test-name="test_primitive_xml_archive" result="fail"/><test-result test-name="test_primitive_xml_warchive" result="fail"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="fail"/><test-result test-name="test_recursion_xml_archive" result="fail"/><test-result test-name="test_recursion_xml_warchive" result="fail"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_registered_xml_archive" result="fail"/><test-result test-name="test_registered_xml_warchive" result="fail"/><test-result test-name="test_set_binary_archive" result="fail"/><test-result test-name="test_set_text_archive" result="fail"/><test-result test-name="test_set_text_warchive" result="fail"/><test-result test-name="test_set_xml_archive" result="fail"/><test-result test-name="test_set_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_archive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="fail"/><test-result test-name="test_simple_class_xml_archive" result="fail"/><test-result test-name="test_simple_class_xml_warchive" result="fail"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="fail"/><test-result test-name="test_split_xml_archive" result="fail"/><test-result test-name="test_split_xml_warchive" result="fail"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="fail"/><test-result test-name="test_tracking_xml_archive" result="fail"/><test-result test-name="test_tracking_xml_warchive" result="fail"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_unregistered_xml_archive" result="fail"/><test-result test-name="test_unregistered_xml_warchive" result="fail"/><test-result test-name="test_utf8_codecvt" result="fail"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="fail"/><test-result test-name="test_vector_xml_archive" result="fail"/><test-result test-name="test_vector_xml_warchive" result="fail"/><test-result test-name="test_void_cast" result="success"/></library>
-<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
-<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
-<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
-<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
-<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="fail"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="fail"/><test-result test-name="is_integral_test" result="fail"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
-<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
-<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="fail"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
-<library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="fail"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
-<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
-<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
-<library name="crc"><test-result test-name="crc_test" result="success"/></library>
-<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="fail"/></library>
-<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
-<library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
-<library name="functional"><test-result test-name="function_test" result="success"/></library>
-<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
-<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
-<library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
-<library name="timer"><test-result test-name="timer_test" result="success"/></library>
-</toolset><toolset name="msvc"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="container" result="fail"/><test-result test-name="conv" result="fail"/><test-result test-name="find" result="fail"/><test-result test-name="predicate" result="fail"/><test-result test-name="regex" result="fail"/><test-result test-name="replace" result="fail"/><test-result test-name="split" result="fail"/><test-result test-name="trim" result="fail"/></library>
-<library name="assign"><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
-<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtime_wstream_std_config" result="fail"/><test-result test-name="testwrapping_int" result="success"/></library>
-<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="function"><test-result test-name="allocator_test" result="fail"/><test-result test-name="contains_test" result="fail"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="fail"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="fail"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="fail"/><test-result test-name="lib_function_test" result="fail"/><test-result test-name="mem_fun_cxx98" result="fail"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="fail"/><test-result test-name="std_bind_portable" result="fail"/><test-result test-name="sum_avg_cxx98" result="fail"/><test-result test-name="sum_avg_portable" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="fail"/><test-result test-name="adj_list_cc" result="fail"/><test-result test-name="adj_matrix_cc" result="fail"/><test-result test-name="betweenness_centrality_test" result="fail"/><test-result test-name="bfs" result="fail"/><test-result test-name="bfs_cc" result="fail"/><test-result test-name="bundled_properties" result="fail"/><test-result test-name="copy" result="fail"/><test-result test-name="dfs" result="fail"/><test-result test-name="dfs_cc" result="fail"/><test-result test-name="dijkstra_cc" result="fail"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="fail"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="fail"/><test-result test-name="layout_test" result="fail"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="fail"/><test-result test-name="transitive_closure_test" result="fail"/><test-result test-name="vector_graph_cc" result="fail"/></library>
+<library name="function"><test-result test-name="allocator_test" result="fail"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="fail"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="fail"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="fail"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="fail"/><test-result test-name="lib_function_test" result="fail"/><test-result test-name="mem_fun_cxx98" result="fail"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="fail"/><test-result test-name="std_bind_portable" result="fail"/><test-result test-name="sum_avg_cxx98" result="fail"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="fail"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="fail"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="fail"/><test-result test-name="adj_list_cc" result="fail"/><test-result test-name="adj_matrix_cc" result="fail"/><test-result test-name="astar_search_test" result="fail"/><test-result test-name="bellman-test" result="fail"/><test-result test-name="betweenness_centrality_test" result="fail"/><test-result test-name="bfs" result="fail"/><test-result test-name="bfs_cc" result="fail"/><test-result test-name="biconnected_components_test" result="fail"/><test-result test-name="bundled_properties" result="fail"/><test-result test-name="copy" result="fail"/><test-result test-name="cuthill_mckee_ordering" result="fail"/><test-result test-name="dag_longest_paths" result="fail"/><test-result test-name="dfs" result="fail"/><test-result test-name="dfs_cc" result="fail"/><test-result test-name="dijkstra_cc" result="fail"/><test-result test-name="dijkstra_heap_performance" result="fail"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="fail"/><test-result test-name="floyd_warshall_test" result="fail"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="fail"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="fail"/><test-result test-name="isomorphism" result="fail"/><test-result test-name="king_ordering" result="fail"/><test-result test-name="layout_test" result="fail"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="fail"/><test-result test-name="reverse_graph_cc" result="fail"/><test-result test-name="sequential_vertex_coloring" result="fail"/><test-result test-name="subgraph" result="fail"/><test-result test-name="transitive_closure_test" result="fail"/><test-result test-name="vector_graph_cc" result="fail"/></library>
 <library name="io"><test-result test-name="ios_state_test" result="fail"/><test-result test-name="ios_state_unit_test" result="fail"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="fail"/><test-result test-name="flush_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/></library>
 <library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="fail"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
 <library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
 <library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="fail"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="fail"/><test-result test-name="special_functions_test" result="fail"/></library>
-<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="fail"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="fail"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="fail"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
 <library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="fail"/><test-result test-name="numeric_cast_test" result="fail"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="fail"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="fail"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="fail"/><test-result test-name="udt_support_test" result="fail"/></library>
 <library name="numeric/interval"><test-result test-name="add" result="fail"/><test-result test-name="cmp" result="fail"/><test-result test-name="cmp_exn" result="fail"/><test-result test-name="cmp_exp" result="fail"/><test-result test-name="cmp_lex" result="fail"/><test-result test-name="cmp_set" result="fail"/><test-result test-name="cmp_tribool" result="fail"/><test-result test-name="det" result="fail"/><test-result test-name="fmod" result="fail"/><test-result test-name="integer" result="fail"/><test-result test-name="mul" result="fail"/><test-result test-name="overflow" result="fail"/><test-result test-name="pi" result="fail"/><test-result test-name="pow" result="fail"/><test-result test-name="test_float" result="fail"/></library>
-<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="fail"/><test-result test-name="placement_new" result="fail"/><test-result test-name="test1" result="fail"/><test-result test-name="test2" result="fail"/><test-result test-name="test3" result="fail"/><test-result test-name="test4" result="fail"/><test-result test-name="test5" result="fail"/><test-result test-name="test6" result="fail"/></library>
 <library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="fail"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
-<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="fail"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
-<library name="python"><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="fail"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="options_description_test" result="fail"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="fail"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test" result="fail"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="fail"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="fail"/><test-result test-name="winmain_dll" result="fail"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="fail"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="fail"/><test-result test-name="ptr_array" result="fail"/><test-result test-name="ptr_deque" result="fail"/><test-result test-name="ptr_list" result="fail"/><test-result test-name="ptr_map" result="fail"/><test-result test-name="ptr_set" result="fail"/><test-result test-name="ptr_vector" result="fail"/><test-result test-name="tree_test" result="fail"/><test-result test-name="tut1" result="fail"/><test-result test-name="view_example" result="fail"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
 <library name="random"><test-result test-name="random_demo" result="fail"/><test-result test-name="random_test" result="fail"/></library>
-<library name="range"><test-result test-name="array_test" result="fail"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="fail"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
-<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const" result="fail"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_fast_archive" result="fail"/><test-result test-name="test_demo_pimpl" result="fail"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="fail"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_demo_xml_save" result="fail"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_xml_archive" result="fail"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="fail"/><test-result test-name="test_map_text_archive" result="fail"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_void_cast" result="fail"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="fail"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="fail"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="fail"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="fail"/><test-result test-name="test_const_save_fail2" result="fail"/><test-result test-name="test_const_save_fail3" result="fail"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="fail"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_exception_dll" result="fail"/><test-result test-name="test_demo_fast_archive" result="fail"/><test-result test-name="test_demo_fast_archive_dll" result="fail"/><test-result test-name="test_demo_pimpl" result="fail"/><test-result test-name="test_demo_pimpl_dll" result="fail"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="fail"/><test-result test-name="test_demo_portable_archive_dll" result="fail"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_shared_ptr_dll" result="fail"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_diamond_binary_archive_dll" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_diamond_text_archive_dll" result="fail"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_text_warchive_dll" result="fail"/><test-result test-name="test_diamond_xml_archive" result="fail"/><test-result test-name="test_diamond_xml_archive_dll" result="fail"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_diamond_xml_warchive_dll" result="fail"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="fail"/><test-result test-name="test_map_binary_archive_dll" result="fail"/><test-result test-name="test_map_text_archive" result="fail"/><test-result test-name="test_map_text_archive_dll" result="fail"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_map_text_warchive_dll" result="fail"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_mi_binary_archive_dll" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_mi_text_archive_dll" result="fail"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_text_warchive_dll" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_mi_xml_archive_dll" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_mi_xml_warchive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_mult_archive_types_dll" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address" result="fail"/><test-result test-name="test_reset_object_address_dll" result="fail"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="fail"/><test-result test-name="test_void_cast_dll" result="fail"/></library>
 <library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="fail"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
-<library name="spirit"><test-result test-name="action_tests" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="chset_tests" result="fail"/><test-result test-name="chset_tests_debug" result="fail"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="file_iterator_tests" result="fail"/><test-result test-name="file_iterator_tests_debug" result="fail"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="match_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/></library>
-<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="fail"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
-<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="fail"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="fail"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
-<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
-<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="fail"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="fail"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="fail"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="fail"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="fail"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="fail"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="fail"/><test-result test-name="remove_bounds_test" result="fail"/><test-result test-name="remove_const_test" result="fail"/><test-result test-name="remove_cv_test" result="fail"/><test-result test-name="remove_pointer_test" result="fail"/><test-result test-name="remove_reference_test" result="fail"/><test-result test-name="remove_volatile_test" result="fail"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="fail"/><test-result test-name="tricky_function_type_test" result="fail"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="fail"/><test-result test-name="tricky_partial_spec_test" result="fail"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="char_strings_test" result="fail"/><test-result test-name="char_strings_test_debug" result="fail"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="fail"/><test-result test-name="chset_tests_debug" result="fail"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="file_iterator_tests" result="fail"/><test-result test-name="file_iterator_tests_debug" result="fail"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="grammar_def_test" result="fail"/><test-result test-name="grammar_def_test_debug" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="group_match_bug" result="fail"/><test-result test-name="group_match_bug_debug" result="fail"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="if_p_int_as_condition_test" result="fail"/><test-result test-name="if_p_int_as_condition_test_debug" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="match_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="symbols_add_null" result="fail"/><test-result test-name="symbols_add_null_debug" result="fail"/><test-result test-name="symbols_find_null" result="fail"/><test-result test-name="symbols_find_null_debug" result="fail"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="fail"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="fail"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="fail"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="fail"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="fail"/><test-result test-name="extent_test" result="fail"/><test-result test-name="function_traits_test" result="fail"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="fail"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="fail"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="fail"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="fail"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="fail"/><test-result test-name="is_unsigned_test" result="fail"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="fail"/><test-result test-name="rank_test" result="fail"/><test-result test-name="remove_all_extents_test" result="fail"/><test-result test-name="remove_bounds_test" result="fail"/><test-result test-name="remove_const_test" result="fail"/><test-result test-name="remove_cv_test" result="fail"/><test-result test-name="remove_extent_test" result="fail"/><test-result test-name="remove_pointer_test" result="fail"/><test-result test-name="remove_reference_test" result="fail"/><test-result test-name="remove_volatile_test" result="fail"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="fail"/><test-result test-name="tricky_function_type_test" result="fail"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="fail"/><test-result test-name="tricky_partial_spec_test" result="fail"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="fail"/><test-result test-name="dummy_arg_disambiguation" result="fail"/><test-result test-name="lazy" result="fail"/><test-result test-name="lazy_test" result="fail"/><test-result test-name="member_templates" result="fail"/><test-result test-name="namespace_disambiguation" result="fail"/><test-result test-name="no_disambiguation" result="fail"/><test-result test-name="partial_specializations" result="fail"/></library>
 <library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="fail"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="fail"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="fail"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="fail"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="fail"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="fail"/><test-result test-name="test_re2c_lexer" result="fail"/><test-result test-name="test_slex_lexer" result="fail"/></library>
 <library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="fail"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
 <library name="lambda"><test-result test-name="algorithm_test" result="fail"/><test-result test-name="bind_tests_advanced" result="fail"/><test-result test-name="bind_tests_simple" result="fail"/><test-result test-name="bind_tests_simple_f_refs" result="fail"/><test-result test-name="bll_and_function" result="fail"/><test-result test-name="constructor_tests" result="fail"/><test-result test-name="control_structures" result="fail"/><test-result test-name="exception_test" result="fail"/><test-result test-name="extending_rt_traits" result="fail"/><test-result test-name="is_instance_of_test" result="fail"/><test-result test-name="lambda_cast_test" result="fail"/><test-result test-name="member_pointer_test" result="fail"/><test-result test-name="operator_tests_simple" result="fail"/><test-result test-name="phoenix_control_structures" result="fail"/><test-result test-name="switch_construct" result="fail"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="fail"/><test-result test-name="array4" result="fail"/><test-result test-name="array5" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="fail"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="fail"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
-</toolset><toolset name="vc-6_5"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="container" result="fail"/><test-result test-name="conv" result="fail"/><test-result test-name="find" result="fail"/><test-result test-name="predicate" result="fail"/><test-result test-name="regex" result="fail"/><test-result test-name="replace" result="fail"/><test-result test-name="split" result="fail"/><test-result test-name="trim" result="fail"/></library>
-<library name="assign"><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
-<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtime_wstream_std_config" result="fail"/><test-result test-name="testwrapping_int" result="success"/></library>
-<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/></library>
+</toolset>
+<toolset name="vc-6_5-stlport">
+<toolset-alias name="msvc-6.5_stlport4"/>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="fail"/><test-result test-name="find" result="fail"/><test-result test-name="predicate" result="fail"/><test-result test-name="regex" result="fail"/><test-result test-name="replace" result="fail"/><test-result test-name="split" result="fail"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="fail"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="fail"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="fail"/><test-result test-name="ptr_list_of" result="fail"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="fail"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="fail"/><test-result test-name="bind_dm_test" result="fail"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="fail"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="fail"/><test-result test-name="testclocks" result="fail"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="fail"/><test-result test-name="testc_local_adjustor" result="fail"/><test-result test-name="testdate" result="fail"/><test-result test-name="testdate_dll" result="fail"/><test-result test-name="testdate_duration" result="fail"/><test-result test-name="testdate_duration_dll" result="fail"/><test-result test-name="testdate_facet_new" result="fail"/><test-result test-name="testdate_facet_new_dll" result="fail"/><test-result test-name="testdate_input_facet" result="fail"/><test-result test-name="testdate_input_facet_dll" result="fail"/><test-result test-name="testdate_iterator" result="fail"/><test-result test-name="testdate_iterator_dll" result="fail"/><test-result test-name="testdst_rules" result="fail"/><test-result test-name="testdst_transition_day_rule" result="fail"/><test-result test-name="testduration" result="fail"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="fail"/><test-result test-name="testformatters" result="fail"/><test-result test-name="testformatters_dll" result="fail"/><test-result test-name="testgenerators" result="fail"/><test-result test-name="testgenerators_dll" result="fail"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="fail"/><test-result test-name="testgreg_cal_dll" result="fail"/><test-result test-name="testgreg_day" result="fail"/><test-result test-name="testgreg_day_dll" result="fail"/><test-result test-name="testgreg_durations" result="fail"/><test-result test-name="testgreg_durations_dll" result="fail"/><test-result test-name="testgreg_duration_operators" result="fail"/><test-result test-name="testgreg_month" result="fail"/><test-result test-name="testgreg_month_dll" result="fail"/><test-result test-name="testgreg_serialize" result="fail"/><test-result test-name="testgreg_serialize_xml" result="fail"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="fail"/><test-result test-name="testgreg_year_dll" result="fail"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="fail"/><test-result test-name="testlocal_adjustor" result="fail"/><test-result test-name="testlocal_time" result="fail"/><test-result test-name="testlocal_time_facet" result="fail"/><test-result test-name="testlocal_time_input_facet" result="fail"/><test-result test-name="testmicrosec_time_clock" result="fail"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="testparse_time" result="fail"/><test-result test-name="testperiod" result="fail"/><test-result test-name="testperiod_dll" result="fail"/><test-result test-name="testposix_time_zone" result="fail"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="fail"/><test-result test-name="testtime_facet" result="fail"/><test-result test-name="testtime_formatters" result="fail"/><test-result test-name="testtime_input_facet" result="fail"/><test-result test-name="testtime_period" result="fail"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="fail"/><test-result test-name="testtime_serialize_std_config" result="fail"/><test-result test-name="testtime_serialize_xml" result="fail"/><test-result test-name="testtime_serialize_xml_std_config" result="fail"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtz_database" result="fail"/><test-result test-name="testwrapping_int" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="fail"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="function"><test-result test-name="allocator_test" result="fail"/><test-result test-name="contains_test" result="fail"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="fail"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="fail"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="fail"/><test-result test-name="lib_function_test" result="fail"/><test-result test-name="mem_fun_cxx98" result="fail"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="fail"/><test-result test-name="std_bind_portable" result="fail"/><test-result test-name="sum_avg_cxx98" result="fail"/><test-result test-name="sum_avg_portable" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="fail"/><test-result test-name="adj_list_cc" result="fail"/><test-result test-name="adj_matrix_cc" result="fail"/><test-result test-name="betweenness_centrality_test" result="fail"/><test-result test-name="bfs" result="fail"/><test-result test-name="bfs_cc" result="fail"/><test-result test-name="bundled_properties" result="fail"/><test-result test-name="copy" result="fail"/><test-result test-name="dfs" result="fail"/><test-result test-name="dfs_cc" result="fail"/><test-result test-name="dijkstra_cc" result="fail"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="fail"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="fail"/><test-result test-name="layout_test" result="fail"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="fail"/><test-result test-name="transitive_closure_test" result="fail"/><test-result test-name="vector_graph_cc" result="fail"/></library>
+<library name="function"><test-result test-name="allocator_test" result="fail"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="fail"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="fail"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="fail"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="fail"/><test-result test-name="lib_function_test" result="fail"/><test-result test-name="mem_fun_cxx98" result="fail"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="fail"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="fail"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="fail"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="fail"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="fail"/><test-result test-name="adj_list_cc" result="fail"/><test-result test-name="adj_matrix_cc" result="fail"/><test-result test-name="astar_search_test" result="fail"/><test-result test-name="bellman-test" result="fail"/><test-result test-name="betweenness_centrality_test" result="fail"/><test-result test-name="bfs" result="fail"/><test-result test-name="bfs_cc" result="fail"/><test-result test-name="biconnected_components_test" result="fail"/><test-result test-name="bundled_properties" result="fail"/><test-result test-name="copy" result="fail"/><test-result test-name="cuthill_mckee_ordering" result="fail"/><test-result test-name="dag_longest_paths" result="fail"/><test-result test-name="dfs" result="fail"/><test-result test-name="dfs_cc" result="fail"/><test-result test-name="dijkstra_cc" result="fail"/><test-result test-name="dijkstra_heap_performance" result="fail"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="fail"/><test-result test-name="floyd_warshall_test" result="fail"/><test-result test-name="graph" result="fail"/><test-result test-name="graphviz_test" result="fail"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="fail"/><test-result test-name="isomorphism" result="fail"/><test-result test-name="king_ordering" result="fail"/><test-result test-name="layout_test" result="fail"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="fail"/><test-result test-name="reverse_graph_cc" result="fail"/><test-result test-name="sequential_vertex_coloring" result="fail"/><test-result test-name="subgraph" result="fail"/><test-result test-name="transitive_closure_test" result="fail"/><test-result test-name="vector_graph_cc" result="fail"/></library>
 <library name="io"><test-result test-name="ios_state_test" result="fail"/><test-result test-name="ios_state_unit_test" result="fail"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="fail"/><test-result test-name="flush_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="fail"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/></library>
 <library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="fail"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
-<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="fail"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
 <library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="fail"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="fail"/><test-result test-name="special_functions_test" result="fail"/></library>
-<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="fail"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="fail"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="fail"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
 <library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="fail"/><test-result test-name="numeric_cast_test" result="fail"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="fail"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="fail"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="fail"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="fail"/><test-result test-name="udt_support_test" result="fail"/></library>
 <library name="numeric/interval"><test-result test-name="add" result="fail"/><test-result test-name="cmp" result="fail"/><test-result test-name="cmp_exn" result="fail"/><test-result test-name="cmp_exp" result="fail"/><test-result test-name="cmp_lex" result="fail"/><test-result test-name="cmp_set" result="fail"/><test-result test-name="cmp_tribool" result="fail"/><test-result test-name="det" result="fail"/><test-result test-name="fmod" result="fail"/><test-result test-name="integer" result="fail"/><test-result test-name="mul" result="fail"/><test-result test-name="overflow" result="fail"/><test-result test-name="pi" result="fail"/><test-result test-name="pow" result="fail"/><test-result test-name="test_float" result="fail"/></library>
-<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="fail"/><test-result test-name="placement_new" result="fail"/><test-result test-name="test1" result="fail"/><test-result test-name="test2" result="fail"/><test-result test-name="test3" result="fail"/><test-result test-name="test4" result="fail"/><test-result test-name="test5" result="fail"/><test-result test-name="test6" result="fail"/></library>
 <library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="fail"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
-<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="fail"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
-<library name="python"><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="fail"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="options_description_test" result="fail"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="fail"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test" result="fail"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="fail"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="fail"/><test-result test-name="winmain_dll" result="fail"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="fail"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="fail"/><test-result test-name="ptr_array" result="fail"/><test-result test-name="ptr_deque" result="fail"/><test-result test-name="ptr_list" result="fail"/><test-result test-name="ptr_map" result="fail"/><test-result test-name="ptr_set" result="fail"/><test-result test-name="ptr_vector" result="fail"/><test-result test-name="tree_test" result="fail"/><test-result test-name="tut1" result="fail"/><test-result test-name="view_example" result="fail"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
 <library name="random"><test-result test-name="random_demo" result="fail"/><test-result test-name="random_test" result="fail"/></library>
-<library name="range"><test-result test-name="array_test" result="fail"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="fail"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
-<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const" result="fail"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_fast_archive" result="fail"/><test-result test-name="test_demo_pimpl" result="fail"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="fail"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_demo_xml_save" result="fail"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_xml_archive" result="fail"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="fail"/><test-result test-name="test_map_text_archive" result="fail"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_void_cast" result="fail"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="fail"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="fail"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="fail"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="fail"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="fail"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="fail"/><test-result test-name="test_const_save_fail2" result="fail"/><test-result test-name="test_const_save_fail3" result="fail"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_fast_archive" result="fail"/><test-result test-name="test_demo_pimpl" result="fail"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="fail"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_xml_archive" result="fail"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="fail"/><test-result test-name="test_map_text_archive" result="fail"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_reset_object_address" result="fail"/><test-result test-name="test_set_binary_archive" result="fail"/><test-result test-name="test_set_text_archive" result="fail"/><test-result test-name="test_set_text_warchive" result="fail"/><test-result test-name="test_set_xml_archive" result="fail"/><test-result test-name="test_set_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_void_cast" result="fail"/></library>
 <library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="fail"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
-<library name="spirit"><test-result test-name="action_tests" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="chset_tests" result="fail"/><test-result test-name="chset_tests_debug" result="fail"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="file_iterator_tests" result="fail"/><test-result test-name="file_iterator_tests_debug" result="fail"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="match_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/></library>
-<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="fail"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
-<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="fail"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="fail"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
-<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
-<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="fail"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="fail"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="fail"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="fail"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="fail"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="fail"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="fail"/><test-result test-name="remove_bounds_test" result="fail"/><test-result test-name="remove_const_test" result="fail"/><test-result test-name="remove_cv_test" result="fail"/><test-result test-name="remove_pointer_test" result="fail"/><test-result test-name="remove_reference_test" result="fail"/><test-result test-name="remove_volatile_test" result="fail"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="fail"/><test-result test-name="tricky_function_type_test" result="fail"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="fail"/><test-result test-name="tricky_partial_spec_test" result="fail"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="char_strings_test" result="fail"/><test-result test-name="char_strings_test_debug" result="fail"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="fail"/><test-result test-name="chset_tests_debug" result="fail"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="file_iterator_tests" result="fail"/><test-result test-name="file_iterator_tests_debug" result="fail"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="grammar_def_test" result="fail"/><test-result test-name="grammar_def_test_debug" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="group_match_bug" result="fail"/><test-result test-name="group_match_bug_debug" result="fail"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="if_p_int_as_condition_test" result="fail"/><test-result test-name="if_p_int_as_condition_test_debug" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="match_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="position_iterator_tests" result="fail"/><test-result test-name="position_iterator_tests_debug" result="fail"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="symbols_add_null" result="fail"/><test-result test-name="symbols_add_null_debug" result="fail"/><test-result test-name="symbols_find_null" result="fail"/><test-result test-name="symbols_find_null_debug" result="fail"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="fail"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="fail"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="fail"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="fail"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="fail"/><test-result test-name="extent_test" result="fail"/><test-result test-name="function_traits_test" result="fail"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="fail"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="fail"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="fail"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="fail"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="fail"/><test-result test-name="is_unsigned_test" result="fail"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="fail"/><test-result test-name="rank_test" result="fail"/><test-result test-name="remove_all_extents_test" result="fail"/><test-result test-name="remove_bounds_test" result="fail"/><test-result test-name="remove_const_test" result="fail"/><test-result test-name="remove_cv_test" result="fail"/><test-result test-name="remove_extent_test" result="fail"/><test-result test-name="remove_pointer_test" result="fail"/><test-result test-name="remove_reference_test" result="fail"/><test-result test-name="remove_volatile_test" result="fail"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="fail"/><test-result test-name="tricky_function_type_test" result="fail"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="fail"/><test-result test-name="tricky_partial_spec_test" result="fail"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="fail"/><test-result test-name="dummy_arg_disambiguation" result="fail"/><test-result test-name="lazy" result="fail"/><test-result test-name="lazy_test" result="fail"/><test-result test-name="member_templates" result="fail"/><test-result test-name="namespace_disambiguation" result="fail"/><test-result test-name="no_disambiguation" result="fail"/><test-result test-name="partial_specializations" result="fail"/></library>
 <library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="fail"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="fail"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="fail"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="fail"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="fail"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="fail"/><test-result test-name="test_re2c_lexer" result="fail"/><test-result test-name="test_slex_lexer" result="fail"/></library>
 <library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="fail"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
 <library name="lambda"><test-result test-name="algorithm_test" result="fail"/><test-result test-name="bind_tests_advanced" result="fail"/><test-result test-name="bind_tests_simple" result="fail"/><test-result test-name="bind_tests_simple_f_refs" result="fail"/><test-result test-name="bll_and_function" result="fail"/><test-result test-name="constructor_tests" result="fail"/><test-result test-name="control_structures" result="fail"/><test-result test-name="exception_test" result="fail"/><test-result test-name="extending_rt_traits" result="fail"/><test-result test-name="is_instance_of_test" result="fail"/><test-result test-name="lambda_cast_test" result="fail"/><test-result test-name="member_pointer_test" result="fail"/><test-result test-name="operator_tests_simple" result="fail"/><test-result test-name="phoenix_control_structures" result="fail"/><test-result test-name="switch_construct" result="fail"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="fail"/><test-result test-name="array4" result="fail"/><test-result test-name="array5" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="fail"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="fail"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
-</toolset><toolset name="vc-6_5-stlport"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="container" result="fail"/><test-result test-name="conv" result="fail"/><test-result test-name="find" result="fail"/><test-result test-name="predicate" result="fail"/><test-result test-name="regex" result="fail"/><test-result test-name="replace" result="fail"/><test-result test-name="split" result="fail"/><test-result test-name="trim" result="fail"/></library>
-<library name="assign"><test-result test-name="array" result="fail"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
-<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="date_time"><test-result test-name="testclock" result="fail"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="fail"/><test-result test-name="testdate" result="fail"/><test-result test-name="testdate_dll" result="fail"/><test-result test-name="testdate_duration" result="fail"/><test-result test-name="testdate_duration_dll" result="fail"/><test-result test-name="testdate_iterator" result="fail"/><test-result test-name="testdate_iterator_dll" result="fail"/><test-result test-name="testdst_rules" result="fail"/><test-result test-name="testduration" result="fail"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfiletime_functions" result="fail"/><test-result test-name="testformatters" result="fail"/><test-result test-name="testformatters_dll" result="fail"/><test-result test-name="testgenerators" result="fail"/><test-result test-name="testgenerators_dll" result="fail"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="fail"/><test-result test-name="testgreg_cal_dll" result="fail"/><test-result test-name="testgreg_day" result="fail"/><test-result test-name="testgreg_day_dll" result="fail"/><test-result test-name="testgreg_durations" result="fail"/><test-result test-name="testgreg_duration_operators" result="fail"/><test-result test-name="testgreg_month" result="fail"/><test-result test-name="testgreg_month_dll" result="fail"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="fail"/><test-result test-name="testgreg_year_dll" result="fail"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="fail"/><test-result test-name="testlocal_adjustor" result="fail"/><test-result test-name="testmicrosec_time_clock" result="fail"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="testparse_time" result="fail"/><test-result test-name="testperiod" result="fail"/><test-result test-name="testperiod_dll" result="fail"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="fail"/><test-result test-name="testtime_formatters" result="fail"/><test-result test-name="testtime_period" result="fail"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtime_wstream_std_config" result="fail"/><test-result test-name="testwrapping_int" result="success"/></library>
-<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="fail"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/></library>
+</toolset>
+<toolset name="vc-7_0">
+<toolset-alias name="msvc-7.0"/>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="fail"/><test-result test-name="list_of" result="fail"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="fail"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="fail"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="fail"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="fail"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="fail"/><test-result test-name="testdate_facet_new_dll" result="fail"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="fail"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="fail"/><test-result test-name="testlocal_time_input_facet" result="fail"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="fail"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="fail"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="fail"/><test-result test-name="testtime_serialize_xml_std_config" result="fail"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="function"><test-result test-name="allocator_test" result="fail"/><test-result test-name="contains_test" result="fail"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="fail"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="fail"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="fail"/><test-result test-name="lib_function_test" result="fail"/><test-result test-name="mem_fun_cxx98" result="fail"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="fail"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="fail"/><test-result test-name="sum_avg_portable" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="fail"/><test-result test-name="adj_list_cc" result="fail"/><test-result test-name="adj_matrix_cc" result="fail"/><test-result test-name="betweenness_centrality_test" result="fail"/><test-result test-name="bfs" result="fail"/><test-result test-name="bfs_cc" result="fail"/><test-result test-name="bundled_properties" result="fail"/><test-result test-name="copy" result="fail"/><test-result test-name="dfs" result="fail"/><test-result test-name="dfs_cc" result="fail"/><test-result test-name="dijkstra_cc" result="fail"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="fail"/><test-result test-name="graph" result="fail"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="fail"/><test-result test-name="layout_test" result="fail"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="fail"/><test-result test-name="transitive_closure_test" result="fail"/><test-result test-name="vector_graph_cc" result="fail"/></library>
-<library name="io"><test-result test-name="ios_state_test" result="fail"/><test-result test-name="ios_state_unit_test" result="fail"/></library>
+<library name="function"><test-result test-name="allocator_test" result="fail"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="fail"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="fail"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="fail"/><test-result test-name="lib_function_test" result="fail"/><test-result test-name="mem_fun_cxx98" result="fail"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="fail"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="fail"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="fail"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="fail"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="fail"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="fail"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="fail"/><test-result test-name="biconnected_components_test" result="fail"/><test-result test-name="bundled_properties" result="fail"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="fail"/><test-result test-name="dijkstra_cc" result="fail"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="fail"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="fail"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="fail"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="fail"/><test-result test-name="transitive_closure_test" result="fail"/><test-result test-name="vector_graph_cc" result="fail"/></library>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="fail"/><test-result test-name="flush_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/></library>
 <library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="fail"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
-<library name="logic"><test-result test-name="tribool_io_test" result="fail"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
 <library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="fail"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="fail"/><test-result test-name="special_functions_test" result="fail"/></library>
-<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="fail"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="fail"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
 <library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="fail"/><test-result test-name="numeric_cast_test" result="fail"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="fail"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
 <library name="numeric/interval"><test-result test-name="add" result="fail"/><test-result test-name="cmp" result="fail"/><test-result test-name="cmp_exn" result="fail"/><test-result test-name="cmp_exp" result="fail"/><test-result test-name="cmp_lex" result="fail"/><test-result test-name="cmp_set" result="fail"/><test-result test-name="cmp_tribool" result="fail"/><test-result test-name="det" result="fail"/><test-result test-name="fmod" result="fail"/><test-result test-name="integer" result="fail"/><test-result test-name="mul" result="fail"/><test-result test-name="overflow" result="fail"/><test-result test-name="pi" result="fail"/><test-result test-name="pow" result="fail"/><test-result test-name="test_float" result="fail"/></library>
-<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="fail"/><test-result test-name="placement_new" result="fail"/><test-result test-name="test1" result="fail"/><test-result test-name="test2" result="fail"/><test-result test-name="test3" result="fail"/><test-result test-name="test4" result="fail"/><test-result test-name="test5" result="fail"/><test-result test-name="test6" result="fail"/></library>
 <library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="fail"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
-<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="fail"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
-<library name="python"><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="fail"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="fail"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="fail"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="fail"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="fail"/><test-result test-name="ptr_array" result="fail"/><test-result test-name="ptr_deque" result="fail"/><test-result test-name="ptr_list" result="fail"/><test-result test-name="ptr_map" result="fail"/><test-result test-name="ptr_set" result="fail"/><test-result test-name="ptr_vector" result="fail"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="fail"/><test-result test-name="view_example" result="fail"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
 <library name="random"><test-result test-name="random_demo" result="fail"/><test-result test-name="random_test" result="fail"/></library>
-<library name="range"><test-result test-name="array_test" result="fail"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="fail"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="fail"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
-<library name="serialization"><test-result test-name="test_array_binary_archive" result="fail"/><test-result test-name="test_array_text_archive" result="fail"/><test-result test-name="test_array_text_warchive" result="fail"/><test-result test-name="test_array_xml_archive" result="fail"/><test-result test-name="test_array_xml_warchive" result="fail"/><test-result test-name="test_binary_binary_archive" result="fail"/><test-result test-name="test_binary_text_archive" result="fail"/><test-result test-name="test_binary_text_warchive" result="fail"/><test-result test-name="test_binary_xml_archive" result="fail"/><test-result test-name="test_binary_xml_warchive" result="fail"/><test-result test-name="test_class_info_load_binary_archive" result="fail"/><test-result test-name="test_class_info_load_text_archive" result="fail"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_class_info_load_xml_archive" result="fail"/><test-result test-name="test_class_info_load_xml_warchive" result="fail"/><test-result test-name="test_class_info_save_binary_archive" result="fail"/><test-result test-name="test_class_info_save_text_archive" result="fail"/><test-result test-name="test_class_info_save_text_warchive" result="fail"/><test-result test-name="test_class_info_save_xml_archive" result="fail"/><test-result test-name="test_class_info_save_xml_warchive" result="fail"/><test-result test-name="test_codecvt_null" result="fail"/><test-result test-name="test_const" result="fail"/><test-result test-name="test_contained_class_binary_archive" result="fail"/><test-result test-name="test_contained_class_text_archive" result="fail"/><test-result test-name="test_contained_class_text_warchive" result="fail"/><test-result test-name="test_contained_class_xml_archive" result="fail"/><test-result test-name="test_contained_class_xml_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_text_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="fail"/><test-result test-name="test_delete_pointer_binary_archive" result="fail"/><test-result test-name="test_delete_pointer_text_archive" result="fail"/><test-result test-name="test_delete_pointer_text_warchive" result="fail"/><test-result test-name="test_delete_pointer_xml_archive" result="fail"/><test-result test-name="test_delete_pointer_xml_warchive" result="fail"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_auto_ptr" result="fail"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_fast_archive" result="fail"/><test-result test-name="test_demo_pimpl" result="fail"/><test-result test-name="test_demo_polymorphic" result="fail"/><test-result test-name="test_demo_portable_archive" result="fail"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_xml" result="fail"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_demo_xml_save" result="fail"/><test-result test-name="test_deque_binary_archive" result="fail"/><test-result test-name="test_deque_text_archive" result="fail"/><test-result test-name="test_deque_text_warchive" result="fail"/><test-result test-name="test_deque_xml_archive" result="fail"/><test-result test-name="test_deque_xml_warchive" result="fail"/><test-result test-name="test_derived_binary_archive" result="fail"/><test-result test-name="test_derived_class_binary_archive" result="fail"/><test-result test-name="test_derived_class_ptr_binary_archive" result="fail"/><test-result test-name="test_derived_class_ptr_text_archive" result="fail"/><test-result test-name="test_derived_class_ptr_text_warchive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_archive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_derived_class_text_archive" result="fail"/><test-result test-name="test_derived_class_text_warchive" result="fail"/><test-result test-name="test_derived_class_xml_archive" result="fail"/><test-result test-name="test_derived_class_xml_warchive" result="fail"/><test-result test-name="test_derived_text_archive" result="fail"/><test-result test-name="test_derived_text_warchive" result="fail"/><test-result test-name="test_derived_xml_archive" result="fail"/><test-result test-name="test_derived_xml_warchive" result="fail"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_xml_archive" result="fail"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_exported_binary_archive" result="fail"/><test-result test-name="test_exported_text_archive" result="fail"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_exported_xml_archive" result="fail"/><test-result test-name="test_exported_xml_warchive" result="fail"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="fail"/><test-result test-name="test_list_ptrs_binary_archive" result="fail"/><test-result test-name="test_list_ptrs_text_archive" result="fail"/><test-result test-name="test_list_ptrs_text_warchive" result="fail"/><test-result test-name="test_list_ptrs_xml_archive" result="fail"/><test-result test-name="test_list_ptrs_xml_warchive" result="fail"/><test-result test-name="test_list_text_archive" result="fail"/><test-result test-name="test_list_text_warchive" result="fail"/><test-result test-name="test_list_xml_archive" result="fail"/><test-result test-name="test_list_xml_warchive" result="fail"/><test-result test-name="test_map_binary_archive" result="fail"/><test-result test-name="test_map_text_archive" result="fail"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_map_xml_archive" result="fail"/><test-result test-name="test_map_xml_warchive" result="fail"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="fail"/><test-result test-name="test_multiple_ptrs_text_archive" result="fail"/><test-result test-name="test_multiple_ptrs_text_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_archive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="fail"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor_text_archive" result="fail"/><test-result test-name="test_non_default_ctor_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor_xml_warchive" result="fail"/><test-result test-name="test_non_intrusive_binary_archive" result="fail"/><test-result test-name="test_non_intrusive_text_archive" result="fail"/><test-result test-name="test_non_intrusive_text_warchive" result="fail"/><test-result test-name="test_non_intrusive_xml_archive" result="fail"/><test-result test-name="test_non_intrusive_xml_warchive" result="fail"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="fail"/><test-result test-name="test_no_rtti_text_archive" result="fail"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="fail"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="fail"/><test-result test-name="test_null_ptr_text_archive" result="fail"/><test-result test-name="test_null_ptr_text_warchive" result="fail"/><test-result test-name="test_null_ptr_xml_archive" result="fail"/><test-result test-name="test_null_ptr_xml_warchive" result="fail"/><test-result test-name="test_nvp_binary_archive" result="fail"/><test-result test-name="test_nvp_text_archive" result="fail"/><test-result test-name="test_nvp_text_warchive" result="fail"/><test-result test-name="test_nvp_xml_archive" result="fail"/><test-result test-name="test_nvp_xml_warchive" result="fail"/><test-result test-name="test_object_binary_archive" result="fail"/><test-result test-name="test_object_text_archive" result="fail"/><test-result test-name="test_object_text_warchive" result="fail"/><test-result test-name="test_object_xml_archive" result="fail"/><test-result test-name="test_object_xml_warchive" result="fail"/><test-result test-name="test_optional_binary_archive" result="fail"/><test-result test-name="test_optional_text_archive" result="fail"/><test-result test-name="test_optional_text_warchive" result="fail"/><test-result test-name="test_optional_xml_archive" result="fail"/><test-result test-name="test_optional_xml_warchive" result="fail"/><test-result test-name="test_polymorphic_binary_archive" result="fail"/><test-result test-name="test_polymorphic_text_archive" result="fail"/><test-result test-name="test_polymorphic_text_warchive" result="fail"/><test-result test-name="test_polymorphic_xml_archive" result="fail"/><test-result test-name="test_polymorphic_xml_warchive" result="fail"/><test-result test-name="test_primitive_binary_archive" result="fail"/><test-result test-name="test_primitive_text_archive" result="fail"/><test-result test-name="test_primitive_text_warchive" result="fail"/><test-result test-name="test_primitive_xml_archive" result="fail"/><test-result test-name="test_primitive_xml_warchive" result="fail"/><test-result test-name="test_private_ctor" result="fail"/><test-result test-name="test_recursion_binary_archive" result="fail"/><test-result test-name="test_recursion_text_archive" result="fail"/><test-result test-name="test_recursion_text_warchive" result="fail"/><test-result test-name="test_recursion_xml_archive" result="fail"/><test-result test-name="test_recursion_xml_warchive" result="fail"/><test-result test-name="test_registered_binary_archive" result="fail"/><test-result test-name="test_registered_text_archive" result="fail"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_registered_xml_archive" result="fail"/><test-result test-name="test_registered_xml_warchive" result="fail"/><test-result test-name="test_set_binary_archive" result="fail"/><test-result test-name="test_set_text_archive" result="fail"/><test-result test-name="test_set_text_warchive" result="fail"/><test-result test-name="test_set_xml_archive" result="fail"/><test-result test-name="test_set_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_text_archive" result="fail"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="fail"/><test-result test-name="test_simple_class_ptr_binary_archive" result="fail"/><test-result test-name="test_simple_class_ptr_text_archive" result="fail"/><test-result test-name="test_simple_class_ptr_text_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_archive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_simple_class_text_archive" result="fail"/><test-result test-name="test_simple_class_text_warchive" result="fail"/><test-result test-name="test_simple_class_xml_archive" result="fail"/><test-result test-name="test_simple_class_xml_warchive" result="fail"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="fail"/><test-result test-name="test_split_text_archive" result="fail"/><test-result test-name="test_split_text_warchive" result="fail"/><test-result test-name="test_split_xml_archive" result="fail"/><test-result test-name="test_split_xml_warchive" result="fail"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="fail"/><test-result test-name="test_tracking_text_archive" result="fail"/><test-result test-name="test_tracking_text_warchive" result="fail"/><test-result test-name="test_tracking_xml_archive" result="fail"/><test-result test-name="test_tracking_xml_warchive" result="fail"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="fail"/><test-result test-name="test_unregistered_text_archive" result="fail"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_unregistered_xml_archive" result="fail"/><test-result test-name="test_unregistered_xml_warchive" result="fail"/><test-result test-name="test_utf8_codecvt" result="fail"/><test-result test-name="test_vector_binary_archive" result="fail"/><test-result test-name="test_vector_text_archive" result="fail"/><test-result test-name="test_vector_text_warchive" result="fail"/><test-result test-name="test_vector_xml_archive" result="fail"/><test-result test-name="test_vector_xml_warchive" result="fail"/><test-result test-name="test_void_cast" result="fail"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="fail"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="fail"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="fail"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="fail"/><test-result test-name="test_const_save_fail2" result="fail"/><test-result test-name="test_const_save_fail3" result="fail"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="fail"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_exception_dll" result="fail"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="fail"/><test-result test-name="test_demo_pimpl_dll" result="fail"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="fail"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_shared_ptr_dll" result="fail"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_diamond_binary_archive_dll" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_diamond_text_archive_dll" result="fail"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_text_warchive_dll" result="fail"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="fail"/><test-result test-name="test_map_binary_archive_dll" result="fail"/><test-result test-name="test_map_text_archive" result="fail"/><test-result test-name="test_map_text_archive_dll" result="fail"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_map_text_warchive_dll" result="fail"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
 <library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="fail"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
-<library name="spirit"><test-result test-name="action_tests" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="chset_tests" result="fail"/><test-result test-name="chset_tests_debug" result="fail"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="file_iterator_tests" result="fail"/><test-result test-name="file_iterator_tests_debug" result="fail"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="match_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="position_iterator_tests" result="fail"/><test-result test-name="position_iterator_tests_debug" result="fail"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/></library>
-<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="fail"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
-<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="fail"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="fail"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
-<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
-<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="fail"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="fail"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="fail"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="fail"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="fail"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="fail"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="fail"/><test-result test-name="remove_bounds_test" result="fail"/><test-result test-name="remove_const_test" result="fail"/><test-result test-name="remove_cv_test" result="fail"/><test-result test-name="remove_pointer_test" result="fail"/><test-result test-name="remove_reference_test" result="fail"/><test-result test-name="remove_volatile_test" result="fail"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="fail"/><test-result test-name="tricky_function_type_test" result="fail"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="fail"/><test-result test-name="tricky_partial_spec_test" result="fail"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
-<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="fail"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="fail"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="fail"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="char_strings_test" result="fail"/><test-result test-name="char_strings_test_debug" result="fail"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="fail"/><test-result test-name="chset_tests_debug" result="fail"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="file_iterator_tests" result="fail"/><test-result test-name="file_iterator_tests_debug" result="fail"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="grammar_def_test" result="fail"/><test-result test-name="grammar_def_test_debug" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="group_match_bug" result="fail"/><test-result test-name="group_match_bug_debug" result="fail"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="if_p_int_as_condition_test" result="fail"/><test-result test-name="if_p_int_as_condition_test_debug" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="match_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="symbols_add_null" result="fail"/><test-result test-name="symbols_add_null_debug" result="fail"/><test-result test-name="symbols_find_null" result="fail"/><test-result test-name="symbols_find_null_debug" result="fail"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="fail"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="fail"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="fail"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="fail"/><test-result test-name="extent_test" result="fail"/><test-result test-name="function_traits_test" result="fail"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="fail"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="fail"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="fail"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="fail"/><test-result test-name="rank_test" result="fail"/><test-result test-name="remove_all_extents_test" result="fail"/><test-result test-name="remove_bounds_test" result="fail"/><test-result test-name="remove_const_test" result="fail"/><test-result test-name="remove_cv_test" result="fail"/><test-result test-name="remove_extent_test" result="fail"/><test-result test-name="remove_pointer_test" result="fail"/><test-result test-name="remove_reference_test" result="fail"/><test-result test-name="remove_volatile_test" result="fail"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="fail"/><test-result test-name="tricky_function_type_test" result="fail"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="fail"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="fail"/><test-result test-name="dummy_arg_disambiguation" result="fail"/><test-result test-name="lazy" result="fail"/><test-result test-name="lazy_test" result="fail"/><test-result test-name="member_templates" result="fail"/><test-result test-name="namespace_disambiguation" result="fail"/><test-result test-name="no_disambiguation" result="fail"/><test-result test-name="partial_specializations" result="fail"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="fail"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="fail"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="fail"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="fail"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="fail"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
-<library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="fail"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
-<library name="lambda"><test-result test-name="algorithm_test" result="fail"/><test-result test-name="bind_tests_advanced" result="fail"/><test-result test-name="bind_tests_simple" result="fail"/><test-result test-name="bind_tests_simple_f_refs" result="fail"/><test-result test-name="bll_and_function" result="fail"/><test-result test-name="constructor_tests" result="fail"/><test-result test-name="control_structures" result="fail"/><test-result test-name="exception_test" result="fail"/><test-result test-name="extending_rt_traits" result="fail"/><test-result test-name="is_instance_of_test" result="fail"/><test-result test-name="lambda_cast_test" result="fail"/><test-result test-name="member_pointer_test" result="fail"/><test-result test-name="operator_tests_simple" result="fail"/><test-result test-name="phoenix_control_structures" result="fail"/><test-result test-name="switch_construct" result="fail"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="fail"/><test-result test-name="test_re2c_lexer" result="fail"/><test-result test-name="test_slex_lexer" result="fail"/></library>
+<library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="fail"/><test-result test-name="bind_tests_advanced" result="fail"/><test-result test-name="bind_tests_simple" result="fail"/><test-result test-name="bind_tests_simple_f_refs" result="fail"/><test-result test-name="bll_and_function" result="fail"/><test-result test-name="constructor_tests" result="fail"/><test-result test-name="control_structures" result="fail"/><test-result test-name="exception_test" result="fail"/><test-result test-name="extending_rt_traits" result="fail"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="fail"/><test-result test-name="member_pointer_test" result="fail"/><test-result test-name="operator_tests_simple" result="fail"/><test-result test-name="phoenix_control_structures" result="fail"/><test-result test-name="switch_construct" result="fail"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="fail"/><test-result test-name="array4" result="fail"/><test-result test-name="array5" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="fail"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="fail"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
-</toolset><toolset name="vc-7_0"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="container" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
-<library name="assign"><test-result test-name="array" result="fail"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="fail"/><test-result test-name="list_of" result="fail"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="fail"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
-<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testtime_wstream_std_config" result="fail"/><test-result test-name="testwrapping_int" result="success"/></library>
+</toolset>
+<toolset name="gcc-3_3-darwin">
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="function"><test-result test-name="allocator_test" result="fail"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="fail"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="fail"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="fail"/><test-result test-name="lib_function_test" result="fail"/><test-result test-name="mem_fun_cxx98" result="fail"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="fail"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="fail"/><test-result test-name="sum_avg_portable" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="fail"/><test-result test-name="betweenness_centrality_test" result="fail"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="fail"/><test-result test-name="bundled_properties" result="fail"/><test-result test-name="copy" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="fail"/><test-result test-name="dijkstra_cc" result="fail"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="fail"/><test-result test-name="transitive_closure_test" result="fail"/><test-result test-name="vector_graph_cc" result="fail"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
 <library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
-<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="fail"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="gzip_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/><test-result test-name="zlib_test" result="success"/></library>
+<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="fail"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
 <library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
-<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="fail"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="fail"/><test-result test-name="special_functions_test" result="fail"/></library>
-<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="fail"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
+<library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
 <library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
-<library name="numeric/interval"><test-result test-name="add" result="fail"/><test-result test-name="cmp" result="fail"/><test-result test-name="cmp_exn" result="fail"/><test-result test-name="cmp_exp" result="fail"/><test-result test-name="cmp_lex" result="fail"/><test-result test-name="cmp_set" result="fail"/><test-result test-name="cmp_tribool" result="fail"/><test-result test-name="det" result="fail"/><test-result test-name="fmod" result="fail"/><test-result test-name="integer" result="fail"/><test-result test-name="mul" result="fail"/><test-result test-name="overflow" result="fail"/><test-result test-name="pi" result="fail"/><test-result test-name="pow" result="fail"/><test-result test-name="test_float" result="fail"/></library>
-<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
-<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="fail"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
-<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
-<library name="python"><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/></library>
-<library name="random"><test-result test-name="random_demo" result="fail"/><test-result test-name="random_test" result="fail"/></library>
-<library name="range"><test-result test-name="array_test" result="fail"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="fail"/><test-result test-name="reversible_range_test" result="fail"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="fail"/><test-result test-name="sub_range" result="fail"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
-<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const" result="fail"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_pimpl" result="fail"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_demo_xml_save" result="fail"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="fail"/><test-result test-name="test_map_text_archive" result="fail"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_void_cast" result="success"/></library>
-<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="fail"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
-<library name="spirit"><test-result test-name="action_tests" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="chset_tests" result="fail"/><test-result test-name="chset_tests_debug" result="fail"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="match_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/></library>
-<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="fail"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
-<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
-<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
-<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="fail"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="fail"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="fail"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="fail"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="fail"/><test-result test-name="remove_bounds_test" result="fail"/><test-result test-name="remove_const_test" result="fail"/><test-result test-name="remove_cv_test" result="fail"/><test-result test-name="remove_pointer_test" result="fail"/><test-result test-name="remove_reference_test" result="fail"/><test-result test-name="remove_volatile_test" result="fail"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="fail"/><test-result test-name="tricky_function_type_test" result="fail"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="fail"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
-<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="fail"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="fail"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="fail"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
-<library name="variant"><test-result test-name="recursive_variant_test" result="fail"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="fail"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="fail"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="fail"/><test-result test-name="test2" result="fail"/><test-result test-name="test3" result="fail"/><test-result test-name="test4" result="fail"/><test-result test-name="test5" result="fail"/><test-result test-name="test6" result="fail"/></library>
+<library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="fail"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="fail"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/><test-result test-name="testwave" result="success"/></library>
 <library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
-<library name="lambda"><test-result test-name="algorithm_test" result="fail"/><test-result test-name="bind_tests_advanced" result="fail"/><test-result test-name="bind_tests_simple" result="fail"/><test-result test-name="bind_tests_simple_f_refs" result="fail"/><test-result test-name="bll_and_function" result="fail"/><test-result test-name="constructor_tests" result="fail"/><test-result test-name="control_structures" result="fail"/><test-result test-name="exception_test" result="fail"/><test-result test-name="extending_rt_traits" result="fail"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="fail"/><test-result test-name="member_pointer_test" result="fail"/><test-result test-name="operator_tests_simple" result="fail"/><test-result test-name="phoenix_control_structures" result="fail"/><test-result test-name="switch_construct" result="fail"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
-<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="fail"/><test-result test-name="array4" result="fail"/><test-result test-name="array5" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="fail"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="gcc-2.95.3-linux">
+<library name="test"><test-result test-name="basic_cstring_test" result="fail"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="token_iterator_test" result="fail"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="errors_handling_test" result="success"/></library>
+<library name="regex"><test-result test-name="captures_test" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="fail"/><test-result test-name="regex_timer" result="success"/></library>
+<library name="date_time"><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_facet_new" result="fail"/><test-result test-name="testformatters" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_facet_new_dll" result="fail"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testtime_input_facet" result="fail"/><test-result test-name="testtime_facet" result="fail"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testtime_wstream" result="fail"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testclocks" result="fail"/><test-result test-name="testlocal_time_input_facet" result="fail"/><test-result test-name="testlocal_time_facet" result="fail"/><test-result test-name="testlocal_time" result="fail"/><test-result test-name="testtz_database" result="fail"/><test-result test-name="testposix_time_zone" result="fail"/><test-result test-name="testcustom_time_zone" result="fail"/><test-result test-name="testdst_transition_day_rule" result="success"/></library>
+<library name="filesystem"><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="fstream_test" result="fail"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
+<library name="graph"><test-result test-name="king_ordering" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="graphviz_test" result="fail"/><test-result test-name="graph" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="adj_list_cc" result="success"/></library>
+<library name="program_options"><test-result test-name="winmain_dll" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="winmain" result="fail"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="positional_options_test" result="fail"/><test-result test-name="cmdline_test" result="fail"/><test-result test-name="variable_map_test" result="fail"/><test-result test-name="parsers_test" result="fail"/><test-result test-name="options_description_test" result="fail"/></library>
+<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="str" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="long" result="success"/><test-result test-name="list" result="success"/><test-result test-name="object" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="try" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="args" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="crossmod_exception" result="success"/></library>
+<library name="signals"><test-result test-name="trackable_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_thread" result="success"/></library>
+<library name="wave"><test-result test-name="test_re2c_lexer" result="fail"/><test-result test-name="test_slex_lexer" result="fail"/><test-result test-name="testwave" result="fail"/></library>
+<library name="any"><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/></library>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="regex" result="fail"/><test-result test-name="replace" result="fail"/><test-result test-name="split" result="fail"/><test-result test-name="find" result="fail"/><test-result test-name="predicate" result="fail"/><test-result test-name="conv" result="fail"/><test-result test-name="trim" result="fail"/></library>
+<library name="assign"><test-result test-name="multi_index_container" result="fail"/><test-result test-name="my_vector_example" result="fail"/><test-result test-name="email_example" result="fail"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="ptr_list_inserter" result="fail"/><test-result test-name="list_inserter" result="fail"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="ptr_list_of" result="fail"/><test-result test-name="list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="basic" result="success"/></library>
+<library name="bind"><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
+<library name="conversion"><test-result test-name="lexical_cast_test" result="fail"/><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="format"><test-result test-name="format_test_wstring" result="success"/><test-result test-name="format_test3" result="fail"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test1" result="success"/></library>
+<library name="function"><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="function_test_fail1" result="success"/></library>
+<library name="functional/hash"><test-result test-name="link_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_number_test" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_test" result="fail"/><test-result test-name="ios_state_unit_test" result="fail"/></library>
+<library name="iostreams"><test-result test-name="wide_stream_test" result="fail"/><test-result test-name="tee_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="finite_state_filter_test" result="fail"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="direct_adapter_test" result="fail"/><test-result test-name="counter_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="code_converter_test" result="fail"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="gzip_test" result="fail"/></library>
+<library name="iterator"><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="is_convertible_fail" result="fail"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="fail"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="fail"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="fail"/><test-result test-name="octonion_test" result="fail"/><test-result test-name="quaternion_test" result="fail"/><test-result test-name="special_functions_test" result="fail"/><test-result test-name="quaternion_mult_incl_test" result="success"/></library>
+<library name="mpl"><test-result test-name="for_each" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="fail"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="fail"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="fail"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="fail"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="fail"/><test-result test-name="set_c" result="fail"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="resize" result="fail"/><test-result test-name="stl_interaction" result="fail"/><test-result test-name="idxgen1" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="assign_to_array" result="fail"/><test-result test-name="assign" result="fail"/><test-result test-name="slice" result="success"/><test-result test-name="iterators" result="fail"/><test-result test-name="compare" result="fail"/><test-result test-name="access" result="success"/><test-result test-name="constructors" result="fail"/><test-result test-name="concept_checks" result="fail"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_cbracket" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="fail"/><test-result test-name="test_capacity" result="fail"/><test-result test-name="test_comparison" result="fail"/><test-result test-name="test_composite_key" result="fail"/><test-result test-name="test_conv_iterators" result="fail"/><test-result test-name="test_copy_assignment" result="fail"/><test-result test-name="test_hash_ops" result="fail"/><test-result test-name="test_iterators" result="fail"/><test-result test-name="test_key_extractors" result="fail"/><test-result test-name="test_list_ops" result="fail"/><test-result test-name="test_modifiers" result="fail"/><test-result test-name="test_mpl_ops" result="fail"/><test-result test-name="test_observers" result="fail"/><test-result test-name="test_projection" result="fail"/><test-result test-name="test_range" result="fail"/><test-result test-name="test_safe_mode" result="fail"/><test-result test-name="test_set_ops" result="fail"/><test-result test-name="test_special_list_ops" result="fail"/><test-result test-name="test_special_set_ops" result="fail"/><test-result test-name="test_update" result="fail"/></library>
+<library name="numeric/conversion"><test-result test-name="udt_example_0" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="udt_support_test" result="fail"/><test-result test-name="converter_test" result="fail"/><test-result test-name="traits_test" result="fail"/><test-result test-name="bounds_test" result="fail"/></library>
+<library name="numeric/interval"><test-result test-name="test_float" result="success"/><test-result test-name="cmp_tribool" result="fail"/><test-result test-name="cmp_set" result="fail"/><test-result test-name="cmp_lex" result="fail"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_exn" result="fail"/><test-result test-name="cmp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="det" result="success"/><test-result test-name="add" result="success"/><test-result test-name="integer" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="placement_new" result="fail"/><test-result test-name="test6" result="fail"/><test-result test-name="test5" result="fail"/><test-result test-name="test4" result="fail"/><test-result test-name="test3" result="fail"/><test-result test-name="test2" result="fail"/><test-result test-name="test1" result="fail"/><test-result test-name="concepts" result="fail"/></library>
+<library name="optional"><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/></library>
+<library name="parameter"><test-result test-name="tutorial" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="basics" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="indirect_fun" result="fail"/><test-result test-name="tut1" result="fail"/><test-result test-name="iterator_test" result="fail"/><test-result test-name="view_example" result="fail"/><test-result test-name="incomplete_type_test" result="fail"/><test-result test-name="tree_test" result="fail"/><test-result test-name="ptr_array" result="fail"/><test-result test-name="ptr_map" result="fail"/><test-result test-name="ptr_set" result="fail"/><test-result test-name="ptr_deque" result="fail"/><test-result test-name="ptr_list" result="fail"/><test-result test-name="ptr_vector" result="fail"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
+<library name="range"><test-result test-name="extension_mechanism" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="reversible_range" result="fail"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="sub_range" result="fail"/><test-result test-name="iterator_range" result="fail"/><test-result test-name="string" result="fail"/><test-result test-name="std_container" result="fail"/><test-result test-name="iterator_pair" result="fail"/><test-result test-name="array" result="fail"/></library>
+<library name="smart_ptr"><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_assign_fail" result="fail"/></library>
+<library name="spirit"><test-result test-name="match_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="char_strings_test" result="fail"/><test-result test-name="char_strings_test_debug" result="fail"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="group_match_bug" result="fail"/><test-result test-name="group_match_bug_debug" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="if_p_int_as_condition_test" result="fail"/><test-result test-name="if_p_int_as_condition_test_debug" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="grammar_def_test" result="fail"/><test-result test-name="grammar_def_test_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="symbols_find_null" result="fail"/><test-result test-name="symbols_find_null_debug" result="fail"/><test-result test-name="symbols_add_null" result="fail"/><test-result test-name="symbols_add_null_debug" result="fail"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="chset_tests" result="fail"/><test-result test-name="chset_tests_debug" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="action_tests" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="fail"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="fail"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="fail"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="partial_specializations" result="fail"/><test-result test-name="no_disambiguation" result="fail"/><test-result test-name="namespace_disambiguation" result="fail"/><test-result test-name="member_templates" result="fail"/><test-result test-name="lazy_test" result="fail"/><test-result test-name="lazy" result="fail"/><test-result test-name="dummy_arg_disambiguation" result="fail"/><test-result test-name="constructors" result="fail"/></library>
+<library name="utility"><test-result test-name="value_init_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="result_of_test" result="fail"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="checked_delete_test" result="success"/></library>
+<library name="variant"><test-result test-name="variant_visit_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test1" result="success"/></library>
+<library name="serialization"><test-result test-name="test_const_pass" result="fail"/><test-result test-name="test_traits_pass" result="fail"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_not_serializable" result="success"/></library>
+<library name="config"><test-result test-name="config_link_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="test_thread_fail1" result="success"/></library>
+<library name="array"><test-result test-name="array5" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array1" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/></library>
+<library name="integer"><test-result test-name="integer_traits_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/></library>
+<library name="lambda"><test-result test-name="switch_construct" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="member_pointer_test" result="fail"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="fail"/></library>
+<library name="rational"><test-result test-name="rational_test" result="fail"/><test-result test-name="rational_example" result="success"/></library>
+<library name="tokenizer"><test-result test-name="simple_example_5" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="examples" result="success"/></library>
+<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="preprocessor"><test-result test-name="tuple" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="list" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="control" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="array" result="success"/><test-result test-name="arithmetic" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
-</toolset><toolset name="vc-8_0"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="container" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
-<library name="assign"><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
-<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="fail"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
+</toolset>
+<toolset name="gcc-2.95.3-stlport-4.6.2-linux">
+<library name="test"><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="token_iterator_test" result="fail"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="errors_handling_test" result="success"/></library>
+<library name="regex"><test-result test-name="captures_test" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="fail"/><test-result test-name="recursion_test" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="captures_example" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="regex_timer" result="success"/></library>
+<library name="date_time"><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_facet_new" result="fail"/><test-result test-name="testformatters" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_facet_new_dll" result="fail"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testtime_input_facet" result="fail"/><test-result test-name="testtime_facet" result="fail"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testlocal_time_input_facet" result="fail"/><test-result test-name="testlocal_time_facet" result="fail"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/></library>
+<library name="filesystem"><test-result test-name="path_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="convenience_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
+<library name="graph"><test-result test-name="king_ordering" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="graphviz_test" result="fail"/><test-result test-name="graph" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="vector_graph_cc" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="adj_list_cc" result="success"/></library>
+<library name="program_options"><test-result test-name="winmain_dll" result="success"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="cmdline_test" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="options_description_test" result="success"/></library>
+<library name="python"><test-result test-name="select_from_python_test" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="result" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="str" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="long" result="success"/><test-result test-name="list" result="success"/><test-result test-name="object" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="try" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="args" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="wrapper_held_type" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="andreas_beyer" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="crossmod_exception" result="success"/></library>
+<library name="signals"><test-result test-name="trackable_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="dead_slot_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_xtime_lib" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_barrier" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_thread" result="success"/></library>
+<library name="wave"><test-result test-name="test_re2c_lexer" result="fail"/><test-result test-name="test_slex_lexer" result="fail"/><test-result test-name="testwave" result="fail"/></library>
+<library name="any"><test-result test-name="any_to_ref_test" result="success"/><test-result test-name="any_test" result="success"/></library>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="regex" result="fail"/><test-result test-name="replace" result="fail"/><test-result test-name="split" result="fail"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="conv" result="fail"/><test-result test-name="trim" result="success"/></library>
+<library name="assign"><test-result test-name="multi_index_container" result="fail"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="ptr_list_inserter" result="fail"/><test-result test-name="list_inserter" result="fail"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="ptr_list_of" result="fail"/><test-result test-name="list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="basic" result="success"/></library>
+<library name="bind"><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_test" result="success"/></library>
+<library name="conversion"><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/></library>
+<library name="format"><test-result test-name="format_test_wstring" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test1" result="success"/></library>
+<library name="function"><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="allocator_test" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="function_test_fail1" result="success"/></library>
+<library name="functional/hash"><test-result test-name="link_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_number_test" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="fail"/></library>
+<library name="iostreams"><test-result test-name="wide_stream_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="seekable_file_test" result="fail"/><test-result test-name="restrict_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="finite_state_filter_test" result="fail"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="array_test" result="success"/><test-result test-name="bzip2_test" result="success"/><test-result test-name="zlib_test" result="success"/><test-result test-name="gzip_test" result="success"/></library>
+<library name="iterator"><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="concept_tests" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/><test-result test-name="is_convertible_fail" result="fail"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="interoperable_fail" result="fail"/></library>
+<library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="fail"/><test-result test-name="octonion_test" result="fail"/><test-result test-name="quaternion_test" result="fail"/><test-result test-name="special_functions_test" result="fail"/><test-result test-name="quaternion_mult_incl_test" result="success"/></library>
+<library name="mpl"><test-result test-name="for_each" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="fail"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="fail"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="fail"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="fail"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="fail"/><test-result test-name="set_c" result="fail"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
+<library name="multi_array"><test-result test-name="resize" result="fail"/><test-result test-name="stl_interaction" result="fail"/><test-result test-name="idxgen1" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="storage_order" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="assign_to_array" result="fail"/><test-result test-name="assign" result="fail"/><test-result test-name="slice" result="success"/><test-result test-name="iterators" result="fail"/><test-result test-name="compare" result="fail"/><test-result test-name="access" result="success"/><test-result test-name="constructors" result="fail"/><test-result test-name="concept_checks" result="fail"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_cbracket" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="fail"/><test-result test-name="test_capacity" result="fail"/><test-result test-name="test_comparison" result="fail"/><test-result test-name="test_composite_key" result="fail"/><test-result test-name="test_conv_iterators" result="fail"/><test-result test-name="test_copy_assignment" result="fail"/><test-result test-name="test_hash_ops" result="fail"/><test-result test-name="test_iterators" result="fail"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="fail"/><test-result test-name="test_modifiers" result="fail"/><test-result test-name="test_mpl_ops" result="fail"/><test-result test-name="test_observers" result="fail"/><test-result test-name="test_projection" result="fail"/><test-result test-name="test_range" result="fail"/><test-result test-name="test_safe_mode" result="fail"/><test-result test-name="test_set_ops" result="fail"/><test-result test-name="test_special_list_ops" result="fail"/><test-result test-name="test_special_set_ops" result="fail"/><test-result test-name="test_update" result="fail"/></library>
+<library name="numeric/conversion"><test-result test-name="udt_example_0" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="udt_support_test" result="fail"/><test-result test-name="converter_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="bounds_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="test_float" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="det" result="success"/><test-result test-name="add" result="success"/><test-result test-name="integer" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="placement_new" result="fail"/><test-result test-name="test6" result="fail"/><test-result test-name="test5" result="fail"/><test-result test-name="test4" result="fail"/><test-result test-name="test3" result="fail"/><test-result test-name="test2" result="fail"/><test-result test-name="test1" result="fail"/><test-result test-name="concepts" result="fail"/></library>
+<library name="optional"><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail1" result="success"/></library>
+<library name="parameter"><test-result test-name="tutorial" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="basics" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="indirect_fun" result="fail"/><test-result test-name="tut1" result="fail"/><test-result test-name="iterator_test" result="fail"/><test-result test-name="view_example" result="fail"/><test-result test-name="incomplete_type_test" result="fail"/><test-result test-name="tree_test" result="fail"/><test-result test-name="ptr_array" result="fail"/><test-result test-name="ptr_map" result="fail"/><test-result test-name="ptr_set" result="fail"/><test-result test-name="ptr_deque" result="fail"/><test-result test-name="ptr_list" result="fail"/><test-result test-name="ptr_vector" result="fail"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
+<library name="range"><test-result test-name="extension_mechanism" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="sub_range" result="fail"/><test-result test-name="iterator_range" result="fail"/><test-result test-name="string" result="fail"/><test-result test-name="std_container" result="fail"/><test-result test-name="iterator_pair" result="fail"/><test-result test-name="array" result="fail"/></library>
+<library name="smart_ptr"><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_assign_fail" result="fail"/></library>
+<library name="spirit"><test-result test-name="match_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="char_strings_test" result="fail"/><test-result test-name="char_strings_test_debug" result="fail"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="group_match_bug" result="fail"/><test-result test-name="group_match_bug_debug" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="if_p_int_as_condition_test" result="fail"/><test-result test-name="if_p_int_as_condition_test_debug" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="grammar_def_test" result="fail"/><test-result test-name="grammar_def_test_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="symbols_find_null" result="fail"/><test-result test-name="symbols_find_null_debug" result="fail"/><test-result test-name="symbols_add_null" result="fail"/><test-result test-name="symbols_add_null_debug" result="fail"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="chset_tests" result="fail"/><test-result test-name="chset_tests_debug" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="action_tests" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="multi_pass_compile_tests" result="fail"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="fail"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="fail"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="fail"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="fail"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="partial_specializations" result="fail"/><test-result test-name="no_disambiguation" result="fail"/><test-result test-name="namespace_disambiguation" result="fail"/><test-result test-name="member_templates" result="fail"/><test-result test-name="lazy_test" result="fail"/><test-result test-name="lazy" result="fail"/><test-result test-name="dummy_arg_disambiguation" result="fail"/><test-result test-name="constructors" result="fail"/></library>
+<library name="utility"><test-result test-name="value_init_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="addressof_test" result="success"/><test-result test-name="value_init_test_fail3" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="result_of_test" result="fail"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="checked_delete_test" result="success"/></library>
+<library name="variant"><test-result test-name="variant_visit_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test1" result="success"/></library>
+<library name="serialization"><test-result test-name="test_const_pass" result="fail"/><test-result test-name="test_traits_pass" result="fail"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_not_serializable" result="success"/></library>
+<library name="config"><test-result test-name="config_link_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="test_thread_fail2" result="success"/><test-result test-name="test_thread_fail1" result="success"/></library>
+<library name="array"><test-result test-name="array5" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array1" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/></library>
+<library name="integer"><test-result test-name="integer_traits_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="cstdint_test" result="success"/></library>
+<library name="lambda"><test-result test-name="switch_construct" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="member_pointer_test" result="fail"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="algorithm_test" result="success"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="fail"/></library>
+<library name="rational"><test-result test-name="rational_test" result="success"/><test-result test-name="rational_example" result="success"/></library>
+<library name="tokenizer"><test-result test-name="simple_example_5" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="examples" result="success"/></library>
+<library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
+<library name="preprocessor"><test-result test-name="tuple" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="list" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="control" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="array" result="success"/><test-result test-name="arithmetic" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="sunpro-5_8u1-sunos">
+<toolset-alias name="sun-5.8"/>
+<library name="test"><test-result test-name="class_properties_test" result="success"/><test-result test-name="basic_cstring_test" result="fail"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="foreach_test" result="fail"/><test-result test-name="output_test_stream_test" result="fail"/><test-result test-name="result_report_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="test_fp_comparisons" result="fail"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="test_case_template_test" result="fail"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="fail"/><test-result test-name="algorithms_test" result="success"/><test-result test-name="token_iterator_test" result="fail"/><test-result test-name="boost_check_equal_str" result="success"/></library>
+<library name="regex"><test-result test-name="regex_regress" result="fail"/><test-result test-name="posix_api_check" result="fail"/><test-result test-name="posix_api_check_cpp" result="fail"/><test-result test-name="wide_posix_api_check_cpp" result="fail"/><test-result test-name="bad_expression_test" result="fail"/><test-result test-name="recursion_test" result="fail"/><test-result test-name="unicode_iterator_test" result="fail"/><test-result test-name="static_mutex_test" result="fail"/><test-result test-name="object_cache_test" result="fail"/><test-result test-name="regex_config_info" result="fail"/><test-result test-name="regex_dll_config_info" result="fail"/><test-result test-name="collate_info" result="fail"/><test-result test-name="regex_regress_dll" result="fail"/><test-result test-name="captures_test" result="fail"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="concept_check" result="fail"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="regex_timer" result="fail"/><test-result test-name="grep" result="fail"/><test-result test-name="credit_card_example" result="fail"/><test-result test-name="mfc_example" result="fail"/><test-result test-name="icu_example" result="fail"/><test-result test-name="partial_regex_grep" result="fail"/><test-result test-name="partial_regex_match" result="fail"/><test-result test-name="regex_grep_example_1" result="fail"/><test-result test-name="regex_grep_example_2" result="fail"/><test-result test-name="regex_grep_example_3" result="fail"/><test-result test-name="regex_grep_example_4" result="fail"/><test-result test-name="regex_match_example" result="fail"/><test-result test-name="regex_merge_example" result="fail"/><test-result test-name="regex_replace_example" result="fail"/><test-result test-name="regex_search_example" result="fail"/><test-result test-name="regex_split_example_1" result="fail"/><test-result test-name="regex_split_example_2" result="fail"/><test-result test-name="regex_token_iterator_eg_1" result="fail"/><test-result test-name="regex_token_iterator_eg_2" result="fail"/><test-result test-name="regex_iterator_example" result="fail"/><test-result test-name="captures_example" result="fail"/></library>
+<library name="date_time"><test-result test-name="testint_adapter" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testwrapping_int" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testdate_facet_new" result="fail"/><test-result test-name="testdate_input_facet" result="fail"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testdate_facet_new_dll" result="fail"/><test-result test-name="testdate_input_facet_dll" result="fail"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testclock" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testiterator" result="fail"/><test-result test-name="testparse_time" result="fail"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testtime_facet" result="fail"/><test-result test-name="testtime_input_facet" result="fail"/><test-result test-name="testgreg_wstream" result="fail"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testfacet_dll" result="fail"/><test-result test-name="testfacet" result="fail"/><test-result test-name="testparse_date" result="fail"/><test-result test-name="teststreams" result="fail"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testcustom_time_zone" result="fail"/><test-result test-name="testposix_time_zone" result="fail"/><test-result test-name="testtz_database" result="fail"/><test-result test-name="testlocal_time" result="fail"/><test-result test-name="testlocal_time_facet" result="fail"/><test-result test-name="testlocal_time_input_facet" result="fail"/><test-result test-name="testclocks" result="fail"/><test-result test-name="testgreg_serialize_xml" result="fail"/><test-result test-name="testtime_serialize_xml_std_config" result="fail"/><test-result test-name="testtime_serialize_xml" result="fail"/><test-result test-name="testgreg_serialize" result="fail"/><test-result test-name="testtime_serialize_std_config" result="fail"/><test-result test-name="testtime_serialize" result="fail"/></library>
+<library name="serialization"><test-result test-name="test_array_text_archive" result="fail"/><test-result test-name="test_array_text_archive_dll" result="fail"/><test-result test-name="test_array_text_warchive" result="fail"/><test-result test-name="test_array_text_warchive_dll" result="fail"/><test-result test-name="test_array_binary_archive" result="fail"/><test-result test-name="test_array_binary_archive_dll" result="fail"/><test-result test-name="test_array_xml_archive" result="fail"/><test-result test-name="test_array_xml_archive_dll" result="fail"/><test-result test-name="test_array_xml_warchive" result="fail"/><test-result test-name="test_array_xml_warchive_dll" result="fail"/><test-result test-name="test_binary_text_archive" result="fail"/><test-result test-name="test_binary_text_archive_dll" result="fail"/><test-result test-name="test_binary_text_warchive" result="fail"/><test-result test-name="test_binary_text_warchive_dll" result="fail"/><test-result test-name="test_binary_binary_archive" result="fail"/><test-result test-name="test_binary_binary_archive_dll" result="fail"/><test-result test-name="test_binary_xml_archive" result="fail"/><test-result test-name="test_binary_xml_archive_dll" result="fail"/><test-result test-name="test_binary_xml_warchive" result="fail"/><test-result test-name="test_binary_xml_warchive_dll" result="fail"/><test-result test-name="test_contained_class_text_archive" result="fail"/><test-result test-name="test_contained_class_text_archive_dll" result="fail"/><test-result test-name="test_contained_class_text_warchive" result="fail"/><test-result test-name="test_contained_class_text_warchive_dll" result="fail"/><test-result test-name="test_contained_class_binary_archive" result="fail"/><test-result test-name="test_contained_class_binary_archive_dll" result="fail"/><test-result test-name="test_contained_class_xml_archive" result="fail"/><test-result test-name="test_contained_class_xml_archive_dll" result="fail"/><test-result test-name="test_contained_class_xml_warchive" result="fail"/><test-result test-name="test_contained_class_xml_warchive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_text_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="fail"/><test-result test-name="test_delete_pointer_text_archive" result="fail"/><test-result test-name="test_delete_pointer_text_archive_dll" result="fail"/><test-result test-name="test_delete_pointer_text_warchive" result="fail"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="fail"/><test-result test-name="test_delete_pointer_binary_archive" result="fail"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="fail"/><test-result test-name="test_delete_pointer_xml_archive" result="fail"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="fail"/><test-result test-name="test_delete_pointer_xml_warchive" result="fail"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="fail"/><test-result test-name="test_deque_text_archive" result="fail"/><test-result test-name="test_deque_text_archive_dll" result="fail"/><test-result test-name="test_deque_text_warchive" result="fail"/><test-result test-name="test_deque_text_warchive_dll" result="fail"/><test-result test-name="test_deque_binary_archive" result="fail"/><test-result test-name="test_deque_binary_archive_dll" result="fail"/><test-result test-name="test_deque_xml_archive" result="fail"/><test-result test-name="test_deque_xml_archive_dll" result="fail"/><test-result test-name="test_deque_xml_warchive" result="fail"/><test-result test-name="test_deque_xml_warchive_dll" result="fail"/><test-result test-name="test_derived_text_archive" result="fail"/><test-result test-name="test_derived_text_archive_dll" result="fail"/><test-result test-name="test_derived_text_warchive" result="fail"/><test-result test-name="test_derived_text_warchive_dll" result="fail"/><test-result test-name="test_derived_binary_archive" result="fail"/><test-result test-name="test_derived_binary_archive_dll" result="fail"/><test-result test-name="test_derived_xml_archive" result="fail"/><test-result test-name="test_derived_xml_archive_dll" result="fail"/><test-result test-name="test_derived_xml_warchive" result="fail"/><test-result test-name="test_derived_xml_warchive_dll" result="fail"/><test-result test-name="test_derived_class_text_archive" result="fail"/><test-result test-name="test_derived_class_text_archive_dll" result="fail"/><test-result test-name="test_derived_class_text_warchive" result="fail"/><test-result test-name="test_derived_class_text_warchive_dll" result="fail"/><test-result test-name="test_derived_class_binary_archive" result="fail"/><test-result test-name="test_derived_class_binary_archive_dll" result="fail"/><test-result test-name="test_derived_class_xml_archive" result="fail"/><test-result test-name="test_derived_class_xml_archive_dll" result="fail"/><test-result test-name="test_derived_class_xml_warchive" result="fail"/><test-result test-name="test_derived_class_xml_warchive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_text_archive" result="fail"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_text_warchive" result="fail"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_binary_archive" result="fail"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_xml_archive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="fail"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_diamond_text_archive_dll" result="fail"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_text_warchive_dll" result="fail"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_diamond_binary_archive_dll" result="fail"/><test-result test-name="test_diamond_xml_archive" result="fail"/><test-result test-name="test_diamond_xml_archive_dll" result="fail"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_diamond_xml_warchive_dll" result="fail"/><test-result test-name="test_exported_text_archive" result="fail"/><test-result test-name="test_exported_text_archive_dll" result="fail"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_exported_text_warchive_dll" result="fail"/><test-result test-name="test_exported_binary_archive" result="fail"/><test-result test-name="test_exported_binary_archive_dll" result="fail"/><test-result test-name="test_exported_xml_archive" result="fail"/><test-result test-name="test_exported_xml_archive_dll" result="fail"/><test-result test-name="test_exported_xml_warchive" result="fail"/><test-result test-name="test_exported_xml_warchive_dll" result="fail"/><test-result test-name="test_class_info_save_text_archive" result="fail"/><test-result test-name="test_class_info_save_text_archive_dll" result="fail"/><test-result test-name="test_class_info_save_text_warchive" result="fail"/><test-result test-name="test_class_info_save_text_warchive_dll" result="fail"/><test-result test-name="test_class_info_save_binary_archive" result="fail"/><test-result test-name="test_class_info_save_binary_archive_dll" result="fail"/><test-result test-name="test_class_info_save_xml_archive" result="fail"/><test-result test-name="test_class_info_save_xml_archive_dll" result="fail"/><test-result test-name="test_class_info_save_xml_warchive" result="fail"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="fail"/><test-result test-name="test_class_info_load_text_archive" result="fail"/><test-result test-name="test_class_info_load_text_archive_dll" result="fail"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_class_info_load_text_warchive_dll" result="fail"/><test-result test-name="test_class_info_load_binary_archive" result="fail"/><test-result test-name="test_class_info_load_binary_archive_dll" result="fail"/><test-result test-name="test_class_info_load_xml_archive" result="fail"/><test-result test-name="test_class_info_load_xml_archive_dll" result="fail"/><test-result test-name="test_class_info_load_xml_warchive" result="fail"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="fail"/><test-result test-name="test_object_text_archive" result="fail"/><test-result test-name="test_object_text_archive_dll" result="fail"/><test-result test-name="test_object_text_warchive" result="fail"/><test-result test-name="test_object_text_warchive_dll" result="fail"/><test-result test-name="test_object_binary_archive" result="fail"/><test-result test-name="test_object_binary_archive_dll" result="fail"/><test-result test-name="test_object_xml_archive" result="fail"/><test-result test-name="test_object_xml_archive_dll" result="fail"/><test-result test-name="test_object_xml_warchive" result="fail"/><test-result test-name="test_object_xml_warchive_dll" result="fail"/><test-result test-name="test_primitive_text_archive" result="fail"/><test-result test-name="test_primitive_text_archive_dll" result="fail"/><test-result test-name="test_primitive_text_warchive" result="fail"/><test-result test-name="test_primitive_text_warchive_dll" result="fail"/><test-result test-name="test_primitive_binary_archive" result="fail"/><test-result test-name="test_primitive_binary_archive_dll" result="fail"/><test-result test-name="test_primitive_xml_archive" result="fail"/><test-result test-name="test_primitive_xml_archive_dll" result="fail"/><test-result test-name="test_primitive_xml_warchive" result="fail"/><test-result test-name="test_primitive_xml_warchive_dll" result="fail"/><test-result test-name="test_list_text_archive" result="fail"/><test-result test-name="test_list_text_archive_dll" result="fail"/><test-result test-name="test_list_text_warchive" result="fail"/><test-result test-name="test_list_text_warchive_dll" result="fail"/><test-result test-name="test_list_binary_archive" result="fail"/><test-result test-name="test_list_binary_archive_dll" result="fail"/><test-result test-name="test_list_xml_archive" result="fail"/><test-result test-name="test_list_xml_archive_dll" result="fail"/><test-result test-name="test_list_xml_warchive" result="fail"/><test-result test-name="test_list_xml_warchive_dll" result="fail"/><test-result test-name="test_list_ptrs_text_archive" result="fail"/><test-result test-name="test_list_ptrs_text_archive_dll" result="fail"/><test-result test-name="test_list_ptrs_text_warchive" result="fail"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="fail"/><test-result test-name="test_list_ptrs_binary_archive" result="fail"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="fail"/><test-result test-name="test_list_ptrs_xml_archive" result="fail"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="fail"/><test-result test-name="test_list_ptrs_xml_warchive" result="fail"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="fail"/><test-result test-name="test_map_text_archive" result="fail"/><test-result test-name="test_map_text_archive_dll" result="fail"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_map_text_warchive_dll" result="fail"/><test-result test-name="test_map_binary_archive" result="fail"/><test-result test-name="test_map_binary_archive_dll" result="fail"/><test-result test-name="test_map_xml_archive" result="fail"/><test-result test-name="test_map_xml_archive_dll" result="fail"/><test-result test-name="test_map_xml_warchive" result="fail"/><test-result test-name="test_map_xml_warchive_dll" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_mi_text_archive_dll" result="fail"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_text_warchive_dll" result="fail"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_mi_binary_archive_dll" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_mi_xml_archive_dll" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_mi_xml_warchive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_text_archive" result="fail"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_text_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_xml_archive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="fail"/><test-result test-name="test_no_rtti_text_archive" result="fail"/><test-result test-name="test_no_rtti_text_archive_dll" result="fail"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_no_rtti_text_warchive_dll" result="fail"/><test-result test-name="test_no_rtti_binary_archive" result="fail"/><test-result test-name="test_no_rtti_binary_archive_dll" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="fail"/><test-result test-name="test_no_rtti_xml_archive_dll" result="fail"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="fail"/><test-result test-name="test_non_intrusive_text_archive" result="fail"/><test-result test-name="test_non_intrusive_text_archive_dll" result="fail"/><test-result test-name="test_non_intrusive_text_warchive" result="fail"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="fail"/><test-result test-name="test_non_intrusive_binary_archive" result="fail"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="fail"/><test-result test-name="test_non_intrusive_xml_archive" result="fail"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="fail"/><test-result test-name="test_non_intrusive_xml_warchive" result="fail"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor_text_archive" result="fail"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="fail"/><test-result test-name="test_null_ptr_text_archive" result="fail"/><test-result test-name="test_null_ptr_text_archive_dll" result="fail"/><test-result test-name="test_null_ptr_text_warchive" result="fail"/><test-result test-name="test_null_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="fail"/><test-result test-name="test_null_ptr_binary_archive_dll" result="fail"/><test-result test-name="test_null_ptr_xml_archive" result="fail"/><test-result test-name="test_null_ptr_xml_archive_dll" result="fail"/><test-result test-name="test_null_ptr_xml_warchive" result="fail"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_nvp_text_archive" result="fail"/><test-result test-name="test_nvp_text_archive_dll" result="fail"/><test-result test-name="test_nvp_text_warchive" result="fail"/><test-result test-name="test_nvp_text_warchive_dll" result="fail"/><test-result test-name="test_nvp_binary_archive" result="fail"/><test-result test-name="test_nvp_binary_archive_dll" result="fail"/><test-result test-name="test_nvp_xml_archive" result="fail"/><test-result test-name="test_nvp_xml_archive_dll" result="fail"/><test-result test-name="test_nvp_xml_warchive" result="fail"/><test-result test-name="test_nvp_xml_warchive_dll" result="fail"/><test-result test-name="test_recursion_text_archive" result="fail"/><test-result test-name="test_recursion_text_archive_dll" result="fail"/><test-result test-name="test_recursion_text_warchive" result="fail"/><test-result test-name="test_recursion_text_warchive_dll" result="fail"/><test-result test-name="test_recursion_binary_archive" result="fail"/><test-result test-name="test_recursion_binary_archive_dll" result="fail"/><test-result test-name="test_recursion_xml_archive" result="fail"/><test-result test-name="test_recursion_xml_archive_dll" result="fail"/><test-result test-name="test_recursion_xml_warchive" result="fail"/><test-result test-name="test_recursion_xml_warchive_dll" result="fail"/><test-result test-name="test_registered_text_archive" result="fail"/><test-result test-name="test_registered_text_archive_dll" result="fail"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_registered_text_warchive_dll" result="fail"/><test-result test-name="test_registered_binary_archive" result="fail"/><test-result test-name="test_registered_binary_archive_dll" result="fail"/><test-result test-name="test_registered_xml_archive" result="fail"/><test-result test-name="test_registered_xml_archive_dll" result="fail"/><test-result test-name="test_registered_xml_warchive" result="fail"/><test-result test-name="test_registered_xml_warchive_dll" result="fail"/><test-result test-name="test_set_text_archive" result="fail"/><test-result test-name="test_set_text_archive_dll" result="fail"/><test-result test-name="test_set_text_warchive" result="fail"/><test-result test-name="test_set_text_warchive_dll" result="fail"/><test-result test-name="test_set_binary_archive" result="fail"/><test-result test-name="test_set_binary_archive_dll" result="fail"/><test-result test-name="test_set_xml_archive" result="fail"/><test-result test-name="test_set_xml_archive_dll" result="fail"/><test-result test-name="test_set_xml_warchive" result="fail"/><test-result test-name="test_set_xml_warchive_dll" result="fail"/><test-result test-name="test_simple_class_text_archive" result="fail"/><test-result test-name="test_simple_class_text_archive_dll" result="fail"/><test-result test-name="test_simple_class_text_warchive" result="fail"/><test-result test-name="test_simple_class_text_warchive_dll" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="fail"/><test-result test-name="test_simple_class_binary_archive_dll" result="fail"/><test-result test-name="test_simple_class_xml_archive" result="fail"/><test-result test-name="test_simple_class_xml_archive_dll" result="fail"/><test-result test-name="test_simple_class_xml_warchive" result="fail"/><test-result test-name="test_simple_class_xml_warchive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_text_archive" result="fail"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_text_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_binary_archive" result="fail"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_xml_archive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="fail"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_split_text_archive" result="fail"/><test-result test-name="test_split_text_archive_dll" result="fail"/><test-result test-name="test_split_text_warchive" result="fail"/><test-result test-name="test_split_text_warchive_dll" result="fail"/><test-result test-name="test_split_binary_archive" result="fail"/><test-result test-name="test_split_binary_archive_dll" result="fail"/><test-result test-name="test_split_xml_archive" result="fail"/><test-result test-name="test_split_xml_archive_dll" result="fail"/><test-result test-name="test_split_xml_warchive" result="fail"/><test-result test-name="test_split_xml_warchive_dll" result="fail"/><test-result test-name="test_tracking_text_archive" result="fail"/><test-result test-name="test_tracking_text_archive_dll" result="fail"/><test-result test-name="test_tracking_text_warchive" result="fail"/><test-result test-name="test_tracking_text_warchive_dll" result="fail"/><test-result test-name="test_tracking_binary_archive" result="fail"/><test-result test-name="test_tracking_binary_archive_dll" result="fail"/><test-result test-name="test_tracking_xml_archive" result="fail"/><test-result test-name="test_tracking_xml_archive_dll" result="fail"/><test-result test-name="test_tracking_xml_warchive" result="fail"/><test-result test-name="test_tracking_xml_warchive_dll" result="fail"/><test-result test-name="test_unregistered_text_archive" result="fail"/><test-result test-name="test_unregistered_text_archive_dll" result="fail"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_unregistered_text_warchive_dll" result="fail"/><test-result test-name="test_unregistered_binary_archive" result="fail"/><test-result test-name="test_unregistered_binary_archive_dll" result="fail"/><test-result test-name="test_unregistered_xml_archive" result="fail"/><test-result test-name="test_unregistered_xml_archive_dll" result="fail"/><test-result test-name="test_unregistered_xml_warchive" result="fail"/><test-result test-name="test_unregistered_xml_warchive_dll" result="fail"/><test-result test-name="test_variant_text_archive" result="fail"/><test-result test-name="test_variant_text_archive_dll" result="fail"/><test-result test-name="test_variant_text_warchive" result="fail"/><test-result test-name="test_variant_text_warchive_dll" result="fail"/><test-result test-name="test_variant_binary_archive" result="fail"/><test-result test-name="test_variant_binary_archive_dll" result="fail"/><test-result test-name="test_variant_xml_archive" result="fail"/><test-result test-name="test_variant_xml_archive_dll" result="fail"/><test-result test-name="test_variant_xml_warchive" result="fail"/><test-result test-name="test_variant_xml_warchive_dll" result="fail"/><test-result test-name="test_vector_text_archive" result="fail"/><test-result test-name="test_vector_text_archive_dll" result="fail"/><test-result test-name="test_vector_text_warchive" result="fail"/><test-result test-name="test_vector_text_warchive_dll" result="fail"/><test-result test-name="test_vector_binary_archive" result="fail"/><test-result test-name="test_vector_binary_archive_dll" result="fail"/><test-result test-name="test_vector_xml_archive" result="fail"/><test-result test-name="test_vector_xml_archive_dll" result="fail"/><test-result test-name="test_vector_xml_warchive" result="fail"/><test-result test-name="test_vector_xml_warchive_dll" result="fail"/><test-result test-name="test_optional_text_archive" result="fail"/><test-result test-name="test_optional_text_archive_dll" result="fail"/><test-result test-name="test_optional_text_warchive" result="fail"/><test-result test-name="test_optional_text_warchive_dll" result="fail"/><test-result test-name="test_optional_binary_archive" result="fail"/><test-result test-name="test_optional_binary_archive_dll" result="fail"/><test-result test-name="test_optional_xml_archive" result="fail"/><test-result test-name="test_optional_xml_archive_dll" result="fail"/><test-result test-name="test_optional_xml_warchive" result="fail"/><test-result test-name="test_optional_xml_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_text_archive" result="fail"/><test-result test-name="test_shared_ptr_text_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_text_archive" result="fail"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="fail"/><test-result test-name="test_polymorphic_text_archive" result="fail"/><test-result test-name="test_polymorphic_text_archive_dll" result="fail"/><test-result test-name="test_polymorphic_text_warchive" result="fail"/><test-result test-name="test_polymorphic_text_warchive_dll" result="fail"/><test-result test-name="test_polymorphic_binary_archive" result="fail"/><test-result test-name="test_polymorphic_binary_archive_dll" result="fail"/><test-result test-name="test_polymorphic_xml_archive" result="fail"/><test-result test-name="test_polymorphic_xml_archive_dll" result="fail"/><test-result test-name="test_polymorphic_xml_warchive" result="fail"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="fail"/><test-result test-name="test_iterators" result="fail"/><test-result test-name="test_iterators_base64" result="fail"/><test-result test-name="test_private_ctor" result="fail"/><test-result test-name="test_private_ctor_dll" result="fail"/><test-result test-name="test_reset_object_address" result="fail"/><test-result test-name="test_reset_object_address_dll" result="fail"/><test-result test-name="test_smart_cast" result="fail"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_utf8_codecvt" result="fail"/><test-result test-name="test_void_cast" result="fail"/><test-result test-name="test_void_cast_dll" result="fail"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_mult_archive_types_dll" result="fail"/><test-result test-name="test_codecvt_null" result="fail"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_dll" result="fail"/><test-result test-name="test_demo_auto_ptr" result="fail"/><test-result test-name="test_demo_auto_ptr_dll" result="fail"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_exception_dll" result="fail"/><test-result test-name="test_demo_fast_archive" result="fail"/><test-result test-name="test_demo_fast_archive_dll" result="fail"/><test-result test-name="test_demo_pimpl" result="fail"/><test-result test-name="test_demo_pimpl_dll" result="fail"/><test-result test-name="test_demo_polymorphic" result="fail"/><test-result test-name="test_demo_polymorphic_dll" result="fail"/><test-result test-name="test_demo_portable_archive" result="fail"/><test-result test-name="test_demo_portable_archive_dll" result="fail"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_shared_ptr_dll" result="fail"/><test-result test-name="test_demo_xml" result="fail"/><test-result test-name="test_demo_xml_dll" result="fail"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_demo_xml_load_dll" result="fail"/><test-result test-name="test_demo_xml_save" result="fail"/><test-result test-name="test_demo_xml_save_dll" result="fail"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_inclusion" result="fail"/><test-result test-name="test_traits_pass" result="fail"/><test-result test-name="test_const_pass" result="fail"/></library>
+<library name="filesystem"><test-result test-name="path_test" result="fail"/><test-result test-name="path_test_dll" result="fail"/><test-result test-name="default_name_check_test" result="fail"/><test-result test-name="operations_test" result="fail"/><test-result test-name="operations_test_dll" result="fail"/><test-result test-name="fstream_test" result="fail"/><test-result test-name="convenience_test" result="fail"/><test-result test-name="large_file_support_test" result="fail"/></library>
+<library name="graph"><test-result test-name="transitive_closure_test" result="fail"/><test-result test-name="bfs" result="fail"/><test-result test-name="bellman-test" result="fail"/><test-result test-name="betweenness_centrality_test" result="fail"/><test-result test-name="dag_longest_paths" result="fail"/><test-result test-name="dfs" result="fail"/><test-result test-name="dijkstra_heap_performance" result="fail"/><test-result test-name="relaxed_heap_test" result="fail"/><test-result test-name="graph" result="fail"/><test-result test-name="graphviz_test" result="fail"/><test-result test-name="gursoy_atun_layout_test" result="fail"/><test-result test-name="layout_test" result="fail"/><test-result test-name="sequential_vertex_coloring" result="fail"/><test-result test-name="subgraph" result="fail"/><test-result test-name="isomorphism" result="fail"/><test-result test-name="adjacency_matrix_test" result="fail"/><test-result test-name="bundled_properties" result="fail"/><test-result test-name="floyd_warshall_test" result="fail"/><test-result test-name="astar_search_test" result="fail"/><test-result test-name="biconnected_components_test" result="fail"/><test-result test-name="cuthill_mckee_ordering" result="fail"/><test-result test-name="king_ordering" result="fail"/><test-result test-name="adj_list_cc" result="fail"/><test-result test-name="adj_matrix_cc" result="fail"/><test-result test-name="bfs_cc" result="fail"/><test-result test-name="dfs_cc" result="fail"/><test-result test-name="dijkstra_cc" result="fail"/><test-result test-name="edge_list_cc" result="fail"/><test-result test-name="filtered_graph_cc" result="fail"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="reverse_graph_cc" result="fail"/><test-result test-name="vector_graph_cc" result="fail"/><test-result test-name="copy" result="fail"/><test-result test-name="property_iter" result="fail"/></library>
+<library name="program_options"><test-result test-name="options_description_test" result="fail"/><test-result test-name="parsers_test" result="fail"/><test-result test-name="variable_map_test" result="fail"/><test-result test-name="cmdline_test" result="fail"/><test-result test-name="positional_options_test" result="fail"/><test-result test-name="unicode_test" result="fail"/><test-result test-name="winmain" result="fail"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="winmain_dll" result="fail"/></library>
+<library name="signals"><test-result test-name="dead_slot_test" result="fail"/><test-result test-name="deletion_test" result="fail"/><test-result test-name="ordering_test" result="fail"/><test-result test-name="signal_n_test" result="fail"/><test-result test-name="signal_test" result="fail"/><test-result test-name="trackable_test" result="fail"/></library>
+<library name="thread"><test-result test-name="test_thread" result="fail"/><test-result test-name="test_mutex" result="fail"/><test-result test-name="test_condition" result="fail"/><test-result test-name="test_tss" result="fail"/><test-result test-name="test_once" result="fail"/><test-result test-name="test_xtime" result="fail"/><test-result test-name="test_barrier" result="fail"/><test-result test-name="test_thread_lib" result="fail"/><test-result test-name="test_mutex_lib" result="fail"/><test-result test-name="test_condition_lib" result="fail"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_once_lib" result="fail"/><test-result test-name="test_xtime_lib" result="fail"/><test-result test-name="test_barrier_lib" result="fail"/></library>
+<library name="wave"><test-result test-name="testwave" result="fail"/><test-result test-name="test_slex_lexer" result="fail"/><test-result test-name="test_re2c_lexer" result="fail"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="algorithm/minmax"><test-result test-name="minmax_element" result="fail"/><test-result test-name="minmax" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="trim" result="success"/><test-result test-name="conv" result="fail"/><test-result test-name="predicate" result="success"/><test-result test-name="find" result="success"/><test-result test-name="split" result="fail"/><test-result test-name="replace" result="success"/><test-result test-name="regex" result="fail"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="std" result="success"/><test-result test-name="list_of" result="fail"/><test-result test-name="ptr_list_of" result="fail"/><test-result test-name="static_list_of" result="success"/><test-result test-name="tuple_list_of" result="success"/><test-result test-name="list_inserter" result="fail"/><test-result test-name="ptr_list_inserter" result="fail"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="email_example" result="fail"/><test-result test-name="my_vector_example" result="fail"/><test-result test-name="multi_index_container" result="fail"/></library>
+<library name="bind"><test-result test-name="bind_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_function_test" result="fail"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/></library>
+<library name="conversion"><test-result test-name="implicit_cast" result="success"/><test-result test-name="cast_test" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="implicit_cast_fail" result="success"/></library>
+<library name="concept_check"><test-result test-name="stl_concept_covering" result="fail"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="class_concept_check_test" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="fail"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+<library name="function"><test-result test-name="lib_function_test" result="fail"/><test-result test-name="function_n_test" result="fail"/><test-result test-name="allocator_test" result="fail"/><test-result test-name="stateless_test" result="fail"/><test-result test-name="lambda_test" result="success"/><test-result test-name="function_arith_cxx98" result="fail"/><test-result test-name="function_arith_portable" result="fail"/><test-result test-name="sum_avg_cxx98" result="fail"/><test-result test-name="sum_avg_portable" result="fail"/><test-result test-name="mem_fun_cxx98" result="fail"/><test-result test-name="mem_fun_portable" result="fail"/><test-result test-name="std_bind_cxx98" result="fail"/><test-result test-name="std_bind_portable" result="fail"/><test-result test-name="function_ref_cxx98" result="fail"/><test-result test-name="function_ref_portable" result="fail"/><test-result test-name="contains_test" result="fail"/><test-result test-name="contains2_test" result="fail"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="function_30" result="fail"/></library>
+<library name="functional/hash"><test-result test-name="hash_number_test" result="fail"/><test-result test-name="hash_pointer_test" result="fail"/><test-result test-name="hash_function_pointer_test" result="fail"/><test-result test-name="hash_float_test" result="fail"/><test-result test-name="hash_string_test" result="fail"/><test-result test-name="hash_range_test" result="fail"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_unit_test" result="success"/><test-result test-name="ios_state_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="fail"/><test-result test-name="auto_close_test" result="fail"/><test-result test-name="buffer_size_test" result="fail"/><test-result test-name="code_converter_test" result="fail"/><test-result test-name="component_access_test" result="fail"/><test-result test-name="compose_test" result="fail"/><test-result test-name="copy_test" result="fail"/><test-result test-name="counter_test" result="fail"/><test-result test-name="direct_adapter_test" result="fail"/><test-result test-name="example_test" result="fail"/><test-result test-name="file_test" result="fail"/><test-result test-name="file_descriptor_test" result="fail"/><test-result test-name="filtering_stream_test" result="fail"/><test-result test-name="finite_state_filter_test" result="fail"/><test-result test-name="flush_test" result="fail"/><test-result test-name="invert_test" result="fail"/><test-result test-name="line_filter_test" result="fail"/><test-result test-name="mapped_file_test" result="fail"/><test-result test-name="newline_test" result="fail"/><test-result test-name="null_test" result="fail"/><test-result test-name="pipeline_test" result="fail"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="fail"/><test-result test-name="restrict_test" result="fail"/><test-result test-name="seekable_file_test" result="fail"/><test-result test-name="seekable_filter_test" result="fail"/><test-result test-name="stdio_filter_test" result="fail"/><test-result test-name="symmetric_filter_test" result="fail"/><test-result test-name="tee_test" result="fail"/><test-result test-name="wide_stream_test" result="fail"/><test-result test-name="bzip2_test" result="fail"/><test-result test-name="gzip_test" result="fail"/><test-result test-name="zlib_test" result="fail"/></library>
+<library name="iterator"><test-result test-name="is_convertible_fail" result="fail"/><test-result test-name="zip_iterator_test" result="fail"/><test-result test-name="unit_tests" result="fail"/><test-result test-name="concept_tests" result="fail"/><test-result test-name="iterator_adaptor_cc" result="fail"/><test-result test-name="iterator_adaptor_test" result="fail"/><test-result test-name="transform_iterator_test" result="fail"/><test-result test-name="indirect_iterator_test" result="fail"/><test-result test-name="filter_iterator_test" result="fail"/><test-result test-name="iterator_facade" result="fail"/><test-result test-name="reverse_iterator_test" result="fail"/><test-result test-name="counting_iterator_test" result="fail"/><test-result test-name="interoperable" result="fail"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="permutation_iterator_test" result="fail"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="fail"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="iterator_archetype_cc" result="fail"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="indirect_iter_member_types" result="fail"/></library>
+<library name="logic"><test-result test-name="tribool_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_io_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="fail"/><test-result test-name="quaternion_test" result="fail"/><test-result test-name="special_functions_test" result="fail"/><test-result test-name="quaternion_mult_incl_test" result="fail"/></library>
+<library name="mpl"><test-result test-name="for_each" result="fail"/><test-result test-name="largest_int" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="fail"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="fail"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="fail"/><test-result test-name="copy_if" result="fail"/><test-result test-name="count" result="fail"/><test-result test-name="count_if" result="fail"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="fail"/><test-result test-name="erase" result="fail"/><test-result test-name="erase_range" result="fail"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="fail"/><test-result test-name="find" result="fail"/><test-result test-name="find_if" result="fail"/><test-result test-name="fold" result="fail"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="fail"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="fail"/><test-result test-name="insert_range" result="fail"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="fail"/><test-result test-name="lambda" result="fail"/><test-result test-name="lambda_args" result="fail"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="fail"/><test-result test-name="min_max" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="fail"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="fail"/><test-result test-name="remove_if" result="fail"/><test-result test-name="replace" result="fail"/><test-result test-name="replace_if" result="fail"/><test-result test-name="reverse" result="fail"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="sort" result="fail"/><test-result test-name="stable_partition" result="fail"/><test-result test-name="transform" result="fail"/><test-result test-name="transform_view" result="fail"/><test-result test-name="unique" result="fail"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="fail"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="fail"/></library>
+<library name="multi_array"><test-result test-name="constructors" result="fail"/><test-result test-name="access" result="fail"/><test-result test-name="compare" result="fail"/><test-result test-name="iterators" result="fail"/><test-result test-name="slice" result="fail"/><test-result test-name="assign" result="fail"/><test-result test-name="assign_to_array" result="fail"/><test-result test-name="index_bases" result="fail"/><test-result test-name="storage_order" result="fail"/><test-result test-name="reshape" result="fail"/><test-result test-name="range1" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="stl_interaction" result="fail"/><test-result test-name="resize" result="fail"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="concept_checks" result="fail"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="fail"/><test-result test-name="test_capacity" result="fail"/><test-result test-name="test_comparison" result="fail"/><test-result test-name="test_composite_key" result="fail"/><test-result test-name="test_conv_iterators" result="fail"/><test-result test-name="test_copy_assignment" result="fail"/><test-result test-name="test_hash_ops" result="fail"/><test-result test-name="test_iterators" result="fail"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="fail"/><test-result test-name="test_modifiers" result="fail"/><test-result test-name="test_mpl_ops" result="fail"/><test-result test-name="test_observers" result="fail"/><test-result test-name="test_projection" result="fail"/><test-result test-name="test_range" result="fail"/><test-result test-name="test_safe_mode" result="fail"/><test-result test-name="test_serialization" result="fail"/><test-result test-name="test_set_ops" result="fail"/><test-result test-name="test_special_list_ops" result="fail"/><test-result test-name="test_special_set_ops" result="fail"/><test-result test-name="test_update" result="fail"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="udt_support_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="udt_example_0" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="det" result="fail"/><test-result test-name="fmod" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="test_float" result="success"/><test-result test-name="integer" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="test1" result="fail"/><test-result test-name="test2" result="fail"/><test-result test-name="test3" result="fail"/><test-result test-name="test4" result="fail"/><test-result test-name="test5" result="fail"/><test-result test-name="test6" result="fail"/><test-result test-name="placement_new" result="success"/><test-result test-name="concepts" result="success"/></library>
+<library name="optional"><test-result test-name="optional_test" result="fail"/><test-result test-name="optional_test_tie" result="success"/><test-result test-name="optional_test_ref" result="fail"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="fail"/><test-result test-name="sfinae" result="fail"/><test-result test-name="macros" result="fail"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="fail"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="ptr_vector" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_map" result="fail"/><test-result test-name="ptr_array" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="view_example" result="fail"/><test-result test-name="iterator_test" result="fail"/><test-result test-name="tut1" result="fail"/><test-result test-name="indirect_fun" result="fail"/></library>
+<library name="random"><test-result test-name="random_test" result="fail"/><test-result test-name="random_demo" result="fail"/></library>
+<library name="range"><test-result test-name="array" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="algorithm_example" result="success"/><test-result test-name="reversible_range" result="fail"/><test-result test-name="const_ranges" result="fail"/><test-result test-name="extension_mechanism" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="atomic_count_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_delete_fail" result="fail"/></library>
+<library name="spirit"><test-result test-name="match_tests" result="fail"/><test-result test-name="match_tests_debug" result="fail"/><test-result test-name="scanner_tests" result="fail"/><test-result test-name="scanner_tests_debug" result="fail"/><test-result test-name="primitives_tests" result="fail"/><test-result test-name="primitives_tests_debug" result="fail"/><test-result test-name="char_strings_test" result="fail"/><test-result test-name="char_strings_test_debug" result="fail"/><test-result test-name="numerics_tests" result="fail"/><test-result test-name="numerics_tests_debug" result="fail"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="negated_eps_p_test" result="fail"/><test-result test-name="negated_eps_p_test_debug" result="fail"/><test-result test-name="operators_tests" result="fail"/><test-result test-name="operators_tests_debug" result="fail"/><test-result test-name="directives_tests" result="fail"/><test-result test-name="directives_tests_debug" result="fail"/><test-result test-name="shortest_alternative_tests" result="fail"/><test-result test-name="shortest_alternative_tests_debug" result="fail"/><test-result test-name="rule_tests" result="fail"/><test-result test-name="rule_tests_debug" result="fail"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="grammar_tests" result="fail"/><test-result test-name="grammar_tests_debug" result="fail"/><test-result test-name="grammar_multi_instance_tst" result="fail"/><test-result test-name="grammar_multi_instance_tst_debug" result="fail"/><test-result test-name="subrule_tests" result="fail"/><test-result test-name="subrule_tests_debug" result="fail"/><test-result test-name="owi_mt_tests" result="fail"/><test-result test-name="grammar_mt_tests" result="fail"/><test-result test-name="parser_context_test" result="fail"/><test-result test-name="parser_context_test_debug" result="fail"/><test-result test-name="fundamental_tests" result="fail"/><test-result test-name="fundamental_tests_debug" result="fail"/><test-result test-name="parser_traits_tests" result="fail"/><test-result test-name="parser_traits_tests_debug" result="fail"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="closure_tests" result="fail"/><test-result test-name="closure_tests_debug" result="fail"/><test-result test-name="bug_000008" result="fail"/><test-result test-name="parametric_tests" result="fail"/><test-result test-name="parametric_tests_debug" result="fail"/><test-result test-name="exception_tests" result="fail"/><test-result test-name="exception_tests_debug" result="fail"/><test-result test-name="ast_calc_tests" result="fail"/><test-result test-name="ast_calc_tests_debug" result="fail"/><test-result test-name="group_match_bug" result="fail"/><test-result test-name="group_match_bug_debug" result="fail"/><test-result test-name="repeat_ast_tests" result="fail"/><test-result test-name="repeat_ast_tests_debug" result="fail"/><test-result test-name="if_tests" result="fail"/><test-result test-name="if_tests_debug" result="fail"/><test-result test-name="if_p_int_as_condition_test" result="fail"/><test-result test-name="if_p_int_as_condition_test_debug" result="fail"/><test-result test-name="for_tests" result="fail"/><test-result test-name="for_tests_debug" result="fail"/><test-result test-name="while_tests" result="fail"/><test-result test-name="while_tests_debug" result="fail"/><test-result test-name="lazy_tests" result="fail"/><test-result test-name="lazy_tests_debug" result="fail"/><test-result test-name="switch_tests_eps_default" result="fail"/><test-result test-name="switch_tests_eps_default_debug" result="fail"/><test-result test-name="switch_tests_general_def" result="fail"/><test-result test-name="switch_tests_general_def_debug" result="fail"/><test-result test-name="switch_tests_wo_default" result="fail"/><test-result test-name="switch_tests_wo_default_debug" result="fail"/><test-result test-name="switch_tests_single" result="fail"/><test-result test-name="switch_tests_single_debug" result="fail"/><test-result test-name="switch_problem" result="fail"/><test-result test-name="switch_problem_debug" result="fail"/><test-result test-name="select_p_with_rule" result="fail"/><test-result test-name="select_p_with_rule_debug" result="fail"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="confix_tests" result="fail"/><test-result test-name="confix_tests_debug" result="fail"/><test-result test-name="loops_tests" result="fail"/><test-result test-name="loops_tests_debug" result="fail"/><test-result test-name="symbols_tests" result="fail"/><test-result test-name="symbols_tests_debug" result="fail"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="fail"/><test-result test-name="escape_char_parser_tests_debug" result="fail"/><test-result test-name="distinct_tests" result="fail"/><test-result test-name="distinct_tests_debug" result="fail"/><test-result test-name="grammar_def_test" result="fail"/><test-result test-name="grammar_def_test_debug" result="fail"/><test-result test-name="scoped_lock_tests" result="fail"/><test-result test-name="scoped_lock_tests_debug" result="fail"/><test-result test-name="fixed_size_queue_tests" result="fail"/><test-result test-name="fixed_size_queue_tests_debug" result="fail"/><test-result test-name="file_iterator_tests" result="fail"/><test-result test-name="file_iterator_tests_debug" result="fail"/><test-result test-name="multi_pass_tests" result="fail"/><test-result test-name="multi_pass_tests_debug" result="fail"/><test-result test-name="sf_bug_720917" result="fail"/><test-result test-name="sf_bug_720917_debug" result="fail"/><test-result test-name="position_iterator_tests" result="fail"/><test-result test-name="position_iterator_tests_debug" result="fail"/><test-result test-name="bug_fixes" result="fail"/><test-result test-name="bug_fixes_debug" result="fail"/><test-result test-name="action_tests" result="fail"/><test-result test-name="action_tests_debug" result="fail"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="if_p_as_parser_tests" result="fail"/><test-result test-name="while_p_as_parser_tests" result="fail"/><test-result test-name="for_p_as_parser_tests" result="fail"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="multi_pass_compile_tests" result="fail"/></library>
+<library name="static_assert"><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="fail"/><test-result test-name="extent_test" result="fail"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="fail"/><test-result test-name="is_base_of_test" result="fail"/><test-result test-name="is_class_test" result="fail"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="fail"/><test-result test-name="is_empty_test" result="fail"/><test-result test-name="is_enum_test" result="fail"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_function_test" result="fail"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="fail"/><test-result test-name="is_member_obj_test" result="fail"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="fail"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="fail"/><test-result test-name="is_reference_test" result="fail"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="fail"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="fail"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="fail"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="fail"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="fail"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="fail"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="fail"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
+<library name="utility"><test-result test-name="addressof_test" result="fail"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="fail"/><test-result test-name="compressed_pair_test" result="fail"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="shared_iterator_test" result="fail"/><test-result test-name="value_init_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
+<library name="variant"><test-result test-name="variant_test1" result="fail"/><test-result test-name="variant_test2" result="fail"/><test-result test-name="variant_test3" result="fail"/><test-result test-name="variant_test4" result="fail"/><test-result test-name="variant_test5" result="fail"/><test-result test-name="variant_test6" result="fail"/><test-result test-name="variant_test7" result="fail"/><test-result test-name="variant_test8" result="fail"/><test-result test-name="recursive_variant_test" result="fail"/><test-result test-name="variant_reference_test" result="fail"/><test-result test-name="variant_comparison_test" result="fail"/><test-result test-name="variant_visit_test" result="fail"/></library>
+<library name="config"><test-result test-name="config_test" result="fail"/><test-result test-name="config_info" result="success"/><test-result test-name="abi_test" result="success"/><test-result test-name="limits_test" result="fail"/><test-result test-name="config_link_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
+<library name="crc"><test-result test-name="crc_test" result="success"/></library>
+<library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
+<library name="functional"><test-result test-name="function_test" result="success"/></library>
+<library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
+<library name="lambda"><test-result test-name="algorithm_test" result="fail"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_advanced" result="fail"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="fail"/><test-result test-name="lambda_cast_test" result="fail"/><test-result test-name="constructor_tests" result="fail"/><test-result test-name="control_structures" result="fail"/><test-result test-name="exception_test" result="fail"/><test-result test-name="extending_rt_traits" result="fail"/><test-result test-name="is_instance_of_test" result="fail"/><test-result test-name="member_pointer_test" result="fail"/><test-result test-name="operator_tests_simple" result="fail"/><test-result test-name="phoenix_control_structures" result="fail"/><test-result test-name="switch_construct" result="fail"/></library>
+<library name="pool"><test-result test-name="test_pool_alloc" result="fail"/></library>
+<library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
+<library name="tokenizer"><test-result test-name="examples" result="fail"/><test-result test-name="simple_example_1" result="fail"/><test-result test-name="simple_example_2" result="fail"/><test-result test-name="simple_example_3" result="fail"/><test-result test-name="simple_example_4" result="fail"/><test-result test-name="simple_example_5" result="fail"/></library>
+<library name="tuple"><test-result test-name="tuple_test_bench" result="success"/><test-result test-name="io_test" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="timer"><test-result test-name="timer_test" result="success"/></library>
+</toolset>
+<toolset name="mingw-3_4_2-stlport-5_0-win32-release">
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="fail"/><test-result test-name="testdate_facet_new_dll" result="fail"/><test-result test-name="testdate_input_facet" result="fail"/><test-result test-name="testdate_input_facet_dll" result="fail"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="fail"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="fail"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="fail"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="fail"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="fail"/></library>
+<library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
 <library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
-<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="fail"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/></library>
+<library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="fail"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="fail"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
 <library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
-<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
+<library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="fail"/></library>
 <library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
 <library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
-<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
-<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="fail"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="fail"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
 <library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
-<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
-<library name="python"><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="virtual_functions" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="fail"/><test-result test-name="ptr_map" result="fail"/><test-result test-name="ptr_set" result="fail"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
 <library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
-<library name="range"><test-result test-name="array_test" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="fail"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
-<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="fail"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="fail"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="fail"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="fail"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="fail"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="fail"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="fail"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="fail"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="fail"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="fail"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="fail"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="fail"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="fail"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="fail"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="fail"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="fail"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="fail"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="fail"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="fail"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="fail"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="fail"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="fail"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="fail"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_warchive" result="fail"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="fail"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="fail"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="fail"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="fail"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="fail"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="fail"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="fail"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="fail"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="fail"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="fail"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="fail"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="fail"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="fail"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="fail"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="fail"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="fail"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="fail"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="fail"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="fail"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_warchive" result="fail"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="fail"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="fail"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="fail"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="fail"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="fail"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="fail"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="fail"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="fail"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="fail"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="fail"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="fail"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="fail"/><test-result test-name="test_void_cast" result="success"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="fail"/><test-result test-name="regex_regress_dll" result="fail"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="fail"/><test-result test-name="test_array_xml_archive_dll" result="fail"/><test-result test-name="test_array_xml_warchive" result="fail"/><test-result test-name="test_array_xml_warchive_dll" result="fail"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="fail"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="fail"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="fail"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
 <library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
-<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="fail"/><test-result test-name="epsilon_tests_debug" result="fail"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
-<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
-<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
-<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
 <library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/></library>
 <library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
 <library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
-<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="fail"/><test-result test-name="array4" result="fail"/><test-result test-name="array5" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
-</toolset><toolset name="intel-win32-8_1"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="container" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
-<library name="assign"><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
-<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
+</toolset>
+<toolset name="intel-win32-9_0">
+<toolset-alias name="intel-vc71-win-9.1"/>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="fail"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="fail"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
 <library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/></library>
 <library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
 <library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
 <library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
 <library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
 <library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
 <library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
-<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="fail"/><test-result test-name="test4" result="fail"/><test-result test-name="test5" result="fail"/><test-result test-name="test6" result="fail"/></library>
+<library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
 <library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
-<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="fail"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="fail"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="fail"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="fail"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="fail"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="fail"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="fail"/></library>
-<library name="python"><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/></library>
-<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
-<library name="range"><test-result test-name="array_test" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
-<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="fail"/><test-result test-name="test_class_info_load_text_archive" result="fail"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_class_info_load_xml_archive" result="fail"/><test-result test-name="test_class_info_load_xml_warchive" result="fail"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_void_cast" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
+<library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="fail"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="fail"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="fail"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_load_dll" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
 <library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
-<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
-<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
-<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
-<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="fail"/><test-result test-name="traverse_tests_debug" result="fail"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
 <library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/></library>
 <library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
 <library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
-</toolset><toolset name="cw-9_3"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="container" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
-<library name="assign"><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
-<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
-<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="fail"/></library>
-<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/></library>
+</toolset>
+<toolset name="cw-9_4">
+<toolset-alias name="cw-9.4"/>
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet" result="fail"/><test-result test-name="testdate_input_facet_dll" result="fail"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtz_database" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
+<library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="fail"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
 <library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/></library>
 <library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
 <library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
 <library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
 <library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
 <library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
 <library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
 <library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
 <library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
 <library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
-<library name="python"><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
 <library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="success"/></library>
-<library name="range"><test-result test-name="array_test" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
-<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_xml" result="fail"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_demo_xml_save" result="fail"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="fail"/><test-result test-name="test_exported_text_archive" result="fail"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_exported_xml_archive" result="fail"/><test-result test-name="test_exported_xml_warchive" result="fail"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="fail"/><test-result test-name="test_no_rtti_text_archive" result="fail"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="fail"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_registered_binary_archive" result="fail"/><test-result test-name="test_registered_text_archive" result="fail"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_registered_xml_archive" result="fail"/><test-result test-name="test_registered_xml_warchive" result="fail"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_text_archive" result="fail"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="fail"/><test-result test-name="test_unregistered_text_archive" result="fail"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_unregistered_xml_archive" result="fail"/><test-result test-name="test_unregistered_xml_warchive" result="fail"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_void_cast" result="success"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="success"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="fail"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="fail"/><test-result test-name="test_demo_exception" result="fail"/><test-result test-name="test_demo_exception_dll" result="fail"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="success"/><test-result test-name="test_demo_shared_ptr" result="fail"/><test-result test-name="test_demo_shared_ptr_dll" result="fail"/><test-result test-name="test_demo_xml" result="fail"/><test-result test-name="test_demo_xml_dll" result="fail"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_demo_xml_load_dll" result="fail"/><test-result test-name="test_demo_xml_save" result="fail"/><test-result test-name="test_demo_xml_save_dll" result="fail"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="fail"/><test-result test-name="test_diamond_binary_archive_dll" result="fail"/><test-result test-name="test_diamond_text_archive" result="fail"/><test-result test-name="test_diamond_text_archive_dll" result="fail"/><test-result test-name="test_diamond_text_warchive" result="fail"/><test-result test-name="test_diamond_text_warchive_dll" result="fail"/><test-result test-name="test_diamond_xml_archive" result="fail"/><test-result test-name="test_diamond_xml_archive_dll" result="fail"/><test-result test-name="test_diamond_xml_warchive" result="fail"/><test-result test-name="test_diamond_xml_warchive_dll" result="fail"/><test-result test-name="test_exported_binary_archive" result="fail"/><test-result test-name="test_exported_binary_archive_dll" result="fail"/><test-result test-name="test_exported_text_archive" result="fail"/><test-result test-name="test_exported_text_archive_dll" result="fail"/><test-result test-name="test_exported_text_warchive" result="fail"/><test-result test-name="test_exported_text_warchive_dll" result="fail"/><test-result test-name="test_exported_xml_archive" result="fail"/><test-result test-name="test_exported_xml_archive_dll" result="fail"/><test-result test-name="test_exported_xml_warchive" result="fail"/><test-result test-name="test_exported_xml_warchive_dll" result="fail"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="fail"/><test-result test-name="test_mi_binary_archive_dll" result="fail"/><test-result test-name="test_mi_text_archive" result="fail"/><test-result test-name="test_mi_text_archive_dll" result="fail"/><test-result test-name="test_mi_text_warchive" result="fail"/><test-result test-name="test_mi_text_warchive_dll" result="fail"/><test-result test-name="test_mi_xml_archive" result="fail"/><test-result test-name="test_mi_xml_archive_dll" result="fail"/><test-result test-name="test_mi_xml_warchive" result="fail"/><test-result test-name="test_mi_xml_warchive_dll" result="fail"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="fail"/><test-result test-name="test_mult_archive_types_dll" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive" result="fail"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive" result="fail"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="fail"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="fail"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="fail"/><test-result test-name="test_no_rtti_binary_archive_dll" result="fail"/><test-result test-name="test_no_rtti_text_archive" result="fail"/><test-result test-name="test_no_rtti_text_archive_dll" result="fail"/><test-result test-name="test_no_rtti_text_warchive" result="fail"/><test-result test-name="test_no_rtti_text_warchive_dll" result="fail"/><test-result test-name="test_no_rtti_xml_archive" result="fail"/><test-result test-name="test_no_rtti_xml_archive_dll" result="fail"/><test-result test-name="test_no_rtti_xml_warchive" result="fail"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="fail"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="fail"/><test-result test-name="test_registered_binary_archive_dll" result="fail"/><test-result test-name="test_registered_text_archive" result="fail"/><test-result test-name="test_registered_text_archive_dll" result="fail"/><test-result test-name="test_registered_text_warchive" result="fail"/><test-result test-name="test_registered_text_warchive_dll" result="fail"/><test-result test-name="test_registered_xml_archive" result="fail"/><test-result test-name="test_registered_xml_archive_dll" result="fail"/><test-result test-name="test_registered_xml_warchive" result="fail"/><test-result test-name="test_registered_xml_warchive_dll" result="fail"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_text_archive" result="fail"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_binary_archive" result="fail"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_text_archive" result="fail"/><test-result test-name="test_shared_ptr_text_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_text_warchive" result="fail"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="fail"/><test-result test-name="test_shared_ptr_xml_archive" result="fail"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive" result="fail"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="fail"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="fail"/><test-result test-name="test_unregistered_binary_archive_dll" result="fail"/><test-result test-name="test_unregistered_text_archive" result="fail"/><test-result test-name="test_unregistered_text_archive_dll" result="fail"/><test-result test-name="test_unregistered_text_warchive" result="fail"/><test-result test-name="test_unregistered_text_warchive_dll" result="fail"/><test-result test-name="test_unregistered_xml_archive" result="fail"/><test-result test-name="test_unregistered_xml_archive_dll" result="fail"/><test-result test-name="test_unregistered_xml_warchive" result="fail"/><test-result test-name="test_unregistered_xml_warchive_dll" result="fail"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
 <library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
-<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
-<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
-<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
-<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="fail"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="fail"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="fail"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
 <library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/></library>
 <library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
 <library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
-</toolset><toolset name="intel-win32-8_0"><library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
-<library name="algorithm/string"><test-result test-name="container" result="success"/><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
-<library name="assign"><test-result test-name="array" result="success"/><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="success"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="std" result="success"/></library>
-<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
-<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/></library>
-<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtime_wstream_std_config" result="success"/><test-result test-name="testwrapping_int" result="success"/></library>
+</toolset>
+<toolset name="intel-win32-8_1">
+<library name="algorithm/minmax"><test-result test-name="minmax" result="success"/><test-result test-name="minmax_element" result="success"/></library>
+<library name="algorithm/string"><test-result test-name="conv" result="success"/><test-result test-name="find" result="success"/><test-result test-name="predicate" result="success"/><test-result test-name="regex" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="split" result="success"/><test-result test-name="trim" result="success"/></library>
+<library name="any"><test-result test-name="any_test" result="success"/><test-result test-name="any_to_ref_test" result="success"/></library>
+<library name="assign"><test-result test-name="basic" result="success"/><test-result test-name="email_example" result="success"/><test-result test-name="list_inserter" result="success"/><test-result test-name="list_of" result="fail"/><test-result test-name="list_of_workaround" result="success"/><test-result test-name="multi_index_container" result="success"/><test-result test-name="my_vector_example" result="success"/><test-result test-name="ptr_list_inserter" result="success"/><test-result test-name="ptr_list_of" result="success"/><test-result test-name="static_list_of" result="success"/><test-result test-name="std" result="success"/><test-result test-name="tuple_list_of" result="success"/></library>
+<library name="bind"><test-result test-name="bind_const_test" result="success"/><test-result test-name="bind_cv_test" result="success"/><test-result test-name="bind_dm2_test" result="success"/><test-result test-name="bind_dm_test" result="success"/><test-result test-name="bind_eq_test" result="success"/><test-result test-name="bind_function_test" result="success"/><test-result test-name="bind_lookup_problem_test" result="success"/><test-result test-name="bind_not_test" result="success"/><test-result test-name="bind_rel_test" result="success"/><test-result test-name="bind_stateful_test" result="success"/><test-result test-name="bind_test" result="success"/><test-result test-name="mem_fn_derived_test" result="success"/><test-result test-name="mem_fn_dm_test" result="success"/><test-result test-name="mem_fn_eq_test" result="success"/><test-result test-name="mem_fn_test" result="success"/><test-result test-name="mem_fn_void_test" result="success"/></library>
+<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="concept_check_test" result="success"/><test-result test-name="stl_concept_covering" result="fail"/></library>
+<library name="conversion"><test-result test-name="cast_test" result="success"/><test-result test-name="implicit_cast" result="success"/><test-result test-name="implicit_cast_fail" result="success"/><test-result test-name="lexical_cast_test" result="success"/></library>
+<library name="date_time"><test-result test-name="testclock" result="success"/><test-result test-name="testclocks" result="success"/><test-result test-name="testconstrained_value" result="success"/><test-result test-name="testcustom_time_zone" result="success"/><test-result test-name="testc_local_adjustor" result="success"/><test-result test-name="testdate" result="success"/><test-result test-name="testdate_dll" result="success"/><test-result test-name="testdate_duration" result="success"/><test-result test-name="testdate_duration_dll" result="success"/><test-result test-name="testdate_facet_new" result="success"/><test-result test-name="testdate_facet_new_dll" result="success"/><test-result test-name="testdate_input_facet" result="success"/><test-result test-name="testdate_input_facet_dll" result="success"/><test-result test-name="testdate_iterator" result="success"/><test-result test-name="testdate_iterator_dll" result="success"/><test-result test-name="testdst_rules" result="success"/><test-result test-name="testdst_transition_day_rule" result="success"/><test-result test-name="testduration" result="success"/><test-result test-name="testfacet" result="success"/><test-result test-name="testfacet_dll" result="success"/><test-result test-name="testfiletime_functions" result="success"/><test-result test-name="testformatters" result="success"/><test-result test-name="testformatters_dll" result="success"/><test-result test-name="testgenerators" result="success"/><test-result test-name="testgenerators_dll" result="success"/><test-result test-name="testgeneric_period" result="success"/><test-result test-name="testgregorian_calendar" result="success"/><test-result test-name="testgreg_cal" result="success"/><test-result test-name="testgreg_cal_dll" result="success"/><test-result test-name="testgreg_day" result="success"/><test-result test-name="testgreg_day_dll" result="success"/><test-result test-name="testgreg_durations" result="success"/><test-result test-name="testgreg_durations_dll" result="success"/><test-result test-name="testgreg_duration_operators" result="success"/><test-result test-name="testgreg_month" result="success"/><test-result test-name="testgreg_month_dll" result="success"/><test-result test-name="testgreg_serialize" result="success"/><test-result test-name="testgreg_serialize_xml" result="success"/><test-result test-name="testgreg_wstream" result="success"/><test-result test-name="testgreg_year" result="success"/><test-result test-name="testgreg_year_dll" result="success"/><test-result test-name="testint_adapter" result="success"/><test-result test-name="testiterator" result="success"/><test-result test-name="testlocal_adjustor" result="success"/><test-result test-name="testlocal_time" result="success"/><test-result test-name="testlocal_time_facet" result="success"/><test-result test-name="testlocal_time_input_facet" result="success"/><test-result test-name="testmicrosec_time_clock" result="success"/><test-result test-name="testparse_date" result="success"/><test-result test-name="testparse_time" result="success"/><test-result test-name="testperiod" result="success"/><test-result test-name="testperiod_dll" result="success"/><test-result test-name="testposix_time_zone" result="success"/><test-result test-name="teststreams" result="success"/><test-result test-name="testtime" result="success"/><test-result test-name="testtime_facet" result="success"/><test-result test-name="testtime_formatters" result="success"/><test-result test-name="testtime_input_facet" result="success"/><test-result test-name="testtime_period" result="success"/><test-result test-name="testtime_resolution_traits" result="success"/><test-result test-name="testtime_serialize" result="success"/><test-result test-name="testtime_serialize_std_config" result="success"/><test-result test-name="testtime_serialize_xml" result="success"/><test-result test-name="testtime_serialize_xml_std_config" result="success"/><test-result test-name="testtime_wstream" result="success"/><test-result test-name="testtz_database" result="fail"/><test-result test-name="testwrapping_int" result="success"/></library>
 <library name="dynamic_bitset"><test-result test-name="dyn_bitset_unit_tests1" result="success"/><test-result test-name="dyn_bitset_unit_tests2" result="success"/><test-result test-name="dyn_bitset_unit_tests3" result="success"/><test-result test-name="dyn_bitset_unit_tests4" result="success"/></library>
-<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="path_test" result="success"/></library>
+<library name="filesystem"><test-result test-name="convenience_test" result="success"/><test-result test-name="default_name_check_test" result="success"/><test-result test-name="fstream_test" result="success"/><test-result test-name="large_file_support_test" result="success"/><test-result test-name="operations_test" result="success"/><test-result test-name="operations_test_dll" result="success"/><test-result test-name="path_test" result="success"/><test-result test-name="path_test_dll" result="success"/></library>
 <library name="format"><test-result test-name="format_test1" result="success"/><test-result test-name="format_test2" result="success"/><test-result test-name="format_test3" result="success"/><test-result test-name="format_test_wstring" result="success"/></library>
-<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
-<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
-<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="success"/></library>
+<library name="function"><test-result test-name="allocator_test" result="success"/><test-result test-name="contains2_test" result="success"/><test-result test-name="contains_test" result="success"/><test-result test-name="function_30" result="success"/><test-result test-name="function_arith_cxx98" result="success"/><test-result test-name="function_arith_portable" result="success"/><test-result test-name="function_n_test" result="success"/><test-result test-name="function_ref_cxx98" result="success"/><test-result test-name="function_ref_portable" result="success"/><test-result test-name="function_test_fail1" result="success"/><test-result test-name="function_test_fail2" result="success"/><test-result test-name="lambda_test" result="success"/><test-result test-name="lib_function_test" result="success"/><test-result test-name="mem_fun_cxx98" result="success"/><test-result test-name="mem_fun_portable" result="success"/><test-result test-name="stateless_test" result="success"/><test-result test-name="std_bind_cxx98" result="success"/><test-result test-name="std_bind_portable" result="success"/><test-result test-name="sum_avg_cxx98" result="success"/><test-result test-name="sum_avg_portable" result="success"/></library>
+<library name="functional/hash"><test-result test-name="hash_built_in_array_test" result="success"/><test-result test-name="hash_custom_test" result="success"/><test-result test-name="hash_deque_test" result="success"/><test-result test-name="hash_float_test" result="success"/><test-result test-name="hash_function_pointer_test" result="success"/><test-result test-name="hash_list_test" result="success"/><test-result test-name="hash_map_test" result="success"/><test-result test-name="hash_number_test" result="success"/><test-result test-name="hash_pointer_test" result="success"/><test-result test-name="hash_range_test" result="success"/><test-result test-name="hash_set_test" result="success"/><test-result test-name="hash_string_test" result="success"/><test-result test-name="hash_value_array_test" result="success"/><test-result test-name="hash_vector_test" result="success"/><test-result test-name="link_test" result="success"/></library>
+<library name="graph"><test-result test-name="adjacency_matrix_test" result="success"/><test-result test-name="adj_list_cc" result="success"/><test-result test-name="adj_matrix_cc" result="success"/><test-result test-name="astar_search_test" result="success"/><test-result test-name="bellman-test" result="success"/><test-result test-name="betweenness_centrality_test" result="success"/><test-result test-name="bfs" result="success"/><test-result test-name="bfs_cc" result="success"/><test-result test-name="biconnected_components_test" result="success"/><test-result test-name="bundled_properties" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="cuthill_mckee_ordering" result="success"/><test-result test-name="dag_longest_paths" result="success"/><test-result test-name="dfs" result="success"/><test-result test-name="dfs_cc" result="success"/><test-result test-name="dijkstra_cc" result="success"/><test-result test-name="dijkstra_heap_performance" result="success"/><test-result test-name="edge_list_cc" result="success"/><test-result test-name="filtered_graph_cc" result="success"/><test-result test-name="floyd_warshall_test" result="success"/><test-result test-name="graph" result="success"/><test-result test-name="graphviz_test" result="success"/><test-result test-name="graph_concepts" result="success"/><test-result test-name="gursoy_atun_layout_test" result="success"/><test-result test-name="isomorphism" result="success"/><test-result test-name="king_ordering" result="success"/><test-result test-name="layout_test" result="success"/><test-result test-name="property_iter" result="success"/><test-result test-name="relaxed_heap_test" result="success"/><test-result test-name="reverse_graph_cc" result="success"/><test-result test-name="sequential_vertex_coloring" result="success"/><test-result test-name="subgraph" result="success"/><test-result test-name="transitive_closure_test" result="success"/><test-result test-name="vector_graph_cc" result="success"/></library>
+<library name="io"><test-result test-name="ios_state_test" result="success"/><test-result test-name="ios_state_unit_test" result="fail"/></library>
+<library name="iostreams"><test-result test-name="array_test" result="success"/><test-result test-name="auto_close_test" result="success"/><test-result test-name="buffer_size_test" result="success"/><test-result test-name="code_converter_test" result="success"/><test-result test-name="component_access_test" result="success"/><test-result test-name="compose_test" result="success"/><test-result test-name="copy_test" result="success"/><test-result test-name="counter_test" result="success"/><test-result test-name="direct_adapter_test" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="file_descriptor_test" result="success"/><test-result test-name="file_test" result="success"/><test-result test-name="filtering_stream_test" result="success"/><test-result test-name="finite_state_filter_test" result="success"/><test-result test-name="flush_test" result="success"/><test-result test-name="invert_test" result="success"/><test-result test-name="line_filter_test" result="success"/><test-result test-name="mapped_file_test" result="success"/><test-result test-name="newline_test" result="success"/><test-result test-name="null_test" result="success"/><test-result test-name="pipeline_test" result="success"/><test-result test-name="positioning_test" result="success"/><test-result test-name="regex_filter_test" result="success"/><test-result test-name="restrict_test" result="success"/><test-result test-name="seekable_file_test" result="success"/><test-result test-name="seekable_filter_test" result="success"/><test-result test-name="stdio_filter_test" result="success"/><test-result test-name="symmetric_filter_test" result="success"/><test-result test-name="tee_test" result="success"/><test-result test-name="wide_stream_test" result="success"/></library>
 <library name="iterator"><test-result test-name="concept_tests" result="success"/><test-result test-name="counting_iterator_test" result="success"/><test-result test-name="filter_iterator_test" result="success"/><test-result test-name="indirect_iterator_test" result="success"/><test-result test-name="indirect_iter_member_types" result="success"/><test-result test-name="interoperable" result="success"/><test-result test-name="interoperable_fail" result="success"/><test-result test-name="is_convertible_fail" result="success"/><test-result test-name="is_lvalue_iterator" result="success"/><test-result test-name="is_readable_iterator" result="success"/><test-result test-name="iterator_adaptor_cc" result="success"/><test-result test-name="iterator_adaptor_test" result="success"/><test-result test-name="iterator_archetype_cc" result="success"/><test-result test-name="iterator_facade" result="success"/><test-result test-name="iterator_traits_test" result="success"/><test-result test-name="iter_archetype_default_ctor" result="success"/><test-result test-name="lvalue_concept_fail" result="success"/><test-result test-name="permutation_iterator_test" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="reverse_iterator_test" result="success"/><test-result test-name="transform_iterator_test" result="success"/><test-result test-name="unit_tests" result="success"/><test-result test-name="zip_iterator_test" result="success"/></library>
 <library name="logic"><test-result test-name="tribool_io_test" result="success"/><test-result test-name="tribool_rename_test" result="success"/><test-result test-name="tribool_test" result="success"/></library>
 <library name="math"><test-result test-name="common_factor_test" result="success"/><test-result test-name="octonion_test" result="success"/><test-result test-name="quaternion_mult_incl_test" result="success"/><test-result test-name="quaternion_test" result="success"/><test-result test-name="special_functions_test" result="success"/></library>
 <library name="mpl"><test-result test-name="advance" result="success"/><test-result test-name="always" result="success"/><test-result test-name="apply" result="success"/><test-result test-name="apply_wrap" result="success"/><test-result test-name="arithmetic" result="success"/><test-result test-name="assert" result="success"/><test-result test-name="as_sequence" result="success"/><test-result test-name="at" result="success"/><test-result test-name="back" result="success"/><test-result test-name="bind" result="success"/><test-result test-name="bitwise" result="success"/><test-result test-name="bool" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="contains" result="success"/><test-result test-name="copy" result="success"/><test-result test-name="copy_if" result="success"/><test-result test-name="count" result="success"/><test-result test-name="count_if" result="success"/><test-result test-name="deque" result="success"/><test-result test-name="distance" result="success"/><test-result test-name="empty" result="success"/><test-result test-name="equal" result="success"/><test-result test-name="erase" result="success"/><test-result test-name="erase_range" result="success"/><test-result test-name="eval_if" result="success"/><test-result test-name="filter_view" result="success"/><test-result test-name="find" result="success"/><test-result test-name="find_if" result="success"/><test-result test-name="fold" result="success"/><test-result test-name="for_each" result="success"/><test-result test-name="front" result="success"/><test-result test-name="has_xxx" result="success"/><test-result test-name="identity" result="success"/><test-result test-name="if" result="success"/><test-result test-name="index_of" result="success"/><test-result test-name="inherit" result="success"/><test-result test-name="insert" result="success"/><test-result test-name="insert_range" result="success"/><test-result test-name="int" result="success"/><test-result test-name="integral_c" result="success"/><test-result test-name="is_placeholder" result="success"/><test-result test-name="is_sequence" result="success"/><test-result test-name="iterator_tags" result="success"/><test-result test-name="joint_view" result="success"/><test-result test-name="lambda" result="success"/><test-result test-name="lambda_args" result="success"/><test-result test-name="largest_int" result="success"/><test-result test-name="list" result="success"/><test-result test-name="list_c" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="lower_bound" result="success"/><test-result test-name="map" result="success"/><test-result test-name="max_element" result="success"/><test-result test-name="min_max" result="success"/><test-result test-name="msvc_is_class" result="success"/><test-result test-name="multiset" result="success"/><test-result test-name="next" result="success"/><test-result test-name="no_has_xxx" result="success"/><test-result test-name="numeric_ops" result="success"/><test-result test-name="pair_view" result="success"/><test-result test-name="partition" result="success"/><test-result test-name="pop_front" result="success"/><test-result test-name="push_front" result="success"/><test-result test-name="quote" result="success"/><test-result test-name="range_c" result="success"/><test-result test-name="remove" result="success"/><test-result test-name="remove_if" result="success"/><test-result test-name="replace" result="success"/><test-result test-name="replace_if" result="success"/><test-result test-name="reverse" result="success"/><test-result test-name="same_as" result="success"/><test-result test-name="set" result="success"/><test-result test-name="set_c" result="success"/><test-result test-name="single_view" result="success"/><test-result test-name="size" result="success"/><test-result test-name="sizeof" result="success"/><test-result test-name="size_t" result="success"/><test-result test-name="sort" result="success"/><test-result test-name="stable_partition" result="success"/><test-result test-name="template_arity" result="success"/><test-result test-name="transform" result="success"/><test-result test-name="transform_view" result="success"/><test-result test-name="unique" result="success"/><test-result test-name="unpack_args" result="success"/><test-result test-name="upper_bound" result="success"/><test-result test-name="vector" result="success"/><test-result test-name="vector_c" result="success"/><test-result test-name="zip_view" result="success"/></library>
 <library name="multi_array"><test-result test-name="access" result="success"/><test-result test-name="assign" result="success"/><test-result test-name="assign_to_array" result="success"/><test-result test-name="compare" result="success"/><test-result test-name="concept_checks" result="success"/><test-result test-name="constructors" result="success"/><test-result test-name="fail_cbracket" result="success"/><test-result test-name="fail_cdata" result="success"/><test-result test-name="fail_citerator" result="success"/><test-result test-name="fail_cparen" result="success"/><test-result test-name="fail_criterator" result="success"/><test-result test-name="fail_csubarray" result="success"/><test-result test-name="fail_csubarray2" result="success"/><test-result test-name="fail_csubarray3" result="success"/><test-result test-name="fail_cview" result="success"/><test-result test-name="fail_cview2" result="success"/><test-result test-name="fail_cview3" result="success"/><test-result test-name="fail_ref_cbracket" result="success"/><test-result test-name="fail_ref_cdata" result="success"/><test-result test-name="fail_ref_citerator" result="success"/><test-result test-name="fail_ref_cparen" result="success"/><test-result test-name="fail_ref_criterator" result="success"/><test-result test-name="fail_ref_csubarray" result="success"/><test-result test-name="fail_ref_csubarray2" result="success"/><test-result test-name="fail_ref_csubarray3" result="success"/><test-result test-name="fail_ref_cview" result="success"/><test-result test-name="fail_ref_cview2" result="success"/><test-result test-name="fail_ref_cview3" result="success"/><test-result test-name="idxgen1" result="success"/><test-result test-name="index_bases" result="success"/><test-result test-name="iterators" result="success"/><test-result test-name="range1" result="success"/><test-result test-name="reshape" result="success"/><test-result test-name="resize" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="stl_interaction" result="success"/><test-result test-name="storage_order" result="success"/></library>
-<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
-<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
+<library name="multi_index"><test-result test-name="test_basic" result="success"/><test-result test-name="test_capacity" result="success"/><test-result test-name="test_comparison" result="success"/><test-result test-name="test_composite_key" result="success"/><test-result test-name="test_conv_iterators" result="success"/><test-result test-name="test_copy_assignment" result="success"/><test-result test-name="test_hash_ops" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_key_extractors" result="success"/><test-result test-name="test_list_ops" result="success"/><test-result test-name="test_modifiers" result="success"/><test-result test-name="test_mpl_ops" result="success"/><test-result test-name="test_observers" result="success"/><test-result test-name="test_projection" result="success"/><test-result test-name="test_range" result="success"/><test-result test-name="test_safe_mode" result="success"/><test-result test-name="test_serialization" result="success"/><test-result test-name="test_set_ops" result="success"/><test-result test-name="test_special_list_ops" result="success"/><test-result test-name="test_special_set_ops" result="success"/><test-result test-name="test_update" result="success"/></library>
+<library name="numeric/conversion"><test-result test-name="bounds_test" result="success"/><test-result test-name="converter_test" result="success"/><test-result test-name="numeric_cast_test" result="success"/><test-result test-name="traits_test" result="success"/><test-result test-name="udt_example_0" result="success"/><test-result test-name="udt_support_test" result="success"/></library>
 <library name="numeric/interval"><test-result test-name="add" result="success"/><test-result test-name="cmp" result="success"/><test-result test-name="cmp_exn" result="success"/><test-result test-name="cmp_exp" result="success"/><test-result test-name="cmp_lex" result="success"/><test-result test-name="cmp_set" result="success"/><test-result test-name="cmp_tribool" result="success"/><test-result test-name="det" result="success"/><test-result test-name="fmod" result="success"/><test-result test-name="integer" result="success"/><test-result test-name="mul" result="success"/><test-result test-name="overflow" result="success"/><test-result test-name="pi" result="success"/><test-result test-name="pow" result="success"/><test-result test-name="test_float" result="success"/></library>
 <library name="numeric/ublas"><test-result test-name="concepts" result="success"/><test-result test-name="placement_new" result="success"/><test-result test-name="test1" result="success"/><test-result test-name="test2" result="success"/><test-result test-name="test3" result="success"/><test-result test-name="test4" result="success"/><test-result test-name="test5" result="success"/><test-result test-name="test6" result="success"/></library>
 <library name="optional"><test-result test-name="optional_test" result="success"/><test-result test-name="optional_test_fail1" result="success"/><test-result test-name="optional_test_fail2" result="success"/><test-result test-name="optional_test_fail3a" result="success"/><test-result test-name="optional_test_fail3b" result="success"/><test-result test-name="optional_test_inplace" result="success"/><test-result test-name="optional_test_inplace_fail" result="success"/><test-result test-name="optional_test_inplace_fail2" result="success"/><test-result test-name="optional_test_ref" result="success"/><test-result test-name="optional_test_ref_fail1" result="success"/><test-result test-name="optional_test_ref_fail2" result="success"/><test-result test-name="optional_test_ref_fail3" result="success"/><test-result test-name="optional_test_ref_fail4" result="success"/><test-result test-name="optional_test_tie" result="success"/></library>
+<library name="parameter"><test-result test-name="basics" result="success"/><test-result test-name="macros" result="success"/><test-result test-name="sfinae" result="success"/><test-result test-name="tutorial" result="success"/><test-result test-name="unwrap_cv_reference" result="success"/></library>
 <library name="program_options"><test-result test-name="cmdline_test" result="success"/><test-result test-name="cmdline_test_dll" result="success"/><test-result test-name="options_description_test" result="success"/><test-result test-name="options_description_test_dll" result="success"/><test-result test-name="parsers_test" result="success"/><test-result test-name="parsers_test_dll" result="success"/><test-result test-name="positional_options_test" result="success"/><test-result test-name="positional_options_test_dll" result="success"/><test-result test-name="unicode_test" result="success"/><test-result test-name="unicode_test_dll" result="success"/><test-result test-name="variable_map_test" result="success"/><test-result test-name="variable_map_test_dll" result="success"/><test-result test-name="winmain" result="success"/><test-result test-name="winmain_dll" result="success"/></library>
-<library name="python"><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/></library>
-<library name="random"><test-result test-name="random_demo" result="fail"/><test-result test-name="random_test" result="fail"/></library>
-<library name="range"><test-result test-name="array_test" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="example_test" result="success"/><test-result test-name="iterator_pair_test" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="reversible_range_test" result="success"/><test-result test-name="std_container_test" result="success"/><test-result test-name="string_test" result="success"/><test-result test-name="sub_range" result="success"/><test-result test-name="workaround_test" result="success"/></library>
-<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="jgrep" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="regex_wide_regress" result="success"/><test-result test-name="regex_wide_regress_dll" result="success"/><test-result test-name="wide_concept_check" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
-<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="fail"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_load" result="success"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_void_cast" result="success"/></library>
+<library name="property_map"><test-result test-name="dynamic_properties_test" result="success"/><test-result test-name="property_map_cc" result="success"/></library>
+<library name="ptr_container"><test-result test-name="incomplete_type_test" result="success"/><test-result test-name="indirect_fun" result="success"/><test-result test-name="iterator_test" result="success"/><test-result test-name="ptr_array" result="success"/><test-result test-name="ptr_deque" result="success"/><test-result test-name="ptr_list" result="success"/><test-result test-name="ptr_map" result="success"/><test-result test-name="ptr_set" result="success"/><test-result test-name="ptr_vector" result="success"/><test-result test-name="tree_test" result="success"/><test-result test-name="tut1" result="success"/><test-result test-name="view_example" result="success"/></library>
+<library name="python"><test-result test-name="andreas_beyer" result="success"/><test-result test-name="args" result="success"/><test-result test-name="as_to_python_function" result="success"/><test-result test-name="auto_ptr" result="success"/><test-result test-name="back_reference" result="success"/><test-result test-name="bases" result="success"/><test-result test-name="ben_scott1" result="success"/><test-result test-name="bienstman1" result="success"/><test-result test-name="bienstman2" result="success"/><test-result test-name="bienstman3" result="success"/><test-result test-name="borrowed" result="success"/><test-result test-name="builtin_converters" result="success"/><test-result test-name="callbacks" result="success"/><test-result test-name="const_argument" result="success"/><test-result test-name="copy_ctor_mutates_rhs" result="success"/><test-result test-name="crossmod_exception" result="success"/><test-result test-name="data_members" result="success"/><test-result test-name="defaults" result="success"/><test-result test-name="destroy_test" result="success"/><test-result test-name="dict" result="success"/><test-result test-name="docstring" result="success"/><test-result test-name="embedding" result="success"/><test-result test-name="enum" result="success"/><test-result test-name="exception_translator" result="success"/><test-result test-name="extract" result="success"/><test-result test-name="if_else" result="success"/><test-result test-name="implicit" result="success"/><test-result test-name="indirect_traits_test" result="success"/><test-result test-name="injected" result="success"/><test-result test-name="iterator" result="success"/><test-result test-name="keywords" result="success"/><test-result test-name="list" result="success"/><test-result test-name="long" result="success"/><test-result test-name="map_indexing_suite" result="success"/><test-result test-name="minimal" result="success"/><test-result test-name="multi_arg_constructor" result="success"/><test-result test-name="nested" result="success"/><test-result test-name="numpy" result="success"/><test-result test-name="object" result="success"/><test-result test-name="object_fail1" result="success"/><test-result test-name="object_manager" result="success"/><test-result test-name="opaque" result="success"/><test-result test-name="operators" result="success"/><test-result test-name="pearu1" result="success"/><test-result test-name="pickle1" result="success"/><test-result test-name="pickle2" result="success"/><test-result test-name="pickle3" result="success"/><test-result test-name="pickle4" result="success"/><test-result test-name="pointee" result="success"/><test-result test-name="pointer_type_id_test" result="success"/><test-result test-name="pointer_vector" result="success"/><test-result test-name="polymorphism" result="success"/><test-result test-name="polymorphism2" result="success"/><test-result test-name="polymorphism2_auto_ptr" result="success"/><test-result test-name="properties" result="success"/><test-result test-name="raw_ctor" result="success"/><test-result test-name="raw_pyobject_fail1" result="success"/><test-result test-name="raw_pyobject_fail2" result="success"/><test-result test-name="result" result="success"/><test-result test-name="return_arg" result="success"/><test-result test-name="select_arg_to_python_test" result="success"/><test-result test-name="select_from_python_test" result="success"/><test-result test-name="select_holder" result="success"/><test-result test-name="shared_ptr" result="success"/><test-result test-name="slice" result="success"/><test-result test-name="staticmethod" result="success"/><test-result test-name="str" result="success"/><test-result test-name="string_literal" result="success"/><test-result test-name="test_pointer_adoption" result="success"/><test-result test-name="try" result="success"/><test-result test-name="tuple" result="success"/><test-result test-name="upcast" result="success"/><test-result test-name="vector_indexing_suite" result="success"/><test-result test-name="virtual_functions" result="success"/><test-result test-name="wrapper_held_type" result="success"/></library>
+<library name="random"><test-result test-name="random_demo" result="success"/><test-result test-name="random_test" result="fail"/></library>
+<library name="range"><test-result test-name="algorithm_example" result="success"/><test-result test-name="array" result="success"/><test-result test-name="const_ranges" result="success"/><test-result test-name="extension_mechanism" result="success"/><test-result test-name="iterator_pair" result="success"/><test-result test-name="iterator_range" result="success"/><test-result test-name="partial_workaround" result="fail"/><test-result test-name="reversible_range" result="success"/><test-result test-name="std_container" result="success"/><test-result test-name="string" result="success"/><test-result test-name="sub_range" result="success"/></library>
+<library name="regex"><test-result test-name="captures_example" result="success"/><test-result test-name="credit_card_example" result="success"/><test-result test-name="grep" result="success"/><test-result test-name="icu_example" result="success"/><test-result test-name="mfc_example" result="success"/><test-result test-name="partial_regex_grep" result="success"/><test-result test-name="partial_regex_match" result="success"/><test-result test-name="regex_grep_example_1" result="success"/><test-result test-name="regex_grep_example_2" result="success"/><test-result test-name="regex_grep_example_3" result="success"/><test-result test-name="regex_grep_example_4" result="success"/><test-result test-name="regex_iterator_example" result="success"/><test-result test-name="regex_match_example" result="success"/><test-result test-name="regex_merge_example" result="success"/><test-result test-name="regex_replace_example" result="success"/><test-result test-name="regex_search_example" result="success"/><test-result test-name="regex_split_example_1" result="success"/><test-result test-name="regex_split_example_2" result="success"/><test-result test-name="regex_timer" result="success"/><test-result test-name="regex_token_iterator_eg_1" result="success"/><test-result test-name="regex_token_iterator_eg_2" result="success"/><test-result test-name="bad_expression_test" result="success"/><test-result test-name="captures_test" result="success"/><test-result test-name="collate_info" result="success"/><test-result test-name="concept_check" result="success"/><test-result test-name="icu_concept_check" result="success"/><test-result test-name="object_cache_test" result="success"/><test-result test-name="posix_api_check" result="success"/><test-result test-name="posix_api_check_cpp" result="success"/><test-result test-name="recursion_test" result="success"/><test-result test-name="regex_config_info" result="success"/><test-result test-name="regex_dll_config_info" result="success"/><test-result test-name="regex_regress" result="success"/><test-result test-name="regex_regress_dll" result="success"/><test-result test-name="static_mutex_test" result="success"/><test-result test-name="unicode_iterator_test" result="success"/><test-result test-name="wide_posix_api_check_c" result="success"/><test-result test-name="wide_posix_api_check_cpp" result="success"/></library>
+<library name="serialization"><test-result test-name="test_array_binary_archive" result="success"/><test-result test-name="test_array_binary_archive_dll" result="success"/><test-result test-name="test_array_text_archive" result="success"/><test-result test-name="test_array_text_archive_dll" result="success"/><test-result test-name="test_array_text_warchive" result="success"/><test-result test-name="test_array_text_warchive_dll" result="success"/><test-result test-name="test_array_xml_archive" result="success"/><test-result test-name="test_array_xml_archive_dll" result="success"/><test-result test-name="test_array_xml_warchive" result="success"/><test-result test-name="test_array_xml_warchive_dll" result="success"/><test-result test-name="test_binary_binary_archive" result="success"/><test-result test-name="test_binary_binary_archive_dll" result="success"/><test-result test-name="test_binary_text_archive" result="success"/><test-result test-name="test_binary_text_archive_dll" result="success"/><test-result test-name="test_binary_text_warchive" result="success"/><test-result test-name="test_binary_text_warchive_dll" result="success"/><test-result test-name="test_binary_xml_archive" result="success"/><test-result test-name="test_binary_xml_archive_dll" result="success"/><test-result test-name="test_binary_xml_warchive" result="success"/><test-result test-name="test_binary_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_load_binary_archive" result="success"/><test-result test-name="test_class_info_load_binary_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_archive" result="success"/><test-result test-name="test_class_info_load_text_archive_dll" result="success"/><test-result test-name="test_class_info_load_text_warchive" result="success"/><test-result test-name="test_class_info_load_text_warchive_dll" result="success"/><test-result test-name="test_class_info_load_xml_archive" result="success"/><test-result test-name="test_class_info_load_xml_archive_dll" result="success"/><test-result test-name="test_class_info_load_xml_warchive" result="success"/><test-result test-name="test_class_info_load_xml_warchive_dll" result="success"/><test-result test-name="test_class_info_save_binary_archive" result="success"/><test-result test-name="test_class_info_save_binary_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_archive" result="success"/><test-result test-name="test_class_info_save_text_archive_dll" result="success"/><test-result test-name="test_class_info_save_text_warchive" result="success"/><test-result test-name="test_class_info_save_text_warchive_dll" result="success"/><test-result test-name="test_class_info_save_xml_archive" result="success"/><test-result test-name="test_class_info_save_xml_archive_dll" result="success"/><test-result test-name="test_class_info_save_xml_warchive" result="success"/><test-result test-name="test_class_info_save_xml_warchive_dll" result="success"/><test-result test-name="test_codecvt_null" result="success"/><test-result test-name="test_const_load_fail1" result="success"/><test-result test-name="test_const_load_fail1_nvp" result="success"/><test-result test-name="test_const_load_fail2" result="success"/><test-result test-name="test_const_load_fail2_nvp" result="success"/><test-result test-name="test_const_load_fail3" result="success"/><test-result test-name="test_const_load_fail3_nvp" result="success"/><test-result test-name="test_const_pass" result="success"/><test-result test-name="test_const_save_fail1" result="success"/><test-result test-name="test_const_save_fail2" result="success"/><test-result test-name="test_const_save_fail3" result="success"/><test-result test-name="test_contained_class_binary_archive" result="success"/><test-result test-name="test_contained_class_binary_archive_dll" result="success"/><test-result test-name="test_contained_class_text_archive" result="success"/><test-result test-name="test_contained_class_text_archive_dll" result="success"/><test-result test-name="test_contained_class_text_warchive" result="success"/><test-result test-name="test_contained_class_text_warchive_dll" result="success"/><test-result test-name="test_contained_class_xml_archive" result="success"/><test-result test-name="test_contained_class_xml_archive_dll" result="success"/><test-result test-name="test_contained_class_xml_warchive" result="success"/><test-result test-name="test_contained_class_xml_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive" result="success"/><test-result test-name="test_cyclic_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive" result="success"/><test-result test-name="test_cyclic_ptrs_text_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive" result="success"/><test-result test-name="test_cyclic_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_binary_archive" result="success"/><test-result test-name="test_delete_pointer_binary_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_archive" result="success"/><test-result test-name="test_delete_pointer_text_archive_dll" result="success"/><test-result test-name="test_delete_pointer_text_warchive" result="success"/><test-result test-name="test_delete_pointer_text_warchive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_archive" result="success"/><test-result test-name="test_delete_pointer_xml_archive_dll" result="success"/><test-result test-name="test_delete_pointer_xml_warchive" result="success"/><test-result test-name="test_delete_pointer_xml_warchive_dll" result="success"/><test-result test-name="test_demo" result="success"/><test-result test-name="test_demo_auto_ptr" result="success"/><test-result test-name="test_demo_auto_ptr_dll" result="success"/><test-result test-name="test_demo_dll" result="success"/><test-result test-name="test_demo_exception" result="success"/><test-result test-name="test_demo_exception_dll" result="success"/><test-result test-name="test_demo_fast_archive" result="success"/><test-result test-name="test_demo_fast_archive_dll" result="success"/><test-result test-name="test_demo_pimpl" result="success"/><test-result test-name="test_demo_pimpl_dll" result="success"/><test-result test-name="test_demo_polymorphic" result="success"/><test-result test-name="test_demo_polymorphic_dll" result="success"/><test-result test-name="test_demo_portable_archive" result="success"/><test-result test-name="test_demo_portable_archive_dll" result="fail"/><test-result test-name="test_demo_shared_ptr" result="success"/><test-result test-name="test_demo_shared_ptr_dll" result="success"/><test-result test-name="test_demo_xml" result="success"/><test-result test-name="test_demo_xml_dll" result="success"/><test-result test-name="test_demo_xml_load" result="fail"/><test-result test-name="test_demo_xml_load_dll" result="fail"/><test-result test-name="test_demo_xml_save" result="success"/><test-result test-name="test_demo_xml_save_dll" result="success"/><test-result test-name="test_deque_binary_archive" result="success"/><test-result test-name="test_deque_binary_archive_dll" result="success"/><test-result test-name="test_deque_text_archive" result="success"/><test-result test-name="test_deque_text_archive_dll" result="success"/><test-result test-name="test_deque_text_warchive" result="success"/><test-result test-name="test_deque_text_warchive_dll" result="success"/><test-result test-name="test_deque_xml_archive" result="success"/><test-result test-name="test_deque_xml_archive_dll" result="success"/><test-result test-name="test_deque_xml_warchive" result="success"/><test-result test-name="test_deque_xml_warchive_dll" result="success"/><test-result test-name="test_derived_binary_archive" result="success"/><test-result test-name="test_derived_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_binary_archive" result="success"/><test-result test-name="test_derived_class_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive" result="success"/><test-result test-name="test_derived_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_archive" result="success"/><test-result test-name="test_derived_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive" result="success"/><test-result test-name="test_derived_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive" result="success"/><test-result test-name="test_derived_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive" result="success"/><test-result test-name="test_derived_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_derived_class_text_archive" result="success"/><test-result test-name="test_derived_class_text_archive_dll" result="success"/><test-result test-name="test_derived_class_text_warchive" result="success"/><test-result test-name="test_derived_class_text_warchive_dll" result="success"/><test-result test-name="test_derived_class_xml_archive" result="success"/><test-result test-name="test_derived_class_xml_archive_dll" result="success"/><test-result test-name="test_derived_class_xml_warchive" result="success"/><test-result test-name="test_derived_class_xml_warchive_dll" result="success"/><test-result test-name="test_derived_text_archive" result="success"/><test-result test-name="test_derived_text_archive_dll" result="success"/><test-result test-name="test_derived_text_warchive" result="success"/><test-result test-name="test_derived_text_warchive_dll" result="success"/><test-result test-name="test_derived_xml_archive" result="success"/><test-result test-name="test_derived_xml_archive_dll" result="success"/><test-result test-name="test_derived_xml_warchive" result="success"/><test-result test-name="test_derived_xml_warchive_dll" result="success"/><test-result test-name="test_diamond_binary_archive" result="success"/><test-result test-name="test_diamond_binary_archive_dll" result="success"/><test-result test-name="test_diamond_text_archive" result="success"/><test-result test-name="test_diamond_text_archive_dll" result="success"/><test-result test-name="test_diamond_text_warchive" result="success"/><test-result test-name="test_diamond_text_warchive_dll" result="success"/><test-result test-name="test_diamond_xml_archive" result="success"/><test-result test-name="test_diamond_xml_archive_dll" result="success"/><test-result test-name="test_diamond_xml_warchive" result="success"/><test-result test-name="test_diamond_xml_warchive_dll" result="success"/><test-result test-name="test_exported_binary_archive" result="success"/><test-result test-name="test_exported_binary_archive_dll" result="success"/><test-result test-name="test_exported_text_archive" result="success"/><test-result test-name="test_exported_text_archive_dll" result="success"/><test-result test-name="test_exported_text_warchive" result="success"/><test-result test-name="test_exported_text_warchive_dll" result="success"/><test-result test-name="test_exported_xml_archive" result="success"/><test-result test-name="test_exported_xml_archive_dll" result="success"/><test-result test-name="test_exported_xml_warchive" result="success"/><test-result test-name="test_exported_xml_warchive_dll" result="success"/><test-result test-name="test_inclusion" result="success"/><test-result test-name="test_iterators" result="success"/><test-result test-name="test_iterators_base64" result="success"/><test-result test-name="test_list_binary_archive" result="success"/><test-result test-name="test_list_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_binary_archive" result="success"/><test-result test-name="test_list_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_archive" result="success"/><test-result test-name="test_list_ptrs_text_archive_dll" result="success"/><test-result test-name="test_list_ptrs_text_warchive" result="success"/><test-result test-name="test_list_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_archive" result="success"/><test-result test-name="test_list_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_list_ptrs_xml_warchive" result="success"/><test-result test-name="test_list_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_list_text_archive" result="success"/><test-result test-name="test_list_text_archive_dll" result="success"/><test-result test-name="test_list_text_warchive" result="success"/><test-result test-name="test_list_text_warchive_dll" result="success"/><test-result test-name="test_list_xml_archive" result="success"/><test-result test-name="test_list_xml_archive_dll" result="success"/><test-result test-name="test_list_xml_warchive" result="success"/><test-result test-name="test_list_xml_warchive_dll" result="success"/><test-result test-name="test_map_binary_archive" result="success"/><test-result test-name="test_map_binary_archive_dll" result="success"/><test-result test-name="test_map_text_archive" result="success"/><test-result test-name="test_map_text_archive_dll" result="success"/><test-result test-name="test_map_text_warchive" result="success"/><test-result test-name="test_map_text_warchive_dll" result="success"/><test-result test-name="test_map_xml_archive" result="success"/><test-result test-name="test_map_xml_archive_dll" result="success"/><test-result test-name="test_map_xml_warchive" result="success"/><test-result test-name="test_map_xml_warchive_dll" result="success"/><test-result test-name="test_mi_binary_archive" result="success"/><test-result test-name="test_mi_binary_archive_dll" result="success"/><test-result test-name="test_mi_text_archive" result="success"/><test-result test-name="test_mi_text_archive_dll" result="success"/><test-result test-name="test_mi_text_warchive" result="success"/><test-result test-name="test_mi_text_warchive_dll" result="success"/><test-result test-name="test_mi_xml_archive" result="success"/><test-result test-name="test_mi_xml_archive_dll" result="success"/><test-result test-name="test_mi_xml_warchive" result="success"/><test-result test-name="test_mi_xml_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive" result="success"/><test-result test-name="test_multiple_ptrs_binary_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_archive" result="success"/><test-result test-name="test_multiple_ptrs_text_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive" result="success"/><test-result test-name="test_multiple_ptrs_text_warchive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive" result="success"/><test-result test-name="test_multiple_ptrs_xml_archive_dll" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive" result="success"/><test-result test-name="test_multiple_ptrs_xml_warchive_dll" result="success"/><test-result test-name="test_mult_archive_types" result="success"/><test-result test-name="test_mult_archive_types_dll" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive" result="success"/><test-result test-name="test_non_default_ctor2_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_archive" result="success"/><test-result test-name="test_non_default_ctor2_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive" result="success"/><test-result test-name="test_non_default_ctor2_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive" result="success"/><test-result test-name="test_non_default_ctor2_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor2_xml_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_binary_archive" result="success"/><test-result test-name="test_non_default_ctor_binary_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_archive" result="success"/><test-result test-name="test_non_default_ctor_text_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_text_warchive" result="success"/><test-result test-name="test_non_default_ctor_text_warchive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_archive" result="success"/><test-result test-name="test_non_default_ctor_xml_archive_dll" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive" result="success"/><test-result test-name="test_non_default_ctor_xml_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_binary_archive" result="success"/><test-result test-name="test_non_intrusive_binary_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_archive" result="success"/><test-result test-name="test_non_intrusive_text_archive_dll" result="success"/><test-result test-name="test_non_intrusive_text_warchive" result="success"/><test-result test-name="test_non_intrusive_text_warchive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_archive" result="success"/><test-result test-name="test_non_intrusive_xml_archive_dll" result="success"/><test-result test-name="test_non_intrusive_xml_warchive" result="success"/><test-result test-name="test_non_intrusive_xml_warchive_dll" result="success"/><test-result test-name="test_not_serializable" result="success"/><test-result test-name="test_no_rtti_binary_archive" result="success"/><test-result test-name="test_no_rtti_binary_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_archive" result="success"/><test-result test-name="test_no_rtti_text_archive_dll" result="success"/><test-result test-name="test_no_rtti_text_warchive" result="success"/><test-result test-name="test_no_rtti_text_warchive_dll" result="success"/><test-result test-name="test_no_rtti_xml_archive" result="success"/><test-result test-name="test_no_rtti_xml_archive_dll" result="success"/><test-result test-name="test_no_rtti_xml_warchive" result="success"/><test-result test-name="test_no_rtti_xml_warchive_dll" result="success"/><test-result test-name="test_null_ptr_binary_archive" result="success"/><test-result test-name="test_null_ptr_binary_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_archive" result="success"/><test-result test-name="test_null_ptr_text_archive_dll" result="success"/><test-result test-name="test_null_ptr_text_warchive" result="success"/><test-result test-name="test_null_ptr_text_warchive_dll" result="success"/><test-result test-name="test_null_ptr_xml_archive" result="success"/><test-result test-name="test_null_ptr_xml_archive_dll" result="success"/><test-result test-name="test_null_ptr_xml_warchive" result="success"/><test-result test-name="test_null_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_nvp_binary_archive" result="success"/><test-result test-name="test_nvp_binary_archive_dll" result="success"/><test-result test-name="test_nvp_text_archive" result="success"/><test-result test-name="test_nvp_text_archive_dll" result="success"/><test-result test-name="test_nvp_text_warchive" result="success"/><test-result test-name="test_nvp_text_warchive_dll" result="success"/><test-result test-name="test_nvp_xml_archive" result="success"/><test-result test-name="test_nvp_xml_archive_dll" result="success"/><test-result test-name="test_nvp_xml_warchive" result="success"/><test-result test-name="test_nvp_xml_warchive_dll" result="success"/><test-result test-name="test_object_binary_archive" result="success"/><test-result test-name="test_object_binary_archive_dll" result="success"/><test-result test-name="test_object_text_archive" result="success"/><test-result test-name="test_object_text_archive_dll" result="success"/><test-result test-name="test_object_text_warchive" result="success"/><test-result test-name="test_object_text_warchive_dll" result="success"/><test-result test-name="test_object_xml_archive" result="success"/><test-result test-name="test_object_xml_archive_dll" result="success"/><test-result test-name="test_object_xml_warchive" result="success"/><test-result test-name="test_object_xml_warchive_dll" result="success"/><test-result test-name="test_optional_binary_archive" result="success"/><test-result test-name="test_optional_binary_archive_dll" result="success"/><test-result test-name="test_optional_text_archive" result="success"/><test-result test-name="test_optional_text_archive_dll" result="success"/><test-result test-name="test_optional_text_warchive" result="success"/><test-result test-name="test_optional_text_warchive_dll" result="success"/><test-result test-name="test_optional_xml_archive" result="success"/><test-result test-name="test_optional_xml_archive_dll" result="success"/><test-result test-name="test_optional_xml_warchive" result="success"/><test-result test-name="test_optional_xml_warchive_dll" result="success"/><test-result test-name="test_polymorphic_binary_archive" result="success"/><test-result test-name="test_polymorphic_binary_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_archive" result="success"/><test-result test-name="test_polymorphic_text_archive_dll" result="success"/><test-result test-name="test_polymorphic_text_warchive" result="success"/><test-result test-name="test_polymorphic_text_warchive_dll" result="success"/><test-result test-name="test_polymorphic_xml_archive" result="success"/><test-result test-name="test_polymorphic_xml_archive_dll" result="success"/><test-result test-name="test_polymorphic_xml_warchive" result="success"/><test-result test-name="test_polymorphic_xml_warchive_dll" result="success"/><test-result test-name="test_primitive_binary_archive" result="success"/><test-result test-name="test_primitive_binary_archive_dll" result="success"/><test-result test-name="test_primitive_text_archive" result="success"/><test-result test-name="test_primitive_text_archive_dll" result="success"/><test-result test-name="test_primitive_text_warchive" result="success"/><test-result test-name="test_primitive_text_warchive_dll" result="success"/><test-result test-name="test_primitive_xml_archive" result="success"/><test-result test-name="test_primitive_xml_archive_dll" result="success"/><test-result test-name="test_primitive_xml_warchive" result="success"/><test-result test-name="test_primitive_xml_warchive_dll" result="success"/><test-result test-name="test_private_ctor" result="success"/><test-result test-name="test_private_ctor_dll" result="success"/><test-result test-name="test_recursion_binary_archive" result="success"/><test-result test-name="test_recursion_binary_archive_dll" result="success"/><test-result test-name="test_recursion_text_archive" result="success"/><test-result test-name="test_recursion_text_archive_dll" result="success"/><test-result test-name="test_recursion_text_warchive" result="success"/><test-result test-name="test_recursion_text_warchive_dll" result="success"/><test-result test-name="test_recursion_xml_archive" result="success"/><test-result test-name="test_recursion_xml_archive_dll" result="success"/><test-result test-name="test_recursion_xml_warchive" result="success"/><test-result test-name="test_recursion_xml_warchive_dll" result="success"/><test-result test-name="test_registered_binary_archive" result="success"/><test-result test-name="test_registered_binary_archive_dll" result="success"/><test-result test-name="test_registered_text_archive" result="success"/><test-result test-name="test_registered_text_archive_dll" result="success"/><test-result test-name="test_registered_text_warchive" result="success"/><test-result test-name="test_registered_text_warchive_dll" result="success"/><test-result test-name="test_registered_xml_archive" result="success"/><test-result test-name="test_registered_xml_archive_dll" result="success"/><test-result test-name="test_registered_xml_warchive" result="success"/><test-result test-name="test_registered_xml_warchive_dll" result="success"/><test-result test-name="test_reset_object_address" result="success"/><test-result test-name="test_reset_object_address_dll" result="success"/><test-result test-name="test_set_binary_archive" result="success"/><test-result test-name="test_set_binary_archive_dll" result="success"/><test-result test-name="test_set_text_archive" result="success"/><test-result test-name="test_set_text_archive_dll" result="success"/><test-result test-name="test_set_text_warchive" result="success"/><test-result test-name="test_set_text_warchive_dll" result="success"/><test-result test-name="test_set_xml_archive" result="success"/><test-result test-name="test_set_xml_archive_dll" result="success"/><test-result test-name="test_set_xml_warchive" result="success"/><test-result test-name="test_set_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive" result="success"/><test-result test-name="test_shared_ptr_132_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_archive" result="success"/><test-result test-name="test_shared_ptr_132_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive" result="success"/><test-result test-name="test_shared_ptr_132_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive" result="success"/><test-result test-name="test_shared_ptr_132_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_132_xml_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_binary_archive" result="success"/><test-result test-name="test_shared_ptr_binary_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_archive" result="success"/><test-result test-name="test_shared_ptr_text_archive_dll" result="success"/><test-result test-name="test_shared_ptr_text_warchive" result="success"/><test-result test-name="test_shared_ptr_text_warchive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_archive" result="success"/><test-result test-name="test_shared_ptr_xml_archive_dll" result="success"/><test-result test-name="test_shared_ptr_xml_warchive" result="success"/><test-result test-name="test_shared_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_binary_archive" result="success"/><test-result test-name="test_simple_class_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive" result="success"/><test-result test-name="test_simple_class_ptr_binary_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_archive" result="success"/><test-result test-name="test_simple_class_ptr_text_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive" result="success"/><test-result test-name="test_simple_class_ptr_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive" result="success"/><test-result test-name="test_simple_class_ptr_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive" result="success"/><test-result test-name="test_simple_class_ptr_xml_warchive_dll" result="success"/><test-result test-name="test_simple_class_text_archive" result="success"/><test-result test-name="test_simple_class_text_archive_dll" result="success"/><test-result test-name="test_simple_class_text_warchive" result="success"/><test-result test-name="test_simple_class_text_warchive_dll" result="success"/><test-result test-name="test_simple_class_xml_archive" result="success"/><test-result test-name="test_simple_class_xml_archive_dll" result="success"/><test-result test-name="test_simple_class_xml_warchive" result="success"/><test-result test-name="test_simple_class_xml_warchive_dll" result="success"/><test-result test-name="test_smart_cast" result="success"/><test-result test-name="test_split_binary_archive" result="success"/><test-result test-name="test_split_binary_archive_dll" result="success"/><test-result test-name="test_split_text_archive" result="success"/><test-result test-name="test_split_text_archive_dll" result="success"/><test-result test-name="test_split_text_warchive" result="success"/><test-result test-name="test_split_text_warchive_dll" result="success"/><test-result test-name="test_split_xml_archive" result="success"/><test-result test-name="test_split_xml_archive_dll" result="success"/><test-result test-name="test_split_xml_warchive" result="success"/><test-result test-name="test_split_xml_warchive_dll" result="success"/><test-result test-name="test_static_warning" result="success"/><test-result test-name="test_tracking_binary_archive" result="success"/><test-result test-name="test_tracking_binary_archive_dll" result="success"/><test-result test-name="test_tracking_text_archive" result="success"/><test-result test-name="test_tracking_text_archive_dll" result="success"/><test-result test-name="test_tracking_text_warchive" result="success"/><test-result test-name="test_tracking_text_warchive_dll" result="success"/><test-result test-name="test_tracking_xml_archive" result="success"/><test-result test-name="test_tracking_xml_archive_dll" result="success"/><test-result test-name="test_tracking_xml_warchive" result="success"/><test-result test-name="test_tracking_xml_warchive_dll" result="success"/><test-result test-name="test_traits_fail" result="success"/><test-result test-name="test_traits_pass" result="success"/><test-result test-name="test_unregistered_binary_archive" result="success"/><test-result test-name="test_unregistered_binary_archive_dll" result="success"/><test-result test-name="test_unregistered_text_archive" result="success"/><test-result test-name="test_unregistered_text_archive_dll" result="success"/><test-result test-name="test_unregistered_text_warchive" result="success"/><test-result test-name="test_unregistered_text_warchive_dll" result="success"/><test-result test-name="test_unregistered_xml_archive" result="success"/><test-result test-name="test_unregistered_xml_archive_dll" result="success"/><test-result test-name="test_unregistered_xml_warchive" result="success"/><test-result test-name="test_unregistered_xml_warchive_dll" result="success"/><test-result test-name="test_utf8_codecvt" result="success"/><test-result test-name="test_variant_binary_archive" result="success"/><test-result test-name="test_variant_binary_archive_dll" result="success"/><test-result test-name="test_variant_text_archive" result="success"/><test-result test-name="test_variant_text_archive_dll" result="success"/><test-result test-name="test_variant_text_warchive" result="success"/><test-result test-name="test_variant_text_warchive_dll" result="success"/><test-result test-name="test_variant_xml_archive" result="success"/><test-result test-name="test_variant_xml_archive_dll" result="success"/><test-result test-name="test_variant_xml_warchive" result="success"/><test-result test-name="test_variant_xml_warchive_dll" result="success"/><test-result test-name="test_vector_binary_archive" result="success"/><test-result test-name="test_vector_binary_archive_dll" result="success"/><test-result test-name="test_vector_text_archive" result="success"/><test-result test-name="test_vector_text_archive_dll" result="success"/><test-result test-name="test_vector_text_warchive" result="success"/><test-result test-name="test_vector_text_warchive_dll" result="success"/><test-result test-name="test_vector_xml_archive" result="success"/><test-result test-name="test_vector_xml_archive_dll" result="success"/><test-result test-name="test_vector_xml_warchive" result="success"/><test-result test-name="test_vector_xml_warchive_dll" result="success"/><test-result test-name="test_void_cast" result="success"/><test-result test-name="test_void_cast_dll" result="success"/></library>
 <library name="signals"><test-result test-name="dead_slot_test" result="success"/><test-result test-name="deletion_test" result="success"/><test-result test-name="ordering_test" result="success"/><test-result test-name="signal_n_test" result="success"/><test-result test-name="signal_test" result="success"/><test-result test-name="trackable_test" result="success"/></library>
-<library name="smart_ptr"><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
-<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
-<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
-<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/><test-result test-name="unit_test_suite_ex_test" result="success"/></library>
-<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_read_write_mutex" result="success"/><test-result test-name="test_read_write_mutex_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
-<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="smart_ptr"><test-result test-name="atomic_count_test" result="success"/><test-result test-name="get_deleter_test" result="success"/><test-result test-name="intrusive_ptr_test" result="success"/><test-result test-name="lw_mutex_test" result="success"/><test-result test-name="shared_from_this_test" result="success"/><test-result test-name="shared_ptr_assign_fail" result="success"/><test-result test-name="shared_ptr_basic_test" result="success"/><test-result test-name="shared_ptr_delete_fail" result="success"/><test-result test-name="shared_ptr_test" result="success"/><test-result test-name="smart_ptr_test" result="success"/><test-result test-name="weak_ptr_test" result="success"/></library>
+<library name="spirit"><test-result test-name="action_tests" result="success"/><test-result test-name="action_tests_debug" result="success"/><test-result test-name="ast_calc_tests" result="success"/><test-result test-name="ast_calc_tests_debug" result="success"/><test-result test-name="bug_000008" result="success"/><test-result test-name="bug_fixes" result="success"/><test-result test-name="bug_fixes_debug" result="success"/><test-result test-name="char_strings_test" result="success"/><test-result test-name="char_strings_test_debug" result="success"/><test-result test-name="char_strings_test_fail" result="success"/><test-result test-name="chset_tests" result="success"/><test-result test-name="chset_tests_debug" result="success"/><test-result test-name="closure_tests" result="success"/><test-result test-name="closure_tests_debug" result="success"/><test-result test-name="confix_tests" result="success"/><test-result test-name="confix_tests_debug" result="success"/><test-result test-name="directives_tests" result="success"/><test-result test-name="directives_tests_debug" result="success"/><test-result test-name="distinct_tests" result="success"/><test-result test-name="distinct_tests_debug" result="success"/><test-result test-name="epsilon_tests" result="success"/><test-result test-name="epsilon_tests_debug" result="success"/><test-result test-name="escape_char_parser_tests" result="success"/><test-result test-name="escape_char_parser_tests_debug" result="success"/><test-result test-name="exception_tests" result="success"/><test-result test-name="exception_tests_debug" result="success"/><test-result test-name="file_iterator_tests" result="success"/><test-result test-name="file_iterator_tests_debug" result="success"/><test-result test-name="fixed_size_queue_fail_tests" result="success"/><test-result test-name="fixed_size_queue_tests" result="success"/><test-result test-name="fixed_size_queue_tests_debug" result="success"/><test-result test-name="for_p_as_parser_tests" result="success"/><test-result test-name="for_tests" result="success"/><test-result test-name="for_tests_debug" result="success"/><test-result test-name="fundamental_tests" result="success"/><test-result test-name="fundamental_tests_debug" result="success"/><test-result test-name="grammar_def_test" result="success"/><test-result test-name="grammar_def_test_debug" result="success"/><test-result test-name="grammar_mt_tests" result="success"/><test-result test-name="grammar_multi_instance_tst" result="success"/><test-result test-name="grammar_multi_instance_tst_debug" result="success"/><test-result test-name="grammar_tests" result="success"/><test-result test-name="grammar_tests_debug" result="success"/><test-result test-name="group_match_bug" result="success"/><test-result test-name="group_match_bug_debug" result="success"/><test-result test-name="if_p_as_parser_tests" result="success"/><test-result test-name="if_p_int_as_condition_test" result="success"/><test-result test-name="if_p_int_as_condition_test_debug" result="success"/><test-result test-name="if_tests" result="success"/><test-result test-name="if_tests_debug" result="success"/><test-result test-name="lazy_tests" result="success"/><test-result test-name="lazy_tests_debug" result="success"/><test-result test-name="loops_tests" result="success"/><test-result test-name="loops_tests_debug" result="success"/><test-result test-name="match_tests" result="success"/><test-result test-name="match_tests_debug" result="success"/><test-result test-name="multi_pass_compile_tests" result="success"/><test-result test-name="multi_pass_tests" result="success"/><test-result test-name="multi_pass_tests_debug" result="success"/><test-result test-name="negated_eps_p_test" result="success"/><test-result test-name="negated_eps_p_test_debug" result="success"/><test-result test-name="numerics_tests" result="success"/><test-result test-name="numerics_tests_debug" result="success"/><test-result test-name="operators_tests" result="success"/><test-result test-name="operators_tests_debug" result="success"/><test-result test-name="owi_mt_tests" result="success"/><test-result test-name="owi_st_tests" result="success"/><test-result test-name="owi_st_tests_debug" result="success"/><test-result test-name="parametric_tests" result="success"/><test-result test-name="parametric_tests_debug" result="success"/><test-result test-name="parser_context_test" result="success"/><test-result test-name="parser_context_test_debug" result="success"/><test-result test-name="parser_traits_tests" result="success"/><test-result test-name="parser_traits_tests_debug" result="success"/><test-result test-name="position_iterator_tests" result="success"/><test-result test-name="position_iterator_tests_debug" result="success"/><test-result test-name="primitives_tests" result="success"/><test-result test-name="primitives_tests_debug" result="success"/><test-result test-name="repeat_ast_tests" result="success"/><test-result test-name="repeat_ast_tests_debug" result="success"/><test-result test-name="rule_tests" result="success"/><test-result test-name="rule_tests_debug" result="success"/><test-result test-name="scanner_tests" result="success"/><test-result test-name="scanner_tests_debug" result="success"/><test-result test-name="scoped_lock_tests" result="success"/><test-result test-name="scoped_lock_tests_debug" result="success"/><test-result test-name="select_p_with_rule" result="success"/><test-result test-name="select_p_with_rule_debug" result="success"/><test-result test-name="sf_bug_720917" result="success"/><test-result test-name="sf_bug_720917_debug" result="success"/><test-result test-name="shortest_alternative_tests" result="success"/><test-result test-name="shortest_alternative_tests_debug" result="success"/><test-result test-name="subrule_tests" result="success"/><test-result test-name="subrule_tests_debug" result="success"/><test-result test-name="switch_problem" result="success"/><test-result test-name="switch_problem_debug" result="success"/><test-result test-name="switch_tests_eps_default" result="success"/><test-result test-name="switch_tests_eps_default_debug" result="success"/><test-result test-name="switch_tests_general_def" result="success"/><test-result test-name="switch_tests_general_def_debug" result="success"/><test-result test-name="switch_tests_single" result="success"/><test-result test-name="switch_tests_single_debug" result="success"/><test-result test-name="switch_tests_wo_default" result="success"/><test-result test-name="switch_tests_wo_default_debug" result="success"/><test-result test-name="symbols_add_null" result="success"/><test-result test-name="symbols_add_null_debug" result="success"/><test-result test-name="symbols_find_null" result="success"/><test-result test-name="symbols_find_null_debug" result="success"/><test-result test-name="symbols_tests" result="success"/><test-result test-name="symbols_tests_debug" result="success"/><test-result test-name="traverse_tests" result="success"/><test-result test-name="traverse_tests_debug" result="success"/><test-result test-name="while_p_as_parser_tests" result="success"/><test-result test-name="while_tests" result="success"/><test-result test-name="while_tests_debug" result="success"/></library>
+<library name="static_assert"><test-result test-name="static_assert_example_2" result="success"/><test-result test-name="static_assert_example_3" result="success"/><test-result test-name="static_assert_test" result="success"/><test-result test-name="static_assert_test_fail_1" result="success"/><test-result test-name="static_assert_test_fail_10" result="success"/><test-result test-name="static_assert_test_fail_2" result="success"/><test-result test-name="static_assert_test_fail_3" result="success"/><test-result test-name="static_assert_test_fail_4" result="success"/><test-result test-name="static_assert_test_fail_5" result="success"/><test-result test-name="static_assert_test_fail_6" result="success"/><test-result test-name="static_assert_test_fail_7" result="success"/><test-result test-name="static_assert_test_fail_8" result="success"/></library>
+<library name="test"><test-result test-name="algorithms_test" result="success"/><test-result test-name="auto_unit_test_test" result="success"/><test-result test-name="auto_unit_test_test_mult" result="success"/><test-result test-name="basic_cstring_test" result="success"/><test-result test-name="boost_check_equal_str" result="success"/><test-result test-name="class_properties_test" result="success"/><test-result test-name="custom_exception_test" result="success"/><test-result test-name="errors_handling_test" result="success"/><test-result test-name="fixed_mapping_test" result="success"/><test-result test-name="foreach_test" result="success"/><test-result test-name="ifstream_line_iterator_test" result="success"/><test-result test-name="online_test" result="success"/><test-result test-name="output_test_stream_test" result="success"/><test-result test-name="parameterized_test_test" result="success"/><test-result test-name="result_report_test" result="success"/><test-result test-name="test_case_template_test" result="success"/><test-result test-name="test_fp_comparisons" result="success"/><test-result test-name="test_tools_test" result="success"/><test-result test-name="token_iterator_test" result="success"/></library>
+<library name="thread"><test-result test-name="test_barrier" result="success"/><test-result test-name="test_barrier_lib" result="success"/><test-result test-name="test_condition" result="success"/><test-result test-name="test_condition_lib" result="success"/><test-result test-name="test_mutex" result="success"/><test-result test-name="test_mutex_lib" result="success"/><test-result test-name="test_once" result="success"/><test-result test-name="test_once_lib" result="success"/><test-result test-name="test_thread" result="success"/><test-result test-name="test_thread_lib" result="success"/><test-result test-name="test_tss" result="success"/><test-result test-name="test_tss_lib" result="success"/><test-result test-name="test_xtime" result="success"/><test-result test-name="test_xtime_lib" result="success"/></library>
+<library name="type_traits"><test-result test-name="add_const_test" result="success"/><test-result test-name="add_cv_test" result="success"/><test-result test-name="add_pointer_test" result="success"/><test-result test-name="add_reference_test" result="success"/><test-result test-name="add_volatile_test" result="success"/><test-result test-name="aligned_storage_test" result="success"/><test-result test-name="alignment_of_test" result="success"/><test-result test-name="decay_test" result="success"/><test-result test-name="extent_test" result="success"/><test-result test-name="function_traits_test" result="success"/><test-result test-name="has_nothrow_assign_test" result="success"/><test-result test-name="has_nothrow_constr_test" result="success"/><test-result test-name="has_nothrow_copy_test" result="success"/><test-result test-name="has_trivial_assign_test" result="success"/><test-result test-name="has_trivial_constr_test" result="success"/><test-result test-name="has_trivial_copy_test" result="success"/><test-result test-name="has_trivial_destructor_test" result="success"/><test-result test-name="has_virtual_destructor_test" result="success"/><test-result test-name="is_abstract_test" result="success"/><test-result test-name="is_arithmetic_test" result="success"/><test-result test-name="is_array_test" result="success"/><test-result test-name="is_base_and_derived_test" result="success"/><test-result test-name="is_base_of_test" result="success"/><test-result test-name="is_class_test" result="success"/><test-result test-name="is_compound_test" result="success"/><test-result test-name="is_const_test" result="success"/><test-result test-name="is_convertible_test" result="success"/><test-result test-name="is_empty_test" result="success"/><test-result test-name="is_enum_test" result="success"/><test-result test-name="is_floating_point_test" result="success"/><test-result test-name="is_float_test" result="success"/><test-result test-name="is_function_test" result="success"/><test-result test-name="is_fundamental_test" result="success"/><test-result test-name="is_integral_test" result="success"/><test-result test-name="is_member_func_test" result="success"/><test-result test-name="is_member_obj_test" result="success"/><test-result test-name="is_member_pointer_test" result="success"/><test-result test-name="is_object_test" result="success"/><test-result test-name="is_pod_test" result="success"/><test-result test-name="is_pointer_test" result="success"/><test-result test-name="is_polymorphic_test" result="success"/><test-result test-name="is_reference_test" result="success"/><test-result test-name="is_same_test" result="success"/><test-result test-name="is_scalar_test" result="success"/><test-result test-name="is_signed_test" result="success"/><test-result test-name="is_stateless_test" result="success"/><test-result test-name="is_union_test" result="success"/><test-result test-name="is_unsigned_test" result="success"/><test-result test-name="is_void_test" result="success"/><test-result test-name="is_volatile_test" result="success"/><test-result test-name="rank_test" result="success"/><test-result test-name="remove_all_extents_test" result="success"/><test-result test-name="remove_bounds_test" result="success"/><test-result test-name="remove_const_test" result="success"/><test-result test-name="remove_cv_test" result="success"/><test-result test-name="remove_extent_test" result="success"/><test-result test-name="remove_pointer_test" result="success"/><test-result test-name="remove_reference_test" result="success"/><test-result test-name="remove_volatile_test" result="success"/><test-result test-name="tricky_abstract_type_test" result="success"/><test-result test-name="tricky_add_pointer_test" result="success"/><test-result test-name="tricky_function_type_test" result="success"/><test-result test-name="tricky_incomplete_type_test" result="success"/><test-result test-name="tricky_is_enum_test" result="success"/><test-result test-name="tricky_partial_spec_test" result="success"/><test-result test-name="type_with_alignment_test" result="success"/><test-result test-name="udt_specialisations" result="success"/></library>
+<library name="utility/enable_if"><test-result test-name="constructors" result="success"/><test-result test-name="dummy_arg_disambiguation" result="success"/><test-result test-name="lazy" result="success"/><test-result test-name="lazy_test" result="success"/><test-result test-name="member_templates" result="success"/><test-result test-name="namespace_disambiguation" result="success"/><test-result test-name="no_disambiguation" result="success"/><test-result test-name="partial_specializations" result="success"/></library>
 <library name="utility"><test-result test-name="addressof_test" result="success"/><test-result test-name="assert_test" result="success"/><test-result test-name="base_from_member_test" result="success"/><test-result test-name="binary_search_test" result="success"/><test-result test-name="call_traits_test" result="success"/><test-result test-name="checked_delete_test" result="success"/><test-result test-name="compressed_pair_test" result="success"/><test-result test-name="current_function_test" result="success"/><test-result test-name="iterators_test" result="success"/><test-result test-name="next_prior_test" result="success"/><test-result test-name="noncopyable_test" result="success"/><test-result test-name="numeric_traits_test" result="success"/><test-result test-name="operators_test" result="success"/><test-result test-name="ref_ct_test" result="success"/><test-result test-name="ref_test" result="success"/><test-result test-name="result_of_test" result="success"/><test-result test-name="shared_iterator_test" result="success"/><test-result test-name="value_init_test" result="success"/><test-result test-name="value_init_test_fail1" result="success"/><test-result test-name="value_init_test_fail2" result="success"/><test-result test-name="value_init_test_fail3" result="success"/></library>
 <library name="variant"><test-result test-name="recursive_variant_test" result="success"/><test-result test-name="variant_comparison_test" result="success"/><test-result test-name="variant_reference_test" result="success"/><test-result test-name="variant_test1" result="success"/><test-result test-name="variant_test2" result="success"/><test-result test-name="variant_test3" result="success"/><test-result test-name="variant_test4" result="success"/><test-result test-name="variant_test5" result="success"/><test-result test-name="variant_test6" result="success"/><test-result test-name="variant_test7" result="success"/><test-result test-name="variant_test8" result="success"/><test-result test-name="variant_visit_test" result="success"/></library>
+<library name="wave"><test-result test-name="testwave" result="success"/><test-result test-name="test_re2c_lexer" result="success"/><test-result test-name="test_slex_lexer" result="success"/></library>
 <library name="config"><test-result test-name="abi_test" result="success"/><test-result test-name="config_info" result="success"/><test-result test-name="config_link_test" result="success"/><test-result test-name="config_test" result="success"/><test-result test-name="limits_test" result="success"/><test-result test-name="test_thread_fail1" result="success"/><test-result test-name="test_thread_fail2" result="success"/></library>
 <library name="lambda"><test-result test-name="algorithm_test" result="success"/><test-result test-name="bind_tests_advanced" result="success"/><test-result test-name="bind_tests_simple" result="success"/><test-result test-name="bind_tests_simple_f_refs" result="success"/><test-result test-name="bll_and_function" result="success"/><test-result test-name="constructor_tests" result="success"/><test-result test-name="control_structures" result="success"/><test-result test-name="exception_test" result="success"/><test-result test-name="extending_rt_traits" result="success"/><test-result test-name="is_instance_of_test" result="success"/><test-result test-name="lambda_cast_test" result="success"/><test-result test-name="member_pointer_test" result="success"/><test-result test-name="operator_tests_simple" result="success"/><test-result test-name="phoenix_control_structures" result="success"/><test-result test-name="switch_construct" result="success"/></library>
-<library name="any"><test-result test-name="any_test" result="success"/></library>
-<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
+<library name="preprocessor"><test-result test-name="arithmetic" result="success"/><test-result test-name="array" result="success"/><test-result test-name="comparison" result="success"/><test-result test-name="control" result="success"/><test-result test-name="debug" result="success"/><test-result test-name="facilities" result="success"/><test-result test-name="iteration" result="success"/><test-result test-name="list" result="success"/><test-result test-name="logical" result="success"/><test-result test-name="repetition" result="success"/><test-result test-name="selection" result="success"/><test-result test-name="seq" result="success"/><test-result test-name="slot" result="success"/><test-result test-name="tuple" result="success"/></library>
 <library name="array"><test-result test-name="array1" result="success"/><test-result test-name="array2" result="success"/><test-result test-name="array3" result="success"/><test-result test-name="array4" result="success"/><test-result test-name="array5" result="success"/></library>
-<library name="concept_check"><test-result test-name="class_concept_check_test" result="success"/><test-result test-name="class_concept_fail_expected" result="success"/><test-result test-name="concept_check_fail_expected" result="success"/><test-result test-name="concept_check_test" result="success"/></library>
 <library name="crc"><test-result test-name="crc_test" result="success"/></library>
 <library name="integer"><test-result test-name="cstdint_test" result="success"/><test-result test-name="integer_test" result="success"/><test-result test-name="integer_traits_test" result="success"/></library>
 <library name="disjoint_sets"><test-result test-name="disjoint_set_test" result="success"/></library>
 <library name="tokenizer"><test-result test-name="examples" result="success"/><test-result test-name="simple_example_1" result="success"/><test-result test-name="simple_example_2" result="success"/><test-result test-name="simple_example_3" result="success"/><test-result test-name="simple_example_4" result="success"/><test-result test-name="simple_example_5" result="success"/></library>
 <library name="functional"><test-result test-name="function_test" result="success"/></library>
 <library name="tuple"><test-result test-name="io_test" result="success"/><test-result test-name="tuple_test_bench" result="success"/></library>
-<library name="property_map"><test-result test-name="property_map_cc" result="success"/></library>
 <library name="rational"><test-result test-name="rational_example" result="success"/><test-result test-name="rational_test" result="success"/></library>
 <library name="pool"><test-result test-name="test_pool_alloc" result="success"/></library>
 <library name="timer"><test-result test-name="timer_test" result="success"/></library>
-</toolset></expected-failures>
+</toolset>
+</expected-failures>

Deleted: boost/trunk/libs/filesystem/build/Jamfile
===================================================================
--- boost/trunk/libs/filesystem/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/filesystem/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,56 +0,0 @@
-# Boost Filesystem Library Build Jamfile
-
-# (C) Copyright Beman Dawes 2002
-# Use, modification, and distribution is subject to the Boost Software
-# License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-
-# See library home page at http://www.boost.org/libs/filesystem
-
-subproject libs/filesystem/build ;
-
-SOURCES = exception operations path portability utf8_codecvt_facet ;
-
-lib boost_filesystem
-     : ../src/$(SOURCES).cpp
-     : # build requirements
-       <define>BOOST_FILESYSTEM_STATIC_LINK
-       <include>$(BOOST_ROOT) <sysinclude>$(BOOST_ROOT)
-      # common-variant-tag ensures that the library will
-      # be named according to the rules used by the install
-      # and auto-link features:
-      common-variant-tag 
-     : debug release  # build variants
-     ;
-
-dll boost_filesystem
-     : ../src/$(SOURCES).cpp
-     : # build requirements
-       <define>BOOST_FILESYSTEM_DYN_LINK=1  # tell source we're building dll's
-       <runtime-link>dynamic  # build only for dynamic runtimes
-       <include>$(BOOST_ROOT) <sysinclude>$(BOOST_ROOT)
-      # common-variant-tag ensures that the library will
-      # be named according to the rules used by the install
-      # and auto-link features:
-      common-variant-tag 
-     : debug release  # build variants
-     ;
-
-install filesystem lib
-     : <lib>boost_filesystem <dll>boost_filesystem
-     ;
-
-stage stage/lib : <lib>boost_filesystem <dll>boost_filesystem
-    :
-        # copy to a path rooted at BOOST_ROOT:
-        <locate>$(BOOST_ROOT)
-        # make sure the names of the libraries are correctly named:
-        common-variant-tag
-        # add this target to the "stage" and "all" psuedo-targets:
-        <target>stage
-        <target>all
-    :
-        debug release
-    ;
-
-# end

Modified: boost/trunk/libs/filesystem/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/filesystem/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/filesystem/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,12 @@
+# Boost Filesystem Library Build Jamfile
 
+# (C) Copyright Beman Dawes 2002, 2006
+
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or www.boost.org/LICENSE_1_0.txt)
+
+# See library home page at http://www.boost.org/libs/filesystem
+
 project boost/filesystem
     :
     source-location ../src

Modified: boost/trunk/libs/filesystem/doc/faq.htm
===================================================================
--- boost/trunk/libs/filesystem/doc/faq.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/filesystem/doc/faq.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,131 +1,269 @@
-<title>Boost Filesystem FAQ</title>
-<body bgcolor="#FFFFFF">
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+  <head>
+    <title>
+      Boost Filesystem FAQ
+    </title>
+<style type="text/css">
+ body {
+  background-color: #FFFFFF;
+ }
+ p.c1 {font-weight: bold}
+</style>
+  </head>
+  <body>
+    <h1>
+      <img border="0" src="../../../boost.png" align="middle" alt=
+      "Boost C++ libraries logo" width="277" height="86"> Filesystem
+      FAQ
+    </h1>
 
-<h1>
-<img border="0" src="../../../boost.png" align="center" width="277" height="86">Filesystem 
-FAQ</h1>
-<p><b>Why base the generic-path string format on POSIX?</b></p>
-<p><a href="design.htm#POSIX-01">[POSIX-01]</a> is an ISO Standard. It is the basis for the most familiar path-string formats, including the 
-URL portion of URI's and the native Windows format. It is ubiquitous and 
-familiar.&nbsp; On many systems, it is very easy to implement because it is 
-either the native operating system format (Unix and Windows) or via a 
-operating system supplied 
-POSIX library (z/OS, OS/390, and many more.)</p>
-<p><b>Why not use a full URI (Universal Resource Identifier) based path?</b></p>
-<p><a href="design.htm#URI">URI's</a> would promise more than the Filesystem Library can actually deliver, 
-since URI's extend far beyond what most operating systems consider a file or a 
-directory.&nbsp; Thus for the primary &quot;portable script-style file system 
-operations&quot; requirement of the Filesystem Library, full URI's appear to be over-specification.</p>
-<p><b>Why isn't <i>path</i> a base class with derived <i>directory_path</i> and
-<i>file_path</i> classes?</b></p>
-<p>Why bother?&nbsp; The behavior of all three classes is essentially identical. 
-Several early versions did require users to identify each path as a file or 
-directory path, and this seemed to increase errors and decrease code 
-readability. There was no apparent upside benefit.</p>
-<p><b>Why are fully specified paths called <i>complete</i> rather than <i>
-<a name="absolute">absolute</a></i>?</b></p>
-<p>To avoid long-held assumptions (what do you mean, <i>&quot;/foo&quot;</i> isn't 
-absolute on some systems?) by programmers used to single-rooted filesystems. 
-Using an unfamiliar name for the concept and related functions causes 
-programmers to read the specs rather than just assuming the meaning is known.</p>
-<p><b>Why not support a  concept of specific kinds of file systems, such as posix_file_system or windows_file_system.</b></p>
-<p>Portability is one of the most important requirements for the 
-library.&nbsp;Gaining some advantage by using features specific to particular 
-operating systems is not a requirement. There doesn't appear to be much need for 
-the ability to manipulate, say, a classic Mac OS path while running on an 
-OpenVMS machine.</p>
-<p>Furthermore, concepts like &quot;file system&quot; 
-are very slippery. What happens when a NTFS or FAT file system is mounted 
-in directory on a machine running a POSIX-like operating system, for example? 
-Some of the POSIX API's may return very un-POSIX like results.</p>
-<p><b>Why not supply a 'handle' type, and let the file and directory operations 
-traffic in it?</b></p>
-<p>It isn't clear there is any feasible way to meet the &quot;portable script-style 
-file system operations&quot; requirement with such a system. File systems exist where operations are usually performed on 
-  some non-string handle type. The classic Mac OS has been mentioned explicitly as a case where 
-trafficking in paths isn't always natural.&nbsp;&nbsp;&nbsp; </p>
-<p>The case for the &quot;handle&quot; (opaque data type to identify a file) 
-style may be strongest for directory iterator value type.&nbsp; (See Jesse Jones' Jan 28, 
-2002, Boost postings). However, as class path has evolved, it seems sufficient 
-even as the directory iterator value type.</p>
-<p><b>Why are the operations.hpp non-member functions so low-level?</b></p>
-<p>To provide a toolkit from which higher-level functionality can be created.</p>
-<p>An 
-extended attempt to add convenience functions on top of, or as a replacement 
-for, the low-level functionality failed because there is no widely acceptable 
-set of simple semantics for most convenience functions considered.&nbsp; 
-Attempts to provide alternate semantics via either run-time options or 
-compile-time polices became overly complicated in relation to the value 
-delivered, or became contentious.&nbsp; OTOH, the specific functionality needed for several trial 
-applications was very easy for the user to construct from the lower-level 
-toolkit functions.&nbsp; See <a href="design.htm#Abandoned_Designs">Failed 
-Attempts</a>.</p>
-<p><b>Isn't it inconsistent then to provide a few convenience functions?</b></p>
-<p>Yes, but experience with both this library, POSIX, and Windows indicates 
-the utility of certain convenience functions, and that it is possible to provide 
-simple, yet widely acceptable, semantics for them. For example, remove_all.</p>
-<p><b>Why are there basic_directory_iterator&lt;&gt; overloads for operations.hpp 
-predicate functions? Isn't two ways to do the same thing poor design?</b></p>
-<p>Yes, two ways to do the same thing is often a poor design practice. But the 
-iterator versions are often much more efficient. Calling status() during 
-iteration over a directory containing 15,000 files took 6 seconds for the path 
-overload, and 1 second for the iterator overload, for tests on a freshly booted 
-machine. Times were .90 seconds and .30 seconds, for tests after prior use of 
-the directory. This performance gain is large enough to justify deviating from 
-preferred design practices. Neither overload alone meets all needs.</p>
-<p><b>Why are library functions so picky about errors?</b></p>
-<p>Safety. The default is to be safe rather than sorry. This is particularly 
-important given the reality that on many computer systems files and directories 
-are <a href="#global">globally shared</a> resources, and thus subject to 
-unexpected errors.</p>
-<p><b>Why are errors reported by exception rather than return code or error 
-notification variable?</b></p>
-<p>Safety.&nbsp;Return codes or error notification variables are often ignored 
-by programmers.&nbsp; Exceptions are much harder to ignore, provided desired 
-default behavior (program termination) if not caught, yet allow error recovery 
-if desired. Non-throwing versions of functions are provided where experience 
-indicates the need.</p>
-<p><b>Why are attributes accessed via named functions rather than property maps?</b></p>
-<p>For  commonly used attributes (existence, directory or file, emptiness), 
-simple syntax and guaranteed presence outweigh other considerations. Because 
-access to many other attributes is inherently system dependent, 
-property maps are viewed as the best hope for access and modification, but it is 
-better design to provide such functionality in a separate library. (Historical 
-note: even the apparently simple attribute &quot;read-only&quot; turned out to be so 
-system depend as to be disqualified as a &quot;guaranteed presence&quot; operation.)</p>
-<p><b>Why isn't there a set_current_directory function?</b></p>
-<p>Global variables are considered harmful [<a href="design.htm#Wulf-Shaw-73">wulf-shaw-73</a>]. 
-While we can't prevent people from shooting themselves in the foot, we aren't 
-about to hand them a loaded gun pointed right at their big toe.</p>
-<p><b>Why aren't <a name="wide-character_names">wide-character names</a> supported? Why not std::wstring or even 
-a templated type?</b></p>
-<p>They <u>are</u> supported, starting with version 1.33. See
-<a href="i18n.html">Internationalization</a>.</p>
-<p><b>Why isn't automatic name portability error detection provided?</b></p>
-<p>A number (at least six) of designs for  name validity error 
-detection were evaluated, including at least four complete implementations.&nbsp; 
-While the details for rejection differed, all of the more powerful name validity checking 
-designs distorted other 
-otherwise simple aspects of the library. Even the simple name checking provided 
-in prior library versions was a constant source of user complaints. While name checking can be helpful, it 
-isn't important enough to justify added a lot of additional complexity.</p>
-<p><b>Why are paths sometimes manipulated by member functions and sometimes by 
-non-member functions?</b></p>
-<p>The design rule is that purely lexical operations are supplied as <i>class 
-basic_path</i> member 
-functions, while operations performed by the operating system are provided as 
-free functions.</p>
-<p><b>Why is path <a href="path.htm#Normalized">normalized form</a> different 
-from <a href="path.htm#Canonical">canonical form</a>?</b></p>
-<p>On operating systems such as POSIX which allow symbolic links to directories, 
-the normalized form of a path can represent a different location than the 
-canonical form. See <a href="design.htm#symbolic-link-use-case">use case</a> 
-from Walter Landry.</p>
-<hr>
-<p>Revised
-<!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->06 February, 2006<!--webbot bot="Timestamp" endspan i-checksum="40411" --></p>
-<p>© Copyright Beman Dawes, 2002</p>
-<p> Use, modification, and distribution are subject to the Boost Software 
-License, Version 1.0. (See accompanying file <a href="../../../LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a>)</p>
\ No newline at end of file
+    <p class="c1">
+      Why base the generic-path string format on POSIX?
+    </p>
+    <p>
+      <a href="design.htm#POSIX-01">[POSIX-01]</a> is an ISO Standard.
+      It is the basis for the most familiar path-string formats,
+      including the URL portion of URI's and the native Windows format.
+      It is ubiquitous and familiar.&nbsp; On many systems, it is very
+      easy to implement because it is either the native operating
+      system format (Unix and Windows) or via a operating system
+      supplied POSIX library (z/OS, OS/390, and many more.)
+    </p>
+    <p class="c1">
+      Why not use a full URI (Universal Resource Identifier) based
+      path?
+    </p>
+
+    <p>
+      <a href="design.htm#URI">URI's</a> would promise more than the
+      Filesystem Library can actually deliver, since URI's extend far
+      beyond what most operating systems consider a file or a
+      directory.&nbsp; Thus for the primary "portable script-style file
+      system operations" requirement of the Filesystem Library, full
+      URI's appear to be over-specification.
+    </p>
+    <p class="c1">
+      Why isn't <i>path</i> a base class with derived
+      <i>directory_path</i> and <i>file_path</i> classes?
+    </p>
+
+    <p>
+      Why bother?&nbsp; The behavior of all three classes is
+      essentially identical. Several early versions did require users
+      to identify each path as a file or directory path, and this
+      seemed to increase errors and decrease code readability. There
+      was no apparent upside benefit.
+    </p>
+    <p class="c1">
+      Why are fully specified paths called <i>complete</i> rather than
+      <i><a name="absolute" id="absolute">absolute</a></i>?
+    </p>
+
+    <p>
+      To avoid long-held assumptions (what do you mean, <i>"/foo"</i>
+      isn't absolute on some systems?) by programmers used to
+      single-rooted filesystems. Using an unfamiliar name for the
+      concept and related functions causes programmers to read the
+      specs rather than just assuming the meaning is known.
+    </p>
+    <p class="c1">
+      Why not support a concept of specific kinds of file systems, such
+      as posix_file_system or windows_file_system.
+    </p>
+    <p>
+      Portability is one of the most important requirements for the
+      library.&nbsp;Gaining some advantage by using features specific
+      to particular operating systems is not a requirement. There
+      doesn't appear to be much need for the ability to manipulate,
+      say, a classic Mac OS path while running on an OpenVMS machine.
+    </p>
+
+    <p>
+      Furthermore, concepts like "file system" are very slippery. What
+      happens when a NTFS or FAT file system is mounted in directory on
+      a machine running a POSIX-like operating system, for example?
+      Some of the POSIX API's may return very un-POSIX like results.
+    </p>
+    <p class="c1">
+      Why not supply a 'handle' type, and let the file and directory
+      operations traffic in it?
+    </p>
+    <p>
+      It isn't clear there is any feasible way to meet the "portable
+      script-style file system operations" requirement with such a
+      system. File systems exist where operations are usually performed
+      on some non-string handle type. The classic Mac OS has been
+      mentioned explicitly as a case where trafficking in paths isn't
+      always natural.&nbsp;&nbsp;&nbsp;
+    </p>
+
+    <p>
+      The case for the "handle" (opaque data type to identify a file)
+      style may be strongest for directory iterator value type.&nbsp;
+      (See Jesse Jones' Jan 28, 2002, Boost postings). However, as
+      class path has evolved, it seems sufficient even as the directory
+      iterator value type.
+    </p>
+    <p class="c1">
+      Why are the operations.hpp non-member functions so low-level?
+    </p>
+    <p>
+      To provide a toolkit from which higher-level functionality can be
+      created.
+    </p>
+
+    <p>
+      An extended attempt to add convenience functions on top of, or as
+      a replacement for, the low-level functionality failed because
+      there is no widely acceptable set of simple semantics for most
+      convenience functions considered.&nbsp; Attempts to provide
+      alternate semantics via either run-time options or compile-time
+      polices became overly complicated in relation to the value
+      delivered, or became contentious.&nbsp; OTOH, the specific
+      functionality needed for several trial applications was very easy
+      for the user to construct from the lower-level toolkit
+      functions.&nbsp; See <a href=
+      "design.htm#Abandoned_Designs">Failed Attempts</a>.
+    </p>
+    <p class="c1">
+      Isn't it inconsistent then to provide a few convenience
+      functions?
+    </p>
+
+    <p>
+      Yes, but experience with both this library, POSIX, and Windows
+      indicates the utility of certain convenience functions, and that
+      it is possible to provide simple, yet widely acceptable,
+      semantics for them. For example, remove_all.
+    </p>
+    <p class="c1">
+      Why are there basic_directory_iterator&lt;&gt; overloads for
+      operations.hpp predicate functions? Isn't two ways to do the same
+      thing poor design?
+    </p>
+    <p>
+      Yes, two ways to do the same thing is often a poor design
+      practice. But the iterator versions are often much more
+      efficient. Calling status() during iteration over a directory
+      containing 15,000 files took 6 seconds for the path overload, and
+      1 second for the iterator overload, for tests on a freshly booted
+      machine. Times were .90 seconds and .30 seconds, for tests after
+      prior use of the directory. This performance gain is large enough
+      to justify deviating from preferred design practices. Neither
+      overload alone meets all needs.
+    </p>
+
+    <p class="c1">
+      Why are library functions so picky about errors?
+    </p>
+    <p>
+      Safety. The default is to be safe rather than sorry. This is
+      particularly important given the reality that on many computer
+      systems files and directories are <a href="#global">globally
+      shared</a> resources, and thus subject to unexpected errors.
+    </p>
+    <p class="c1">
+      Why are errors reported by exception rather than return code or
+      error notification variable?
+    </p>
+
+    <p>
+      Safety.&nbsp;Return codes or error notification variables are
+      often ignored by programmers.&nbsp; Exceptions are much harder to
+      ignore, provided desired default behavior (program termination)
+      if not caught, yet allow error recovery if desired. Non-throwing
+      versions of functions are provided where experience indicates the
+      need.
+    </p>
+    <p class="c1">
+      Why are attributes accessed via named functions rather than
+      property maps?
+    </p>
+    <p>
+      For commonly used attributes (existence, directory or file,
+      emptiness), simple syntax and guaranteed presence outweigh other
+      considerations. Because access to many other attributes is
+      inherently system dependent, property maps are viewed as the best
+      hope for access and modification, but it is better design to
+      provide such functionality in a separate library. (Historical
+      note: even the apparently simple attribute "read-only" turned out
+      to be so system depend as to be disqualified as a "guaranteed
+      presence" operation.)
+    </p>
+
+    <p class="c1">
+      Why isn't there a set_current_directory function?
+    </p>
+    <p>
+      Global variables are considered harmful [<a href=
+      "design.htm#Wulf-Shaw-73">wulf-shaw-73</a>]. While we can't
+      prevent people from shooting themselves in the foot, we aren't
+      about to hand them a loaded gun pointed right at their big toe.
+    </p>
+    <p class="c1">
+      Why aren't <a name="wide-character_names" id=
+      "wide-character_names">wide-character names</a> supported? Why
+      not std::wstring or even a templated type?
+    </p>
+
+    <p>
+      They <u>are</u> supported, starting with version 1.33. See
+      <a href="i18n.html">Internationalization</a>.
+    </p>
+    <p class="c1">
+      Why isn't automatic name portability error detection provided?
+    </p>
+    <p>
+
+      A number (at least six) of designs for name validity error
+      detection were evaluated, including at least four complete
+      implementations.&nbsp; While the details for rejection differed,
+      all of the more powerful name validity checking designs distorted
+      other otherwise simple aspects of the library. Even the simple
+      name checking provided in prior library versions was a constant
+      source of user complaints. While name checking can be helpful, it
+      isn't important enough to justify added a lot of additional
+      complexity.
+    </p>
+    <p class="c1">
+      Why are paths sometimes manipulated by member functions and
+      sometimes by non-member functions?
+    </p>
+    <p>
+      The design rule is that purely lexical operations are supplied as
+      <i>class basic_path</i> member functions, while operations
+      performed by the operating system are provided as free functions.
+    </p>
+
+    <p class="c1">
+      Why is path <i>normalized form</i> different from <i>canonical
+      form</i>?
+    </p>
+    <p>
+      On operating systems such as POSIX which allow symbolic links to
+      directories, the normalized form of a path can represent a
+      different location than the canonical form. See <a href=
+      "design.htm#symbolic-link-use-case">use case</a> from Walter
+      Landry.
+    </p>
+
+    <hr>
+    <p>
+      Revised 
+      <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
+			06 February, 2006
+      <!--webbot bot="Timestamp" endspan i-checksum="40411" -->
+    </p>
+    <p>
+      © Copyright Beman Dawes, 2002
+    </p>
+    <p>
+
+      Use, modification, and distribution are subject to the Boost
+      Software License, Version 1.0. (See accompanying file <a href=
+      "../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at
+      <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
+    </p>
+  </body>
+</html>

Modified: boost/trunk/libs/filesystem/doc/i18n.html
===================================================================
--- boost/trunk/libs/filesystem/doc/i18n.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/filesystem/doc/i18n.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -417,11 +417,9 @@
 <p>Revised
 <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->16 December, 2005<!--webbot bot="Timestamp" endspan i-checksum="38518" --></p>
 <p>© Copyright Beman Dawes, 2005</p>
-<p> Use, modification, and distribution are subject to the Boost Software 
-License, Version 1.0. (See accompanying file 
-<a href="../../../../site/LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a>)</p>
+<p>Distributed under the Boost Software License, Version 1.0.
+(See accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
 
 </body>
 

Deleted: boost/trunk/libs/filesystem/example/Jamfile
===================================================================
--- boost/trunk/libs/filesystem/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/filesystem/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,22 +0,0 @@
-# Boost Filesystem Library Example Jamfile
-
-# Copyright Beman Dawes 2003
-
-# Use, modification, and distribution is subject to the Boost Software
-# License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-
-# See library home page at http://www.boost.org/libs/filesystem
-
-{
-
- exe file_size : file_size.cpp
-                 ../src/operations.cpp
-                 ../src/exception.cpp
-                 ../src/path.cpp
-                 ../src/portability.cpp
-               : <define>BOOST_ALL_NO_LIB
-                 <include>$(BOOST_ROOT) <sysinclude>$(BOOST_ROOT)
-               ;
-
-}
\ No newline at end of file

Modified: boost/trunk/libs/filesystem/example/Jamfile.v2
===================================================================
--- boost/trunk/libs/filesystem/example/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/filesystem/example/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,12 @@
+# Boost System Library Build Jamfile
 
+# (C) Copyright Beman Dawes 2002, 2006
+
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or www.boost.org/LICENSE_1_0.txt)
+
+# See library home page at http://www.boost.org/libs/filesystem
+
 project
     : requirements <library>../build//boost_filesystem
       <hardcode-dll-paths>true

Modified: boost/trunk/libs/filesystem/index.html
===================================================================
--- boost/trunk/libs/filesystem/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/filesystem/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 <a href="doc/index.htm">doc/index.htm</a>.
 <hr>
 <p>© Copyright Beman Dawes, 2003</p>
-<p> Use, modification, and distribution are subject to the Boost Software 
+<p> Distributed under the Boost Software 
 License, Version 1.0. (See accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
 www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>

Modified: boost/trunk/libs/filesystem/src/operations.cpp
===================================================================
--- boost/trunk/libs/filesystem/src/operations.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/filesystem/src/operations.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,12 +2,13 @@
 
 //  Copyright 2002-2005 Beman Dawes
 //  Copyright 2001 Dietmar Kuehl
-//  Use, modification, and distribution is subject to the Boost Software
-//  License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy
-//  at http://www.boost.org/LICENSE_1_0.txt)
 
-//  See library home page at http://www.boost.org/libs/filesystem
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
 
+//  See library home page at http://www.boost.org/libs/filesystem/
+
 //----------------------------------------------------------------------------// 
 
 // define BOOST_FILESYSTEM_SOURCE so that <boost/filesystem/config.hpp> knows
@@ -16,7 +17,11 @@
 
 #define _POSIX_PTHREAD_SEMANTICS  // Sun readdir_r() needs this
 
-#define _FILE_OFFSET_BITS 64 // at worst, these defines may have no effect,
+#if !(defined(__HP_aCC) && defined(_ILP32) && \
+      !defined(_STATVFS_ACPP_PROBLEMS_FIXED))
+# define _FILE_OFFSET_BITS 64 // at worst, these defines may have no effect,
+#endif
+
 #define __USE_FILE_OFFSET64 // but that is harmless on Windows and on POSIX
       // 64-bit systems or on 32-bit systems which don't have files larger 
       // than can be represented by a traditional POSIX/UNIX off_t type. 
@@ -1259,12 +1264,12 @@
         if ( result == 0 ) return dir_itr_close( handle, buffer );
         target = entry->d_name;
 #     ifdef BOOST_FILESYSTEM_STATUS_CACHE
-		    if ( entry->d_type == DT_UNKNOWN )  // filesystem does not supply d_type value
+            if ( entry->d_type == DT_UNKNOWN )  // filesystem does not supply d_type value
         {
           sf = symlink_sf = fs::file_status(fs::status_unknown);
         }
-	  	  else  // filesystem supplies d_type value
-		    {
+          else  // filesystem supplies d_type value
+            {
           if ( entry->d_type == DT_DIR )
             sf = symlink_sf = fs::file_status( fs::directory_file );
           else if ( entry->d_type == DT_REG )
@@ -1275,7 +1280,7 @@
             symlink_sf = fs::file_status( fs::symlink_file );
           }
           else sf = symlink_sf = fs::file_status( fs::status_unknown );
-		    }
+            }
 #     else
         sf = symlink_sf = fs::file_status( fs::status_unknown );
 #     endif

Deleted: boost/trunk/libs/filesystem/test/Jamfile
===================================================================
--- boost/trunk/libs/filesystem/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/filesystem/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,62 +0,0 @@
-# Boost Filesystem Library test Jamfile
-
-# Copyright Beman Dawes 2003
-
-# Use, modification, and distribution is subject to the Boost Software
-# License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-
-# See library home page at http://www.boost.org/libs/filesystem
-
-subproject libs/filesystem/test ;
-
-# bring in rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-    # look in BOOST_ROOT for sources first, just in this Jamfile
-    local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-    
-   test-suite "filesystem"
-       : [ run libs/filesystem/test/path_test.cpp
-               <lib>../build/boost_filesystem
-               :  :  : <define>BOOST_ALL_NO_LIB <define>BOOST_FILESYSTEM_STATIC_LINK
-         ]
-       : [ run libs/filesystem/test/path_test.cpp
-               <dll>../build/boost_filesystem
-               :  :  : <define>BOOST_ALL_NO_LIB <define>BOOST_FILESYSTEM_DYN_LINK <runtime-link>dynamic
-               : path_test_dll
-         ]
-         [ run libs/filesystem/test/operations_test.cpp
-               <lib>../build/boost_filesystem
-               :  :  : <define>BOOST_ALL_NO_LIB <define>BOOST_FILESYSTEM_STATIC_LINK
-         ]
-         [ run libs/filesystem/test/operations_test.cpp
-               <dll>../build/boost_filesystem
-               :  :  : <define>BOOST_ALL_NO_LIB <define>BOOST_FILESYSTEM_DYN_LINK <runtime-link>dynamic
-               : operations_test_dll
-         ]
-         [ run libs/filesystem/test/fstream_test.cpp
-               <lib>../build/boost_filesystem
-               :  :  : <define>BOOST_ALL_NO_LIB <define>BOOST_FILESYSTEM_STATIC_LINK
-         ]
-         [ run libs/filesystem/test/convenience_test.cpp
-               <lib>../build/boost_filesystem
-               :  :  : <define>BOOST_ALL_NO_LIB <define>BOOST_FILESYSTEM_STATIC_LINK
-         ]
-         [ run libs/filesystem/test/large_file_support_test.cpp
-               <lib>../build/boost_filesystem
-               :  :  : <define>BOOST_ALL_NO_LIB <define>BOOST_FILESYSTEM_STATIC_LINK
-         ]
-         [ run libs/filesystem/test/wide_test.cpp
-               <lib>../build/boost_filesystem
-               :  :  : <define>BOOST_ALL_NO_LIB <define>BOOST_FILESYSTEM_STATIC_LINK
-         ]
-         [ compile libs/filesystem/example/mbcopy.cpp ]
-         [ compile libs/filesystem/example/mbpath.cpp ]
-         [ compile libs/filesystem/example/simple_ls.cpp ]
-       ;
-}

Modified: boost/trunk/libs/filesystem/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/filesystem/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/filesystem/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,12 @@
 # Boost Filesystem Library test Jamfile
 
-#  (C) Copyright Beman Dawes 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# (C) Copyright Beman Dawes 2002, 2006
 
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or www.boost.org/LICENSE_1_0.txt)
+
+# See library home page at http://www.boost.org/libs/filesystem
+
 project 
     : requirements <library>/boost/filesystem//boost_filesystem
       <define>BOOST_ALL_NO_LIB

Modified: boost/trunk/libs/foreach/doc/foreach.qbk
===================================================================
--- boost/trunk/libs/foreach/doc/foreach.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/foreach/doc/foreach.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -61,17 +61,21 @@
 [h2 Hello, world!]
 
 Below is a sample program that uses _foreach_ to loop over the contents of
-a null-terminated C-style string.
+a `std::string`.
 
+    #include <string>
     #include <iostream>
     #include <boost/foreach.hpp>
 
     int main()
     {
-        BOOST_FOREACH( char ch, "Hello, world!" )
+        std::string hello( "Hello, world!" );
+        
+        BOOST_FOREACH( char ch, hello )
         {
             std::cout << ch;
         }
+
         return 0;
     }
 
@@ -128,14 +132,14 @@
     int i = 0;
     BOOST_FOREACH( i, deque_int )
     {
-        if(i==0) return;
-        if(i==1) continue;
-        if(i==2) break;
+        if( i == 0 ) return;
+        if( i == 1 ) continue;
+        if( i == 2 ) break;
     }
 
 Iterate over a sequence by reference, and modify the underlying sequence:
 
-    short array_short[] = {1,2,3};
+    short array_short[] = { 1, 2, 3 };
     BOOST_FOREACH( short & i, array_short )
     {
         ++i;

Modified: boost/trunk/libs/foreach/index.html
===================================================================
--- boost/trunk/libs/foreach/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/foreach/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,5 +5,10 @@
 <body>
 Automatic redirection failed, please go to
 <a href="../../doc/html/foreach.html">../../doc/html/foreach.html</a>
+<p>Copyright&nbsp;Eric Niebler 2006</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying file
+<a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at
+<a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>).
+</p>
 </body>
 </html>

Deleted: boost/trunk/libs/foreach/test/Jamfile
===================================================================
--- boost/trunk/libs/foreach/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/foreach/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,34 +0,0 @@
-# foreach library test Jamfile
-
-# Copyright Eric Niebler 2004
-
-# Use, modification, and distribution is subject to the Boost Software
-# License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-
-subproject libs/foreach/test ;
-
-# bring in rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : foreach ;
-
-{
-    test-suite "foreach"
-       : [ run stl_byval.cpp ]
-         [ run stl_byref.cpp ]
-         [ run array_byval.cpp ]
-         [ run array_byref.cpp ]
-         [ run cstr_byval.cpp ]
-         [ run cstr_byref.cpp ]
-         [ run pair_byval.cpp ]
-         [ run pair_byref.cpp ]
-         [ run user_defined.cpp ]
-         [ run call_once.cpp ]
-         [ run rvalue_const.cpp ]
-         [ run rvalue_nonconst.cpp ]
-         [ run dependent_type.cpp ]
-         [ compile noncopyable.cpp ]
-       ;
-}

Deleted: boost/trunk/libs/format/Jamfile
===================================================================
--- boost/trunk/libs/format/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/format/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,15 +0,0 @@
-#  Boost.Bind Library test Jamfile
-#
-#  Copyright (c) 2003 Samuel Krempp
-#
-#  Permission to copy, use, modify, sell and distribute this software
-#  is granted provided this copyright notice appears in all copies.
-#  This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
-
-
-subproject libs/format ;
-
-# please order by name to ease maintenance
-subinclude libs/format/example ;
-subinclude libs/format/test ;

Deleted: boost/trunk/libs/format/benchmark/Jamfile
===================================================================
--- boost/trunk/libs/format/benchmark/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/format/benchmark/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,43 +0,0 @@
-#  Boost.Bind Library test Jamfile
-#
-#  Copyright (c) 2003 Samuel Krempp
-#
-#  Permission to copy, use, modify, sell and distribute this software
-#  is granted provided this copyright notice appears in all copies.
-#  This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
-
-subproject libs/format/benchmark ;
-
-
-
-#exe bench_format_overloads
-#    : bench_format.cpp
-#    : <include>$(BOOST_ROOT) <define>BOOST_FORMAT_OVERLOADS <define>BOOST_FORMAT_ONLY_BASICFMT
-#    ;
-
-#exe bench_format_basicfmt
-#    : bench_format.cpp
-#    : <include>$(BOOST_ROOT) <define>BOOST_FORMAT_ONLY_BASICFMT
-#    ;
-
-exe bench_format_no_locale
-    : bench_format.cpp
-    : <include>$(BOOST_ROOT) <define>BOOST_NO_STD_LOCALE
-    ;
-
-exe bench_format_normal
-    : bench_format.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe bench_format_no_reuse_stream
-    : bench_format.cpp
-    : <include>alts <include>$(BOOST_ROOT) <define>BOOST_FORMAT_NO_OSS_MEMBER
-    ;
-
-exe format_test
-    : format_test.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-

Modified: boost/trunk/libs/format/benchmark/bench_format.cpp
===================================================================
--- boost/trunk/libs/format/benchmark/bench_format.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/format/benchmark/bench_format.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
 //  Boost general library 'format'  ---------------------------
 //  See http://www.boost.org for updates, documentation, and revision history.
 
-//  (C) Samuel Krempp 2001
+//  Copyright (c) 2001 Samuel Krempp
 //                  krempp at crans.ens-cachan.fr
 //  Distributed under the Boost Software License, Version 1.0. (See
 //  accompanying file LICENSE_1_0.txt or copy at

Modified: boost/trunk/libs/format/benchmark/results.txt
===================================================================
--- boost/trunk/libs/format/benchmark/results.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/format/benchmark/results.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+// Copyright (c) 2001 Samuel Krempp
+//                  krempp at crans.ens-cachan.fr
+// Distributed under the Boost Software License, Version 1.0. (See accompany-
+// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 // This benchmark is provided purely for information.
 // It might not even compile as-is, 
 //   or not give any sensible results. 

Modified: boost/trunk/libs/format/doc/choices.html
===================================================================
--- boost/trunk/libs/format/doc/choices.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/format/doc/choices.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,258 +1,327 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
-<HTML><HEAD><TITLE>Type-safe 'printf-like' format class</TITLE>
-<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
-</HEAD>
-<BODY bgColor=#ffffff text=#000000>
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<H1><IMG align=center alt="boost.png (6897 bytes)" height=86 
-src="../../../boost.png" width=277>Type-safe 'printf-like' <B>format class</B> </H1>
-<H2>Choices made</H2>
+  <title>Type-safe 'printf-like' format class</title>
+</head>
 
-<p> "Le pourquoi du comment"  ( - "the why of the how") </p>
-<hr>
-<h3>The syntax of the format-string</h3>
-<p>
-Format is a new library. One of its goal is to provide a replacement for printf, 
-that means format can parse a format-string designed for printf, apply it to the given arguments,
-and produce the same result as printf would have.
-<br>With this constraint, there were roughly 3 possible choices for the syntax of the format-string :
-<ol>
-<li>Use the exact same syntax of printf. It's well known by many experienced users, 
-and fits almost all needs. But with C++ streams, the type-conversion character, crucial to determine
-the end of a directive, is only useful to set some associated formatting options, in a C++ streams
-context (%x for setting hexa, etc..)
-It would be better to make this obligatory type-conversion character, with modified meaning, optional.
-</li>
-<li>extend printf syntax while maintaining compatibility, by using characters and constructs 
-not yet valid as printf syntax. e.g. : "%1%", "%[1]", "%|1$d|", ..
-Using begin / end marks, all sort of extension can be considered.
-</li>
-<li>Provide a non-legacy mode, in parallel of the printf-compatible one, that can be
-designed to fit other objectives without constraints of compatibilty with the
-existing printf syntax. 
-<br>But Designing a replacement to printf's syntax, that would be clearly better, and as much powerful,
- is yet another task than building a format class.
- When such a syntax is designed, we should consider splitting Boost.format into 
- 2 separate libraries : one working hand in hand with this new syntax, and another 
-  supporting the legacy syntax (possibly a fast version, built with 
- safety improvement above snprintf or the like).
-</li>
-</ol>
+<body bgcolor="#FFFFFF" text="#000000">
+  <h1><img align="middle" alt="boost.png (6897 bytes)" height="86" src=
+  "../../../boost.png" width="277">Type-safe 'printf-like' <b>format
+  class</b></h1>
 
-In the absence of a full, clever, new syntax clearly better adapted to C++ streams than printf,
-the second approach was chosen. Boost.format uses printf's syntax, with extensions 
-(tabulations, centered alignements) that can be expressed using  extensions to this syntax.
-<br> And alternate compatible notations are provided to address the weaknesses of printf's :
-<ul>
-<li> <i>"%<b>N</b>%"</i> as a simpler positional, typeless and optionless notation. </li>
-<li> <i>%|spec|</i> as a way to encapsulate printf directive in movre visually evident structures,
-        at the same time making printf's 'type-conversion character' optional.
+  <h2>Choices made</h2>
 
-</ul>
-</p>
+  <p>"Le pourquoi du comment" ( - "the why of the how")</p>
+  <hr>
 
+  <h3>The syntax of the format-string</h3>
 
-<hr>
-<h3>Why are arguments passed through an operator rather than a function call ? </h3>
-<br>
-The inconvenience of the operator approach (for some people) 
-is that it might be confusing. It's a usual warning that too much 
-of overloading operators gets people real confused.
-<br>
-Since the use of format objects will be in specific contexts
-( most often right after a "cout << ")
- and look like a formatting string followed by arguments indeed : 
+  <p>Format is a new library. One of its goal is to provide a replacement for
+  printf, that means format can parse a format-string designed for printf,
+  apply it to the given arguments, and produce the same result as printf
+  would have.<br>
+  With this constraint, there were roughly 3 possible choices for the syntax
+  of the format-string :</p>
 
-<BLOCKQUOTE><PRE>
+  <ol>
+    <li>Use the exact same syntax of printf. It's well known by many
+    experienced users, and fits almost all needs. But with C++ streams, the
+    type-conversion character, crucial to determine the end of a directive,
+    is only useful to set some associated formatting options, in a C++
+    streams context (%x for setting hexa, etc..) It would be better to make
+    this obligatory type-conversion character, with modified meaning,
+    optional.</li>
+
+    <li>extend printf syntax while maintaining compatibility, by using
+    characters and constructs not yet valid as printf syntax. e.g. : "%1%",
+    "%[1]", "%|1$d|", .. Using begin / end marks, all sort of extension can
+    be considered.</li>
+
+    <li>Provide a non-legacy mode, in parallel of the printf-compatible one,
+    that can be designed to fit other objectives without constraints of
+    compatibilty with the existing printf syntax.<br>
+    But Designing a replacement to printf's syntax, that would be clearly
+    better, and as much powerful, is yet another task than building a format
+    class. When such a syntax is designed, we should consider splitting
+    Boost.format into 2 separate libraries : one working hand in hand with
+    this new syntax, and another supporting the legacy syntax (possibly a
+    fast version, built with safety improvement above snprintf or the
+    like).</li>
+  </ol>In the absence of a full, clever, new syntax clearly better adapted to
+  C++ streams than printf, the second approach was chosen. Boost.format uses
+  printf's syntax, with extensions (tabulations, centered alignements) that
+  can be expressed using extensions to this syntax.<br>
+  And alternate compatible notations are provided to address the weaknesses
+  of printf's :
+
+  <ul>
+    <li><i>"%<b>N</b>%"</i> as a simpler positional, typeless and optionless
+    notation.</li>
+
+    <li><i>%|spec|</i> as a way to encapsulate printf directive in movre
+    visually evident structures, at the same time making printf's
+    'type-conversion character' optional.</li>
+  </ul>
+  <hr>
+
+  <h3>Why are arguments passed through an operator rather than a function
+  call ?</h3><br>
+  The inconvenience of the operator approach (for some people) is that it
+  might be confusing. It's a usual warning that too much of overloading
+  operators gets people real confused.<br>
+  Since the use of format objects will be in specific contexts ( most often
+  right after a "cout &lt;&lt; ") and look like a formatting string followed
+  by arguments indeed :
+
+  <blockquote>
+    <pre>
 format(" %s at %s  with %s\n") % x % y % z;
-</PRE></BLOCKQUOTE>
-we can hope it wont confuse people that much.
-<p>
-An other fear about operators, is precedence problems.
-What if I someday write <b>format("%s") %  x+y </b>   
-<br>instead of <i>format("%s") %  (x+y)</i>    ??
-<br>
-It will make a mistake at compile-time, so the error will be immediately detected.
-<br>indeed, this line calls  <i>tmp = operator%( format("%s"), x)</i>
-<br> and then <i>operator+(tmp, y)</i>
-<br>tmp will be a format object, for which no implicit conversion is defined,
-and thus the call to operator+ will fail. (except if you define such an operator, of course).
-So you can safely assume precedence mistakes will be noticed at compilation.
-<p>
-<br>
-On the other hand, the function approach has a true inconvenience.
-It needs to define lots of template function like :
+</pre>
+  </blockquote>we can hope it wont confuse people that much.
 
-<BLOCKQUOTE><PRE>
+  <p>An other fear about operators, is precedence problems. What if I someday
+  write <b>format("%s") % x+y</b><br>
+  instead of <i>format("%s") % (x+y)</i> ??<br>
+  It will make a mistake at compile-time, so the error will be immediately
+  detected.<br>
+  indeed, this line calls <i>tmp = operator%( format("%s"), x)</i><br>
+  and then <i>operator+(tmp, y)</i><br>
+  tmp will be a format object, for which no implicit conversion is defined,
+  and thus the call to operator+ will fail. (except if you define such an
+  operator, of course). So you can safely assume precedence mistakes will be
+  noticed at compilation.</p>
+
+  <p><br>
+  On the other hand, the function approach has a true inconvenience. It needs
+  to define lots of template function like :</p>
+
+  <blockquote>
+    <pre>
 template &lt;class T1, class T2,  .., class TN&gt; 
-string format(string s,  const T1& x1, .... , const T1& xN);
+string format(string s,  const T1&amp; x1, .... , const T1&amp; xN);
 
-</PRE></BLOCKQUOTE>
+</pre>
+  </blockquote>and even if we define those for N up to 500, that is still a
+  limitation, that C's printf does not have.<br>
+  Also, since format somehow emulates printf in some cases, but is far from
+  being fully equivalent to printf, it's best to use a radically different
+  appearance, and using operator calls succeeds very well in that !
 
-and even if we define those for N up to 500, that is still a limitation, that
-C's printf does not have.
-<br>
-Also, since format somehow emulates printf in some cases, but is far from being 
-fully equivalent to printf, it's best to use a radically different appearance, 
-and using operator calls succeeds very well in that ! 
+  <p><br>
+  Anyhow, if we actually chose the formal function call templates system, it
+  would only be able to print Classes T for which there is an</p>
 
-</p>
-<p>
-<br>
-Anyhow, if we actually chose the formal function call templates system,
-it would only be able to print Classes T for which there is an 
-<BLOCKQUOTE><PRE>operator<< ( stream,   const T&)</PRE></BLOCKQUOTE>
-Because allowing both const and non const produces  a combinatorics explosion -
- if we go up to 10 arguments, we need 2^10 functions.
-<br>(providing overloads on T& / const T&  is  at the frontier of defects of the C++
-standard, and thus is far from guaranteed to be supported. But right now several compilers
-support those overloads)
-<br>
-There is a lot of chances that a class which only provides the non-const 
-equivalent is badly designed, but yet it is another unjustified 
-restriction to the user.
-<br>Also, some manipulators are functions, and can not be passed as const references.
-The function call approach thus does not support manipulators well.
-</p>
+  <blockquote>
+    <pre>
+operator&lt;&lt; ( stream,   const T&amp;)
+</pre>
+  </blockquote>Because allowing both const and non const produces a
+  combinatorics explosion - if we go up to 10 arguments, we need 2^10
+  functions.<br>
+  (providing overloads on T&amp; / const T&amp; is at the frontier of defects
+  of the C++ standard, and thus is far from guaranteed to be supported. But
+  right now several compilers support those overloads)<br>
+  There is a lot of chances that a class which only provides the non-const
+  equivalent is badly designed, but yet it is another unjustified restriction
+  to the user.<br>
+  Also, some manipulators are functions, and can not be passed as const
+  references. The function call approach thus does not support manipulators
+  well.
 
-<p>
-In conclusion, using a dedicated binary operator is the simplest, most robust, 
-and least restrictive mechanism to pass arguments
-when you can't know the number of arguments at compile-time.
+  <p>In conclusion, using a dedicated binary operator is the simplest, most
+  robust, and least restrictive mechanism to pass arguments when you can't
+  know the number of arguments at compile-time.</p>
+  <hr>
 
-<hr>
-<h3>Why operator% rather than a member function 'with(..)'  ??</h3>
-technically, 
-<BLOCKQUOTE><PRE>format(fstr) % x1 % x2 % x3;</PRE></BLOCKQUOTE>
-has the same structure as
-<BLOCKQUOTE><PRE>format(fstr).with( x1 ).with( x2 ).with( x3 );</PRE></BLOCKQUOTE>
+  <h3>Why operator% rather than a member function 'with(..)'
+  ??</h3>technically,
 
-which does not have any precedence problem.
-The only drawback, is it's harder for the eye to catch what is done in this line,
-than when we are using operators.
-calling .with(..), it looks just like any other line of code. 
+  <blockquote>
+    <pre>
+format(fstr) % x1 % x2 % x3;
+</pre>
+  </blockquote>has the same structure as
 
-So it may be a better solution, depending on tastes.
-The extra characters, and overall cluttered aspect of the line of code using 'with(..)' 
-were enough for me to opt for a true operator.
+  <blockquote>
+    <pre>
+format(fstr).with( x1 ).with( x2 ).with( x3 );
+</pre>
+  </blockquote>which does not have any precedence problem. The only drawback,
+  is it's harder for the eye to catch what is done in this line, than when we
+  are using operators. calling .with(..), it looks just like any other line
+  of code. So it may be a better solution, depending on tastes. The extra
+  characters, and overall cluttered aspect of the line of code using
+  'with(..)' were enough for me to opt for a true operator.
+  <hr>
 
-<hr>
-<h3>Why operator% rather than usual formatting operator<<  ??</h3>
-<ul>
-<li>
- because   passing arguments to a format object is *not* the same as sending variables, sequentially, into a stream, and because a format object is not a stream, nor a manipulator.
-<br>
-We use an operator to pass arguments. format will use them as a function would, it simply takes arguments one by one.
+  <h3>Why operator% rather than usual formatting operator&lt;&lt; ??</h3>
 
-<br>
-format objects can not provide stream-like behaviour. When you try to implement a format object that acts like a manipulator, returning a stream, you make the user beleive it is completely like a 
-stream-manipulator. And sooner or later, the user is deceived by this point of view.
-<br> The most obvious example of that difference in behaviour is 
-<BLOCKQUOTE><PRE>
-cout << format("%s %s ") << x;
-cout << y ;  // uh-oh, format is not really a stream manipulator
-</PRE></BLOCKQUOTE>
-</li>
-<li> precedence of % is higher than that of <<. 
-It can be viewd as a problem, because + and - thus needs to be grouped inside parentheses, while it is not necessary with '<<'.
-But if the user forgets, the mistake is catched at compilation, and hopefully he won't forget
-again.
-<br>
-On the other hand, the higher precedence makes format's behaviour very straight-forward.
-<BLOCKQUOTE><PRE>
-cout << format("%s %s ") % x % y << endl;
-</PRE></BLOCKQUOTE>
-is treated exaclt like :
-<BLOCKQUOTE><PRE>
-cout << ( format("%s %s ") % x % y ) << endl;
-</PRE></BLOCKQUOTE>
-So using %, the life of a format object does not interfere with the surrounding stream context.
-This is the simplest possible behaviour, and thus the user is able to continue using the stream
-after the format object.
-<br>
-<br>
-With operator<<, things are much more problematic in this situation. This line :
-<BLOCKQUOTE><PRE>
-cout << format("%s %s ") <<  x  <<  y << endl;
-</PRE></BLOCKQUOTE>
-is understood as :
-<BLOCKQUOTE><PRE>
-( ( ( cout << format("%s %s ") ) << x ) <<  y ) << endl;
-</PRE></BLOCKQUOTE>
-Several alternative implementations chose operator<<, and there is only one way to make it work :
-<br>
-the first call to <BLOCKQUOTE><PRE>operator<<( ostream&, format const&)</PRE></BLOCKQUOTE>
-returns a proxy, encapsulating both the 
-final destination (cout) and the format-string information
-<br>
-Passing arguments to format, or to the final destination after completion of the format are 
-indistinguishable. This is a problem.
-<p>
-I examined several possible implementations, and none is completely satsifying.
-<br>
-E.g. : In order to catch users mistake, it makes sense to raise exceptions when the user passes too many arguments. But in this context, supplementary arguments are most certainly aimed at the final destination.
-There are several choices here :
-<ul>
-<li> You can give-up detection of arity excess, and have the proxy's  template member operator<<( const T&)  
-simply forward all supplementary arguments to cout. 
-</li> 
-<li>Require the user to close the format arguments with a special manipulator, 'endf', in this way :
-<BLOCKQUOTE><PRE>
-cout << format("%s %s ") <<  x  <<  y << endf << endl;
-</PRE></BLOCKQUOTE>
-You can define endf to be a function that returns the final destination stored inside the proxy.
-Then it's okay, after endf the user is calling << on cout again.
-</li>
-<li>An intermediate solution, is to adress the most frequent use, where the user simply wants to 
-output one more manipulator item to cout (a std::flush, or endl, ..)
-<BLOCKQUOTE><PRE>
-cout << format("%s %s \n") <<  x  <<  y << flush ;
-</PRE></BLOCKQUOTE>
-Then, the solution is to overload the operator<< for manipulators.
-This way You don't need endf, but outputting a non-manipulator item right after the format
-arguments is a mistake.
-</li>
-</ul>
-<br>
-The most complete solution is the one with the endf manipualtor. 
-With operator%, there is no need for this end-format function, plus you instantly see which arguments are going into the format object, and which are going to the stream.
-</p>
+  <ul>
+    <li>because passing arguments to a format object is *not* the same as
+    sending variables, sequentially, into a stream, and because a format
+    object is not a stream, nor a manipulator.<br>
+      We use an operator to pass arguments. format will use them as a
+      function would, it simply takes arguments one by one.<br>
+      format objects can not provide stream-like behaviour. When you try to
+      implement a format object that acts like a manipulator, returning a
+      stream, you make the user beleive it is completely like a
+      stream-manipulator. And sooner or later, the user is deceived by this
+      point of view.<br>
+      The most obvious example of that difference in behaviour is
 
-</li>
-<li> Esthetically : '%' is the same letter as used inside the format-string. That is quite
-nice to have the same letter used for passing each argument.
-'<<' is 2 letters, '%' is one.  '%' is also smaller in size.
-  It overall improves visualisation (we see  what goes with what) :
-<BLOCKQUOTE><PRE>cout << format("%s %s %s") %x %y %z << "And  avg is" << format("%s\n") %avg;
-</PRE></BLOCKQUOTE>
-  compared to :
-<BLOCKQUOTE><PRE>cout << format("%s %s %s") << x << y << z << endf <<"And avg is" << format("%s\n") << avg;
-</PRE></BLOCKQUOTE>
-    "<<" misleadingly puts the arguments at the same level as any object passed to the stream.
-</li>
-<li> python also uses % for formatting, so you see it's not so "unheard of"  
-  ;-)
-</li></ul>
+      <blockquote>
+        <pre>
+cout &lt;&lt; format("%s %s ") &lt;&lt; x;
+cout &lt;&lt; y ;  // uh-oh, format is not really a stream manipulator
+</pre>
+      </blockquote>
+    </li>
 
-<hr>
-<h3>Why operator% rather than operator(), or operator[]  ??</h3>
+    <li>precedence of % is higher than that of &lt;&lt;. It can be viewd as a
+    problem, because + and - thus needs to be grouped inside parentheses,
+    while it is not necessary with '&lt;&lt;'. But if the user forgets, the
+    mistake is catched at compilation, and hopefully he won't forget
+    again.<br>
+      On the other hand, the higher precedence makes format's behaviour very
+      straight-forward.
 
-<p>
-operator() has the merit of being the natural way to send an argument into a function.
-And some think that operator[] 's meaning apply well to the usage in format.
-<br>They're as  good as operator% technically, but quite ugly. (that's a matter of taste)
-<br> And deepd down, using operator% for passing arguments that were referred to by "%" in the
-format string seems much more natural to me than using those operators.
+      <blockquote>
+        <pre>
+cout &lt;&lt; format("%s %s ") % x % y &lt;&lt; endl;
+</pre>
+      </blockquote>is treated exaclt like :
 
+      <blockquote>
+        <pre>
+cout &lt;&lt; ( format("%s %s ") % x % y ) &lt;&lt; endl;
+</pre>
+      </blockquote>So using %, the life of a format object does not interfere
+      with the surrounding stream context. This is the simplest possible
+      behaviour, and thus the user is able to continue using the stream after
+      the format object.<br>
+      <br>
+      With operator&lt;&lt;, things are much more problematic in this
+      situation. This line :
 
- 
+      <blockquote>
+        <pre>
+cout &lt;&lt; format("%s %s ") &lt;&lt;  x  &lt;&lt;  y &lt;&lt; endl;
+</pre>
+      </blockquote>is understood as :
 
-<hr>
-<P>July 07, 2001</P>
-<P>© Copyright Samuel Krempp 2001. Permission to copy, use, modify, sell and 
-distribute this document is granted provided this copyright notice appears in 
-all copies. This document is provided "as is" without express or implied 
-warranty, and with no claim as to its suitability for any purpose.</P>
-<P></P>
-<P>&nbsp;</P></BODY></HTML>
+      <blockquote>
+        <pre>
+( ( ( cout &lt;&lt; format("%s %s ") ) &lt;&lt; x ) &lt;&lt;  y ) &lt;&lt; endl;
+</pre>
+      </blockquote>Several alternative implementations chose
+      operator&lt;&lt;, and there is only one way to make it work :<br>
+      the first call to
+
+      <blockquote>
+        <pre>
+operator&lt;&lt;( ostream&amp;, format const&amp;)
+</pre>
+      </blockquote>returns a proxy, encapsulating both the final destination
+      (cout) and the format-string information<br>
+      Passing arguments to format, or to the final destination after
+      completion of the format are indistinguishable. This is a problem.
+
+      <p>I examined several possible implementations, and none is completely
+      satsifying.<br>
+      E.g. : In order to catch users mistake, it makes sense to raise
+      exceptions when the user passes too many arguments. But in this
+      context, supplementary arguments are most certainly aimed at the final
+      destination. There are several choices here :</p>
+
+      <ul>
+        <li>You can give-up detection of arity excess, and have the proxy's
+        template member operator&lt;&lt;( const T&amp;) simply forward all
+        supplementary arguments to cout.</li>
+
+        <li>Require the user to close the format arguments with a special
+        manipulator, 'endf', in this way :
+
+          <blockquote>
+            <pre>
+cout &lt;&lt; format("%s %s ") &lt;&lt;  x  &lt;&lt;  y &lt;&lt; endf &lt;&lt; endl;
+</pre>
+          </blockquote>You can define endf to be a function that returns the
+          final destination stored inside the proxy. Then it's okay, after
+          endf the user is calling &lt;&lt; on cout again.
+        </li>
+
+        <li>An intermediate solution, is to adress the most frequent use,
+        where the user simply wants to output one more manipulator item to
+        cout (a std::flush, or endl, ..)
+
+          <blockquote>
+            <pre>
+cout &lt;&lt; format("%s %s \n") &lt;&lt;  x  &lt;&lt;  y &lt;&lt; flush ;
+</pre>
+          </blockquote>Then, the solution is to overload the operator&lt;&lt;
+          for manipulators. This way You don't need endf, but outputting a
+          non-manipulator item right after the format arguments is a mistake.
+        </li>
+      </ul><br>
+      The most complete solution is the one with the endf manipualtor. With
+      operator%, there is no need for this end-format function, plus you
+      instantly see which arguments are going into the format object, and
+      which are going to the stream.
+    </li>
+
+    <li>Esthetically : '%' is the same letter as used inside the
+    format-string. That is quite nice to have the same letter used for
+    passing each argument. '&lt;&lt;' is 2 letters, '%' is one. '%' is also
+    smaller in size. It overall improves visualisation (we see what goes with
+    what) :
+
+      <blockquote>
+        <pre>
+cout &lt;&lt; format("%s %s %s") %x %y %z &lt;&lt; "And  avg is" &lt;&lt; format("%s\n") %avg;
+</pre>
+      </blockquote>compared to :
+
+      <blockquote>
+        <pre>
+cout &lt;&lt; format("%s %s %s") &lt;&lt; x &lt;&lt; y &lt;&lt; z &lt;&lt; endf &lt;&lt;"And avg is" &lt;&lt; format("%s\n") &lt;&lt; avg;
+</pre>
+      </blockquote>"&lt;&lt;" misleadingly puts the arguments at the same
+      level as any object passed to the stream.
+    </li>
+
+    <li>python also uses % for formatting, so you see it's not so "unheard
+    of" ;-)</li>
+  </ul>
+  <hr>
+
+  <h3>Why operator% rather than operator(), or operator[] ??</h3>
+
+  <p>operator() has the merit of being the natural way to send an argument
+  into a function. And some think that operator[] 's meaning apply well to
+  the usage in format.<br>
+  They're as good as operator% technically, but quite ugly. (that's a matter
+  of taste)<br>
+  And deepd down, using operator% for passing arguments that were referred to
+  by "%" in the format string seems much more natural to me than using those
+  operators.</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->02 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38510" --></p>
+
+  <p><i>Copyright &copy; 2001 Samuel Krempp</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/format/doc/format.html
===================================================================
--- boost/trunk/libs/format/doc/format.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/format/doc/format.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,78 +1,112 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
-<HTML><HEAD><TITLE>The Boost Format library</TITLE>
-<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
-</HEAD>
-<BODY bgColor=white text=black>
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<H1><IMG align=middle alt="boost.png (6897 bytes)" height=86 
-src="../../../boost.png" width=277>The Boost Format library</H1>
-<P>The <CODE>
-<A href="../../../boost/format.hpp">&lt;boost/format.hpp&gt;</A></CODE> 
-format class provides printf-like formatting, in a type-safe manner which allows output of 
-user-defined types. 
-<br>
-</P>
-<ul>
-<li><a href="#synopsis">Synopsis</a> </li>
-<li><a href="#how_it_works">How it works</a> </li>
-<li><a href="#examples">Examples</a> </li>
-<li><a href="#syntax">Syntax</a> 
-        <ul>
-          <li><a href="#printf_directives">printf format-specification syntax</a> </li>
-          <li><a href="#printf_differences">Incompatibilities with printf</a> </li>
-        </ul>
-</li>
-<li><a href="#manipulators">Manipulators and the internal stream state</a> </li>
-<li><a href="#user-defined">User-defined types</a> </li>
-<li><a href="#alternatives">Alternatives</a></li>
-<li><a href="#exceptions">Exceptions</a></li>
-<li><a href="#performance">Performance</a></li>
-<li><a href="#extract">Class Interface Extract</a></li>
-<li><a href="#rationale">Rationale</a> </li>
-</ul>
-<a name="synopsis"></a>
-<hr>
-<H2>Synopsis</H2>
-<P>A format object is constructed from a format-string, and is then given arguments through 
-repeated calls to <i>operator%</i>.
-<br>
-Each of those arguments are then converted to strings, who are in turn  combined into one string,
- according to the format-string.
-</P>
-<BLOCKQUOTE><PRE>
-cout << boost::format("writing %1%,  x=%2% : %3%-th try") % "toto" % 40.23 % 50; 
+  <title>The Boost Format library</title>
+</head>
+
+<body bgcolor="white" text="black">
+  <h1><img align="middle" alt="boost.png (6897 bytes)" height="86" src=
+  "../../../boost.png" width="277">The Boost Format library</h1>
+
+  <p>The <code><a href=
+  "../../../boost/format.hpp">&lt;boost/format.hpp&gt;</a></code> format
+  class provides printf-like formatting, in a type-safe manner which allows
+  output of user-defined types.<br></p>
+
+  <ul>
+    <li><a href="#synopsis">Synopsis</a></li>
+
+    <li><a href="#how_it_works">How it works</a></li>
+
+    <li><a href="#examples">Examples</a></li>
+
+    <li>
+      <a href="#syntax">Syntax</a>
+
+      <ul>
+        <li><a href="#printf_directives">printf format-specification
+        syntax</a></li>
+
+        <li><a href="#printf_differences">Incompatibilities with
+        printf</a></li>
+      </ul>
+    </li>
+
+    <li><a href="#manipulators">Manipulators and the internal stream
+    state</a></li>
+
+    <li><a href="#user-defined">User-defined types</a></li>
+
+    <li><a href="#alternatives">Alternatives</a></li>
+
+    <li><a href="#exceptions">Exceptions</a></li>
+
+    <li><a href="#performance">Performance</a></li>
+
+    <li><a href="#extract">Class Interface Extract</a></li>
+
+    <li><a href="#rationale">Rationale</a></li>
+  </ul><a name="synopsis" id="synopsis"></a>
+  <hr>
+
+  <h2>Synopsis</h2>
+
+  <p>A format object is constructed from a format-string, and is then given
+  arguments through repeated calls to <i>operator%</i>.<br>
+  Each of those arguments are then converted to strings, who are in turn
+  combined into one string, according to the format-string.</p>
+
+  <blockquote>
+    <pre>
+cout &lt;&lt; boost::format("writing %1%,  x=%2% : %3%-th try") % "toto" % 40.23 % 50; 
      // prints "writing toto,  x=40.230 : 50-th try"
-</PRE></BLOCKQUOTE>
+</pre>
+  </blockquote><a name="how_it_works" id="how_it_works"></a>
+  <hr>
 
-<a name="how_it_works"></a>
-<hr>
-<H2>How it works</H2>
-<ol>
-<li>When you call <i>format(s)</i>, where s is the format-string, it constructs an object,
-which parses the format string and look for all directives in it and prepares internal structures
-for the next step.</li>
-<li>
-Then, either immediately,
-as in <BLOCKQUOTE><PRE>cout << format("%2% %1%") % 36 % 77 )</PRE></BLOCKQUOTE>
-or later on, as in 
-<BLOCKQUOTE><PRE>format fmter("%2% %1%");
-fmter % 36; fmter % 77;</PRE></BLOCKQUOTE> 
-you <i>feed</i> variables into the formatter. 
-<br>those variables are dumped into an internal stream, 
-which state is set according to the given formatting options in the format-string 
--if there are any-, 
-and the format object stores the string results for the last step.
-</li>
-<li>Once all arguments have been fed  you can dump the format object to a stream, 
-or get its string value by using the 
-<i>str()</i> member function, or the free function <i>str(const format& )</i> in namespace <i>boost</i>. The result string stays accessible in the format object until another argument is passed,
-at which time it is reinitialised.
+  <h2>How it works</h2>
 
-<BLOCKQUOTE><PRE>
+  <ol>
+    <li>When you call <i>format(s)</i>, where s is the format-string, it
+    constructs an object, which parses the format string and look for all
+    directives in it and prepares internal structures for the next step.</li>
 
+    <li>Then, either immediately, as in
+
+      <blockquote>
+        <pre>
+cout &lt;&lt; format("%2% %1%") % 36 % 77 )
+</pre>
+      </blockquote>or later on, as in
+
+      <blockquote>
+        <pre>
+format fmter("%2% %1%");
+fmter % 36; fmter % 77;
+</pre>
+      </blockquote>you <i>feed</i> variables into the formatter.<br>
+      those variables are dumped into an internal stream, which state is set
+      according to the given formatting options in the format-string -if
+      there are any-, and the format object stores the string results for the
+      last step.
+    </li>
+
+    <li>Once all arguments have been fed you can dump the format object to a
+    stream, or get its string value by using the <i>str()</i> member
+    function, or the free function <i>str(const format&amp; )</i> in
+    namespace <i>boost</i>. The result string stays accessible in the format
+    object until another argument is passed, at which time it is
+    reinitialised.
+
+      <blockquote>
+        <pre>
+
 // fmter was previously created and fed arguments, it can print the result :
-cout << fmter ;  
+cout &lt;&lt; fmter ;  
 
 // You can take the string result :
 string s  = fmter.str();
@@ -81,670 +115,792 @@
 s = fmter.str( );
 
 // You can also do all steps at once :
-cout << boost::format("%2% %1%") % 36 % 77; 
+cout &lt;&lt; boost::format("%2% %1%") % 36 % 77; 
 
 // using the str free function :
 string s2 = str( format("%2% %1%") % 36 % 77 );
 
-</PRE></BLOCKQUOTE>
-</li>
-<li>
-Optionnally, after step 3, you can re-use a format object and restart at step2 :
-<i>fmter % 18 % 39; </i>
-<br> to format new variables with  the same format-string, saving the expensive processing
-involved at step 1.
-</li>
-</ol>
-All in all, the format class translates a format-string  (with eventually printf-like directives)
-into operations on an internal stream, and finally returns the result of the formatting,
-as a string, or directly into an output stream.
+</pre>
+      </blockquote>
+    </li>
 
-<a name="examples"></a>
-<hr>
-<H2>Examples</H2>
+    <li>Optionnally, after step 3, you can re-use a format object and restart
+    at step2 : <i>fmter % 18 % 39;</i><br>
+    to format new variables with the same format-string, saving the expensive
+    processing involved at step 1.</li>
+  </ol>All in all, the format class translates a format-string (with
+  eventually printf-like directives) into operations on an internal stream,
+  and finally returns the result of the formatting, as a string, or directly
+  into an output stream. <a name="examples" id="examples"></a>
+  <hr>
 
-<BLOCKQUOTE><PRE>
+  <h2>Examples</h2>
+
+  <blockquote>
+    <pre>
 using namespace std;
 using boost::format;
 using boost::io::group;
-</PRE></BLOCKQUOTE>
-<ul>
-<li> Simple output, with reordering :
-<BLOCKQUOTE><PRE>
+</pre>
+  </blockquote>
 
-cout << format("%1% %2% %3% %2% %1% \n") % "11" % "22" % "333"; // 'simple' style.
+  <ul>
+    <li>Simple output, with reordering :
 
-</PRE></BLOCKQUOTE>
-        It   prints : "11 22 333 22 11 \n"
-</li>
+      <blockquote>
+        <pre>
 
-<li> More precise formatting, with Posix-printf positional directives :
-<BLOCKQUOTE><PRE>
+cout &lt;&lt; format("%1% %2% %3% %2% %1% \n") % "11" % "22" % "333"; // 'simple' style.
 
-cout << format("(x,y) = (%1$+5d,%2$+5d) \n") % -23 % 35;     // Posix-Printf style
+</pre>
+      </blockquote>It prints : "11 22 333 22 11 \n"
+    </li>
 
-</PRE></BLOCKQUOTE>
-        It prints : "(x,y) = (  -23,  +35) \n"
-</li>
+    <li>More precise formatting, with Posix-printf positional directives :
 
-<li> classical printf directive, no reordering :
-<BLOCKQUOTE><PRE>
+      <blockquote>
+        <pre>
 
-cout << format("writing %s,  x=%s : %d-th step \n") % "toto" % 40.23 % 50; 
+cout &lt;&lt; format("(x,y) = (%1$+5d,%2$+5d) \n") % -23 % 35;     // Posix-Printf style
 
-</PRE></BLOCKQUOTE>
-        It prints : "writing toto,  x=40.23 : 50-th step \n"
-</li>
+</pre>
+      </blockquote>It prints : "(x,y) = ( -23, +35) \n"
+    </li>
 
-<li> Several ways to express the same thing :
-<BLOCKQUOTE><PRE>
+    <li>classical printf directive, no reordering :
 
-cout << format("(x,y) = (%+5d,%+5d) \n") % -23 % 35;
-cout << format("(x,y) = (%|+5|,%|+5|) \n") % -23 % 35;
+      <blockquote>
+        <pre>
 
-cout << format("(x,y) = (%1$+5d,%2$+5d) \n") % -23 % 35;
-cout << format("(x,y) = (%|1$+5|,%|2$+5|) \n") % -23 % 35;
+cout &lt;&lt; format("writing %s,  x=%s : %d-th step \n") % "toto" % 40.23 % 50; 
 
-</PRE></BLOCKQUOTE>
-        all those print :  "(x,y) = (  -23,  +35) \n"
+</pre>
+      </blockquote>It prints : "writing toto, x=40.23 : 50-th step \n"
+    </li>
 
-</li>
+    <li>Several ways to express the same thing :
 
-<li> Using manipulators to modify the format-string :
-<BLOCKQUOTE><PRE>
+      <blockquote>
+        <pre>
 
+cout &lt;&lt; format("(x,y) = (%+5d,%+5d) \n") % -23 % 35;
+cout &lt;&lt; format("(x,y) = (%|+5|,%|+5|) \n") % -23 % 35;
+
+cout &lt;&lt; format("(x,y) = (%1$+5d,%2$+5d) \n") % -23 % 35;
+cout &lt;&lt; format("(x,y) = (%|1$+5|,%|2$+5|) \n") % -23 % 35;
+
+</pre>
+      </blockquote>all those print : "(x,y) = ( -23, +35) \n"
+    </li>
+
+    <li>Using manipulators to modify the format-string :
+
+      <blockquote>
+        <pre>
+
 format fmter("_%1$+5d_ %1$d \n");
 
 format fmter2("_%1%_ %1% \n");
 fmter2.modify_item(1, group(showpos, setw(5)) ); 
 
-cout << fmter % 101 ;
-cout << fmter2 % 101 ;
+cout &lt;&lt; fmter % 101 ;
+cout &lt;&lt; fmter2 % 101 ;
 
-</PRE></BLOCKQUOTE>
-        Both print the same : "_ +101_ 101 \n"
-</li>
+</pre>
+      </blockquote>Both print the same : "_ +101_ 101 \n"
+    </li>
 
-<li> Using manipulators with arguments :
-<BLOCKQUOTE><PRE>
+    <li>Using manipulators with arguments :
 
-cout << format("_%1%_ %1% \n") % group(showpos, setw(5), 101);
+      <blockquote>
+        <pre>
 
-</PRE></BLOCKQUOTE>
-        The manipulators are applied at each occurence of %1%, and thus it prints : "_ +101_  +101 \n"
-</li>
+cout &lt;&lt; format("_%1%_ %1% \n") % group(showpos, setw(5), 101);
 
-<li> New formatting feature : 'absolute tabulations', useful inside loops, 
-to insure a field is printed at the same position from one line to the next, 
-even if the widthes of the previous arguments can vary a lot.
+</pre>
+      </blockquote>The manipulators are applied at each occurence of %1%, and
+      thus it prints : "_ +101_ +101 \n"
+    </li>
 
-<BLOCKQUOTE><PRE>
+    <li>New formatting feature : 'absolute tabulations', useful inside loops,
+    to insure a field is printed at the same position from one line to the
+    next, even if the widthes of the previous arguments can vary a lot.
 
-for(unsigned int i=0; i < names.size(); ++i)
-    cout << format("%1%, %2%, %|40t|%3%\n") % names[i] % surname[i] % tel[i];
+      <blockquote>
+        <pre>
 
-</PRE></BLOCKQUOTE>
+for(unsigned int i=0; i &lt; names.size(); ++i)
+    cout &lt;&lt; format("%1%, %2%, %|40t|%3%\n") % names[i] % surname[i] % tel[i];
 
-For some std::vector <i>names</i>, <i>surnames</i>, and <i>tel</i> (see sample_new_features.cpp) it prints :
-<BLOCKQUOTE><PRE>
-Marc-François Michel, Durand,           +33 (0) 123 456 789
+</pre>
+      </blockquote>For some std::vector <i>names</i>, <i>surnames</i>, and
+      <i>tel</i> (see sample_new_features.cpp) it prints :
+
+      <blockquote>
+        <pre>
+Marc-Fran&ccedil;ois Michel, Durand,           +33 (0) 123 456 789
 Jean, de Lattre de Tassigny,            +33 (0) 987 654 321
-</PRE></BLOCKQUOTE>
+</pre>
+      </blockquote>
+    </li>
+  </ul>
+  <hr>
 
+  <h2>Sample Files</h2>
 
-</li>
+  <p>The program <a href=
+  "../example/sample_formats.cpp">sample_formats.cpp</a> demonstrates simple
+  uses of <b>format</b>.<br></p>
 
-</ul>
+  <p><a href="../example/sample_new_features.cpp">sample_new_features.cpp</a>
+  illustrates the few formatting features that were added to printf's syntax
+  such as simple positional directives, centered alignment, and
+  'tabulations'.<br></p>
 
-<hr>
-<H2>Sample Files</H2>
-<P>The program <A href="../example/sample_formats.cpp">sample_formats.cpp</A> 
- demonstrates simple uses of <B>format</B>.
-<br>
-<P><A href="../example/sample_new_features.cpp">sample_new_features.cpp</A> 
- illustrates the few formatting features that were added to printf's syntax such as
- simple positional directives, centered alignment, and 'tabulations'.
-<br>
-<P><A href="../example/sample_advanced.cpp">sample_advanced.cpp</A> 
- demonstrates uses of advanced features, like reusing, and modifying, format objects, etc.. 
-<br>
-<P>And <A href="../example/sample_userType.cpp">sample_userType.cpp</A> 
-shows the behaviour of the <b>format</b> library on user-defined types.
-</P>
+  <p><a href="../example/sample_advanced.cpp">sample_advanced.cpp</a>
+  demonstrates uses of advanced features, like reusing, and modifying, format
+  objects, etc..<br></p>
 
+  <p>And <a href="../example/sample_userType.cpp">sample_userType.cpp</a>
+  shows the behaviour of the <b>format</b> library on user-defined
+  types.</p><a name="syntax" id="syntax"></a>
+  <hr>
 
-<a name="syntax"></a>
-<hr>
-<H2>Syntax</H2>
-<P>
-<b>boost::format( </b> format-string <b> ) %</b> arg1 <b>%</b> arg2 <b>%</b> ... <b>%</b> argN
+  <h2>Syntax</h2>
 
-</P>
+  <p><b>boost::format(</b> format-string <b>) %</b> arg1 <b>%</b> arg2
+  <b>%</b> ... <b>%</b> argN</p>
 
-<P>
-The <i>format-string</i> contains text in which special directives will be replaced by 
-strings resulting from the formatting of the given arguments.
-<br>The legacy syntax in the C and C++ worlds is the one used by printf, and thus format can use 
-directly printf format-strings, and produce the same result (in almost all cases. see 
-<a href="#printf_differences">Incompatibilities with printf</a> for details)
-<br>
-This core syntax was extended, to allow new features, but also to adapt to the C++ streams context.
-Thus, format accepts several forms of directives in format-strings :
-<UL>
-<li> Legacy printf format strings : <B>%</B><i>spec</i><b></b> where <i>spec</i> is a 
-	<a href="#printf_directives">printf format specification</a>
-	<br><i>spec</i> passes formatting options, like width, alignment, numerical base used for
-        formatting numbers,
-	as well as other specific flags.
-	But the classical <i>type-specification</i> flag of printf has a weaker meaning
-	in format. It merely sets the appropriate flags on the internal stream,
-	and/or formatting parameters, 
-	but does not require the corresponding argument to be of a specific type.
-	<br>
-	e.g. : the specification <i>2$x</i>, 
-	meaning "print argument number 2, which  is an integral number, in hexa" 	for printf,
-	merely means "print argument 2 with stream basefield flags set to <i>hex</i>" for format.
-</li>        
-<li><B>%|</B><i>spec</i><b>|</b> where <i>spec</i> is a printf format specification.
-        <br>
-        The brackets are introduced, to improve the readability of the format-string,
-        but primarily, to make the <i>type-conversion character</i> optional
-        in <i>spec</i>. This information is not necessary with C++ variables,
-        but with direct printf syntax, it is necessary to always give a type-conversion character,
-        merely because this character is crucial to determine the end of a format-specification.
-        <br>
-        e.g. : "%|-5|" will format the next variable with width set to 5, and left-alignment
-        just like the following printf directives : "%-5g", "%-5f", "%-5s" ..
-</li>	
-<li> <b>%</b><i>N</i><b>%</b>  <br>This simple positional notation
-        requests the formatting of the <i>N</i>-th argument - wihout any formatting option.
-        <br>
-        (It's merely a shortcut to Printf's positional directives (like "%<i>N</i>$s"),
-        but a major benefit is that it's much more readable, and 
-        does not use a "type-conversion" character)
-</li>
-</UL>
-    On top of the standard printf format specifications, new features were implemented, like centered alignment. See <a href="#new_directives">new format specification</a> for details.
+  <p>The <i>format-string</i> contains text in which special directives will
+  be replaced by strings resulting from the formatting of the given
+  arguments.<br>
+  The legacy syntax in the C and C++ worlds is the one used by printf, and
+  thus format can use directly printf format-strings, and produce the same
+  result (in almost all cases. see <a href=
+  "#printf_differences">Incompatibilities with printf</a> for details)<br>
+  This core syntax was extended, to allow new features, but also to adapt to
+  the C++ streams context. Thus, format accepts several forms of directives
+  in format-strings :</p>
 
-<a name="printf_directives"></a>
-<h3>printf format specifications</h3>
-<p> 
-The printf format specifications supported by Boost.format follows the Unix98
-<a href="http://www.opengroup.org/onlinepubs/7908799/xsh/fprintf.html">Open-group printf</a>
-precise syntax, rather than the standard C printf, which does not support positional arguments.
-(Common flags have the same meaning in both, so it should not be a headache for anybody)
-<br>
-<i> Note that it is an error to use positional format specifications</i>
-(e.g. <i>%3$+d</i>) 
-<i> mixed with non-positional ones</i> (e.g. <i>%+d</i>) <i>in the same format string.</i>
-<br>
-In the Open-group specification, referring to the same argument several times (e.g. <i>"%1$d %1$d"</i>) has undefined behaviour.  Boost.format's behaviour in such cases is to allow each argument to be reffered to any number of times. The only constraint is
-that it expects exactly <i>P</i> arguments, <i>P</i> being the maximum argument number used in the
- format string. (e.g., for "%1$d %10$d", <i>P</i> == 10 ).
-<br>Supplying more, or less, than <i>P</i> arguments raises an exception. 
-(unless it was set otherwise, see <a href="#exceptions">exceptions</a>)
-</p>
-<p>
-<br>
-<br>
-A  specification <i>spec</i> has the form :
-[ <i>N</i><b>$</b> ] [ <i>flags</i> ] [ <i>width</i> ] 
-[ <b>.</b> <i>precision</i> ] <i>type-char</i>
-<br>
-<br>
-Fields insided square brackets are optional.
-Each of those fields are explained one by one in the following list :
-</p>
+  <ul>
+    <li>Legacy printf format strings : <b>%</b><i>spec</i> where <i>spec</i>
+    is a <a href="#printf_directives">printf format specification</a><br>
+    <i>spec</i> passes formatting options, like width, alignment, numerical
+    base used for formatting numbers, as well as other specific flags. But
+    the classical <i>type-specification</i> flag of printf has a weaker
+    meaning in format. It merely sets the appropriate flags on the internal
+    stream, and/or formatting parameters, but does not require the
+    corresponding argument to be of a specific type.<br>
+    e.g. : the specification <i>2$x</i>, meaning "print argument number 2,
+    which is an integral number, in hexa" for printf, merely means "print
+    argument 2 with stream basefield flags set to <i>hex</i>" for
+    format.</li>
 
-<ul>
-<li>
-<i>N</i> <b>$</b> (optional field)  specifies that the format specification applies to the <i>N</i>-th argument. (it is called a <i>positional format specification</i>)
-<br>If this is not present, arguments are taken one by one. (and it is then an error to later supply an argument number)
-<li>
-<i>flags</i> is a sequences of any of those :
-<blockquote>
-<table border="1" cellpadding="5">
-<tr> <td><b>Flag</b></td> <td><b>Meaning</b></td> <td><b>effect on internal stream</b></td> 
-</tr>
+    <li><b>%|</b><i>spec</i><b>|</b> where <i>spec</i> is a printf format
+    specification.<br>
+    The brackets are introduced, to improve the readability of the
+    format-string, but primarily, to make the <i>type-conversion
+    character</i> optional in <i>spec</i>. This information is not necessary
+    with C++ variables, but with direct printf syntax, it is necessary to
+    always give a type-conversion character, merely because this character is
+    crucial to determine the end of a format-specification.<br>
+    e.g. : "%|-5|" will format the next variable with width set to 5, and
+    left-alignment just like the following printf directives : "%-5g",
+    "%-5f", "%-5s" ..</li>
 
-<tr> <td><b>'-'</b></td> <td>left alignment</td> 
-		<td>N/A (applied later on the string)</td> 
-</tr>
-<tr> 
-            <td><b>'='</b></td> <td>centered alignment</td> 
-            <td>N/A (applied later on the string) 
-               <br><i>- note : added feature, not in printf -</i>
-            </td> 
-</tr>
-<tr>
-            <td><b>'_'</b></td> <td>internal alignment</td>
-            <td>sets internal alignment 
-               <br><i>- note : added feature, not in printf -</i>
-            </td> 
-</tr>
+    <li><b>%</b><i>N</i><b>%</b><br>
+    This simple positional notation requests the formatting of the
+    <i>N</i>-th argument - wihout any formatting option.<br>
+    (It's merely a shortcut to Printf's positional directives (like
+    "%<i>N</i>$s"), but a major benefit is that it's much more readable, and
+    does not use a "type-conversion" character)</li>
+  </ul>On top of the standard printf format specifications, new features were
+  implemented, like centered alignment. See <a href="#new_directives">new
+  format specification</a> for details. <a name="printf_directives" id=
+  "printf_directives"></a>
 
-<tr> <td><b>'+'</b></td> <td>show sign even for positive numbers</td> 
-	    <td>sets <i>showpos</i></td> 
-</tr>
-<tr> 
-	    <td><b>'#'</b></td> 
-	    <td>show numerical base, and decimal point</td> 
-	    <td>sets <i>showbase</i> and <i>showpoint</i></td> 
-</tr>
-<tr> 
-	    <td><b>'0'</b></td> 
-	    <td>pad with 0's (inserted after sign or base indicator)</td> 
-	    <td>if not left-aligned, calls <i>setfill('0')</i> and sets <i>internal</i>
-	     <br> Extra actions are taken after stream conversion to handle 
-		  <a href="#user-defined">user-defined output</a>.  </td> 
-</tr>
-<tr> 
-	    <td><b>' '</b></td> 
-	    <td>if the string does not begin with <i>+</i> or <i>-</i>, 
-	      insert a <i>space</i> before the converted string</td> 
-	    <td>N/A (applied later on the string)
-	      <br>Different to printf's behaviour : it is not affected by internal alignment</td> 
-</tr>
+  <h3>printf format specifications</h3>
 
-</table>
-</blockquote>
-</li>
+  <p>The printf format specifications supported by Boost.format follows the
+  Unix98 <a href=
+  "http://www.opengroup.org/onlinepubs/7908799/xsh/fprintf.html">Open-group
+  printf</a> precise syntax, rather than the standard C printf, which does
+  not support positional arguments. (Common flags have the same meaning in
+  both, so it should not be a headache for anybody)<br>
+  <i>Note that it is an error to use positional format specifications</i>
+  (e.g. <i>%3$+d</i>) <i>mixed with non-positional ones</i> (e.g. <i>%+d</i>)
+  <i>in the same format string.</i><br>
+  In the Open-group specification, referring to the same argument several
+  times (e.g. <i>"%1$d %1$d"</i>) has undefined behaviour. Boost.format's
+  behaviour in such cases is to allow each argument to be reffered to any
+  number of times. The only constraint is that it expects exactly <i>P</i>
+  arguments, <i>P</i> being the maximum argument number used in the format
+  string. (e.g., for "%1$d %10$d", <i>P</i> == 10 ).<br>
+  Supplying more, or less, than <i>P</i> arguments raises an exception.
+  (unless it was set otherwise, see <a href="#exceptions">exceptions</a>)</p>
 
-<li>
-<i>width</i> specifies a minimal width for the string resulting form the conversion.
-If necessary, the string will be padded with alignment and fill characters either set on the stream via manipulators, or specified by the  format-string  (e.g. flags '0', '-', ..)
-<br>
-Note that width is not just set on the conversion stream. 
-To support output of <a href="#user-defined">user-defined types</a>
-(that might call <i>operator<<</i> many times on several members),
-the width is handled after stream conversion of the whole argument object, 
-in the format class code.
-<li>
-<i>precision</i> (preceded by a point), sets the stream's <i>precision</i>
-        <ul>
-          <li>When outputting a floatting type number, it sets the maximum number of digits 
-            <ul><li>after decimal point when in fixed or scientific mode</li>
-              <li>in total when in default mode ('<i>general mode</i>', like <i>%g</i>) </li>
-            </ul>
-          <li>When used with type-char <b>s</b> or <b>S</b> it takes another meaning : 
-            the conversion string is truncated to the <i>precision</i> first chars.
-            (Note that the eventual padding to <i>width</i> is done after truncation.)
-          </li>
-        </ul>
-</li>
-<li>
-<i>type-char</i>. it does <b>not</b> impose the concerned argument to be of a restricted set 
-of types, but merely sets the flags that are associated with this type specification.
+  <p><br>
+  <br>
+  A specification <i>spec</i> has the form : [ <i>N</i><b>$</b> ] [
+  <i>flags</i> ] [ <i>width</i> ] [ <b>.</b> <i>precision</i> ]
+  <i>type-char</i><br>
+  <br>
+  Fields insided square brackets are optional. Each of those fields are
+  explained one by one in the following list :</p>
 
-<blockquote>
-<table border="1" cellpadding="5">
-<tr> 
-		<td><b>Type-Char</b></td> 
-		<td><b>Meaning</b></td> 
-		<td><b>effect on stream</b></td> 
-</tr>
-<tr> 
-	    <td><b>p or x</b></td> 
-	    <td>hexadecimal output</td> 
-	    <td>sets <i>hex</i></td> 
-</tr>
-<tr> 
-	    <td><b>o</b></td> 
-	    <td>octal output</td> 
-	    <td>sets <i>oct</i></td> 
-</tr>
-<tr> 
-	    <td><b>e</b></td> 
-	    <td>scientific float format</td> 
-	    <td>sets floatfield bits to <i>scientific</i></td> 
-</tr>
-<tr> 
-	    <td><b>f</b></td> 
-	    <td>fixed float format</td> 
-	    <td>sets floatfield bits to <i>fixed</i></td> 
-</tr>
-<tr> 
-	    <td><b>g</b></td> 
-	    <td>general -default- float format</td> 
-	    <td><b>unset</b> all floatfield bits</td> 
-</tr>
-<tr> 
-	    <td><b>X, E</b> or <b>G</b></td> 
-	    <td>same effect as their lowercase counterparts, 
-		  but using uppercase letters for number outputs. (exponents, hex digits, ..)</td> 
-	    <td>same effects as <i>'x'</i>, <i>'e'</i>, or <i>'g'</i>, 
-		  <b>plus</b> <i>uppercase</i></td> 
-</tr>
+  <ul>
+    <li><i>N</i> <b>$</b> (optional field) specifies that the format
+    specification applies to the <i>N</i>-th argument. (it is called a
+    <i>positional format specification</i>)<br>
+    If this is not present, arguments are taken one by one. (and it is then
+    an error to later supply an argument number)</li>
 
-<tr> 
-	    <td><b>d, i</b> or <b>u</b></td> 
-	    <td><b>decimal</b> type output</td> 
-	    <td>sets basefield bits to <i>dec</i></td> 
-</tr>
-<tr> 
-	    <td><b>s</b> or <b>S</b></td> 
-	    <td>string output</td> 
-	    <td><i>precision</i> specification is unset, 
-		  and its value goes to an internal field for later 'truncation'. 
-		  (see <i>precision</i> explanation above) </td> 
-</tr>
-<tr> 
-	    <td><b>c</b> or <b>C</b></td> 
-	    <td>1-character output</td> 
-	    <td>only the first character of the conversion string is used.</td> 
-</tr>
-<tr>
+    <li>
+      <i>flags</i> is a sequences of any of those :
+
+      <blockquote>
+        <table border="1" cellpadding="5" summary="">
+          <tr>
+            <td><b>Flag</b></td>
+
+            <td><b>Meaning</b></td>
+
+            <td><b>effect on internal stream</b></td>
+          </tr>
+
+          <tr>
+            <td><b>'-'</b></td>
+
+            <td>left alignment</td>
+
+            <td>N/A (applied later on the string)</td>
+          </tr>
+
+          <tr>
+            <td><b>'='</b></td>
+
+            <td>centered alignment</td>
+
+            <td>N/A (applied later on the string)<br>
+            <i>- note : added feature, not in printf -</i></td>
+          </tr>
+
+          <tr>
+            <td><b>'_'</b></td>
+
+            <td>internal alignment</td>
+
+            <td>sets internal alignment<br>
+            <i>- note : added feature, not in printf -</i></td>
+          </tr>
+
+          <tr>
+            <td><b>'+'</b></td>
+
+            <td>show sign even for positive numbers</td>
+
+            <td>sets <i>showpos</i></td>
+          </tr>
+
+          <tr>
+            <td><b>'#'</b></td>
+
+            <td>show numerical base, and decimal point</td>
+
+            <td>sets <i>showbase</i> and <i>showpoint</i></td>
+          </tr>
+
+          <tr>
+            <td><b>'0'</b></td>
+
+            <td>pad with 0's (inserted after sign or base indicator)</td>
+
+            <td>if not left-aligned, calls <i>setfill('0')</i> and sets
+            <i>internal</i><br>
+            Extra actions are taken after stream conversion to handle
+            <a href="#user-defined">user-defined output</a>.</td>
+          </tr>
+
+          <tr>
+            <td><b>' '</b></td>
+
+            <td>if the string does not begin with <i>+</i> or <i>-</i>,
+            insert a <i>space</i> before the converted string</td>
+
+            <td>N/A (applied later on the string)<br>
+            Different to printf's behaviour : it is not affected by internal
+            alignment</td>
+          </tr>
+        </table>
+      </blockquote>
+    </li>
+
+    <li><i>width</i> specifies a minimal width for the string resulting form
+    the conversion. If necessary, the string will be padded with alignment
+    and fill characters either set on the stream via manipulators, or
+    specified by the format-string (e.g. flags '0', '-', ..)<br>
+    Note that width is not just set on the conversion stream. To support
+    output of <a href="#user-defined">user-defined types</a> (that might call
+    <i>operator&lt;&lt;</i> many times on several members), the width is
+    handled after stream conversion of the whole argument object, in the
+    format class code.</li>
+
+    <li>
+      <i>precision</i> (preceded by a point), sets the stream's
+      <i>precision</i>
+
+      <ul>
+        <li>When outputting a floatting type number, it sets the maximum
+        number of digits
+
+          <ul>
+            <li>after decimal point when in fixed or scientific mode</li>
+
+            <li>in total when in default mode ('<i>general mode</i>', like
+            <i>%g</i>)</li>
+          </ul>
+        </li>
+
+        <li>When used with type-char <b>s</b> or <b>S</b> it takes another
+        meaning : the conversion string is truncated to the <i>precision</i>
+        first chars. (Note that the eventual padding to <i>width</i> is done
+        after truncation.)</li>
+      </ul>
+    </li>
+
+    <li>
+      <i>type-char</i>. it does <b>not</b> impose the concerned argument to
+      be of a restricted set of types, but merely sets the flags that are
+      associated with this type specification.
+
+      <blockquote>
+        <table border="1" cellpadding="5" summary="">
+          <tr>
+            <td><b>Type-Char</b></td>
+
+            <td><b>Meaning</b></td>
+
+            <td><b>effect on stream</b></td>
+          </tr>
+
+          <tr>
+            <td><b>p or x</b></td>
+
+            <td>hexadecimal output</td>
+
+            <td>sets <i>hex</i></td>
+          </tr>
+
+          <tr>
+            <td><b>o</b></td>
+
+            <td>octal output</td>
+
+            <td>sets <i>oct</i></td>
+          </tr>
+
+          <tr>
+            <td><b>e</b></td>
+
+            <td>scientific float format</td>
+
+            <td>sets floatfield bits to <i>scientific</i></td>
+          </tr>
+
+          <tr>
+            <td><b>f</b></td>
+
+            <td>fixed float format</td>
+
+            <td>sets floatfield bits to <i>fixed</i></td>
+          </tr>
+
+          <tr>
+            <td><b>g</b></td>
+
+            <td>general -default- float format</td>
+
+            <td><b>unset</b> all floatfield bits</td>
+          </tr>
+
+          <tr>
+            <td><b>X, E</b> or <b>G</b></td>
+
+            <td>same effect as their lowercase counterparts, but using
+            uppercase letters for number outputs. (exponents, hex digits,
+            ..)</td>
+
+            <td>same effects as <i>'x'</i>, <i>'e'</i>, or <i>'g'</i>,
+            <b>plus</b> <i>uppercase</i></td>
+          </tr>
+
+          <tr>
+            <td><b>d, i</b> or <b>u</b></td>
+
+            <td><b>decimal</b> type output</td>
+
+            <td>sets basefield bits to <i>dec</i></td>
+          </tr>
+
+          <tr>
+            <td><b>s</b> or <b>S</b></td>
+
+            <td>string output</td>
+
+            <td><i>precision</i> specification is unset, and its value goes
+            to an internal field for later 'truncation'. (see
+            <i>precision</i> explanation above)</td>
+          </tr>
+
+          <tr>
+            <td><b>c</b> or <b>C</b></td>
+
+            <td>1-character output</td>
+
+            <td>only the first character of the conversion string is
+            used.</td>
+          </tr>
+
+          <tr>
             <td><b>%</b></td>
+
             <td>print the character <i>%</i></td>
+
             <td>N/A</td>
-</tr>
-</table>
-</blockquote>
-<p>Note that the 'n' type specification is ignored (and so is the corresponding argument),
- because it does not fit in this context.
-<br>
-Also, printf 'l', 'L',  or 'h' modifiers (to indicate wide, long or short types) are supported
-(and simply have no effect on the internal stream).
-</p>
+          </tr>
+        </table>
+      </blockquote>
 
-</li>
-</ul>
+      <p>Note that the 'n' type specification is ignored (and so is the
+      corresponding argument), because it does not fit in this context.<br>
+      Also, printf 'l', 'L', or 'h' modifiers (to indicate wide, long or
+      short types) are supported (and simply have no effect on the internal
+      stream).</p>
+    </li>
+  </ul><a name="new_directives" id="new_directives"></a>
 
-<a name="new_directives"></a>
-<h3>new format-specifications</h3>
-<ul>
-<li> as stated in the flags table, centered and internal alignment flags (' <i>=</i> ', 
-and ' <i>_</i> ')  were added.
-</li>
-<li> <i><b>%{</b>n</i><b>t}</b> , where <i>n</i> is a positive number, 
-        inserts an <i>absolute tabulation</i>.
-        It means that format will, if needed, fill the string with characters, until
-        the length of the string created so far reaches <i>n</i> characters.
-        (see <a href="#examples">examples</a> )
-</li>
-<li> <b>%{</b><i>n</i><B>T</B><i>X</i><b>}</b> inserts a tabulation in the same way, 
-	but using <i>X</i> as fill character instead of the current 'fill' char of the stream 
-	(which is <i>space</i> for a stream in default state)
-</li>
-</ul>
+  <h3>new format-specifications</h3>
 
-<a name="printf_differences"></a>
-<h2>Differences of behaviour vs printf</h2>
-Suppose you have variables <i>x1, x2</i> (built_in types, supported by C's printf),
-<br> and a format string <i>s</i> intended for use with a printf function this way :
-<BLOCKQUOTE><PRE>
+  <ul>
+    <li>as stated in the flags table, centered and internal alignment flags
+    (' <i>=</i> ', and ' <i>_</i> ') were added.</li>
+
+    <li><i><b>%{</b>n</i><b>t}</b> , where <i>n</i> is a positive number,
+    inserts an <i>absolute tabulation</i>. It means that format will, if
+    needed, fill the string with characters, until the length of the string
+    created so far reaches <i>n</i> characters. (see <a href=
+    "#examples">examples</a> )</li>
+
+    <li><b>%{</b><i>n</i><b>T</b><i>X</i><b>}</b> inserts a tabulation in the
+    same way, but using <i>X</i> as fill character instead of the current
+    'fill' char of the stream (which is <i>space</i> for a stream in default
+    state)</li>
+  </ul><a name="printf_differences" id="printf_differences"></a>
+
+  <h2>Differences of behaviour vs printf</h2>Suppose you have variables
+  <i>x1, x2</i> (built_in types, supported by C's printf),<br>
+  and a format string <i>s</i> intended for use with a printf function this
+  way :
+
+  <blockquote>
+    <pre>
 printf(s, x1, x2);
-</PRE></BLOCKQUOTE>
-<br>
-In almost all cases, the result will be the same as with this command :
-<BLOCKQUOTE><PRE>
-cout << format(s) % x1 % x2;
-</PRE></BLOCKQUOTE>
+</pre>
+  </blockquote><br>
+  In almost all cases, the result will be the same as with this command :
 
-<p>
-But because some printf format specifications don't translate well into stream formatting options,
-there are a few notable imperfections in the way Boost.format emulates printf.<br>
-In any case, the <i>format</i> class should quietly ignore the unsupported options, so
-that printf format-strings are always accepted by format and produce almost the same 
-output as printf.
-</p>
-<br>Here is the full list of such differences :
-<ul>
-<li> <b>'0'</b> and <b>' '</b> options : 
-printf ignores these options for non numeric conversions, but format applies them to all
-types of variables.
-(so it is possible to use those options on user-defined types, e.g. a Rational class, etc..)
-</li>
-<li> <b>precision</b> for integral types arguments has a special meaning for printf :
-<br> <i> printf( "(%5.3d)" , 7 ) ;</i>  prints « (  007) »
-<br> While format, like streams, ignores the precision parameter for integral types conversions.
-</li>
-<li> the <b>'</b> printf option 
-(<i>format with thousands grouping characters)</i>)
-has no effect in format. 
-</li>
-<li> Width or precision set to asterisk (<i>*</i>) are used by printf to read this field from 
-an argument. e.g. 
-<i>printf("%1$d:%2$.*3$d:%4$.*3$d\n", hour, min, precision, sec);</i>
-<br>This class does not support this mechanism for now. so such precision or width fields are quietly 
-ignored by the parsing. 
-</ul>
+  <blockquote>
+    <pre>
+cout &lt;&lt; format(s) % x1 % x2;
+</pre>
+  </blockquote>
 
-Also, note that the special <b>'n'</b> type-specification 
-(used to tell printf to save in a variable the number of characters output by the formatting) 
-has no effect in format. 
-<br> Thus format strings containing this type-specification should produce the same converted 
-string by printf or format. 
-It will not cause differences in the formatted strings between printf and format.
-<br>To get the number of characters in the formatted string using Boost.Format, 
-you can use the <i>size()</i> member function :
-<BLOCKQUOTE><PRE>
+  <p>But because some printf format specifications don't translate well into
+  stream formatting options, there are a few notable imperfections in the way
+  Boost.format emulates printf.<br>
+  In any case, the <i>format</i> class should quietly ignore the unsupported
+  options, so that printf format-strings are always accepted by format and
+  produce almost the same output as printf.</p><br>
+  Here is the full list of such differences :
+
+  <ul>
+    <li><b>'0'</b> and <b>' '</b> options : printf ignores these options for
+    non numeric conversions, but format applies them to all types of
+    variables. (so it is possible to use those options on user-defined types,
+    e.g. a Rational class, etc..)</li>
+
+    <li><b>precision</b> for integral types arguments has a special meaning
+    for printf :<br>
+    <i>printf( "(%5.3d)" , 7 ) ;</i> prints &laquo; ( 007) &raquo;<br>
+    While format, like streams, ignores the precision parameter for integral
+    types conversions.</li>
+
+    <li>the <b>'</b> printf option (<i>format with thousands grouping
+    characters)</i>) has no effect in format.</li>
+
+    <li>Width or precision set to asterisk (<i>*</i>) are used by printf to
+    read this field from an argument. e.g.
+    <i>printf("%1$d:%2$.*3$d:%4$.*3$d\n", hour, min, precision, sec);</i><br>
+    This class does not support this mechanism for now. so such precision or
+    width fields are quietly ignored by the parsing.</li>
+  </ul>Also, note that the special <b>'n'</b> type-specification (used to
+  tell printf to save in a variable the number of characters output by the
+  formatting) has no effect in format.<br>
+  Thus format strings containing this type-specification should produce the
+  same converted string by printf or format. It will not cause differences in
+  the formatted strings between printf and format.<br>
+  To get the number of characters in the formatted string using Boost.Format,
+  you can use the <i>size()</i> member function :
+
+  <blockquote>
+    <pre>
 format formatter("%+5d");
-cout << formatter % x;
+cout &lt;&lt; formatter % x;
 unsigned int n = formatter.size();
-</PRE></BLOCKQUOTE>
+</pre>
+  </blockquote><a name="user-defined" id="user-defined"></a>
+  <hr>
 
-<a name="user-defined"></a>
-<hr>
-<h2>User-defined types output</h2>
-<p> 
-All flags which are translated into modification to the stream state 
-act recursively within user-defined types.
-( the flags remain active, and so does the desired format option, for each of
-the '<<' operations that might be called by the user-defined class)
-</p>
-e.g., with a Rational class, we would have something like :
-<BLOCKQUOTE><PRE>
+  <h2>User-defined types output</h2>
+
+  <p>All flags which are translated into modification to the stream state act
+  recursively within user-defined types. ( the flags remain active, and so
+  does the desired format option, for each of the '&lt;&lt;' operations that
+  might be called by the user-defined class)</p>e.g., with a Rational class,
+  we would have something like :
+
+  <blockquote>
+    <pre>
 Rational ratio(16,9);
-cerr << format("%#x \n")  % ratio;  // -> "0x10/0x9 \n"
-</PRE></BLOCKQUOTE>
+cerr &lt;&lt; format("%#x \n")  % ratio;  // -&gt; "0x10/0x9 \n"
+</pre>
+  </blockquote>
 
-<p>
-It's a different story for other formatting options. For example, setting width applies 
-to the final output produced by the object, not to each of its internal outputs, and
-that's fortunate :
-</p>
-<BLOCKQUOTE><PRE>
-cerr << format("%-8d")  % ratio;  // -> "16/9    "      and not    "16      /9       "
-cerr << format("%=8d")  % ratio;  // -> "  16/9  "      and not    "   16   /    9   "
-</PRE></BLOCKQUOTE>
-<p>
-<br>But so does the 0 and ' ' options (contrarily to '+' which is directly translated to the stream
-state by <i>showpos</i>. But no such flags exist for the zero and space printf options)
-<br>and that is less natural :
-</p>
-<BLOCKQUOTE><PRE>
-cerr << format("%+08d \n")  % ratio;  // -> "+00016/9"
-cerr << format("% 08d \n")  % ratio;  // -> "000 16/9"
-</PRE></BLOCKQUOTE>
-It is possible to obtain a better behaviour by carefully designing the Rational's <i>operator<<</i> 
-to handle the stream's width, alignment and <i>showpos</i> paramaters by itself. This is demonstrated in 
-<A href="../example/sample_userType.cpp">sample_userType.cpp</A>.
+  <p>It's a different story for other formatting options. For example,
+  setting width applies to the final output produced by the object, not to
+  each of its internal outputs, and that's fortunate :</p>
 
-<p></p>
+  <blockquote>
+    <pre>
+cerr &lt;&lt; format("%-8d")  % ratio;  // -&gt; "16/9    "      and not    "16      /9       "
+cerr &lt;&lt; format("%=8d")  % ratio;  // -&gt; "  16/9  "      and not    "   16   /    9   "
+</pre>
+  </blockquote>
 
-<a name="manipulators"></a>
-<hr>
-<h3>Manipulators, and internal stream state</h3>
-<P>
-The internal stream state of <B>format</B> is saved before 
-and restored after output of an argument; therefore, the modifiers are not sticky and affect only
-the argument they are applied to.
-<br> The default state for streams, as stated by the standard, is :
-precision 6, width 0, right alignment, and decimal flag set.
-</P>
-<P>
-The state of the internal <B>format</B> stream can be changed by manipulators passed along 
-with the argument; via the <i>group</i> function, like that :
-</p>
-<BLOCKQUOTE><PRE>
-cout << format("%1% %2% %1%\n") % group(hex, showbase, 40) % 50; // prints "0x28 50 0x28\n"
-</PRE></BLOCKQUOTE>
-<p>
-<br>When passing N items inside a 'group' Boost.format needs to process manipulators
-diferently from regular argument, and thus using group is subject to the following constraints :
-<ol>
-<li>the object to be printed must be passed as the last item in the group</li>
-<li>the first N-1 items are treated as manipulators, and if they do produce output, it is discarded
-</li>
-</ol>
+  <p><br>
+  But so does the 0 and ' ' options (contrarily to '+' which is directly
+  translated to the stream state by <i>showpos</i>. But no such flags exist
+  for the zero and space printf options)<br>
+  and that is less natural :</p>
 
+  <blockquote>
+    <pre>
+cerr &lt;&lt; format("%+08d \n")  % ratio;  // -&gt; "+00016/9"
+cerr &lt;&lt; format("% 08d \n")  % ratio;  // -&gt; "000 16/9"
+</pre>
+  </blockquote>It is possible to obtain a better behaviour by carefully
+  designing the Rational's <i>operator&lt;&lt;</i> to handle the stream's
+  width, alignment and <i>showpos</i> paramaters by itself. This is
+  demonstrated in <a href=
+  "../example/sample_userType.cpp">sample_userType.cpp</a>. <a name=
+  "manipulators" id="manipulators"></a>
+  <hr>
 
+  <h3>Manipulators, and internal stream state</h3>
 
-<p>
-Such manipulators are passed to the streams right before the following argument, 
-at every occurence.
-Note that formatting options specified within the format string are overridden
-by stream state modifiers passed this way. For instance in the following code,
-the <i>hex</i> manipulator has priority over the <i>d</i> type-specification in
- the format-string which would set decimal output :
-</P>
-<BLOCKQUOTE><PRE>
-cout << format("%1$d %2% %1%\n") % group(hex, showbase, 40) % 50; 
+  <p>The internal stream state of <b>format</b> is saved before and restored
+  after output of an argument; therefore, the modifiers are not sticky and
+  affect only the argument they are applied to.<br>
+  The default state for streams, as stated by the standard, is : precision 6,
+  width 0, right alignment, and decimal flag set.</p>
+
+  <p>The state of the internal <b>format</b> stream can be changed by
+  manipulators passed along with the argument; via the <i>group</i> function,
+  like that :</p>
+
+  <blockquote>
+    <pre>
+cout &lt;&lt; format("%1% %2% %1%\n") % group(hex, showbase, 40) % 50; // prints "0x28 50 0x28\n"
+</pre>
+  </blockquote>
+
+  <p><br>
+  When passing N items inside a 'group' Boost.format needs to process
+  manipulators diferently from regular argument, and thus using group is
+  subject to the following constraints :</p>
+
+  <ol>
+    <li>the object to be printed must be passed as the last item in the
+    group</li>
+
+    <li>the first N-1 items are treated as manipulators, and if they do
+    produce output, it is discarded</li>
+  </ol>
+
+  <p>Such manipulators are passed to the streams right before the following
+  argument, at every occurence. Note that formatting options specified within
+  the format string are overridden by stream state modifiers passed this way.
+  For instance in the following code, the <i>hex</i> manipulator has priority
+  over the <i>d</i> type-specification in the format-string which would set
+  decimal output :</p>
+
+  <blockquote>
+    <pre>
+cout &lt;&lt; format("%1$d %2% %1%\n") % group(hex, showbase, 40) % 50; 
 // prints "0x28 50 0x28\n"
-</PRE></BLOCKQUOTE>
+</pre>
+  </blockquote><a name="alternatives" id="alternatives"></a>
 
+  <h2>Alternatives</h2>
 
-<a name="alternatives"></a>
-<H2>Alternatives</H2> 
-<ul>
-<li>
-<B>printf</B> is the classical alternative, that is not type safe and not extendable to user-defined types.
-<li>
-ofrstream.cc
-	by Karl Nelson's design was a big source of inspiration to this format class.
-</li>
-<li>James Kanze's library
-	has a format class (in <i>srcode/Extended/format</i> ) which looks 
-	very well polished. Its design has in common with this class the use of internal stream
-	for the actual conversions, as well as using operators to pass arguments. 
-	(but his class, as ofrstream, uses <i>operator<< </i> rather <i>than operator%</i> )
-</li>
-<li><a href="http://groups.yahoo.com/group/boost/files/format3/">Karl Nelson's library</a>
-        was intented as demonstration of alternative solutions 
-        in discussions on Boost's list for the design of Boost.format.
-</li>
-</ul>
+  <ul>
+    <li><b>printf</b> is the classical alternative, that is not type safe and
+    not extendable to user-defined types.</li>
 
+    <li>ofrstream.cc by Karl Nelson's design was a big source of inspiration
+    to this format class.</li>
 
-<a name="exceptions"></a>
-<hr>
-<H2>Exceptions</H2>
-<p>
-Boost.format enforces a number of rules on the usage of format objects. The format-string must obeys 
-the syntax described above, the user must supply exactly the right number of arguments before outputting to the final destination, and if using modify_item or bind_arg, items and arguments index
-must not be out of range.
-<br>
-When format detects that one of these rules is not satisfied, it raises a corresponding exception, 
-so that the mistakes don't go unnoticed and unhandled.
-<br>
-But the user can change this behaviour to fit his needs, 
-and select which types of errors may raise exceptions  using the following functions :
-</p>
-<BLOCKQUOTE><PRE>
+    <li>James Kanze's library has a format class (in
+    <i>srcode/Extended/format</i> ) which looks very well polished. Its
+    design has in common with this class the use of internal stream for the
+    actual conversions, as well as using operators to pass arguments. (but
+    his class, as ofrstream, uses <i>operator&lt;&lt;</i> rather <i>than
+    operator%</i> )</li>
 
+    <li><a href="http://groups.yahoo.com/group/boost/files/format3/">Karl
+    Nelson's library</a> was intented as demonstration of alternative
+    solutions in discussions on Boost's list for the design of
+    Boost.format.</li>
+  </ul><a name="exceptions" id="exceptions"></a>
+  <hr>
+
+  <h2>Exceptions</h2>
+
+  <p>Boost.format enforces a number of rules on the usage of format objects.
+  The format-string must obeys the syntax described above, the user must
+  supply exactly the right number of arguments before outputting to the final
+  destination, and if using modify_item or bind_arg, items and arguments
+  index must not be out of range.<br>
+  When format detects that one of these rules is not satisfied, it raises a
+  corresponding exception, so that the mistakes don't go unnoticed and
+  unhandled.<br>
+  But the user can change this behaviour to fit his needs, and select which
+  types of errors may raise exceptions using the following functions :</p>
+
+  <blockquote>
+    <pre>
+
 unsigned char exceptions(unsigned char newexcept); // query and set
 unsigned char exceptions() const;                  // just query
 
-</PRE></BLOCKQUOTE>
+</pre>
+  </blockquote>
 
-<p>
-The user can compute the argument <i>newexcept</i> by combining the following atoms using binary arithmetic :
+  <p>The user can compute the argument <i>newexcept</i> by combining the
+  following atoms using binary arithmetic :</p>
 
-<ul>
-<li> <b>boost::io::bad_format_string_bit</b> selects errors due to ill-formed format-strings.
-</li>
+  <ul>
+    <li><b>boost::io::bad_format_string_bit</b> selects errors due to
+    ill-formed format-strings.</li>
 
-<li> <b>boost::io::too_few_args_bit</b> selects errors due to asking for the srting result before all arguments are passed.
-</li>
+    <li><b>boost::io::too_few_args_bit</b> selects errors due to asking for
+    the srting result before all arguments are passed.</li>
 
-<li> <b>boost::io::too_many_args_bit</b>  selects errors due to passing too many arguments.
-</li>
+    <li><b>boost::io::too_many_args_bit</b> selects errors due to passing too
+    many arguments.</li>
 
-<li> <b>boost::io::out_of_range_bit</b> select errors due to out of range index supplied by the user when calling 
-        <i>modify_item</i> or other functions taking an item index (or an argument index)
-</li>
+    <li><b>boost::io::out_of_range_bit</b> select errors due to out of range
+    index supplied by the user when calling <i>modify_item</i> or other
+    functions taking an item index (or an argument index)</li>
 
-<li> <b>boost::io::all_error_bits</b> selects all errors
-</li>
+    <li><b>boost::io::all_error_bits</b> selects all errors</li>
 
-<li> <b>boost::io::no_error_bits</b> selects no error.
-</li>
-        
-</ul>
-<p>
-For instance, if you don't want Boost.format to detect bad number of arguments, you can define
-a specific wrapper function for building format objects with the right exceptions settings :
-</p>
-<BLOCKQUOTE><PRE>
+    <li><b>boost::io::no_error_bits</b> selects no error.</li>
+  </ul>
 
-boost::format  my_fmt(const std::string & f_string) {
+  <p>For instance, if you don't want Boost.format to detect bad number of
+  arguments, you can define a specific wrapper function for building format
+  objects with the right exceptions settings :</p>
+
+  <blockquote>
+    <pre>
+
+boost::format  my_fmt(const std::string &amp; f_string) {
     using namespace boost::io;
     format fmter(f_string);
     fmter.exceptions( all_error_bits ^ ( too_many_args_bit | too_few_args_bit )  );
     return fmter;
 }
 
-</PRE></BLOCKQUOTE>
+</pre>
+  </blockquote>It is then allowed to give more arguments than needed (they
+  are simply ignored) :
 
-It is then allowed to give more arguments than needed  (they are simply ignored) :
+  <blockquote>
+    <pre>
 
-<BLOCKQUOTE><PRE>
+cout &lt;&lt; my_fmt(" %1% %2% \n") % 1 % 2 % 3 % 4 % 5;
 
-cout << my_fmt(" %1% %2% \n") % 1 % 2 % 3 % 4 % 5;
+</pre>
+  </blockquote>And if we ask for the result before all arguments are
+  supplied, the corresponding part of the result is simply empty
 
-</PRE></BLOCKQUOTE>
+  <blockquote>
+    <pre>
 
-And if we ask for the result before all arguments are supplied, the corresponding part of the
-result is simply empty
+cout &lt;&lt; my_fmt(" _%2%_ _%1%_ \n") % 1 ;
+// prints      " __ _1_ \n"
 
-<BLOCKQUOTE><PRE>
+</pre>
+  </blockquote><a name="performance" id="performance"></a>
+  <hr>
 
-cout << my_fmt(" _%2%_ _%1%_ \n") % 1 ;
-// prints      " __ _1_ \n"
+  <h2>A Note about performance</h2>
 
-</PRE></BLOCKQUOTE>
+  <p>The performance of boost::format for formatting a few builtin type
+  arguments with reordering can be compared to that of Posix-printf, and of
+  the equivalent stream manual operations to give a measure of the overhead
+  incurred. The result may greatly depend on the compiler, standard library
+  implementation, and the precise choice of format-string and arguments.</p>
 
-<a name="performance"></a>
-<hr>
-<H2>A Note about performance</H2>
-<p>
-The performance of boost::format for formatting a few builtin type arguments with reordering can be compared
-to that of Posix-printf, and of the equivalent stream manual operations to give a measure
-of the overhead incurred.
-The result may greatly depend on the compiler, standard library implementation, and the precise
-choice of format-string and arguments. 
-</p>
-<p>
-Since common stream implementations eventually call functions of the printf family for the actual 
-formatting of numbers, in general printf will be noticeably faster than the direct stream operations 
-And due to to the reordering overhead (allocations to store the pieces of string,
-stream initialisation at each item formatting, ..) the
-direct stream operations would be faster than boost::format, 
-(one cas expect a ratio ranging from 2 to 5 or more)
-</p>
-<p>
-When iterated formattings are a performance bottleneck, performance can be slightly increased by parsing
-the format string into a format object, and copying it at each formatting, in the following way.
-</p>
-<BLOCKQUOTE><PRE>
+  <p>Since common stream implementations eventually call functions of the
+  printf family for the actual formatting of numbers, in general printf will
+  be noticeably faster than the direct stream operations And due to to the
+  reordering overhead (allocations to store the pieces of string, stream
+  initialisation at each item formatting, ..) the direct stream operations
+  would be faster than boost::format, (one cas expect a ratio ranging from 2
+  to 5 or more)</p>
+
+  <p>When iterated formattings are a performance bottleneck, performance can
+  be slightly increased by parsing the format string into a format object,
+  and copying it at each formatting, in the following way.</p>
+
+  <blockquote>
+    <pre>
     const boost::format fmter(fstring);
-    dest << boost::format(fmter) % arg1 % arg2 % arg3 ;
-</PRE></BLOCKQUOTE>
-<p>
-As an example of performance results, the author measured the time of execution of iterated formattings
-with 4 different methods 
-</p>
-<ol>
-<li> posix printf </li>
-<li> manual stream output (to a dummy <i>nullStream</i> stream sending the bytes into oblivion)</li>
-<li> boost::format copied from a const object as shown above</li>
-<li> the straigt boost::format usage </li>
-</ol>
-<p>
-the test was compiled with g++-3.3.3 and the following timings were measured (in seconds, and ratios) :
-</p>
-<BLOCKQUOTE><PRE>
+    dest &lt;&lt; boost::format(fmter) % arg1 % arg2 % arg3 ;
+</pre>
+  </blockquote>
+
+  <p>As an example of performance results, the author measured the time of
+  execution of iterated formattings with 4 different methods</p>
+
+  <ol>
+    <li>posix printf</li>
+
+    <li>manual stream output (to a dummy <i>nullStream</i> stream sending the
+    bytes into oblivion)</li>
+
+    <li>boost::format copied from a const object as shown above</li>
+
+    <li>the straigt boost::format usage</li>
+  </ol>
+
+  <p>the test was compiled with g++-3.3.3 and the following timings were
+  measured (in seconds, and ratios) :</p>
+
+  <blockquote>
+    <pre>
 string     fstring="%3$0#6x %1$20.10E %2$g %3$0+5d \n";
 double     arg1=45.23;
 double     arg2=12.34;
@@ -761,15 +917,16 @@
 nullStream             : 3.69,  = 1.74057 * printf
 boost::format copied   :10.02,  = 4.72642 * printf ,  = 2.71545 * nullStream
 boost::format straight :17.03,  = 8.03302 * printf ,  = 4.61518 * nullStream
-</PRE></BLOCKQUOTE>
+</pre>
+  </blockquote><a name="extract" id="extract"></a>
+  <hr>
 
+  <h2>Class Interface Extract</h2>
 
-<a name="extract"></a>
-<hr>
-<H2>Class Interface Extract</H2>
+  <blockquote>
+    <pre>
+namespace boost {
 
-<BLOCKQUOTE><PRE>namespace boost {
-
 template&lt;class charT, class Traits=std::char_traits&lt;charT&gt; &gt; 
 class basic_format 
 {
@@ -777,24 +934,24 @@
   typedef std::basic_string&lt;charT, Traits&gt; string_t;
   typedef typename string_t::size_type     size_type;
   basic_format(const charT* str);
-  basic_format(const charT* str, const std::locale & loc);
-  basic_format(const string_t& s);
-  basic_format(const string_t& s, const std::locale & loc);
-  basic_format& operator= (const basic_format& x);
+  basic_format(const charT* str, const std::locale &amp; loc);
+  basic_format(const string_t&amp; s);
+  basic_format(const string_t&amp; s, const std::locale &amp; loc);
+  basic_format&amp; operator= (const basic_format&amp; x);
 
   void clear(); // reset buffers
-  basic_format& parse(const string_t&); // clears and parse a new format string
+  basic_format&amp; parse(const string_t&amp;); // clears and parse a new format string
 
   string_t str() const;
   size_type size() const;
 
   // pass arguments through those operators :
-  template&lt;class T&gt;  basic_format&   operator%(T& x);  
-  template&lt;class T&gt;  basic_format&   operator%(const T& x);
+  template&lt;class T&gt;  basic_format&amp;   operator%(T&amp; x);  
+  template&lt;class T&gt;  basic_format&amp;   operator%(const T&amp; x);
 
   // dump buffers to ostream :
-  friend std::basic_ostream&lt;charT, Traits&gt;& 
-  operator&lt;&lt; &lt;&gt; ( std::basic_ostream&lt;charT, Traits&gt;& , basic_format& ); 
+  friend std::basic_ostream&lt;charT, Traits&gt;&amp; 
+  operator&lt;&lt; &lt;&gt; ( std::basic_ostream&lt;charT, Traits&gt;&amp; , basic_format&amp; ); 
 
    // Choosing which errors will throw exceptions :
    unsigned char exceptions() const;
@@ -809,57 +966,65 @@
 
 // free function for ease of use :
 template&lt;class charT, class Traits&gt; 
-std::basic_string&lt;charT,Traits&gt;  str(const basic_format&lt;charT,Traits&gt;& f) {
+std::basic_string&lt;charT,Traits&gt;  str(const basic_format&lt;charT,Traits&gt;&amp; f) {
       return f.str();
 }
 
 
 } // namespace boost
-</PRE></BLOCKQUOTE>
-<P>
-</P>
-<hr>
+</pre>
+  </blockquote>
+  <hr>
+  <a name="rationale" id="rationale"></a>
 
-<a name="rationale"></a>
-<H2>Rationale</H2>
-<p>This class's goal is to bring a better, C++, type-safe and type-extendable <i>printf</i> 
-      equivalent to be used with streams.
-</p>
-Precisely, <b>format</b> was designed to provide the following features :
-<ul>
-<li> support positional arguments (required for internationalisation)
-<li> accept an unlimited number of arguments.
-<li> make formatting commands visually natural.
-<li> support the use of manipulators to modify the display of an argument.
-     in addition to the format-string syntax.
-<li> accept any types of variables, by relying on streams for the actual conversion
-     to string. This specifically concerns user-defined types, for which the formatting
-     options effects should be intuitively natural.
-<li> provide printf-compatibility, as much as it makes sense in a type-safe and type-extendable
-     context.
-</li>
-</ul>
-<p> In the process of the design, many issues were faced, and some choices were made, that
-      might not be intuitively right. But in each case they were taken for 
-      <a href="choices.html">some reasons</a>.
-</p>
-<hr>
-<H2>Credits</H2>
-<P>The author of Boost format is Samuel Krempp. &nbsp; He used ideas from
-    Rüdiger Loos' format.hpp and Karl Nelson's formatting classes.
-<HR>
+  <h2>Rationale</h2>
 
-<P>Revised  26 January, 2003</P>
-<p>
-<a href="http://validator.w3.org/check/referer"><img border="0"
-          src="http://www.w3.org/Icons/valid-html40"
-          alt="Valid HTML 4.0!" height="31" width="88"></a>
-</p>
-<P>© Samuel Krempp 2002</p>
-<p> Use, modification, and distribution are subject to the Boost Software
-License, Version 1.0. (See accompanying file <a href="../../../LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a>)</p>
+  <p>This class's goal is to bring a better, C++, type-safe and
+  type-extendable <i>printf</i> equivalent to be used with
+  streams.</p>Precisely, <b>format</b> was designed to provide the following
+  features :
 
-<P></P>
-<P>&nbsp;</P></BODY></HTML>
+  <ul>
+    <li>support positional arguments (required for internationalisation)</li>
+
+    <li>accept an unlimited number of arguments.</li>
+
+    <li>make formatting commands visually natural.</li>
+
+    <li>support the use of manipulators to modify the display of an argument.
+    in addition to the format-string syntax.</li>
+
+    <li>accept any types of variables, by relying on streams for the actual
+    conversion to string. This specifically concerns user-defined types, for
+    which the formatting options effects should be intuitively natural.</li>
+
+    <li>provide printf-compatibility, as much as it makes sense in a
+    type-safe and type-extendable context.</li>
+  </ul>
+
+  <p>In the process of the design, many issues were faced, and some choices
+  were made, that might not be intuitively right. But in each case they were
+  taken for <a href="choices.html">some reasons</a>.</p>
+  <hr>
+
+  <h2>Credits</h2>
+
+  <p>The author of Boost format is Samuel Krempp. &nbsp; He used ideas from
+  R&uuml;diger Loos' format.hpp and Karl Nelson's formatting classes.</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->02 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38510" --></p>
+
+  <p><i>Copyright &copy; 2002 Samuel Krempp</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Deleted: boost/trunk/libs/format/example/Jamfile
===================================================================
--- boost/trunk/libs/format/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/format/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,32 +0,0 @@
-#  Boost.Bind Library test Jamfile
-#
-#  Copyright (c) 2003 Samuel Krempp
-#
-#  Permission to copy, use, modify, sell and distribute this software
-#  is granted provided this copyright notice appears in all copies.
-#  This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
-
-subproject libs/format/example ;
-
-exe sample_formats
-    : sample_formats.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe sample_advanced
-    : sample_advanced.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe sample_new_features
-    : sample_new_features.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe sample_userType
-    : sample_userType.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-

Modified: boost/trunk/libs/format/index.html
===================================================================
--- boost/trunk/libs/format/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/format/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,82 +1,132 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<head>
-<TITLE>The Boost Format library</TITLE>
-<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
+  <title>The Boost Format library</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-<table border="1" bgcolor="#007F7F" cellpadding="2">
-  <tr>
-    <td bgcolor="#FFFFFF"><img src="../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-    <td><a href="../../index.htm"><font face="Arial" color="#FFFFFF"><big>Home </big></font></a></td>
-    <td><a href="../libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries </big></font></a></td>
-    <td><a href="../../people/people.htm"><font face="Arial" color="#FFFFFF"><big>People </big></font></a></td>
-    <td><a href="../../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ </big></font></a></td>
-    <td><a href="../../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More </big></font></a></td>
-  </tr>
-</table>
+      <td><a href="../../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-<h1>Boost Format library</h1>
+      <td><a href="../libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
 
-<p>
-The format library provides a class for formatting arguments according to a format-string, 
-as does printf, but with two major differences :
-<br>
-<ul>
-<li>format sends the arguments to an internal stream, and so is entirely type-safe and 
-naturally supports all user-defined types.</li>
-<li>The ellipsis (...) can not be used correctly in the strongly typed context of format,
-and thus the function call with arbitrary arguments is replaced by successive calls to an 
-<i>argument feeding</i> <b>operator%</b>
-</li>
-</ul>
+      <td><a href="../../people/people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
 
-</p>
+      <td><a href="../../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
 
-<p>
-<br>
-You can find more Details in :
-<ul>
-  <li><a href="doc/format.html">Documentation</a> (HTML).</li>
-  <li>Headers <ul>
-                <li><a href="../../boost/format.hpp">format.hpp</a> : user frontend.</li>
-                <li><a href="../../boost/format/format_fwd.hpp">format_fwd.hpp</a> 
-                  : user forward declarations.</li>
-                <li><a href="../../boost/format/format_class.hpp">
-                  format_class.hpp</a> : the class interface</li>
-                <li><a href="../../boost/format/format_implementation.hpp">
-                    format_implementation.hpp</a>: implementation of the member functions</li>
-                <li><a href="../../boost/format/feed_args.hpp">feed_args.hpp</a> 
-                  : argument feeding helper functions</li>
-                <li><a href="../../boost/format/free_funcs.hpp">free_funcs.hpp</a>
-                  : free functions definitions</li>
-                <li><a href="../../boost/format/parsing.hpp">parsing.hpp</a>
-                  : code for parsing format-strings</li>
-                <li><a href="../../boost/format/group.hpp">group.hpp</a>
-                  : auxiliary struct used to group arguments and manipulators</li>
-                <li><a href="../../boost/format/exceptions.hpp">exceptions.hpp</a>
-                  : exceptions used by the library</li>
-                <li><a href="../../boost/format/internals.hpp">internals.hpp</a>
-                  : auxiliary structs stream_format_state and format_item</li>
-              </ul>
-            </li>
-  <li> Sample programs <ul>
-                <li>The program <A href="./example/sample_formats.cpp">sample_formats.cpp</A> 
-                demonstrates simple uses of <B>format</B>. </li>
-                <li><A href="./example/sample_new_features.cpp">sample_new_features.cpp</A> 
-                  illustrates the few formatting features that were added to printf's syntax such 
-                  as  simple positional directives, centered alignment, and 'tabulations'. </li>
-                <li><A href="./example/sample_advanced.cpp">sample_advanced.cpp</A> 
-                  demonstrates uses of advanced features, like reusing, and modifying, 
-                  format objects, etc.. </li>
-                <li>And <A href="./example/sample_userType.cpp">sample_userType.cpp</A> 
-                  shows the behaviour of the <b>format</b> library on user-defined types.</li>
-              </ul>
-</li>
-</ul>
-Submitted by <a href="../../people/samuel_krempp.htm">Samuel Krempp</a>.</p>
+      <td><a href="../../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <h1>Boost Format library</h1>
+
+  <p>The format library provides a class for formatting arguments according
+  to a format-string, as does printf, but with two major differences
+  :<br></p>
+
+  <ul>
+    <li>format sends the arguments to an internal stream, and so is entirely
+    type-safe and naturally supports all user-defined types.</li>
+
+    <li>The ellipsis (...) can not be used correctly in the strongly typed
+    context of format, and thus the function call with arbitrary arguments is
+    replaced by successive calls to an <i>argument feeding</i>
+    <b>operator%</b></li>
+  </ul>
+
+  <p><br>
+  You can find more Details in :</p>
+
+  <ul>
+    <li><a href="doc/format.html">Documentation</a> (HTML).</li>
+
+    <li>Headers
+
+      <ul>
+        <li><a href="../../boost/format.hpp">format.hpp</a> : user
+        frontend.</li>
+
+        <li><a href="../../boost/format/format_fwd.hpp">format_fwd.hpp</a> :
+        user forward declarations.</li>
+
+        <li><a href=
+        "../../boost/format/format_class.hpp">format_class.hpp</a> : the
+        class interface</li>
+
+        <li><a href=
+        "../../boost/format/format_implementation.hpp">format_implementation.hpp</a>:
+        implementation of the member functions</li>
+
+        <li><a href="../../boost/format/feed_args.hpp">feed_args.hpp</a> :
+        argument feeding helper functions</li>
+
+        <li><a href="../../boost/format/free_funcs.hpp">free_funcs.hpp</a> :
+        free functions definitions</li>
+
+        <li><a href="../../boost/format/parsing.hpp">parsing.hpp</a> : code
+        for parsing format-strings</li>
+
+        <li><a href="../../boost/format/group.hpp">group.hpp</a> : auxiliary
+        struct used to group arguments and manipulators</li>
+
+        <li><a href="../../boost/format/exceptions.hpp">exceptions.hpp</a> :
+        exceptions used by the library</li>
+
+        <li><a href="../../boost/format/internals.hpp">internals.hpp</a> :
+        auxiliary structs stream_format_state and format_item</li>
+      </ul>
+    </li>
+
+    <li>Sample programs
+
+      <ul>
+        <li>The program <a href=
+        "./example/sample_formats.cpp">sample_formats.cpp</a> demonstrates
+        simple uses of <b>format</b>.</li>
+
+        <li><a href=
+        "./example/sample_new_features.cpp">sample_new_features.cpp</a>
+        illustrates the few formatting features that were added to printf's
+        syntax such as simple positional directives, centered alignment, and
+        'tabulations'.</li>
+
+        <li><a href="./example/sample_advanced.cpp">sample_advanced.cpp</a>
+        demonstrates uses of advanced features, like reusing, and modifying,
+        format objects, etc..</li>
+
+        <li>And <a href=
+        "./example/sample_userType.cpp">sample_userType.cpp</a> shows the
+        behaviour of the <b>format</b> library on user-defined types.</li>
+      </ul>
+    </li>
+  </ul>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->02 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38510" --></p>
+
+  <p><i>Copyright &copy; 2003 Samuel Krempp</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
-
 </html>

Deleted: boost/trunk/libs/format/test/Jamfile
===================================================================
--- boost/trunk/libs/format/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/format/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,49 +0,0 @@
-#  Boost.Bind Library test Jamfile
-#
-#  Copyright (c) 2003 Samuel Krempp
-#
-#  Permission to copy, use, modify, sell and distribute this software
-#  is granted provided this copyright notice appears in all copies.
-#  This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
-
-subproject libs/format/test ;
-
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-
-test-suite "format"
-   :    [  run format_test1.cpp 
-                <lib>../../../libs/test/build/boost_test_exec_monitor
-              : # args
-              : # input files
-              : std::locale-support
-        ]
-
-        [ run format_test2.cpp 
-                <lib>../../../libs/test/build/boost_test_exec_monitor
-              : # args
-              : # input files
-              : std::locale-support
-        ]
-
-        [ run format_test3.cpp 
-                <lib>../../../libs/test/build/boost_test_exec_monitor
-              : # args
-              : # input files
-              : std::locale-support
-        ]
-
-        [ run format_test_wstring.cpp 
-                <lib>../../../libs/test/build/boost_test_exec_monitor
-              : # args
-              : # input files
-              : std::locale-support
-        ]
-  ;
-}
-

Modified: boost/trunk/libs/format/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/format/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/format/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,43 +1,23 @@
-#  Boost.Bind Library test Jamfile
+#  Boost.Format Library test Jamfile
 #
 #  Copyright (c) 2003 Samuel Krempp
 #
-#  Permission to copy, use, modify, sell and distribute this software
-#  is granted provided this copyright notice appears in all copies.
-#  This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+#  Distributed under the Boost Software License, Version 1.0. (See accompany-
+#  ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
+project
+    : requirements 
+      <library>/boost/test//boost_test_exec_monitor/<link>static
+    ;
+
 import testing ;
 {
 
 test-suite "format"
-   :    [  run format_test1.cpp 
-                ../../../libs/test/build//boost_test_exec_monitor
-              : # args
-              : # input files
-#              : std::locale-support
-        ]
-
-        [ run format_test2.cpp 
-                ../../../libs/test/build//boost_test_exec_monitor
-              : # args
-              : # input files
-#              : std::locale-support
-        ]
-
-        [ run format_test3.cpp 
-                ../../../libs/test/build//boost_test_exec_monitor
-              : # args
-              : # input files
-#              : std::locale-support
-        ]
-
-        [ run format_test_wstring.cpp 
-                ../../../libs/test/build//boost_test_exec_monitor
-              : # args
-              : # input files
-#              : std::locale-support
-        ]
+   :    [ run format_test1.cpp ]
+        [ run format_test2.cpp ]
+        [ run format_test3.cpp ]
+        [ run format_test_wstring.cpp ]
   ;
 }
 

Modified: boost/trunk/libs/format/test/format_test3.cpp
===================================================================
--- boost/trunk/libs/format/test/format_test3.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/format/test/format_test3.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -100,5 +100,14 @@
     f.bind_arg(1, x);
     f.clear();
 
+    // testcase for bug reported at
+    // http://lists.boost.org/boost-users/2005/11/15454.php
+    std::string l_param;
+    std::string l_str = (boost::format("here is an empty string: %1%") % l_param).str(); 
+
+    // testcase for SourceForge bug #1506914
+    std::string arg; // empty string  
+    s = str(format("%=8s") % arg);
+
     return 0;
 }

Modified: boost/trunk/libs/function/doc/Jamfile.v2
===================================================================
--- boost/trunk/libs/function/doc/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/function/doc/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+#   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+#   Distributed under the Boost Software License, Version 1.0.
+#   (See accompanying file LICENSE_1_0.txt or copy at
+#   http://www.boost.org/LICENSE_1_0.txt)
 project boost/doc ;
 import boostbook : boostbook ;
 

Modified: boost/trunk/libs/function/doc/faq.xml
===================================================================
--- boost/trunk/libs/function/doc/faq.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/function/doc/faq.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section id="function.faq" last-revision="$Date: 2004/02/18 06:37:13 $">
+<section id="function.faq" last-revision="$Date: 2006/11/03 19:41:09 $">
   <title>Frequently Asked Questions</title>
 
 <qandaset>

Modified: boost/trunk/libs/function/doc/history.xml
===================================================================
--- boost/trunk/libs/function/doc/history.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/function/doc/history.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section id="function.history" last-revision="$Date: 2006/01/10 23:52:35 $">
+<section id="function.history" last-revision="$Date: 2006/11/03 19:41:09 $">
   <title>History &amp; Compatibility Notes</title>
 
 <itemizedlist spacing="compact">

Modified: boost/trunk/libs/function/doc/misc.xml
===================================================================
--- boost/trunk/libs/function/doc/misc.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/function/doc/misc.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section id="function.misc" last-revision="$Date: 2003/03/12 23:27:22 $">
+<section id="function.misc" last-revision="$Date: 2006/11/03 19:41:09 $">
   <title>Miscellaneous Notes</title>
 
   <section>

Modified: boost/trunk/libs/function/doc/reference.xml
===================================================================
--- boost/trunk/libs/function/doc/reference.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/function/doc/reference.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
 
-<library-reference id="function.reference" last-revision="$Date: 2006/01/10 23:52:35 $">
+<library-reference id="function.reference" last-revision="$Date: 2006/11/03 19:41:09 $">
 
 <section id="function.definitions">
   <title>Definitions</title>

Modified: boost/trunk/libs/function/doc/tests.xml
===================================================================
--- boost/trunk/libs/function/doc/tests.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/function/doc/tests.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<testsuite id="function.testsuite" last-revision="$Date: 2004/01/25 00:38:26 $">
+<testsuite id="function.testsuite" last-revision="$Date: 2006/11/03 19:41:10 $">
   <run-test filename="function_test.cpp" name="lib_function_test">
     <purpose><para>Test the capabilities of the <classname>boost::function</classname> class template.</para></purpose>
     <if-fails><para>The <classname>boost::function</classname> class template may not be usable on your compiler. However, the library may still be usable via the <classname>boost::functionN</classname> class templates.</para></if-fails>

Modified: boost/trunk/libs/function/doc/tutorial.xml
===================================================================
--- boost/trunk/libs/function/doc/tutorial.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/function/doc/tutorial.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
 <section xmlns:xi="http://www.w3.org/2001/XInclude" id="function.tutorial"
-         last-revision="$Date: 2005/03/18 04:54:32 $">
+         last-revision="$Date: 2006/11/03 19:41:10 $">
 <title>Tutorial</title>
 
 <using-namespace name="boost"/>

Modified: boost/trunk/libs/function/index.html
===================================================================
--- boost/trunk/libs/function/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/function/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,20 @@
 <html>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <head>
 <meta http-equiv="refresh" content="0; URL=../../doc/html/function.html">
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="../../doc/html/function.html">../../doc/html/function.html</a>
+<a href="../../doc/html/function.html">../../doc/html/function.html</a> &nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
-</html>
+</html>
\ No newline at end of file

Deleted: boost/trunk/libs/function/test/Jamfile
===================================================================
--- boost/trunk/libs/function/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/function/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,68 +0,0 @@
-# Function library
-
-# Copyright (C) 2001-2003 Douglas Gregor
-
-# Use, modification and distribution is subject to the Boost Software License, 
-# Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at 
-# http://www.boost.org/LICENSE_1_0.txt) 
-
-# For more information, see http://www.boost.org/
-
-
-# Testing Jamfile autogenerated from XML source
-subproject libs/function/test ;
-
-# bring in rules for testing
-SEARCH on testing.jam = $(BOOST_BUILD_PATH) ;
-include testing.jam ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-  # look in BOOST_ROOT for sources first, just in this Jamfile
-  local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-
-  test-suite function
-    : 
-  [ run libs/function/test/function_test.cpp :  :  :  : lib_function_test ]
-
-  [ run libs/function/test/function_n_test.cpp :  :  :  :  ]
-
-  [ run libs/function/test/allocator_test.cpp :  :  :  :  ]
-
-  [ run libs/function/test/stateless_test.cpp :  :  :  :  ]
-
-  [ run libs/function/test/lambda_test.cpp :  :  :  :  ]
-
-  [ compile-fail libs/function/test/function_test_fail1.cpp :  :  :  :  ]
-
-  [ compile-fail libs/function/test/function_test_fail2.cpp :  :  :  :  ]
-
-  [ compile libs/function/test/function_30.cpp :  :  :  :  ] 
-
-  [ run libs/function/test/function_arith_cxx98.cpp :  :  :  :  ]
-
-  [ run libs/function/test/function_arith_portable.cpp :  :  :  :  ]
-
-  [ run libs/function/test/sum_avg_cxx98.cpp :  :  :  :  ]
-
-  [ run libs/function/test/sum_avg_portable.cpp :  :  :  :  ]
-
-  [ run libs/function/test/mem_fun_cxx98.cpp :  :  :  :  ]
-
-  [ run libs/function/test/mem_fun_portable.cpp :  :  :  :  ]
-
-  [ run libs/function/test/std_bind_cxx98.cpp :  :  :  :  ]
-
-  [ run libs/function/test/std_bind_portable.cpp :  :  :  :  ]
-
-  [ run libs/function/test/function_ref_cxx98.cpp :  :  :  :  ]
-
-  [ run libs/function/test/function_ref_portable.cpp :  :  :  :  ]
-
-  [ run libs/function/test/contains_test.cpp : : : : ]
-
-  [ run libs/function/test/contains2_test.cpp : : : : ]
- ;
-}

Modified: boost/trunk/libs/functional/binders.html
===================================================================
--- boost/trunk/libs/functional/binders.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/binders.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,132 +1,161 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<title>Boost Function Object Adapter Library</title>
+  <title>Boost Function Object Adapter Library</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-<table border="1" bgcolor="#007F7F" cellpadding="2">
-  <tr>
-    <td bgcolor="#FFFFFF"><img src="../../boost.png" alt="boost.png (6897 bytes)" WIDTH="277" HEIGHT="86"></td>
-    <td><a href="../../index.htm"><font face="Arial" color="#FFFFFF"><big>Home </big></font></a></td>
-    <td><a href="../libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries </big></font></a></td>
-    <td><a href="../../people/people.htm"><font face="Arial" color="#FFFFFF"><big>People </big></font></a></td>
-    <td><a href="../../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ </big></font></a></td>
-    <td><a href="../../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More </big></font></a></td>
-  </tr>
-</table>
+      <td><a href="../../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-<h1>Binders</h1>
+      <td><a href="../libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
 
-<p>The header <nobr><a
-href="../../boost/functional.hpp">functional.hpp</a></nobr> provides
-enhanced versions of both the binder function object adapters from the
-C++ Standard Library <nobr>(&sect;20.3.6):</nobr></p>
+      <td><a href="../../people/people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
 
-<ul>
-<li><tt>binder1st</tt></li>
-<li><tt>binder2nd</tt></li>
-</ul>
+      <td><a href="../../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
 
-<p>As well as the corresponding helper functions</p>
+      <td><a href="../../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
 
-<ul>
-<li><tt>bind1st</tt></li>
-<li><tt>bind2nd</tt></li>
-</ul>
+  <h1>Binders</h1>
 
-<p>The key benefit of these adapters over those in the Standard
-Library is they avoid the problem of <a href="#refref">references to
-references.</a>
+  <p>The header <a href="../../boost/functional.hpp">functional.hpp</a>
+  provides enhanced versions of both the binder function object adapters from
+  the C++ Standard Library (&sect;20.3.6):</p>
 
-<h3>Usage</h3>
+  <ul>
+    <li><tt>binder1st</tt></li>
 
-<p>Usage is identical to the standard binders.  For example,</p>
+    <li><tt>binder2nd</tt></li>
+  </ul>
 
-<blockquote><pre>
+  <p>As well as the corresponding helper functions</p>
+
+  <ul>
+    <li><tt>bind1st</tt></li>
+
+    <li><tt>bind2nd</tt></li>
+  </ul>
+
+  <p>The key benefit of these adapters over those in the Standard Library is
+  they avoid the problem of <a href="#refref">references to
+  references.</a></p>
+
+  <h3>Usage</h3>
+
+  <p>Usage is identical to the standard binders. For example,</p>
+
+  <blockquote>
+    <pre>
 class Foo {
 public:
-  void bar(std::ostream &);
+  void bar(std::ostream &amp;);
   // ...
 };
 // ...
 std::vector&lt;Foo&gt; c;
 // ...
 std::for_each(c.begin(), c.end(), 
-              boost::bind2nd(boost::mem_fun_ref(&Foo::bar), std::cout));
-</pre></blockquote>
+              boost::bind2nd(boost::mem_fun_ref(&amp;Foo::bar), std::cout));
+</pre>
+  </blockquote>
 
-<h3 id="refref">References to References</h3>
+  <h3 id="refref">References to References</h3>
 
-<p>Consider the usage example above</p>
+  <p>Consider the usage example above</p>
 
-<blockquote><pre>
+  <blockquote>
+    <pre>
 class Foo {
 public:
-  void bar(<strong>std::ostream &</strong>);
+  void bar(<strong>std::ostream &amp;</strong>);
   // ...
 };
 // ...
 std::for_each(c.begin(), c.end(), 
-              boost::bind2nd(boost::mem_fun_ref(&Foo::bar), std::cout));
-</pre></blockquote>
+              boost::bind2nd(boost::mem_fun_ref(&amp;Foo::bar), std::cout));
+</pre>
+  </blockquote>
 
-<p>If this had been written using <tt><nobr>std::bind2nd</nobr></tt>
-and <tt><nobr>std::mem_fun_ref</nobr></tt>, it would be unlikely to
-compile.</p>
+  <p>If this had been written using <tt>std::bind2nd</tt> and
+  <tt>std::mem_fun_ref</tt>, it would be unlikely to compile.</p>
 
-<p>The problem arises because <tt><nobr>bar</nobr></tt> takes a
-reference argument.  The Standard defines
-<tt><nobr>std::mem_fun_ref</nobr></tt> such that it creates a function
-object whose <tt><nobr>second_argument_type</nobr></tt> will be
-<tt><nobr>std::ostream&</nobr></tt>.</p>
+  <p>The problem arises because <tt>bar</tt> takes a reference argument. The
+  Standard defines <tt>std::mem_fun_ref</tt> such that it creates a function
+  object whose <tt>second_argument_type</tt> will be
+  <tt>std::ostream&amp;</tt>.</p>
 
-<p>The call to <tt><nobr>bind2nd</nobr></tt> creates a
-<tt><nobr>binder2nd</nobr></tt> which the Standard defines as follows:
+  <p>The call to <tt>bind2nd</tt> creates a <tt>binder2nd</tt> which the
+  Standard defines as follows:</p>
 
-<blockquote><pre>
+  <blockquote>
+    <pre>
 template &lt;class Operation&gt;
 class binder2nd
     : public unary_function&lt;typename Operation::first_argument_type,
                             typename Operation::result_type&gt; {
 ...
 public:
-  binder2nd(const Operation& x,
-            <strong>const typename Operation::second_argument_type& y</strong>);
+  binder2nd(const Operation&amp; x,
+            <strong>const typename Operation::second_argument_type&amp; y</strong>);
   ...
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<p>Since our operation's <tt><nobr>second_argument_type</nobr></tt> is
-<tt><nobr>std::ostream&</nobr></tt>, the type of <tt>y</tt> in the
-constructor would be <tt><nobr>std::ostream&&</nobr></tt>.  Since you
-cannot have a reference to a reference, at this point we should get a
-compilation error because references to references are illegal in C++
-(but see <a
-href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_active.html#106">
-C++ Standard core language active issues list</a>).</p>
+  <p>Since our operation's <tt>second_argument_type</tt> is
+  <tt>std::ostream&amp;</tt>, the type of <tt>y</tt> in the constructor would
+  be <tt>std::ostream&amp;&amp;</tt>. Since you cannot have a reference to a
+  reference, at this point we should get a compilation error because
+  references to references are illegal in C++ (but see <a href=
+  "http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_active.html#106">C++
+  Standard core language active issues list</a>).</p>
 
-<p>The binders in this library avoid this problem by using the Boost
-<nobr><tt><a
-href="../utility/call_traits.htm">call_traits</a></tt></nobr> templates.</p>
+  <p>The binders in this library avoid this problem by using the Boost
+  <tt><a href="../utility/call_traits.htm">call_traits</a></tt>
+  templates.</p>
 
-<p>Our constructor is declared
+  <p>Our constructor is declared</p>
 
-<blockquote><pre>
-binder2nd(const Operation& x,
+  <blockquote>
+    <pre>
+binder2nd(const Operation&amp; x,
           <strong>typename call_traits&lt;
              typename binary_traits&lt;Operation&gt;::second_argument_type
           &gt;::param_type y</strong>)
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<p>As a result, <tt>y</tt> has a type of <tt><nobr>std::ostream&</nobr></tt>, 
-and our example compiles.</p>
+  <p>As a result, <tt>y</tt> has a type of <tt>std::ostream&amp;</tt>, and
+  our example compiles.</p>
+  <hr>
 
-<hr>
-<p>Copyright &copy; 2000 Cadenza New Zealand Ltd.  Permission to copy, use, modify, sell and distribute this document is granted provided this copyright notice appears in all copies. This document is provided "as is" without express or implied warranty, and with no claim as to its suitability for any purpose.</p>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<p>Revised 28 June 2000</p>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->02
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38510" --></p>
 
+  <p><i>Copyright &copy; 2000 Cadenza New Zealand Ltd.</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/functional/function_test.cpp
===================================================================
--- boost/trunk/libs/functional/function_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/function_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,25 +1,102 @@
 // ------------------------------------------------------------------------------
+// Copyright (c) 2000 Cadenza New Zealand Ltd
+// Distributed under the Boost Software License, Version 1.0. (See accompany-
+// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+// ------------------------------------------------------------------------------
 // Tests for the Boost functional.hpp header file
 //
 // Note that functional.hpp relies on partial specialisation to be
 // effective.  If your compiler lacks this feature, very few of the
 // tests would compile, and so have been excluded from the test.
 // ------------------------------------------------------------------------------
-// Copyright (c) 2000
-// Cadenza New Zealand Ltd
-//
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without
-// fee, provided that the above copyright notice appears in all copies
-// and that both the copyright notice and this permission notice
-// appear in supporting documentation.  Cadenza New Zealand Ltd makes
-// no representations about the suitability of this software for any
-// purpose.  It is provided "as is" without express or implied
-// warranty.
+// $Id: function_test.cpp,v 1.2.24.1 2006/12/02 14:17:26 andreas_huber69 Exp $
 // ------------------------------------------------------------------------------
-// $Id: function_test.cpp,v 1.2 2001/09/22 11:52:24 johnmaddock Exp $
-// ------------------------------------------------------------------------------
 // $Log: function_test.cpp,v $
+// Revision 1.2.24.1  2006/12/02 14:17:26  andreas_huber69
+// Merged L & C issue fixes from trunk to branch.
+//
+// Revision 1.3  2006/12/02 13:57:32  andreas_huber69
+// Fixed license & copyright issues.
+//
+// From Mark Rodgers Fri Dec 1 12:59:14 2006
+// X-Apparently-To: ahd6974-boostorg -at- yahoo.com via 68.142.206.160; Fri, 01 Dec 2006 12:59:41 -0800
+// X-Originating-IP: [195.112.4.54]
+// Return-Path: <mark.rodgers -at- cadenza.co.nz>
+// Authentication-Results: mta550.mail.mud.yahoo.com from=cadenza.co.nz; domainkeys=neutral (no sig)
+// Received: from 195.112.4.54 (EHLO smtp.nildram.co.uk) (195.112.4.54) by mta550.mail.mud.yahoo.com with SMTP; Fri, 01 Dec 2006 12:59:40 -0800
+// Received: from snagglepuss.cadenza.co.nz (81-6-246-87.dyn.gotadsl.co.uk [81.6.246.87]) by smtp.nildram.co.uk (Postfix) with ESMTP id D32EA2B6D8C for <ahd6974-boostorg -at- yahoo.com>; Fri, 1 Dec 2006 20:59:35 +0000 (GMT)
+// Received: from penfold.cadenza.co.nz ([192.168.55.56]) by snagglepuss.cadenza.co.nz with esmtp (Exim 4.63) (envelope-from <mark.rodgers -at- cadenza.co.nz>) id J9M4Y9-0009TO-9K for ahd6974-boostorg -at- yahoo.com; Fri, 01 Dec 2006 20:58:57 +0000
+// Message-ID: <457097A2.1090305 at cadenza.co.nz>
+// Date: Fri, 01 Dec 2006 20:59:14 +0000
+// From: "Mark Rodgers" <mark.rodgers -at- cadenza.co.nz>
+// User-Agent: Thunderbird 1.5.0.8 (Macintosh/20061025)
+// MIME-Version: 1.0
+// To: ahd6974-boostorg -at- yahoo.com [Edit - Delete]
+// Subject: Re: [boost] Reminder: Need your permission to correct license & copyright issues
+// References: <379990.36007.qm at web33507.mail.mud.yahoo.com>
+// In-Reply-To: <379990.36007.qm at web33507.mail.mud.yahoo.com>
+// Content-Type: text/plain; charset=ISO-8859-1; format=flowed
+// Content-Transfer-Encoding: 7bit
+// Content-Length: 812
+// Gidday Andreas
+//
+// Sure that's fine.  I'm happy for you to do 1, 2 and 3.
+//
+// Regards
+// Mark
+//
+// Andreas Huber wrote:
+// > Hello Mark
+// >
+// > Quite a while ago it was decided that every file that goes into the
+// > 1.34 release of the Boost distribution (www.boost.org) needs uniform
+// > license and copyright information. For more information please see:
+// >
+// > <http://www.boost.org/more/license_info.html>
+// >
+// > You are receiving this email because several files you contributed
+// > lack such information or have an old license:
+// >
+// > boost/functional/functional.hpp
+// > boost/libs/functional/binders.html
+// > boost/libs/functional/function_test.cpp
+// > boost/libs/functional/function_traits.html
+// > boost/libs/functional/index.html
+// > boost/libs/functional/mem_fun.html
+// > boost/libs/functional/negators.html
+// > boost/libs/functional/ptr_fun.html
+// > boost/people/mark_rodgers.htm
+// >
+// > I therefore kindly ask you to grant the permission to do the
+// > following:
+// >
+// > 1. For the files above that already have a license text (all except
+// > mark_rodgers.htm), replace the license text with:
+// >
+// > "Distributed under the Boost Software License, Version 1.0. (See
+// > accompanying file LICENSE_1_0.txt or copy at
+// > http://www.boost.org/LICENSE_1_0.txt)"
+// >
+// > 2. For the file that does not yet have a license and copyright
+// > (mark_rodgers.htm) add the same license text as under 1. and add the
+// > following copyright:
+// >
+// > "(c) Copyright Mark Rodgers 2000"
+// >
+// > 3. (Optional) I would also want to convert all HTML files to conform
+// > the HTML 4.01 Standard by running them through HTML Tidy, see
+// > <http://tidy.sf.net>
+// >
+// > It would be great if you could grant me permission to do 1 & 2 and
+// > optionally also 3.
+// >
+// > Thank you!
+// >
+// > Regards,
+// >
+// > Andreas Huber
+// >
+//
 // Revision 1.2  2001/09/22 11:52:24  johnmaddock
 // Intel C++ fixes: no void return types supported.
 //

Modified: boost/trunk/libs/functional/function_traits.html
===================================================================
--- boost/trunk/libs/functional/function_traits.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/function_traits.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,137 +1,166 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<title>Boost Function Object Adapter Library</title>
+  <title>Boost Function Object Adapter Library</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-<table border="1" bgcolor="#007F7F" cellpadding="2">
-  <tr>
-    <td bgcolor="#FFFFFF"><img src="../../boost.png" alt="boost.png (6897 bytes)" WIDTH="277" HEIGHT="86"></td>
-    <td><a href="../../index.htm"><font face="Arial" color="#FFFFFF"><big>Home </big></font></a></td>
-    <td><a href="../libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries </big></font></a></td>
-    <td><a href="../../people/people.htm"><font face="Arial" color="#FFFFFF"><big>People </big></font></a></td>
-    <td><a href="../../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ </big></font></a></td>
-    <td><a href="../../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More </big></font></a></td>
-  </tr>
-</table>
+      <td><a href="../../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-<h1>Function Object Traits</h1>
+      <td><a href="../libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
 
-<p>The header <nobr><a
-href="../../boost/functional.hpp">functional.hpp</a></nobr> provides two
-traits class templates for functions and function objects:</p>
+      <td><a href="../../people/people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
 
-<table border="1">
-<tr>
-	<th>Type</th>
-	<th>Contents</th>
-	<th>Description</th>
-</tr>
-<tr>
-	<td valign="top" rowspan="4"><tt><nobr>template &lt;typename T&gt;</nobr><br><nobr>struct unary_traits<nobr></tt>
-	</td>
-	<td valign="top"><tt><nobr>function_type</nobr></tt>
-	</td>
-	<td valign="top">The type of the function or function object itself (i.e., <tt>T</tt>).
-	</td>
-</tr>
-<tr>
-	<td valign="top"><tt><nobr>param_type</nobr></tt>
-	</td>
-	<td valign="top">The type that should be used to pass the function or function object as a parameter.
-	</td>
-</tr>
-<tr>
-	<td valign="top"><tt><nobr>result_type</nobr></tt>
-	</td>
-	<td valign="top">The type returned by the function or function object.
-	</td>
-</tr>
-<tr>
-	<td valign="top"><tt><nobr>argument_type</nobr></tt>
-	</td>
-	<td valign="top">The type of the argument to the function or function object.
-	</td>
-</tr>
-<tr>
-	<td valign="top" rowspan="5"><tt><nobr>template &lt;typename T&gt;</nobr><br><nobr>struct binary_traits<nobr></tt>
-	</td>
-	<td valign="top"><tt><nobr>function_type</nobr></tt>
-	</td>
-	<td valign="top">The type of the function or function object itself (i.e., <tt>T</tt>).
-	</td>
-</tr>
-<tr>
-	<td valign="top"><tt><nobr>param_type</nobr></tt>
-	</td>
-	<td valign="top">The type that should be used to pass the function or function object as a parameter.
-	</td>
-</tr>
-<tr>
-	<td valign="top"><tt><nobr>result_type</nobr></tt>
-	</td>
-	<td valign="top">The type returned by the function or function object.
-	</td>
-</tr>
-<tr>
-	<td valign="top"><tt><nobr>first_argument_type</nobr></tt>
-	</td>
-	<td valign="top">The type of the first argument to the function or function object.
-	</td>
-</tr>
-<tr>
-	<td valign="top"><tt><nobr>second_argument_type</nobr></tt>
-	</td>
-	<td valign="top">The type of the second argument to the function or function object.
-	</td>
-</tr>
-</table>
+      <td><a href="../../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
 
-<h3>Usage</h3>
+      <td><a href="../../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
 
-<p><tt><nobr>unary_traits</nobr></tt> should be instantiated with
-either a function taking a single parameter, or an adaptable unary
-function object (i.e., a class derived from
-<tt><nobr>std::unary_function</nobr></tt> or one which provides the
-same typedefs).  (See &sect;20.3.1 in the C++ Standard.)
+  <h1>Function Object Traits</h1>
 
-<p><tt><nobr>binary_traits</nobr></tt> should be instantiated with
-either a function taking two parameters, or an adaptable binary
-function object (i.e., a class derived from
-<tt><nobr>std::binary_function</nobr></tt> or one which provides the
-same typedefs).  (See &sect;20.3.1 in the C++ Standard.)
+  <p>The header <a href="../../boost/functional.hpp">functional.hpp</a>
+  provides two traits class templates for functions and function objects:</p>
 
-<p>The most common usage of these templates is in function object
-adapters, thus allowing them to adapt plain functions as well as
-function objects.  You can do this by wherever you would normally
-write, for example,
+  <table border="1" summary="">
+    <tr>
+      <th>Type</th>
 
-<blockquote><pre>
+      <th>Contents</th>
+
+      <th>Description</th>
+    </tr>
+
+    <tr>
+      <td valign="top" rowspan="4">
+      <tt>template&nbsp;&lt;typename&nbsp;T&gt;<br>
+      struct&nbsp;unary_traits</tt></td>
+
+      <td valign="top"><tt>function_type</tt></td>
+
+      <td valign="top">The type of the function or function object itself
+      (i.e., <tt>T</tt>).</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>param_type</tt></td>
+
+      <td valign="top">The type that should be used to pass the function or
+      function object as a parameter.</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>result_type</tt></td>
+
+      <td valign="top">The type returned by the function or function
+      object.</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>argument_type</tt></td>
+
+      <td valign="top">The type of the argument to the function or function
+      object.</td>
+    </tr>
+
+    <tr>
+      <td valign="top" rowspan="5">
+      <tt>template&nbsp;&lt;typename&nbsp;T&gt;<br>
+      struct&nbsp;binary_traits</tt></td>
+
+      <td valign="top"><tt>function_type</tt></td>
+
+      <td valign="top">The type of the function or function object itself
+      (i.e., <tt>T</tt>).</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>param_type</tt></td>
+
+      <td valign="top">The type that should be used to pass the function or
+      function object as a parameter.</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>result_type</tt></td>
+
+      <td valign="top">The type returned by the function or function
+      object.</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>first_argument_type</tt></td>
+
+      <td valign="top">The type of the first argument to the function or
+      function object.</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>second_argument_type</tt></td>
+
+      <td valign="top">The type of the second argument to the function or
+      function object.</td>
+    </tr>
+  </table>
+
+  <h3>Usage</h3>
+
+  <p><tt>unary_traits</tt> should be instantiated with either a function
+  taking a single parameter, or an adaptable unary function object (i.e., a
+  class derived from <tt>std::unary_function</tt> or one which provides the
+  same typedefs). (See &sect;20.3.1 in the C++ Standard.)</p>
+
+  <p><tt>binary_traits</tt> should be instantiated with either a function
+  taking two parameters, or an adaptable binary function object (i.e., a
+  class derived from <tt>std::binary_function</tt> or one which provides the
+  same typedefs). (See &sect;20.3.1 in the C++ Standard.)</p>
+
+  <p>The most common usage of these templates is in function object adapters,
+  thus allowing them to adapt plain functions as well as function objects.
+  You can do this by wherever you would normally write, for example,</p>
+
+  <blockquote>
+    <pre>
 typename Operation::argument_type
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<p>simply writing
+  <p>simply writing</p>
 
-<blockquote><pre>
+  <blockquote>
+    <pre>
 typename boost::unary_traits&lt;Operation&gt;::argument_type
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<p>instead.
+  <p>instead.</p>
 
-<h3>Additional Types Defined</h3>
+  <h3>Additional Types Defined</h3>
 
-<p>In addition to the standard result and argument typedefs, these
-traits templates define two additional types.
+  <p>In addition to the standard result and argument typedefs, these traits
+  templates define two additional types.</p>
 
-<h4><tt>function_type</tt></h4>
+  <h4><tt>function_type</tt></h4>
 
-<p>This is the type of the function or function object, and can be
-used in declarations such as</p>
+  <p>This is the type of the function or function object, and can be used in
+  declarations such as</p>
 
-<blockquote><pre>
+  <blockquote>
+    <pre>
 template &lt;class Predicate&gt;
 class unary_negate : // ...
 {
@@ -139,19 +168,21 @@
   private:
     <strong>typename unary_traits&lt;Predicate&gt;::function_type</strong> pred;
 };
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<p>If this typedef were not provided, it would not be possible to
-declare <tt>pred</tt> in a way that would allow
-<tt><nobr>unary_negate</nobr></tt> to be instantiated with a function
-type (see the C++ Standard &sect;14.3.1 &para;3).
+  <p>If this typedef were not provided, it would not be possible to declare
+  <tt>pred</tt> in a way that would allow <tt>unary_negate</tt> to be
+  instantiated with a function type (see the C++ Standard &sect;14.3.1
+  &para;3).</p>
 
-<h4><tt>param_type</tt></h4>
+  <h4><tt>param_type</tt></h4>
 
-<p>This is a type suitable for passing the function or function object
-as a parameter to another function.  For example,
+  <p>This is a type suitable for passing the function or function object as a
+  parameter to another function. For example,</p>
 
-<blockquote><pre>
+  <blockquote>
+    <pre>
 template &lt;class Predicate&gt;
 class unary_negate : // ...
 {
@@ -162,35 +193,41 @@
     {}
     // ...
 };
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<p>Function objects are passed by reference to const; function
-pointers are passed by value.</p>
+  <p>Function objects are passed by reference to const; function pointers are
+  passed by value.</p>
 
+  <h3>Limitations</h3>
 
-<h3>Limitations</h3>
+  <p>This library uses these traits within all function object adapters,
+  theoretically rendering <tt>ptr_fun</tt> obsolete. However, third party
+  adapters probably won't take advantage of this mechanism, and so
+  <tt>ptr_fun</tt> may still be required. Accordingly, this library also
+  provides <a href="ptr_fun.html">improved versions of the standard function
+  pointer adapters</a>.</p>
 
-<p>This library uses these traits within all function object adapters,
-theoretically rendering <tt><nobr>ptr_fun</nobr></tt> obsolete.
-However, third party adapters probably won't take advantage of this
-mechanism, and so <tt><nobr>ptr_fun</nobr></tt> may still be required.
-Accordingly, this library also provides <a
-href="ptr_fun.html">improved versions of the standard function pointer
-adapters</a>.</p>
+  <p>These traits templates will also not work with compilers that fail to
+  support partial specialisation of templates. With these compilers, the
+  traits templates can only be instantiated with adaptable function objects,
+  thus requiring <tt>ptr_fun</tt> to be used, even with the function object
+  adapters in this library.</p>
+  <hr>
 
-<p>These traits templates will also not work with compilers that fail
-to support partial specialisation of templates.  With these compilers,
-the traits templates can only be instantiated with adaptable function
-objects, thus requiring <tt><nobr>ptr_fun</nobr></tt> to be used, even
-with the function object adapters in this library.
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<hr>
-<p>Copyright &copy; 2000 Cadenza New Zealand Ltd.  Permission to copy,
-use, modify, sell and distribute this document is granted provided
-this copyright notice appears in all copies. This document is provided
-"as is" without express or implied warranty, and with no claim as to
-its suitability for any purpose.</p>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->02
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38510" --></p>
 
-<p>Revised 28 June 2000</p>
+  <p><i>Copyright &copy; 2000 Cadenza New Zealand Ltd.</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/functional/hash/doc/changes.qbk
===================================================================
--- boost/trunk/libs/functional/hash/doc/changes.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/hash/doc/changes.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+
+[/ Copyright 2005-2006 Daniel James.
+ / Distributed under the Boost Software License, Version 1.0. (See accompanying
+ / file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) ]
+
 [section:changes Change Log]
 
 [h2 Boost 1.33.0]

Modified: boost/trunk/libs/functional/hash/doc/disable.qbk
===================================================================
--- boost/trunk/libs/functional/hash/doc/disable.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/hash/doc/disable.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+
+[/ Copyright 2005-2006 Daniel James.
+ / Distributed under the Boost Software License, Version 1.0. (See accompanying
+ / file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) ]
+
 [section:disable Disabling The Extensions]
 
 While [classref boost::hash]'s extensions are generally useful, you might want

Modified: boost/trunk/libs/functional/hash/doc/intro.qbk
===================================================================
--- boost/trunk/libs/functional/hash/doc/intro.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/hash/doc/intro.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+
+[/ Copyright 2005-2006 Daniel James.
+ / Distributed under the Boost Software License, Version 1.0. (See accompanying
+ / file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) ]
+
 [section:intro Introduction]
 
 [def __tr1-full__

Modified: boost/trunk/libs/functional/hash/doc/links.qbk
===================================================================
--- boost/trunk/libs/functional/hash/doc/links.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/hash/doc/links.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+
+[/ Copyright 2005-2006 Daniel James.
+ / Distributed under the Boost Software License, Version 1.0. (See accompanying
+ / file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) ]
+
 [section:links Links]
 
 [*A Proposal to Add Hash Tables to the Standard Library]\n

Modified: boost/trunk/libs/functional/hash/doc/portability.qbk
===================================================================
--- boost/trunk/libs/functional/hash/doc/portability.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/hash/doc/portability.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+
+[/ Copyright 2005-2006 Daniel James.
+ / Distributed under the Boost Software License, Version 1.0. (See accompanying
+ / file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) ]
+
 [section:portability Portability]
 
 [def __boost_hash__ [classref boost::hash]]

Modified: boost/trunk/libs/functional/hash/doc/ref.xml
===================================================================
--- boost/trunk/libs/functional/hash/doc/ref.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/hash/doc/ref.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+<!--
+Copyright 2005-2006 Daniel James.
+Distributed under the Boost Software License, Version 1.0. (See accompanying
+file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 <library-reference>
   <section id="hash.reference.specification">
     <para>For the full specification, see section 6.3 of the

Modified: boost/trunk/libs/functional/hash/doc/thanks.qbk
===================================================================
--- boost/trunk/libs/functional/hash/doc/thanks.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/hash/doc/thanks.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,14 +1,20 @@
+
+[/ Copyright 2005-2006 Daniel James.
+ / Distributed under the Boost Software License, Version 1.0. (See accompanying
+ / file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) ]
+
 [section:acknowledgements Acknowledgements]
 
-This library is based on the design by Peter Dimov. During the initial
-development
-Joaquín M López Muñoz made many useful suggestions and contributed fixes.
+This library is based on the design by Peter Dimov's original design.
 
+During the initial development Joaquín M López Muñoz made many useful
+suggestions, contributed fixes.
+
 The formal review was managed by Thorsten Ottosen, and the library reviewed by:
 David Abrahams, Alberto Barbati, Topher Cooper, Caleb Epstein, Dave Harris,
-Chris Jefferson, Bronek Kozicki, John Maddock, Tobias Swinger, Jaap Suter,
-Rob Stewart and Pavel Vozenilek. Since then, further constructive criticism has
-been made by Daniel Krügler, Alexander Nasonov and 沈慧峰.
+Chris Jefferson, Bronek Kozicki, John Maddock, Tobias Swinger, Jaap Suter, Rob
+Stewart and Pavel Vozenilek. Since then, there have been further contributions
+from Daniel Krügler, Alexander Nasonov, 沈慧峰 and John Maddock.
 
 The implementation of the hash function for pointers is based on suggestions
 made by Alberto Barbati and Dave Harris. Dave Harris also suggested an

Modified: boost/trunk/libs/functional/hash/doc/tutorial.qbk
===================================================================
--- boost/trunk/libs/functional/hash/doc/tutorial.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/hash/doc/tutorial.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+
+[/ Copyright 2005-2006 Daniel James.
+ / Distributed under the Boost Software License, Version 1.0. (See accompanying
+ / file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) ]
+
 [def __multi-index-short__ [@../../libs/multi_index/doc/index.html
     Boost.MultiIndex]]
 

Deleted: boost/trunk/libs/functional/hash/examples/Jamfile
===================================================================
--- boost/trunk/libs/functional/hash/examples/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/hash/examples/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,28 +0,0 @@
-
-#  (C) Copyright Daniel James 2005.
-#  Use, modification and distribution are subject to the
-#  Boost Software License, Version 1.0. (See accompanying file
-#  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-subproject libs/functional/hash/examples ;
-
-import testing ;
-
-DEPENDS all : test ;
-
-rule hash-example ( name )
-{
-    return [
-        run $(name).cpp
-        : : : <include>$(BOOST_ROOT)
-        ] ;
-}
-
-{
-    test-suite functional/examples
-        :
-            [ hash-example books ]
-            [ hash-example point ]
-            [ hash-example portable ]
-        ;
-}

Modified: boost/trunk/libs/functional/hash/index.html
===================================================================
--- boost/trunk/libs/functional/hash/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/hash/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,10 @@
+
+<!--
+Copyright 2005-2006 Daniel James.
+Distributed under the Boost Software License, Version 1.0. (See accompanying
+file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 <html>
 <head>
     <meta http-equiv="refresh" content="0; URL=../../../doc/html/hash.html">

Deleted: boost/trunk/libs/functional/hash/test/Jamfile
===================================================================
--- boost/trunk/libs/functional/hash/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/hash/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,51 +0,0 @@
-
-#  Copyright Daniel James 2005-2006. Use, modification, and distribution are
-#  subject to the Boost Software License, Version 1.0. (See accompanying
-#  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-subproject libs/functional/hash/test ;
-
-import testing ;
-
-DEPENDS all : test ;
-
-rule hash-test ( names + : extras * )
-{
-    return [
-        run $(names).cpp
-        : : : <include>$(BOOST_ROOT) $(extras)
-        : $(names[1])
-        ] ;
-}
-
-{
-    test-suite functional/hash
-        :
-            [ hash-test hash_fwd_test_1 ]
-            [ hash-test hash_fwd_test_2 ]
-            [ hash-test hash_number_test ]
-            [ hash-test hash_pointer_test ]
-            [ hash-test hash_function_pointer_test ]
-            [ hash-test hash_float_test : <test-info>always_show_run_output ]
-            [ hash-test hash_string_test ]
-            [ hash-test hash_range_test ]
-            [ hash-test hash_custom_test ]
-            [ hash-test hash_global_namespace_test ]
-            [ hash-test hash_friend_test ]
-            [ hash-test hash_built_in_array_test ]
-            [ hash-test hash_value_array_test ]
-            [ hash-test hash_vector_test ]
-            [ hash-test hash_list_test ]
-            [ hash-test hash_deque_test ]
-            [ hash-test hash_set_test ]
-            [ hash-test hash_map_test ]
-            [ hash-test link_test link_test_2 ]
-            [ hash-test link_ext_test link_no_ext_test ]
-            [ run container_fwd_test.cpp : : : <include>$(BOOST_ROOT) ]
-            [ compile-fail hash_no_ext_fail_test.cpp ]
-            [ run hash_no_ext_macro_1.cpp ]
-            [ run hash_no_ext_macro_2.cpp ]
-        ;
-}
-
-subinclude libs/functional/hash/examples ;

Modified: boost/trunk/libs/functional/index.html
===================================================================
--- boost/trunk/libs/functional/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,97 +1,140 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
 
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<title>Boost Function Object Adapter Library</title>
+  <title>Boost Function Object Adapter Library</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-<table border="1" bgcolor="#007F7F" cellpadding="2">
-  <tr>
-    <td bgcolor="#FFFFFF"><img src="../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-    <td><a href="../../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-    <td><a href="../libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-    <td><a href="../../people/people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-    <td><a href="../../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-    <td><a href="../../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-  </tr>
-</table>
-<h1>Improved Function Object Adapters</h1>
-<p>The header <nobr><a href="../../boost/functional.hpp">functional.hpp</a></nobr>
-provides enhancements to the function object adapters specified in the C++
-Standard Library (sections 20.3.5, through to 20.3.8). The enhancements are
-principally possible due to two changes:</p>
-<ol>
-  <li>We use the Boost <nobr><tt><a href="../utility/call_traits.htm">call_traits</a></tt></nobr>
-    templates to avoid the problem of <a href="binders.html#refref">references
-    to references</a>, and to improve the efficiency of <a href="mem_fun.html#args">parameter
+      <td><a href="../../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="../../people/people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <h1>Improved Function Object Adapters</h1>
+
+  <p>The header <a href="../../boost/functional.hpp">functional.hpp</a>
+  provides enhancements to the function object adapters specified in the C++
+  Standard Library (sections 20.3.5, through to 20.3.8). The enhancements are
+  principally possible due to two changes:</p>
+
+  <ol>
+    <li>We use the Boost <tt><a href=
+    "../utility/call_traits.htm">call_traits</a></tt> templates to avoid the
+    problem of <a href="binders.html#refref">references to references</a>,
+    and to improve the efficiency of <a href="mem_fun.html#args">parameter
     passing</a>.</li>
-  <li>We use two <a href="function_traits.html">function object traits</a> class
-    templates to avoid the need for <nobr><tt><a href="ptr_fun.html">ptr_fun</a></tt></nobr>
-    with the adapters in this library.</li>
-</ol>
-<h3>Contents</h3>
-<p>The header contains the following function and class templates:</p>
-<table border="1" cellpadding="5">
-  <tr>
-    <th align="left"><a href="function_traits.html">Function object traits</a>
-    <td valign="top"><tt><nobr>unary_traits</nobr><br>
-      <nobr>binary_traits</nobr></tt></td>
-    <td valign="top">Used to determine the types of function objects' and
-      functions' arguments. Eliminate the necessity for <nobr><tt>ptr_fun</tt></nobr>.</td>
-  </tr>
-  <tr>
-    <th align="left"><a href="negators.html">Negators</a></th>
-    <td valign="top"><tt><nobr>unary_negate</nobr><br>
-      <nobr>binary_negate</nobr><br>
-      <nobr>not1</nobr><br>
-      <nobr>not2</nobr></tt></td>
-    <td valign="top">Based on section 20.3.5 of the standard.</td>
-  </tr>
-  <tr>
-    <th align="left"><a href="binders.html">Binders</a></th>
-    <td valign="top"><tt><nobr>binder1st</nobr><br>
-      <nobr>binder2nd</nobr><br>
-      <nobr>bind1st</nobr><br>
-      <nobr>bind2nd</nobr></tt></td>
-    <td valign="top">Based on section 20.3.6 of the standard.</td>
-  </tr>
-  <tr>
-    <th align="left"><a href="ptr_fun.html">Adapters for pointers to functions</a></th>
-    <td valign="top"><tt><nobr>pointer_to_unary_function</nobr><br>
-      <nobr>pointer_to_binary_function</nobr><br>
-      <nobr>ptr_fun</nobr></tt></td>
-    <td valign="top">Based on section 20.3.7 of the standard. Not required for
-      use with this library since the binders and negators can adapt functions,
-      but may be needed with third party adapters.</td>
-  </tr>
-  <tr>
-    <th align="left"><a href="mem_fun.html">Adapters for pointers to member
+
+    <li>We use two <a href="function_traits.html">function object traits</a>
+    class templates to avoid the need for <tt><a href=
+    "ptr_fun.html">ptr_fun</a></tt> with the adapters in this library.</li>
+  </ol>
+
+  <h3>Contents</h3>
+
+  <p>The header contains the following function and class templates:</p>
+
+  <table border="1" cellpadding="5" summary="">
+    <tr>
+      <th align="left"><a href="function_traits.html">Function object
+      traits</a></th>
+
+      <td valign="top"><tt>unary_traits<br>
+      binary_traits</tt></td>
+
+      <td valign="top">Used to determine the types of function objects' and
+      functions' arguments. Eliminate the necessity for
+      <tt>ptr_fun</tt>.</td>
+    </tr>
+
+    <tr>
+      <th align="left"><a href="negators.html">Negators</a></th>
+
+      <td valign="top"><tt>unary_negate<br>
+      binary_negate<br>
+      not1<br>
+      not2</tt></td>
+
+      <td valign="top">Based on section 20.3.5 of the standard.</td>
+    </tr>
+
+    <tr>
+      <th align="left"><a href="binders.html">Binders</a></th>
+
+      <td valign="top"><tt>binder1st<br>
+      binder2nd<br>
+      bind1st<br>
+      bind2nd</tt></td>
+
+      <td valign="top">Based on section 20.3.6 of the standard.</td>
+    </tr>
+
+    <tr>
+      <th align="left"><a href="ptr_fun.html">Adapters for pointers to
       functions</a></th>
-    <td valign="top"><tt><nobr>mem_fun_t</nobr><br>
-      <nobr>mem_fun1_t</nobr><br>
-      <nobr>const_mem_fun_t</nobr><br>
-      <nobr>const_mem_fun1_t</nobr><br>
-      <nobr>mem_fun_ref_t</nobr><br>
-      <nobr>mem_fun1_ref_t</nobr><br>
-      <nobr>const_mem_fun_ref_t</nobr><br>
-      <nobr>const_mem_fun1_ref_t</nobr><br>
-      <nobr>mem_fun</nobr><br>
-      <nobr>mem_fun_ref</nobr></tt></td>
-    <td valign="top">Based on section 20.3.8 of the standard.</td>
-  </tr>
-</table>
-<h3>Usage</h3>
-<p>Using these adapters should be pretty much the same as using the standard
-function object adapters; the only differences are that you need to write <nobr><tt>boost::</tt></nobr>
-instead of <nobr><tt>std::</tt></nobr>, and that you will get fewer headaches.</p>
-<p>For example, suppose you had a <tt>Person</tt> class that contained a <nobr><tt>set_name</tt></nobr>
-function:
-<blockquote>
-  <pre>
+
+      <td valign="top"><tt>pointer_to_unary_function<br>
+      pointer_to_binary_function<br>
+      ptr_fun</tt></td>
+
+      <td valign="top">Based on section 20.3.7 of the standard. Not required
+      for use with this library since the binders and negators can adapt
+      functions, but may be needed with third party adapters.</td>
+    </tr>
+
+    <tr>
+      <th align="left"><a href="mem_fun.html">Adapters for pointers to member
+      functions</a></th>
+
+      <td valign="top"><tt>mem_fun_t<br>
+      mem_fun1_t<br>
+      const_mem_fun_t<br>
+      const_mem_fun1_t<br>
+      mem_fun_ref_t<br>
+      mem_fun1_ref_t<br>
+      const_mem_fun_ref_t<br>
+      const_mem_fun1_ref_t<br>
+      mem_fun<br>
+      mem_fun_ref</tt></td>
+
+      <td valign="top">Based on section 20.3.8 of the standard.</td>
+    </tr>
+  </table>
+
+  <h3>Usage</h3>
+
+  <p>Using these adapters should be pretty much the same as using the
+  standard function object adapters; the only differences are that you need
+  to write <tt>boost::</tt> instead of <tt>std::</tt>, and that you will get
+  fewer headaches.</p>
+
+  <p>For example, suppose you had a <tt>Person</tt> class that contained a
+  <tt>set_name</tt> function:</p>
+
+  <blockquote>
+    <pre>
 class Person
 {
   public:
@@ -99,86 +142,122 @@
   // ...
 };
 </pre>
-</blockquote>
-<p>You could rename a bunch of people in a collection, <tt>c</tt>, by writing</p>
-<blockquote>
-  <pre>
+  </blockquote>
+
+  <p>You could rename a bunch of people in a collection, <tt>c</tt>, by
+  writing</p>
+
+  <blockquote>
+    <pre>
 std::for_each(c.begin(), c.end(), 
-              boost::bind2nd(boost::mem_fun_ref(&amp;Person::set_name), &quot;Fred&quot;));
+              boost::bind2nd(boost::mem_fun_ref(&amp;Person::set_name), "Fred"));
 </pre>
-</blockquote>
-<p>If the standard adapters had been used instead then this code would normally
-fail to compile, because <tt><nobr>set_name</nobr></tt> takes a reference
-argument. Refer to the comments in the <a href="binders.html#refref">binder
-documentation</a> to explain why this is so.</p>
-<h3>Compiler Compatibility</h3>
-<p>The header and <a href="function_test.cpp">test program</a> have been
-compiled with the following compilers:</p>
-<table border="1" cellpadding="5">
-  <tr>
-    <th>Compiler</th>
-    <th>Comments</th>
-  </tr>
-  <tr>
-    <td valign="top">Borland C++Builder 4 Update 2</td>
-    <td valign="top">No known issues.</td>
-  </tr>
-  <tr>
-    <td valign="top">Borland C++ 5.5</td>
-    <td valign="top">No known issues.</td>
-  </tr>
-  <tr>
-    <td valign="top">g++ 2.95.2</td>
-    <td valign="top">No known issues.</td>
-  </tr>
-  <tr>
-    <td valign="top">Microsoft Visual C++ Service Pack 3</td>
-    <td valign="top">Compiler lacks partial specialisation, so this library
-      offers little more than is provided by the standard adapters:
-      <ul>
-        <li>The <nobr><tt>call_traits</tt></nobr> mechanism is unable to prevent
-          references to references, and so the adapters in this library will be
-          usable in fewer situations.</li>
-        <li>The <nobr><tt>function_traits</tt></nobr> mechanism is unable to
-          determine the argument and result types of functions, therefore <nobr><tt>ptr_fun</tt></nobr>
-          continues to be required to adapt functions.
-      </ul>
-    </td>
-  </tr>
-</table>
-<h3>Future Directions</h3>
-<p>This library's primary focus is to solve the problem of references to
-references while maintaining as much compatibility as possible with the standard
-library. This allows you to use the techniques you read about in books and
-magazines with many of today's compilers.</p>
-<p>In the longer term, even better solutions are likely:</p>
-<ol>
-  <li>Several Boost members are working on expression template libraries. These
-    will allow a more natural syntax for combining and adapting functions. As
-    this is a new technology, it may be some time before it has matured and is
-    widely supported by major compilers but shows great promise. In the
-    meantime, the functional.hpp library fills the gap.</li>
-  <li>The Standard Committee has recognised the problem of references to
-    references occurring during template instantiation and has moved to fix the
-    standard (see the <a href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_active.html#106">C++
+  </blockquote>
+
+  <p>If the standard adapters had been used instead then this code would
+  normally fail to compile, because <tt>set_name</tt> takes a reference
+  argument. Refer to the comments in the <a href="binders.html#refref">binder
+  documentation</a> to explain why this is so.</p>
+
+  <h3>Compiler Compatibility</h3>
+
+  <p>The header and <a href="function_test.cpp">test program</a> have been
+  compiled with the following compilers:</p>
+
+  <table border="1" cellpadding="5" summary="">
+    <tr>
+      <th>Compiler</th>
+
+      <th>Comments</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Borland C++Builder 4 Update 2</td>
+
+      <td valign="top">No known issues.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Borland C++ 5.5</td>
+
+      <td valign="top">No known issues.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">g++ 2.95.2</td>
+
+      <td valign="top">No known issues.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Microsoft Visual C++ Service Pack 3</td>
+
+      <td valign="top">
+        Compiler lacks partial specialisation, so this library offers little
+        more than is provided by the standard adapters:
+
+        <ul>
+          <li>The <tt>call_traits</tt> mechanism is unable to prevent
+          references to references, and so the adapters in this library will
+          be usable in fewer situations.</li>
+
+          <li>The <tt>function_traits</tt> mechanism is unable to determine
+          the argument and result types of functions, therefore
+          <tt>ptr_fun</tt> continues to be required to adapt functions.</li>
+        </ul>
+      </td>
+    </tr>
+  </table>
+
+  <h3>Future Directions</h3>
+
+  <p>This library's primary focus is to solve the problem of references to
+  references while maintaining as much compatibility as possible with the
+  standard library. This allows you to use the techniques you read about in
+  books and magazines with many of today's compilers.</p>
+
+  <p>In the longer term, even better solutions are likely:</p>
+
+  <ol>
+    <li>Several Boost members are working on expression template libraries.
+    These will allow a more natural syntax for combining and adapting
+    functions. As this is a new technology, it may be some time before it has
+    matured and is widely supported by major compilers but shows great
+    promise. In the meantime, the functional.hpp library fills the gap.</li>
+
+    <li>The Standard Committee has recognised the problem of references to
+    references occurring during template instantiation and has moved to fix
+    the standard (see the <a href=
+    "http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_active.html#106">C++
     standard core language active issues list</a>).</li>
-</ol>
-<h3>Author</h3>
-<p><a href="../../people/mark_rodgers.htm">Mark Rodgers</a></p>
-<h3>Acknowledgements</h3>
-<p>Thanks to <a href="../../people/john_maddock.htm">John Maddock</a> for
-suggesting the mechanism that allowed the function objects traits to work
-correctly. <a href="../../people/jens_maurer.htm">Jens Maurer</a> provided
-invaluable feedback during the <a href="../../more/formal_review_process.htm">formal
-review process</a>.
-<hr>
-<p>Copyright © 2000 Cadenza New Zealand Ltd. Permission to copy, use, modify,
-sell and distribute this document is granted provided this copyright notice
-appears in all copies. This document is provided &quot;as is&quot; without
-express or implied warranty, and with no claim as to its suitability for any
-purpose.</p>
-<p>Revised 28 June 2000</p>
+  </ol>
 
+  <h3>Author</h3>
+
+  <p><a href="../../people/mark_rodgers.htm">Mark Rodgers</a></p>
+
+  <h3>Acknowledgements</h3>
+
+  <p>Thanks to <a href="../../people/john_maddock.htm">John Maddock</a> for
+  suggesting the mechanism that allowed the function objects traits to work
+  correctly. <a href="../../people/jens_maurer.htm">Jens Maurer</a> provided
+  invaluable feedback during the <a href=
+  "../../more/formal_review_process.htm">formal review process</a>.</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->02
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38510" --></p>
+
+  <p><i>Copyright &copy; 2000 Cadenza New Zealand Ltd.</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
-
 </html>

Modified: boost/trunk/libs/functional/mem_fun.html
===================================================================
--- boost/trunk/libs/functional/mem_fun.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/mem_fun.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,171 +1,201 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<title>Boost Function Object Adapter Library</title>
+  <title>Boost Function Object Adapter Library</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-<table border="1" bgcolor="#007F7F" cellpadding="2">
-  <tr>
-    <td bgcolor="#FFFFFF"><img src="../../boost.png" alt="boost.png (6897 bytes)" WIDTH="277" HEIGHT="86"></td>
-    <td><a href="../../index.htm"><font face="Arial" color="#FFFFFF"><big>Home </big></font></a></td>
-    <td><a href="../libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries </big></font></a></td>
-    <td><a href="../../people/people.htm"><font face="Arial" color="#FFFFFF"><big>People </big></font></a></td>
-    <td><a href="../../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ </big></font></a></td>
-    <td><a href="../../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More </big></font></a></td>
-  </tr>
-</table>
+      <td><a href="../../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-<h1>Member Function Adapters</h1>
+      <td><a href="../libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
 
-<p>The header <nobr><a
-href="../../boost/functional.hpp">functional.hpp</a></nobr> includes
-improved versions of the full range of member function adapters from
-the the C++ Standard Library <nobr>(&sect 20.3.8):</nobr></p>
+      <td><a href="../../people/people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
 
-<ul>
-<li><tt>mem_fun_t</tt></li>
-<li><tt>mem_fun1_t</tt></li>
-<li><tt>const_mem_fun_t</tt></li>
-<li><tt>const_mem_fun1_t</tt></li>
-<li><tt>mem_fun_ref_t</tt></li>
-<li><tt>mem_fun1_ref_t</tt></li>
-<li><tt>const_mem_fun_ref_t</tt></li>
-<li><tt>const_mem_fun1_ref_t</tt></li>
-</ul>
+      <td><a href="../../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
 
-<p>as well as the corresponding overloaded helper functions<p>
-<ul>
-<li><tt>mem_fun</tt></li>
-<li><tt>mem_fun_ref</tt></li>
-</ul>
+      <td><a href="../../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
 
-<p>The following changes have been made to the adapters as specified
-in the Standard:</p>
+  <h1>Member Function Adapters</h1>
 
-<ul>
-<li>The <tt><nobr>first_argument_type</nobr></tt> typedef has been
-corrected for the <nobr><tt>const_</tt></nobr> family of member
-function adapters (see <a href="#firstarg">below</a>).</li>
+  <p>The header <a href="../../boost/functional.hpp">functional.hpp</a>
+  includes improved versions of the full range of member function adapters
+  from the the C++ Standard Library (&sect;20.3.8):</p>
 
-<li>The argument passed to <tt><nobr>mem_fun1_t</nobr></tt> and its
-variants is passed using the
-<tt><nobr>call_traits::param_type</nobr></tt> for the member
-function's argument type.
-</ul>
+  <ul>
+    <li><tt>mem_fun_t</tt></li>
 
-<h3 id="firstarg">first_argument_type</h3>
+    <li><tt>mem_fun1_t</tt></li>
 
-<p>The standard specifies <tt><nobr>const_mem_fun1_t</nobr></tt>, for example, like this:
+    <li><tt>const_mem_fun_t</tt></li>
 
-<blockquote><pre>
+    <li><tt>const_mem_fun1_t</tt></li>
+
+    <li><tt>mem_fun_ref_t</tt></li>
+
+    <li><tt>mem_fun1_ref_t</tt></li>
+
+    <li><tt>const_mem_fun_ref_t</tt></li>
+
+    <li><tt>const_mem_fun1_ref_t</tt></li>
+  </ul>
+
+  <p>as well as the corresponding overloaded helper functions</p>
+
+  <ul>
+    <li><tt>mem_fun</tt></li>
+
+    <li><tt>mem_fun_ref</tt></li>
+  </ul>
+
+  <p>The following changes have been made to the adapters as specified in the
+  Standard:</p>
+
+  <ul>
+    <li>The <tt>first_argument_type</tt> typedef has been corrected for the
+    <tt>const_</tt> family of member function adapters (see <a href=
+    "#firstarg">below</a>).</li>
+
+    <li>The argument passed to <tt>mem_fun1_t</tt> and its variants is passed
+    using the <tt>call_traits::param_type</tt> for the member function's
+    argument type.</li>
+  </ul>
+
+  <h3 id="firstarg">first_argument_type</h3>
+
+  <p>The standard specifies <tt>const_mem_fun1_t</tt>, for example, like
+  this:</p>
+
+  <blockquote>
+    <pre>
 template &lt;class S, class T, class A&gt; class const_mem_fun1_t
   : public binary_function&lt;<strong>T*</strong>, A, S&gt; {
 public:
   explicit const_mem_fun1_t(S (T::*p)(A) const);
   S operator()(<strong>const T*</strong> p, A x) const;
 };
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<p>Note that the first argument to
-<tt><nobr>binary_function</nobr></tt> is <tt><nobr>T*</nobr></tt>
-despite the fact that the first argument to <tt><nobr>operator()</nobr></tt> is
-actually of type <tt><nobr><em>const</em> T*</nobr></tt>.  
+  <p>Note that the first argument to <tt>binary_function</tt> is <tt>T*</tt>
+  despite the fact that the first argument to <tt>operator()</tt> is actually
+  of type <tt><em>const</em>&nbsp;T*</tt>.</p>
 
-<p>Does this matter?  Well, consider what happens when we write
+  <p>Does this matter? Well, consider what happens when we write</p>
 
-<blockquote><pre>
+  <blockquote>
+    <pre>
 struct Foo { void bar(int) const; };
 const Foo *cp = new Foo;
-std::bind1st(std::mem_fun(&Foo::bar), cp);
-</pre></blockquote>
+std::bind1st(std::mem_fun(&amp;Foo::bar), cp);
+</pre>
+  </blockquote>
 
-<p>We have created a <tt><nobr>const_mem_fun1_t</nobr></tt> object
-which will effectively contain the following
+  <p>We have created a <tt>const_mem_fun1_t</tt> object which will
+  effectively contain the following</p>
 
-<blockquote><pre>
+  <blockquote>
+    <pre>
 typedef Foo* first_argument_type;
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<p>The <tt><nobr>bind1st</nobr></tt> will then create a
-<tt><nobr>binder1st</nobr></tt> object that will use this
-<tt><nobr>typedef</nobr></tt> as the type of a member which will be
-initialised with <tt><nobr>cp</nobr></tt>.  In other words, we will
-need to initialise a <tt><nobr>Foo*</nobr></tt> member with a
-<tt><nobr>const Foo*</nobr></tt> pointer!  Clearly this is not
-possible, so to implement this your Standard Library vendor will have
-had to cast away the constness of <tt><nobr>cp</nobr></tt>, probably
-within the body of <tt><nobr>bind1st</nobr></tt>.
+  <p>The <tt>bind1st</tt> will then create a <tt>binder1st</tt> object that
+  will use this <tt>typedef</tt> as the type of a member which will be
+  initialised with <tt>cp</tt>. In other words, we will need to initialise a
+  <tt>Foo*</tt> member with a <tt>const&nbsp;Foo*</tt> pointer! Clearly this
+  is not possible, so to implement this your Standard Library vendor will
+  have had to cast away the constness of <tt>cp</tt>, probably within the
+  body of <tt>bind1st</tt>.</p>
 
-<p>This hack will not suffice with the improved <a
-href="binders.html">binders</a> in this library, so we have had to
-provide corrected versions of the member function adapters as well.
+  <p>This hack will not suffice with the improved <a href=
+  "binders.html">binders</a> in this library, so we have had to provide
+  corrected versions of the member function adapters as well.</p>
 
+  <h3 id="args">Argument Types</h3>
 
-<h3 id="args">Argument Types</h3>
+  <p>The standard defines <tt>mem_fun1_t</tt>, for example, like this
+  (&sect;20.3.8&nbsp;&para;2):</p>
 
-<p>The standard defines <nobr><tt>mem_fun1_t</tt></nobr>, for example, like this
-<nobr>(&sect;20.3.8 &para;2):</nobr>
-
-<blockquote><pre>
+  <blockquote>
+    <pre>
 template &lt;class S, class T, class A&gt; class mem_fun1_t
   : public binary_function&lt;T*, A, S&gt; {
 public:
   explicit mem_fun1_t(S (T::*p)(<strong>A</strong>));
   S operator()(T* p, <strong>A</strong> x) const;
 };
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<p>Note that the second argument to <nobr><tt>operator()</tt></nobr> is
-exactly the same type as the argument to the member function.  If this
-is a value type, the argument will be passed by value and copied twice.
+  <p>Note that the second argument to <tt>operator()</tt> is exactly the same
+  type as the argument to the member function. If this is a value type, the
+  argument will be passed by value and copied twice.</p>
 
-<p>However, if we were to try and eliminate this inefficiency by
-instead declaring the argument as <nobr><tt>const A&</tt></nobr>, then
-if A were a reference type, we would have a reference to a reference,
-which is currently illegal (but see <a
-href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_active.html#106">C++
-core language issue number 106)</a>
+  <p>However, if we were to try and eliminate this inefficiency by instead
+  declaring the argument as <tt>const&nbsp;A&amp;</tt>, then if A were a
+  reference type, we would have a reference to a reference, which is
+  currently illegal (but see <a href=
+  "http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_active.html#106">C++ core
+  language issue number 106)</a></p>
 
-<p>So the way in which we want to declare the second argument for
-<nobr><tt>operator()</tt></nobr> depends on whether or not the member
-function's argument is a reference.  If it is a reference, we want to
-declare it simply as <nobr><tt>A</tt></nobr>; if it is a value we want
-to declare it as <nobr><tt>const A&</tt></nobr>.
+  <p>So the way in which we want to declare the second argument for
+  <tt>operator()</tt> depends on whether or not the member function's
+  argument is a reference. If it is a reference, we want to declare it simply
+  as <tt>A</tt>; if it is a value we want to declare it as
+  <tt>const&nbsp;A&amp;</tt>.</p>
 
-<p>The Boost <nobr><a
-href="../utility/call_traits.htm">call_traits</a></nobr> class
-template contains a <tt><nobr>param_type</nobr></tt> typedef, which
-uses partial specialisation to make precisely this decision.  By
-declaring the <nobr><tt>operator()</tt></nobr> as
+  <p>The Boost <a href="../utility/call_traits.htm">call_traits</a> class
+  template contains a <tt>param_type</tt> typedef, which uses partial
+  specialisation to make precisely this decision. By declaring the
+  <tt>operator()</tt> as</p>
 
-<blockquote><pre>
+  <blockquote>
+    <pre>
 S operator()(T* p, typename call_traits&lt;A&gt;::param_type x) const
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<p>we achieve the desired result - we improve efficiency without
-generating references to references.</p>
+  <p>we achieve the desired result - we improve efficiency without generating
+  references to references.</p>
 
-<h3>Limitations</h3>
+  <h3>Limitations</h3>
 
-<p>The call traits template used to realise some improvements relies
-on partial specialisation, so these improvements are only available on
-compilers that support that feature.  With other compilers, the
-argument passed to the member function (in the
-<nobr><tt>mem_fun1_t</tt></nobr> family) will always be passed by
-reference, thus generating the possibility of references to references.
+  <p>The call traits template used to realise some improvements relies on
+  partial specialisation, so these improvements are only available on
+  compilers that support that feature. With other compilers, the argument
+  passed to the member function (in the <tt>mem_fun1_t</tt> family) will
+  always be passed by reference, thus generating the possibility of
+  references to references.</p>
+  <hr>
 
-<hr>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<p>Copyright &copy; 2000 Cadenza New Zealand Ltd.  Permission to copy,
-use, modify, sell and distribute this document is granted provided
-this copyright notice appears in all copies. This document is provided
-"as is" without express or implied warranty, and with no claim as to
-its suitability for any purpose.</p>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->02 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38510" --></p>
 
-<p>Revised 28 June 2000</p>
+  <p><i>Copyright &copy; 2000 Cadenza New Zealand Ltd.</i></p>
 
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/functional/negators.html
===================================================================
--- boost/trunk/libs/functional/negators.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/negators.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,132 +1,158 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<title>Boost Function Object Adapter Library</title>
+  <title>Boost Function Object Adapter Library</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-<table border="1" bgcolor="#007F7F" cellpadding="2">
-  <tr>
-    <td bgcolor="#FFFFFF"><img src="../../boost.png" alt="boost.png (6897 bytes)" WIDTH="277" HEIGHT="86"></td>
-    <td><a href="../../index.htm"><font face="Arial" color="#FFFFFF"><big>Home </big></font></a></td>
-    <td><a href="../libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries </big></font></a></td>
-    <td><a href="../../people/people.htm"><font face="Arial" color="#FFFFFF"><big>People </big></font></a></td>
-    <td><a href="../../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ </big></font></a></td>
-    <td><a href="../../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More </big></font></a></td>
-  </tr>
-</table>
+      <td><a href="../../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-<h1>Negators</h1>
+      <td><a href="../libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
 
-<p>The header <nobr><a
-href="../../boost/functional.hpp">functional.hpp</a></nobr> provides
-enhanced versions of both the negator adapters from the C++ Standard
-Library (&sect;20.3.5):</p>
+      <td><a href="../../people/people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
 
-<ul>
-<li><tt>unary_negate</tt></li>
-<li><tt>binary_negate</tt></li>
-</ul>
+      <td><a href="../../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
 
-<p>As well as the corresponding helper functions</p>
+      <td><a href="../../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
 
-<ul>
-<li><tt>not1</tt></li>
-<li><tt>not2</tt></li>
-</ul>
+  <h1>Negators</h1>
 
-<p>However, the negators in this library improve on the standard
-versions in two ways:
+  <p>The header <a href="../../boost/functional.hpp">functional.hpp</a>
+  provides enhanced versions of both the negator adapters from the C++
+  Standard Library (&sect;20.3.5):</p>
 
-<ul>
-<li>They use <a href="function_traits.html">function object traits</a>
-to avoid the need for <tt><nobr>ptr_fun</nobr></tt> when negating a
-function rather than an adaptable function object.
-</li>
-<li>They use Boost <nobr><a
-href="../utility/call_traits.htm">call traits</a></nobr> to determine
-the best way to declare their arguments and pass them through
-to the adapted function (see <a href="#arguments">below</a>).  
-</li>
-</ul>
+  <ul>
+    <li><tt>unary_negate</tt></li>
 
-<h3>Usage</h3>
+    <li><tt>binary_negate</tt></li>
+  </ul>
 
-<p>Usage is identical to the standard negators.  For example,</p>
+  <p>As well as the corresponding helper functions</p>
 
-<blockquote><pre>
-bool bad(const Foo &foo) { ... }
+  <ul>
+    <li><tt>not1</tt></li>
+
+    <li><tt>not2</tt></li>
+  </ul>
+
+  <p>However, the negators in this library improve on the standard versions
+  in two ways:</p>
+
+  <ul>
+    <li>They use <a href="function_traits.html">function object traits</a> to
+    avoid the need for <tt>ptr_fun</tt> when negating a function rather than
+    an adaptable function object.</li>
+
+    <li>They use Boost <a href=
+    "../utility/call_traits.htm">call&nbsp;traits</a> to determine the best
+    way to declare their arguments and pass them through to the adapted
+    function (see <a href="#arguments">below</a>).</li>
+  </ul>
+
+  <h3>Usage</h3>
+
+  <p>Usage is identical to the standard negators. For example,</p>
+
+  <blockquote>
+    <pre>
+bool bad(const Foo &amp;foo) { ... }
 ...
 std::vector&lt;Foo&gt; c;
 ...
 std::find_if(c.begin(), c.end(), boost::not1(bad));
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<h3 id="arguments">Argument Types</h3>
+  <h3 id="arguments">Argument Types</h3>
 
-<p>The C++ Standard <nobr>(&sect;20.3.5)</nobr> defines unary negate
-like this (binary negate is similar):</p>
+  <p>The C++ Standard (&sect;20.3.5) defines unary negate like this (binary
+  negate is similar):</p>
 
-<blockquote><pre>
+  <blockquote>
+    <pre>
 template &lt;class Predicate&gt;
   class unary_negate
     : public unary_function&lt;typename Predicate::argument_type,bool&gt; {
 public:
-  explicit unary_negate(const Predicate& pred);
-  bool operator()(<strong>const typename Predicate::argument_type&</strong> x) const;
-};</pre></blockquote>
+  explicit unary_negate(const Predicate&amp; pred);
+  bool operator()(<strong>const typename Predicate::argument_type&amp;</strong> x) const;
+};
+</pre>
+  </blockquote>
 
-<p>Note that if the Predicate's <nobr><tt>argument_type</tt></nobr> is
-a reference, the type of <nobr><tt>operator()</tt>'s</nobr> argument
-would be a reference to a reference.  Currently this is illegal in C++
-(but see the <a
-href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_active.html#106">
-C++ standard core language active issues list</a>).</p>
+  <p>Note that if the Predicate's <tt>argument_type</tt> is a reference, the
+  type of <tt>operator()</tt>'s argument would be a reference to a reference.
+  Currently this is illegal in C++ (but see the <a href=
+  "http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_active.html#106">C++
+  standard core language active issues list</a>).</p>
 
-<p>However, if we instead defined <nobr><tt>operator()</tt></nobr>
-to accept Predicate's argument_type unmodified, this would be
-needlessly inefficient if it were a value type; the argument would be
-copied twice - once when calling <nobr><tt>unary_negate</tt>'s</nobr>
-<nobr><tt>operator()</tt></nobr>, and again when <nobr><tt>operator()</tt></nobr>
-called the adapted function.</p>
+  <p>However, if we instead defined <tt>operator()</tt> to accept Predicate's
+  argument_type unmodified, this would be needlessly inefficient if it were a
+  value type; the argument would be copied twice - once when calling
+  <tt>unary_negate</tt>'s <tt>operator()</tt>, and again when
+  <tt>operator()</tt> called the adapted function.</p>
 
-<p>So how we want to declare the argument for
-<nobr><tt>operator()</tt></nobr> depends on whether or not the
-Predicate's <nobr><tt>argument_type</tt></nobr> is a reference.  If it
-is a reference, we want to declare it simply as
-<nobr><tt>argument_type</tt></nobr>; if it is a value we want to
-declare it as <nobr><tt>const argument_type&</tt></nobr>.
+  <p>So how we want to declare the argument for <tt>operator()</tt> depends
+  on whether or not the Predicate's <tt>argument_type</tt> is a reference. If
+  it is a reference, we want to declare it simply as <tt>argument_type</tt>;
+  if it is a value we want to declare it as
+  <tt>const&nbsp;argument_type&amp;</tt>.</p>
 
-<p>The Boost <nobr><a
-href="../utility/call_traits.htm">call_traits</a></nobr> class
-template contains a <tt><nobr>param_type</nobr></tt> typedef, which
-uses partial specialisation to make precisely this decision.  If we were
-to declare <nobr><tt>operator()</tt></nobr> as</p>
+  <p>The Boost <a href="../utility/call_traits.htm">call_traits</a> class
+  template contains a <tt>param_type</tt> typedef, which uses partial
+  specialisation to make precisely this decision. If we were to declare
+  <tt>operator()</tt> as</p>
 
-<blockquote><pre>
+  <blockquote>
+    <pre>
 bool operator()(typename call_traits&lt;typename Predicate::argument_type&gt;::param_type x) const
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<p>the desired result would be achieved - we would eliminate
-references to references without loss of efficiency.  In fact, the
-actual declaration is slightly more complicated because of the use of
-function object traits, but the effect remains the same.</p>
+  <p>the desired result would be achieved - we would eliminate references to
+  references without loss of efficiency. In fact, the actual declaration is
+  slightly more complicated because of the use of function object traits, but
+  the effect remains the same.</p>
 
-<h3>Limitations</h3>
+  <h3>Limitations</h3>
 
-<p>Both the function object traits and call traits used to realise
-these improvements rely on partial specialisation, these improvements
-are only available on compilers that support that feature.  With other
-compilers, the negators in this library behave very much like those
-in the Standard - <nobr><tt>ptr_fun</tt></nobr> will be required to 
-adapt functions, and references to references will not be avoided.
+  <p>Both the function object traits and call traits used to realise these
+  improvements rely on partial specialisation, these improvements are only
+  available on compilers that support that feature. With other compilers, the
+  negators in this library behave very much like those in the Standard -
+  <tt>ptr_fun</tt> will be required to adapt functions, and references to
+  references will not be avoided.</p>
+  <hr>
 
-<hr>
-<p>Copyright &copy; 2000 Cadenza New Zealand Ltd.  Permission to copy, use, modify, sell and distribute this document is granted provided this copyright notice appears in all copies. This document is provided "as is" without express or implied warranty, and with no claim as to its suitability for any purpose.</p>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<p>Revised 28 June 2000</p>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->02
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38510" --></p>
 
+  <p><i>Copyright &copy; 2000 Cadenza New Zealand Ltd.</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/functional/ptr_fun.html
===================================================================
--- boost/trunk/libs/functional/ptr_fun.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/functional/ptr_fun.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,135 +1,158 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<title>Boost Function Object Adapter Library</title>
+  <title>Boost Function Object Adapter Library</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-<table border="1" bgcolor="#007F7F" cellpadding="2">
-  <tr>
-    <td bgcolor="#FFFFFF"><img src="../../boost.png" alt="boost.png (6897 bytes)" WIDTH="277" HEIGHT="86"></td>
-    <td><a href="../../index.htm"><font face="Arial" color="#FFFFFF"><big>Home </big></font></a></td>
-    <td><a href="../libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries </big></font></a></td>
-    <td><a href="../../people/people.htm"><font face="Arial" color="#FFFFFF"><big>People </big></font></a></td>
-    <td><a href="../../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ </big></font></a></td>
-    <td><a href="../../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More </big></font></a></td>
-  </tr>
-</table>
+      <td><a href="../../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-<h1>Function Pointer Adapters</h1>
+      <td><a href="../libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
 
-<p>The header <nobr><a
-href="../../boost/functional.hpp">functional.hpp</a></nobr> provides
-enhanced versions of both the function pointer adapters from the C++
-Standard Library <nobr>(&sect 20.3.7):</nobr></p>
+      <td><a href="../../people/people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
 
-<ul>
-<li><tt>pointer_to_unary_function</tt></li>
-<li><tt>pointer_to_binary_function</tt></li>
-</ul>
+      <td><a href="../../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
 
-<p>As well as the corresponding helper function template:</p>
+      <td><a href="../../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
 
-<ul>
-<li><tt>ptr_fun</tt></li>
-</ul>
+  <h1>Function Pointer Adapters</h1>
 
-<p>However, you should not need to use the adapters in conjunction
-with the adapters in this library due to our use of <a
-href="function_traits.html">function object traits</a>.  You will
-however need to use them if your implementation fails to work properly
-with our traits classes (due to lack if partial specialisation), or if
-you wish to use a function object adapter from a third party.
+  <p>The header <a href="../../boost/functional.hpp">functional.hpp</a>
+  provides enhanced versions of both the function pointer adapters from the
+  C++ Standard Library (&sect;20.3.7):</p>
 
-<h3>Usage</h3>
+  <ul>
+    <li><tt>pointer_to_unary_function</tt></li>
 
-<p>If you need to use these adapters, usage is identical to the
-standard function pointer adapters.  For example,</p>
+    <li><tt>pointer_to_binary_function</tt></li>
+  </ul>
 
-<blockquote><pre>
+  <p>As well as the corresponding helper function template:</p>
+
+  <ul>
+    <li><tt>ptr_fun</tt></li>
+  </ul>
+
+  <p>However, you should not need to use the adapters in conjunction with the
+  adapters in this library due to our use of <a href=
+  "function_traits.html">function object traits</a>. You will however need to
+  use them if your implementation fails to work properly with our traits
+  classes (due to lack if partial specialisation), or if you wish to use a
+  function object adapter from a third party.</p>
+
+  <h3>Usage</h3>
+
+  <p>If you need to use these adapters, usage is identical to the standard
+  function pointer adapters. For example,</p>
+
+  <blockquote>
+    <pre>
 bool bad(std::string foo) { ... }
 ...
 std::vector&lt;std::string&gt; c;
 ...
 std::vector&lt;std::string&gt;::iterator it
      = std::find_if(c.begin(), c.end(), std::not1(boost::ptr_fun(bad)));
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<p>Note however that this library contains enhanced <a
-href="negators.html">negators</a> that support function object traits,
-so the line above could equally be written
+  <p>Note however that this library contains enhanced <a href=
+  "negators.html">negators</a> that support function object traits, so the
+  line above could equally be written</p>
 
-<blockquote><pre>
+  <blockquote>
+    <pre>
 std::vector&lt;std::string&gt;::iterator it
      = std::find_if(c.begin(), c.end(), boost::not1(bad));
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<h3>Argument Types</h3>
+  <h3>Argument Types</h3>
 
-<p>The standard defines
-<nobr><tt>pointer_to_unary_function</tt></nobr> like this
-<nobr>(&sect;20.3.8 &para;2):</nobr>
+  <p>The standard defines <tt>pointer_to_unary_function</tt> like this
+  (&sect;20.3.8&nbsp;&para;2):</p>
 
-<blockquote><pre>
+  <blockquote>
+    <pre>
 template &lt;class Arg, class Result&gt;
 class pointer_to_unary_function : public unary_function&lt;Arg, Result&gt; {
 public:
   explicit pointer_to_unary_function(Result (* f)(<strong>Arg</strong>));
   Result operator()(<strong>Arg</strong> x) const;
 };
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<p>Note that the argument to <nobr><tt>operator()</tt></nobr> is
-exactly the same type as the argument to the wrapped function.  If this
-is a value type, the argument will be passed by value and copied twice.
-<nobr><tt>pointer_to_binary_function</tt></nobr> has a similar problem.
+  <p>Note that the argument to <tt>operator()</tt> is exactly the same type
+  as the argument to the wrapped function. If this is a value type, the
+  argument will be passed by value and copied twice.
+  <tt>pointer_to_binary_function</tt> has a similar problem.</p>
 
-<p>However, if we were to try and eliminate this inefficiency by
-instead declaring the argument as <nobr><tt>const Arg&</tt></nobr>, then
-if Arg were a reference type, we would have a reference to a reference,
-which is currently illegal (but see <a
-href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_active.html#106">C++
-core language issue number 106)</a>
+  <p>However, if we were to try and eliminate this inefficiency by instead
+  declaring the argument as <tt>const&nbsp;Arg&amp;</tt>, then if Arg were a
+  reference type, we would have a reference to a reference, which is
+  currently illegal (but see <a href=
+  "http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_active.html#106">C++ core
+  language issue number 106)</a></p>
 
-<p>So the way in which we want to declare the argument for
-<nobr><tt>operator()</tt></nobr> depends on whether or not the
-wrapped function's argument is a reference.  If it
-is a reference, we want to declare it simply as
-<nobr><tt>Arg</tt></nobr>; if it is a value we want to
-declare it as <nobr><tt>const Arg&</tt></nobr>.
+  <p>So the way in which we want to declare the argument for
+  <tt>operator()</tt> depends on whether or not the wrapped function's
+  argument is a reference. If it is a reference, we want to declare it simply
+  as <tt>Arg</tt>; if it is a value we want to declare it as
+  <tt>const&nbsp;Arg&amp;</tt>.</p>
 
-<p>The Boost <nobr><a
-href="../utility/call_traits.htm">call_traits</a></nobr> class
-template contains a <tt><nobr>param_type</nobr></tt> typedef, which
-uses partial specialisation to make precisely this decision.  By
-declaring the <nobr><tt>operator()</tt></nobr> as
+  <p>The Boost <a href="../utility/call_traits.htm">call_traits</a> class
+  template contains a <tt>param_type</tt> typedef, which uses partial
+  specialisation to make precisely this decision. By declaring the
+  <tt>operator()</tt> as</p>
 
-<blockquote><pre>
+  <blockquote>
+    <pre>
 Result operator()(typename call_traits&lt;Arg&gt;::param_type x) const
-</pre></blockquote>
+</pre>
+  </blockquote>
 
-<p>we achieve the desired result - we improve efficiency without
-generating references to references.</p>
+  <p>we achieve the desired result - we improve efficiency without generating
+  references to references.</p>
 
-<h3>Limitations</h3>
+  <h3>Limitations</h3>
 
-<p>The call traits template used to realise this improvement relies
-on partial specialisation, so this improvement is only available on
-compilers that support that feature.  With other compilers, the
-argument passed to the function will always be passed by
-reference, thus generating the possibility of references to references.
+  <p>The call traits template used to realise this improvement relies on
+  partial specialisation, so this improvement is only available on compilers
+  that support that feature. With other compilers, the argument passed to the
+  function will always be passed by reference, thus generating the
+  possibility of references to references.</p>
+  <hr>
 
-<hr>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<p>Copyright &copy; 2000 Cadenza New Zealand Ltd.  Permission to copy,
-use, modify, sell and distribute this document is granted provided
-this copyright notice appears in all copies. This document is provided
-"as is" without express or implied warranty, and with no claim as to
-its suitability for any purpose.</p>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->02
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38510" --></p>
 
-<p>Revised 28 June 2000</p>
+  <p><i>Copyright &copy; 2000 Cadenza New Zealand Ltd.</i></p>
 
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Deleted: boost/trunk/libs/graph/build/Jamfile
===================================================================
--- boost/trunk/libs/graph/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,50 +0,0 @@
-subproject libs/graph/build ;
-
-SOURCES = graphviz_graph_lex graphviz_digraph_lex
-    graphviz_graph_parser graphviz_digraph_parser 
-    read_graphviz_spirit 
-    ;
-
-GRAPHVIZ_DEFS(graphviz_graph_lex) =
-    GRAPHVIZ_DIRECTED=0
-    ;
-GRAPHVIZ_DEFS(graphviz_digraph_lex) =
-    GRAPHVIZ_DIRECTED=1
-    ;
-GRAPHVIZ_DEFS(graphviz_graph_parser) =
-    GRAPHVIZ_DIRECTED=0
-    ;
-GRAPHVIZ_DEFS(graphviz_digraph_parser) =
-    GRAPHVIZ_DIRECTED=1
-    ;
-
-{
-
-    rule bgl-lib-file
-    {
-        local objects source defs ;
-        defs = $(DEFINES) ;
-        for source in $(>)
-        {
-            DEFINES = $(defs) $(GRAPHVIZ_DEFS($(source:B))) ;
-            objects += [ Objects $(source) ] ;
-        }
-        LibraryFromObjects $(<) : $(objects) ;
-    }
-    local gGENERATOR_FUNCTION(LIB) = bgl-lib-file ;
-
-    lib bgl-viz
-        : ../src/$(SOURCES).cpp 
-        : <sysinclude>$(BOOST_ROOT) <define>YY_NO_UNISTD_H
-          # Darwin compiler ICEs if we turn optimization on
-          <darwin><*><debug-symbols>off
-          <darwin><*><optimization>off
-          # Intel compiler ICEs if we turn optimization on
-          <intel-win32><*><optimization>off
-          <vc-7_1><*><cxxflags>-GR-
-        : debug <inlining>on #inlining prevents linker name clashes due to truncation! 
-          <debug-symbols>off # Debugging symbols become HUGE 
-
-        ;
-
-}

Modified: boost/trunk/libs/graph/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/graph/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
 
 project boost/graph
     : requirements <include>../src
@@ -4,24 +9,42 @@
     : source-location ../src
     ;
 
-lib bgl-viz 
-    : graphviz_graph_lex 
-    graphviz_digraph_lex 
-    graphviz_graph_parser 
-    graphviz_digraph_parser
-    read_graphviz_spirit.cpp
-    : <define>YY_NO_UNISTD_H
-	;
+if [ modules.peek : GRAPHVIZ_PARSER ]
+{
+    lib boost_graph
+        :
+        graphviz_graph_lex
+        graphviz_digraph_lex
+        graphviz_graph_parser
+        graphviz_digraph_parser
+        : <define>YY_NO_UNISTD_H
+        ;
 
-obj graphviz_graph_lex : graphviz_lex.ll 
-    : <flex.prefix>bgl_undir_ <define>GRAPHVIZ_DIRECTED=0 
-      <implicit-dependency>graphviz_graph_parser ;
-obj graphviz_graph_parser : graphviz_parser.yy 
-    : <bison.prefix>bgl_undir_ 	<define>GRAPHVIZ_DIRECTED=0 ;    
-    
-    
-obj graphviz_digraph_lex : graphviz_lex.ll 
-    : <flex.prefix>bgl_dir_ <define>GRAPHVIZ_DIRECTED=1 
-      <implicit-dependency>graphviz_digraph_parser ;
-obj graphviz_digraph_parser : graphviz_parser.yy 
-    : <bison.prefix>bgl_dir_ 	<define>GRAPHVIZ_DIRECTED=1 ;
+    obj graphviz_graph_lex : graphviz_lex.ll
+        : <flex.prefix>bgl_undir_ <define>GRAPHVIZ_DIRECTED=0
+          <implicit-dependency>graphviz_graph_parser ;
+    obj graphviz_graph_parser : graphviz_parser.yy
+        : <bison.prefix>bgl_undir_ 	<define>GRAPHVIZ_DIRECTED=0 ;
+
+
+    obj graphviz_digraph_lex : graphviz_lex.ll
+        : <flex.prefix>bgl_dir_ <define>GRAPHVIZ_DIRECTED=1
+          <implicit-dependency>graphviz_digraph_parser ;
+    obj graphviz_digraph_parser : graphviz_parser.yy
+        : <bison.prefix>bgl_dir_ 	<define>GRAPHVIZ_DIRECTED=1 ;
+}
+else
+{
+    lib boost_graph
+        :
+        read_graphviz_spirit.cpp
+        :
+        <define>BOOST_GRAPH_NO_LIB=1
+        <link>shared:<define>BOOST_GRAPH_DYN_LINK=1
+        # # Intel compiler ICEs if we turn optimization on
+        <toolset>intel-vc71-win-9.1:<optimization>off
+        # Without these flags, MSVC 7.1 and 8.0 crash
+        <toolset>msvc-7.1:<cxxflags>-GR-
+        <toolset>msvc-8.0:<cxxflags>-GR-
+        ;
+}

Modified: boost/trunk/libs/graph/doc/AStarHeuristic.html
===================================================================
--- boost/trunk/libs/graph/doc/AStarHeuristic.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/AStarHeuristic.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) 2004 Kris Beevers
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: AStarHeuristic</Title>

Modified: boost/trunk/libs/graph/doc/AStarVisitor.html
===================================================================
--- boost/trunk/libs/graph/doc/AStarVisitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/AStarVisitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) 2004 Kris Beevers
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: AStarVisitor</Title>

Modified: boost/trunk/libs/graph/doc/AdjacencyGraph.html
===================================================================
--- boost/trunk/libs/graph/doc/AdjacencyGraph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/AdjacencyGraph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>AdjacencyGraph</Title>

Modified: boost/trunk/libs/graph/doc/AdjacencyMatrix.html
===================================================================
--- boost/trunk/libs/graph/doc/AdjacencyMatrix.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/AdjacencyMatrix.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>AdjacencyMatrix</Title>

Modified: boost/trunk/libs/graph/doc/BFSVisitor.html
===================================================================
--- boost/trunk/libs/graph/doc/BFSVisitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/BFSVisitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: BFSVisitor</Title>

Modified: boost/trunk/libs/graph/doc/BasicMatrix.html
===================================================================
--- boost/trunk/libs/graph/doc/BasicMatrix.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/BasicMatrix.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>BasicMatrix</Title>

Modified: boost/trunk/libs/graph/doc/BellmanFordVisitor.html
===================================================================
--- boost/trunk/libs/graph/doc/BellmanFordVisitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/BellmanFordVisitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Bellman Ford Visitor</Title>
@@ -80,16 +76,6 @@
 </tr>
 
 <tr>
-<td>Initialize Vertex</td>
-<td><tt>vis.initialize_vertex(s, g)</tt></td>
-<td><tt>void</tt></td>
-<td>
-This is invoked on every vertex of the graph before the start of the
-graph search.
-</td>
-</tr>
-
-<tr>
 <td>Examine Edge</td>
 <td><tt>vis.examine_edge(e, g)</tt></td>
 <td><tt>void</tt></td>

Modified: boost/trunk/libs/graph/doc/BidirectionalGraph.html
===================================================================
--- boost/trunk/libs/graph/doc/BidirectionalGraph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/BidirectionalGraph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Bidirectional</Title>

Modified: boost/trunk/libs/graph/doc/Buffer.html
===================================================================
--- boost/trunk/libs/graph/doc/Buffer.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/Buffer.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Buffer</Title>

Modified: boost/trunk/libs/graph/doc/ColorValue.html
===================================================================
--- boost/trunk/libs/graph/doc/ColorValue.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/ColorValue.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine  2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: ColorValue Concept</Title>

Modified: boost/trunk/libs/graph/doc/DFSVisitor.html
===================================================================
--- boost/trunk/libs/graph/doc/DFSVisitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/DFSVisitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>DFS Visitor</Title>

Modified: boost/trunk/libs/graph/doc/DijkstraVisitor.html
===================================================================
--- boost/trunk/libs/graph/doc/DijkstraVisitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/DijkstraVisitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Dijkstra Visitor</Title>

Modified: boost/trunk/libs/graph/doc/EdgeListGraph.html
===================================================================
--- boost/trunk/libs/graph/doc/EdgeListGraph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/EdgeListGraph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>EdgeListGraph</Title>

Modified: boost/trunk/libs/graph/doc/EdgeMutableGraph.html
===================================================================
--- boost/trunk/libs/graph/doc/EdgeMutableGraph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/EdgeMutableGraph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2001
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Edge Mutable Graph</Title>

Modified: boost/trunk/libs/graph/doc/EventVisitor.html
===================================================================
--- boost/trunk/libs/graph/doc/EventVisitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/EventVisitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: EventVisitor</Title>

Modified: boost/trunk/libs/graph/doc/EventVisitorList.html
===================================================================
--- boost/trunk/libs/graph/doc/EventVisitorList.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/EventVisitorList.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: EventVisitorList</Title>

Modified: boost/trunk/libs/graph/doc/Graph.html
===================================================================
--- boost/trunk/libs/graph/doc/Graph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/Graph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Graph</Title>
@@ -74,7 +70,7 @@
 
 <tr>
 <td><pre>boost::graph_traits&lt;G&gt;::directed_category</pre>
-The choices are <TT>directed_tag</TT> and <TT>undirected_tag</TT>.
+This type shall be convertible to <TT>directed_tag</TT> or <TT>undirected_tag</TT>.
 </td>
 </tr>
 

Modified: boost/trunk/libs/graph/doc/IncidenceGraph.html
===================================================================
--- boost/trunk/libs/graph/doc/IncidenceGraph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/IncidenceGraph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>IncidenceGraph</Title>

Modified: boost/trunk/libs/graph/doc/IteratorConstructibleGraph.html
===================================================================
--- boost/trunk/libs/graph/doc/IteratorConstructibleGraph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/IteratorConstructibleGraph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>IteratorConstructibleGraph</Title>

Modified: boost/trunk/libs/graph/doc/Makefile
===================================================================
--- boost/trunk/libs/graph/doc/Makefile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/Makefile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
+
 DVIPS		= dvips
 
 LATEX		= latex

Modified: boost/trunk/libs/graph/doc/Monoid.html
===================================================================
--- boost/trunk/libs/graph/doc/Monoid.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/Monoid.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2001
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Monoid</Title>

Modified: boost/trunk/libs/graph/doc/MutableGraph.html
===================================================================
--- boost/trunk/libs/graph/doc/MutableGraph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/MutableGraph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>MutableGraph</Title>

Modified: boost/trunk/libs/graph/doc/MutablePropertyGraph.html
===================================================================
--- boost/trunk/libs/graph/doc/MutablePropertyGraph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/MutablePropertyGraph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>MutablePropertyGraph</Title>

Modified: boost/trunk/libs/graph/doc/PropertyGraph.html
===================================================================
--- boost/trunk/libs/graph/doc/PropertyGraph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/PropertyGraph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>PropertyGraph</Title>

Modified: boost/trunk/libs/graph/doc/PropertyTag.html
===================================================================
--- boost/trunk/libs/graph/doc/PropertyTag.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/PropertyTag.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Property</Title>

Modified: boost/trunk/libs/graph/doc/VertexAndEdgeListGraph.html
===================================================================
--- boost/trunk/libs/graph/doc/VertexAndEdgeListGraph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/VertexAndEdgeListGraph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>VertexAndEdgeListGraph</Title>

Modified: boost/trunk/libs/graph/doc/VertexListGraph.html
===================================================================
--- boost/trunk/libs/graph/doc/VertexListGraph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/VertexListGraph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>VertexListGraph</Title>

Modified: boost/trunk/libs/graph/doc/VertexMutableGraph.html
===================================================================
--- boost/trunk/libs/graph/doc/VertexMutableGraph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/VertexMutableGraph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2001
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Vertex Mutable Graph</Title>

Modified: boost/trunk/libs/graph/doc/acknowledgements.html
===================================================================
--- boost/trunk/libs/graph/doc/acknowledgements.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/acknowledgements.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Acknowledgements</Title>

Modified: boost/trunk/libs/graph/doc/adjacency_iterator.html
===================================================================
--- boost/trunk/libs/graph/doc/adjacency_iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/adjacency_iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <html>
+<!--
+  -- Copyright (c) Jeremy Siek 2000
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
 
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">

Modified: boost/trunk/libs/graph/doc/adjacency_list.html
===================================================================
--- boost/trunk/libs/graph/doc/adjacency_list.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/adjacency_list.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Adjacency List</Title>
@@ -358,7 +354,7 @@
 <br>
 and
 <br>
-<tt>adjacency_list_traits&lt;OutEdgeList, VertexList, Directed, EdgeList&gt;::vertex_descriptor</tt>
+<tt>adjacency_list_traits&lt;OutEdgeList, VertexList, Directed&gt;::vertex_descriptor</tt>
 <br><br>
 The type for the vertex descriptors associated with the
 <TT>adjacency_list</TT>.
@@ -367,7 +363,7 @@
 
 <tt>graph_traits&lt;adjacency_list&gt;::edge_descriptor</tt><br>
 and<br>
-<tt>adjacency_list_traits&lt;OutEdgeList, VertexList, Directed, EdgeList&gt;::edge_descriptor</tt>
+<tt>adjacency_list_traits&lt;OutEdgeList, VertexList, Directed&gt;::edge_descriptor</tt>
 <br><br>
 The type for the edge descriptors associated with the
 <TT>adjacency_list</TT>.
@@ -428,7 +424,7 @@
 
 <tt>graph_traits&lt;adjacency_list&gt;::directed_category</tt><br>
 and<br>
-<tt>adjacency_list_traits&lt;OutEdgeList, VertexList, Directed, EdgeList&gt;::directed_category</tt>
+<tt>adjacency_list_traits&lt;OutEdgeList, VertexList, Directed&gt;::directed_category</tt>
 <br><br>
 Provides information about whether the graph is
 directed (<TT>directed_tag</TT>) or undirected
@@ -438,7 +434,7 @@
 
 <tt>graph_traits&lt;adjacency_list&gt;::edge_parallel_category</tt><br>
 and<br>
-<tt>adjacency_list_traits&lt;OutEdgeList, VertexList, Directed, EdgeList&gt;::edge_parallel_category</tt>
+<tt>adjacency_list_traits&lt;OutEdgeList, VertexList, Directed&gt;::edge_parallel_category</tt>
 <br><br>
 This describes whether the graph class allows the insertion of
 parallel edges (edges with the same source and target). The two tags
@@ -449,17 +445,13 @@
 
 <hr>
 
-<tt>graph_traits&lt;adjacency_list&gt;::vertices_size_type</tt><br>
-and<br>
-<tt>adjacency_list_traits&lt;OutEdgeList, VertexList, Directed_list, EdgeList&gt;::vertices_size_type</tt><br>
+<tt>graph_traits&lt;adjacency_list&gt;::vertices_size_type</tt>
 <br><br>
 The type used for dealing with the number of vertices in the graph.
 
 <hr>
 
-<tt>graph_traits&lt;adjacency_list&gt;::edge_size_type</tt><br>
-and<br>
-<tt>adjacency_list_traits&lt;OutEdgeList, VertexList, Directed_list, EdgeList&gt;::edge_size_type</tt><br>
+<tt>graph_traits&lt;adjacency_list&gt;::edge_size_type</tt>
 <br><br>
 The type used for dealing with the number of edges in the graph.
 

Modified: boost/trunk/libs/graph/doc/adjacency_list_traits.html
===================================================================
--- boost/trunk/libs/graph/doc/adjacency_list_traits.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/adjacency_list_traits.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Graph Traits</Title>

Modified: boost/trunk/libs/graph/doc/adjacency_matrix.html
===================================================================
--- boost/trunk/libs/graph/doc/adjacency_matrix.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/adjacency_matrix.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Adjacency Matrix</Title>

Modified: boost/trunk/libs/graph/doc/astar_heuristic.html
===================================================================
--- boost/trunk/libs/graph/doc/astar_heuristic.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/astar_heuristic.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) 2004 Kris Beevers
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: astar_heuristic</Title>

Modified: boost/trunk/libs/graph/doc/astar_search.html
===================================================================
--- boost/trunk/libs/graph/doc/astar_search.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/astar_search.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) 2004 Kris Beevers
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: A* Heuristic Search</Title>

Modified: boost/trunk/libs/graph/doc/astar_visitor.html
===================================================================
--- boost/trunk/libs/graph/doc/astar_visitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/astar_visitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) 2004 Kris Beevers
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: astar_visitor</Title>

Modified: boost/trunk/libs/graph/doc/bandwidth.html
===================================================================
--- boost/trunk/libs/graph/doc/bandwidth.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/bandwidth.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Bandwidth</Title>

Modified: boost/trunk/libs/graph/doc/bc_clustering.html
===================================================================
--- boost/trunk/libs/graph/doc/bc_clustering.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/bc_clustering.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<!--
+  -- Copyright (c) 2004 Trustees of Indiana University
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <html>
 <head>
 <meta name="generator" content=

Modified: boost/trunk/libs/graph/doc/bellman_ford_shortest.html
===================================================================
--- boost/trunk/libs/graph/doc/bellman_ford_shortest.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/bellman_ford_shortest.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Bellman Ford Shortest Paths</Title>

Modified: boost/trunk/libs/graph/doc/bellman_visitor.html
===================================================================
--- boost/trunk/libs/graph/doc/bellman_visitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/bellman_visitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: bellman_visitor</Title>

Modified: boost/trunk/libs/graph/doc/betweenness_centrality.html
===================================================================
--- boost/trunk/libs/graph/doc/betweenness_centrality.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/betweenness_centrality.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,12 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
+<!--
+  -- Copyright (c) 2004 Trustees of Indiana University
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
   <head>
     <title>Boost Graph Library: Brandes' Betweenness Centrality</title>
   </head>

Modified: boost/trunk/libs/graph/doc/bfs_visitor.html
===================================================================
--- boost/trunk/libs/graph/doc/bfs_visitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/bfs_visitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: bfs_visitor</Title>

Modified: boost/trunk/libs/graph/doc/bgl_named_params.html
===================================================================
--- boost/trunk/libs/graph/doc/bgl_named_params.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/bgl_named_params.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Named Parameters</Title>

Modified: boost/trunk/libs/graph/doc/bibliography.html
===================================================================
--- boost/trunk/libs/graph/doc/bibliography.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/bibliography.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Bibliography</Title>

Modified: boost/trunk/libs/graph/doc/breadth_first_search.html
===================================================================
--- boost/trunk/libs/graph/doc/breadth_first_search.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/breadth_first_search.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000, 2001
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Breadth-First Search</Title>

Modified: boost/trunk/libs/graph/doc/breadth_first_visit.html
===================================================================
--- boost/trunk/libs/graph/doc/breadth_first_visit.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/breadth_first_visit.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000, 2001
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Breadth-First Visit</Title>

Modified: boost/trunk/libs/graph/doc/challenge.html
===================================================================
--- boost/trunk/libs/graph/doc/challenge.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/challenge.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Challenge</Title>

Modified: boost/trunk/libs/graph/doc/circle_layout.html
===================================================================
--- boost/trunk/libs/graph/doc/circle_layout.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/circle_layout.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
-<html><head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"><title>Function template circle_graph_layout</title></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><table cellpadding="2" width="100%"><td valign="top"><img src="../../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td><td align="center"><a href="../../../index.htm">Home</a></td><td align="center"><a href="../../libraries.htm">Libraries</a></td><td align="center"><a href="../../../people/people.htm">People</a></td><td align="center"><a href="../../../more/faq.htm">FAQ</a></td><td align="center"><a href="../../../more/index.htm">More</a></td></table><hr><div class="refentry" lang="en"><a name="id103562-bb"></a><div class="titlepage"><div></div><div></div></div><div class="refnamediv"><h2><img src="figs/python.gif" alt="(Python)"/><span class="refentrytitle">Function template circle_graph_layout</span></h2><p>boost::circle_graph_layout &#8212; Layout the graph with the vertices at the points of a regular n-polygon. </p></div><h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2><div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">
+<html><!--
+  -- Copyright (c) 2004 Trustees of Indiana University
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
+<head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"><title>Function template circle_graph_layout</title></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><table cellpadding="2" width="100%"><td valign="top"><img src="../../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td><td align="center"><a href="../../../index.htm">Home</a></td><td align="center"><a href="../../libraries.htm">Libraries</a></td><td align="center"><a href="../../../people/people.htm">People</a></td><td align="center"><a href="../../../more/faq.htm">FAQ</a></td><td align="center"><a href="../../../more/index.htm">More</a></td></table><hr><div class="refentry" lang="en"><a name="id103562-bb"></a><div class="titlepage"><div></div><div></div></div><div class="refnamediv"><h2><img src="figs/python.gif" alt="(Python)"/><span class="refentrytitle">Function template circle_graph_layout</span></h2><p>boost::circle_graph_layout &#8212; Layout the graph with the vertices at the points of a regular n-polygon. </p></div><h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2><div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">
 <span class="bold"><b>template</b></span>&lt;<span class="bold"><b>typename</b></span> VertexListGraph, <span class="bold"><b>typename</b></span> PositionMap, <span class="bold"><b>typename</b></span> Radius&gt; 
   <span class="type"><span class="bold"><b>void</b></span></span> circle_graph_layout(<span class="bold"><b>const</b></span> VertexListGraph &amp; g, PositionMap position, 
                            Radius radius);</pre></div><div class="refsect1" lang="en"><a name="id821794"></a><h2>Where Defined</h2><a href="../../../boost/graph/circle_layout.hpp">boost/graph/circle_layout.hpp</a><h2>Description</h2><p>The distance from the center of the polygon to each point is determined by the <tt class="computeroutput">radius</tt>  parameter. The <tt class="computeroutput">position</tt>  parameter must be an Lvalue Property Map whose value type is a class type containing <tt class="computeroutput">x</tt>  and <tt class="computeroutput">y</tt>  members that will be set to the <tt class="computeroutput">x</tt>  and <tt class="computeroutput">y</tt>  coordinates. 

Modified: boost/trunk/libs/graph/doc/compressed_sparse_row.html
===================================================================
--- boost/trunk/libs/graph/doc/compressed_sparse_row.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/compressed_sparse_row.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,12 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
+<!--
+  -- Copyright (c) 2005 Trustees of Indiana University
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
   <head>
     <title>Compressed Sparse Row Graph</title>
 

Modified: boost/trunk/libs/graph/doc/connected_components.html
===================================================================
--- boost/trunk/libs/graph/doc/connected_components.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/connected_components.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000-2001
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Connected Components</Title>

Modified: boost/trunk/libs/graph/doc/constructing_algorithms.html
===================================================================
--- boost/trunk/libs/graph/doc/constructing_algorithms.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/constructing_algorithms.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Constructing Graph Algorithms</Title>

Modified: boost/trunk/libs/graph/doc/copy_graph.html
===================================================================
--- boost/trunk/libs/graph/doc/copy_graph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/copy_graph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Copy Graph</Title>

Modified: boost/trunk/libs/graph/doc/cuthill_mckee_ordering.html
===================================================================
--- boost/trunk/libs/graph/doc/cuthill_mckee_ordering.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/cuthill_mckee_ordering.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 
 <!--   Copyright (c) Jeremy Siek 2000 -->
   
-<!--   Permission to use, copy, modify, distribute and sell this software -->
-<!--   and its documentation for any purpose is hereby granted without fee, -->
-<!--   provided that the above copyright notice appears in all copies and -->
-<!--   that both that copyright notice and this permission notice appear -->
-<!--   in supporting documentation.  Silicon Graphics makes no -->
-<!--   representations about the suitability of this software for any -->
-<!--   purpose.  It is provided "as is" without express or implied warranty. -->
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
 
 <Head> 
 <Title>Boost Graph Library: Cuthill-Mckee Ordering</Title>

Modified: boost/trunk/libs/graph/doc/dag_shortest_paths.html
===================================================================
--- boost/trunk/libs/graph/doc/dag_shortest_paths.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/dag_shortest_paths.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Directed Acyclic Graph Shortest Paths</Title>

Modified: boost/trunk/libs/graph/doc/default.css
===================================================================
--- boost/trunk/libs/graph/doc/default.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/default.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,18 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:date: $Date: 2005/03/24 14:24:11 $
-:version: $Revision: 1.1 $
+:date: $Date: 2006/11/03 18:55:10 $
+:version: $Revision: 1.1.4.1 $
 :copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
+   
+-- Copyright (c) 2005 Trustees of Indiana University
+
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+
 */
 
 .first {

Modified: boost/trunk/libs/graph/doc/depth_first_search.html
===================================================================
--- boost/trunk/libs/graph/doc/depth_first_search.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/depth_first_search.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Depth-First Search</Title>

Modified: boost/trunk/libs/graph/doc/depth_first_visit.html
===================================================================
--- boost/trunk/libs/graph/doc/depth_first_visit.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/depth_first_visit.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Depth-First Visit</Title>

Modified: boost/trunk/libs/graph/doc/dfs_visitor.html
===================================================================
--- boost/trunk/libs/graph/doc/dfs_visitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/dfs_visitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: dfs_visitor</Title>

Modified: boost/trunk/libs/graph/doc/dijkstra_shortest_paths.html
===================================================================
--- boost/trunk/libs/graph/doc/dijkstra_shortest_paths.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/dijkstra_shortest_paths.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Dijkstra's Shortest Paths</Title>

Modified: boost/trunk/libs/graph/doc/dijkstra_visitor.html
===================================================================
--- boost/trunk/libs/graph/doc/dijkstra_visitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/dijkstra_visitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: dijkstra_visitor</Title>

Modified: boost/trunk/libs/graph/doc/distance_recorder.html
===================================================================
--- boost/trunk/libs/graph/doc/distance_recorder.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/distance_recorder.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: distance_recorder</Title>

Modified: boost/trunk/libs/graph/doc/edge_list.html
===================================================================
--- boost/trunk/libs/graph/doc/edge_list.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/edge_list.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Edge List Class</Title>

Modified: boost/trunk/libs/graph/doc/edmunds_karp_max_flow.html
===================================================================
--- boost/trunk/libs/graph/doc/edmunds_karp_max_flow.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/edmunds_karp_max_flow.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Edmunds-Karp Maximum Flow</Title>

Modified: boost/trunk/libs/graph/doc/exception.html
===================================================================
--- boost/trunk/libs/graph/doc/exception.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/exception.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2002
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Exceptions</Title>

Modified: boost/trunk/libs/graph/doc/faq.html
===================================================================
--- boost/trunk/libs/graph/doc/faq.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/faq.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: FAQ</Title>

Modified: boost/trunk/libs/graph/doc/figs/Makefile
===================================================================
--- boost/trunk/libs/graph/doc/figs/Makefile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/figs/Makefile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,9 @@
 # -*- makefile -*-
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
 
 .SUFFIXES:  .fig .gif .tif .jpeg
 

Modified: boost/trunk/libs/graph/doc/file_dependency_example.html
===================================================================
--- boost/trunk/libs/graph/doc/file_dependency_example.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/file_dependency_example.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>File Dependency Example</Title>
@@ -85,14 +81,27 @@
 <H2>Graph Setup</H2>
 
 <P>
-Here we show the construction of the graph.  For simplicity we have
+Here we show the construction of the graph.  First, these are the required
+header files:
+
+<P>
+<PRE>
+#include &lt;iostream&gt; // std::cout
+#include &lt;utility&gt; // std::pair
+#include &lt;boost/graph/graph_traits.hpp&gt;
+#include &lt;boost/graph/adjacency_list.hpp&gt;
+#include &lt;boost/graph/topological_sort.hpp&gt;
+</PRE>
+
+<P>
+For simplicity we have
 constructed the graph &quot;by-hand&quot;. A compilation system such
 as <TT>make</TT> would instead parse a <TT>Makefile</TT> to get the
 list of files and to set-up the dependencies. We use the
 <TT>adjacency_list</TT> class to represent the graph. The
 <TT>vecS</TT> selector means that a <TT>std::vector</TT> will be used
 to represent each edge-list, which provides efficient traversal. The
-<TT>directedS</TT> selector means we want a directed graph, and the
+<TT>bidirectionalS</TT> selector means we want a directed graph with access to both the edges outgoing from each vertex and the edges incoming to each vertex, and the
 <TT>color_property</TT> attaches a color property to each vertex of the
 graph. The color property will be used in several of the algorithms in
 the following sections.
@@ -127,11 +136,10 @@
   };
 
   using namespace boost;
-  typedef adjacency_list&lt;vecS, vecS, directedS, 
-      property&lt;vertex_color_t, default_color_type&gt;,
-      property&lt;edge_weight_t, int&gt;
+  typedef adjacency_list&lt;vecS, vecS, bidirectionalS, 
+      property&lt;vertex_color_t, default_color_type&gt;
     &gt; Graph;
-  Graph g(N, used_by, used_by + sizeof(used_by) / sizeof(Edge));
+  Graph g(used_by, used_by + sizeof(used_by) / sizeof(Edge), N);
   typedef graph_traits&lt;Graph&gt;::vertex_descriptor Vertex;
 </PRE>
 
@@ -195,88 +203,44 @@
 number of files can be built at the same time? The main criteria for
 when a file can be built is that all of the files it depends on must
 already be built. To simplify things for this example, we'll assume
-that each file takes 1 time unit to build (even header files). The
+that each file takes 1 time unit to build (even header files). For
+parallel compilation, we can build all of the files corresponding to
+vertices with no dependencies, e.g., those that have
+an <i>in-degree</i> of 0, in the first step. For all other files, the
 main observation for determining the ``time slot'' for a file is that
 the time slot must be one more than the maximum time-slot of the files
 it depends on.
 
-<P>
-This idea of calculating a value based on the previously computed
-values of neighboring vertices is the same idea behind Dijkstra's
-single-source shortest paths algorithm (see <a
-href="./dijkstra_shortest_paths.html"><tt>dijkstra_shortest_paths()</tt></a>). The
-main difference between this situation and a shortest-path algorithm
-is that we want to use the maximum of the neighbors' values instead of
-the minimum.  In addition, we do not have a single source
-vertex. Instead we will want to treat all vertices with in-degree of
-zero as sources (i.e., vertices with no edges coming into them). So we
-use Dijkstra's algorithm with several extra parameters instead
-of relying on the defaults.
+<P>We start be creating a vector <code>time</code> that will store the
+  time step at which each file can be built. We initialize every value
+  with time step zero.</p>
 
 <P>
-To use <TT>dijkstra_shortest_paths()</TT>, we must first set up the vertex
-and edge properties that will be used in the algorithm.  We will need
-a time property (replacing the distance property of Dijkstra's
-algorithm) and an edge weight property. We will use a
-<TT>std::vector</TT> to store the time. The weight property has already
-been attached to the graph via a plug-in so here we just declare an
-map for the internal weight property.
-
-<P>
 <PRE>
   std::vector&lt;int&gt; time(N, 0);
-  typedef std::vector&lt;int&gt;::iterator Time;
-  using boost::edge_weight_t;
-  typedef boost::property_map&lt;Graph, edge_weight_t&gt;::type Weight;
-  Weight weight = get(edge_weight, g);
 </PRE>
 
-<P>
-The next step is to identify the vertices with zero in-degree which
-will be our ``source'' vertices from which to start the shortest path
-searches. The in-degrees can be calculated with the following loop.
+<p>Now, we want to visit the vertices against in topological order,
+  from those files that need to be built first until those that need
+  to be built last. However, instead of printing out the order
+  immediately, we will compute the time step in which each file should
+  be built based on the time steps of the files it depends on. We
+  only need to consider those files whose in-degree is greater than
+  zero.</p>
 
-<P>
-<PRE>
-  std::vector&lt;int&gt; in_degree(N, 0);
-  Graph::vertex_iterator i, iend;
-  Graph::out_edge_iterator j, jend;
-  for (boost::tie(i, iend) = vertices(g); i != iend; ++i)
-    for (boost::tie(j, jend) = out_edges(*i, g); j != jend; ++j)
-      in_degree[target(*j, g)] += 1;
-</PRE>
+<pre>
+    for (i = make_order.begin(); i != make_order.end(); ++i) {    
+      if (in_degree (*i, g) &gt; 0) {
+        Graph::in_edge_iterator j, j_end;
+        int maxdist = 0;
+        for (tie(j, j_end) = in_edges(*i, g); j != j_end; ++j)
+          maxdist = std::max(time[source(*j, g)], maxdist);
+        time[*i]=maxdist+1;
+      }
+    }
+</pre>
 
 <P>
-Next we need to define comparison of the &quot;cost&quot;. In this
-case we want each file to have a time stamp greater than any of its
-predecessors.  Therefore we define comparison with the
-<TT>std::greater&lt;int&gt;</TT> function object.  We also need to
-tell the algorithm that we want to use addition to combine time
-values, so we use <TT>std::plus&lt;int&gt;</TT>.
-
-<P>
-<PRE>
-  std::greater&lt;int&gt; compare;
-  std::plus&lt;int&gt; combine;
-</PRE>
-
-<P>
-We are now ready to call <TT>uniform_cost_search()</TT>. We just
-loop through all the vertices in the graph, and invoke the algorithm
-if the vertex has zero in-degree.
-
-<P>
-<PRE>
-  for (boost::tie(i, iend) = vertices(g); i != iend; ++i)
-    if (in_degree[*i] == 0)
-      boost::dijkstra_shortest_paths(g, *i, 
-				     distance_map(&amp;time[0]). 
-				     weight_map(weight). 
-				     distance_compare(compare).
-				     distance_combine(combine));
-</PRE>
-
-<P>
 Last, we output the time-slot that we've calculated for each vertex.
 
 <P>

Modified: boost/trunk/libs/graph/doc/filtered_graph.html
===================================================================
--- boost/trunk/libs/graph/doc/filtered_graph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/filtered_graph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Filtered Graph</Title>
@@ -196,13 +192,9 @@
 
 <hr>
 
-<tt>graph_traits&lt;filtered_graph&gt;::vertex_iterator</tt><br>
+<tt>graph_traits&lt;filtered_graph&gt;::vertex_iterator</tt>
 <br><br>
-The type for the iterators returned by <TT>vertices()</TT>,
-which is:
-<pre>
-<a href="../../iterator/doc/filter_iterator.html">filter_iterator</a>&lt;VertexPredicate, graph_traits&lt;Graph&gt;::vertex_iterator&gt;
-</pre>
+The type for the iterators returned by <TT>vertices()</TT>.
 The iterator is a model of <a href="../../utility/MultiPassInputIterator.html">MultiPassInputIterator</a>.
 
 
@@ -210,10 +202,7 @@
 
 <tt>graph_traits&lt;filtered_graph&gt;::edge_iterator</tt>
 <br><br>
-The type for the iterators returned by <TT>edges()</TT>, which is:
-<pre>
-<a href="../../iterator/doc/filter_iterator.html">filter_iterator</a>&lt;EdgePredicate, graph_traits&lt;Graph&gt;::edge_iterator&gt;
-</pre>
+The type for the iterators returned by <TT>edges()</TT>.
 The iterator is a model of <a href="../../utility/MultiPassInputIterator.html">MultiPassInputIterator</a>.
 
 <hr>
@@ -221,10 +210,7 @@
 
 <tt>graph_traits&lt;filtered_graph&gt;::out_edge_iterator</tt>
 <br><br>
-The type for the iterators returned by <TT>out_edges()</TT>, which is:
-<pre>
-<a href="../../iterator/doc/filter_iterator.html">filter_iterator</a>&lt;EdgePredicate, graph_traits&lt;Graph&gt;::out_edge_iterator&gt;
-</pre>
+The type for the iterators returned by <TT>out_edges()</TT>.
 The iterator is a model of <a href="../../utility/MultiPassInputIterator.html">MultiPassInputIterator</a>.
 
 
@@ -233,7 +219,6 @@
 <tt>graph_traits&lt;filtered_graph&gt;::adjacency_iterator</tt>
 <br><br>
 The type for the iterators returned by <TT>adjacent_vertices()</TT>.
-
 The <tt>adjacency_iterator</tt> models the same iterator concept as
 <tt>out_edge_iterator</tt>.
 

Modified: boost/trunk/libs/graph/doc/floyd_warshall_shortest.html
===================================================================
--- boost/trunk/libs/graph/doc/floyd_warshall_shortest.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/floyd_warshall_shortest.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <HTML>
+<!--
+  -- Copyright (c) 2002 Rensselaer Polytechnic Institute
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <Head>
 <Title>Floyd-Warshall All Pairs Shortest Paths</Title>
 <BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 

Modified: boost/trunk/libs/graph/doc/fruchterman_reingold.html
===================================================================
--- boost/trunk/libs/graph/doc/fruchterman_reingold.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/fruchterman_reingold.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,12 @@
 <HTML>
+<!--
+  -- Copyright (c) 2004 Trustees of Indiana University
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
+
 <Head>
 <Title>Boost Graph Library: Fruchterman-Reingold Force-Directed Layout</Title>
 <BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 

Modified: boost/trunk/libs/graph/doc/graph_coloring.html
===================================================================
--- boost/trunk/libs/graph/doc/graph_coloring.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/graph_coloring.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine  2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Graph Coloring Example</Title>
@@ -121,7 +117,7 @@
   void 
   smallest_last_ordering(const VertexListGraph&amp; G, Order order, 
                          Degree degree, Marker marker, 
-                         BucketSorter&amp; bucket_sorter) {
+                         BucketSorter&amp; degree_buckets) {
     typedef typename graph_traits&lt;VertexListGraph&gt; GraphTraits;
 
     typedef typename GraphTraits::vertex_descriptor Vertex;

Modified: boost/trunk/libs/graph/doc/graph_concepts.html
===================================================================
--- boost/trunk/libs/graph/doc/graph_concepts.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/graph_concepts.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Concepts</Title>

Modified: boost/trunk/libs/graph/doc/graph_theory_review.html
===================================================================
--- boost/trunk/libs/graph/doc/graph_theory_review.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/graph_theory_review.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Graph Theory Review</Title>

Modified: boost/trunk/libs/graph/doc/graph_traits.html
===================================================================
--- boost/trunk/libs/graph/doc/graph_traits.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/graph_traits.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Graph Traits</Title>

Modified: boost/trunk/libs/graph/doc/gursoy_atun_layout.html
===================================================================
--- boost/trunk/libs/graph/doc/gursoy_atun_layout.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/gursoy_atun_layout.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <HTML>
+<!--
+  -- Copyright (c) 2004 Trustees of Indiana University
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <Head>
 <Title>Boost Graph Library: G&uuml;rsoy-Atun Layout</Title>
 <script language="JavaScript" type="text/JavaScript">

Modified: boost/trunk/libs/graph/doc/history.html
===================================================================
--- boost/trunk/libs/graph/doc/history.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/history.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: History</Title>
@@ -83,11 +79,12 @@
   <a name="1.34.0"></a><li>Version 1.34.0<br><b>New algorithms and components</b>
     <ul>
       <li><a href="maximum_matching.html"><tt>edmonds_maximum_cardinality_matching</tt></a>, from Aaron Windsor.</li>
-      <li><a href="lengauer_tarjan_dominator_tree.htm"><tt>lengauer_tarjan_dominator_tree</tt></a>, from JongSoo Park.</li>
+      <li><a href="lengauer_tarjan_dominator.htm"><tt>lengauer_tarjan_dominator_tree</tt></a>, from JongSoo Park.</li>
       <li><a href="compressed_sparse_row.html"><tt>compressed_sparse_row_graph</tt></a>, from Jeremiah Willcock and Douglas Gregor of Indiana University.</li>
-      <li><a href="sorted_erdos_renyi_generator.html"><tt>sorted_erdos_renyi_iterator</tt></a>, from Jeremiah Willcock of Indiana University.</li>
+      <li><a href="sorted_erdos_renyi_gen.html"><tt>sorted_erdos_renyi_iterator</tt></a>, from Jeremiah Willcock of Indiana University.</li>
     </ul><br><b>Enhancements</b><br>
     <ul>
+       <li>Note: the name of the compiled library for GraphViz reading is now called <code>boost_graph</code> rather than <code>bgl-viz</code>.</li>
       <li><a href="biconnected_components.html"><tt>biconnected_components</tt></a> now has a visitor parameter and supports named parameters, from Janusz Piwowarski.</li>
       <li><a href="adjacency_matrix.html"><tt>adjacency_matrix</tt></a> now models the <a href="BidirectionalGraph.html">Bidirectional Graph</a> concept.</li>
                              <li><a href="adjacency_list.html"><tt>adjacency_list</tt></a> is now <a href="../../serialization/doc/index.html">Serializable</a>, from Jeremy Siek of Rice University.</li>

Modified: boost/trunk/libs/graph/doc/incident.html
===================================================================
--- boost/trunk/libs/graph/doc/incident.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/incident.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: incident</Title>

Modified: boost/trunk/libs/graph/doc/incremental_components.html
===================================================================
--- boost/trunk/libs/graph/doc/incremental_components.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/incremental_components.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Incremental Connected Components</Title>

Modified: boost/trunk/libs/graph/doc/index.html
===================================================================
--- boost/trunk/libs/graph/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>The Boost Graph Library</Title>

Modified: boost/trunk/libs/graph/doc/inv_adjacency_iterator.html
===================================================================
--- boost/trunk/libs/graph/doc/inv_adjacency_iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/inv_adjacency_iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <html>
+<!--
+  -- Copyright (c) 2000 Jeremy Siek
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
 
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">

Modified: boost/trunk/libs/graph/doc/isomorphism.html
===================================================================
--- boost/trunk/libs/graph/doc/isomorphism.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/isomorphism.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Isomorphism</Title>

Modified: boost/trunk/libs/graph/doc/johnson_all_pairs_shortest.html
===================================================================
--- boost/trunk/libs/graph/doc/johnson_all_pairs_shortest.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/johnson_all_pairs_shortest.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Johnson All Pairs Shortest Paths</Title>

Modified: boost/trunk/libs/graph/doc/jwebfrob.pl
===================================================================
--- boost/trunk/libs/graph/doc/jwebfrob.pl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/jwebfrob.pl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
 
 
 $lastpage = 0;

Modified: boost/trunk/libs/graph/doc/kamada_kawai_spring_layout.html
===================================================================
--- boost/trunk/libs/graph/doc/kamada_kawai_spring_layout.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/kamada_kawai_spring_layout.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,12 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
+<!--
+  -- Copyright (c) 2004 Trustees of Indiana University
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <head>
 <meta name="generator" content=
 "HTML Tidy for Mac OS X (vers 12 April 2005), see www.w3.org">

Modified: boost/trunk/libs/graph/doc/kevin_bacon.html
===================================================================
--- boost/trunk/libs/graph/doc/kevin_bacon.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/kevin_bacon.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Kevin Bacon Example</Title>

Modified: boost/trunk/libs/graph/doc/king_ordering.html
===================================================================
--- boost/trunk/libs/graph/doc/king_ordering.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/king_ordering.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   ~~ Copyright (c) Jeremy Siek 2000
   ~~
-  ~~ Permission to use, copy, modify, distribute and sell this software
-  ~~ and its documentation for any purpose is hereby granted without fee,
-  ~~ provided that the above copyright notice appears in all copies and
-  ~~ that both that copyright notice and this permission notice appear
-  ~~ in supporting documentation.  Silicon Graphics makes no
-  ~~ representations about the suitability of this software for any
-  ~~ purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
 -->
   
   

Modified: boost/trunk/libs/graph/doc/known_problems.html
===================================================================
--- boost/trunk/libs/graph/doc/known_problems.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/known_problems.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Known Problems</Title>

Modified: boost/trunk/libs/graph/doc/kruskal_min_spanning_tree.html
===================================================================
--- boost/trunk/libs/graph/doc/kruskal_min_spanning_tree.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/kruskal_min_spanning_tree.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Kruskal Minimum Spanning Tree</Title>

Modified: boost/trunk/libs/graph/doc/layout_tolerance.html
===================================================================
--- boost/trunk/libs/graph/doc/layout_tolerance.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/layout_tolerance.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
-<html><head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"><title>Struct template layout_tolerance</title></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><table cellpadding="2" width="100%"><td valign="top"><img src="../../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td><td align="center"><a href="../../../index.htm">Home</a></td><td align="center"><a href="../../libraries.htm">Libraries</a></td><td align="center"><a href="../../../people/people.htm">People</a></td><td align="center"><a href="../../../more/faq.htm">FAQ</a></td><td align="center"><a href="../../../more/index.htm">More</a></td></table><hr><div class="refentry" lang="en"><a name="struct.boost.layout_tolerance"></a><div class="titlepage"><div></div><div></div></div><div class="refnamediv"><h2><span class="refentrytitle">Struct template layout_tolerance</span></h2><p>boost::layout_tolerance &#8212; Determines when to terminate layout of a particular graph based on a given relative tolerance. </p></div><h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2><div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="bold"><b>template</b></span>&lt;<span class="bold"><b>typename</b></span> T = double&gt; 
+<html><!--
+  -- Copyright (c) 2004 Trustees of Indiana University
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
+<head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"><title>Struct template layout_tolerance</title></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><table cellpadding="2" width="100%"><td valign="top"><img src="../../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td><td align="center"><a href="../../../index.htm">Home</a></td><td align="center"><a href="../../libraries.htm">Libraries</a></td><td align="center"><a href="../../../people/people.htm">People</a></td><td align="center"><a href="../../../more/faq.htm">FAQ</a></td><td align="center"><a href="../../../more/index.htm">More</a></td></table><hr><div class="refentry" lang="en"><a name="struct.boost.layout_tolerance"></a><div class="titlepage"><div></div><div></div></div><div class="refnamediv"><h2><span class="refentrytitle">Struct template layout_tolerance</span></h2><p>boost::layout_tolerance &#8212; Determines when to terminate layout of a particular graph based on a given relative tolerance. </p></div><h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2><div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="bold"><b>template</b></span>&lt;<span class="bold"><b>typename</b></span> T = double&gt; 
 <span class="bold"><b>struct</b></span> layout_tolerance {
   <span class="emphasis"><em>// <a href="layout_tolerance.html#layout_toleranceconstruct-copy-destruct">construct/copy/destruct</a></em></span>
   <a href="layout_tolerance.html#id103752-bb">layout_tolerance</a>(<span class="bold"><b>const</b></span> T &amp; = T(0.001));

Modified: boost/trunk/libs/graph/doc/leda_conversion.html
===================================================================
--- boost/trunk/libs/graph/doc/leda_conversion.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/leda_conversion.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Converting Existing Graphs to BGL</Title>

Copied: boost/trunk/libs/graph/doc/lengauer_tarjan_dominator.htm (from rev 14034, boost/branches/upstream/current/libs/graph/doc/lengauer_tarjan_dominator.htm)

Deleted: boost/trunk/libs/graph/doc/lengauer_tarjan_dominator_tree.htm
===================================================================
--- boost/trunk/libs/graph/doc/lengauer_tarjan_dominator_tree.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/lengauer_tarjan_dominator_tree.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,187 +0,0 @@
-<HTML>
-<!--
-  -- Copyright (c) JongSoo Park 2005
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
-<Head>
-<Title>Boost Graph Library: Lengauer-Tarjan Dominator Tree Algorithm</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
-        ALINK="#ff0000"> 
-<IMG SRC="../../../boost.png" 
-     ALT="C++ Boost" width="277" height="86"> 
-
-<BR Clear>
-
-<H1><A NAME="sec:lengauer-tarjan"></A>
-<TT>lengauer_tarjan_dominator_tree</TT>
-</H1>
-
-
-<P>
-<PRE>
-<i>// The simplest version:
-// Data structures for depth first search is created internally,
-// and depth first search runs internally.</i>
-template &lt;class Graph, class DomTreePredMap&gt;
-void
-lengauer_tarjan_dominator_tree
-  (const Graph&amp; g,
-   const typename graph_traits&lt;Graph&gt;::vertex_descriptor&amp; entry,
-   DomTreePredMap domTreePredMap)
-
-<i>// The version providing data structures for depth first search:
-// After calling this function,
-// user can reuse the depth first search related information
-// filled in property maps.</i>
-template &lt;class Graph, class IndexMap, class TimeMap, class PredMap,
-             class VertexVector, class DomTreePredMap&gt;
-void
-lengauer_tarjan_dominator_tree
-  (const Graph&amp; g,
-   const typename graph_traits&lt;Graph&gt;::vertex_descriptor&amp; entry,
-   const IndexMap&amp; indexMap,
-   TimeMap dfnumMap, PredMap parentMap, VertexVector&amp; verticesByDFNum,
-   DomTreePredMap domTreePredMap)
-
-<i>// The version without depth first search:
-// The caller should provide depth first search related information
-// evaluated before.</i>
-template &lt;class Graph, class IndexMap, class TimeMap, class PredMap,
-             class VertexVector, class DomTreePredMap&gt;
-void
-lengauer_tarjan_dominator_tree_without_dfs(
-  (const Graph&amp; g,
-   const typename graph_traits&lt;Graph&gt;::vertex_descriptor&amp; entry,
-   const IndexMap&amp; indexMap,
-   TimeMap dfnumMap, PredMap parentMap, VertexVector&amp; verticesByDFNum,
-   DomTreePredMap domTreePredMap)
-</PRE>
-
-<P> This algorithm&nbsp;[<A
-HREF="bibliography.html#lengauer-tarjan79">65</A>,<A
-HREF="bibliography.html#muchnick97">66</A>,<A
-HREF="bibliography.html#appel98">67</A>] builds the dominator tree for
-directed graph. There are three options for dealing the depth first
-search related values. The simplest version creates data structures
-and run depth first search internally. However, chances are that a
-user wants to reuse the depth first search data, so we have two
-versions.  </P>
-
-<P> A vertex <i>u</i> dominates a vertex <i>v</i>, if every path of
-directed graph from the entry to <i>v</i> must go through <i>u</i>. In
-the left graph of <a href="#fig:dominator-tree-example">Figure 1</a>,
-vertex 1 dominates vertex 2, 3, 4, 5, 6 and 7, because we have to pass
-vertex 1 to reach those vertex. Note that vertex 4 dominates vertex 6,
-even though vertex 4 is a successor of vertex 6. Dominator
-relationship is useful in many applications especially for compiler
-optimization. We can define the immediate dominator for each vertex
-such that <i>idom(n) dominates n</i> but does not dominate any other
-dominator of <i>n</i>. For example, vertex 1, 3 and 4 are dominators
-of vertex 6, but vertex 4 is the immediate dominator, because vertex 1
-and 3 dominates vertex 4. If we make every idom of each vertex as its
-parent, we can build the dominator tree like the right part of <a
-href="#fig:dominator-tree-example">Figure 1</a> </P>
-
-<P></P>
-<DIV ALIGN="CENTER"><A NAME="fig:dominator-tree-example">
-<TABLE>
-<CAPTION ALIGN="BOTTOM"><STRONG>Figure 1:</STRONG>
-An example graph and its dominator tree.</CAPTION>
-<TR>
-<TD><IMG SRC="./figs/dominator-tree1.gif"></TD>
-<TD>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
-<TD><IMG SRC="./figs/dominator-tree2.gif"></TD>
-</TR>
-</TABLE>
-</DIV><P></P>
-
-<P> An easy way to build dominator tree is to use iterative bit vector
-algorithm, but it may be slow in the worst case. We implemented
-Lengauer-Tarjan algorithm whose time complexity is
-<i>O((V+E)log(V+E))</i>.  </P>
-
-<P> Lengauer-Tarjan algorithm utilizes two techniques. The first one
-is, as an intermediate step, finding semidominator which is relatively
-easier to evaluate than immediate dominator, and the second one is the
-path compression. For the detail of the algorithm, see [<A
-HREF="bibliography.html#lengauer-tarjan79">65</A>].  </P>
-
-<h3>Where Defined</h3>
-
-<a href="../../../boost/graph/dominator_tree.hpp"><tt>boost/graph/dominator_tree.hpp</tt></a>
-
-<h3>Parameters</h3>
-
-IN: <tt>const Graph&amp; g</tt>
-<blockquote>
-  The graph object on which the algorithm will be applied.
-  The type <tt>Graph</tt> must be a model of
-  <a href="./VertexListGraph.html">Vertex List Graph</a>
-  and <a href="./BidirectionalGraph.html">Bidirectional Graph</a>.<br>
-</blockquote>
-
-IN: <tt>vertex_descriptor entry</tt>
-<blockquote>
-  The entry vertex. The dominator tree will be rooted at this vertex.
-</blockquote>
-
-IN: <tt>IndexMap indexMap</tt>
-<blockquote>
-  This maps each vertex to an integer in the range <tt>[0, num_vertices(g))</tt>.
-  The type 
-  <tt>VertexIndexMap</tt> must be a model of
-  <a href="../../property_map/ReadablePropertyMap.html">Readable Property Map</a>. The value type of the map must be an
-  integer type. The vertex descriptor type of the graph needs to be
-  usable as the key type of the map.
-</blockquote>
-
-IN/OUT: <tt>TimeMap dfnumMap</tt>
-<blockquote>
-  The sequence number of depth first search. The type <tt>TimeMap</tt> must be a model of <a href="../../property_map/ReadWritePropertyMap.html">Read/Write Property Map</a>. The vertex descriptor type of the graph needs to be usable as the key type of the <tt>TimeMap</tt>.
-</blockquote>
-
-IN/OUT: <tt>PredMap parentMap</tt>
-<blockquote>
-  The predecessor map records the parent of the depth first search tree. The <tt>PredMap</tt> type must be a <a href="../../property_map/ReadWritePropertyMap.html">Read/Write Property Map</a> whose key and value types are the same as the vertex descriptor type of the graph.
-</blockquote>
-
-IN/OUT: <tt>VertexVector verticesByDFNum</tt>
-<blockquote>
-  The vector containing vertices in depth first search order. If we access this vector sequentially, it's equivalent to access vertices by depth first search order.
-</blockquote>
-
-OUT: <tt>DomTreePredMap domTreePredMap</tt>
-<blockquote>
-  The dominator tree where parents are each children's immediate dominator.
-</blockquote>
-
-<H3>Complexity</H3>
-
-<P>
-The time complexity is <i>O((V+E)log(V+E))</i>.
-
-<H3>Example</H3>
-
-<P>
-See <a href="../test/dominator_tree_test.cpp">
-<TT>test/dominator_tree_test.cpp</TT></a> for an example of using Dijkstra's
-algorithm.
-
-<br>
-<HR>
-<TABLE>
-<TR valign="top">
-<TD>Copyright &copy; 2005</TD><TD>
-JongSoo Park, Stanford University
-</TD></TR></TABLE>
-
-</BODY>
-</HTML> 
-

Modified: boost/trunk/libs/graph/doc/maximum_matching.html
===================================================================
--- boost/trunk/libs/graph/doc/maximum_matching.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/maximum_matching.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -224,7 +224,7 @@
 </p><h3>Where Defined</h3>
 
 <p>
-<a href="../../../boost/graph/maximum_cardinality_matching.hpp"><tt>boost/graph/maximum_cardinality_matching.hpp</tt></a>
+<a href="../../../boost/graph/max_cardinality_matching.hpp"><tt>boost/graph/max_cardinality_matching.hpp</tt></a>
 
 
 </p><h3>Parameters</h3>

Modified: boost/trunk/libs/graph/doc/minimum_degree_ordering.html
===================================================================
--- boost/trunk/libs/graph/doc/minimum_degree_ordering.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/minimum_degree_ordering.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Lie-Quan Lee and Jeremy Siek, 2001
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Minimum Degree Ordering</Title>

Modified: boost/trunk/libs/graph/doc/null_visitor.html
===================================================================
--- boost/trunk/libs/graph/doc/null_visitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/null_visitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: null_visitor</Title>

Modified: boost/trunk/libs/graph/doc/opposite.html
===================================================================
--- boost/trunk/libs/graph/doc/opposite.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/opposite.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: opposite</Title>

Modified: boost/trunk/libs/graph/doc/predecessor_recorder.html
===================================================================
--- boost/trunk/libs/graph/doc/predecessor_recorder.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/predecessor_recorder.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: predecessor_recorder</Title>

Modified: boost/trunk/libs/graph/doc/prim_minimum_spanning_tree.html
===================================================================
--- boost/trunk/libs/graph/doc/prim_minimum_spanning_tree.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/prim_minimum_spanning_tree.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Prim Minimum Spanning Tree</Title>

Modified: boost/trunk/libs/graph/doc/profile.htm
===================================================================
--- boost/trunk/libs/graph/doc/profile.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/profile.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,13 +4,9 @@
 <META http-equiv=Content-Type content="text/html; charset=windows-1252"><!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <META content="MSHTML 6.00.2715.400" name=GENERATOR></HEAD>
 <BODY text=#000000 vLink=#551a8b aLink=#ff0000 link=#0000ee bgColor=#ffffff>

Modified: boost/trunk/libs/graph/doc/property.html
===================================================================
--- boost/trunk/libs/graph/doc/property.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/property.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Property</Title>

Modified: boost/trunk/libs/graph/doc/property_map.html
===================================================================
--- boost/trunk/libs/graph/doc/property_map.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/property_map.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Property Map Traits</Title>

Modified: boost/trunk/libs/graph/doc/property_writer.html
===================================================================
--- boost/trunk/libs/graph/doc/property_writer.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/property_writer.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: property_writer</Title>

Modified: boost/trunk/libs/graph/doc/publications.html
===================================================================
--- boost/trunk/libs/graph/doc/publications.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/publications.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Publications</Title>

Modified: boost/trunk/libs/graph/doc/push_relabel_max_flow.html
===================================================================
--- boost/trunk/libs/graph/doc/push_relabel_max_flow.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/push_relabel_max_flow.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Push-Relabel Maximum Flow</Title>

Modified: boost/trunk/libs/graph/doc/python.html
===================================================================
--- boost/trunk/libs/graph/doc/python.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/python.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <html>
+<!--
+  -- Copyright (c) 2005 Trustees of Indiana University
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
   <head>
     <title>Boost Graph Library: Python Bindings (Experimental)</title>
     <script language="JavaScript" type="text/JavaScript">

Modified: boost/trunk/libs/graph/doc/quick_tour.html
===================================================================
--- boost/trunk/libs/graph/doc/quick_tour.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/quick_tour.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 
 <head>

Modified: boost/trunk/libs/graph/doc/random.html
===================================================================
--- boost/trunk/libs/graph/doc/random.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/random.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <html>
+<!--
+  -- Copyright (c) 2003 Vladimir Prus
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <head>
 <title>Boost Graph Library: random</title>
 

Modified: boost/trunk/libs/graph/doc/random_layout.html
===================================================================
--- boost/trunk/libs/graph/doc/random_layout.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/random_layout.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <HTML>
+<!--
+  -- Copyright (c) 2005 Trustees of Indiana University
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <Head>
 <Title>Boost Graph Library: Random Graph Layout</Title>
 <BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 

Modified: boost/trunk/libs/graph/doc/read_graphviz.html
===================================================================
--- boost/trunk/libs/graph/doc/read_graphviz.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/read_graphviz.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,12 @@
 <!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">
+<!--
+  -- Copyright (c) 2005 Trustees of Indiana University
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.3: http://docutils.sourceforge.net/" />
@@ -123,7 +130,7 @@
 <div class="section" id="building-the-graphviz-readers">
 <h1><a class="toc-backref" href="#id4" name="building-the-graphviz-readers">Building the GraphViz Readers</a></h1>
 <p>To use the GraphViz readers, you will need to build and link against
-the &quot;bgl-viz&quot; library. The library can be built by following the
+the &quot;boost_graph&quot; library. The library can be built by following the
 <a class="reference" href="../../../more/getting_started.html#Build_Install">Boost Jam Build Instructions</a> for the subdirectory <tt class="literal"><span class="pre">libs/graph/build</span></tt>.</p>
 </div>
 <div class="section" id="deprecated-readers">

Modified: boost/trunk/libs/graph/doc/read_graphviz.rst
===================================================================
--- boost/trunk/libs/graph/doc/read_graphviz.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/read_graphviz.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,6 +6,10 @@
    :align: middle
    :alt: Boost
 
+.. Copyright (c) 2005 Trustees of Indiana University
+    Distributed under the Boost Software License, Version 1.0.
+    (See accompanying file LICENSE_1_0.txt or copy at
+     http://www.boost.org/LICENSE_1_0.txt)
 __ ../../../index.htm
 
 ::
@@ -121,7 +125,7 @@
 Building the GraphViz Readers
 -----------------------------
 To use the GraphViz readers, you will need to build and link against
-the "bgl-viz" library. The library can be built by following the
+the "boost_graph" library. The library can be built by following the
 `Boost Jam Build Instructions`_ for the subdirectory ``libs/graph/build``.
 
 Deprecated Readers

Modified: boost/trunk/libs/graph/doc/reverse_graph.html
===================================================================
--- boost/trunk/libs/graph/doc/reverse_graph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/reverse_graph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,10 @@
 <HTML>
 <!--
-  --  (C) Copyright David Abrahams and Jeremy Siek 2000. Permission to copy,
-  --  use, modify, sell and distribute this software is granted provided this
-  --  copyright notice appears in all copies. This software is provided
-  --  "as is" without express or implied warranty, and with no claim as
-  --  to its suitability for any purpose.
+  --  (C) Copyright David Abrahams and Jeremy Siek 2000.
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Reverse Graph Adaptor</Title>

Modified: boost/trunk/libs/graph/doc/sequential_vertex_coloring.html
===================================================================
--- boost/trunk/libs/graph/doc/sequential_vertex_coloring.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/sequential_vertex_coloring.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,12 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
+<!--
+  -- Copyright (c) 2005 Trustees of Indiana University
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
   <head>
     <title>Boost Graph Library: Sequential Vertex Coloring</title>
   </head>

Modified: boost/trunk/libs/graph/doc/sloan_ordering.htm
===================================================================
--- boost/trunk/libs/graph/doc/sloan_ordering.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/sloan_ordering.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,13 +4,9 @@
 <META http-equiv=Content-Type content="text/html; charset=windows-1252"><!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <META content="MSHTML 6.00.2715.400" name=GENERATOR></HEAD>
 <BODY text=#000000 vLink=#551a8b aLink=#ff0000 link=#0000ee bgColor=#ffffff>
@@ -91,9 +87,9 @@
   manually. But there is also an algorithm sloan_starting_nodes that provides 
   usually quite good start and end vertices. Each vertex is asigned with a priority. 
   This priority is a weighted sum of the distance of the vector to the end vertex 
-  (a global criterium) and is called the current degree of vertex. This current 
+  (a global criterion) and is called the current degree of vertex. This current 
   degree basically reflects the status of the renumbering in the neighborhood 
-  of a vertex (a local criterium). Therefore the Sloan algorithm (in contrast 
+  of a vertex (a local criterion). Therefore the Sloan algorithm (in contrast 
   to-McKee) takes into account local as well as global criteria for the renumbering 
   sequence. One can play around with the relative weights, but the default values 
   proposed by Sloan (weight1/weight2=1/2) turn out to be pretty good in most cases. 

Modified: boost/trunk/libs/graph/doc/sloan_start_end_vertices.htm
===================================================================
--- boost/trunk/libs/graph/doc/sloan_start_end_vertices.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/sloan_start_end_vertices.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,13 +4,9 @@
 <META http-equiv=Content-Type content="text/html; charset=windows-1252"><!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <META content="MSHTML 6.00.2715.400" name=GENERATOR></HEAD>
 <BODY text=#000000 vLink=#551a8b aLink=#ff0000 link=#0000ee bgColor=#ffffff><IMG 

Copied: boost/trunk/libs/graph/doc/sorted_erdos_renyi_gen.html (from rev 14034, boost/branches/upstream/current/libs/graph/doc/sorted_erdos_renyi_gen.html)

Deleted: boost/trunk/libs/graph/doc/sorted_erdos_renyi_generator.html
===================================================================
--- boost/trunk/libs/graph/doc/sorted_erdos_renyi_generator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/sorted_erdos_renyi_generator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,133 +0,0 @@
-<HTML>
-<!--
-  -- Copyright (c) 2004, 2005 The Trustees of Indiana University
-  --
-  -- Use, modification and distribution is subject to the Boost Software
-  -- License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-  -- http://www.boost.org/LICENSE_1_0.txt)
-  --
-  --  Authors: Jeremiah Willcock
-  --           Douglas Gregor
-  --           Andrew Lumsdaine
-  -->
-<Head>
-  <Title>Boost Graph Library: Erd&ouml;s-Renyi Generator</Title>
-<script language="JavaScript" type="text/JavaScript">
-<!--
-function address(host, user) {
-        var atchar = '@';
-        var thingy = user+atchar+host;
-        thingy = '<a hre' + 'f=' + "mai" + "lto:" + thingy + '>' + user+atchar+host + '</a>';
-        document.write(thingy);
-}
-//-->
-</script>
-</head>
-
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
-        ALINK="#ff0000"> 
-<IMG SRC="../../../boost.png" 
-     ALT="C++ Boost" width="277" height="86"> 
-
-<tt>sorted_erdos_renyi_iterator</tt>
-
-<br>
-
-<PRE>
-template&lt;typename RandomGenerator, typename Graph&gt;
-class sorted_erdos_renyi_iterator
-{
-public:
-  typedef std::input_iterator_tag iterator_category;
-  typedef std::pair&lt;vertices_size_type, vertices_size_type&gt; value_type;
-  typedef const value_type&amp; reference;
-  typedef const value_type* pointer;
-  typedef void difference_type;
-
-  sorted_erdos_renyi_iterator();
-  sorted_erdos_renyi_iterator(RandomGenerator&amp; gen, vertices_size_type n,
-                              double probability = 0.0, bool allow_self_loops = false);
-
-  // Iterator operations
-  reference operator*() const;
-  pointer operator-&gt;() const;
-  sorted_erdos_renyi_iterator&amp; operator++();
-  sorted_erdos_renyi_iterator operator++(int);
-  bool operator==(const sorted_erdos_renyi_iterator&amp; other) const;
-  bool operator!=(const sorted_erdos_renyi_iterator&amp; other) const;
-}; 
-</PRE>
-
-<p> This class template implements a generator for Erd&ouml;s-Renyi
-graphs, suitable for initializing an <a
-href="adjacency_list.html"><tt>adjacency_list</tt></a> or other graph
-structure with iterator-based initialization. An Erd&ouml;s-Renyi
-graph <em>G = (n, p)</em> is a graph with <em>n</em> vertices
-that. The probability of having an edge <em>(u, v)</em> in <em>G</em>
-is <em>p</em> for any vertices <em>u</em> and <em>v</em>. Typically,
-there are no self-loops, but the generator can optionally introduce
-self-loops with probability <em>p</em>.</p>
-
-<p>Erd&ouml;s-Renyi graphs typically exhibit very little
-structure. For this reason, they are rarely useful in modeling
-real-world problems. However, they are often used when determining
-the theoretical complexity of complex graph algorithms.</p>
-
-<h3>Where Defined</h3>
-
-<a href="../../../boost/graph/erdos_renyi_generator.hpp"><tt>boost/graph/erdos_renyi_generator.hpp</tt></a>
-
-<h3>Constructors</h3>
-
-<a name="default-constructor"/>
-<pre>sorted_erdos_renyi_iterator();</pre>
-<blockquote>
-Constructs a past-the-end iterator.
-</blockquote>
-
-<pre>
-sorted_erdos_renyi_iterator(RandomGenerator&amp; gen, vertices_size_type n,
-                            double probability = 0.0, bool allow_self_loops = false);
-</pre>
-<blockquote>
-Constructs an Erd&ouml;s-Renyi generator iterator that creates a
-graph with <tt>n</tt> vertices and a given <tt>probability</tt> of the
-total number of edges that a simple graph may have.
-<tt>probability</tt>. Random vertices and edges are selected using the
-random number generator <tt>gen</tt>. Self-loops are permitted only when
-<tt>allow_self_loops</tt> is <tt>true</tt>.
-</blockquote>
-
-<H3>Example</H3>
-
-<pre>
-#include &lt;boost/graph/adjacency_list.hpp&gt;
-#include &lt;boost/graph/erdos_renyi_generator.hpp&gt;
-#include &lt;boost/random/linear_congruential.hpp&gt;
-
-typedef boost::adjacency_list&lt;&gt; Graph;
-typedef boost::sorted_erdos_renyi_iterator&lt;boost::minstd_rand, Graph&gt; ERGen;
-
-int main()
-{
-  boost::minstd_rand gen;
-  // Create graph with 100 nodes and edges with probability 0.05
-  Graph g(ERGen(gen, 100, 0.05), ERGen(), 100);
-  return 0;
-}
-</pre>
-
-<br>
-<HR>
-<TABLE>
-<TR valign=top>
-<TD nowrap>Copyright &copy 2005</TD><TD>
-Jeremiah Willcock, Indiana University (<script language="Javascript">address("cs.indiana.edu", "jewillco")</script>)<br>
-  
-<A HREF="../../../people/doug_gregor.html">Doug Gregor</A>, Indiana University (<script language="Javascript">address("cs.indiana.edu", "dgregor")</script>)<br>
-  <A HREF=http://www.osl.iu.edu/~lums>Andrew Lumsdaine</A>,
-Indiana University (<script language="Javascript">address("osl.iu.edu", "lums")</script>)
-</TD></TR></TABLE>
-
-</BODY>
-</HTML> 

Modified: boost/trunk/libs/graph/doc/sparse_matrix_ordering.html
===================================================================
--- boost/trunk/libs/graph/doc/sparse_matrix_ordering.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/sparse_matrix_ordering.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Sparse Matrix Ordering Example</Title>

Modified: boost/trunk/libs/graph/doc/stanford_graph.html
===================================================================
--- boost/trunk/libs/graph/doc/stanford_graph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/stanford_graph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,14 +3,9 @@
   Copyright (C) 2001, Andreas Scherer, Jeremy Siek, Lie-Quan Lee,
   and Andrew Lumsdaine
 
-  Permission to use, copy, modify, distribute and sell this software and its
-  documentation for any purpose is hereby granted without fee, provided that
-  the above copyright notice appears in all copies and that both that
-  copyright notice and this permission notice appear in supporting
-  documentation.
-  
-  We make no representations about the suitability of this software for any
-  purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Stanford Graph Interface</Title>

Modified: boost/trunk/libs/graph/doc/strong_components.html
===================================================================
--- boost/trunk/libs/graph/doc/strong_components.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/strong_components.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Strongly Connected Components</Title>

Modified: boost/trunk/libs/graph/doc/subgraph.html
===================================================================
--- boost/trunk/libs/graph/doc/subgraph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/subgraph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Subgraph</Title>

Modified: boost/trunk/libs/graph/doc/table_of_contents.html
===================================================================
--- boost/trunk/libs/graph/doc/table_of_contents.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/table_of_contents.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Table of Contents: Boost Graph Library</Title>
@@ -213,7 +209,7 @@
                   </ol>
                 </li>
 		<li><a href="astar_search.html"><tt>astar_search</tt></a></li>
-                <li><a href="lengauer_tarjan_dominator_tree.htm"><tt>lengauer_tarjan_dominator_tree</tt></a></li>
+                <li><a href="lengauer_tarjan_dominator.htm"><tt>lengauer_tarjan_dominator_tree</tt></a></li>
             </OL>
          </OL>
 
@@ -240,7 +236,7 @@
           <LI><a href="./random.html#generate_random_graph">generate_random_graph</a>
           <LI><a href="./random.html#randomize_property">randomize_property</a>
           <li><a href="erdos_renyi_generator.html"><tt>erdos_renyi_iterator</tt></li>
-          <li><a href="sorted_erdos_renyi_generator.html"><tt>sorted_erdos_renyi_iterator</tt></li>
+          <li><a href="sorted_erdos_renyi_gen.html"><tt>sorted_erdos_renyi_iterator</tt></li>
           <li><a href="plod_generator.html"><tt>plod_iterator</tt></li>
           <li><a href="small_world_generator.html"><tt>small_world_iterator</tt></li>
           </OL>

Modified: boost/trunk/libs/graph/doc/time_stamper.html
===================================================================
--- boost/trunk/libs/graph/doc/time_stamper.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/time_stamper.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: time_stamper</Title>

Modified: boost/trunk/libs/graph/doc/topological_sort.html
===================================================================
--- boost/trunk/libs/graph/doc/topological_sort.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/topological_sort.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Topological Sort</Title>

Modified: boost/trunk/libs/graph/doc/transitive_closure.html
===================================================================
--- boost/trunk/libs/graph/doc/transitive_closure.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/transitive_closure.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2001
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Transitive Closure</Title>

Modified: boost/trunk/libs/graph/doc/transpose_graph.html
===================================================================
--- boost/trunk/libs/graph/doc/transpose_graph.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/transpose_graph.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Transpose Graph</Title>

Modified: boost/trunk/libs/graph/doc/trouble_shooting.html
===================================================================
--- boost/trunk/libs/graph/doc/trouble_shooting.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/trouble_shooting.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Trouble Shooting</Title>

Modified: boost/trunk/libs/graph/doc/undirected_dfs.html
===================================================================
--- boost/trunk/libs/graph/doc/undirected_dfs.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/undirected_dfs.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2002
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Depth-First Search</Title>

Modified: boost/trunk/libs/graph/doc/users.html
===================================================================
--- boost/trunk/libs/graph/doc/users.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/users.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <html>
+<!--
+  -- Copyright (c) 2002 Trustees of Indiana University
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <title>Boost Graph Library Users</title>
 <body BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
         ALINK="#ff0000"> 

Modified: boost/trunk/libs/graph/doc/using_adjacency_list.html
===================================================================
--- boost/trunk/libs/graph/doc/using_adjacency_list.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/using_adjacency_list.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Using the Boost Graph Library</Title>

Modified: boost/trunk/libs/graph/doc/using_property_maps.html
===================================================================
--- boost/trunk/libs/graph/doc/using_property_maps.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/using_property_maps.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Using Property Maps</Title>

Modified: boost/trunk/libs/graph/doc/visitor_concepts.html
===================================================================
--- boost/trunk/libs/graph/doc/visitor_concepts.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/visitor_concepts.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,9 @@
 <!--
   -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine  2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  We make no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: Visitor Concepts</Title>

Modified: boost/trunk/libs/graph/doc/wavefront.htm
===================================================================
--- boost/trunk/libs/graph/doc/wavefront.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/wavefront.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,13 +4,9 @@
 <META http-equiv=Content-Type content="text/html; charset=windows-1252"><!--
   -- Copyright (c) Jeremy Siek 2000
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <META content="MSHTML 6.00.2715.400" name=GENERATOR></HEAD>
 <BODY text=#000000 vLink=#551a8b aLink=#ff0000 link=#0000ee bgColor=#ffffff>

Modified: boost/trunk/libs/graph/doc/write-graphviz.html
===================================================================
--- boost/trunk/libs/graph/doc/write-graphviz.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/doc/write-graphviz.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,9 @@
 <!--
   -- Copyright (c) Lie-Quan Lee and Jeremy Siek 2000, 2001
   --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
   -->
 <Head>
 <Title>Boost Graph Library: write graphviz</Title>
@@ -234,6 +230,8 @@
 a BGL graph into a graphviz format file.
 
 <pre>
+#include &lt;boost/graph/graphviz.hpp&gt;
+
 enum files_e { dax_h, yow_h, boz_h, zow_h, foo_cpp, 
                foo_o, bar_cpp, bar_o, libfoobar_a,
                zig_cpp, zig_o, zag_cpp, zag_o, 
@@ -265,13 +263,15 @@
   };
   const int nedges = sizeof(used_by)/sizeof(Edge);
   int weights[nedges];
-  fill(weights, weights + nedges, 1);
+  std::fill(weights, weights + nedges, 1);
 
+  using namespace boost;
+
   typedef adjacency_list< vecS, vecS, directedS, 
       property< vertex_color_t, default_color_type >,
       property< edge_weight_t, int >
     > Graph;
-  Graph g(N, used_by, used_by + nedges, weights);
+  Graph g(used_by, used_by + nedges, weights, N);
 
   write_graphviz(std::cout, g, make_label_writer(name));
 }

Deleted: boost/trunk/libs/graph/example/Jamfile
===================================================================
--- boost/trunk/libs/graph/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,136 +0,0 @@
-subproject libs/graph/example ;
-
-# Define SGB (stanford graph base top level directory) and 
-# LEDA (also top level directory) at the command line of jam using -s
-
-rule graph-test ( sources + : requirements * )
-{
-    unit-test $(sources[1]:S=) : $(sources) : $(requirements) <sysinclude>$(BOOST_ROOT) : debug <inlining>on ;
-}
-
-graph-test remove_edge_if_bidir.cpp  ;
-graph-test undirected_dfs.cpp  ;
-graph-test remove_edge_if_dir.cpp  ;
-graph-test remove_edge_if_undir.cpp  ;
-graph-test reverse-graph-eg.cpp  ;
-graph-test scc.cpp <lib>../build/bgl-viz ;
-graph-test strong_components.cpp <lib>../build/bgl-viz ;
-graph-test strong-components.cpp  ;
-graph-test subgraph.cpp  ;
-graph-test subgraph_properties.cpp  ;
-graph-test topo-sort1.cpp  ;
-graph-test topo-sort2.cpp  ;
-graph-test topo_sort.cpp  ;
-graph-test topo-sort-file-dep2.cpp  ;
-graph-test topo-sort-file-dep.cpp  ;
-graph-test transitive_closure.cpp  ;
-graph-test transpose-example.cpp  ;
-graph-test undirected.cpp  ;
-graph-test vector-as-graph.cpp  ;
-graph-test vertex_basics.cpp  ;
-graph-test vertex-name-property.cpp  ;
-graph-test visitor.cpp  ;
-graph-test accum-compile-times.cpp  ;
-graph-test adjacency_list.cpp  ;
-graph-test adjacency_list_io.cpp  ;
-graph-test adjacency_matrix.cpp  ;
-graph-test bellman-example.cpp  ;
-graph-test bellman-ford-internet.cpp  ;
-graph-test bfs.cpp  ;
-graph-test bfs-example.cpp  ;
-graph-test bfs-name-printer.cpp  ;
-graph-test bfs_neighbor.cpp  ;
-graph-test biconnected_components.cpp  ;
-graph-test boost_web_graph.cpp  ;
-graph-test bucket_sorter.cpp  ;
-graph-test cc-internet.cpp <lib>../build/bgl-viz ;
-graph-test city_visitor.cpp  ;
-graph-test components_on_edgelist.cpp  ;
-graph-test connected_components.cpp  ;
-graph-test connected-components.cpp  ;
-graph-test container_gen.cpp  ;
-graph-test copy-example.cpp  ;
-graph-test cuthill_mckee_ordering.cpp  ;
-graph-test cycle-file-dep2.cpp  ;
-graph-test cycle-file-dep.cpp  ;
-graph-test dag_shortest_paths.cpp  ;
-graph-test dave.cpp  ;
-graph-test default-constructor2.cpp  ;
-graph-test default-constructor.cpp  ;
-graph-test dfs.cpp  ;
-graph-test dfs-example.cpp  ;
-graph-test dfs_parenthesis.cpp <lib>../build/bgl-viz ;
-graph-test dfs-parenthesis.cpp <lib>../build/bgl-viz ;
-graph-test dijkstra-example.cpp  ;
-graph-test edge_basics.cpp  ;
-graph-test edge_connectivity.cpp  ;
-graph-test edge-connectivity.cpp <lib>../build/bgl-viz ;
-graph-test edge-function.cpp  ;
-graph-test edge_iterator_constructor.cpp  ;
-graph-test edge-iter-constructor.cpp  ;
-graph-test edge_property.cpp  ;
-graph-test edmunds-karp-eg.cpp  ;
-graph-test exterior_properties.cpp  ;
-graph-test exterior_property_map.cpp  ;
-graph-test family-tree-eg.cpp  ;
-graph-test fibonacci_heap.cpp  ;
-graph-test file_dependencies.cpp  ;
-graph-test filtered_graph.cpp  ;
-graph-test filtered_vec_as_graph.cpp  ;
-graph-test gerdemann.cpp  ;
-graph-test graph-assoc-types.cpp  ;
-graph-test graph.cpp  ;
-graph-test graph-property-iter-eg.cpp  ;
-graph-test graphviz.cpp <lib>../build/bgl-viz ;
-graph-test incremental_components.cpp  ;
-graph-test incremental-components-eg.cpp  ;
-graph-test in_edges.cpp  ;
-graph-test interior_property_map.cpp  ;
-graph-test isomorphism.cpp  ;
-graph-test iterator-property-map-eg.cpp  ;
-graph-test johnson-eg.cpp <lib>../build/bgl-viz ;
-graph-test kevin-bacon.cpp  ;
-graph-test knights-tour.cpp  ;
-graph-test kruskal-example.cpp  ;
-graph-test kruskal-telephone.cpp <lib>../build/bgl-viz ;
-graph-test last-mod-time.cpp  ;
-graph-test loops_dfs.cpp <lib>../build/bgl-viz ;
-graph-test max_flow.cpp  ;
-graph-test minimum_degree_ordering.cpp iohb.c ;
-graph-test min_max_paths.cpp  ;
-graph-test modify_graph.cpp  ;
-graph-test neighbor_bfs.cpp  ;
-graph-test ordered_out_edges.cpp  ;
-graph-test ospf-example.cpp <lib>../build/bgl-viz ;
-graph-test parallel-compile-time.cpp  ;
-graph-test prim-example.cpp  ;
-graph-test prim-telephone.cpp <lib>../build/bgl-viz ;
-graph-test print-adjacent-vertices.cpp  ;
-graph-test print-edges.cpp  ;
-graph-test print-in-edges.cpp  ;
-graph-test print-out-edges.cpp  ;
-graph-test property_iterator.cpp  ;
-graph-test property-map-traits-eg.cpp  ;
-graph-test push-relabel-eg.cpp  ;
-graph-test put-get-helper-eg.cpp  ;
-graph-test quick_tour.cpp  ;
-graph-test quick-tour.cpp  ;
-graph-test reachable-loop-head.cpp <lib>../build/bgl-viz ;
-graph-test reachable-loop-tail.cpp <lib>../build/bgl-viz ;
-graph-test roget_components.cpp  :  
-  <include>$(SGB) <library-file>$(SGB)/libgb.a  ;
-graph-test topo-sort-with-leda.cpp  :  
-  <include>$(LEDA)/incl <library-file>$(LEDA)/libG.a
-  <library-file>$(LEDA)/libL.a <library-file>$(LEDA)/libP.a  ;
-graph-test topo-sort-with-sgb.cpp  :  
-   <include>$(SGB) <library-file>$(SGB)/libgb.a  ;
-graph-test leda-concept-check.cpp  :  
-  <include>$(LEDA)/incl <library-file>$(LEDA)/libG.a <library-file>$(LEDA)/libL.a <library-file>$(LEDA)/libP.a  ;
-graph-test leda-graph-eg.cpp  :  
-  <include>$(LEDA)/incl <library-file>$(LEDA)/libG.a
-  <library-file>$(LEDA)/libL.a <library-file>$(LEDA)/libP.a  ;
-graph-test girth.cpp  :  <include>$(SGB) 
-  <library-file>$(SGB)/libgb.a  ;
-graph-test miles_span.cpp  :  <include>$(SGB) 
-   <library-file>$(SGB)/libgb.a  ;
-

Modified: boost/trunk/libs/graph/example/cuthill_mckee_ordering.cpp
===================================================================
--- boost/trunk/libs/graph/example/cuthill_mckee_ordering.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/example/cuthill_mckee_ordering.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,25 +3,9 @@
 // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
 //          Doug Gregor, D. Kevin McGrath
 //
-// This file is part of the Boost Graph Library
-//
-// You should have received a copy of the License Agreement for the
-// Boost Graph Library along with the software; see the file LICENSE.
-// If not, contact Office of Research, University of Notre Dame, Notre
-// Dame, IN 46556.
-//
-// Permission to modify the code and to distribute modified code is
-// granted, provided the text of this NOTICE is retained, a notice that
-// the code was modified is included with the above COPYRIGHT NOTICE and
-// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
-// file is distributed with the modified code.
-//
-// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
-// By way of example, but not limitation, Licensor MAKES NO
-// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
-// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
-// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
-// OR OTHER RIGHTS.
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
 //=======================================================================
 
 #include <boost/config.hpp>

Modified: boost/trunk/libs/graph/example/data1.txt
===================================================================
--- boost/trunk/libs/graph/example/data1.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/example/data1.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
 # five vertices
 n 5
 # the edges

Modified: boost/trunk/libs/graph/example/data2.txt
===================================================================
--- boost/trunk/libs/graph/example/data2.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/example/data2.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
 # vertices
 v
 0 0.5 4.1 #

Modified: boost/trunk/libs/graph/example/data3.txt
===================================================================
--- boost/trunk/libs/graph/example/data3.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/example/data3.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
 # vertices and edges can be interleaved
 v 3.14 0
 v 3.15 1

Modified: boost/trunk/libs/graph/example/file_dependencies.cpp
===================================================================
--- boost/trunk/libs/graph/example/file_dependencies.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/example/file_dependencies.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,6 +6,9 @@
 // accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 //=======================================================================
+
+// Some small modifications are done by Alexander Holler
+
 /*
 
   Paul Moore's request:
@@ -14,14 +17,14 @@
   "experts", consider file dependencies. It's basically graph construction,
   plus topological sort, but it might make a nice "tutorial" example. Build a
   dependency graph of files, then use the algorithms to do things like
-  
+
   1. Produce a full recompilation order (topological sort, by modified date)
   2. Produce a "parallel" recompilation order (same as above, but group files
   which can be built in parallel)
   3. Change analysis (if I change file x, which others need recompiling)
   4. Dependency changes (if I add a dependency between file x and file y, what
   are the effects)
-  
+
 */
 
 #include <boost/config.hpp> // put this first to suppress some VC++ warnings
@@ -75,7 +78,7 @@
 
 int main(int,char*[])
 {
-    
+
   typedef pair<int,int> Edge;
   Edge used_by[] = {
     Edge(dax_h, foo_cpp), Edge(dax_h, bar_cpp), Edge(dax_h, yow_h),
@@ -94,79 +97,58 @@
     Edge(libzigzag_a, killerapp)
   };
   const std::size_t nedges = sizeof(used_by)/sizeof(Edge);
-  int weights[nedges];
-  std::fill(weights, weights + nedges, 1);
 
-  typedef adjacency_list<vecS, vecS, directedS, 
-      property<vertex_color_t, default_color_type>,
-      property<edge_weight_t, int>
-    > Graph;
+  typedef adjacency_list<vecS, vecS, bidirectionalS> Graph;
 #if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
   // VC++ can't handle the iterator constructor
   Graph g(N);
-  property_map<Graph, edge_weight_t>::type weightmap = get(edge_weight, g);
   for (std::size_t j = 0; j < nedges; ++j) {
     graph_traits<Graph>::edge_descriptor e; bool inserted;
     tie(e, inserted) = add_edge(used_by[j].first, used_by[j].second, g);
-    weightmap[e] = weights[j];
   }
 #else
-  Graph g(used_by, used_by + nedges, weights, N);
+  Graph g(used_by, used_by + nedges, N);
 #endif
   typedef graph_traits<Graph>::vertex_descriptor Vertex;
 
   // Determine ordering for a full recompilation
+  // and the order with files that can be compiled in parallel
   {
     typedef list<Vertex> MakeOrder;
+    MakeOrder::iterator i;
     MakeOrder make_order;
+
     topological_sort(g, std::front_inserter(make_order));
-    
     cout << "make ordering: ";
-    for (MakeOrder::iterator i = make_order.begin();
-         i != make_order.end(); ++i)
+    for (i = make_order.begin();
+         i != make_order.end(); ++i) 
       cout << name[*i] << " ";
-    cout << endl;
-  }
-  cout << endl;
+  
+    cout << endl << endl;
 
-  // Recompilation order with files that can be compiled in parallel
-  // grouped together
-  {
-    // Set up the necessary graph properties.
-    vector<int> time(N, (std::numeric_limits<int>::max)());
-    typedef vector<int>::iterator Time;
-    property_map<Graph, edge_weight_t>::type weight = get(edge_weight, g);
-
-    // Calculate the in_degree for each vertex.
-    vector<int> in_degree(N, 0);
-    graph_traits<Graph>::vertex_iterator i, iend;
-    graph_traits<Graph>::out_edge_iterator j, jend;
-    for (tie(i, iend) = vertices(g); i != iend; ++i)
-      for (tie(j, jend) = out_edges(*i,g); j != jend; ++j)
-        in_degree[target(*j,g)] += 1;
-
-    std::greater<int> compare;
-    closed_plus<int> combine;
-
-    // Run best-first-search from each vertex with zero in-degree.
-    for (tie(i, iend) = vertices(g); i != iend; ++i) {
-      if (in_degree[*i] == 0) {
-        std::vector<graph_traits<Graph>::vertex_descriptor> 
-          pred(num_vertices(g));
-        property_map<Graph, vertex_index_t>::type 
-          indexmap = get(vertex_index, g);
-        dijkstra_shortest_paths_no_init
-          (g, *i, &pred[0], &time[0], weight, indexmap, 
-           compare, combine, 0,  // Since we are using > instead of <, we
-                                 // flip 0 and inf.
-           default_dijkstra_visitor());
+    // Parallel compilation ordering
+    std::vector<int> time(N, 0);
+    for (i = make_order.begin(); i != make_order.end(); ++i) {    
+      // Walk through the in_edges an calculate the maximum time.
+      if (in_degree (*i, g) > 0) {
+        Graph::in_edge_iterator j, j_end;
+        int maxdist=0;
+        // Through the order from topological sort, we are sure that every 
+        // time we are using here is already initialized.
+        for (tie(j, j_end) = in_edges(*i, g); j != j_end; ++j)
+          maxdist=std::max(time[source(*j, g)], maxdist);
+        time[*i]=maxdist+1;
       }
     }
 
     cout << "parallel make ordering, " << endl
          << "vertices with same group number can be made in parallel" << endl;
-    for (tie(i,iend) = vertices(g); i != iend; ++i)
-      cout << "time_slot[" << name[*i] << "] = " << time[*i] << endl;
+    {
+      graph_traits<Graph>::vertex_iterator i, iend;
+      for (tie(i,iend) = vertices(g); i != iend; ++i)
+        cout << "time_slot[" << name[*i] << "] = " << time[*i] << endl;
+    }
+
   }
   cout << endl;
 

Modified: boost/trunk/libs/graph/example/kevin-bacon2.cpp
===================================================================
--- boost/trunk/libs/graph/example/kevin-bacon2.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/example/kevin-bacon2.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -38,7 +38,7 @@
 using namespace boost;
 
 typedef adjacency_list<vecS, vecS, undirectedS, 
-		       vertex_properties, edge_properties> Graph;
+               vertex_properties, edge_properties> Graph;
 typedef graph_traits<Graph>::vertex_descriptor Vertex;
 typedef graph_traits<Graph>::edge_descriptor Edge;
 
@@ -84,7 +84,7 @@
 
   for (tie(i, end) = vertices(g); i != end; ++i)
     std::cout << g[*i].name << " has a Bacon number of "
-	      << bacon_number[*i] << std::endl;
+          << bacon_number[*i] << std::endl;
 
   return 0;
 }

Modified: boost/trunk/libs/graph/example/king_ordering.cpp
===================================================================
--- boost/trunk/libs/graph/example/king_ordering.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/example/king_ordering.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,25 +3,9 @@
 // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
 //          Doug Gregor, D. Kevin McGrath
 //
-// This file is part of the Boost Graph Library
-//
-// You should have received a copy of the License Agreement for the
-// Boost Graph Library along with the software; see the file LICENSE.
-// If not, contact Office of Research, University of Notre Dame, Notre
-// Dame, IN 46556.
-//
-// Permission to modify the code and to distribute modified code is
-// granted, provided the text of this NOTICE is retained, a notice that
-// the code was modified is included with the above COPYRIGHT NOTICE and
-// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
-// file is distributed with the modified code.
-//
-// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
-// By way of example, but not limitation, Licensor MAKES NO
-// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
-// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
-// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
-// OR OTHER RIGHTS.
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
 //=======================================================================
 
 #include <boost/config.hpp>

Modified: boost/trunk/libs/graph/example/matching_example.cpp
===================================================================
--- boost/trunk/libs/graph/example/matching_example.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/example/matching_example.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,7 +11,7 @@
 #include <boost/graph/adjacency_list.hpp>
 #include <cassert>
 
-#include <boost/graph/maximum_cardinality_matching.hpp>
+#include <boost/graph/max_cardinality_matching.hpp>
 
 
 using namespace boost;

Modified: boost/trunk/libs/graph/example/property_iterator.cpp
===================================================================
--- boost/trunk/libs/graph/example/property_iterator.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/example/property_iterator.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,9 @@
 
-// (C) Copyright François Faure, iMAGIS-GRAVIR / UJF, 2001. Permission
-// to copy, use, modify, sell and distribute this software is granted
-// provided this copyright notice appears in all copies. This software
-// is provided "as is" without express or implied warranty, and with
-// no claim as to its suitability for any purpose.
+// (C) Copyright François Faure, iMAGIS-GRAVIR / UJF, 2001. 
 
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
 
 // Revision History:
 // 03 May 2001   Jeremy Siek

Deleted: boost/trunk/libs/graph/example/regrtest.py
===================================================================
--- boost/trunk/libs/graph/example/regrtest.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/example/regrtest.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,306 +0,0 @@
-#!/usr/bin/python
-
-# boost graph library compilation regression test
-
-# Usage: regrtest [*|compiler] [*|library/program]
-#
-# Default: regrtest * *
-#
-# Compilers:  bcc   = Borland 5.5.1
-#             cw    = Metrowerks CodeWarrior
-#             gcc   = GNU GCC
-#             gcc-stlport  = GNU GCC with STLport library
-#             como  = Comeau C++
-#             vc    = Microsoft Visual C++
-#             vcstlport  = Microsoft Visual C++ with STLport library
-#             suncc = Sun's C++ compiler
-#             kcc = KAI C++ 3.4g
-#
-# Examples: regrtest
-#           regrtest
-#           regrtest gcc
-#           regrtest * smart_ptr/smart_ptr_test.cpp
-#           regrtest gcc smart_ptr/smart_ptr_test.cpp
-#
-# Note: use the following command line syntax if output is to be redirected:
-#           python regrtest.py [*|compiler] [*|library/program]  >log 2>&1
-
-# Revision history:
-#  09 Dec 00 Modified the main boost regrtest.py to create this file. -Jeremy
-
-
-# The Metrowerks and Microsoft compilers require various environment variables be set.
-#   See mwcc -help
-#   See http://msdn.microsoft.com/library/devprods/vs6/visualc/vccore/_core_building_on_the_command_line.3a_.overview.htm
-# Others:
-#   See bcb4.hlp.  Don't bother with bcb4tools.hlp; it has a bad link to the command line options
-
-import sys
-import os
-import time
-
-#------------------------------------------------------------------------------#
-
-def invoke( desc, command ):
-
-  print " ", desc
-  f.write( "<td>" )
-  print "  ", command     #script debugging aid
-  sys.stdout.flush()
-  rs=os.system( command )
-  print " return status: ", rs
-  if rs==0:
-    f.write( "yes" )
-  else:
-    f.write( "no" )
-  f.write( "</td>\n" )
-
-#------------------------------------------------------------------------------#
-
-def compile( program ):
-
-  fullpath= path + "/libs/" + program
-
-  print
-  print "*****", program, "*****"
-
-  f.write( "<tr>\n" )
-  f.write( "<td><a href=\"" + program + "\">" + program + "</a></td>\n" )
-
-# ----------  Linux2 ---------- #
-
-  if sys.platform == "linux2": 
-    if compiler_arg == "*" or compiler_arg == "gcc":
-      invoke( "GCC 2.95.2", 'g++ -ftemplate-depth-30 -c -I' + path + ' ' + fullpath )
-    if compiler_arg == "*" or compiler_arg == "gcc-stlport":
-      invoke( "GCC 2.95.2 STLport 4.0", 'g++ -V 2.95.2-stlport -c -ftemplate-depth-30 -I' + path + ' ' + fullpath )
-#    if compiler_arg == "*" or compiler_arg == "gcc-exp":
-#      invoke( "GCC pre-2.97 experimental", '/opt/exp/gcc/bin/g++ -ftemplate-depth-30 -I' + path + ' ' + fullpath )
-    if compiler_arg == "*" or compiler_arg == "como":
-      invoke( "Comeau C++ 4.2.44 beta3", 'como -c -I' + path + ' ' + fullpath)
-#    if compiler_arg == "*" or compiler_arg == "occ":
-#      invoke( "OpenC++ 2.5.9", 'occ -c --regular-c++ -I' + path + ' ' + fullpath)
-
-# ----------- Solaris (Sun OS 5)/Sparc ------ #
-
-  elif sys.platform == "sunos5":
-    if compiler_arg == "*" or compiler_arg =="suncc":
-        invoke("Sun WorkShop 6 2000/04/07 C++ 5.1", 'CC -c -I' + path + ' ' + fullpath )
-    if compiler_arg == "*" or compiler_arg == "gcc":
-      invoke( "GCC 2.95.2", 'g++ -Wall -pedantic -ftemplate-depth-30 -Wno-long-long -c -I' + path + ' ' + fullpath )
-    if compiler_arg == "*" or compiler_arg == "kcc":
-      invoke( "KCC 3.4g", 'KCC --strict_warnings -lm -I' + path + ' ' + fullpath )
-
-
-# ----------- BeOS5/Intel ------ #
-#
-# currently this compiler fails so many tests that it may not be worth while
-# reporting the results: most of these are as a result of broken C++ standard
-# libraries and a non-standard <climits>, problems that the forthcoming
-# gcc3 should fix (STLPort does not build on this platform).
-#
-  elif sys.platform == "beos":
-    if compiler_arg=="*" or compiler_arg=="gcc":
-      invoke( "GNU GCC", "c++ -ftemplate-depth-30 -Wall -I" + path + "  " + fullpath )
-    if compiler_arg=="*" or compiler_arg=="gcc-sgi":
-      invoke( "GNU GCC", "c++ -ftemplate-depth-30 -Wall -I/boot/home/config/stlport/stl330 -I" + path + "  " + fullpath )
-
-# ----------  Windows ---------- #
-
-  else:
-#    if compiler_arg=="*" or compiler_arg=="bcc54":
-#      bcc54_path=os.environ["BOOST_BCC54_PATH"]
-#      invoke( "Borland C++ 5.4 up2", "\"" + bcc54_path + "/bcc32\" -I" + path + " -j10 -q " + fullpath )
-    if compiler_arg=="*" or compiler_arg=="bcc":
-      bcc55_path=os.environ["BOOST_BCC55_PATH"]
-      invoke( "Borland C++ 5.5.1", "\"" + bcc55_path + "/bcc32\" -I" + path + " -j10 -q " + fullpath )
-
-    # GCC 2.95.2 is looping on some tests, so only invoke if asked for by name
-    #if compiler_arg=="*" or compiler_arg=="gcc":
-    if compiler_arg=="gcc":
-      # TODO: fix the absolute STLport paths
-      invoke( "GNU GCC", "c++ -ftemplate-depth-30 -I" + path + " -IC:/stl/STLport-4.0b8/stlport  " + fullpath + "  c:/stl/STLport-4.0b8/lib/libstlport_gcc.a" )
-
-    if compiler_arg=="*" or compiler_arg=="cw":
-      invoke( "Metrowerks CodeWarrior", "mwcc -maxerrors 10 -cwd source -I- -I" + path + " " + fullpath )
-
-#John Maddock says use /Zm400 switch; it increases compiler memory
-# /MDd causes compiler errors in VC98\INCLUDE\xlocnum -Jeremy Siek
-    if compiler_arg=="*" or compiler_arg=="vc":
-      invoke( "VC++ with MS library", 'cl /c /nologo /Zm400 /W3 /GR /GX /Zi /Od /GZ /I "' + path + '" /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_CONSOLE" ' + fullpath )
-    if compiler_arg=="*" or compiler_arg=="vcstlport":
-      stl=os.environ["BOOST_STLPORT_PATH"]
-      invoke( "VC++ with STLport library", 'cl /c /nologo /Zm400 /W3 /GR /GX /Zi /Od /GZ /I "' + stl + '" /I "' + path + '" /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_CONSOLE" ' + fullpath )
-
-
-  f.write( "</tr>\n" )
-
-#------------------------------------------------------------------------------#
-
-def library():
-
-  print
-  print "***** Boost Library *****"
-
-  f.write( "<tr>\n" )
-  f.write( "<td>Boost Graph Library build</td>\n" )
-
-  #if compiler_arg=="*" or compiler_arg=="bcc32":
-  #if compiler_arg=="*" or compiler_arg=="gcc":
-  #if compiler_arg=="*" or compiler_arg=="cw":
-
-  #if compiler_arg=="*" or compiler_arg=="vc":
-  #  command='cl /nologo /MDd /W3 /GR /GX /Zi /Od /GZ /I "' + path + '" /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB /c"'
-  #     command=command + " " + path + "/libs/" + ...
-  #  invoke( "VC++ with MS library", command )
-              
-#    invoke( "MS Lib with MS library", 'lib /nologo /out:"boost_vc.lib" boost_timer_vc.obj boost_prg_timer_vc.obj boost_prg_display_vc.obj' )
-
-  #if compiler_arg=="*" or compiler_arg=="vcstlport":
-
-  f.write( "</tr>\n" )
-
-#----------------------------------  main  ------------------------------------#
-
-# set up environment variables
-
-path=os.environ["BOOST_PATH"]
-
-compiler_arg="*"
-if len(sys.argv)>1:
-  compiler_arg=sys.argv[1]
-
-program_arg="*"
-if len(sys.argv)>2:
-  program_arg=sys.argv[2]
-
-if sys.platform == "linux2":
-  platform = "Linux/x86"
-elif sys.platform == "sunos5":
-  platform = "SunOS5/sparc"
-elif sys.platform == "beos":
-  platform = "BeOS5/x86"
-elif sys.platform == "win32":
-  platform = "Windows"
-  if os.name == "nt":
-    platform = platform + " NT / Windows 2000"
-else:
-  print "**** Error: unknown platform ****"
-  sys.exit(1)
-
-f=open( "cs-" + sys.platform + ".html", "w" )
-
-f.write( "<html>\n<head>\n<title>\nCompiler Status: " + platform + "\n</title>\n</head>" )
-f.write( "<body bgcolor=\"#FFFFFF\" text=\"#000000\">\n" )
-f.write( "<h1><img border=\"0\" src=\"../../../boost.png\" width=\"277\" height=\"86\"></h1>\n" )
-f.write( "<h1>Compiler Status: " + platform + "</h1>\n" )
-f.write( "<p><b>Run Date:</b> " + time.strftime("%d %b %Y %H:%M GMT", time.gmtime(time.time())) + "</p>\n" )
-f.write( "<p>\n" )
-f.write( "<table border=\"1\" cellspacing=\"0\" cellpadding=\"5\">\n"  )
-f.write( "<tr>\n" )
-f.write( "<td>Program</td>\n" )
-
-if sys.platform == "linux2": 
-  if compiler_arg == "*" or compiler_arg == "gcc":
-    f.write( "<td>GNU<br>GCC<br>2.95.2</td>\n" )
-  if compiler_arg == "*" or compiler_arg == "gcc-stlport":
-    f.write( "<td>GNU<br>GCC<br>2.95.2<br>STLport<br>4.0</td>\n" )
-#  if compiler_arg == "*" or compiler_arg == "gcc-exp":
-#    f.write( "<td>GNU<br>GCC<br>pre-2.97 experimental</td>\n" )
-  if compiler_arg == "*" or compiler_arg == "como":
-    f.write( "<td>Comeau C++<br>4.2.44 beta3<br>STLport<br>4.0</td>\n" )
-#  if compiler_arg == "*" or compiler_arg == "occ":
-#    f.write( "<td>OpenC++<br>2.5.9</td>\n" )
-elif sys.platform == "sunos5":
-  if compiler_arg == "*" or compiler_arg == "suncc":
-    f.write( "<td>Sun C++<br>Sun WorkShop 6, C++ 5.1</td>\n" )
-  if compiler_arg == "*" or compiler_arg == "gcc":
-    f.write( "<td>GNU<br>GCC<br>2.95.2</td>\n" )
-  if compiler_arg == "*" or compiler_arg == "kcc":
-    f.write( "<td>KAI<br>KCC<br>3.4g</td>\n" )
-elif sys.platform == "beos":
-  if compiler_arg == "*" or compiler_arg == "gcc":
-    f.write( "<td>GNUPro<br>GCC&nbsp;2.9</td>\n" )
-  if compiler_arg == "*" or compiler_arg == "gcc-sgi":
-    f.write( "<td>GNUPro<br>GCC&nbsp;2.9<br>+<br>SGI&nbsp;STL&nbsp;3.3</td>\n" )
-else:
-#  if compiler_arg=="*" or compiler_arg=="bcc54":
-#    f.write( "<td>Borland<br>BCC<br>5.4 up2</td>\n" )
-  if compiler_arg=="*" or compiler_arg=="bcc":
-    f.write( "<td>Borland<br>BCC<br>5.5.1</td>\n" )
-
-  # GCC 2.95.2 is looping on some tests, so only invoke if asked for by name
-  #if compiler_arg=="*" or compiler_arg=="gcc":
-  if compiler_arg=="gcc":
-   f.write( "<td>GNU<br>GCC<br>2.95.2<br>STLport<br>4.0 beta 8</td>\n" )
-  if compiler_arg=="*" or compiler_arg=="cw":
-    f.write( "<td>Metrowerks<br>CodeWarrior<br>6.0</td>\n" )
-  if compiler_arg=="*" or compiler_arg=="vc":
-    f.write( "<td>Microsoft<br>VC++<br>6.0 SP4</td>\n" )
-  if compiler_arg=="*" or compiler_arg=="vcstlport":
-    f.write( "<td>Microsoft<br>VC++<br>6.0 SP4<br>STLport<br>4.0</td>\n" )
-
-f.write( "</tr>\n" )
-
-if  program_arg=="*":
-#  compile( "graph/example/LEDA_concept_check.cpp" )
-  compile( "graph/example/adjacency_list.cpp" )
-  compile( "graph/example/bellman_ford.cpp" )
-  compile( "graph/example/bfs.cpp" )
-  compile( "graph/example/bfs_basics.cpp" )
-  compile( "graph/example/bucket_sorter.cpp" )
-  compile( "graph/example/city_visitor.cpp" )
-  compile( "graph/example/components_on_edgelist.cpp" )
-  compile( "graph/example/concept_checks.cpp" )
-  compile( "graph/example/connected_components.cpp" )
-  compile( "graph/example/container_gen.cpp" )
-  compile( "graph/example/cuthill_mckee_ordering.cpp" )
-  compile( "graph/example/dave.cpp" )
-  compile( "graph/example/dfs.cpp" )
-  compile( "graph/example/dfs_basics.cpp" )
-  compile( "graph/example/dfs_parenthesis.cpp" )
-  compile( "graph/example/dijkstra.cpp" )
-  compile( "graph/example/dynamic_components.cpp" )
-  compile( "graph/example/edge_basics.cpp" )
-  compile( "graph/example/edge_iterator_constructor.cpp" )
-  compile( "graph/example/edge_property.cpp" )
-  compile( "graph/example/exterior_properties.cpp" )
-  compile( "graph/example/exterior_property_map.cpp" )
-  compile( "graph/example/family_tree.cpp" )
-  compile( "graph/example/fibonacci_heap.cpp" )
-  compile( "graph/example/file_dependencies.cpp" )
-  compile( "graph/example/gerdemann.cpp" )
-  compile( "graph/example/graph.cpp" )
-  compile( "graph/example/in_edges.cpp" )
-  compile( "graph/example/interior_property_map.cpp" )
-  compile( "graph/example/johnson.cpp" )
-  compile( "graph/example/kevin_bacon.cpp" )
-  compile( "graph/example/knights_tour.cpp" )
-  compile( "graph/example/kruskal.cpp" )
-  compile( "graph/example/max_flow.cpp" )
-#  compile( "graph/example/miles_span.cpp" )
-  compile( "graph/example/ordered_out_edges.cpp" )
-  compile( "graph/example/prim.cpp" )
-  compile( "graph/example/quick_tour.cpp" )
-  compile( "graph/example/remove_edge_if_bidir.cpp" )
-  compile( "graph/example/remove_edge_if_dir.cpp" )
-  compile( "graph/example/remove_edge_if_undir.cpp" )
-  compile( "graph/example/reverse_graph.cpp" )
-  compile( "graph/example/topo_sort.cpp" )
-  compile( "graph/example/undirected.cpp" )
-  compile( "graph/example/vector_as_graph.cpp" )
-  compile( "graph/example/vertex_basics.cpp" )
-  compile( "graph/example/visitor.cpp" )
-else:
-  compile( program_arg )
-
-f.write( "</table>\n" );
-if sys.platform == "linux2":
-  f.write( "<p>\nNote: A hand-crafted &lt;limits&gt; Standard header has been applied to all configurations.\n" )
-f.write( "</body>\n</html>\n" )
-
-# end
-
-
-
-

Modified: boost/trunk/libs/graph/example/sloan_ordering.cpp
===================================================================
--- boost/trunk/libs/graph/example/sloan_ordering.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/example/sloan_ordering.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,25 +3,9 @@
 // Copyright 2002 Marc Wintermantel (wintermantel at imes.mavt.ethz.ch)
 // ETH Zurich, Center of Structure Technologies (www.imes.ethz.ch/st)
 //
-// This file is part of the Boost Graph Library
-//
-// You should have received a copy of the License Agreement for the
-// Boost Graph Library along with the software; see the file LICENSE.
-// If not, contact Office of Research, University of Notre Dame, Notre
-// Dame, IN 46556.
-//
-// Permission to modify the code and to distribute modified code is
-// granted, provided the text of this NOTICE is retained, a notice that
-// the code was modified is included with the above COPYRIGHT NOTICE and
-// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
-// file is distributed with the modified code.
-//
-// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
-// By way of example, but not limitation, Licensor MAKES NO
-// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
-// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
-// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
-// OR OTHER RIGHTS.
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
 //=======================================================================
 //
 

Modified: boost/trunk/libs/graph/index.html
===================================================================
--- boost/trunk/libs/graph/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,21 @@
 <html>
+<!--
+  -- Copyright (c) 2004 Trustees of Indiana University
+  --
+  -- Distributed under the Boost Software License, Version 1.0.
+  -- (See accompanying file LICENSE_1_0.txt or copy at
+  -- http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <head>
 <meta http-equiv="refresh" content="0; URL=doc/index.html">
 </head>
 <body>
 Automatic redirection failed, please go to
 <a href="doc/index.html">doc/index.html</a>.
+<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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: boost/trunk/libs/graph/src/Makefile
===================================================================
--- boost/trunk/libs/graph/src/Makefile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/src/Makefile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,83 +0,0 @@
-
-# The files in this directory implement the read_graphviz() functions
-# declared in <boost/graph/graphviz.hpp>. There are both directed
-# and undirected graph versions of these functions. To use both, you
-# will need to compile the code generated from graphviz_parser.y twice,
-# once with -DGRAPHVIZ_DIRECTED=0 and once with -DGRAPHVIZ_DIRECTED=1.
-#
-# This Makefile will most likely *not* work on your system.
-# We have not yet had time to create a portable Makefile.
-# This is the Makefile we currently use.
-#
-
-BOOST 		= ../../..
-
-CXX		= g++ -ftemplate-depth-50
-LEX		= flex -L
-YACC		= bison -l
-MV		= /bin/mv
-
-EXTRAFLAGS 	= -O3 -DYYSTYPE_IS_DECLARED=1 -D_REENTRANT
-
-INCLUDES	= -I$(BOOST)
-
-CXXFLAGS	= $(INCLUDES) $(EXTRAFLAGS)
-
-LDFLAAGS	= 
-
-LIBS		=
-
-AR		= ar
-
-
-default: libbgl-viz.a libbgl-viz.so
-
-OBJS = graphviz_graph_lex.o graphviz_digraph_lex.o graphviz_digraph_parser.o graphviz_graph_parser.o read_graphviz_spirit.o
-
-libbgl-viz.a: $(OBJS)
-	$(AR) -rc libbgl-viz.a $(OBJS)
-
-GRAPH_SONAME_VERSION = 1
-
-libbgl-viz.so: $(OBJS)
-	$(CXX) -shared -Wl,-soname -Wl,$@.$(GRAPH_SONAME_VERSION) -o $@.$(GRAPH_SONAME_VERSION) $(OBJS)
-	ln -s $@.$(GRAPH_SONAME_VERSION) $@ 
-
-# this next part is a bit strange. We compile graphviz_parser.cpp twice.
-# Once with for undirected graphs with GRAPHVIZ_DIRECTED=0
-# and once for directed graphs with GRAPHVIZ_DIRECTED=1.
-
-graphviz_graph_parser.o: graphviz_graph_parser.cpp
-	$(CXX) -DGRAPHVIZ_DIRECTED=0 $(CXXFLAGS) -c graphviz_graph_parser.cpp -o graphviz_graph_parser.o
-
-graphviz_digraph_parser.o: graphviz_digraph_parser.cpp
-	$(CXX) -DGRAPHVIZ_DIRECTED=1 $(CXXFLAGS) -c graphviz_digraph_parser.cpp -o graphviz_digraph_parser.o
-
-graphviz_graph_lex.o: graphviz_graph_lex.cpp graphviz_graph_parser.hpp
-	$(CXX) -DGRAPHVIZ_DIRECTED=0 $(CXXFLAGS) -c graphviz_graph_lex.cpp
-
-graphviz_digraph_lex.o: graphviz_digraph_lex.cpp graphviz_digraph_parser.hpp
-	$(CXX) -DGRAPHVIZ_DIRECTED=1 $(CXXFLAGS) -c graphviz_digraph_lex.cpp
-
-graphviz_graph_lex.cpp: graphviz_lex.ll
-	$(LEX) -Pbgl_undir_ -ographviz_graph_lex.cpp graphviz_lex.ll
-
-graphviz_digraph_lex.cpp: graphviz_lex.ll
-	$(LEX) -Pbgl_dir_ -ographviz_digraph_lex.cpp graphviz_lex.ll
-
-graphviz_graph_parser.cpp graphviz_graph_parser.hpp: graphviz_parser.yy
-	$(YACC) -p bgl_undir_ -d -v -o graphviz_graph_parser.cpp graphviz_parser.yy
-	mv graphviz_graph_parser.cpp tmp_graphviz_graph_parser.cpp 
-	echo "#define GRAPHVIZ_DIRECTED 0" > graphviz_graph_parser.cpp
-	cat tmp_graphviz_graph_parser.cpp >> graphviz_graph_parser.cpp
-	rm tmp_graphviz_graph_parser.cpp
-
-graphviz_digraph_parser.cpp graphviz_digraph_parser.hpp: graphviz_parser.yy
-	$(YACC) -p bgl_dir_ -d -v -o graphviz_digraph_parser.cpp graphviz_parser.yy
-	mv graphviz_digraph_parser.cpp tmp_graphviz_digraph_parser.cpp 
-	echo "#define GRAPHVIZ_DIRECTED 1" > graphviz_digraph_parser.cpp
-	cat tmp_graphviz_digraph_parser.cpp >> graphviz_digraph_parser.cpp
-	rm tmp_graphviz_digraph_parser.cpp
-
-clean:
-	/bin/rm -rf	*.o *.a *.so* *.output graphviz_digraph_parser.cpp graphviz_digraph_parser.hpp graphviz_graph_parser.cpp graphviz_graph_parser.hpp graphviz_digraph_lex.cpp graphviz_graph_lex.cpp

Deleted: boost/trunk/libs/graph/src/README
===================================================================
--- boost/trunk/libs/graph/src/README	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/src/README	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +0,0 @@
-
-The files in this directory implement the read_graphviz() functions
-declared in <boost/graph/graphviz.hpp>. There are both directed
-and undirected graph versions of these functions. To use both, you
-will need to compile the code generated from graphviz_parser.y twice,
-once with -DGRAPHVIZ_GRAPH=boost::GraphvizDigraph and once with
- -DGRAPHVIZ_GRAPH=boost::GraphvizGraph.
-
-An example Makefile is included. When time permits the Makefile will
-be replaced by a more portable build system.

Modified: boost/trunk/libs/graph/src/graphviz_digraph_lex.cpp
===================================================================
--- boost/trunk/libs/graph/src/graphviz_digraph_lex.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/src/graphviz_digraph_lex.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+// Copyright (C) 2002 Trustees of Indiana University
+
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
 #define GRAPHVIZ_DIRECTED 1
 #define yy_create_buffer bgl_dir__create_buffer
 #define yy_delete_buffer bgl_dir__delete_buffer
@@ -19,7 +25,7 @@
 /* A lexical scanner generated by flex */
 
 /* Scanner skeleton version:
- * $Header: /cvsroot/boost/boost/libs/graph/src/graphviz_digraph_lex.cpp,v 1.12 2005/07/12 03:10:30 dgregor Exp $
+ * $Header: /cvsroot/boost/boost/libs/graph/src/graphviz_digraph_lex.cpp,v 1.12.4.1 2006/11/03 19:17:54 dgregor Exp $
  */
 
 #define FLEX_SCANNER

Modified: boost/trunk/libs/graph/src/graphviz_digraph_parser.hpp
===================================================================
--- boost/trunk/libs/graph/src/graphviz_digraph_parser.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/src/graphviz_digraph_parser.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+// Copyright (C) 2002 Trustees of Indiana University
+
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
 #define GRAPH_T 257
 #define NODE_T  258
 #define EDGE_T  259

Modified: boost/trunk/libs/graph/src/graphviz_graph_lex.cpp
===================================================================
--- boost/trunk/libs/graph/src/graphviz_graph_lex.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/src/graphviz_graph_lex.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+// Copyright (C) 2002 Trustees of Indiana University
+
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
 #define GRAPHVIZ_DIRECTED 0
 #define yy_create_buffer bgl_undir__create_buffer
 #define yy_delete_buffer bgl_undir__delete_buffer
@@ -19,7 +25,7 @@
 /* A lexical scanner generated by flex */
 
 /* Scanner skeleton version:
- * $Header: /cvsroot/boost/boost/libs/graph/src/graphviz_graph_lex.cpp,v 1.12 2005/07/12 03:10:32 dgregor Exp $
+ * $Header: /cvsroot/boost/boost/libs/graph/src/graphviz_graph_lex.cpp,v 1.12.4.1 2006/11/03 19:17:56 dgregor Exp $
  */
 
 #define FLEX_SCANNER

Modified: boost/trunk/libs/graph/src/graphviz_graph_parser.hpp
===================================================================
--- boost/trunk/libs/graph/src/graphviz_graph_parser.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/src/graphviz_graph_parser.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+// Copyright (C) 2002 Trustees of Indiana University
+
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
 #define GRAPH_T 257
 #define NODE_T  258
 #define EDGE_T  259

Modified: boost/trunk/libs/graph/src/read_graphviz_spirit.cpp
===================================================================
--- boost/trunk/libs/graph/src/read_graphviz_spirit.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/src/read_graphviz_spirit.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,6 +20,8 @@
 // Authors: Ronald Garcia and Douglas Gregor
 //
 
+#define BOOST_GRAPH_SOURCE
+
 #ifndef BOOST_GRAPH_READ_GRAPHVIZ_ITERATORS
 #  define BOOST_GRAPH_READ_GRAPHVIZ_ITERATORS
 #endif
@@ -27,6 +29,7 @@
 
 namespace boost { namespace detail { namespace graph { 
 
+BOOST_GRAPH_DECL
 bool read_graphviz(std::istream& in, mutate_graph& graph) 
 {
   using namespace boost;

Deleted: boost/trunk/libs/graph/test/Jamfile
===================================================================
--- boost/trunk/libs/graph/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,125 +0,0 @@
-# Define SGB (stanford graph base top level directory) and 
-# LEDA (also top level directory) at the command line of jam using -s
-
-
-subproject libs/graph/test ;
-
-import testing ;
-
-# A bug in the Win32 intel compilers causes compilation of one of our
-# tests to take forever when debug symbols are enabled. This rule
-# turns them off when added to the requirements section
-local rule turn-off-intel-debug-symbols ( toolset variant : properties * )
-{
-    if $(NT) && [ MATCH (.*intel.*) : $(toolset) ]
-    {
-        properties = [ difference $(properties) : <debug-symbols>on ] <debug-symbols>off ;
-    }
-    return $(properties) ;
-}
-
-
-test-suite graph : 
-
-    [ compile adj_list_cc.cpp : <sysinclude>$(BOOST_ROOT)  ]
-
-    # adj_list_test needs some work -JGS
-    # unit-test adj_list_test : adj_list_test.cpp : <sysinclude>$(BOOST_ROOT)  ;
-    [ run adj_list_edge_list_set.cpp : : : <sysinclude>$(BOOST_ROOT) ]
-
-    [ compile adj_matrix_cc.cpp : <sysinclude>$(BOOST_ROOT)  ]
-
-    [ run bfs.cpp : : : <sysinclude>$(BOOST_ROOT) ]
-
-    [ compile bfs_cc.cpp : <sysinclude>$(BOOST_ROOT)  ]
-
-    [ run bellman-test.cpp : <sysinclude>$(BOOST_ROOT ]
-
-    [ run betweenness_centrality_test.cpp ] 
-
-    [ run bidir_remove_edge.cpp ]
-
-    [ run csr_graph_test.cpp : : : : : release ]
-
-    [ run dag_longest_paths.cpp : : : <sysinclude>$(BOOST_ROOT) ]
-
-    [ run dfs.cpp : : : <sysinclude>$(BOOST_ROOT) ]
-
-    [ compile dfs_cc.cpp : <sysinclude>$(BOOST_ROOT)  ]
-
-    [ compile dijkstra_cc.cpp : <sysinclude>$(BOOST_ROOT) ]
-
-    [ run dijkstra_heap_performance.cpp : 10000 : : <sysinclude>$(BOOST_ROOT) ]
-    [ run dominator_tree_test.cpp ]
-    [ run relaxed_heap_test.cpp : 5000 15000 : : <sysinclude>$(BOOST_ROOT) ]
-    [ compile edge_list_cc.cpp : <sysinclude>$(BOOST_ROOT) ]
-
-    [ compile filtered_graph_cc.cpp : <sysinclude>$(BOOST_ROOT) ]
-
-    [ run graph.cpp : : : <sysinclude>$(BOOST_ROOT) ]
-
-    [ compile graph_concepts.cpp : <sysinclude>$(BOOST_ROOT) ]
-
-    [ run graphviz_test.cpp 
-            <lib>../../test/build/boost_test_exec_monitor 
-            <lib>../build/bgl-viz
-      : : : <sysinclude>$(BOOST_ROOT) ] 
-
-    [ run gursoy_atun_layout_test.cpp : : : <sysinclude>$(BOOST_ROOT) ]
-
-    [ run layout_test.cpp : : : <test-info>always_show_run_output turn-off-intel-debug-symbols ]
-
-    [ compile reverse_graph_cc.cpp : <sysinclude>$(BOOST_ROOT) ] 
-
-    [ run sequential_vertex_coloring.cpp : : : <sysinclude>$(BOOST_ROOT) ]
-
-    [ run subgraph.cpp : : : <sysinclude>$(BOOST_ROOT) ]
-
-    [ run transitive_closure_test.cpp : : : <sysinclude>$(BOOST_ROOT) ]
-             
-    [ run isomorphism.cpp  : : : <sysinclude>$(BOOST_ROOT) ]
-
-    [ run adjacency_matrix_test.cpp : : : <sysinclude>$(BOOST_ROOT) ]    
-
-    [ compile vector_graph_cc.cpp : <sysinclude>$(BOOST_ROOT)  ]
-
-    [ compile copy.cpp : <sysinclude>$(BOOST_ROOT) ]
-    
-    [ compile property_iter.cpp : <sysinclude>$(BOOST_ROOT) ]    
-
-    [ run bundled_properties.cpp ]
-
-    [ run floyd_warshall_test.cpp ]
-
-    [ run astar_search_test.cpp ]
-
-    [ run biconnected_components_test.cpp ]
-
-    [ run cuthill_mckee_ordering.cpp ]
-
-    [ run king_ordering.cpp ]
- 
-    [ run matching_test.cpp ]
-    ;
-
-# Run SDB tests only when -sSDB= is set.
-if $(SDB) != ""
-{
-    local SDB_DEPENDCIES =
-        <include>$(SGB) <library-file>$(SGB)/libgb.a  ;
-
-    compile stanford_graph_cc.cpp : <sysinclude>$(BOOST_ROOT) 
-        $(SDB_DEPENDCIES)  ;
-}
-
-# Run LEDA tests only when -sLEDA= is set.
-if $(LEDA) != ""
-{
-     local LEDA_DEPENDENCIES = 
-        <include>$(LEDA)/incl 
-        <library-file>$(LEDA)/libG.a
-        ;
-
-    compile leda_graph_cc.cpp : <sysinclude>$(BOOST_ROOT)  
-       $(LEDA_DEPENDENCIES) ;
-}

Modified: boost/trunk/libs/graph/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/graph/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
+
 # Define SGB (stanford graph base top level directory) and 
 # LEDA (also top level directory) at the command line of jam using -s
 
@@ -52,13 +58,17 @@
 
 
     [ run graphviz_test.cpp 
-            /boost/test//boost_test_exec_monitor 
-            ../build//bgl-viz ]
+            /boost/test//boost_test_exec_monitor/<link>static 
+            ../build//boost_graph ]
 
     [ run gursoy_atun_layout_test.cpp ]
 
     [ run layout_test.cpp : : : <test-info>always_show_run_output <toolset>intel:<debug-symbols>off ]
 
+    [ run serialize.cpp 
+          ../../serialization/build//boost_serialization
+      : : : ]
+
     [ compile reverse_graph_cc.cpp ] 
 
     [ run sequential_vertex_coloring.cpp ]

Modified: boost/trunk/libs/graph/test/bidir_remove_edge.cpp
===================================================================
--- boost/trunk/libs/graph/test/bidir_remove_edge.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/test/bidir_remove_edge.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,8 @@
 #include <iostream>
 #include <boost/graph/adjacency_list.hpp>
 #include <boost/cstdlib.hpp>
-#include <boost/detail/lightweight_test.hpp>
+#include <boost/test/minimal.hpp>
+using namespace boost;
 
 struct edge_prop {
   int weight;
@@ -25,10 +26,10 @@
     edge_prop p = { 42 };
     edge e; bool b;
     tie(e, b) = add_edge(0, 1, p, g);
-    BOOST_TEST( num_edges(g) == 1 );
-    BOOST_TEST( g[e].weight == 42 );
+    assert( num_edges(g) == 1 );
+    assert( g[e].weight == 42 );
     remove_edge(e, g);
-    BOOST_TEST( num_edges(g) == 0 );
+    assert( num_edges(g) == 0 );
   }
   {
     typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS> graph;
@@ -38,9 +39,9 @@
 
     edge e; bool b;
     tie(e, b) = add_edge(0, 1, g);
-    BOOST_TEST( num_edges(g) == 1 );
+    assert( num_edges(g) == 1 );
     remove_edge(e, g);
-    BOOST_TEST( num_edges(g) == 0 );
+    assert( num_edges(g) == 0 );
   }
-  return boost::report_errors();
+  return boost::exit_success;
 }

Modified: boost/trunk/libs/graph/test/csr_graph_test.cpp
===================================================================
--- boost/trunk/libs/graph/test/csr_graph_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/test/csr_graph_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -44,6 +44,8 @@
 void assert_graphs_equal(const G1& g1, const VI1& vi1,
                          const G2& g2, const VI2& vi2,
                          const IsomorphismMap& iso) {
+  using boost::out_degree;
+
   BOOST_CHECK (num_vertices(g1) == num_vertices(g2));
   BOOST_CHECK (num_edges(g1) == num_edges(g2));
 
@@ -200,8 +202,8 @@
     if (i % 13 == 0) check_consistency(g4);
   }
   assert_graphs_equal(g3, boost::identity_property_map(),
-		      g4, boost::identity_property_map(),
-		      boost::identity_property_map());
+                      g4, boost::identity_property_map(),
+                      boost::identity_property_map());
 
   // Check edge_from_index (and implicitly the edge_index property map) for
   // each edge in g2
@@ -241,11 +243,11 @@
       BOOST_CHECK(source(edge_info.first, g2) == *vi);
       BOOST_CHECK(target(edge_info.first, g2) == tgtd);
       std::pair<CSRGraphT::out_edge_iterator, CSRGraphT::out_edge_iterator> er =
-	edge_range(*vi, tgtd, g2);
+        edge_range(*vi, tgtd, g2);
       BOOST_CHECK(er.first != er.second);
       for (; er.first != er.second; ++er.first) {
-	BOOST_CHECK(source(*er.first, g2) == *vi);
-	BOOST_CHECK(target(*er.first, g2) == tgtd);
+        BOOST_CHECK(source(*er.first, g2) == *vi);
+        BOOST_CHECK(target(*er.first, g2) == tgtd);
       }
     }
 
@@ -255,7 +257,7 @@
     CSRGraphT::out_edge_iterator oei2, oei2_end;
     for (boost::tie(oei2, oei_end) = out_edges(*vi, g2); oei2 != oei_end; ++oei2) {
       if (target(*oei2, g2) == test_vertex)
-	++edge_count;
+        ++edge_count;
     }
 
     // Test edge and edge_range on an edge that may not be present
@@ -368,9 +370,9 @@
     CSRGraphT g;
     test(g);
   }
-  test(1000, 0.05, seed);
-  test(1000, 0.0, seed);
-  test(1000, 0.1, seed);
+  //  test(1000, 0.05, seed);
+  //  test(1000, 0.0, seed);
+  //  test(1000, 0.1, seed);
   test(1000, 0.001, seed);
   test(1000, 0.0005, seed);
   {

Modified: boost/trunk/libs/graph/test/cuthill_mckee_ordering.cpp
===================================================================
--- boost/trunk/libs/graph/test/cuthill_mckee_ordering.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/test/cuthill_mckee_ordering.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,25 +3,9 @@
 // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
 //          Doug Gregor, D. Kevin McGrath
 //
-// This file is part of the Boost Graph Library
-//
-// You should have received a copy of the License Agreement for the
-// Boost Graph Library along with the software; see the file LICENSE.
-// If not, contact Office of Research, University of Notre Dame, Notre
-// Dame, IN 46556.
-//
-// Permission to modify the code and to distribute modified code is
-// granted, provided the text of this NOTICE is retained, a notice that
-// the code was modified is included with the above COPYRIGHT NOTICE and
-// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
-// file is distributed with the modified code.
-//
-// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
-// By way of example, but not limitation, Licensor MAKES NO
-// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
-// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
-// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
-// OR OTHER RIGHTS.
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
 //=======================================================================
 
 #include <boost/config.hpp>

Modified: boost/trunk/libs/graph/test/dag_longest_paths.cpp
===================================================================
--- boost/trunk/libs/graph/test/dag_longest_paths.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/test/dag_longest_paths.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,9 @@
+// Copyright (C) 2002 Trustees of Indiana University
 
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
 #include <boost/graph/adjacency_list.hpp>
 #include <boost/graph/dag_shortest_paths.hpp>
 #include <boost/vector_property_map.hpp>

Modified: boost/trunk/libs/graph/test/dominator_tree_test.cpp
===================================================================
--- boost/trunk/libs/graph/test/dominator_tree_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/test/dominator_tree_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -26,10 +26,10 @@
 using namespace boost;
 
 typedef adjacency_list<
-	listS,
-	listS,
-	bidirectionalS,
-	property<vertex_index_t, std::size_t>, no_property> G;
+    listS,
+    listS,
+    bidirectionalS,
+    property<vertex_index_t, std::size_t>, no_property> G;
 
 int test_main(int, char*[])
 {
@@ -209,7 +209,7 @@
       G g(
           testSet[i].edges, testSet[i].edges + testSet[i].numOfEdges,
           numOfVertices);
-		
+
       typedef graph_traits<G>::vertex_descriptor Vertex;
       typedef property_map<G, vertex_index_t>::type IndexMap;
       typedef

Modified: boost/trunk/libs/graph/test/graph.cpp
===================================================================
--- boost/trunk/libs/graph/test/graph.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/test/graph.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -142,7 +142,6 @@
   std::size_t N = 5, E = 0;
   std::size_t old_N;
 
-  typedef ::Graph Graph;
   Graph g;
   typedef boost::graph_traits<Graph>::vertex_descriptor Vertex;
   typedef boost::graph_traits<Graph>::edge_descriptor Edge;

Modified: boost/trunk/libs/graph/test/king_ordering.cpp
===================================================================
--- boost/trunk/libs/graph/test/king_ordering.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/test/king_ordering.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,25 +3,9 @@
 // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
 //          Doug Gregor, D. Kevin McGrath
 //
-// This file is part of the Boost Graph Library
-//
-// You should have received a copy of the License Agreement for the
-// Boost Graph Library along with the software; see the file LICENSE.
-// If not, contact Office of Research, University of Notre Dame, Notre
-// Dame, IN 46556.
-//
-// Permission to modify the code and to distribute modified code is
-// granted, provided the text of this NOTICE is retained, a notice that
-// the code was modified is included with the above COPYRIGHT NOTICE and
-// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
-// file is distributed with the modified code.
-//
-// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
-// By way of example, but not limitation, Licensor MAKES NO
-// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
-// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
-// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
-// OR OTHER RIGHTS.
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
 //=======================================================================
 
 #include <boost/config.hpp>

Modified: boost/trunk/libs/graph/test/matching_test.cpp
===================================================================
--- boost/trunk/libs/graph/test/matching_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/test/matching_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 //
 //=======================================================================
 
-#include <boost/graph/maximum_cardinality_matching.hpp>
+#include <boost/graph/max_cardinality_matching.hpp>
 
 #include <iostream>                      // for std::cout
 #include <boost/vector_property_map.hpp>
@@ -21,17 +21,17 @@
 using namespace boost;
 
 typedef adjacency_list<vecS, 
-		       vecS, 
-		       undirectedS, 
-      		       property<vertex_index_t, int> >  undirected_graph;
+                       vecS, 
+                       undirectedS, 
+                       property<vertex_index_t, int> >  undirected_graph;
 
 typedef adjacency_list<listS,
-		       listS,
-		       undirectedS,
-		       property<vertex_index_t, int> >  undirected_list_graph;
+                       listS,
+                       undirectedS,
+                       property<vertex_index_t, int> >  undirected_list_graph;
 
 typedef adjacency_matrix<undirectedS, 
-			 property<vertex_index_t,int> > undirected_adjacency_matrix_graph;
+                         property<vertex_index_t,int> > undirected_adjacency_matrix_graph;
 
 
 template <typename Graph>
@@ -72,7 +72,7 @@
       wi = vi;
       ++wi;
       for(; wi != vi_end; ++wi)
-	add_edge(*vi,*wi,g);      
+        add_edge(*vi,*wi,g);      
     }
 }
 
@@ -104,10 +104,10 @@
       vi = ui;
       ++vi;
       while (vi != halfway)
-	{
-	  add_edge(*ui,*vi,g);
-	  ++vi;
-	}
+        {
+          add_edge(*ui,*vi,g);
+          ++vi;
+        }
       ++ui;
     }
 
@@ -160,7 +160,7 @@
   if (!edmonds_result)
     {
       std::cout << "Verifier reporting a problem finding a perfect matching on" << std::endl
-		<< "the complete graph using " << graph_name << std::endl;
+                << "the complete graph using " << graph_name << std::endl;
       all_tests_passed = false;
     }
   
@@ -174,7 +174,7 @@
   if (!greedy_result)
     {
       std::cout << "Verifier reporting a problem finding a greedy matching on" << std::endl
-		<< "the complete graph using " << graph_name << std::endl;
+                << "the complete graph using " << graph_name << std::endl;
       all_tests_passed = false;
     }
 
@@ -188,7 +188,7 @@
   if (!extra_greedy_result)
     {
       std::cout << "Verifier reporting a problem finding an extra greedy matching on" << std::endl
-		<< "the complete graph using " << graph_name << std::endl;
+                << "the complete graph using " << graph_name << std::endl;
       all_tests_passed = false;
     }
 
@@ -202,8 +202,8 @@
   if (edmonds_result && !edmonds_sanity_check)
     {
       std::cout << "Verifier okayed edmonds' algorithm on the complete graph, but" << std::endl
-		<< "the matching returned either wasn't a valid matching or wasn't" << std::endl
-		<< "actually a maximum cardinality matching." << std::endl;
+                << "the matching returned either wasn't a valid matching or wasn't" << std::endl
+                << "actually a maximum cardinality matching." << std::endl;
       all_tests_passed = false;
     }
 
@@ -214,8 +214,8 @@
   if (greedy_result && !greedy_sanity_check)
     {
       std::cout << "Verifier okayed greedy algorithm on the complete graph, but" << std::endl
-		<< "the matching returned either wasn't a valid matching or wasn't" << std::endl
-		<< "actually a maximum cardinality matching." << std::endl;
+                << "the matching returned either wasn't a valid matching or wasn't" << std::endl
+                << "actually a maximum cardinality matching." << std::endl;
       all_tests_passed = false;
     }
   
@@ -226,8 +226,8 @@
   if (extra_greedy_result && !extra_greedy_sanity_check)
     {
       std::cout << "Verifier okayed extra greedy algorithm on the complete graph, but" << std::endl
-		<< "the matching returned either wasn't a valid matching or wasn't" << std::endl
-		<< "actually a maximum cardinality matching." << std::endl;
+                << "the matching returned either wasn't a valid matching or wasn't" << std::endl
+                << "actually a maximum cardinality matching." << std::endl;
       all_tests_passed = false;
     }
   
@@ -268,7 +268,7 @@
   if (!gabows_graph_result)
     {
       std::cout << "Problem on Gabow's Graph with " << graph_name << ":" << std::endl
-		<< "   Verifier reporting a maximum cardinality matching not found." << std::endl;
+                << "   Verifier reporting a maximum cardinality matching not found." << std::endl;
       all_tests_passed = false;
     }
   
@@ -276,9 +276,9 @@
   if (gabows_graph_result && matching_size(h,gabow_mate) != num_v)
     {
       std::cout << "Problem on Gabow's Graph with " << graph_name << ":" << std::endl
-		<< "   Verifier reported a maximum cardinality matching found," << std::endl
-		<< "   but matching size is " << matching_size(h,gabow_mate)
-		<< " when it should be " << num_v << std::endl;
+                << "   Verifier reported a maximum cardinality matching found," << std::endl
+                << "   but matching size is " << matching_size(h,gabow_mate)
+                << " when it should be " << num_v << std::endl;
       all_tests_passed = false;
     }
 
@@ -298,11 +298,11 @@
       vertex_descriptor_t u = random_vertex(j,rand_num);
       vertex_descriptor_t v = random_vertex(j,rand_num);
       if (u != v)
-	{
-	  tie(tuples::ignore, success) = add_edge(u, v, j);
-	  if (success)
-	    num_edges++;
-	}
+        {
+          tie(tuples::ignore, success) = add_edge(u, v, j);
+          if (success)
+            num_edges++;
+        }
     }
 
   mate_t random_mate(double_num_v);

Modified: boost/trunk/libs/graph/test/property_iter.cpp
===================================================================
--- boost/trunk/libs/graph/test/property_iter.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/test/property_iter.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -58,7 +58,6 @@
   int ret = 0;
   std::size_t N = 5, E = 0;
 
-  typedef ::Graph Graph;
   Graph g;
   typedef boost::graph_traits<Graph>::vertex_descriptor Vertex;
   typedef boost::graph_traits<Graph>::edge_descriptor Edge;

Modified: boost/trunk/libs/graph/test/random_matching_test.cpp
===================================================================
--- boost/trunk/libs/graph/test/random_matching_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/graph/test/random_matching_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,14 +14,14 @@
 #include <ctime>
 #include <boost/random.hpp>
 
-#include <boost/graph/maximum_cardinality_matching.hpp>
+#include <boost/graph/max_cardinality_matching.hpp>
 
 using namespace boost;
 
 typedef adjacency_list<vecS, 
-		       vecS, 
-		       undirectedS, 
-      		       property<vertex_index_t, int> >  undirected_graph;
+                       vecS, 
+                       undirectedS, 
+                       property<vertex_index_t, int> >  undirected_graph;
 
 typedef property_map<undirected_graph,vertex_index_t>::type vertex_index_map_t;
 typedef vector_property_map<graph_traits<undirected_graph>::vertex_descriptor, vertex_index_map_t > mate_t;
@@ -35,7 +35,7 @@
   if (argc < 3)
     {
       std::cout << "Usage: " << argv[0] << " n m" << std::endl
-		<< "Tests the checked matching on a random graph w/ n vertices and m edges" << std::endl;
+                << "Tests the checked matching on a random graph w/ n vertices and m edges" << std::endl;
       exit(-1);
     }
   
@@ -58,15 +58,15 @@
       vertex_descriptor_t u = random_vertex(g,rand_num);
       vertex_descriptor_t v = random_vertex(g,rand_num);
       if (u != v)
-	{
-	  if (!edge(u,v,g).second)
-	    tie(tuples::ignore, success) = add_edge(u, v, g);
-	  else
-	    success = false;
+        {
+          if (!edge(u,v,g).second)
+            tie(tuples::ignore, success) = add_edge(u, v, g);
+          else
+            success = false;
 
-	  if (success)
-	    num_edges++;
-	}
+          if (success)
+            num_edges++;
+        }
     }
 
   mate_t mate(n);
@@ -80,15 +80,15 @@
       typedef graph_traits<undirected_graph>::edge_iterator edge_iterator_t;
       edge_iterator_t ei,ei_end;
       for(tie(ei,ei_end) = edges(g); ei != ei_end; ++ei)
-	std:: cout << *ei << ", ";
+        std:: cout << *ei << ", ";
       std::cout << std::endl;
       
       std::cout << "Matching is: ";
       vertex_iterator_t vi, vi_end;
       for(tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi)
-	if (mate[*vi] != graph_traits<undirected_graph>::null_vertex() &&
-	    *vi < mate[*vi])
-	  std::cout << "{" << *vi << "," << mate[*vi] << "}, ";
+        if (mate[*vi] != graph_traits<undirected_graph>::null_vertex() &&
+            *vi < mate[*vi])
+          std::cout << "{" << *vi << "," << mate[*vi] << "}, ";
       std::cout << std::endl;
     }
 
@@ -117,7 +117,7 @@
 
   if (matching_size(g,mate) > matching_size(g,greedy_mate) &&
       maximum_cardinality_matching_verifier<undirected_graph,mate_t,vertex_index_map_t>::verify_matching(g,greedy_mate,get(vertex_index,g)))
-	std::cout << "TEST 3 FAILED!!!" << std::endl;
+        std::cout << "TEST 3 FAILED!!!" << std::endl;
 
   return 0;
 }

Copied: boost/trunk/libs/graph/test/serialize.cpp (from rev 14034, boost/branches/upstream/current/libs/graph/test/serialize.cpp)

Modified: boost/trunk/libs/index.html
===================================================================
--- boost/trunk/libs/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,5 +5,10 @@
 <body>
 Automatic redirection failed, please go to
 <a href="libraries.htm">libraries.htm</a>.
+<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p> Distributed under the Boost Software 
+License, Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
+www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
-</html>
+</html>
\ No newline at end of file

Modified: boost/trunk/libs/integer/cstdint_test.cpp
===================================================================
--- boost/trunk/libs/integer/cstdint_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/integer/cstdint_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -113,10 +113,24 @@
    assert(sizeof(T1) == sizeof(T2));
    assert(t1 == t2);
 #endif
+#if defined(BOOST_HAS_STDINT_H)
+   // native headers are permitted to promote small
+   // unsigned types to type int:
+   if(sizeof(T1) >= sizeof(int))
+   {
+      if(t1 > 0)
+        assert(t2 > 0);
+      else
+        assert(!(t2 > 0));
+   }
+   else if(t1 < 0)
+      assert(!(t2 > 0));
+#else
    if(t1 > 0)
      assert(t2 > 0);
    else
      assert(!(t2 > 0));
+#endif
 }
 
 

Modified: boost/trunk/libs/io/index.html
===================================================================
--- boost/trunk/libs/io/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/io/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,11 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="doc/index.html">doc/index.html</a>.
+<a href="doc/index.html">doc/index.html</a>.&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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: boost/trunk/libs/io/test/Jamfile
===================================================================
--- boost/trunk/libs/io/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/io/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,33 +0,0 @@
-#  Boost.IO Library test Jamfile
-#
-#  Copyright 2003 Daryle Walker.  Use, modification, and distribution
-#  are subject to the Boost Software License, Version 1.0.  (See
-#  accompanying file LICENSE_1_0.txt or a copy at
-#  <http://www.boost.org/LICENSE_1_0.txt>.)
-#
-#  See <http://www.boost.org/libs/io/> for the library's home page.
-subproject libs/io/test ;
-
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-
-test-suite "io"
-   :    [  run ios_state_unit_test.cpp 
-                <lib>@boost/libs/test/build/boost_unit_test_framework
-              : # args
-              : # input files
-              : std::locale-support
-        ]
-
-        [ run ios_state_test.cpp 
-                <lib>@boost/libs/test/build/boost_test_exec_monitor
-              : # args
-              : # input files
-              : std::locale-support
-        ]
-  ;
-}

Modified: boost/trunk/libs/io/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/io/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/io/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,14 +9,14 @@
 
 test-suite "io"
    :    [  run ios_state_unit_test.cpp 
-                ../../../libs/test/build//boost_unit_test_framework
+                ../../../libs/test/build//boost_unit_test_framework/<link>static
               : # args
               : # input files
               # : std::locale-support
         ]
 
         [ run ios_state_test.cpp 
-                ../../../libs/test/build//boost_test_exec_monitor
+                ../../../libs/test/build//boost_test_exec_monitor/<link>static
               : # args
               : # input files
               # : std::locale-support

Deleted: boost/trunk/libs/iostreams/build/Jamfile
===================================================================
--- boost/trunk/libs/iostreams/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iostreams/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,70 +0,0 @@
-# Boost.Iostreams Library Build Jamfile
-
-# (C) Copyright Jonathan Turkanis 2004
-# Distributed under the Boost Software License, Version 1.0. (See accompanying 
-# file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt.)
-
-# See http://www.boost.org/libs/iostreams for documentation.
-
-subproject libs/iostreams/build ;
-
-import ./bzip2 ;
-import ./zlib ;
-
-SOURCES = file_descriptor mapped_file ;
-
-template iostreams
-    : # sources
-          ../src/$(SOURCES).cpp
-      <template>bzip2
-      <template>zlib
-    : # build requirements
-    : # build variants
-    ;
-
-lib boost_iostreams
-    : # sources
-      <template>iostreams
-    : # build requirements
-      [ cond $(BZIP2_SOURCE) : <lib>boost_bzip2 : ]
-      [ cond $(ZLIB_SOURCE) : <lib>boost_zlib : ]
-      [ common-names ] # magic for install and auto-link features
-      <include>$(BOOST_ROOT) <sysinclude>$(BOOST_ROOT)
-    : # build variants
-      debug release  
-    ;
-
-dll boost_iostreams
-    : # sources
-      <template>iostreams
-    : # build requirements
-      [ common-names ]  # magic for install and auto-link features
-      <define>BOOST_IOSTREAMS_DYN_LINK=1  # tell source we're building dll's
-      <runtime-link>dynamic  # build only for dynamic runtimes
-      <include>$(BOOST_ROOT) <sysinclude>$(BOOST_ROOT)
-    : # build variants
-      debug release 
-    ;
-
-install iostreams lib
-     : <lib>boost_iostreams <dll>boost_iostreams
-     ;
-
-stage stage/lib 
-    : <lib>boost_iostreams <dll>boost_iostreams 
-      [ cond $(BZIP2_SOURCE) 
-        : <lib>boost_bzip2 
-          #<dll>boost_bzip2 
-        : ] 
-      [ cond $(ZLIB_SOURCE) : <lib>boost_zlib <dll>boost_zlib : ] 
-    : # copy to a path rooted at BOOST_ROOT:
-      <locate>$(BOOST_ROOT)
-      [ common-names ] # magic for install and auto-link features
-      # add this target to the "stage" and "all" psuedo-targets:
-      <target>stage
-      <target>all
-    : # build variants
-      debug release 
-    ;
-
-# end

Modified: boost/trunk/libs/iostreams/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/iostreams/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iostreams/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -131,10 +131,11 @@
     sources += boost_bzip2 bzip2.cpp ;
 }
 
-lib boost_iostreams : $(sources) ;
+lib boost_iostreams : $(sources) : <link>shared:<define>BOOST_IOSTREAMS_DYN_LINK=1 ;
 
 
 
   
 
 
+

Modified: boost/trunk/libs/iostreams/doc/home.html
===================================================================
--- boost/trunk/libs/iostreams/doc/home.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iostreams/doc/home.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,8 +2,8 @@
 <HTML>
 <HEAD>
     <TITLE>The Boost Iostreams library</TITLE>
-    <LINK REL="stylesheet" HREF="../../../boost.css">
-    <LINK REL="stylesheet" HREF="theme/iostreams.css">
+    <LINK REL="stylesheet" HREF="../../../boost.css" type="text/css">
+    <LINK REL="stylesheet" HREF="theme/iostreams.css" type="text/css">
 </HEAD>
 <BODY>
 
@@ -23,7 +23,7 @@
 
 <HR>
 
-<!-- -------------- Core Components -------------- -->
+<!--                Core Components                -->
 
 <A NAME="purpose"></A>
 <H2>Purpose</H2>
@@ -95,11 +95,11 @@
     namespace <CODE>boost::iostreams</CODE>, unless otherwise indicated. Namespace qualification is usually omitted.
 </P>
 <P> 
-    Specializations of <CODE>std::basic_istream</CODE> will be refered to as 
+    Specializations of <CODE>std::basic_istream</CODE> will be referred to as 
     <SPAN CLASS="term">standard input streams</SPAN>, specializations of <CODE>std::basic_ostream</CODE>  
      as <SPAN CLASS="term">standard output streams</SPAN>, specializations of <CODE>std::basic_iostream</CODE> 
     as <SPAN CLASS="term">standard i/o streams</SPAN>, and specializations of <CODE>std::basic_streambuf</CODE> 
-    as <SPAN CLASS="term">standard stream buffers</SPAN>. Together, standard input streams, standard output streams and standard i/o streams will be refered to as <SPAN CLASS="term">standard streams</SPAN>. Sometimes the qualifier <I>standard</I> will be omitted.
+    as <SPAN CLASS="term">standard stream buffers</SPAN>. Together, standard input streams, standard output streams and standard i/o streams will be referred to as <SPAN CLASS="term">standard streams</SPAN>. Sometimes the qualifier <I>standard</I> will be omitted.
 </P>
 
 <!-- <UL>
@@ -107,11 +107,11 @@
         All classes, functions and templates introduced in the documentation are in the namespace <CODE>boost::iostreams</CODE> unless otherwise indicated. Namespace qualification will usually be omitted.
     </LI>
     <LI CLASS="square"> 
-        Specializations of <CODE>std::basic_istream</CODE> will be refered to as 
+        Specializations of <CODE>std::basic_istream</CODE> will be referred to as 
         <SPAN CLASS="term">standard input streams</SPAN>, specializations of <CODE>std::basic_ostream</CODE>  
          as <SPAN CLASS="term">standard output streams</SPAN>, specializations of <CODE>std::basic_iostream</CODE> 
         as <SPAN CLASS="term">standard i/o streams</SPAN>, and specializations of <CODE>std::basic_streambuf</CODE> 
-        as <SPAN CLASS="term">standard stream buffers</SPAN>. Together, standard input streams, standard output streams and standard i/o streams will be refered to as <SPAN CLASS="term">standard streams</SPAN>. The qualifier <I>standard</I> will usually be omitted.
+        as <SPAN CLASS="term">standard stream buffers</SPAN>. Together, standard input streams, standard output streams and standard i/o streams will be referred to as <SPAN CLASS="term">standard streams</SPAN>. The qualifier <I>standard</I> will usually be omitted.
     </LI>
 </UL> -->
 

Modified: boost/trunk/libs/iostreams/doc/installation.html
===================================================================
--- boost/trunk/libs/iostreams/doc/installation.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iostreams/doc/installation.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -29,7 +29,7 @@
 </P>
 
 <P>
-    The components which are implemented in <CODE>.cpp</CODE> or which rely on external libraries can be built in two ways: by adding the appropriate <CODE>.cpp</CODE> files to your IDE project or makefile, or by using <A HREF="../../../tools/build/v1/build_system.htm" TARGET="_top">Boost.Build</A>.
+    The components which are implemented in <CODE>.cpp</CODE> or which rely on external libraries can be built in two ways: by adding the appropriate <CODE>.cpp</CODE> files to your IDE project or makefile, or by using <A HREF="../../../tools/build/index.html" TARGET="_top">Boost.Build</A>.
 </P>
 
 <A NAME="ide"></A>
@@ -183,4 +183,4 @@
 
 <!-- End Footer -->
 
-</BODY>
\ No newline at end of file
+</BODY>

Modified: boost/trunk/libs/iostreams/doc/menu.html
===================================================================
--- boost/trunk/libs/iostreams/doc/menu.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iostreams/doc/menu.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,6 @@
 <!--
 
+Copyright 2005 Jonathan Turkanis
 Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <A HREF="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>)
 
 -->

Modified: boost/trunk/libs/iostreams/doc/tree/tree.css
===================================================================
--- boost/trunk/libs/iostreams/doc/tree/tree.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iostreams/doc/tree/tree.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,33 +1,33 @@
-/*
- * (C) Copyright Jonathan Turkanis 2003.
- * Distributed under the Boost Software License, Version 1.0. (See accompanying
- * file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt.)
- */
-
-BODY { padding:5; margin:5 }
-HR { width:95%; text-align:center }
-DIV.tree-item { font-family:"Times New Roman",serif }
-SPAN.tree-icon { color:#0000ee }
-A.tree-icon, A.tree-text { text-decoration:none }
-A.tree-text { color:#0000ee }
-A:visited.tree-text { color:#0000ee }
-.lib-name, .tree-caption
-{ 
-    margin-bottom:0;
-    font-size:108%;
-    font-family:Verdana,Tahoma,Arial,Helvetica,sans-serif;
-    text-align:center;
-    color:black
-}
-.tree-sync 
-{ 
-    font-size:10px;
-    font-family:Verdana,Tahoma,Arial,Helvetica,sans-serif;
-    text-decoration:none;
-    color:#0000ee 
-}
-P.tree-sync 
-{ 
-    text-align:center;
-    margin-bottom:1em
-}
\ No newline at end of file
+/*
+ * (C) Copyright Jonathan Turkanis 2003.
+ * Distributed under the Boost Software License, Version 1.0. (See accompanying
+ * file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt.)
+ */
+
+BODY { padding:5; margin:5 }
+HR { width:95%; text-align:center }
+DIV.tree-item { font-family:"Times New Roman",serif }
+SPAN.tree-icon { color:#0000ee }
+A.tree-icon, A.tree-text { text-decoration:none }
+A.tree-text { color:#0000ee }
+A:visited.tree-text { color:#0000ee }
+.lib-name, .tree-caption
+{ 
+    margin-bottom:0;
+    font-size:108%;
+    font-family:Verdana,Tahoma,Arial,Helvetica,sans-serif;
+    text-align:center;
+    color:black
+}
+.tree-sync 
+{ 
+    font-size:10px;
+    font-family:Verdana,Tahoma,Arial,Helvetica,sans-serif;
+    text-decoration:none;
+    color:#0000ee 
+}
+P.tree-sync 
+{ 
+    text-align:center;
+    margin-bottom:1em
+}

Modified: boost/trunk/libs/iostreams/example/finite_state_filter.hpp
===================================================================
--- boost/trunk/libs/iostreams/example/finite_state_filter.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iostreams/example/finite_state_filter.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -253,7 +253,8 @@
             return state;
         }
     };
-#if BOOST_WORKAROUND(__DECCXX_VER, BOOST_TESTED_AT(60590042)) // Tru64.
+#if BOOST_WORKAROUND(__DECCXX_VER, BOOST_TESTED_AT(60590042)) /* Tru64 */ \
+ || BOOST_WORKAROUND(__MWERKS__,   BOOST_TESTED_AT(0x3205))   /* CW9.4 */
     public:
 #endif
     template<typename FSM>

Modified: boost/trunk/libs/iostreams/index.html
===================================================================
--- boost/trunk/libs/iostreams/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iostreams/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,9 +4,11 @@
 <META HTTP-EQUIV="refresh" CONTENT="0; URL=doc/index.html">
 </HEAD>
 <BODY>
-<P>Please visit our new location at <A HREF="doc/index.html">doc/index.html</A>.</P>
-<P CLASS="copyright"> 
-    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <A HREF="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>)
-</P>
+<P>Please visit our new location at <A HREF="doc/index.html">doc/index.html</A>.&nbsp;</P>
+<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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: boost/trunk/libs/iostreams/test/Jamfile
===================================================================
--- boost/trunk/libs/iostreams/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iostreams/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,136 +0,0 @@
-# Boost.Iostreams Library test Jamfile
-
-# (C) Copyright Jonathan Turkanis 2004
-# Distributed under the Boost Software License, Version 1.0. (See accompanying 
-# file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt.)
-
-# See http://www.boost.org/libs/iostreams for documentation.
-
-subproject libs/iostreams/test ;
-
-# bring in rules for testing
-import testing ;
-
-# import compression libraries
-import ../build/bzip2 ;
-import ../build/zlib ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-    # look in BOOST_ROOT for sources first, just in this Jamfile
-    local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-
-    template bzip2
-        : # sources
-          <template>basic
-          <lib>../build/boost_iostreams
-          <lib>../build/boost_bzip2
-        : # build requirements
-          <define>BOOST_IOSTREAMS_NO_LIB
-        : # build variants
-        ;
-
-    template zlib
-        : # sources
-          <template>basic
-          <lib>../build/boost_iostreams
-          <lib>../build/boost_zlib
-        : # build requirements
-          <define>BOOST_IOSTREAMS_NO_LIB
-        : # build variants
-        ;
-
-    rule test-iostreams ( sources * : requirements * ) {
-        return [
-            run
-                $(sources)
-                <lib>../../test/build/boost_unit_test_framework
-            : # command
-            : # input files
-            : # build requirements
-                <vc-6_5-stlport><*><runtime-link>static
-                <define>BOOST_IOSTREAMS_NO_LIB
-                $(requirements)
-        ] ;
-    }
-    
-    rule intialize_suite {
-        TEST_SUITE =
-          [ test-iostreams libs/iostreams/test/array_test.cpp ]
-          [ test-iostreams libs/iostreams/test/auto_close_test.cpp ]
-          [ test-iostreams libs/iostreams/test/buffer_size_test.cpp ]
-          [ test-iostreams 
-                libs/iostreams/test/code_converter_test.cpp 
-                libs/iostreams/test/detail/utf8_codecvt_facet.cpp 
-              : # build requirements 
-                std::locale-support ]   
-          [ test-iostreams libs/iostreams/test/component_access_test.cpp ]
-          [ test-iostreams libs/iostreams/test/compose_test.cpp ]
-          [ test-iostreams libs/iostreams/test/copy_test.cpp ]
-          [ test-iostreams libs/iostreams/test/counter_test.cpp ]
-          [ test-iostreams libs/iostreams/test/direct_adapter_test.cpp ]
-          [ test-iostreams libs/iostreams/test/example_test.cpp ]
-          [ test-iostreams libs/iostreams/test/file_test.cpp ]
-          [ test-iostreams 
-                libs/iostreams/test/file_descriptor_test.cpp 
-                libs/iostreams/src/file_descriptor.cpp ]
-          [ test-iostreams libs/iostreams/test/filtering_stream_test.cpp ]
-          [ test-iostreams 
-                libs/iostreams/test/finite_state_filter_test.cpp 
-              : # build requirements 
-                std::locale-support ]
-          [ test-iostreams libs/iostreams/test/flush_test.cpp ]
-          [ test-iostreams libs/iostreams/test/invert_test.cpp ]
-          [ test-iostreams libs/iostreams/test/line_filter_test.cpp ]
-          [ test-iostreams 
-                libs/iostreams/test/mapped_file_test.cpp 
-                libs/iostreams/src/mapped_file.cpp ]
-          [ test-iostreams libs/iostreams/test/newline_test.cpp ]
-          [ test-iostreams libs/iostreams/test/null_test.cpp ]
-          [ test-iostreams libs/iostreams/test/pipeline_test.cpp ]
-          [ test-iostreams libs/iostreams/test/positioning_test.cpp ]
-          [ test-iostreams 
-                libs/iostreams/test/regex_filter_test.cpp     
-                <lib>../../regex/build/boost_regex ]
-          [ test-iostreams libs/iostreams/test/restrict_test.cpp ]
-          [ test-iostreams libs/iostreams/test/seekable_file_test.cpp ]
-          [ test-iostreams libs/iostreams/test/seekable_filter_test.cpp ]
-          [ test-iostreams libs/iostreams/test/stdio_filter_test.cpp ]
-          [ test-iostreams libs/iostreams/test/symmetric_filter_test.cpp ]
-          [ test-iostreams libs/iostreams/test/tee_test.cpp ]
-          [ test-iostreams libs/iostreams/test/wide_stream_test.cpp ] ;
-          
-        if ! $(NO_BZIP2) 
-        {
-            TEST_SUITE += 
-                [ test-iostreams 
-                      libs/iostreams/test/bzip2_test.cpp 
-                      <template>bzip2 
-                    : # build requirements
-                      <define>BOOST_IOSTREAMS_NO_LIB ] ;
-        }
-
-        if ! $(NO_ZLIB) 
-        {
-            TEST_SUITE += 
-                [ test-iostreams 
-                      libs/iostreams/test/gzip_test.cpp 
-                      <template>zlib
-                    : # build requirements
-                      <define>BOOST_IOSTREAMS_NO_LIB ]
-                [ test-iostreams 
-                      libs/iostreams/test/zlib_test.cpp 
-                      <template>zlib
-                    : # build requirements
-                      <define>BOOST_IOSTREAMS_NO_LIB ] ;
-        }
-    }
-    
-    intialize_suite ;
-
-    test-suite "iostreams"
-        : $(IOSTREAMS_TEST_SUITE)
-        ;
-}

Modified: boost/trunk/libs/iostreams/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/iostreams/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iostreams/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,13 +17,14 @@
     return [
             run
                 $(sources)
-                /boost/test//boost_unit_test_framework
+                /boost/test//boost_unit_test_framework/<link>static
             : # command
             : # input files
             : # build requirements
                 <toolset>msvc,<stdlib>stlport:<runtime-link>static
                 <toolset>cw-9.3,<os>darwin:<runtime-link>static
                 <define>BOOST_IOSTREAMS_NO_LIB
+                <link>shared:<define>BOOST_IOSTREAMS_DYN_LINK=1
                 $(requirements)
         ] ;
 }
@@ -48,7 +49,7 @@
           [ test-iostreams file_test.cpp ]
           [ test-iostreams 
                 file_descriptor_test.cpp 
-                ../src/file_descriptor.cpp ]
+                ../src/file_descriptor.cpp : <link>static ]
           [ test-iostreams filtering_stream_test.cpp ]
           [ test-iostreams 
                 finite_state_filter_test.cpp 
@@ -62,7 +63,7 @@
           [ test-iostreams line_filter_test.cpp ]
           [ test-iostreams 
                 mapped_file_test.cpp 
-                ../src/mapped_file.cpp ]
+                ../src/mapped_file.cpp : <link>static ]
           [ test-iostreams newline_test.cpp ]
           [ test-iostreams null_test.cpp ]
           [ test-iostreams pipeline_test.cpp ]
@@ -93,4 +94,4 @@
       }          
           
     test-suite "iostreams" : $(all-tests) ;
-    
\ No newline at end of file
+    

Modified: boost/trunk/libs/iostreams/test/detail/utf8_codecvt_facet.cpp
===================================================================
--- boost/trunk/libs/iostreams/test/detail/utf8_codecvt_facet.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iostreams/test/detail/utf8_codecvt_facet.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,9 +3,8 @@
 
 // Copyright © 2001 Ronald Garcia, Indiana University (garcia at osl.iu.edu)
 // Andrew Lumsdaine, Indiana University (lums at osl.iu.edu). 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
+// Distributed under the Boost Software License, Version 1.0. (See accompany-
+// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 // See http://www.boost.org/libs/iostreams for documentation.
 

Modified: boost/trunk/libs/iostreams/test/detail/utf8_codecvt_facet.hpp
===================================================================
--- boost/trunk/libs/iostreams/test/detail/utf8_codecvt_facet.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iostreams/test/detail/utf8_codecvt_facet.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,11 +15,9 @@
 // utf8_codecvt_facet.hpp
 
 // Copyright © 2001 Ronald Garcia, Indiana University (garcia at osl.iu.edu)
-// Andrew Lumsdaine, Indiana University (lums at osl.iu.edu). Permission to copy, 
-// use, modify, sell and distribute this software is granted provided this
-// copyright notice appears in all copies. This software is provided "as is"
-// without express or implied warranty, and with no claim as to its suitability
-// for any purpose.
+// Andrew Lumsdaine, Indiana University (lums at osl.iu.edu).
+// Distributed under the Boost Software License, Version 1.0. (See accompany-
+// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 // Note:(Robert Ramey).  I have made the following alterations in the original
 // code.

Modified: boost/trunk/libs/iostreams/test/putback_test.hpp
===================================================================
--- boost/trunk/libs/iostreams/test/putback_test.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iostreams/test/putback_test.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
 // Distributed under the Boost Software License, Version 1.0. (See accompanying
 // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt.)
 
-// See http://www.boost.org/libs/iostreams for documentation.
+// See http://www.boost.org/libs/iostreams/ for documentation.
 
 #ifndef BOOST_IOSTREAMS_TEST_PUTBACK_HPP_INCLUDED
 #define BOOST_IOSTREAMS_TEST_PUTBACK_HPP_INCLUDED
@@ -11,86 +11,86 @@
 #include <boost/iostreams/filtering_stream.hpp>
 #include <boost/iostreams/putback.hpp>
 #include "detail/constants.hpp"
-#include "detail/temp_file.hpp"
-
-using boost::iostreams::test::chunk_size;
-
-bool putback_test_one(std::istream& is)
-{
-    try {
-        do {
-            char buf[chunk_size];
-            is.read(buf, chunk_size);
-            if (is.gcount() < static_cast<std::streamsize>(chunk_size))
-                break;
-            is.putback('a');
-            if (is.get() != 'a')
-                return false;
-        } while (!is.eof());
-        return true;
-    } catch (std::exception&) { return false; }
-}
-
-bool putback_test_two(std::istream& is)
-{
-    try {
-        do {
-            char buf[chunk_size];
-            is.read(buf, chunk_size);
-            if (is.gcount() < static_cast<std::streamsize>(chunk_size))
-                break;
-            is.putback('a');
-            is.putback('b');
-            is.putback('c');
-            is.putback('d');
-            if ( is.get() != 'd' || is.get() != 'c' ||
-                 is.get() != 'b' || is.get() != 'a' )
-            {
-                return false;
-            }
-        } while (!is.eof());
-        return true;
-    } catch (std::exception&) { return false; }
+#include "detail/temp_file.hpp"
+
+using boost::iostreams::test::chunk_size;
+
+bool putback_test_one(std::istream& is)
+{
+    try {
+        do {
+            char buf[chunk_size];
+            is.read(buf, chunk_size);
+            if (is.gcount() < static_cast<std::streamsize>(chunk_size))
+                break;
+            is.putback('a');
+            if (is.get() != 'a')
+                return false;
+        } while (!is.eof());
+        return true;
+    } catch (std::exception&) { return false; }
 }
 
+bool putback_test_two(std::istream& is)
+{
+    try {
+        do {
+            char buf[chunk_size];
+            is.read(buf, chunk_size);
+            if (is.gcount() < static_cast<std::streamsize>(chunk_size))
+                break;
+            is.putback('a');
+            is.putback('b');
+            is.putback('c');
+            is.putback('d');
+            if ( is.get() != 'd' || is.get() != 'c' ||
+                 is.get() != 'b' || is.get() != 'a' )
+            {
+                return false;
+            }
+        } while (!is.eof());
+        return true;
+    } catch (std::exception&) { return false; }
+}
+
 template<typename Source>
-bool putback_test_three(Source& src)
-{
-    try {
-        while (true) {
-            char buf[chunk_size];
-            if (boost::iostreams::read(src, buf, chunk_size) < chunk_size)
-                break;
-            boost::iostreams::putback(src, 'a');
-            if (boost::iostreams::get(src) != 'a')
-                return false;
-        }
-        return true;
-    } catch (std::exception&) { return false; }
-}
+bool putback_test_three(Source& src)
+{
+    try {
+        while (true) {
+            char buf[chunk_size];
+            if (boost::iostreams::read(src, buf, chunk_size) < chunk_size)
+                break;
+            boost::iostreams::putback(src, 'a');
+            if (boost::iostreams::get(src) != 'a')
+                return false;
+        }
+        return true;
+    } catch (std::exception&) { return false; }
+}
 
-template<typename Source>
-bool putback_test_four(Source& src)
-{
-    try {
-        while (true) {
-            char buf[chunk_size];
-            if (boost::iostreams::read(src, buf, chunk_size) < chunk_size)
-                break;
-            boost::iostreams::putback(src, 'a');
-            boost::iostreams::putback(src, 'b');
-            boost::iostreams::putback(src, 'c');
-            boost::iostreams::putback(src, 'd');
-            if ( boost::iostreams::get(src) != 'd' || 
-                 boost::iostreams::get(src) != 'c' ||
-                 boost::iostreams::get(src) != 'b' || 
-                 boost::iostreams::get(src) != 'a' )
-            {
-                return false;
-            }
-        }
-        return true;
-    } catch (std::exception&) { return false; }
+template<typename Source>
+bool putback_test_four(Source& src)
+{
+    try {
+        while (true) {
+            char buf[chunk_size];
+            if (boost::iostreams::read(src, buf, chunk_size) < chunk_size)
+                break;
+            boost::iostreams::putback(src, 'a');
+            boost::iostreams::putback(src, 'b');
+            boost::iostreams::putback(src, 'c');
+            boost::iostreams::putback(src, 'd');
+            if ( boost::iostreams::get(src) != 'd' || 
+                 boost::iostreams::get(src) != 'c' ||
+                 boost::iostreams::get(src) != 'b' || 
+                 boost::iostreams::get(src) != 'a' )
+            {
+                return false;
+            }
+        }
+        return true;
+    } catch (std::exception&) { return false; }
 }
 
 void putback_test()

Deleted: boost/trunk/libs/iterator/doc/.cvsignore
===================================================================
--- boost/trunk/libs/iterator/doc/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +0,0 @@
-GNUmakefile

Modified: boost/trunk/libs/iterator/doc/BidirectionalTraversal.html
===================================================================
--- boost/trunk/libs/iterator/doc/BidirectionalTraversal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/BidirectionalTraversal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,48 +3,333 @@
 <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.3.6: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Bidirectional Traversal Concept</title>
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:29 $
+:Revision: $Revision: 1.2.6.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
+<div class="document" id="bidirectional-traversal-concept">
 <h1 class="title">Bidirectional Traversal Concept</h1>
-<div class="document" id="bidirectional-traversal-concept">
-<p>A class or built-in type <tt class="literal"><span class="pre">X</span></tt> models the <em>Bidirectional Traversal</em>
-concept if, in addition to <tt class="literal"><span class="pre">X</span></tt> meeting the requirements of Forward
+<!-- 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>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Bidirectional Traversal</em>
+concept if, in addition to <tt class="docutils literal"><span class="pre">X</span></tt> meeting the requirements of Forward
 Traversal Iterator, the following expressions are valid and respect
 the stated semantics.</p>
-<table border="1" class="table">
+<table border="1" class="docutils">
 <colgroup>
 <col width="38%" />
 <col width="37%" />
 <col width="25%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th colspan="3">Bidirectional Traversal Iterator Requirements (in addition to Forward Traversal
+<tr><th class="head" colspan="3">Bidirectional Traversal Iterator Requirements (in addition to Forward Traversal
 Iterator)</th>
 </tr>
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Assertion/Semantics /
+<tr><th class="head">Expression</th>
+<th class="head">Return Type</th>
+<th class="head">Assertion/Semantics /
 Pre-/Post-condition</th>
 </tr>
 </thead>
 <tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">--r</span></tt></td>
-<td><tt class="literal"><span class="pre">X&amp;</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">--r</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">X&amp;</span></tt></td>
 <td>pre: there exists
-<tt class="literal"><span class="pre">s</span></tt> such that <tt class="literal"><span class="pre">r</span>
+<tt class="docutils literal"><span class="pre">s</span></tt> such that <tt class="docutils literal"><span class="pre">r</span>
 <span class="pre">==</span> <span class="pre">++s</span></tt>.  post:
-<tt class="literal"><span class="pre">s</span></tt> is
+<tt class="docutils literal"><span class="pre">s</span></tt> is
 dereferenceable.
-<tt class="literal"><span class="pre">--(++r)</span> <span class="pre">==</span> <span class="pre">r</span></tt>.
-<tt class="literal"><span class="pre">--r</span> <span class="pre">==</span> <span class="pre">--s</span></tt>
-implies <tt class="literal"><span class="pre">r</span> <span class="pre">==</span>
-<span class="pre">s</span></tt>. <tt class="literal"><span class="pre">&amp;r</span> <span class="pre">==</span> <span class="pre">&amp;--r</span></tt>.</td>
+<tt class="docutils literal"><span class="pre">--(++r)</span> <span class="pre">==</span> <span class="pre">r</span></tt>.
+<tt class="docutils literal"><span class="pre">--r</span> <span class="pre">==</span> <span class="pre">--s</span></tt>
+implies <tt class="docutils literal"><span class="pre">r</span> <span class="pre">==</span>
+<span class="pre">s</span></tt>. <tt class="docutils literal"><span class="pre">&amp;r</span> <span class="pre">==</span> <span class="pre">&amp;--r</span></tt>.</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">r--</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">const</span> <span class="pre">X&amp;</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">r--</span></tt></td>
+<td>convertible to <tt class="docutils literal"><span class="pre">const</span> <span class="pre">X&amp;</span></tt></td>
 <td><pre class="first last literal-block">
 {
   X tmp = r;
@@ -54,18 +339,13 @@
 </pre>
 </td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
 <td>Convertible to
-<tt class="literal"><span class="pre">bidirectional_traversal_tag</span></tt></td>
+<tt class="docutils literal"><span class="pre">bidirectional_traversal_tag</span></tt></td>
 <td>&nbsp;</td>
 </tr>
 </tbody>
 </table>
 </div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="BidirectionalTraversal.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/BidirectionalTraversal.rst
===================================================================
--- boost/trunk/libs/iterator/doc/BidirectionalTraversal.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/BidirectionalTraversal.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Bidirectional Traversal Concept
 ...............................
 

Modified: boost/trunk/libs/iterator/doc/ForwardTraversal.html
===================================================================
--- boost/trunk/libs/iterator/doc/ForwardTraversal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/ForwardTraversal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,60 +3,340 @@
 <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.3.6: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Forward Traversal Concept</title>
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:29 $
+:Revision: $Revision: 1.2.6.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
+<div class="document" id="forward-traversal-concept">
 <h1 class="title">Forward Traversal Concept</h1>
-<div class="document" id="forward-traversal-concept">
-<p>A class or built-in type <tt class="literal"><span class="pre">X</span></tt> models the <em>Forward Traversal</em>
-concept if, in addition to <tt class="literal"><span class="pre">X</span></tt> meeting the requirements of Default
+<!-- 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>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Forward Traversal</em>
+concept if, in addition to <tt class="docutils literal"><span class="pre">X</span></tt> meeting the requirements of Default
 Constructible and Single Pass Iterator, the following expressions are
 valid and respect the stated semantics.</p>
-<table border="1" class="table">
+<table border="1" class="docutils">
 <colgroup>
 <col width="38%" />
 <col width="34%" />
 <col width="27%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th colspan="3">Forward Traversal Iterator Requirements (in addition to Default Constructible and Single Pass Iterator)</th>
+<tr><th class="head" colspan="3">Forward Traversal Iterator Requirements (in addition to Default Constructible and Single Pass Iterator)</th>
 </tr>
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Assertion/Note</th>
+<tr><th class="head">Expression</th>
+<th class="head">Return Type</th>
+<th class="head">Assertion/Note</th>
 </tr>
 </thead>
 <tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">X</span> <span class="pre">u;</span></tt></td>
-<td><tt class="literal"><span class="pre">X&amp;</span></tt></td>
-<td>note: <tt class="literal"><span class="pre">u</span></tt> may have a
+<tr><td><tt class="docutils literal"><span class="pre">X</span> <span class="pre">u;</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">X&amp;</span></tt></td>
+<td>note: <tt class="docutils literal"><span class="pre">u</span></tt> may have a
 singular value.</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">++r</span></tt></td>
-<td><tt class="literal"><span class="pre">X&amp;</span></tt></td>
-<td><tt class="literal"><span class="pre">r</span> <span class="pre">==</span> <span class="pre">s</span></tt> and <tt class="literal"><span class="pre">r</span></tt> is
+<tr><td><tt class="docutils literal"><span class="pre">++r</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">X&amp;</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">r</span> <span class="pre">==</span> <span class="pre">s</span></tt> and <tt class="docutils literal"><span class="pre">r</span></tt> is
 dereferenceable implies
-<tt class="literal"><span class="pre">++r</span> <span class="pre">==</span> <span class="pre">++s.</span></tt></td>
+<tt class="docutils literal"><span class="pre">++r</span> <span class="pre">==</span> <span class="pre">++s.</span></tt></td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::difference_type</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">iterator_traits&lt;X&gt;::difference_type</span></tt></td>
 <td>A signed integral type representing
 the distance between iterators</td>
 <td>&nbsp;</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
 <td>Convertible to
-<tt class="literal"><span class="pre">forward_traversal_tag</span></tt></td>
+<tt class="docutils literal"><span class="pre">forward_traversal_tag</span></tt></td>
 <td>&nbsp;</td>
 </tr>
 </tbody>
 </table>
 </div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="ForwardTraversal.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/ForwardTraversal.rst
===================================================================
--- boost/trunk/libs/iterator/doc/ForwardTraversal.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/ForwardTraversal.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Forward Traversal Concept
 .........................
 

Modified: boost/trunk/libs/iterator/doc/IncrementableIterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/IncrementableIterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/IncrementableIterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,38 +3,323 @@
 <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.3.6: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Incrementable Iterator Concept</title>
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:29 $
+:Revision: $Revision: 1.2.6.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
+<div class="document" id="incrementable-iterator-concept">
 <h1 class="title">Incrementable Iterator Concept</h1>
-<div class="document" id="incrementable-iterator-concept">
-<p>A class or built-in type <tt class="literal"><span class="pre">X</span></tt> models the <em>Incrementable Iterator</em>
-concept if, in addition to <tt class="literal"><span class="pre">X</span></tt> being Assignable and Copy
+<!-- 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>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Incrementable Iterator</em>
+concept if, in addition to <tt class="docutils literal"><span class="pre">X</span></tt> being Assignable and Copy
 Constructible, the following expressions are valid and respect the
 stated semantics.</p>
-<table border="1" class="table">
+<table border="1" class="docutils">
 <colgroup>
 <col width="39%" />
 <col width="37%" />
 <col width="24%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th colspan="3">Incrementable Iterator Requirements (in addition to Assignable, Copy Constructible)</th>
+<tr><th class="head" colspan="3">Incrementable Iterator Requirements (in addition to Assignable, Copy Constructible)</th>
 </tr>
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Assertion/Semantics</th>
+<tr><th class="head">Expression</th>
+<th class="head">Return Type</th>
+<th class="head">Assertion/Semantics</th>
 </tr>
 </thead>
 <tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">++r</span></tt></td>
-<td><tt class="literal"><span class="pre">X&amp;</span></tt></td>
-<td><tt class="literal"><span class="pre">&amp;r</span> <span class="pre">==</span> <span class="pre">&amp;++r</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">++r</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">X&amp;</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">&amp;r</span> <span class="pre">==</span> <span class="pre">&amp;++r</span></tt></td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">r++</span></tt></td>
-<td><tt class="literal"><span class="pre">X</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">r++</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">X</span></tt></td>
 <td><pre class="first last literal-block">
 {
    X tmp = r;
@@ -44,18 +329,13 @@
 </pre>
 </td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
 <td>Convertible to
-<tt class="literal"><span class="pre">incrementable_traversal_tag</span></tt></td>
+<tt class="docutils literal"><span class="pre">incrementable_traversal_tag</span></tt></td>
 <td>&nbsp;</td>
 </tr>
 </tbody>
 </table>
 </div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="IncrementableIterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/IncrementableIterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/IncrementableIterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/IncrementableIterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Incrementable Iterator Concept
 ..............................
 

Modified: boost/trunk/libs/iterator/doc/InteroperableIterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/InteroperableIterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/InteroperableIterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Interoperable Iterator Concept
 ..............................
 

Modified: boost/trunk/libs/iterator/doc/LvalueIterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/LvalueIterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/LvalueIterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,49 +3,329 @@
 <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.3.6: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Lvalue Iterator Concept</title>
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:29 $
+:Revision: $Revision: 1.2.6.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
+<div class="document" id="lvalue-iterator-concept">
 <h1 class="title">Lvalue Iterator Concept</h1>
-<div class="document" id="lvalue-iterator-concept">
+<!-- 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>The <em>Lvalue Iterator</em> concept adds the requirement that the return
-type of <tt class="literal"><span class="pre">operator*</span></tt> type be a reference to the value type of the
+type of <tt class="docutils literal"><span class="pre">operator*</span></tt> type be a reference to the value type of the
 iterator.</p>
-<table border="1" class="table">
+<table border="1" class="docutils">
 <colgroup>
 <col width="22%" />
 <col width="19%" />
 <col width="59%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th colspan="3">Lvalue Iterator Requirements</th>
+<tr><th class="head" colspan="3">Lvalue Iterator Requirements</th>
 </tr>
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Note/Assertion</th>
+<tr><th class="head">Expression</th>
+<th class="head">Return Type</th>
+<th class="head">Note/Assertion</th>
 </tr>
 </thead>
 <tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">*a</span></tt></td>
-<td><tt class="literal"><span class="pre">T&amp;</span></tt></td>
-<td><tt class="literal"><span class="pre">T</span></tt> is <em>cv</em>
-<tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::value_type</span></tt>
+<tr><td><tt class="docutils literal"><span class="pre">*a</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">T&amp;</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">T</span></tt> is <em>cv</em>
+<tt class="docutils literal"><span class="pre">iterator_traits&lt;X&gt;::value_type</span></tt>
 where <em>cv</em> is an optional
 cv-qualification.
-pre: <tt class="literal"><span class="pre">a</span></tt> is
-dereferenceable. If <tt class="literal"><span class="pre">a</span>
-<span class="pre">==</span> <span class="pre">b</span></tt> then <tt class="literal"><span class="pre">*a</span></tt> is
-equivalent to <tt class="literal"><span class="pre">*b</span></tt>.</td>
+pre: <tt class="docutils literal"><span class="pre">a</span></tt> is
+dereferenceable. If <tt class="docutils literal"><span class="pre">a</span>
+<span class="pre">==</span> <span class="pre">b</span></tt> then <tt class="docutils literal"><span class="pre">*a</span></tt> is
+equivalent to <tt class="docutils literal"><span class="pre">*b</span></tt>.</td>
 </tr>
 </tbody>
 </table>
 </div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="LvalueIterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/LvalueIterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/LvalueIterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/LvalueIterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Lvalue Iterator Concept
 .......................
 

Modified: boost/trunk/libs/iterator/doc/RandomAccessTraversal.html
===================================================================
--- boost/trunk/libs/iterator/doc/RandomAccessTraversal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/RandomAccessTraversal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,19 +3,304 @@
 <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.3.6: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Random Access Traversal Concept</title>
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:29 $
+:Revision: $Revision: 1.2.6.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
+<div class="document" id="random-access-traversal-concept">
 <h1 class="title">Random Access Traversal Concept</h1>
-<div class="document" id="random-access-traversal-concept">
-<p>A class or built-in type <tt class="literal"><span class="pre">X</span></tt> models the <em>Random Access Traversal</em>
+<!-- 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>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Random Access Traversal</em>
 concept if the following expressions are valid and respect the stated
-semantics.  In the table below, <tt class="literal"><span class="pre">Distance</span></tt> is
-<tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::difference_type</span></tt> and <tt class="literal"><span class="pre">n</span></tt> represents a
-constant object of type <tt class="literal"><span class="pre">Distance</span></tt>.</p>
-<table border="1" class="table">
+semantics.  In the table below, <tt class="docutils literal"><span class="pre">Distance</span></tt> is
+<tt class="docutils literal"><span class="pre">iterator_traits&lt;X&gt;::difference_type</span></tt> and <tt class="docutils literal"><span class="pre">n</span></tt> represents a
+constant object of type <tt class="docutils literal"><span class="pre">Distance</span></tt>.</p>
+<table border="1" class="docutils">
 <colgroup>
 <col width="28%" />
 <col width="30%" />
@@ -23,18 +308,18 @@
 <col width="20%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th colspan="4">Random Access Traversal Iterator Requirements (in addition to Bidirectional Traversal)</th>
+<tr><th class="head" colspan="4">Random Access Traversal Iterator Requirements (in addition to Bidirectional Traversal)</th>
 </tr>
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Operational Semantics</th>
-<th>Assertion/
+<tr><th class="head">Expression</th>
+<th class="head">Return Type</th>
+<th class="head">Operational Semantics</th>
+<th class="head">Assertion/
 Precondition</th>
 </tr>
 </thead>
 <tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">r</span> <span class="pre">+=</span> <span class="pre">n</span></tt></td>
-<td><tt class="literal"><span class="pre">X&amp;</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">r</span> <span class="pre">+=</span> <span class="pre">n</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">X&amp;</span></tt></td>
 <td><pre class="first last literal-block">
 {
   Distance m = n;
@@ -50,80 +335,75 @@
 </td>
 <td>&nbsp;</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">a</span> <span class="pre">+</span> <span class="pre">n</span></tt>, <tt class="literal"><span class="pre">n</span> <span class="pre">+</span> <span class="pre">a</span></tt></td>
-<td><tt class="literal"><span class="pre">X</span></tt></td>
-<td><tt class="literal"><span class="pre">{</span> <span class="pre">X</span> <span class="pre">tmp</span> <span class="pre">=</span> <span class="pre">a;</span> <span class="pre">return</span> <span class="pre">tmp</span>
+<tr><td><tt class="docutils literal"><span class="pre">a</span> <span class="pre">+</span> <span class="pre">n</span></tt>, <tt class="docutils literal"><span class="pre">n</span> <span class="pre">+</span> <span class="pre">a</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">X</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">{</span> <span class="pre">X</span> <span class="pre">tmp</span> <span class="pre">=</span> <span class="pre">a;</span> <span class="pre">return</span> <span class="pre">tmp</span>
 <span class="pre">+=</span> <span class="pre">n;</span> <span class="pre">}</span></tt></td>
 <td>&nbsp;</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">r</span> <span class="pre">-=</span> <span class="pre">n</span></tt></td>
-<td><tt class="literal"><span class="pre">X&amp;</span></tt></td>
-<td><tt class="literal"><span class="pre">return</span> <span class="pre">r</span> <span class="pre">+=</span> <span class="pre">-n</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">r</span> <span class="pre">-=</span> <span class="pre">n</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">X&amp;</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">return</span> <span class="pre">r</span> <span class="pre">+=</span> <span class="pre">-n</span></tt></td>
 <td>&nbsp;</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">a</span> <span class="pre">-</span> <span class="pre">n</span></tt></td>
-<td><tt class="literal"><span class="pre">X</span></tt></td>
-<td><tt class="literal"><span class="pre">{</span> <span class="pre">X</span> <span class="pre">tmp</span> <span class="pre">=</span> <span class="pre">a;</span> <span class="pre">return</span> <span class="pre">tmp</span>
+<tr><td><tt class="docutils literal"><span class="pre">a</span> <span class="pre">-</span> <span class="pre">n</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">X</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">{</span> <span class="pre">X</span> <span class="pre">tmp</span> <span class="pre">=</span> <span class="pre">a;</span> <span class="pre">return</span> <span class="pre">tmp</span>
 <span class="pre">-=</span> <span class="pre">n;</span> <span class="pre">}</span></tt></td>
 <td>&nbsp;</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">b</span> <span class="pre">-</span> <span class="pre">a</span></tt></td>
-<td><tt class="literal"><span class="pre">Distance</span></tt></td>
-<td><tt class="literal"><span class="pre">a</span> <span class="pre">&lt;</span> <span class="pre">b</span> <span class="pre">?</span>&nbsp; <span class="pre">distance(a,b)</span>
+<tr><td><tt class="docutils literal"><span class="pre">b</span> <span class="pre">-</span> <span class="pre">a</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">Distance</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">a</span> <span class="pre">&lt;</span> <span class="pre">b</span> <span class="pre">?</span>&nbsp; <span class="pre">distance(a,b)</span>
 <span class="pre">:</span> <span class="pre">-distance(b,a)</span></tt></td>
 <td>pre: there exists a
-value <tt class="literal"><span class="pre">n</span></tt> of
-<tt class="literal"><span class="pre">Distance</span></tt> such that
-<tt class="literal"><span class="pre">a</span> <span class="pre">+</span> <span class="pre">n</span> <span class="pre">==</span> <span class="pre">b</span></tt>.  <tt class="literal"><span class="pre">b</span>
+value <tt class="docutils literal"><span class="pre">n</span></tt> of
+<tt class="docutils literal"><span class="pre">Distance</span></tt> such that
+<tt class="docutils literal"><span class="pre">a</span> <span class="pre">+</span> <span class="pre">n</span> <span class="pre">==</span> <span class="pre">b</span></tt>.  <tt class="docutils literal"><span class="pre">b</span>
 <span class="pre">==</span> <span class="pre">a</span> <span class="pre">+</span> <span class="pre">(b</span> <span class="pre">-</span> <span class="pre">a)</span></tt>.</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">a[n]</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">a[n]</span></tt></td>
 <td>convertible to T</td>
-<td><tt class="literal"><span class="pre">*(a</span> <span class="pre">+</span> <span class="pre">n)</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">*(a</span> <span class="pre">+</span> <span class="pre">n)</span></tt></td>
 <td>pre: a is a <em>Readable
 Iterator</em></td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">a[n]</span> <span class="pre">=</span> <span class="pre">v</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">a[n]</span> <span class="pre">=</span> <span class="pre">v</span></tt></td>
 <td>convertible to T</td>
-<td><tt class="literal"><span class="pre">*(a</span> <span class="pre">+</span> <span class="pre">n)</span> <span class="pre">=</span> <span class="pre">v</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">*(a</span> <span class="pre">+</span> <span class="pre">n)</span> <span class="pre">=</span> <span class="pre">v</span></tt></td>
 <td>pre: a is a <em>Writable
 iterator</em></td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">a</span> <span class="pre">&lt;</span> <span class="pre">b</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">b</span> <span class="pre">-</span> <span class="pre">a</span> <span class="pre">&gt;</span> <span class="pre">0</span></tt></td>
-<td><tt class="literal"><span class="pre">&lt;</span></tt> is a total
+<tr><td><tt class="docutils literal"><span class="pre">a</span> <span class="pre">&lt;</span> <span class="pre">b</span></tt></td>
+<td>convertible to <tt class="docutils literal"><span class="pre">bool</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">b</span> <span class="pre">-</span> <span class="pre">a</span> <span class="pre">&gt;</span> <span class="pre">0</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">&lt;</span></tt> is a total
 ordering relation</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">a</span> <span class="pre">&gt;</span> <span class="pre">b</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">b</span> <span class="pre">&lt;</span> <span class="pre">a</span></tt></td>
-<td><tt class="literal"><span class="pre">&gt;</span></tt> is a total
+<tr><td><tt class="docutils literal"><span class="pre">a</span> <span class="pre">&gt;</span> <span class="pre">b</span></tt></td>
+<td>convertible to <tt class="docutils literal"><span class="pre">bool</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">b</span> <span class="pre">&lt;</span> <span class="pre">a</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">&gt;</span></tt> is a total
 ordering relation</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">a</span> <span class="pre">&gt;=</span> <span class="pre">b</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">!(a</span> <span class="pre">&lt;</span> <span class="pre">b)</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">a</span> <span class="pre">&gt;=</span> <span class="pre">b</span></tt></td>
+<td>convertible to <tt class="docutils literal"><span class="pre">bool</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">!(a</span> <span class="pre">&lt;</span> <span class="pre">b)</span></tt></td>
 <td>&nbsp;</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">a</span> <span class="pre">&lt;=</span> <span class="pre">b</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">!(a</span> <span class="pre">&gt;</span> <span class="pre">b)</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">a</span> <span class="pre">&lt;=</span> <span class="pre">b</span></tt></td>
+<td>convertible to <tt class="docutils literal"><span class="pre">bool</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">!(a</span> <span class="pre">&gt;</span> <span class="pre">b)</span></tt></td>
 <td>&nbsp;</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
 <td>Convertible to
-<tt class="literal"><span class="pre">random_access_traversal_tag</span></tt></td>
+<tt class="docutils literal"><span class="pre">random_access_traversal_tag</span></tt></td>
 <td>&nbsp;</td>
 <td>&nbsp;</td>
 </tr>
 </tbody>
 </table>
 </div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="RandomAccessTraversal.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/RandomAccessTraversal.rst
===================================================================
--- boost/trunk/libs/iterator/doc/RandomAccessTraversal.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/RandomAccessTraversal.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Random Access Traversal Concept
 ...............................
 

Modified: boost/trunk/libs/iterator/doc/ReadableIterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/ReadableIterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/ReadableIterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,57 +3,337 @@
 <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.3.6: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Readable Iterator Concept</title>
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:29 $
+:Revision: $Revision: 1.2.6.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
+<div class="document" id="readable-iterator-concept">
 <h1 class="title">Readable Iterator Concept</h1>
-<div class="document" id="readable-iterator-concept">
-<p>A class or built-in type <tt class="literal"><span class="pre">X</span></tt> models the <em>Readable Iterator</em> concept
-for value type <tt class="literal"><span class="pre">T</span></tt> if, in addition to <tt class="literal"><span class="pre">X</span></tt> being Assignable and
+<!-- 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>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Readable Iterator</em> concept
+for value type <tt class="docutils literal"><span class="pre">T</span></tt> if, in addition to <tt class="docutils literal"><span class="pre">X</span></tt> being Assignable and
 Copy Constructible, the following expressions are valid and respect
-the stated semantics. <tt class="literal"><span class="pre">U</span></tt> is the type of any specified member of
-type <tt class="literal"><span class="pre">T</span></tt>.</p>
-<table border="1" class="table">
+the stated semantics. <tt class="docutils literal"><span class="pre">U</span></tt> is the type of any specified member of
+type <tt class="docutils literal"><span class="pre">T</span></tt>.</p>
+<table border="1" class="docutils">
 <colgroup>
 <col width="28%" />
 <col width="20%" />
 <col width="52%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th colspan="3">Readable Iterator Requirements (in addition to Assignable and Copy Constructible)</th>
+<tr><th class="head" colspan="3">Readable Iterator Requirements (in addition to Assignable and Copy Constructible)</th>
 </tr>
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Note/Precondition</th>
+<tr><th class="head">Expression</th>
+<th class="head">Return Type</th>
+<th class="head">Note/Precondition</th>
 </tr>
 </thead>
 <tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::value_type</span></tt></td>
-<td><tt class="literal"><span class="pre">T</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">iterator_traits&lt;X&gt;::value_type</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">T</span></tt></td>
 <td>Any non-reference,
 non-cv-qualified type</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">*a</span></tt></td>
-<td>Convertible to <tt class="literal"><span class="pre">T</span></tt></td>
-<td><dl class="first last">
-<dt>pre: <tt class="literal"><span class="pre">a</span></tt> is dereferenceable. If <tt class="literal"><span class="pre">a</span> <span class="pre">==</span> <span class="pre">b</span></tt> then <tt class="literal"><span class="pre">*a</span></tt></dt>
-<dd>is equivalent to <tt class="literal"><span class="pre">*b</span></tt>.</dd>
+<tr><td><tt class="docutils literal"><span class="pre">*a</span></tt></td>
+<td>Convertible to <tt class="docutils literal"><span class="pre">T</span></tt></td>
+<td><dl class="first last docutils">
+<dt>pre: <tt class="docutils literal"><span class="pre">a</span></tt> is dereferenceable. If <tt class="docutils literal"><span class="pre">a</span> <span class="pre">==</span> <span class="pre">b</span></tt> then <tt class="docutils literal"><span class="pre">*a</span></tt></dt>
+<dd>is equivalent to <tt class="docutils literal"><span class="pre">*b</span></tt>.</dd>
 </dl>
 </td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">a-&gt;m</span></tt></td>
-<td><tt class="literal"><span class="pre">U&amp;</span></tt></td>
-<td>pre: <tt class="literal"><span class="pre">pre:</span> <span class="pre">(*a).m</span></tt> is well-defined. Equivalent to <tt class="literal"><span class="pre">(*a).m</span></tt>.</td>
+<tr><td><tt class="docutils literal"><span class="pre">a-&gt;m</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">U&amp;</span></tt></td>
+<td>pre: <tt class="docutils literal"><span class="pre">pre:</span> <span class="pre">(*a).m</span></tt> is well-defined. Equivalent to <tt class="docutils literal"><span class="pre">(*a).m</span></tt>.</td>
 </tr>
 </tbody>
 </table>
 </div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="ReadableIterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/ReadableIterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/ReadableIterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/ReadableIterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+.. 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)
 
 Readable Iterator Concept
 .........................

Modified: boost/trunk/libs/iterator/doc/SinglePassIterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/SinglePassIterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/SinglePassIterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,61 +3,341 @@
 <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.3.6: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Single Pass Iterator Concept</title>
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:29 $
+:Revision: $Revision: 1.2.6.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
+<div class="document" id="single-pass-iterator-concept">
 <h1 class="title">Single Pass Iterator Concept</h1>
-<div class="document" id="single-pass-iterator-concept">
-<p>A class or built-in type <tt class="literal"><span class="pre">X</span></tt> models the <em>Single Pass Iterator</em>
+<!-- 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>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Single Pass Iterator</em>
 concept if the following expressions are valid and respect the stated
 semantics.</p>
-<table border="1" class="table">
+<table border="1" class="docutils">
 <colgroup>
 <col width="36%" />
 <col width="33%" />
 <col width="31%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th colspan="3">Single Pass Iterator Requirements (in addition to Incrementable Iterator and Equality
+<tr><th class="head" colspan="3">Single Pass Iterator Requirements (in addition to Incrementable Iterator and Equality
 Comparable)</th>
 </tr>
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Assertion/Semantics /
+<tr><th class="head">Expression</th>
+<th class="head">Return Type</th>
+<th class="head">Assertion/Semantics /
 Pre-/Post-condition</th>
 </tr>
 </thead>
 <tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">++r</span></tt></td>
-<td><tt class="literal"><span class="pre">X&amp;</span></tt></td>
-<td>pre: <tt class="literal"><span class="pre">r</span></tt> is
+<tr><td><tt class="docutils literal"><span class="pre">++r</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">X&amp;</span></tt></td>
+<td>pre: <tt class="docutils literal"><span class="pre">r</span></tt> is
 dereferenceable; post:
-<tt class="literal"><span class="pre">r</span></tt> is dereferenceable or
-<tt class="literal"><span class="pre">r</span></tt> is past-the-end</td>
+<tt class="docutils literal"><span class="pre">r</span></tt> is dereferenceable or
+<tt class="docutils literal"><span class="pre">r</span></tt> is past-the-end</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">a</span> <span class="pre">==</span> <span class="pre">b</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">==</span></tt> is an equivalence
+<tr><td><tt class="docutils literal"><span class="pre">a</span> <span class="pre">==</span> <span class="pre">b</span></tt></td>
+<td>convertible to <tt class="docutils literal"><span class="pre">bool</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">==</span></tt> is an equivalence
 relation over its domain</td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">a</span> <span class="pre">!=</span> <span class="pre">b</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">!(a</span> <span class="pre">==</span> <span class="pre">b)</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">a</span> <span class="pre">!=</span> <span class="pre">b</span></tt></td>
+<td>convertible to <tt class="docutils literal"><span class="pre">bool</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">!(a</span> <span class="pre">==</span> <span class="pre">b)</span></tt></td>
 </tr>
-<tr><td><tt class="literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
 <td>Convertible to
-<tt class="literal"><span class="pre">single_pass_traversal_tag</span></tt></td>
+<tt class="docutils literal"><span class="pre">single_pass_traversal_tag</span></tt></td>
 <td>&nbsp;</td>
 </tr>
 </tbody>
 </table>
 </div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="SinglePassIterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/SinglePassIterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/SinglePassIterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/SinglePassIterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Single Pass Iterator Concept
 ............................
 

Modified: boost/trunk/libs/iterator/doc/SwappableIterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/SwappableIterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/SwappableIterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,47 +3,327 @@
 <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.3.6: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Swappable Iterator Concept</title>
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:29 $
+:Revision: $Revision: 1.2.6.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
+<div class="document" id="swappable-iterator-concept">
 <h1 class="title">Swappable Iterator Concept</h1>
-<div class="document" id="swappable-iterator-concept">
-<p>A class or built-in type <tt class="literal"><span class="pre">X</span></tt> models the <em>Swappable Iterator</em> concept
-if, in addition to <tt class="literal"><span class="pre">X</span></tt> being Copy Constructible, the following
+<!-- 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>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Swappable Iterator</em> concept
+if, in addition to <tt class="docutils literal"><span class="pre">X</span></tt> being Copy Constructible, the following
 expressions are valid and respect the stated semantics.</p>
-<table border="1" class="table">
+<table border="1" class="docutils">
 <colgroup>
 <col width="37%" />
 <col width="19%" />
 <col width="43%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th colspan="3">Swappable Iterator Requirements (in addition to Copy Constructible)</th>
+<tr><th class="head" colspan="3">Swappable Iterator Requirements (in addition to Copy Constructible)</th>
 </tr>
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Postcondition</th>
+<tr><th class="head">Expression</th>
+<th class="head">Return Type</th>
+<th class="head">Postcondition</th>
 </tr>
 </thead>
 <tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">iter_swap(a,</span> <span class="pre">b)</span></tt></td>
-<td><tt class="literal"><span class="pre">void</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">iter_swap(a,</span> <span class="pre">b)</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">void</span></tt></td>
 <td>the pointed to values are
 exchanged</td>
 </tr>
 </tbody>
 </table>
-<dl>
+<dl class="docutils">
 <dt>[<em>Note:</em> An iterator that is a model of the <em>Readable</em> and <em>Writable Iterator</em> concepts</dt>
 <dd>is also a model of <em>Swappable Iterator</em>.  <em>--end note</em>]</dd>
 </dl>
 </div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="SwappableIterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/SwappableIterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/SwappableIterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/SwappableIterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Swappable Iterator Concept
 ..........................
 

Modified: boost/trunk/libs/iterator/doc/WritableIterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/WritableIterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/WritableIterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,45 +3,325 @@
 <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.3.6: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Writable Iterator Concept</title>
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:29 $
+:Revision: $Revision: 1.2.6.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
+<div class="document" id="writable-iterator-concept">
 <h1 class="title">Writable Iterator Concept</h1>
-<div class="document" id="writable-iterator-concept">
-<p>A class or built-in type <tt class="literal"><span class="pre">X</span></tt> models the <em>Writable Iterator</em> concept
-if, in addition to <tt class="literal"><span class="pre">X</span></tt> being Copy Constructible, the following
+<!-- 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>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Writable Iterator</em> concept
+if, in addition to <tt class="docutils literal"><span class="pre">X</span></tt> being Copy Constructible, the following
 expressions are valid and respect the stated semantics.  Writable
 Iterators have an associated <em>set of value types</em>.</p>
-<table border="1" class="table">
+<table border="1" class="docutils">
 <colgroup>
 <col width="37%" />
 <col width="21%" />
 <col width="42%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th colspan="3">Writable Iterator Requirements (in addition to Copy Constructible)</th>
+<tr><th class="head" colspan="3">Writable Iterator Requirements (in addition to Copy Constructible)</th>
 </tr>
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Precondition</th>
+<tr><th class="head">Expression</th>
+<th class="head">Return Type</th>
+<th class="head">Precondition</th>
 </tr>
 </thead>
 <tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">*a</span> <span class="pre">=</span> <span class="pre">o</span></tt></td>
+<tr><td><tt class="docutils literal"><span class="pre">*a</span> <span class="pre">=</span> <span class="pre">o</span></tt></td>
 <td>&nbsp;</td>
-<td>pre: The type of <tt class="literal"><span class="pre">o</span></tt>
+<td>pre: The type of <tt class="docutils literal"><span class="pre">o</span></tt>
 is in the set of
-value types of <tt class="literal"><span class="pre">X</span></tt></td>
+value types of <tt class="docutils literal"><span class="pre">X</span></tt></td>
 </tr>
 </tbody>
 </table>
 </div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="WritableIterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/WritableIterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/WritableIterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/WritableIterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Writable Iterator Concept
 .........................
 

Modified: boost/trunk/libs/iterator/doc/counting_iterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/counting_iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/counting_iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,295 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Counting Iterator</title>
 <meta name="author" content="David Abrahams, Jeremy Siek, Thomas Witt" />
 <meta name="organization" content="Boost Consulting, Indiana University Open Systems Lab, University of Hanover Institute for Transport Railway Operation and Construction" />
 <meta name="date" content="2004-11-01" />
 <meta name="copyright" content="Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003." />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:29 $
+:Revision: $Revision: 1.31.4.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="counting-iterator">
@@ -32,6 +314,9 @@
 <td>Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.</td></tr>
 </tbody>
 </table>
+<!-- Distributed under the 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 field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
@@ -44,6 +329,9 @@
 functionality to whatever type it wraps.  One can use the
 counting iterator adaptor not only with integer types, but with
 any incrementable type.</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 class="last"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> adapts an object by adding an <tt class="docutils literal"><span class="pre">operator*</span></tt> that
 returns the current value of the object. All other iterator operations
 are forwarded to the adapted object.</p>
@@ -51,8 +339,8 @@
 </tr>
 </tbody>
 </table>
-<div class="contents topic" id="table-of-contents">
-<p class="topic-title first"><a name="table-of-contents">Table of Contents</a></p>
+<div class="contents topic">
+<p class="topic-title first"><a id="table-of-contents" name="table-of-contents">Table of Contents</a></p>
 <ul class="simple">
 <li><a class="reference" href="#counting-iterator-synopsis" id="id2" name="id2"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> synopsis</a></li>
 <li><a class="reference" href="#counting-iterator-requirements" id="id3" name="id3"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> requirements</a></li>
@@ -61,8 +349,11 @@
 <li><a class="reference" href="#example" id="id6" name="id6">Example</a></li>
 </ul>
 </div>
-<div class="section" id="counting-iterator-synopsis">
-<h1><a class="toc-backref" href="#id2" name="counting-iterator-synopsis"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> synopsis</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id2" id="counting-iterator-synopsis" name="counting-iterator-synopsis"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> synopsis</a></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) -->
 <pre class="literal-block">
 template &lt;
     class Incrementable
@@ -102,7 +393,7 @@
         random_access_traversal_tag, Incrementable, const Incrementable&amp;)
 else
     return <a class="reference" href="iterator_facade.html#iterator-category"><em>iterator-category</em></a>(
-         iterator_traversal&lt;Incrementable&gt;::type, 
+         iterator_traversal&lt;Incrementable&gt;::type,
          Incrementable, const Incrementable&amp;)
 </pre>
 <dl class="docutils">
@@ -112,8 +403,8 @@
 is true.]</dd>
 </dl>
 </div>
-<div class="section" id="counting-iterator-requirements">
-<h1><a class="toc-backref" href="#id3" name="counting-iterator-requirements"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> requirements</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id3" id="counting-iterator-requirements" name="counting-iterator-requirements"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> requirements</a></h1>
 <p>The <tt class="docutils literal"><span class="pre">Incrementable</span></tt> argument shall be Copy Constructible and Assignable.</p>
 <p>If <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is convertible to <tt class="docutils literal"><span class="pre">forward_iterator_tag</span></tt>
 or <tt class="docutils literal"><span class="pre">forward_traversal_tag</span></tt>, the following must be well-formed:</p>
@@ -138,8 +429,8 @@
 i &lt; j;
 </pre>
 </div>
-<div class="section" id="counting-iterator-models">
-<h1><a class="toc-backref" href="#id4" name="counting-iterator-models"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> models</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id4" id="counting-iterator-models" name="counting-iterator-models"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> models</a></h1>
 <p>Specializations of <tt class="docutils literal"><span class="pre">counting_iterator</span></tt> model Readable Lvalue
 Iterator. In addition, they model the concepts corresponding to the
 iterator tags to which their <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is convertible.
@@ -154,8 +445,8 @@
 <tt class="docutils literal"><span class="pre">counting_iterator&lt;Y,C2,D2&gt;</span></tt> if and only if <tt class="docutils literal"><span class="pre">X</span></tt> is
 interoperable with <tt class="docutils literal"><span class="pre">Y</span></tt>.</p>
 </div>
-<div class="section" id="counting-iterator-operations">
-<h1><a class="toc-backref" href="#id5" name="counting-iterator-operations"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> operations</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id5" id="counting-iterator-operations" name="counting-iterator-operations"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> operations</a></h1>
 <p>In addition to the operations required by the concepts modeled by
 <tt class="docutils literal"><span class="pre">counting_iterator</span></tt>, <tt class="docutils literal"><span class="pre">counting_iterator</span></tt> provides the following
 operations.</p>
@@ -228,6 +519,9 @@
 </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) -->
 <pre class="literal-block">
 template &lt;class Incrementable&gt;
 counting_iterator&lt;Incrementable&gt; make_counting_iterator(Incrementable x);
@@ -241,9 +535,12 @@
 </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) -->
 </div>
-<div class="section" id="example">
-<h1><a class="toc-backref" href="#id6" name="example">Example</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id6" id="example" name="example">Example</a></h1>
 <p>This example fills an array with numbers and a second array with
 pointers into the first array, using <tt class="docutils literal"><span class="pre">counting_iterator</span></tt> for both
 tasks. Finally <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> is used to print out the numbers
@@ -261,7 +558,7 @@
           boost::make_counting_iterator(numbers.end()),
           std::back_inserter(pointers));
 
-std::cout &lt;&lt; &quot;indirectly printing out the numbers from 0 to &quot; 
+std::cout &lt;&lt; &quot;indirectly printing out the numbers from 0 to &quot;
           &lt;&lt; N &lt;&lt; std::endl;
 std::copy(boost::make_indirect_iterator(pointers.begin()),
           boost::make_indirect_iterator(pointers.end()),
@@ -271,15 +568,10 @@
 <p>The output is:</p>
 <pre class="literal-block">
 indirectly printing out the numbers from 0 to 7
-0 1 2 3 4 5 6 
+0 1 2 3 4 5 6
 </pre>
 <p>The source code for this example can be found <a class="reference" href="../example/counting_iterator_example.cpp">here</a>.</p>
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="counting_iterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/counting_iterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/counting_iterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/counting_iterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 +++++++++++++++++++
  Counting Iterator
 +++++++++++++++++++
@@ -7,7 +11,7 @@
 :organization: `Boost Consulting`_, Indiana University `Open Systems
                Lab`_, University of Hanover `Institute for Transport
                Railway Operation and Construction`_
-:date: $Date: 2004/11/01 21:23:47 $
+:date: $Date: 2006/09/11 22:27:29 $
 :copyright: Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. 
 
 .. _`Boost Consulting`: http://www.boost-consulting.com

Modified: boost/trunk/libs/iterator/doc/counting_iterator_abstract.rst
===================================================================
--- boost/trunk/libs/iterator/doc/counting_iterator_abstract.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/counting_iterator_abstract.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 ``counting_iterator`` adapts an object by adding an ``operator*`` that
 returns the current value of the object. All other iterator operations
 are forwarded to the adapted object.

Modified: boost/trunk/libs/iterator/doc/counting_iterator_eg.rst
===================================================================
--- boost/trunk/libs/iterator/doc/counting_iterator_eg.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/counting_iterator_eg.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+.. 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)
 
 Example
 .......

Modified: boost/trunk/libs/iterator/doc/counting_iterator_ref.rst
===================================================================
--- boost/trunk/libs/iterator/doc/counting_iterator_ref.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/counting_iterator_ref.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 ::
 
   template <

Modified: boost/trunk/libs/iterator/doc/default.css
===================================================================
--- boost/trunk/libs/iterator/doc/default.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/default.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,12 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:date: $Date: 2004/01/12 02:49:54 $
-:version: $Revision: 1.2 $
+:date: $Date: 2006/09/29 01:59:16 $
+:version: $Revision: 1.2.10.1 $
 :copyright: This stylesheet has been placed in the public domain.
 
+boostinspect:nolicense
+
 Default cascading style sheet for the HTML output of Docutils.
 */
 

Deleted: boost/trunk/libs/iterator/doc/facade-and-adaptor.diff
===================================================================
--- boost/trunk/libs/iterator/doc/facade-and-adaptor.diff	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/facade-and-adaptor.diff	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,228 +0,0 @@
-Index: facade-and-adaptor.rst
-===================================================================
-RCS file: /cvsroot/boost/boost/libs/iterator/doc/facade-and-adaptor.rst,v
-retrieving revision 1.9
-retrieving revision 1.14
-diff -b -d -u -r1.9 -r1.14
---- facade-and-adaptor.rst	22 Sep 2003 19:55:00 -0000	1.9
-+++ facade-and-adaptor.rst	18 Jan 2004 15:51:06 -0000	1.14
-@@ -3,17 +3,25 @@  None
- +++++++++++++++++++++++++++++
- 
- :Author: David Abrahams, Jeremy Siek, Thomas Witt
--:Contact: dave at boost-consulting.com, jsiek at osl.iu.edu, witt at acm.org
-+:Contact: dave at boost-consulting.com, jsiek at osl.iu.edu, witt at styleadvisor.com
- :organization: `Boost Consulting`_, Indiana University `Open Systems
--               Lab`_, University of Hanover `Institute for Transport
--               Railway Operation and Construction`_
--:date: $Date: 2004/01/18 19:56:39 $
--:Number: N1530=03-0113
-+               Lab`_, `Zephyr Associates, Inc.`_
-+:date: $Date: 2004/01/18 19:56:39 $
-+
-+:Number: This is a revised version of N1530_\ =03-0113, which was
-+         accepted for Technical Report 1 by the C++ standard
-+         committee's library working group.  
-+
-+.. Version 1.9 of this ReStructuredText document corresponds to
-+   n1530_, the paper accepted by the LWG.
-+
-+.. _n1530: http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1530.html
-+
- :copyright: Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. All rights reserved
- 
- .. _`Boost Consulting`: http://www.boost-consulting.com
- .. _`Open Systems Lab`: http://www.osl.iu.edu
--.. _`Institute for Transport Railway Operation and Construction`: http://www.ive.uni-hannover.de
-+.. _`Zephyr Associates, Inc.`: http://www.styleadvisor.com
- 
- :abstract: We propose a set of class templates that help programmers
-            build standard-conforming iterators, both from scratch and
-@@ -124,15 +132,15 @@  None
- =================
- 
- This proposal is formulated in terms of the new ``iterator concepts``
--as proposed in `n1477`_, since user-defined and especially adapted
-+as proposed in n1550_, since user-defined and especially adapted
- iterators suffer from the well known categorization problems that are
- inherent to the current iterator categories.
- 
--.. _`n1477`: http://anubis.dkuug.dk/JTC1/SC22/WG21/docs/papers/2003/n1477.html
-+.. _n1550: http://anubis.dkuug.dk/JTC1/SC22/WG21/docs/papers/2003/n1550.html
- 
--This proposal does not strictly depend on proposal `n1477`_, as there
-+This proposal does not strictly depend on proposal n1550_, as there
- is a direct mapping between new and old categories. This proposal
--could be reformulated using this mapping if `n1477`_ was not accepted.
-+could be reformulated using this mapping if n1550_ was not accepted.
- 
- Interoperability
- ================
-@@ -141,24 +149,24 @@  None
- current standard.  There are currently two defect reports that are
- concerned with interoperability issues.
- 
--Issue `179`_ concerns the fact that mutable container iterator types
-+Issue 179_ concerns the fact that mutable container iterator types
- are only required to be convertible to the corresponding constant
- iterator types, but objects of these types are not required to
- interoperate in comparison or subtraction expressions.  This situation
- is tedious in practice and out of line with the way built in types
- work.  This proposal implements the proposed resolution to issue
--`179`_, as most standard library implementations do nowadays. In other
-+179_, as most standard library implementations do nowadays. In other
- words, if an iterator type A has an implicit or user defined
- conversion to an iterator type B, the iterator types are interoperable
- and the usual set of operators are available.
- 
--Issue `280`_ concerns the current lack of interoperability between
-+Issue 280_ concerns the current lack of interoperability between
- reverse iterator types. The proposed new reverse_iterator template
- fixes the issues raised in 280. It provides the desired
- interoperability without introducing unwanted overloads.
- 
--.. _`179`: http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html#179
--.. _`280`: http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-active.html#280
-+.. _179: http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html#179
-+.. _280: http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-active.html#280
- 
- 
- Iterator Facade
-@@ -195,7 +203,7 @@  None
- * ``filter_iterator``, which provides a view of an iterator range in
-   which some elements of the underlying range are skipped.
- 
--.. _counting_iterator:
-+.. _counting: 
- 
- * ``counting_iterator``, which adapts any incrementable type
-   (e.g. integers, iterators) so that incrementing/decrementing the
-@@ -226,15 +234,13 @@  Issue 9.1 et al
- ::
- 
-   struct use_default;
--  const unsigned use_default_access = -1;
-        
-   struct iterator_core_access { /* implementation detail */ };
-   
-   template <
-       class Derived
-     , class Value
--    , unsigned AccessCategory
--    , class TraversalCategory
-+    , class CategoryOrTraversal
-     , class Reference  = Value&
-     , class Difference = ptrdiff_t
-   >
-@@ -244,8 +250,7 @@  Issue 9.1 et al.
-       class Derived
-     , class Base
-     , class Value      = use_default
--    , unsigned Access  = use_default_access
--    , class Traversal  = use_default
-+    , class CategoryOrTraversal  = use_default
-     , class Reference  = use_default
-     , class Difference = use_default
-   >
-@@ -254,10 +259,9 @@  Issue 9.1 et al.
-   template <
-       class Iterator
-     , class Value = use_default
--    , unsigned Access  = use_default_access
--    , class Traversal  = use_default
-+    , class CategoryOrTraversal = use_default
-     , class Reference = use_default
-     , class Difference = use_default
-   >
-   class indirect_iterator;
-   
-Issue 9.44y
-
-+  template <class Dereferenceable>
-+  struct pointee;
-+
-+  template <class Dereferenceable>
-+  struct indirect_reference;
-+
-   template <class Iterator>
-   class reverse_iterator;
- 
-@@ -277,8 +287,7 @@  Issue 9.1 et al.
- 
-   template <
-       class Incrementable
--    , unsigned Access  = use_default_access
--    , class Traversal  = use_default
-+    , class CategoryOrTraversal  = use_default
-     , class Difference = use_default
-   >
-   class counting_iterator
-@@ -312,17 +321,35 @@  Issue 9.8
- Specialized adaptors [lib.iterator.special.adaptors]
- ====================================================
- 
--.. The requirements for all of these need to be written *much* more
--   formally -DWA
--
- 
--[*Note:* The ``enable_if_convertible<X,Y>::type`` expression used in
-+The ``enable_if_convertible<X,Y>::type`` expression used in
- this section is for exposition purposes. The converting constructors
- for specialized adaptors should be only be in an overload set provided
- that an object of type ``X`` is implicitly convertible to an object of
--type ``Y``.  The ``enable_if_convertible`` approach uses SFINAE to
-+type ``Y``.  
-+The signatures involving ``enable_if_convertible`` should behave
-+*as-if* ``enable_if_convertible`` were defined to be::
-+
-+  template <bool> enable_if_convertible_impl
-+  {};
-+
-+  template <> enable_if_convertible_impl<true>
-+  { struct type; };
-+
-+  template<typename From, typename To>
-+  struct enable_if_convertible
-+    : enable_if_convertible_impl<is_convertible<From,To>::value>
-+  {};
-+
-+If an expression other than the default argument is used to supply
-+the value of a function parameter whose type is written in terms
-+of ``enable_if_convertible``, the program is ill-formed, no
-+diagnostic required.
-+
-+[*Note:* The ``enable_if_convertible`` approach uses SFINAE to
- take the constructor out of the overload set when the types are not
--implicitly convertible.]
-+implicitly convertible.  
-+]
- 
- 
- Indirect iterator
-@@ -330,6 +357,16 @@  Issue 9.44y
- 
- .. include:: indirect_iterator_abstract.rst
- 
-+Class template ``pointee``
-+....................................
-+
-+.. include:: pointee_ref.rst
-+
-+Class template ``indirect_reference``
-+.....................................
-+
-+.. include:: indirect_reference_ref.rst
-+
- Class template ``indirect_iterator``
- ....................................
- 
-@@ -393,8 +430,7 @@
- 
- 
- 
--..
-- LocalWords:  Abrahams Siek Witt istream ostream iter MTL strided interoperate
-+.. LocalWords:  Abrahams Siek Witt istream ostream iter MTL strided interoperate
-  LocalWords:  CRTP metafunctions inlining lvalue JGS incrementable BGL LEDA cv
-  LocalWords:  GraphBase struct ptrdiff UnaryFunction const int typename bool pp
-  LocalWords:  lhs rhs SFINAE markup iff tmp OtherDerived OtherIterator DWA foo

Modified: boost/trunk/libs/iterator/doc/facade-and-adaptor.html
===================================================================
--- boost/trunk/libs/iterator/doc/facade-and-adaptor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/facade-and-adaptor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,12 +3,294 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Iterator Facade and Adaptor</title>
 <meta name="author" content="David Abrahams, Jeremy Siek, Thomas Witt" />
 <meta name="organization" content="Boost Consulting, Indiana University Open Systems Lab, Zephyr Associates, Inc." />
 <meta name="date" content="2004-11-01" />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:28 $
+:Revision: $Revision: 1.64.2.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="iterator-facade-and-adaptor">
@@ -32,6 +314,9 @@
 </tr>
 </tbody>
 </table>
+<!-- Distributed under the Boost -->
+<!-- Software License, Version 1.0. (See accompanying -->
+<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <!-- Version 1.9 of this ReStructuredText document corresponds to
 n1530_, the paper accepted by the LWG. -->
 <table class="docutils field-list" frame="void" rules="none">
@@ -52,8 +337,8 @@
 </tr>
 </tbody>
 </table>
-<div class="contents topic" id="table-of-contents">
-<p class="topic-title first"><a name="table-of-contents">Table of Contents</a></p>
+<div class="contents topic">
+<p class="topic-title first"><a id="table-of-contents" name="table-of-contents">Table of Contents</a></p>
 <ul class="simple">
 <li><a class="reference" href="#motivation" id="id15" name="id15">Motivation</a></li>
 <li><a class="reference" href="#impact-on-the-standard" id="id16" name="id16">Impact on the Standard</a></li>
@@ -140,8 +425,8 @@
 </li>
 </ul>
 </div>
-<div class="section" id="motivation">
-<h1><a class="toc-backref" href="#id15" name="motivation">Motivation</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id15" id="motivation" name="motivation">Motivation</a></h1>
 <p>Iterators play an important role in modern C++ programming. The
 iterator is the central abstraction of the algorithms of the Standard
 Library, allowing algorithms to be re-used in in a wide variety of
@@ -225,16 +510,16 @@
 applies some user-specified function during the dereference of the
 iterator.</p>
 </div>
-<div class="section" id="impact-on-the-standard">
-<h1><a class="toc-backref" href="#id16" name="impact-on-the-standard">Impact on the Standard</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id16" id="impact-on-the-standard" name="impact-on-the-standard">Impact on the Standard</a></h1>
 <p>This proposal is purely an addition to the C++ standard library.
 However, note that this proposal relies on the proposal for New
 Iterator Concepts.</p>
 </div>
-<div class="section" id="design">
-<h1><a class="toc-backref" href="#id17" name="design">Design</a></h1>
-<div class="section" id="iterator-concepts">
-<h2><a class="toc-backref" href="#id18" name="iterator-concepts">Iterator Concepts</a></h2>
+<div class="section">
+<h1><a class="toc-backref" href="#id17" id="design" name="design">Design</a></h1>
+<div class="section">
+<h2><a class="toc-backref" href="#id18" id="iterator-concepts" name="iterator-concepts">Iterator Concepts</a></h2>
 <p>This proposal is formulated in terms of the new <tt class="docutils literal"><span class="pre">iterator</span> <span class="pre">concepts</span></tt>
 as proposed in <a class="reference" href="http://anubis.dkuug.dk/JTC1/SC22/WG21/docs/papers/2003/n1550.html">n1550</a>, since user-defined and especially adapted
 iterators suffer from the well known categorization problems that are
@@ -243,8 +528,8 @@
 is a direct mapping between new and old categories. This proposal
 could be reformulated using this mapping if <a class="reference" href="http://anubis.dkuug.dk/JTC1/SC22/WG21/docs/papers/2003/n1550.html">n1550</a> was not accepted.</p>
 </div>
-<div class="section" id="interoperability">
-<h2><a class="toc-backref" href="#id19" name="interoperability">Interoperability</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id19" id="interoperability" name="interoperability">Interoperability</a></h2>
 <p>The question of iterator interoperability is poorly addressed in the
 current standard.  There are currently two defect reports that are
 concerned with interoperability issues.</p>
@@ -263,11 +548,14 @@
 fixes the issues raised in 280. It provides the desired
 interoperability without introducing unwanted overloads.</p>
 </div>
-<div class="section" id="iterator-facade">
-<h2><a class="toc-backref" href="#id20" name="iterator-facade">Iterator Facade</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id20" id="iterator-facade" name="iterator-facade">Iterator Facade</a></h2>
+<!-- Distributed under the Boost -->
+<!-- Software License, Version 1.0. (See accompanying -->
+<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <!-- Version 1.1 of this ReStructuredText document corresponds to
 n1530_, the paper accepted by the LWG for TR1. -->
-<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.  -->
+<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. -->
 <p>While the iterator interface is rich, there is a core subset of the
 interface that is necessary for all the functionality.  We have
 identified the following core behaviors for iterators:</p>
@@ -307,8 +595,8 @@
 impossible.</li>
 </ol>
 </blockquote>
-<div class="section" id="usage">
-<h3><a class="toc-backref" href="#id21" name="usage">Usage</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id21" id="usage" name="usage">Usage</a></h3>
 <p>The user of <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> derives his iterator class from a
 specialization of <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> and passes the derived
 iterator class as <tt class="docutils literal"><span class="pre">iterator_facade</span></tt>'s first template parameter.
@@ -331,8 +619,8 @@
 <col width="56%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th>Expression</th>
-<th>Effects</th>
+<tr><th class="head">Expression</th>
+<th class="head">Effects</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -371,8 +659,8 @@
 Iterator or a more-refined iterator concept, a default constructor is
 required.</p>
 </div>
-<div class="section" id="iterator-core-access">
-<h3><a class="toc-backref" href="#id22" name="iterator-core-access">Iterator Core Access</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id22" id="iterator-core-access" name="iterator-core-access">Iterator Core Access</a></h3>
 <p><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> and the operator implementations need to be able
 to access the core member functions in the derived class.  Making the
 core member functions public would expose an implementation detail to
@@ -395,7 +683,7 @@
 in the derived iterator class.  The author of the derived class only
 needs to grant friendship to <tt class="docutils literal"><span class="pre">iterator_core_access</span></tt> to make his core
 member functions available to the library.</p>
-<!-- This is no long uptodate -thw  -->
+<!-- This is no long uptodate -thw -->
 <!-- Yes it is; I made sure of it! -DWA -->
 <p><tt class="docutils literal"><span class="pre">iterator_core_access</span></tt> will be typically implemented as an empty
 class containing only private static member functions which invoke the
@@ -405,8 +693,8 @@
 open a safety loophole, as every core member function preserves the
 invariants of the iterator.</p>
 </div>
-<div class="section" id="operator">
-<h3><a class="toc-backref" href="#id23" name="operator"><tt class="docutils literal"><span class="pre">operator[]</span></tt></a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id23" id="operator" name="operator"><tt class="docutils literal"><span class="pre">operator[]</span></tt></a></h3>
 <p>The indexing operator for a generalized iterator presents special
 challenges.  A random access iterator's <tt class="docutils literal"><span class="pre">operator[]</span></tt> is only
 required to return something convertible to its <tt class="docutils literal"><span class="pre">value_type</span></tt>.
@@ -428,8 +716,8 @@
 class; it will hide the one supplied by <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> from
 clients of her iterator.</p>
 </div>
-<div class="section" id="id6">
-<h3><a class="toc-backref" href="#id24" name="id6"><span class="target" id="operator-arrow"></span><tt class="docutils literal"><span class="pre">operator-&gt;</span></tt></a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id24" id="id6" name="id6"><span id="operator-arrow"></span><tt class="docutils literal"><span class="pre">operator-&gt;</span></tt></a></h3>
 <p>The <tt class="docutils literal"><span class="pre">reference</span></tt> type of a readable iterator (and today's input
 iterator) need not in fact be a reference, so long as it is
 convertible to the iterator's <tt class="docutils literal"><span class="pre">value_type</span></tt>.  When the <tt class="docutils literal"><span class="pre">value_type</span></tt>
@@ -450,11 +738,14 @@
 </table>
 </div>
 </div>
-<div class="section" id="iterator-adaptor">
-<h2><a class="toc-backref" href="#id25" name="iterator-adaptor">Iterator Adaptor</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id25" id="iterator-adaptor" name="iterator-adaptor">Iterator Adaptor</a></h2>
+<!-- Distributed under the Boost -->
+<!-- Software License, Version 1.0. (See accompanying -->
+<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <!-- Version 1.2 of this ReStructuredText document corresponds to
 n1530_, the paper accepted by the LWG for TR1. -->
-<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.  -->
+<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. -->
 <p>The <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> class template adapts some <tt class="docutils literal"><span class="pre">Base</span></tt> <a class="footnote-reference" href="#base" id="id7" name="id7">[3]</a>
 type to create a new iterator.  Instantiations of <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt>
 are derived from a corresponding instantiation of <tt class="docutils literal"><span class="pre">iterator_facade</span></tt>
@@ -491,8 +782,8 @@
 <tt class="docutils literal"><span class="pre">reference</span></tt> type, and will keep users from making mistakes based on
 that assumption.</p>
 </div>
-<div class="section" id="specialized-adaptors">
-<h2><a class="toc-backref" href="#id26" name="specialized-adaptors">Specialized Adaptors</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id26" id="specialized-adaptors" name="specialized-adaptors">Specialized Adaptors</a></h2>
 <p>This proposal also contains several examples of specialized adaptors
 which were easily implemented using <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt>:</p>
 <ul class="simple">
@@ -507,7 +798,7 @@
 <li><tt class="docutils literal"><span class="pre">filter_iterator</span></tt>, which provides a view of an iterator range in
 which some elements of the underlying range are skipped.</li>
 </ul>
-<span class="target" id="counting"></span><ul class="simple">
+<ul class="simple" id="counting">
 <li><tt class="docutils literal"><span class="pre">counting_iterator</span></tt>, which adapts any incrementable type
 (e.g. integers, iterators) so that incrementing/decrementing the
 adapted iterator and dereferencing it produces successive values of
@@ -525,10 +816,10 @@
 Standard compliant iterators).</p>
 </div>
 </div>
-<div class="section" id="proposed-text">
-<h1><a class="toc-backref" href="#id27" name="proposed-text">Proposed Text</a></h1>
-<div class="section" id="header-iterator-helper-synopsis-lib-iterator-helper-synopsis">
-<h2><a class="toc-backref" href="#id28" name="header-iterator-helper-synopsis-lib-iterator-helper-synopsis">Header <tt class="docutils literal"><span class="pre">&lt;iterator_helper&gt;</span></tt> synopsis    [lib.iterator.helper.synopsis]</a></h2>
+<div class="section">
+<h1><a class="toc-backref" href="#id27" id="proposed-text" name="proposed-text">Proposed Text</a></h1>
+<div class="section">
+<h2><a class="toc-backref" href="#id28" id="header-iterator-helper-synopsis-lib-iterator-helper-synopsis" name="header-iterator-helper-synopsis-lib-iterator-helper-synopsis">Header <tt class="docutils literal"><span class="pre">&lt;iterator_helper&gt;</span></tt> synopsis    [lib.iterator.helper.synopsis]</a></h2>
 <pre class="literal-block">
 struct use_default;
 
@@ -593,16 +884,22 @@
 class function_output_iterator;
 </pre>
 </div>
-<div class="section" id="iterator-facade-lib-iterator-facade">
-<h2><a class="toc-backref" href="#id29" name="iterator-facade-lib-iterator-facade">Iterator facade [lib.iterator.facade]</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id29" id="iterator-facade-lib-iterator-facade" name="iterator-facade-lib-iterator-facade">Iterator facade [lib.iterator.facade]</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><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> is a base class template that implements the
 interface of standard iterators in terms of a few core functions
 and associated types, to be supplied by a derived iterator class.</p>
-<div class="section" id="class-template-iterator-facade">
-<h3><a class="toc-backref" href="#id30" name="class-template-iterator-facade">Class template <tt class="docutils literal"><span class="pre">iterator_facade</span></tt></a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id30" id="class-template-iterator-facade" name="class-template-iterator-facade">Class template <tt class="docutils literal"><span class="pre">iterator_facade</span></tt></a></h3>
+<!-- Distributed under the Boost -->
+<!-- Software License, Version 1.0. (See accompanying -->
+<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <!-- Version 1.3 of this ReStructuredText document corresponds to
 n1530_, the paper accepted by the LWG for TR1. -->
-<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.  -->
+<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. -->
 <pre class="literal-block">
 template &lt;
     class Derived
@@ -686,12 +983,12 @@
 Derived operator+ (typename Derived::difference_type n,
                    iterator_facade&lt;Dr,V,TC,R,D&gt; const&amp;);
 </pre>
-<span class="target" id="iterator-category"></span><p>The <tt class="docutils literal"><span class="pre">iterator_category</span></tt> member of <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> is</p>
+<p id="iterator-category">The <tt class="docutils literal"><span class="pre">iterator_category</span></tt> member of <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> is</p>
 <pre class="literal-block">
 <em>iterator-category</em>(CategoryOrTraversal, value_type, reference)
 </pre>
 <p>where <em>iterator-category</em> is defined as follows:</p>
-<span class="target" id="id12"></span><pre class="literal-block">
+<pre class="literal-block" id="id12">
 <em>iterator-category</em>(C,R,V) :=
    if (C is convertible to std::input_iterator_tag
        || C is convertible to std::output_iterator_tag
@@ -738,10 +1035,10 @@
 <!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <p>The <tt class="docutils literal"><span class="pre">enable_if_interoperable</span></tt> template used above is for exposition
 purposes.  The member operators should only be in an overload set
-provided the derived types <tt class="docutils literal"><span class="pre">Dr1</span></tt> and <tt class="docutils literal"><span class="pre">Dr2</span></tt> are interoperable, 
+provided the derived types <tt class="docutils literal"><span class="pre">Dr1</span></tt> and <tt class="docutils literal"><span class="pre">Dr2</span></tt> are interoperable,
 meaning that at least one of the types is convertible to the other.  The
 <tt class="docutils literal"><span class="pre">enable_if_interoperable</span></tt> approach uses SFINAE to take the operators
-out of the overload set when the types are not interoperable.  
+out of the overload set when the types are not interoperable.
 The operators should behave <em>as-if</em> <tt class="docutils literal"><span class="pre">enable_if_interoperable</span></tt>
 were defined to be:</p>
 <pre class="literal-block">
@@ -760,8 +1057,8 @@
 {};
 </pre>
 </div>
-<div class="section" id="iterator-facade-requirements">
-<h3><a class="toc-backref" href="#id31" name="iterator-facade-requirements"><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> Requirements</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id31" id="iterator-facade-requirements" name="iterator-facade-requirements"><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> Requirements</a></h3>
 <p>The following table describes the typical valid expressions on
 <tt class="docutils literal"><span class="pre">iterator_facade</span></tt>'s <tt class="docutils literal"><span class="pre">Derived</span></tt> parameter, depending on the
 iterator concept(s) it will model.  The operations in the first
@@ -774,8 +1071,8 @@
 object of a single pass iterator type interoperable with <tt class="docutils literal"><span class="pre">X</span></tt>, and <tt class="docutils literal"><span class="pre">z</span></tt>
 is a constant object of a random access traversal iterator type
 interoperable with <tt class="docutils literal"><span class="pre">X</span></tt>.</p>
-<span class="target" id="core-operations"></span><div class="topic">
-<p class="topic-title first"><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> Core Operations</p>
+<div class="topic">
+<p class="topic-title first"><a id="core-operations" name="core-operations"><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> Core Operations</a></p>
 <table border="1" class="docutils">
 <colgroup>
 <col width="21%" />
@@ -784,10 +1081,10 @@
 <col width="29%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Assertion/Note</th>
-<th>Used to implement Iterator
+<tr><th class="head">Expression</th>
+<th class="head">Return Type</th>
+<th class="head">Assertion/Note</th>
+<th class="head">Used to implement Iterator
 Concept(s)</th>
 </tr>
 </thead>
@@ -834,8 +1131,8 @@
 </table>
 </div>
 </div>
-<div class="section" id="iterator-facade-operations">
-<h3><a class="toc-backref" href="#id32" name="iterator-facade-operations"><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> operations</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id32" id="iterator-facade-operations" name="iterator-facade-operations"><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> operations</a></h3>
 <p>The operations in this section are described in terms of operations on
 the core interface of <tt class="docutils literal"><span class="pre">Derived</span></tt> which may be inaccessible
 (i.e. private).  The implementation should access these operations
@@ -859,14 +1156,14 @@
 <pre class="literal-block">
 &amp;static_cast&lt;Derived const*&gt;(this)-&gt;dereference()
 </pre>
-<p class="last">Otherwise returns an object of unspecified type such that, 
+<p class="last">Otherwise returns an object of unspecified type such that,
 <tt class="docutils literal"><span class="pre">(*static_cast&lt;Derived</span> <span class="pre">const*&gt;(this))-&gt;m</span></tt> is equivalent to <tt class="docutils literal"><span class="pre">(w</span> <span class="pre">=</span> <span class="pre">**static_cast&lt;Derived</span> <span class="pre">const*&gt;(this),</span>
 <span class="pre">w.m)</span></tt> for some temporary object <tt class="docutils literal"><span class="pre">w</span></tt> of type <tt class="docutils literal"><span class="pre">value_type</span></tt>.</p>
 </td>
 </tr>
 </tbody>
 </table>
-<span class="target" id="brackets"></span><p><em>unspecified</em> <tt class="docutils literal"><span class="pre">operator[](difference_type</span> <span class="pre">n)</span> <span class="pre">const;</span></tt></p>
+<p id="brackets"><em>unspecified</em> <tt class="docutils literal"><span class="pre">operator[](difference_type</span> <span class="pre">n)</span> <span class="pre">const;</span></tt></p>
 <table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
@@ -1007,10 +1304,12 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
 <dl class="last docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).equal((Dr2</span> <span class="pre">const&amp;)rhs)</span></tt>.</dd>
-<dt>Otherwise, </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).equal((Dr1</span> <span class="pre">const&amp;)lhs)</span></tt>.</dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).equal((Dr2</span> <span class="pre">const&amp;)rhs)</span></tt>.</p>
+</dd>
+<dt>Otherwise,</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).equal((Dr1</span> <span class="pre">const&amp;)lhs)</span></tt>.</p>
+</dd>
 </dl>
 </td>
 </tr>
@@ -1029,10 +1328,12 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
 <dl class="last docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">!((Dr1</span> <span class="pre">const&amp;)lhs).equal((Dr2</span> <span class="pre">const&amp;)rhs)</span></tt>.</dd>
-<dt>Otherwise, </dt>
-<dd><tt class="docutils literal"><span class="pre">!((Dr2</span> <span class="pre">const&amp;)rhs).equal((Dr1</span> <span class="pre">const&amp;)lhs)</span></tt>.</dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">!((Dr1</span> <span class="pre">const&amp;)lhs).equal((Dr2</span> <span class="pre">const&amp;)rhs)</span></tt>.</p>
+</dd>
+<dt>Otherwise,</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">!((Dr2</span> <span class="pre">const&amp;)rhs).equal((Dr1</span> <span class="pre">const&amp;)lhs)</span></tt>.</p>
+</dd>
 </dl>
 </td>
 </tr>
@@ -1051,10 +1352,12 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
 <dl class="last docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&lt;</span> <span class="pre">0</span></tt>.</dd>
-<dt>Otherwise, </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&gt;</span> <span class="pre">0</span></tt>.</dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&lt;</span> <span class="pre">0</span></tt>.</p>
+</dd>
+<dt>Otherwise,</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&gt;</span> <span class="pre">0</span></tt>.</p>
+</dd>
 </dl>
 </td>
 </tr>
@@ -1073,10 +1376,12 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
 <dl class="last docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&lt;=</span> <span class="pre">0</span></tt>.</dd>
-<dt>Otherwise, </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&gt;=</span> <span class="pre">0</span></tt>.</dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&lt;=</span> <span class="pre">0</span></tt>.</p>
+</dd>
+<dt>Otherwise,</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&gt;=</span> <span class="pre">0</span></tt>.</p>
+</dd>
 </dl>
 </td>
 </tr>
@@ -1095,10 +1400,12 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
 <dl class="last docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&gt;</span> <span class="pre">0</span></tt>.</dd>
-<dt>Otherwise, </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&lt;</span> <span class="pre">0</span></tt>.</dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&gt;</span> <span class="pre">0</span></tt>.</p>
+</dd>
+<dt>Otherwise,</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&lt;</span> <span class="pre">0</span></tt>.</p>
+</dd>
 </dl>
 </td>
 </tr>
@@ -1117,16 +1424,18 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
 <dl class="last docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&gt;=</span> <span class="pre">0</span></tt>.</dd>
-<dt>Otherwise, </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&lt;=</span> <span class="pre">0</span></tt>.</dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&gt;=</span> <span class="pre">0</span></tt>.</p>
+</dd>
+<dt>Otherwise,</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&lt;=</span> <span class="pre">0</span></tt>.</p>
+</dd>
 </dl>
 </td>
 </tr>
 </tbody>
 </table>
-<span class="target" id="minus"></span><pre class="literal-block">
+<pre class="literal-block" id="minus">
 template &lt;class Dr1, class V1, class TC1, class R1, class D1,
           class Dr2, class V2, class TC2, class R2, class D2&gt;
 typename enable_if_interoperable&lt;Dr1,Dr2,difference&gt;::type
@@ -1138,23 +1447,27 @@
 <col class="field-body" />
 <tbody valign="top">
 <tr class="field"><th class="field-name">Return Type:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
-<blockquote class="last">
+<blockquote>
 <dl class="docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">difference</span></tt> shall be
-<tt class="docutils literal"><span class="pre">iterator_traits&lt;Dr1&gt;::difference_type</span></tt>.</dd>
-<dt>Otherwise </dt>
-<dd><tt class="docutils literal"><span class="pre">difference</span></tt> shall be <tt class="docutils literal"><span class="pre">iterator_traits&lt;Dr2&gt;::difference_type</span></tt></dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">difference</span></tt> shall be
+<tt class="docutils literal"><span class="pre">iterator_traits&lt;Dr1&gt;::difference_type</span></tt>.</p>
+</dd>
+<dt>Otherwise</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">difference</span></tt> shall be <tt class="docutils literal"><span class="pre">iterator_traits&lt;Dr2&gt;::difference_type</span></tt></p>
+</dd>
 </dl>
 </blockquote>
 </td>
 </tr>
 <tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
 <dl class="last docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">-((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span></tt>.</dd>
-<dt>Otherwise, </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span></tt>.</dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">-((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span></tt>.</p>
+</dd>
+<dt>Otherwise,</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span></tt>.</p>
+</dd>
 </dl>
 </td>
 </tr>
@@ -1162,11 +1475,14 @@
 </table>
 </div>
 </div>
-<div class="section" id="iterator-adaptor-lib-iterator-adaptor">
-<h2><a class="toc-backref" href="#id33" name="iterator-adaptor-lib-iterator-adaptor">Iterator adaptor [lib.iterator.adaptor]</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id33" id="iterator-adaptor-lib-iterator-adaptor" name="iterator-adaptor-lib-iterator-adaptor">Iterator adaptor [lib.iterator.adaptor]</a></h2>
+<!-- Distributed under the Boost -->
+<!-- Software License, Version 1.0. (See accompanying -->
+<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <!-- Version 1.1 of this ReStructuredText document corresponds to
 n1530_, the paper accepted by the LWG. -->
-<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.  -->
+<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. -->
 <p>Each specialization of the <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> class template is derived from
 a specialization of <tt class="docutils literal"><span class="pre">iterator_facade</span></tt>. The core interface functions
 expected by <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> are implemented in terms of the
@@ -1177,11 +1493,14 @@
 depends on the operations supported by the <tt class="docutils literal"><span class="pre">Base</span></tt> type and which
 core interface functions of <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> are redefined in the
 <tt class="docutils literal"><span class="pre">Derived</span></tt> class.</p>
-<div class="section" id="class-template-iterator-adaptor">
-<h3><a class="toc-backref" href="#id34" name="class-template-iterator-adaptor">Class template <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt></a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id34" id="class-template-iterator-adaptor" name="class-template-iterator-adaptor">Class template <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt></a></h3>
+<!-- Distributed under the Boost -->
+<!-- Software License, Version 1.0. (See accompanying -->
+<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <!-- Version 1.4 of this ReStructuredText document corresponds to
 n1530_, the paper accepted by the LWG for TR1. -->
-<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.  -->
+<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. -->
 <pre class="literal-block">
 template &lt;
     class Derived
@@ -1191,7 +1510,7 @@
   , class Reference           = use_default
   , class Difference = use_default
 &gt;
-class iterator_adaptor 
+class iterator_adaptor
   : public iterator_facade&lt;Derived, <em>V'</em>, <em>C'</em>, <em>R'</em>, <em>D'</em>&gt; // see <a class="reference" href="#base-parameters">details</a>
 {
     friend class iterator_core_access;
@@ -1204,12 +1523,12 @@
     typedef iterator_adaptor iterator_adaptor_;
     Base const&amp; base_reference() const;
     Base&amp; base_reference();
- private: // Core iterator interface for iterator_facade.  
+ private: // Core iterator interface for iterator_facade.
     typename iterator_adaptor::reference dereference() const;
 
     template &lt;
     class OtherDerived, class OtherIterator, class V, class C, class R, class D
-    &gt;   
+    &gt;
     bool equal(iterator_adaptor&lt;OtherDerived, OtherIterator, V, C, R, D&gt; const&amp; x) const;
 
     void advance(typename iterator_adaptor::difference_type n);
@@ -1218,7 +1537,7 @@
 
     template &lt;
         class OtherDerived, class OtherIterator, class V, class C, class R, class D
-    &gt;   
+    &gt;
     typename iterator_adaptor::difference_type distance_to(
         iterator_adaptor&lt;OtherDerived, OtherIterator, V, C, R, D&gt; const&amp; y) const;
 
@@ -1227,13 +1546,13 @@
 };
 </pre>
 </div>
-<div class="section" id="iterator-adaptor-requirements">
-<h3><a class="toc-backref" href="#id35" name="iterator-adaptor-requirements"><span class="target" id="requirements"></span><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> requirements</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id35" id="iterator-adaptor-requirements" name="iterator-adaptor-requirements"><span id="requirements"></span><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> requirements</a></h3>
 <p><tt class="docutils literal"><span class="pre">static_cast&lt;Derived*&gt;(iterator_adaptor*)</span></tt> shall be well-formed.
 The <tt class="docutils literal"><span class="pre">Base</span></tt> argument shall be Assignable and Copy Constructible.</p>
 </div>
-<div class="section" id="iterator-adaptor-base-class-parameters">
-<h3><a class="toc-backref" href="#id36" name="iterator-adaptor-base-class-parameters"><span class="target" id="base-parameters"></span><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> base class parameters</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id36" id="iterator-adaptor-base-class-parameters" name="iterator-adaptor-base-class-parameters"><span id="base-parameters"></span><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> base class parameters</a></h3>
 <p>The <em>V'</em>, <em>C'</em>, <em>R'</em>, and <em>D'</em> parameters of the <tt class="docutils literal"><span class="pre">iterator_facade</span></tt>
 used as a base class in the summary of <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt>
 above are defined as follows:</p>
@@ -1273,8 +1592,8 @@
 <!-- The above is confusing and needs a rewrite. -JGS -->
 <!-- That's why it's removed.  We're embracing inheritance, remember? -->
 </div>
-<div class="section" id="iterator-adaptor-public-operations">
-<h3><a class="toc-backref" href="#id37" name="iterator-adaptor-public-operations"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> public operations</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id37" id="iterator-adaptor-public-operations" name="iterator-adaptor-public-operations"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> public operations</a></h3>
 <p><tt class="docutils literal"><span class="pre">iterator_adaptor();</span></tt></p>
 <table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
@@ -1282,7 +1601,7 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Requires:</th><td class="field-body">The <tt class="docutils literal"><span class="pre">Base</span></tt> type must be Default Constructible.</td>
 </tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> with 
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> with
 <tt class="docutils literal"><span class="pre">m_iterator</span></tt> default constructed.</td>
 </tr>
 </tbody>
@@ -1307,8 +1626,8 @@
 </tbody>
 </table>
 </div>
-<div class="section" id="iterator-adaptor-protected-member-functions">
-<h3><a class="toc-backref" href="#id38" name="iterator-adaptor-protected-member-functions"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> protected member functions</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id38" id="iterator-adaptor-protected-member-functions" name="iterator-adaptor-protected-member-functions"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> protected member functions</a></h3>
 <p><tt class="docutils literal"><span class="pre">Base</span> <span class="pre">const&amp;</span> <span class="pre">base_reference()</span> <span class="pre">const;</span></tt></p>
 <table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
@@ -1328,8 +1647,8 @@
 </tbody>
 </table>
 </div>
-<div class="section" id="iterator-adaptor-private-member-functions">
-<h3><a class="toc-backref" href="#id39" name="iterator-adaptor-private-member-functions"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> private member functions</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id39" id="iterator-adaptor-private-member-functions" name="iterator-adaptor-private-member-functions"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> private member functions</a></h3>
 <p><tt class="docutils literal"><span class="pre">typename</span> <span class="pre">iterator_adaptor::reference</span> <span class="pre">dereference()</span> <span class="pre">const;</span></tt></p>
 <table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
@@ -1342,7 +1661,7 @@
 <pre class="literal-block">
 template &lt;
 class OtherDerived, class OtherIterator, class V, class C, class R, class D
-&gt;   
+&gt;
 bool equal(iterator_adaptor&lt;OtherDerived, OtherIterator, V, C, R, D&gt; const&amp; x) const;
 </pre>
 <table class="docutils field-list" frame="void" rules="none">
@@ -1383,7 +1702,7 @@
 <pre class="literal-block">
 template &lt;
     class OtherDerived, class OtherIterator, class V, class C, class R, class D
-&gt;   
+&gt;
 typename iterator_adaptor::difference_type distance_to(
     iterator_adaptor&lt;OtherDerived, OtherIterator, V, C, R, D&gt; const&amp; y) const;
 </pre>
@@ -1397,13 +1716,13 @@
 </table>
 </div>
 </div>
-<div class="section" id="specialized-adaptors-lib-iterator-special-adaptors">
-<h2><a class="toc-backref" href="#id40" name="specialized-adaptors-lib-iterator-special-adaptors">Specialized adaptors [lib.iterator.special.adaptors]</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id40" id="specialized-adaptors-lib-iterator-special-adaptors" name="specialized-adaptors-lib-iterator-special-adaptors">Specialized adaptors [lib.iterator.special.adaptors]</a></h2>
 <p>The <tt class="docutils literal"><span class="pre">enable_if_convertible&lt;X,Y&gt;::type</span></tt> expression used in
 this section is for exposition purposes. The converting constructors
 for specialized adaptors should be only be in an overload set provided
 that an object of type <tt class="docutils literal"><span class="pre">X</span></tt> is implicitly convertible to an object of
-type <tt class="docutils literal"><span class="pre">Y</span></tt>.  
+type <tt class="docutils literal"><span class="pre">Y</span></tt>.
 The signatures involving <tt class="docutils literal"><span class="pre">enable_if_convertible</span></tt> should behave
 <em>as-if</em> <tt class="docutils literal"><span class="pre">enable_if_convertible</span></tt> were defined to be:</p>
 <pre class="literal-block">
@@ -1424,10 +1743,13 @@
 diagnostic required.</p>
 <p>[<em>Note:</em> The <tt class="docutils literal"><span class="pre">enable_if_convertible</span></tt> approach uses SFINAE to
 take the constructor out of the overload set when the types are not
-implicitly convertible.  
+implicitly convertible.
 ]</p>
-<div class="section" id="indirect-iterator">
-<h3><a class="toc-backref" href="#id41" name="indirect-iterator">Indirect iterator</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id41" id="indirect-iterator" name="indirect-iterator">Indirect iterator</a></h3>
+<!-- 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><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> adapts an iterator by applying an
 <em>extra</em> dereference inside of <tt class="docutils literal"><span class="pre">operator*()</span></tt>. For example, this
 iterator adaptor makes it possible to view a container of pointers
@@ -1436,8 +1758,8 @@
 auxiliary traits, <tt class="docutils literal"><span class="pre">pointee</span></tt> and <tt class="docutils literal"><span class="pre">indirect_reference</span></tt>, to
 provide support for underlying iterators whose <tt class="docutils literal"><span class="pre">value_type</span></tt> is
 not an iterator.</p>
-<div class="section" id="class-template-pointee">
-<h4><a class="toc-backref" href="#id42" name="class-template-pointee">Class template <tt class="docutils literal"><span class="pre">pointee</span></tt></a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id42" id="class-template-pointee" name="class-template-pointee">Class template <tt class="docutils literal"><span class="pre">pointee</span></tt></a></h4>
 <!-- Copyright David Abrahams 2004. Use, modification and distribution is -->
 <!-- subject to the Boost Software License, Version 1.0. (See accompanying -->
 <!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
@@ -1480,8 +1802,8 @@
 }
 </pre>
 </div>
-<div class="section" id="class-template-indirect-reference">
-<h4><a class="toc-backref" href="#id43" name="class-template-indirect-reference">Class template <tt class="docutils literal"><span class="pre">indirect_reference</span></tt></a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id43" id="class-template-indirect-reference" name="class-template-indirect-reference">Class template <tt class="docutils literal"><span class="pre">indirect_reference</span></tt></a></h4>
 <!-- Copyright David Abrahams 2004. Use, modification and distribution is -->
 <!-- subject to the Boost Software License, Version 1.0. (See accompanying -->
 <!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
@@ -1515,8 +1837,11 @@
     std::iterator_traits&lt;Dereferenceable&gt;::reference
 </pre>
 </div>
-<div class="section" id="class-template-indirect-iterator">
-<h4><a class="toc-backref" href="#id44" name="class-template-indirect-iterator">Class template <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt></a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id44" id="class-template-indirect-iterator" name="class-template-indirect-iterator">Class template <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt></a></h4>
+<!-- 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) -->
 <pre class="literal-block">
 template &lt;
     class Iterator
@@ -1573,9 +1898,9 @@
 else
     typedef Reference reference;
 
-if (Value is use_default) then 
+if (Value is use_default) then
     typedef pointee&lt;V&gt;::type* pointer;
-else 
+else
     typedef Value* pointer;
 
 if (Difference is use_default)
@@ -1593,8 +1918,8 @@
     ) iterator_category;
 </pre>
 </div>
-<div class="section" id="indirect-iterator-requirements">
-<h4><a class="toc-backref" href="#id45" name="indirect-iterator-requirements"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> requirements</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id45" id="indirect-iterator-requirements" name="indirect-iterator-requirements"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> requirements</a></h4>
 <p>The expression <tt class="docutils literal"><span class="pre">*v</span></tt>, where <tt class="docutils literal"><span class="pre">v</span></tt> is an object of
 <tt class="docutils literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt>, shall be valid
 expression and convertible to <tt class="docutils literal"><span class="pre">reference</span></tt>.  <tt class="docutils literal"><span class="pre">Iterator</span></tt> shall
@@ -1607,8 +1932,8 @@
 parameter is not <tt class="docutils literal"><span class="pre">use_default</span></tt>, as implied by the algorithm for
 deducing the default for the <tt class="docutils literal"><span class="pre">value_type</span></tt> member.]</p>
 </div>
-<div class="section" id="indirect-iterator-models">
-<h4><a class="toc-backref" href="#id46" name="indirect-iterator-models"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> models</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id46" id="indirect-iterator-models" name="indirect-iterator-models"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> models</a></h4>
 <p>In addition to the concepts indicated by <tt class="docutils literal"><span class="pre">iterator_category</span></tt>
 and by <tt class="docutils literal"><span class="pre">iterator_traversal&lt;indirect_iterator&gt;::type</span></tt>, a
 specialization of <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> models the following
@@ -1628,8 +1953,8 @@
 <tt class="docutils literal"><span class="pre">indirect_iterator&lt;Y,V2,C2,R2,D2&gt;</span></tt> if and only if <tt class="docutils literal"><span class="pre">X</span></tt> is
 interoperable with <tt class="docutils literal"><span class="pre">Y</span></tt>.</p>
 </div>
-<div class="section" id="indirect-iterator-operations">
-<h4><a class="toc-backref" href="#id47" name="indirect-iterator-operations"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> operations</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id47" id="indirect-iterator-operations" name="indirect-iterator-operations"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> operations</a></h4>
 <p>In addition to the operations required by the concepts described
 above, specializations of <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> provide the
 following operations.</p>
@@ -1640,7 +1965,7 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">Iterator</span></tt> must be Default Constructible.</td>
 </tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> with 
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> with
 a default-constructed <tt class="docutils literal"><span class="pre">m_iterator</span></tt>.</td>
 </tr>
 </tbody>
@@ -1673,7 +1998,7 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">Iterator2</span></tt> is implicitly convertible to <tt class="docutils literal"><span class="pre">Iterator</span></tt>.</td>
 </tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> whose 
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> whose
 <tt class="docutils literal"><span class="pre">m_iterator</span></tt> subobject is constructed from <tt class="docutils literal"><span class="pre">y.base()</span></tt>.</td>
 </tr>
 </tbody>
@@ -1720,12 +2045,18 @@
 </table>
 </div>
 </div>
-<div class="section" id="reverse-iterator">
-<h3><a class="toc-backref" href="#id48" name="reverse-iterator">Reverse iterator</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id48" id="reverse-iterator" name="reverse-iterator">Reverse iterator</a></h3>
+<!-- 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>The reverse iterator adaptor iterates through the adapted iterator
 range in the opposite direction.</p>
-<div class="section" id="class-template-reverse-iterator">
-<h4><a class="toc-backref" href="#id49" name="class-template-reverse-iterator">Class template <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt></a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id49" id="class-template-reverse-iterator" name="class-template-reverse-iterator">Class template <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt></a></h4>
+<!-- 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) -->
 <pre class="literal-block">
 template &lt;class Iterator&gt;
 class reverse_iterator
@@ -1761,14 +2092,14 @@
 <tt class="docutils literal"><span class="pre">bidirectional_iterator_tag</span></tt>. Otherwise, <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is
 convertible to <tt class="docutils literal"><span class="pre">input_iterator_tag</span></tt>.</p>
 </div>
-<div class="section" id="reverse-iterator-requirements">
-<h4><a class="toc-backref" href="#id50" name="reverse-iterator-requirements"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> requirements</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id50" id="reverse-iterator-requirements" name="reverse-iterator-requirements"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> requirements</a></h4>
 <p><tt class="docutils literal"><span class="pre">Iterator</span></tt> must be a model of Bidirectional Traversal Iterator.  The
 type <tt class="docutils literal"><span class="pre">iterator_traits&lt;Iterator&gt;::reference</span></tt> must be the type of
 <tt class="docutils literal"><span class="pre">*i</span></tt>, where <tt class="docutils literal"><span class="pre">i</span></tt> is an object of type <tt class="docutils literal"><span class="pre">Iterator</span></tt>.</p>
 </div>
-<div class="section" id="reverse-iterator-models">
-<h4><a class="toc-backref" href="#id51" name="reverse-iterator-models"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> models</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id51" id="reverse-iterator-models" name="reverse-iterator-models"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> models</a></h4>
 <p>A specialization of <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> models the same iterator
 traversal and iterator access concepts modeled by its <tt class="docutils literal"><span class="pre">Iterator</span></tt>
 argument.  In addition, it may model old iterator concepts
@@ -1779,8 +2110,8 @@
 <col width="47%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th>If <tt class="docutils literal"><span class="pre">I</span></tt> models</th>
-<th>then <tt class="docutils literal"><span class="pre">reverse_iterator&lt;I&gt;</span></tt> models</th>
+<tr><th class="head">If <tt class="docutils literal"><span class="pre">I</span></tt> models</th>
+<th class="head">then <tt class="docutils literal"><span class="pre">reverse_iterator&lt;I&gt;</span></tt> models</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -1806,8 +2137,8 @@
 <tt class="docutils literal"><span class="pre">reverse_iterator&lt;Y&gt;</span></tt> if and only if <tt class="docutils literal"><span class="pre">X</span></tt> is interoperable with
 <tt class="docutils literal"><span class="pre">Y</span></tt>.</p>
 </div>
-<div class="section" id="reverse-iterator-operations">
-<h4><a class="toc-backref" href="#id52" name="reverse-iterator-operations"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> operations</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id52" id="reverse-iterator-operations" name="reverse-iterator-operations"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> operations</a></h4>
 <p>In addition to the operations required by the concepts modeled by
 <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt>, <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> provides the following
 operations.</p>
@@ -1818,7 +2149,7 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">Iterator</span></tt> must be Default Constructible.</td>
 </tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> with <tt class="docutils literal"><span class="pre">m_iterator</span></tt> 
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> with <tt class="docutils literal"><span class="pre">m_iterator</span></tt>
 default constructed.</td>
 </tr>
 </tbody>
@@ -1846,7 +2177,7 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">OtherIterator</span></tt> is implicitly convertible to <tt class="docutils literal"><span class="pre">Iterator</span></tt>.</td>
 </tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs instance of <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> whose 
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs instance of <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> whose
 <tt class="docutils literal"><span class="pre">m_iterator</span></tt> subobject is constructed from <tt class="docutils literal"><span class="pre">y.base()</span></tt>.</td>
 </tr>
 </tbody>
@@ -1897,18 +2228,24 @@
 </table>
 </div>
 </div>
-<div class="section" id="transform-iterator">
-<h3><a class="toc-backref" href="#id53" name="transform-iterator">Transform iterator</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id53" id="transform-iterator" name="transform-iterator">Transform iterator</a></h3>
+<!-- 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>The transform iterator adapts an iterator by modifying the
 <tt class="docutils literal"><span class="pre">operator*</span></tt> to apply a function object to the result of
 dereferencing the iterator and returning the result.</p>
-<div class="section" id="class-template-transform-iterator">
-<h4><a class="toc-backref" href="#id54" name="class-template-transform-iterator">Class template <tt class="docutils literal"><span class="pre">transform_iterator</span></tt></a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id54" id="class-template-transform-iterator" name="class-template-transform-iterator">Class template <tt class="docutils literal"><span class="pre">transform_iterator</span></tt></a></h4>
+<!-- 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) -->
 <!-- Version 1.3 of this document was accepted for TR1 -->
 <pre class="literal-block">
 template &lt;class UnaryFunction,
-          class Iterator, 
-          class Reference = use_default, 
+          class Iterator,
+          class Reference = use_default,
           class Value = use_default&gt;
 class transform_iterator
 {
@@ -1955,8 +2292,8 @@
 model Readable Lvalue Iterator then <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is
 convertible to <tt class="docutils literal"><span class="pre">input_iterator_tag</span></tt>.</p>
 </div>
-<div class="section" id="transform-iterator-requirements">
-<h4><a class="toc-backref" href="#id55" name="transform-iterator-requirements"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> requirements</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id55" id="transform-iterator-requirements" name="transform-iterator-requirements"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> requirements</a></h4>
 <p>The type <tt class="docutils literal"><span class="pre">UnaryFunction</span></tt> must be Assignable, Copy Constructible, and
 the expression <tt class="docutils literal"><span class="pre">f(*i)</span></tt> must be valid where <tt class="docutils literal"><span class="pre">f</span></tt> is an object of
 type <tt class="docutils literal"><span class="pre">UnaryFunction</span></tt>, <tt class="docutils literal"><span class="pre">i</span></tt> is an object of type <tt class="docutils literal"><span class="pre">Iterator</span></tt>, and
@@ -1964,8 +2301,8 @@
 <tt class="docutils literal"><span class="pre">result_of&lt;UnaryFunction(iterator_traits&lt;Iterator&gt;::reference)&gt;::type</span></tt>.</p>
 <p>The argument <tt class="docutils literal"><span class="pre">Iterator</span></tt> shall model Readable Iterator.</p>
 </div>
-<div class="section" id="transform-iterator-models">
-<h4><a class="toc-backref" href="#id56" name="transform-iterator-models"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> models</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id56" id="transform-iterator-models" name="transform-iterator-models"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> models</a></h4>
 <p>The resulting <tt class="docutils literal"><span class="pre">transform_iterator</span></tt> models the most refined of the
 following that is also modeled by <tt class="docutils literal"><span class="pre">Iterator</span></tt>.</p>
 <blockquote>
@@ -1986,8 +2323,8 @@
 <col width="53%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th>If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="docutils literal"><span class="pre">transform_iterator</span></tt> models</th>
+<tr><th class="head">If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models</th>
+<th class="head">then <tt class="docutils literal"><span class="pre">transform_iterator</span></tt> models</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -2011,8 +2348,8 @@
 <tt class="docutils literal"><span class="pre">transform_iterator&lt;F2,</span> <span class="pre">Y,</span> <span class="pre">R2,</span> <span class="pre">V2&gt;</span></tt> if and only if <tt class="docutils literal"><span class="pre">X</span></tt> is
 interoperable with <tt class="docutils literal"><span class="pre">Y</span></tt>.</p>
 </div>
-<div class="section" id="transform-iterator-operations">
-<h4><a class="toc-backref" href="#id57" name="transform-iterator-operations"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> operations</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id57" id="transform-iterator-operations" name="transform-iterator-operations"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> operations</a></h4>
 <p>In addition to the operations required by the concepts modeled by
 <tt class="docutils literal"><span class="pre">transform_iterator</span></tt>, <tt class="docutils literal"><span class="pre">transform_iterator</span></tt> provides the following
 operations.</p>
@@ -2107,8 +2444,11 @@
 </table>
 </div>
 </div>
-<div class="section" id="filter-iterator">
-<h3><a class="toc-backref" href="#id58" name="filter-iterator">Filter iterator</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id58" id="filter-iterator" name="filter-iterator">Filter iterator</a></h3>
+<!-- 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>The filter iterator adaptor creates a view of an iterator range in
 which some elements of the range are skipped. A predicate function
 object controls which elements are skipped. When the predicate is
@@ -2119,12 +2459,12 @@
 underlying range. A filter iterator is therefore constructed with pair
 of iterators indicating the range of elements in the unfiltered
 sequence to be traversed.</p>
-<div class="section" id="class-template-filter-iterator">
-<h4><a class="toc-backref" href="#id59" name="class-template-filter-iterator">Class template <tt class="docutils literal"><span class="pre">filter_iterator</span></tt></a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id59" id="class-template-filter-iterator" name="class-template-filter-iterator">Class template <tt class="docutils literal"><span class="pre">filter_iterator</span></tt></a></h4>
 <!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt -->
 <!-- 2004. Use, modification and distribution is subject to the Boost -->
 <!-- Software License, Version 1.0. (See accompanying  file -->
-<!-- LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)  -->
+<!-- LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <pre class="literal-block">
 template &lt;class Predicate, class Iterator&gt;
 class filter_iterator
@@ -2157,15 +2497,15 @@
 </pre>
 <p>If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models Readable Lvalue Iterator and Bidirectional Traversal
 Iterator then <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is convertible to
-<tt class="docutils literal"><span class="pre">std::bidirectional_iterator_tag</span></tt>. 
+<tt class="docutils literal"><span class="pre">std::bidirectional_iterator_tag</span></tt>.
 Otherwise, if <tt class="docutils literal"><span class="pre">Iterator</span></tt> models Readable Lvalue Iterator and Forward Traversal
 Iterator then <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is convertible to
-<tt class="docutils literal"><span class="pre">std::forward_iterator_tag</span></tt>. 
+<tt class="docutils literal"><span class="pre">std::forward_iterator_tag</span></tt>.
 Otherwise <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is
 convertible to <tt class="docutils literal"><span class="pre">std::input_iterator_tag</span></tt>.</p>
 </div>
-<div class="section" id="filter-iterator-requirements">
-<h4><a class="toc-backref" href="#id60" name="filter-iterator-requirements"><tt class="docutils literal"><span class="pre">filter_iterator</span></tt> requirements</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id60" id="filter-iterator-requirements" name="filter-iterator-requirements"><tt class="docutils literal"><span class="pre">filter_iterator</span></tt> requirements</a></h4>
 <p>The <tt class="docutils literal"><span class="pre">Iterator</span></tt> argument shall meet the requirements of Readable
 Iterator and Single Pass Iterator or it shall meet the requirements of
 Input Iterator.</p>
@@ -2175,8 +2515,8 @@
 <tt class="docutils literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt>, and where the type of
 <tt class="docutils literal"><span class="pre">p(x)</span></tt> must be convertible to <tt class="docutils literal"><span class="pre">bool</span></tt>.</p>
 </div>
-<div class="section" id="filter-iterator-models">
-<h4><a class="toc-backref" href="#id61" name="filter-iterator-models"><tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id61" id="filter-iterator-models" name="filter-iterator-models"><tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models</a></h4>
 <p>The concepts that <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models are dependent on which
 concepts the <tt class="docutils literal"><span class="pre">Iterator</span></tt> argument models, as specified in the
 following tables.</p>
@@ -2186,8 +2526,8 @@
 <col width="56%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th>If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models</th>
+<tr><th class="head">If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models</th>
+<th class="head">then <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -2208,8 +2548,8 @@
 <col width="59%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th>If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models</th>
+<tr><th class="head">If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models</th>
+<th class="head">then <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -2230,8 +2570,8 @@
 <col width="38%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th>If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models</th>
+<tr><th class="head">If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models</th>
+<th class="head">then <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -2249,11 +2589,11 @@
 </tr>
 </tbody>
 </table>
-<p><tt class="docutils literal"><span class="pre">filter_iterator&lt;P1,</span> <span class="pre">X&gt;</span></tt> is interoperable with <tt class="docutils literal"><span class="pre">filter_iterator&lt;P2,</span> <span class="pre">Y&gt;</span></tt> 
+<p><tt class="docutils literal"><span class="pre">filter_iterator&lt;P1,</span> <span class="pre">X&gt;</span></tt> is interoperable with <tt class="docutils literal"><span class="pre">filter_iterator&lt;P2,</span> <span class="pre">Y&gt;</span></tt>
 if and only if <tt class="docutils literal"><span class="pre">X</span></tt> is interoperable with <tt class="docutils literal"><span class="pre">Y</span></tt>.</p>
 </div>
-<div class="section" id="filter-iterator-operations">
-<h4><a class="toc-backref" href="#id62" name="filter-iterator-operations"><tt class="docutils literal"><span class="pre">filter_iterator</span></tt> operations</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id62" id="filter-iterator-operations" name="filter-iterator-operations"><tt class="docutils literal"><span class="pre">filter_iterator</span></tt> operations</a></h4>
 <p>In addition to those operations required by the concepts that
 <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models, <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> provides the following
 operations.</p>
@@ -2264,7 +2604,7 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">Predicate</span></tt> and <tt class="docutils literal"><span class="pre">Iterator</span></tt> must be Default Constructible.</td>
 </tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> whose``m_pred``,  <tt class="docutils literal"><span class="pre">m_iter</span></tt>, and <tt class="docutils literal"><span class="pre">m_end</span></tt> 
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> whose``m_pred``,  <tt class="docutils literal"><span class="pre">m_iter</span></tt>, and <tt class="docutils literal"><span class="pre">m_end</span></tt>
 members are a default constructed.</td>
 </tr>
 </tbody>
@@ -2275,7 +2615,7 @@
 <col class="field-body" />
 <tbody valign="top">
 <tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> where <tt class="docutils literal"><span class="pre">m_iter</span></tt> is either
-the first position in the range <tt class="docutils literal"><span class="pre">[x,end)</span></tt> such that <tt class="docutils literal"><span class="pre">f(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt> 
+the first position in the range <tt class="docutils literal"><span class="pre">[x,end)</span></tt> such that <tt class="docutils literal"><span class="pre">f(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt>
 or else``m_iter == end``. The member <tt class="docutils literal"><span class="pre">m_pred</span></tt> is constructed from
 <tt class="docutils literal"><span class="pre">f</span></tt> and <tt class="docutils literal"><span class="pre">m_end</span></tt> from <tt class="docutils literal"><span class="pre">end</span></tt>.</td>
 </tr>
@@ -2290,7 +2630,7 @@
 <tt class="docutils literal"><span class="pre">Predicate</span></tt> is a class type (not a function pointer).</td>
 </tr>
 <tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> where <tt class="docutils literal"><span class="pre">m_iter</span></tt> is either
-the first position in the range <tt class="docutils literal"><span class="pre">[x,end)</span></tt> such that <tt class="docutils literal"><span class="pre">m_pred(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt> 
+the first position in the range <tt class="docutils literal"><span class="pre">[x,end)</span></tt> such that <tt class="docutils literal"><span class="pre">m_pred(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt>
 or else``m_iter == end``. The member <tt class="docutils literal"><span class="pre">m_pred</span></tt> is default constructed.</td>
 </tr>
 </tbody>
@@ -2363,13 +2703,19 @@
 </table>
 </div>
 </div>
-<div class="section" id="counting-iterator">
-<h3><a class="toc-backref" href="#id63" name="counting-iterator">Counting iterator</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id63" id="counting-iterator" name="counting-iterator">Counting iterator</a></h3>
+<!-- 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><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> adapts an object by adding an <tt class="docutils literal"><span class="pre">operator*</span></tt> that
 returns the current value of the object. All other iterator operations
 are forwarded to the adapted object.</p>
-<div class="section" id="class-template-counting-iterator">
-<h4><a class="toc-backref" href="#id64" name="class-template-counting-iterator">Class template <tt class="docutils literal"><span class="pre">counting_iterator</span></tt></a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id64" id="class-template-counting-iterator" name="class-template-counting-iterator">Class template <tt class="docutils literal"><span class="pre">counting_iterator</span></tt></a></h4>
+<!-- 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) -->
 <pre class="literal-block">
 template &lt;
     class Incrementable
@@ -2409,7 +2755,7 @@
         random_access_traversal_tag, Incrementable, const Incrementable&amp;)
 else
     return <a class="reference" href="#id12"><em>iterator-category</em></a>(
-         iterator_traversal&lt;Incrementable&gt;::type, 
+         iterator_traversal&lt;Incrementable&gt;::type,
          Incrementable, const Incrementable&amp;)
 </pre>
 <dl class="docutils">
@@ -2419,8 +2765,8 @@
 is true.]</dd>
 </dl>
 </div>
-<div class="section" id="counting-iterator-requirements">
-<h4><a class="toc-backref" href="#id65" name="counting-iterator-requirements"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> requirements</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id65" id="counting-iterator-requirements" name="counting-iterator-requirements"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> requirements</a></h4>
 <p>The <tt class="docutils literal"><span class="pre">Incrementable</span></tt> argument shall be Copy Constructible and Assignable.</p>
 <p>If <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is convertible to <tt class="docutils literal"><span class="pre">forward_iterator_tag</span></tt>
 or <tt class="docutils literal"><span class="pre">forward_traversal_tag</span></tt>, the following must be well-formed:</p>
@@ -2445,8 +2791,8 @@
 i &lt; j;
 </pre>
 </div>
-<div class="section" id="counting-iterator-models">
-<h4><a class="toc-backref" href="#id66" name="counting-iterator-models"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> models</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id66" id="counting-iterator-models" name="counting-iterator-models"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> models</a></h4>
 <p>Specializations of <tt class="docutils literal"><span class="pre">counting_iterator</span></tt> model Readable Lvalue
 Iterator. In addition, they model the concepts corresponding to the
 iterator tags to which their <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is convertible.
@@ -2461,8 +2807,8 @@
 <tt class="docutils literal"><span class="pre">counting_iterator&lt;Y,C2,D2&gt;</span></tt> if and only if <tt class="docutils literal"><span class="pre">X</span></tt> is
 interoperable with <tt class="docutils literal"><span class="pre">Y</span></tt>.</p>
 </div>
-<div class="section" id="counting-iterator-operations">
-<h4><a class="toc-backref" href="#id67" name="counting-iterator-operations"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> operations</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id67" id="counting-iterator-operations" name="counting-iterator-operations"><tt class="docutils literal"><span class="pre">counting_iterator</span></tt> operations</a></h4>
 <p>In addition to the operations required by the concepts modeled by
 <tt class="docutils literal"><span class="pre">counting_iterator</span></tt>, <tt class="docutils literal"><span class="pre">counting_iterator</span></tt> provides the following
 operations.</p>
@@ -2537,8 +2883,11 @@
 </table>
 </div>
 </div>
-<div class="section" id="function-output-iterator">
-<h3><a class="toc-backref" href="#id68" name="function-output-iterator">Function output iterator</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id68" id="function-output-iterator" name="function-output-iterator">Function output iterator</a></h3>
+<!-- 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>The function output iterator adaptor makes it easier to create custom
 output iterators. The adaptor takes a unary function and creates a
 model of Output Iterator. Each item assigned to the output iterator is
@@ -2546,11 +2895,14 @@
 iterator is that creating a conforming output iterator is non-trivial,
 particularly because the proper implementation usually requires a
 proxy object.</p>
-<div class="section" id="class-template-function-output-iterator">
-<h4><a class="toc-backref" href="#id69" name="class-template-function-output-iterator">Class template <tt class="docutils literal"><span class="pre">function_output_iterator</span></tt></a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id69" id="class-template-function-output-iterator" name="class-template-function-output-iterator">Class template <tt class="docutils literal"><span class="pre">function_output_iterator</span></tt></a></h4>
+<!-- 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">
-<h4><a class="toc-backref" href="#id70" name="header">Header</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id70" id="header" name="header">Header</a></h4>
 <pre class="literal-block">
 #include &lt;boost/function_output_iterator.hpp&gt;
 </pre>
@@ -2576,23 +2928,23 @@
 };
 </pre>
 </div>
-<div class="section" id="function-output-iterator-requirements">
-<h4><a class="toc-backref" href="#id71" name="function-output-iterator-requirements"><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> requirements</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id71" id="function-output-iterator-requirements" name="function-output-iterator-requirements"><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> requirements</a></h4>
 <p><tt class="docutils literal"><span class="pre">UnaryFunction</span></tt> must be Assignable and Copy Constructible.</p>
 </div>
-<div class="section" id="function-output-iterator-models">
-<h4><a class="toc-backref" href="#id72" name="function-output-iterator-models"><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> models</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id72" id="function-output-iterator-models" name="function-output-iterator-models"><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> models</a></h4>
 <p><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> is a model of the Writable and
 Incrementable Iterator concepts.</p>
 </div>
-<div class="section" id="function-output-iterator-operations">
-<h4><a class="toc-backref" href="#id73" name="function-output-iterator-operations"><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> operations</a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id73" id="function-output-iterator-operations" name="function-output-iterator-operations"><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> operations</a></h4>
 <p><tt class="docutils literal"><span class="pre">explicit</span> <span class="pre">function_output_iterator(const</span> <span class="pre">UnaryFunction&amp;</span> <span class="pre">f</span> <span class="pre">=</span> <span class="pre">UnaryFunction());</span></tt></p>
 <table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> 
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">function_output_iterator</span></tt>
 with <tt class="docutils literal"><span class="pre">m_f</span></tt> constructed from <tt class="docutils literal"><span class="pre">f</span></tt>.</td>
 </tr>
 </tbody>
@@ -2636,10 +2988,5 @@
 </div>
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="facade-and-adaptor.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/facade-and-adaptor.rst
===================================================================
--- boost/trunk/libs/iterator/doc/facade-and-adaptor.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/facade-and-adaptor.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 +++++++++++++++++++++++++++++
  Iterator Facade and Adaptor
 +++++++++++++++++++++++++++++
@@ -6,7 +10,7 @@
 :Contact: dave at boost-consulting.com, jsiek at osl.iu.edu, witt at styleadvisor.com
 :organization: `Boost Consulting`_, Indiana University `Open Systems
                Lab`_, `Zephyr Associates, Inc.`_
-:date: $Date: 2004/11/01 21:23:47 $
+:date: $Date: 2006/09/11 22:27:28 $
 
 :Number: This is a revised version of N1530_\ =03-0113, which was
          accepted for Technical Report 1 by the C++ standard

Modified: boost/trunk/libs/iterator/doc/filter_iterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/filter_iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/filter_iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,15 +3,298 @@
 <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.3.6: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Filter Iterator</title>
 <meta name="author" content="David Abrahams, Jeremy Siek, Thomas Witt" />
 <meta name="organization" content="Boost Consulting, Indiana University Open Systems Lab, University of Hanover Institute for Transport Railway Operation and Construction" />
 <meta name="date" content="2004-11-01" />
 <meta name="copyright" content="Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003." />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:28 $
+:Revision: $Revision: 1.27.4.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
+<div class="document" id="filter-iterator">
 <h1 class="title">Filter Iterator</h1>
 <table class="docinfo" frame="void" rules="none">
 <col class="docinfo-name" />
@@ -31,16 +314,21 @@
 <td>Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.</td></tr>
 </tbody>
 </table>
-<div class="document" id="filter-iterator">
-<table class="field-list" frame="void" rules="none">
+<!-- Distributed under the 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 field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">abstract:</th><td class="field-body">The filter iterator adaptor creates a view of an iterator range in
+<tr class="field"><th class="field-name">abstract:</th><td class="field-body"><!-- 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) -->
+The filter iterator adaptor creates a view of an iterator range in
 which some elements of the range are skipped. A predicate function
 object controls which elements are skipped. When the predicate is
-applied to an element, if it returns <tt class="literal"><span class="pre">true</span></tt> then the element is
-retained and if it returns <tt class="literal"><span class="pre">false</span></tt> then the element is skipped
+applied to an element, if it returns <tt class="docutils literal"><span class="pre">true</span></tt> then the element is
+retained and if it returns <tt class="docutils literal"><span class="pre">false</span></tt> then the element is skipped
 over. When skipping over elements, it is necessary for the filter
 adaptor to know when to stop so as to avoid going past the end of the
 underlying range. A filter iterator is therefore constructed with pair
@@ -49,22 +337,22 @@
 </tr>
 </tbody>
 </table>
-<div class="contents topic" id="table-of-contents">
-<p class="topic-title first"><a name="table-of-contents">Table of Contents</a></p>
+<div class="contents topic">
+<p class="topic-title first"><a id="table-of-contents" name="table-of-contents">Table of Contents</a></p>
 <ul class="simple">
-<li><a class="reference" href="#filter-iterator-synopsis" id="id3" name="id3"><tt class="literal"><span class="pre">filter_iterator</span></tt> synopsis</a></li>
-<li><a class="reference" href="#filter-filter-iterator" id="id4" name="id4"><tt class="literal"><span class="pre">filter_iterator</span></tt> requirements</a></li>
-<li><a class="reference" href="#filter-iterator-models" id="id5" name="id5"><tt class="literal"><span class="pre">filter_iterator</span></tt> models</a></li>
-<li><a class="reference" href="#id1" id="id6" name="id6"><tt class="literal"><span class="pre">filter_iterator</span></tt> operations</a></li>
-<li><a class="reference" href="#example" id="id7" name="id7">Example</a></li>
+<li><a class="reference" href="#filter-iterator-synopsis" id="id2" name="id2"><tt class="docutils literal"><span class="pre">filter_iterator</span></tt> synopsis</a></li>
+<li><a class="reference" href="#filter-iterator-requirements" id="id3" name="id3"><tt class="docutils literal"><span class="pre">filter_iterator</span></tt> requirements</a></li>
+<li><a class="reference" href="#filter-iterator-models" id="id4" name="id4"><tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models</a></li>
+<li><a class="reference" href="#filter-iterator-operations" id="id5" name="id5"><tt class="docutils literal"><span class="pre">filter_iterator</span></tt> operations</a></li>
+<li><a class="reference" href="#example" id="id6" name="id6">Example</a></li>
 </ul>
 </div>
-<div class="section" id="filter-iterator-synopsis">
-<h1><a class="toc-backref" href="#id3" name="filter-iterator-synopsis"><tt class="literal"><span class="pre">filter_iterator</span></tt> synopsis</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id2" id="filter-iterator-synopsis" name="filter-iterator-synopsis"><tt class="docutils literal"><span class="pre">filter_iterator</span></tt> synopsis</a></h1>
 <!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt -->
 <!-- 2004. Use, modification and distribution is subject to the Boost -->
 <!-- Software License, Version 1.0. (See accompanying  file -->
-<!-- LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)  -->
+<!-- LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <pre class="literal-block">
 template &lt;class Predicate, class Iterator&gt;
 class filter_iterator
@@ -95,39 +383,39 @@
     Iterator m_end;   // exposition only
 };
 </pre>
-<p>If <tt class="literal"><span class="pre">Iterator</span></tt> models Readable Lvalue Iterator and Bidirectional Traversal
-Iterator then <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to
-<tt class="literal"><span class="pre">std::bidirectional_iterator_tag</span></tt>. 
-Otherwise, if <tt class="literal"><span class="pre">Iterator</span></tt> models Readable Lvalue Iterator and Forward Traversal
-Iterator then <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to
-<tt class="literal"><span class="pre">std::forward_iterator_tag</span></tt>. 
-Otherwise <tt class="literal"><span class="pre">iterator_category</span></tt> is
-convertible to <tt class="literal"><span class="pre">std::input_iterator_tag</span></tt>.</p>
+<p>If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models Readable Lvalue Iterator and Bidirectional Traversal
+Iterator then <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is convertible to
+<tt class="docutils literal"><span class="pre">std::bidirectional_iterator_tag</span></tt>.
+Otherwise, if <tt class="docutils literal"><span class="pre">Iterator</span></tt> models Readable Lvalue Iterator and Forward Traversal
+Iterator then <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is convertible to
+<tt class="docutils literal"><span class="pre">std::forward_iterator_tag</span></tt>.
+Otherwise <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is
+convertible to <tt class="docutils literal"><span class="pre">std::input_iterator_tag</span></tt>.</p>
 </div>
-<div class="section" id="filter-filter-iterator">
-<h1><a class="toc-backref" href="#id4" name="filter-filter-iterator"><tt class="literal"><span class="pre">filter_iterator</span></tt> requirements</a></h1>
-<p>The <tt class="literal"><span class="pre">Iterator</span></tt> argument shall meet the requirements of Readable
+<div class="section">
+<h1><a class="toc-backref" href="#id3" id="filter-iterator-requirements" name="filter-iterator-requirements"><tt class="docutils literal"><span class="pre">filter_iterator</span></tt> requirements</a></h1>
+<p>The <tt class="docutils literal"><span class="pre">Iterator</span></tt> argument shall meet the requirements of Readable
 Iterator and Single Pass Iterator or it shall meet the requirements of
 Input Iterator.</p>
-<p>The <tt class="literal"><span class="pre">Predicate</span></tt> argument must be Assignable, Copy Constructible, and
-the expression <tt class="literal"><span class="pre">p(x)</span></tt> must be valid where <tt class="literal"><span class="pre">p</span></tt> is an object of type
-<tt class="literal"><span class="pre">Predicate</span></tt>, <tt class="literal"><span class="pre">x</span></tt> is an object of type
-<tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt>, and where the type of
-<tt class="literal"><span class="pre">p(x)</span></tt> must be convertible to <tt class="literal"><span class="pre">bool</span></tt>.</p>
+<p>The <tt class="docutils literal"><span class="pre">Predicate</span></tt> argument must be Assignable, Copy Constructible, and
+the expression <tt class="docutils literal"><span class="pre">p(x)</span></tt> must be valid where <tt class="docutils literal"><span class="pre">p</span></tt> is an object of type
+<tt class="docutils literal"><span class="pre">Predicate</span></tt>, <tt class="docutils literal"><span class="pre">x</span></tt> is an object of type
+<tt class="docutils literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt>, and where the type of
+<tt class="docutils literal"><span class="pre">p(x)</span></tt> must be convertible to <tt class="docutils literal"><span class="pre">bool</span></tt>.</p>
 </div>
-<div class="section" id="filter-iterator-models">
-<h1><a class="toc-backref" href="#id5" name="filter-iterator-models"><tt class="literal"><span class="pre">filter_iterator</span></tt> models</a></h1>
-<p>The concepts that <tt class="literal"><span class="pre">filter_iterator</span></tt> models are dependent on which
-concepts the <tt class="literal"><span class="pre">Iterator</span></tt> argument models, as specified in the
+<div class="section">
+<h1><a class="toc-backref" href="#id4" id="filter-iterator-models" name="filter-iterator-models"><tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models</a></h1>
+<p>The concepts that <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models are dependent on which
+concepts the <tt class="docutils literal"><span class="pre">Iterator</span></tt> argument models, as specified in the
 following tables.</p>
-<table border="1" class="table">
+<table border="1" class="docutils">
 <colgroup>
 <col width="44%" />
 <col width="56%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th>If <tt class="literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="literal"><span class="pre">filter_iterator</span></tt> models</th>
+<tr><th class="head">If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models</th>
+<th class="head">then <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -142,14 +430,14 @@
 </tr>
 </tbody>
 </table>
-<table border="1" class="table">
+<table border="1" class="docutils">
 <colgroup>
 <col width="41%" />
 <col width="59%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th>If <tt class="literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="literal"><span class="pre">filter_iterator</span></tt> models</th>
+<tr><th class="head">If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models</th>
+<th class="head">then <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -164,14 +452,14 @@
 </tr>
 </tbody>
 </table>
-<table border="1" class="table">
+<table border="1" class="docutils">
 <colgroup>
 <col width="63%" />
 <col width="38%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th>If <tt class="literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="literal"><span class="pre">filter_iterator</span></tt> models</th>
+<tr><th class="head">If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models</th>
+<th class="head">then <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -189,49 +477,49 @@
 </tr>
 </tbody>
 </table>
-<p><tt class="literal"><span class="pre">filter_iterator&lt;P1,</span> <span class="pre">X&gt;</span></tt> is interoperable with <tt class="literal"><span class="pre">filter_iterator&lt;P2,</span> <span class="pre">Y&gt;</span></tt> 
-if and only if <tt class="literal"><span class="pre">X</span></tt> is interoperable with <tt class="literal"><span class="pre">Y</span></tt>.</p>
+<p><tt class="docutils literal"><span class="pre">filter_iterator&lt;P1,</span> <span class="pre">X&gt;</span></tt> is interoperable with <tt class="docutils literal"><span class="pre">filter_iterator&lt;P2,</span> <span class="pre">Y&gt;</span></tt>
+if and only if <tt class="docutils literal"><span class="pre">X</span></tt> is interoperable with <tt class="docutils literal"><span class="pre">Y</span></tt>.</p>
 </div>
-<div class="section" id="id1">
-<h1><a class="toc-backref" href="#id6" name="id1"><tt class="literal"><span class="pre">filter_iterator</span></tt> operations</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id5" id="filter-iterator-operations" name="filter-iterator-operations"><tt class="docutils literal"><span class="pre">filter_iterator</span></tt> operations</a></h1>
 <p>In addition to those operations required by the concepts that
-<tt class="literal"><span class="pre">filter_iterator</span></tt> models, <tt class="literal"><span class="pre">filter_iterator</span></tt> provides the following
+<tt class="docutils literal"><span class="pre">filter_iterator</span></tt> models, <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> provides the following
 operations.</p>
-<p><tt class="literal"><span class="pre">filter_iterator();</span></tt></p>
-<table class="field-list" frame="void" rules="none">
+<p><tt class="docutils literal"><span class="pre">filter_iterator();</span></tt></p>
+<table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="literal"><span class="pre">Predicate</span></tt> and <tt class="literal"><span class="pre">Iterator</span></tt> must be Default Constructible.</td>
+<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">Predicate</span></tt> and <tt class="docutils literal"><span class="pre">Iterator</span></tt> must be Default Constructible.</td>
 </tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="literal"><span class="pre">filter_iterator</span></tt> whose``m_pred``,  <tt class="literal"><span class="pre">m_iter</span></tt>, and <tt class="literal"><span class="pre">m_end</span></tt> 
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> whose``m_pred``,  <tt class="docutils literal"><span class="pre">m_iter</span></tt>, and <tt class="docutils literal"><span class="pre">m_end</span></tt>
 members are a default constructed.</td>
 </tr>
 </tbody>
 </table>
-<p><tt class="literal"><span class="pre">filter_iterator(Predicate</span> <span class="pre">f,</span> <span class="pre">Iterator</span> <span class="pre">x,</span> <span class="pre">Iterator</span> <span class="pre">end</span> <span class="pre">=</span> <span class="pre">Iterator());</span></tt></p>
-<table class="field-list" frame="void" rules="none">
+<p><tt class="docutils literal"><span class="pre">filter_iterator(Predicate</span> <span class="pre">f,</span> <span class="pre">Iterator</span> <span class="pre">x,</span> <span class="pre">Iterator</span> <span class="pre">end</span> <span class="pre">=</span> <span class="pre">Iterator());</span></tt></p>
+<table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="literal"><span class="pre">filter_iterator</span></tt> where <tt class="literal"><span class="pre">m_iter</span></tt> is either
-the first position in the range <tt class="literal"><span class="pre">[x,end)</span></tt> such that <tt class="literal"><span class="pre">f(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt> 
-or else``m_iter == end``. The member <tt class="literal"><span class="pre">m_pred</span></tt> is constructed from
-<tt class="literal"><span class="pre">f</span></tt> and <tt class="literal"><span class="pre">m_end</span></tt> from <tt class="literal"><span class="pre">end</span></tt>.</td>
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> where <tt class="docutils literal"><span class="pre">m_iter</span></tt> is either
+the first position in the range <tt class="docutils literal"><span class="pre">[x,end)</span></tt> such that <tt class="docutils literal"><span class="pre">f(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt>
+or else``m_iter == end``. The member <tt class="docutils literal"><span class="pre">m_pred</span></tt> is constructed from
+<tt class="docutils literal"><span class="pre">f</span></tt> and <tt class="docutils literal"><span class="pre">m_end</span></tt> from <tt class="docutils literal"><span class="pre">end</span></tt>.</td>
 </tr>
 </tbody>
 </table>
-<p><tt class="literal"><span class="pre">filter_iterator(Iterator</span> <span class="pre">x,</span> <span class="pre">Iterator</span> <span class="pre">end</span> <span class="pre">=</span> <span class="pre">Iterator());</span></tt></p>
-<table class="field-list" frame="void" rules="none">
+<p><tt class="docutils literal"><span class="pre">filter_iterator(Iterator</span> <span class="pre">x,</span> <span class="pre">Iterator</span> <span class="pre">end</span> <span class="pre">=</span> <span class="pre">Iterator());</span></tt></p>
+<table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="literal"><span class="pre">Predicate</span></tt> must be Default Constructible and
-<tt class="literal"><span class="pre">Predicate</span></tt> is a class type (not a function pointer).</td>
+<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">Predicate</span></tt> must be Default Constructible and
+<tt class="docutils literal"><span class="pre">Predicate</span></tt> is a class type (not a function pointer).</td>
 </tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="literal"><span class="pre">filter_iterator</span></tt> where <tt class="literal"><span class="pre">m_iter</span></tt> is either
-the first position in the range <tt class="literal"><span class="pre">[x,end)</span></tt> such that <tt class="literal"><span class="pre">m_pred(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt> 
-or else``m_iter == end``. The member <tt class="literal"><span class="pre">m_pred</span></tt> is default constructed.</td>
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> where <tt class="docutils literal"><span class="pre">m_iter</span></tt> is either
+the first position in the range <tt class="docutils literal"><span class="pre">[x,end)</span></tt> such that <tt class="docutils literal"><span class="pre">m_pred(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt>
+or else``m_iter == end``. The member <tt class="docutils literal"><span class="pre">m_pred</span></tt> is default constructed.</td>
 </tr>
 </tbody>
 </table>
@@ -242,71 +530,74 @@
     , typename enable_if_convertible&lt;OtherIterator, Iterator&gt;::type* = 0 // exposition
     );``
 </pre>
-<table class="field-list" frame="void" rules="none">
+<table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="literal"><span class="pre">OtherIterator</span></tt> is implicitly convertible to <tt class="literal"><span class="pre">Iterator</span></tt>.</td>
+<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">OtherIterator</span></tt> is implicitly convertible to <tt class="docutils literal"><span class="pre">Iterator</span></tt>.</td>
 </tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a filter iterator whose members are copied from <tt class="literal"><span class="pre">t</span></tt>.</td>
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a filter iterator whose members are copied from <tt class="docutils literal"><span class="pre">t</span></tt>.</td>
 </tr>
 </tbody>
 </table>
-<p><tt class="literal"><span class="pre">Predicate</span> <span class="pre">predicate()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
+<p><tt class="docutils literal"><span class="pre">Predicate</span> <span class="pre">predicate()</span> <span class="pre">const;</span></tt></p>
+<table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">m_pred</span></tt></td>
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="docutils literal"><span class="pre">m_pred</span></tt></td>
 </tr>
 </tbody>
 </table>
-<p><tt class="literal"><span class="pre">Iterator</span> <span class="pre">end()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
+<p><tt class="docutils literal"><span class="pre">Iterator</span> <span class="pre">end()</span> <span class="pre">const;</span></tt></p>
+<table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">m_end</span></tt></td>
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="docutils literal"><span class="pre">m_end</span></tt></td>
 </tr>
 </tbody>
 </table>
-<p><tt class="literal"><span class="pre">Iterator</span> <span class="pre">const&amp;</span> <span class="pre">base()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
+<p><tt class="docutils literal"><span class="pre">Iterator</span> <span class="pre">const&amp;</span> <span class="pre">base()</span> <span class="pre">const;</span></tt></p>
+<table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">m_iterator</span></tt></td>
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="docutils literal"><span class="pre">m_iterator</span></tt></td>
 </tr>
 </tbody>
 </table>
-<p><tt class="literal"><span class="pre">reference</span> <span class="pre">operator*()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
+<p><tt class="docutils literal"><span class="pre">reference</span> <span class="pre">operator*()</span> <span class="pre">const;</span></tt></p>
+<table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*m_iter</span></tt></td>
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="docutils literal"><span class="pre">*m_iter</span></tt></td>
 </tr>
 </tbody>
 </table>
-<p><tt class="literal"><span class="pre">filter_iterator&amp;</span> <span class="pre">operator++();</span></tt></p>
-<table class="field-list" frame="void" rules="none">
+<p><tt class="docutils literal"><span class="pre">filter_iterator&amp;</span> <span class="pre">operator++();</span></tt></p>
+<table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Increments <tt class="literal"><span class="pre">m_iter</span></tt> and then continues to
-increment <tt class="literal"><span class="pre">m_iter</span></tt> until either <tt class="literal"><span class="pre">m_iter</span> <span class="pre">==</span> <span class="pre">m_end</span></tt>
-or <tt class="literal"><span class="pre">m_pred(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt>.</td>
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Increments <tt class="docutils literal"><span class="pre">m_iter</span></tt> and then continues to
+increment <tt class="docutils literal"><span class="pre">m_iter</span></tt> until either <tt class="docutils literal"><span class="pre">m_iter</span> <span class="pre">==</span> <span class="pre">m_end</span></tt>
+or <tt class="docutils literal"><span class="pre">m_pred(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt>.</td>
 </tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*this</span></tt></td>
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="docutils literal"><span class="pre">*this</span></tt></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) -->
 <pre class="literal-block">
 template &lt;class Predicate, class Iterator&gt;
 filter_iterator&lt;Predicate,Iterator&gt;
 make_filter_iterator(Predicate f, Iterator x, Iterator end = Iterator());
 </pre>
-<table class="field-list" frame="void" rules="none">
+<table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
@@ -319,7 +610,7 @@
 filter_iterator&lt;Predicate,Iterator&gt;
 make_filter_iterator(Iterator x, Iterator end = Iterator());
 </pre>
-<table class="field-list" frame="void" rules="none">
+<table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
@@ -327,13 +618,16 @@
 </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) -->
 </div>
-<div class="section" id="example">
-<h1><a class="toc-backref" href="#id7" name="example">Example</a></h1>
-<p>This example uses <tt class="literal"><span class="pre">filter_iterator</span></tt> and then
-<tt class="literal"><span class="pre">make_filter_iterator</span></tt> to output only the positive integers from an
-array of integers. Then <tt class="literal"><span class="pre">make_filter_iterator</span></tt> is is used to output
-the integers greater than <tt class="literal"><span class="pre">-2</span></tt>.</p>
+<div class="section">
+<h1><a class="toc-backref" href="#id6" id="example" name="example">Example</a></h1>
+<p>This example uses <tt class="docutils literal"><span class="pre">filter_iterator</span></tt> and then
+<tt class="docutils literal"><span class="pre">make_filter_iterator</span></tt> to output only the positive integers from an
+array of integers. Then <tt class="docutils literal"><span class="pre">make_filter_iterator</span></tt> is is used to output
+the integers greater than <tt class="docutils literal"><span class="pre">-2</span></tt>.</p>
 <pre class="literal-block">
 struct is_positive_number {
   bool operator()(int x) { return 0 &lt; x; }
@@ -384,17 +678,12 @@
 </pre>
 <p>The output is:</p>
 <pre class="literal-block">
-4 5 8 
-4 5 8 
-0 -1 4 5 8 
+4 5 8
+4 5 8
+0 -1 4 5 8
 </pre>
 <p>The source code for this example can be found <a class="reference" href="../example/filter_iterator_example.cpp">here</a>.</p>
 </div>
 </div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="filter_iterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/filter_iterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/filter_iterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/filter_iterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 +++++++++++++++++
  Filter Iterator
 +++++++++++++++++
@@ -7,7 +11,7 @@
 :organization: `Boost Consulting`_, Indiana University `Open Systems
                Lab`_, University of Hanover `Institute for Transport
                Railway Operation and Construction`_
-:date: $Date: 2004/11/01 21:23:47 $
+:date: $Date: 2006/09/11 22:27:28 $
 :copyright: Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. 
 
 .. _`Boost Consulting`: http://www.boost-consulting.com

Modified: boost/trunk/libs/iterator/doc/filter_iterator_abstract.rst
===================================================================
--- boost/trunk/libs/iterator/doc/filter_iterator_abstract.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/filter_iterator_abstract.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 The filter iterator adaptor creates a view of an iterator range in
 which some elements of the range are skipped. A predicate function
 object controls which elements are skipped. When the predicate is

Modified: boost/trunk/libs/iterator/doc/filter_iterator_eg.rst
===================================================================
--- boost/trunk/libs/iterator/doc/filter_iterator_eg.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/filter_iterator_eg.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+.. 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)
 
 Example
 .......

Deleted: boost/trunk/libs/iterator/doc/filter_iterator_ref.html
===================================================================
--- boost/trunk/libs/iterator/doc/filter_iterator_ref.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/filter_iterator_ref.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,259 +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.3.6: http://docutils.sourceforge.net/" />
-<title></title>
-<link rel="stylesheet" href="default.css" type="text/css" />
-</head>
-<body>
-<div class="document">
-<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt -->
-<!-- 2004. Use, modification and distribution is subject to the Boost -->
-<!-- Software License, Version 1.0. (See accompanying  file -->
-<!-- LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)  -->
-<pre class="literal-block">
-template &lt;class Predicate, class Iterator&gt;
-class filter_iterator
-{
- public:
-    typedef iterator_traits&lt;Iterator&gt;::value_type value_type;
-    typedef iterator_traits&lt;Iterator&gt;::reference reference;
-    typedef iterator_traits&lt;Iterator&gt;::pointer pointer;
-    typedef iterator_traits&lt;Iterator&gt;::difference_type difference_type;
-    typedef /* see below */ iterator_category;
-
-    filter_iterator();
-    filter_iterator(Predicate f, Iterator x, Iterator end = Iterator());
-    filter_iterator(Iterator x, Iterator end = Iterator());
-    template&lt;class OtherIterator&gt;
-    filter_iterator(
-        filter_iterator&lt;Predicate, OtherIterator&gt; const&amp; t
-        , typename enable_if_convertible&lt;OtherIterator, Iterator&gt;::type* = 0 // exposition
-        );
-    Predicate predicate() const;
-    Iterator end() const;
-    Iterator const&amp; base() const;
-    reference operator*() const;
-    filter_iterator&amp; operator++();
-private:
-    Predicate m_pred; // exposition only
-    Iterator m_iter;  // exposition only
-    Iterator m_end;   // exposition only
-};
-</pre>
-<p>If <tt class="literal"><span class="pre">Iterator</span></tt> models Readable Lvalue Iterator and Bidirectional Traversal
-Iterator then <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to
-<tt class="literal"><span class="pre">std::bidirectional_iterator_tag</span></tt>. 
-Otherwise, if <tt class="literal"><span class="pre">Iterator</span></tt> models Readable Lvalue Iterator and Forward Traversal
-Iterator then <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to
-<tt class="literal"><span class="pre">std::forward_iterator_tag</span></tt>. 
-Otherwise <tt class="literal"><span class="pre">iterator_category</span></tt> is
-convertible to <tt class="literal"><span class="pre">std::input_iterator_tag</span></tt>.</p>
-<div class="section" id="filter-iterator">
-<h1><a name="filter-iterator"><tt class="literal"><span class="pre">filter_iterator</span></tt> requirements</a></h1>
-<p>The <tt class="literal"><span class="pre">Iterator</span></tt> argument shall meet the requirements of Readable
-Iterator and Single Pass Iterator or it shall meet the requirements of
-Input Iterator.</p>
-<p>The <tt class="literal"><span class="pre">Predicate</span></tt> argument must be Assignable, Copy Constructible, and
-the expression <tt class="literal"><span class="pre">p(x)</span></tt> must be valid where <tt class="literal"><span class="pre">p</span></tt> is an object of type
-<tt class="literal"><span class="pre">Predicate</span></tt>, <tt class="literal"><span class="pre">x</span></tt> is an object of type
-<tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt>, and where the type of
-<tt class="literal"><span class="pre">p(x)</span></tt> must be convertible to <tt class="literal"><span class="pre">bool</span></tt>.</p>
-</div>
-<div class="section" id="filter-iterator-models">
-<h1><a name="filter-iterator-models"><tt class="literal"><span class="pre">filter_iterator</span></tt> models</a></h1>
-<p>The concepts that <tt class="literal"><span class="pre">filter_iterator</span></tt> models are dependent on which
-concepts the <tt class="literal"><span class="pre">Iterator</span></tt> argument models, as specified in the
-following tables.</p>
-<table border="1" class="table">
-<colgroup>
-<col width="44%" />
-<col width="56%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th>If <tt class="literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="literal"><span class="pre">filter_iterator</span></tt> models</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td>Single Pass Iterator</td>
-<td>Single Pass Iterator</td>
-</tr>
-<tr><td>Forward Traversal Iterator</td>
-<td>Forward Traversal Iterator</td>
-</tr>
-<tr><td>Bidirectional Traversal Iterator</td>
-<td>Bidirectional Traversal Iterator</td>
-</tr>
-</tbody>
-</table>
-<table border="1" class="table">
-<colgroup>
-<col width="41%" />
-<col width="59%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th>If <tt class="literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="literal"><span class="pre">filter_iterator</span></tt> models</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td>Readable Iterator</td>
-<td>Readable Iterator</td>
-</tr>
-<tr><td>Writable Iterator</td>
-<td>Writable Iterator</td>
-</tr>
-<tr><td>Lvalue Iterator</td>
-<td>Lvalue Iterator</td>
-</tr>
-</tbody>
-</table>
-<table border="1" class="table">
-<colgroup>
-<col width="63%" />
-<col width="38%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th>If <tt class="literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="literal"><span class="pre">filter_iterator</span></tt> models</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td>Readable Iterator, Single Pass Iterator</td>
-<td>Input Iterator</td>
-</tr>
-<tr><td>Readable Lvalue Iterator, Forward Traversal Iterator</td>
-<td>Forward Iterator</td>
-</tr>
-<tr><td>Writable Lvalue Iterator, Forward Traversal Iterator</td>
-<td>Mutable Forward Iterator</td>
-</tr>
-<tr><td>Writable Lvalue Iterator, Bidirectional Iterator</td>
-<td>Mutable Bidirectional Iterator</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">filter_iterator&lt;P1,</span> <span class="pre">X&gt;</span></tt> is interoperable with <tt class="literal"><span class="pre">filter_iterator&lt;P2,</span> <span class="pre">Y&gt;</span></tt> 
-if and only if <tt class="literal"><span class="pre">X</span></tt> is interoperable with <tt class="literal"><span class="pre">Y</span></tt>.</p>
-</div>
-<div class="section" id="id1">
-<h1><a name="id1"><tt class="literal"><span class="pre">filter_iterator</span></tt> operations</a></h1>
-<p>In addition to those operations required by the concepts that
-<tt class="literal"><span class="pre">filter_iterator</span></tt> models, <tt class="literal"><span class="pre">filter_iterator</span></tt> provides the following
-operations.</p>
-<p><tt class="literal"><span class="pre">filter_iterator();</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="literal"><span class="pre">Predicate</span></tt> and <tt class="literal"><span class="pre">Iterator</span></tt> must be Default Constructible.</td>
-</tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="literal"><span class="pre">filter_iterator</span></tt> whose``m_pred``,  <tt class="literal"><span class="pre">m_iter</span></tt>, and <tt class="literal"><span class="pre">m_end</span></tt> 
-members are a default constructed.</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">filter_iterator(Predicate</span> <span class="pre">f,</span> <span class="pre">Iterator</span> <span class="pre">x,</span> <span class="pre">Iterator</span> <span class="pre">end</span> <span class="pre">=</span> <span class="pre">Iterator());</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="literal"><span class="pre">filter_iterator</span></tt> where <tt class="literal"><span class="pre">m_iter</span></tt> is either
-the first position in the range <tt class="literal"><span class="pre">[x,end)</span></tt> such that <tt class="literal"><span class="pre">f(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt> 
-or else``m_iter == end``. The member <tt class="literal"><span class="pre">m_pred</span></tt> is constructed from
-<tt class="literal"><span class="pre">f</span></tt> and <tt class="literal"><span class="pre">m_end</span></tt> from <tt class="literal"><span class="pre">end</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">filter_iterator(Iterator</span> <span class="pre">x,</span> <span class="pre">Iterator</span> <span class="pre">end</span> <span class="pre">=</span> <span class="pre">Iterator());</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="literal"><span class="pre">Predicate</span></tt> must be Default Constructible and
-<tt class="literal"><span class="pre">Predicate</span></tt> is a class type (not a function pointer).</td>
-</tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="literal"><span class="pre">filter_iterator</span></tt> where <tt class="literal"><span class="pre">m_iter</span></tt> is either
-the first position in the range <tt class="literal"><span class="pre">[x,end)</span></tt> such that <tt class="literal"><span class="pre">m_pred(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt> 
-or else``m_iter == end``. The member <tt class="literal"><span class="pre">m_pred</span></tt> is default constructed.</td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;class OtherIterator&gt;
-filter_iterator(
-    filter_iterator&lt;Predicate, OtherIterator&gt; const&amp; t
-    , typename enable_if_convertible&lt;OtherIterator, Iterator&gt;::type* = 0 // exposition
-    );``
-</pre>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="literal"><span class="pre">OtherIterator</span></tt> is implicitly convertible to <tt class="literal"><span class="pre">Iterator</span></tt>.</td>
-</tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a filter iterator whose members are copied from <tt class="literal"><span class="pre">t</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">Predicate</span> <span class="pre">predicate()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">m_pred</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">Iterator</span> <span class="pre">end()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">m_end</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">Iterator</span> <span class="pre">const&amp;</span> <span class="pre">base()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">m_iterator</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">reference</span> <span class="pre">operator*()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*m_iter</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">filter_iterator&amp;</span> <span class="pre">operator++();</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Increments <tt class="literal"><span class="pre">m_iter</span></tt> and then continues to
-increment <tt class="literal"><span class="pre">m_iter</span></tt> until either <tt class="literal"><span class="pre">m_iter</span> <span class="pre">==</span> <span class="pre">m_end</span></tt>
-or <tt class="literal"><span class="pre">m_pred(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt>.</td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*this</span></tt></td>
-</tr>
-</tbody>
-</table>
-</div>
-</div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="filter_iterator_ref.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
-</body>
-</html>

Modified: boost/trunk/libs/iterator/doc/func_output_iter_abstract.rst
===================================================================
--- boost/trunk/libs/iterator/doc/func_output_iter_abstract.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/func_output_iter_abstract.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 The function output iterator adaptor makes it easier to create custom
 output iterators. The adaptor takes a unary function and creates a
 model of Output Iterator. Each item assigned to the output iterator is

Modified: boost/trunk/libs/iterator/doc/func_output_iter_ref.rst
===================================================================
--- boost/trunk/libs/iterator/doc/func_output_iter_ref.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/func_output_iter_ref.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Header
 ......
 

Modified: boost/trunk/libs/iterator/doc/function_output_iterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/function_output_iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/function_output_iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,295 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Function Output Iterator</title>
 <meta name="author" content="David Abrahams, Jeremy Siek, Thomas Witt" />
 <meta name="organization" content="Boost Consulting, Indiana University Open Systems Lab, University of Hanover Institute for Transport Railway Operation and Construction" />
 <meta name="date" content="2004-11-01" />
 <meta name="copyright" content="Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003." />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:28 $
+:Revision: $Revision: 1.20.2.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="function-output-iterator">
@@ -32,11 +314,17 @@
 <td>Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.</td></tr>
 </tbody>
 </table>
+<!-- Distributed under the 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 field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">abstract:</th><td class="field-body">The function output iterator adaptor makes it easier to create custom
+<tr class="field"><th class="field-name">abstract:</th><td class="field-body"><!-- 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) -->
+The function output iterator adaptor makes it easier to create custom
 output iterators. The adaptor takes a unary function and creates a
 model of Output Iterator. Each item assigned to the output iterator is
 passed as an argument to the unary function.  The motivation for this
@@ -46,8 +334,8 @@
 </tr>
 </tbody>
 </table>
-<div class="contents topic" id="table-of-contents">
-<p class="topic-title first"><a name="table-of-contents">Table of Contents</a></p>
+<div class="contents topic">
+<p class="topic-title first"><a id="table-of-contents" name="table-of-contents">Table of Contents</a></p>
 <ul class="simple">
 <li><a class="reference" href="#header" id="id1" name="id1">Header</a></li>
 <li><a class="reference" href="#function-output-iterator-requirements" id="id2" name="id2"><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> requirements</a></li>
@@ -56,8 +344,11 @@
 <li><a class="reference" href="#example" id="id5" name="id5">Example</a></li>
 </ul>
 </div>
-<div class="section" id="header">
-<h1><a class="toc-backref" href="#id1" name="header">Header</a></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) -->
+<div class="section">
+<h1><a class="toc-backref" href="#id1" id="header" name="header">Header</a></h1>
 <pre class="literal-block">
 #include &lt;boost/function_output_iterator.hpp&gt;
 </pre>
@@ -83,23 +374,23 @@
 };
 </pre>
 </div>
-<div class="section" id="function-output-iterator-requirements">
-<h1><a class="toc-backref" href="#id2" name="function-output-iterator-requirements"><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> requirements</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id2" id="function-output-iterator-requirements" name="function-output-iterator-requirements"><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> requirements</a></h1>
 <p><tt class="docutils literal"><span class="pre">UnaryFunction</span></tt> must be Assignable and Copy Constructible.</p>
 </div>
-<div class="section" id="function-output-iterator-models">
-<h1><a class="toc-backref" href="#id3" name="function-output-iterator-models"><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> models</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id3" id="function-output-iterator-models" name="function-output-iterator-models"><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> models</a></h1>
 <p><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> is a model of the Writable and
 Incrementable Iterator concepts.</p>
 </div>
-<div class="section" id="function-output-iterator-operations">
-<h1><a class="toc-backref" href="#id4" name="function-output-iterator-operations"><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> operations</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id4" id="function-output-iterator-operations" name="function-output-iterator-operations"><tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> operations</a></h1>
 <p><tt class="docutils literal"><span class="pre">explicit</span> <span class="pre">function_output_iterator(const</span> <span class="pre">UnaryFunction&amp;</span> <span class="pre">f</span> <span class="pre">=</span> <span class="pre">UnaryFunction());</span></tt></p>
 <table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">function_output_iterator</span></tt> 
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">function_output_iterator</span></tt>
 with <tt class="docutils literal"><span class="pre">m_f</span></tt> constructed from <tt class="docutils literal"><span class="pre">f</span></tt>.</td>
 </tr>
 </tbody>
@@ -132,9 +423,12 @@
 </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) -->
 </div>
-<div class="section" id="example">
-<h1><a class="toc-backref" href="#id5" name="example">Example</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id5" id="example" name="example">Example</a></h1>
 <pre class="literal-block">
 struct string_appender
 {
@@ -159,7 +453,7 @@
   x.push_back(&quot;!&quot;);
 
   std::string s = &quot;&quot;;
-  std::copy(x.begin(), x.end(), 
+  std::copy(x.begin(), x.end(),
             boost::make_function_output_iterator(string_appender(s)));
 
   std::cout &lt;&lt; s &lt;&lt; std::endl;
@@ -169,10 +463,5 @@
 </pre>
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="function_output_iterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/function_output_iterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/function_output_iterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/function_output_iterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 ++++++++++++++++++++++++++
  Function Output Iterator
 ++++++++++++++++++++++++++
@@ -7,7 +11,7 @@
 :organization: `Boost Consulting`_, Indiana University `Open Systems
                Lab`_, University of Hanover `Institute for Transport
                Railway Operation and Construction`_
-:date: $Date: 2004/11/01 21:23:47 $
+:date: $Date: 2006/09/11 22:27:28 $
 :copyright: Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. 
 
 .. _`Boost Consulting`: http://www.boost-consulting.com

Modified: boost/trunk/libs/iterator/doc/function_output_iterator_eg.rst
===================================================================
--- boost/trunk/libs/iterator/doc/function_output_iterator_eg.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/function_output_iterator_eg.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Example
 .......
 

Modified: boost/trunk/libs/iterator/doc/index.html
===================================================================
--- boost/trunk/libs/iterator/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,298 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>The Boost.Iterator Library Boost</title>
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:28 $
+:Revision: $Revision: 1.25.4.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="the-boost-iterator-library-logo">
 <h1 class="title">The Boost.Iterator Library <a class="reference" href="../../../index.htm"><img alt="Boost" src="../../../boost.png" /></a></h1>
+<!-- Distributed under the Boost -->
+<!-- Software License, Version 1.0. (See accompanying -->
+<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <hr class="docutils" />
 <table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
@@ -22,7 +307,7 @@
 <tr class="field"><th class="field-name">organizations:</th><td class="field-body"><a class="reference" href="http://www.boost-consulting.com">Boost Consulting</a>, Indiana University <a class="reference" href="http://www.osl.iu.edu">Open Systems
 Lab</a>, <a class="reference" href="http://www.styleadvisor.com">Zephyr Associates, Inc.</a></td>
 </tr>
-<tr class="field"><th class="field-name">date:</th><td class="field-body">$Date: 2005/05/20 15:32:55 $</td>
+<tr class="field"><th class="field-name">date:</th><td class="field-body">$Date: 2006/09/11 22:27:28 $</td>
 </tr>
 <tr class="field"><th class="field-name">copyright:</th><td class="field-body">Copyright David Abrahams, Jeremy Siek, Thomas Witt 2003.</td>
 </tr>
@@ -50,8 +335,8 @@
 </tr>
 </tbody>
 </table>
-<div class="contents topic" id="table-of-contents">
-<p class="topic-title first"><a name="table-of-contents"><strong>Table of Contents</strong></a></p>
+<div class="contents topic">
+<p class="topic-title first"><a id="table-of-contents" name="table-of-contents"><strong>Table of Contents</strong></a></p>
 <ul class="simple">
 <li><a class="reference" href="#new-style-iterators" id="id22" name="id22">New-Style Iterators</a></li>
 <li><a class="reference" href="#iterator-facade-and-adaptor" id="id23" name="id23">Iterator Facade and Adaptor</a></li>
@@ -66,8 +351,8 @@
 </ul>
 </div>
 <hr class="docutils" />
-<div class="section" id="new-style-iterators">
-<h1><a class="toc-backref" href="#id22" name="new-style-iterators">New-Style Iterators</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id22" id="new-style-iterators" name="new-style-iterators">New-Style Iterators</a></h1>
 <p>The iterator categories defined in C++98 are extremely limiting
 because they bind together two orthogonal concepts: traversal and
 element access.  For example, because a random access iterator is
@@ -85,8 +370,8 @@
 <blockquote>
 <a class="reference" href="new-iter-concepts.html">Standard Proposal For New-Style Iterators</a> (<a class="reference" href="new-iter-concepts.pdf">PDF</a>)</blockquote>
 </div>
-<div class="section" id="iterator-facade-and-adaptor">
-<h1><a class="toc-backref" href="#id23" name="iterator-facade-and-adaptor">Iterator Facade and Adaptor</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id23" id="iterator-facade-and-adaptor" name="iterator-facade-and-adaptor">Iterator Facade and Adaptor</a></h1>
 <p>Writing standard-conforming iterators is tricky, but the need comes
 up often.  In order to ease the implementation of new iterators,
 the Boost.Iterator library provides the <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> class template,
@@ -112,8 +397,8 @@
 <a class="reference" href="facade-and-adaptor.html">Standard Proposal For Iterator Facade and Adaptor</a> (<a class="reference" href="facade-and-adaptor.pdf">PDF</a>)</blockquote>
 <p>for more details.</p>
 </div>
-<div class="section" id="specialized-adaptors">
-<h1><a class="toc-backref" href="#id24" name="specialized-adaptors">Specialized Adaptors</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id24" id="specialized-adaptors" name="specialized-adaptors">Specialized Adaptors</a></h1>
 <p>The iterator library supplies a useful suite of standard-conforming
 iterator templates based on the Boost <a class="reference" href="#iterator-facade-and-adaptor">iterator facade and adaptor</a>.</p>
 <ul class="simple">
@@ -141,10 +426,10 @@
 positions of heterogeneous underlying iterators.</li>
 </ul>
 </div>
-<div class="section" id="iterator-utilities">
-<h1><a class="toc-backref" href="#id25" name="iterator-utilities">Iterator Utilities</a></h1>
-<div class="section" id="traits">
-<h2><a class="toc-backref" href="#id26" name="traits">Traits</a></h2>
+<div class="section">
+<h1><a class="toc-backref" href="#id25" id="iterator-utilities" name="iterator-utilities">Iterator Utilities</a></h1>
+<div class="section">
+<h2><a class="toc-backref" href="#id26" id="traits" name="traits">Traits</a></h2>
 <ul class="simple">
 <li><a class="reference" href="pointee.html"><tt class="docutils literal"><span class="pre">pointee.hpp</span></tt></a> (<a class="reference" href="pointee.pdf">PDF</a>): Provides the capability to deduce the referent types
 of pointers, smart pointers and iterators in generic code.  Used
@@ -157,17 +442,17 @@
 testing iterator interoperability -->
 <!-- comment! __ interoperable.pdf -->
 </div>
-<div class="section" id="testing-and-concept-checking">
-<h2><a class="toc-backref" href="#id27" name="testing-and-concept-checking">Testing and Concept Checking</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id27" id="testing-and-concept-checking" name="testing-and-concept-checking">Testing and Concept Checking</a></h2>
 <ul class="simple">
 <li><a class="reference" href="iterator_concepts.html"><tt class="docutils literal"><span class="pre">iterator_concepts.hpp</span></tt></a> (<a class="reference" href="iterator_concepts.pdf">PDF</a>): Concept checking classes for the new iterator concepts.</li>
 <li><a class="reference" href="iterator_archetypes.html"><tt class="docutils literal"><span class="pre">iterator_archetypes.hpp</span></tt></a> (<a class="reference" href="iterator_archetypes.pdf">PDF</a>): Concept archetype classes for the new iterators concepts.</li>
 </ul>
 </div>
 </div>
-<div class="section" id="upgrading-from-the-old-boost-iterator-adaptor-library">
-<h1><a class="toc-backref" href="#id28" name="upgrading-from-the-old-boost-iterator-adaptor-library">Upgrading from the old Boost Iterator Adaptor Library</a></h1>
-<a class="target" id="upgrading" name="upgrading"></a><p>If you have been using the old Boost Iterator Adaptor library to
+<div class="section">
+<h1><a class="toc-backref" href="#id28" id="upgrading-from-the-old-boost-iterator-adaptor-library" name="upgrading-from-the-old-boost-iterator-adaptor-library">Upgrading from the old Boost Iterator Adaptor Library</a></h1>
+<p id="upgrading">If you have been using the old Boost Iterator Adaptor library to
 implement iterators, you probably wrote a <tt class="docutils literal"><span class="pre">Policies</span></tt> class which
 captures the core operations of your iterator.  In the new library
 design, you'll move those same core operations into the body of the
@@ -190,8 +475,8 @@
 type, <tt class="docutils literal"><span class="pre">transform_iterator</span></tt> will behave like
 <tt class="docutils literal"><span class="pre">projection_iterator</span></tt> used to.</p>
 </div>
-<div class="section" id="history">
-<h1><a class="toc-backref" href="#id29" name="history">History</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id29" id="history" name="history">History</a></h1>
 <p>In 2000 Dave Abrahams was writing an iterator for a container of
 pointers, which would access the pointed-to elements when
 dereferenced.  Naturally, being a library writer, he decided to
@@ -232,10 +517,5 @@
 LocalWords:  TraversalTag typename lvalues DWA Hmm JGS -->
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="index.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/index.rst
===================================================================
--- boost/trunk/libs/iterator/doc/index.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/index.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 +++++++++++++++++++++++++++++++++++++++++++++++++
  The Boost.Iterator Library |(logo)|__
 +++++++++++++++++++++++++++++++++++++++++++++++++
@@ -15,7 +19,7 @@
 :Contact:       dave at boost-consulting.com, jsiek at osl.iu.edu, witt at styleadvisor.com
 :organizations: `Boost Consulting`_, Indiana University `Open Systems
                 Lab`_, `Zephyr Associates, Inc.`_
-:date:          $Date: 2004/11/02 14:31:23 $
+:date:          $Date: 2006/09/11 22:27:28 $
 
 :copyright:     Copyright David Abrahams, Jeremy Siek, Thomas Witt 2003.
 

Modified: boost/trunk/libs/iterator/doc/indirect_iterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/indirect_iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/indirect_iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,295 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Indirect Iterator</title>
 <meta name="author" content="David Abrahams, Jeremy Siek, Thomas Witt" />
 <meta name="organization" content="Boost Consulting, Indiana University Open Systems Lab, University of Hanover Institute for Transport Railway Operation and Construction" />
 <meta name="date" content="2004-11-01" />
 <meta name="copyright" content="Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003." />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:28 $
+:Revision: $Revision: 1.26.4.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="indirect-iterator">
@@ -32,11 +314,17 @@
 <td>Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.</td></tr>
 </tbody>
 </table>
+<!-- Distributed under the 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 field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">abstract:</th><td class="field-body"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> adapts an iterator by applying an
+<tr class="field"><th class="field-name">abstract:</th><td class="field-body"><!-- 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) -->
+<tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> adapts an iterator by applying an
 <em>extra</em> dereference inside of <tt class="docutils literal"><span class="pre">operator*()</span></tt>. For example, this
 iterator adaptor makes it possible to view a container of pointers
 (e.g. <tt class="docutils literal"><span class="pre">list&lt;foo*&gt;</span></tt>) as if it were a container of the pointed-to type
@@ -47,8 +335,8 @@
 </tr>
 </tbody>
 </table>
-<div class="contents topic" id="table-of-contents">
-<p class="topic-title first"><a name="table-of-contents">Table of Contents</a></p>
+<div class="contents topic">
+<p class="topic-title first"><a id="table-of-contents" name="table-of-contents">Table of Contents</a></p>
 <ul class="simple">
 <li><a class="reference" href="#indirect-iterator-synopsis" id="id2" name="id2"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> synopsis</a></li>
 <li><a class="reference" href="#indirect-iterator-requirements" id="id3" name="id3"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> requirements</a></li>
@@ -57,8 +345,11 @@
 <li><a class="reference" href="#example" id="id6" name="id6">Example</a></li>
 </ul>
 </div>
-<div class="section" id="indirect-iterator-synopsis">
-<h1><a class="toc-backref" href="#id2" name="indirect-iterator-synopsis"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> synopsis</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id2" id="indirect-iterator-synopsis" name="indirect-iterator-synopsis"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> synopsis</a></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) -->
 <pre class="literal-block">
 template &lt;
     class Iterator
@@ -115,9 +406,9 @@
 else
     typedef Reference reference;
 
-if (Value is use_default) then 
+if (Value is use_default) then
     typedef pointee&lt;V&gt;::type* pointer;
-else 
+else
     typedef Value* pointer;
 
 if (Difference is use_default)
@@ -135,8 +426,8 @@
     ) iterator_category;
 </pre>
 </div>
-<div class="section" id="indirect-iterator-requirements">
-<h1><a class="toc-backref" href="#id3" name="indirect-iterator-requirements"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> requirements</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id3" id="indirect-iterator-requirements" name="indirect-iterator-requirements"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> requirements</a></h1>
 <p>The expression <tt class="docutils literal"><span class="pre">*v</span></tt>, where <tt class="docutils literal"><span class="pre">v</span></tt> is an object of
 <tt class="docutils literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt>, shall be valid
 expression and convertible to <tt class="docutils literal"><span class="pre">reference</span></tt>.  <tt class="docutils literal"><span class="pre">Iterator</span></tt> shall
@@ -149,8 +440,8 @@
 parameter is not <tt class="docutils literal"><span class="pre">use_default</span></tt>, as implied by the algorithm for
 deducing the default for the <tt class="docutils literal"><span class="pre">value_type</span></tt> member.]</p>
 </div>
-<div class="section" id="indirect-iterator-models">
-<h1><a class="toc-backref" href="#id4" name="indirect-iterator-models"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> models</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id4" id="indirect-iterator-models" name="indirect-iterator-models"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> models</a></h1>
 <p>In addition to the concepts indicated by <tt class="docutils literal"><span class="pre">iterator_category</span></tt>
 and by <tt class="docutils literal"><span class="pre">iterator_traversal&lt;indirect_iterator&gt;::type</span></tt>, a
 specialization of <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> models the following
@@ -170,8 +461,8 @@
 <tt class="docutils literal"><span class="pre">indirect_iterator&lt;Y,V2,C2,R2,D2&gt;</span></tt> if and only if <tt class="docutils literal"><span class="pre">X</span></tt> is
 interoperable with <tt class="docutils literal"><span class="pre">Y</span></tt>.</p>
 </div>
-<div class="section" id="indirect-iterator-operations">
-<h1><a class="toc-backref" href="#id5" name="indirect-iterator-operations"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> operations</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id5" id="indirect-iterator-operations" name="indirect-iterator-operations"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> operations</a></h1>
 <p>In addition to the operations required by the concepts described
 above, specializations of <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> provide the
 following operations.</p>
@@ -182,7 +473,7 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">Iterator</span></tt> must be Default Constructible.</td>
 </tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> with 
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> with
 a default-constructed <tt class="docutils literal"><span class="pre">m_iterator</span></tt>.</td>
 </tr>
 </tbody>
@@ -215,7 +506,7 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">Iterator2</span></tt> is implicitly convertible to <tt class="docutils literal"><span class="pre">Iterator</span></tt>.</td>
 </tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> whose 
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> whose
 <tt class="docutils literal"><span class="pre">m_iterator</span></tt> subobject is constructed from <tt class="docutils literal"><span class="pre">y.base()</span></tt>.</td>
 </tr>
 </tbody>
@@ -260,9 +551,12 @@
 </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) -->
 </div>
-<div class="section" id="example">
-<h1><a class="toc-backref" href="#id6" name="example">Example</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id6" id="example" name="example">Example</a></h1>
 <p>This example prints an array of characters, using
 <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> to access the array of characters through an
 array of pointers. Next <tt class="docutils literal"><span class="pre">indirect_iterator</span></tt> is used with the
@@ -309,7 +603,7 @@
 
 // Example of using make_indirect_iterator()
 
-std::copy(boost::make_indirect_iterator(pointers_to_chars), 
+std::copy(boost::make_indirect_iterator(pointers_to_chars),
           boost::make_indirect_iterator(pointers_to_chars + N),
           std::ostream_iterator&lt;char&gt;(std::cout, &quot;,&quot;));
 std::cout &lt;&lt; std::endl;
@@ -323,10 +617,5 @@
 <p>The source code for this example can be found <a class="reference" href="../example/indirect_iterator_example.cpp">here</a>.</p>
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="indirect_iterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/indirect_iterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/indirect_iterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/indirect_iterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 +++++++++++++++++++
  Indirect Iterator
 +++++++++++++++++++
@@ -7,7 +11,7 @@
 :organization: `Boost Consulting`_, Indiana University `Open Systems
                Lab`_, University of Hanover `Institute for Transport
                Railway Operation and Construction`_
-:date: $Date: 2004/11/01 21:23:47 $
+:date: $Date: 2006/09/11 22:27:28 $
 :copyright: Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. 
 
 .. _`Boost Consulting`: http://www.boost-consulting.com

Modified: boost/trunk/libs/iterator/doc/indirect_iterator_abstract.rst
===================================================================
--- boost/trunk/libs/iterator/doc/indirect_iterator_abstract.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/indirect_iterator_abstract.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 ``indirect_iterator`` adapts an iterator by applying an
 *extra* dereference inside of ``operator*()``. For example, this
 iterator adaptor makes it possible to view a container of pointers

Modified: boost/trunk/libs/iterator/doc/indirect_iterator_eg.rst
===================================================================
--- boost/trunk/libs/iterator/doc/indirect_iterator_eg.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/indirect_iterator_eg.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Example
 .......
 

Deleted: boost/trunk/libs/iterator/doc/indirect_iterator_ref.diff
===================================================================
--- boost/trunk/libs/iterator/doc/indirect_iterator_ref.diff	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/indirect_iterator_ref.diff	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,245 +0,0 @@
-Index: indirect_iterator_ref.rst
-===================================================================
-RCS file: /cvsroot/boost/boost/libs/iterator/doc/indirect_iterator_ref.rst,v
-retrieving revision 1.2
-retrieving revision 1.21
-diff -w -d -u -b -r1.2 -r1.21
---- indirect_iterator_ref.rst	22 Sep 2003 19:55:00 -0000	1.2
-+++ indirect_iterator_ref.rst	15 Jan 2004 00:01:33 -0000	1.21
-
-
-
-@@ -3,82 +3,139 @@
-   template <
-       class Iterator
-     , class Value = use_default
-
-Issue 9.15
-
--    , unsigned Access  = use_default_access
--    , class Traversal  = use_default
-+    , class CategoryOrTraversal = use_default
-     , class Reference = use_default
-     , class Difference = use_default
-   >
-   class indirect_iterator
-
-Issue 9.37x
-
--    : public iterator_adaptor</* see discussion */>
-   {
--      friend class iterator_core_access;
-    public:
-+      typedef /* see below */ value_type;
-+      typedef /* see below */ reference;
-+      typedef /* see below */ pointer;
-+      typedef /* see below */ difference_type;
-+      typedef /* see below */ iterator_category;
-+
-       indirect_iterator();
-       indirect_iterator(Iterator x);
-+
-
-Issue 9.15
-
-       template <
--          class Iterator2, class Value2, unsigned Access2, class Traversal2
-+          class Iterator2, class Value2, class Category2
-         , class Reference2, class Difference2
-       >
-       indirect_iterator(
-           indirect_iterator<
--               Iterator2, Value2, Access2, Traversal2, Reference2, Difference2
-+               Iterator2, Value2, Category2, Reference2, Difference2
-           > const& y
-         , typename enable_if_convertible<Iterator2, Iterator>::type* = 0 // exposition
-       );
-
-Issue 9.37x
-
--  private: // as-if specification
--      typename indirect_iterator::reference dereference() const
--      {
--          return **this->base();
--      }
-+
-+      Iterator const& base() const;
-+      reference operator*() const;
-+      indirect_iterator& operator++();
-+      indirect_iterator& operator--();
-+  private:
-+     Iterator m_iterator; // exposition
-   };
- 
-+
-+The member types of ``indirect_iterator`` are defined according to
-+the following pseudo-code, where ``V`` is
-+``iterator_traits<Iterator>::value_type``
-+
-+.. parsed-literal::
-+
-+  if (Value is use_default) then
-+      typedef remove_const<pointee<V>::type>::type value_type;
-+  else
-+      typedef remove_const<Value>::type value_type;
-+
-+  if (Reference is use_default) then
-+      if (Value is use_default) then
-+          typedef indirect_reference<V>::type reference;
-+      else
-+          typedef Value& reference;
-+  else
-+      typedef Reference reference;
-+
-+  if (Value is use_default) then 
-+      typedef pointee<V>::type\* pointer;
-+  else 
-+      typedef Value\* pointer;
-+
-+  if (Difference is use_default)
-+      typedef iterator_traits<Iterator>::difference_type difference_type;
-+  else
-+      typedef Difference difference_type;
-+
-+  if (CategoryOrTraversal is use_default)
-+      typedef |iterator-category|_\ (
-+          iterator_traversal<Iterator>::type,``reference``,``value_type``
-+      ) iterator_category;
-+  else
-+      typedef |iterator-category|_\ (
-+          CategoryOrTraversal,``reference``,``value_type``
-+      ) iterator_category;
-+
-+
-
- ``indirect_iterator`` requirements
- ..................................
-
-Issue 9.40x
- 
--The ``value_type`` of the ``Iterator`` template parameter should
--itself be dereferenceable. The return type of the ``operator*`` for
--the ``value_type`` must be the same type as the ``Reference`` template
--parameter. The ``Value`` template parameter will be the ``value_type``
--for the ``indirect_iterator``, unless ``Value`` is const. If ``Value``
--is ``const X``, then ``value_type`` will be *non-* ``const X``.  The
--default for ``Value`` is
-+The expression ``*v``, where ``v`` is an object of
-+``iterator_traits<Iterator>::value_type``, shall be valid
-+expression and convertible to ``reference``.  ``Iterator`` shall
-+model the traversal concept indicated by ``iterator_category``.
-+``Value``, ``Reference``, and ``Difference`` shall be chosen so
-+that ``value_type``, ``reference``, and ``difference_type`` meet
-+the requirements indicated by ``iterator_category``.
- 
--::
-+[Note: there are further requirements on the
-+``iterator_traits<Iterator>::value_type`` if the ``Value``
-+parameter is not ``use_default``, as implied by the algorithm for
-+deducing the default for the ``value_type`` member.]
- 
--  iterator_traits< iterator_traits<Iterator>::value_type >::value_type
-
-Issue 9.37x
-
-+``indirect_iterator`` models
-+............................
- 
--If the default is used for ``Value``, then there must be a valid
--specialization of ``iterator_traits`` for the value type of the base
--iterator.
-+In addition to the concepts indicated by ``iterator_category``
-+and by ``iterator_traversal<indirect_iterator>::type``, a
-+specialization of ``indirect_iterator`` models the following
-+concepts, Where ``v`` is an object of
-+``iterator_traits<Iterator>::value_type``:
- 
--The ``Reference`` parameter will be the ``reference`` type of the
--``indirect_iterator``. The default is ``Value&``.
-+  * Readable Iterator if ``reference(*v)`` is convertible to
-+    ``value_type``.
- 
--The ``Access`` and ``Traversal`` parameters are passed unchanged to
--the corresponding parameters of the ``iterator_adaptor`` base
--class, and  the ``Iterator`` parameter is passed unchanged as the
--``Base`` parameter to the ``iterator_adaptor`` base class.
-+  * Writable Iterator if ``reference(*v) = t`` is a valid
-+    expression (where ``t`` is an object of type
-+    ``indirect_iterator::value_type``)
- 
--The indirect iterator will model the most refined standard traversal
--concept that is modeled by the ``Iterator`` type.  The indirect
--iterator will model the most refined standard access concept that is
--modeled by the value type of ``Iterator``.
-+  * Lvalue Iterator if ``reference`` is a reference type.
-+
-+``indirect_iterator<X,V1,C1,R1,D1>`` is interoperable with
-+``indirect_iterator<Y,V2,C2,R2,D2>`` if and only if ``X`` is
-+interoperable with ``Y``.
- 
- 
- ``indirect_iterator`` operations
- ................................
-
-Issue 9.37x
- 
-+In addition to the operations required by the concepts described
-+above, specializations of ``indirect_iterator`` provide the
-+following operations.
-+
-+
-
-Issue 9.28 and 9.37x
-
- ``indirect_iterator();``
- 
- :Requires: ``Iterator`` must be Default Constructible.
- :Returns: An instance of ``indirect_iterator`` with
--    a default constructed base object.
-+   a default-constructed ``m_iterator``.
- 
-
-Issue 9.37x
- 
- ``indirect_iterator(Iterator x);``
- 
- :Returns: An instance of ``indirect_iterator`` with
--    the ``iterator_adaptor`` subobject copy constructed from ``x``.
-+    ``m_iterator`` copy constructed from ``x``.
- 
- ::
- 
-
-Issue 9.29
-
-@@ -94,5 +151,27 @@
-   );
- 
- :Requires: ``Iterator2`` is implicitly convertible to ``Iterator``.
--:Returns: An instance of ``indirect_iterator`` that is a copy of ``y``.
-+:Returns: An instance of ``indirect_iterator`` whose 
-+    ``m_iterator`` subobject is constructed from ``y.base()``.
-+
-
-Issue 9.37x
-
-+``Iterator const& base() const;``
- 
-+:Returns: ``m_iterator``
-+
-+
-+``reference operator*() const;``
-+
-+:Returns:  ``**m_iterator``
-+
-+
-+``indirect_iterator& operator++();``
-+
-+:Effects: ``++m_iterator``
-+:Returns: ``*this``
-+
-+
-+``indirect_iterator& operator--();``
-+
-+:Effects: ``--m_iterator``
-+:Returns: ``*this``

Deleted: boost/trunk/libs/iterator/doc/indirect_iterator_ref.html
===================================================================
--- boost/trunk/libs/iterator/doc/indirect_iterator_ref.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/indirect_iterator_ref.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,220 +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.3.6: http://docutils.sourceforge.net/" />
-<title></title>
-<link rel="stylesheet" href="default.css" type="text/css" />
-</head>
-<body>
-<div class="document">
-<pre class="literal-block">
-template &lt;
-    class Iterator
-  , class Value = use_default
-  , class CategoryOrTraversal = use_default
-  , class Reference = use_default
-  , class Difference = use_default
-&gt;
-class indirect_iterator
-{
- public:
-    typedef /* see below */ value_type;
-    typedef /* see below */ reference;
-    typedef /* see below */ pointer;
-    typedef /* see below */ difference_type;
-    typedef /* see below */ iterator_category;
-
-    indirect_iterator();
-    indirect_iterator(Iterator x);
-
-    template &lt;
-        class Iterator2, class Value2, class Category2
-      , class Reference2, class Difference2
-    &gt;
-    indirect_iterator(
-        indirect_iterator&lt;
-             Iterator2, Value2, Category2, Reference2, Difference2
-        &gt; const&amp; y
-      , typename enable_if_convertible&lt;Iterator2, Iterator&gt;::type* = 0 // exposition
-    );
-
-    Iterator const&amp; base() const;
-    reference operator*() const;
-    indirect_iterator&amp; operator++();
-    indirect_iterator&amp; operator--();
-private:
-   Iterator m_iterator; // exposition
-};
-</pre>
-<p>The member types of <tt class="literal"><span class="pre">indirect_iterator</span></tt> are defined according to
-the following pseudo-code, where <tt class="literal"><span class="pre">V</span></tt> is
-<tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt></p>
-<pre class="literal-block">
-if (Value is use_default) then
-    typedef remove_const&lt;pointee&lt;V&gt;::type&gt;::type value_type;
-else
-    typedef remove_const&lt;Value&gt;::type value_type;
-
-if (Reference is use_default) then
-    if (Value is use_default) then
-        typedef indirect_reference&lt;V&gt;::type reference;
-    else
-        typedef Value&amp; reference;
-else
-    typedef Reference reference;
-
-if (Value is use_default) then 
-    typedef pointee&lt;V&gt;::type* pointer;
-else 
-    typedef Value* pointer;
-
-if (Difference is use_default)
-    typedef iterator_traits&lt;Iterator&gt;::difference_type difference_type;
-else
-    typedef Difference difference_type;
-
-if (CategoryOrTraversal is use_default)
-    typedef <em>iterator-category</em> (
-        iterator_traversal&lt;Iterator&gt;::type,``reference``,``value_type``
-    ) iterator_category;
-else
-    typedef <em>iterator-category</em> (
-        CategoryOrTraversal,``reference``,``value_type``
-    ) iterator_category;
-</pre>
-<div class="section" id="indirect-iterator-requirements">
-<h1><a name="indirect-iterator-requirements"><tt class="literal"><span class="pre">indirect_iterator</span></tt> requirements</a></h1>
-<p>The expression <tt class="literal"><span class="pre">*v</span></tt>, where <tt class="literal"><span class="pre">v</span></tt> is an object of
-<tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt>, shall be valid
-expression and convertible to <tt class="literal"><span class="pre">reference</span></tt>.  <tt class="literal"><span class="pre">Iterator</span></tt> shall
-model the traversal concept indicated by <tt class="literal"><span class="pre">iterator_category</span></tt>.
-<tt class="literal"><span class="pre">Value</span></tt>, <tt class="literal"><span class="pre">Reference</span></tt>, and <tt class="literal"><span class="pre">Difference</span></tt> shall be chosen so
-that <tt class="literal"><span class="pre">value_type</span></tt>, <tt class="literal"><span class="pre">reference</span></tt>, and <tt class="literal"><span class="pre">difference_type</span></tt> meet
-the requirements indicated by <tt class="literal"><span class="pre">iterator_category</span></tt>.</p>
-<p>[Note: there are further requirements on the
-<tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt> if the <tt class="literal"><span class="pre">Value</span></tt>
-parameter is not <tt class="literal"><span class="pre">use_default</span></tt>, as implied by the algorithm for
-deducing the default for the <tt class="literal"><span class="pre">value_type</span></tt> member.]</p>
-</div>
-<div class="section" id="indirect-iterator-models">
-<h1><a name="indirect-iterator-models"><tt class="literal"><span class="pre">indirect_iterator</span></tt> models</a></h1>
-<p>In addition to the concepts indicated by <tt class="literal"><span class="pre">iterator_category</span></tt>
-and by <tt class="literal"><span class="pre">iterator_traversal&lt;indirect_iterator&gt;::type</span></tt>, a
-specialization of <tt class="literal"><span class="pre">indirect_iterator</span></tt> models the following
-concepts, Where <tt class="literal"><span class="pre">v</span></tt> is an object of
-<tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt>:</p>
-<blockquote>
-<ul class="simple">
-<li>Readable Iterator if <tt class="literal"><span class="pre">reference(*v)</span></tt> is convertible to
-<tt class="literal"><span class="pre">value_type</span></tt>.</li>
-<li>Writable Iterator if <tt class="literal"><span class="pre">reference(*v)</span> <span class="pre">=</span> <span class="pre">t</span></tt> is a valid
-expression (where <tt class="literal"><span class="pre">t</span></tt> is an object of type
-<tt class="literal"><span class="pre">indirect_iterator::value_type</span></tt>)</li>
-<li>Lvalue Iterator if <tt class="literal"><span class="pre">reference</span></tt> is a reference type.</li>
-</ul>
-</blockquote>
-<p><tt class="literal"><span class="pre">indirect_iterator&lt;X,V1,C1,R1,D1&gt;</span></tt> is interoperable with
-<tt class="literal"><span class="pre">indirect_iterator&lt;Y,V2,C2,R2,D2&gt;</span></tt> if and only if <tt class="literal"><span class="pre">X</span></tt> is
-interoperable with <tt class="literal"><span class="pre">Y</span></tt>.</p>
-</div>
-<div class="section" id="indirect-iterator-operations">
-<h1><a name="indirect-iterator-operations"><tt class="literal"><span class="pre">indirect_iterator</span></tt> operations</a></h1>
-<p>In addition to the operations required by the concepts described
-above, specializations of <tt class="literal"><span class="pre">indirect_iterator</span></tt> provide the
-following operations.</p>
-<p><tt class="literal"><span class="pre">indirect_iterator();</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="literal"><span class="pre">Iterator</span></tt> must be Default Constructible.</td>
-</tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="literal"><span class="pre">indirect_iterator</span></tt> with 
-a default-constructed <tt class="literal"><span class="pre">m_iterator</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">indirect_iterator(Iterator</span> <span class="pre">x);</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="literal"><span class="pre">indirect_iterator</span></tt> with
-<tt class="literal"><span class="pre">m_iterator</span></tt> copy constructed from <tt class="literal"><span class="pre">x</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;
-    class Iterator2, class Value2, unsigned Access, class Traversal
-  , class Reference2, class Difference2
-&gt;
-indirect_iterator(
-    indirect_iterator&lt;
-         Iterator2, Value2, Access, Traversal, Reference2, Difference2
-    &gt; const&amp; y
-  , typename enable_if_convertible&lt;Iterator2, Iterator&gt;::type* = 0 // exposition
-);
-</pre>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="literal"><span class="pre">Iterator2</span></tt> is implicitly convertible to <tt class="literal"><span class="pre">Iterator</span></tt>.</td>
-</tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="literal"><span class="pre">indirect_iterator</span></tt> whose 
-<tt class="literal"><span class="pre">m_iterator</span></tt> subobject is constructed from <tt class="literal"><span class="pre">y.base()</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">Iterator</span> <span class="pre">const&amp;</span> <span class="pre">base()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">m_iterator</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">reference</span> <span class="pre">operator*()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">**m_iterator</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">indirect_iterator&amp;</span> <span class="pre">operator++();</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><tt class="literal"><span class="pre">++m_iterator</span></tt></td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*this</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">indirect_iterator&amp;</span> <span class="pre">operator--();</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><tt class="literal"><span class="pre">--m_iterator</span></tt></td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*this</span></tt></td>
-</tr>
-</tbody>
-</table>
-</div>
-</div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="indirect_iterator_ref.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
-</body>
-</html>

Modified: boost/trunk/libs/iterator/doc/indirect_iterator_ref.rst
===================================================================
--- boost/trunk/libs/iterator/doc/indirect_iterator_ref.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/indirect_iterator_ref.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 ::
 
   template <

Modified: boost/trunk/libs/iterator/doc/interoperability-revisited.rst
===================================================================
--- boost/trunk/libs/iterator/doc/interoperability-revisited.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/interoperability-revisited.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,9 +2,12 @@
  Interoperability Revisited 
 ++++++++++++++++++++++++++++
 
-:date: $Date: 2005/02/27 17:28:10 $
+:date: $Date: 2006/09/29 01:59:16 $
 :copyright: Copyright Thomas Witt 2004.
 
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 Problem
 =======

Deleted: boost/trunk/libs/iterator/doc/issues.html
===================================================================
--- boost/trunk/libs/iterator/doc/issues.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/issues.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,170 +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.3.6: http://docutils.sourceforge.net/" />
-<title>Problem with is_writable and is_swappable in N1550</title>
-<link rel="stylesheet" href="default.css" type="text/css" />
-</head>
-<body>
-<h1 class="title">Problem with <tt class="literal"><span class="pre">is_writable</span></tt> and <tt class="literal"><span class="pre">is_swappable</span></tt> in <a class="reference" href="http://www.boost-consulting.com/writing/n1550.html">N1550</a></h1>
-<div class="document" id="problem-with-is-writable-and-is-swappable-in-n1550">
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Author:</th><td class="field-body">David Abrahams and Jeremy Siek</td>
-</tr>
-<tr class="field"><th class="field-name">Contact:</th><td class="field-body"><a class="reference" href="mailto:dave&#64;boost-consulting.com">dave&#64;boost-consulting.com</a>, <a class="reference" href="mailto:jsiek&#64;osl.iu.edu">jsiek&#64;osl.iu.edu</a></td>
-</tr>
-<tr class="field"><th class="field-name">Organization:</th><td class="field-body"><a class="reference" href="http://www.boost-consulting.com">Boost Consulting</a>, Indiana University Bloomington</td>
-</tr>
-<tr class="field"><th class="field-name">date:</th><td class="field-body">$Date: 2004/11/02 14:31:17 $</td>
-</tr>
-<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Copyright David Abrahams, Jeremy Siek 2003. Use, modification and
-distribution is subject to the Boost Software License,
-Version 1.0. (See accompanying file LICENSE_1_0.txt or copy
-at <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</td>
-</tr>
-</tbody>
-</table>
-<div class="contents topic" id="table-of-contents">
-<p class="topic-title first"><a name="table-of-contents">Table of Contents</a></p>
-<ul class="simple">
-<li><a class="reference" href="#introduction" id="id1" name="id1">Introduction</a></li>
-<li><a class="reference" href="#proposed-resolution" id="id2" name="id2">Proposed Resolution</a></li>
-<li><a class="reference" href="#rationale" id="id3" name="id3">Rationale</a></li>
-</ul>
-</div>
-<div class="section" id="introduction">
-<h1><a class="toc-backref" href="#id1" name="introduction">Introduction</a></h1>
-<p>The <tt class="literal"><span class="pre">is_writable</span></tt> and <tt class="literal"><span class="pre">is_swappable</span></tt> traits classes in <a class="reference" href="http://www.boost-consulting.com/writing/n1550.html">N1550</a>
-provide a mechanism for determining at compile time if an iterator
-type is a model of the new Writable Iterator and Swappable Iterator
-concepts, analogous to <tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::iterator_category</span></tt>
-for the old iterator concepts. For backward compatibility,
-<tt class="literal"><span class="pre">is_writable</span></tt> and <tt class="literal"><span class="pre">is_swappable</span></tt> not only work with new
-iterators, but they also are intended to work for old
-iterators (iterators that meet the requirements for one of the
-iterator concepts in the current standard). In the case of old
-iterators, the writability and swapability is deduced based on the
-<tt class="literal"><span class="pre">iterator_category</span></tt> and also the <tt class="literal"><span class="pre">reference</span></tt> type. The
-specification for this deduction gives false positives for forward
-iterators that have non-assignable value types.</p>
-<p>To review, the part of the <tt class="literal"><span class="pre">is_writable</span></tt> trait definition which
-applies to old iterators is:</p>
-<pre class="literal-block">
-if (cat is convertible to output_iterator_tag)
-    return true;
-else if (cat is convertible to forward_iterator_tag
-         and iterator_traits&lt;Iterator&gt;::reference is a 
-             mutable reference)
-    return true;
-else
-    return false;
-</pre>
-<p>Suppose the <tt class="literal"><span class="pre">value_type</span></tt> of the iterator <tt class="literal"><span class="pre">It</span></tt> has a private
-assignment operator:</p>
-<pre class="literal-block">
-class B {
-public:
-  ...
-private:
-  B&amp; operator=(const B&amp;);
-};
-</pre>
-<p>and suppose the <tt class="literal"><span class="pre">reference</span></tt> type of the iterator is <tt class="literal"><span class="pre">B&amp;</span></tt>.  In
-that case, <tt class="literal"><span class="pre">is_writable&lt;It&gt;::value</span></tt> will be true when in fact
-attempting to write into <tt class="literal"><span class="pre">B</span></tt> will cause an error.</p>
-<p>The same problem applies to <tt class="literal"><span class="pre">is_swappable</span></tt>.</p>
-</div>
-<div class="section" id="proposed-resolution">
-<h1><a class="toc-backref" href="#id2" name="proposed-resolution">Proposed Resolution</a></h1>
-<ol class="arabic">
-<li><p class="first">Remove the <tt class="literal"><span class="pre">is_writable</span></tt> and <tt class="literal"><span class="pre">is_swappable</span></tt> traits, and remove the
-requirements in the Writable Iterator and Swappable Iterator concepts
-that require their models to support these traits.</p>
-</li>
-<li><p class="first">Change the <tt class="literal"><span class="pre">is_readable</span></tt> specification to be:
-<tt class="literal"><span class="pre">is_readable&lt;X&gt;::type</span></tt> is <tt class="literal"><span class="pre">true_type</span></tt> if the
-result type of <tt class="literal"><span class="pre">X::operator*</span></tt> is convertible to
-<tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::value_type</span></tt> and is <tt class="literal"><span class="pre">false_type</span></tt>
-otherwise. Also, <tt class="literal"><span class="pre">is_readable</span></tt> is required to satisfy
-the requirements for the UnaryTypeTrait concept
-(defined in the type traits proposal).</p>
-<p>Remove the requirement for support of the <tt class="literal"><span class="pre">is_readable</span></tt> trait from
-the Readable Iterator concept.</p>
-</li>
-<li><p class="first">Remove the <tt class="literal"><span class="pre">iterator_tag</span></tt> class.</p>
-</li>
-<li><p class="first">Change the specification of <tt class="literal"><span class="pre">traversal_category</span></tt> to:</p>
-<pre class="literal-block">
-traversal-category(Iterator) =
-    let cat = iterator_traits&lt;Iterator&gt;::iterator_category
-    if (cat is convertible to incrementable_iterator_tag)
-      return cat; // Iterator is a new iterator
-    else if (cat is convertible to random_access_iterator_tag)
-        return random_access_traversal_tag;
-    else if (cat is convertible to bidirectional_iterator_tag)
-        return bidirectional_traversal_tag;
-    else if (cat is convertible to forward_iterator_tag)
-        return forward_traversal_tag;
-    else if (cat is convertible to input_iterator_tag)
-        return single_pass_iterator_tag;
-    else if (cat is convertible to output_iterator_tag)
-        return incrementable_iterator_tag;
-    else
-        return null_category_tag;
-</pre>
-</li>
-</ol>
-</div>
-<div class="section" id="rationale">
-<h1><a class="toc-backref" href="#id3" name="rationale">Rationale</a></h1>
-<ol class="arabic simple">
-<li>There are two reasons for removing <tt class="literal"><span class="pre">is_writable</span></tt>
-and <tt class="literal"><span class="pre">is_swappable</span></tt>. The first is that we do not know of
-a way to fix the specification so that it gives the correct
-answer for all iterators. Second, there was only a weak
-motivation for having <tt class="literal"><span class="pre">is_writable</span></tt> and <tt class="literal"><span class="pre">is_swappable</span></tt>
-there in the first place.  The main motivation was simply
-uniformity: we have tags for the old iterator categories
-so we should have tags for the new iterator categories.
-While having tags and the capability to dispatch based
-on the traversal categories is often used, we see
-less of a need for dispatching based on writability
-and swappability, since typically algorithms
-that need these capabilities have no alternative if
-they are not provided.</li>
-<li>We discovered that the <tt class="literal"><span class="pre">is_readable</span></tt> trait can be implemented
-using only the iterator type itself and its <tt class="literal"><span class="pre">value_type</span></tt>.
-Therefore we remove the requirement for <tt class="literal"><span class="pre">is_readable</span></tt> from the
-Readable Iterator concept, and change the definition of
-<tt class="literal"><span class="pre">is_readable</span></tt> so that it works for any iterator type.</li>
-<li>The purpose of the <tt class="literal"><span class="pre">iterator_tag</span></tt> class was to
-bundle the traversal and access category tags
-into the <tt class="literal"><span class="pre">iterator_category</span></tt> typedef.
-With <tt class="literal"><span class="pre">is_writable</span></tt> and <tt class="literal"><span class="pre">is_swappable</span></tt> gone, and
-<tt class="literal"><span class="pre">is_readable</span></tt> no longer in need of special hints,
-there is no reason for iterators to provide
-information about the access capabilities of an iterator.
-Thus there is no need for the <tt class="literal"><span class="pre">iterator_tag</span></tt>. The
-traversal tag can be directly used for the
-<tt class="literal"><span class="pre">iterator_category</span></tt>. If a new iterator is intended to be backward
-compatible with old iterator concepts, a tag type
-that is convertible to both one of the new traversal tags 
-and also to an old iterator tag can be created and use
-for the <tt class="literal"><span class="pre">iterator_category</span></tt>.</li>
-<li>The changes to the specification of <tt class="literal"><span class="pre">traversal_category</span></tt> are a 
-direct result of the removal of <tt class="literal"><span class="pre">iterator_tag</span></tt>.</li>
-</ol>
-</div>
-</div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="issues.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
-</body>
-</html>

Deleted: boost/trunk/libs/iterator/doc/iter-issue-list.html
===================================================================
--- boost/trunk/libs/iterator/doc/iter-issue-list.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iter-issue-list.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5268 +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.3.6: http://docutils.sourceforge.net/" />
-<title>Iterator concept and adapter issues</title>
-<meta name="date" content="2004-01-27" />
-<link rel="stylesheet" href="default.css" type="text/css" />
-</head>
-<body>
-<h1 class="title">Iterator concept and adapter issues</h1>
-<table class="docinfo" frame="void" rules="none">
-<col class="docinfo-name" />
-<col class="docinfo-content" />
-<tbody valign="top">
-<tr><th class="docinfo-name">Date:</th>
-<td>2004-01-27</td></tr>
-</tbody>
-</table>
-<div class="document" id="iterator-concept-and-adapter-issues">
-<div class="contents topic" id="index">
-<p class="topic-title first"><a name="index">Index</a></p>
-<ul class="simple">
-<li><a class="reference" href="#issues-from-matt-s-tr-issues-list" id="id1" name="id1">Issues from Matt's TR issues list</a><ul>
-<li><a class="reference" href="#iterator-access-overspecified" id="id2" name="id2">9.1 iterator_access overspecified?</a></li>
-<li><a class="reference" href="#operators-of-iterator-facade-overspecified" id="id3" name="id3">9.2 operators of iterator_facade overspecified</a></li>
-<li><a class="reference" href="#enable-if-interoperable-needs-standardese" id="id4" name="id4">9.3 enable_if_interoperable needs standardese</a></li>
-<li><a class="reference" href="#enable-if-convertible-unspecified-conflicts-with-requires" id="id5" name="id5">9.4 enable_if_convertible unspecified, conflicts with requires</a></li>
-<li><a class="reference" href="#iterator-adaptor-has-an-extraneous-bool-at-the-start-of-the-template-definition" id="id6" name="id6">9.5 iterator_adaptor has an extraneous 'bool' at the start of the template definition</a></li>
-<li><a class="reference" href="#name-of-private-member-shouldn-t-be-normative" id="id7" name="id7">9.6 Name of private member shouldn't be normative</a></li>
-<li><a class="reference" href="#iterator-adaptor-operations-specifications-are-a-bit-inconsistent" id="id8" name="id8">9.7 iterator_adaptor operations specifications are a bit inconsistent</a></li>
-<li><a class="reference" href="#specialized-adaptors-text-should-be-normative" id="id9" name="id9">9.8 Specialized adaptors text should be normative</a></li>
-<li><a class="reference" href="#reverse-iterator-text-is-too-informal" id="id10" name="id10">9.9 Reverse_iterator text is too informal</a></li>
-<li><a class="reference" href="#prior-is-undefined" id="id11" name="id11">9.10 'prior' is undefined</a></li>
-<li><a class="reference" href="#in-other-words-is-bad-wording" id="id12" name="id12">9.11 &quot;In other words&quot; is bad wording</a></li>
-<li><a class="reference" href="#transform-iterator-shouldn-t-mandate-private-member" id="id13" name="id13">9.12 Transform_iterator shouldn't mandate private member</a></li>
-<li><a class="reference" href="#unclear-description-of-counting-iterator" id="id14" name="id14">9.13 Unclear description of counting iterator</a></li>
-<li><a class="reference" href="#counting-iterator-s-difference-type" id="id15" name="id15">9.14 Counting_iterator's difference type</a></li>
-<li><a class="reference" href="#how-to-detect-lvalueness" id="id16" name="id16">9.15 How to detect lvalueness?</a></li>
-<li><a class="reference" href="#is-writable-iterator-returns-false-positives" id="id17" name="id17">9.16 is_writable_iterator returns false positives</a></li>
-<li><a class="reference" href="#is-swappable-iterator-returns-false-positives" id="id18" name="id18">9.17 is_swappable_iterator returns false positives</a></li>
-<li><a class="reference" href="#are-is-readable-is-writable-and-is-swappable-useful" id="id19" name="id19">9.18 Are is_readable, is_writable, and is_swappable useful?</a></li>
-<li><a class="reference" href="#non-uniformity-of-the-lvalue-iterator-bit" id="id20" name="id20">9.19 Non-Uniformity of the &quot;lvalue_iterator Bit&quot;</a></li>
-<li><a class="reference" href="#traversal-concepts-and-tags" id="id21" name="id21">9.20 Traversal Concepts and Tags</a></li>
-<li><a class="reference" href="#iterator-facade-derived-template-argument-underspecified" id="id22" name="id22">9.21 iterator_facade Derived template argument underspecified</a></li>
-<li><a class="reference" href="#return-type-of-iterator-difference-for-iterator-facade" id="id23" name="id23">9.22 return type of Iterator difference for iterator facade</a></li>
-<li><a class="reference" href="#iterator-facade-minor-wording-issue" id="id24" name="id24">9.23 Iterator_facade: minor wording Issue</a></li>
-<li><a class="reference" href="#use-of-undefined-name-in-iterator-facade-table" id="id25" name="id25">9.24 Use of undefined name in iterator_facade table</a></li>
-<li><a class="reference" href="#iterator-facade-wrong-return-type" id="id26" name="id26">9.25 Iterator_facade: wrong return type</a></li>
-<li><a class="reference" href="#iterator-facade-unclear-returns-clause-for-operator" id="id27" name="id27">9.26 Iterator_facade: unclear returns clause for operator[]</a></li>
-<li><a class="reference" href="#iterator-facade-redundant-clause" id="id28" name="id28">9.27 Iterator_facade: redundant clause</a></li>
-<li><a class="reference" href="#indirect-iterator-incorrect-specification-of-default-constructor" id="id29" name="id29">9.28 indirect_iterator: incorrect specification of default constructor</a></li>
-<li><a class="reference" href="#indirect-iterator-unclear-specification-of-template-constructor" id="id30" name="id30">9.29 indirect_iterator: unclear specification of template constructor</a></li>
-<li><a class="reference" href="#transform-iterator-argument-irregularity" id="id31" name="id31">9.30 transform_iterator argument irregularity</a></li>
-<li><a class="reference" href="#function-output-iterator-overconstrained" id="id32" name="id32">9.31 function_output_iterator overconstrained</a></li>
-<li><a class="reference" href="#should-output-proxy-really-be-a-named-type" id="id33" name="id33">9.32 Should output_proxy really be a named type?</a></li>
-<li><a class="reference" href="#istreambuf-iterator-isn-t-a-readable-iterator" id="id34" name="id34">9.33 istreambuf_iterator isn't a Readable Iterator</a></li>
-<li><a class="reference" href="#iterator-facade-free-functions-unspecified" id="id35" name="id35">9.34 iterator_facade free functions unspecified</a></li>
-<li><a class="reference" href="#iterator-facade-too-many-equals" id="id36" name="id36">9.35 iterator_facade: too many equals?</a></li>
-<li><a class="reference" href="#iterator-facade-function-requirements" id="id37" name="id37">9.36 iterator_facade function requirements</a></li>
-</ul>
-</li>
-<li><a class="reference" href="#more-issues-not-from-matt-s-list" id="id38" name="id38">More Issues (not from Matt's list)</a><ul>
-<li><a class="reference" href="#x-inheritance-in-iterator-adaptor-and-other-adaptors-is-an-overspecification" id="id39" name="id39">9.37x Inheritance in iterator_adaptor and other adaptors is an overspecification</a></li>
-<li><a class="reference" href="#x-problem-with-specification-of-a-m-in-readable-iterator" id="id40" name="id40">9.38x Problem with specification of a-&gt;m in Readable Iterator</a></li>
-<li><a class="reference" href="#x-counting-iterator-traversal-argument-unspecified" id="id41" name="id41">9.39x counting_iterator Traversal argument unspecified</a></li>
-<li><a class="reference" href="#x-indirect-iterator-requirements-muddled" id="id42" name="id42">9.40x indirect_iterator requirements muddled</a></li>
-<li><a class="reference" href="#x-problem-with-transform-iterator-requirements" id="id43" name="id43">9.41x Problem with transform_iterator requirements</a></li>
-<li><a class="reference" href="#x-filter-iterator-details-unspecified" id="id44" name="id44">9.42x filter_iterator details unspecified</a></li>
-<li><a class="reference" href="#x-transform-iterator-interoperability-too-restrictive" id="id45" name="id45">9.43x transform_iterator interoperability too restrictive</a></li>
-<li><a class="reference" href="#y-indirect-iterator-and-smart-pointers" id="id46" name="id46">9.44y <tt class="literal"><span class="pre">indirect_iterator</span></tt> and smart pointers</a></li>
-<li><a class="reference" href="#y-n1530-typos-and-editorial-changes-in-proposal-text-not-standardese" id="id47" name="id47">9.45y N1530: Typos and editorial changes in proposal text (not standardese)</a></li>
-<li><a class="reference" href="#y-n1530-base-return-by-value-is-costly" id="id48" name="id48">9.46y N1530: <tt class="literal"><span class="pre">base()</span></tt> return-by-value is costly</a></li>
-<li><a class="reference" href="#x-forgot-default-constructible-in-forward-traversal-iterator" id="id49" name="id49">9.47x Forgot default constructible in Forward Traversal Iterator</a></li>
-<li><a class="reference" href="#x-editorial-changes-non-normative-text" id="id50" name="id50">9.48x Editorial changes (non-normative text)</a></li>
-<li><a class="reference" href="#x-clarification-of-iterator-facade-requirements-and-type-members" id="id51" name="id51">9.49x Clarification of iterator_facade requirements and type members</a></li>
-</ul>
-</li>
-</ul>
-</div>
-<div class="section" id="issues-from-matt-s-tr-issues-list">
-<h1><a class="toc-backref" href="#id1" name="issues-from-matt-s-tr-issues-list">Issues from Matt's TR issues list</a></h1>
-<div class="section" id="iterator-access-overspecified">
-<h2><a class="toc-backref" href="#id2" name="iterator-access-overspecified">9.1 iterator_access overspecified?</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>The proposal includes:</p>
-<pre class="literal-block">
-enum iterator_access { 
-   readable_iterator = 1, writable_iterator = 2,
-   swappable_iterator = 4, lvalue_iterator = 8
-}; 
-</pre>
-<p>In general, the standard specifies thing like this as a bitmask
-type with a list of defined names, and specifies neither the exact
-type nor the specific values. Is there a reason for iterator_access
-to be more specific?</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">The <tt class="literal"><span class="pre">iterator_access</span></tt> enum will be removed,
-so this is no longer an issue.  See the resolution to 9.15.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="operators-of-iterator-facade-overspecified">
-<h2><a class="toc-backref" href="#id3" name="operators-of-iterator-facade-overspecified">9.2 operators of iterator_facade overspecified</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>In general, we've provided operational semantics for things like
-operator++. That is, we've said that ++iter must work, without
-requiring either a member function or a non-member function.
-iterator_facade specifies most operators as member
-functions. There's no inherent reason for these to be members, so
-we should remove this requirement. Similarly, some operations are
-specified as non-member functions but could be implemented as
-members. Again, the standard doesn't make either of these choices,
-and TR1 shouldn't, either. So: <tt class="literal"><span class="pre">operator*()</span></tt>, <tt class="literal"><span class="pre">operator++()</span></tt>,
-<tt class="literal"><span class="pre">operator++(int)</span></tt>, <tt class="literal"><span class="pre">operator--()</span></tt>, <tt class="literal"><span class="pre">operator--(int)</span></tt>,
-<tt class="literal"><span class="pre">operator+=</span></tt>, <tt class="literal"><span class="pre">operator-=</span></tt>, <tt class="literal"><span class="pre">operator-(difference_type)</span></tt>,
-<tt class="literal"><span class="pre">operator-(iterator_facade</span> <span class="pre">instance)</span></tt>, and <tt class="literal"><span class="pre">operator+</span></tt> should
-be specified with operational semantics and not explicitly required
-to be members or non-members.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">Not a defect.</td>
-</tr>
-<tr class="field"><th class="field-name">Rationale:</th><td class="field-body">The standard uses valid expressions such as <tt class="literal"><span class="pre">++iter</span></tt>
-in requirements tables, such as for input iterator.  However, for
-classes, such as <tt class="literal"><span class="pre">reverse_iterator</span></tt>, the standard uses function
-prototypes, as we have done here for
-<tt class="literal"><span class="pre">iterator_facade</span></tt>. Further, the prototype specification does
-not prevent the implementor from using members or non-members,
-since nothing the user can do in a conforming program can detect
-how the function is implemented.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="enable-if-interoperable-needs-standardese">
-<h2><a class="toc-backref" href="#id4" name="enable-if-interoperable-needs-standardese">9.3 enable_if_interoperable needs standardese</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>The only discussion of what this means is in a note, so is
-non-normative. Further, the note seems to be incorrect. It says
-that enable_if_interoperable only works for types that &quot;are
-interoperable, by which we mean they are convertible to each
-other.&quot; This requirement is too strong: it should be that one of
-the types is convertible to the other.  N1541 48</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Add normative text. Relax requirements in the
-proposed way.</p>
-<p>Change:</p>
-<blockquote>
-[<em>Note:</em> The <tt class="literal"><span class="pre">enable_if_interoperable</span></tt> template used above is
-for exposition purposes. The member operators should be only be
-in an overload set provided the derived types <tt class="literal"><span class="pre">Dr1</span></tt> and
-<tt class="literal"><span class="pre">Dr2</span></tt> are interoperable, by which we mean they are
-convertible to each other.  The <tt class="literal"><span class="pre">enable_if_interoperable</span></tt>
-approach uses SFINAE to take the operators out of the overload
-set when the types are not interoperable.]</blockquote>
-<p>To:</p>
-<blockquote class="last">
-<p>The <tt class="literal"><span class="pre">enable_if_interoperable</span></tt> template used above is for
-exposition purposes.  The member operators should only be in an
-overload set provided the derived types <tt class="literal"><span class="pre">Dr1</span></tt> and <tt class="literal"><span class="pre">Dr2</span></tt> are
-interoperable, meaning that at least one of the types is
-convertible to the other.  The <tt class="literal"><span class="pre">enable_if_interoperable</span></tt>
-approach uses SFINAE to take the operators out of the overload
-set when the types are not interoperable.  The operators should
-behave <em>as-if</em> <tt class="literal"><span class="pre">enable_if_interoperable</span></tt> were defined to be:</p>
-<pre class="literal-block">
-template &lt;bool, typename&gt; enable_if_interoperable_impl
-{};
-
-template &lt;typename T&gt; enable_if_interoperable_impl&lt;true,T&gt;
-{ typedef T type; };
-
-template&lt;typename Dr1, typename Dr2, typename T&gt;
-struct enable_if_interoperable
-  : enable_if_interoperable_impl&lt;
-        is_convertible&lt;Dr1,Dr2&gt;::value || is_convertible&lt;Dr2,Dr1&gt;::value
-      , T
-    &gt;
-{};
-</pre>
-</blockquote>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="enable-if-convertible-unspecified-conflicts-with-requires">
-<h2><a class="toc-backref" href="#id5" name="enable-if-convertible-unspecified-conflicts-with-requires">9.4 enable_if_convertible unspecified, conflicts with requires</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>In every place where enable_if_convertible is used it's used like
-this (simplified):</p>
-<pre class="literal-block">
-template&lt;class T&gt;
-struct C
-{
-  template&lt;class T1&gt;
-  C(T1, enable_if_convertible&lt;T1, T&gt;::type* = 0);
-};
-</pre>
-<p>The idea being that this constructor won't compile if T1 isn't
-convertible to T. As a result, the constructor won't be considered
-as a possible overload when constructing from an object x where the
-type of x isn't convertible to T. In addition, however, each of
-these constructors has a requires clause that requires
-convertibility, so the behavior of a program that attempts such a
-construction is undefined. Seems like the enable_if_convertible
-part is irrelevant, and should be removed.  There are two
-problems. First, enable_if_convertible is never specified, so we
-don't know what this is supposed to do. Second: we could reasonably
-say that this overload should be disabled in certain cases or we
-could reasonably say that behavior is undefined, but we can't say
-both.</p>
-<p>Thomas Witt writes that the goal of putting in
-enable_if_convertible here is to make sure that a specific overload
-doesn't interfere with the generic case except when that overload
-makes sense. He agrees that what we currently have is deficient.
-Dave Abrahams writes that there is no conflict with the requires
-cause because the requires clause only takes effect when the
-function is actually called. The presence of the constructor
-signature can/will be detected by is_convertible without violating
-the requires clause, and thus it makes a difference to disable
-those constructor instantiations that would be disabled by
-enable_if_convertible even if calling them invokes undefined
-behavior.  There was more discussion on the reflector:
-c++std-lib-12312, c++std-lib-12325, c++std-lib- 12330,
-c++std-lib-12334, c++std-lib-12335, c++std-lib-12336,
-c++std-lib-12338, c++std-lib- 12362.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Change:</p>
-<blockquote>
-[<em>Note:</em> The <tt class="literal"><span class="pre">enable_if_convertible&lt;X,Y&gt;::type</span></tt> expression
-used in this section is for exposition purposes. The converting
-constructors for specialized adaptors should be only be in an
-overload set provided that an object of type <tt class="literal"><span class="pre">X</span></tt> is
-implicitly convertible to an object of type <tt class="literal"><span class="pre">Y</span></tt>.  The
-<tt class="literal"><span class="pre">enable_if_convertible</span></tt> approach uses SFINAE to take the
-constructor out of the overload set when the types are not
-implicitly convertible.]</blockquote>
-<p>To:</p>
-<blockquote class="last">
-<p>The <tt class="literal"><span class="pre">enable_if_convertible&lt;X,Y&gt;::type</span></tt> expression used in
-this section is for exposition purposes. The converting
-constructors for specialized adaptors should be only be in an
-overload set provided that an object of type <tt class="literal"><span class="pre">X</span></tt> is
-implicitly convertible to an object of type <tt class="literal"><span class="pre">Y</span></tt>.  The
-signatures involving <tt class="literal"><span class="pre">enable_if_convertible</span></tt> should behave
-<em>as-if</em> <tt class="literal"><span class="pre">enable_if_convertible</span></tt> were defined to be:</p>
-<pre class="literal-block">
-template &lt;bool&gt; enable_if_convertible_impl
-{};
-
-template &lt;&gt; enable_if_convertible_impl&lt;true&gt;
-{ struct type; };
-
-template&lt;typename From, typename To&gt;
-struct enable_if_convertible
-  : enable_if_convertible_impl&lt;is_convertible&lt;From,To&gt;::value&gt;
-{};
-</pre>
-<p>If an expression other than the default argument is used to
-supply the value of a function parameter whose type is written
-in terms of <tt class="literal"><span class="pre">enable_if_convertible</span></tt>, the program is
-ill-formed, no diagnostic required.</p>
-<p>[<em>Note:</em> The <tt class="literal"><span class="pre">enable_if_convertible</span></tt> approach uses SFINAE to
-take the constructor out of the overload set when the types are
-not implicitly convertible.  ]</p>
-</blockquote>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="iterator-adaptor-has-an-extraneous-bool-at-the-start-of-the-template-definition">
-<h2><a class="toc-backref" href="#id6" name="iterator-adaptor-has-an-extraneous-bool-at-the-start-of-the-template-definition">9.5 iterator_adaptor has an extraneous 'bool' at the start of the template definition</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>The title says it all; this is probably just a typo.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">Remove the 'bool'.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="name-of-private-member-shouldn-t-be-normative">
-<h2><a class="toc-backref" href="#id7" name="name-of-private-member-shouldn-t-be-normative">9.6 Name of private member shouldn't be normative</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>iterator_adaptor has a private member named m_iterator. Presumably
-this is for exposition only, since it's an implementation
-detail. It needs to be marked as such.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><dl class="first">
-<dt>Mark the member <tt class="literal"><span class="pre">m_iterator</span></tt> as exposition</dt>
-<dd>only.  Note/DWA: I think this is NAD because the user can't
-detect it, though I'm happy to mark it exposition only.</dd>
-</dl>
-<p>In [lib.iterator.adaptor]</p>
-<p>Change:</p>
-<pre class="literal-block">
-Base m_iterator;
-</pre>
-<p>to:</p>
-<pre class="last literal-block">
-Base m_iterator; // exposition only
-</pre>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="iterator-adaptor-operations-specifications-are-a-bit-inconsistent">
-<h2><a class="toc-backref" href="#id8" name="iterator-adaptor-operations-specifications-are-a-bit-inconsistent">9.7 iterator_adaptor operations specifications are a bit inconsistent</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>iterator_adpator() has a Requires clause, that Base must be default
-constructible.  iterator_adaptor(Base) has no Requires clause,
-although the Returns clause says that the Base member is copy
-construced from the argument (this may actually be an oversight in
-N1550, which doesn't require iterators to be copy constructible or
-assignable).</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Add a requirements section for the template
-parameters of iterator_adaptor, and state that Base must be Copy
-Constructible and Assignable.</p>
-<p class="last">N1550 does in fact include requirements for copy constructible
-and assignable in the requirements tables. To clarify, we've also
-added the requirements to the text.</p>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="specialized-adaptors-text-should-be-normative">
-<h2><a class="toc-backref" href="#id9" name="specialized-adaptors-text-should-be-normative">9.8 Specialized adaptors text should be normative</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>similar to 9.3, &quot;Specialized Adaptors&quot; has a note describing
-enable_if_convertible. This should be normative text.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">Changed it to normative
-text.  See the resolution of 9.4</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="reverse-iterator-text-is-too-informal">
-<h2><a class="toc-backref" href="#id10" name="reverse-iterator-text-is-too-informal">9.9 Reverse_iterator text is too informal</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>reverse iterator &quot;flips the direction of the base iterator's
-motion&quot;. This needs to be more formal, as in the current
-standard. Something like: &quot;iterates through the controlled sequence
-in the opposite direction&quot;</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Change:</p>
-<blockquote>
-The reverse iterator adaptor flips the direction of a base
-iterator's motion. Invoking <tt class="literal"><span class="pre">operator++()</span></tt> moves the base
-iterator backward and invoking <tt class="literal"><span class="pre">operator--()</span></tt> moves the base
-iterator forward.</blockquote>
-<p>to:</p>
-<blockquote class="last">
-The reverse iterator adaptor iterates through the adapted iterator
-range in the opposite direction.</blockquote>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="prior-is-undefined">
-<h2><a class="toc-backref" href="#id11" name="prior-is-undefined">9.10 'prior' is undefined</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>reverse_iterator::dereference is specified as calling a function
-named 'prior' which has no specification.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Change the specification to avoid using <tt class="literal"><span class="pre">prior</span></tt> as follows.</p>
-<p>Remove:</p>
-<pre class="literal-block">
-typename reverse_iterator::reference dereference() const { return *prior(this-&gt;base()); }
-</pre>
-<p>And at the end of the operations section add:</p>
-<blockquote class="last">
-<p><tt class="literal"><span class="pre">reference</span> <span class="pre">operator*()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"></td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-Iterator tmp = m_iterator;
-return *--tmp;
-</pre>
-</blockquote>
-</td>
-</tr>
-<tr class="field"><th class="field-name">Rationale:</th><td class="field-body">The style of specification has changed because of issue 9.37x.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="in-other-words-is-bad-wording">
-<h2><a class="toc-backref" href="#id12" name="in-other-words-is-bad-wording">9.11 &quot;In other words&quot; is bad wording</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>Transform iterator has a two-part specification: it does this, in
-other words, it does that. &quot;In other words&quot; always means &quot;I didn't
-say it right, so I'll try again.&quot; We need to say it once.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Change:</p>
-<blockquote>
-The transform iterator adapts an iterator by applying some function
-object to the result of dereferencing the iterator. In other words,
-the <tt class="literal"><span class="pre">operator*</span></tt> of the transform iterator first dereferences the
-base iterator, passes the result of this to the function object, and
-then returns the result.</blockquote>
-<p>to:</p>
-<blockquote class="last">
-The transform iterator adapts an iterator by modifying the
-<tt class="literal"><span class="pre">operator*</span></tt> to apply a function object to the result of
-dereferencing the iterator and returning the result.</blockquote>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="transform-iterator-shouldn-t-mandate-private-member">
-<h2><a class="toc-backref" href="#id13" name="transform-iterator-shouldn-t-mandate-private-member">9.12 Transform_iterator shouldn't mandate private member</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>transform_iterator has a private member named 'm_f' which should be
-marked &quot;exposition only.&quot;</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Mark the member <tt class="literal"><span class="pre">m_f</span></tt> as exposition
-only. Note/DWA: I think this is NAD because the user can't
-detect it, though I'm happy to mark it exposition only.</p>
-<p>Change:</p>
-<pre class="literal-block">
-UnaryFunction m_f;
-</pre>
-<p>to:</p>
-<pre class="last literal-block">
-UnaryFunction m_f;   // exposition only
-</pre>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="unclear-description-of-counting-iterator">
-<h2><a class="toc-backref" href="#id14" name="unclear-description-of-counting-iterator">9.13 Unclear description of counting iterator</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>The description of Counting iterator is unclear. &quot;The counting
-iterator adaptor implements dereference by returning a reference to
-the base object. The other operations are implemented by the base
-m_iterator, as per the inheritance from iterator_adaptor.&quot;</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Change:</p>
-<blockquote>
-The counting iterator adaptor implements dereference by
-returning a reference to the base object. The other operations
-are implemented by the base <tt class="literal"><span class="pre">m_iterator</span></tt>, as per the
-inheritance from <tt class="literal"><span class="pre">iterator_adaptor</span></tt>.</blockquote>
-<p>to:</p>
-<blockquote class="last">
-<tt class="literal"><span class="pre">counting_iterator</span></tt> adapts an object by adding an
-<tt class="literal"><span class="pre">operator*</span></tt> that returns the current value of the object. All
-other iterator operations are forwarded to the adapted object.</blockquote>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="counting-iterator-s-difference-type">
-<h2><a class="toc-backref" href="#id15" name="counting-iterator-s-difference-type">9.14 Counting_iterator's difference type</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>Counting iterator has the following note:</p>
-<blockquote>
-[Note: implementers are encouraged to provide an implementation
-of distance_to and a difference_type that avoids overflows in the
-cases when the Incrementable type is a numeric type.]</blockquote>
-<p>I'm not sure what this means. The user provides a template argument
-named Difference, but there's no difference_type. I assume this is
-just a glitch in the wording. But if implementors are encouraged to
-ignore this argument if it won't work right, why is it there?</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">The <tt class="literal"><span class="pre">difference_type</span></tt> was inherited from
-<tt class="literal"><span class="pre">iterator_adaptor</span></tt>.  However, we've removed the explicit
-inheritance, so explicit typedefs have been added. See the
-resolution of 9.37x.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="how-to-detect-lvalueness">
-<h2><a class="toc-backref" href="#id16" name="how-to-detect-lvalueness">9.15 How to detect lvalueness?</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Dave Abrahams</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>Shortly after N1550 was accepted, we discovered that an iterator's
-lvalueness can be determined knowing only its value_type. This
-predicate can be calculated even for old-style iterators (on whose
-reference type the standard places few requirements). A trait in
-the Boost iterator library does it by relying on the compiler's
-unwillingness to bind an rvalue to a T&amp; function template
-parameter. Similarly, it is possible to detect an iterator's
-readability knowing only its value_type.  Thus, any interface which
-asks the user to explicitly describe an iterator's lvalue-ness or
-readability seems to introduce needless complexity.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><ol class="first arabic simple">
-<li>Remove the <tt class="literal"><span class="pre">is_writable</span></tt> and <tt class="literal"><span class="pre">is_swappable</span></tt> traits, and
-remove the requirements in the Writable Iterator and Swappable
-Iterator concepts that require their models to support these
-traits.</li>
-<li>Change the <tt class="literal"><span class="pre">is_readable</span></tt> specification.  Remove the
-requirement for support of the <tt class="literal"><span class="pre">is_readable</span></tt> trait from the
-Readable Iterator concept.</li>
-<li>Remove the <tt class="literal"><span class="pre">iterator_tag</span></tt> class and transplant the logic for
-choosing an iterator category into <tt class="literal"><span class="pre">iterator_facade</span></tt>.</li>
-<li>Change the specification of <tt class="literal"><span class="pre">traversal_category</span></tt>.</li>
-<li>Remove Access parameters from N1530</li>
-</ol>
-<p>In N1550:</p>
-<p>Remove:</p>
-<blockquote>
-<p>Since the access concepts are not related via refinement, but
-instead cover orthogonal issues, we do not use tags for the
-access concepts, but instead use the equivalent of a bit field.</p>
-<p>We provide an access mechanism for mapping iterator types to
-the new traversal tags and access bit field. Our design reuses
-<tt class="literal"><span class="pre">iterator_traits&lt;Iter&gt;::iterator_category</span></tt> as the access
-mechanism. To that end, the access and traversal information is
-bundled into a single type using the following <cite>iterator_tag</cite>
-class.</p>
-<pre class="literal-block">
-enum iterator_access { readable_iterator = 1, writable_iterator = 2, 
-    swappable_iterator = 4, lvalue_iterator = 8 };
-
-template &lt;unsigned int access_bits, class TraversalTag&gt;
-struct iterator_tag : /* appropriate old category or categories */ {
-  static const iterator_access access =
-    (iterator_access)access_bits &amp; 
-      (readable_iterator | writable_iterator | swappable_iterator);
-  typedef TraversalTag traversal;
-};
-</pre>
-<p>The <tt class="literal"><span class="pre">access_bits</span></tt> argument is declared to be <tt class="literal"><span class="pre">unsigned</span> <span class="pre">int</span></tt>
-instead of the enum <tt class="literal"><span class="pre">iterator_access</span></tt> for convenience of
-use. For example, the expression <tt class="literal"><span class="pre">(readable_iterator</span> <span class="pre">|</span>
-<span class="pre">writable_iterator)</span></tt> produces an unsigned int, not an
-<tt class="literal"><span class="pre">iterator_access</span></tt>.  The purpose of the <tt class="literal"><span class="pre">lvalue_iterator</span></tt>
-part of the <tt class="literal"><span class="pre">iterator_access</span></tt> enum is to communicate to
-<tt class="literal"><span class="pre">iterator_tag</span></tt> whether the reference type is an lvalue so
-that the appropriate old category can be chosen for the base
-class. The <tt class="literal"><span class="pre">lvalue_iterator</span></tt> bit is not recorded in the
-<tt class="literal"><span class="pre">iterator_tag::access</span></tt> data member.</p>
-<p>The <tt class="literal"><span class="pre">iterator_tag</span></tt> class template is derived from the
-appropriate iterator tag or tags from the old requirements
-based on the access bits and traversal tag passed as template
-parameters.  The algorithm for determining the old tag or tags
-picks the least refined old concepts that include all of the
-requirements of the access and traversal concepts (that is, the
-closest fit), if any such category exists.  For example, the
-category tag for a Readable Single Pass Iterator will always be
-derived from <tt class="literal"><span class="pre">input_iterator_tag</span></tt>, while the category tag for
-a Single Pass Iterator that is both Readable and Writable will
-be derived from both <tt class="literal"><span class="pre">input_iterator_tag</span></tt> and
-<tt class="literal"><span class="pre">output_iterator_tag</span></tt>.</p>
-<p>We also provide several helper classes that make it convenient
-to obtain the access and traversal characteristics of an
-iterator. These helper classes work both for iterators whose
-<tt class="literal"><span class="pre">iterator_category</span></tt> is <tt class="literal"><span class="pre">iterator_tag</span></tt> and also for
-iterators using the original iterator categories.</p>
-<pre class="literal-block">
-template &lt;class Iterator&gt; struct is_readable  { typedef ... type; };
-template &lt;class Iterator&gt; struct is_writable { typedef ... type; };
-template &lt;class Iterator&gt; struct is_swappable { typedef ... type; };
-template &lt;class Iterator&gt; struct traversal_category { typedef ... type; };
-</pre>
-</blockquote>
-<p>After:</p>
-<blockquote>
-Like the old iterator requirements, we provide tags for
-purposes of dispatching based on the traversal concepts.  The
-tags are related via inheritance so that a tag is convertible
-to another tag if the concept associated with the first tag is
-a refinement of the second tag.</blockquote>
-<p>Add:</p>
-<blockquote>
-<p>Our design reuses <tt class="literal"><span class="pre">iterator_traits&lt;Iter&gt;::iterator_category</span></tt>
-to indicate an iterator's traversal capability.  To specify
-capabilities not captured by any old-style iterator category,
-an iterator designer can use an <tt class="literal"><span class="pre">iterator_category</span></tt> type that
-is convertible to both the the most-derived old iterator
-category tag which fits, and the appropriate new iterator
-traversal tag.</p>
-<p>We do not provide tags for the purposes of dispatching based on
-the access concepts, in part because we could not find a way to
-automatically infer the right access tags for old-style
-iterators.  An iterator's writability may be dependent on the
-assignability of its <tt class="literal"><span class="pre">value_type</span></tt> and there's no known way to
-detect whether an arbitrary type is assignable.  Fortunately,
-the need for dispatching based on access capability is not as
-great as the need for dispatching based on traversal
-capability.</p>
-</blockquote>
-<p>From the Readable Iterator Requirements table, remove:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="37%" />
-<col width="37%" />
-<col width="26%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">is_readable&lt;X&gt;::type</span></tt></td>
-<td><tt class="literal"><span class="pre">true_type</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>From the Writable Iterator Requirements table, remove:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="37%" />
-<col width="21%" />
-<col width="42%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">is_writable&lt;X&gt;::type</span></tt></td>
-<td><tt class="literal"><span class="pre">true_type</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>From the Swappable Iterator Requirements table, remove:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="37%" />
-<col width="19%" />
-<col width="43%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">is_swappable&lt;X&gt;::type</span></tt></td>
-<td><tt class="literal"><span class="pre">true_type</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>From [lib.iterator.synopsis] replace:</p>
-<pre class="literal-block">
-template &lt;class Iterator&gt; struct is_readable;
-template &lt;class Iterator&gt; struct is_writable;
-template &lt;class Iterator&gt; struct is_swappable;
-template &lt;class Iterator&gt; struct traversal_category;
-
-enum iterator_access { readable_iterator = 1, writable_iterator = 2, 
-    swappable_iterator = 4, lvalue_iterator = 8 };
-
-template &lt;unsigned int access_bits, class TraversalTag&gt;
-struct iterator_tag : /* appropriate old category or categories */ {
-  static const iterator_access access =
-    (iterator_access)access_bits &amp; 
-      (readable_iterator | writable_iterator | swappable_iterator);
-  typedef TraversalTag traversal;
-};
-</pre>
-<p>with:</p>
-<pre class="literal-block">
-template &lt;class Iterator&gt; struct is_readable_iterator;
-template &lt;class Iterator&gt; struct iterator_traversal;
-</pre>
-<p>In [lib.iterator.traits], remove:</p>
-<blockquote>
-<p>The <tt class="literal"><span class="pre">iterator_tag</span></tt> class template is an iterator category tag
-that encodes the access enum and traversal tag in addition to
-being compatible with the original iterator tags.  The
-<tt class="literal"><span class="pre">iterator_tag</span></tt> class inherits from one of the original
-iterator tags according to the following pseudo-code.</p>
-<pre class="literal-block">
-inherit-category(access, traversal-tag) =
-     if ((access &amp; readable_iterator) &amp;&amp; (access &amp; lvalue_iterator)) {
-         if (traversal-tag is convertible to random_access_traversal_tag)
-             return random_access_iterator_tag;
-         else if (traversal-tag is convertible to bidirectional_traversal_tag)
-             return bidirectional_iterator_tag;
-         else if (traversal-tag is convertible to forward_traversal_tag)
-             return forward_iterator_tag;
-         else if (traversal-tag is convertible to single_pass_traversal_tag)
-             if (access-tag is convertible to writable_iterator_tag)
-                 return input_output_iterator_tag;
-             else
-                 return input_iterator_tag;
-         else
-             return null_category_tag;
-     } else if ((access &amp; readable_iterator) and (access &amp; writable_iterator)
-                and traversal-tag is convertible to single_pass_iterator_tag)
-         return input_output_iterator_tag;
-     else if (access &amp; readable_iterator
-              and traversal-tag is convertible to single_pass_iterator_tag)
-         return input_iterator_tag;
-     else if (access &amp; writable_iterator
-              and traversal-tag is convertible to incrementable_iterator_tag)
-         return output_iterator_tag;
-     else
-         return null_category_tag;
-</pre>
-<p>If the argument for <tt class="literal"><span class="pre">TraversalTag</span></tt> is not convertible to
-<tt class="literal"><span class="pre">incrementable_iterator_tag</span></tt> then the program is ill-formed.</p>
-</blockquote>
-<p>Change:</p>
-<blockquote>
-<p>The <tt class="literal"><span class="pre">is_readable</span></tt>, <tt class="literal"><span class="pre">is_writable</span></tt>, <tt class="literal"><span class="pre">is_swappable</span></tt>, and
-<tt class="literal"><span class="pre">traversal_category</span></tt> class templates are traits classes. For
-iterators whose <tt class="literal"><span class="pre">iterator_traits&lt;Iter&gt;::iterator_category</span></tt>
-type is <tt class="literal"><span class="pre">iterator_tag</span></tt>, these traits obtain the <tt class="literal"><span class="pre">access</span></tt>
-enum and <tt class="literal"><span class="pre">traversal</span></tt> member type from within
-<tt class="literal"><span class="pre">iterator_tag</span></tt>.  For iterators whose
-<tt class="literal"><span class="pre">iterator_traits&lt;Iter&gt;::iterator_category</span></tt> type is not
-<tt class="literal"><span class="pre">iterator_tag</span></tt> and instead is a tag convertible to one of the
-original tags, the appropriate traversal tag and access bits
-are deduced.  The following pseudo-code describes the
-algorithm.</p>
-<pre class="literal-block">
-is-readable(Iterator) = 
-    cat = iterator_traits&lt;Iterator&gt;::iterator_category;
-    if (cat == iterator_tag&lt;Access,Traversal&gt;)
-        return Access &amp; readable_iterator;
-    else if (cat is convertible to input_iterator_tag)
-        return true;
-    else
-        return false;
-
-is-writable(Iterator) =
-    cat = iterator_traits&lt;Iterator&gt;::iterator_category;
-    if (cat == iterator_tag&lt;Access,Traversal&gt;)
-        return Access &amp; writable_iterator;
-    else if (cat is convertible to output_iterator_tag)
-         return true;
-    else if (
-         cat is convertible to forward_iterator_tag
-         and iterator_traits&lt;Iterator&gt;::reference is a 
-             mutable reference)
-        return true;
-    else
-        return false;
-
-is-swappable(Iterator) =
-    cat = iterator_traits&lt;Iterator&gt;::iterator_category;
-    if (cat == iterator_tag&lt;Access,Traversal&gt;)
-        return Access &amp; swappable_iterator;
-    else if (cat is convertible to forward_iterator_tag) {
-        if (iterator_traits&lt;Iterator&gt;::reference is a const reference)
-            return false;
-        else
-            return true;
-    } else 
-        return false;
-
-traversal-category(Iterator) =
-    cat = iterator_traits&lt;Iterator&gt;::iterator_category;
-    if (cat == iterator_tag&lt;Access,Traversal&gt;)
-        return Traversal;
-    else if (cat is convertible to random_access_iterator_tag)
-        return random_access_traversal_tag;
-    else if (cat is convertible to bidirectional_iterator_tag)
-        return bidirectional_traversal_tag;
-    else if (cat is convertible to forward_iterator_tag)
-        return forward_traversal_tag;
-    else if (cat is convertible to input_iterator_tag)
-        return single_pass_iterator_tag;
-    else if (cat is convertible to output_iterator_tag)
-        return incrementable_iterator_tag;
-    else
-        return null_category_tag;
-</pre>
-<p>The following specializations provide the access and traversal
-category tags for pointer types.</p>
-<pre class="literal-block">
-template &lt;typename T&gt;
-struct is_readable&lt;const T*&gt; { typedef true_type type; };
-template &lt;typename T&gt;
-struct is_writable&lt;const T*&gt; { typedef false_type type; };
-template &lt;typename T&gt;
-struct is_swappable&lt;const T*&gt; { typedef false_type type; };
-
-template &lt;typename T&gt;
-struct is_readable&lt;T*&gt; { typedef true_type type; };
-template &lt;typename T&gt;
-struct is_writable&lt;T*&gt; { typedef true_type type; };
-template &lt;typename T&gt;
-struct is_swappable&lt;T*&gt; { typedef true_type type; };
-
-template &lt;typename T&gt;
-struct traversal_category&lt;T*&gt;
-{
-  typedef random_access_traversal_tag type;
-};
-</pre>
-</blockquote>
-<p>to:</p>
-<blockquote>
-<p>The <tt class="literal"><span class="pre">is_readable_iterator</span></tt> class template satisfies the
-UnaryTypeTrait requirements.</p>
-<p>Given an iterator type <tt class="literal"><span class="pre">X</span></tt>,
-<tt class="literal"><span class="pre">is_readable_iterator&lt;X&gt;::value</span></tt> yields <tt class="literal"><span class="pre">true</span></tt> if, for an
-object <tt class="literal"><span class="pre">a</span></tt> of type <tt class="literal"><span class="pre">X</span></tt>, <tt class="literal"><span class="pre">*a</span></tt> is convertible to
-<tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::value_type</span></tt>, and <tt class="literal"><span class="pre">false</span></tt> otherwise.</p>
-<a class="target" id="category-to-traversal" name="category-to-traversal"></a><p><tt class="literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt> is</p>
-<pre class="literal-block">
-<em>category-to-traversal</em>(iterator_traits&lt;X&gt;::iterator_category) 
-</pre>
-<p>where <em>category-to-traversal</em> is defined as follows</p>
-<pre class="literal-block">
-<em>category-to-traversal</em>(C) =
-    if (C is convertible to incrementable_traversal_tag)
-        return C;
-    else if (C is convertible to random_access_iterator_tag)
-        return random_access_traversal_tag;
-    else if (C is convertible to bidirectional_iterator_tag)
-        return bidirectional_traversal_tag;
-    else if (C is convertible to forward_iterator_tag)
-        return forward_traversal_tag;
-    else if (C is convertible to input_iterator_tag)
-        return single_pass_traversal_tag;
-    else if (C is convertible to output_iterator_tag)
-        return incrementable_traversal_tag;
-    else
-        <em>the program is ill-formed</em>
-</pre>
-</blockquote>
-<p>In N1530:</p>
-<p>In [lib.iterator.helper.synopsis]:</p>
-<p>Change:</p>
-<pre class="literal-block">
-const unsigned use_default_access = -1;
-
-struct iterator_core_access { /* implementation detail */ };
-
-template &lt;
-    class Derived
-  , class Value
-  , unsigned AccessCategory
-  , class TraversalCategory
-  , class Reference  = Value&amp;
-  , class Difference = ptrdiff_t
-&gt;
-class iterator_facade;
-
-template &lt;
-    class Derived
-  , class Base
-  , class Value      = use_default
-  , unsigned Access  = use_default_access
-  , class Traversal  = use_default
-  , class Reference  = use_default
-  , class Difference = use_default
-&gt;
-class iterator_adaptor;
-
-template &lt;
-    class Iterator
-  , class Value = use_default
-  , unsigned Access  = use_default_access
-  , class Traversal  = use_default
-  , class Reference = use_default
-  , class Difference = use_default
-&gt;
-class indirect_iterator;
-</pre>
-<p>To:</p>
-<pre class="literal-block">
-struct iterator_core_access { /* implementation detail */ };
-
-template &lt;
-    class Derived
-  , class Value
-  , class CategoryOrTraversal
-  , class Reference  = Value&amp;
-  , class Difference = ptrdiff_t
-&gt;
-class iterator_facade;
-
-template &lt;
-    class Derived
-  , class Base
-  , class Value      = use_default
-  , class CategoryOrTraversal  = use_default
-  , class Reference  = use_default
-  , class Difference = use_default
-&gt;
-class iterator_adaptor;
-
-template &lt;
-    class Iterator
-  , class Value = use_default
-  , class CategoryOrTraversal = use_default
-  , class Reference = use_default
-  , class Difference = use_default
-&gt;
-class indirect_iterator;
-</pre>
-<p>Change:</p>
-<pre class="literal-block">
-template &lt;
-    class Incrementable
-  , unsigned Access  = use_default_access
-  , class Traversal  = use_default
-  , class Difference = use_default
-&gt;
-class counting_iterator
-</pre>
-<p>To:</p>
-<pre class="literal-block">
-template &lt;
-    class Incrementable
-  , class CategoryOrTraversal  = use_default
-  , class Difference = use_default
-&gt;
-class counting_iterator;
-</pre>
-<p>In [lib.iterator.facade]:</p>
-<p>Change:</p>
-<pre class="literal-block">
-template &lt;
-    class Derived
-  , class Value
-  , unsigned AccessCategory
-  , class TraversalCategory
-  , class Reference  = /* see below */
-  , class Difference = ptrdiff_t
-&gt;
-class iterator_facade {
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-template &lt;
-    class Derived
-  , class Value
-  , class CategoryOrTraversal
-  , class Reference  = Value&amp;
-  , class Difference = ptrdiff_t
-&gt;
-class iterator_facade {
-</pre>
-<p>Change:</p>
-<pre class="literal-block">
-typedef iterator_tag&lt;AccessCategory, TraversalCategory&gt; iterator_category;
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-typedef /* see below */ iterator_category;
-</pre>
-<p>Change:</p>
-<pre class="literal-block">
-// Comparison operators
-template &lt;class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-          class Dr2, class V2, class AC2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1, Dr2, bool&gt;::type // exposition
-operator ==(iterator_facade&lt;Dr1, V1, AC1, TC1, R1, D1&gt; const&amp; lhs,
-            iterator_facade&lt;Dr2, V2, AC2, TC2, R2, D2&gt; const&amp; rhs);
-
-template &lt;class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-          class Dr2, class V2, class AC2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1, Dr2, bool&gt;::type
-operator !=(iterator_facade&lt;Dr1, V1, AC1, TC1, R1, D1&gt; const&amp; lhs,
-            iterator_facade&lt;Dr2, V2, AC2, TC2, R2, D2&gt; const&amp; rhs);
-
-template &lt;class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-          class Dr2, class V2, class AC2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1, Dr2, bool&gt;::type
-operator &lt;(iterator_facade&lt;Dr1, V1, AC1, TC1, R1, D1&gt; const&amp; lhs,
-           iterator_facade&lt;Dr2, V2, AC2, TC2, R2, D2&gt; const&amp; rhs);
-
-template &lt;class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-          class Dr2, class V2, class AC2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1, Dr2, bool&gt;::type
-operator &lt;=(iterator_facade&lt;Dr1, V1, AC1, TC1, R1, D1&gt; const&amp; lhs,
-            iterator_facade&lt;Dr2, V2, AC2, TC2, R2, D2&gt; const&amp; rhs);
-
-template &lt;class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-          class Dr2, class V2, class AC2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1, Dr2, bool&gt;::type
-operator &gt;(iterator_facade&lt;Dr1, V1, AC1, TC1, R1, D1&gt; const&amp; lhs,
-           iterator_facade&lt;Dr2, V2, AC2, TC2, R2, D2&gt; const&amp; rhs);
-
-template &lt;class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-          class Dr2, class V2, class AC2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1, Dr2, bool&gt;::type
-operator &gt;=(iterator_facade&lt;Dr1, V1, AC1, TC1, R1, D1&gt; const&amp; lhs,
-            iterator_facade&lt;Dr2, V2, AC2, TC2, R2, D2&gt; const&amp; rhs);
-
-template &lt;class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-          class Dr2, class V2, class AC2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1, Dr2, bool&gt;::type
-operator &gt;=(iterator_facade&lt;Dr1, V1, AC1, TC1, R1, D1&gt; const&amp; lhs,
-            iterator_facade&lt;Dr2, V2, AC2, TC2, R2, D2&gt; const&amp; rhs);
-
-// Iterator difference
-template &lt;class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-          class Dr2, class V2, class AC2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1, Dr2, bool&gt;::type
-operator -(iterator_facade&lt;Dr1, V1, AC1, TC1, R1, D1&gt; const&amp; lhs,
-           iterator_facade&lt;Dr2, V2, AC2, TC2, R2, D2&gt; const&amp; rhs);
-
-// Iterator addition
-template &lt;class Derived, class V, class AC, class TC, class R, class D&gt;
-Derived operator+ (iterator_facade&lt;Derived, V, AC, TC, R, D&gt; const&amp;,
-                   typename Derived::difference_type n)
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-// Comparison operators
-template &lt;class Dr1, class V1, class TC1, class R1, class D1,
-          class Dr2, class V2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1,Dr2,bool&gt;::type // exposition
-operator ==(iterator_facade&lt;Dr1,V1,TC1,R1,D1&gt; const&amp; lhs,
-            iterator_facade&lt;Dr2,V2,TC2,R2,D2&gt; const&amp; rhs);
-
-template &lt;class Dr1, class V1, class TC1, class R1, class D1,
-          class Dr2, class V2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1,Dr2,bool&gt;::type
-operator !=(iterator_facade&lt;Dr1,V1,TC1,R1,D1&gt; const&amp; lhs,
-            iterator_facade&lt;Dr2,V2,TC2,R2,D2&gt; const&amp; rhs);
-
-template &lt;class Dr1, class V1, class TC1, class R1, class D1,
-          class Dr2, class V2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1,Dr2,bool&gt;::type
-operator &lt;(iterator_facade&lt;Dr1,V1,TC1,R1,D1&gt; const&amp; lhs,
-           iterator_facade&lt;Dr2,V2,TC2,R2,D2&gt; const&amp; rhs);
-
-template &lt;class Dr1, class V1, class TC1, class R1, class D1,
-          class Dr2, class V2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1,Dr2,bool&gt;::type
-operator &lt;=(iterator_facade&lt;Dr1,V1,TC1,R1,D1&gt; const&amp; lhs,
-            iterator_facade&lt;Dr2,V2,TC2,R2,D2&gt; const&amp; rhs);
-
-template &lt;class Dr1, class V1, class TC1, class R1, class D1,
-          class Dr2, class V2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1,Dr2,bool&gt;::type
-operator &gt;(iterator_facade&lt;Dr1,V1,TC1,R1,D1&gt; const&amp; lhs,
-           iterator_facade&lt;Dr2,V2,TC2,R2,D2&gt; const&amp; rhs);
-
-template &lt;class Dr1, class V1, class TC1, class R1, class D1,
-          class Dr2, class V2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1,Dr2,bool&gt;::type
-operator &gt;=(iterator_facade&lt;Dr1,V1,TC1,R1,D1&gt; const&amp; lhs,
-            iterator_facade&lt;Dr2,V2,TC2,R2,D2&gt; const&amp; rhs);
-
-// Iterator difference
-template &lt;class Dr1, class V1, class TC1, class R1, class D1,
-          class Dr2, class V2, class TC2, class R2, class D2&gt;
-/* see below */
-operator-(iterator_facade&lt;Dr1,V1,TC1,R1,D1&gt; const&amp; lhs,
-          iterator_facade&lt;Dr2,V2,TC2,R2,D2&gt; const&amp; rhs);
-
-// Iterator addition
-template &lt;class Dr, class V, class TC, class R, class D&gt;
-Derived operator+ (iterator_facade&lt;Dr,V,TC,R,D&gt; const&amp;,
-                   typename Derived::difference_type n);
-
-template &lt;class Dr, class V, class TC, class R, class D&gt;
-Derived operator+ (typename Derived::difference_type n,
-                   iterator_facade&lt;Dr,V,TC,R,D&gt; const&amp;);
-</pre>
-<p>After the <tt class="literal"><span class="pre">iterator_facade</span></tt> synopsis, add:</p>
-<p>The <tt class="literal"><span class="pre">iterator_category</span></tt> member of <tt class="literal"><span class="pre">iterator_facade</span></tt> is</p>
-<pre class="literal-block">
-<em>iterator-category</em>(CategoryOrTraversal, value_type, reference)
-</pre>
-<p>where <em>iterator-category</em> is defined as follows:</p>
-<pre class="last literal-block">
-<em>iterator-category</em>(C,R,V) :=
-   if (C is convertible to std::input_iterator_tag
-       || C is convertible to std::output_iterator_tag
-   )
-       return C
-
-   else if (C is not convertible to incrementable_traversal_tag)
-       <em>the program is ill-formed</em>
-
-   else return a type X satisfying the following two constraints:
-
-      1. X is convertible to X1, and not to any more-derived
-         type, where X1 is defined by:
-
-           if (R is a reference type
-               &amp;&amp; C is convertible to forward_traversal_tag)
-           {
-               if (C is convertible to random_access_traversal_tag)
-                   X1 = random_access_iterator_tag
-               else if (C is convertible to bidirectional_traversal_tag)
-                   X1 = bidirectional_iterator_tag
-               else
-                   X1 = forward_iterator_tag
-           }
-           else
-           {
-               if (C is convertible to single_pass_traversal_tag
-                   &amp;&amp; R is convertible to V)
-                   X1 = input_iterator_tag
-               else
-                   X1 = C
-           }
-
-      2. <a class="reference" href="#category-to-traversal"><em>category-to-traversal</em></a>(X) is convertible to the most
-         derived traversal tag type to which X is also
-         convertible, and not to any more-derived traversal tag
-         type.
-</pre>
-</td>
-</tr>
-</tbody>
-</table>
-<a class="target" id="iterator-category" name="iterator-category"></a><blockquote>
-<p>In [lib.iterator.facade] <tt class="literal"><span class="pre">iterator_facade</span></tt> requirements:</p>
-<p>Remove:</p>
-<blockquote>
-<tt class="literal"><span class="pre">AccessCategory</span></tt> must be an unsigned value which uses no more
-bits than the greatest value of <tt class="literal"><span class="pre">iterator_access</span></tt>.</blockquote>
-<p>In the <strong>Iterator Adaptor</strong> section, change:</p>
-<blockquote>
-Several of the template parameters of <tt class="literal"><span class="pre">iterator_adaptor</span></tt> default
-to <tt class="literal"><span class="pre">use_default</span></tt> (or <tt class="literal"><span class="pre">use_default_access</span></tt>).</blockquote>
-<p>to:</p>
-<blockquote>
-Several of the template parameters of <tt class="literal"><span class="pre">iterator_adaptor</span></tt> default
-to <tt class="literal"><span class="pre">use_default</span></tt>.</blockquote>
-<p>In [lib.iterator.special.adaptors]:</p>
-<p>Change:</p>
-<pre class="literal-block">
-template &lt;
-    class Iterator
-  , class Value = use_default
-  , unsigned Access  = use_default_access
-  , class Traversal  = use_default
-  , class Reference = use_default
-  , class Difference = use_default
-&gt;
-class indirect_iterator
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-template &lt;
-    class Iterator
-  , class Value = use_default
-  , class CategoryOrTraversal = use_default
-  , class Reference = use_default
-  , class Difference = use_default
-&gt;
-class indirect_iterator
-</pre>
-<p>Change:</p>
-<pre class="literal-block">
-template &lt;
-    class Iterator2, class Value2, unsigned Access2, class Traversal2
-  , class Reference2, class Difference2
-&gt;
-indirect_iterator(
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-template &lt;
-    class Iterator2, class Value2, class Category2
-  , class Reference2, class Difference2
-&gt;
-indirect_iterator(
-</pre>
-<p>Change:</p>
-<pre class="literal-block">
-template &lt;
-    class Incrementable
-  , unsigned Access = use_default_access
-  , class Traversal = use_default
-  , class Difference = use_default
-&gt;
-class counting_iterator
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-template &lt;
-    class Incrementable
-  , class CategoryOrTraversal = use_default
-  , class Difference = use_default
-&gt;
-class counting_iterator
-</pre>
-<p>Change:</p>
-<pre class="literal-block">
-typedef iterator_tag&lt;
-      writable_iterator
-    , incrementable_traversal_tag
-&gt; iterator_category;
-</pre>
-<p>to:</p>
-<blockquote>
-typedef std::output_iterator_tag iterator_category;</blockquote>
-<p>In [lib.iterator.adaptor]</p>
-<p>Change:</p>
-<pre class="literal-block">
-template &lt;
-    class Derived
-  , class Base
-  , class Value      = use_default
-  , unsigned Access  = use_default_access
-  , class Traversal  = use_default
-  , class Reference  = use_default
-  , class Difference = use_default
-&gt;
-class iterator_adaptor 
-</pre>
-<p>To:</p>
-<pre class="literal-block">
-template &lt;
-    class Derived
-  , class Base
-  , class Value               = use_default
-  , class CategoryOrTraversal = use_default
-  , class Reference           = use_default
-  , class Difference = use_default
-&gt;
-class iterator_adaptor 
-</pre>
-</blockquote>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Rationale:</th><td class="field-body"></td>
-</tr>
-</tbody>
-</table>
-<ol class="arabic simple">
-<li>There are two reasons for removing <tt class="literal"><span class="pre">is_writable</span></tt>
-and <tt class="literal"><span class="pre">is_swappable</span></tt>. The first is that we do not know of
-a way to fix the specification so that it gives the correct
-answer for all iterators. Second, there was only a weak
-motivation for having <tt class="literal"><span class="pre">is_writable</span></tt> and <tt class="literal"><span class="pre">is_swappable</span></tt>
-there in the first place.  The main motivation was simply
-uniformity: we have tags for the old iterator categories
-so we should have tags for the new iterator categories.
-While having tags and the capability to dispatch based
-on the traversal categories is often used, we see
-less of a need for dispatching based on writability
-and swappability, since typically algorithms
-that need these capabilities have no alternative if
-they are not provided.</li>
-<li>We discovered that the <tt class="literal"><span class="pre">is_readable</span></tt> trait can be implemented
-using only the iterator type itself and its <tt class="literal"><span class="pre">value_type</span></tt>.
-Therefore we remove the requirement for <tt class="literal"><span class="pre">is_readable</span></tt> from the
-Readable Iterator concept, and change the definition of
-<tt class="literal"><span class="pre">is_readable</span></tt> so that it works for any iterator type.</li>
-<li>The purpose of the <tt class="literal"><span class="pre">iterator_tag</span></tt> class was to bundle the
-traversal and access category tags into the
-<tt class="literal"><span class="pre">iterator_category</span></tt> typedef.  With <tt class="literal"><span class="pre">is_writable</span></tt> and
-<tt class="literal"><span class="pre">is_swappable</span></tt> gone, and <tt class="literal"><span class="pre">is_readable</span></tt> no longer in need of
-special hints, there is no reason for iterators to provide
-information about the access capabilities of an iterator.  Thus
-there is no need for the <tt class="literal"><span class="pre">iterator_tag</span></tt>. The traversal tag can
-be directly used for the <tt class="literal"><span class="pre">iterator_category</span></tt>. If a new
-iterator is intended to be backward compatible with old iterator
-concepts, a tag type that is convertible to both one of the new
-traversal tags and also to an old iterator tag can be created
-and use for the <tt class="literal"><span class="pre">iterator_category</span></tt>.</li>
-<li>The changes to the specification of <tt class="literal"><span class="pre">traversal_category</span></tt> are a 
-direct result of the removal of <tt class="literal"><span class="pre">iterator_tag</span></tt>.</li>
-</ol>
-</div>
-<div class="section" id="is-writable-iterator-returns-false-positives">
-<h2><a class="toc-backref" href="#id17" name="is-writable-iterator-returns-false-positives">9.16 is_writable_iterator returns false positives</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Dave Abrahams</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>is_writable_iterator returns false positives for forward iterators
-whose value_type has a private assignment operator, or whose
-reference type is not a reference (currently legal).</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed Resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">See the resolution to 9.15.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="is-swappable-iterator-returns-false-positives">
-<h2><a class="toc-backref" href="#id18" name="is-swappable-iterator-returns-false-positives">9.17 is_swappable_iterator returns false positives</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Dave Abrahams</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>is_swappable_iterator has the same problems as
-is_writable_iterator. In addition, if we allow users to write their
-own iter_swap functions it's easy to imagine old-style iterators
-for which is_swappable returns false negatives.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed Resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">See the resolution to 9.15.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="are-is-readable-is-writable-and-is-swappable-useful">
-<h2><a class="toc-backref" href="#id19" name="are-is-readable-is-writable-and-is-swappable-useful">9.18 Are is_readable, is_writable, and is_swappable useful?</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Dave Abrahams</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>I am concerned that there is little use for any of is_readable,
-is_writable, or is_swappable, and that not only do they unduly
-constrain iterator implementors but they add overhead to
-iterator_facade and iterator_adaptor in the form of a template
-parameter which would otherwise be unneeded. Since we can't
-implement two of them accurately for old-style iterators, I am
-having a hard time justifying their impact on the rest of the
-proposal(s).</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed Resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">See the resolution to 9.15.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="non-uniformity-of-the-lvalue-iterator-bit">
-<h2><a class="toc-backref" href="#id20" name="non-uniformity-of-the-lvalue-iterator-bit">9.19 Non-Uniformity of the &quot;lvalue_iterator Bit&quot;</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Dave Abrahams</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>The proposed iterator_tag class template accepts an &quot;access bits&quot;
-parameter which includes a bit to indicate the iterator's
-lvalueness (whether its dereference operator returns a reference to
-its value_type. The relevant part of N1550 says:</p>
-<blockquote>
-The purpose of the lvalue_iterator part of the iterator_access
-enum is to communicate to iterator_tagwhether the reference type
-is an lvalue so that the appropriate old category can be chosen
-for the base class. The lvalue_iterator bit is not recorded in
-the iterator_tag::access data member.</blockquote>
-<p>The lvalue_iterator bit is not recorded because N1550 aims to
-improve orthogonality of the iterator concepts, and a new-style
-iterator's lvalueness is detectable by examining its reference
-type. This inside/outside difference is awkward and confusing.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed Resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">The iterator_tag class will be removed, so this is no longer an issue.
-See the resolution to 9.15.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="traversal-concepts-and-tags">
-<h2><a class="toc-backref" href="#id21" name="traversal-concepts-and-tags">9.20 Traversal Concepts and Tags</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Dave Abrahams</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>Howard Hinnant pointed out some inconsistencies with the naming of
-these tag types:</p>
-<pre class="literal-block">
-incrementable_iterator_tag // ++r, r++ 
-single_pass_iterator_tag // adds a == b, a != b 
-forward_traversal_iterator_tag // adds multi-pass 
-bidirectional_traversal_iterator_tag // adds --r, r--
-random_access_traversal_iterator_tag // adds r+n,n+r,etc. 
-</pre>
-<p>Howard thought that it might be better if all tag names contained
-the word &quot;traversal&quot;.  It's not clear that would result in the best
-possible names, though. For example, incrementable iterators can
-only make a single pass over their input. What really distinguishes
-single pass iterators from incrementable iterators is not that they
-can make a single pass, but that they are equality
-comparable. Forward traversal iterators really distinguish
-themselves by introducing multi-pass capability. Without entering
-a &quot;Parkinson's Bicycle Shed&quot; type of discussion, it might be worth
-giving the names of these tags (and the associated concepts) some
-extra attention.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Change the names of the traversal tags to the
-following names:</p>
-<pre class="literal-block">
-incrementable_traversal_tag
-single_pass_traversal_tag
-forward_traversal_tag
-bidirectional_traversal_tag
-random_access_traversal_tag
-</pre>
-<p>In [lib.iterator.traversal]:</p>
-<p>Change:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="39%" />
-<col width="37%" />
-<col width="24%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">traversal_category&lt;X&gt;::type</span></tt></td>
-<td>Convertible to
-<tt class="literal"><span class="pre">incrementable_iterator_tag</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>to:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="39%" />
-<col width="37%" />
-<col width="24%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
-<td>Convertible to
-<tt class="literal"><span class="pre">incrementable_traversal_tag</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>Change:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="36%" />
-<col width="33%" />
-<col width="31%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">traversal_category&lt;X&gt;::type</span></tt></td>
-<td>Convertible to
-<tt class="literal"><span class="pre">single_pass_iterator_tag</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>to:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="36%" />
-<col width="33%" />
-<col width="31%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
-<td>Convertible to
-<tt class="literal"><span class="pre">single_pass_traversal_tag</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>Change:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="44%" />
-<col width="39%" />
-<col width="17%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">traversal_category&lt;X&gt;::type</span></tt></td>
-<td>Convertible to
-<tt class="literal"><span class="pre">forward_traversal_iterator_tag</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>to:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="38%" />
-<col width="34%" />
-<col width="27%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
-<td>Convertible to
-<tt class="literal"><span class="pre">forward_traversal_tag</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>Change:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="35%" />
-<col width="44%" />
-<col width="21%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">traversal_category&lt;X&gt;::type</span></tt></td>
-<td>Convertible to
-<tt class="literal"><span class="pre">bidirectional_traversal_iterator_tag</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>to:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="38%" />
-<col width="37%" />
-<col width="25%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
-<td>Convertible to
-<tt class="literal"><span class="pre">bidirectional_traversal_tag</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>Change:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="31%" />
-<col width="35%" />
-<col width="18%" />
-<col width="16%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">traversal_category&lt;X&gt;::type</span></tt></td>
-<td>Convertible to
-<tt class="literal"><span class="pre">random_access_traversal_iterator_tag</span></tt></td>
-<td>&nbsp;</td>
-<td>&nbsp;</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>to:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="28%" />
-<col width="30%" />
-<col width="23%" />
-<col width="20%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
-<td>Convertible to
-<tt class="literal"><span class="pre">random_access_traversal_tag</span></tt></td>
-<td>&nbsp;</td>
-<td>&nbsp;</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>In [lib.iterator.synopsis], change:</p>
-<pre class="literal-block">
-struct incrementable_iterator_tag { };
-struct single_pass_iterator_tag : incrementable_iterator_tag { };
-struct forward_traversal_tag : single_pass_iterator_tag { };
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-struct incrementable_traversal_tag { };
-struct single_pass_traversal_tag : incrementable_traversal_tag { };
-struct forward_traversal_tag : single_pass_traversal_tag { };
-</pre>
-<p>Remove:</p>
-<pre class="last literal-block">
-struct null_category_tag { };
-struct input_output_iterator_tag : input_iterator_tag, output_iterator_tag {};
-</pre>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="iterator-facade-derived-template-argument-underspecified">
-<h2><a class="toc-backref" href="#id22" name="iterator-facade-derived-template-argument-underspecified">9.21 iterator_facade Derived template argument underspecified</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>The first template argument to iterator_facade is named Derived,
-and the proposal says:</p>
-<blockquote>
-The Derived template parameter must be a class derived from
-iterator_facade.</blockquote>
-<p>First, iterator_facade is a template, so cannot be derived
-from. Rather, the class must be derived from a specialization of
-iterator_facade. More important, isn't Derived required to be the
-class that is being defined? That is, if I understand it right, the
-definition of D here this is not valid:</p>
-<pre class="literal-block">
-class C : public iterator_facade&lt;C, ... &gt; { ... }; 
-class D : public iterator_facade&lt;C, ...&gt; { ... }; 
-</pre>
-<p>In the definition of D, the Derived argument to iterator_facade is
-a class derived from a specialization of iterator_facade, so the
-requirement is met. Shouldn't the requirement be more like &quot;when
-using iterator_facade to define an iterator class Iter, the class
-Iter must be derived from a specialization of iterator_facade whose
-first template argument is Iter.&quot; That's a bit awkward, but at the
-moment I don't see a better way of phrasing it.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">In [lib.iterator.facade]</p>
-<p>Remove:</p>
-<blockquote>
-The <tt class="literal"><span class="pre">Derived</span></tt> template parameter must be a class derived from
-<tt class="literal"><span class="pre">iterator_facade</span></tt>.</blockquote>
-<p>Change:</p>
-<blockquote>
-The following table describes the other requirements on the
-<tt class="literal"><span class="pre">Derived</span></tt> parameter.  Depending on the resulting iterator's
-<tt class="literal"><span class="pre">iterator_category</span></tt>, a subset of the expressions listed in the table
-are required to be valid.  The operations in the first column must be
-accessible to member functions of class <tt class="literal"><span class="pre">iterator_core_access</span></tt>.</blockquote>
-<p>to:</p>
-<blockquote>
-The following table describes the typical valid expressions on
-<tt class="literal"><span class="pre">iterator_facade</span></tt>'s <tt class="literal"><span class="pre">Derived</span></tt> parameter, depending on the
-iterator concept(s) it will model.  The operations in the first
-column must be made accessible to member functions of class
-<tt class="literal"><span class="pre">iterator_core_access</span></tt>.  In addition,
-<tt class="literal"><span class="pre">static_cast&lt;Derived*&gt;(iterator_facade*)</span></tt> shall be well-formed.</blockquote>
-<p>In [lib.iterator.adaptor]</p>
-<p>Change:</p>
-<blockquote>
-The <tt class="literal"><span class="pre">iterator_adaptor</span></tt> is a base class template derived from
-an instantiation of <tt class="literal"><span class="pre">iterator_facade</span></tt>.</blockquote>
-<p>to:</p>
-<blockquote>
-Each specialization of the <tt class="literal"><span class="pre">iterator_adaptor</span></tt> class template
-is derived from a specialization of <tt class="literal"><span class="pre">iterator_facade</span></tt>.</blockquote>
-<p>Change:</p>
-<blockquote>
-The <tt class="literal"><span class="pre">Derived</span></tt> template parameter must be a derived class of
-<tt class="literal"><span class="pre">iterator_adaptor</span></tt>.</blockquote>
-<p>To:</p>
-<blockquote class="last">
-<tt class="literal"><span class="pre">static_cast&lt;Derived*&gt;(iterator_adaptor*)</span></tt> shall be well-formed.</blockquote>
-</td>
-</tr>
-</tbody>
-</table>
-<p>[Note: The proposed resolution to Issue 9.37 contains related
-changes]</p>
-</div>
-<div class="section" id="return-type-of-iterator-difference-for-iterator-facade">
-<h2><a class="toc-backref" href="#id23" name="return-type-of-iterator-difference-for-iterator-facade">9.22 return type of Iterator difference for iterator facade</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>The proposal says:</p>
-<pre class="literal-block">
-template &lt;class Dr1, class V1, class AC1, class TC1, class R1, class D1, 
-class Dr2, class V2, class AC2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1, Dr2, bool&gt;::type
-operator -(iterator_facade&lt;Dr1, V1, AC1, TC1, R1, D1&gt; const&amp; lhs, 
-iterator_facade&lt;Dr2, V2, AC2, TC2, R2, D2&gt; const&amp; rhs); 
-</pre>
-<p>Shouldn't the return type be one of the two iterator types? Which
-one? The idea is that if one of the iterator types can be converted
-to the other type, then the subtraction is okay. Seems like the
-return type should then be the type that was converted to. Is that
-right?</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">See resolution to 9.34.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="iterator-facade-minor-wording-issue">
-<h2><a class="toc-backref" href="#id24" name="iterator-facade-minor-wording-issue">9.23 Iterator_facade: minor wording Issue</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>In the table that lists the required (sort of) member functions of
-iterator types that are based on iterator_facade, the entry for
-c.equal(y) says:</p>
-<blockquote>
-true iff c and y refer to the same position. Implements c == y
-and c != y.  The second sentence is inside out. c.equal(y) does
-not implement either of these operations. It is used to implement
-them. Same thing in the description of c.distance_to(z).</blockquote>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">remove &quot;implements&quot; descriptions from
-table.  See resolution to 9.34</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="use-of-undefined-name-in-iterator-facade-table">
-<h2><a class="toc-backref" href="#id25" name="use-of-undefined-name-in-iterator-facade-table">9.24 Use of undefined name in iterator_facade table</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>Several of the descriptions use the name X without defining
-it. This seems to be a carryover from the table immediately above
-this section, but the text preceding that table says &quot;In the table
-below, X is the derived iterator type.&quot; Looks like the X::
-qualifiers aren't really needed; X::reference can simply be
-reference, since that's defined by the iterator_facade
-specialization itself.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Remove references to X.</p>
-<p>In [lib.iterator.facade] operations <tt class="literal"><span class="pre">operator-&gt;()</span> <span class="pre">const;</span></tt>:</p>
-<blockquote class="last">
-<p>Change:</p>
-<blockquote>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">If <tt class="literal"><span class="pre">X::reference</span></tt> is a reference type, an object
-of type <tt class="literal"><span class="pre">X::pointer</span></tt> equal to:</p>
-<pre class="literal-block">
-&amp;static_cast&lt;Derived const*&gt;(this)-&gt;dereference()
-</pre>
-<p>Otherwise returns an object of unspecified type such that,
-given an object <tt class="literal"><span class="pre">a</span></tt> of type <tt class="literal"><span class="pre">X</span></tt>, <tt class="literal"><span class="pre">a-&gt;m</span></tt> is equivalent
-to <tt class="literal"><span class="pre">(w</span> <span class="pre">=</span> <span class="pre">*a,</span> <span class="pre">w.m)</span></tt> for some temporary object <tt class="literal"><span class="pre">w</span></tt> of type
-<tt class="literal"><span class="pre">X::value_type</span></tt>.</p>
-<p class="last">The type <tt class="literal"><span class="pre">X::pointer</span></tt> is <tt class="literal"><span class="pre">Value*</span></tt> if
-<tt class="literal"><span class="pre">is_writable_iterator&lt;X&gt;::value</span></tt> is <tt class="literal"><span class="pre">true</span></tt>, and
-<tt class="literal"><span class="pre">Value</span> <span class="pre">const*</span></tt> otherwise.</p>
-</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>to:</p>
-<blockquote>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">If <tt class="literal"><span class="pre">reference</span></tt> is a reference type, an object
-of type <tt class="literal"><span class="pre">pointer</span></tt> equal to:</p>
-<pre class="literal-block">
-&amp;static_cast&lt;Derived const*&gt;(this)-&gt;dereference()
-</pre>
-<p class="last">Otherwise returns an object of unspecified type such that,
-<tt class="literal"><span class="pre">(*static_cast&lt;Derived</span> <span class="pre">const*&gt;(this))-&gt;m</span></tt> is equivalent
-to <tt class="literal"><span class="pre">(w</span> <span class="pre">=</span> <span class="pre">**static_cast&lt;Derived</span> <span class="pre">const*&gt;(this),</span> <span class="pre">w.m)</span></tt> for
-some temporary object <tt class="literal"><span class="pre">w</span></tt> of type <tt class="literal"><span class="pre">value_type</span></tt>.</p>
-</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>Further changes are covered by issue 9.26.</p>
-</blockquote>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="iterator-facade-wrong-return-type">
-<h2><a class="toc-backref" href="#id26" name="iterator-facade-wrong-return-type">9.25 Iterator_facade: wrong return type</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>Several of the member functions return a Derived object or a
-Derived&amp;. Their Effects clauses end with:</p>
-<pre class="literal-block">
-return *this;
-</pre>
-<p>This should be</p>
-<pre class="literal-block">
-return *static_cast&lt;Derived*&gt;(this);
-</pre>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">In [lib.iterator.facade], in the effects clause
-of the following operations:</p>
-<pre class="literal-block">
-Derived&amp; operator++()
-Derived&amp; operator--()
-Derived&amp; operator+=(difference_type n)
-Derived&amp; operator-=(difference_type n)
-</pre>
-<dl class="last">
-<dt>Change:</dt>
-<dd><tt class="literal"><span class="pre">return</span> <span class="pre">*this</span></tt></dd>
-<dt>to:</dt>
-<dd><tt class="literal"><span class="pre">return</span> <span class="pre">*static_cast&lt;Derived*&gt;(this);</span></tt></dd>
-</dl>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="iterator-facade-unclear-returns-clause-for-operator">
-<h2><a class="toc-backref" href="#id27" name="iterator-facade-unclear-returns-clause-for-operator">9.26 Iterator_facade: unclear returns clause for operator[]</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>The returns clause for <tt class="literal"><span class="pre">operator[](difference_type</span> <span class="pre">n)</span></tt> const
-says:</p>
-<blockquote>
-Returns: an object convertible to X::reference and holding a copy
-p of a+n such that, for a constant object v of type
-X::value_type, X::reference(a[n] = v) is equivalent to p = v.
-This needs to define 'a', but assuming it's supposed to be
-<tt class="literal"><span class="pre">*this</span></tt> (or maybe <tt class="literal"><span class="pre">*(Derived*)this</span></tt>), it still isn't clear
-what this says. Presumably, the idea is that you can index off of
-an iterator and assign to the result. But why the requirement
-that it hold a copy of a+n? Granted, that's probably how it's
-implemented, but it seems over-constrained. And the last phrase
-seems wrong. p is an iterator; there's no requirement that you
-can assign a value_type object to it. Should that be <tt class="literal"><span class="pre">*p</span> <span class="pre">=</span> <span class="pre">v</span></tt>?
-But why the cast in reference(a[n] = v)?</blockquote>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">In section operator[]:</p>
-<blockquote>
-<p>Change:</p>
-<blockquote>
-Writable iterators built with <tt class="literal"><span class="pre">iterator_facade</span></tt> implement
-the semantics required by the preferred resolution to <cite>issue
-299</cite> and adopted by proposal <cite>n1477</cite>: the result of <tt class="literal"><span class="pre">p[n]</span></tt>
-is a proxy object containing a copy of <tt class="literal"><span class="pre">p+n</span></tt>, and <tt class="literal"><span class="pre">p[n]</span> <span class="pre">=</span>
-<span class="pre">x</span></tt> is equivalent to <tt class="literal"><span class="pre">*(p</span> <span class="pre">+</span> <span class="pre">n)</span> <span class="pre">=</span> <span class="pre">x</span></tt>.  This approach will
-work properly for any random-access iterator regardless of
-the other details of its implementation.  A user who knows
-more about the implementation of her iterator is free to
-implement an <tt class="literal"><span class="pre">operator[]</span></tt> which returns an lvalue in the
-derived iterator class; it will hide the one supplied by
-<tt class="literal"><span class="pre">iterator_facade</span></tt> from clients of her iterator.</blockquote>
-<p>to:</p>
-<blockquote>
-Writable iterators built with <tt class="literal"><span class="pre">iterator_facade</span></tt> implement
-the semantics required by the preferred resolution to <cite>issue
-299</cite> and adopted by proposal <cite>n1550</cite>: the result of <tt class="literal"><span class="pre">p[n]</span></tt>
-is an object convertible to the iterator's <tt class="literal"><span class="pre">value_type</span></tt>,
-and <tt class="literal"><span class="pre">p[n]</span> <span class="pre">=</span> <span class="pre">x</span></tt> is equivalent to <tt class="literal"><span class="pre">*(p</span> <span class="pre">+</span> <span class="pre">n)</span> <span class="pre">=</span> <span class="pre">x</span></tt> (Note:
-This result object may be implemented as a proxy containing a
-copy of <tt class="literal"><span class="pre">p+n</span></tt>).  This approach will work properly for any
-random-access iterator regardless of the other details of its
-implementation.  A user who knows more about the
-implementation of her iterator is free to implement an
-<tt class="literal"><span class="pre">operator[]</span></tt> that returns an lvalue in the derived iterator
-class; it will hide the one supplied by <tt class="literal"><span class="pre">iterator_facade</span></tt>
-from clients of her iterator.</blockquote>
-</blockquote>
-<p>In [lib.iterator.facade] operations:</p>
-<blockquote class="last">
-<p>Change:</p>
-<blockquote>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">an object convertible to <tt class="literal"><span class="pre">X::reference</span></tt> and
-holding a copy <em>p</em> of <tt class="literal"><span class="pre">a+n</span></tt> such that, for a constant
-object <tt class="literal"><span class="pre">v</span></tt> of type <tt class="literal"><span class="pre">X::value_type</span></tt>, <tt class="literal"><span class="pre">X::reference(a[n]</span>
-<span class="pre">=</span> <span class="pre">v)</span></tt> is equivalent to <tt class="literal"><span class="pre">p</span> <span class="pre">=</span> <span class="pre">v</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>to:</p>
-<blockquote>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">an object convertible to <tt class="literal"><span class="pre">value_type</span></tt>. For
-constant objects <tt class="literal"><span class="pre">v</span></tt> of type <tt class="literal"><span class="pre">value_type</span></tt>, and <tt class="literal"><span class="pre">n</span></tt> of
-type <tt class="literal"><span class="pre">difference_type</span></tt>, <tt class="literal"><span class="pre">(*this)[n]</span> <span class="pre">=</span> <span class="pre">v</span></tt> is equivalent
-to <tt class="literal"><span class="pre">*(*this</span> <span class="pre">+</span> <span class="pre">n)</span> <span class="pre">=</span> <span class="pre">v</span></tt>, and <tt class="literal"><span class="pre">static_cast&lt;value_type</span>
-<span class="pre">const&amp;&gt;((*this)[n])</span></tt> is equivalent to
-<tt class="literal"><span class="pre">static_cast&lt;value_type</span> <span class="pre">const&amp;&gt;(*(*this</span> <span class="pre">+</span> <span class="pre">n))</span></tt></td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-</blockquote>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="iterator-facade-redundant-clause">
-<h2><a class="toc-backref" href="#id28" name="iterator-facade-redundant-clause">9.27 Iterator_facade: redundant clause</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">operator-</span></tt> has both an effects clause and a returns
-clause. Looks like the returns clause should be removed.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Remove the returns clause.</p>
-<p>In [lib.iterator.facade] operations:</p>
-<dl class="last">
-<dt>Remove:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">static_cast&lt;Derived</span> <span class="pre">const*&gt;(this)-&gt;advance(-n);</span></tt></td>
-</tr>
-</tbody>
-</table>
-</dd>
-</dl>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="indirect-iterator-incorrect-specification-of-default-constructor">
-<h2><a class="toc-backref" href="#id29" name="indirect-iterator-incorrect-specification-of-default-constructor">9.28 indirect_iterator: incorrect specification of default constructor</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>The default constructor returns &quot;An instance of indirect_iterator
-with a default constructed base object&quot;, but the constructor that
-takes an Iterator object returns &quot;An instance of indirect_iterator
-with the iterator_adaptor subobject copy constructed from x.&quot; The
-latter is the correct form, since it does not reach inside the base
-class for its semantics. So the default constructor shoudl return
-&quot;An instance of indirect_iterator with a default-constructed
-iterator_adaptor subobject.&quot;</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><dl class="first last">
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">indirect_iterator</span></tt> with
-a default constructed base object.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">indirect_iterator</span></tt> with
-a default-constructed <tt class="literal"><span class="pre">m_iterator</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-</dl>
-</td>
-</tr>
-<tr class="field"><th class="field-name">Rationale:</th><td class="field-body">Inheritance from iterator_adaptor has been removed, so we instead
-give the semantics in terms of the (exposition only) member
-<tt class="literal"><span class="pre">m_iterator</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="indirect-iterator-unclear-specification-of-template-constructor">
-<h2><a class="toc-backref" href="#id30" name="indirect-iterator-unclear-specification-of-template-constructor">9.29 indirect_iterator: unclear specification of template constructor</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>The templated constructor that takes an indirect_iterator with a
-different set of template arguments says that it returns &quot;An
-instance of indirect_iterator that is a copy of [the argument]&quot;.
-But the type of the argument is different from the type of the
-object being constructed, and there is no description of what
-a &quot;copy&quot; means. The Iterator template parameter for the argument
-must be convertible to the Iterator template parameter for the type
-being constructed, which suggests that the argument's contained
-Iterator object should be converted to the target type's Iterator
-type.  Is that what's meant here?
-(Pete later writes: In fact, this problem is present in all of the
-specialized adaptors that have a constructor like this: the
-constructor returns &quot;a copy&quot; of the argument without saying what a
-copy is.)</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><dl class="first last">
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">indirect_iterator</span></tt> that is a copy of <tt class="literal"><span class="pre">y</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">indirect_iterator</span></tt> whose 
-<tt class="literal"><span class="pre">m_iterator</span></tt> subobject is constructed from <tt class="literal"><span class="pre">y.base()</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-</dl>
-</td>
-</tr>
-<tr class="field"><th class="field-name">Rationale:</th><td class="field-body">Inheritance from iterator_adaptor has been removed, so we
-instead give the semantics in terms of the member <tt class="literal"><span class="pre">m_iterator</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="transform-iterator-argument-irregularity">
-<h2><a class="toc-backref" href="#id31" name="transform-iterator-argument-irregularity">9.30 transform_iterator argument irregularity</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>The specialized adaptors that take both a Value and a Reference
-template argument all take them in that order, i.e. Value precedes
-Reference in the template argument list, with the exception of
-transform_iterator, where Reference precedes Value. This seems like
-a possible source of confusion. Is there a reason why this order is
-preferable?</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">NAD</td>
-</tr>
-<tr class="field"><th class="field-name">Rationale:</th><td class="field-body">defaults for Value depend on Reference.  A sensible
-Value can almost always be computed from Reference.  The first
-parameter is UnaryFunction, so the argument order is already
-different from the other adapters.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="function-output-iterator-overconstrained">
-<h2><a class="toc-backref" href="#id32" name="function-output-iterator-overconstrained">9.31 function_output_iterator overconstrained</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>function_output_iterator requirements says: &quot;The UnaryFunction must
-be Assignable, Copy Constructible, and the expression f(x) must be
-valid, where f is an object of type UnaryFunction and x is an
-object of a type accepted by f.&quot;</p>
-<p>Everything starting with &quot;and,&quot; somewhat reworded, is actually a
-constraint on output_proxy::operator=. All that's needed to create
-a function_output_iterator object is that the UnaryFunction type be
-Assignable and CopyConstructible. That's also sufficient to
-dereference and to increment such an object. It's only when you try
-to assign through a dereferenced iterator that f(x) has to work,
-and then only for the particular function object that the iterator
-holds and for the particular value that is being assigned.</p>
-<dl>
-<dt>Addition from Jeremy:</dt>
-<dd>The constructor for <tt class="literal"><span class="pre">function_output_iterator</span></tt> is also
-slightly overconstrained because it requires 
-the <tt class="literal"><span class="pre">UnaryFunction</span></tt> to have a default constructor
-even when the default constructor of <tt class="literal"><span class="pre">function_output_iterator</span></tt>
-is not used.</dd>
-</dl>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><dl class="first">
-<dt>Change:</dt>
-<dd><tt class="literal"><span class="pre">output_proxy</span> <span class="pre">operator*();</span></tt></dd>
-<dt>to:</dt>
-<dd><tt class="literal"><span class="pre">/*</span> <span class="pre">see</span> <span class="pre">below</span> <span class="pre">*/</span> <span class="pre">operator*();</span></tt></dd>
-</dl>
-<p>After <tt class="literal"><span class="pre">function_output_iterator&amp;</span> <span class="pre">operator++(int);</span></tt> add:</p>
-<pre class="literal-block">
-private:
-  UnaryFunction m_f;     // exposition only
-</pre>
-<dl>
-<dt>Change:</dt>
-<dd>The <tt class="literal"><span class="pre">UnaryFunction</span></tt> must be Assignable, Copy Constructible,
-and the expression <tt class="literal"><span class="pre">f(x)</span></tt> must be valid, where <tt class="literal"><span class="pre">f</span></tt> is an
-object of type <tt class="literal"><span class="pre">UnaryFunction</span></tt> and <tt class="literal"><span class="pre">x</span></tt> is an object of a
-type accepted by <tt class="literal"><span class="pre">f</span></tt>.  The resulting
-<tt class="literal"><span class="pre">function_output_iterator</span></tt> is a model of the Writable and
-Incrementable Iterator concepts.</dd>
-<dt>to:</dt>
-<dd><tt class="literal"><span class="pre">UnaryFunction</span></tt> must be Assignable and Copy Constructible.</dd>
-</dl>
-<p class="last">After the requirements section, add:</p>
-</td>
-</tr>
-</tbody>
-</table>
-<div class="topic">
-<p class="topic-title first"><tt class="literal"><span class="pre">function_output_iterator</span></tt> models</p>
-<blockquote>
-<tt class="literal"><span class="pre">function_output_iterator</span></tt> is a model of the Writable and
-Incrementable Iterator concepts.</blockquote>
-<dl>
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">function_output_iterator</span></tt> with
-<tt class="literal"><span class="pre">f</span></tt> stored as a data member.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="literal"><span class="pre">function_output_iterator</span></tt> 
-with <tt class="literal"><span class="pre">m_f</span></tt> constructed from <tt class="literal"><span class="pre">f</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>Change:</dt>
-<dd><p class="first"><tt class="literal"><span class="pre">output_proxy</span> <span class="pre">operator*();</span></tt></p>
-<table class="last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">output_proxy</span></tt> constructed with
-a copy of the unary function <tt class="literal"><span class="pre">f</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><p class="first"><tt class="literal"><span class="pre">operator*();</span></tt></p>
-<table class="last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An object <tt class="literal"><span class="pre">r</span></tt> of unspecified type such that <tt class="literal"><span class="pre">r</span> <span class="pre">=</span> <span class="pre">t</span></tt>
-is equivalent to <tt class="literal"><span class="pre">m_f(t)</span></tt> for all <tt class="literal"><span class="pre">t</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>Remove:</dt>
-<dd><p class="first"><tt class="literal"><span class="pre">function_output_iterator::output_proxy</span></tt> operations</p>
-<p><tt class="literal"><span class="pre">output_proxy(UnaryFunction&amp;</span> <span class="pre">f);</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">output_proxy</span></tt> with <tt class="literal"><span class="pre">f</span></tt> stored as
-a data member.</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">template</span> <span class="pre">&lt;class</span> <span class="pre">T&gt;</span> <span class="pre">output_proxy&amp;</span> <span class="pre">operator=(const</span> <span class="pre">T&amp;</span> <span class="pre">value);</span></tt></p>
-<table class="last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><pre class="first last literal-block">
-m_f(value); 
-return *this; 
-</pre>
-</td>
-</tr>
-</tbody>
-</table>
-</dd>
-</dl>
-<p>Change:</p>
-<pre class="literal-block">
-explicit function_output_iterator(const UnaryFunction&amp; f = UnaryFunction());
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-explicit function_output_iterator();
-
-explicit function_output_iterator(const UnaryFunction&amp; f);
-</pre>
-</div>
-</div>
-<div class="section" id="should-output-proxy-really-be-a-named-type">
-<h2><a class="toc-backref" href="#id33" name="should-output-proxy-really-be-a-named-type">9.32 Should output_proxy really be a named type?</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>This means someone can store an output_proxy object for later use,
-whatever that means. It also constrains output_proxy to hold a copy
-of the function object, rather than a pointer to the iterator
-object. Is all this mechanism really necessary?</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">See issue 9.31.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="istreambuf-iterator-isn-t-a-readable-iterator">
-<h2><a class="toc-backref" href="#id34" name="istreambuf-iterator-isn-t-a-readable-iterator">9.33 istreambuf_iterator isn't a Readable Iterator</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>c++std-lib-12333:</p>
-<blockquote>
-N1550 requires that for a Readable Iterator a of type X, <tt class="literal"><span class="pre">*a</span></tt>
-returns an object of type
-<tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::reference</span></tt>. <tt class="literal"><span class="pre">istreambuf_iterator::operator*</span></tt>
-returns <tt class="literal"><span class="pre">charT</span></tt>, but <tt class="literal"><span class="pre">istreambuf_iterator::reference</span></tt> is
-<tt class="literal"><span class="pre">charT&amp;</span></tt>. So am I overlooking something, or is
-<tt class="literal"><span class="pre">istreambuf_iterator</span></tt> not Readable.</blockquote>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Remove all constraints on
-<tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::reference</span></tt> in Readable Iterator and Lvalue
-Iterator. Change Lvalue Iterator to refer to <tt class="literal"><span class="pre">T&amp;</span></tt> instead of
-<tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::reference</span></tt>.</p>
-<dl>
-<dt>Change:</dt>
-<dd>A class or built-in type <tt class="literal"><span class="pre">X</span></tt> models the <em>Readable Iterator</em>
-concept for the value type <tt class="literal"><span class="pre">T</span></tt> if the following expressions
-are valid and respect the stated semantics. <tt class="literal"><span class="pre">U</span></tt> is the type
-of any specified member of type <tt class="literal"><span class="pre">T</span></tt>.</dd>
-<dt>to:</dt>
-<dd>A class or built-in type <tt class="literal"><span class="pre">X</span></tt> models the <em>Readable Iterator</em>
-concept for value type <tt class="literal"><span class="pre">T</span></tt> if, in addition to <tt class="literal"><span class="pre">X</span></tt> being
-Assignable and Copy Constructible, the following expressions
-are valid and respect the stated semantics. <tt class="literal"><span class="pre">U</span></tt> is the type
-of any specified member of type <tt class="literal"><span class="pre">T</span></tt>.</dd>
-</dl>
-<p>From the Input Iterator Requirements table, remove:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="37%" />
-<col width="37%" />
-<col width="26%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::reference</span></tt></td>
-<td>Convertible to
-<tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::value_type</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>Change:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="37%" />
-<col width="37%" />
-<col width="26%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">*a</span></tt></td>
-<td><tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::reference</span></tt></td>
-<td>pre: <tt class="literal"><span class="pre">a</span></tt> is
-dereferenceable. If <tt class="literal"><span class="pre">a</span>
-<span class="pre">==</span> <span class="pre">b</span></tt> then <tt class="literal"><span class="pre">*a</span></tt> is
-equivalent to <tt class="literal"><span class="pre">*b</span></tt></td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>to:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="28%" />
-<col width="20%" />
-<col width="52%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">*a</span></tt></td>
-<td>Convertible to <tt class="literal"><span class="pre">T</span></tt></td>
-<td><dl class="first last">
-<dt>pre: <tt class="literal"><span class="pre">a</span></tt> is dereferenceable. If <tt class="literal"><span class="pre">a</span> <span class="pre">==</span> <span class="pre">b</span></tt> then <tt class="literal"><span class="pre">*a</span></tt></dt>
-<dd>is equivalent to <tt class="literal"><span class="pre">*b</span></tt>.</dd>
-</dl>
-</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<dl>
-<dt>Change:</dt>
-<dd>The <em>Lvalue Iterator</em> concept adds the requirement that the
-<tt class="literal"><span class="pre">reference</span></tt> type be a reference to the value type of the
-iterator.</dd>
-<dt>to:</dt>
-<dd>The <em>Lvalue Iterator</em> concept adds the requirement that the
-return type of <tt class="literal"><span class="pre">operator*</span></tt> type be a reference to the value
-type of the iterator.</dd>
-</dl>
-<p>Change:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="42%" />
-<col width="14%" />
-<col width="44%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th colspan="3">Lvalue Iterator Requirements</th>
-</tr>
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Assertion</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::reference</span></tt></td>
-<td><tt class="literal"><span class="pre">T&amp;</span></tt></td>
-<td><tt class="literal"><span class="pre">T</span></tt> is <em>cv</em>
-<tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::value_type</span></tt>
-where <em>cv</em> is an optional
-cv-qualification</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>to:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="22%" />
-<col width="19%" />
-<col width="59%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th colspan="3">Lvalue Iterator Requirements</th>
-</tr>
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Note/Assertion</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">*a</span></tt></td>
-<td><tt class="literal"><span class="pre">T&amp;</span></tt></td>
-<td><tt class="literal"><span class="pre">T</span></tt> is <em>cv</em>
-<tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::value_type</span></tt>
-where <em>cv</em> is an optional
-cv-qualification.
-pre: <tt class="literal"><span class="pre">a</span></tt> is
-dereferenceable. If <tt class="literal"><span class="pre">a</span>
-<span class="pre">==</span> <span class="pre">b</span></tt> then <tt class="literal"><span class="pre">*a</span></tt> is
-equivalent to <tt class="literal"><span class="pre">*b</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p class="last">At the end of the section reverse_iterator models, add:
-The type <tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::reference</span></tt> must be the type of
-<tt class="literal"><span class="pre">*i</span></tt>, where <tt class="literal"><span class="pre">i</span></tt> is an object of type <tt class="literal"><span class="pre">Iterator</span></tt>.</p>
-</td>
-</tr>
-<tr class="field"><th class="field-name">Rationale:</th><td class="field-body"><p class="first">Ideally there should be requirements on the reference
-type, however, since Readable Iterator is suppose to correspond
-to the current standard iterator requirements (which do not place
-requirements on the reference type) we will leave them off for
-now.  There is a DR in process with respect to the reference type
-in the stadard iterator requirements. Once that is resolved we
-will revisit this issue for Readable Iterator and Lvalue
-Iterator.</p>
-<p class="last">We added Assignable to the requirements for Readable
-Iterator. This is needed to have Readable Iterator coincide with
-the capabilities of Input Iterator.</p>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="iterator-facade-free-functions-unspecified">
-<h2><a class="toc-backref" href="#id35" name="iterator-facade-free-functions-unspecified">9.34 iterator_facade free functions unspecified</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>c++std-lib-12562:</p>
-<blockquote>
-The template functions <tt class="literal"><span class="pre">operator==</span></tt>, <tt class="literal"><span class="pre">operator!=</span></tt>,
-<tt class="literal"><span class="pre">operator&lt;</span></tt>, <tt class="literal"><span class="pre">operator&lt;=</span></tt>, <tt class="literal"><span class="pre">operator&gt;</span></tt>, <tt class="literal"><span class="pre">operator&gt;=</span></tt>, and
-<tt class="literal"><span class="pre">operator-</span></tt> that take two arguments that are specializations of
-iterator_facade have no specification. The template function
-operator+ that takes an argument that is a specialization of
-iterator_facade and an argument of type difference_type has no
-specification.</blockquote>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Add the missing specifications.</p>
-<pre class="literal-block">
-template &lt;class Dr, class V, class TC, class R, class D&gt;
-Derived operator+ (iterator_facade&lt;Dr,V,TC,R,D&gt; const&amp;,
-                   typename Derived::difference_type n);
-
-template &lt;class Dr, class V, class TC, class R, class D&gt;
-Derived operator+ (typename Derived::difference_type n,
-                   iterator_facade&lt;Dr,V,TC,R,D&gt; const&amp;);
-</pre>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><pre class="first last literal-block">
-Derived tmp(static_cast&lt;Derived const*&gt;(this));
-return tmp += n;
-</pre>
-</td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;class Dr1, class V1, class TC1, class R1, class D1,
-          class Dr2, class V2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1,Dr2,bool&gt;::type
-operator ==(iterator_facade&lt;Dr1,V1,TC1,R1,D1&gt; const&amp; lhs,
-            iterator_facade&lt;Dr2,V2,TC2,R2,D2&gt; const&amp; rhs);
-</pre>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">if <tt class="literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt>, then
-<tt class="literal"><span class="pre">lhs.equal(rhs)</span></tt>.  Otherwise, <tt class="literal"><span class="pre">rhs.equal(lhs)</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;class Dr1, class V1, class TC1, class R1, class D1,
-          class Dr2, class V2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1,Dr2,bool&gt;::type
-operator !=(iterator_facade&lt;Dr1,V1,TC1,R1,D1&gt; const&amp; lhs,
-            iterator_facade&lt;Dr2,V2,TC2,R2,D2&gt; const&amp; rhs);
-</pre>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">if <tt class="literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt>, then
-<tt class="literal"><span class="pre">!lhs.equal(rhs)</span></tt>.  Otherwise, <tt class="literal"><span class="pre">!rhs.equal(lhs)</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;class Dr1, class V1, class TC1, class R1, class D1,
-          class Dr2, class V2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1,Dr2,bool&gt;::type
-operator &lt;(iterator_facade&lt;Dr1,V1,TC1,R1,D1&gt; const&amp; lhs,
-           iterator_facade&lt;Dr2,V2,TC2,R2,D2&gt; const&amp; rhs);
-</pre>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">if <tt class="literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt>, then
-<tt class="literal"><span class="pre">lhs.distance_to(rhs)</span> <span class="pre">&lt;</span> <span class="pre">0</span></tt>. Otherwise, <tt class="literal"><span class="pre">rhs.distance_to(lhs)</span> <span class="pre">&gt;</span>
-<span class="pre">0</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;class Dr1, class V1, class TC1, class R1, class D1,
-          class Dr2, class V2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1,Dr2,bool&gt;::type
-operator &lt;=(iterator_facade&lt;Dr1,V1,TC1,R1,D1&gt; const&amp; lhs,
-            iterator_facade&lt;Dr2,V2,TC2,R2,D2&gt; const&amp; rhs);
-</pre>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">if <tt class="literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt>, then
-<tt class="literal"><span class="pre">lhs.distance_to(rhs)</span> <span class="pre">&lt;=</span> <span class="pre">0</span></tt>. Otherwise, <tt class="literal"><span class="pre">rhs.distance_to(lhs)</span>
-<span class="pre">&gt;=</span> <span class="pre">0</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;class Dr1, class V1, class TC1, class R1, class D1,
-          class Dr2, class V2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1,Dr2,bool&gt;::type
-operator &gt;(iterator_facade&lt;Dr1,V1,TC1,R1,D1&gt; const&amp; lhs,
-           iterator_facade&lt;Dr2,V2,TC2,R2,D2&gt; const&amp; rhs);
-</pre>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">if <tt class="literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt>, then
-<tt class="literal"><span class="pre">lhs.distance_to(rhs)</span> <span class="pre">&gt;</span> <span class="pre">0</span></tt>. Otherwise,
-<tt class="literal"><span class="pre">rhs.distance_to(lhs)</span> <span class="pre">&lt;</span> <span class="pre">0</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;class Dr1, class V1, class TC1, class R1, class D1,
-          class Dr2, class V2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1,Dr2,bool&gt;::type
-operator &gt;=(iterator_facade&lt;Dr1,V1,TC1,R1,D1&gt; const&amp; lhs,
-            iterator_facade&lt;Dr2,V2,TC2,R2,D2&gt; const&amp; rhs);
-</pre>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">if <tt class="literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt>, then
-<tt class="literal"><span class="pre">lhs.distance_to(rhs)</span> <span class="pre">&gt;=</span> <span class="pre">0</span></tt>. Otherwise,
-<tt class="literal"><span class="pre">rhs.distance_to(lhs)</span> <span class="pre">&lt;=</span> <span class="pre">0</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;class Dr1, class V1, class TC1, class R1, class D1,
-          class Dr2, class V2, class TC2, class R2, class D2&gt;
-typename enable_if_interoperable&lt;Dr1,Dr2,difference&gt;::type
-operator -(iterator_facade&lt;Dr1,V1,TC1,R1,D1&gt; const&amp; lhs,
-           iterator_facade&lt;Dr2,V2,TC2,R2,D2&gt; const&amp; rhs);
-</pre>
-<table class="last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Return Type:</th><td class="field-body">if <tt class="literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt>, then
-<tt class="literal"><span class="pre">difference</span></tt> shall be
-<tt class="literal"><span class="pre">iterator_traits&lt;Dr1&gt;::difference_type</span></tt>.  Otherwise,
-<tt class="literal"><span class="pre">difference</span></tt> shall be
-<tt class="literal"><span class="pre">iterator_traits&lt;Dr2&gt;::difference_type</span></tt>.</td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">if <tt class="literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt>, then
-<tt class="literal"><span class="pre">-lhs.distance_to(rhs)</span></tt>. Otherwise,
-<tt class="literal"><span class="pre">rhs.distance_to(lhs)</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="iterator-facade-too-many-equals">
-<h2><a class="toc-backref" href="#id36" name="iterator-facade-too-many-equals">9.35 iterator_facade: too many equals?</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>c++std-lib-12563:</p>
-<blockquote>
-<p>The table listing the functions required for types derived from
-iterator_facade has two functions named equal and two named
-distance_to:</p>
-<pre class="literal-block">
-c.equal(b)
-c.equal(y)
-c.distance_to(b)
-c.distance_to(z)
-</pre>
-<p>where b and c are const objects of the derived type, y and z are
-constant objects of certain iterator types that are interoperable
-with the derived type.  Seems like the 'b' versions are
-redundant: in both cases, the other version will take a 'b'. In
-fact, iterator_adaptor is specified to use iterator_facade, but
-does not provide the 'b' versions of these functions.</p>
-<p>Are the 'b' versions needed?</p>
-</blockquote>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Remove the 'b' versions.</p>
-<p>In <tt class="literal"><span class="pre">iterator_facade</span></tt> requirements, remove:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="19%" />
-<col width="18%" />
-<col width="36%" />
-<col width="26%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">c.equal(b)</span></tt></td>
-<td>convertible to bool</td>
-<td>true iff <tt class="literal"><span class="pre">b</span></tt> and <tt class="literal"><span class="pre">c</span></tt> are
-equivalent.</td>
-<td>Single Pass Iterator</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>and remove:</p>
-<blockquote class="last">
-<table border="1" class="table">
-<colgroup>
-<col width="19%" />
-<col width="18%" />
-<col width="36%" />
-<col width="26%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">c.distance_to(b)</span></tt></td>
-<td>convertible to
-X::difference_type</td>
-<td>equivalent to <tt class="literal"><span class="pre">distance(c,</span> <span class="pre">b)</span></tt></td>
-<td>Random Access Traversal
-Iterator</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="iterator-facade-function-requirements">
-<h2><a class="toc-backref" href="#id37" name="iterator-facade-function-requirements">9.36 iterator_facade function requirements</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>c++std-lib-12636:</p>
-<blockquote>
-<p>The table that lists required functions for the derived type X
-passed to iterator_facade lists, among others:</p>
-<p>for a single pass iterator:</p>
-<pre class="literal-block">
-c.equal(b)
-c.equal(y)
-</pre>
-<p>where b and c are const X objects, and y is a const object of a
-single pass iterator that is interoperable with X. Since X is
-interoperable with itself, c.equal(b) is redundant. There is a
-difference in their descriptions, but its meaning isn't
-clear. The first is &quot;true iff b and c are equivalent&quot;, and the
-second is &quot;true iff c and y refer to the same position.&quot; Is there
-a difference between the undefined term &quot;equivalent&quot; and &quot;refer
-to the same position&quot;?</p>
-<p>Similarly, for a random access traversal iterator:</p>
-<pre class="literal-block">
-c.distance_to(b)
-c.distance_to(z)
-</pre>
-<p>where z is a constant object of a random access traversal
-iterator that is interoperable with X.  Again, X is interoperable
-with itself, so c.distance_to(b) is redundant.  Also, the
-specification for c.distance_to(z) isn't valid. It's written
-as &quot;equivalent to distance(c, z)&quot;. The template function distance
-takes two arguments of the same type, so distance(c, z) isn't
-valid if c and z are different types. Should it be
-distance(c, (X)z)?</p>
-</blockquote>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Removed the 'b' versions (see 9.35) and added the cast.</p>
-<p>Change:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="19%" />
-<col width="18%" />
-<col width="36%" />
-<col width="26%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">c.distance_to(z)</span></tt></td>
-<td>convertible to
-X::difference_type</td>
-<td>equivalent to <tt class="literal"><span class="pre">distance(c,</span> <span class="pre">z)</span></tt>.
-Implements <tt class="literal"><span class="pre">c</span> <span class="pre">-</span> <span class="pre">z</span></tt>, <tt class="literal"><span class="pre">c</span> <span class="pre">&lt;</span> <span class="pre">z</span></tt>, <tt class="literal"><span class="pre">c</span>
-<span class="pre">&lt;=</span> <span class="pre">z</span></tt>, <tt class="literal"><span class="pre">c</span> <span class="pre">&gt;</span> <span class="pre">z</span></tt>, and <tt class="literal"><span class="pre">c</span> <span class="pre">&gt;=</span> <span class="pre">c</span></tt>.</td>
-<td>Random Access Traversal
-Iterator</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>to:</p>
-<blockquote class="last">
-<table border="1" class="table">
-<colgroup>
-<col width="21%" />
-<col width="23%" />
-<col width="27%" />
-<col width="29%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">c.distance_to(z)</span></tt></td>
-<td>convertible to
-<tt class="literal"><span class="pre">F::difference_type</span></tt></td>
-<td>equivalent to
-<tt class="literal"><span class="pre">distance(c,</span> <span class="pre">X(z))</span></tt>.</td>
-<td>Random Access Traversal
-Iterator</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-</div>
-<div class="section" id="more-issues-not-from-matt-s-list">
-<h1><a class="toc-backref" href="#id38" name="more-issues-not-from-matt-s-list">More Issues (not from Matt's list)</a></h1>
-<div class="section" id="x-inheritance-in-iterator-adaptor-and-other-adaptors-is-an-overspecification">
-<h2><a class="toc-backref" href="#id39" name="x-inheritance-in-iterator-adaptor-and-other-adaptors-is-an-overspecification">9.37x Inheritance in iterator_adaptor and other adaptors is an overspecification</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>c++std-lib-12696:
-The paper requires that iterator_adaptor be derived from an
-appropriate instance of iterator_facade, and that most of the specific
-forms of adaptors be derived from appropriate instances of
-iterator_adaptor. That seems like overspecification, and we ought to
-look at specifying these things in terms of what the various templates
-provide rather than how they're implemented.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Remove the specfication of inheritance, and add explicit
-specification of all the functionality that was inherited from the
-specialized iterators.</p>
-<p>In iterator_adaptor, inheritance is retained, sorry NAD.  Also,
-the Interoperable Iterators concept is added to the new iterator
-concepts, and this concept is used in the specification of the
-iterator adaptors.</p>
-<p>In n1550, after [lib.random.access.traversal.iterators], add:</p>
-<blockquote>
-<p>Interoperable Iterators [lib.interoperable.iterators]</p>
-<p>A class or built-in type <tt class="literal"><span class="pre">X</span></tt> that models Single Pass Iterator
-is <em>interoperable with</em> a class or built-in type <tt class="literal"><span class="pre">Y</span></tt> that
-also models Single Pass Iterator if the following expressions
-are valid and respect the stated semantics. In the tables
-below, <tt class="literal"><span class="pre">x</span></tt> is an object of type <tt class="literal"><span class="pre">X</span></tt>, <tt class="literal"><span class="pre">y</span></tt> is an object of
-type <tt class="literal"><span class="pre">Y</span></tt>, <tt class="literal"><span class="pre">Distance</span></tt> is
-<tt class="literal"><span class="pre">iterator_traits&lt;Y&gt;::difference_type</span></tt>, and <tt class="literal"><span class="pre">n</span></tt> represents a
-constant object of type <tt class="literal"><span class="pre">Distance</span></tt>.</p>
-<table border="1" class="table">
-<colgroup>
-<col width="13%" />
-<col width="27%" />
-<col width="60%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Assertion/Precondition/Postcondition</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">y</span> <span class="pre">=</span> <span class="pre">x</span></tt></td>
-<td><tt class="literal"><span class="pre">Y</span></tt></td>
-<td>post: <tt class="literal"><span class="pre">y</span> <span class="pre">==</span> <span class="pre">x</span></tt></td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">Y(x)</span></tt></td>
-<td><tt class="literal"><span class="pre">Y</span></tt></td>
-<td>post: <tt class="literal"><span class="pre">Y(x)</span> <span class="pre">==</span> <span class="pre">x</span></tt></td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">x</span> <span class="pre">==</span> <span class="pre">y</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">==</span></tt> is an equivalence relation over its domain.</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">y</span> <span class="pre">==</span> <span class="pre">x</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">==</span></tt> is an equivalence relation over its domain.</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">x</span> <span class="pre">!=</span> <span class="pre">y</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">bool(a==b)</span> <span class="pre">!=</span> <span class="pre">bool(a!=b)</span></tt> over its domain.</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">y</span> <span class="pre">!=</span> <span class="pre">x</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">bool(a==b)</span> <span class="pre">!=</span> <span class="pre">bool(a!=b)</span></tt> over its domain.</td>
-</tr>
-</tbody>
-</table>
-<p>If <tt class="literal"><span class="pre">X</span></tt> and <tt class="literal"><span class="pre">Y</span></tt> both model Random Access Traversal Iterator then
-the following additional requirements must be met.</p>
-<table border="1" class="table">
-<colgroup>
-<col width="12%" />
-<col width="25%" />
-<col width="23%" />
-<col width="41%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Operational Semantics</th>
-<th>Assertion/ Precondition</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">x</span> <span class="pre">&lt;</span> <span class="pre">y</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">y</span> <span class="pre">-</span> <span class="pre">x</span> <span class="pre">&gt;</span> <span class="pre">0</span></tt></td>
-<td><tt class="literal"><span class="pre">&lt;</span></tt> is a total ordering relation</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">y</span> <span class="pre">&lt;</span> <span class="pre">x</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">x</span> <span class="pre">-</span> <span class="pre">y</span> <span class="pre">&gt;</span> <span class="pre">0</span></tt></td>
-<td><tt class="literal"><span class="pre">&lt;</span></tt> is a total ordering relation</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">x</span> <span class="pre">&gt;</span> <span class="pre">y</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">y</span> <span class="pre">&lt;</span> <span class="pre">x</span></tt></td>
-<td><tt class="literal"><span class="pre">&gt;</span></tt> is a total ordering relation</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">y</span> <span class="pre">&gt;</span> <span class="pre">x</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">x</span> <span class="pre">&lt;</span> <span class="pre">y</span></tt></td>
-<td><tt class="literal"><span class="pre">&gt;</span></tt> is a total ordering relation</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">x</span> <span class="pre">&gt;=</span> <span class="pre">y</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">!(x</span> <span class="pre">&lt;</span> <span class="pre">y)</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">y</span> <span class="pre">&gt;=</span> <span class="pre">x</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">!(y</span> <span class="pre">&lt;</span> <span class="pre">x)</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">x</span> <span class="pre">&lt;=</span> <span class="pre">y</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">!(x</span> <span class="pre">&gt;</span> <span class="pre">y)</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">y</span> <span class="pre">&lt;=</span> <span class="pre">x</span></tt></td>
-<td>convertible to <tt class="literal"><span class="pre">bool</span></tt></td>
-<td><tt class="literal"><span class="pre">!(y</span> <span class="pre">&gt;</span> <span class="pre">x)</span></tt></td>
-<td>&nbsp;</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">y</span> <span class="pre">-</span> <span class="pre">x</span></tt></td>
-<td><tt class="literal"><span class="pre">Distance</span></tt></td>
-<td><tt class="literal"><span class="pre">distance(Y(x),y)</span></tt></td>
-<td>pre: there exists a value <tt class="literal"><span class="pre">n</span></tt> of
-<tt class="literal"><span class="pre">Distance</span></tt> such that <tt class="literal"><span class="pre">x</span> <span class="pre">+</span> <span class="pre">n</span> <span class="pre">==</span> <span class="pre">y</span></tt>.
-<tt class="literal"><span class="pre">y</span> <span class="pre">==</span> <span class="pre">x</span> <span class="pre">+</span> <span class="pre">(y</span> <span class="pre">-</span> <span class="pre">x)</span></tt>.</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">x</span> <span class="pre">-</span> <span class="pre">y</span></tt></td>
-<td><tt class="literal"><span class="pre">Distance</span></tt></td>
-<td><tt class="literal"><span class="pre">distance(y,Y(x))</span></tt></td>
-<td>pre: there exists a value <tt class="literal"><span class="pre">n</span></tt> of
-<tt class="literal"><span class="pre">Distance</span></tt> such that <tt class="literal"><span class="pre">y</span> <span class="pre">+</span> <span class="pre">n</span> <span class="pre">==</span> <span class="pre">x</span></tt>.
-<tt class="literal"><span class="pre">x</span> <span class="pre">==</span> <span class="pre">y</span> <span class="pre">+</span> <span class="pre">(x</span> <span class="pre">-</span> <span class="pre">y)</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>In N1530:</p>
-<blockquote class="last">
-<p>In [lib.iterator.adaptor]</p>
-<p>Change:</p>
-<pre class="literal-block">
-class iterator_adaptor 
-  : public iterator_facade&lt;Derived, /* see details ...*/&gt;
-</pre>
-<p>To:</p>
-<pre class="literal-block">
-class iterator_adaptor 
-  : public iterator_facade&lt;Derived, *V'*, *C'*, *R'*, *D'*&gt; // see details
-</pre>
-<dl>
-<dt>Change the text from:</dt>
-<dd>The <tt class="literal"><span class="pre">Base</span></tt> type must implement the expressions involving
-<tt class="literal"><span class="pre">m_iterator</span></tt> in the specifications...</dd>
-<dt>until the end of the <strong>iterator_adaptor requirements</strong> section, to:</dt>
-<dd>The <tt class="literal"><span class="pre">Base</span></tt> argument shall be Assignable and Copy Constructible.</dd>
-</dl>
-<p>Add:</p>
-</blockquote>
-</td>
-</tr>
-</tbody>
-</table>
-<div class="topic">
-<p class="topic-title first"><tt class="literal"><span class="pre">iterator_adaptor</span></tt> base class parameters</p>
-<blockquote>
-<p>The <em>V'</em>, <em>C'</em>, <em>R'</em>, and <em>D'</em> parameters of the <tt class="literal"><span class="pre">iterator_facade</span></tt>
-used as a base class in the summary of <tt class="literal"><span class="pre">iterator_adaptor</span></tt>
-above are defined as follows:</p>
-<pre class="literal-block">
-<em>V'</em> = if (Value is use_default)
-          return iterator_traits&lt;Base&gt;::value_type
-      else
-          return Value
-
-<em>C'</em> = if (CategoryOrTraversal is use_default)
-          return iterator_traversal&lt;Base&gt;::type
-      else
-          return CategoryOrTraversal
-
-<em>R'</em> = if (Reference is use_default)
-          if (Value is use_default)
-              return iterator_traits&lt;Base&gt;::reference
-          else
-              return Value&amp;
-      else
-          return Reference
-
-<em>D'</em> = if (Difference is use_default)
-          return iterator_traits&lt;Base&gt;::difference_type
-      else
-          return Difference
-</pre>
-</blockquote>
-<p>In [lib.iterator.special.adaptors]</p>
-<p>Change:</p>
-<pre class="literal-block">
-class indirect_iterator
-  : public iterator_adaptor&lt;/* see discussion */&gt;
-{
-    friend class iterator_core_access;
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-class indirect_iterator
-{
- public:
-    typedef /* see below */ value_type;
-    typedef /* see below */ reference;
-    typedef /* see below */ pointer;
-    typedef /* see below */ difference_type;
-    typedef /* see below */ iterator_category;
-</pre>
-<p>Change:</p>
-<pre class="literal-block">
-private: // as-if specification
-    typename indirect_iterator::reference dereference() const
-    {
-        return **this-&gt;base();
-    }
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-    Iterator const&amp; base() const;
-    reference operator*() const;
-    indirect_iterator&amp; operator++();
-    indirect_iterator&amp; operator--();
-private:
-   Iterator m_iterator; // exposition
-</pre>
-<p>After the synopsis add:</p>
-<blockquote>
-<p>The member types of <tt class="literal"><span class="pre">indirect_iterator</span></tt> are defined
-according to the following pseudo-code, where <tt class="literal"><span class="pre">V</span></tt> is
-<tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt></p>
-<pre class="literal-block">
-if (Value is use_default) then
-    typedef remove_const&lt;pointee&lt;V&gt;::type&gt;::type value_type;
-else
-    typedef remove_const&lt;Value&gt;::type value_type;
-
-if (Reference is use_default) then
-    if (Value is use_default) then
-        typedef indirect_reference&lt;V&gt;::type reference;
-    else
-        typedef Value&amp; reference;
-else
-    typedef Reference reference;
-
-if (Value is use_default) then 
-    typedef pointee&lt;V&gt;::type* pointer;
-else 
-    typedef Value* pointer;
-
-if (Difference is use_default)
-    typedef iterator_traits&lt;Iterator&gt;::difference_type difference_type;
-else
-    typedef Difference difference_type;
-
-if (CategoryOrTraversal is use_default)
-    typedef <em>iterator-category</em>(
-        iterator_traversal&lt;Iterator&gt;::type,``reference``,``value_type``
-    ) iterator_category;
-else
-    typedef <em>iterator-category</em>(
-        CategoryOrTraversal,``reference``,``value_type``
-    ) iterator_category;
-</pre>
-</blockquote>
-<p>[Note: See resolution to 9.44y for a description of <tt class="literal"><span class="pre">pointee</span></tt> and
-<tt class="literal"><span class="pre">indirect_reference</span></tt>]</p>
-<p>After the requirements section, add:</p>
-</div>
-<div class="topic">
-<p class="topic-title first"><tt class="literal"><span class="pre">indirect_iterator</span></tt> models</p>
-<blockquote>
-<p>In addition to the concepts indicated by <tt class="literal"><span class="pre">iterator_category</span></tt>
-and by <tt class="literal"><span class="pre">iterator_traversal&lt;indirect_iterator&gt;::type</span></tt>, a
-specialization of <tt class="literal"><span class="pre">indirect_iterator</span></tt> models the following
-concepts, Where <tt class="literal"><span class="pre">v</span></tt> is an object of
-<tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt>:</p>
-<blockquote>
-<ul class="simple">
-<li>Readable Iterator if <tt class="literal"><span class="pre">reference(*v)</span></tt> is convertible to
-<tt class="literal"><span class="pre">value_type</span></tt>.</li>
-<li>Writable Iterator if <tt class="literal"><span class="pre">reference(*v)</span> <span class="pre">=</span> <span class="pre">t</span></tt> is a valid
-expression (where <tt class="literal"><span class="pre">t</span></tt> is an object of type
-<tt class="literal"><span class="pre">indirect_iterator::value_type</span></tt>)</li>
-<li>Lvalue Iterator if <tt class="literal"><span class="pre">reference</span></tt> is a reference type.</li>
-</ul>
-</blockquote>
-<p><tt class="literal"><span class="pre">indirect_iterator&lt;X,V1,C1,R1,D1&gt;</span></tt> is interoperable with
-<tt class="literal"><span class="pre">indirect_iterator&lt;Y,V2,C2,R2,D2&gt;</span></tt> if and only if <tt class="literal"><span class="pre">X</span></tt> is
-interoperable with <tt class="literal"><span class="pre">Y</span></tt>.</p>
-</blockquote>
-<p>Before <tt class="literal"><span class="pre">indirect_iterator();</span></tt> add:</p>
-<blockquote>
-In addition to the operations required by the concepts described
-above, specializations of <tt class="literal"><span class="pre">indirect_iterator</span></tt> provide the
-following operations.</blockquote>
-<dl>
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">indirect_iterator</span></tt> with
-the <tt class="literal"><span class="pre">iterator_adaptor</span></tt> subobject copy constructed from <tt class="literal"><span class="pre">x</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">indirect_iterator</span></tt> with
-<tt class="literal"><span class="pre">m_iterator</span></tt> copy constructed from <tt class="literal"><span class="pre">x</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-</dl>
-<p>At the end of the indirect_iterator operations add:</p>
-<blockquote>
-<p><tt class="literal"><span class="pre">Iterator</span> <span class="pre">const&amp;</span> <span class="pre">base()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">m_iterator</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">reference</span> <span class="pre">operator*()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">**m_iterator</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">indirect_iterator&amp;</span> <span class="pre">operator++();</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><tt class="literal"><span class="pre">++m_iterator</span></tt></td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*this</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">indirect_iterator&amp;</span> <span class="pre">operator--();</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><tt class="literal"><span class="pre">--m_iterator</span></tt></td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*this</span></tt></td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>Change:</p>
-<pre class="literal-block">
-template &lt;class Iterator&gt;
-class reverse_iterator :
-  public iterator_adaptor&lt; reverse_iterator&lt;Iterator&gt;, Iterator &gt;
-{
-  friend class iterator_core_access;
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-template &lt;class Iterator&gt;
-class reverse_iterator
-{
-public:
-  typedef iterator_traits&lt;Iterator&gt;::value_type value_type;
-  typedef iterator_traits&lt;Iterator&gt;::reference reference;
-  typedef iterator_traits&lt;Iterator&gt;::pointer pointer;
-  typedef iterator_traits&lt;Iterator&gt;::difference_type difference_type;
-  typedef /* see below */ iterator_category;
-</pre>
-<p>Change:</p>
-<pre class="literal-block">
-private: // as-if specification
-  typename reverse_iterator::reference dereference() const { return *prior(this-&gt;base()); }
-
-  void increment() { --this-&gt;base_reference(); }
-  void decrement() { ++this-&gt;base_reference(); }
-
-  void advance(typename reverse_iterator::difference_type n)
-  {
-      this-&gt;base_reference() += -n;
-  }
-
-  template &lt;class OtherIterator&gt;
-  typename reverse_iterator::difference_type
-  distance_to(reverse_iterator&lt;OtherIterator&gt; const&amp; y) const
-  {
-      return this-&gt;base_reference() - y.base();
-  }
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-  Iterator const&amp; base() const;
-  reference operator*() const;
-  reverse_iterator&amp; operator++();
-  reverse_iterator&amp; operator--();
-private:
-  Iterator m_iterator; // exposition
-</pre>
-<dl>
-<dt>After the synopsis for <tt class="literal"><span class="pre">reverse_iterator</span></tt>, add:</dt>
-<dd>If <tt class="literal"><span class="pre">Iterator</span></tt> models Random Access Traversal Iterator and Readable
-Lvalue Iterator, then <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to
-<tt class="literal"><span class="pre">random_access_iterator_tag</span></tt>. Otherwise, if
-<tt class="literal"><span class="pre">Iterator</span></tt> models Bidirectional Traversal Iterator and Readable
-Lvalue Iterator, then <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to
-<tt class="literal"><span class="pre">bidirectional_iterator_tag</span></tt>. Otherwise, <tt class="literal"><span class="pre">iterator_category</span></tt> is
-convertible to <tt class="literal"><span class="pre">input_iterator_tag</span></tt>.</dd>
-<dt>Change:</dt>
-<dd><p class="first"><strong>reverse_iterator requirements</strong></p>
-<p class="last">The base <tt class="literal"><span class="pre">Iterator</span></tt> must be a model of Bidirectional Traversal
-Iterator. The resulting <tt class="literal"><span class="pre">reverse_iterator</span></tt> will be a model of the
-most refined standard traversal and access concepts that are modeled
-by <tt class="literal"><span class="pre">Iterator</span></tt>.</p>
-</dd>
-<dt>to:</dt>
-<dd><p class="first"><strong>reverse_iterator requirements</strong></p>
-<p class="last"><tt class="literal"><span class="pre">Iterator</span></tt> must be a model of Bidirectional Traversal Iterator.</p>
-</dd>
-</dl>
-</div>
-<div class="topic">
-<p class="topic-title first"><tt class="literal"><span class="pre">reverse_iterator</span></tt> models</p>
-<blockquote>
-<p>A specialization of <tt class="literal"><span class="pre">reverse_iterator</span></tt> models the same iterator
-traversal and iterator access concepts modeled by its <tt class="literal"><span class="pre">Iterator</span></tt>
-argument.  In addition, it may model old iterator concepts
-specified in the following table:</p>
-<table border="1" class="table">
-<colgroup>
-<col width="53%" />
-<col width="47%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th>If <tt class="literal"><span class="pre">I</span></tt> models</th>
-<th>then <tt class="literal"><span class="pre">reverse_iterator&lt;I&gt;</span></tt> models</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td>Readable Lvalue Iterator,
-Bidirectional Traversal Iterator</td>
-<td>Bidirectional Iterator</td>
-</tr>
-<tr><td>Writable Lvalue Iterator,
-Bidirectional Traversal Iterator</td>
-<td>Mutable Bidirectional Iterator</td>
-</tr>
-<tr><td>Readable Lvalue Iterator,
-Random Access Traversal Iterator</td>
-<td>Random Access Iterator</td>
-</tr>
-<tr><td>Writable Lvalue Iterator,
-Random Access Traversal Iterator</td>
-<td>Mutable Random Access Iterator</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">reverse_iterator&lt;X&gt;</span></tt> is interoperable with
-<tt class="literal"><span class="pre">reverse_iterator&lt;Y&gt;</span></tt> if and only if <tt class="literal"><span class="pre">X</span></tt> is interoperable with
-<tt class="literal"><span class="pre">Y</span></tt>.</p>
-</blockquote>
-<dl>
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">reverse_iterator</span></tt> with a
-default constructed base object.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="literal"><span class="pre">reverse_iterator</span></tt> with <tt class="literal"><span class="pre">m_iterator</span></tt> 
-default constructed.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="literal"><span class="pre">reverse_iterator</span></tt> with a
-base object copy constructed from <tt class="literal"><span class="pre">x</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="literal"><span class="pre">reverse_iterator</span></tt> with a
-<tt class="literal"><span class="pre">m_iterator</span></tt> constructed from <tt class="literal"><span class="pre">x</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">reverse_iterator</span></tt> that is a copy of <tt class="literal"><span class="pre">r</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs instance of <tt class="literal"><span class="pre">reverse_iterator</span></tt> whose 
-<tt class="literal"><span class="pre">m_iterator</span></tt> subobject is constructed from <tt class="literal"><span class="pre">y.base()</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>At the end of the operations for <tt class="literal"><span class="pre">reverse_iterator</span></tt>, add:</dt>
-<dd><p class="first"><tt class="literal"><span class="pre">Iterator</span> <span class="pre">const&amp;</span> <span class="pre">base()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">m_iterator</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">reference</span> <span class="pre">operator*()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"></td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-Iterator tmp = m_iterator;
-return *--tmp;
-</pre>
-<p><tt class="literal"><span class="pre">reverse_iterator&amp;</span> <span class="pre">operator++();</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><tt class="literal"><span class="pre">--m_iterator</span></tt></td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*this</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">reverse_iterator&amp;</span> <span class="pre">operator--();</span></tt></p>
-<table class="last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><tt class="literal"><span class="pre">++m_iterator</span></tt></td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*this</span></tt></td>
-</tr>
-</tbody>
-</table>
-</dd>
-</dl>
-<p>Change:</p>
-<pre class="literal-block">
-class transform_iterator
-  : public iterator_adaptor&lt;/* see discussion */&gt;
-{
-  friend class iterator_core_access;
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-class transform_iterator
-{
-public:
-  typedef /* see below */ value_type;
-  typedef /* see below */ reference;
-  typedef /* see below */ pointer;
-  typedef iterator_traits&lt;Iterator&gt;::difference_type difference_type;
-  typedef /* see below */ iterator_category;
-</pre>
-<p>After <tt class="literal"><span class="pre">UnaryFunction</span> <span class="pre">functor()</span> <span class="pre">const;</span></tt> add:</p>
-<pre class="literal-block">
-Iterator const&amp; base() const;
-reference operator*() const;
-transform_iterator&amp; operator++();
-transform_iterator&amp; operator--();
-</pre>
-<p>Change:</p>
-<pre class="literal-block">
-private:
-  typename transform_iterator::value_type dereference() const;
-  UnaryFunction m_f;
-};
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-private:
-  Iterator m_iterator; // exposition only
-  UnaryFunction m_f;   // exposition only
-};
-</pre>
-<dl>
-<dt>After the synopsis, add:</dt>
-<dd>If <tt class="literal"><span class="pre">Iterator</span></tt> models Readable Lvalue Iterator and if <tt class="literal"><span class="pre">Iterator</span></tt>
-models Random Access Traversal Iterator, then <tt class="literal"><span class="pre">iterator_category</span></tt> is
-convertible to <tt class="literal"><span class="pre">random_access_iterator_tag</span></tt>. Otherwise, if
-<tt class="literal"><span class="pre">Iterator</span></tt> models Bidirectional Traversal Iterator, then
-<tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to
-<tt class="literal"><span class="pre">bidirectional_iterator_tag</span></tt>.  Otherwise <tt class="literal"><span class="pre">iterator_category</span></tt> is
-convertible to <tt class="literal"><span class="pre">forward_iterator_tag</span></tt>. If <tt class="literal"><span class="pre">Iterator</span></tt> does not
-model Readable Lvalue Iterator then <tt class="literal"><span class="pre">iterator_category</span></tt> is
-convertible to <tt class="literal"><span class="pre">input_iterator_tag</span></tt>.</dd>
-<dt>In the requirements section, change:</dt>
-<dd><p class="first">The type <tt class="literal"><span class="pre">Iterator</span></tt> must at least model Readable Iterator.  The
-resulting <tt class="literal"><span class="pre">transform_iterator</span></tt> models the most refined of the
-following that is also modeled by <tt class="literal"><span class="pre">Iterator</span></tt>.</p>
-<blockquote>
-<ul class="simple">
-<li>Writable Lvalue Iterator if
-<tt class="literal"><span class="pre">result_of&lt;UnaryFunction(iterator_traits&lt;Iterator&gt;::reference)&gt;::type</span></tt>
-is a non-const reference.</li>
-<li>Readable Lvalue Iterator if
-<tt class="literal"><span class="pre">result_of&lt;UnaryFunction(iterator_traits&lt;Iterator&gt;::reference)&gt;::type</span></tt>
-is a const reference.</li>
-<li>Readable Iterator otherwise.</li>
-</ul>
-</blockquote>
-<p>The <tt class="literal"><span class="pre">transform_iterator</span></tt> models the most refined standard traversal
-concept that is modeled by <tt class="literal"><span class="pre">Iterator</span></tt>.</p>
-<p class="last">The <tt class="literal"><span class="pre">reference</span></tt> type of <tt class="literal"><span class="pre">transform_iterator</span></tt> is
-<tt class="literal"><span class="pre">result_of&lt;UnaryFunction(iterator_traits&lt;Iterator&gt;::reference)&gt;::type</span></tt>.
-The <tt class="literal"><span class="pre">value_type</span></tt> is <tt class="literal"><span class="pre">remove_cv&lt;remove_reference&lt;reference&gt;</span> <span class="pre">&gt;::type</span></tt>.</p>
-</dd>
-<dt>to:</dt>
-<dd>The argument <tt class="literal"><span class="pre">Iterator</span></tt> shall model Readable Iterator.</dd>
-</dl>
-<p>After the requirements section, add:</p>
-</div>
-<div class="topic">
-<p class="topic-title first"><tt class="literal"><span class="pre">transform_iterator</span></tt> models</p>
-<blockquote>
-<p>The resulting <tt class="literal"><span class="pre">transform_iterator</span></tt> models the most refined of the
-following options that is also modeled by <tt class="literal"><span class="pre">Iterator</span></tt>.</p>
-<blockquote>
-<ul class="simple">
-<li>Writable Lvalue Iterator if
-<tt class="literal"><span class="pre">transform_iterator::reference</span></tt> is a non-const
-reference.</li>
-<li>Readable Lvalue Iterator if
-<tt class="literal"><span class="pre">transform_iterator::reference</span></tt> is a const reference.</li>
-<li>Readable Iterator otherwise.</li>
-</ul>
-</blockquote>
-<p>The <tt class="literal"><span class="pre">transform_iterator</span></tt> models the most refined standard traversal
-concept that is modeled by the <tt class="literal"><span class="pre">Iterator</span></tt> argument.</p>
-<p>If <tt class="literal"><span class="pre">transform_iterator</span></tt> is a model of Readable Lvalue Iterator then
-it models the following original iterator concepts depending on what
-the <tt class="literal"><span class="pre">Iterator</span></tt> argument models.</p>
-<table border="1" class="table">
-<colgroup>
-<col width="50%" />
-<col width="50%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th>If <tt class="literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="literal"><span class="pre">transform_iterator</span></tt> models</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td>Single Pass Iterator</td>
-<td>Input Iterator</td>
-</tr>
-<tr><td>Forward Traversal Iterator</td>
-<td>Forward Iterator</td>
-</tr>
-<tr><td>Bidirectional Traversal Iterator</td>
-<td>Bidirectional Iterator</td>
-</tr>
-<tr><td>Random Access Traversal Iterator</td>
-<td>Random Access Iterator</td>
-</tr>
-</tbody>
-</table>
-<p>If <tt class="literal"><span class="pre">transform_iterator</span></tt> models Writable Lvalue Iterator then it is a
-mutable iterator (as defined in the old iterator requirements).</p>
-<p><tt class="literal"><span class="pre">transform_iterator&lt;F1,</span> <span class="pre">X,</span> <span class="pre">R1,</span> <span class="pre">V1&gt;</span></tt> is interoperable with
-<tt class="literal"><span class="pre">transform_iterator&lt;F2,</span> <span class="pre">Y,</span> <span class="pre">R2,</span> <span class="pre">V2&gt;</span></tt> if and only if <tt class="literal"><span class="pre">X</span></tt> is
-interoperable with <tt class="literal"><span class="pre">Y</span></tt>.</p>
-</blockquote>
-<p>Remove the private operations section heading and remove:</p>
-<pre class="literal-block">
-``typename transform_iterator::value_type dereference() const;``
-
-:Returns: ``m_f(transform_iterator::dereference());``
-</pre>
-<p>After the entry for <tt class="literal"><span class="pre">functor()</span></tt>, add:</p>
-<pre class="literal-block">
-``Iterator const&amp; base() const;``
-
-:Returns: ``m_iterator``
-
-
-``reference operator*() const;``
-
-:Returns: ``m_f(*m_iterator)``
-
-
-``transform_iterator&amp; operator++();``
-
-:Effects: ``++m_iterator``
-:Returns: ``*this``
-
-
-``transform_iterator&amp; operator--();``
-
-:Effects: ``--m_iterator``
-:Returns: ``*this``
-</pre>
-<p>Change:</p>
-<pre class="literal-block">
-template &lt;class Predicate, class Iterator&gt;
-class filter_iterator
-   : public iterator_adaptor&lt;
-         filter_iterator&lt;Predicate, Iterator&gt;, Iterator
-       , use_default
-       , /* see details */
-     &gt;
-{
- public:
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-template &lt;class Predicate, class Iterator&gt;
-class filter_iterator
-{
- public:
-   typedef iterator_traits&lt;Iterator&gt;::value_type value_type;
-   typedef iterator_traits&lt;Iterator&gt;::reference reference;
-   typedef iterator_traits&lt;Iterator&gt;::pointer pointer;
-   typedef iterator_traits&lt;Iterator&gt;::difference_type difference_type;
-   typedef /* see below */ iterator_category;
-</pre>
-<p>Change:</p>
-<pre class="literal-block">
-private: // as-if specification
-   void increment()
-   {
-       ++(this-&gt;base_reference());
-       satisfy_predicate();
-   }
-
-   void satisfy_predicate()
-   {
-       while (this-&gt;base() != this-&gt;m_end &amp;&amp; !this-&gt;m_predicate(*this-&gt;base()))
-           ++(this-&gt;base_reference());
-   }
-
-   Predicate m_predicate;
-   Iterator m_end;
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-    Iterator const&amp; base() const;
-    reference operator*() const;
-    filter_iterator&amp; operator++();
-private:
-    Predicate m_pred; // exposition only
-    Iterator m_iter;  // exposition only
-    Iterator m_end;   // exposition only
-</pre>
-<dl>
-<dt>Change:</dt>
-<dd>The base <tt class="literal"><span class="pre">Iterator</span></tt> parameter must be a model of Readable
-Iterator and Single Pass Iterator. The resulting
-<tt class="literal"><span class="pre">filter_iterator</span></tt> will be a model of Forward Traversal Iterator
-if <tt class="literal"><span class="pre">Iterator</span></tt> is, otherwise the <tt class="literal"><span class="pre">filter_iterator</span></tt> will be a
-model of Single Pass Iterator. The access category of the
-<tt class="literal"><span class="pre">filter_iterator</span></tt> will be the same as the access category of
-<tt class="literal"><span class="pre">Iterator</span></tt>.</dd>
-<dt>to:</dt>
-<dd>The <tt class="literal"><span class="pre">Iterator</span></tt> argument shall meet the requirements of Readable
-Iterator and Single Pass Iterator or it shall meet the requirements of
-Input Iterator.</dd>
-</dl>
-<p>After the requirements section, add:</p>
-</div>
-<div class="topic">
-<p class="topic-title first"><tt class="literal"><span class="pre">filter_iterator</span></tt> models</p>
-<blockquote>
-<p>The concepts that <tt class="literal"><span class="pre">filter_iterator</span></tt> models are dependent on which
-concepts the <tt class="literal"><span class="pre">Iterator</span></tt> argument models, as specified in the
-following tables.</p>
-<table border="1" class="table">
-<colgroup>
-<col width="33%" />
-<col width="67%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th>If <tt class="literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="literal"><span class="pre">filter_iterator</span></tt> models</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td>Single Pass Iterator</td>
-<td>Single Pass Iterator</td>
-</tr>
-<tr><td>Forward Traversal Iterator</td>
-<td>Forward Traversal Iterator</td>
-</tr>
-</tbody>
-</table>
-<table border="1" class="table">
-<colgroup>
-<col width="41%" />
-<col width="59%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th>If <tt class="literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="literal"><span class="pre">filter_iterator</span></tt> models</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td>Readable Iterator</td>
-<td>Readable Iterator</td>
-</tr>
-<tr><td>Writable Iterator</td>
-<td>Writable Iterator</td>
-</tr>
-<tr><td>Lvalue Iterator</td>
-<td>Lvalue Iterator</td>
-</tr>
-</tbody>
-</table>
-<table border="1" class="table">
-<colgroup>
-<col width="63%" />
-<col width="38%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th>If <tt class="literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="literal"><span class="pre">filter_iterator</span></tt> models</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td>Readable Iterator, Single Pass Iterator</td>
-<td>Input Iterator</td>
-</tr>
-<tr><td>Readable Lvalue Iterator, Forward Traversal Iterator</td>
-<td>Forward Iterator</td>
-</tr>
-<tr><td>Writable Lvalue Iterator, Forward Traversal Iterator</td>
-<td>Mutable Forward Iterator</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">filter_iterator&lt;P1,</span> <span class="pre">X&gt;</span></tt> is interoperable with <tt class="literal"><span class="pre">filter_iterator&lt;P2,</span> <span class="pre">Y&gt;</span></tt> 
-if and only if <tt class="literal"><span class="pre">X</span></tt> is interoperable with <tt class="literal"><span class="pre">Y</span></tt>.</p>
-</blockquote>
-<dl>
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">a <tt class="literal"><span class="pre">filter_iterator</span></tt> whose
-predicate is a default constructed <tt class="literal"><span class="pre">Predicate</span></tt> and
-whose <tt class="literal"><span class="pre">end</span></tt> is a default constructed <tt class="literal"><span class="pre">Iterator</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="literal"><span class="pre">filter_iterator</span></tt> whose``m_pred``,  <tt class="literal"><span class="pre">m_iter</span></tt>, and <tt class="literal"><span class="pre">m_end</span></tt> 
-members are a default constructed.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">A <tt class="literal"><span class="pre">filter_iterator</span></tt> at position <tt class="literal"><span class="pre">x</span></tt> that filters according
-to predicate <tt class="literal"><span class="pre">f</span></tt> and that will not increment past <tt class="literal"><span class="pre">end</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="literal"><span class="pre">filter_iterator</span></tt> where <tt class="literal"><span class="pre">m_iter</span></tt> is either
-the first position in the range <tt class="literal"><span class="pre">[x,end)</span></tt> such that <tt class="literal"><span class="pre">f(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt> 
-or else``m_iter == end``. The member <tt class="literal"><span class="pre">m_pred</span></tt> is constructed from
-<tt class="literal"><span class="pre">f</span></tt> and <tt class="literal"><span class="pre">m_end</span></tt> from <tt class="literal"><span class="pre">end</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">A <tt class="literal"><span class="pre">filter_iterator</span></tt> at position <tt class="literal"><span class="pre">x</span></tt> that filters 
-according to a default constructed <tt class="literal"><span class="pre">Predicate</span></tt>
-and that will not increment past <tt class="literal"><span class="pre">end</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a <tt class="literal"><span class="pre">filter_iterator</span></tt> where <tt class="literal"><span class="pre">m_iter</span></tt> is either
-the first position in the range <tt class="literal"><span class="pre">[x,end)</span></tt> such that <tt class="literal"><span class="pre">m_pred(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt> 
-or else``m_iter == end``. The member <tt class="literal"><span class="pre">m_pred</span></tt> is default constructed.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">A copy of iterator <tt class="literal"><span class="pre">t</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs a filter iterator whose members are copied from <tt class="literal"><span class="pre">t</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">A copy of the predicate object used to construct <tt class="literal"><span class="pre">*this</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">m_pred</span></tt></td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">The object <tt class="literal"><span class="pre">end</span></tt> used to construct <tt class="literal"><span class="pre">*this</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">m_end</span></tt></td>
-</tr>
-</tbody>
-</table>
-</dd>
-</dl>
-<p>At the end of the operations section, add:</p>
-<blockquote>
-<p><tt class="literal"><span class="pre">reference</span> <span class="pre">operator*()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*m_iter</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">filter_iterator&amp;</span> <span class="pre">operator++();</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Increments <tt class="literal"><span class="pre">m_iter</span></tt> and then continues to
-increment <tt class="literal"><span class="pre">m_iter</span></tt> until either <tt class="literal"><span class="pre">m_iter</span> <span class="pre">==</span> <span class="pre">m_end</span></tt>
-or <tt class="literal"><span class="pre">m_pred(*m_iter)</span> <span class="pre">==</span> <span class="pre">true</span></tt>.</td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*this</span></tt></td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>Change:</p>
-<pre class="literal-block">
-class counting_iterator
-  : public iterator_adaptor&lt;
-        counting_iterator&lt;Incrementable, Access, Traversal, Difference&gt;
-      , Incrementable
-      , Incrementable
-      , Access
-      , /* see details for traversal category */
-      , Incrementable const&amp;
-      , Incrementable const*
-      , /* distance = Difference or a signed integral type */&gt;
-{
-    friend class iterator_core_access;
- public:
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-class counting_iterator
-{
- public:
-    typedef Incrementable value_type;
-    typedef const Incrementable&amp; reference;
-    typedef const Incrementable* pointer;
-    typedef /* see below */ difference_type;
-    typedef /* see below */ iterator_category;
-</pre>
-<p>Change:</p>
-<pre class="literal-block">
-private:
-    typename counting_iterator::reference dereference() const
-    {
-        return this-&gt;base_reference();
-    }
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-    Incrementable const&amp; base() const;
-    reference operator*() const;
-    counting_iterator&amp; operator++();
-    counting_iterator&amp; operator--();
-private:
-    Incrementable m_inc; // exposition
-</pre>
-<p>After the synopsis, add:</p>
-<blockquote>
-<p>If the <tt class="literal"><span class="pre">Difference</span></tt> argument is <tt class="literal"><span class="pre">use_default</span></tt> then
-<tt class="literal"><span class="pre">difference_type</span></tt> is an unspecified signed integral
-type. Otherwise <tt class="literal"><span class="pre">difference_type</span></tt> is <tt class="literal"><span class="pre">Difference</span></tt>.</p>
-<p><tt class="literal"><span class="pre">iterator_category</span></tt> is determined according to the following
-algorithm:</p>
-<pre class="literal-block">
-if (CategoryOrTraversal is not use_default)
-    return CategoryOrTraversal
-else if (numeric_limits&lt;Incrementable&gt;::is_specialized)
-    return <em>iterator-category</em>(
-        random_access_traversal_tag, Incrementable, const Incrementable&amp;)
-else
-    return <em>iterator-category</em>(
-         iterator_traversal&lt;Incrementable&gt;::type, 
-         Incrementable, const Incrementable&amp;)
-</pre>
-</blockquote>
-<dl>
-<dt>Change:</dt>
-<dd><dl class="first last">
-<dt>[<em>Note:</em> implementers are encouraged to provide an implementation of</dt>
-<dd><tt class="literal"><span class="pre">distance_to</span></tt> and a <tt class="literal"><span class="pre">difference_type</span></tt> that avoids overflows in
-the cases when the <tt class="literal"><span class="pre">Incrementable</span></tt> type is a numeric type.]</dd>
-</dl>
-</dd>
-<dt>to:</dt>
-<dd><dl class="first last">
-<dt>[<em>Note:</em> implementers are encouraged to provide an implementation of</dt>
-<dd><tt class="literal"><span class="pre">operator-</span></tt> and a <tt class="literal"><span class="pre">difference_type</span></tt> that avoid overflows in
-the cases where <tt class="literal"><span class="pre">std::numeric_limits&lt;Incrementable&gt;::is_specialized</span></tt>
-is true.]</dd>
-</dl>
-</dd>
-<dt>Change:</dt>
-<dd><p class="first">The <tt class="literal"><span class="pre">Incrementable</span></tt> type must be Default Constructible, Copy
-Constructible, and Assignable.  The default distance is
-an implementation defined signed integegral type.</p>
-<p class="last">The resulting <tt class="literal"><span class="pre">counting_iterator</span></tt> models Readable Lvalue Iterator.</p>
-</dd>
-<dt>to:</dt>
-<dd>The <tt class="literal"><span class="pre">Incrementable</span></tt> argument shall be Copy Constructible and Assignable.</dd>
-<dt>Change:</dt>
-<dd>Furthermore, if you wish to create a counting iterator that is a Forward
-Traversal Iterator, then the following expressions must be valid:</dd>
-<dt>to:</dt>
-<dd>If <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to <tt class="literal"><span class="pre">forward_iterator_tag</span></tt>
-or <tt class="literal"><span class="pre">forward_traversal_tag</span></tt>, the following must be well-formed:</dd>
-<dt>Change:</dt>
-<dd>If you wish to create a counting iterator that is a 
-Bidirectional Traversal Iterator, then pre-decrement is also required:</dd>
-<dt>to:</dt>
-<dd>If <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to
-<tt class="literal"><span class="pre">bidirectional_iterator_tag</span></tt> or <tt class="literal"><span class="pre">bidirectional_traversal_tag</span></tt>,
-the following expression must also be well-formed:</dd>
-<dt>Change:</dt>
-<dd>If you wish to create a counting iterator that is a Random Access
-Traversal Iterator, then these additional expressions are also
-required:</dd>
-<dt>to:</dt>
-<dd>If <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to
-<tt class="literal"><span class="pre">random_access_iterator_tag</span></tt> or <tt class="literal"><span class="pre">random_access_traversal_tag</span></tt>,
-the following must must also be valid:</dd>
-</dl>
-<p>After the requirements section, add:</p>
-</div>
-<div class="topic">
-<p class="topic-title first"><tt class="literal"><span class="pre">counting_iterator</span></tt> models</p>
-<blockquote>
-<p>Specializations of <tt class="literal"><span class="pre">counting_iterator</span></tt> model Readable Lvalue
-Iterator. In addition, they model the concepts corresponding to the
-iterator tags to which their <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible.
-Also, if <tt class="literal"><span class="pre">CategoryOrTraversal</span></tt> is not <tt class="literal"><span class="pre">use_default</span></tt> then
-<tt class="literal"><span class="pre">counting_iterator</span></tt> models the concept corresponding to the iterator
-tag <tt class="literal"><span class="pre">CategoryOrTraversal</span></tt>.  Otherwise, if
-<tt class="literal"><span class="pre">numeric_limits&lt;Incrementable&gt;::is_specialized</span></tt>, then
-<tt class="literal"><span class="pre">counting_iterator</span></tt> models Random Access Traversal Iterator.
-Otherwise, <tt class="literal"><span class="pre">counting_iterator</span></tt> models the same iterator traversal
-concepts modeled by <tt class="literal"><span class="pre">Incrementable</span></tt>.</p>
-<p><tt class="literal"><span class="pre">counting_iterator&lt;X,C1,D1&gt;</span></tt> is interoperable with
-<tt class="literal"><span class="pre">counting_iterator&lt;Y,C2,D2&gt;</span></tt> if and only if <tt class="literal"><span class="pre">X</span></tt> is
-interoperable with <tt class="literal"><span class="pre">Y</span></tt>.</p>
-</blockquote>
-<p>At the begining of the operations section, add:</p>
-<blockquote>
-In addition to the operations required by the concepts modeled by
-<tt class="literal"><span class="pre">counting_iterator</span></tt>, <tt class="literal"><span class="pre">counting_iterator</span></tt> provides the following
-operations.</blockquote>
-<dl>
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">A default constructed instance of <tt class="literal"><span class="pre">counting_iterator</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="literal"><span class="pre">Incrementable</span></tt> is Default Constructible.</td>
-</tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Default construct the member <tt class="literal"><span class="pre">m_inc</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">counting_iterator</span></tt> that is a copy of <tt class="literal"><span class="pre">rhs</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Construct member <tt class="literal"><span class="pre">m_inc</span></tt> from <tt class="literal"><span class="pre">rhs.m_inc</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>Change:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">counting_iterator</span></tt> with its base
-object copy constructed from <tt class="literal"><span class="pre">x</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-<dt>to:</dt>
-<dd><table class="first last field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Construct member <tt class="literal"><span class="pre">m_inc</span></tt> from <tt class="literal"><span class="pre">x</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-</dl>
-<p>At the end of the operations section, add:</p>
-<blockquote>
-<p><tt class="literal"><span class="pre">reference</span> <span class="pre">operator*()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">m_inc</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">counting_iterator&amp;</span> <span class="pre">operator++();</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><tt class="literal"><span class="pre">++m_inc</span></tt></td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*this</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">counting_iterator&amp;</span> <span class="pre">operator--();</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><tt class="literal"><span class="pre">--m_inc</span></tt></td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*this</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">Incrementable</span> <span class="pre">const&amp;</span> <span class="pre">base()</span> <span class="pre">const;</span></tt></p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">m_inc</span></tt></td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-</div>
-</div>
-<div class="section" id="x-problem-with-specification-of-a-m-in-readable-iterator">
-<h2><a class="toc-backref" href="#id40" name="x-problem-with-specification-of-a-m-in-readable-iterator">9.38x Problem with specification of a-&gt;m in Readable Iterator</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Howard Hinnant</td>
-</tr>
-<tr class="field"><th class="field-name">Status:</th><td class="field-body">New</td>
-</tr>
-</tbody>
-</table>
-<p>c++std-lib-12585:</p>
-<p>Readable Iterator Requirements says:</p>
-<blockquote>
-<table border="1" class="table">
-<colgroup>
-<col width="13%" />
-<col width="10%" />
-<col width="77%" />
-</colgroup>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">a-&gt;m</span></tt></td>
-<td><tt class="literal"><span class="pre">U&amp;</span></tt></td>
-<td>pre: <tt class="literal"><span class="pre">(*a).m</span></tt> is well-defined. Equivalent to <tt class="literal"><span class="pre">(*a).m</span></tt></td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>Do we mean to outlaw iterators with proxy references from meeting
-the readable requirements?</p>
-<p>Would it be better for the requirements to read <tt class="literal"><span class="pre">static_cast&lt;T&gt;(*a).m</span></tt>
-instead of <tt class="literal"><span class="pre">(*a).m</span></tt> ?</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">NAD.</td>
-</tr>
-<tr class="field"><th class="field-name">Rationale:</th><td class="field-body"><p class="first">We think you're misreading &quot;pre:&quot;.
-If <tt class="literal"><span class="pre">(*a).m</span></tt> is not well defined, then the iterator is not
-required to provide <tt class="literal"><span class="pre">a-&gt;m</span></tt>. So a proxy iterator is not
-required to provide <tt class="literal"><span class="pre">a-&gt;m</span></tt>.</p>
-<p class="last">As an aside, it is possible for proxy iterators to
-support <tt class="literal"><span class="pre">-&gt;</span></tt>, so changing the requirements to
-read <tt class="literal"><span class="pre">static_cast&lt;T&gt;(*a).m</span></tt> is interesting.
-However, such a change to Readable Iterator would
-mean that it no longer corresponds to the
-input iterator requirements. So old iterators would not
-necessarily conform to new iterator requirements.</p>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="x-counting-iterator-traversal-argument-unspecified">
-<h2><a class="toc-backref" href="#id41" name="x-counting-iterator-traversal-argument-unspecified">9.39x counting_iterator Traversal argument unspecified</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-</tbody>
-</table>
-<p>c++std-lib-12635:</p>
-<p>counting_iterator takes an argument for its Traversal type, with a
-default value of use_default. It is derived from an instance of
-iterator_adaptor, where the argument passed for the Traversal type
-is described as &quot;<tt class="literal"><span class="pre">/*</span> <span class="pre">see</span> <span class="pre">details</span> <span class="pre">for</span> <span class="pre">traversal</span> <span class="pre">category</span>
-<span class="pre">*/</span></tt>&quot;. The details for counting_iterator describe constraints on
-the Incrementable type imposed by various traversal
-categories. There is no description of what the argument to
-iterator_adaptor should be.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body">We no longer inherit from iterator_adaptor. So instead,
-we specify the iterator_category in terms of the Traversal type
-(which is now called CategoryOrTraversal). Also the
-requirements and models section was reorganized to
-match these changes and to make more sense.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="x-indirect-iterator-requirements-muddled">
-<h2><a class="toc-backref" href="#id42" name="x-indirect-iterator-requirements-muddled">9.40x indirect_iterator requirements muddled</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-</tbody>
-</table>
-<p>c++std-lib-12640:</p>
-<blockquote>
-<blockquote>
-The value_type of the Iterator template parameter should itself
-be dereferenceable. The return type of the <tt class="literal"><span class="pre">operator*</span></tt> for
-the value_type must be the same type as the Reference template
-parameter.</blockquote>
-<p>I'd say this a bit differently, to emphasize what's required:
-iterator_traits&lt;Iterator&gt;::value_type must be dereferenceable.
-The Reference template parameter must be the same type as 
-<tt class="literal"><span class="pre">*iterator_traits&lt;Iterator&gt;::value_type()</span></tt>.</p>
-<blockquote>
-The Value template parameter will be the value_type for the 
-indirect_iterator, unless Value is const. If Value is const X, then 
-value_type will be non- const X.</blockquote>
-<p>Also non-volatile, right? In other words, if Value isn't use_default, it 
-just gets passed as the Value argument for iterator_adaptor.</p>
-<blockquote>
-<p>The default for Value is:</p>
-<pre class="literal-block">
-iterator_traits&lt; iterator_traits&lt;Iterator&gt;::value_type &gt;::value_type
-</pre>
-<p>If the default is used for Value, then there must be a valid
-specialization of iterator_traits for the value type of the
-base iterator.</p>
-</blockquote>
-<p>The earlier requirement is that
-<tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt> must be
-dereferenceable. Now it's being treated as an iterator. Is this
-just a pun, or is <tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt>
-required to be some form of iterator? If it's the former we need
-to find a different way to say it.  If it's the latter we need to
-say so.</p>
-</blockquote>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Change:</p>
-<blockquote>
-<p>The <tt class="literal"><span class="pre">value_type</span></tt> of the <tt class="literal"><span class="pre">Iterator</span></tt> template parameter
-should itself be dereferenceable. The return type of the
-<tt class="literal"><span class="pre">operator*</span></tt> for the <tt class="literal"><span class="pre">value_type</span></tt> must be the same type as
-the <tt class="literal"><span class="pre">Reference</span></tt> template parameter. The <tt class="literal"><span class="pre">Value</span></tt> template
-parameter will be the <tt class="literal"><span class="pre">value_type</span></tt> for the
-<tt class="literal"><span class="pre">indirect_iterator</span></tt>, unless <tt class="literal"><span class="pre">Value</span></tt> is const. If <tt class="literal"><span class="pre">Value</span></tt>
-is <tt class="literal"><span class="pre">const</span> <span class="pre">X</span></tt>, then <tt class="literal"><span class="pre">value_type</span></tt> will be <em>non-</em> <tt class="literal"><span class="pre">const</span> <span class="pre">X</span></tt>.
-The default for <tt class="literal"><span class="pre">Value</span></tt> is:</p>
-<pre class="literal-block">
-iterator_traits&lt; iterator_traits&lt;Iterator&gt;::value_type &gt;::value_type
-</pre>
-<p>If the default is used for <tt class="literal"><span class="pre">Value</span></tt>, then there must be a
-valid specialization of <tt class="literal"><span class="pre">iterator_traits</span></tt> for the value type
-of the base iterator.</p>
-<p>The <tt class="literal"><span class="pre">Reference</span></tt> parameter will be the <tt class="literal"><span class="pre">reference</span></tt> type of the
-<tt class="literal"><span class="pre">indirect_iterator</span></tt>. The default is <tt class="literal"><span class="pre">Value&amp;</span></tt>.</p>
-<p>The <tt class="literal"><span class="pre">Access</span></tt> and <tt class="literal"><span class="pre">Traversal</span></tt> parameters are passed
-unchanged to the corresponding parameters of the
-<tt class="literal"><span class="pre">iterator_adaptor</span></tt> base class, and the <tt class="literal"><span class="pre">Iterator</span></tt> parameter
-is passed unchanged as the <tt class="literal"><span class="pre">Base</span></tt> parameter to the
-<tt class="literal"><span class="pre">iterator_adaptor</span></tt> base class.</p>
-</blockquote>
-<p>to:</p>
-<blockquote class="last">
-<blockquote>
-The expression <tt class="literal"><span class="pre">*v</span></tt>, where <tt class="literal"><span class="pre">v</span></tt> is an object of
-<tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt>, shall be valid
-expression and convertible to <tt class="literal"><span class="pre">reference</span></tt>.  <tt class="literal"><span class="pre">Iterator</span></tt>
-shall model the traversal concept indicated by
-<tt class="literal"><span class="pre">iterator_category</span></tt>.  <tt class="literal"><span class="pre">Value</span></tt>, <tt class="literal"><span class="pre">Reference</span></tt>, and
-<tt class="literal"><span class="pre">Difference</span></tt> shall be chosen so that <tt class="literal"><span class="pre">value_type</span></tt>,
-<tt class="literal"><span class="pre">reference</span></tt>, and <tt class="literal"><span class="pre">difference_type</span></tt> meet the requirements
-indicated by <tt class="literal"><span class="pre">iterator_category</span></tt>.</blockquote>
-<p>[Note: there are further requirements on the
-<tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::value_type</span></tt> if the <tt class="literal"><span class="pre">Value</span></tt>
-parameter is not <tt class="literal"><span class="pre">use_default</span></tt>, as implied by the algorithm
-for deducing the default for the <tt class="literal"><span class="pre">value_type</span></tt> member.]</p>
-</blockquote>
-</td>
-</tr>
-<tr class="field"><th class="field-name">Rationale:</th><td class="field-body">Not included above is the specification of the
-<tt class="literal"><span class="pre">value_type</span></tt>, <tt class="literal"><span class="pre">reference</span></tt>, etc., members, which is handled by
-the changes in 9.37x.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="x-problem-with-transform-iterator-requirements">
-<h2><a class="toc-backref" href="#id43" name="x-problem-with-transform-iterator-requirements">9.41x Problem with transform_iterator requirements</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-</tbody>
-</table>
-<p>c++std-lib-12641:</p>
-<blockquote>
-The reference type of transform_iterator is <tt class="literal"><span class="pre">result_of&lt;</span>
-<span class="pre">UnaryFunction(iterator_traits&lt;Iterator&gt;::reference)</span>
-<span class="pre">&gt;::type</span></tt>. The <tt class="literal"><span class="pre">value_type</span></tt> is
-<tt class="literal"><span class="pre">remove_cv&lt;remove_reference&lt;reference&gt;</span> <span class="pre">&gt;::type</span></tt>.</blockquote>
-<p>These are the defaults, right? If the user supplies their own types
-that's what gets passed to iterator_adaptor. And again, the
-specification should be in terms of the specialization of
-iterator_adaptor, and not in terms of the result:</p>
-<p>Reference argument to iterator_adaptor:</p>
-<pre class="literal-block">
-if (Reference != use_default)
-    Reference
-else
-    result_of&lt;
-        UnaryFunction(iterator_traits&lt;Iterator&gt;::reference)
-    &gt;::type
-</pre>
-<p>Value argument to iterator_adaptor:</p>
-<pre class="literal-block">
-if (Value != use_default)
-    Value
-else if (Reference != use_default)
-    remove_reference&lt;reference&gt;::type
-else
-    remove_reference&lt;
-        result_of&lt;
-            UnaryFunction(iterator_traits&lt;Iterator&gt;::reference)
-        &gt;::type
-    &gt;::type
-</pre>
-<p>There's probably a better way to specify that last alternative, but
-I've been at this too long, and it's all turning into a maze of
-twisty passages, all alike.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Replace:</p>
-<blockquote>
-The reference type of transform_iterator is <tt class="literal"><span class="pre">result_of&lt;</span>
-<span class="pre">UnaryFunction(iterator_traits&lt;Iterator&gt;::reference)</span>
-<span class="pre">&gt;::type</span></tt>. The <tt class="literal"><span class="pre">value_type</span></tt> is
-<tt class="literal"><span class="pre">remove_cv&lt;remove_reference&lt;reference&gt;</span> <span class="pre">&gt;::type</span></tt>.</blockquote>
-<p>with:</p>
-<blockquote class="last">
-<p>If <tt class="literal"><span class="pre">Reference</span></tt> is <tt class="literal"><span class="pre">use_default</span></tt> then the <tt class="literal"><span class="pre">reference</span></tt>
-member of <tt class="literal"><span class="pre">transform_iterator</span></tt> is <tt class="literal"><span class="pre">result_of&lt;</span>
-<span class="pre">UnaryFunction(iterator_traits&lt;Iterator&gt;::reference)</span>
-<span class="pre">&gt;::type</span></tt>.  Otherwise, <tt class="literal"><span class="pre">reference</span></tt> is <tt class="literal"><span class="pre">Reference</span></tt>.</p>
-<p>If <tt class="literal"><span class="pre">Value</span></tt> is <tt class="literal"><span class="pre">use_default</span></tt> then the <tt class="literal"><span class="pre">value_type</span></tt>
-member is <tt class="literal"><span class="pre">remove_cv&lt;remove_reference&lt;reference&gt;</span> <span class="pre">&gt;::type</span></tt>.
-Otherwise, <tt class="literal"><span class="pre">value_type</span></tt> is <tt class="literal"><span class="pre">Value</span></tt>.</p>
-</blockquote>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="x-filter-iterator-details-unspecified">
-<h2><a class="toc-backref" href="#id44" name="x-filter-iterator-details-unspecified">9.42x filter_iterator details unspecified</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Pete Becker</td>
-</tr>
-</tbody>
-</table>
-<p>c++std-lib-12642:</p>
-<p>The paper says:</p>
-<pre class="literal-block">
-template&lt;class Predicate, class Iterator&gt;
-class filter_iterator
-     : public iterator_adaptor&lt;
-         filter_iterator&lt;Predicate, Iterator&gt;,
-         Iterator,
-         use_default,
-         /* see details */ &gt;
-</pre>
-<p>That comment covers the Access, Traversal, Reference, and Difference
-arguments. The only specification for any of these in the details is:</p>
-<blockquote>
-The access category of the filter_iterator will be the same as
-the access category of Iterator.</blockquote>
-<p>Needs more.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Add to the synopsis:</p>
-<pre class="literal-block">
-typedef iterator_traits&lt;Iterator&gt;::value_type value_type;
-typedef iterator_traits&lt;Iterator&gt;::reference reference;
-typedef iterator_traits&lt;Iterator&gt;::pointer pointer;
-typedef iterator_traits&lt;Iterator&gt;::difference_type difference_type;
-typedef /* see below */ iterator_category;
-</pre>
-<p>and add just after the synopsis:</p>
-<blockquote class="last">
-If <tt class="literal"><span class="pre">Iterator</span></tt> models Readable Lvalue Iterator and Forward
-Traversal Iterator then <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible
-to <tt class="literal"><span class="pre">std::forward_iterator_tag</span></tt>. Otherwise
-<tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to
-<tt class="literal"><span class="pre">std::input_iterator_tag</span></tt>.</blockquote>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="x-transform-iterator-interoperability-too-restrictive">
-<h2><a class="toc-backref" href="#id45" name="x-transform-iterator-interoperability-too-restrictive">9.43x transform_iterator interoperability too restrictive</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Jeremy Siek</td>
-</tr>
-</tbody>
-</table>
-<p>We do not need to require that the function objects have the same
-type, just that they be convertible.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Change:</p>
-<pre class="literal-block">
-template&lt;class OtherIterator, class R2, class V2&gt;
-transform_iterator(
-      transform_iterator&lt;UnaryFunction, OtherIterator, R2, V2&gt; const&amp; t
-    , typename enable_if_convertible&lt;OtherIterator, Iterator&gt;::type* = 0 // exposition
-);
-</pre>
-<p>to:</p>
-<pre class="last literal-block">
-template&lt;class F2, class I2, class R2, class V2&gt;
-transform_iterator(
-      transform_iterator&lt;F2, I2, R2, V2&gt; const&amp; t
-    , typename enable_if_convertible&lt;I2, Iterator&gt;::type* = 0      // exposition only
-    , typename enable_if_convertible&lt;F2, UnaryFunction&gt;::type* = 0 // exposition only
-);
-</pre>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="y-indirect-iterator-and-smart-pointers">
-<h2><a class="toc-backref" href="#id46" name="y-indirect-iterator-and-smart-pointers">9.44y <tt class="literal"><span class="pre">indirect_iterator</span></tt> and smart pointers</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Dave Abrahams</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">indirect_iterator</span></tt> should be able to iterate over containers of
-smart pointers, but the mechanism that allows it was left out of
-the specification, even though it's present in the Boost
-specification</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Add <tt class="literal"><span class="pre">pointee</span></tt> and <tt class="literal"><span class="pre">indirect_reference</span></tt>
-to deal with this capability.</p>
-<p>In [lib.iterator.helper.synopsis], add:</p>
-<pre class="literal-block">
-template &lt;class Dereferenceable&gt;
-struct pointee;
-
-template &lt;class Dereferenceable&gt;
-struct indirect_reference;
-</pre>
-<p class="last">After <tt class="literal"><span class="pre">indirect_iterator</span></tt>'s abstract, add:</p>
-</td>
-</tr>
-</tbody>
-</table>
-<div class="topic">
-<p class="topic-title first">Class template <tt class="literal"><span class="pre">pointee</span></tt></p>
-<!-- Copyright David Abrahams 2004. Use, modification and distribution is -->
-<!-- subject to the Boost Software License, Version 1.0. (See accompanying -->
-<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
-<pre class="literal-block">
-template &lt;class Dereferenceable&gt;
-struct pointee
-{
-    typedef /* see below */ type;
-};
-</pre>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body">For an object <tt class="literal"><span class="pre">x</span></tt> of type <tt class="literal"><span class="pre">Dereferenceable</span></tt>, <tt class="literal"><span class="pre">*x</span></tt>
-is well-formed.  If <tt class="literal"><span class="pre">++x</span></tt> is ill-formed it shall neither be
-ambiguous nor shall it violate access control, and
-<tt class="literal"><span class="pre">Dereferenceable::element_type</span></tt> shall be an accessible type.
-Otherwise <tt class="literal"><span class="pre">iterator_traits&lt;Dereferenceable&gt;::value_type</span></tt> shall
-be well formed.  [Note: These requirements need not apply to
-explicit or partial specializations of <tt class="literal"><span class="pre">pointee</span></tt>]</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">type</span></tt> is determined according to the following algorithm, where
-<tt class="literal"><span class="pre">x</span></tt> is an object of type <tt class="literal"><span class="pre">Dereferenceable</span></tt>:</p>
-<pre class="literal-block">
-if ( ++x is ill-formed )
-{
-    return ``Dereferenceable::element_type``
-}
-else if (``*x`` is a mutable reference to
-         std::iterator_traits&lt;Dereferenceable&gt;::value_type)
-{
-    return iterator_traits&lt;Dereferenceable&gt;::value_type
-}
-else
-{
-    return iterator_traits&lt;Dereferenceable&gt;::value_type const
-}
-</pre>
-</div>
-<div class="topic">
-<p class="topic-title first">Class template <tt class="literal"><span class="pre">indirect_reference</span></tt></p>
-<!-- Copyright David Abrahams 2004. Use, modification and distribution is -->
-<!-- subject to the Boost Software License, Version 1.0. (See accompanying -->
-<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
-<pre class="literal-block">
-template &lt;class Dereferenceable&gt;
-struct indirect_reference
-{
-    typedef /* see below */ type;
-};
-</pre>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body">For an object <tt class="literal"><span class="pre">x</span></tt> of type <tt class="literal"><span class="pre">Dereferenceable</span></tt>, <tt class="literal"><span class="pre">*x</span></tt>
-is well-formed.  If <tt class="literal"><span class="pre">++x</span></tt> is ill-formed it shall neither be
-ambiguous nor shall it violate access control, and
-<tt class="literal"><span class="pre">pointee&lt;Dereferenceable&gt;::type&amp;</span></tt> shall be well-formed.
-Otherwise <tt class="literal"><span class="pre">iterator_traits&lt;Dereferenceable&gt;::reference</span></tt> shall
-be well formed.  [Note: These requirements need not apply to
-explicit or partial specializations of <tt class="literal"><span class="pre">indirect_reference</span></tt>]</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="literal"><span class="pre">type</span></tt> is determined according to the following algorithm, where
-<tt class="literal"><span class="pre">x</span></tt> is an object of type <tt class="literal"><span class="pre">Dereferenceable</span></tt>:</p>
-<pre class="literal-block">
-if ( ++x is ill-formed )
-    return ``pointee&lt;Dereferenceable&gt;::type&amp;``
-else
-    std::iterator_traits&lt;Dereferenceable&gt;::reference
-</pre>
-</div>
-<p>See proposed resolution to Issue 9.37x for more changes related to
-this issue.</p>
-</div>
-<div class="section" id="y-n1530-typos-and-editorial-changes-in-proposal-text-not-standardese">
-<h2><a class="toc-backref" href="#id47" name="y-n1530-typos-and-editorial-changes-in-proposal-text-not-standardese">9.45y N1530: Typos and editorial changes in proposal text (not standardese)</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Dave Abrahams</td>
-</tr>
-</tbody>
-</table>
-<ol class="arabic">
-<li><p class="first">&quot;because specification helps to highlight that the <tt class="literal"><span class="pre">Reference</span></tt>
-template parameter may not always be identical to the iterator's
-<tt class="literal"><span class="pre">reference</span></tt> type, and will keep users making mistakes based on
-that assumption.&quot;</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first last">add &quot;from&quot; before &quot;making&quot;</p>
-</td>
-</tr>
-</tbody>
-</table>
-</li>
-<li><p class="first">mention of obsolete projection_iterator</p>
-</li>
-</ol>
-<blockquote>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed Resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">From n1530, in the <strong>Specialized Adaptors</strong> section, remove:</p>
-<blockquote class="last">
-<tt class="literal"><span class="pre">projection_iterator</span></tt>, which is similar to <tt class="literal"><span class="pre">transform_iterator</span></tt>
-except that when dereferenced it returns a reference instead of
-a value.</blockquote>
-</td>
-</tr>
-<tr class="field"><th class="field-name">Rationale:</th><td class="field-body">This iterator was in the original boost library, but the new
-iterator concepts allowed this iterator to be
-folded into <tt class="literal"><span class="pre">transform_iterator</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-</div>
-<div class="section" id="y-n1530-base-return-by-value-is-costly">
-<h2><a class="toc-backref" href="#id48" name="y-n1530-base-return-by-value-is-costly">9.46y N1530: <tt class="literal"><span class="pre">base()</span></tt> return-by-value is costly</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Dave Abrahams</td>
-</tr>
-</tbody>
-</table>
-<p>We've had some real-life reports that iterators that use
-<tt class="literal"><span class="pre">iterator_adaptor</span></tt>'s <tt class="literal"><span class="pre">base()</span></tt> function can be inefficient
-when the <tt class="literal"><span class="pre">Base</span></tt> iterator is expensive to copy.  Iterators, of
-all things, should be efficient.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">In [lib.iterator.adaptor]</p>
-<p>Change:</p>
-<pre class="literal-block">
-Base base() const;
-</pre>
-<p>to:</p>
-<pre class="literal-block">
-Base const&amp; base() const;
-</pre>
-<p class="last">twice (once in the synopsis and once in the <strong>public
-operations</strong> section).</p>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="x-forgot-default-constructible-in-forward-traversal-iterator">
-<h2><a class="toc-backref" href="#id49" name="x-forgot-default-constructible-in-forward-traversal-iterator">9.47x Forgot default constructible in Forward Traversal Iterator</a></h2>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Submitter:</th><td class="field-body">Jeremy Siek</td>
-</tr>
-</tbody>
-</table>
-<p>We want Forward Traversal Iterator plus Readable Lvalue Iterator to
-match the old Foward Iterator requirements, so we need Forward
-Traversal Iterator to include Default Constructible.</p>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Proposed resolution:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><p class="first">Change:</p>
-<blockquote>
-<p>A class or built-in type <tt class="literal"><span class="pre">X</span></tt> models the <em>Forward Traversal Iterator</em>
-concept if the following expressions are valid and respect the stated
-semantics.</p>
-<table border="1" class="table">
-<colgroup>
-<col width="44%" />
-<col width="39%" />
-<col width="17%" />
-</colgroup>
-<tbody valign="top">
-<tr><td colspan="3">Forward Traversal Iterator Requirements (in addition to Single Pass Iterator)</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>to:</p>
-<blockquote class="last">
-<p>A class or built-in type <tt class="literal"><span class="pre">X</span></tt> models the <em>Forward Traversal Iterator</em>
-concept if, in addition to <tt class="literal"><span class="pre">X</span></tt> meeting the requirements of
-Default Constructible and Single Pass Iterator, the following
-expressions are valid and respect the
-stated semantics.</p>
-<table border="1" class="table">
-<colgroup>
-<col width="38%" />
-<col width="34%" />
-<col width="27%" />
-</colgroup>
-<tbody valign="top">
-<tr><td colspan="3">Forward Traversal Iterator Requirements (in addition to Default Constructible and Single Pass Iterator)</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="x-editorial-changes-non-normative-text">
-<h2><a class="toc-backref" href="#id50" name="x-editorial-changes-non-normative-text">9.48x Editorial changes (non-normative text)</a></h2>
-<dl>
-<dt>Change:</dt>
-<dd>Iterator facade uses the Curiously Recurring Template Pattern (CRTP)
-[Cop95] so that the user can specify the behavior of
-<tt class="literal"><span class="pre">iterator_facade</span></tt> in a derived class.  Former designs used policy
-objects to specify the behavior.  <tt class="literal"><span class="pre">iterator_facade</span></tt> does not use policy
-objects for several reasons:</dd>
-<dt>to:</dt>
-<dd>Iterator facade uses the Curiously Recurring Template
-Pattern (CRTP) [Cop95] so that the user can specify the behavior
-of <tt class="literal"><span class="pre">iterator_facade</span></tt> in a derived class.  Former designs used
-policy objects to specify the behavior, but that approach was
-discarded for several reasons:</dd>
-<dt>Change:</dt>
-<dd>iterator's <tt class="literal"><span class="pre">operator++</span></tt> returns the iterator type itself means
-that all iterators generated by <tt class="literal"><span class="pre">iterator_facade</span></tt> would be
-instantiations of <tt class="literal"><span class="pre">iterator_facade</span></tt>.  Cumbersome type generator</dd>
-<dt>to:</dt>
-<dd>iterator's <tt class="literal"><span class="pre">operator++</span></tt> returns the iterator type itself
-would mean that all iterators built with the library would
-have to be specializations of <tt class="literal"><span class="pre">iterator_facade&lt;...&gt;</span></tt>, rather
-than something more descriptive like
-<tt class="literal"><span class="pre">indirect_iterator&lt;T*&gt;</span></tt>.  Cumbersome type generator</dd>
-<dt>Change:</dt>
-<dd>The return type for <tt class="literal"><span class="pre">operator-&gt;</span></tt> and <tt class="literal"><span class="pre">operator[]</span></tt> is not
-explicitly specified. Instead it requires each <tt class="literal"><span class="pre">iterator_facade</span></tt>
-instantiation to meet the requirements of its <tt class="literal"><span class="pre">iterator_category</span></tt>.</dd>
-<dt>To:</dt>
-<dd>The return types for <tt class="literal"><span class="pre">iterator_facade</span></tt>'s <tt class="literal"><span class="pre">operator-&gt;</span></tt> and
-<tt class="literal"><span class="pre">operator[]</span></tt> are not explicitly specified. Instead, those types
-are described in terms of a set of requirements, which must be
-satisfied by the <tt class="literal"><span class="pre">iterator_facade</span></tt> implementation.</dd>
-</dl>
-</div>
-<div class="section" id="x-clarification-of-iterator-facade-requirements-and-type-members">
-<h2><a class="toc-backref" href="#id51" name="x-clarification-of-iterator-facade-requirements-and-type-members">9.49x Clarification of iterator_facade requirements and type members</a></h2>
-<p>A general cleanup and simplification of the requirements and
-description of type members for <tt class="literal"><span class="pre">iterator_facade</span></tt>.</p>
-<p>The user is only allowed to add <tt class="literal"><span class="pre">const</span></tt> as a qualifier.</p>
-<dl>
-<dt>Change:</dt>
-<dd><tt class="literal"><span class="pre">typedef</span> <span class="pre">remove_cv&lt;Value&gt;::type</span> <span class="pre">value_type;</span></tt></dd>
-<dt>to:</dt>
-<dd><tt class="literal"><span class="pre">typedef</span> <span class="pre">remove_const&lt;Value&gt;::type</span> <span class="pre">value_type;</span></tt></dd>
-</dl>
-<p>We use to have an unspecified type for <tt class="literal"><span class="pre">pointer</span></tt>, to match the
-return type of <tt class="literal"><span class="pre">operator-&gt;</span></tt>, but there's no real reason to make them
-match, so we just use the simpler <tt class="literal"><span class="pre">Value*</span></tt> for <tt class="literal"><span class="pre">pointer</span></tt>.</p>
-<p>Change:</p>
-<blockquote>
-<tt class="literal"><span class="pre">typedef</span> <span class="pre">/*</span> <span class="pre">see</span> <span class="pre">description</span> <span class="pre">of</span> <span class="pre">operator-&gt;</span> <span class="pre">*/</span> <span class="pre">pointer;</span></tt></blockquote>
-<dl>
-<dt>To:</dt>
-<dd><tt class="literal"><span class="pre">typedef</span> <span class="pre">Value*</span> <span class="pre">pointer;</span></tt></dd>
-<dt>Remove:</dt>
-<dd>Some of the constraints on template parameters to
-<tt class="literal"><span class="pre">iterator_facade</span></tt> are expressed in terms of resulting nested
-types and should be viewed in the context of their impact on
-<tt class="literal"><span class="pre">iterator_traits&lt;Derived&gt;</span></tt>.</dd>
-<dt>Change:</dt>
-<dd>The <tt class="literal"><span class="pre">Derived</span></tt> template parameter must be a class derived from
-<tt class="literal"><span class="pre">iterator_facade</span></tt>.</dd>
-<dt>and:</dt>
-<dd>The following table describes the other requirements on the
-<tt class="literal"><span class="pre">Derived</span></tt> parameter.  Depending on the resulting iterator's
-<tt class="literal"><span class="pre">iterator_category</span></tt>, a subset of the expressions listed in the table
-are required to be valid.  The operations in the first column must be
-accessible to member functions of class <tt class="literal"><span class="pre">iterator_core_access</span></tt>.</dd>
-<dt>to:</dt>
-<dd>The following table describes the typical valid expressions on
-<tt class="literal"><span class="pre">iterator_facade</span></tt>'s <tt class="literal"><span class="pre">Derived</span></tt> parameter, depending on the
-iterator concept(s) it will model.  The operations in the first
-column must be made accessible to member functions of class
-<tt class="literal"><span class="pre">iterator_core_access</span></tt>.  In addition,
-<tt class="literal"><span class="pre">static_cast&lt;Derived*&gt;(iterator_facade*)</span></tt> shall be well-formed.</dd>
-<dt>Remove:</dt>
-<dd><p class="first">The nested <tt class="literal"><span class="pre">::value_type</span></tt> type will be the same as
-<tt class="literal"><span class="pre">remove_cv&lt;Value&gt;::type</span></tt>, so the <tt class="literal"><span class="pre">Value</span></tt> parameter must be
-an (optionally <tt class="literal"><span class="pre">const</span></tt>-qualified) non-reference type.</p>
-<p class="last">The nested <tt class="literal"><span class="pre">::reference</span></tt> will be the same as the <tt class="literal"><span class="pre">Reference</span></tt>
-parameter; it must be a suitable reference type for the resulting
-iterator.  The default for the <tt class="literal"><span class="pre">Reference</span></tt> parameter is
-<tt class="literal"><span class="pre">Value&amp;</span></tt>.</p>
-</dd>
-</dl>
-<p>Change:</p>
-<blockquote>
-<p>In the table below, <tt class="literal"><span class="pre">X</span></tt> is the derived iterator type, <tt class="literal"><span class="pre">a</span></tt> is an
-object of type <tt class="literal"><span class="pre">X</span></tt>, <tt class="literal"><span class="pre">b</span></tt> and <tt class="literal"><span class="pre">c</span></tt> are objects of type <tt class="literal"><span class="pre">const</span> <span class="pre">X</span></tt>,
-<tt class="literal"><span class="pre">n</span></tt> is an object of <tt class="literal"><span class="pre">X::difference_type</span></tt>, <tt class="literal"><span class="pre">y</span></tt> is a constant
-object of a single pass iterator type interoperable with X, and <tt class="literal"><span class="pre">z</span></tt>
-is a constant object of a random access traversal iterator type
-interoperable with <tt class="literal"><span class="pre">X</span></tt>.</p>
-<table border="1" class="table">
-<colgroup>
-<col width="19%" />
-<col width="18%" />
-<col width="36%" />
-<col width="26%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Assertion/Note</th>
-<th>Required to implement
-Iterator Concept(s)</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">c.dereference()</span></tt></td>
-<td><tt class="literal"><span class="pre">X::reference</span></tt></td>
-<td>&nbsp;</td>
-<td>Readable Iterator, Writable
-Iterator</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">c.equal(b)</span></tt></td>
-<td>convertible to bool</td>
-<td>true iff <tt class="literal"><span class="pre">b</span></tt> and <tt class="literal"><span class="pre">c</span></tt> are
-equivalent.</td>
-<td>Single Pass Iterator</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">c.equal(y)</span></tt></td>
-<td>convertible to bool</td>
-<td>true iff <tt class="literal"><span class="pre">c</span></tt> and <tt class="literal"><span class="pre">y</span></tt> refer to the
-same position.  Implements <tt class="literal"><span class="pre">c</span> <span class="pre">==</span> <span class="pre">y</span></tt>
-and <tt class="literal"><span class="pre">c</span> <span class="pre">!=</span> <span class="pre">y</span></tt>.</td>
-<td>Single Pass Iterator</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">a.advance(n)</span></tt></td>
-<td>unused</td>
-<td>&nbsp;</td>
-<td>Random Access Traversal
-Iterator</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">a.increment()</span></tt></td>
-<td>unused</td>
-<td>&nbsp;</td>
-<td>Incrementable Iterator</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">a.decrement()</span></tt></td>
-<td>unused</td>
-<td>&nbsp;</td>
-<td>Bidirectional Traversal
-Iterator</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">c.distance_to(b)</span></tt></td>
-<td>convertible to
-X::difference_type</td>
-<td>equivalent to <tt class="literal"><span class="pre">distance(c,</span> <span class="pre">b)</span></tt></td>
-<td>Random Access Traversal
-Iterator</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">c.distance_to(z)</span></tt></td>
-<td>convertible to
-X::difference_type</td>
-<td>equivalent to <tt class="literal"><span class="pre">distance(c,</span> <span class="pre">z)</span></tt>.
-Implements <tt class="literal"><span class="pre">c</span> <span class="pre">-</span> <span class="pre">z</span></tt>, <tt class="literal"><span class="pre">c</span> <span class="pre">&lt;</span> <span class="pre">z</span></tt>, <tt class="literal"><span class="pre">c</span>
-<span class="pre">&lt;=</span> <span class="pre">z</span></tt>, <tt class="literal"><span class="pre">c</span> <span class="pre">&gt;</span> <span class="pre">z</span></tt>, and <tt class="literal"><span class="pre">c</span> <span class="pre">&gt;=</span> <span class="pre">c</span></tt>.</td>
-<td>Random Access Traversal
-Iterator</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p>to:</p>
-<blockquote>
-<p>In the table below, <tt class="literal"><span class="pre">F</span></tt> is <tt class="literal"><span class="pre">iterator_facade&lt;X,V,C,R,D&gt;</span></tt>, <tt class="literal"><span class="pre">a</span></tt> is an
-object of type <tt class="literal"><span class="pre">X</span></tt>, <tt class="literal"><span class="pre">b</span></tt> and <tt class="literal"><span class="pre">c</span></tt> are objects of type <tt class="literal"><span class="pre">const</span> <span class="pre">X</span></tt>,
-<tt class="literal"><span class="pre">n</span></tt> is an object of <tt class="literal"><span class="pre">F::difference_type</span></tt>, <tt class="literal"><span class="pre">y</span></tt> is a constant
-object of a single pass iterator type interoperable with <tt class="literal"><span class="pre">X</span></tt>, and <tt class="literal"><span class="pre">z</span></tt>
-is a constant object of a random access traversal iterator type
-interoperable with <tt class="literal"><span class="pre">X</span></tt>.</p>
-<p><strong>iterator_facade Core Operations</strong></p>
-<table border="1" class="table">
-<colgroup>
-<col width="21%" />
-<col width="23%" />
-<col width="27%" />
-<col width="29%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Assertion/Note</th>
-<th>Used to implement Iterator
-Concept(s)</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><tt class="literal"><span class="pre">c.dereference()</span></tt></td>
-<td><tt class="literal"><span class="pre">F::reference</span></tt></td>
-<td>&nbsp;</td>
-<td>Readable Iterator, Writable
-Iterator</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">c.equal(y)</span></tt></td>
-<td>convertible to bool</td>
-<td>true iff <tt class="literal"><span class="pre">c</span></tt> and <tt class="literal"><span class="pre">y</span></tt>
-refer to the same
-position.</td>
-<td>Single Pass Iterator</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">a.increment()</span></tt></td>
-<td>unused</td>
-<td>&nbsp;</td>
-<td>Incrementable Iterator</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">a.decrement()</span></tt></td>
-<td>unused</td>
-<td>&nbsp;</td>
-<td>Bidirectional Traversal
-Iterator</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">a.advance(n)</span></tt></td>
-<td>unused</td>
-<td>&nbsp;</td>
-<td>Random Access Traversal
-Iterator</td>
-</tr>
-<tr><td><tt class="literal"><span class="pre">c.distance_to(z)</span></tt></td>
-<td>convertible to
-<tt class="literal"><span class="pre">F::difference_type</span></tt></td>
-<td>equivalent to
-<tt class="literal"><span class="pre">distance(c,</span> <span class="pre">X(z))</span></tt>.</td>
-<td>Random Access Traversal
-Iterator</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-</div>
-</div>
-</div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="iter-issue-list.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
-</body>
-</html>

Deleted: boost/trunk/libs/iterator/doc/iter-issue-list.rst
===================================================================
--- boost/trunk/libs/iterator/doc/iter-issue-list.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iter-issue-list.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3841 +0,0 @@
-+++++++++++++++++++++++++++++++++++++
- Iterator concept and adapter issues 
-+++++++++++++++++++++++++++++++++++++
-
-:date: $Date: 2004/01/27 03:17:30 $
-
-.. contents:: Index
-
-===================================
- Issues from Matt's TR issues list
-===================================
-
-
-9.1 iterator_access overspecified?
-==================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-The proposal includes::
-
-  enum iterator_access { 
-     readable_iterator = 1, writable_iterator = 2,
-     swappable_iterator = 4, lvalue_iterator = 8
-  }; 
-
-In general, the standard specifies thing like this as a bitmask
-type with a list of defined names, and specifies neither the exact
-type nor the specific values. Is there a reason for iterator_access
-to be more specific?
-
-:Proposed resolution: The ``iterator_access`` enum will be removed,
-   so this is no longer an issue.  See the resolution to 9.15.
-
-
-9.2 operators of iterator_facade overspecified 
-==============================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-In general, we've provided operational semantics for things like
-operator++. That is, we've said that ++iter must work, without
-requiring either a member function or a non-member function.
-iterator_facade specifies most operators as member
-functions. There's no inherent reason for these to be members, so
-we should remove this requirement. Similarly, some operations are
-specified as non-member functions but could be implemented as
-members. Again, the standard doesn't make either of these choices,
-and TR1 shouldn't, either. So: ``operator*()``, ``operator++()``,
-``operator++(int)``, ``operator--()``, ``operator--(int)``,
-``operator+=``, ``operator-=``, ``operator-(difference_type)``,
-``operator-(iterator_facade instance)``, and ``operator+`` should
-be specified with operational semantics and not explicitly required
-to be members or non-members.
-
-:Proposed resolution: Not a defect. 
-
-:Rationale: The standard uses valid expressions such as ``++iter``
-  in requirements tables, such as for input iterator.  However, for
-  classes, such as ``reverse_iterator``, the standard uses function
-  prototypes, as we have done here for
-  ``iterator_facade``. Further, the prototype specification does
-  not prevent the implementor from using members or non-members,
-  since nothing the user can do in a conforming program can detect
-  how the function is implemented.
-
-
-9.3 enable_if_interoperable needs standardese
-=============================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-The only discussion of what this means is in a note, so is
-non-normative. Further, the note seems to be incorrect. It says
-that enable_if_interoperable only works for types that "are
-interoperable, by which we mean they are convertible to each
-other." This requirement is too strong: it should be that one of
-the types is convertible to the other.  N1541 48
-
-:Proposed resolution: Add normative text. Relax requirements in the
-  proposed way.
-
-  Change:
-
-    [*Note:* The ``enable_if_interoperable`` template used above is
-    for exposition purposes. The member operators should be only be
-    in an overload set provided the derived types ``Dr1`` and
-    ``Dr2`` are interoperable, by which we mean they are
-    convertible to each other.  The ``enable_if_interoperable``
-    approach uses SFINAE to take the operators out of the overload
-    set when the types are not interoperable.]
-
-  To:
-
-    The ``enable_if_interoperable`` template used above is for
-    exposition purposes.  The member operators should only be in an
-    overload set provided the derived types ``Dr1`` and ``Dr2`` are
-    interoperable, meaning that at least one of the types is
-    convertible to the other.  The ``enable_if_interoperable``
-    approach uses SFINAE to take the operators out of the overload
-    set when the types are not interoperable.  The operators should
-    behave *as-if* ``enable_if_interoperable`` were defined to be::
-    
-      template <bool, typename> enable_if_interoperable_impl
-      {};
-    
-      template <typename T> enable_if_interoperable_impl<true,T>
-      { typedef T type; };
-    
-      template<typename Dr1, typename Dr2, typename T>
-      struct enable_if_interoperable
-        : enable_if_interoperable_impl<
-              is_convertible<Dr1,Dr2>::value || is_convertible<Dr2,Dr1>::value
-            , T
-          >
-      {};
-
-9.4 enable_if_convertible unspecified, conflicts with requires 
-==============================================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-In every place where enable_if_convertible is used it's used like
-this (simplified)::
-
-  template<class T>
-  struct C
-  {
-    template<class T1>
-    C(T1, enable_if_convertible<T1, T>::type* = 0);
-  };
-
-The idea being that this constructor won't compile if T1 isn't
-convertible to T. As a result, the constructor won't be considered
-as a possible overload when constructing from an object x where the
-type of x isn't convertible to T. In addition, however, each of
-these constructors has a requires clause that requires
-convertibility, so the behavior of a program that attempts such a
-construction is undefined. Seems like the enable_if_convertible
-part is irrelevant, and should be removed.  There are two
-problems. First, enable_if_convertible is never specified, so we
-don't know what this is supposed to do. Second: we could reasonably
-say that this overload should be disabled in certain cases or we
-could reasonably say that behavior is undefined, but we can't say
-both.
-
-Thomas Witt writes that the goal of putting in
-enable_if_convertible here is to make sure that a specific overload
-doesn't interfere with the generic case except when that overload
-makes sense. He agrees that what we currently have is deficient.
-Dave Abrahams writes that there is no conflict with the requires
-cause because the requires clause only takes effect when the
-function is actually called. The presence of the constructor
-signature can/will be detected by is_convertible without violating
-the requires clause, and thus it makes a difference to disable
-those constructor instantiations that would be disabled by
-enable_if_convertible even if calling them invokes undefined
-behavior.  There was more discussion on the reflector:
-c++std-lib-12312, c++std-lib-12325, c++std-lib- 12330,
-c++std-lib-12334, c++std-lib-12335, c++std-lib-12336,
-c++std-lib-12338, c++std-lib- 12362.
-
-:Proposed resolution: 
-  Change:
-
-    [*Note:* The ``enable_if_convertible<X,Y>::type`` expression
-    used in this section is for exposition purposes. The converting
-    constructors for specialized adaptors should be only be in an
-    overload set provided that an object of type ``X`` is
-    implicitly convertible to an object of type ``Y``.  The
-    ``enable_if_convertible`` approach uses SFINAE to take the
-    constructor out of the overload set when the types are not
-    implicitly convertible.]
-    
-  To:
-
-    The ``enable_if_convertible<X,Y>::type`` expression used in
-    this section is for exposition purposes. The converting
-    constructors for specialized adaptors should be only be in an
-    overload set provided that an object of type ``X`` is
-    implicitly convertible to an object of type ``Y``.  The
-    signatures involving ``enable_if_convertible`` should behave
-    *as-if* ``enable_if_convertible`` were defined to be::
-
-      template <bool> enable_if_convertible_impl
-      {};
-
-      template <> enable_if_convertible_impl<true>
-      { struct type; };
-
-      template<typename From, typename To>
-      struct enable_if_convertible
-        : enable_if_convertible_impl<is_convertible<From,To>::value>
-      {};
-
-    If an expression other than the default argument is used to
-    supply the value of a function parameter whose type is written
-    in terms of ``enable_if_convertible``, the program is
-    ill-formed, no diagnostic required.
-
-    [*Note:* The ``enable_if_convertible`` approach uses SFINAE to
-    take the constructor out of the overload set when the types are
-    not implicitly convertible.  ]
-
-9.5 iterator_adaptor has an extraneous 'bool' at the start of the template definition 
-=====================================================================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-The title says it all; this is probably just a typo. 
-
-:Proposed resolution: Remove the 'bool'.
-
-9.6 Name of private member shouldn't be normative 
-=================================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-iterator_adaptor has a private member named m_iterator. Presumably
-this is for exposition only, since it's an implementation
-detail. It needs to be marked as such.
-
-:Proposed resolution: Mark the member ``m_iterator`` as exposition
-   only.  Note/DWA: I think this is NAD because the user can't
-   detect it, though I'm happy to mark it exposition only.
-
-  In [lib.iterator.adaptor]
-
-  Change::
-
-    Base m_iterator;
-
-  to::
-
-    Base m_iterator; // exposition only
-
-
-9.7 iterator_adaptor operations specifications are a bit inconsistent 
-=====================================================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-iterator_adpator() has a Requires clause, that Base must be default
-constructible.  iterator_adaptor(Base) has no Requires clause,
-although the Returns clause says that the Base member is copy
-construced from the argument (this may actually be an oversight in
-N1550, which doesn't require iterators to be copy constructible or
-assignable).
-
-:Proposed resolution: Add a requirements section for the template
-  parameters of iterator_adaptor, and state that Base must be Copy
-  Constructible and Assignable.
-
-  N1550 does in fact include requirements for copy constructible
-  and assignable in the requirements tables. To clarify, we've also
-  added the requirements to the text.
-
-
-9.8 Specialized adaptors text should be normative 
-=================================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-similar to 9.3, "Specialized Adaptors" has a note describing
-enable_if_convertible. This should be normative text.
-
-:Proposed resolution: Changed it to normative
-  text.  See the resolution of 9.4
-
-9.9 Reverse_iterator text is too informal 
-=========================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-reverse iterator "flips the direction of the base iterator's
-motion". This needs to be more formal, as in the current
-standard. Something like: "iterates through the controlled sequence
-in the opposite direction"
-
-:Proposed resolution:
-
-  Change:
-
-    The reverse iterator adaptor flips the direction of a base
-    iterator's motion. Invoking ``operator++()`` moves the base
-    iterator backward and invoking ``operator--()`` moves the base
-    iterator forward.
-
-  to:
-
-    The reverse iterator adaptor iterates through the adapted iterator
-    range in the opposite direction.
-
-
-9.10 'prior' is undefined 
-=========================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-reverse_iterator::dereference is specified as calling a function
-named 'prior' which has no specification.
-
-:Proposed resolution:
-  Change the specification to avoid using ``prior`` as follows.
-
-  Remove::
-
-    typename reverse_iterator::reference dereference() const { return *prior(this->base()); }
-
-  And at the end of the operations section add:
-
-    ``reference operator*() const;``
-
-    :Effects: 
-
-    ::
-
-        Iterator tmp = m_iterator;
-        return *--tmp;
-
-:Rationale:
-  The style of specification has changed because of issue 9.37x.
-
-
-
-9.11 "In other words" is bad wording 
-====================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-Transform iterator has a two-part specification: it does this, in
-other words, it does that. "In other words" always means "I didn't
-say it right, so I'll try again." We need to say it once.
-
-:Proposed resolution:
-  Change:
-
-    The transform iterator adapts an iterator by applying some function
-    object to the result of dereferencing the iterator. In other words,
-    the ``operator*`` of the transform iterator first dereferences the
-    base iterator, passes the result of this to the function object, and
-    then returns the result.
-
-  to:
-
-    The transform iterator adapts an iterator by modifying the
-    ``operator*`` to apply a function object to the result of
-    dereferencing the iterator and returning the result.
-
-
-9.12 Transform_iterator shouldn't mandate private member 
-========================================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-transform_iterator has a private member named 'm_f' which should be
-marked "exposition only."
-
-:Proposed resolution: Mark the member ``m_f`` as exposition
-  only. Note/DWA: I think this is NAD because the user can't
-  detect it, though I'm happy to mark it exposition only.
-
-  Change::
-
-    UnaryFunction m_f;
-
-  to::
-
-    UnaryFunction m_f;   // exposition only
-
-
-
-9.13 Unclear description of counting iterator 
-=============================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-The description of Counting iterator is unclear. "The counting
-iterator adaptor implements dereference by returning a reference to
-the base object. The other operations are implemented by the base
-m_iterator, as per the inheritance from iterator_adaptor."
-
-:Proposed resolution:
-  Change:
-
-    The counting iterator adaptor implements dereference by
-    returning a reference to the base object. The other operations
-    are implemented by the base ``m_iterator``, as per the
-    inheritance from ``iterator_adaptor``.
-
-  to:
-
-    ``counting_iterator`` adapts an object by adding an
-    ``operator*`` that returns the current value of the object. All
-    other iterator operations are forwarded to the adapted object.
-
-
-
-9.14 Counting_iterator's difference type 
-========================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-Counting iterator has the following note: 
-
-  [Note: implementers are encouraged to provide an implementation
-  of distance_to and a difference_type that avoids overflows in the
-  cases when the Incrementable type is a numeric type.]
-
-I'm not sure what this means. The user provides a template argument
-named Difference, but there's no difference_type. I assume this is
-just a glitch in the wording. But if implementors are encouraged to
-ignore this argument if it won't work right, why is it there?
-
-:Proposed resolution: The ``difference_type`` was inherited from
-  ``iterator_adaptor``.  However, we've removed the explicit
-  inheritance, so explicit typedefs have been added. See the
-  resolution of 9.37x.
-
-
-
-9.15 How to detect lvalueness? 
-==============================
-
-:Submitter: Dave Abrahams 
-:Status: New 
-
-Shortly after N1550 was accepted, we discovered that an iterator's
-lvalueness can be determined knowing only its value_type. This
-predicate can be calculated even for old-style iterators (on whose
-reference type the standard places few requirements). A trait in
-the Boost iterator library does it by relying on the compiler's
-unwillingness to bind an rvalue to a T& function template
-parameter. Similarly, it is possible to detect an iterator's
-readability knowing only its value_type.  Thus, any interface which
-asks the user to explicitly describe an iterator's lvalue-ness or
-readability seems to introduce needless complexity.
-
-
-:Proposed resolution: 
-
-  1. Remove the ``is_writable`` and ``is_swappable`` traits, and
-     remove the requirements in the Writable Iterator and Swappable
-     Iterator concepts that require their models to support these
-     traits.
-
-  2. Change the ``is_readable`` specification.  Remove the
-     requirement for support of the ``is_readable`` trait from the
-     Readable Iterator concept.
-
-  3. Remove the ``iterator_tag`` class and transplant the logic for
-     choosing an iterator category into ``iterator_facade``.
-
-  4. Change the specification of ``traversal_category``.
-
-  5. Remove Access parameters from N1530
-
-  In N1550:
-
-  Remove:
-
-    Since the access concepts are not related via refinement, but
-    instead cover orthogonal issues, we do not use tags for the
-    access concepts, but instead use the equivalent of a bit field.
-    
-    We provide an access mechanism for mapping iterator types to
-    the new traversal tags and access bit field. Our design reuses
-    ``iterator_traits<Iter>::iterator_category`` as the access
-    mechanism. To that end, the access and traversal information is
-    bundled into a single type using the following `iterator_tag`
-    class.
-    
-    ::
-    
-      enum iterator_access { readable_iterator = 1, writable_iterator = 2, 
-          swappable_iterator = 4, lvalue_iterator = 8 };
-    
-      template <unsigned int access_bits, class TraversalTag>
-      struct iterator_tag : /* appropriate old category or categories */ {
-        static const iterator_access access =
-          (iterator_access)access_bits & 
-            (readable_iterator | writable_iterator | swappable_iterator);
-        typedef TraversalTag traversal;
-      };
-    
-    The ``access_bits`` argument is declared to be ``unsigned int``
-    instead of the enum ``iterator_access`` for convenience of
-    use. For example, the expression ``(readable_iterator |
-    writable_iterator)`` produces an unsigned int, not an
-    ``iterator_access``.  The purpose of the ``lvalue_iterator``
-    part of the ``iterator_access`` enum is to communicate to
-    ``iterator_tag`` whether the reference type is an lvalue so
-    that the appropriate old category can be chosen for the base
-    class. The ``lvalue_iterator`` bit is not recorded in the
-    ``iterator_tag::access`` data member.
-    
-    The ``iterator_tag`` class template is derived from the
-    appropriate iterator tag or tags from the old requirements
-    based on the access bits and traversal tag passed as template
-    parameters.  The algorithm for determining the old tag or tags
-    picks the least refined old concepts that include all of the
-    requirements of the access and traversal concepts (that is, the
-    closest fit), if any such category exists.  For example, the
-    category tag for a Readable Single Pass Iterator will always be
-    derived from ``input_iterator_tag``, while the category tag for
-    a Single Pass Iterator that is both Readable and Writable will
-    be derived from both ``input_iterator_tag`` and
-    ``output_iterator_tag``.
-    
-    We also provide several helper classes that make it convenient
-    to obtain the access and traversal characteristics of an
-    iterator. These helper classes work both for iterators whose
-    ``iterator_category`` is ``iterator_tag`` and also for
-    iterators using the original iterator categories.
-    
-    ::
-    
-      template <class Iterator> struct is_readable  { typedef ... type; };
-      template <class Iterator> struct is_writable { typedef ... type; };
-      template <class Iterator> struct is_swappable { typedef ... type; };
-      template <class Iterator> struct traversal_category { typedef ... type; };
-
-
-  After:
-
-    Like the old iterator requirements, we provide tags for
-    purposes of dispatching based on the traversal concepts.  The
-    tags are related via inheritance so that a tag is convertible
-    to another tag if the concept associated with the first tag is
-    a refinement of the second tag.
-
-  Add:
-
-    Our design reuses ``iterator_traits<Iter>::iterator_category``
-    to indicate an iterator's traversal capability.  To specify
-    capabilities not captured by any old-style iterator category,
-    an iterator designer can use an ``iterator_category`` type that
-    is convertible to both the the most-derived old iterator
-    category tag which fits, and the appropriate new iterator
-    traversal tag.
-
-    We do not provide tags for the purposes of dispatching based on
-    the access concepts, in part because we could not find a way to
-    automatically infer the right access tags for old-style
-    iterators.  An iterator's writability may be dependent on the
-    assignability of its ``value_type`` and there's no known way to
-    detect whether an arbitrary type is assignable.  Fortunately,
-    the need for dispatching based on access capability is not as
-    great as the need for dispatching based on traversal
-    capability.
-
-
-  From the Readable Iterator Requirements table, remove:
-
-    +-----------------------------------+-----------------------------------+-------------------------+
-    |``is_readable<X>::type``           |``true_type``                      |                         |
-    +-----------------------------------+-----------------------------------+-------------------------+
-
-  From the Writable Iterator Requirements table, remove:
-
-    +-------------------------+--------------+----------------------------+
-    |``is_writable<X>::type`` |``true_type`` |                            |
-    +-------------------------+--------------+----------------------------+
-
-  From the Swappable Iterator Requirements table, remove:
-
-    +-------------------------+-------------+-----------------------------+
-    |``is_swappable<X>::type``|``true_type``|                             |
-    +-------------------------+-------------+-----------------------------+
-
-
-  From [lib.iterator.synopsis] replace::
-
-    template <class Iterator> struct is_readable;
-    template <class Iterator> struct is_writable;
-    template <class Iterator> struct is_swappable;
-    template <class Iterator> struct traversal_category;
-  
-    enum iterator_access { readable_iterator = 1, writable_iterator = 2, 
-        swappable_iterator = 4, lvalue_iterator = 8 };
-  
-    template <unsigned int access_bits, class TraversalTag>
-    struct iterator_tag : /* appropriate old category or categories */ {
-      static const iterator_access access =
-        (iterator_access)access_bits & 
-          (readable_iterator | writable_iterator | swappable_iterator);
-      typedef TraversalTag traversal;
-    };
-
-  with::
-
-    template <class Iterator> struct is_readable_iterator;
-    template <class Iterator> struct iterator_traversal;
-
-
-  In [lib.iterator.traits], remove:
-
-    The ``iterator_tag`` class template is an iterator category tag
-    that encodes the access enum and traversal tag in addition to
-    being compatible with the original iterator tags.  The
-    ``iterator_tag`` class inherits from one of the original
-    iterator tags according to the following pseudo-code.
-    
-    ::
-     
-        inherit-category(access, traversal-tag) =
-             if ((access & readable_iterator) && (access & lvalue_iterator)) {
-                 if (traversal-tag is convertible to random_access_traversal_tag)
-                     return random_access_iterator_tag;
-                 else if (traversal-tag is convertible to bidirectional_traversal_tag)
-                     return bidirectional_iterator_tag;
-                 else if (traversal-tag is convertible to forward_traversal_tag)
-                     return forward_iterator_tag;
-                 else if (traversal-tag is convertible to single_pass_traversal_tag)
-                     if (access-tag is convertible to writable_iterator_tag)
-                         return input_output_iterator_tag;
-                     else
-                         return input_iterator_tag;
-                 else
-                     return null_category_tag;
-             } else if ((access & readable_iterator) and (access & writable_iterator)
-                        and traversal-tag is convertible to single_pass_iterator_tag)
-                 return input_output_iterator_tag;
-             else if (access & readable_iterator
-                      and traversal-tag is convertible to single_pass_iterator_tag)
-                 return input_iterator_tag;
-             else if (access & writable_iterator
-                      and traversal-tag is convertible to incrementable_iterator_tag)
-                 return output_iterator_tag;
-             else
-                 return null_category_tag;
-
-    If the argument for ``TraversalTag`` is not convertible to
-    ``incrementable_iterator_tag`` then the program is ill-formed.
-
-  Change:
-
-    The ``is_readable``, ``is_writable``, ``is_swappable``, and
-    ``traversal_category`` class templates are traits classes. For
-    iterators whose ``iterator_traits<Iter>::iterator_category``
-    type is ``iterator_tag``, these traits obtain the ``access``
-    enum and ``traversal`` member type from within
-    ``iterator_tag``.  For iterators whose
-    ``iterator_traits<Iter>::iterator_category`` type is not
-    ``iterator_tag`` and instead is a tag convertible to one of the
-    original tags, the appropriate traversal tag and access bits
-    are deduced.  The following pseudo-code describes the
-    algorithm.
-
-    ::
-
-      is-readable(Iterator) = 
-          cat = iterator_traits<Iterator>::iterator_category;
-          if (cat == iterator_tag<Access,Traversal>)
-              return Access & readable_iterator;
-          else if (cat is convertible to input_iterator_tag)
-              return true;
-          else
-              return false;
-
-      is-writable(Iterator) =
-          cat = iterator_traits<Iterator>::iterator_category;
-          if (cat == iterator_tag<Access,Traversal>)
-              return Access & writable_iterator;
-          else if (cat is convertible to output_iterator_tag)
-               return true;
-          else if (
-               cat is convertible to forward_iterator_tag
-               and iterator_traits<Iterator>::reference is a 
-                   mutable reference)
-              return true;
-          else
-              return false;
-
-      is-swappable(Iterator) =
-          cat = iterator_traits<Iterator>::iterator_category;
-          if (cat == iterator_tag<Access,Traversal>)
-              return Access & swappable_iterator;
-          else if (cat is convertible to forward_iterator_tag) {
-              if (iterator_traits<Iterator>::reference is a const reference)
-                  return false;
-              else
-                  return true;
-          } else 
-              return false;
-
-      traversal-category(Iterator) =
-          cat = iterator_traits<Iterator>::iterator_category;
-          if (cat == iterator_tag<Access,Traversal>)
-              return Traversal;
-          else if (cat is convertible to random_access_iterator_tag)
-              return random_access_traversal_tag;
-          else if (cat is convertible to bidirectional_iterator_tag)
-              return bidirectional_traversal_tag;
-          else if (cat is convertible to forward_iterator_tag)
-              return forward_traversal_tag;
-          else if (cat is convertible to input_iterator_tag)
-              return single_pass_iterator_tag;
-          else if (cat is convertible to output_iterator_tag)
-              return incrementable_iterator_tag;
-          else
-              return null_category_tag;
-
-
-    The following specializations provide the access and traversal
-    category tags for pointer types.
-
-    ::
-
-      template <typename T>
-      struct is_readable<const T*> { typedef true_type type; };
-      template <typename T>
-      struct is_writable<const T*> { typedef false_type type; };
-      template <typename T>
-      struct is_swappable<const T*> { typedef false_type type; };
-
-      template <typename T>
-      struct is_readable<T*> { typedef true_type type; };
-      template <typename T>
-      struct is_writable<T*> { typedef true_type type; };
-      template <typename T>
-      struct is_swappable<T*> { typedef true_type type; };
-
-      template <typename T>
-      struct traversal_category<T*>
-      {
-        typedef random_access_traversal_tag type;
-      };
-
-  to:
-
-    The ``is_readable_iterator`` class template satisfies the
-    UnaryTypeTrait requirements.
-
-    Given an iterator type ``X``,
-    ``is_readable_iterator<X>::value`` yields ``true`` if, for an
-    object ``a`` of type ``X``, ``*a`` is convertible to
-    ``iterator_traits<X>::value_type``, and ``false`` otherwise.
-
-    .. _`category-to-traversal`: 
-
-    ``iterator_traversal<X>::type`` is 
-
-    .. parsed-literal::
-
-      *category-to-traversal*\ (iterator_traits<X>::iterator_category) 
-
-    where *category-to-traversal* is defined as follows
-
-    .. parsed-literal::
-
-       *category-to-traversal*\ (C) =
-           if (C is convertible to incrementable_traversal_tag)
-               return C;
-           else if (C is convertible to random_access_iterator_tag)
-               return random_access_traversal_tag;
-           else if (C is convertible to bidirectional_iterator_tag)
-               return bidirectional_traversal_tag;
-           else if (C is convertible to forward_iterator_tag)
-               return forward_traversal_tag;
-           else if (C is convertible to input_iterator_tag)
-               return single_pass_traversal_tag;
-           else if (C is convertible to output_iterator_tag)
-               return incrementable_traversal_tag;
-           else
-               *the program is ill-formed*
-
-  In N1530:
-
-  In [lib.iterator.helper.synopsis]:
-
-  Change::
-
-    const unsigned use_default_access = -1;
-
-    struct iterator_core_access { /* implementation detail */ };
-
-    template <
-        class Derived
-      , class Value
-      , unsigned AccessCategory
-      , class TraversalCategory
-      , class Reference  = Value&
-      , class Difference = ptrdiff_t
-    >
-    class iterator_facade;
-
-    template <
-        class Derived
-      , class Base
-      , class Value      = use_default
-      , unsigned Access  = use_default_access
-      , class Traversal  = use_default
-      , class Reference  = use_default
-      , class Difference = use_default
-    >
-    class iterator_adaptor;
-
-    template <
-        class Iterator
-      , class Value = use_default
-      , unsigned Access  = use_default_access
-      , class Traversal  = use_default
-      , class Reference = use_default
-      , class Difference = use_default
-    >
-    class indirect_iterator;
-
-  To::
-
-    struct iterator_core_access { /* implementation detail */ };
-
-    template <
-        class Derived
-      , class Value
-      , class CategoryOrTraversal
-      , class Reference  = Value&
-      , class Difference = ptrdiff_t
-    >
-    class iterator_facade;
-
-    template <
-        class Derived
-      , class Base
-      , class Value      = use_default
-      , class CategoryOrTraversal  = use_default
-      , class Reference  = use_default
-      , class Difference = use_default
-    >
-    class iterator_adaptor;
-
-    template <
-        class Iterator
-      , class Value = use_default
-      , class CategoryOrTraversal = use_default
-      , class Reference = use_default
-      , class Difference = use_default
-    >
-    class indirect_iterator;
-    
-  Change::
-
-    template <
-        class Incrementable
-      , unsigned Access  = use_default_access
-      , class Traversal  = use_default
-      , class Difference = use_default
-    >
-    class counting_iterator
-
-  To::
-
-    template <
-        class Incrementable
-      , class CategoryOrTraversal  = use_default
-      , class Difference = use_default
-    >
-    class counting_iterator;
-
-  In [lib.iterator.facade]:
-
-  Change::
-
-    template <
-        class Derived
-      , class Value
-      , unsigned AccessCategory
-      , class TraversalCategory
-      , class Reference  = /* see below */
-      , class Difference = ptrdiff_t
-    >
-    class iterator_facade {
-
-  to::
-
-    template <
-        class Derived
-      , class Value
-      , class CategoryOrTraversal
-      , class Reference  = Value&
-      , class Difference = ptrdiff_t
-    >
-    class iterator_facade {
-
-
-  Change::
-
-        typedef iterator_tag<AccessCategory, TraversalCategory> iterator_category;
-  
-  to::
-
-        typedef /* see below */ iterator_category;
-
-
-  Change::
-  
-    // Comparison operators
-    template <class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-              class Dr2, class V2, class AC2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1, Dr2, bool>::type // exposition
-    operator ==(iterator_facade<Dr1, V1, AC1, TC1, R1, D1> const& lhs,
-                iterator_facade<Dr2, V2, AC2, TC2, R2, D2> const& rhs);
-  
-    template <class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-              class Dr2, class V2, class AC2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1, Dr2, bool>::type
-    operator !=(iterator_facade<Dr1, V1, AC1, TC1, R1, D1> const& lhs,
-                iterator_facade<Dr2, V2, AC2, TC2, R2, D2> const& rhs);
-  
-    template <class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-              class Dr2, class V2, class AC2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1, Dr2, bool>::type
-    operator <(iterator_facade<Dr1, V1, AC1, TC1, R1, D1> const& lhs,
-               iterator_facade<Dr2, V2, AC2, TC2, R2, D2> const& rhs);
-  
-    template <class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-              class Dr2, class V2, class AC2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1, Dr2, bool>::type
-    operator <=(iterator_facade<Dr1, V1, AC1, TC1, R1, D1> const& lhs,
-                iterator_facade<Dr2, V2, AC2, TC2, R2, D2> const& rhs);
-  
-    template <class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-              class Dr2, class V2, class AC2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1, Dr2, bool>::type
-    operator >(iterator_facade<Dr1, V1, AC1, TC1, R1, D1> const& lhs,
-               iterator_facade<Dr2, V2, AC2, TC2, R2, D2> const& rhs);
-  
-    template <class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-              class Dr2, class V2, class AC2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1, Dr2, bool>::type
-    operator >=(iterator_facade<Dr1, V1, AC1, TC1, R1, D1> const& lhs,
-                iterator_facade<Dr2, V2, AC2, TC2, R2, D2> const& rhs);
-  
-    template <class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-              class Dr2, class V2, class AC2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1, Dr2, bool>::type
-    operator >=(iterator_facade<Dr1, V1, AC1, TC1, R1, D1> const& lhs,
-                iterator_facade<Dr2, V2, AC2, TC2, R2, D2> const& rhs);
-  
-    // Iterator difference
-    template <class Dr1, class V1, class AC1, class TC1, class R1, class D1,
-              class Dr2, class V2, class AC2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1, Dr2, bool>::type
-    operator -(iterator_facade<Dr1, V1, AC1, TC1, R1, D1> const& lhs,
-               iterator_facade<Dr2, V2, AC2, TC2, R2, D2> const& rhs);
-  
-    // Iterator addition
-    template <class Derived, class V, class AC, class TC, class R, class D>
-    Derived operator+ (iterator_facade<Derived, V, AC, TC, R, D> const&,
-                       typename Derived::difference_type n)
-
-  to::
-
-    // Comparison operators
-    template <class Dr1, class V1, class TC1, class R1, class D1,
-              class Dr2, class V2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1,Dr2,bool>::type // exposition
-    operator ==(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
-                iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs);
-  
-    template <class Dr1, class V1, class TC1, class R1, class D1,
-              class Dr2, class V2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1,Dr2,bool>::type
-    operator !=(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
-                iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs);
-  
-    template <class Dr1, class V1, class TC1, class R1, class D1,
-              class Dr2, class V2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1,Dr2,bool>::type
-    operator <(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
-               iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs);
-  
-    template <class Dr1, class V1, class TC1, class R1, class D1,
-              class Dr2, class V2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1,Dr2,bool>::type
-    operator <=(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
-                iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs);
-  
-    template <class Dr1, class V1, class TC1, class R1, class D1,
-              class Dr2, class V2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1,Dr2,bool>::type
-    operator >(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
-               iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs);
-  
-    template <class Dr1, class V1, class TC1, class R1, class D1,
-              class Dr2, class V2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1,Dr2,bool>::type
-    operator >=(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
-                iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs);
-  
-    // Iterator difference
-    template <class Dr1, class V1, class TC1, class R1, class D1,
-              class Dr2, class V2, class TC2, class R2, class D2>
-    /* see below */
-    operator-(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
-              iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs);
-  
-    // Iterator addition
-    template <class Dr, class V, class TC, class R, class D>
-    Derived operator+ (iterator_facade<Dr,V,TC,R,D> const&,
-                       typename Derived::difference_type n);
-  
-    template <class Dr, class V, class TC, class R, class D>
-    Derived operator+ (typename Derived::difference_type n,
-                       iterator_facade<Dr,V,TC,R,D> const&);
-
-
-  After the ``iterator_facade`` synopsis, add:
-
-  The ``iterator_category`` member of ``iterator_facade`` is
-
-  .. parsed-literal::
-
-    *iterator-category*\ (CategoryOrTraversal, value_type, reference)
-
-  where *iterator-category* is defined as follows:
-
-  .. parsed-literal::
-      
-      *iterator-category*\ (C,R,V) :=
-         if (C is convertible to std::input_iterator_tag
-             || C is convertible to std::output_iterator_tag
-         )
-             return C
-    
-         else if (C is not convertible to incrementable_traversal_tag)
-             *the program is ill-formed*
-    
-         else return a type X satisfying the following two constraints:
-    
-            1. X is convertible to X1, and not to any more-derived
-               type, where X1 is defined by:
-    
-                 if (R is a reference type
-                     && C is convertible to forward_traversal_tag)
-                 {
-                     if (C is convertible to random_access_traversal_tag)
-                         X1 = random_access_iterator_tag
-                     else if (C is convertible to bidirectional_traversal_tag)
-                         X1 = bidirectional_iterator_tag
-                     else
-                         X1 = forward_iterator_tag
-                 }
-                 else
-                 {
-                     if (C is convertible to single_pass_traversal_tag
-                         && R is convertible to V)
-                         X1 = input_iterator_tag
-                     else
-                         X1 = C
-                 }
-    
-            2. |category-to-traversal|_\ (X) is convertible to the most
-               derived traversal tag type to which X is also
-               convertible, and not to any more-derived traversal tag
-               type.
-    
-.. |category-to-traversal| replace:: *category-to-traversal*
-
-.. |iterator-category| replace:: *iterator-category*
-.. _iterator-category:
-
-  In [lib.iterator.facade] ``iterator_facade`` requirements:
-
-  Remove:
-
-    ``AccessCategory`` must be an unsigned value which uses no more
-    bits than the greatest value of ``iterator_access``.
-        
-  In the **Iterator Adaptor** section, change:
-
-     Several of the template parameters of ``iterator_adaptor`` default
-     to ``use_default`` (or ``use_default_access``). 
-
-  to:
-
-     Several of the template parameters of ``iterator_adaptor`` default
-     to ``use_default``. 
-
-  In [lib.iterator.special.adaptors]:
-
-  Change::
-
-    template <
-        class Iterator
-      , class Value = use_default
-      , unsigned Access  = use_default_access
-      , class Traversal  = use_default
-      , class Reference = use_default
-      , class Difference = use_default
-    >
-    class indirect_iterator
-
-  to::
-
-    template <
-        class Iterator
-      , class Value = use_default
-      , class CategoryOrTraversal = use_default
-      , class Reference = use_default
-      , class Difference = use_default
-    >
-    class indirect_iterator
-
-  Change::
-
-    template <
-        class Iterator2, class Value2, unsigned Access2, class Traversal2
-      , class Reference2, class Difference2
-    >
-    indirect_iterator(
-
-  to::
-
-    template <
-        class Iterator2, class Value2, class Category2
-      , class Reference2, class Difference2
-    >
-    indirect_iterator(
-
-  Change::
-
-    template <
-        class Incrementable
-      , unsigned Access = use_default_access
-      , class Traversal = use_default
-      , class Difference = use_default
-    >
-    class counting_iterator
-
-  to::
-
-    template <
-        class Incrementable
-      , class CategoryOrTraversal = use_default
-      , class Difference = use_default
-    >
-    class counting_iterator
-
-
-  Change::
-
-    typedef iterator_tag<
-          writable_iterator
-        , incrementable_traversal_tag
-    > iterator_category;
-
-  to:
-
-    typedef std::output_iterator_tag iterator_category;
-
-  In [lib.iterator.adaptor]
-
-  Change::
-
-    template <
-        class Derived
-      , class Base
-      , class Value      = use_default
-      , unsigned Access  = use_default_access
-      , class Traversal  = use_default
-      , class Reference  = use_default
-      , class Difference = use_default
-    >
-    class iterator_adaptor 
-
-  To::
-
-    template <
-        class Derived
-      , class Base
-      , class Value               = use_default
-      , class CategoryOrTraversal = use_default
-      , class Reference           = use_default
-      , class Difference = use_default
-    >
-    class iterator_adaptor 
-  
-:Rationale: 
-
-1. There are two reasons for removing ``is_writable``
-   and ``is_swappable``. The first is that we do not know of
-   a way to fix the specification so that it gives the correct
-   answer for all iterators. Second, there was only a weak
-   motivation for having ``is_writable`` and ``is_swappable``
-   there in the first place.  The main motivation was simply
-   uniformity: we have tags for the old iterator categories
-   so we should have tags for the new iterator categories.
-   While having tags and the capability to dispatch based
-   on the traversal categories is often used, we see
-   less of a need for dispatching based on writability
-   and swappability, since typically algorithms
-   that need these capabilities have no alternative if
-   they are not provided.
-
-2. We discovered that the ``is_readable`` trait can be implemented
-   using only the iterator type itself and its ``value_type``.
-   Therefore we remove the requirement for ``is_readable`` from the
-   Readable Iterator concept, and change the definition of
-   ``is_readable`` so that it works for any iterator type.
-
-3. The purpose of the ``iterator_tag`` class was to bundle the
-   traversal and access category tags into the
-   ``iterator_category`` typedef.  With ``is_writable`` and
-   ``is_swappable`` gone, and ``is_readable`` no longer in need of
-   special hints, there is no reason for iterators to provide
-   information about the access capabilities of an iterator.  Thus
-   there is no need for the ``iterator_tag``. The traversal tag can
-   be directly used for the ``iterator_category``. If a new
-   iterator is intended to be backward compatible with old iterator
-   concepts, a tag type that is convertible to both one of the new
-   traversal tags and also to an old iterator tag can be created
-   and use for the ``iterator_category``.
-
-4. The changes to the specification of ``traversal_category`` are a 
-   direct result of the removal of ``iterator_tag``.
-
-
-
-9.16 is_writable_iterator returns false positives 
-=================================================
-
-:Submitter: Dave Abrahams 
-:Status: New 
-
-is_writable_iterator returns false positives for forward iterators
-whose value_type has a private assignment operator, or whose
-reference type is not a reference (currently legal).
-
-:Proposed Resolution: See the resolution to 9.15.
-
-
-9.17 is_swappable_iterator returns false positives 
-==================================================
-
-:Submitter: Dave Abrahams 
-:Status: New 
-
-is_swappable_iterator has the same problems as
-is_writable_iterator. In addition, if we allow users to write their
-own iter_swap functions it's easy to imagine old-style iterators
-for which is_swappable returns false negatives.
-
-:Proposed Resolution: See the resolution to 9.15.
-
-
-9.18 Are is_readable, is_writable, and is_swappable useful? 
-===========================================================
-
-:Submitter: Dave Abrahams 
-:Status: New 
-
-I am concerned that there is little use for any of is_readable,
-is_writable, or is_swappable, and that not only do they unduly
-constrain iterator implementors but they add overhead to
-iterator_facade and iterator_adaptor in the form of a template
-parameter which would otherwise be unneeded. Since we can't
-implement two of them accurately for old-style iterators, I am
-having a hard time justifying their impact on the rest of the
-proposal(s).
-
-:Proposed Resolution: See the resolution to 9.15.
-
-9.19 Non-Uniformity of the "lvalue_iterator Bit" 
-================================================
-
-:Submitter: Dave Abrahams 
-:Status: New 
-
-The proposed iterator_tag class template accepts an "access bits"
-parameter which includes a bit to indicate the iterator's
-lvalueness (whether its dereference operator returns a reference to
-its value_type. The relevant part of N1550 says:
-
-  The purpose of the lvalue_iterator part of the iterator_access
-  enum is to communicate to iterator_tagwhether the reference type
-  is an lvalue so that the appropriate old category can be chosen
-  for the base class. The lvalue_iterator bit is not recorded in
-  the iterator_tag::access data member.
-
-The lvalue_iterator bit is not recorded because N1550 aims to
-improve orthogonality of the iterator concepts, and a new-style
-iterator's lvalueness is detectable by examining its reference
-type. This inside/outside difference is awkward and confusing.
-
-:Proposed Resolution: The iterator_tag class will be removed, so this is no longer an issue.
-  See the resolution to 9.15.
-
-
-9.20 Traversal Concepts and Tags 
-================================
-
-:Submitter: Dave Abrahams 
-:Status: New 
-
-Howard Hinnant pointed out some inconsistencies with the naming of
-these tag types::
-
-  incrementable_iterator_tag // ++r, r++ 
-  single_pass_iterator_tag // adds a == b, a != b 
-  forward_traversal_iterator_tag // adds multi-pass 
-  bidirectional_traversal_iterator_tag // adds --r, r--
-  random_access_traversal_iterator_tag // adds r+n,n+r,etc. 
-
-Howard thought that it might be better if all tag names contained
-the word "traversal".  It's not clear that would result in the best
-possible names, though. For example, incrementable iterators can
-only make a single pass over their input. What really distinguishes
-single pass iterators from incrementable iterators is not that they
-can make a single pass, but that they are equality
-comparable. Forward traversal iterators really distinguish
-themselves by introducing multi-pass capability. Without entering
-a "Parkinson's Bicycle Shed" type of discussion, it might be worth
-giving the names of these tags (and the associated concepts) some
-extra attention.
-
-:Proposed resolution: Change the names of the traversal tags to the
-  following names::
-
-    incrementable_traversal_tag
-    single_pass_traversal_tag
-    forward_traversal_tag
-    bidirectional_traversal_tag
-    random_access_traversal_tag
-
-
-  In [lib.iterator.traversal]:
-
-
-  Change:
-
-    +--------------------------------+-------------------------------+--------------------+
-    |``traversal_category<X>::type`` |Convertible to                 |                    |
-    |                                |``incrementable_iterator_tag`` |                    |
-    +--------------------------------+-------------------------------+--------------------+
-
-  to:
-
-    +--------------------------------+-------------------------------+--------------------+
-    |``iterator_traversal<X>::type`` |Convertible to                 |                    |
-    |                                |``incrementable_traversal_tag``|                    |
-    +--------------------------------+-------------------------------+--------------------+
-
-  Change:
-
-    +--------------------------------+-----------------------------+---------------------------+
-    |``traversal_category<X>::type`` |Convertible to               |                           |
-    |                                |``single_pass_iterator_tag`` |                           |
-    +--------------------------------+-----------------------------+---------------------------+
-
-  to:
-
-    +--------------------------------+-----------------------------+---------------------------+
-    |``iterator_traversal<X>::type`` |Convertible to               |                           |
-    |                                |``single_pass_traversal_tag``|                           |
-    +--------------------------------+-----------------------------+---------------------------+
-
-  Change:
-
-    +---------------------------------------+-----------------------------------+---------------+
-    |``traversal_category<X>::type``        |Convertible to                     |               |
-    |                                       |``forward_traversal_iterator_tag`` |               |
-    +---------------------------------------+-----------------------------------+---------------+
-
-  to:
-
-    +---------------------------------------+-----------------------------------+----------------------------+
-    |``iterator_traversal<X>::type``        |Convertible to                     |                            |
-    |                                       |``forward_traversal_tag``          |                            |
-    +---------------------------------------+-----------------------------------+----------------------------+
-
-  Change:
-
-    +------------------------------------+---------------------------------------------+---------------------+
-    |``traversal_category<X>::type``     |Convertible to                               |                     |
-    |                                    |``bidirectional_traversal_iterator_tag``     |                     |
-    +------------------------------------+---------------------------------------------+---------------------+
-
-  to:
-
-    +--------------------------------+-------------------------------+---------------------+
-    |``iterator_traversal<X>::type`` |Convertible to                 |                     |
-    |                                |``bidirectional_traversal_tag``|                     |
-    +--------------------------------+-------------------------------+---------------------+
-
-  Change:
-
-    +-------------------------------------------+-------------------------------------------------+-------------------------+----------------------+
-    |``traversal_category<X>::type``            |Convertible to                                   |                         |                      |
-    |                                           |``random_access_traversal_iterator_tag``         |                         |                      |
-    +-------------------------------------------+-------------------------------------------------+-------------------------+----------------------+
-
-  to:
-
-    +-------------------------------+---------------------------------+-------------------------+----------------------+
-    |``iterator_traversal<X>::type``|Convertible to                   |                         |                      |
-    |                               |``random_access_traversal_tag``  |                         |                      |
-    +-------------------------------+---------------------------------+-------------------------+----------------------+
-
-
-  In [lib.iterator.synopsis], change::  
-
-    struct incrementable_iterator_tag { };
-    struct single_pass_iterator_tag : incrementable_iterator_tag { };
-    struct forward_traversal_tag : single_pass_iterator_tag { };
-
-  to::
-
-    struct incrementable_traversal_tag { };
-    struct single_pass_traversal_tag : incrementable_traversal_tag { };
-    struct forward_traversal_tag : single_pass_traversal_tag { };
-
-  Remove::
-
-    struct null_category_tag { };
-    struct input_output_iterator_tag : input_iterator_tag, output_iterator_tag {};
-
-
-9.21 iterator_facade Derived template argument underspecified 
-=============================================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-The first template argument to iterator_facade is named Derived,
-and the proposal says: 
-
-  The Derived template parameter must be a class derived from
-  iterator_facade. 
-
-First, iterator_facade is a template, so cannot be derived
-from. Rather, the class must be derived from a specialization of
-iterator_facade. More important, isn't Derived required to be the
-class that is being defined? That is, if I understand it right, the
-definition of D here this is not valid::
-
-  class C : public iterator_facade<C, ... > { ... }; 
-  class D : public iterator_facade<C, ...> { ... }; 
-
-In the definition of D, the Derived argument to iterator_facade is
-a class derived from a specialization of iterator_facade, so the
-requirement is met. Shouldn't the requirement be more like "when
-using iterator_facade to define an iterator class Iter, the class
-Iter must be derived from a specialization of iterator_facade whose
-first template argument is Iter." That's a bit awkward, but at the
-moment I don't see a better way of phrasing it.
-
-:Proposed resolution: 
-
-  In [lib.iterator.facade]
-
-  Remove:
-
-    The ``Derived`` template parameter must be a class derived from
-    ``iterator_facade``.
-    
-  Change:
-
-    The following table describes the other requirements on the
-    ``Derived`` parameter.  Depending on the resulting iterator's
-    ``iterator_category``, a subset of the expressions listed in the table
-    are required to be valid.  The operations in the first column must be
-    accessible to member functions of class ``iterator_core_access``.
-    
-  to:
-
-    The following table describes the typical valid expressions on
-    ``iterator_facade``\ 's ``Derived`` parameter, depending on the
-    iterator concept(s) it will model.  The operations in the first
-    column must be made accessible to member functions of class
-    ``iterator_core_access``.  In addition,
-    ``static_cast<Derived*>(iterator_facade*)`` shall be well-formed.
-    
-  In [lib.iterator.adaptor]
-
-  Change:
-
-    The ``iterator_adaptor`` is a base class template derived from
-    an instantiation of ``iterator_facade``.
-
-  to:
-
-    Each specialization of the ``iterator_adaptor`` class template
-    is derived from a specialization of ``iterator_facade``.  
-
-  Change:
-
-    The ``Derived`` template parameter must be a derived class of
-    ``iterator_adaptor``.
-
-  To:
-
-    ``static_cast<Derived*>(iterator_adaptor*)`` shall be well-formed.
-
-[Note: The proposed resolution to Issue 9.37 contains related
-changes]
-
-9.22 return type of Iterator difference for iterator facade
-===========================================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-The proposal says::
-
-  template <class Dr1, class V1, class AC1, class TC1, class R1, class D1, 
-  class Dr2, class V2, class AC2, class TC2, class R2, class D2>
-  typename enable_if_interoperable<Dr1, Dr2, bool>::type
-  operator -(iterator_facade<Dr1, V1, AC1, TC1, R1, D1> const& lhs, 
-  iterator_facade<Dr2, V2, AC2, TC2, R2, D2> const& rhs); 
-
-Shouldn't the return type be one of the two iterator types? Which
-one? The idea is that if one of the iterator types can be converted
-to the other type, then the subtraction is okay. Seems like the
-return type should then be the type that was converted to. Is that
-right?
-
-:Proposed resolution:
-
-   See resolution to 9.34.
-
-9.23 Iterator_facade: minor wording Issue
-=========================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-In the table that lists the required (sort of) member functions of
-iterator types that are based on iterator_facade, the entry for
-c.equal(y) says:
-
-  true iff c and y refer to the same position. Implements c == y
-  and c != y.  The second sentence is inside out. c.equal(y) does
-  not implement either of these operations. It is used to implement
-  them. Same thing in the description of c.distance_to(z).
-
-:Proposed resolution: remove "implements" descriptions from
-   table.  See resolution to 9.34
-
-
-9.24 Use of undefined name in iterator_facade table 
-===================================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-Several of the descriptions use the name X without defining
-it. This seems to be a carryover from the table immediately above
-this section, but the text preceding that table says "In the table
-below, X is the derived iterator type." Looks like the X::
-qualifiers aren't really needed; X::reference can simply be
-reference, since that's defined by the iterator_facade
-specialization itself.
-
-:Proposed resolution: 
-
-  Remove references to X.
-
-  In [lib.iterator.facade] operations ``operator->() const;``:
-
-    Change:
-
-      :Returns: If ``X::reference`` is a reference type, an object
-        of type ``X::pointer`` equal to::
-
-          &static_cast<Derived const*>(this)->dereference()
-
-	Otherwise returns an object of unspecified type such that,
-	given an object ``a`` of type ``X``, ``a->m`` is equivalent
-	to ``(w = *a, w.m)`` for some temporary object ``w`` of type
-	``X::value_type``.
-
-        The type ``X::pointer`` is ``Value*`` if
-        ``is_writable_iterator<X>::value`` is ``true``, and
-        ``Value const*`` otherwise.
-
-    to:
-
-      :Returns: If ``reference`` is a reference type, an object
-        of type ``pointer`` equal to::
-
-          &static_cast<Derived const*>(this)->dereference()
-
-        Otherwise returns an object of unspecified type such that,
-        ``(*static_cast<Derived const*>(this))->m`` is equivalent
-        to ``(w = **static_cast<Derived const*>(this), w.m)`` for
-        some temporary object ``w`` of type ``value_type``.
-
-    Further changes are covered by issue 9.26.
-
-9.25 Iterator_facade: wrong return type 
-=======================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-Several of the member functions return a Derived object or a
-Derived&. Their Effects clauses end with::
-
-  return *this;
-
-This should be ::
-
-  return *static_cast<Derived*>(this);
-
-:Proposed resolution: 
-
-  In [lib.iterator.facade], in the effects clause
-  of the following operations::
-
-    Derived& operator++()
-    Derived& operator--()
-    Derived& operator+=(difference_type n)
-    Derived& operator-=(difference_type n)
-
-  Change:
-    ``return *this``
-
-  to:
-    ``return *static_cast<Derived*>(this);``
-
-9.26 Iterator_facade: unclear returns clause for operator[] 
-===========================================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-The returns clause for ``operator[](difference_type n)`` const
-says: 
-
-  Returns: an object convertible to X::reference and holding a copy
-  p of a+n such that, for a constant object v of type
-  X::value_type, X::reference(a[n] = v) is equivalent to p = v.
-  This needs to define 'a', but assuming it's supposed to be
-  ``*this`` (or maybe ``*(Derived*)this``), it still isn't clear
-  what this says. Presumably, the idea is that you can index off of
-  an iterator and assign to the result. But why the requirement
-  that it hold a copy of a+n? Granted, that's probably how it's
-  implemented, but it seems over-constrained. And the last phrase
-  seems wrong. p is an iterator; there's no requirement that you
-  can assign a value_type object to it. Should that be ``*p = v``?
-  But why the cast in reference(a[n] = v)?
-
-:Proposed resolution: 
-
-  In section operator[]:
- 
-    Change:
-  
-      Writable iterators built with ``iterator_facade`` implement
-      the semantics required by the preferred resolution to `issue
-      299` and adopted by proposal `n1477`: the result of ``p[n]``
-      is a proxy object containing a copy of ``p+n``, and ``p[n] =
-      x`` is equivalent to ``*(p + n) = x``.  This approach will
-      work properly for any random-access iterator regardless of
-      the other details of its implementation.  A user who knows
-      more about the implementation of her iterator is free to
-      implement an ``operator[]`` which returns an lvalue in the
-      derived iterator class; it will hide the one supplied by
-      ``iterator_facade`` from clients of her iterator.
-  
-    to:
-  
-      Writable iterators built with ``iterator_facade`` implement
-      the semantics required by the preferred resolution to `issue
-      299` and adopted by proposal `n1550`: the result of ``p[n]``
-      is an object convertible to the iterator's ``value_type``,
-      and ``p[n] = x`` is equivalent to ``*(p + n) = x`` (Note:
-      This result object may be implemented as a proxy containing a
-      copy of ``p+n``).  This approach will work properly for any
-      random-access iterator regardless of the other details of its
-      implementation.  A user who knows more about the
-      implementation of her iterator is free to implement an
-      ``operator[]`` that returns an lvalue in the derived iterator
-      class; it will hide the one supplied by ``iterator_facade``
-      from clients of her iterator.
-  
-  In [lib.iterator.facade] operations:
-
-    Change:
-  
-     :Returns: an object convertible to ``X::reference`` and
-        holding a copy *p* of ``a+n`` such that, for a constant
-        object ``v`` of type ``X::value_type``, ``X::reference(a[n]
-        = v)`` is equivalent to ``p = v``.
-  
-    to:
-  
-     :Returns: an object convertible to ``value_type``. For
-        constant objects ``v`` of type ``value_type``, and ``n`` of
-        type ``difference_type``, ``(*this)[n] = v`` is equivalent
-        to ``*(*this + n) = v``, and ``static_cast<value_type
-        const&>((*this)[n])`` is equivalent to
-        ``static_cast<value_type const&>(*(*this + n))``
-     
-
-9.27 Iterator_facade: redundant clause 
-======================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-``operator-`` has both an effects clause and a returns
-clause. Looks like the returns clause should be removed.
-
-:Proposed resolution:
-
-  Remove the returns clause.
-
-  In [lib.iterator.facade] operations:
-        
-  Remove:
-    :Returns: ``static_cast<Derived const*>(this)->advance(-n);`` 
-
-
-
-
-9.28 indirect_iterator: incorrect specification of default constructor 
-======================================================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-The default constructor returns "An instance of indirect_iterator
-with a default constructed base object", but the constructor that
-takes an Iterator object returns "An instance of indirect_iterator
-with the iterator_adaptor subobject copy constructed from x." The
-latter is the correct form, since it does not reach inside the base
-class for its semantics. So the default constructor shoudl return
-"An instance of indirect_iterator with a default-constructed
-iterator_adaptor subobject."
-
-:Proposed resolution: 
-  Change:
-     :Returns: An instance of ``indirect_iterator`` with
-        a default constructed base object.
-
-  to:
-     :Returns: An instance of ``indirect_iterator`` with
-       a default-constructed ``m_iterator``.
-
-:Rationale: Inheritance from iterator_adaptor has been removed, so we instead
-  give the semantics in terms of the (exposition only) member
-  ``m_iterator``.
-
-
-9.29 indirect_iterator: unclear specification of template constructor 
-=====================================================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-The templated constructor that takes an indirect_iterator with a
-different set of template arguments says that it returns "An
-instance of indirect_iterator that is a copy of [the argument]".
-But the type of the argument is different from the type of the
-object being constructed, and there is no description of what
-a "copy" means. The Iterator template parameter for the argument
-must be convertible to the Iterator template parameter for the type
-being constructed, which suggests that the argument's contained
-Iterator object should be converted to the target type's Iterator
-type.  Is that what's meant here?
-(Pete later writes: In fact, this problem is present in all of the
-specialized adaptors that have a constructor like this: the
-constructor returns "a copy" of the argument without saying what a
-copy is.)
-
-:Proposed resolution: 
-
-  Change:
-    :Returns: An instance of ``indirect_iterator`` that is a copy of ``y``.
-
-  to:
-    :Returns: An instance of ``indirect_iterator`` whose 
-      ``m_iterator`` subobject is constructed from ``y.base()``.
-
-
-:Rationale: Inheritance from iterator_adaptor has been removed, so we
-  instead give the semantics in terms of the member ``m_iterator``.
-
-
-9.30 transform_iterator argument irregularity 
-=============================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-The specialized adaptors that take both a Value and a Reference
-template argument all take them in that order, i.e. Value precedes
-Reference in the template argument list, with the exception of
-transform_iterator, where Reference precedes Value. This seems like
-a possible source of confusion. Is there a reason why this order is
-preferable?
-
-:Proposed resolution: NAD
-
-:Rationale: defaults for Value depend on Reference.  A sensible
-   Value can almost always be computed from Reference.  The first
-   parameter is UnaryFunction, so the argument order is already
-   different from the other adapters.
-
-
-9.31 function_output_iterator overconstrained 
-=============================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-function_output_iterator requirements says: "The UnaryFunction must
-be Assignable, Copy Constructible, and the expression f(x) must be
-valid, where f is an object of type UnaryFunction and x is an
-object of a type accepted by f."
-
-Everything starting with "and," somewhat reworded, is actually a
-constraint on output_proxy::operator=. All that's needed to create
-a function_output_iterator object is that the UnaryFunction type be
-Assignable and CopyConstructible. That's also sufficient to
-dereference and to increment such an object. It's only when you try
-to assign through a dereferenced iterator that f(x) has to work,
-and then only for the particular function object that the iterator
-holds and for the particular value that is being assigned.
-
-
-Addition from Jeremy:
-  The constructor for ``function_output_iterator`` is also
-  slightly overconstrained because it requires 
-  the ``UnaryFunction`` to have a default constructor
-  even when the default constructor of ``function_output_iterator``
-  is not used.
-
-
-:Proposed resolution: 
-
-  Change:
-    ``output_proxy operator*();``
-
-  to:
-    ``/* see below */ operator*();``
-
-  After ``function_output_iterator& operator++(int);`` add::
-
-    private:
-      UnaryFunction m_f;     // exposition only
-
-  Change:
-    The ``UnaryFunction`` must be Assignable, Copy Constructible,
-    and the expression ``f(x)`` must be valid, where ``f`` is an
-    object of type ``UnaryFunction`` and ``x`` is an object of a
-    type accepted by ``f``.  The resulting
-    ``function_output_iterator`` is a model of the Writable and
-    Incrementable Iterator concepts.
-
-  to:
-    ``UnaryFunction`` must be Assignable and Copy Constructible.  
-
-  After the requirements section, add:
-
-.. topic:: ``function_output_iterator`` models
-
-    ``function_output_iterator`` is a model of the Writable and
-    Incrementable Iterator concepts.
-
-  Change:
-    :Returns: An instance of ``function_output_iterator`` with
-      ``f`` stored as a data member.
-
-  to:
-    :Effects: Constructs an instance of ``function_output_iterator`` 
-      with ``m_f`` constructed from ``f``.
-
-  Change:
-    ``output_proxy operator*();``
-
-    :Returns: An instance of ``output_proxy`` constructed with
-      a copy of the unary function ``f``.
-
-  to:
-    ``operator*();``
-
-    :Returns: An object ``r`` of unspecified type such that ``r = t``
-      is equivalent to ``m_f(t)`` for all ``t``.
-
-  
-  Remove:
-    ``function_output_iterator::output_proxy`` operations
-
-    ``output_proxy(UnaryFunction& f);``
-
-    :Returns: An instance of ``output_proxy`` with ``f`` stored as
-        a data member.
-
-
-    ``template <class T> output_proxy& operator=(const T& value);``
-
-    :Effects: 
-      ::
-
-          m_f(value); 
-          return *this; 
-
-
-  Change::
-
-    explicit function_output_iterator(const UnaryFunction& f = UnaryFunction());
-
-  to::
-
-    explicit function_output_iterator();
-
-    explicit function_output_iterator(const UnaryFunction& f);
-
-
-
-9.32 Should output_proxy really be a named type? 
-================================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-This means someone can store an output_proxy object for later use,
-whatever that means. It also constrains output_proxy to hold a copy
-of the function object, rather than a pointer to the iterator
-object. Is all this mechanism really necessary?
-
-:Proposed resolution: See issue 9.31.
-
-
-
-9.33 istreambuf_iterator isn't a Readable Iterator 
-==================================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-c++std-lib-12333: 
-
-  N1550 requires that for a Readable Iterator a of type X, ``*a``
-  returns an object of type
-  ``iterator_traits<X>::reference``. ``istreambuf_iterator::operator*``
-  returns ``charT``, but ``istreambuf_iterator::reference`` is
-  ``charT&``. So am I overlooking something, or is
-  ``istreambuf_iterator`` not Readable.
-
-:Proposed resolution: Remove all constraints on
-  ``iterator_traits<X>::reference`` in Readable Iterator and Lvalue
-  Iterator. Change Lvalue Iterator to refer to ``T&`` instead of
-  ``iterator_traits<X>::reference``.
-
-  Change:
-    A class or built-in type ``X`` models the *Readable Iterator*
-    concept for the value type ``T`` if the following expressions
-    are valid and respect the stated semantics. ``U`` is the type
-    of any specified member of type ``T``.
-
-  to:
-    A class or built-in type ``X`` models the *Readable Iterator*
-    concept for value type ``T`` if, in addition to ``X`` being
-    Assignable and Copy Constructible, the following expressions
-    are valid and respect the stated semantics. ``U`` is the type
-    of any specified member of type ``T``.
-
-  From the Input Iterator Requirements table, remove:
-
-    +-----------------------------------+-----------------------------------+-------------------------+
-    |``iterator_traits<X>::reference``  |Convertible to                     |                         |
-    |                                   |``iterator_traits<X>::value_type`` |                         |
-    +-----------------------------------+-----------------------------------+-------------------------+
-
-  Change:
-
-    +-----------------------------------+-----------------------------------+-------------------------+
-    |``*a``                             |``iterator_traits<X>::reference``  |pre: ``a`` is            |
-    |                                   |                                   |dereferenceable. If ``a  |
-    |                                   |                                   |== b`` then ``*a`` is    |
-    |                                   |                                   |equivalent to ``*b``     |
-    +-----------------------------------+-----------------------------------+-------------------------+
-
-  to:
-
-    +-----------------------------------+------------------------+----------------------------------------------------------------+
-    |``*a``                             | Convertible to ``T``   |pre: ``a`` is dereferenceable. If ``a == b`` then ``*a``        |
-    |                                   |                        | is equivalent to ``*b``.                                       |
-    +-----------------------------------+------------------------+----------------------------------------------------------------+
-
-  Change:
-    The *Lvalue Iterator* concept adds the requirement that the
-    ``reference`` type be a reference to the value type of the
-    iterator.
-
-  to:
-    The *Lvalue Iterator* concept adds the requirement that the
-    return type of ``operator*`` type be a reference to the value
-    type of the iterator.
-
-  Change:
-
-    +---------------------------------------------------------------------------------+
-    | Lvalue Iterator Requirements                                                    |
-    +---------------------------------+-----------+-----------------------------------+
-    |Expression                       |Return Type|Assertion                          |
-    +=================================+===========+===================================+
-    |``iterator_traits<X>::reference``|``T&``     |``T`` is *cv*                      |
-    |                                 |           |``iterator_traits<X>::value_type`` |
-    |                                 |           |where *cv* is an optional          |
-    |                                 |           |cv-qualification                   |
-    +---------------------------------+-----------+-----------------------------------+
-
-  to:
-
-    +-------------------------------------------------------------+
-    | Lvalue Iterator Requirements                                |
-    +-------------+-----------+-----------------------------------+
-    |Expression   |Return Type|Note/Assertion                     |
-    +=============+===========+===================================+
-    |``*a``       | ``T&``    |``T`` is *cv*                      |
-    |             |           |``iterator_traits<X>::value_type`` |
-    |             |           |where *cv* is an optional          |
-    |             |           |cv-qualification.                  |
-    |             |           |pre: ``a`` is                      |
-    |             |           |dereferenceable. If ``a            |
-    |             |           |== b`` then ``*a`` is              |
-    |             |           |equivalent to ``*b``.              |
-    +-------------+-----------+-----------------------------------+
-
-
-  At the end of the section reverse_iterator models, add:
-  The type ``iterator_traits<Iterator>::reference`` must be the type of
-  ``*i``, where ``i`` is an object of type ``Iterator``.
-
-
-:Rationale: Ideally there should be requirements on the reference
-  type, however, since Readable Iterator is suppose to correspond
-  to the current standard iterator requirements (which do not place
-  requirements on the reference type) we will leave them off for
-  now.  There is a DR in process with respect to the reference type
-  in the stadard iterator requirements. Once that is resolved we
-  will revisit this issue for Readable Iterator and Lvalue
-  Iterator.
-
-  We added Assignable to the requirements for Readable
-  Iterator. This is needed to have Readable Iterator coincide with
-  the capabilities of Input Iterator.
-
-
-9.34 iterator_facade free functions unspecified
-===============================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-c++std-lib-12562:
-
-  The template functions ``operator==``, ``operator!=``,
-  ``operator<``, ``operator<=``, ``operator>``, ``operator>=``, and
-  ``operator-`` that take two arguments that are specializations of
-  iterator_facade have no specification. The template function
-  operator+ that takes an argument that is a specialization of
-  iterator_facade and an argument of type difference_type has no
-  specification.
-
-:Proposed resolution: 
-  Add the missing specifications.
-
-  ::
-
-    template <class Dr, class V, class TC, class R, class D>
-    Derived operator+ (iterator_facade<Dr,V,TC,R,D> const&,
-                       typename Derived::difference_type n);
-
-    template <class Dr, class V, class TC, class R, class D>
-    Derived operator+ (typename Derived::difference_type n,
-                       iterator_facade<Dr,V,TC,R,D> const&);
-
-  :Effects:
-    ::
-
-      Derived tmp(static_cast<Derived const*>(this));
-      return tmp += n;
-
-
-  ::
-
-    template <class Dr1, class V1, class TC1, class R1, class D1,
-              class Dr2, class V2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1,Dr2,bool>::type
-    operator ==(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
-                iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs);
-
-  :Returns: if ``is_convertible<Dr2,Dr1>::value``, then
-    ``lhs.equal(rhs)``.  Otherwise, ``rhs.equal(lhs)``.
-
-  ::
-
-    template <class Dr1, class V1, class TC1, class R1, class D1,
-              class Dr2, class V2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1,Dr2,bool>::type
-    operator !=(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
-                iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs);
-
-  :Returns: if ``is_convertible<Dr2,Dr1>::value``, then
-    ``!lhs.equal(rhs)``.  Otherwise, ``!rhs.equal(lhs)``.
-
-  ::
-
-    template <class Dr1, class V1, class TC1, class R1, class D1,
-              class Dr2, class V2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1,Dr2,bool>::type
-    operator <(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
-               iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs);
-
-  :Returns: if ``is_convertible<Dr2,Dr1>::value``, then
-    ``lhs.distance_to(rhs) < 0``. Otherwise, ``rhs.distance_to(lhs) >
-    0``.
-
-  ::
-
-    template <class Dr1, class V1, class TC1, class R1, class D1,
-              class Dr2, class V2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1,Dr2,bool>::type
-    operator <=(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
-                iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs);
-
-  :Returns: if ``is_convertible<Dr2,Dr1>::value``, then
-    ``lhs.distance_to(rhs) <= 0``. Otherwise, ``rhs.distance_to(lhs)
-    >= 0``.
-
-  ::
-
-    template <class Dr1, class V1, class TC1, class R1, class D1,
-              class Dr2, class V2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1,Dr2,bool>::type
-    operator >(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
-               iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs);
-
-  :Returns: if ``is_convertible<Dr2,Dr1>::value``, then
-    ``lhs.distance_to(rhs) > 0``. Otherwise,
-    ``rhs.distance_to(lhs) < 0``.
-
-
-  ::
-
-    template <class Dr1, class V1, class TC1, class R1, class D1,
-              class Dr2, class V2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1,Dr2,bool>::type
-    operator >=(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
-                iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs);
-
-  :Returns: if ``is_convertible<Dr2,Dr1>::value``, then
-    ``lhs.distance_to(rhs) >= 0``. Otherwise,
-    ``rhs.distance_to(lhs) <= 0``.
-
-  ::
-
-    template <class Dr1, class V1, class TC1, class R1, class D1,
-              class Dr2, class V2, class TC2, class R2, class D2>
-    typename enable_if_interoperable<Dr1,Dr2,difference>::type
-    operator -(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
-               iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs);
-
-  :Return Type: if ``is_convertible<Dr2,Dr1>::value``, then
-    ``difference`` shall be
-    ``iterator_traits<Dr1>::difference_type``.  Otherwise,
-    ``difference`` shall be
-    ``iterator_traits<Dr2>::difference_type``.
-
-  :Returns: if ``is_convertible<Dr2,Dr1>::value``, then
-    ``-lhs.distance_to(rhs)``. Otherwise,
-    ``rhs.distance_to(lhs)``.
-
-
-
-9.35 iterator_facade: too many equals? 
-======================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-c++std-lib-12563:
-
-  The table listing the functions required for types derived from
-  iterator_facade has two functions named equal and two named
-  distance_to::
-
-    c.equal(b)
-    c.equal(y)
-    c.distance_to(b)
-    c.distance_to(z)
-
-  where b and c are const objects of the derived type, y and z are
-  constant objects of certain iterator types that are interoperable
-  with the derived type.  Seems like the 'b' versions are
-  redundant: in both cases, the other version will take a 'b'. In
-  fact, iterator_adaptor is specified to use iterator_facade, but
-  does not provide the 'b' versions of these functions.
-
-  Are the 'b' versions needed? 
-
-:Proposed resolution:  Remove the 'b' versions.
-
-  In ``iterator_facade`` requirements, remove:
-
-    +--------------------+-------------------+-------------------------------------+---------------------------+
-    |``c.equal(b)``      |convertible to bool|true iff ``b`` and ``c`` are         |Single Pass Iterator       |
-    |                    |                   |equivalent.                          |                           |
-    +--------------------+-------------------+-------------------------------------+---------------------------+
-
-  and remove:
-
-    +--------------------+-------------------+-------------------------------------+---------------------------+
-    |``c.distance_to(b)``|convertible to     |equivalent to ``distance(c, b)``     |Random Access Traversal    |
-    |                    |X::difference_type |                                     |Iterator                   |
-    +--------------------+-------------------+-------------------------------------+---------------------------+
-
-
-9.36 iterator_facade function requirements 
-==========================================
-
-:Submitter: Pete Becker 
-:Status: New 
-
-c++std-lib-12636:
-
-  The table that lists required functions for the derived type X
-  passed to iterator_facade lists, among others:
-
-  for a single pass iterator::
-
-    c.equal(b)
-    c.equal(y)
-
-  where b and c are const X objects, and y is a const object of a
-  single pass iterator that is interoperable with X. Since X is
-  interoperable with itself, c.equal(b) is redundant. There is a
-  difference in their descriptions, but its meaning isn't
-  clear. The first is "true iff b and c are equivalent", and the
-  second is "true iff c and y refer to the same position." Is there
-  a difference between the undefined term "equivalent" and "refer
-  to the same position"?
-
-  Similarly, for a random access traversal iterator::
-
-    c.distance_to(b)
-    c.distance_to(z)
-
-  where z is a constant object of a random access traversal
-  iterator that is interoperable with X.  Again, X is interoperable
-  with itself, so c.distance_to(b) is redundant.  Also, the
-  specification for c.distance_to(z) isn't valid. It's written
-  as "equivalent to distance(c, z)". The template function distance
-  takes two arguments of the same type, so distance(c, z) isn't
-  valid if c and z are different types. Should it be
-  distance(c, (X)z)?
-
-:Proposed resolution:   Removed the 'b' versions (see 9.35) and added the cast.
-
-  Change:
-
-    +--------------------+-------------------+-------------------------------------+---------------------------+
-    |``c.distance_to(z)``|convertible to     |equivalent to ``distance(c, z)``.    |Random Access Traversal    |
-    |                    |X::difference_type |Implements ``c - z``, ``c < z``, ``c |Iterator                   |
-    |                    |                   |<= z``, ``c > z``, and ``c >= c``.   |                           |
-    +--------------------+-------------------+-------------------------------------+---------------------------+
-
-  to:
-
-    +--------------------+----------------------+-------------------------+---------------------------+
-    |``c.distance_to(z)``|convertible to        |equivalent to            |Random Access Traversal    |
-    |                    |``F::difference_type``|``distance(c, X(z))``.   |Iterator                   |
-    +--------------------+----------------------+-------------------------+---------------------------+
-
-
-
-====================================
- More Issues (not from Matt's list)
-====================================
-
-
-
-9.37x Inheritance in iterator_adaptor and other adaptors is an overspecification
-================================================================================
-
-:Submitter: Pete Becker
-:Status: New 
-
-c++std-lib-12696:
-The paper requires that iterator_adaptor be derived from an
-appropriate instance of iterator_facade, and that most of the specific
-forms of adaptors be derived from appropriate instances of
-iterator_adaptor. That seems like overspecification, and we ought to
-look at specifying these things in terms of what the various templates
-provide rather than how they're implemented.
-
-:Proposed resolution:
-
-  Remove the specfication of inheritance, and add explicit
-  specification of all the functionality that was inherited from the
-  specialized iterators. 
-
-  In iterator_adaptor, inheritance is retained, sorry NAD.  Also,
-  the Interoperable Iterators concept is added to the new iterator
-  concepts, and this concept is used in the specification of the
-  iterator adaptors.
-
-
-  In n1550, after [lib.random.access.traversal.iterators], add:
-
-    Interoperable Iterators [lib.interoperable.iterators]
-
-    A class or built-in type ``X`` that models Single Pass Iterator
-    is *interoperable with* a class or built-in type ``Y`` that
-    also models Single Pass Iterator if the following expressions
-    are valid and respect the stated semantics. In the tables
-    below, ``x`` is an object of type ``X``, ``y`` is an object of
-    type ``Y``, ``Distance`` is
-    ``iterator_traits<Y>::difference_type``, and ``n`` represents a
-    constant object of type ``Distance``.
-
-    +-----------+-----------------------+---------------------------------------------------+
-    |Expression |Return Type            |Assertion/Precondition/Postcondition               |
-    +===========+=======================+===================================================+
-    |``y = x``  |``Y``                  |post: ``y == x``                                   |
-    +-----------+-----------------------+---------------------------------------------------+
-    |``Y(x)``   |``Y``                  |post: ``Y(x) == x``                                |
-    +-----------+-----------------------+---------------------------------------------------+
-    |``x == y`` |convertible to ``bool``|``==`` is an equivalence relation over its domain. |
-    +-----------+-----------------------+---------------------------------------------------+
-    |``y == x`` |convertible to ``bool``|``==`` is an equivalence relation over its domain. |
-    +-----------+-----------------------+---------------------------------------------------+
-    |``x != y`` |convertible to ``bool``|``bool(a==b) != bool(a!=b)`` over its domain.      |
-    +-----------+-----------------------+---------------------------------------------------+
-    |``y != x`` |convertible to ``bool``|``bool(a==b) != bool(a!=b)`` over its domain.      |
-    +-----------+-----------------------+---------------------------------------------------+
-
-    If ``X`` and ``Y`` both model Random Access Traversal Iterator then
-    the following additional requirements must be met.
-
-    +-----------+-----------------------+---------------------+--------------------------------------+
-    |Expression |Return Type            |Operational Semantics|Assertion/ Precondition               |
-    +===========+=======================+=====================+======================================+
-    |``x < y``  |convertible to ``bool``|``y - x > 0``        |``<`` is a total ordering relation    |
-    +-----------+-----------------------+---------------------+--------------------------------------+
-    |``y < x``  |convertible to ``bool``|``x - y > 0``        |``<`` is a total ordering relation    |
-    +-----------+-----------------------+---------------------+--------------------------------------+
-    |``x > y``  |convertible to ``bool``|``y < x``            |``>`` is a total ordering relation    |
-    +-----------+-----------------------+---------------------+--------------------------------------+
-    |``y > x``  |convertible to ``bool``|``x < y``            |``>`` is a total ordering relation    |
-    +-----------+-----------------------+---------------------+--------------------------------------+
-    |``x >= y`` |convertible to ``bool``|``!(x < y)``         |                                      |
-    +-----------+-----------------------+---------------------+--------------------------------------+
-    |``y >= x`` |convertible to ``bool``|``!(y < x)``         |                                      |
-    +-----------+-----------------------+---------------------+--------------------------------------+
-    |``x <= y`` |convertible to ``bool``|``!(x > y)``         |                                      |
-    +-----------+-----------------------+---------------------+--------------------------------------+
-    |``y <= x`` |convertible to ``bool``|``!(y > x)``         |                                      |
-    +-----------+-----------------------+---------------------+--------------------------------------+
-    |``y - x``  |``Distance``           |``distance(Y(x),y)`` |pre: there exists a value ``n`` of    |
-    |           |                       |                     |``Distance`` such that ``x + n == y``.|
-    |           |                       |                     |``y == x + (y - x)``.                 |
-    +-----------+-----------------------+---------------------+--------------------------------------+ 
-    |``x - y``  |``Distance``           |``distance(y,Y(x))`` |pre: there exists a value ``n`` of    |
-    |           |                       |                     |``Distance`` such that ``y + n == x``.|
-    |           |                       |                     |``x == y + (x - y)``.                 |
-    +-----------+-----------------------+---------------------+--------------------------------------+
-
-
-
-  In N1530:
-
-    In [lib.iterator.adaptor]
-
-    Change::
-
-       class iterator_adaptor 
-         : public iterator_facade<Derived, /* see details ...*/>
-
-    To::
-
-       class iterator_adaptor 
-         : public iterator_facade<Derived, *V'*, *C'*, *R'*, *D'*> // see details
-      
-
-    Change the text from:
-       The ``Base`` type must implement the expressions involving
-       ``m_iterator`` in the specifications...
-
-    until the end of the **iterator_adaptor requirements** section, to:
-       The ``Base`` argument shall be Assignable and Copy Constructible.
-
-
-    Add:
-
-.. topic:: ``iterator_adaptor`` base class parameters
-
-      The *V'*, *C'*, *R'*, and *D'* parameters of the ``iterator_facade``
-      used as a base class in the summary of ``iterator_adaptor``
-      above are defined as follows:
-
-      .. parsed-literal::
-
-         *V'* = if (Value is use_default)
-                   return iterator_traits<Base>::value_type
-               else
-                   return Value
-
-         *C'* = if (CategoryOrTraversal is use_default)
-                   return iterator_traversal<Base>::type
-               else
-                   return CategoryOrTraversal
-
-         *R'* = if (Reference is use_default)
-                   if (Value is use_default)
-                       return iterator_traits<Base>::reference
-                   else
-                       return Value&
-               else
-                   return Reference
-
-         *D'* = if (Difference is use_default)
-                   return iterator_traits<Base>::difference_type
-               else
-                   return Difference
-
-
-    In [lib.iterator.special.adaptors]
-
-    Change::
-
-      class indirect_iterator
-        : public iterator_adaptor</* see discussion */>
-      {
-          friend class iterator_core_access;
-
-    to::
-
-      class indirect_iterator
-      {
-       public:
-          typedef /* see below */ value_type;
-          typedef /* see below */ reference;
-          typedef /* see below */ pointer;
-          typedef /* see below */ difference_type;
-          typedef /* see below */ iterator_category;
-
-    Change::
-
-      private: // as-if specification
-          typename indirect_iterator::reference dereference() const
-          {
-              return **this->base();
-          }
-
-    to::
-
-          Iterator const& base() const;
-          reference operator*() const;
-          indirect_iterator& operator++();
-          indirect_iterator& operator--();
-      private:
-         Iterator m_iterator; // exposition
-
-
-    After the synopsis add:
-
-      The member types of ``indirect_iterator`` are defined
-      according to the following pseudo-code, where ``V`` is
-      ``iterator_traits<Iterator>::value_type``
-
-      .. parsed-literal::
-
-        if (Value is use_default) then
-            typedef remove_const<pointee<V>::type>::type value_type;
-        else
-            typedef remove_const<Value>::type value_type;
-
-        if (Reference is use_default) then
-            if (Value is use_default) then
-                typedef indirect_reference<V>::type reference;
-            else
-                typedef Value& reference;
-        else
-            typedef Reference reference;
-
-        if (Value is use_default) then 
-            typedef pointee<V>::type\* pointer;
-        else 
-            typedef Value\* pointer;
-
-        if (Difference is use_default)
-            typedef iterator_traits<Iterator>::difference_type difference_type;
-        else
-            typedef Difference difference_type;
-
-        if (CategoryOrTraversal is use_default)
-            typedef |iterator-category|\ (
-                iterator_traversal<Iterator>::type,``reference``,``value_type``
-            ) iterator_category;
-        else
-            typedef |iterator-category|\ (
-                CategoryOrTraversal,``reference``,``value_type``
-            ) iterator_category;
-
-
-    [Note: See resolution to 9.44y for a description of ``pointee`` and
-    ``indirect_reference``]
-
-    After the requirements section, add:
-
-.. topic:: ``indirect_iterator`` models
-
-
-      In addition to the concepts indicated by ``iterator_category``
-      and by ``iterator_traversal<indirect_iterator>::type``, a
-      specialization of ``indirect_iterator`` models the following
-      concepts, Where ``v`` is an object of
-      ``iterator_traits<Iterator>::value_type``:
-
-        * Readable Iterator if ``reference(*v)`` is convertible to
-          ``value_type``.
-
-        * Writable Iterator if ``reference(*v) = t`` is a valid
-          expression (where ``t`` is an object of type
-          ``indirect_iterator::value_type``)
-
-        * Lvalue Iterator if ``reference`` is a reference type.
-
-      ``indirect_iterator<X,V1,C1,R1,D1>`` is interoperable with
-      ``indirect_iterator<Y,V2,C2,R2,D2>`` if and only if ``X`` is
-      interoperable with ``Y``.
-
-
-    Before ``indirect_iterator();`` add:
-
-      In addition to the operations required by the concepts described
-      above, specializations of ``indirect_iterator`` provide the
-      following operations.
-
-    Change:
-      :Returns: An instance of ``indirect_iterator`` with
-        the ``iterator_adaptor`` subobject copy constructed from ``x``.
-
-    to:
-      :Returns: An instance of ``indirect_iterator`` with
-        ``m_iterator`` copy constructed from ``x``.
-
-
-    At the end of the indirect_iterator operations add:
-
-      ``Iterator const& base() const;``
-
-      :Returns: ``m_iterator``
-
-
-      ``reference operator*() const;``
-
-      :Returns:  ``**m_iterator``
-
-
-      ``indirect_iterator& operator++();``
-
-      :Effects: ``++m_iterator``
-      :Returns: ``*this``
-
-
-      ``indirect_iterator& operator--();``
-
-      :Effects: ``--m_iterator``
-      :Returns: ``*this``
-
-
-
-    Change::
-
-      template <class Iterator>
-      class reverse_iterator :
-        public iterator_adaptor< reverse_iterator<Iterator>, Iterator >
-      {
-        friend class iterator_core_access;
-
-    to::
-
-      template <class Iterator>
-      class reverse_iterator
-      {
-      public:
-        typedef iterator_traits<Iterator>::value_type value_type;
-        typedef iterator_traits<Iterator>::reference reference;
-        typedef iterator_traits<Iterator>::pointer pointer;
-        typedef iterator_traits<Iterator>::difference_type difference_type;
-        typedef /* see below */ iterator_category;
-
-    Change::
-
-      private: // as-if specification
-        typename reverse_iterator::reference dereference() const { return *prior(this->base()); }
-
-        void increment() { --this->base_reference(); }
-        void decrement() { ++this->base_reference(); }
-
-        void advance(typename reverse_iterator::difference_type n)
-        {
-            this->base_reference() += -n;
-        }
-
-        template <class OtherIterator>
-        typename reverse_iterator::difference_type
-        distance_to(reverse_iterator<OtherIterator> const& y) const
-        {
-            return this->base_reference() - y.base();
-        }
-
-    to::
-
-        Iterator const& base() const;
-        reference operator*() const;
-        reverse_iterator& operator++();
-        reverse_iterator& operator--();
-      private:
-        Iterator m_iterator; // exposition
-
-    After the synopsis for ``reverse_iterator``, add:
-      If ``Iterator`` models Random Access Traversal Iterator and Readable
-      Lvalue Iterator, then ``iterator_category`` is convertible to
-      ``random_access_iterator_tag``. Otherwise, if
-      ``Iterator`` models Bidirectional Traversal Iterator and Readable
-      Lvalue Iterator, then ``iterator_category`` is convertible to
-      ``bidirectional_iterator_tag``. Otherwise, ``iterator_category`` is
-      convertible to ``input_iterator_tag``.
-
-
-    Change:
-      **reverse_iterator requirements**
-
-      The base ``Iterator`` must be a model of Bidirectional Traversal
-      Iterator. The resulting ``reverse_iterator`` will be a model of the
-      most refined standard traversal and access concepts that are modeled
-      by ``Iterator``.
-
-
-    to:
-      **reverse_iterator requirements**
-
-      ``Iterator`` must be a model of Bidirectional Traversal Iterator.
-
-
-.. topic:: ``reverse_iterator`` models
-
-      A specialization of ``reverse_iterator`` models the same iterator
-      traversal and iterator access concepts modeled by its ``Iterator``
-      argument.  In addition, it may model old iterator concepts
-      specified in the following table:
-
-      +---------------------------------------+-----------------------------------+
-      | If ``I`` models                       |then ``reverse_iterator<I>`` models|
-      +=======================================+===================================+
-      | Readable Lvalue Iterator,             | Bidirectional Iterator            |
-      | Bidirectional Traversal Iterator      |                                   |
-      +---------------------------------------+-----------------------------------+
-      | Writable Lvalue Iterator,             | Mutable Bidirectional Iterator    |
-      | Bidirectional Traversal Iterator      |                                   |
-      +---------------------------------------+-----------------------------------+
-      | Readable Lvalue Iterator,             | Random Access Iterator            |
-      | Random Access Traversal Iterator      |                                   |
-      +---------------------------------------+-----------------------------------+
-      | Writable Lvalue Iterator,             | Mutable Random Access Iterator    |
-      | Random Access Traversal Iterator      |                                   |
-      +---------------------------------------+-----------------------------------+
-
-
-      ``reverse_iterator<X>`` is interoperable with
-      ``reverse_iterator<Y>`` if and only if ``X`` is interoperable with
-      ``Y``.
-
-    Change:
-      :Returns: An instance of ``reverse_iterator`` with a
-        default constructed base object.
-
-    to:
-      :Effects: Constructs an instance of ``reverse_iterator`` with ``m_iterator`` 
-        default constructed.
-
-    Change:
-      :Effects: Constructs an instance of ``reverse_iterator`` with a
-        base object copy constructed from ``x``.
-
-    to:
-      :Effects: Constructs an instance of ``reverse_iterator`` with a
-        ``m_iterator`` constructed from ``x``.
-
-
-    Change:
-      :Returns: An instance of ``reverse_iterator`` that is a copy of ``r``.
-
-    to:
-      :Effects: Constructs instance of ``reverse_iterator`` whose 
-        ``m_iterator`` subobject is constructed from ``y.base()``.    
-
-
-
-    At the end of the operations for ``reverse_iterator``, add:
-      ``Iterator const& base() const;``
-
-      :Returns: ``m_iterator``
-
-
-      ``reference operator*() const;``
-
-      :Effects: 
-
-      ::
-
-          Iterator tmp = m_iterator;
-          return *--tmp;
-
-
-      ``reverse_iterator& operator++();``
-
-      :Effects: ``--m_iterator``
-      :Returns: ``*this``
-
-
-      ``reverse_iterator& operator--();``
-
-      :Effects: ``++m_iterator``
-      :Returns: ``*this``
-
-
-
-    Change::
-
-      class transform_iterator
-        : public iterator_adaptor</* see discussion */>
-      {
-        friend class iterator_core_access;
-
-    to::
-
-      class transform_iterator
-      {
-      public:
-        typedef /* see below */ value_type;
-        typedef /* see below */ reference;
-        typedef /* see below */ pointer;
-        typedef iterator_traits<Iterator>::difference_type difference_type;
-        typedef /* see below */ iterator_category;
-
-
-    After ``UnaryFunction functor() const;`` add::
-
-       Iterator const& base() const;
-       reference operator*() const;
-       transform_iterator& operator++();
-       transform_iterator& operator--();
-
-    Change::
-
-       private:
-         typename transform_iterator::value_type dereference() const;
-         UnaryFunction m_f;
-       };
-
-    to::
-
-       private:
-         Iterator m_iterator; // exposition only
-         UnaryFunction m_f;   // exposition only
-       };
-
-
-    After the synopsis, add:
-      If ``Iterator`` models Readable Lvalue Iterator and if ``Iterator``
-      models Random Access Traversal Iterator, then ``iterator_category`` is
-      convertible to ``random_access_iterator_tag``. Otherwise, if
-      ``Iterator`` models Bidirectional Traversal Iterator, then
-      ``iterator_category`` is convertible to
-      ``bidirectional_iterator_tag``.  Otherwise ``iterator_category`` is
-      convertible to ``forward_iterator_tag``. If ``Iterator`` does not
-      model Readable Lvalue Iterator then ``iterator_category`` is
-      convertible to ``input_iterator_tag``.
-
-
-    In the requirements section, change:
-      The type ``Iterator`` must at least model Readable Iterator.  The
-      resulting ``transform_iterator`` models the most refined of the
-      following that is also modeled by ``Iterator``.
-
-        * Writable Lvalue Iterator if
-          ``result_of<UnaryFunction(iterator_traits<Iterator>::reference)>::type``
-          is a non-const reference.
-
-        * Readable Lvalue Iterator if
-          ``result_of<UnaryFunction(iterator_traits<Iterator>::reference)>::type``
-          is a const reference.
-
-        * Readable Iterator otherwise.
-
-
-      The ``transform_iterator`` models the most refined standard traversal
-      concept that is modeled by ``Iterator``.
-
-      The ``reference`` type of ``transform_iterator`` is
-      ``result_of<UnaryFunction(iterator_traits<Iterator>::reference)>::type``.
-      The ``value_type`` is ``remove_cv<remove_reference<reference> >::type``.
-
-    to:
-      The argument ``Iterator`` shall model Readable Iterator.
-
-
-    After the requirements section, add:
-
-.. topic:: ``transform_iterator`` models
-
-      The resulting ``transform_iterator`` models the most refined of the
-      following options that is also modeled by ``Iterator``.
-
-        * Writable Lvalue Iterator if
-          ``transform_iterator::reference`` is a non-const
-          reference.
-
-        * Readable Lvalue Iterator if
-          ``transform_iterator::reference`` is a const reference.
-
-        * Readable Iterator otherwise.
-
-      The ``transform_iterator`` models the most refined standard traversal
-      concept that is modeled by the ``Iterator`` argument.
-
-      If ``transform_iterator`` is a model of Readable Lvalue Iterator then
-      it models the following original iterator concepts depending on what
-      the ``Iterator`` argument models.
-
-      +-----------------------------------+-----------------------------------+
-      | If ``Iterator`` models            |then ``transform_iterator`` models |
-      +===================================+===================================+
-      | Single Pass Iterator              | Input Iterator                    |
-      +-----------------------------------+-----------------------------------+
-      | Forward Traversal Iterator        | Forward Iterator                  |
-      +-----------------------------------+-----------------------------------+
-      | Bidirectional Traversal Iterator  | Bidirectional Iterator            |
-      +-----------------------------------+-----------------------------------+
-      | Random Access Traversal Iterator  | Random Access Iterator            |
-      +-----------------------------------+-----------------------------------+
-
-      If ``transform_iterator`` models Writable Lvalue Iterator then it is a
-      mutable iterator (as defined in the old iterator requirements).
-
-      ``transform_iterator<F1, X, R1, V1>`` is interoperable with
-      ``transform_iterator<F2, Y, R2, V2>`` if and only if ``X`` is
-      interoperable with ``Y``.
-
-
-    Remove the private operations section heading and remove::
-
-      ``typename transform_iterator::value_type dereference() const;``
-
-      :Returns: ``m_f(transform_iterator::dereference());``
-
-    After the entry for ``functor()``, add::
-
-      ``Iterator const& base() const;``
-
-      :Returns: ``m_iterator``
-
-
-      ``reference operator*() const;``
-
-      :Returns: ``m_f(*m_iterator)``
-
-
-      ``transform_iterator& operator++();``
-
-      :Effects: ``++m_iterator``
-      :Returns: ``*this``
-
-
-      ``transform_iterator& operator--();``
-
-      :Effects: ``--m_iterator``
-      :Returns: ``*this``
-
-
-    Change::
-
-      template <class Predicate, class Iterator>
-      class filter_iterator
-         : public iterator_adaptor<
-               filter_iterator<Predicate, Iterator>, Iterator
-             , use_default
-             , /* see details */
-           >
-      {
-       public:
-
-    to::
-
-      template <class Predicate, class Iterator>
-      class filter_iterator
-      {
-       public:
-         typedef iterator_traits<Iterator>::value_type value_type;
-         typedef iterator_traits<Iterator>::reference reference;
-         typedef iterator_traits<Iterator>::pointer pointer;
-         typedef iterator_traits<Iterator>::difference_type difference_type;
-         typedef /* see below */ iterator_category;
-
-    Change::
-
-      private: // as-if specification
-         void increment()
-         {
-             ++(this->base_reference());
-             satisfy_predicate();
-         }
-
-         void satisfy_predicate()
-         {
-             while (this->base() != this->m_end && !this->m_predicate(*this->base()))
-                 ++(this->base_reference());
-         }
-
-         Predicate m_predicate;
-         Iterator m_end;
-
-    to::
-
-         Iterator const& base() const;
-         reference operator*() const;
-         filter_iterator& operator++();
-     private:
-         Predicate m_pred; // exposition only
-         Iterator m_iter;  // exposition only
-         Iterator m_end;   // exposition only
-
-
-
-    Change:
-      The base ``Iterator`` parameter must be a model of Readable
-      Iterator and Single Pass Iterator. The resulting
-      ``filter_iterator`` will be a model of Forward Traversal Iterator
-      if ``Iterator`` is, otherwise the ``filter_iterator`` will be a
-      model of Single Pass Iterator. The access category of the
-      ``filter_iterator`` will be the same as the access category of
-      ``Iterator``.
-
-    to:
-      The ``Iterator`` argument shall meet the requirements of Readable
-      Iterator and Single Pass Iterator or it shall meet the requirements of
-      Input Iterator.
-
-    After the requirements section, add:
-
-.. topic:: ``filter_iterator`` models
-
-      The concepts that ``filter_iterator`` models are dependent on which
-      concepts the ``Iterator`` argument models, as specified in the
-      following tables.
-
-      +-----------------------------+----------------------------------------------------------+
-      | If ``Iterator`` models      | then ``filter_iterator`` models                          |
-      +=============================+==========================================================+
-      | Single Pass Iterator        | Single Pass Iterator                                     |
-      +-----------------------------+----------------------------------------------------------+
-      | Forward Traversal Iterator  | Forward Traversal Iterator                               |
-      +-----------------------------+----------------------------------------------------------+
-
-      +--------------------------------+----------------------------------------------+
-      | If ``Iterator`` models         | then ``filter_iterator`` models              |
-      +================================+==============================================+
-      | Readable Iterator              | Readable Iterator                            |
-      +--------------------------------+----------------------------------------------+
-      | Writable Iterator              | Writable Iterator                            |
-      +--------------------------------+----------------------------------------------+
-      | Lvalue Iterator                | Lvalue Iterator                              |
-      +--------------------------------+----------------------------------------------+
-
-      +-------------------------------------------------------+---------------------------------+
-      | If ``Iterator`` models                                | then ``filter_iterator`` models |
-      +=======================================================+=================================+
-      | Readable Iterator, Single Pass Iterator               | Input Iterator                  |
-      +-------------------------------------------------------+---------------------------------+
-      | Readable Lvalue Iterator, Forward Traversal Iterator  | Forward Iterator                |
-      +-------------------------------------------------------+---------------------------------+
-      | Writable Lvalue Iterator, Forward Traversal Iterator  | Mutable Forward Iterator        |
-      +-------------------------------------------------------+---------------------------------+
-
-
-      ``filter_iterator<P1, X>`` is interoperable with ``filter_iterator<P2, Y>`` 
-      if and only if ``X`` is interoperable with ``Y``.
-
-
-    Change:
-      :Returns: a ``filter_iterator`` whose
-          predicate is a default constructed ``Predicate`` and
-          whose ``end`` is a default constructed ``Iterator``.
-
-    to:
-      :Effects: Constructs a ``filter_iterator`` whose``m_pred``,  ``m_iter``, and ``m_end`` 
-        members are a default constructed.
-
-    Change:
-      :Returns: A ``filter_iterator`` at position ``x`` that filters according
-          to predicate ``f`` and that will not increment past ``end``.
-
-    to:
-      :Effects: Constructs a ``filter_iterator`` where ``m_iter`` is either
-          the first position in the range ``[x,end)`` such that ``f(*m_iter) == true`` 
-          or else``m_iter == end``. The member ``m_pred`` is constructed from
-          ``f`` and ``m_end`` from ``end``.
-
-    Change:
-      :Returns: A ``filter_iterator`` at position ``x`` that filters 
-          according to a default constructed ``Predicate``
-          and that will not increment past ``end``.
-
-    to:
-      :Effects: Constructs a ``filter_iterator`` where ``m_iter`` is either
-          the first position in the range ``[x,end)`` such that ``m_pred(*m_iter) == true`` 
-          or else``m_iter == end``. The member ``m_pred`` is default constructed.
-
-
-    Change:
-      :Returns: A copy of iterator ``t``. 
-
-    to:
-      :Effects: Constructs a filter iterator whose members are copied from ``t``.
-
-    Change:
-      :Returns: A copy of the predicate object used to construct ``*this``.
-
-    to:
-      :Returns: ``m_pred``
-
-    Change:
-      :Returns: The object ``end`` used to construct ``*this``.
-
-    to:
-      :Returns: ``m_end``
-
-    At the end of the operations section, add:
-
-      ``reference operator*() const;``
-
-      :Returns: ``*m_iter``
-
-
-      ``filter_iterator& operator++();``
-
-      :Effects: Increments ``m_iter`` and then continues to
-        increment ``m_iter`` until either ``m_iter == m_end``
-        or ``m_pred(*m_iter) == true``.
-      :Returns: ``*this``  
-
-
-    Change::
-
-      class counting_iterator
-        : public iterator_adaptor<
-              counting_iterator<Incrementable, Access, Traversal, Difference>
-            , Incrementable
-            , Incrementable
-            , Access
-            , /* see details for traversal category */
-            , Incrementable const&
-            , Incrementable const*
-            , /* distance = Difference or a signed integral type */>
-      {
-          friend class iterator_core_access;
-       public:
-
-    to::
-
-      class counting_iterator
-      {
-       public:
-          typedef Incrementable value_type;
-          typedef const Incrementable& reference;
-          typedef const Incrementable* pointer;
-          typedef /* see below */ difference_type;
-          typedef /* see below */ iterator_category;
-
-
-
-    Change::
-
-      private:
-          typename counting_iterator::reference dereference() const
-          {
-              return this->base_reference();
-          }
-
-    to::
-
-          Incrementable const& base() const;
-          reference operator*() const;
-          counting_iterator& operator++();
-          counting_iterator& operator--();
-      private:
-          Incrementable m_inc; // exposition
-
-    After the synopsis, add:
-
-      If the ``Difference`` argument is ``use_default`` then
-      ``difference_type`` is an unspecified signed integral
-      type. Otherwise ``difference_type`` is ``Difference``.
-
-      ``iterator_category`` is determined according to the following
-      algorithm:
-
-      .. parsed-literal::
-
-         if (CategoryOrTraversal is not use_default)
-             return CategoryOrTraversal
-         else if (numeric_limits<Incrementable>::is_specialized)
-             return |iterator-category|\ (
-                 random_access_traversal_tag, Incrementable, const Incrementable&)
-         else
-             return |iterator-category|\ (
-                  iterator_traversal<Incrementable>::type, 
-                  Incrementable, const Incrementable&)
-
-
-
-    Change:
-      [*Note:* implementers are encouraged to provide an implementation of
-        ``distance_to`` and a ``difference_type`` that avoids overflows in
-        the cases when the ``Incrementable`` type is a numeric type.]
-
-    to:
-      [*Note:* implementers are encouraged to provide an implementation of
-        ``operator-`` and a ``difference_type`` that avoid overflows in
-        the cases where ``std::numeric_limits<Incrementable>::is_specialized``
-        is true.]
-
-    Change:
-      The ``Incrementable`` type must be Default Constructible, Copy
-      Constructible, and Assignable.  The default distance is
-      an implementation defined signed integegral type.
-
-      The resulting ``counting_iterator`` models Readable Lvalue Iterator.
-
-    to:
-      The ``Incrementable`` argument shall be Copy Constructible and Assignable.
-
-    Change:
-      Furthermore, if you wish to create a counting iterator that is a Forward
-      Traversal Iterator, then the following expressions must be valid:
-
-    to:
-      If ``iterator_category`` is convertible to ``forward_iterator_tag``
-      or ``forward_traversal_tag``, the following must be well-formed:
-
-    Change:
-      If you wish to create a counting iterator that is a 
-      Bidirectional Traversal Iterator, then pre-decrement is also required:
-
-    to:
-      If ``iterator_category`` is convertible to
-      ``bidirectional_iterator_tag`` or ``bidirectional_traversal_tag``,
-      the following expression must also be well-formed:
-
-    Change:
-      If you wish to create a counting iterator that is a Random Access
-      Traversal Iterator, then these additional expressions are also
-      required:
-
-    to:
-      If ``iterator_category`` is convertible to
-      ``random_access_iterator_tag`` or ``random_access_traversal_tag``,
-      the following must must also be valid:
-
-    After the requirements section, add:
-
-.. topic:: ``counting_iterator`` models
-
-      Specializations of ``counting_iterator`` model Readable Lvalue
-      Iterator. In addition, they model the concepts corresponding to the
-      iterator tags to which their ``iterator_category`` is convertible.
-      Also, if ``CategoryOrTraversal`` is not ``use_default`` then
-      ``counting_iterator`` models the concept corresponding to the iterator
-      tag ``CategoryOrTraversal``.  Otherwise, if
-      ``numeric_limits<Incrementable>::is_specialized``, then
-      ``counting_iterator`` models Random Access Traversal Iterator.
-      Otherwise, ``counting_iterator`` models the same iterator traversal
-      concepts modeled by ``Incrementable``.
-
-      ``counting_iterator<X,C1,D1>`` is interoperable with
-      ``counting_iterator<Y,C2,D2>`` if and only if ``X`` is
-      interoperable with ``Y``.
-
-    At the begining of the operations section, add:
-
-      In addition to the operations required by the concepts modeled by
-      ``counting_iterator``, ``counting_iterator`` provides the following
-      operations.
-
-    Change:
-      :Returns: A default constructed instance of ``counting_iterator``.
-
-    to:
-      :Requires: ``Incrementable`` is Default Constructible.
-      :Effects: Default construct the member ``m_inc``.
-
-    Change:
-      :Returns: An instance of ``counting_iterator`` that is a copy of ``rhs``.
-
-    to:
-      :Effects: Construct member ``m_inc`` from ``rhs.m_inc``.
-
-    Change:
-      :Returns: An instance of ``counting_iterator`` with its base
-          object copy constructed from ``x``.
-
-    to:
-      :Effects: Construct member ``m_inc`` from ``x``.
-
-    At the end of the operations section, add:
-
-      ``reference operator*() const;``
-
-      :Returns: ``m_inc``
-
-
-      ``counting_iterator& operator++();``
-
-      :Effects: ``++m_inc``
-      :Returns: ``*this``
-
-
-      ``counting_iterator& operator--();``
-
-      :Effects: ``--m_inc``
-      :Returns: ``*this``  
-
-
-      ``Incrementable const& base() const;``
-
-      :Returns: ``m_inc``
-
-
-9.38x Problem with specification of a->m in Readable Iterator
-=============================================================
-
-:Submitter: Howard Hinnant
-:Status: New
-
-c++std-lib-12585:
-
-Readable Iterator Requirements says:
-
-  +----------+--------+-----------------------------------------------------------+
-  | ``a->m`` | ``U&`` | pre: ``(*a).m`` is well-defined. Equivalent to ``(*a).m`` |
-  +----------+--------+-----------------------------------------------------------+
-
-Do we mean to outlaw iterators with proxy references from meeting
-the readable requirements?
-
-Would it be better for the requirements to read ``static_cast<T>(*a).m``
-instead of ``(*a).m`` ?
-
-:Proposed resolution: NAD.  
-
-:Rationale: We think you're misreading "pre:".
-  If ``(*a).m`` is not well defined, then the iterator is not
-  required to provide ``a->m``. So a proxy iterator is not
-  required to provide ``a->m``.
-
-  As an aside, it is possible for proxy iterators to
-  support ``->``, so changing the requirements to
-  read ``static_cast<T>(*a).m`` is interesting.
-  However, such a change to Readable Iterator would
-  mean that it no longer corresponds to the
-  input iterator requirements. So old iterators would not
-  necessarily conform to new iterator requirements. 
-
-
-9.39x counting_iterator Traversal argument unspecified
-======================================================
-
-:Submitter: Pete Becker
-
-c++std-lib-12635:
- 
-counting_iterator takes an argument for its Traversal type, with a
-default value of use_default. It is derived from an instance of
-iterator_adaptor, where the argument passed for the Traversal type
-is described as "\ ``/* see details for traversal category
-*/``". The details for counting_iterator describe constraints on
-the Incrementable type imposed by various traversal
-categories. There is no description of what the argument to
-iterator_adaptor should be.
-
-
-:Proposed resolution:
-  We no longer inherit from iterator_adaptor. So instead,
-  we specify the iterator_category in terms of the Traversal type
-  (which is now called CategoryOrTraversal). Also the
-  requirements and models section was reorganized to
-  match these changes and to make more sense.
-
-
-
-9.40x indirect_iterator requirements muddled
-============================================
-
-:Submitter: Pete Becker
-
-c++std-lib-12640:
-
-    The value_type of the Iterator template parameter should itself
-    be dereferenceable. The return type of the ``operator*`` for
-    the value_type must be the same type as the Reference template
-    parameter.
-
-  I'd say this a bit differently, to emphasize what's required:
-  iterator_traits<Iterator>::value_type must be dereferenceable.
-  The Reference template parameter must be the same type as 
-  ``*iterator_traits<Iterator>::value_type()``.
-
-    The Value template parameter will be the value_type for the 
-    indirect_iterator, unless Value is const. If Value is const X, then 
-    value_type will be non- const X.
-
-  Also non-volatile, right? In other words, if Value isn't use_default, it 
-  just gets passed as the Value argument for iterator_adaptor.
-
-    The default for Value is::
-
-      iterator_traits< iterator_traits<Iterator>::value_type >::value_type
-
-    If the default is used for Value, then there must be a valid
-    specialization of iterator_traits for the value type of the
-    base iterator.
-
-  The earlier requirement is that
-  ``iterator_traits<Iterator>::value_type`` must be
-  dereferenceable. Now it's being treated as an iterator. Is this
-  just a pun, or is ``iterator_traits<Iterator>::value_type``
-  required to be some form of iterator? If it's the former we need
-  to find a different way to say it.  If it's the latter we need to
-  say so.
-
-:Proposed resolution:
-  Change:
-
-    The ``value_type`` of the ``Iterator`` template parameter
-    should itself be dereferenceable. The return type of the
-    ``operator*`` for the ``value_type`` must be the same type as
-    the ``Reference`` template parameter. The ``Value`` template
-    parameter will be the ``value_type`` for the
-    ``indirect_iterator``, unless ``Value`` is const. If ``Value``
-    is ``const X``, then ``value_type`` will be *non-* ``const X``.
-    The default for ``Value`` is::
-
-      iterator_traits< iterator_traits<Iterator>::value_type >::value_type
-
-    If the default is used for ``Value``, then there must be a
-    valid specialization of ``iterator_traits`` for the value type
-    of the base iterator.
-
-    The ``Reference`` parameter will be the ``reference`` type of the
-    ``indirect_iterator``. The default is ``Value&``.
-
-    The ``Access`` and ``Traversal`` parameters are passed
-    unchanged to the corresponding parameters of the
-    ``iterator_adaptor`` base class, and the ``Iterator`` parameter
-    is passed unchanged as the ``Base`` parameter to the
-    ``iterator_adaptor`` base class.
-
-  to:
-
-    The expression ``*v``, where ``v`` is an object of
-    ``iterator_traits<Iterator>::value_type``, shall be valid
-    expression and convertible to ``reference``.  ``Iterator``
-    shall model the traversal concept indicated by
-    ``iterator_category``.  ``Value``, ``Reference``, and
-    ``Difference`` shall be chosen so that ``value_type``,
-    ``reference``, and ``difference_type`` meet the requirements
-    indicated by ``iterator_category``.
-
-   [Note: there are further requirements on the
-   ``iterator_traits<Iterator>::value_type`` if the ``Value``
-   parameter is not ``use_default``, as implied by the algorithm
-   for deducing the default for the ``value_type`` member.]
-
-
-:Rationale: Not included above is the specification of the
-  ``value_type``, ``reference``, etc., members, which is handled by
-  the changes in 9.37x.
-
-
-9.41x Problem with transform_iterator requirements
-==================================================
-
-:Submitter: Pete Becker
-
-c++std-lib-12641:
-
-      The reference type of transform_iterator is ``result_of<
-      UnaryFunction(iterator_traits<Iterator>::reference)
-      >::type``. The ``value_type`` is
-      ``remove_cv<remove_reference<reference> >::type``.
-
-These are the defaults, right? If the user supplies their own types
-that's what gets passed to iterator_adaptor. And again, the
-specification should be in terms of the specialization of
-iterator_adaptor, and not in terms of the result:
-
-Reference argument to iterator_adaptor::
-
-    if (Reference != use_default)
-        Reference
-    else
-        result_of<
-            UnaryFunction(iterator_traits<Iterator>::reference)
-        >::type
-
-Value argument to iterator_adaptor::
-
-    if (Value != use_default)
-        Value
-    else if (Reference != use_default)
-        remove_reference<reference>::type
-    else
-        remove_reference<
-            result_of<
-                UnaryFunction(iterator_traits<Iterator>::reference)
-            >::type
-        >::type
-
-There's probably a better way to specify that last alternative, but
-I've been at this too long, and it's all turning into a maze of
-twisty passages, all alike.
-
-:Proposed resolution:
-  Replace:
-
-      The reference type of transform_iterator is ``result_of<
-      UnaryFunction(iterator_traits<Iterator>::reference)
-      >::type``. The ``value_type`` is
-      ``remove_cv<remove_reference<reference> >::type``.
-
-  with:
-
-      If ``Reference`` is ``use_default`` then the ``reference``
-      member of ``transform_iterator`` is ``result_of<
-      UnaryFunction(iterator_traits<Iterator>::reference)
-      >::type``.  Otherwise, ``reference`` is ``Reference``.
-
-      If ``Value`` is ``use_default`` then the ``value_type``
-      member is ``remove_cv<remove_reference<reference> >::type``.
-      Otherwise, ``value_type`` is ``Value``.
-
-
-9.42x filter_iterator details unspecified
-=========================================
-
-:Submitter: Pete Becker
-
-c++std-lib-12642:
-
-The paper says::
-
-    template<class Predicate, class Iterator>
-    class filter_iterator
-         : public iterator_adaptor<
-             filter_iterator<Predicate, Iterator>,
-             Iterator,
-             use_default,
-             /* see details */ >
- 
-That comment covers the Access, Traversal, Reference, and Difference
-arguments. The only specification for any of these in the details is:
- 
-    The access category of the filter_iterator will be the same as
-    the access category of Iterator.
- 
-Needs more.
-
-:Proposed resolution:
-  Add to the synopsis::
-
-      typedef iterator_traits<Iterator>::value_type value_type;
-      typedef iterator_traits<Iterator>::reference reference;
-      typedef iterator_traits<Iterator>::pointer pointer;
-      typedef iterator_traits<Iterator>::difference_type difference_type;
-      typedef /* see below */ iterator_category;
-
-  and add just after the synopsis:
-
-      If ``Iterator`` models Readable Lvalue Iterator and Forward
-      Traversal Iterator then ``iterator_category`` is convertible
-      to ``std::forward_iterator_tag``. Otherwise
-      ``iterator_category`` is convertible to
-      ``std::input_iterator_tag``.
-
-
-9.43x transform_iterator interoperability too restrictive
-=========================================================
-
-:Submitter: Jeremy Siek
-
-We do not need to require that the function objects have the same
-type, just that they be convertible.
-
-:Proposed resolution:
-
-  Change::
-
-      template<class OtherIterator, class R2, class V2>
-      transform_iterator(
-            transform_iterator<UnaryFunction, OtherIterator, R2, V2> const& t
-          , typename enable_if_convertible<OtherIterator, Iterator>::type* = 0 // exposition
-      );
-
-  to::
-
-      template<class F2, class I2, class R2, class V2>
-      transform_iterator(
-            transform_iterator<F2, I2, R2, V2> const& t
-          , typename enable_if_convertible<I2, Iterator>::type* = 0      // exposition only
-          , typename enable_if_convertible<F2, UnaryFunction>::type* = 0 // exposition only
-      );
-
-
-9.44y ``indirect_iterator`` and smart pointers
-==============================================
-
-:Submitter: Dave Abrahams
-
-``indirect_iterator`` should be able to iterate over containers of
-smart pointers, but the mechanism that allows it was left out of
-the specification, even though it's present in the Boost
-specification
-
-:Proposed resolution: Add ``pointee`` and ``indirect_reference``
-  to deal with this capability.
-
-  In [lib.iterator.helper.synopsis], add::
-
-    template <class Dereferenceable>
-    struct pointee;
-
-    template <class Dereferenceable>
-    struct indirect_reference;
-
-  After ``indirect_iterator``\ 's abstract, add:
-
-.. topic:: Class template ``pointee``
-
-  .. include:: pointee_ref.rst
-
-.. topic:: Class template ``indirect_reference``
-
-  .. include:: indirect_reference_ref.rst
-
-See proposed resolution to Issue 9.37x for more changes related to
-this issue.
-
-9.45y N1530: Typos and editorial changes in proposal text (not standardese)
-===========================================================================
-
-:Submitter: Dave Abrahams
-
-1. "because specification helps to highlight that the ``Reference``
-   template parameter may not always be identical to the iterator's
-   ``reference`` type, and will keep users making mistakes based on
-   that assumption."
-
-   :Proposed resolution: add "from" before "making"
-
-2. mention of obsolete projection_iterator
-
-  :Proposed Resolution:
-
-    From n1530, in the **Specialized Adaptors** section, remove:
-
-      ``projection_iterator``, which is similar to ``transform_iterator``
-      except that when dereferenced it returns a reference instead of
-      a value.
-
-  :Rationale:
-    This iterator was in the original boost library, but the new
-    iterator concepts allowed this iterator to be
-    folded into ``transform_iterator``.
-
-
-
-9.46y N1530: ``base()`` return-by-value is costly
-=================================================
-
-:Submitter: Dave Abrahams
-
-We've had some real-life reports that iterators that use
-``iterator_adaptor``\ 's ``base()`` function can be inefficient
-when the ``Base`` iterator is expensive to copy.  Iterators, of
-all things, should be efficient.
-
-:Proposed resolution: 
-
-   In [lib.iterator.adaptor]
-
-   Change::
-
-      Base base() const;
-
-   to::
-
-      Base const& base() const;
-
-   twice (once in the synopsis and once in the **public
-   operations** section).
-
-
-9.47x Forgot default constructible in Forward Traversal Iterator
-================================================================
-
-:Submitter: Jeremy Siek
-
-We want Forward Traversal Iterator plus Readable Lvalue Iterator to
-match the old Foward Iterator requirements, so we need Forward
-Traversal Iterator to include Default Constructible.
-
-:Proposed resolution: 
-
-  Change:
-
-    A class or built-in type ``X`` models the *Forward Traversal Iterator*
-    concept if the following expressions are valid and respect the stated
-    semantics.
-
-    +-------------------------------------------------------------------------------------------+
-    |Forward Traversal Iterator Requirements (in addition to Single Pass Iterator)              |
-    +---------------------------------------+-----------------------------------+---------------+
-
-  to:
-
-    A class or built-in type ``X`` models the *Forward Traversal Iterator*
-    concept if, in addition to ``X`` meeting the requirements of
-    Default Constructible and Single Pass Iterator, the following
-    expressions are valid and respect the
-    stated semantics.
-
-    +--------------------------------------------------------------------------------------------------------+
-    |Forward Traversal Iterator Requirements (in addition to Default Constructible and Single Pass Iterator) |
-    +---------------------------------------+-----------------------------------+----------------------------+
-        
-9.48x Editorial changes (non-normative text)
-============================================
-
-Change:
-  Iterator facade uses the Curiously Recurring Template Pattern (CRTP)
-  [Cop95] so that the user can specify the behavior of
-  ``iterator_facade`` in a derived class.  Former designs used policy
-  objects to specify the behavior.  ``iterator_facade`` does not use policy
-  objects for several reasons: 
-
-to:
-  Iterator facade uses the Curiously Recurring Template
-  Pattern (CRTP) [Cop95] so that the user can specify the behavior
-  of ``iterator_facade`` in a derived class.  Former designs used
-  policy objects to specify the behavior, but that approach was
-  discarded for several reasons:
-
-
-Change:
-  iterator's ``operator++`` returns the iterator type itself means
-  that all iterators generated by ``iterator_facade`` would be
-  instantiations of ``iterator_facade``.  Cumbersome type generator
-
-to:
-  iterator's ``operator++`` returns the iterator type itself
-  would mean that all iterators built with the library would
-  have to be specializations of ``iterator_facade<...>``, rather
-  than something more descriptive like
-  ``indirect_iterator<T*>``.  Cumbersome type generator
-
-
-Change:
-  The return type for ``operator->`` and ``operator[]`` is not
-  explicitly specified. Instead it requires each ``iterator_facade``
-  instantiation to meet the requirements of its ``iterator_category``.
-
-To:
-  The return types for ``iterator_facade``\ 's ``operator->`` and
-  ``operator[]`` are not explicitly specified. Instead, those types
-  are described in terms of a set of requirements, which must be
-  satisfied by the ``iterator_facade`` implementation.
-
-
-9.49x Clarification of iterator_facade requirements and type members
-====================================================================
-
-A general cleanup and simplification of the requirements and
-description of type members for ``iterator_facade``.
-
-
-The user is only allowed to add ``const`` as a qualifier.
-
-Change:
-  ``typedef remove_cv<Value>::type value_type;``
-
-to:
-  ``typedef remove_const<Value>::type value_type;``
-
-
-We use to have an unspecified type for ``pointer``, to match the
-return type of ``operator->``, but there's no real reason to make them
-match, so we just use the simpler ``Value*`` for ``pointer``.
-
-Change:
-
-  ``typedef /* see description of operator-> */ pointer;``
-
-To:
-  ``typedef Value* pointer;``
-
-
-Remove:
-  Some of the constraints on template parameters to
-  ``iterator_facade`` are expressed in terms of resulting nested
-  types and should be viewed in the context of their impact on
-  ``iterator_traits<Derived>``.
-
-Change:
-  The ``Derived`` template parameter must be a class derived from
-  ``iterator_facade``.
-
-and:
-  The following table describes the other requirements on the
-  ``Derived`` parameter.  Depending on the resulting iterator's
-  ``iterator_category``, a subset of the expressions listed in the table
-  are required to be valid.  The operations in the first column must be
-  accessible to member functions of class ``iterator_core_access``.
-
-to:
-  The following table describes the typical valid expressions on
-  ``iterator_facade``\ 's ``Derived`` parameter, depending on the
-  iterator concept(s) it will model.  The operations in the first
-  column must be made accessible to member functions of class
-  ``iterator_core_access``.  In addition,
-  ``static_cast<Derived*>(iterator_facade*)`` shall be well-formed.
-
-
-Remove:
-  The nested ``::value_type`` type will be the same as
-  ``remove_cv<Value>::type``, so the ``Value`` parameter must be
-  an (optionally ``const``\ -qualified) non-reference type.
-
-  The nested ``::reference`` will be the same as the ``Reference``
-  parameter; it must be a suitable reference type for the resulting
-  iterator.  The default for the ``Reference`` parameter is
-  ``Value&``.
-
-
-Change:
-
-  In the table below, ``X`` is the derived iterator type, ``a`` is an
-  object of type ``X``, ``b`` and ``c`` are objects of type ``const X``,
-  ``n`` is an object of ``X::difference_type``, ``y`` is a constant
-  object of a single pass iterator type interoperable with X, and ``z``
-  is a constant object of a random access traversal iterator type
-  interoperable with ``X``.
-
-  +--------------------+-------------------+-------------------------------------+---------------------------+
-  |Expression          |Return Type        |Assertion/Note                       |Required to implement      |
-  |                    |                   |                                     |Iterator Concept(s)        |
-  +====================+===================+=====================================+===========================+
-  |``c.dereference()`` |``X::reference``   |                                     |Readable Iterator, Writable|
-  |                    |                   |                                     |Iterator                   |
-  +--------------------+-------------------+-------------------------------------+---------------------------+
-  |``c.equal(b)``      |convertible to bool|true iff ``b`` and ``c`` are         |Single Pass Iterator       |
-  |                    |                   |equivalent.                          |                           |
-  +--------------------+-------------------+-------------------------------------+---------------------------+
-  |``c.equal(y)``      |convertible to bool|true iff ``c`` and ``y`` refer to the|Single Pass Iterator       |
-  |                    |                   |same position.  Implements ``c == y``|                           |
-  |                    |                   |and ``c != y``.                      |                           |
-  +--------------------+-------------------+-------------------------------------+---------------------------+
-  |``a.advance(n)``    |unused             |                                     |Random Access Traversal    |
-  |                    |                   |                                     |Iterator                   |
-  +--------------------+-------------------+-------------------------------------+---------------------------+
-  |``a.increment()``   |unused             |                                     |Incrementable Iterator     |
-  +--------------------+-------------------+-------------------------------------+---------------------------+
-  |``a.decrement()``   |unused             |                                     |Bidirectional Traversal    |
-  |                    |                   |                                     |Iterator                   |
-  +--------------------+-------------------+-------------------------------------+---------------------------+
-  |``c.distance_to(b)``|convertible to     |equivalent to ``distance(c, b)``     |Random Access Traversal    |
-  |                    |X::difference_type |                                     |Iterator                   |
-  +--------------------+-------------------+-------------------------------------+---------------------------+
-  |``c.distance_to(z)``|convertible to     |equivalent to ``distance(c, z)``.    |Random Access Traversal    |
-  |                    |X::difference_type |Implements ``c - z``, ``c < z``, ``c |Iterator                   |
-  |                    |                   |<= z``, ``c > z``, and ``c >= c``.   |                           |
-  +--------------------+-------------------+-------------------------------------+---------------------------+
-
-to:
-
-  In the table below, ``F`` is ``iterator_facade<X,V,C,R,D>``, ``a`` is an
-  object of type ``X``, ``b`` and ``c`` are objects of type ``const X``,
-  ``n`` is an object of ``F::difference_type``, ``y`` is a constant
-  object of a single pass iterator type interoperable with ``X``, and ``z``
-  is a constant object of a random access traversal iterator type
-  interoperable with ``X``.
-
-  **iterator_facade Core Operations**
-
-  +--------------------+----------------------+-------------------------+---------------------------+
-  |Expression          |Return Type           |Assertion/Note           |Used to implement Iterator |
-  |                    |                      |                         |Concept(s)                 |
-  +====================+======================+=========================+===========================+
-  |``c.dereference()`` |``F::reference``      |                         |Readable Iterator, Writable|
-  |                    |                      |                         |Iterator                   |
-  +--------------------+----------------------+-------------------------+---------------------------+
-  |``c.equal(y)``      |convertible to bool   |true iff ``c`` and ``y`` |Single Pass Iterator       |
-  |                    |                      |refer to the same        |                           |
-  |                    |                      |position.                |                           |
-  +--------------------+----------------------+-------------------------+---------------------------+
-  |``a.increment()``   |unused                |                         |Incrementable Iterator     |
-  +--------------------+----------------------+-------------------------+---------------------------+
-  |``a.decrement()``   |unused                |                         |Bidirectional Traversal    |
-  |                    |                      |                         |Iterator                   |
-  +--------------------+----------------------+-------------------------+---------------------------+
-  |``a.advance(n)``    |unused                |                         |Random Access Traversal    |
-  |                    |                      |                         |Iterator                   |
-  +--------------------+----------------------+-------------------------+---------------------------+
-  |``c.distance_to(z)``|convertible to        |equivalent to            |Random Access Traversal    |
-  |                    |``F::difference_type``|``distance(c, X(z))``.   |Iterator                   |
-  +--------------------+----------------------+-------------------------+---------------------------+
-
-
-

Modified: boost/trunk/libs/iterator/doc/iterator_adaptor.html
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_adaptor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_adaptor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,295 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Iterator Adaptor</title>
 <meta name="author" content="David Abrahams, Jeremy Siek, Thomas Witt" />
 <meta name="organization" content="Boost Consulting, Indiana University Open Systems Lab, University of Hanover Institute for Transport Railway Operation and Construction" />
 <meta name="date" content="2004-11-01" />
 <meta name="copyright" content="Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003." />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:27 $
+:Revision: $Revision: 1.22.4.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="iterator-adaptor">
@@ -32,6 +314,9 @@
 <td>Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.</td></tr>
 </tbody>
 </table>
+<!-- Distributed under the 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 field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
@@ -40,9 +325,12 @@
 </tr>
 </tbody>
 </table>
+<!-- Distributed under the Boost -->
+<!-- Software License, Version 1.0. (See accompanying -->
+<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <!-- Version 1.1 of this ReStructuredText document corresponds to
 n1530_, the paper accepted by the LWG. -->
-<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.  -->
+<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. -->
 <p>Each specialization of the <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> class template is derived from
 a specialization of <tt class="docutils literal"><span class="pre">iterator_facade</span></tt>. The core interface functions
 expected by <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> are implemented in terms of the
@@ -53,8 +341,8 @@
 depends on the operations supported by the <tt class="docutils literal"><span class="pre">Base</span></tt> type and which
 core interface functions of <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> are redefined in the
 <tt class="docutils literal"><span class="pre">Derived</span></tt> class.</p>
-<div class="contents topic" id="table-of-contents">
-<p class="topic-title first"><a name="table-of-contents">Table of Contents</a></p>
+<div class="contents topic">
+<p class="topic-title first"><a id="table-of-contents" name="table-of-contents">Table of Contents</a></p>
 <ul class="simple">
 <li><a class="reference" href="#overview" id="id6" name="id6">Overview</a></li>
 <li><a class="reference" href="#reference" id="id7" name="id7">Reference</a><ul>
@@ -68,11 +356,14 @@
 <li><a class="reference" href="#tutorial-example" id="id13" name="id13">Tutorial Example</a></li>
 </ul>
 </div>
-<div class="section" id="overview">
-<h1><a class="toc-backref" href="#id6" name="overview">Overview</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id6" id="overview" name="overview">Overview</a></h1>
+<!-- Distributed under the Boost -->
+<!-- Software License, Version 1.0. (See accompanying -->
+<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <!-- Version 1.2 of this ReStructuredText document corresponds to
 n1530_, the paper accepted by the LWG for TR1. -->
-<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.  -->
+<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. -->
 <p>The <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> class template adapts some <tt class="docutils literal"><span class="pre">Base</span></tt> <a class="footnote-reference" href="#base" id="id1" name="id1">[1]</a>
 type to create a new iterator.  Instantiations of <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt>
 are derived from a corresponding instantiation of <tt class="docutils literal"><span class="pre">iterator_facade</span></tt>
@@ -109,11 +400,14 @@
 <tt class="docutils literal"><span class="pre">reference</span></tt> type, and will keep users from making mistakes based on
 that assumption.</p>
 </div>
-<div class="section" id="reference">
-<h1><a class="toc-backref" href="#id7" name="reference">Reference</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id7" id="reference" name="reference">Reference</a></h1>
+<!-- Distributed under the Boost -->
+<!-- Software License, Version 1.0. (See accompanying -->
+<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <!-- Version 1.4 of this ReStructuredText document corresponds to
 n1530_, the paper accepted by the LWG for TR1. -->
-<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.  -->
+<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. -->
 <pre class="literal-block">
 template &lt;
     class Derived
@@ -123,7 +417,7 @@
   , class Reference           = use_default
   , class Difference = use_default
 &gt;
-class iterator_adaptor 
+class iterator_adaptor
   : public iterator_facade&lt;Derived, <em>V'</em>, <em>C'</em>, <em>R'</em>, <em>D'</em>&gt; // see <a class="reference" href="#base-parameters">details</a>
 {
     friend class iterator_core_access;
@@ -136,12 +430,12 @@
     typedef iterator_adaptor iterator_adaptor_;
     Base const&amp; base_reference() const;
     Base&amp; base_reference();
- private: // Core iterator interface for iterator_facade.  
+ private: // Core iterator interface for iterator_facade.
     typename iterator_adaptor::reference dereference() const;
 
     template &lt;
     class OtherDerived, class OtherIterator, class V, class C, class R, class D
-    &gt;   
+    &gt;
     bool equal(iterator_adaptor&lt;OtherDerived, OtherIterator, V, C, R, D&gt; const&amp; x) const;
 
     void advance(typename iterator_adaptor::difference_type n);
@@ -150,7 +444,7 @@
 
     template &lt;
         class OtherDerived, class OtherIterator, class V, class C, class R, class D
-    &gt;   
+    &gt;
     typename iterator_adaptor::difference_type distance_to(
         iterator_adaptor&lt;OtherDerived, OtherIterator, V, C, R, D&gt; const&amp; y) const;
 
@@ -158,13 +452,13 @@
     Base m_iterator; // exposition only
 };
 </pre>
-<a class="target" id="requirements" name="requirements"></a><div class="section" id="iterator-adaptor-requirements">
-<h2><a class="toc-backref" href="#id8" name="iterator-adaptor-requirements"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> requirements</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id8" id="iterator-adaptor-requirements" name="iterator-adaptor-requirements"><span id="requirements"></span><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> requirements</a></h2>
 <p><tt class="docutils literal"><span class="pre">static_cast&lt;Derived*&gt;(iterator_adaptor*)</span></tt> shall be well-formed.
 The <tt class="docutils literal"><span class="pre">Base</span></tt> argument shall be Assignable and Copy Constructible.</p>
-<a class="target" id="base-parameters" name="base-parameters"></a></div>
-<div class="section" id="iterator-adaptor-base-class-parameters">
-<h2><a class="toc-backref" href="#id9" name="iterator-adaptor-base-class-parameters"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> base class parameters</a></h2>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id9" id="iterator-adaptor-base-class-parameters" name="iterator-adaptor-base-class-parameters"><span id="base-parameters"></span><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> base class parameters</a></h2>
 <p>The <em>V'</em>, <em>C'</em>, <em>R'</em>, and <em>D'</em> parameters of the <tt class="docutils literal"><span class="pre">iterator_facade</span></tt>
 used as a base class in the summary of <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt>
 above are defined as follows:</p>
@@ -204,8 +498,8 @@
 <!-- The above is confusing and needs a rewrite. -JGS -->
 <!-- That's why it's removed.  We're embracing inheritance, remember? -->
 </div>
-<div class="section" id="iterator-adaptor-public-operations">
-<h2><a class="toc-backref" href="#id10" name="iterator-adaptor-public-operations"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> public operations</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id10" id="iterator-adaptor-public-operations" name="iterator-adaptor-public-operations"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> public operations</a></h2>
 <p><tt class="docutils literal"><span class="pre">iterator_adaptor();</span></tt></p>
 <table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
@@ -213,7 +507,7 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Requires:</th><td class="field-body">The <tt class="docutils literal"><span class="pre">Base</span></tt> type must be Default Constructible.</td>
 </tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> with 
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> with
 <tt class="docutils literal"><span class="pre">m_iterator</span></tt> default constructed.</td>
 </tr>
 </tbody>
@@ -238,8 +532,8 @@
 </tbody>
 </table>
 </div>
-<div class="section" id="iterator-adaptor-protected-member-functions">
-<h2><a class="toc-backref" href="#id11" name="iterator-adaptor-protected-member-functions"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> protected member functions</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id11" id="iterator-adaptor-protected-member-functions" name="iterator-adaptor-protected-member-functions"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> protected member functions</a></h2>
 <p><tt class="docutils literal"><span class="pre">Base</span> <span class="pre">const&amp;</span> <span class="pre">base_reference()</span> <span class="pre">const;</span></tt></p>
 <table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
@@ -259,8 +553,8 @@
 </tbody>
 </table>
 </div>
-<div class="section" id="iterator-adaptor-private-member-functions">
-<h2><a class="toc-backref" href="#id12" name="iterator-adaptor-private-member-functions"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> private member functions</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id12" id="iterator-adaptor-private-member-functions" name="iterator-adaptor-private-member-functions"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> private member functions</a></h2>
 <p><tt class="docutils literal"><span class="pre">typename</span> <span class="pre">iterator_adaptor::reference</span> <span class="pre">dereference()</span> <span class="pre">const;</span></tt></p>
 <table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
@@ -273,7 +567,7 @@
 <pre class="literal-block">
 template &lt;
 class OtherDerived, class OtherIterator, class V, class C, class R, class D
-&gt;   
+&gt;
 bool equal(iterator_adaptor&lt;OtherDerived, OtherIterator, V, C, R, D&gt; const&amp; x) const;
 </pre>
 <table class="docutils field-list" frame="void" rules="none">
@@ -314,7 +608,7 @@
 <pre class="literal-block">
 template &lt;
     class OtherDerived, class OtherIterator, class V, class C, class R, class D
-&gt;   
+&gt;
 typename iterator_adaptor::difference_type distance_to(
     iterator_adaptor&lt;OtherDerived, OtherIterator, V, C, R, D&gt; const&amp; y) const;
 </pre>
@@ -328,8 +622,8 @@
 </table>
 </div>
 </div>
-<div class="section" id="tutorial-example">
-<h1><a class="toc-backref" href="#id13" name="tutorial-example">Tutorial Example</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id13" id="tutorial-example" name="tutorial-example">Tutorial Example</a></h1>
 <!-- Copyright David Abrahams 2004. Use, modification and distribution is -->
 <!-- subject to the Boost Software License, Version 1.0. (See accompanying -->
 <!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
@@ -439,10 +733,5 @@
 <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt>'s <tt class="docutils literal"><span class="pre">Base</span></tt> type needn't be an iterator.</p>
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="iterator_adaptor.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/iterator_adaptor.rst
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_adaptor.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_adaptor.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 +++++++++++++++++
  Iterator Adaptor
 +++++++++++++++++
@@ -7,7 +11,7 @@
 :organization: `Boost Consulting`_, Indiana University `Open Systems
                Lab`_, University of Hanover `Institute for Transport
                Railway Operation and Construction`_
-:date: $Date: 2004/11/01 21:23:47 $
+:date: $Date: 2006/09/11 22:27:27 $
 :copyright: Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. 
 
 .. _`Boost Consulting`: http://www.boost-consulting.com

Deleted: boost/trunk/libs/iterator/doc/iterator_adaptor_abstract.diff
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_adaptor_abstract.diff	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_adaptor_abstract.diff	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,22 +0,0 @@
-Index: iterator_adaptor_abstract.rst
-===================================================================
-RCS file: /cvsroot/boost/boost/libs/iterator/doc/iterator_adaptor_abstract.rst,v
-retrieving revision 1.1
-retrieving revision 1.2
-diff -b -d -u -r1.1 -r1.2
---- iterator_adaptor_abstract.rst	5 Aug 2003 18:19:55 -0000	1.1
-+++ iterator_adaptor_abstract.rst	24 Nov 2003 05:02:46 -0000	1.2
-@@ -1,5 +1,11 @@  Issue 9.21
--The ``iterator_adaptor`` is a base class template derived from an
--instantiation of ``iterator_facade``. The core interface functions
-+.. Version 1.1 of this ReStructuredText document corresponds to
-+   n1530_, the paper accepted by the LWG.
-+
-+.. Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. All
-+   rights reserved
-+
-+Each specialization of the ``iterator_adaptor`` class template is derived from
-+a specialization of ``iterator_facade``. The core interface functions
- expected by ``iterator_facade`` are implemented in terms of the
- ``iterator_adaptor``\ 's ``Base`` template parameter. A class derived
- from ``iterator_adaptor`` typically redefines some of the core

Modified: boost/trunk/libs/iterator/doc/iterator_adaptor_abstract.rst
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_adaptor_abstract.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_adaptor_abstract.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 .. Version 1.1 of this ReStructuredText document corresponds to
    n1530_, the paper accepted by the LWG.
 

Deleted: boost/trunk/libs/iterator/doc/iterator_adaptor_body.diff
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_adaptor_body.diff	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_adaptor_body.diff	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,35 +0,0 @@
-Index: iterator_adaptor_body.rst
-===================================================================
-RCS file: /cvsroot/boost/boost/libs/iterator/doc/iterator_adaptor_body.rst,v
-retrieving revision 1.2
-retrieving revision 1.3
-diff -b -d -u -r1.2 -r1.3
---- iterator_adaptor_body.rst	22 Sep 2003 19:55:00 -0000	1.2
-+++ iterator_adaptor_body.rst	24 Nov 2003 05:02:46 -0000	1.3
-@@ -1,3 +1,9 @@
-+.. Version 1.2 of this ReStructuredText document corresponds to
-+   n1530_, the paper accepted by the LWG for TR1.
-+
-+.. Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. All
-+   rights reserved
-+
- The ``iterator_adaptor`` class template adapts some ``Base`` [#base]_
- type to create a new iterator.  Instantiations of ``iterator_adaptor``
- are derived from a corresponding instantiation of ``iterator_facade``
-@@ -19,7 +25,7 @@  Issue 9.1 et al
- redefined in the user's derived class.
- 
- Several of the template parameters of ``iterator_adaptor`` default
--to ``use_default`` (or ``use_default_access``). This allows the
-+to ``use_default``. This allows the
- user to make use of a default parameter even when she wants to
- specify a parameter later in the parameter list.  Also, the
- defaults for the corresponding associated types are somewhat
-@@ -28,6 +34,6 @@  Issue 9.45y
- the identity of the ``use_default`` type is not left unspecified
- because specification helps to highlight that the ``Reference``
- template parameter may not always be identical to the iterator's
--``reference`` type, and will keep users making mistakes based on
-+``reference`` type, and will keep users from making mistakes based on
- that assumption.
- 

Modified: boost/trunk/libs/iterator/doc/iterator_adaptor_body.rst
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_adaptor_body.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_adaptor_body.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 .. Version 1.2 of this ReStructuredText document corresponds to
    n1530_, the paper accepted by the LWG for TR1.
 

Deleted: boost/trunk/libs/iterator/doc/iterator_adaptor_ref.html
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_adaptor_ref.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_adaptor_ref.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,235 +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.3.8: http://docutils.sourceforge.net/" />
-<title></title>
-<link rel="stylesheet" href="default.css" type="text/css" />
-</head>
-<body>
-<div class="document">
-<!-- Version 1.4 of this ReStructuredText document corresponds to
-n1530_, the paper accepted by the LWG for TR1. -->
-<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.  -->
-<pre class="literal-block">
-template &lt;
-    class Derived
-  , class Base
-  , class Value               = use_default
-  , class CategoryOrTraversal = use_default
-  , class Reference           = use_default
-  , class Difference = use_default
-&gt;
-class iterator_adaptor 
-  : public iterator_facade&lt;Derived, <em>V'</em>, <em>C'</em>, <em>R'</em>, <em>D'</em>&gt; // see <a class="reference" href="#base-parameters">details</a>
-{
-    friend class iterator_core_access;
- public:
-    iterator_adaptor();
-    explicit iterator_adaptor(Base const&amp; iter);
-    typedef Base base_type;
-    Base const&amp; base() const;
- protected:
-    typedef iterator_adaptor iterator_adaptor_;
-    Base const&amp; base_reference() const;
-    Base&amp; base_reference();
- private: // Core iterator interface for iterator_facade.  
-    typename iterator_adaptor::reference dereference() const;
-
-    template &lt;
-    class OtherDerived, class OtherIterator, class V, class C, class R, class D
-    &gt;   
-    bool equal(iterator_adaptor&lt;OtherDerived, OtherIterator, V, C, R, D&gt; const&amp; x) const;
-
-    void advance(typename iterator_adaptor::difference_type n);
-    void increment();
-    void decrement();
-
-    template &lt;
-        class OtherDerived, class OtherIterator, class V, class C, class R, class D
-    &gt;   
-    typename iterator_adaptor::difference_type distance_to(
-        iterator_adaptor&lt;OtherDerived, OtherIterator, V, C, R, D&gt; const&amp; y) const;
-
- private:
-    Base m_iterator; // exposition only
-};
-</pre>
-<div class="section" id="iterator-adaptor-requirements">
-<h1><a name="iterator-adaptor-requirements"><span class="target" id="requirements"></span><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> requirements</a></h1>
-<p><tt class="docutils literal"><span class="pre">static_cast&lt;Derived*&gt;(iterator_adaptor*)</span></tt> shall be well-formed.
-The <tt class="docutils literal"><span class="pre">Base</span></tt> argument shall be Assignable and Copy Constructible.</p>
-</div>
-<div class="section" id="iterator-adaptor-base-class-parameters">
-<h1><a name="iterator-adaptor-base-class-parameters"><span class="target" id="base-parameters"></span><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> base class parameters</a></h1>
-<p>The <em>V'</em>, <em>C'</em>, <em>R'</em>, and <em>D'</em> parameters of the <tt class="docutils literal"><span class="pre">iterator_facade</span></tt>
-used as a base class in the summary of <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt>
-above are defined as follows:</p>
-<pre class="literal-block">
-<em>V'</em> = if (Value is use_default)
-          return iterator_traits&lt;Base&gt;::value_type
-      else
-          return Value
-
-<em>C'</em> = if (CategoryOrTraversal is use_default)
-          return iterator_traversal&lt;Base&gt;::type
-      else
-          return CategoryOrTraversal
-
-<em>R'</em> = if (Reference is use_default)
-          if (Value is use_default)
-              return iterator_traits&lt;Base&gt;::reference
-          else
-              return Value&amp;
-      else
-          return Reference
-
-<em>D'</em> = if (Difference is use_default)
-          return iterator_traits&lt;Base&gt;::difference_type
-      else
-          return Difference
-</pre>
-<!-- ``iterator_adaptor`` models
-- - - - - - - - - - - - - - - - - - - - - - - - - - -
-
-In order for ``Derived`` to model the iterator concepts corresponding
-to ``iterator_traits<Derived>::iterator_category``, the expressions
-involving ``m_iterator`` in the specifications of those private member
-functions of ``iterator_adaptor`` that may be called by
-``iterator_facade<Derived, V, C, R, D>`` in evaluating any valid
-expression involving ``Derived`` in those concepts' requirements. -->
-<!-- The above is confusing and needs a rewrite. -JGS -->
-<!-- That's why it's removed.  We're embracing inheritance, remember? -->
-</div>
-<div class="section" id="iterator-adaptor-public-operations">
-<h1><a name="iterator-adaptor-public-operations"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> public operations</a></h1>
-<p><tt class="docutils literal"><span class="pre">iterator_adaptor();</span></tt></p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body">The <tt class="docutils literal"><span class="pre">Base</span></tt> type must be Default Constructible.</td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> with 
-<tt class="docutils literal"><span class="pre">m_iterator</span></tt> default constructed.</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="docutils literal"><span class="pre">explicit</span> <span class="pre">iterator_adaptor(Base</span> <span class="pre">const&amp;</span> <span class="pre">iter);</span></tt></p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> with
-<tt class="docutils literal"><span class="pre">m_iterator</span></tt> copy constructed from <tt class="docutils literal"><span class="pre">iter</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="docutils literal"><span class="pre">Base</span> <span class="pre">const&amp;</span> <span class="pre">base()</span> <span class="pre">const;</span></tt></p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="docutils literal"><span class="pre">m_iterator</span></tt></td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="iterator-adaptor-protected-member-functions">
-<h1><a name="iterator-adaptor-protected-member-functions"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> protected member functions</a></h1>
-<p><tt class="docutils literal"><span class="pre">Base</span> <span class="pre">const&amp;</span> <span class="pre">base_reference()</span> <span class="pre">const;</span></tt></p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">A const reference to <tt class="docutils literal"><span class="pre">m_iterator</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="docutils literal"><span class="pre">Base&amp;</span> <span class="pre">base_reference();</span></tt></p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">A non-const reference to <tt class="docutils literal"><span class="pre">m_iterator</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section" id="iterator-adaptor-private-member-functions">
-<h1><a name="iterator-adaptor-private-member-functions"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> private member functions</a></h1>
-<p><tt class="docutils literal"><span class="pre">typename</span> <span class="pre">iterator_adaptor::reference</span> <span class="pre">dereference()</span> <span class="pre">const;</span></tt></p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="docutils literal"><span class="pre">*m_iterator</span></tt></td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;
-class OtherDerived, class OtherIterator, class V, class C, class R, class D
-&gt;   
-bool equal(iterator_adaptor&lt;OtherDerived, OtherIterator, V, C, R, D&gt; const&amp; x) const;
-</pre>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="docutils literal"><span class="pre">m_iterator</span> <span class="pre">==</span> <span class="pre">x.base()</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="docutils literal"><span class="pre">void</span> <span class="pre">advance(typename</span> <span class="pre">iterator_adaptor::difference_type</span> <span class="pre">n);</span></tt></p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><tt class="docutils literal"><span class="pre">m_iterator</span> <span class="pre">+=</span> <span class="pre">n;</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="docutils literal"><span class="pre">void</span> <span class="pre">increment();</span></tt></p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><tt class="docutils literal"><span class="pre">++m_iterator;</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p><tt class="docutils literal"><span class="pre">void</span> <span class="pre">decrement();</span></tt></p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><tt class="docutils literal"><span class="pre">--m_iterator;</span></tt></td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;
-    class OtherDerived, class OtherIterator, class V, class C, class R, class D
-&gt;   
-typename iterator_adaptor::difference_type distance_to(
-    iterator_adaptor&lt;OtherDerived, OtherIterator, V, C, R, D&gt; const&amp; y) const;
-</pre>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="docutils literal"><span class="pre">y.base()</span> <span class="pre">-</span> <span class="pre">m_iterator</span></tt></td>
-</tr>
-</tbody>
-</table>
-</div>
-</div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="iterator_adaptor_ref.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
-</body>
-</html>

Modified: boost/trunk/libs/iterator/doc/iterator_adaptor_ref.rst
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_adaptor_ref.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_adaptor_ref.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 .. Version 1.4 of this ReStructuredText document corresponds to
    n1530_, the paper accepted by the LWG for TR1.
 

Modified: boost/trunk/libs/iterator/doc/iterator_archetypes.html
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_archetypes.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_archetypes.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,295 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Iterator Archetype</title>
 <meta name="author" content="David Abrahams, Jeremy Siek, Thomas Witt" />
 <meta name="organization" content="Boost Consulting, Indiana University Open Systems Lab, Zephyr Associates, Inc." />
 <meta name="date" content="2004-11-01" />
 <meta name="copyright" content="Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2004." />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:27 $
+:Revision: $Revision: 1.6.4.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="iterator-archetype">
@@ -31,6 +313,9 @@
 <td>Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2004.</td></tr>
 </tbody>
 </table>
+<!-- Distributed under the 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 field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
@@ -43,8 +328,8 @@
 </tr>
 </tbody>
 </table>
-<div class="contents topic" id="table-of-contents">
-<p class="topic-title first"><a name="table-of-contents">Table of Contents</a></p>
+<div class="contents topic">
+<p class="topic-title first"><a id="table-of-contents" name="table-of-contents">Table of Contents</a></p>
 <ul class="simple">
 <li><a class="reference" href="#reference" id="id1" name="id1">Reference</a><ul>
 <li><a class="reference" href="#iterator-archetype-synopsis" id="id2" name="id2"><tt class="docutils literal"><span class="pre">iterator_archetype</span></tt> Synopsis</a></li>
@@ -56,10 +341,10 @@
 </li>
 </ul>
 </div>
-<div class="section" id="reference">
-<h1><a class="toc-backref" href="#id1" name="reference">Reference</a></h1>
-<div class="section" id="iterator-archetype-synopsis">
-<h2><a class="toc-backref" href="#id2" name="iterator-archetype-synopsis"><tt class="docutils literal"><span class="pre">iterator_archetype</span></tt> Synopsis</a></h2>
+<div class="section">
+<h1><a class="toc-backref" href="#id1" id="reference" name="reference">Reference</a></h1>
+<div class="section">
+<h2><a class="toc-backref" href="#id2" id="iterator-archetype-synopsis" name="iterator-archetype-synopsis"><tt class="docutils literal"><span class="pre">iterator_archetype</span></tt> Synopsis</a></h2>
 <pre class="literal-block">
 namespace iterator_archetypes
 {
@@ -88,8 +373,8 @@
 };
 </pre>
 </div>
-<div class="section" id="access-category-tags">
-<h2><a class="toc-backref" href="#id3" name="access-category-tags"><tt class="docutils literal"><span class="pre">Access</span> <span class="pre">Category</span> <span class="pre">Tags</span></tt></a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id3" id="access-category-tags" name="access-category-tags"><tt class="docutils literal"><span class="pre">Access</span> <span class="pre">Category</span> <span class="pre">Tags</span></tt></a></h2>
 <p>The access category types provided correspond to the following
 standard iterator access concept combinations:</p>
 <pre class="literal-block">
@@ -114,27 +399,27 @@
   Readable Iterator &amp; Writeable Iterator &amp; Swappable Iterator &amp; Lvalue Iterator
 </pre>
 </div>
-<div class="section" id="iterator-archetype-requirements">
-<h2><a class="toc-backref" href="#id4" name="iterator-archetype-requirements"><tt class="docutils literal"><span class="pre">iterator_archetype</span></tt> Requirements</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id4" id="iterator-archetype-requirements" name="iterator-archetype-requirements"><tt class="docutils literal"><span class="pre">iterator_archetype</span></tt> Requirements</a></h2>
 <p>The <tt class="docutils literal"><span class="pre">AccessCategory</span></tt> argument must be one of the predefined access
 category tags. The <tt class="docutils literal"><span class="pre">TraversalCategory</span></tt> must be one of the standard
 traversal tags. The <tt class="docutils literal"><span class="pre">Value</span></tt> type must satisfy the requirements of
 the iterator concept specified by <tt class="docutils literal"><span class="pre">AccessCategory</span></tt> and
 <tt class="docutils literal"><span class="pre">TraversalCategory</span></tt> as implied by the nested traits types.</p>
 </div>
-<div class="section" id="iterator-archetype-models">
-<h2><a class="toc-backref" href="#id5" name="iterator-archetype-models"><tt class="docutils literal"><span class="pre">iterator_archetype</span></tt> Models</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id5" id="iterator-archetype-models" name="iterator-archetype-models"><tt class="docutils literal"><span class="pre">iterator_archetype</span></tt> Models</a></h2>
 <p><tt class="docutils literal"><span class="pre">iterator_archetype</span></tt> models the iterator concepts specified by the
 <tt class="docutils literal"><span class="pre">AccessCategory</span></tt> and <tt class="docutils literal"><span class="pre">TraversalCategory</span></tt>
 arguments. <tt class="docutils literal"><span class="pre">iterator_archetype</span></tt> does not model any other access
 concepts or any more derived traversal concepts.</p>
 </div>
-<div class="section" id="traits">
-<h2><a class="toc-backref" href="#id6" name="traits"><tt class="docutils literal"><span class="pre">Traits</span></tt></a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id6" id="traits" name="traits"><tt class="docutils literal"><span class="pre">Traits</span></tt></a></h2>
 <p>The nested trait types are defined as follows:</p>
 <pre class="literal-block">
 if (AccessCategory == readable_iterator_t)
-  
+
   value_type = Value
   reference  = Value
   pointer    = Value*
@@ -152,7 +437,7 @@
   reference :=
 
     A type X that is convertible to Value for which the following
-    expression is valid. Given an object x of type X and v of type 
+    expression is valid. Given an object x of type X and v of type
     Value.
 
     x = v
@@ -160,13 +445,13 @@
   pointer    = Value*
 
 else if (AccessCategory == readable_lvalue_iterator_t)
-  
+
   value_type = Value
   reference  = Value const&amp;
   pointer    = Value const*
 
 else if (AccessCategory == writable_lvalue_iterator_t)
-  
+
   value_type = Value
   reference  = Value&amp;
   pointer    = Value*
@@ -180,7 +465,7 @@
   difference_type := unspecified type
 
 
-iterator_category := 
+iterator_category :=
 
   A type X satisfying the following two constraints:
 
@@ -211,10 +496,5 @@
 </div>
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="iterator_archetypes.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/iterator_archetypes.rst
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_archetypes.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_archetypes.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 ++++++++++++++++++++
  Iterator Archetype
 ++++++++++++++++++++
@@ -6,7 +10,7 @@
 :Contact: dave at boost-consulting.com, jsiek at osl.iu.edu, witt at styleadvisor.com
 :organization: `Boost Consulting`_, Indiana University `Open Systems
                Lab`_, `Zephyr Associates, Inc.`_
-:date: $Date: 2004/11/01 21:23:47 $
+:date: $Date: 2006/09/11 22:27:27 $
 :copyright: Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2004. 
 
 .. _`Boost Consulting`: http://www.boost-consulting.com

Modified: boost/trunk/libs/iterator/doc/iterator_concepts.html
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_concepts.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_concepts.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,295 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Iterator Concepts</title>
 <meta name="author" content="David Abrahams, Jeremy Siek, Thomas Witt" />
 <meta name="organization" content="Boost Consulting, Indiana University Open Systems Lab, Zephyr Associates, Inc." />
 <meta name="date" content="2004-11-01" />
 <meta name="copyright" content="Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2004." />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:27 $
+:Revision: $Revision: 1.3.4.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="iterator-concepts">
@@ -31,6 +313,9 @@
 <td>Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2004.</td></tr>
 </tbody>
 </table>
+<!-- Distributed under the 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 field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
@@ -44,10 +329,10 @@
 </table>
 <p>For an introduction to using concept checking classes, see
 the documentation for the <a class="reference" href="../../concept_check/index.html"><tt class="docutils literal"><span class="pre">boost::concept_check</span></tt></a> library.</p>
-<div class="section" id="reference">
-<h1><a name="reference">Reference</a></h1>
-<div class="section" id="iterator-access-concepts">
-<h2><a name="iterator-access-concepts">Iterator Access Concepts</a></h2>
+<div class="section">
+<h1><a id="reference" name="reference">Reference</a></h1>
+<div class="section">
+<h2><a id="iterator-access-concepts" name="iterator-access-concepts">Iterator Access Concepts</a></h2>
 <ul class="simple">
 <li><a class="reference" href="ReadableIterator.html"><em>Readable Iterator</em></a></li>
 <li><a class="reference" href="WritableIterator.html"><em>Writable Iterator</em></a></li>
@@ -55,8 +340,8 @@
 <li><a class="reference" href="LvalueIterator.html"><em>Lvalue Iterator</em></a></li>
 </ul>
 </div>
-<div class="section" id="iterator-traversal-concepts">
-<h2><a name="iterator-traversal-concepts">Iterator Traversal Concepts</a></h2>
+<div class="section">
+<h2><a id="iterator-traversal-concepts" name="iterator-traversal-concepts">Iterator Traversal Concepts</a></h2>
 <ul class="simple">
 <li><a class="reference" href="IncrementableIterator.html"><em>Incrementable Iterator</em></a></li>
 <li><a class="reference" href="SinglePassIterator.html"><em>Single Pass Iterator</em></a></li>
@@ -65,8 +350,8 @@
 <li><a class="reference" href="RandomAccessTraversal.html"><em>Random Access Traversal</em></a></li>
 </ul>
 </div>
-<div class="section" id="iterator-concepts-hpp-synopsis">
-<h2><a name="iterator-concepts-hpp-synopsis"><tt class="docutils literal"><span class="pre">iterator_concepts.hpp</span></tt> Synopsis</a></h2>
+<div class="section">
+<h2><a id="iterator-concepts-hpp-synopsis" name="iterator-concepts-hpp-synopsis"><tt class="docutils literal"><span class="pre">iterator_concepts.hpp</span></tt> Synopsis</a></h2>
 <pre class="literal-block">
 namespace boost_concepts {
 
@@ -114,10 +399,5 @@
 </div>
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="iterator_concepts.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/iterator_concepts.rst
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_concepts.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_concepts.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
-
 ++++++++++++++++++
  Iterator Concepts
 ++++++++++++++++++
@@ -8,7 +10,7 @@
 :Contact: dave at boost-consulting.com, jsiek at osl.iu.edu, witt at styleadvisor.com
 :organization: `Boost Consulting`_, Indiana University `Open Systems
                Lab`_, `Zephyr Associates, Inc.`_
-:date: $Date: 2004/11/01 21:23:47 $
+:date: $Date: 2006/09/11 22:27:27 $
 :copyright: Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2004. 
 
 .. _`Boost Consulting`: http://www.boost-consulting.com

Modified: boost/trunk/libs/iterator/doc/iterator_facade.html
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_facade.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_facade.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,295 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Iterator Facade</title>
 <meta name="author" content="David Abrahams, Jeremy Siek, Thomas Witt" />
 <meta name="organization" content="Boost Consulting, Indiana University Open Systems Lab, University of Hanover Institute for Transport Railway Operation and Construction" />
 <meta name="date" content="2004-11-01" />
 <meta name="copyright" content="Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003." />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:27 $
+:Revision: $Revision: 1.31.2.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="iterator-facade">
@@ -32,18 +314,24 @@
 <td>Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.</td></tr>
 </tbody>
 </table>
+<!-- Distributed under the 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 field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">abstract:</th><td class="field-body"><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> is a base class template that implements the
+<tr class="field"><th class="field-name">abstract:</th><td class="field-body"><!-- 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) -->
+<tt class="docutils literal"><span class="pre">iterator_facade</span></tt> is a base class template that implements the
 interface of standard iterators in terms of a few core functions
 and associated types, to be supplied by a derived iterator class.</td>
 </tr>
 </tbody>
 </table>
-<div class="contents topic" id="table-of-contents">
-<p class="topic-title first"><a name="table-of-contents">Table of Contents</a></p>
+<div class="contents topic">
+<p class="topic-title first"><a id="table-of-contents" name="table-of-contents">Table of Contents</a></p>
 <ul class="simple">
 <li><a class="reference" href="#overview" id="id23" name="id23">Overview</a><ul>
 <li><a class="reference" href="#usage" id="id24" name="id24">Usage</a></li>
@@ -80,11 +368,14 @@
 </li>
 </ul>
 </div>
-<div class="section" id="overview">
-<h1><a class="toc-backref" href="#id23" name="overview">Overview</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id23" id="overview" name="overview">Overview</a></h1>
+<!-- Distributed under the Boost -->
+<!-- Software License, Version 1.0. (See accompanying -->
+<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <!-- Version 1.1 of this ReStructuredText document corresponds to
 n1530_, the paper accepted by the LWG for TR1. -->
-<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.  -->
+<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. -->
 <p>While the iterator interface is rich, there is a core subset of the
 interface that is necessary for all the functionality.  We have
 identified the following core behaviors for iterators:</p>
@@ -124,8 +415,8 @@
 impossible.</li>
 </ol>
 </blockquote>
-<div class="section" id="usage">
-<h2><a class="toc-backref" href="#id24" name="usage">Usage</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id24" id="usage" name="usage">Usage</a></h2>
 <p>The user of <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> derives his iterator class from a
 specialization of <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> and passes the derived
 iterator class as <tt class="docutils literal"><span class="pre">iterator_facade</span></tt>'s first template parameter.
@@ -148,8 +439,8 @@
 <col width="56%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th>Expression</th>
-<th>Effects</th>
+<tr><th class="head">Expression</th>
+<th class="head">Effects</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -188,8 +479,8 @@
 Iterator or a more-refined iterator concept, a default constructor is
 required.</p>
 </div>
-<div class="section" id="iterator-core-access">
-<h2><a class="toc-backref" href="#id25" name="iterator-core-access">Iterator Core Access</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id25" id="iterator-core-access" name="iterator-core-access">Iterator Core Access</a></h2>
 <p><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> and the operator implementations need to be able
 to access the core member functions in the derived class.  Making the
 core member functions public would expose an implementation detail to
@@ -212,7 +503,7 @@
 in the derived iterator class.  The author of the derived class only
 needs to grant friendship to <tt class="docutils literal"><span class="pre">iterator_core_access</span></tt> to make his core
 member functions available to the library.</p>
-<!-- This is no long uptodate -thw  -->
+<!-- This is no long uptodate -thw -->
 <!-- Yes it is; I made sure of it! -DWA -->
 <p><tt class="docutils literal"><span class="pre">iterator_core_access</span></tt> will be typically implemented as an empty
 class containing only private static member functions which invoke the
@@ -222,8 +513,8 @@
 open a safety loophole, as every core member function preserves the
 invariants of the iterator.</p>
 </div>
-<div class="section" id="operator">
-<h2><a class="toc-backref" href="#id26" name="operator"><tt class="docutils literal"><span class="pre">operator[]</span></tt></a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id26" id="operator" name="operator"><tt class="docutils literal"><span class="pre">operator[]</span></tt></a></h2>
 <p>The indexing operator for a generalized iterator presents special
 challenges.  A random access iterator's <tt class="docutils literal"><span class="pre">operator[]</span></tt> is only
 required to return something convertible to its <tt class="docutils literal"><span class="pre">value_type</span></tt>.
@@ -245,8 +536,8 @@
 class; it will hide the one supplied by <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> from
 clients of her iterator.</p>
 </div>
-<div class="section" id="id2">
-<h2><a class="toc-backref" href="#id27" name="id2"><span class="target" id="operator-arrow"></span><tt class="docutils literal"><span class="pre">operator-&gt;</span></tt></a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id27" id="id2" name="id2"><span id="operator-arrow"></span><tt class="docutils literal"><span class="pre">operator-&gt;</span></tt></a></h2>
 <p>The <tt class="docutils literal"><span class="pre">reference</span></tt> type of a readable iterator (and today's input
 iterator) need not in fact be a reference, so long as it is
 convertible to the iterator's <tt class="docutils literal"><span class="pre">value_type</span></tt>.  When the <tt class="docutils literal"><span class="pre">value_type</span></tt>
@@ -267,11 +558,14 @@
 </table>
 </div>
 </div>
-<div class="section" id="reference">
-<h1><a class="toc-backref" href="#id28" name="reference">Reference</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id28" id="reference" name="reference">Reference</a></h1>
+<!-- Distributed under the Boost -->
+<!-- Software License, Version 1.0. (See accompanying -->
+<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <!-- Version 1.3 of this ReStructuredText document corresponds to
 n1530_, the paper accepted by the LWG for TR1. -->
-<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.  -->
+<!-- Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. -->
 <pre class="literal-block">
 template &lt;
     class Derived
@@ -355,12 +649,12 @@
 Derived operator+ (typename Derived::difference_type n,
                    iterator_facade&lt;Dr,V,TC,R,D&gt; const&amp;);
 </pre>
-<span class="target" id="iterator-category"></span><p>The <tt class="docutils literal"><span class="pre">iterator_category</span></tt> member of <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> is</p>
+<p id="iterator-category">The <tt class="docutils literal"><span class="pre">iterator_category</span></tt> member of <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> is</p>
 <pre class="literal-block">
 <em>iterator-category</em>(CategoryOrTraversal, value_type, reference)
 </pre>
 <p>where <em>iterator-category</em> is defined as follows:</p>
-<span class="target" id="id7"></span><pre class="literal-block">
+<pre class="literal-block" id="id7">
 <em>iterator-category</em>(C,R,V) :=
    if (C is convertible to std::input_iterator_tag
        || C is convertible to std::output_iterator_tag
@@ -407,10 +701,10 @@
 <!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <p>The <tt class="docutils literal"><span class="pre">enable_if_interoperable</span></tt> template used above is for exposition
 purposes.  The member operators should only be in an overload set
-provided the derived types <tt class="docutils literal"><span class="pre">Dr1</span></tt> and <tt class="docutils literal"><span class="pre">Dr2</span></tt> are interoperable, 
+provided the derived types <tt class="docutils literal"><span class="pre">Dr1</span></tt> and <tt class="docutils literal"><span class="pre">Dr2</span></tt> are interoperable,
 meaning that at least one of the types is convertible to the other.  The
 <tt class="docutils literal"><span class="pre">enable_if_interoperable</span></tt> approach uses SFINAE to take the operators
-out of the overload set when the types are not interoperable.  
+out of the overload set when the types are not interoperable.
 The operators should behave <em>as-if</em> <tt class="docutils literal"><span class="pre">enable_if_interoperable</span></tt>
 were defined to be:</p>
 <pre class="literal-block">
@@ -428,8 +722,8 @@
     &gt;
 {};
 </pre>
-<div class="section" id="iterator-facade-requirements">
-<h2><a class="toc-backref" href="#id29" name="iterator-facade-requirements"><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> Requirements</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id29" id="iterator-facade-requirements" name="iterator-facade-requirements"><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> Requirements</a></h2>
 <p>The following table describes the typical valid expressions on
 <tt class="docutils literal"><span class="pre">iterator_facade</span></tt>'s <tt class="docutils literal"><span class="pre">Derived</span></tt> parameter, depending on the
 iterator concept(s) it will model.  The operations in the first
@@ -442,8 +736,8 @@
 object of a single pass iterator type interoperable with <tt class="docutils literal"><span class="pre">X</span></tt>, and <tt class="docutils literal"><span class="pre">z</span></tt>
 is a constant object of a random access traversal iterator type
 interoperable with <tt class="docutils literal"><span class="pre">X</span></tt>.</p>
-<span class="target" id="core-operations"></span><div class="topic">
-<p class="topic-title first"><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> Core Operations</p>
+<div class="topic">
+<p class="topic-title first"><a id="core-operations" name="core-operations"><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> Core Operations</a></p>
 <table border="1" class="docutils">
 <colgroup>
 <col width="21%" />
@@ -452,10 +746,10 @@
 <col width="29%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th>Expression</th>
-<th>Return Type</th>
-<th>Assertion/Note</th>
-<th>Used to implement Iterator
+<tr><th class="head">Expression</th>
+<th class="head">Return Type</th>
+<th class="head">Assertion/Note</th>
+<th class="head">Used to implement Iterator
 Concept(s)</th>
 </tr>
 </thead>
@@ -502,8 +796,8 @@
 </table>
 </div>
 </div>
-<div class="section" id="iterator-facade-operations">
-<h2><a class="toc-backref" href="#id30" name="iterator-facade-operations"><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> operations</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id30" id="iterator-facade-operations" name="iterator-facade-operations"><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> operations</a></h2>
 <p>The operations in this section are described in terms of operations on
 the core interface of <tt class="docutils literal"><span class="pre">Derived</span></tt> which may be inaccessible
 (i.e. private).  The implementation should access these operations
@@ -527,14 +821,14 @@
 <pre class="literal-block">
 &amp;static_cast&lt;Derived const*&gt;(this)-&gt;dereference()
 </pre>
-<p class="last">Otherwise returns an object of unspecified type such that, 
+<p class="last">Otherwise returns an object of unspecified type such that,
 <tt class="docutils literal"><span class="pre">(*static_cast&lt;Derived</span> <span class="pre">const*&gt;(this))-&gt;m</span></tt> is equivalent to <tt class="docutils literal"><span class="pre">(w</span> <span class="pre">=</span> <span class="pre">**static_cast&lt;Derived</span> <span class="pre">const*&gt;(this),</span>
 <span class="pre">w.m)</span></tt> for some temporary object <tt class="docutils literal"><span class="pre">w</span></tt> of type <tt class="docutils literal"><span class="pre">value_type</span></tt>.</p>
 </td>
 </tr>
 </tbody>
 </table>
-<span class="target" id="brackets"></span><p><em>unspecified</em> <tt class="docutils literal"><span class="pre">operator[](difference_type</span> <span class="pre">n)</span> <span class="pre">const;</span></tt></p>
+<p id="brackets"><em>unspecified</em> <tt class="docutils literal"><span class="pre">operator[](difference_type</span> <span class="pre">n)</span> <span class="pre">const;</span></tt></p>
 <table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
@@ -675,10 +969,12 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
 <dl class="last docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).equal((Dr2</span> <span class="pre">const&amp;)rhs)</span></tt>.</dd>
-<dt>Otherwise, </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).equal((Dr1</span> <span class="pre">const&amp;)lhs)</span></tt>.</dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).equal((Dr2</span> <span class="pre">const&amp;)rhs)</span></tt>.</p>
+</dd>
+<dt>Otherwise,</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).equal((Dr1</span> <span class="pre">const&amp;)lhs)</span></tt>.</p>
+</dd>
 </dl>
 </td>
 </tr>
@@ -697,10 +993,12 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
 <dl class="last docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">!((Dr1</span> <span class="pre">const&amp;)lhs).equal((Dr2</span> <span class="pre">const&amp;)rhs)</span></tt>.</dd>
-<dt>Otherwise, </dt>
-<dd><tt class="docutils literal"><span class="pre">!((Dr2</span> <span class="pre">const&amp;)rhs).equal((Dr1</span> <span class="pre">const&amp;)lhs)</span></tt>.</dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">!((Dr1</span> <span class="pre">const&amp;)lhs).equal((Dr2</span> <span class="pre">const&amp;)rhs)</span></tt>.</p>
+</dd>
+<dt>Otherwise,</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">!((Dr2</span> <span class="pre">const&amp;)rhs).equal((Dr1</span> <span class="pre">const&amp;)lhs)</span></tt>.</p>
+</dd>
 </dl>
 </td>
 </tr>
@@ -719,10 +1017,12 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
 <dl class="last docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&lt;</span> <span class="pre">0</span></tt>.</dd>
-<dt>Otherwise, </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&gt;</span> <span class="pre">0</span></tt>.</dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&lt;</span> <span class="pre">0</span></tt>.</p>
+</dd>
+<dt>Otherwise,</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&gt;</span> <span class="pre">0</span></tt>.</p>
+</dd>
 </dl>
 </td>
 </tr>
@@ -741,10 +1041,12 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
 <dl class="last docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&lt;=</span> <span class="pre">0</span></tt>.</dd>
-<dt>Otherwise, </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&gt;=</span> <span class="pre">0</span></tt>.</dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&lt;=</span> <span class="pre">0</span></tt>.</p>
+</dd>
+<dt>Otherwise,</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&gt;=</span> <span class="pre">0</span></tt>.</p>
+</dd>
 </dl>
 </td>
 </tr>
@@ -763,10 +1065,12 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
 <dl class="last docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&gt;</span> <span class="pre">0</span></tt>.</dd>
-<dt>Otherwise, </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&lt;</span> <span class="pre">0</span></tt>.</dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&gt;</span> <span class="pre">0</span></tt>.</p>
+</dd>
+<dt>Otherwise,</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&lt;</span> <span class="pre">0</span></tt>.</p>
+</dd>
 </dl>
 </td>
 </tr>
@@ -785,16 +1089,18 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
 <dl class="last docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&gt;=</span> <span class="pre">0</span></tt>.</dd>
-<dt>Otherwise, </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&lt;=</span> <span class="pre">0</span></tt>.</dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span> <span class="pre">&gt;=</span> <span class="pre">0</span></tt>.</p>
+</dd>
+<dt>Otherwise,</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span> <span class="pre">&lt;=</span> <span class="pre">0</span></tt>.</p>
+</dd>
 </dl>
 </td>
 </tr>
 </tbody>
 </table>
-<span class="target" id="minus"></span><pre class="literal-block">
+<pre class="literal-block" id="minus">
 template &lt;class Dr1, class V1, class TC1, class R1, class D1,
           class Dr2, class V2, class TC2, class R2, class D2&gt;
 typename enable_if_interoperable&lt;Dr1,Dr2,difference&gt;::type
@@ -806,23 +1112,27 @@
 <col class="field-body" />
 <tbody valign="top">
 <tr class="field"><th class="field-name">Return Type:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
-<blockquote class="last">
+<blockquote>
 <dl class="docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">difference</span></tt> shall be
-<tt class="docutils literal"><span class="pre">iterator_traits&lt;Dr1&gt;::difference_type</span></tt>.</dd>
-<dt>Otherwise </dt>
-<dd><tt class="docutils literal"><span class="pre">difference</span></tt> shall be <tt class="docutils literal"><span class="pre">iterator_traits&lt;Dr2&gt;::difference_type</span></tt></dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">difference</span></tt> shall be
+<tt class="docutils literal"><span class="pre">iterator_traits&lt;Dr1&gt;::difference_type</span></tt>.</p>
+</dd>
+<dt>Otherwise</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">difference</span></tt> shall be <tt class="docutils literal"><span class="pre">iterator_traits&lt;Dr2&gt;::difference_type</span></tt></p>
+</dd>
 </dl>
 </blockquote>
 </td>
 </tr>
 <tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">if <tt class="docutils literal"><span class="pre">is_convertible&lt;Dr2,Dr1&gt;::value</span></tt></p>
 <dl class="last docutils">
-<dt>then </dt>
-<dd><tt class="docutils literal"><span class="pre">-((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span></tt>.</dd>
-<dt>Otherwise, </dt>
-<dd><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span></tt>.</dd>
+<dt>then</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">-((Dr1</span> <span class="pre">const&amp;)lhs).distance_to((Dr2</span> <span class="pre">const&amp;)rhs)</span></tt>.</p>
+</dd>
+<dt>Otherwise,</dt>
+<dd><p class="first last"><tt class="docutils literal"><span class="pre">((Dr2</span> <span class="pre">const&amp;)rhs).distance_to((Dr1</span> <span class="pre">const&amp;)lhs)</span></tt>.</p>
+</dd>
 </dl>
 </td>
 </tr>
@@ -830,8 +1140,8 @@
 </table>
 </div>
 </div>
-<div class="section" id="tutorial-example">
-<h1><a class="toc-backref" href="#id31" name="tutorial-example">Tutorial Example</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id31" id="tutorial-example" name="tutorial-example">Tutorial Example</a></h1>
 <!-- Copyright David Abrahams 2004. Use, modification and distribution is -->
 <!-- subject to the Boost Software License, Version 1.0. (See accompanying -->
 <!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
@@ -840,8 +1150,8 @@
 example of a linked list of polymorphic objects.  This example was
 inspired by a <a class="reference" href="http://thread.gmane.org/gmane.comp.lib.boost.user/5100">posting</a> by Keith Macdonald on the <a class="reference" href="../../../more/mailing_lists.htm#users">Boost-Users</a>
 mailing list.</p>
-<div class="section" id="the-problem">
-<h2><a class="toc-backref" href="#id32" name="the-problem">The Problem</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id32" id="the-problem" name="the-problem">The Problem</a></h2>
 <p>Say we've written a polymorphic linked list node base class:</p>
 <pre class="literal-block">
 # include &lt;iostream&gt;
@@ -858,16 +1168,16 @@
 
     // print to the stream
     virtual void print(std::ostream&amp; s) const = 0;
-    
+
     // double the value
     virtual void double_me() = 0;
 
     void append(node_base* p)
     {
-        if (m_next) 
-            m_next-&gt;append(p); 
+        if (m_next)
+            m_next-&gt;append(p);
         else
-            m_next = p; 
+            m_next = p;
     }
 
  private:
@@ -902,8 +1212,8 @@
 <p>Our first challenge is to build an appropriate iterator over these
 lists.</p>
 </div>
-<div class="section" id="a-basic-iterator-using-iterator-facade">
-<h2><a class="toc-backref" href="#id33" name="a-basic-iterator-using-iterator-facade">A Basic Iterator Using <tt class="docutils literal"><span class="pre">iterator_facade</span></tt></a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id33" id="a-basic-iterator-using-iterator-facade" name="a-basic-iterator-using-iterator-facade">A Basic Iterator Using <tt class="docutils literal"><span class="pre">iterator_facade</span></tt></a></h2>
 <p>We will construct a <tt class="docutils literal"><span class="pre">node_iterator</span></tt> class using inheritance from
 <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> to implement most of the iterator's operations.</p>
 <pre class="literal-block">
@@ -916,25 +1226,25 @@
    ...
 };
 </pre>
-<div class="section" id="template-arguments-for-iterator-facade">
-<h3><a class="toc-backref" href="#id34" name="template-arguments-for-iterator-facade">Template Arguments for <tt class="docutils literal"><span class="pre">iterator_facade</span></tt></a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id34" id="template-arguments-for-iterator-facade" name="template-arguments-for-iterator-facade">Template Arguments for <tt class="docutils literal"><span class="pre">iterator_facade</span></tt></a></h3>
 <p><tt class="docutils literal"><span class="pre">iterator_facade</span></tt> has several template parameters, so we must decide
 what types to use for the arguments. The parameters are <tt class="docutils literal"><span class="pre">Derived</span></tt>,
 <tt class="docutils literal"><span class="pre">Value</span></tt>, <tt class="docutils literal"><span class="pre">CategoryOrTraversal</span></tt>, <tt class="docutils literal"><span class="pre">Reference</span></tt>, and <tt class="docutils literal"><span class="pre">Difference</span></tt>.</p>
-<div class="section" id="derived">
-<h4><a class="toc-backref" href="#id35" name="derived"><tt class="docutils literal"><span class="pre">Derived</span></tt></a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id35" id="derived" name="derived"><tt class="docutils literal"><span class="pre">Derived</span></tt></a></h4>
 <p>Because <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> is meant to be used with the CRTP
 <a class="citation-reference" href="#cop95" id="id10" name="id10">[Cop95]</a> the first parameter is the iterator class name itself,
 <tt class="docutils literal"><span class="pre">node_iterator</span></tt>.</p>
 </div>
-<div class="section" id="value">
-<h4><a class="toc-backref" href="#id36" name="value"><tt class="docutils literal"><span class="pre">Value</span></tt></a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id36" id="value" name="value"><tt class="docutils literal"><span class="pre">Value</span></tt></a></h4>
 <p>The <tt class="docutils literal"><span class="pre">Value</span></tt> parameter determines the <tt class="docutils literal"><span class="pre">node_iterator</span></tt>'s
 <tt class="docutils literal"><span class="pre">value_type</span></tt>.  In this case, we are iterating over <tt class="docutils literal"><span class="pre">node_base</span></tt>
 objects, so <tt class="docutils literal"><span class="pre">Value</span></tt> will be <tt class="docutils literal"><span class="pre">node_base</span></tt>.</p>
 </div>
-<div class="section" id="categoryortraversal">
-<h4><a class="toc-backref" href="#id37" name="categoryortraversal"><tt class="docutils literal"><span class="pre">CategoryOrTraversal</span></tt></a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id37" id="categoryortraversal" name="categoryortraversal"><tt class="docutils literal"><span class="pre">CategoryOrTraversal</span></tt></a></h4>
 <p>Now we have to determine which <a class="reference" href="new-iter-concepts.html#iterator-traversal-concepts-lib-iterator-traversal">iterator traversal concept</a> our
 <tt class="docutils literal"><span class="pre">node_iterator</span></tt> is going to model.  Singly-linked lists only have
 forward links, so our iterator can't can't be a <a class="reference" href="new-iter-concepts.html#bidirectional-traversal-iterators-lib-bidirectional-traversal-iterators">bidirectional
@@ -953,8 +1263,8 @@
 </tbody>
 </table>
 </div>
-<div class="section" id="id12">
-<h4><a class="toc-backref" href="#id38" name="id12"><tt class="docutils literal"><span class="pre">Reference</span></tt></a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id38" id="id12" name="id12"><tt class="docutils literal"><span class="pre">Reference</span></tt></a></h4>
 <p>The <tt class="docutils literal"><span class="pre">Reference</span></tt> argument becomes the type returned by
 <tt class="docutils literal"><span class="pre">node_iterator</span></tt>'s dereference operation, and will also be the
 same as <tt class="docutils literal"><span class="pre">std::iterator_traits&lt;node_iterator&gt;::reference</span></tt>.  The
@@ -962,8 +1272,8 @@
 <tt class="docutils literal"><span class="pre">node_base&amp;</span></tt> is a good choice for the iterator's <tt class="docutils literal"><span class="pre">reference</span></tt>
 type, we can omit this argument, or pass <tt class="docutils literal"><span class="pre">use_default</span></tt>.</p>
 </div>
-<div class="section" id="difference">
-<h4><a class="toc-backref" href="#id39" name="difference"><tt class="docutils literal"><span class="pre">Difference</span></tt></a></h4>
+<div class="section">
+<h4><a class="toc-backref" href="#id39" id="difference" name="difference"><tt class="docutils literal"><span class="pre">Difference</span></tt></a></h4>
 <p>The <tt class="docutils literal"><span class="pre">Difference</span></tt> argument determines how the distance between
 two <tt class="docutils literal"><span class="pre">node_iterator</span></tt>s will be measured and will also be the
 same as <tt class="docutils literal"><span class="pre">std::iterator_traits&lt;node_iterator&gt;::difference_type</span></tt>.
@@ -989,8 +1299,8 @@
 </pre>
 </div>
 </div>
-<div class="section" id="constructors-and-data-members">
-<h3><a class="toc-backref" href="#id40" name="constructors-and-data-members">Constructors and Data Members</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id40" id="constructors-and-data-members" name="constructors-and-data-members">Constructors and Data Members</a></h3>
 <p>Next we need to decide how to represent the iterator's position.
 This representation will take the form of data members, so we'll
 also need to write constructors to initialize them.  The
@@ -1034,8 +1344,8 @@
 </tbody>
 </table>
 </div>
-<div class="section" id="implementing-the-core-operations">
-<h3><a class="toc-backref" href="#id41" name="implementing-the-core-operations">Implementing the Core Operations</a></h3>
+<div class="section">
+<h3><a class="toc-backref" href="#id41" id="implementing-the-core-operations" name="implementing-the-core-operations">Implementing the Core Operations</a></h3>
 <p>The last step is to implement the <a class="reference" href="#core-operations">core operations</a> required by
 the concepts we want our iterator to model.  Referring to the
 <a class="reference" href="#core-operations">table</a>, we can see that the first three rows are applicable
@@ -1085,8 +1395,8 @@
 iterator!  For a working example of its use, see <a class="reference" href="../example/node_iterator1.cpp">this program</a>.</p>
 </div>
 </div>
-<div class="section" id="a-constant-node-iterator">
-<h2><a class="toc-backref" href="#id42" name="a-constant-node-iterator">A constant <tt class="docutils literal"><span class="pre">node_iterator</span></tt></a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id42" id="a-constant-node-iterator" name="a-constant-node-iterator">A constant <tt class="docutils literal"><span class="pre">node_iterator</span></tt></a></h2>
 <div class="sidebar">
 <p class="first sidebar-title">Constant and Mutable iterators</p>
 <p>The term <strong>mutable iterator</strong> means an iterator through which
@@ -1186,8 +1496,8 @@
 typedef node_iter&lt;node_base const&gt; node_const_iterator;
 </pre>
 </div>
-<div class="section" id="interoperability">
-<h2><a class="toc-backref" href="#id43" name="interoperability">Interoperability</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id43" id="interoperability" name="interoperability">Interoperability</a></h2>
 <p>Our <tt class="docutils literal"><span class="pre">const_node_iterator</span></tt> works perfectly well on its own, but
 taken together with <tt class="docutils literal"><span class="pre">node_iterator</span></tt> it doesn't quite meet
 expectations.  For example, we'd like to be able to pass a
@@ -1226,7 +1536,7 @@
 
     template &lt;class OtherValue&gt;
     bool equal(node_iter&lt;OtherValue&gt; const&amp; other) const
-    { 
+    {
         return this-&gt;m_node == other.m_node;
     }
 
@@ -1259,8 +1569,8 @@
 <p>You can see an example program which exercises our interoperable
 iterators <a class="reference" href="../example/node_iterator2.cpp">here</a>.</p>
 </div>
-<div class="section" id="telling-the-truth">
-<h2><a class="toc-backref" href="#id44" name="telling-the-truth">Telling the Truth</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id44" id="telling-the-truth" name="telling-the-truth">Telling the Truth</a></h2>
 <p>Now <tt class="docutils literal"><span class="pre">node_iterator</span></tt> and <tt class="docutils literal"><span class="pre">node_const_iterator</span></tt> behave exactly as
 you'd expect... almost.  We can compare them and we can convert in
 one direction: from <tt class="docutils literal"><span class="pre">node_iterator</span></tt> to <tt class="docutils literal"><span class="pre">node_const_iterator</span></tt>.
@@ -1286,7 +1596,7 @@
 
   ...
 
-private: 
+private:
   struct enabler {};
 
 public:
@@ -1301,8 +1611,8 @@
     : m_node(other.m_node) {}
 </pre>
 </div>
-<div class="section" id="wrap-up">
-<h2><a class="toc-backref" href="#id45" name="wrap-up">Wrap Up</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id45" id="wrap-up" name="wrap-up">Wrap Up</a></h2>
 <p>This concludes our <tt class="docutils literal"><span class="pre">iterator_facade</span></tt> tutorial, but before you
 stop reading we urge you to take a look at <a class="reference" href="iterator_adaptor.html"><tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt></a>.
 There's another way to approach writing these iterators which might
@@ -1310,10 +1620,5 @@
 </div>
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="iterator_facade.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/iterator_facade.rst
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_facade.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_facade.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 ++++++++++++++++
  Iterator Facade
 ++++++++++++++++
@@ -7,7 +11,7 @@
 :organization: `Boost Consulting`_, Indiana University `Open Systems
                Lab`_, University of Hanover `Institute for Transport
                Railway Operation and Construction`_
-:date: $Date: 2004/11/01 21:23:47 $
+:date: $Date: 2006/09/11 22:27:27 $
 :copyright: Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. 
 
 .. _`Boost Consulting`: http://www.boost-consulting.com

Modified: boost/trunk/libs/iterator/doc/iterator_facade_abstract.rst
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_facade_abstract.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_facade_abstract.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 ``iterator_facade`` is a base class template that implements the
 interface of standard iterators in terms of a few core functions
 and associated types, to be supplied by a derived iterator class.

Modified: boost/trunk/libs/iterator/doc/iterator_facade_body.rst
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_facade_body.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_facade_body.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 .. Version 1.1 of this ReStructuredText document corresponds to
    n1530_, the paper accepted by the LWG for TR1.
 

Modified: boost/trunk/libs/iterator/doc/iterator_facade_ref.rst
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_facade_ref.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_facade_ref.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 .. Version 1.3 of this ReStructuredText document corresponds to
    n1530_, the paper accepted by the LWG for TR1.
 

Modified: boost/trunk/libs/iterator/doc/iterator_traits.html
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_traits.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_traits.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,295 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Iterator Traits</title>
 <meta name="author" content="David Abrahams" />
 <meta name="organization" content="Boost Consulting" />
 <meta name="date" content="2004-11-01" />
 <meta name="copyright" content="Copyright David Abrahams 2004." />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:27 $
+:Revision: $Revision: 1.4.2.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="iterator-traits">
@@ -30,41 +312,44 @@
 <td>Copyright David Abrahams 2004.</td></tr>
 </tbody>
 </table>
+<!-- Distributed under the 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 field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
 <tr class="field"><th class="field-name">abstract:</th><td class="field-body">Header <tt class="docutils literal"><span class="pre">&lt;boost/iterator/iterator_traits.hpp&gt;</span></tt> provides
 the ability to access an iterator's associated types using
-MPL-compatible <a class="reference" href="../../mpl/doc/refmanual/metafunction.html">metafunctions</a>.</td>
+MPL-compatible <a class="reference" href="../../mpl/doc/index.html#metafunctions">metafunctions</a>.</td>
 </tr>
 </tbody>
 </table>
-<div class="section" id="overview">
-<h1><a name="overview">Overview</a></h1>
+<div class="section">
+<h1><a id="overview" name="overview">Overview</a></h1>
 <p><tt class="docutils literal"><span class="pre">std::iterator_traits</span></tt> provides access to five associated types
 of any iterator: its <tt class="docutils literal"><span class="pre">value_type</span></tt>, <tt class="docutils literal"><span class="pre">reference</span></tt>, <tt class="docutils literal"><span class="pre">pointer</span></tt>,
 <tt class="docutils literal"><span class="pre">iterator_category</span></tt>, and <tt class="docutils literal"><span class="pre">difference_type</span></tt>.  Unfortunately,
 such a &quot;multi-valued&quot; traits template can be difficult to use in a
 metaprogramming context.  <tt class="docutils literal"><span class="pre">&lt;boost/iterator/iterator_traits.hpp&gt;</span></tt>
-provides access to these types using a standard <a class="reference" href="../../mpl/doc/refmanual/metafunction.html">metafunctions</a>.</p>
+provides access to these types using a standard <a class="reference" href="../../mpl/doc/index.html#metafunctions">metafunctions</a>.</p>
 </div>
-<div class="section" id="summary">
-<h1><a name="summary">Summary</a></h1>
+<div class="section">
+<h1><a id="summary" name="summary">Summary</a></h1>
 <p>Header <tt class="docutils literal"><span class="pre">&lt;boost/iterator/iterator_traits.hpp&gt;</span></tt>:</p>
 <pre class="literal-block">
 template &lt;class Iterator&gt;
 struct iterator_value
 {
-    typedef typename 
-      std::iterator_traits&lt;Iterator&gt;::value_type 
+    typedef typename
+      std::iterator_traits&lt;Iterator&gt;::value_type
     type;
 };
 
 template &lt;class Iterator&gt;
 struct iterator_reference
 {
-    typedef typename 
+    typedef typename
       std::iterator_traits&lt;Iterator&gt;::reference
     type;
 };
@@ -73,8 +358,8 @@
 template &lt;class Iterator&gt;
 struct iterator_pointer
 {
-    typedef typename 
-      std::iterator_traits&lt;Iterator&gt;::pointer 
+    typedef typename
+      std::iterator_traits&lt;Iterator&gt;::pointer
     type;
 };
 
@@ -95,14 +380,14 @@
 };
 </pre>
 </div>
-<div class="section" id="broken-compiler-notes">
-<h1><a name="broken-compiler-notes">Broken Compiler Notes</a></h1>
+<div class="section">
+<h1><a id="broken-compiler-notes" name="broken-compiler-notes">Broken Compiler Notes</a></h1>
 <p>Because of workarounds in Boost, you may find that these
-<a class="reference" href="../../mpl/doc/refmanual/metafunction.html">metafunctions</a> actually work better than the facilities provided by
+<a class="reference" href="../../mpl/doc/index.html#metafunctions">metafunctions</a> actually work better than the facilities provided by
 your compiler's standard library.</p>
 <p>On compilers that don't support partial specialization, such as
 Microsoft Visual C++ 6.0 or 7.0, you may need to manually invoke
-<a class="reference" href="../../../doc/html/boost_typetraits/category.html#boost_typetraits.transform">BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION</a> on the
+<a class="reference" href="../../type_traits/index.html#transformations">BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION</a> on the
 <tt class="docutils literal"><span class="pre">value_type</span></tt> of pointers that are passed to these metafunctions.</p>
 <p>Because of bugs in the implementation of GCC-2.9x, the name of
 <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is changed to <tt class="docutils literal"><span class="pre">iterator_category_</span></tt> on that
@@ -111,10 +396,5 @@
 appropriate to the platform, is provided for portability.</p>
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="iterator_traits.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/iterator_traits.rst
===================================================================
--- boost/trunk/libs/iterator/doc/iterator_traits.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/iterator_traits.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 +++++++++++++++++
  Iterator Traits
 +++++++++++++++++
@@ -5,7 +9,7 @@
 :Author: David Abrahams
 :Contact: dave at boost-consulting.com
 :organization: `Boost Consulting`_
-:date: $Date: 2004/11/01 21:23:47 $
+:date: $Date: 2006/09/11 22:27:27 $
 :copyright: Copyright David Abrahams 2004. 
 
 .. _`Boost Consulting`: http://www.boost-consulting.com

Modified: boost/trunk/libs/iterator/doc/make_counting_iterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/make_counting_iterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/make_counting_iterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+.. 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)
 
 ::
 

Deleted: boost/trunk/libs/iterator/doc/make_filter_iterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/make_filter_iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/make_filter_iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,45 +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.3.6: http://docutils.sourceforge.net/" />
-<title></title>
-<link rel="stylesheet" href="default.css" type="text/css" />
-</head>
-<body>
-<div class="document">
-<pre class="literal-block">
-template &lt;class Predicate, class Iterator&gt;
-filter_iterator&lt;Predicate,Iterator&gt;
-make_filter_iterator(Predicate f, Iterator x, Iterator end = Iterator());
-</pre>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">filter_iterator&lt;Predicate,Iterator&gt;(f, x, end)</td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;class Predicate, class Iterator&gt;
-filter_iterator&lt;Predicate,Iterator&gt;
-make_filter_iterator(Iterator x, Iterator end = Iterator());
-</pre>
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">filter_iterator&lt;Predicate,Iterator&gt;(x, end)</td>
-</tr>
-</tbody>
-</table>
-</div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="make_filter_iterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
-</body>
-</html>

Modified: boost/trunk/libs/iterator/doc/make_filter_iterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/make_filter_iterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/make_filter_iterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+.. 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)
 
 ::
 

Modified: boost/trunk/libs/iterator/doc/make_reverse_iterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/make_reverse_iterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/make_reverse_iterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 ::
 
   template <class BidirectionalIterator>

Modified: boost/trunk/libs/iterator/doc/make_transform_iterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/make_transform_iterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/make_transform_iterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 ::
 
     template <class UnaryFunction, class Iterator>

Modified: boost/trunk/libs/iterator/doc/make_zip_iterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/make_zip_iterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/make_zip_iterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 ::
 
     template<typename IteratorTuple> 

Modified: boost/trunk/libs/iterator/doc/new-iter-concepts.html
===================================================================
--- boost/trunk/libs/iterator/doc/new-iter-concepts.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/new-iter-concepts.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,19 +3,19 @@
 <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.5: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>New Iterator Concepts</title>
 <meta name="author" content="David Abrahams, Jeremy Siek, Thomas Witt" />
 <meta name="organization" content="Boost Consulting, Indiana University Open Systems Lab, Zephyr Associates, Inc." />
-<meta name="date" content="2004-11-01" />
+<meta name="date" content="2006-04-30" />
 <meta name="copyright" content="Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003." />
 <style type="text/css">
 
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/04/30 03:35:15 $
-:Revision: $Revision: 1.53 $
+:Date: $Date: 2006/09/11 22:27:27 $
+:Revision: $Revision: 1.52.2.1 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -227,7 +227,8 @@
 
 pre.literal-block, pre.doctest-block {
   margin-left: 2em ;
-  margin-right: 2em }
+  margin-right: 2em ;
+  background-color: #eeeeee }
 
 span.classifier {
   font-family: sans-serif ;
@@ -284,6 +285,9 @@
 h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
   font-size: 100% }
 
+tt.docutils {
+  background-color: #eeeeee }
+
 ul.auto-toc {
   list-style-type: none }
 
@@ -304,7 +308,7 @@
 <td><a class="first reference" href="http://www.boost-consulting.com">Boost Consulting</a>, Indiana University <a class="reference" href="http://www.osl.iu.edu">Open Systems
 Lab</a>, <a class="last reference" href="http://www.styleadvisor.com">Zephyr Associates, Inc.</a></td></tr>
 <tr><th class="docinfo-name">Date:</th>
-<td>2004-11-01</td></tr>
+<td>2006-04-30</td></tr>
 <tr class="field"><th class="docinfo-name">Number:</th><td class="field-body">This is a revised version of <a class="reference" href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1550.html">n1550</a>=03-0133, which was
 accepted for Technical Report 1 by the C++ standard
 committee's library working group. This proposal is a
@@ -315,6 +319,9 @@
 2003.</td></tr>
 </tbody>
 </table>
+<!-- Distributed under the Boost -->
+<!-- Software License, Version 1.0. (See accompanying -->
+<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <!-- Version 1.25 of this ReStructuredText document is the same as
 n1550_, the paper accepted by the LWG. -->
 <table class="docutils field-list" frame="void" rules="none">
@@ -329,8 +336,8 @@
 </tr>
 </tbody>
 </table>
-<div class="contents topic">
-<p class="topic-title first"><a id="table-of-contents" name="table-of-contents">Table of Contents</a></p>
+<div class="contents topic" id="table-of-contents">
+<p class="topic-title first"><a name="table-of-contents">Table of Contents</a></p>
 <ul class="simple">
 <li><a class="reference" href="#motivation" id="id1" name="id1">Motivation</a></li>
 <li><a class="reference" href="#impact-on-the-standard" id="id2" name="id2">Impact on the Standard</a><ul>
@@ -370,8 +377,8 @@
 <li><a class="reference" href="#footnotes" id="id24" name="id24">Footnotes</a></li>
 </ul>
 </div>
-<div class="section">
-<h1><a class="toc-backref" href="#id1" id="motivation" name="motivation">Motivation</a></h1>
+<div class="section" id="motivation">
+<h1><a class="toc-backref" href="#id1" name="motivation">Motivation</a></h1>
 <p>The standard iterator categories and requirements are flawed because
 they use a single hierarchy of concepts to address two orthogonal
 issues: <em>iterator traversal</em> and <em>value access</em>. As a result, many
@@ -391,7 +398,7 @@
 <col width="69%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th class="head" colspan="2">Value Access Requirements in Existing Iterator Categories</th>
+<tr><th colspan="2">Value Access Requirements in Existing Iterator Categories</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -424,7 +431,7 @@
 supports random access iterators.</p>
 <p>Another difficult-to-categorize iterator is the transform iterator, an
 adaptor which applies a unary function object to the dereferenced
-value of the some underlying iterator (see <a class="reference" href="http://www.boost.org/libs/utility/transform_iterator.htm">transform_iterator</a>).
+value of the some underlying iterator (see <a class="reference" href="http://www.boost.org/libs/iterator/doc/transform_iterator.html">transform_iterator</a>).
 For unary functions such as <tt class="docutils literal"><span class="pre">times</span></tt>, the return type of
 <tt class="docutils literal"><span class="pre">operator*</span></tt> clearly needs to be the <tt class="docutils literal"><span class="pre">result_type</span></tt> of the function
 object, which is typically not a reference.  Because random access
@@ -451,8 +458,8 @@
 traversal from the need for a true reference return type.</li>
 </ul>
 </div>
-<div class="section">
-<h1><a class="toc-backref" href="#id2" id="impact-on-the-standard" name="impact-on-the-standard">Impact on the Standard</a></h1>
+<div class="section" id="impact-on-the-standard">
+<h1><a class="toc-backref" href="#id2" name="impact-on-the-standard">Impact on the Standard</a></h1>
 <p>This proposal for TR1 is a pure extension. Further, the new iterator
 concepts are backward-compatible with the old iterator requirements,
 and old iterators are forward-compatible with the new iterator
@@ -467,13 +474,13 @@
 standards conforming input iterator is allowed to have
 a tag that is not input_iterator_tag but that
 is convertible to input_iterator_tag? -JGS -->
-<div class="section">
-<h2><a class="toc-backref" href="#id3" id="possible-but-not-proposed-changes-to-the-working-paper" name="possible-but-not-proposed-changes-to-the-working-paper">Possible (but not proposed) Changes to the Working Paper</a></h2>
+<div class="section" id="possible-but-not-proposed-changes-to-the-working-paper">
+<h2><a class="toc-backref" href="#id3" name="possible-but-not-proposed-changes-to-the-working-paper">Possible (but not proposed) Changes to the Working Paper</a></h2>
 <p>The extensions in this paper suggest several changes we might make
 to the working paper for the next standard.  These changes are not
 a formal part of this proposal for TR1.</p>
-<div class="section">
-<h3><a class="toc-backref" href="#id4" id="changes-to-algorithm-requirements" name="changes-to-algorithm-requirements">Changes to Algorithm Requirements</a></h3>
+<div class="section" id="changes-to-algorithm-requirements">
+<h3><a class="toc-backref" href="#id4" name="changes-to-algorithm-requirements">Changes to Algorithm Requirements</a></h3>
 <p>The algorithms in the standard library could benefit from the new
 iterator concepts because the new concepts provide a more accurate way
 to express their type requirements. The result is algorithms that are
@@ -517,7 +524,7 @@
 <dt>Bidirectional Iterator -&gt; Bidirectional Traversal Iterator and Readable and Swappable Iterator</dt>
 <dd><tt class="docutils literal"><span class="pre">partition</span></tt></dd>
 </dl>
-<p>Bidirectional Iterator (1) -&gt; Bidirectional Traversal Iterator and Readable Iterator,
+<p>Bidirectional Iterator (1) -&gt; Bidirectional Traversal Iterator and Readable Iterator, 
 Bidirectional Iterator (2) -&gt; Bidirectional Traversal Iterator and Writable Iterator</p>
 <blockquote>
 <tt class="docutils literal"><span class="pre">copy_backwards</span></tt></blockquote>
@@ -537,15 +544,15 @@
 <dd><tt class="docutils literal"><span class="pre">transform</span></tt></dd>
 </dl>
 </div>
-<div class="section">
-<h3><a class="toc-backref" href="#id5" id="deprecations" name="deprecations">Deprecations</a></h3>
+<div class="section" id="deprecations">
+<h3><a class="toc-backref" href="#id5" name="deprecations">Deprecations</a></h3>
 <p>For the next working paper (but not for TR1), the committee should
 consider deprecating the old iterator tags, and
 std::iterator_traits, since it will be superceded by individual
 traits metafunctions.</p>
 </div>
-<div class="section">
-<h3><a class="toc-backref" href="#id6" id="vector-bool" name="vector-bool"><tt class="docutils literal"><span class="pre">vector&lt;bool&gt;</span></tt></a></h3>
+<div class="section" id="vector-bool">
+<h3><a class="toc-backref" href="#id6" name="vector-bool"><tt class="docutils literal"><span class="pre">vector&lt;bool&gt;</span></tt></a></h3>
 <p>For the next working paper (but not for TR1), the committee should
 consider reclassifying <tt class="docutils literal"><span class="pre">vector&lt;bool&gt;::iterator</span></tt> as a Random
 Access Traversal Iterator and Readable Iterator and Writable
@@ -553,8 +560,8 @@
 </div>
 </div>
 </div>
-<div class="section">
-<h1><a class="toc-backref" href="#id7" id="design" name="design">Design</a></h1>
+<div class="section" id="design">
+<h1><a class="toc-backref" href="#id7" name="design">Design</a></h1>
 <p>The iterator requirements are to be separated into two groups. One set
 of concepts handles the syntax and semantics of value access:</p>
 <ul class="simple">
@@ -576,7 +583,7 @@
 </ul>
 <p>The refinement relationships for the traversal concepts are in the
 following diagram.</p>
-<img alt="traversal.png" src="traversal.png" />
+<div class="image"><img alt="traversal.png" src="traversal.png" /></div>
 <p>In addition to the iterator movement operators, such as
 <tt class="docutils literal"><span class="pre">operator++</span></tt>, the traversal concepts also include requirements on
 position comparison such as <tt class="docutils literal"><span class="pre">operator==</span></tt> and <tt class="docutils literal"><span class="pre">operator&lt;</span></tt>.  The
@@ -591,7 +598,7 @@
 </ul>
 <p>The relationship between the new iterator concepts and the old are
 given in the following diagram.</p>
-<img alt="oldeqnew.png" src="oldeqnew.png" />
+<div class="image"><img alt="oldeqnew.png" src="oldeqnew.png" /></div>
 <p>Like the old iterator requirements, we provide tags for purposes of
 dispatching based on the traversal concepts.  The tags are related via
 inheritance so that a tag is convertible to another tag if the concept
@@ -624,19 +631,19 @@
 (for a Readable Iterator), and is required to support assignment
 <tt class="docutils literal"><span class="pre">i[n]</span> <span class="pre">=</span> <span class="pre">t</span></tt> (for a Writable Iterator).</p>
 </div>
-<div class="section">
-<h1><a class="toc-backref" href="#id8" id="proposed-text" name="proposed-text">Proposed Text</a></h1>
-<div class="section">
-<h2><a class="toc-backref" href="#id9" id="addition-to-lib-iterator-requirements" name="addition-to-lib-iterator-requirements">Addition to [lib.iterator.requirements]</a></h2>
-<div class="section">
-<h3><a class="toc-backref" href="#id10" id="iterator-value-access-concepts-lib-iterator-value-access" name="iterator-value-access-concepts-lib-iterator-value-access">Iterator Value Access Concepts [lib.iterator.value.access]</a></h3>
+<div class="section" id="proposed-text">
+<h1><a class="toc-backref" href="#id8" name="proposed-text">Proposed Text</a></h1>
+<div class="section" id="addition-to-lib-iterator-requirements">
+<h2><a class="toc-backref" href="#id9" name="addition-to-lib-iterator-requirements">Addition to [lib.iterator.requirements]</a></h2>
+<div class="section" id="iterator-value-access-concepts-lib-iterator-value-access">
+<h3><a class="toc-backref" href="#id10" name="iterator-value-access-concepts-lib-iterator-value-access">Iterator Value Access Concepts [lib.iterator.value.access]</a></h3>
 <p>In the tables below, <tt class="docutils literal"><span class="pre">X</span></tt> is an iterator type, <tt class="docutils literal"><span class="pre">a</span></tt> is a constant
 object of type <tt class="docutils literal"><span class="pre">X</span></tt>, <tt class="docutils literal"><span class="pre">R</span></tt> is
 <tt class="docutils literal"><span class="pre">std::iterator_traits&lt;X&gt;::reference</span></tt>, <tt class="docutils literal"><span class="pre">T</span></tt> is
 <tt class="docutils literal"><span class="pre">std::iterator_traits&lt;X&gt;::value_type</span></tt>, and <tt class="docutils literal"><span class="pre">v</span></tt> is a constant
 object of type <tt class="docutils literal"><span class="pre">T</span></tt>.</p>
-<div class="section">
-<h4><a class="toc-backref" href="#id11" id="readable-iterators-lib-readable-iterators" name="readable-iterators-lib-readable-iterators"><span id="readable-iterator"></span>Readable Iterators [lib.readable.iterators]</a></h4>
+<a class="target" id="readable-iterator" name="readable-iterator"></a><div class="section" id="readable-iterators-lib-readable-iterators">
+<h4><a class="toc-backref" href="#id11" name="readable-iterators-lib-readable-iterators">Readable Iterators [lib.readable.iterators]</a></h4>
 <p>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Readable Iterator</em> concept
 for value type <tt class="docutils literal"><span class="pre">T</span></tt> if, in addition to <tt class="docutils literal"><span class="pre">X</span></tt> being Assignable and
 Copy Constructible, the following expressions are valid and respect
@@ -649,11 +656,11 @@
 <col width="52%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th class="head" colspan="3">Readable Iterator Requirements (in addition to Assignable and Copy Constructible)</th>
+<tr><th colspan="3">Readable Iterator Requirements (in addition to Assignable and Copy Constructible)</th>
 </tr>
-<tr><th class="head">Expression</th>
-<th class="head">Return Type</th>
-<th class="head">Note/Precondition</th>
+<tr><th>Expression</th>
+<th>Return Type</th>
+<th>Note/Precondition</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -677,9 +684,9 @@
 </tbody>
 </table>
 <!-- We won't say anything about iterator_traits<X>::reference until the DR is resolved. -JGS -->
-</div>
-<div class="section">
-<h4><a class="toc-backref" href="#id12" id="writable-iterators-lib-writable-iterators" name="writable-iterators-lib-writable-iterators"><span id="writable-iterator"></span>Writable Iterators [lib.writable.iterators]</a></h4>
+<a class="target" id="writable-iterator" name="writable-iterator"></a></div>
+<div class="section" id="writable-iterators-lib-writable-iterators">
+<h4><a class="toc-backref" href="#id12" name="writable-iterators-lib-writable-iterators">Writable Iterators [lib.writable.iterators]</a></h4>
 <p>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Writable Iterator</em> concept
 if, in addition to <tt class="docutils literal"><span class="pre">X</span></tt> being Copy Constructible, the following
 expressions are valid and respect the stated semantics.  Writable
@@ -691,11 +698,11 @@
 <col width="42%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th class="head" colspan="3">Writable Iterator Requirements (in addition to Copy Constructible)</th>
+<tr><th colspan="3">Writable Iterator Requirements (in addition to Copy Constructible)</th>
 </tr>
-<tr><th class="head">Expression</th>
-<th class="head">Return Type</th>
-<th class="head">Precondition</th>
+<tr><th>Expression</th>
+<th>Return Type</th>
+<th>Precondition</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -708,8 +715,8 @@
 </tbody>
 </table>
 </div>
-<div class="section">
-<h4><a class="toc-backref" href="#id13" id="swappable-iterators-lib-swappable-iterators" name="swappable-iterators-lib-swappable-iterators">Swappable Iterators [lib.swappable.iterators]</a></h4>
+<div class="section" id="swappable-iterators-lib-swappable-iterators">
+<h4><a class="toc-backref" href="#id13" name="swappable-iterators-lib-swappable-iterators">Swappable Iterators [lib.swappable.iterators]</a></h4>
 <p>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Swappable Iterator</em> concept
 if, in addition to <tt class="docutils literal"><span class="pre">X</span></tt> being Copy Constructible, the following
 expressions are valid and respect the stated semantics.</p>
@@ -720,11 +727,11 @@
 <col width="43%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th class="head" colspan="3">Swappable Iterator Requirements (in addition to Copy Constructible)</th>
+<tr><th colspan="3">Swappable Iterator Requirements (in addition to Copy Constructible)</th>
 </tr>
-<tr><th class="head">Expression</th>
-<th class="head">Return Type</th>
-<th class="head">Postcondition</th>
+<tr><th>Expression</th>
+<th>Return Type</th>
+<th>Postcondition</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -739,8 +746,8 @@
 <a class="reference" href="#writable-iterator">Writable Iterator</a> concepts is also a model of <em>Swappable
 Iterator</em>.  <em>--end note</em>]</p>
 </div>
-<div class="section">
-<h4><a class="toc-backref" href="#id14" id="lvalue-iterators-lib-lvalue-iterators" name="lvalue-iterators-lib-lvalue-iterators">Lvalue Iterators [lib.lvalue.iterators]</a></h4>
+<div class="section" id="lvalue-iterators-lib-lvalue-iterators">
+<h4><a class="toc-backref" href="#id14" name="lvalue-iterators-lib-lvalue-iterators">Lvalue Iterators [lib.lvalue.iterators]</a></h4>
 <p>The <em>Lvalue Iterator</em> concept adds the requirement that the return
 type of <tt class="docutils literal"><span class="pre">operator*</span></tt> type be a reference to the value type of the
 iterator.</p>
@@ -751,11 +758,11 @@
 <col width="59%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th class="head" colspan="3">Lvalue Iterator Requirements</th>
+<tr><th colspan="3">Lvalue Iterator Requirements</th>
 </tr>
-<tr><th class="head">Expression</th>
-<th class="head">Return Type</th>
-<th class="head">Note/Assertion</th>
+<tr><th>Expression</th>
+<th>Return Type</th>
+<th>Note/Assertion</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -775,14 +782,14 @@
 <tt class="docutils literal"><span class="pre">*b</span></tt>.</p>
 </div>
 </div>
-<div class="section">
-<h3><a class="toc-backref" href="#id15" id="iterator-traversal-concepts-lib-iterator-traversal" name="iterator-traversal-concepts-lib-iterator-traversal">Iterator Traversal Concepts [lib.iterator.traversal]</a></h3>
+<div class="section" id="iterator-traversal-concepts-lib-iterator-traversal">
+<h3><a class="toc-backref" href="#id15" name="iterator-traversal-concepts-lib-iterator-traversal">Iterator Traversal Concepts [lib.iterator.traversal]</a></h3>
 <p>In the tables below, <tt class="docutils literal"><span class="pre">X</span></tt> is an iterator type, <tt class="docutils literal"><span class="pre">a</span></tt> and <tt class="docutils literal"><span class="pre">b</span></tt> are
 constant objects of type <tt class="docutils literal"><span class="pre">X</span></tt>, <tt class="docutils literal"><span class="pre">r</span></tt> and <tt class="docutils literal"><span class="pre">s</span></tt> are mutable objects of
 type <tt class="docutils literal"><span class="pre">X</span></tt>, <tt class="docutils literal"><span class="pre">T</span></tt> is <tt class="docutils literal"><span class="pre">std::iterator_traits&lt;X&gt;::value_type</span></tt>, and
 <tt class="docutils literal"><span class="pre">v</span></tt> is a constant object of type <tt class="docutils literal"><span class="pre">T</span></tt>.</p>
-<div class="section">
-<h4><a class="toc-backref" href="#id16" id="incrementable-iterators-lib-incrementable-iterators" name="incrementable-iterators-lib-incrementable-iterators">Incrementable Iterators [lib.incrementable.iterators]</a></h4>
+<div class="section" id="incrementable-iterators-lib-incrementable-iterators">
+<h4><a class="toc-backref" href="#id16" name="incrementable-iterators-lib-incrementable-iterators">Incrementable Iterators [lib.incrementable.iterators]</a></h4>
 <p>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Incrementable Iterator</em>
 concept if, in addition to <tt class="docutils literal"><span class="pre">X</span></tt> being Assignable and Copy
 Constructible, the following expressions are valid and respect the
@@ -794,11 +801,11 @@
 <col width="23%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th class="head" colspan="3">Incrementable Iterator Requirements (in addition to Assignable, Copy Constructible)</th>
+<tr><th colspan="3">Incrementable Iterator Requirements (in addition to Assignable, Copy Constructible)</th>
 </tr>
-<tr><th class="head">Expression</th>
-<th class="head">Return Type</th>
-<th class="head">Assertion</th>
+<tr><th>Expression</th>
+<th>Return Type</th>
+<th>Assertion</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -829,26 +836,27 @@
 <!-- TR1: incrementable_iterator_tag changed to
 incrementable_traversal_tag for consistency. -->
 </div>
-<div class="section">
-<h4><a class="toc-backref" href="#id17" id="single-pass-iterators-lib-single-pass-iterators" name="single-pass-iterators-lib-single-pass-iterators">Single Pass Iterators [lib.single.pass.iterators]</a></h4>
+<div class="section" id="single-pass-iterators-lib-single-pass-iterators">
+<h4><a class="toc-backref" href="#id17" name="single-pass-iterators-lib-single-pass-iterators">Single Pass Iterators [lib.single.pass.iterators]</a></h4>
 <p>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Single Pass Iterator</em>
 concept if the following expressions are valid and respect the stated
 semantics.</p>
 <table border="1" class="docutils">
 <colgroup>
-<col width="37%" />
+<col width="32%" />
+<col width="29%" />
+<col width="13%" />
 <col width="27%" />
-<col width="12%" />
-<col width="25%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th class="head" colspan="4">Single Pass Iterator Requirements (in addition to Incrementable Iterator and Equality Comparable)</th>
+<tr><th colspan="4">Single Pass Iterator Requirements (in addition to Incrementable Iterator and Equality
+Comparable)</th>
 </tr>
-<tr><th class="head">Expression</th>
-<th class="head">Return Type</th>
-<th class="head">Operational
+<tr><th>Expression</th>
+<th>Return Type</th>
+<th>Operational
 Semantics</th>
-<th class="head">Assertion/
+<th>Assertion/
 Pre-/Post-condition</th>
 </tr>
 </thead>
@@ -872,13 +880,6 @@
 <td><tt class="docutils literal"><span class="pre">!(a</span> <span class="pre">==</span> <span class="pre">b)</span></tt></td>
 <td>&nbsp;</td>
 </tr>
-<tr><td><tt class="docutils literal"><span class="pre">iterator_traits&lt;X&gt;::difference_type</span></tt></td>
-<td>A signed integral type
-representing the distance
-between iterators</td>
-<td>&nbsp;</td>
-<td>&nbsp;</td>
-</tr>
 <tr><td><tt class="docutils literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
 <td>Convertible to
 <tt class="docutils literal"><span class="pre">single_pass_traversal_tag</span></tt></td>
@@ -890,8 +891,8 @@
 <!-- TR1: single_pass_iterator_tag changed to
 single_pass_traversal_tag for consistency -->
 </div>
-<div class="section">
-<h4><a class="toc-backref" href="#id18" id="forward-traversal-iterators-lib-forward-traversal-iterators" name="forward-traversal-iterators-lib-forward-traversal-iterators">Forward Traversal Iterators [lib.forward.traversal.iterators]</a></h4>
+<div class="section" id="forward-traversal-iterators-lib-forward-traversal-iterators">
+<h4><a class="toc-backref" href="#id18" name="forward-traversal-iterators-lib-forward-traversal-iterators">Forward Traversal Iterators [lib.forward.traversal.iterators]</a></h4>
 <p>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Forward Traversal Iterator</em>
 concept if, in addition to <tt class="docutils literal"><span class="pre">X</span></tt> meeting the requirements of Default
 Constructible and Single Pass Iterator, the following expressions are
@@ -903,11 +904,11 @@
 <col width="27%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th class="head" colspan="3">Forward Traversal Iterator Requirements (in addition to Default Constructible and Single Pass Iterator)</th>
+<tr><th colspan="3">Forward Traversal Iterator Requirements (in addition to Default Constructible and Single Pass Iterator)</th>
 </tr>
-<tr><th class="head">Expression</th>
-<th class="head">Return Type</th>
-<th class="head">Assertion/Note</th>
+<tr><th>Expression</th>
+<th>Return Type</th>
+<th>Assertion/Note</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -922,6 +923,11 @@
 dereferenceable implies
 <tt class="docutils literal"><span class="pre">++r</span> <span class="pre">==</span> <span class="pre">++s.</span></tt></td>
 </tr>
+<tr><td><tt class="docutils literal"><span class="pre">iterator_traits&lt;X&gt;::difference_type</span></tt></td>
+<td>A signed integral type representing
+the distance between iterators</td>
+<td>&nbsp;</td>
+</tr>
 <tr><td><tt class="docutils literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt></td>
 <td>Convertible to
 <tt class="docutils literal"><span class="pre">forward_traversal_tag</span></tt></td>
@@ -932,8 +938,8 @@
 <!-- TR1: forward_traversal_iterator_tag changed to
 forward_traversal_tag for consistency -->
 </div>
-<div class="section">
-<h4><a class="toc-backref" href="#id19" id="bidirectional-traversal-iterators-lib-bidirectional-traversal-iterators" name="bidirectional-traversal-iterators-lib-bidirectional-traversal-iterators">Bidirectional Traversal Iterators [lib.bidirectional.traversal.iterators]</a></h4>
+<div class="section" id="bidirectional-traversal-iterators-lib-bidirectional-traversal-iterators">
+<h4><a class="toc-backref" href="#id19" name="bidirectional-traversal-iterators-lib-bidirectional-traversal-iterators">Bidirectional Traversal Iterators [lib.bidirectional.traversal.iterators]</a></h4>
 <p>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Bidirectional Traversal
 Iterator</em> concept if, in addition to <tt class="docutils literal"><span class="pre">X</span></tt> meeting the requirements of
 Forward Traversal Iterator, the following expressions are valid and
@@ -946,14 +952,14 @@
 <col width="21%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th class="head" colspan="4">Bidirectional Traversal Iterator Requirements (in addition to Forward Traversal
+<tr><th colspan="4">Bidirectional Traversal Iterator Requirements (in addition to Forward Traversal
 Iterator)</th>
 </tr>
-<tr><th class="head">Expression</th>
-<th class="head">Return Type</th>
-<th class="head">Operational
+<tr><th>Expression</th>
+<th>Return Type</th>
+<th>Operational
 Semantics</th>
-<th class="head">Assertion/
+<th>Assertion/
 Pre-/Post-condition</th>
 </tr>
 </thead>
@@ -995,8 +1001,8 @@
 <!-- TR1: bidirectional_traversal_iterator_tag changed to
 bidirectional_traversal_tag for consistency -->
 </div>
-<div class="section">
-<h4><a class="toc-backref" href="#id20" id="random-access-traversal-iterators-lib-random-access-traversal-iterators" name="random-access-traversal-iterators-lib-random-access-traversal-iterators">Random Access Traversal Iterators [lib.random.access.traversal.iterators]</a></h4>
+<div class="section" id="random-access-traversal-iterators-lib-random-access-traversal-iterators">
+<h4><a class="toc-backref" href="#id20" name="random-access-traversal-iterators-lib-random-access-traversal-iterators">Random Access Traversal Iterators [lib.random.access.traversal.iterators]</a></h4>
 <p>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> models the <em>Random Access Traversal
 Iterator</em> concept if the following expressions are valid and respect
 the stated semantics.  In the table below, <tt class="docutils literal"><span class="pre">Distance</span></tt> is
@@ -1010,12 +1016,12 @@
 <col width="20%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th class="head" colspan="4">Random Access Traversal Iterator Requirements (in addition to Bidirectional Traversal Iterator)</th>
+<tr><th colspan="4">Random Access Traversal Iterator Requirements (in addition to Bidirectional Traversal Iterator)</th>
 </tr>
-<tr><th class="head">Expression</th>
-<th class="head">Return Type</th>
-<th class="head">Operational Semantics</th>
-<th class="head">Assertion/
+<tr><th>Expression</th>
+<th>Return Type</th>
+<th>Operational Semantics</th>
+<th>Assertion/
 Precondition</th>
 </tr>
 </thead>
@@ -1109,8 +1115,8 @@
 <!-- TR1: random_access_traversal_iterator_tag changed to
 random_access_traversal_tag for consistency -->
 </div>
-<div class="section">
-<h4><a class="toc-backref" href="#id21" id="interoperable-iterators-lib-interoperable-iterators" name="interoperable-iterators-lib-interoperable-iterators">Interoperable Iterators [lib.interoperable.iterators]</a></h4>
+<div class="section" id="interoperable-iterators-lib-interoperable-iterators">
+<h4><a class="toc-backref" href="#id21" name="interoperable-iterators-lib-interoperable-iterators">Interoperable Iterators [lib.interoperable.iterators]</a></h4>
 <p>A class or built-in type <tt class="docutils literal"><span class="pre">X</span></tt> that models Single Pass Iterator is
 <em>interoperable with</em> a class or built-in type <tt class="docutils literal"><span class="pre">Y</span></tt> that also models
 Single Pass Iterator if the following expressions are valid and
@@ -1125,9 +1131,9 @@
 <col width="60%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th class="head">Expression</th>
-<th class="head">Return Type</th>
-<th class="head">Assertion/Precondition/Postcondition</th>
+<tr><th>Expression</th>
+<th>Return Type</th>
+<th>Assertion/Precondition/Postcondition</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -1167,10 +1173,10 @@
 <col width="41%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th class="head">Expression</th>
-<th class="head">Return Type</th>
-<th class="head">Operational Semantics</th>
-<th class="head">Assertion/ Precondition</th>
+<tr><th>Expression</th>
+<th>Return Type</th>
+<th>Operational Semantics</th>
+<th>Assertion/ Precondition</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -1233,8 +1239,8 @@
 </div>
 </div>
 </div>
-<div class="section">
-<h2><a class="toc-backref" href="#id22" id="addition-to-lib-iterator-synopsis" name="addition-to-lib-iterator-synopsis">Addition to [lib.iterator.synopsis]</a></h2>
+<div class="section" id="addition-to-lib-iterator-synopsis">
+<h2><a class="toc-backref" href="#id22" name="addition-to-lib-iterator-synopsis">Addition to [lib.iterator.synopsis]</a></h2>
 <pre class="literal-block">
 // lib.iterator.traits, traits and tags
 template &lt;class Iterator&gt; struct is_readable_iterator;
@@ -1247,8 +1253,8 @@
 struct random_access_traversal_tag : bidirectional_traversal_tag { };
 </pre>
 </div>
-<div class="section">
-<h2><a class="toc-backref" href="#id23" id="addition-to-lib-iterator-traits" name="addition-to-lib-iterator-traits">Addition to [lib.iterator.traits]</a></h2>
+<div class="section" id="addition-to-lib-iterator-traits">
+<h2><a class="toc-backref" href="#id23" name="addition-to-lib-iterator-traits">Addition to [lib.iterator.traits]</a></h2>
 <p>The <tt class="docutils literal"><span class="pre">is_readable_iterator</span></tt> class
 template satisfies the <a class="reference" href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1519.htm">UnaryTypeTrait</a> requirements.</p>
 <p>Given an iterator type <tt class="docutils literal"><span class="pre">X</span></tt>, <tt class="docutils literal"><span class="pre">is_readable_iterator&lt;X&gt;::value</span></tt>
@@ -1257,10 +1263,10 @@
 otherwise.</p>
 <p><tt class="docutils literal"><span class="pre">iterator_traversal&lt;X&gt;::type</span></tt> is</p>
 <pre class="literal-block">
-<em>category-to-traversal</em>(iterator_traits&lt;X&gt;::iterator_category)
+<em>category-to-traversal</em>(iterator_traits&lt;X&gt;::iterator_category) 
 </pre>
 <p>where <em>category-to-traversal</em> is defined as follows</p>
-<pre class="literal-block" id="category-to-traversal">
+<a class="target" id="category-to-traversal" name="category-to-traversal"></a><pre class="literal-block">
 <em>category-to-traversal</em>(C) =
     if (C is convertible to incrementable_traversal_tag)
         return C;
@@ -1279,8 +1285,8 @@
 </pre>
 </div>
 </div>
-<div class="section">
-<h1><a class="toc-backref" href="#id24" id="footnotes" name="footnotes">Footnotes</a></h1>
+<div class="section" id="footnotes">
+<h1><a class="toc-backref" href="#id24" name="footnotes">Footnotes</a></h1>
 <p>The UnaryTypeTrait concept is defined in <a class="reference" href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1519.htm">n1519</a>; the LWG is
 considering adding the requirement that specializations are derived
 from their nested <tt class="docutils literal"><span class="pre">::type</span></tt>.</p>
@@ -1293,11 +1299,5 @@
 LocalWords:  TraversalTag typename lvalues DWA Hmm JGS mis enum -->
 </div>
 </div>
-<div class="footer">
-<hr class="footer" />
-<a class="reference" href="new-iter-concepts.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/new-iter-concepts.rst
===================================================================
--- boost/trunk/libs/iterator/doc/new-iter-concepts.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/new-iter-concepts.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 ++++++++++++++++++++++
  New Iterator Concepts
 ++++++++++++++++++++++
@@ -9,7 +13,7 @@
 :Contact: dave at boost-consulting.com, jsiek at osl.iu.edu, witt at styleadvisor.com
 :organization: `Boost Consulting`_, Indiana University `Open Systems
                Lab`_, `Zephyr Associates, Inc.`_
-:date: $Date: 2006/04/30 03:35:15 $
+:date: $Date: 2006/09/11 22:27:27 $
 
 :Number: This is a revised version of n1550_\ =03-0133, which was
          accepted for Technical Report 1 by the C++ standard
@@ -492,30 +496,26 @@
 semantics.
 
 
-+----------------------------------------------------------------------------------------------------------------+
-|Single Pass Iterator Requirements (in addition to Incrementable Iterator and Equality Comparable)               |
-|                                                                                                                |
-+----------------------------------------+-----------------------------+-------------+---------------------------+
-|Expression                              |Return Type                  | Operational |Assertion/                 | 
-|                                        |                             | Semantics   |Pre-/Post-condition        |
-+========================================+=============================+=============+===========================+
-|``++r``                                 |``X&``                       |             |pre: ``r`` is              |
-|                                        |                             |             |dereferenceable; post:     |
-|                                        |                             |             |``r`` is dereferenceable or|
-|                                        |                             |             |``r`` is past-the-end      |
-+----------------------------------------+-----------------------------+-------------+---------------------------+
-|``a == b``                              |convertible to ``bool``      |             |``==`` is an equivalence   |
-|                                        |                             |             |relation over its domain   |
-+----------------------------------------+-----------------------------+-------------+---------------------------+
-|``a != b``                              |convertible to ``bool``      |``!(a == b)``|                           |
-+----------------------------------------+-----------------------------+-------------+---------------------------+
-|``iterator_traits<X>::difference_type`` |A signed integral type       |             |                           |
-|                                        |representing the distance    |             |                           |
-|                                        |between iterators            |             |                           |
-+----------------------------------------+-----------------------------+-------------+---------------------------+
-|``iterator_traversal<X>::type``         |Convertible to               |             |                           |
-|                                        |``single_pass_traversal_tag``|             |                           |
-+----------------------------------------+-----------------------------+-------------+---------------------------+
++--------------------------------------------------------------------------------------------------------+
+|Single Pass Iterator Requirements (in addition to Incrementable Iterator and Equality                   |
+|Comparable)                                                                                             |
++--------------------------------+-----------------------------+-------------+---------------------------+
+|Expression                      |Return Type                  | Operational |Assertion/                 | 
+|                                |                             | Semantics   |Pre-/Post-condition        |
++================================+=============================+=============+===========================+
+|``++r``                         |``X&``                       |             |pre: ``r`` is              |
+|                                |                             |             |dereferenceable; post:     |
+|                                |                             |             |``r`` is dereferenceable or|
+|                                |                             |             |``r`` is past-the-end      |
++--------------------------------+-----------------------------+-------------+---------------------------+
+|``a == b``                      |convertible to ``bool``      |             |``==`` is an equivalence   |
+|                                |                             |             |relation over its domain   |
++--------------------------------+-----------------------------+-------------+---------------------------+
+|``a != b``                      |convertible to ``bool``      |``!(a == b)``|                           |
++--------------------------------+-----------------------------+-------------+---------------------------+
+|``iterator_traversal<X>::type`` |Convertible to               |             |                           |
+|                                |``single_pass_traversal_tag``|             |                           |
++--------------------------------+-----------------------------+-------------+---------------------------+
 
 .. TR1: single_pass_iterator_tag changed to
    single_pass_traversal_tag for consistency
@@ -541,6 +541,10 @@
 |                                       |                                   |dereferenceable implies     |
 |                                       |                                   |``++r == ++s.``             |
 +---------------------------------------+-----------------------------------+----------------------------+
+|``iterator_traits<X>::difference_type``|A signed integral type representing|                            |
+|                                       |the distance between iterators     |                            |
+|                                       |                                   |                            |
++---------------------------------------+-----------------------------------+----------------------------+
 |``iterator_traversal<X>::type``        |Convertible to                     |                            |
 |                                       |``forward_traversal_tag``          |                            |
 +---------------------------------------+-----------------------------------+----------------------------+

Modified: boost/trunk/libs/iterator/doc/permutation_iter_abstract.rst
===================================================================
--- boost/trunk/libs/iterator/doc/permutation_iter_abstract.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/permutation_iter_abstract.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 The permutation iterator adaptor provides a permuted view of a given
 range. That is, the view includes every element of the given range but
 in a potentially different order.

Modified: boost/trunk/libs/iterator/doc/permutation_iterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/permutation_iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/permutation_iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,295 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Permutation Iterator</title>
 <meta name="author" content="Toon Knapen, David Abrahams, Roland Richter, Jeremy Siek" />
 <meta name="organization" content="Boost Consulting, Indiana University Open Systems Lab" />
 <meta name="date" content="2004-11-01" />
 <meta name="copyright" content="Copyright Toon Knapen, David Abrahams, Roland Richter, and Jeremy Siek 2003." />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:27 $
+:Revision: $Revision: 1.20.4.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="permutation-iterator">
@@ -31,18 +313,24 @@
 <td>Copyright Toon Knapen, David Abrahams, Roland Richter, and Jeremy Siek 2003.</td></tr>
 </tbody>
 </table>
+<!-- Distributed under the 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 field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">abstract:</th><td class="field-body">The permutation iterator adaptor provides a permuted view of a given
+<tr class="field"><th class="field-name">abstract:</th><td class="field-body"><!-- 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) -->
+The permutation iterator adaptor provides a permuted view of a given
 range. That is, the view includes every element of the given range but
 in a potentially different order.</td>
 </tr>
 </tbody>
 </table>
-<div class="contents topic" id="table-of-contents">
-<p class="topic-title first"><a name="table-of-contents">Table of Contents</a></p>
+<div class="contents topic">
+<p class="topic-title first"><a id="table-of-contents" name="table-of-contents">Table of Contents</a></p>
 <ul class="simple">
 <li><a class="reference" href="#introduction" id="id2" name="id2">Introduction</a></li>
 <li><a class="reference" href="#reference" id="id3" name="id3">Reference</a><ul>
@@ -54,8 +342,11 @@
 <li><a class="reference" href="#example" id="id7" name="id7">Example</a></li>
 </ul>
 </div>
-<div class="section" id="introduction">
-<h1><a class="toc-backref" href="#id2" name="introduction">Introduction</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id2" id="introduction" name="introduction">Introduction</a></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) -->
 <p>The adaptor takes two arguments:</p>
 <blockquote>
 <ul class="simple">
@@ -74,8 +365,11 @@
 end permutation iterator is completely defined by means of the
 past-the-end iterator to the indices.</p>
 </div>
-<div class="section" id="reference">
-<h1><a class="toc-backref" href="#id3" name="reference">Reference</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id3" id="reference" name="reference">Reference</a></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) -->
 <pre class="literal-block">
 template&lt; class ElementIterator
         , class IndexIterator
@@ -104,28 +398,28 @@
 };
 
 template &lt;class ElementIterator, class IndexIterator&gt;
-permutation_iterator&lt;ElementIterator, IndexIterator&gt; 
+permutation_iterator&lt;ElementIterator, IndexIterator&gt;
 make_permutation_iterator( ElementIterator e, IndexIterator i);
 </pre>
-<div class="section" id="permutation-iterator-requirements">
-<h2><a class="toc-backref" href="#id4" name="permutation-iterator-requirements"><tt class="docutils literal"><span class="pre">permutation_iterator</span></tt> requirements</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id4" id="permutation-iterator-requirements" name="permutation-iterator-requirements"><tt class="docutils literal"><span class="pre">permutation_iterator</span></tt> requirements</a></h2>
 <p><tt class="docutils literal"><span class="pre">ElementIterator</span></tt> shall model Random Access Traversal Iterator.
 <tt class="docutils literal"><span class="pre">IndexIterator</span></tt> shall model Readable Iterator.  The value type of
 the <tt class="docutils literal"><span class="pre">IndexIterator</span></tt> must be convertible to the difference type of
 <tt class="docutils literal"><span class="pre">ElementIterator</span></tt>.</p>
 </div>
-<div class="section" id="permutation-iterator-models">
-<h2><a class="toc-backref" href="#id5" name="permutation-iterator-models"><tt class="docutils literal"><span class="pre">permutation_iterator</span></tt> models</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id5" id="permutation-iterator-models" name="permutation-iterator-models"><tt class="docutils literal"><span class="pre">permutation_iterator</span></tt> models</a></h2>
 <p><tt class="docutils literal"><span class="pre">permutation_iterator</span></tt> models the same iterator traversal concepts
 as <tt class="docutils literal"><span class="pre">IndexIterator</span></tt> and the same iterator access concepts as
 <tt class="docutils literal"><span class="pre">ElementIterator</span></tt>.</p>
-<p>If <tt class="docutils literal"><span class="pre">IndexIterator</span></tt> models Single Pass Iterator and 
+<p>If <tt class="docutils literal"><span class="pre">IndexIterator</span></tt> models Single Pass Iterator and
 <tt class="docutils literal"><span class="pre">ElementIterator</span></tt> models Readable Iterator then
 <tt class="docutils literal"><span class="pre">permutation_iterator</span></tt> models Input Iterator.</p>
-<p>If <tt class="docutils literal"><span class="pre">IndexIterator</span></tt> models Forward Traversal Iterator and 
+<p>If <tt class="docutils literal"><span class="pre">IndexIterator</span></tt> models Forward Traversal Iterator and
 <tt class="docutils literal"><span class="pre">ElementIterator</span></tt> models Readable Lvalue Iterator then
 <tt class="docutils literal"><span class="pre">permutation_iterator</span></tt> models Forward Iterator.</p>
-<p>If <tt class="docutils literal"><span class="pre">IndexIterator</span></tt> models Bidirectional Traversal Iterator and 
+<p>If <tt class="docutils literal"><span class="pre">IndexIterator</span></tt> models Bidirectional Traversal Iterator and
 <tt class="docutils literal"><span class="pre">ElementIterator</span></tt> models Readable Lvalue Iterator then
 <tt class="docutils literal"><span class="pre">permutation_iterator</span></tt> models Bidirectional Iterator.</p>
 <p>If <tt class="docutils literal"><span class="pre">IndexIterator</span></tt> models Random Access Traversal Iterator and
@@ -136,8 +430,8 @@
 <tt class="docutils literal"><span class="pre">X</span></tt> is interoperable with <tt class="docutils literal"><span class="pre">Y</span></tt> and <tt class="docutils literal"><span class="pre">E1</span></tt> is convertible
 to <tt class="docutils literal"><span class="pre">E2</span></tt>.</p>
 </div>
-<div class="section" id="permutation-iterator-operations">
-<h2><a class="toc-backref" href="#id6" name="permutation-iterator-operations"><tt class="docutils literal"><span class="pre">permutation_iterator</span></tt> operations</a></h2>
+<div class="section">
+<h2><a class="toc-backref" href="#id6" id="permutation-iterator-operations" name="permutation-iterator-operations"><tt class="docutils literal"><span class="pre">permutation_iterator</span></tt> operations</a></h2>
 <p>In addition to those operations required by the concepts that
 <tt class="docutils literal"><span class="pre">permutation_iterator</span></tt> models, <tt class="docutils literal"><span class="pre">permutation_iterator</span></tt> provides the
 following operations.</p>
@@ -207,7 +501,7 @@
 </table>
 <pre class="literal-block">
 template &lt;class ElementIterator, class IndexIterator&gt;
-permutation_iterator&lt;ElementIterator, IndexIterator&gt; 
+permutation_iterator&lt;ElementIterator, IndexIterator&gt;
 make_permutation_iterator(ElementIterator e, IndexIterator i);
 </pre>
 <table class="docutils field-list" frame="void" rules="none">
@@ -220,8 +514,11 @@
 </table>
 </div>
 </div>
-<div class="section" id="example">
-<h1><a class="toc-backref" href="#id7" name="example">Example</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id7" id="example" name="example">Example</a></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) -->
 <pre class="literal-block">
 using namespace boost;
 int i = 0;
@@ -237,7 +534,7 @@
   *el_it = std::distance(elements.begin(), el_it);
 
 index_type indices( index_size );
-for(index_type::iterator i_it = indices.begin() ; i_it != indices.end() ; ++i_it ) 
+for(index_type::iterator i_it = indices.begin() ; i_it != indices.end() ; ++i_it )
   *i_it = element_range_size - index_size + std::distance(indices.begin(), i_it);
 std::reverse( indices.begin(), indices.end() );
 
@@ -276,20 +573,15 @@
 </pre>
 <p>The output is:</p>
 <pre class="literal-block">
-The original range is : 0 1 2 3 4 5 6 7 8 9 
-The reindexing scheme is : 9 8 7 6 
-The permutated range is : 9 8 7 6 
-Elements at even indices in the permutation : 9 7 
-Permutation backwards : 6 7 8 9 
-Iterate backward with stride 2 : 6 8 
+The original range is : 0 1 2 3 4 5 6 7 8 9
+The reindexing scheme is : 9 8 7 6
+The permutated range is : 9 8 7 6
+Elements at even indices in the permutation : 9 7
+Permutation backwards : 6 7 8 9
+Iterate backward with stride 2 : 6 8
 </pre>
 <p>The source code for this example can be found <a class="reference" href="../example/permutation_iter_example.cpp">here</a>.</p>
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="permutation_iterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/permutation_iterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/permutation_iterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/permutation_iterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 ++++++++++++++++++++++
  Permutation Iterator
 ++++++++++++++++++++++
@@ -6,7 +10,7 @@
 :Contact: dave at boost-consulting.com, jsiek at osl.iu.edu
 :organization: `Boost Consulting`_, Indiana University `Open Systems
                Lab`_
-:date: $Date: 2004/11/01 21:23:47 $
+:date: $Date: 2006/09/11 22:27:27 $
 :copyright: Copyright Toon Knapen, David Abrahams, Roland Richter, and Jeremy Siek 2003. 
 
 .. _`Boost Consulting`: http://www.boost-consulting.com

Modified: boost/trunk/libs/iterator/doc/permutation_iterator_body.rst
===================================================================
--- boost/trunk/libs/iterator/doc/permutation_iterator_body.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/permutation_iterator_body.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 The adaptor takes two arguments:
 
   * an iterator to the range V on which the permutation

Modified: boost/trunk/libs/iterator/doc/permutation_iterator_eg.rst
===================================================================
--- boost/trunk/libs/iterator/doc/permutation_iterator_eg.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/permutation_iterator_eg.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 ::
 
     using namespace boost;

Modified: boost/trunk/libs/iterator/doc/permutation_iterator_ref.rst
===================================================================
--- boost/trunk/libs/iterator/doc/permutation_iterator_ref.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/permutation_iterator_ref.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 .. parsed-literal::
 
   template< class ElementIterator

Modified: boost/trunk/libs/iterator/doc/pointee.html
===================================================================
--- boost/trunk/libs/iterator/doc/pointee.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/pointee.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,295 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>pointee and indirect_reference</title>
 <meta name="author" content="David Abrahams" />
 <meta name="organization" content="Boost Consulting" />
 <meta name="date" content="2005-02-27" />
 <meta name="copyright" content="Copyright David Abrahams 2004." />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:27 $
+:Revision: $Revision: 1.8.4.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="pointee-and-indirect-reference">
@@ -30,6 +312,9 @@
 <td>Copyright David Abrahams 2004.</td></tr>
 </tbody>
 </table>
+<!-- Distributed under the 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 field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
@@ -39,8 +324,8 @@
 </tr>
 </tbody>
 </table>
-<div class="section" id="overview">
-<h1><a name="overview">Overview</a></h1>
+<div class="section">
+<h1><a id="overview" name="overview">Overview</a></h1>
 <p>Have you ever wanted to write a generic function that can operate
 on any kind of dereferenceable object?  If you have, you've
 probably run into the problem of how to determine the type that the
@@ -53,8 +338,8 @@
     ...
 }
 </pre>
-<div class="section" id="pointee">
-<h2><a name="pointee"><tt class="docutils literal"><span class="pre">pointee</span></tt></a></h2>
+<div class="section">
+<h2><a id="pointee" name="pointee"><tt class="docutils literal"><span class="pre">pointee</span></tt></a></h2>
 <p>It turns out to be impossible to come up with a fully-general
 algorithm to do determine <em>what-goes-here</em> directly, but it is
 possible to require that <tt class="docutils literal"><span class="pre">pointee&lt;Dereferenceable&gt;::type</span></tt> is
@@ -75,8 +360,8 @@
 }
 </pre>
 </div>
-<div class="section" id="indirect-reference">
-<h2><a name="indirect-reference"><tt class="docutils literal"><span class="pre">indirect_reference</span></tt></a></h2>
+<div class="section">
+<h2><a id="indirect-reference" name="indirect-reference"><tt class="docutils literal"><span class="pre">indirect_reference</span></tt></a></h2>
 <p><tt class="docutils literal"><span class="pre">indirect_reference&lt;T&gt;::type</span></tt> is rather more specialized than
 <tt class="docutils literal"><span class="pre">pointee</span></tt>, and is meant to be used to forward the result of
 dereferencing an object of its argument type.  Most dereferenceable
@@ -87,10 +372,10 @@
 <a class="reference" href="indirect_iterator.html"><tt class="docutils literal"><span class="pre">indirect_iterator</span></tt></a>.</p>
 </div>
 </div>
-<div class="section" id="reference">
-<h1><a name="reference">Reference</a></h1>
-<div class="section" id="id1">
-<h2><a name="id1"><tt class="docutils literal"><span class="pre">pointee</span></tt></a></h2>
+<div class="section">
+<h1><a id="reference" name="reference">Reference</a></h1>
+<div class="section">
+<h2><a id="id1" name="id1"><tt class="docutils literal"><span class="pre">pointee</span></tt></a></h2>
 <!-- Copyright David Abrahams 2004. Use, modification and distribution is -->
 <!-- subject to the Boost Software License, Version 1.0. (See accompanying -->
 <!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
@@ -133,8 +418,8 @@
 }
 </pre>
 </div>
-<div class="section" id="id2">
-<h2><a name="id2"><tt class="docutils literal"><span class="pre">indirect_reference</span></tt></a></h2>
+<div class="section">
+<h2><a id="id2" name="id2"><tt class="docutils literal"><span class="pre">indirect_reference</span></tt></a></h2>
 <!-- Copyright David Abrahams 2004. Use, modification and distribution is -->
 <!-- subject to the Boost Software License, Version 1.0. (See accompanying -->
 <!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
@@ -170,10 +455,5 @@
 </div>
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="pointee.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/pointee.rst
===================================================================
--- boost/trunk/libs/iterator/doc/pointee.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/pointee.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 ++++++++++++++++++++++++++++++++++++++++
  ``pointee`` and ``indirect_reference`` 
 ++++++++++++++++++++++++++++++++++++++++
@@ -5,7 +9,7 @@
 :Author: David Abrahams
 :Contact: dave at boost-consulting.com
 :organization: `Boost Consulting`_
-:date: $Date: 2005/02/27 17:28:11 $
+:date: $Date: 2006/09/11 22:27:27 $
 :copyright: Copyright David Abrahams 2004. 
 
 .. _`Boost Consulting`: http://www.boost-consulting.com

Deleted: boost/trunk/libs/iterator/doc/ref_problem.html
===================================================================
--- boost/trunk/libs/iterator/doc/ref_problem.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/ref_problem.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,75 +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.3.6: http://docutils.sourceforge.net/" />
-<title>Problem with reference and old/new iterator category correspondance</title>
-<link rel="stylesheet" href="default.css" type="text/css" />
-</head>
-<body>
-<h1 class="title">Problem with <tt class="literal"><span class="pre">reference</span></tt> and old/new iterator category correspondance</h1>
-<div class="document" id="problem-with-reference-and-old-new-iterator-category-correspondance">
-<table class="field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Author:</th><td class="field-body">David Abrahams and Jeremy Siek</td>
-</tr>
-<tr class="field"><th class="field-name">Contact:</th><td class="field-body"><a class="reference" href="mailto:dave&#64;boost-consulting.com">dave&#64;boost-consulting.com</a>, <a class="reference" href="mailto:jsiek&#64;osl.iu.edu">jsiek&#64;osl.iu.edu</a></td>
-</tr>
-<tr class="field"><th class="field-name">Organization:</th><td class="field-body"><a class="reference" href="http://www.boost-consulting.com">Boost Consulting</a>, Indiana University Bloomington</td>
-</tr>
-<tr class="field"><th class="field-name">date:</th><td class="field-body">$Date: 2004/11/02 14:31:13 $</td>
-</tr>
-<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Copyright David Abrahams, Jeremy Siek 2003. Use, modification and
-distribution is subject to the Boost Software License,
-Version 1.0. (See accompanying file LICENSE_1_0.txt or copy
-at <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</td>
-</tr>
-</tbody>
-</table>
-<div class="section" id="introduction">
-<h1><a name="introduction">Introduction</a></h1>
-<p>The new iterator categories are intended to correspond to the old
-iterator categories, as specified in a diagram in <a class="reference" href="http://www.boost-consulting.com/writing/n1550.html">N1550</a>. For example,
-an iterator categorized as a mutable Forward Iterator under the old
-scheme is now a Writable, Lvalue, and Foward Traversal iterator.
-However, there is a problem with this correspondance, the new iterator
-categories place requirements on the <tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::reference</span></tt>
-type whereas the standard iterator requirements say nothing about the
-<tt class="literal"><span class="pre">reference</span></tt> type . In particular, the new Readable Iterator
-requirements say that the return type of <tt class="literal"><span class="pre">*a</span></tt> must be
-<tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::reference</span></tt> and the Lvalue Iterator requirements
-says that <tt class="literal"><span class="pre">iterator_traits&lt;X&gt;::reference</span></tt> must be <tt class="literal"><span class="pre">T&amp;</span></tt> or <tt class="literal"><span class="pre">const</span>
-<span class="pre">T&amp;</span></tt>.</p>
-</div>
-<div class="section" id="proposed-resolution">
-<h1><a name="proposed-resolution">Proposed Resolution</a></h1>
-<p>Change the standard requirements to match the requirements of the new
-iterators. (more details to come)</p>
-</div>
-<div class="section" id="rationale">
-<h1><a name="rationale">Rationale</a></h1>
-<p>The lack of specification in the standard of the <tt class="literal"><span class="pre">reference</span></tt> type is
-certainly a defect. Without specification, it is entirely useless in a
-generic function. The current practice in the community is generally
-to assume there are requirements on the <tt class="literal"><span class="pre">reference</span></tt> type, such as
-those proposed in the new iterator categories.</p>
-<p>There is some danger in <em>adding</em> requirements to existing concepts.
-This will mean that some existing iterator types will no longer meet
-the iterator requirements. However, we feel that the impact of this is
-small enough to warrant going ahead with this change.</p>
-<p>An alternative solution would be to leave the standard requirements as
-is, and to remove the requirements for the <tt class="literal"><span class="pre">reference</span></tt> type in the
-new iterator concepts. We are not in favor of this approach because it
-extends what we see as a defect further into the future.</p>
-</div>
-</div>
-<hr class="footer" />
-<div class="footer">
-<a class="reference" href="ref_problem.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
-</body>
-</html>

Modified: boost/trunk/libs/iterator/doc/reverse_iterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/reverse_iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/reverse_iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,295 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Reverse Iterator</title>
 <meta name="author" content="David Abrahams, Jeremy Siek, Thomas Witt" />
 <meta name="organization" content="Boost Consulting, Indiana University Open Systems Lab, University of Hanover Institute for Transport Railway Operation and Construction" />
 <meta name="date" content="2004-11-01" />
 <meta name="copyright" content="Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003." />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:26 $
+:Revision: $Revision: 1.27.4.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="reverse-iterator">
@@ -32,17 +314,23 @@
 <td>Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.</td></tr>
 </tbody>
 </table>
+<!-- Distributed under the 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 field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">abstract:</th><td class="field-body">The reverse iterator adaptor iterates through the adapted iterator
+<tr class="field"><th class="field-name">abstract:</th><td class="field-body"><!-- 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) -->
+The reverse iterator adaptor iterates through the adapted iterator
 range in the opposite direction.</td>
 </tr>
 </tbody>
 </table>
-<div class="contents topic" id="table-of-contents">
-<p class="topic-title first"><a name="table-of-contents">Table of Contents</a></p>
+<div class="contents topic">
+<p class="topic-title first"><a id="table-of-contents" name="table-of-contents">Table of Contents</a></p>
 <ul class="simple">
 <li><a class="reference" href="#reverse-iterator-synopsis" id="id2" name="id2"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> synopsis</a></li>
 <li><a class="reference" href="#reverse-iterator-requirements" id="id3" name="id3"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> requirements</a></li>
@@ -51,8 +339,11 @@
 <li><a class="reference" href="#example" id="id6" name="id6">Example</a></li>
 </ul>
 </div>
-<div class="section" id="reverse-iterator-synopsis">
-<h1><a class="toc-backref" href="#id2" name="reverse-iterator-synopsis"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> synopsis</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id2" id="reverse-iterator-synopsis" name="reverse-iterator-synopsis"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> synopsis</a></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) -->
 <pre class="literal-block">
 template &lt;class Iterator&gt;
 class reverse_iterator
@@ -88,14 +379,14 @@
 <tt class="docutils literal"><span class="pre">bidirectional_iterator_tag</span></tt>. Otherwise, <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is
 convertible to <tt class="docutils literal"><span class="pre">input_iterator_tag</span></tt>.</p>
 </div>
-<div class="section" id="reverse-iterator-requirements">
-<h1><a class="toc-backref" href="#id3" name="reverse-iterator-requirements"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> requirements</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id3" id="reverse-iterator-requirements" name="reverse-iterator-requirements"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> requirements</a></h1>
 <p><tt class="docutils literal"><span class="pre">Iterator</span></tt> must be a model of Bidirectional Traversal Iterator.  The
 type <tt class="docutils literal"><span class="pre">iterator_traits&lt;Iterator&gt;::reference</span></tt> must be the type of
 <tt class="docutils literal"><span class="pre">*i</span></tt>, where <tt class="docutils literal"><span class="pre">i</span></tt> is an object of type <tt class="docutils literal"><span class="pre">Iterator</span></tt>.</p>
 </div>
-<div class="section" id="reverse-iterator-models">
-<h1><a class="toc-backref" href="#id4" name="reverse-iterator-models"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> models</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id4" id="reverse-iterator-models" name="reverse-iterator-models"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> models</a></h1>
 <p>A specialization of <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> models the same iterator
 traversal and iterator access concepts modeled by its <tt class="docutils literal"><span class="pre">Iterator</span></tt>
 argument.  In addition, it may model old iterator concepts
@@ -106,8 +397,8 @@
 <col width="47%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th>If <tt class="docutils literal"><span class="pre">I</span></tt> models</th>
-<th>then <tt class="docutils literal"><span class="pre">reverse_iterator&lt;I&gt;</span></tt> models</th>
+<tr><th class="head">If <tt class="docutils literal"><span class="pre">I</span></tt> models</th>
+<th class="head">then <tt class="docutils literal"><span class="pre">reverse_iterator&lt;I&gt;</span></tt> models</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -133,8 +424,8 @@
 <tt class="docutils literal"><span class="pre">reverse_iterator&lt;Y&gt;</span></tt> if and only if <tt class="docutils literal"><span class="pre">X</span></tt> is interoperable with
 <tt class="docutils literal"><span class="pre">Y</span></tt>.</p>
 </div>
-<div class="section" id="reverse-iterator-operations">
-<h1><a class="toc-backref" href="#id5" name="reverse-iterator-operations"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> operations</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id5" id="reverse-iterator-operations" name="reverse-iterator-operations"><tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> operations</a></h1>
 <p>In addition to the operations required by the concepts modeled by
 <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt>, <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> provides the following
 operations.</p>
@@ -145,7 +436,7 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">Iterator</span></tt> must be Default Constructible.</td>
 </tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> with <tt class="docutils literal"><span class="pre">m_iterator</span></tt> 
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs an instance of <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> with <tt class="docutils literal"><span class="pre">m_iterator</span></tt>
 default constructed.</td>
 </tr>
 </tbody>
@@ -173,7 +464,7 @@
 <tbody valign="top">
 <tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">OtherIterator</span></tt> is implicitly convertible to <tt class="docutils literal"><span class="pre">Iterator</span></tt>.</td>
 </tr>
-<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs instance of <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> whose 
+<tr class="field"><th class="field-name">Effects:</th><td class="field-body">Constructs instance of <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt> whose
 <tt class="docutils literal"><span class="pre">m_iterator</span></tt> subobject is constructed from <tt class="docutils literal"><span class="pre">y.base()</span></tt>.</td>
 </tr>
 </tbody>
@@ -222,6 +513,9 @@
 </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) -->
 <pre class="literal-block">
 template &lt;class BidirectionalIterator&gt;
 reverse_iterator&lt;BidirectionalIterator&gt;n
@@ -236,9 +530,12 @@
 </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) -->
 </div>
-<div class="section" id="example">
-<h1><a class="toc-backref" href="#id6" name="example">Example</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id6" id="example" name="example">Example</a></h1>
 <p>The following example prints an array of characters in reverse order
 using <tt class="docutils literal"><span class="pre">reverse_iterator</span></tt>.</p>
 <pre class="literal-block">
@@ -272,10 +569,5 @@
 <p>The source code for this example can be found <a class="reference" href="../example/reverse_iterator_example.cpp">here</a>.</p>
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="reverse_iterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/reverse_iterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/reverse_iterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/reverse_iterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 ++++++++++++++++++
  Reverse Iterator
 ++++++++++++++++++
@@ -7,7 +11,7 @@
 :organization: `Boost Consulting`_, Indiana University `Open Systems
                Lab`_, University of Hanover `Institute for Transport
                Railway Operation and Construction`_
-:date: $Date: 2004/11/01 21:23:47 $
+:date: $Date: 2006/09/11 22:27:26 $
 :copyright: Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. 
 
 .. _`Boost Consulting`: http://www.boost-consulting.com

Modified: boost/trunk/libs/iterator/doc/reverse_iterator_abstract.rst
===================================================================
--- boost/trunk/libs/iterator/doc/reverse_iterator_abstract.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/reverse_iterator_abstract.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+.. 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)
 
 The reverse iterator adaptor iterates through the adapted iterator
 range in the opposite direction.

Modified: boost/trunk/libs/iterator/doc/reverse_iterator_eg.rst
===================================================================
--- boost/trunk/libs/iterator/doc/reverse_iterator_eg.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/reverse_iterator_eg.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+.. 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)
 
 Example
 .......

Modified: boost/trunk/libs/iterator/doc/reverse_iterator_ref.rst
===================================================================
--- boost/trunk/libs/iterator/doc/reverse_iterator_ref.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/reverse_iterator_ref.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 ::
 
   template <class Iterator>

Modified: boost/trunk/libs/iterator/doc/rst2html
===================================================================
--- boost/trunk/libs/iterator/doc/rst2html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/rst2html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,10 @@
 #!/bin/sh
+# 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)
 PYTHONPATH="c:/src/docutils;c:/src/docutils/extras"
 export PYTHONPATH
-python c:/src/docutils/tools/rst2html.py -gs $1 `echo $1 | sed 's/\(.*\)\..*/\1.html/'`
+python rst2html.py -gs $1 `echo $1 | sed 's/\(.*\)\..*/\1.html/'`
 
 
 

Modified: boost/trunk/libs/iterator/doc/rst2latex
===================================================================
--- boost/trunk/libs/iterator/doc/rst2latex	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/rst2latex	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,7 @@
 #!/bin/sh
+# 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)
 PYTHONPATH="c:/src/docutils;c:/src/docutils/extras"
 export PYTHONPATH
 python c:/src/docutils/tools/rst2latex.py --documentoptions pdftex --stylesheet=docutils.sty $1 `echo $1 | sed 's/\(.*\)\..*/\1.tex/'`

Modified: boost/trunk/libs/iterator/doc/transform_iterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/transform_iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/transform_iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,295 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Transform Iterator</title>
 <meta name="author" content="David Abrahams, Jeremy Siek, Thomas Witt" />
 <meta name="organization" content="Boost Consulting, Indiana University Open Systems Lab, University of Hanover Institute for Transport Railway Operation and Construction" />
 <meta name="date" content="2004-11-01" />
 <meta name="copyright" content="Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003." />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:26 $
+:Revision: $Revision: 1.21.4.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="transform-iterator">
@@ -32,18 +314,24 @@
 <td>Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.</td></tr>
 </tbody>
 </table>
+<!-- Distributed under the 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 field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">abstract:</th><td class="field-body">The transform iterator adapts an iterator by modifying the
+<tr class="field"><th class="field-name">abstract:</th><td class="field-body"><!-- 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) -->
+The transform iterator adapts an iterator by modifying the
 <tt class="docutils literal"><span class="pre">operator*</span></tt> to apply a function object to the result of
 dereferencing the iterator and returning the result.</td>
 </tr>
 </tbody>
 </table>
-<div class="contents topic" id="table-of-contents">
-<p class="topic-title first"><a name="table-of-contents">Table of Contents</a></p>
+<div class="contents topic">
+<p class="topic-title first"><a id="table-of-contents" name="table-of-contents">Table of Contents</a></p>
 <ul class="simple">
 <li><a class="reference" href="#transform-iterator-synopsis" id="id2" name="id2"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> synopsis</a></li>
 <li><a class="reference" href="#transform-iterator-requirements" id="id3" name="id3"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> requirements</a></li>
@@ -52,13 +340,16 @@
 <li><a class="reference" href="#example" id="id6" name="id6">Example</a></li>
 </ul>
 </div>
-<div class="section" id="transform-iterator-synopsis">
-<h1><a class="toc-backref" href="#id2" name="transform-iterator-synopsis"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> synopsis</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id2" id="transform-iterator-synopsis" name="transform-iterator-synopsis"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> synopsis</a></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) -->
 <!-- Version 1.3 of this document was accepted for TR1 -->
 <pre class="literal-block">
 template &lt;class UnaryFunction,
-          class Iterator, 
-          class Reference = use_default, 
+          class Iterator,
+          class Reference = use_default,
           class Value = use_default&gt;
 class transform_iterator
 {
@@ -105,8 +396,8 @@
 model Readable Lvalue Iterator then <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is
 convertible to <tt class="docutils literal"><span class="pre">input_iterator_tag</span></tt>.</p>
 </div>
-<div class="section" id="transform-iterator-requirements">
-<h1><a class="toc-backref" href="#id3" name="transform-iterator-requirements"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> requirements</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id3" id="transform-iterator-requirements" name="transform-iterator-requirements"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> requirements</a></h1>
 <p>The type <tt class="docutils literal"><span class="pre">UnaryFunction</span></tt> must be Assignable, Copy Constructible, and
 the expression <tt class="docutils literal"><span class="pre">f(*i)</span></tt> must be valid where <tt class="docutils literal"><span class="pre">f</span></tt> is an object of
 type <tt class="docutils literal"><span class="pre">UnaryFunction</span></tt>, <tt class="docutils literal"><span class="pre">i</span></tt> is an object of type <tt class="docutils literal"><span class="pre">Iterator</span></tt>, and
@@ -114,8 +405,8 @@
 <tt class="docutils literal"><span class="pre">result_of&lt;UnaryFunction(iterator_traits&lt;Iterator&gt;::reference)&gt;::type</span></tt>.</p>
 <p>The argument <tt class="docutils literal"><span class="pre">Iterator</span></tt> shall model Readable Iterator.</p>
 </div>
-<div class="section" id="transform-iterator-models">
-<h1><a class="toc-backref" href="#id4" name="transform-iterator-models"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> models</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id4" id="transform-iterator-models" name="transform-iterator-models"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> models</a></h1>
 <p>The resulting <tt class="docutils literal"><span class="pre">transform_iterator</span></tt> models the most refined of the
 following that is also modeled by <tt class="docutils literal"><span class="pre">Iterator</span></tt>.</p>
 <blockquote>
@@ -136,8 +427,8 @@
 <col width="53%" />
 </colgroup>
 <thead valign="bottom">
-<tr><th>If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models</th>
-<th>then <tt class="docutils literal"><span class="pre">transform_iterator</span></tt> models</th>
+<tr><th class="head">If <tt class="docutils literal"><span class="pre">Iterator</span></tt> models</th>
+<th class="head">then <tt class="docutils literal"><span class="pre">transform_iterator</span></tt> models</th>
 </tr>
 </thead>
 <tbody valign="top">
@@ -161,8 +452,8 @@
 <tt class="docutils literal"><span class="pre">transform_iterator&lt;F2,</span> <span class="pre">Y,</span> <span class="pre">R2,</span> <span class="pre">V2&gt;</span></tt> if and only if <tt class="docutils literal"><span class="pre">X</span></tt> is
 interoperable with <tt class="docutils literal"><span class="pre">Y</span></tt>.</p>
 </div>
-<div class="section" id="transform-iterator-operations">
-<h1><a class="toc-backref" href="#id5" name="transform-iterator-operations"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> operations</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id5" id="transform-iterator-operations" name="transform-iterator-operations"><tt class="docutils literal"><span class="pre">transform_iterator</span></tt> operations</a></h1>
 <p>In addition to the operations required by the concepts modeled by
 <tt class="docutils literal"><span class="pre">transform_iterator</span></tt>, <tt class="docutils literal"><span class="pre">transform_iterator</span></tt> provides the following
 operations.</p>
@@ -255,6 +546,9 @@
 </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) -->
 <pre class="literal-block">
 template &lt;class UnaryFunction, class Iterator&gt;
 transform_iterator&lt;UnaryFunction, Iterator&gt;
@@ -283,9 +577,12 @@
 </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) -->
 </div>
-<div class="section" id="example">
-<h1><a class="toc-backref" href="#id6" name="example">Example</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id6" id="example" name="example">Example</a></h1>
 <p>This is a simple example of using the transform_iterators class to
 generate iterators that multiply (or add to) the value returned by
 dereferencing the iterator. It would be cooler to use lambda library
@@ -314,17 +611,12 @@
 <p>The output is:</p>
 <pre class="literal-block">
 multiplying the array by 2:
-2 4 6 8 10 12 14 16 
+2 4 6 8 10 12 14 16
 adding 4 to each element in the array:
 5 6 7 8 9 10 11 12
 </pre>
 <p>The source code for this example can be found <a class="reference" href="../example/transform_iterator_example.cpp">here</a>.</p>
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="transform_iterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/transform_iterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/transform_iterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/transform_iterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 ++++++++++++++++++++
  Transform Iterator
 ++++++++++++++++++++
@@ -7,7 +11,7 @@
 :organization: `Boost Consulting`_, Indiana University `Open Systems
                Lab`_, University of Hanover `Institute for Transport
                Railway Operation and Construction`_
-:date: $Date: 2004/11/01 21:23:47 $
+:date: $Date: 2006/09/11 22:27:26 $
 :copyright: Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. 
 
 .. _`Boost Consulting`: http://www.boost-consulting.com

Modified: boost/trunk/libs/iterator/doc/transform_iterator_abstract.rst
===================================================================
--- boost/trunk/libs/iterator/doc/transform_iterator_abstract.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/transform_iterator_abstract.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 The transform iterator adapts an iterator by modifying the
 ``operator*`` to apply a function object to the result of
 dereferencing the iterator and returning the result.

Modified: boost/trunk/libs/iterator/doc/transform_iterator_eg.rst
===================================================================
--- boost/trunk/libs/iterator/doc/transform_iterator_eg.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/transform_iterator_eg.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Example
 .......
 

Deleted: boost/trunk/libs/iterator/doc/transform_iterator_ref.diff
===================================================================
--- boost/trunk/libs/iterator/doc/transform_iterator_ref.diff	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/transform_iterator_ref.diff	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,202 +0,0 @@
-Index: transform_iterator_ref.rst
-===================================================================
-RCS file: /cvsroot/boost/boost/libs/iterator/doc/transform_iterator_ref.rst,v
-retrieving revision 1.3
-retrieving revision 1.15
-diff -w -d -u -b -r1.3 -r1.15
---- transform_iterator_ref.rst	21 Sep 2003 11:13:46 -0000	1.3
-+++ transform_iterator_ref.rst	15 Jan 2004 00:06:57 -0000	1.15
-@@ -1,3 +1,5 @@
-+.. Version 1.3 of this document was accepted for TR1
-+
- ::
- 
-   template <class UnaryFunction,
-@@ -5,26 +7,55 @@
-             class Reference = use_default, 
-             class Value = use_default>
-   class transform_iterator
-
-Issue 9.37x
-
--    : public iterator_adaptor</* see discussion */>
-   {
--    friend class iterator_core_access;
-   public:
-+    typedef /* see below */ value_type;
-+    typedef /* see below */ reference;
-+    typedef /* see below */ pointer;
-+    typedef iterator_traits<Iterator>::difference_type difference_type;
-+    typedef /* see below */ iterator_category;
-+
-     transform_iterator();
-     transform_iterator(Iterator const& x, UnaryFunction f);
- 
-
-Issue 9.43x
-
--    template<class OtherIterator, class R2, class V2>
-+    template<class F2, class I2, class R2, class V2>
-     transform_iterator(
--          transform_iterator<UnaryFunction, OtherIterator, R2, V2> const& t
--        , typename enable_if_convertible<OtherIterator, Iterator>::type* = 0 // exposition
-+          transform_iterator<F2, I2, R2, V2> const& t
-+        , typename enable_if_convertible<I2, Iterator>::type* = 0      // exposition only
-+        , typename enable_if_convertible<F2, UnaryFunction>::type* = 0 // exposition only
-     );
--
-
-Issues 9.37x and 9.12
-
-+    Iterator const& base() const;
-+    reference operator*() const;
-+    transform_iterator& operator++();
-+    transform_iterator& operator--();
-   private:
--    typename transform_iterator::value_type dereference() const;
--    UnaryFunction m_f;
-+    Iterator m_iterator; // exposition only
-+    UnaryFunction m_f;   // exposition only
-   };
-
-
-Issue 9.41x
- 
-+If ``Reference`` is ``use_default`` then the ``reference`` member of
-+``transform_iterator`` is
-+``result_of<UnaryFunction(iterator_traits<Iterator>::reference)>::type``.
-+Otherwise, ``reference`` is ``Reference``.
-+
-+If ``Value`` is ``use_default`` then the ``value_type`` member is
-+``remove_cv<remove_reference<reference> >::type``.  Otherwise,
-+``value_type`` is ``Value``.
-+
-+
-
-Issue 9.37x
-
-+If ``Iterator`` models Readable Lvalue Iterator and if ``Iterator``
-+models Random Access Traversal Iterator, then ``iterator_category`` is
-+convertible to ``random_access_iterator_tag``. Otherwise, if
-+``Iterator`` models Bidirectional Traversal Iterator, then
-+``iterator_category`` is convertible to
-+``bidirectional_iterator_tag``.  Otherwise ``iterator_category`` is
-+convertible to ``forward_iterator_tag``. If ``Iterator`` does not
-+model Readable Lvalue Iterator then ``iterator_category`` is
-+convertible to ``input_iterator_tag``.
-+
-+
- ``transform_iterator`` requirements
- ...................................
- 
-@@ -34,27 +65,55 @@
- where the type of ``f(*i)`` must be
- ``result_of<UnaryFunction(iterator_traits<Iterator>::reference)>::type``.
-
-
-Issue 9.37x
- 
--The type ``Iterator`` must at least model Readable Iterator.  The
--resulting ``transform_iterator`` models the most refined of the
-+The argument ``Iterator`` shall model Readable Iterator.  
-+
-+
-+``transform_iterator`` models
-+.............................
-+
-+The resulting ``transform_iterator`` models the most refined of the
- following options that is also modeled by ``Iterator``.
- 
--  * Writable Lvalue Iterator if ``result_of<UnaryFunction(iterator_traits<Iterator>::reference)>::type`` is a non-const reference. 
-+  * Writable Lvalue Iterator if ``transform_iterator::reference`` is a non-const reference. 
- 
--  * Readable Lvalue Iterator if ``result_of<UnaryFunction(iterator_traits<Iterator>::reference)>::type`` is a const
--    reference.
-+  * Readable Lvalue Iterator if ``transform_iterator::reference`` is a const reference.
- 
-   * Readable Iterator otherwise. 
- 
--
- The ``transform_iterator`` models the most refined standard traversal
--concept that is modeled by ``Iterator``.
-+concept that is modeled by the ``Iterator`` argument.
-
-Issue 9.41x
- 
--The ``reference`` type of ``transform_iterator`` is
--``result_of<UnaryFunction(iterator_traits<Iterator>::reference)>::type``.
--The ``value_type`` is ``remove_cv<remove_reference<reference> >::type``.
-
-Issue 9.37x.
-
-+If ``transform_iterator`` is a model of Readable Lvalue Iterator then
-+it models the following original iterator concepts depending on what
-+the ``Iterator`` argument models.
- 
--``transform_iterator`` public operations
--........................................
-++-----------------------------------+---------------------------------+
-+| If ``Iterator`` models            | then ``filter_iterator`` models |
-++===================================+=================================+
-+| Single Pass Iterator              | Input Iterator                  |
-++-----------------------------------+---------------------------------+
-+| Forward Traversal Iterator        | Forward Iterator                |
-++-----------------------------------+---------------------------------+
-+| Bidirectional Traversal Iterator  | Bidirectional Iterator          |
-++-----------------------------------+---------------------------------+
-+| Random Access Traversal Iterator  | Random Access Iterator          |
-++-----------------------------------+---------------------------------+
-+
-+If ``transform_iterator`` models Writable Lvalue Iterator then it is a
-+mutable iterator (as defined in the old iterator requirements).
-+
-+``transform_iterator<F1, X, R1, V1>`` is interoperable with
-+``transform_iterator<F2, Y, R2, V2>`` if and only if ``X`` is
-+interoperable with ``Y``.
-+
-+
-+
-+``transform_iterator`` operations
-+.................................
-+
-+In addition to the operations required by the concepts modeled by
-+``transform_iterator``, ``transform_iterator`` provides the following
-+operations.
- 
- 
- ``transform_iterator();``
-@@ -80,14 +139,30 @@
- :Returns: An instance of ``transform_iterator`` that is a copy of ``t``.
- :Requires: ``OtherIterator`` is implicitly convertible to ``Iterator``.
- 
-+
-+``Iterator const& base() const;``
-+
-+:Returns: ``m_iterator``
-+
-+
- ``UnaryFunction functor() const;``
- 
- :Returns: ``m_f``
- 
--``transform_iterator`` private operations
--.........................................
- 
--``typename transform_iterator::value_type dereference() const;``
-+``reference operator*() const;``
- 
--:Returns: ``m_f(transform_iterator::dereference());``
-+:Returns: ``m_f(*m_iterator)``
-+
-+
-+``transform_iterator& operator++();``
-+
-+:Effects: ``++m_iterator``
-+:Returns: ``*this``
-+
-+
-+``transform_iterator& operator--();``
-+
-+:Effects: ``--m_iterator``
-+:Returns: ``*this``
- 

Modified: boost/trunk/libs/iterator/doc/transform_iterator_ref.rst
===================================================================
--- boost/trunk/libs/iterator/doc/transform_iterator_ref.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/transform_iterator_ref.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 .. Version 1.3 of this document was accepted for TR1
 
 ::

Modified: boost/trunk/libs/iterator/doc/zip_iterator.html
===================================================================
--- boost/trunk/libs/iterator/doc/zip_iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/zip_iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,13 +3,295 @@
 <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.3.8: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4: http://docutils.sourceforge.net/" />
 <title>Zip Iterator</title>
 <meta name="author" content="David Abrahams, Thomas Becker" />
 <meta name="organization" content="Boost Consulting, Zephyr Associates, Inc." />
 <meta name="date" content="2004-11-01" />
 <meta name="copyright" content="Copyright David Abrahams and Thomas Becker 2003." />
-<link rel="stylesheet" href="default.css" type="text/css" />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger at users.sourceforge.net
+:Date: $Date: 2006/09/11 22:27:26 $
+:Revision: $Revision: 1.5.4.1 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
+
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
+
+.first {
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em ;
+  margin-right: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid 1px gray;
+  margin-left: 1px }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid 1px black;
+  margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
 </head>
 <body>
 <div class="document" id="zip-iterator">
@@ -30,12 +312,18 @@
 <td>Copyright David Abrahams and Thomas Becker 2003.</td></tr>
 </tbody>
 </table>
+<!-- Distributed under the 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 field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">abstract:</th><td class="field-body">The zip iterator provides the ability to parallel-iterate
-over several controlled sequences simultaneously. A zip 
+<tr class="field"><th class="field-name">abstract:</th><td class="field-body"><!-- 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) -->
+The zip iterator provides the ability to parallel-iterate
+over several controlled sequences simultaneously. A zip
 iterator is constructed from a tuple of iterators. Moving
 the zip iterator moves all the iterators in parallel.
 Dereferencing the zip iterator returns a tuple that contains
@@ -43,8 +331,8 @@
 </tr>
 </tbody>
 </table>
-<div class="contents topic" id="table-of-contents">
-<p class="topic-title first"><a name="table-of-contents">Table of Contents</a></p>
+<div class="contents topic">
+<p class="topic-title first"><a id="table-of-contents" name="table-of-contents">Table of Contents</a></p>
 <ul class="simple">
 <li><a class="reference" href="#zip-iterator-synopsis" id="id1" name="id1"><tt class="docutils literal"><span class="pre">zip_iterator</span></tt> synopsis</a></li>
 <li><a class="reference" href="#zip-iterator-requirements" id="id2" name="id2"><tt class="docutils literal"><span class="pre">zip_iterator</span></tt> requirements</a></li>
@@ -53,12 +341,15 @@
 <li><a class="reference" href="#examples" id="id5" name="id5">Examples</a></li>
 </ul>
 </div>
-<div class="section" id="zip-iterator-synopsis">
-<h1><a class="toc-backref" href="#id1" name="zip-iterator-synopsis"><tt class="docutils literal"><span class="pre">zip_iterator</span></tt> synopsis</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id1" id="zip-iterator-synopsis" name="zip-iterator-synopsis"><tt class="docutils literal"><span class="pre">zip_iterator</span></tt> synopsis</a></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) -->
 <pre class="literal-block">
 template&lt;typename IteratorTuple&gt;
 class zip_iterator
-{  
+{
 
 public:
   typedef /* see below */ reference;
@@ -84,8 +375,8 @@
   IteratorTuple m_iterator_tuple;     // exposition only
 };
 
-template&lt;typename IteratorTuple&gt; 
-zip_iterator&lt;IteratorTuple&gt; 
+template&lt;typename IteratorTuple&gt;
+zip_iterator&lt;IteratorTuple&gt;
 make_zip_iterator(IteratorTuple t);
 </pre>
 <p>The <tt class="docutils literal"><span class="pre">reference</span></tt> member of <tt class="docutils literal"><span class="pre">zip_iterator</span></tt> is the type of the tuple
@@ -96,22 +387,22 @@
 <p>The <tt class="docutils literal"><span class="pre">iterator_category</span></tt> member of <tt class="docutils literal"><span class="pre">zip_iterator</span></tt> is convertible to the
 minimum of the traversal categories of the iterator types in the <tt class="docutils literal"><span class="pre">IteratorTuple</span></tt>
 argument. For example, if the <tt class="docutils literal"><span class="pre">zip_iterator</span></tt> holds only vector
-iterators, then <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is convertible to 
+iterators, then <tt class="docutils literal"><span class="pre">iterator_category</span></tt> is convertible to
 <tt class="docutils literal"><span class="pre">boost::random_access_traversal_tag</span></tt>. If you add a list iterator, then
 <tt class="docutils literal"><span class="pre">iterator_category</span></tt> will be convertible to <tt class="docutils literal"><span class="pre">boost::bidirectional_traversal_tag</span></tt>,
 but no longer to <tt class="docutils literal"><span class="pre">boost::random_access_traversal_tag</span></tt>.</p>
 </div>
-<div class="section" id="zip-iterator-requirements">
-<h1><a class="toc-backref" href="#id2" name="zip-iterator-requirements"><tt class="docutils literal"><span class="pre">zip_iterator</span></tt> requirements</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id2" id="zip-iterator-requirements" name="zip-iterator-requirements"><tt class="docutils literal"><span class="pre">zip_iterator</span></tt> requirements</a></h1>
 <p>All iterator types in the argument <tt class="docutils literal"><span class="pre">IteratorTuple</span></tt> shall model Readable Iterator.</p>
 </div>
-<div class="section" id="zip-iterator-models">
-<h1><a class="toc-backref" href="#id3" name="zip-iterator-models"><tt class="docutils literal"><span class="pre">zip_iterator</span></tt> models</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id3" id="zip-iterator-models" name="zip-iterator-models"><tt class="docutils literal"><span class="pre">zip_iterator</span></tt> models</a></h1>
 <p>The resulting <tt class="docutils literal"><span class="pre">zip_iterator</span></tt> models Readable Iterator.</p>
-<p>The fact that the <tt class="docutils literal"><span class="pre">zip_iterator</span></tt> models only Readable Iterator does not 
+<p>The fact that the <tt class="docutils literal"><span class="pre">zip_iterator</span></tt> models only Readable Iterator does not
 prevent you from modifying the values that the individual iterators point
-to. The tuple returned by the <tt class="docutils literal"><span class="pre">zip_iterator</span></tt>'s <tt class="docutils literal"><span class="pre">operator*</span></tt> is a tuple 
-constructed from the reference types of the individual iterators, not 
+to. The tuple returned by the <tt class="docutils literal"><span class="pre">zip_iterator</span></tt>'s <tt class="docutils literal"><span class="pre">operator*</span></tt> is a tuple
+constructed from the reference types of the individual iterators, not
 their value types. For example, if <tt class="docutils literal"><span class="pre">zip_it</span></tt> is a <tt class="docutils literal"><span class="pre">zip_iterator</span></tt> whose
 first member iterator is an <tt class="docutils literal"><span class="pre">std::vector&lt;double&gt;::iterator</span></tt>, then the
 following line will modify the value which the first member iterator of
@@ -121,14 +412,14 @@
 </pre>
 <p>Consider the set of standard traversal concepts obtained by taking
 the most refined standard traversal concept modeled by each individual
-iterator type in the <tt class="docutils literal"><span class="pre">IteratorTuple</span></tt> argument.The <tt class="docutils literal"><span class="pre">zip_iterator</span></tt> 
+iterator type in the <tt class="docutils literal"><span class="pre">IteratorTuple</span></tt> argument.The <tt class="docutils literal"><span class="pre">zip_iterator</span></tt>
 models the least refined standard traversal concept in this set.</p>
 <p><tt class="docutils literal"><span class="pre">zip_iterator&lt;IteratorTuple1&gt;</span></tt> is interoperable with
 <tt class="docutils literal"><span class="pre">zip_iterator&lt;IteratorTuple2&gt;</span></tt> if and only if <tt class="docutils literal"><span class="pre">IteratorTuple1</span></tt>
 is interoperable with <tt class="docutils literal"><span class="pre">IteratorTuple2</span></tt>.</p>
 </div>
-<div class="section" id="zip-iterator-operations">
-<h1><a class="toc-backref" href="#id4" name="zip-iterator-operations"><tt class="docutils literal"><span class="pre">zip_iterator</span></tt> operations</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id4" id="zip-iterator-operations" name="zip-iterator-operations"><tt class="docutils literal"><span class="pre">zip_iterator</span></tt> operations</a></h1>
 <p>In addition to the operations required by the concepts modeled by
 <tt class="docutils literal"><span class="pre">zip_iterator</span></tt>, <tt class="docutils literal"><span class="pre">zip_iterator</span></tt> provides the following
 operations.</p>
@@ -213,8 +504,8 @@
 </tbody>
 </table>
 <pre class="literal-block">
-template&lt;typename IteratorTuple&gt; 
-zip_iterator&lt;IteratorTuple&gt; 
+template&lt;typename IteratorTuple&gt;
+zip_iterator&lt;IteratorTuple&gt;
 make_zip_iterator(IteratorTuple t);
 </pre>
 <table class="docutils field-list" frame="void" rules="none">
@@ -226,9 +517,12 @@
 </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) -->
 <pre class="literal-block">
-template&lt;typename IteratorTuple&gt; 
-zip_iterator&lt;IteratorTuple&gt; 
+template&lt;typename IteratorTuple&gt;
+zip_iterator&lt;IteratorTuple&gt;
 make_zip_iterator(IteratorTuple t);
 </pre>
 <table class="docutils field-list" frame="void" rules="none">
@@ -240,14 +534,17 @@
 </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) -->
 </div>
-<div class="section" id="examples">
-<h1><a class="toc-backref" href="#id5" name="examples">Examples</a></h1>
+<div class="section">
+<h1><a class="toc-backref" href="#id5" id="examples" name="examples">Examples</a></h1>
 <p>There are two main types of applications of the <tt class="docutils literal"><span class="pre">zip_iterator</span></tt>. The first
 one concerns runtime efficiency: If one has several controlled sequences
-of the same length that must be somehow processed, e.g., with the 
+of the same length that must be somehow processed, e.g., with the
 <tt class="docutils literal"><span class="pre">for_each</span></tt> algorithm, then it is more efficient to perform just
-one parallel-iteration rather than several individual iterations. For an 
+one parallel-iteration rather than several individual iterations. For an
 example, assume that <tt class="docutils literal"><span class="pre">vect_of_doubles</span></tt> and <tt class="docutils literal"><span class="pre">vect_of_ints</span></tt>
 are two vectors of equal length containing doubles and ints, respectively,
 and consider the following two iterations:</p>
@@ -274,7 +571,7 @@
 </pre>
 <p>A non-generic implementation of <tt class="docutils literal"><span class="pre">zip_func</span></tt> could look as follows:</p>
 <pre class="literal-block">
-struct zip_func : 
+struct zip_func :
   public std::unary_function&lt;const boost::tuple&lt;const double&amp;, const int&amp;&gt;&amp;, void&gt;
 {
   void operator()(const boost::tuple&lt;const double&amp;, const int&amp;&gt;&amp; t) const
@@ -294,14 +591,14 @@
 dereferencing, returns the result of applying a functor to the values of the
 sequences at the respective positions. This can now be achieved by using the
 <tt class="docutils literal"><span class="pre">zip_iterator</span></tt> in conjunction with the <tt class="docutils literal"><span class="pre">transform_iterator</span></tt>.</p>
-<p>Suppose, for example, that you have two vectors of doubles, say 
+<p>Suppose, for example, that you have two vectors of doubles, say
 <tt class="docutils literal"><span class="pre">vect_1</span></tt> and <tt class="docutils literal"><span class="pre">vect_2</span></tt>, and you need to expose to a client
-a controlled sequence containing the products of the elements of 
+a controlled sequence containing the products of the elements of
 <tt class="docutils literal"><span class="pre">vect_1</span></tt> and <tt class="docutils literal"><span class="pre">vect_2</span></tt>. Rather than placing these products
 in a third vector, you can use a combining iterator that calculates the
 products on the fly. Let us assume that <tt class="docutils literal"><span class="pre">tuple_multiplies</span></tt> is a
 functor that works like <tt class="docutils literal"><span class="pre">std::multiplies</span></tt>, except that it takes
-its two arguments packaged in a tuple. Then the two iterators 
+its two arguments packaged in a tuple. Then the two iterators
 <tt class="docutils literal"><span class="pre">it_begin</span></tt> and <tt class="docutils literal"><span class="pre">it_end</span></tt> defined below delimit a controlled
 sequence containing the products of the elements of <tt class="docutils literal"><span class="pre">vect_1</span></tt> and
 <tt class="docutils literal"><span class="pre">vect_2</span></tt>:</p>
@@ -342,10 +639,5 @@
 </pre>
 </div>
 </div>
-<hr class="docutils footer" />
-<div class="footer">
-<a class="reference" href="zip_iterator.rst">View document source</a>.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-</div>
 </body>
 </html>

Modified: boost/trunk/libs/iterator/doc/zip_iterator.rst
===================================================================
--- boost/trunk/libs/iterator/doc/zip_iterator.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/zip_iterator.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Distributed under the Boost
+.. Software License, Version 1.0. (See accompanying
+.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 +++++++++++++
  Zip Iterator
 +++++++++++++
@@ -5,7 +9,7 @@
 :Author: David Abrahams, Thomas Becker
 :Contact: dave at boost-consulting.com, thomas at styleadvisor.com
 :organization: `Boost Consulting`_, `Zephyr Associates, Inc.`_
-:date: $Date: 2004/11/01 21:23:46 $
+:date: $Date: 2006/09/11 22:27:26 $
 :copyright: Copyright David Abrahams and Thomas Becker 2003. 
 
 .. _`Boost Consulting`: http://www.boost-consulting.com

Modified: boost/trunk/libs/iterator/doc/zip_iterator_abstract.rst
===================================================================
--- boost/trunk/libs/iterator/doc/zip_iterator_abstract.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/zip_iterator_abstract.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 The zip iterator provides the ability to parallel-iterate
 over several controlled sequences simultaneously. A zip 
 iterator is constructed from a tuple of iterators. Moving

Modified: boost/trunk/libs/iterator/doc/zip_iterator_eg.rst
===================================================================
--- boost/trunk/libs/iterator/doc/zip_iterator_eg.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/zip_iterator_eg.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Examples
 ........
 

Modified: boost/trunk/libs/iterator/doc/zip_iterator_ref.rst
===================================================================
--- boost/trunk/libs/iterator/doc/zip_iterator_ref.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/doc/zip_iterator_ref.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+.. 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)
 
 ::
 

Deleted: boost/trunk/libs/iterator/example/Jamfile
===================================================================
--- boost/trunk/libs/iterator/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,20 +0,0 @@
-subproject libs/iterator/example ;
-
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-test-suite iterator_examples
-  : [ run reverse_iterator.cpp ]
-    [ run node_iterator1.cpp ]
-    [ run node_iterator2.cpp ]
-    [ run node_iterator3.cpp ]
-    [ run counting_iterator_example.cpp ]
-    [ run filter_iterator_example.cpp ]
-    [ run func_output_iter_example.cpp ]
-    [ run indirect_iterator_example.cpp ]
-    [ run permutation_iter_example.cpp ]
-    [ run reverse_iterator_example.cpp ]
-    [ run transform_iterator_example.cpp ]
-      ;

Modified: boost/trunk/libs/iterator/index.html
===================================================================
--- boost/trunk/libs/iterator/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,3 +7,6 @@
 <a href="doc/index.html">doc/index.html</a>.
 </body>
 </html>
+<!-- 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) -->

Deleted: boost/trunk/libs/iterator/test/Jamfile
===================================================================
--- boost/trunk/libs/iterator/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,65 +0,0 @@
-# Copyright David Abrahams 2003. Permission to copy, use,
-# modify, sell and distribute this software is granted provided this
-# copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as
-# to its suitability for any purpose.
-
-subproject libs/iterator/test ;
-
-import testing ;
-
-rule vc6-stlport-debug-inlining ( toolset variant : non-defaults * )
-{
-    if [ MATCH (vc-(6[_0-9]*)-stlport) : $(toolset) ]
-        && ( <inlining>off in $(non-defaults) )
-    {
-        non-defaults = [ difference $(non-defaults) : <inlining>off ] 
-          <inlining>on ;
-    }
-    return $(non-defaults) ;
-}
-  
-test-suite iterator
-  : 
-    # These first two tests will run last, and are expected to fail
-    # for many less-capable compilers.
-  
-    [ compile-fail interoperable_fail.cpp ]
-    # test uses expected success, so that we catch unrelated
-    # compilation problems.
-    [ run is_convertible_fail.cpp ]  
-
-    [ run zip_iterator_test.cpp
-        : : : vc6-stlport-debug-inlining
-        
-        # stlport's debug mode generates long symbols which overwhelm
-        # vc6 unless you turn on inlining
-#        <msvc-stlport><*><cxxflags>-Ob1
-#        <vc-6_5-stlport><*><cxxflags>-Ob1 
-    ]
-      
-    # These tests should work for just about everything.
-    [ compile is_lvalue_iterator.cpp ]
-    [ compile is_readable_iterator.cpp ]
-    [ compile pointee.cpp ]
-      
-    [ run unit_tests.cpp ]
-    [ run concept_tests.cpp ]
-    [ run iterator_adaptor_cc.cpp ]
-    [ run iterator_adaptor_test.cpp ]
-    [ compile iterator_archetype_cc.cpp ]
-    [ compile-fail iter_archetype_default_ctor.cpp ]
-    [ compile-fail lvalue_concept_fail.cpp ]
-    [ run transform_iterator_test.cpp ]
-    [ run indirect_iterator_test.cpp ]
-    [ compile indirect_iter_member_types.cpp ]
-    [ run filter_iterator_test.cpp ]
-    [ run iterator_facade.cpp ]
-    [ run reverse_iterator_test.cpp ]
-    [ run counting_iterator_test.cpp ]
-    [ run interoperable.cpp ]
-    [ run iterator_traits_test.cpp ]
-    [ run permutation_iterator_test.cpp : : : # <stlport-iostream>on 
-    ]
-      
-;

Modified: boost/trunk/libs/iterator/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/iterator/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,6 @@
-# Copyright David Abrahams 2003. Permission to copy, use,
-# modify, sell and distribute this software is granted provided this
-# copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as
-# to its suitability for any purpose.
+# Copyright David Abrahams 2003. Distributed under the Boost
+# Software License, Version 1.0. (See accompanying
+# file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 test-suite iterator
   : 

Modified: boost/trunk/libs/iterator/test/iterator_facade.cpp
===================================================================
--- boost/trunk/libs/iterator/test/iterator_facade.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/test/iterator_facade.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -56,7 +56,38 @@
         
     int& state;
 };
-    
+
+struct value
+{
+    void mutator() {} // non-const member function
+};
+
+struct input_iter
+  : boost::iterator_facade<
+        input_iter
+      , value
+      , boost::single_pass_traversal_tag
+      , value
+    >
+{
+ public:
+    input_iter() {}
+
+    void increment()
+    {
+    }
+    value
+    dereference() const
+    {
+        return value();
+    }
+
+    bool equal(input_iter const& y) const
+    {
+        return false;
+    }
+};
+
 int main()
 {
     int state = 0;
@@ -65,5 +96,12 @@
     boost::readable_iterator_test(counter_iterator<proxy>(&state), 3);
     boost::writable_iterator_test(counter_iterator<proxy>(&state), 9, 7);
     BOOST_ASSERT(state == 8);
+
+    // test for a fix to http://tinyurl.com/zuohe
+    // These two lines should be equivalent (and both compile)
+    input_iter p;
+    (*p).mutator();
+    p->mutator();
+    
     return 0;
 }

Modified: boost/trunk/libs/iterator/test/permutation_iterator_test.cpp
===================================================================
--- boost/trunk/libs/iterator/test/permutation_iterator_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/test/permutation_iterator_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,6 +9,8 @@
 
 #include <boost/iterator/permutation_iterator.hpp>
 #include <boost/static_assert.hpp>
+#include <boost/iterator/iterator_concepts.hpp>
+#include <boost/concept_check.hpp>
 
 #include <vector>
 #include <list>
@@ -16,6 +18,23 @@
 #include <algorithm>
 
 
+// This test checks for convertibility/interoperability among similar
+// permutation iterators.  We're not using container iterators
+// underneath, as in permutation_test, because of bugs in GCC-3.3's
+// __normal_iterator that make is_convertible choke when testing
+// convertibility.
+void iterop_test()
+{
+    typedef boost::permutation_iterator< double*, int const* > permutation_type;
+    typedef boost::permutation_iterator< double const*, int const* > permutation_const_type;
+  
+  boost::function_requires<
+      boost_concepts::InteroperableIteratorConcept<
+           permutation_type
+         , permutation_const_type
+               > >();
+}
+
 void permutation_test()
 {
   // Example taken from documentation of old permutation_iterator.
@@ -39,7 +58,7 @@
   permutation_type begin = boost::make_permutation_iterator( elements.begin(), indices.begin() );
   permutation_type it = begin;
   permutation_type end = boost::make_permutation_iterator( elements.begin(), indices.end() );
-
+  
   BOOST_CHECK( it == begin );
   BOOST_CHECK( it != end );
 

Modified: boost/trunk/libs/iterator/test/zip_iterator_test.cpp
===================================================================
--- boost/trunk/libs/iterator/test/zip_iterator_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/iterator/test/zip_iterator_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,7 @@
-// (C) Copyright Dave Abrahams and Thomas Becker 2003. Permission to
-// copy, use, modify, sell and distribute this software is granted
-// provided this copyright notice appears in all copies. This software
-// is provided "as is" without express or implied warranty, and with
-// no claim as to its suitability for any purpose.
+// (C) Copyright Dave Abrahams and Thomas Becker 2003. Distributed
+// under the Boost Software License, Version 1.0. (See accompanying
+// file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
 //
 
 // File: 

Modified: boost/trunk/libs/lambda/doc/index.html
===================================================================
--- boost/trunk/libs/lambda/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/lambda/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,6 +3,10 @@
 <meta http-equiv="refresh" content="0; URL=../../../doc/html/lambda.html">
 </head>
 <body>
-Automatic redirection failed, please go to <a href="../../../doc/html/lambda.html">www.boost.org/doc/html/lambda.html</a>
+Automatic redirection failed, please go to <a href="../../../doc/html/lambda.html">www.boost.org/doc/html/lambda.html</a>&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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
+</html>

Modified: boost/trunk/libs/lambda/doc/lambda.xml
===================================================================
--- boost/trunk/libs/lambda/doc/lambda.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/lambda/doc/lambda.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
 <library name="Lambda" dirname="lambda" id="lambda" 
-         last-revision="$Date: 2005/10/31 20:11:23 $" 
+         last-revision="$Date: 2006/11/29 19:28:48 $" 
          xmlns:xi="http://www.w3.org/2001/XInclude">
 <libraryinfo>
   <author>
@@ -2640,6 +2640,7 @@
 <row><entry><literal><![CDATA[&]]></literal></entry><entry><literal><![CDATA[other_action<address_of_action>]]></literal></entry></row>
 <row><entry><literal><![CDATA[*]]></literal></entry><entry><literal><![CDATA[other_action<contents_of_action>]]></literal></entry></row>
 <row><entry><literal><![CDATA[,]]></literal></entry><entry><literal><![CDATA[other_action<comma_action>]]></literal></entry></row>
+<row><entry><literal><![CDATA[->*]]></literal></entry><entry><literal><![CDATA[other_action<member_pointer_action>]]></literal></entry></row>
 
 </tbody>
 </tgroup>

Modified: boost/trunk/libs/lambda/index.html
===================================================================
--- boost/trunk/libs/lambda/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/lambda/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,6 +3,10 @@
 <meta http-equiv="refresh" content="0; URL=../../doc/html/lambda.html">
 </head>
 <body>
-Automatic redirection failed, please go to <a href="../../doc/html/lambda.html">www.boost.org/doc/html/lambda.html</a>
+Automatic redirection failed, please go to <a href="../../doc/html/lambda.html">www.boost.org/doc/html/lambda.html</a>&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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: boost/trunk/libs/lambda/test/Jamfile
===================================================================
--- boost/trunk/libs/lambda/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/lambda/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,59 +0,0 @@
-# Lambda library
-
-# Copyright (C) 2001-2003 Jaakko Järvi
-
-# Use, modification and distribution is subject to the Boost Software License, 
-# Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at 
-# http://www.boost.org/LICENSE_1_0.txt) 
-
-# For more information, see http://www.boost.org/
-
-
-subproject libs/lambda/test ;
-
-# bring in rules for testing
-SEARCH on testing.jam = $(BOOST_BUILD_PATH) ;
-include testing.jam ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-  # look in BOOST_ROOT for sources first, just in this Jamfile
-  local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-
-  test-suite lambda
-    : 
-  [ run libs/lambda/test/algorithm_test.cpp :  :  :  :  ]
-
-  [ run libs/lambda/test/bind_tests_simple.cpp :  :  :  :  ]
-
-  [ run libs/lambda/test/bind_tests_advanced.cpp :  :  :  :  ]
-
-  [ run libs/lambda/test/bind_tests_simple_f_refs.cpp :  :  :  :  ]
-
-  [ run libs/lambda/test/bll_and_function.cpp :  :  :  :  ]
-
-  [ run libs/lambda/test/cast_test.cpp :  :  :  :  ]
-
-  [ run libs/lambda/test/constructor_tests.cpp :  :  :  :  ]
-
-  [ run libs/lambda/test/control_structures.cpp :  :  :  :  ]
-
-  [ run libs/lambda/test/exception_test.cpp :  :  :  :  ]
-
-  [ run libs/lambda/test/extending_rt_traits.cpp :  :  :  :  ]
-
-  [ run libs/lambda/test/is_instance_of_test.cpp :  :  :  :  ]
-
-  [ run libs/lambda/test/member_pointer_test.cpp :  :  :  :  ]
-
-  [ run libs/lambda/test/operator_tests_simple.cpp :  :  :  :  ]
-
-  [ run libs/lambda/test/phoenix_control_structures.cpp :  :  :  :  ]
-
-  [ run libs/lambda/test/switch_construct.cpp :  :  :  :  ]
- ;
-
-}
-      
\ No newline at end of file

Modified: boost/trunk/libs/libraries.htm
===================================================================
--- boost/trunk/libs/libraries.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/libraries.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -145,11 +145,11 @@
     domain of mathematics, from various authors.</li>
     <li><a href="math/doc/common_factor.html">math/common_factor</a> - Greatest
     common divisor and least common multiple, from Daryle Walker.</li>
-    <li><a href="math/octonion/index.html">math/octonion</a> -
+    <li><a href="../doc/html/boost_math/octonions.html">math/octonion</a> -
         Octonions, from Hubert Holin.</li>
-    <li><a href="math/quaternion/index.html">math/quaternion</a> -
+    <li><a href="../doc/html/boost_math/quaternions.html">math/quaternion</a> -
         Quaternions, from Hubert Holin.</li>
-    <li><a href="math/special_functions/index.html">math/special_functions</a> -
+    <li><a href="../doc/html/boost_math/math_special_functions.html">math/special_functions</a> -
         Mathematical special functions such as atanh, sinc, and sinhc,
         from Hubert Holin.</li>
     <li><a href="algorithm/minmax/index.html">minmax</a> - standard library
@@ -444,11 +444,11 @@
     Melquiond, Hervé Brönnimann and Sylvain Pion.</li>
     <li><a href="math/doc/common_factor.html">math/common_factor</a> - Greatest
     common divisor and least common multiple, from Daryle Walker.</li>
-    <li><a href="math/octonion/index.html">math/octonion</a> -
+    <li><a href="../doc/html/boost_math/octonions.html">math/octonion</a> -
       Octonions, from Hubert Holin.</li>
-    <li><a href="math/quaternion/index.html">math/quaternion</a> -
+    <li><a href="../doc/html/boost_math/quaternions.html">math/quaternion</a> -
       Quaternions, from Hubert Holin.</li>
-    <li><a href="math/special_functions/index.html">math/special_functions</a> -
+    <li><a href="../doc/html/boost_math/math_special_functions.html">math/special_functions</a> -
         Mathematical special functions such as atanh, sinc, and sinhc,
         from Hubert Holin.</li>
     <li><a href="multi_array/doc/index.html">multi_array</a> - Multidimensional

Deleted: boost/trunk/libs/logic/test/Jamfile
===================================================================
--- boost/trunk/libs/logic/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/logic/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,35 +0,0 @@
-# Tribool library
-
-# Copyright (C) 2002-2003 Douglas Gregor
-
-# Use, modification and distribution is subject to the Boost Software License, 
-# Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at 
-# http://www.boost.org/LICENSE_1_0.txt) 
-
-# For more information, see http://www.boost.org/
-
-
-# Testing Jamfile autogenerated from XML source
-subproject libs/logic/test ;
-
-# bring in rules for testing
-SEARCH on testing.jam = $(BOOST_BUILD_PATH) ;
-include testing.jam ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-  # look in BOOST_ROOT for sources first, just in this Jamfile
-  local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-
-  test-suite logic
-    : 
-    [ run libs/logic/test/tribool_test.cpp :  :  :  :  ]
-
-    [ run libs/logic/test/tribool_rename_test.cpp :  :  :  :  ]
-
-    [ run libs/logic/test/tribool_io_test.cpp :  :  :  :  ]
-   ;
-}
-      
\ No newline at end of file

Modified: boost/trunk/libs/maintainers.txt
===================================================================
--- boost/trunk/libs/maintainers.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/maintainers.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,13 +4,13 @@
 array
 assign                Thorsten Ottosen <nesotto -at- cs.auc.dk>
 bind                  Peter Dimov <pdimov -at- mmltd.net>
-concept_check         Jeremy Siek <jgs3847 -at- cs.rice.edu>
+concept_check         Jeremy Siek <jeremy.siek -at- gmail.com>
 config                John Maddock <john -at- johnmaddock.co.uk>
 conversion            Alexander Nasonov <alexander.nasonov -at- gmail.com>
 crc                   Daryle Walker <darylew -at- hotmail.com>
 date_time             Jeff Garland <jeff -at- crystalclearsoftware.com>
-disjoint_sets         Jeremy Siek <jgs3847 -at- cs.rice.edu>
-dynamic_bitset        Jeremy Siek <jgs3847 -at- cs.rice.edu>
+disjoint_sets         Jeremy Siek <jeremy.siek -at- gmail.com>
+dynamic_bitset        Jeremy Siek <jeremy.siek -at- gmail.com>
 filesystem            Beman Dawes <bdawes -at- acm.org>
 foreach               Eric Niebler <eric -at- boost-consulting.com>
 format                Samuel Krempp <krempp -at- crans.ens-cachan.fr>
@@ -47,10 +47,10 @@
 signals               Douglas Gregor <dgregor -at- cs.indiana.edu>
 smart_ptr             Beman Dawes <bdawes -at- acm.org>, Peter Dimov <pdimov -at- mmltd.net>
 spirit                Joel de Guzman <djowel -at- gmail.com>
-statechart            Andreas Huber <ahd6974-groups -at- yahoo.com>
+statechart            Andreas Huber <ahd6974-boostorg -at- yahoo.com>
 static_assert         John Maddock <john -at- johnmaddock.co.uk>
 test                  Gennadiy Rozental <gennadiy.rozental -at- thomson.com>
-thread                Michael Glassford <glassfordm -at- hotmail.com>
+thread                Anthony Williams <anthony -at- justsoftwaresolutions.co.uk>, Roland Schwarz <roland.schwarz -at- chello.at>
 timer                 Beman Dawes <bdawes -at- acm.org>
 tokenizer             John R. Bandela <jbandela -at- ufl.edu>
 tr1                   John Maddock <john -at- johnmaddock.co.uk>

Modified: boost/trunk/libs/math/doc/common_factor.html
===================================================================
--- boost/trunk/libs/math/doc/common_factor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/math/doc/common_factor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,17 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
   <head>
-    <meta http-equiv="refresh" content="0; URL=../../../doc/html/boost_math/greatest_common_divisor_and_least_common_multiple.html">
+    <meta http-equiv="refresh" content="0; URL=../../../doc/html/boost_math/gcd_lcm.html">
   </head>
   <body>
     Automatic redirection failed, please go to
-    <a href="../../doc/html/boost_math/greatest_common_divisor_and_least_common_multiple.html">../../doc/html/boost_math/greatest_common_divisor_and_least_common_multiple.html</a>
+    <a href="../../../doc/html/boost_math/gcd_lcm.html">../../../doc/html/boost_math/gcd_lcm.html</a>
+      <P>Copyright&nbsp;Daryle Walker 2006</P>
+      <P>Distributed under the Boost Software License, Version 1.0. (See accompanying file <A href="../../../LICENSE_1_0.txt">
+            LICENSE_1_0.txt</A> or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</A>).</P>
   </body>
 </html>
 
 
 
+

Modified: boost/trunk/libs/math/doc/index.html
===================================================================
--- boost/trunk/libs/math/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/math/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,8 +5,12 @@
   </head>
   <body>
     Automatic redirection failed, please go to
-    <a href="../../doc/html/boost_math.html">../../doc/html/boost_math.html</a>
+    <a href="../../../doc/html/boost_math.html">../../../doc/html/boost_math.html</a>
+      <P>Copyright Daryle Walker, Hubert Holin and John Maddock 2006</P>
+      <P>Distributed under the Boost Software License, Version 1.0. (See accompanying file <A href="../../../LICENSE_1_0.txt">
+            LICENSE_1_0.txt</A> or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</A>).</P>
   </body>
 </html>
 
 
+

Modified: boost/trunk/libs/math/doc/math-gcd.qbk
===================================================================
--- boost/trunk/libs/math/doc/math-gcd.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/math/doc/math-gcd.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-[section Greatest Common Divisor and Least Common Multiple]
+[section:gcd_lcm Greatest Common Divisor and Least Common Multiple]
 
 [section Introduction]
 
@@ -227,3 +227,4 @@
 [endsect]
 
 [endsect]
+

Modified: boost/trunk/libs/math/doc/math.qbk
===================================================================
--- boost/trunk/libs/math/doc/math.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/math/doc/math.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,7 +9,7 @@
     ]
     [authors [Holin, Hubert], [Maddock, John], [Walker, Daryle]]
     [category math]
-    [last-revision $Date: 2006/03/26 15:45:03 $]
+    [last-revision $Date: 2006/12/29 11:08:32 $]
 ]
 
 [def __asinh [link boost_math.math_special_functions.asinh asinh]]
@@ -25,7 +25,7 @@
 
 [section Overview]
 
-The [link boost_math.greatest_common_divisor_and_least_common_multiple Greatest Common Divisor and Least Common Multiple library] 
+The [link boost_math.gcd_lcm Greatest Common Divisor and Least Common Multiple library] 
 provides run-time and compile-time evaluation of the greatest common divisor (GCD) 
 or least common multiple (LCM) of two integers.
 

Modified: boost/trunk/libs/math/index.html
===================================================================
--- boost/trunk/libs/math/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/math/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,5 +5,9 @@
 <body>
 Automatic redirection failed, please go to
 <a href="../../doc/html/boost_math.html">../../doc/html/boost_math.html</a>.
+      <P>Copyright Daryle Walker, Hubert Holin and John Maddock 2006</P>
+      <P>Distributed under the Boost Software License, Version 1.0. (See accompanying file <A href="../../LICENSE_1_0.txt">
+            LICENSE_1_0.txt</A> or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</A>).</P>
 </body>
 </html>
+

Modified: boost/trunk/libs/math/quaternion/HSO3.hpp
===================================================================
--- boost/trunk/libs/math/quaternion/HSO3.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/math/quaternion/HSO3.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
 /*                                HSO3.hpp header file                                      */
 /*                                                                                          */
 /* This file is not currently part of the Boost library. It is simply an example of the use */
-/* quaternions can be put to. Hopefully it will be usefull too.                             */
+/* quaternions can be put to. Hopefully it will be useful too.                              */
 /*                                                                                          */
 /* This file provides tools to convert between quaternions and R^3 rotation matrices.       */
 /*                                                                                          */
@@ -96,8 +96,6 @@
 }
 
 
-namespace
-{
     template<typename TYPE_FLOAT>
     void    find_invariant_vector(  R3_matrix<TYPE_FLOAT> const & rot,
                                     TYPE_FLOAT & x,
@@ -390,9 +388,9 @@
         s = -x*w+z*u;
         t = +x*v-y*u;
     }
-}
 
 
+
 template<typename TYPE_FLOAT>
 inline bool                                is_R3_rotation_matrix(R3_matrix<TYPE_FLOAT> const & mat)
 {

Deleted: boost/trunk/libs/math/test/Jamfile
===================================================================
--- boost/trunk/libs/math/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/math/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,29 +0,0 @@
-subproject libs/math/test ;
-
-# bring in the rules for testing
-import testing ;
-
-run ../test/common_factor_test.cpp
-    <lib>../../test/build/boost_test_exec_monitor ;
-
-run ../octonion/octonion_test.cpp
-    <lib>../../test/build/boost_unit_test_framework ;
-
-run ../quaternion/quaternion_test.cpp
-    <lib>../../test/build/boost_unit_test_framework ;
-
-run ../special_functions/special_functions_test.cpp
-    <lib>../../test/build/boost_unit_test_framework ;
-
-run ../quaternion/quaternion_mult_incl_test.cpp 
-    ../quaternion/quaternion_mi1.cpp
-    ../quaternion/quaternion_mi2.cpp
-    <lib>../../test/build/boost_unit_test_framework ;
-    
-run complex_test.cpp : : : <borland><*><runtime-link>static <borland-5_6_4><*><runtime-link>static ;
-run hypot_test.cpp : : : <borland><*><runtime-link>static <borland-5_6_4><*><runtime-link>static ;
-run log1p_expm1_test.cpp : : : <borland><*><runtime-link>static <borland-5_6_4><*><runtime-link>static ;
-
-
-
-

Modified: boost/trunk/libs/math/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/math/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/math/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright Daryle Walker, Hubert Holin and John Maddock 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.
 
 
 # bring in the rules for testing
@@ -4,24 +8,25 @@
 import testing ;
 
 run ../test/common_factor_test.cpp
-    ../../test/build//boost_test_exec_monitor ;
+    ../../test/build//boost_unit_test_framework/<link>static ;
 
 run ../octonion/octonion_test.cpp
-    ../../test/build//boost_unit_test_framework ;
+    ../../test/build//boost_unit_test_framework/<link>static ;
 
 run ../quaternion/quaternion_test.cpp
-    ../../test/build//boost_unit_test_framework ;
+    ../../test/build//boost_unit_test_framework/<link>static ;
 
 run ../special_functions/special_functions_test.cpp
-    ../../test/build//boost_unit_test_framework ;
+    ../../test/build//boost_unit_test_framework/<link>static ;
 
 run ../quaternion/quaternion_mult_incl_test.cpp 
     ../quaternion/quaternion_mi1.cpp
     ../quaternion/quaternion_mi2.cpp
-    ../../test/build//boost_unit_test_framework ;
+    ../../test/build//boost_unit_test_framework/<link>static ;
 
 run complex_test.cpp ;
 run hypot_test.cpp ;
 run log1p_expm1_test.cpp ;
 
 
+

Modified: boost/trunk/libs/math/test/common_factor_test.cpp
===================================================================
--- boost/trunk/libs/math/test/common_factor_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/math/test/common_factor_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 //  Boost GCD & LCM common_factor.hpp test program  --------------------------//
 
-//  (C) Copyright Daryle Walker 2001.
+//  (C) Copyright Daryle Walker 2001, 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)
@@ -8,81 +8,344 @@
 //  See http://www.boost.org for most recent version including documentation.
 
 //  Revision History
+//  01 Dec 2006  Various fixes for old compilers (Joaquín M López Muñoz)
+//  10 Nov 2006  Make long long and __int64 mutually exclusive (Daryle Walker)
+//  04 Nov 2006  Use more built-in numeric types, binary-GCD (Daryle Walker)
+//  03 Nov 2006  Use custom numeric types (Daryle Walker)
+//  02 Nov 2006  Change to Boost.Test's unit test system (Daryle Walker)
 //  07 Nov 2001  Initial version (Daryle Walker)
 
-#define  BOOST_INCLUDE_MAIN
+#define BOOST_TEST_MAIN  "Boost.Math GCD & LCM unit tests"
 
-#include <boost/config.hpp>              // for BOOST_MSVC
-#include <boost/cstdlib.hpp>             // for boost::exit_success
+#include <boost/config.hpp>              // for BOOST_MSVC, etc.
+#include <boost/detail/workaround.hpp>
 #include <boost/math/common_factor.hpp>  // for boost::math::gcd, etc.
-#include <boost/test/test_tools.hpp>     // for main, BOOST_CHECK
+#include <boost/mpl/list.hpp>            // for boost::mpl::list
+#include <boost/operators.hpp>
+#include <boost/test/unit_test.hpp>
+#include <boost/test/test_case_template.hpp>
 
-#include <iostream>  // for std::cout (std::endl indirectly)
+#include <istream>  // for std::basic_istream
+#include <limits>   // for std::numeric_limits
+#include <ostream>  // for std::basic_ostream
 
 
-// Control to determine what kind of built-in integers are used
-#ifndef CONTROL_INT_TYPE
-#define CONTROL_INT_TYPE  int
+namespace {
+
+// TODO: add polynominal/non-real type; especially after any switch to the
+// binary-GCD algorithm for built-in types
+
+// Custom integer class (template)
+template < typename IntType, int ID = 0 >
+class my_wrapped_integer
+    : private ::boost::shiftable1<my_wrapped_integer<IntType, ID>,
+        ::boost::operators<my_wrapped_integer<IntType, ID> > >
+{
+    // Helper type-aliases
+    typedef my_wrapped_integer    self_type;
+    typedef IntType self_type::*  bool_type;
+
+    // Member data
+    IntType  v_;
+
+public:
+    // Template parameters
+    typedef IntType  int_type;
+
+    BOOST_STATIC_CONSTANT(int,id = ID);
+
+    // Lifetime management (use automatic destructor and copy constructor)
+    my_wrapped_integer( int_type const &v = int_type() )  : v_( v )  {}
+
+    // Accessors
+    int_type  value() const  { return this->v_; }
+
+    // Operators (use automatic copy assignment)
+    operator bool_type() const  { return this->v_ ? &self_type::v_ : 0; }
+
+    self_type &  operator ++()  { ++this->v_; return *this; }
+    self_type &  operator --()  { --this->v_; return *this; }
+
+    self_type  operator ~() const  { return self_type( ~this->v_ ); }
+    self_type  operator !() const  { return self_type( !this->v_ ); }
+    self_type  operator +() const  { return self_type( +this->v_ ); }
+    self_type  operator -() const  { return self_type( -this->v_ ); }
+
+    bool  operator  <( self_type const &r ) const  { return this->v_ < r.v_; }
+    bool  operator ==( self_type const &r ) const  { return this->v_ == r.v_; }
+
+    self_type &operator *=(self_type const &r) {this->v_ *= r.v_; return *this;}
+    self_type &operator /=(self_type const &r) {this->v_ /= r.v_; return *this;}
+    self_type &operator %=(self_type const &r) {this->v_ %= r.v_; return *this;}
+    self_type &operator +=(self_type const &r) {this->v_ += r.v_; return *this;}
+    self_type &operator -=(self_type const &r) {this->v_ -= r.v_; return *this;}
+    self_type &operator<<=(self_type const &r){this->v_ <<= r.v_; return *this;}
+    self_type &operator>>=(self_type const &r){this->v_ >>= r.v_; return *this;}
+    self_type &operator &=(self_type const &r) {this->v_ &= r.v_; return *this;}
+    self_type &operator |=(self_type const &r) {this->v_ |= r.v_; return *this;}
+    self_type &operator ^=(self_type const &r) {this->v_ ^= r.v_; return *this;}
+
+    // Input & output
+    friend std::istream & operator >>( std::istream &i, self_type &x )
+    { return i >> x.v_; }
+
+    friend std::ostream & operator <<( std::ostream &o, self_type const &x )
+    { return o << x.v_; }
+
+};  // my_wrapped_integer
+
+template < typename IntType, int ID >
+my_wrapped_integer<IntType, ID>  abs( my_wrapped_integer<IntType, ID> const &x )
+{ return ( x < my_wrapped_integer<IntType, ID>(0) ) ? -x : +x; }
+
+typedef my_wrapped_integer<int>          MyInt1;
+typedef my_wrapped_integer<unsigned>     MyUnsigned1;
+typedef my_wrapped_integer<int, 1>       MyInt2;
+typedef my_wrapped_integer<unsigned, 1>  MyUnsigned2;
+
+// Without these explicit instantiations, MSVC++ 6.5/7.0 does not find
+// some friend operators in certain contexts.
+MyInt1       dummy1;
+MyUnsigned1  dummy2;
+MyInt2       dummy3;
+MyUnsigned2  dummy4;
+
+// Various types to test with each GCD/LCM
+typedef ::boost::mpl::list<signed char, short, int, long,
+#ifdef BOOST_HAS_LONG_LONG
+ long long,
+#elif defined(BOOST_HAS_MS_INT64)
+ __int64,
 #endif
+ MyInt1>  signed_test_types;
+typedef ::boost::mpl::list<unsigned char, unsigned short, unsigned,
+ unsigned long,
+#ifdef BOOST_HAS_LONG_LONG
+ unsigned long long,
+#elif defined(BOOST_HAS_MS_INT64)
+ unsigned __int64,
+#endif
+ MyUnsigned1, MyUnsigned2>  unsigned_test_types;
 
+}  // namespace
 
-// Main testing function
-int
-test_main
-(
-    int         ,   // "argc" is unused
-    char *      []  // "argv" is unused
-)
-{    
-    using std::cout;
-    using std::endl;
 
+// Specialize numeric_limits for _some_ of our types
+namespace std
+{
+
+template < >
+class numeric_limits< MyInt1 >
+{
+    typedef MyInt1::int_type             int_type;
+    typedef numeric_limits<int_type>  limits_type;
+
+public:
+    BOOST_STATIC_CONSTANT(bool, is_specialized = limits_type::is_specialized);
+
+    static MyInt1 min() throw()  { return limits_type::min(); }
+    static MyInt1 max() throw()  { return limits_type::max(); }
+
+    BOOST_STATIC_CONSTANT(int, digits      = limits_type::digits);
+    BOOST_STATIC_CONSTANT(int, digits10    = limits_type::digits10);
+    BOOST_STATIC_CONSTANT(bool, is_signed  = limits_type::is_signed);
+    BOOST_STATIC_CONSTANT(bool, is_integer = limits_type::is_integer);
+    BOOST_STATIC_CONSTANT(bool, is_exact   = limits_type::is_exact);
+    BOOST_STATIC_CONSTANT(int, radix       = limits_type::radix);
+    static MyInt1 epsilon() throw()      { return limits_type::epsilon(); }
+    static MyInt1 round_error() throw()  { return limits_type::round_error(); }
+
+    BOOST_STATIC_CONSTANT(int, min_exponent   = limits_type::min_exponent);
+    BOOST_STATIC_CONSTANT(int, min_exponent10 = limits_type::min_exponent10);
+    BOOST_STATIC_CONSTANT(int, max_exponent   = limits_type::max_exponent);
+    BOOST_STATIC_CONSTANT(int, max_exponent10 = limits_type::max_exponent10);
+
+    BOOST_STATIC_CONSTANT(bool, has_infinity             = limits_type::has_infinity);
+    BOOST_STATIC_CONSTANT(bool, has_quiet_NaN            = limits_type::has_quiet_NaN);
+    BOOST_STATIC_CONSTANT(bool, has_signaling_NaN        = limits_type::has_signaling_NaN);
+    BOOST_STATIC_CONSTANT(float_denorm_style, has_denorm = limits_type::has_denorm);
+    BOOST_STATIC_CONSTANT(bool, has_denorm_loss          = limits_type::has_denorm_loss);
+
+    static MyInt1 infinity() throw()      { return limits_type::infinity(); }
+    static MyInt1 quiet_NaN() throw()     { return limits_type::quiet_NaN(); }
+    static MyInt1 signaling_NaN() throw() {return limits_type::signaling_NaN();}
+    static MyInt1 denorm_min() throw()    { return limits_type::denorm_min(); }
+
+    BOOST_STATIC_CONSTANT(bool, is_iec559  = limits_type::is_iec559);
+    BOOST_STATIC_CONSTANT(bool, is_bounded = limits_type::is_bounded);
+    BOOST_STATIC_CONSTANT(bool, is_modulo  = limits_type::is_modulo);
+
+    BOOST_STATIC_CONSTANT(bool, traps                    = limits_type::traps);
+    BOOST_STATIC_CONSTANT(bool, tinyness_before          = limits_type::tinyness_before);
+    BOOST_STATIC_CONSTANT(float_round_style, round_style = limits_type::round_style);
+
+};  // std::numeric_limits<MyInt1>
+
+template < >
+class numeric_limits< MyUnsigned1 >
+{
+    typedef MyUnsigned1::int_type        int_type;
+    typedef numeric_limits<int_type>  limits_type;
+
+public:
+    BOOST_STATIC_CONSTANT(bool, is_specialized = limits_type::is_specialized);
+
+    static MyUnsigned1 min() throw()  { return limits_type::min(); }
+    static MyUnsigned1 max() throw()  { return limits_type::max(); }
+
+    BOOST_STATIC_CONSTANT(int, digits      = limits_type::digits);
+    BOOST_STATIC_CONSTANT(int, digits10    = limits_type::digits10);
+    BOOST_STATIC_CONSTANT(bool, is_signed  = limits_type::is_signed);
+    BOOST_STATIC_CONSTANT(bool, is_integer = limits_type::is_integer);
+    BOOST_STATIC_CONSTANT(bool, is_exact   = limits_type::is_exact);
+    BOOST_STATIC_CONSTANT(int, radix       = limits_type::radix);
+    static MyUnsigned1 epsilon() throw()      { return limits_type::epsilon(); }
+    static MyUnsigned1 round_error() throw(){return limits_type::round_error();}
+
+    BOOST_STATIC_CONSTANT(int, min_exponent   = limits_type::min_exponent);
+    BOOST_STATIC_CONSTANT(int, min_exponent10 = limits_type::min_exponent10);
+    BOOST_STATIC_CONSTANT(int, max_exponent   = limits_type::max_exponent);
+    BOOST_STATIC_CONSTANT(int, max_exponent10 = limits_type::max_exponent10);
+
+    BOOST_STATIC_CONSTANT(bool, has_infinity             = limits_type::has_infinity);
+    BOOST_STATIC_CONSTANT(bool, has_quiet_NaN            = limits_type::has_quiet_NaN);
+    BOOST_STATIC_CONSTANT(bool, has_signaling_NaN        = limits_type::has_signaling_NaN);
+    BOOST_STATIC_CONSTANT(float_denorm_style, has_denorm = limits_type::has_denorm);
+    BOOST_STATIC_CONSTANT(bool, has_denorm_loss          = limits_type::has_denorm_loss);
+
+    static MyUnsigned1 infinity() throw()    { return limits_type::infinity(); }
+    static MyUnsigned1 quiet_NaN() throw()  { return limits_type::quiet_NaN(); }
+    static MyUnsigned1 signaling_NaN() throw()
+        { return limits_type::signaling_NaN(); }
+    static MyUnsigned1 denorm_min() throw(){ return limits_type::denorm_min(); }
+
+    BOOST_STATIC_CONSTANT(bool, is_iec559  = limits_type::is_iec559);
+    BOOST_STATIC_CONSTANT(bool, is_bounded = limits_type::is_bounded);
+    BOOST_STATIC_CONSTANT(bool, is_modulo  = limits_type::is_modulo);
+
+    BOOST_STATIC_CONSTANT(bool, traps                    = limits_type::traps);
+    BOOST_STATIC_CONSTANT(bool, tinyness_before          = limits_type::tinyness_before);
+    BOOST_STATIC_CONSTANT(float_round_style, round_style = limits_type::round_style);
+
+};  // std::numeric_limits<MyUnsigned1>
+
+#if BOOST_WORKAROUND(BOOST_MSVC,<1300)
+// MSVC 6.0 lacks operator<< for __int64, see
+// http://support.microsoft.com/default.aspx?scid=kb;en-us;168440
+
+inline ostream& operator<<(ostream& os, __int64 i)
+{
+    char buf[20];
+    sprintf(buf,"%I64d", i);
+    os << buf;
+    return os;
+}
+
+inline ostream& operator<<(ostream& os, unsigned __int64 i)
+{
+    char buf[20];
+    sprintf(buf,"%I64u", i);
+    os << buf;
+    return os;
+}
+#endif
+
+}  // namespace std
+
+// GCD tests
+BOOST_AUTO_TEST_SUITE( gcd_test_suite )
+
+// GCD on signed integer types
+BOOST_AUTO_TEST_CASE_TEMPLATE( gcd_int_test, T, signed_test_types )
+{
 #ifndef BOOST_MSVC
     using boost::math::gcd;
-    using boost::math::static_gcd;
-    using boost::math::lcm;
-    using boost::math::static_lcm;
 #else
     using namespace boost::math;
 #endif
 
-    typedef CONTROL_INT_TYPE  int_type;
-    typedef unsigned CONTROL_INT_TYPE uint_type;
+    // Originally from Boost.Rational tests
+    BOOST_CHECK_EQUAL( gcd<T>(  1,  -1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( gcd<T>( -1,   1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( gcd<T>(  1,   1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( gcd<T>( -1,  -1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( gcd<T>(  0,   0), static_cast<T>( 0) );
+    BOOST_CHECK_EQUAL( gcd<T>(  7,   0), static_cast<T>( 7) );
+    BOOST_CHECK_EQUAL( gcd<T>(  0,   9), static_cast<T>( 9) );
+    BOOST_CHECK_EQUAL( gcd<T>( -7,   0), static_cast<T>( 7) );
+    BOOST_CHECK_EQUAL( gcd<T>(  0,  -9), static_cast<T>( 9) );
+    BOOST_CHECK_EQUAL( gcd<T>( 42,  30), static_cast<T>( 6) );
+    BOOST_CHECK_EQUAL( gcd<T>(  6,  -9), static_cast<T>( 3) );
+    BOOST_CHECK_EQUAL( gcd<T>(-10, -10), static_cast<T>(10) );
+    BOOST_CHECK_EQUAL( gcd<T>(-25, -10), static_cast<T>( 5) );
+    BOOST_CHECK_EQUAL( gcd<T>(  3,   7), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( gcd<T>(  8,   9), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( gcd<T>(  7,  49), static_cast<T>( 7) );
+}
 
-    // GCD tests
-    cout << "Doing tests on gcd." << endl;
+// GCD on unmarked signed integer type
+BOOST_AUTO_TEST_CASE( gcd_unmarked_int_test )
+{
+#ifndef BOOST_MSVC
+    using boost::math::gcd;
+#else
+    using namespace boost::math;
+#endif
 
-    BOOST_CHECK( gcd<int_type>(  1,  -1) ==  1 );
-    BOOST_CHECK( gcd<int_type>( -1,   1) ==  1 );
-    BOOST_CHECK( gcd<int_type>(  1,   1) ==  1 );
-    BOOST_CHECK( gcd<int_type>( -1,  -1) ==  1 );
-    BOOST_CHECK( gcd<int_type>(  0,   0) ==  0 );
-    BOOST_CHECK( gcd<int_type>(  7,   0) ==  7 );
-    BOOST_CHECK( gcd<int_type>(  0,   9) ==  9 );
-    BOOST_CHECK( gcd<int_type>( -7,   0) ==  7 );
-    BOOST_CHECK( gcd<int_type>(  0,  -9) ==  9 );
-    BOOST_CHECK( gcd<int_type>( 42,  30) ==  6 );
-    BOOST_CHECK( gcd<int_type>(  6,  -9) ==  3 );
-    BOOST_CHECK( gcd<int_type>(-10, -10) == 10 );
-    BOOST_CHECK( gcd<int_type>(-25, -10) ==  5 );
-    BOOST_CHECK( gcd<int_type>(  3,   7) ==  1 );
-    BOOST_CHECK( gcd<int_type>(  8,   9) ==  1 );
-    BOOST_CHECK( gcd<int_type>(  7,  49) ==  7 );
+    // The regular signed-integer GCD function performs the unsigned version,
+    // then does an absolute-value on the result.  Signed types that are not
+    // marked as such (due to no std::numeric_limits specialization) may be off
+    // by a sign.
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>(   1,  -1 )), MyInt2( 1) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>(  -1,   1 )), MyInt2( 1) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>(   1,   1 )), MyInt2( 1) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>(  -1,  -1 )), MyInt2( 1) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>(   0,   0 )), MyInt2( 0) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>(   7,   0 )), MyInt2( 7) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>(   0,   9 )), MyInt2( 9) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>(  -7,   0 )), MyInt2( 7) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>(   0,  -9 )), MyInt2( 9) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>(  42,  30 )), MyInt2( 6) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>(   6,  -9 )), MyInt2( 3) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>( -10, -10 )), MyInt2(10) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>( -25, -10 )), MyInt2( 5) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>(   3,   7 )), MyInt2( 1) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>(   8,   9 )), MyInt2( 1) );
+    BOOST_CHECK_EQUAL( abs(gcd<MyInt2>(   7,  49 )), MyInt2( 7) );
+}
 
-    // GCD tests
-    cout << "Doing tests on unsigned-gcd." << endl;
+// GCD on unsigned integer types
+BOOST_AUTO_TEST_CASE_TEMPLATE( gcd_unsigned_test, T, unsigned_test_types )
+{
+#ifndef BOOST_MSVC
+    using boost::math::gcd;
+#else
+    using namespace boost::math;
+#endif
 
-    BOOST_CHECK( gcd<uint_type>(  1u,   1u) ==  1u );
-    BOOST_CHECK( gcd<uint_type>(  0u,   0u) ==  0u );
-    BOOST_CHECK( gcd<uint_type>(  7u,   0u) ==  7u );
-    BOOST_CHECK( gcd<uint_type>(  0u,   9u) ==  9u );
-    BOOST_CHECK( gcd<uint_type>( 42u,  30u) ==  6u );
-    BOOST_CHECK( gcd<uint_type>(  3u,   7u) ==  1u );
-    BOOST_CHECK( gcd<uint_type>(  8u,   9u) ==  1u );
-    BOOST_CHECK( gcd<uint_type>(  7u,  49u) ==  7u );
+    // Note that unmarked types (i.e. have no std::numeric_limits
+    // specialization) are treated like non/unsigned types
+    BOOST_CHECK_EQUAL( gcd<T>( 1u,   1u), static_cast<T>( 1u) );
+    BOOST_CHECK_EQUAL( gcd<T>( 0u,   0u), static_cast<T>( 0u) );
+    BOOST_CHECK_EQUAL( gcd<T>( 7u,   0u), static_cast<T>( 7u) );
+    BOOST_CHECK_EQUAL( gcd<T>( 0u,   9u), static_cast<T>( 9u) );
+    BOOST_CHECK_EQUAL( gcd<T>(42u,  30u), static_cast<T>( 6u) );
+    BOOST_CHECK_EQUAL( gcd<T>( 3u,   7u), static_cast<T>( 1u) );
+    BOOST_CHECK_EQUAL( gcd<T>( 8u,   9u), static_cast<T>( 1u) );
+    BOOST_CHECK_EQUAL( gcd<T>( 7u,  49u), static_cast<T>( 7u) );
+}
 
-    cout << "Doing tests on static_gcd." << endl;
+// GCD at compile-time
+BOOST_AUTO_TEST_CASE( gcd_static_test )
+{
+#ifndef BOOST_MSVC
+    using boost::math::static_gcd;
+#else
+    using namespace boost::math;
+#endif
 
+    // Can't use "BOOST_CHECK_EQUAL", otherwise the "value" member will be
+    // disqualified as compile-time-only constant, needing explicit definition
     BOOST_CHECK( (static_gcd< 1,  1>::value) == 1 );
     BOOST_CHECK( (static_gcd< 0,  0>::value) == 0 );
     BOOST_CHECK( (static_gcd< 7,  0>::value) == 7 );
@@ -91,40 +354,109 @@
     BOOST_CHECK( (static_gcd< 3,  7>::value) == 1 );
     BOOST_CHECK( (static_gcd< 8,  9>::value) == 1 );
     BOOST_CHECK( (static_gcd< 7, 49>::value) == 7 );
+}
 
-    // LCM tests
-    cout << "Doing tests on lcm." << endl;
+// TODO: non-built-in signed and unsigned integer tests, with and without
+// numeric_limits specialization; polynominal tests; note any changes if
+// built-ins switch to binary-GCD algorithm
 
-    BOOST_CHECK( lcm<int_type>(  1,  -1) ==  1 );
-    BOOST_CHECK( lcm<int_type>( -1,   1) ==  1 );
-    BOOST_CHECK( lcm<int_type>(  1,   1) ==  1 );
-    BOOST_CHECK( lcm<int_type>( -1,  -1) ==  1 );
-    BOOST_CHECK( lcm<int_type>(  0,   0) ==  0 );
-    BOOST_CHECK( lcm<int_type>(  6,   0) ==  0 );
-    BOOST_CHECK( lcm<int_type>(  0,   7) ==  0 );
-    BOOST_CHECK( lcm<int_type>( -5,   0) ==  0 );
-    BOOST_CHECK( lcm<int_type>(  0,  -4) ==  0 );
-    BOOST_CHECK( lcm<int_type>( 18,  30) == 90 );
-    BOOST_CHECK( lcm<int_type>( -6,   9) == 18 );
-    BOOST_CHECK( lcm<int_type>(-10, -10) == 10 );
-    BOOST_CHECK( lcm<int_type>( 25, -10) == 50 );
-    BOOST_CHECK( lcm<int_type>(  3,   7) == 21 );
-    BOOST_CHECK( lcm<int_type>(  8,   9) == 72 );
-    BOOST_CHECK( lcm<int_type>(  7,  49) == 49 );
+BOOST_AUTO_TEST_SUITE_END()
 
-    cout << "Doing tests on unsigned-lcm." << endl;
 
-    BOOST_CHECK( lcm<uint_type>(  1u,   1u) ==  1u );
-    BOOST_CHECK( lcm<uint_type>(  0u,   0u) ==  0u );
-    BOOST_CHECK( lcm<uint_type>(  6u,   0u) ==  0u );
-    BOOST_CHECK( lcm<uint_type>(  0u,   7u) ==  0u );
-    BOOST_CHECK( lcm<uint_type>( 18u,  30u) == 90u );
-    BOOST_CHECK( lcm<uint_type>(  3u,   7u) == 21u );
-    BOOST_CHECK( lcm<uint_type>(  8u,   9u) == 72u );
-    BOOST_CHECK( lcm<uint_type>(  7u,  49u) == 49u );
+// LCM tests
+BOOST_AUTO_TEST_SUITE( lcm_test_suite )
 
-    cout << "Doing tests on static_lcm." << endl;
+// LCM on signed integer types
+BOOST_AUTO_TEST_CASE_TEMPLATE( lcm_int_test, T, signed_test_types )
+{
+#ifndef BOOST_MSVC
+    using boost::math::lcm;
+#else
+    using namespace boost::math;
+#endif
 
+    // Originally from Boost.Rational tests
+    BOOST_CHECK_EQUAL( lcm<T>(  1,  -1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( lcm<T>( -1,   1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( lcm<T>(  1,   1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( lcm<T>( -1,  -1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( lcm<T>(  0,   0), static_cast<T>( 0) );
+    BOOST_CHECK_EQUAL( lcm<T>(  6,   0), static_cast<T>( 0) );
+    BOOST_CHECK_EQUAL( lcm<T>(  0,   7), static_cast<T>( 0) );
+    BOOST_CHECK_EQUAL( lcm<T>( -5,   0), static_cast<T>( 0) );
+    BOOST_CHECK_EQUAL( lcm<T>(  0,  -4), static_cast<T>( 0) );
+    BOOST_CHECK_EQUAL( lcm<T>( 18,  30), static_cast<T>(90) );
+    BOOST_CHECK_EQUAL( lcm<T>( -6,   9), static_cast<T>(18) );
+    BOOST_CHECK_EQUAL( lcm<T>(-10, -10), static_cast<T>(10) );
+    BOOST_CHECK_EQUAL( lcm<T>( 25, -10), static_cast<T>(50) );
+    BOOST_CHECK_EQUAL( lcm<T>(  3,   7), static_cast<T>(21) );
+    BOOST_CHECK_EQUAL( lcm<T>(  8,   9), static_cast<T>(72) );
+    BOOST_CHECK_EQUAL( lcm<T>(  7,  49), static_cast<T>(49) );
+}
+
+// LCM on unmarked signed integer type
+BOOST_AUTO_TEST_CASE( lcm_unmarked_int_test )
+{
+#ifndef BOOST_MSVC
+    using boost::math::lcm;
+#else
+    using namespace boost::math;
+#endif
+
+    // The regular signed-integer LCM function performs the unsigned version,
+    // then does an absolute-value on the result.  Signed types that are not
+    // marked as such (due to no std::numeric_limits specialization) may be off
+    // by a sign.
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(   1,  -1 )), MyInt2( 1) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(  -1,   1 )), MyInt2( 1) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(   1,   1 )), MyInt2( 1) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(  -1,  -1 )), MyInt2( 1) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(   0,   0 )), MyInt2( 0) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(   6,   0 )), MyInt2( 0) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(   0,   7 )), MyInt2( 0) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(  -5,   0 )), MyInt2( 0) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(   0,  -4 )), MyInt2( 0) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(  18,  30 )), MyInt2(90) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(  -6,   9 )), MyInt2(18) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>( -10, -10 )), MyInt2(10) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(  25, -10 )), MyInt2(50) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(   3,   7 )), MyInt2(21) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(   8,   9 )), MyInt2(72) );
+    BOOST_CHECK_EQUAL( abs(lcm<MyInt2>(   7,  49 )), MyInt2(49) );
+}
+
+// LCM on unsigned integer types
+BOOST_AUTO_TEST_CASE_TEMPLATE( lcm_unsigned_test, T, unsigned_test_types )
+{
+#ifndef BOOST_MSVC
+    using boost::math::lcm;
+#else
+    using namespace boost::math;
+#endif
+
+    // Note that unmarked types (i.e. have no std::numeric_limits
+    // specialization) are treated like non/unsigned types
+    BOOST_CHECK_EQUAL( lcm<T>( 1u,   1u), static_cast<T>( 1u) );
+    BOOST_CHECK_EQUAL( lcm<T>( 0u,   0u), static_cast<T>( 0u) );
+    BOOST_CHECK_EQUAL( lcm<T>( 6u,   0u), static_cast<T>( 0u) );
+    BOOST_CHECK_EQUAL( lcm<T>( 0u,   7u), static_cast<T>( 0u) );
+    BOOST_CHECK_EQUAL( lcm<T>(18u,  30u), static_cast<T>(90u) );
+    BOOST_CHECK_EQUAL( lcm<T>( 3u,   7u), static_cast<T>(21u) );
+    BOOST_CHECK_EQUAL( lcm<T>( 8u,   9u), static_cast<T>(72u) );
+    BOOST_CHECK_EQUAL( lcm<T>( 7u,  49u), static_cast<T>(49u) );
+}
+
+// LCM at compile-time
+BOOST_AUTO_TEST_CASE( lcm_static_test )
+{
+#ifndef BOOST_MSVC
+    using boost::math::static_lcm;
+#else
+    using namespace boost::math;
+#endif
+
+    // Can't use "BOOST_CHECK_EQUAL", otherwise the "value" member will be
+    // disqualified as compile-time-only constant, needing explicit definition
     BOOST_CHECK( (static_lcm< 1,  1>::value) ==  1 );
     BOOST_CHECK( (static_lcm< 0,  0>::value) ==  0 );
     BOOST_CHECK( (static_lcm< 6,  0>::value) ==  0 );
@@ -133,6 +465,8 @@
     BOOST_CHECK( (static_lcm< 3,  7>::value) == 21 );
     BOOST_CHECK( (static_lcm< 8,  9>::value) == 72 );
     BOOST_CHECK( (static_lcm< 7, 49>::value) == 49 );
+}
 
-    return boost::exit_success;
-}
+// TODO: see GCD to-do
+
+BOOST_AUTO_TEST_SUITE_END()

Modified: boost/trunk/libs/mem_fn/index.html
===================================================================
--- boost/trunk/libs/mem_fn/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mem_fn/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,11 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="../bind/mem_fn.html">../bind/mem_fn.html</a>.
+<a href="../bind/mem_fn.html">../bind/mem_fn.html</a>.&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
+<p>&nbsp;</p>
 </body>
-</html>
+</html>
\ No newline at end of file

Modified: boost/trunk/libs/mpl/doc/index.html
===================================================================
--- boost/trunk/libs/mpl/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/accumulate.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/accumulate.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/accumulate.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/acknowledgements.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/acknowledgements.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/acknowledgements.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/advance.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/advance.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/advance.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/algorithms-concepts.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/algorithms-concepts.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/algorithms-concepts.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/algorithms.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/algorithms.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/algorithms.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/always.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/always.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/always.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/and.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/and.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/and.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/apply-wrap.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/apply-wrap.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/apply-wrap.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/apply.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/apply.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/apply.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/arg.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/arg.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/arg.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/arithmetic-operations.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/arithmetic-operations.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/arithmetic-operations.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/assert-msg.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/assert-msg.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/assert-msg.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/assert-not.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/assert-not.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/assert-not.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/assert-relation.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/assert-relation.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/assert-relation.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/assert.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/assert.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/assert.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/asserts.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/asserts.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/asserts.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/associative-sequence.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/associative-sequence.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/associative-sequence.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/at-c.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/at-c.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/at-c.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/at.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/at.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/at.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/aux-lambda-support.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/aux-lambda-support.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/aux-lambda-support.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/back-extensible-sequence.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/back-extensible-sequence.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/back-extensible-sequence.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/back-inserter.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/back-inserter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/back-inserter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/back.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/back.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/back.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/begin.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/begin.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/begin.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/bidirectional-iterator.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/bidirectional-iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/bidirectional-iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/bidirectional-sequence.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/bidirectional-sequence.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/bidirectional-sequence.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/bind.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/bind.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/bind.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/bitand.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/bitand.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/bitand.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/bitor.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/bitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/bitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/bitwise-operations.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/bitwise-operations.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/bitwise-operations.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/bitxor.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/bitxor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/bitxor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/bool.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/bool.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/bool.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/broken-compiler.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/broken-compiler.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/broken-compiler.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/categorized-concepts.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/categorized-concepts.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/categorized-concepts.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/categorized-index.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/categorized-index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/categorized-index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/cfg-no-has-xxx.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/cfg-no-has-xxx.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/cfg-no-has-xxx.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/cfg-no-preprocessed.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/cfg-no-preprocessed.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/cfg-no-preprocessed.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/classes.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/classes.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/classes.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/clear.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/clear.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/clear.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/comparisons.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/comparisons.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/comparisons.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/components.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/components.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/components.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/composition-and-argument.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/composition-and-argument.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/composition-and-argument.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/concepts.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/concepts.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/concepts.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/configuration.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/configuration.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/configuration.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/contains.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/contains.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/contains.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/copy-if.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/copy-if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/copy-if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/copy.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/copy.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/copy.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/count-if.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/count-if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/count-if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/count.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/count.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/count.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/data-concepts.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/data-concepts.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/data-concepts.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/data-miscellaneous.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/data-miscellaneous.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/data-miscellaneous.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/data-types.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/data-types.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/data-types.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/deque.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/deque.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/deque.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/deref.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/deref.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/deref.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/distance.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/distance.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/distance.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/divides.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/divides.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/divides.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/empty-base.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/empty-base.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/empty-base.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/empty-sequence.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/empty-sequence.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/empty-sequence.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/empty.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/empty.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/empty.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/end.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/end.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/end.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/equal-to.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/equal-to.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/equal-to.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/equal.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/equal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/equal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/erase-key.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/erase-key.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/erase-key.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/erase.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/erase.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/erase.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/eval-if-c.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/eval-if-c.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/eval-if-c.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/eval-if.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/eval-if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/eval-if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/extensible-associative.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/extensible-associative.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/extensible-associative.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/extensible-sequence.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/extensible-sequence.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/extensible-sequence.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/filter-view.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/filter-view.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/filter-view.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/find-if.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/find-if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/find-if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/find.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/find.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/find.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/fold.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/fold.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/fold.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/forward-iterator.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/forward-iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/forward-iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/forward-sequence.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/forward-sequence.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/forward-sequence.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/front-extensible-sequence.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/front-extensible-sequence.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/front-extensible-sequence.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/front-inserter.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/front-inserter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/front-inserter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/front.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/front.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/front.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/greater-equal.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/greater-equal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/greater-equal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/greater.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/greater.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/greater.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/has-key.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/has-key.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/has-key.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/has-xxx-trait-def.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/has-xxx-trait-def.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/has-xxx-trait-def.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/has-xxx-trait-named-def.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/has-xxx-trait-named-def.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/has-xxx-trait-named-def.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/identity.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/identity.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/identity.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/if-c.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/if-c.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/if-c.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/if.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/inherit-linearly.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/inherit-linearly.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/inherit-linearly.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/inherit.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/inherit.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/inherit.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/insert-range.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/insert-range.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/insert-range.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/insert.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/insert.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/insert.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/inserter.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/inserter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/inserter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/inserters-inserter.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/inserters-inserter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/inserters-inserter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/inserters.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/inserters.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/inserters.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/int.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/int.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/int.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/integral-c.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/integral-c.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/integral-c.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/integral-constant.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/integral-constant.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/integral-constant.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/integral-sequence-wrapper.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/integral-sequence-wrapper.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/integral-sequence-wrapper.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/intrinsic-metafunctions.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/intrinsic-metafunctions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/intrinsic-metafunctions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/introspection.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/introspection.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/introspection.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/invocation.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/invocation.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/invocation.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/is-sequence.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/is-sequence.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/is-sequence.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/iter-fold.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/iter-fold.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/iter-fold.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/iteration-algorithms.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/iteration-algorithms.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/iteration-algorithms.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/iterator-category.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/iterator-category.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/iterator-category.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/iterator-metafunctions.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/iterator-metafunctions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/iterator-metafunctions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/iterator-range.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/iterator-range.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/iterator-range.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/iterators-concepts.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/iterators-concepts.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/iterators-concepts.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/iterators.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/iterators.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/iterators.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/joint-view.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/joint-view.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/joint-view.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/key-type.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/key-type.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/key-type.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/lambda-expression.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/lambda-expression.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/lambda-expression.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/lambda.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/lambda.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/lambda.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/less-equal.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/less-equal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/less-equal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/less.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/less.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/less.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/limit-list-size.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/limit-list-size.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/limit-list-size.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/limit-map-size.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/limit-map-size.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/limit-map-size.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/limit-metafunction-arity.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/limit-metafunction-arity.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/limit-metafunction-arity.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/limit-set-size.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/limit-set-size.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/limit-set-size.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/limit-unrolling.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/limit-unrolling.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/limit-unrolling.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/limit-vector-size.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/limit-vector-size.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/limit-vector-size.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/list-c.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/list-c.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/list-c.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/list.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/list.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/list.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/logical-operations.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/logical-operations.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/logical-operations.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/long.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/long.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/long.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/lower-bound.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/lower-bound.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/lower-bound.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/macros.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/macros.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/macros.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/map.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/map.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/map.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/max-element.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/max-element.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/max-element.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/max.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/max.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/max.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/metafunction-class.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/metafunction-class.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/metafunction-class.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/metafunction.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/metafunction.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/metafunction.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/metafunctions-concepts.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/metafunctions-concepts.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/metafunctions-concepts.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/metafunctions.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/metafunctions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/metafunctions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/min-element.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/min-element.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/min-element.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/min.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/min.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/min.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/minus.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/minus.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/minus.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/miscellaneous.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/miscellaneous.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/miscellaneous.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/modulus.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/modulus.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/modulus.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/negate.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/negate.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/negate.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/next.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/next.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/next.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/not-equal-to.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/not-equal-to.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/not-equal-to.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/not.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/not.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/not.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/numeric-cast.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/numeric-cast.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/numeric-cast.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/numeric-metafunction.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/numeric-metafunction.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/numeric-metafunction.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/numeric.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/numeric.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/numeric.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/or.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/or.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/or.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/order.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/order.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/order.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/pair.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/pair.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/pair.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/partition.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/partition.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/partition.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/placeholder-expression.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/placeholder-expression.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/placeholder-expression.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/placeholders.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/placeholders.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/placeholders.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/plus.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/plus.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/plus.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/pop-back.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/pop-back.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/pop-back.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/pop-front.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/pop-front.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/pop-front.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/prior.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/prior.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/prior.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/protect.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/protect.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/protect.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/push-back.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/push-back.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/push-back.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/push-front.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/push-front.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/push-front.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/querying-algorithms.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/querying-algorithms.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/querying-algorithms.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/quote.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/quote.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/quote.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/random-access-iterator.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/random-access-iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/random-access-iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/random-access-sequence.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/random-access-sequence.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/random-access-sequence.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/range-c.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/range-c.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/range-c.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/refmanual_toc.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/refmanual_toc.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/refmanual_toc.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/remove-if.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/remove-if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/remove-if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/remove.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/remove.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/remove.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/replace-if.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/replace-if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/replace-if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/replace.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/replace.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/replace.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/reverse-copy-if.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/reverse-copy-if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/reverse-copy-if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/reverse-copy.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/reverse-copy.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/reverse-copy.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/reverse-fold.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/reverse-fold.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/reverse-fold.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/reverse-iter-fold.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/reverse-iter-fold.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/reverse-iter-fold.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/reverse-partition.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/reverse-partition.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/reverse-partition.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/reverse-remove-if.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/reverse-remove-if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/reverse-remove-if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/reverse-remove.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/reverse-remove.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/reverse-remove.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/reverse-replace-if.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/reverse-replace-if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/reverse-replace-if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/reverse-replace.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/reverse-replace.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/reverse-replace.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/reverse-stable-partition.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/reverse-stable-partition.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/reverse-stable-partition.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/reverse-transform.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/reverse-transform.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/reverse-transform.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/reverse-unique.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/reverse-unique.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/reverse-unique.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/reverse.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/reverse.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/reverse.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/reversible-algorithm.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/reversible-algorithm.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/reversible-algorithm.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/sequence-tag.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/sequence-tag.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/sequence-tag.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/sequences.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/sequences.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/sequences.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/set-c.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/set-c.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/set-c.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/set.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/set.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/set.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/shift-left.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/shift-left.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/shift-left.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/shift-right.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/shift-right.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/shift-right.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/single-view.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/single-view.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/single-view.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/size-t.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/size-t.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/size-t.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/size.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/size.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/size.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/sizeof.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/sizeof.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/sizeof.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/sort.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/sort.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/sort.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/stable-partition.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/stable-partition.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/stable-partition.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/tag-dispatched.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/tag-dispatched.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/tag-dispatched.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/terminology.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/terminology.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/terminology.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/times.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/times.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/times.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/transform-view.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/transform-view.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/transform-view.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/transform.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/transform.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/transform.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/transformation-algorithms.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/transformation-algorithms.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/transformation-algorithms.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/trivial-metafunction.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/trivial-metafunction.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/trivial-metafunction.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/trivial-metafunctions.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/trivial-metafunctions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/trivial-metafunctions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/trivial.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/trivial.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/trivial.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/type-selection.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/type-selection.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/type-selection.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/unique.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/unique.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/unique.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/unpack-args.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/unpack-args.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/unpack-args.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/upper-bound.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/upper-bound.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/upper-bound.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/value-type.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/value-type.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/value-type.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/variadic-sequence.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/variadic-sequence.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/variadic-sequence.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/vector-c.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/vector-c.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/vector-c.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/vector.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/vector.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/vector.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/views.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/views.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/views.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/void.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/void.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/void.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual/zip-view.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual/zip-view.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual/zip-view.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/refmanual.html
===================================================================
--- boost/trunk/libs/mpl/doc/refmanual.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/refmanual.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/src/refmanual/ASSERT_MSG.rst
===================================================================
--- boost/trunk/libs/mpl/doc/src/refmanual/ASSERT_MSG.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/src/refmanual/ASSERT_MSG.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -62,7 +62,7 @@
     ``t1``, ``t2``,... ``tn`` are non-``void``. 
 
 :Semantics:
-    Generates a compilation error if ``expr != true``, otherwise
+    Generates a compilation error if ``expr::value != true``, otherwise
     has no effect. 
     
     When possible within the compiler's diagnostic capabilities,
@@ -85,7 +85,7 @@
     None.
 
 :Semantics:
-    Generates a compilation error if ``expr != true``, otherwise
+    Generates a compilation error if ``expr::value != true``, otherwise
     has no effect. 
 
     When possible within the compiler's diagnostics capabilities,

Copied: boost/trunk/libs/mpl/doc/src/refmanual/Algorithms-Runtime.rst (from rev 14034, boost/branches/upstream/current/libs/mpl/doc/src/refmanual/Algorithms-Runtime.rst)

Modified: boost/trunk/libs/mpl/doc/src/refmanual/IntegralConstant.rst
===================================================================
--- boost/trunk/libs/mpl/doc/src/refmanual/IntegralConstant.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/src/refmanual/IntegralConstant.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,6 +19,8 @@
 +-----------------------------------+---------------------------------------+---------------------------+
 | Expression                        | Type                                  | Complexity                |
 +===================================+=======================================+===========================+
+| ``n::tag``                        | ``integral_c_tag``                    | Constant time.            |
++-----------------------------------+---------------------------------------+---------------------------+
 | ``n::value_type``                 | An integral type                      | Constant time.            |
 +-----------------------------------+---------------------------------------+---------------------------+
 | ``n::value``                      | An integral constant expression       | Constant time.            |
@@ -39,6 +41,9 @@
 +---------------------------------------+-----------------------------------------------------------+
 | Expression                            | Semantics                                                 |
 +=======================================+===========================================================+
+| ``n::tag``                            | ``n``\ 's tag type; ``n::tag::value`` is ``n``\ 's        |
+|                                       | *conversion rank*.                                        |
++---------------------------------------+-----------------------------------------------------------+
 | ``n::value_type``                     | A cv-unqualified type of ``n::value``.                    |
 +---------------------------------------+-----------------------------------------------------------+
 | ``n::value``                          | The value of the wrapped integral constant.               |

Copied: boost/trunk/libs/mpl/doc/src/refmanual/for_each.rst (from rev 14034, boost/branches/upstream/current/libs/mpl/doc/src/refmanual/for_each.rst)

Modified: boost/trunk/libs/mpl/doc/src/refmanual/refmanual.toc
===================================================================
--- boost/trunk/libs/mpl/doc/src/refmanual/refmanual.toc	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/src/refmanual/refmanual.toc	2007-02-16 16:48:35 UTC (rev 14035)
@@ -12,6 +12,7 @@
 Algorithms/Iteration Algorithms
 Algorithms/Querying Algorithms
 Algorithms/Transformation Algorithms
+Algorithms/Runtime Algorithms
 Metafunctions
 Metafunctions/Concepts
 Metafunctions/Type Selection

Modified: boost/trunk/libs/mpl/doc/src/refmanual/transform.rst
===================================================================
--- boost/trunk/libs/mpl/doc/src/refmanual/transform.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/src/refmanual/transform.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,7 +9,7 @@
 .. parsed-literal::
     
     template<
-          typename Seq
+          typename Sequence
         , typename Op
         , typename In = |unspecified|
         >
@@ -35,11 +35,11 @@
 
 ``transform`` is an |overloaded name|:
 
-* ``transform<Seq,Op>`` returns a transformed copy of the original sequence 
+* ``transform<Sequence,Op>`` returns a transformed copy of the original sequence 
   produced by applying an unary transformation ``Op`` to every element 
   in the |begin/end<Sequence>| range.
 
-* ``transform<Seq1,Seq2,Op>`` returns a new sequence produced by applying a
+* ``transform<Seq1,Seq2,BinaryOp>`` returns a new sequence produced by applying a
   binary transformation ``BinaryOp`` to a pair of elements (e\ :sub:`1`, e2\ :sub:`1`) 
   from the corresponding |begin/end<Seq1>| and |begin/end<Seq2>| ranges.
 

Modified: boost/trunk/libs/mpl/doc/tutorial/acknowledgements.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/acknowledgements.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/acknowledgements.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/apply-lambda-semantics.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/apply-lambda-semantics.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/apply-lambda-semantics.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/broken-integral-constant.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/broken-integral-constant.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/broken-integral-constant.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/changelog-history.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/changelog-history.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/changelog-history.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/changes-in-boost-1-32-0.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/changes-in-boost-1-32-0.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/changes-in-boost-1-32-0.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/dependencies.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/dependencies.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/dependencies.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/details.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/details.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/details.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/dimensional-analysis.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/dimensional-analysis.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/dimensional-analysis.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/eti.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/eti.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/eti.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/exercises.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/exercises.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/exercises.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/handling-placeholders.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/handling-placeholders.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/handling-placeholders.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/higher-order.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/higher-order.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/higher-order.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/implementing-addition-and.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/implementing-addition-and.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/implementing-addition-and.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/implementing-division.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/implementing-division.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/implementing-division.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/implementing.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/implementing.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/implementing.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/incomplete-support-for.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/incomplete-support-for.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/incomplete-support-for.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/iterator-protocol.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/iterator-protocol.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/iterator-protocol.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/lambda-and-non.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/lambda-and-non.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/lambda-and-non.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/lambda-details.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/lambda-details.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/lambda-details.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/metafunction-composition.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/metafunction-composition.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/metafunction-composition.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/miscellaneous.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/miscellaneous.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/miscellaneous.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/more-lambda-capabilities.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/more-lambda-capabilities.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/more-lambda-capabilities.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/numeric-metafunction.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/numeric-metafunction.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/numeric-metafunction.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/partial-metafunction.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/partial-metafunction.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/partial-metafunction.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/physical-structure.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/physical-structure.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/physical-structure.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/placeholder-expression.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/placeholder-expression.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/placeholder-expression.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/placeholders.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/placeholders.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/placeholders.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/portability.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/portability.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/portability.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/reference-manual.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/reference-manual.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/reference-manual.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/renaming-cleanup.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/renaming-cleanup.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/renaming-cleanup.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/representing-dimensions.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/representing-dimensions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/representing-dimensions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/representing-quantities.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/representing-quantities.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/representing-quantities.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/resources.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/resources.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/resources.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/tag-dispatching-protocol.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/tag-dispatching-protocol.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/tag-dispatching-protocol.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/technical-details.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/technical-details.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/technical-details.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/the-apply-metafunction.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/the-apply-metafunction.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/the-apply-metafunction.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/the-importance-of-being.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/the-importance-of-being.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/the-importance-of-being.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/the-lambda-metafunction.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/the-lambda-metafunction.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/the-lambda-metafunction.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/tutorial-metafunctions.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/tutorial-metafunctions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/tutorial-metafunctions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Modified: boost/trunk/libs/mpl/doc/tutorial/tutorial_toc.html
===================================================================
--- boost/trunk/libs/mpl/doc/tutorial/tutorial_toc.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/doc/tutorial/tutorial_toc.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <?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">
+<!-- Copyright Aleksey Gurtovoy 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) -->
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" />

Deleted: boost/trunk/libs/mpl/example/Jamfile
===================================================================
--- boost/trunk/libs/mpl/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +0,0 @@
-subproject libs/mpl/example ;
-
-# bring in rules for testing
-import testing ;
-
-run fsm/player.cpp ;
-run fsm/player2.cpp ;
-run inherit_linearly.cpp ;
-run inherit_multiply.cpp ;
-run tuple_from_list.cpp ;
-compile integer.cpp ;

Copied: boost/trunk/libs/mpl/example/fsm/README.txt (from rev 14034, boost/branches/upstream/current/libs/mpl/example/fsm/README.txt)

Modified: boost/trunk/libs/mpl/index.html
===================================================================
--- boost/trunk/libs/mpl/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,10 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="doc/index.html">doc/index.html</a>.
+<a href="doc/index.html">doc/index.html</a>.&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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

Modified: boost/trunk/libs/mpl/preprocessed/list/list10.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/list/list10.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/list/list10.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/list/list10.cpp,v $
-// $Date: 2004/09/05 09:45:16 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:53 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/list/list10_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/list/list10_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/list/list10_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/list/list10_c.cpp,v $
-// $Date: 2004/09/05 09:45:16 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/list/list20.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/list/list20.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/list/list20.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/list/list20.cpp,v $
-// $Date: 2004/09/05 09:45:16 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/list/list20_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/list/list20_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/list/list20_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/list/list20_c.cpp,v $
-// $Date: 2004/09/05 09:45:16 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/list/list30.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/list/list30.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/list/list30.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/list/list30.cpp,v $
-// $Date: 2004/09/05 09:45:16 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/list/list30_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/list/list30_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/list/list30_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/list/list30_c.cpp,v $
-// $Date: 2004/09/05 09:45:16 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/list/list40.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/list/list40.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/list/list40.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/list/list40.cpp,v $
-// $Date: 2004/09/05 09:45:16 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/list/list40_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/list/list40_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/list/list40_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/list/list40_c.cpp,v $
-// $Date: 2004/09/05 09:45:16 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/list/list50.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/list/list50.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/list/list50.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/list/list50.cpp,v $
-// $Date: 2004/09/05 09:45:16 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/list/list50_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/list/list50_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/list/list50_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/list/list50_c.cpp,v $
-// $Date: 2004/09/05 09:45:16 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/map/map10.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/map/map10.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/map/map10.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/map/map10.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/map/map20.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/map/map20.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/map/map20.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/map/map20.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/map/map30.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/map/map30.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/map/map30.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/map/map30.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/map/map40.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/map/map40.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/map/map40.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/map/map40.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/map/map50.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/map/map50.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/map/map50.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/map/map50.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/preprocess_list.py
===================================================================
--- boost/trunk/libs/mpl/preprocessed/preprocess_list.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/preprocess_list.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-# Copyright Aleksey Gurtovoy 2001-2004
+# Copyright Aleksey Gurtovoy 2001-2006
 #
 # Distributed under the Boost Software License, Version 1.0. 
 # (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,13 +8,14 @@
 # See http://www.boost.org/libs/mpl for documentation.
 
 # $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/preprocess_list.py,v $
-# $Date: 2004/09/02 15:41:30 $
-# $Revision: 1.2 $
+# $Date: 2006/11/23 19:57:11 $
+# $Revision: 1.2.8.1 $
 
 import preprocess
+import os.path
 
 preprocess.main(
       [ "plain" ]
     , "list"
-    , "boost\\mpl\\list\\aux_\\preprocessed"
+    , os.path.join( "boost", "mpl", "list", "aux_", "preprocessed" )
     )

Modified: boost/trunk/libs/mpl/preprocessed/preprocess_map.py
===================================================================
--- boost/trunk/libs/mpl/preprocessed/preprocess_map.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/preprocess_map.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-# Copyright Aleksey Gurtovoy 2001-2004
+# Copyright Aleksey Gurtovoy 2001-2006
 #
 # Distributed under the Boost Software License, Version 1.0. 
 # (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,13 +8,14 @@
 # See http://www.boost.org/libs/mpl for documentation.
 
 # $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/preprocess_map.py,v $
-# $Date: 2004/12/14 12:57:14 $
-# $Revision: 1.3 $
+# $Date: 2006/11/23 19:57:11 $
+# $Revision: 1.3.4.1 $
 
 import preprocess
+import os.path
 
 preprocess.main(
       [ "plain", "typeof_based", "no_ctps" ]
     , "map"
-    , "boost\\mpl\\map\\aux_\\preprocessed"
+    , os.path.join( "boost", "mpl", "map", "aux_", "preprocessed" )
     )

Modified: boost/trunk/libs/mpl/preprocessed/preprocess_set.py
===================================================================
--- boost/trunk/libs/mpl/preprocessed/preprocess_set.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/preprocess_set.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-# Copyright Aleksey Gurtovoy 2001-2004
+# Copyright Aleksey Gurtovoy 2001-2006
 #
 # Distributed under the Boost Software License, Version 1.0. 
 # (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,13 +8,14 @@
 # See http://www.boost.org/libs/mpl for documentation.
 
 # $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/preprocess_set.py,v $
-# $Date: 2004/09/02 15:41:30 $
-# $Revision: 1.2 $
+# $Date: 2006/11/23 19:57:11 $
+# $Revision: 1.2.8.1 $
 
 import preprocess
+import os.path
 
 preprocess.main(
       [ "plain" ]
     , "set"
-    , "boost\\mpl\\set\\aux_\\preprocessed"
+    , os.path.join( "boost", "mpl", "set", "aux_", "preprocessed" )
     )

Modified: boost/trunk/libs/mpl/preprocessed/preprocess_vector.py
===================================================================
--- boost/trunk/libs/mpl/preprocessed/preprocess_vector.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/preprocess_vector.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-# Copyright Aleksey Gurtovoy 2001-2004
+# Copyright Aleksey Gurtovoy 2001-2006
 #
 # Distributed under the Boost Software License, Version 1.0. 
 # (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,13 +8,14 @@
 # See http://www.boost.org/libs/mpl for documentation.
 
 # $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/preprocess_vector.py,v $
-# $Date: 2004/09/02 15:41:30 $
-# $Revision: 1.2 $
+# $Date: 2006/11/23 19:57:11 $
+# $Revision: 1.2.8.1 $
 
 import preprocess
+import os.path
 
 preprocess.main(
       [ "no_ctps", "plain", "typeof_based" ]
     , "vector"
-    , "boost\\mpl\\vector\\aux_\\preprocessed"
+    , os.path.join( "boost", "mpl", "vector", "aux_", "preprocessed" )
     )

Modified: boost/trunk/libs/mpl/preprocessed/set/set10.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/set/set10.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/set/set10.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/set/set10.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/set/set10_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/set/set10_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/set/set10_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/set/set10_c.cpp,v $
-// $Date: 2004/11/28 03:35:12 $
-// $Revision: 1.2 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.2.6.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/set/set20.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/set/set20.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/set/set20.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/set/set20.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/set/set20_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/set/set20_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/set/set20_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/set/set20_c.cpp,v $
-// $Date: 2004/11/28 03:35:12 $
-// $Revision: 1.2 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.2.6.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/set/set30.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/set/set30.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/set/set30.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/set/set30.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/set/set30_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/set/set30_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/set/set30_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/set/set30_c.cpp,v $
-// $Date: 2004/11/28 03:35:12 $
-// $Revision: 1.2 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.2.6.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/set/set40.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/set/set40.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/set/set40.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/set/set40.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/set/set40_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/set/set40_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/set/set40_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/set/set40_c.cpp,v $
-// $Date: 2004/11/28 03:35:12 $
-// $Revision: 1.2 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.2.6.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/set/set50.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/set/set50.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/set/set50.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/set/set50.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/set/set50_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/set/set50_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/set/set50_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-4004
+// Copyright Aleksey Gurtovoy 2003-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/set/set50_c.cpp,v $
-// $Date: 2004/11/28 03:35:12 $
-// $Revision: 1.2 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.2.6.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/advance_backward.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/advance_backward.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/advance_backward.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/advance_backward.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/advance_forward.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/advance_forward.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/advance_forward.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/advance_forward.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/and.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/and.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/and.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/and.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/apply.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/apply.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/apply.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/apply.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/apply_fwd.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/apply_fwd.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/apply_fwd.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/apply_fwd.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/apply_wrap.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/apply_wrap.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/apply_wrap.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/apply_wrap.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/arg.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/arg.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/arg.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/arg.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/basic_bind.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/basic_bind.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/basic_bind.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/basic_bind.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/bind.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/bind.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/bind.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/bind.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/bind_fwd.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/bind_fwd.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/bind_fwd.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/bind_fwd.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/bitand.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/bitand.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/bitand.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/bitand.cpp,v $
-// $Date: 2004/09/05 09:45:17 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/bitor.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/bitor.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/bitor.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/bitor.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/bitxor.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/bitxor.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/bitxor.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/bitxor.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/deque.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/deque.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/deque.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/deque.cpp,v $
-// $Date: 2004/11/28 03:35:12 $
-// $Revision: 1.2 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.2.6.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/divides.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/divides.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/divides.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/divides.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/equal_to.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/equal_to.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/equal_to.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/equal_to.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/fold_impl.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/fold_impl.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/fold_impl.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/fold_impl.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/full_lambda.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/full_lambda.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/full_lambda.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/full_lambda.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/greater.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/greater.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/greater.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/greater.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/greater_equal.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/greater_equal.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/greater_equal.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/greater_equal.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/inherit.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/inherit.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/inherit.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/inherit.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/iter_fold_if_impl.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/iter_fold_if_impl.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/iter_fold_if_impl.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/iter_fold_if_impl.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/iter_fold_impl.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/iter_fold_impl.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/iter_fold_impl.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/iter_fold_impl.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/lambda_no_ctps.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/lambda_no_ctps.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/lambda_no_ctps.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/lambda_no_ctps.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/less.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/less.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/less.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/less.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/less_equal.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/less_equal.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/less_equal.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/less_equal.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/list.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/list.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/list.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/list.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/list_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/list_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/list_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/list_c.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/map.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/map.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/map.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/map.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/minus.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/minus.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/minus.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/minus.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/modulus.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/modulus.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/modulus.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/modulus.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/not_equal_to.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/not_equal_to.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/not_equal_to.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/not_equal_to.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/or.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/or.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/or.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/or.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/placeholders.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/placeholders.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/placeholders.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/placeholders.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/plus.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/plus.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/plus.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/plus.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/quote.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/quote.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/quote.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/quote.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/reverse_fold_impl.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/reverse_fold_impl.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/reverse_fold_impl.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/reverse_fold_impl.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/reverse_iter_fold_impl.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/reverse_iter_fold_impl.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/reverse_iter_fold_impl.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/reverse_iter_fold_impl.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/set.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/set.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/set.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/set.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/set_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/set_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/set_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/set_c.cpp,v $
-// $Date: 2004/11/28 03:35:12 $
-// $Revision: 1.2 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.2.6.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/shift_left.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/shift_left.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/shift_left.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/shift_left.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/shift_right.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/shift_right.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/shift_right.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/shift_right.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/template_arity.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/template_arity.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/template_arity.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/template_arity.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/times.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/times.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/times.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/times.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/unpack_args.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/unpack_args.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/unpack_args.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/unpack_args.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/vector.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/vector.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/vector.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/vector.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/src/vector_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/src/vector_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/src/vector_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/src/vector_c.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.4 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.4.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/vector/vector10.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/vector/vector10.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/vector/vector10.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/vector/vector10.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/vector/vector10_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/vector/vector10_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/vector/vector10_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/vector/vector10_c.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/vector/vector20.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/vector/vector20.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/vector/vector20.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/vector/vector20.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/vector/vector20_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/vector/vector20_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/vector/vector20_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/vector/vector20_c.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/vector/vector30.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/vector/vector30.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/vector/vector30.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/vector/vector30.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/vector/vector30_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/vector/vector30_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/vector/vector30_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/vector/vector30_c.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/vector/vector40.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/vector/vector40.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/vector/vector40.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/vector/vector40.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/vector/vector40_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/vector/vector40_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/vector/vector40_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/vector/vector40_c.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/vector/vector50.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/vector/vector50.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/vector/vector50.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/vector/vector50.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Modified: boost/trunk/libs/mpl/preprocessed/vector/vector50_c.cpp
===================================================================
--- boost/trunk/libs/mpl/preprocessed/vector/vector50_c.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/preprocessed/vector/vector50_c.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2002-4004
+// Copyright Aleksey Gurtovoy 2002-2004
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/preprocessed/vector/vector50_c.cpp,v $
-// $Date: 2004/09/05 09:45:18 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 05:11:54 $
+// $Revision: 1.3.8.1 $
 
 #define BOOST_MPL_PREPROCESSING_MODE
 #include <boost/config.hpp>

Deleted: boost/trunk/libs/mpl/test/Jamfile
===================================================================
--- boost/trunk/libs/mpl/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,94 +0,0 @@
-subproject libs/mpl/test ;
-
-# bring in rules for testing
-import testing ;
-
-compile aux_/largest_int.cpp ;
-compile aux_/msvc_is_class.cpp ;
-compile aux_/template_arity.cpp ;
-
-compile advance.cpp ;
-compile always.cpp ;
-compile apply.cpp ;
-compile apply_wrap.cpp ;
-compile arithmetic.cpp ;
-compile as_sequence.cpp ;
-compile assert.cpp ;
-compile at.cpp ;
-compile back.cpp ;
-compile bind.cpp ;
-compile bitwise.cpp ;
-run bool.cpp ;
-compile comparison.cpp ;
-compile contains.cpp ;
-compile copy.cpp ;
-compile copy_if.cpp ;
-compile count.cpp ;
-compile count_if.cpp ;
-compile deque.cpp ;
-compile distance.cpp ;
-compile empty.cpp ;
-compile equal.cpp ;
-compile erase.cpp ;
-compile erase_range.cpp ;
-compile eval_if.cpp ;
-compile filter_view.cpp ;
-compile find.cpp ;
-compile find_if.cpp ;
-compile fold.cpp ;
-run for_each.cpp ;
-compile front.cpp ;
-compile has_xxx.cpp ;
-compile identity.cpp ;
-compile if.cpp ;
-compile index_of.cpp ;
-compile inherit.cpp ;
-compile insert.cpp ;
-compile insert_range.cpp ;
-run int.cpp ;
-run integral_c.cpp ;
-compile is_placeholder.cpp ;
-compile is_sequence.cpp ;
-compile iterator_tags.cpp ;
-compile joint_view.cpp ;
-compile lambda.cpp ;
-compile lambda_args.cpp ;
-compile list.cpp ;
-compile list_c.cpp ;
-compile logical.cpp ;
-compile lower_bound.cpp ;
-compile map.cpp ;
-compile max_element.cpp ;
-compile min_max.cpp ;
-compile multiset.cpp ;
-compile next.cpp ;
-compile no_has_xxx.cpp ;
-compile numeric_ops.cpp ;
-compile pair_view.cpp ;
-compile partition.cpp ;
-compile pop_front.cpp ;
-compile push_front.cpp ;
-compile quote.cpp ;
-compile range_c.cpp ;
-compile remove.cpp ;
-compile remove_if.cpp ;
-compile replace.cpp ;
-compile replace_if.cpp ;
-compile reverse.cpp ;
-compile same_as.cpp ;
-compile set.cpp ;
-compile set_c.cpp ;
-compile single_view.cpp ;
-compile size.cpp ;
-run size_t.cpp ;
-compile sizeof.cpp ;
-compile sort.cpp ;
-compile stable_partition.cpp ;
-compile transform.cpp ;
-compile transform_view.cpp ;
-compile unique.cpp ;
-compile unpack_args.cpp ;
-compile upper_bound.cpp ;
-compile vector.cpp ;
-compile vector_c.cpp ;
-compile zip_view.cpp ;

Deleted: boost/trunk/libs/mpl/test/aux_/Jamfile
===================================================================
--- boost/trunk/libs/mpl/test/aux_/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/test/aux_/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +0,0 @@
-subproject libs/mpl/test/aux_ ;
-
-# bring in rules for testing
-import testing ;
-
-compile preprocessor/is_seq.cpp ;
-compile preprocessor/token_equal.cpp ;
-compile largest_int.cpp ;
-compile msvc_is_class.cpp ;
-compile template_arity.cpp ;

Modified: boost/trunk/libs/mpl/test/integral_wrapper_test.hpp
===================================================================
--- boost/trunk/libs/mpl/test/integral_wrapper_test.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/test/integral_wrapper_test.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2001-2004
+// Copyright Aleksey Gurtovoy 2001-2006
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/test/integral_wrapper_test.hpp,v $
-// $Date: 2006/02/20 15:45:07 $
-// $Revision: 1.4 $
+// $Date: 2006/11/20 17:59:29 $
+// $Revision: 1.4.2.1 $
 
 #include <boost/mpl/next_prior.hpp>
 #include <boost/mpl/aux_/test.hpp>
@@ -28,7 +28,22 @@
     /**/
 #endif
 
+#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x582))
+// agurt 20/nov/06: see http://article.gmane.org/gmane.comp.lib.boost.devel/151065
 #define INTEGRAL_WRAPPER_TEST(unused1, i, T) \
+    { \
+      typedef WRAPPER(T,i) borland_tested_type; \
+    { typedef is_same< borland_tested_type::value_type, T > borland_test_type; \
+      MPL_ASSERT(( borland_test_type )); } \
+    { MPL_ASSERT(( is_same< borland_tested_type::type, WRAPPER(T,i) > )); } \
+    { MPL_ASSERT(( is_same< next< borland_tested_type >::type, WRAPPER(T,i+1) > )); } \
+    { MPL_ASSERT(( is_same< prior< borland_tested_type >::type, WRAPPER(T,i-1) > )); } \
+    { MPL_ASSERT_RELATION( (borland_tested_type::value), ==, i ); } \
+    INTEGRAL_WRAPPER_RUNTIME_TEST(i, T) \
+    } \
+/**/
+#else
+#define INTEGRAL_WRAPPER_TEST(unused1, i, T) \
     { MPL_ASSERT(( is_same< WRAPPER(T,i)::value_type, T > )); } \
     { MPL_ASSERT(( is_same< WRAPPER(T,i)::type, WRAPPER(T,i) > )); } \
     { MPL_ASSERT(( is_same< next< WRAPPER(T,i) >::type, WRAPPER(T,i+1) > )); } \
@@ -36,3 +51,5 @@
     { MPL_ASSERT_RELATION( (WRAPPER(T,i)::value), ==, i ); } \
     INTEGRAL_WRAPPER_RUNTIME_TEST(i, T) \
 /**/
+#endif
+

Modified: boost/trunk/libs/mpl/test/is_sequence.cpp
===================================================================
--- boost/trunk/libs/mpl/test/is_sequence.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/test/is_sequence.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,8 +8,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/test/is_sequence.cpp,v $
-// $Date: 2006/05/16 13:37:14 $
-// $Revision: 1.6 $
+// $Date: 2006/07/22 15:10:50 $
+// $Revision: 1.5.8.1 $
 
 #include <boost/mpl/is_sequence.hpp>
 #include <boost/mpl/int.hpp>

Modified: boost/trunk/libs/mpl/test/multiset.cpp
===================================================================
--- boost/trunk/libs/mpl/test/multiset.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/test/multiset.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-// Copyright Aleksey Gurtovoy 2003-2004
+// Copyright Aleksey Gurtovoy 2003-2006
 //
 // Distributed under the Boost Software License, Version 1.0. 
 // (See accompanying file LICENSE_1_0.txt or copy at 
@@ -8,10 +8,11 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/test/multiset.cpp,v $
-// $Date: 2006/02/18 20:54:15 $
-// $Revision: 1.3 $
+// $Date: 2006/06/12 07:13:12 $
+// $Revision: 1.3.2.2 $
 
 #include <boost/mpl/multiset/multiset0.hpp>
+//#include <boost/mpl/multiset/multiset10.hpp>
 
 #include <boost/mpl/insert.hpp>
 #include <boost/mpl/count.hpp>
@@ -21,27 +22,63 @@
 #include <boost/mpl/size.hpp>
 #include <boost/mpl/find.hpp>
 
+#include <boost/config.hpp>
+
+/*
+struct test_data1
+{
+    typedef multiset0<>                         s0;
+    typedef multiset1<int>                      s1;
+    typedef multiset2<int,char&>                s2;
+    typedef multiset3<int,char&,int>            s3;
+    typedef multiset4<int,char&,int,abstract>   s4;
+};
+
+struct test_data2
+{
+    typedef multiset<>                          s0;
+    typedef multiset<int>                       s1;
+    typedef multiset<int,char&>                 s2;
+    typedef multiset<int,char&,int>             s3;
+    typedef multiset<int,char&,int,abstract>    s4;
+};
+*/
+
+template< typename S0 >
+struct test_data
+{
+    typedef S0                                  s0;
+    typedef typename insert<s0,int>::type       s1;
+    typedef typename insert<s1,char&>::type     s2;
+    typedef typename insert<s2,int>::type       s3;
+    typedef typename insert<s3,abstract>::type  s4;
+};
+
+
+template< typename T >
+void count_test()
+{
+    MPL_ASSERT_RELATION( ( count<BOOST_DEDUCED_TYPENAME T::s0,int>::value ), ==, 0 );
+    MPL_ASSERT_RELATION( ( count<BOOST_DEDUCED_TYPENAME T::s1,int>::value ), ==, 1 );
+    MPL_ASSERT_RELATION( ( count<BOOST_DEDUCED_TYPENAME T::s2,int>::value ), ==, 1 );
+    MPL_ASSERT_RELATION( ( count<BOOST_DEDUCED_TYPENAME T::s2,char&>::value ), ==, 1 );
+    MPL_ASSERT_RELATION( ( count<BOOST_DEDUCED_TYPENAME T::s3,int>::value ), ==, 2 );
+    MPL_ASSERT_RELATION( ( count<BOOST_DEDUCED_TYPENAME T::s3,char&>::value ), ==, 1 );
+    MPL_ASSERT_RELATION( ( count<BOOST_DEDUCED_TYPENAME T::s4,abstract>::value ), ==, 1 );
+}
+
 MPL_TEST_CASE()
 {
-    typedef multiset0<> s0;
-    typedef insert<s0,int>::type s1;
-    typedef insert<s1,char&>::type s2;
-    typedef insert<s2,int>::type s3;
-    typedef insert<s3,abstract>::type s4;
-    
-    MPL_ASSERT_RELATION( (count<s0,int>::value), ==, 0 );
-    MPL_ASSERT_RELATION( (count<s1,int>::value), ==, 1 );
-    MPL_ASSERT_RELATION( (count<s2,int>::value), ==, 1 );
-    MPL_ASSERT_RELATION( (count<s2,char&>::value), ==, 1 );
-    MPL_ASSERT_RELATION( (count<s3,int>::value), ==, 2 );
-    MPL_ASSERT_RELATION( (count<s3,char&>::value), ==, 1 );
-    MPL_ASSERT_RELATION( (count<s4,abstract>::value), ==, 1 );
+    //count_test<test_data1>();
+    //count_test<test_data2>();
+    //count_test< test_data< multiset<> > >();
+    count_test< test_data< multiset0<> > >();
 }
 
-
+/*
 // Use a template for testing so that GCC will show us the actual types involved
 template <class S>
-void test()
+void find_test()
 {
     BOOST_MPL_ASSERT_RELATION( size<S>::value, ==, 3 );
 
@@ -50,19 +87,21 @@
     BOOST_MPL_ASSERT_NOT(( is_same<BOOST_DEDUCED_TYPENAME find<S,long>::type,not_found> ));
     BOOST_MPL_ASSERT_NOT(( is_same<BOOST_DEDUCED_TYPENAME find<S,char>::type,not_found> ));
     BOOST_MPL_ASSERT(( is_same<BOOST_DEDUCED_TYPENAME find<S,char*>::type,not_found> ));
-};
+}
+*/
 
 MPL_TEST_CASE()
 {
-    typedef insert<multiset0<>, int> set_of_1_int;
-    typedef begin<set_of_1_int>::type iter_to_1_int;
-    BOOST_MPL_ASSERT(( is_same< deref<iter_to_1_int>::type, int > ));
+    // agurt 11/jun/06: multiset does not implement iterators yet!    
+    // typedef insert<multiset0<>, int>::type set_of_1_int;
+    // typedef begin<set_of_1_int>::type iter_to_1_int;
+    // BOOST_MPL_ASSERT(( is_same< deref<iter_to_1_int>::type, int > ));
     
     typedef multiset0<> s0;
     typedef insert<s0,int>::type s1;
     typedef insert<s1,long>::type s2;
     typedef insert<s2,char>::type myset;
     
-    test<myset>();
-    test<myset::type>();
+    // find_test<myset>();
+    // find_test<myset::type>();
 }

Modified: boost/trunk/libs/mpl/test/set.cpp
===================================================================
--- boost/trunk/libs/mpl/test/set.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/mpl/test/set.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,8 +9,8 @@
 // See http://www.boost.org/libs/mpl for documentation.
 
 // $Source: /cvsroot/boost/boost/libs/mpl/test/set.cpp,v $
-// $Date: 2006/02/20 15:45:07 $
-// $Revision: 1.11 $
+// $Date: 2006/06/12 05:11:55 $
+// $Revision: 1.11.2.1 $
 
 #include <boost/mpl/set.hpp>
 #include <boost/mpl/deref.hpp>
@@ -175,7 +175,7 @@
     BOOST_MPL_ASSERT_NOT(( is_same<BOOST_DEDUCED_TYPENAME find<S,long>::type,not_found> ));
     BOOST_MPL_ASSERT_NOT(( is_same<BOOST_DEDUCED_TYPENAME find<S,char>::type,not_found> ));
     BOOST_MPL_ASSERT(( is_same<BOOST_DEDUCED_TYPENAME find<S,char*>::type,not_found> ));
-};
+}
 
 MPL_TEST_CASE()
 {

Modified: boost/trunk/libs/multi_array/doc/xml/multi_array_ref.xml
===================================================================
--- boost/trunk/libs/multi_array/doc/xml/multi_array_ref.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_array/doc/xml/multi_array_ref.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -37,21 +37,21 @@
 public:
 // types:
   typedef ValueType                             element;
-  typedef *unspecified*                         value_type;
-  typedef *unspecified*                         reference;
-  typedef *unspecified*                         const_reference;
-  typedef *unspecified*                         difference_type;
-  typedef *unspecified*                         iterator;
-  typedef *unspecified*                         const_iterator;
-  typedef *unspecified*                         reverse_iterator;
-  typedef *unspecified*                         const_reverse_iterator;
+  typedef *implementation-defined*              value_type;
+  typedef *implementation-defined*              reference;
+  typedef *implementation-defined*              const_reference;
+  typedef *implementation-defined*              difference_type;
+  typedef *implementation-defined*              iterator;
+  typedef *implementation-defined*              const_iterator;
+  typedef *implementation-defined*              reverse_iterator;
+  typedef *implementation-defined*              const_reverse_iterator;
   typedef multi_array_types::size_type          size_type;
   typedef multi_array_types::index              index;
   typedef multi_array_types::index_gen          index_gen;
   typedef multi_array_types::index_range        index_range;
   typedef multi_array_types::extent_gen         extent_gen;
   typedef multi_array_types::extent_range       extent_range;
-  typedef *unspecified*                         storage_order_type;
+  typedef *implementation-defined*              storage_order_type;
   
   // template typedefs
   template <std::size_t Dims> struct            subarray;

Modified: boost/trunk/libs/multi_array/index.html
===================================================================
--- boost/trunk/libs/multi_array/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_array/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,10 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="doc/index.html">doc/index.html</a>.
+<a href="doc/index.html">doc/index.html</a>.&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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: boost/trunk/libs/multi_array/test/Jamfile
===================================================================
--- boost/trunk/libs/multi_array/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_array/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,51 +0,0 @@
-# Copyright David Abrahams 2003. Permission to copy, use,
-# modify, sell and distribute this software is granted provided this
-# copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as
-# to its suitability for any purpose.
-
-subproject libs/multi_array/test ;
-
-import testing ;
-
-test-suite multi_array
-    : 
-      [ compile-fail fail_cbracket.cpp ]
-      [ compile-fail fail_cdata.cpp ]
-      [ compile-fail fail_citerator.cpp ]
-      [ compile-fail fail_cparen.cpp ]
-      [ compile-fail fail_criterator.cpp ]
-      [ compile-fail fail_csubarray.cpp ]
-      [ compile-fail fail_csubarray2.cpp ]
-      [ compile-fail fail_csubarray3.cpp ]
-      [ compile-fail fail_cview.cpp ]
-      [ compile-fail fail_cview2.cpp ]
-      [ compile-fail fail_cview3.cpp ]
-      [ compile-fail fail_ref_cbracket.cpp ]
-      [ compile-fail fail_ref_cdata.cpp ]
-      [ compile-fail fail_ref_citerator.cpp ]
-      [ compile-fail fail_ref_cparen.cpp ]
-      [ compile-fail fail_ref_criterator.cpp ]
-      [ compile-fail fail_ref_csubarray.cpp ]
-      [ compile-fail fail_ref_csubarray2.cpp ]
-      [ compile-fail fail_ref_csubarray3.cpp ]
-      [ compile-fail fail_ref_cview.cpp ]
-      [ compile-fail fail_ref_cview2.cpp ]
-      [ compile-fail fail_ref_cview3.cpp ]
-  
-      [ run constructors.cpp ]
-      [ run access.cpp ]
-      [ run compare.cpp ]
-      [ run iterators.cpp ]
-      [ run slice.cpp ]
-      [ run assign.cpp ]
-      [ run assign_to_array.cpp ]
-      [ run index_bases.cpp ]
-      [ run storage_order.cpp ]
-      [ run reshape.cpp ]
-      [ run range1.cpp  ]
-      [ run idxgen1.cpp ]
-      [ run stl_interaction.cpp ]
-      [ run resize.cpp ]
-      [ compile concept_checks.cpp ]
-    ;

Modified: boost/trunk/libs/multi_array/test/generative_tests.hpp
===================================================================
--- boost/trunk/libs/multi_array/test/generative_tests.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_array/test/generative_tests.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,6 +49,7 @@
 
 #include "boost/test/minimal.hpp"
 
+#include <boost/config.hpp> /* BOOST_NO_SFINAE */
 #include <algorithm>
 #include <iostream>
 #include <vector>
@@ -239,8 +240,12 @@
 struct set_index_base_modifier {
   template <typename Array>
   void modify(Array& A) const {
+#ifdef BOOST_NO_SFINAE
     typedef boost::multi_array_types::index index;
-    A.reindex(1); 
+    A.reindex(index(1));
+#else
+    A.reindex(1);
+#endif 
   }
 };
 

Modified: boost/trunk/libs/multi_array/test/index_bases.cpp
===================================================================
--- boost/trunk/libs/multi_array/test/index_bases.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_array/test/index_bases.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -126,10 +126,18 @@
     B.assign(vals.begin(),vals.end());
     C.assign(vals.begin(),vals.end());
 
+#ifdef BOOST_NO_SFINAE
+    typedef boost::multi_array_types::index index;
+    A.reindex(index(1));
+    C.reindex(index(1));
+    D.reindex(index(1));
+    E.reindex(index(1));
+#else
     A.reindex(1);
     C.reindex(1);
     D.reindex(1);
     E.reindex(1);
+#endif
 
     for (size_type a = 0; a < A.shape()[0]; ++a)
       for (size_type b = 0; b < A.shape()[1]; ++b)

Modified: boost/trunk/libs/multi_array/test/resize.cpp
===================================================================
--- boost/trunk/libs/multi_array/test/resize.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_array/test/resize.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -104,9 +104,9 @@
     A.resize(boost::extents[3][4][2]);
 
     int check = 0;
-    for (int i = 0; i < 3; i++) { 
-      for (int j = 0; j < 4; j++) {
-        for (int k = 0; k < 2; k++) {
+    for (int x = 0; x < 3; x++) { 
+      for (int y = 0; y < 4; y++) {
+        for (int z = 0; z < 2; z++) {
           BOOST_CHECK(*(A.data() + check) == check);
           ++check;
         }

Deleted: boost/trunk/libs/multi_index/Jamfile
===================================================================
--- boost/trunk/libs/multi_index/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_index/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,16 +0,0 @@
-# Boost.MultiIndex examples and tests Jamfile
-#
-# Copyright 2003-2004 Joaquín M López Muñoz.
-# Distributed under the Boost Software License, Version 1.0.
-# (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-#
-# See http://www.boost.org/libs/multi_index for library home page.
-
-subproject libs/multi_index ;
-
-# please order by name to ease maintenance
-
-subinclude libs/multi_index/example ;
-subinclude libs/multi_index/test ;
-subinclude libs/multi_index/perf ;

Modified: boost/trunk/libs/multi_index/doc/acknowledgements.html
===================================================================
--- boost/trunk/libs/multi_index/doc/acknowledgements.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_index/doc/acknowledgements.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -136,8 +136,9 @@
 for containers with large numbers of elements.
 Caleb Epstein performed the tests under MSVC++ 8.0 described in the
 performance section. The following people have reported bugs and problems with
-previous versions and prereleases of the library: Alexei Alexandrov, Martin Eigel,
-Guillaume Lazzara, Felipe Magno de Almeida, Julien Pervill&eacute;, Toby Smith.
+previous versions and prereleases of the library: Alexei Alexandrov,
+Mat&iacute;as Capeletto, John Eddy, Martin Eigel, Guillaume Lazzara,
+Felipe Magno de Almeida, Julien Pervill&eacute;, Hubert Schmid, Toby Smith.
 </p>
 
 <p>
@@ -160,7 +161,7 @@
 
 <br>
 
-<p>Revised May 10th 2006</p>
+<p>Revised December 21st 2006</p>
 
 <p>&copy; Copyright 2003-2006 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 Distributed under the Boost Software 

Modified: boost/trunk/libs/multi_index/doc/compiler_specifics.html
===================================================================
--- boost/trunk/libs/multi_index/doc/compiler_specifics.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_index/doc/compiler_specifics.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,7 +36,7 @@
 <h2>Contents</h2>
 
 <ul>
-  <li><a href="#bcb_64">Borland C++ Builder 6.4</a></li>
+  <li><a href="#bcb_64">Borland C++ Builder 6.4 and later</a></li>
   <li><a href="#comeau_433_win_vc7_71">Comeau C/C++ 4.3.3 for Windows (VC++ 7.0/7.1 backend)</a></li>
   <li><a href="#compaq_65">Compaq C++ 6.5-042 for Tru64 UNIX and later</a></li>
   <li>
@@ -46,21 +46,40 @@
       <li><a href="#gcc_4_darwin">Darwin GCC 4.0</a></li>
     </ul>
   </li>
-  <li><a href="#acc_60">HP aC++ A.06.00 for HP-UX</a></li>
+  <li><a href="#acc_612">HP aC++ A.06.12 for HP-UX</a></li>
   <li><a href="#va_60">IBM VisualAge C++ V6.0 for AIX</a></li>
-  <li><a href="#intel_71_lin">Intel C++ Compiler for Linux 7.1 and later</a></li>
-  <li><a href="#intel_em64t_81_lin">Intel C++ Compiler Extended Memory 64 Technology 8.1 for Linux</a></li>
+  <li><a href="#intel_90_lin">Intel C++ Compiler for Linux 9.0 and later</a></li>
   <li><a href="#intel_7x_win">Intel C++ Compiler for Windows 32-bit 7.0/7.1</a></li>
-  <li><a href="#intel_71_win_stlport_453">Intel C++ Compiler for Windows 32-bit 7.1 + STLport 4.5.3</a></li>
   <li><a href="#intel_80_win">Intel C++ Compiler for Windows 32-bit 8.0 and later</a></li>
+  <li><a href="#intel_em64t_91_win">Intel C++ Compiler Extended Memory 64 Technology 9.1 for Windows</a></li>
   <li><a href="#cw_83">Metrowerks CodeWarrior 8.3</a></li>
   <li><a href="#cw_9x">Metrowerks CodeWarrior 9 and later</a></li>
-  <li><a href="#msvc_60">Microsoft Visual C++ 6.0 Service Pack 5</a></li>
-  <li><a href="#msvc_60_stlport_453">Microsoft Visual C++ 6.0 Service Pack 5 + STLport 4.5.3</a></li>
-  <li><a href="#msvc_70">Microsoft Visual C++ 7.0</a></li>
-  <li><a href="#msvc_71">Microsoft Visual C++ 7.1</a></li>
-  <li><a href="#msvc_71_stlport_462">Microsoft Visual C++ 7.1 + STLport 4.6.2</a></li>
-  <li><a href="#msvc_80">Microsoft Visual C++ 8.0</a></li>
+  <li>
+    <a href="#msvc_60">Microsoft Visual C++ 6.0 Service Pack 5</a>
+    <ul>
+      <li><a href="#msvc_60_stlport_453">Microsoft Visual C++ 6.0 Service Pack 5 + STLport 4.5.3 and later</a></li>
+    </ul>
+  </li>
+  <li>
+    <a href="#msvc_70">Microsoft Visual C++ 7.0</a>
+    <ul>
+      <li><a href="#msvc_70_stlport_501">Microsoft Visual C++ 7.0 + STLport 5.0.1</a></li>
+    </ul>
+  </li>
+  <li>
+    <a href="#msvc_71">Microsoft Visual C++ 7.1</a>
+    <ul>
+      <li><a href="#msvc_71_stlport_462">Microsoft Visual C++ 7.1 + STLport 4.6.2</a></li>
+    </ul>
+  </li>
+  <li>
+    <a href="#msvc_80">Microsoft Visual C++ 8.0</a>
+    <ul>
+      <li><a href="#msvc_80_stlport_501">Microsoft Visual C++ 8.0 + STLport 5.0.1</a></li>
+    </ul>
+  </li>
+  <li><a href="#msvc_80_x86_amd64">Microsoft Visual C++ 8.0 x64 cross-compiler</a></li>
+  <li><a href="#sun_11">Sun Studio 11 for Solaris</a></li>
   <li><a href="#portability">Portability techniques</a>
     <ul>
       <li><a href="#member_offset">Use of <code>member_offset</code></a></li>
@@ -78,13 +97,12 @@
   </li>
 </ul>
 
-<h2><a name="bcb_64">Borland C++ Builder 6.4</a></h2>
+<h2><a name="bcb_64">Borland C++ Builder 6.4 and later</a></h2>
 
 <p>
-Currently, Boost.MultiIndex cannot be used with BCB 6.4. The
-number of problems encountered during the tests makes it unlikely that
-future versions of the library can be made to work under
-this compiler.
+Currently, Boost.MultiIndex cannot be used with any of BCB 6.4 up to BCB 2006.
+The number of problems encountered during the tests makes it unlikely that
+future versions of the library can be made to work under these compilers.
 </p>
 
 <h2><a name="comeau_433_win_vc7_71">Comeau C/C++ 4.3.3 for Windows (VC++ 7.0/7.1 backend)</a></h2>
@@ -107,22 +125,21 @@
 No problems have been detected with several versions of this compiler
 starting from 3.2. The following versions have been explicitly tested:
 <ul>
-  <li>GCC 3.2 20020903 under Linux,</li>
   <li>GCC 3.2 20020927 (prerelease) under Cygwin 1.5.7,</li>
-  <li>GCC 3.2.3 under Linux, (mingw special 20030504-1) under Win32,</li>
-  <li>GCC 3.3 20030304 (Apple builds 1666 and 1671) under Mac OS,</li>
-  <li>GCC 3.3.3 (cygwin special) under Cygwin 1.5.7,</li>
-  <li>GCC 3.3.5 under Linux,</li>
-  <li>GCC 3.3.6 under Linux and Tru64 (see <a href="#gcc_tru64">below</a>),</li>
-  <li>GCC 3.4.2 (mingw-special) under Win32,</li>
-  <li>GCC 3.4.3 under Linux, Solaris and Tru64 (see <a href="#gcc_tru64">below</a>),</li>
-  <li>GCC 3.4.4 (cygming special) under Cygwin, under Gentoo Linux PPC64, under Linux,
-    under Tru64 (see <a href="#gcc_tru64">below</a>), (mingw special) under Win32,</li>
-  <li>GCC 4.0.0 20041026 (Apple build 4061) under Mac OS 
-    (see <a href="#gcc_4_darwin">below</a>),</li>
-  <li>GCC 4.0.0 under Linux, (Apple build 5026) under Mac OS,</li>
-  <li>GCC 4.0.1 under Linux and Tru64 (see <a href="#gcc_tru64">below</a>),</li>
-  <li>GCC 4.0.2 under Linux.</li>
+  <li>GCC 3.2.3 under Linux,</li>
+  <li>GCC 3.3.5 (qnx-nto) under QNX 6.3.0 and QNX 6.3.2,
+  <li>GCC 3.3.6 under Linux,</li>
+  <li>GCC 3.4.2 (mingw-special) under Win32,
+    (mingw-special) + STLport 5.0.1 under Win32,</li>
+  <li>GCC 3.4.3 under Solaris,</li>
+  <li>GCC 3.4.4 under Linux and Tru64 (see <a href="#gcc_tru64">below</a>),</li>
+  <li>GCC 3.4.5 under Linux and Linux x86-64, (mingw-special) under Win32,
+    (mingw-special) + STLport 5.0.1 under Win32,
+    (mingw-special) + STLport 5.1.0 under Win32,</li>
+  <li>GCC 4.0.1 (Apple build 5250) under Mac OS,</li>
+  <li>GCC 4.0.3 under Linux and Tru64 (see <a href="#gcc_tru64">below</a>),</li>
+  <li>GCC 4.1.0 under Linux and Linux x86-64,</li>
+  <li>GCC 4.1.1 (OpenPKG-2-STABLE) under Solaris.</li>
 </ul>
 Boost.MultiIndex does not work with versions 3.1 and prior of GCC.
 </p>
@@ -155,7 +172,7 @@
 upgrade.
 </p>
 
-<h2><a name="acc_60">HP aC++ A.06.00 for HP-UX</a></h2>
+<h2><a name="acc_612">HP aC++ A.06.12 for HP-UX</a></h2>
 
 <p>
 No problems have been detected with this compiler.
@@ -164,6 +181,14 @@
 <h2><a name="va_60">IBM VisualAge C++ V6.0 for AIX</a></h2>
 
 <p>
+<b>Note:</b> This information was last checked for Boost 1.33.1. There is a
+possibility that changes in Boost since that release have
+caused problems with this platform.
+</p>
+
+<blockquote><hr></blockquote>
+
+<p>
 <a href="reference/key_extraction.html#member"><code>member</code></a> not supported,
 refer to the section on
 <a href="#member_offset">use of <code>member_offset</code></a> for workarounds.
@@ -189,19 +214,12 @@
 supported on this platform.
 </p>
 
-<h2><a name="intel_71_lin">Intel C++ Compiler for Linux 7.1 and later</a></h2>
+<h2><a name="intel_90_lin">Intel C++ Compiler for Linux 9.0 and later</a></h2>
 
 <p>
-No problems have been detected with this compilers from version 7.1 up to 9.0.
+No problems have been detected with this compilers from version 9.0.
 </p>
 
-<h2><a name="intel_em64t_81_lin">Intel C++ Compiler Extended Memory 64 Technology 8.1
-for Linux</a></h2>
-
-<p>
-No problems have been detected with this compiler.
-</p>
-
 <h2><a name="intel_7x_win">Intel C++ Compiler for Windows 32-bit 7.0/7.1</a></h2>
 
 <p>
@@ -220,15 +238,6 @@
 <code>/Qoption,c,--arg_dep_lookup</code> to the project options.
 </p>
 
-<h2><a name="intel_71_win_stlport_453">
-Intel C++ Compiler for Windows 32-bit 7.1 + STLport 4.5.3</a></h2>
-
-<p>
-Boost.MultiIndex works for this configuration. The same limitations apply as
-in Intel C++ 7.1 with its original Dinkumware standard library. STLport 4.6.2 has
-also been confirmed to work correctly.
-</p>
-
 <h2><a name="intel_80_win">Intel C++ Compiler for Windows 32-bit 8.0 and later</a></h2>
 
 <p>
@@ -238,9 +247,15 @@
 Argument dependent lookup is enabled by adding
 <code>/Qoption,c,--arg_dep_lookup</code> to the project options.
 Other than this, Boost.MultiIndex works without problems. Compiler versions
-from 8.0 to 9.0 have been tested.
+from 8.0 to 9.1 have been tested.
 </p>
 
+<h2><a name="intel_em64t_91_win">Intel C++ Compiler Extended Memory 64 Technology 9.1 for Windows</a></h2>
+
+<p>
+No problems have been detected with this compiler.
+</p>
+
 <h2><a name="cw_83">Metrowerks CodeWarrior 8.3</a></h2>
 
 <p>
@@ -469,15 +484,15 @@
 </ul>
 </p>
 
-<h2>
+<h3>
 <a name="msvc_60_stlport_453">Microsoft Visual C++ 6.0 Service Pack 5
-+ STLport 4.5.3</a>
-</h2>
++ STLport 4.5.3 and later</a>
+</h3>
 
 <p>
 Boost.MultiIndex works for this configuration. The same limitations apply as
-in MSVC++ 6.0 with its original Dinkumware standard library. STLport 4.6.2 has
-also been confirmed to work correctly.
+in MSVC++ 6.0 with its original Dinkumware standard library. STLport 4.6.2 and
+5.0.1 has also been confirmed to work correctly.
 </p>
 
 <blockquote><hr></blockquote>
@@ -485,8 +500,7 @@
 <p>
 It is not possible to use the serialization capabilities of Boost.MultiIndex
 along with the dynamic version of STLport, as some linking errors result.
-Use instead the static version of STLport. This bug is reportedly fixed in
-STLport 5.0 (in beta stage as of this writing.)
+Use instead the static version of STLport. This bug is fixed in STLport 5.0.
 </p>
 
 <h2><a name="msvc_70">Microsoft Visual C++ 7.0</a></h2>
@@ -584,19 +598,26 @@
 <span class=identifier>key_extractor</span><span class=special>(</span><span class=identifier>x</span><span class=special>);</span>
 </pre></blockquote>
 
+<h3><a name="msvc_70_stlport_501">Microsoft Visual C++ 7.0 + STLport 5.0.1</a></h3>
+
+<p>
+Boost.MultiIndex works for this configuration. The same issues apply as in
+MSVC++ 7.0 with its original Dinkumware standard library. 
+</p>
+
 <h2><a name="msvc_71">Microsoft Visual C++ 7.1</a></h2>
 
 <p>
 Problems have been reported when compiling the library with the <code>/Gm</code>
 option (Enable Minimal Rebuild.) Seemingly, this is due to an
 internal defect of the compiler (see for instance
-<a href="http://lists.boost.org/MailArchives/boost-users/msg05988.php">
+<a href="http://lists.boost.org/boost-users/2004/02/5987.php">
 this mention of a similar issue</a> in the Boost Users mailing list.)
 If <code>/Gm</code> is turned off, Boost.MultiIndex compiles and runs
 without further problems.
 </p>
 
-<h2><a name="msvc_71_stlport_462">Microsoft Visual C++ 7.1 + STLport 4.6.2</a></h2>
+<h3><a name="msvc_71_stlport_462">Microsoft Visual C++ 7.1 + STLport 4.6.2</a></h3>
 
 <p>
 Boost.MultiIndex works for this configuration. The same issues apply as in
@@ -606,10 +627,30 @@
 <h2><a name="msvc_80">Microsoft Visual C++ 8.0</a></h2>
 
 <p>
-No problems have been detected with this compiler. The Beta 2 version of
-this product was used for the testing.
+No problems have been detected with this compiler.
 </p>
 
+<h3><a name="msvc_80_stlport_501">Microsoft Visual C++ 8.0 + STLport 5.0.1</a></h3>
+
+<p>
+No problems have been detected with this configuration.
+</p>
+
+<h2><a name="msvc_80_x86_amd64">Microsoft Visual C++ 8.0 x64 cross-compiler</a></h2>
+
+<p>
+No problems have been detected with this compiler.
+</p>
+
+<h2><a name="sun_11">Sun Studio 11 for Solaris</a></h2>
+
+<p>
+No problems have been detected with this platform. The exact compiler version
+tested was Sun C++ 5.8 Patch 121017-03 2006/07/19. The option
+<code>-library=stlport4</code> was used to replace the default standard
+library with STLport.
+</p>
+
 <h2><a name="portability">Portability techniques</a></h2>
 
 <h3><a name="member_offset">Use of <code>member_offset</code></a></h3>
@@ -1030,7 +1071,7 @@
 
 <br>
 
-<p>Revised February 6th 2006</p>
+<p>Revised October 16th 2006</p>
 
 <p>&copy; Copyright 2003-2006 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 Distributed under the Boost Software 

Modified: boost/trunk/libs/multi_index/doc/reference/hash_indices.html
===================================================================
--- boost/trunk/libs/multi_index/doc/reference/hash_indices.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_index/doc/reference/hash_indices.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -655,7 +655,7 @@
 and <code>Pred</code> is a
 <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">
 <code>Binary Predicate</code></a> inducing an equivalence relation
-on <code>Key</code>, whit the additional constraint that equivalent
+on <code>Key</code>, with the additional constraint that equivalent
 keys have the same hash value.
 A triplet of types (<code>CompatibleKey</code>, <code>CompatibleHash</code>,
 <code>CompatiblePred</code>) is said to be a <i>compatible extension</i>
@@ -804,7 +804,7 @@
 elements contained is preserved.<br>
 <b>Complexity:</b> Average case <code>O(size())</code>, worst case
 <code>O(size(n)<sup>2</sup>)</code>.<br>
-<b>Exeption safety:</b> Strong.
+<b>Exception safety:</b> Strong.
 </blockquote>
 
 <h4><a name="serialization">Serialization</a></h4>
@@ -895,7 +895,7 @@
 
 <br>
 
-<p>Revised February 6th 2006</p>
+<p>Revised July 13th 2006</p>
 
 <p>&copy; Copyright 2003-2006 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 Distributed under the Boost Software 

Modified: boost/trunk/libs/multi_index/doc/reference/key_extraction.html
===================================================================
--- boost/trunk/libs/multi_index/doc/reference/key_extraction.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_index/doc/reference/key_extraction.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -215,7 +215,7 @@
 <span class=special>{</span>
   <span class=keyword>typedef</span> <span class=identifier>Type</span> <span class=identifier>result_type</span><span class=special>;</span>
 
-  <span class=comment>// only provided if const ChainedPtr& is not convertible to const Type&</span>
+  <span class=comment>// only provided if const ChainedPtr&amp; is not convertible to const Type&amp;</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>ChainedPtr</span><span class=special>&gt;</span> <span class=identifier>Type</span><span class=special>&amp;</span> <span class=keyword>operator</span><span class=special>()(</span><span class=keyword>const</span> <span class=identifier>ChainedPtr</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>const</span> <span class=identifier>Type</span><span class=special>&amp;</span> <span class=keyword>operator</span><span class=special>()(</span><span class=keyword>const</span> <span class=identifier>Type</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span> 
@@ -324,7 +324,7 @@
 <span class=special>{</span>
   <span class=keyword>typedef</span> <span class=identifier>Type</span> <span class=identifier>result_type</span><span class=special>;</span>
 
-  <span class=comment>// only provided if const ChainedPtr& is not convertible to const Class&</span>
+  <span class=comment>// only provided if const ChainedPtr&amp; is not convertible to const Class&amp;</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>ChainedPtr</span><span class=special>&gt;</span> <span class=identifier>Type</span><span class=special>&amp;</span> <span class=keyword>operator</span><span class=special>()(</span><span class=keyword>const</span> <span class=identifier>ChainedPtr</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>const</span> <span class=identifier>Type</span><span class=special>&amp;</span> <span class=keyword>operator</span><span class=special>()(</span><span class=keyword>const</span> <span class=identifier>Class</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
@@ -416,7 +416,7 @@
 <span class=special>{</span>
   <span class=keyword>typedef</span> <span class=identifier>Type</span> <span class=identifier>result_type</span><span class=special>;</span>
 
-  <span class=comment>// only provided if const ChainedPtr& is not convertible to const Class&</span>
+  <span class=comment>// only provided if const ChainedPtr&amp; is not convertible to const Class&amp;</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>ChainedPtr</span><span class=special>&gt;</span> <span class=identifier>Type</span><span class=special>&amp;</span> <span class=keyword>operator</span><span class=special>()(</span><span class=keyword>const</span> <span class=identifier>ChainedPtr</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>const</span> <span class=identifier>Type</span><span class=special>&amp;</span> <span class=keyword>operator</span><span class=special>()(</span><span class=keyword>const</span> <span class=identifier>Class</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span> 
@@ -521,7 +521,7 @@
 <span class=special>{</span>
   <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>remove_reference</span><span class=special>&lt;</span><span class=identifier>Type</span><span class=special>&gt;::</span><span class=identifier>type</span> <span class=identifier>result_type</span><span class=special>;</span>
 
-  <span class=comment>// only provided if const ChainedPtr& is not convertible to const Class&</span>
+  <span class=comment>// only provided if const ChainedPtr&amp; is not convertible to const Class&amp;</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>ChainedPtr</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=identifier>ChainedPtr</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>Type</span> <span class=keyword>operator</span><span class=special>()(</span><span class=keyword>const</span> <span class=identifier>Class</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
@@ -593,7 +593,7 @@
 <span class=special>{</span>
   <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>remove_reference</span><span class=special>&lt;</span><span class=identifier>Type</span><span class=special>&gt;::</span><span class=identifier>type</span> <span class=identifier>result_type</span><span class=special>;</span>
 
-  <span class=comment>// only provided if ChainedPtr& is not convertible to Class&</span>
+  <span class=comment>// only provided if ChainedPtr&amp; is not convertible to Class&amp;</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>ChainedPtr</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=identifier>ChainedPtr</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>Type</span> <span class=keyword>operator</span><span class=special>()(</span><span class=identifier>Class</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
@@ -656,7 +656,7 @@
 <span class=special>{</span>
   <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>remove_reference</span><span class=special>&lt;</span><span class=identifier>Type</span><span class=special>&gt;::</span><span class=identifier>type</span> <span class=identifier>result_type</span><span class=special>;</span>
 
-  <span class=comment>// only provided if const ChainedPtr& is not convertible to const Class&</span>
+  <span class=comment>// only provided if const ChainedPtr&amp; is not convertible to const Class&amp;</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>ChainedPtr</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=identifier>ChainedPtr</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>Type</span> <span class=keyword>operator</span><span class=special>()(</span><span class=keyword>const</span> <span class=identifier>Class</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
@@ -700,7 +700,7 @@
 <span class=special>{</span>
   <span class=keyword>typedef</span> <span class=keyword>typename</span> <span class=identifier>remove_reference</span><span class=special>&lt;</span><span class=identifier>Type</span><span class=special>&gt;::</span><span class=identifier>type</span> <span class=identifier>result_type</span><span class=special>;</span>
 
-  <span class=comment>// only provided if ChainedPtr& is not convertible to Class&</span>
+  <span class=comment>// only provided if ChainedPtr&amp; is not convertible to Class&amp;</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>ChainedPtr</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=identifier>ChainedPtr</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>Type</span> <span class=keyword>operator</span><span class=special>()(</span><span class=identifier>Class</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
@@ -886,7 +886,7 @@
   <span class=keyword>const</span> <span class=identifier>key_extractor_tuple</span><span class=special>&amp;</span> <span class=identifier>key_extractors</span><span class=special>()</span><span class=keyword>const</span><span class=special>;</span>
   <span class=identifier>key_extractor_tuple</span><span class=special>&amp;</span>       <span class=identifier>key_extractors</span><span class=special>()</span>
 
-  <span class=comment>// only provided if const ChainedPtr& is not convertible to const value_type&</span>
+  <span class=comment>// only provided if const ChainedPtr&amp; is not convertible to const value_type&amp;</span>
   <span class=keyword>template</span><span class=special>&lt;</span><span class=keyword>typename</span> <span class=identifier>ChainedPtr</span><span class=special>&gt;</span>
   <span class=identifier>result_type</span> <span class=keyword>operator</span><span class=special>()(</span><span class=keyword>const</span> <span class=identifier>ChainedPtr</span><span class=special>&amp;</span> <span class=identifier>x</span><span class=special>)</span><span class=keyword>const</span><span class=special>;</span>
   
@@ -2101,7 +2101,7 @@
 
 <br>
 
-<p>Revised April 17th 2006</p>
+<p>Revised July 13th 2006</p>
 
 <p>&copy; Copyright 2003-2006 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 Distributed under the Boost Software 

Modified: boost/trunk/libs/multi_index/doc/tutorial/basics.html
===================================================================
--- boost/trunk/libs/multi_index/doc/tutorial/basics.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_index/doc/tutorial/basics.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1034,10 +1034,10 @@
 <span class=identifier>multi_index_container</span><span class=special>&lt;</span>
   <span class=keyword>int</span><span class=special>,</span>
   <span class=identifier>indexed_by</span><span class=special>&lt;</span><span class=identifier>sequenced</span><span class=special>&lt;&gt;</span> <span class=special>&gt;</span>
-<span class=special>&gt;</span> <span class=identifier>s</span><span class=special>;</span>             <span class=comment>// list-like container</span>
+<span class=special>&gt;</span> <span class=identifier>s</span><span class=special>;</span>            <span class=comment>// list-like container</span>
 
 <span class=identifier>s</span><span class=special>.</span><span class=identifier>push_front</span><span class=special>(</span><span class=number>0</span><span class=special>);</span>
-<span class=special>*(</span><span class=identifier>s</span><span class=special>.</span><span class=identifier>begin</span><span class=special>())==</span><span class=number>1</span><span class=special>;</span> <span class=comment>// ERROR: the element cannot be changed</span>
+<span class=special>*(</span><span class=identifier>s</span><span class=special>.</span><span class=identifier>begin</span><span class=special>())=</span><span class=number>1</span><span class=special>;</span> <span class=comment>// ERROR: the element cannot be changed</span>
 </pre></blockquote>
 
 <p>
@@ -1205,7 +1205,7 @@
 
 <br>
 
-<p>Revised February 21st 2006</p>
+<p>Revised July 13th 2006</p>
 
 <p>&copy; Copyright 2003-2006 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.
 Distributed under the Boost Software 

Deleted: boost/trunk/libs/multi_index/example/Jamfile
===================================================================
--- boost/trunk/libs/multi_index/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_index/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,67 +0,0 @@
-# Boost.MultiIndex examples Jamfile
-#
-# Copyright 2003-2006 Joaquín M López Muñoz.
-# Distributed under the Boost Software License, Version 1.0.
-# (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-#
-# See http://www.boost.org/libs/multi_index for library home page.
-
-subproject libs/multi_index/example ;
-
-exe basic
-    : basic.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe bimap
-    : bimap.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe complex_structs
-    : complex_structs.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe composite_keys
-    : composite_keys.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe hashed
-    : hashed.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe memfun_key
-    : memfun_key.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe non_default_ctor
-    : non_default_ctor.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe random_access
-    : random_access.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe rearrange
-    : rearrange.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe sequenced
-    : sequenced.cpp
-    : <include>$(BOOST_ROOT)
-    ;
-
-exe serialization
-    : serialization.cpp
-      <lib>../../serialization/build/boost_serialization
-    : <include>$(BOOST_ROOT)
-      std::locale-support
-    ;

Copied: boost/trunk/libs/multi_index/example/Jamfile.v2 (from rev 14034, boost/branches/upstream/current/libs/multi_index/example/Jamfile.v2)

Deleted: boost/trunk/libs/multi_index/perf/Jamfile
===================================================================
--- boost/trunk/libs/multi_index/perf/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_index/perf/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,16 +0,0 @@
-# Boost.MultiIndex performance tests Jamfile
-#
-# Copyright 2003-2004 Joaquín M López Muñoz.
-# Distributed under the Boost Software License, Version 1.0.
-# (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-#
-# See http://www.boost.org/libs/multi_index for library home page.
-
-subproject libs/multi_index/perf ;
-
-exe test_perf
-    : test_perf.cpp
-    : <include>$(BOOST_ROOT)
-    : release
-    ;

Copied: boost/trunk/libs/multi_index/perf/Jamfile.v2 (from rev 14034, boost/branches/upstream/current/libs/multi_index/perf/Jamfile.v2)

Deleted: boost/trunk/libs/multi_index/test/Jamfile
===================================================================
--- boost/trunk/libs/multi_index/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_index/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,80 +0,0 @@
-# Boost.MultiIndex tests Jamfile
-#
-# Copyright 2003-2006 Joaquín M López Muñoz.
-# Distributed under the Boost Software License, Version 1.0.
-# (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-#
-# See http://www.boost.org/libs/multi_index for library home page.
-
-subproject libs/multi_index/test ;
-
-# bring in rules for testing
-
-import testing ;
-
-local rule special-requirements ( toolset variant : properties * )
-{
-    # GCC on Tru64 has problems with long debug symbols generated by
-    # Boost.MultiIndex, so we turn them off when in that platform
-
-    if $(UNIX) && $(OS) = OSF
-    {
-        switch $(toolset)
-        {
-            case gcc* : properties =
-                [ replace-properties $(properties) : <debug-symbols>off ] ;
-        }
-    }
-    
-    return $(properties) ;
-}
-    
-# local specialization of rule run automatically including special requirements
-
-local rule local-run ( sources + : args * : input-files * : requirements *
-    : name ? : default-build * : args2 * )
-{
-    return [ run $(sources) : $(args) : $(input-files)
-        : $(requirements) special-requirements
-        : $(name) : $(default-build) : $(args2) ] ;
-}
-
-# make tests run by default
-
-DEPENDS all : test ;
-
-# bring in Boost.Serialization rules
-
-import ../../../libs/serialization/build/serialization ;
-
-{
-    test-suite "multi_index"
-        : [ local-run test_basic.cpp            test_basic_main.cpp            ]
-        : [ local-run test_capacity.cpp         test_capacity_main.cpp         ]
-        : [ local-run test_comparison.cpp       test_comparison_main.cpp       ]
-        : [ local-run test_composite_key.cpp    test_composite_key_main.cpp    ]
-        : [ local-run test_conv_iterators.cpp   test_conv_iterators_main.cpp   ]
-        : [ local-run test_copy_assignment.cpp  test_copy_assignment_main.cpp  ]
-        : [ local-run test_hash_ops.cpp         test_hash_ops_main.cpp         ]
-        : [ local-run test_iterators.cpp        test_iterators_main.cpp        ]
-        : [ local-run test_key_extractors.cpp   test_key_extractors_main.cpp   ]
-        : [ local-run test_list_ops.cpp         test_list_ops_main.cpp         ]
-        : [ local-run test_modifiers.cpp        test_modifiers_main.cpp        ]
-        : [ local-run test_mpl_ops.cpp          test_mpl_ops_main.cpp          ]
-        : [ local-run test_observers.cpp        test_observers_main.cpp        ]
-        : [ local-run test_projection.cpp       test_projection_main.cpp       ]
-        : [ local-run test_range.cpp            test_range_main.cpp            ]
-        : [ local-run test_rearrange.cpp        test_rearrange_main.cpp        ]
-        : [ local-run test_safe_mode.cpp        test_safe_mode_main.cpp        ]
-        : [ local-run test_serialization.cpp    test_serialization1.cpp
-                      test_serialization2.cpp   test_serialization_main.cpp
-                <lib>../../serialization/build/boost_serialization           
-            : # args
-            : # input files
-            : std::locale-support toolset::require-boost-spirit-support        ]
-        : [ local-run test_set_ops.cpp          test_set_ops_main.cpp          ]
-        : [ local-run test_special_set_ops.cpp  test_special_set_ops_main.cpp  ]
-        : [ local-run test_update.cpp           test_update_main.cpp           ]
-        ;
-}

Modified: boost/trunk/libs/multi_index/test/test_list_ops.cpp
===================================================================
--- boost/trunk/libs/multi_index/test/test_list_ops.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_index/test/test_list_ops.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 /* Boost.MultiIndex test for standard list operations.
  *
- * Copyright 2003-2006 Joaquín M López Muñoz.
+ * Copyright 2003-2007 Joaquín M López Muñoz.
  * Distributed under the Boost Software License, Version 1.0.
  * (See accompanying file LICENSE_1_0.txt or copy at
  * http://www.boost.org/LICENSE_1_0.txt)
@@ -32,7 +32,7 @@
   int v[]=check_range;\
   std::size_t size_v=sizeof(v)/sizeof(int);\
   BOOST_CHECK(std::size_t(std::distance((p).begin(),(p).end()))==size_v);\
-  BOOST_CHECK(std::equal((p).begin(),(p).end(),v));\
+  BOOST_CHECK(std::equal((p).begin(),(p).end(),&v[0]));\
 }
 
 #undef CHECK_VOID_RANGE
@@ -187,6 +187,43 @@
 
   ss.unique(same_integral_div<1>());
   CHECK_EQUAL(ss,{0 _ 3 _ 6 _ 9});
+
+  /* testcases for bugs reported at
+   * http://lists.boost.org/boost-users/2006/09/22604.php
+   */
+  {
+    Sequence ss,ss2;
+    ss.push_back(0);
+    ss2.push_back(0);
+    ss.splice(ss.end(),ss2,ss2.begin());
+    CHECK_EQUAL(ss,{0 _ 0});
+    BOOST_CHECK(ss2.empty());
+
+    ss.clear();
+    ss2.clear();
+    ss.push_back(0);
+    ss2.push_back(0);
+    ss.splice(ss.end(),ss2,ss2.begin(),ss2.end());
+    CHECK_EQUAL(ss,{0 _ 0});
+    BOOST_CHECK(ss2.empty());
+
+    ss.clear();
+    ss2.clear();
+    ss.push_back(0);
+    ss2.push_back(0);
+    ss.merge(ss2);
+    CHECK_EQUAL(ss,{0 _ 0});
+    BOOST_CHECK(ss2.empty());
+
+    typedef typename Sequence::value_type value_type;
+    ss.clear();
+    ss2.clear();
+    ss.push_back(0);
+    ss2.push_back(0);
+    ss.merge(ss2,std::less<value_type>());
+    CHECK_EQUAL(ss,{0 _ 0});
+    BOOST_CHECK(ss2.empty());
+  }
 }
 
 #if BOOST_WORKAROUND(__MWERKS__,<=0x3003)

Modified: boost/trunk/libs/multi_index/test/test_modifiers.cpp
===================================================================
--- boost/trunk/libs/multi_index/test/test_modifiers.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_index/test/test_modifiers.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,6 +16,37 @@
 #include "employee.hpp"
 #include <boost/test/test_tools.hpp>
 
+class always_one
+{
+public:
+  always_one():n(1){}
+  ~always_one(){n=0;}
+
+  int get()const{return n;}
+
+private:
+  int n;
+};
+
+
+inline bool operator==(const always_one& x,const always_one& y)
+{
+  return x.get()==y.get();
+}
+
+#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
+namespace boost{
+#endif
+
+inline std::size_t hash_value(const always_one& x)
+{
+  return static_cast<std::size_t>(x.get());
+}
+
+#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
+} /* namespace boost */
+#endif
+
 using namespace boost::multi_index;
 
 void test_modifiers()
@@ -236,4 +267,20 @@
 
   es2.clear();
   BOOST_CHECK(es2.size()==0);
+
+  /* testcase for problem reported at
+   * http://lists.boost.org/boost-users/2006/12/24215.php
+   */
+
+  multi_index_container<
+    always_one,
+    indexed_by<
+      hashed_non_unique<identity<always_one> >
+    >
+  > aoc;
+
+  aoc.insert(always_one());
+  aoc.insert(always_one());
+  aoc.erase(*(aoc.begin()));
+  BOOST_CHECK(aoc.empty());
 }

Modified: boost/trunk/libs/multi_index/test/test_range.cpp
===================================================================
--- boost/trunk/libs/multi_index/test/test_range.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_index/test/test_range.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 /* Boost.MultiIndex test for range().
  *
- * Copyright 2003-2004 Joaquín M López Muñoz.
+ * Copyright 2003-2007 Joaquín M López Muñoz.
  * Distributed under the Boost Software License, Version 1.0.
  * (See accompanying file LICENSE_1_0.txt or copy at
  * http://www.boost.org/LICENSE_1_0.txt)
@@ -33,7 +33,7 @@
   int v[]=check_range;\
   std::size_t size_v=sizeof(v)/sizeof(int);\
   BOOST_CHECK(std::size_t(std::distance((p).first,(p).second))==size_v);\
-  BOOST_CHECK(std::equal((p).first,(p).second,v));\
+  BOOST_CHECK(std::equal((p).first,(p).second,&v[0]));\
 }
 
 #undef CHECK_VOID_RANGE

Modified: boost/trunk/libs/multi_index/test/test_rearrange.cpp
===================================================================
--- boost/trunk/libs/multi_index/test/test_rearrange.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/multi_index/test/test_rearrange.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 /* Boost.MultiIndex test for rearrange operations.
  *
- * Copyright 2003-2006 Joaquín M López Muñoz.
+ * Copyright 2003-2007 Joaquín M López Muñoz.
  * Distributed under the Boost Software License, Version 1.0.
  * (See accompanying file LICENSE_1_0.txt or copy at
  * http://www.boost.org/LICENSE_1_0.txt)
@@ -32,7 +32,7 @@
   int v[]=check_range;\
   std::size_t size_v=sizeof(v)/sizeof(int);\
   BOOST_CHECK(std::size_t(std::distance((p).begin(),(p).end()))==size_v);\
-  BOOST_CHECK(std::equal((p).begin(),(p).end(),v));\
+  BOOST_CHECK(std::equal((p).begin(),(p).end(),&v[0]));\
 }
 
 #undef CHECK_VOID_RANGE

Modified: boost/trunk/libs/numeric/conversion/doc/converter_policies.html
===================================================================
--- boost/trunk/libs/numeric/conversion/doc/converter_policies.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/conversion/doc/converter_policies.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,318 +1,318 @@
-<HTML>
-
-<HEAD>
-<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
-<LINK REL="stylesheet" TYPE="text/css" HREF="../../../../boost.css">
-<TITLE>Boost Numeric Conversion Library - Converter Policies</TITLE>
-</HEAD>
-
-<BODY BGCOLOR="#FFFFFF" TEXT="#000000" LINK="#0000ff" VLINK="#800080">
-<TABLE BORDER="0" CELLPADDING="7" CELLSPACING="0" WIDTH="100%"
- SUMMARY="header">
-<TR>
-<TD VALIGN="top" WIDTH="300"> <H3><A HREF="http://www.boost.org"><IMG
-HEIGHT="86" WIDTH="277" ALT="C++ Boost" SRC="../../../../boost.png"
-BORDER="0"></A> </H3>
-</TD>
-<TD VALIGN="top"> <H1 ALIGN="center">Boost Numeric Conversion Library</H1>
-      <H1><A HREF="http://www.boost.org">Header </A><A
-HREF="../../../../boost/numeric/conversion/converter_policies.hpp">boost/numeric/conversion/converter_policies.hpp</A></H1>
-</TD>
-</TR>
-</TABLE>
-<HR>
-<H2>Contents</H2>
-<ol>
-<LI><A HREF="#rcr"><CODE>enumeration range_check_result</CODE></A> </LI>
-<LI><A HREF="#oh"><CODE>Policy OverflowHandler</CODE></A>
-<UL>
-<LI>class <A HREF="#oh_silent"><CODE>silent_overflow_handler</CODE></A></LI>
-<LI>class <A HREF="#oh_def"><CODE>def_overflow_handler</CODE></A> (Default Policy)</LI>
-<ul>
-<LI>class <CODE> <A HREF="#bad_numc">bad_numeric_cast</A></CODE> <a href="#x-note">(see IMPORTANT note)</a></LI>
-<LI>class <A HREF="#negovr"><CODE>negative_overflow</CODE></A></LI>
-<LI>class <A HREF="#posovr"><CODE>positive_overflow</CODE></A></LI>
-</ul>
-</UL>
-</LI>
-<LI><A HREF="#f2i"><CODE>Policy FloatToIntRounder</CODE></A> <UL>
-<LI>class <A HREF="#trunc"><CODE>Trunc&lt;T&gt;</CODE></A> (Default Policy)</LI>
-<LI>class <A HREF="#round"><CODE>RoundEven&lt;T&gt;</CODE></A></LI>
-<LI>class <A HREF="#ceil"><CODE>Ceil&lt;T&gt;</CODE></A></LI>
-<LI>class <A HREF="#floor"><CODE>Floor&lt;T&gt;</CODE></A></LI>
-</UL>
-</LI>
-<LI><A HREF="#rawc"><CODE>Policy RawConverter</CODE></A><UL>
-      <LI>class <A HREF="#rawnumc"><CODE>raw_converter class</CODE></A> (Default)</LI>
-</UL>
-</LI>
-<LI><A HREF="#rc"><CODE>Policy UserRangeChecker</CODE></A><UL>
-      <LI>class <A HREF="#int_rc"><CODE>UseInternalRangeChecker class</CODE></A> (Default)</LI>
-</UL>
-</LI>
-</ol>
-
-<HR>
-<H2><A NAME="types">Types</A></H2>
-<H2><A NAME="rcr"><CODE>enum range_check_result</CODE></A></H2>
-<PRE>namespace boost { namespace numeric {
-
-
-  enum range_check_result
-  {
-    cInRange     ,
-    cNegOverflow ,
-    cPosOverflow
-  } ;
-
-
-} }</PRE>
-
-<P>Defines the values returned by <CODE>boost::numeric::converter&lt;&gt;::out_of_range()</CODE>
-</P>
-<HR>
-<H2><A NAME="oh">Policy <CODE>OverflowHandler</CODE></A></H2>
-<P>This <EM>stateless</EM> non-template policy class must be a <I>function object</I>
-  and is called to administrate the result of the range checking. It can throw
-  an exception if overflow has been detected by the range checking as indicated
-  by its argument. If it throws, is is recommended that it be <CODE>std::bad_cast</CODE>
-  or derived.</P>
-<P>It must have the following interface (it does not has to be a template class):</P>
-<PRE>  struct YourOverflowHandlerPolicy
-  {
-    void operator() ( boost::range_check_result ) ; // throw bad_cast or derived
-  } ;
-</PRE>
-<P>It is called with the result of the converter's <CODE>out_of_range()</CODE>
-  inside <CODE>validate_range()</CODE>.</P>
-<P>These are the two overflow handler classes provided by the
-library:</P>
-<PRE>namespace boost { namespace numeric {
-
-
-  struct <A NAME="oh_def">def_overflow_handler</a>
-  {
-    void operator() ( range_check_result r ) // throw bad_numeric_conversion derived
-    {
-      if ( r == cNegOverflow )
-        throw negative_overflow() ;
-      else if ( r == cPosOverflow )
-             throw positive_overflow() ;
-    }
-  } ;
-
-  struct <A NAME="oh_silent">silent_overflow_handler</a>
-  {
-    void operator() ( range_check_result ) // no-throw
-      {}
-  } ;
-
-} }
-</PRE>
-
-<P>And these are the Exception Classes thrown by the default
-overflow handler <a href="#x-note">(see IMPORTANT note)</a></P>
-<PRE>namespace boost { namespace numeric {
-
-
-  class <a name="bad_numc">bad_numeric_cast</a> : public std::bad_cast
-  {
-    public:
-
-      virtual const char *what() const // throw()
-        {  return &quot;bad numeric conversion: overflow&quot;; }
-  };
-
-  class <a name="negovr">negative_overflow</a> : public bad_numeric_conversion
-  {
-    public:
-
-      virtual const char *what() const // throw()
-        {  return &quot;bad numeric conversion: negative overflow&quot;; }
-  };
-  class <a name="posovr">positive_overflow</a> : public bad_numeric_conversion
-  {
-    public:
-
-      virtual const char *what() const // throw()
-        { return &quot;bad numeric conversion: positive overflow&quot;; }
-  };
-} }
-</PRE>
-
-<a name="x-note"><p><b>IMPORTANT RELEASE NOTE for 1.33</b></p></a>
-<blockquote>
-  <p>Previous to boost version 1.33, the exception class <code>bad_numeric_cast</code> was 
-  named <code>bad_numeric_conversion</code>. However, in 1.33, the old function 
-  <code>numeric_cast&lt;&gt;</code> from <code>boost/cast.hpp</code> was completly replaced by the new 
-  <code>numeric_cast&lt;&gt;</code> in <code>boost/numeric/conversion/cast.hpp</code> 
-  (and <code>boost/cast.hpp</code> is including <code>boost/numeric/conversion/cast.hpp</code> now). That old function which 
-  existed in boost for quite some time used the <code>bad_numeric_cast</code> as its 
-  exception type so I decided to avoid backward compatibility problems by adopting it (guessing 
-  that the user base for the old code is wider than for the new code).</p>
-</blockquote>
-
-<HR>
-<H2><A NAME="f2i">Policy <CODE>FloatToIntRounder</CODE></A></H2>
-<P>This <EM>stateless</EM> template policy class specifies the rounding mode used
-  for<U> float to integral</U> conversions. It supplies the <CODE>&quot;nearbyint()&quot;</CODE>
-  static member function exposed by the converter, which means that it <U>publicly
-  inherits from this policy.</U></P>
-<P>The policy must have the following interface:</P>
-<PRE>  template&lt;class S&gt;
-  struct YourFloat2IntRounderPolicy
-  {
-    typedef S               source_type ;
-    typedef <I>{S or S const&amp;}</I> argument_type ;
-
-    static source_type nearbyint ( argument_type s ) { ... }
-
-    typedef mpl::integral_c&lt;std::float_round_style,std::<i>round_...</i>&gt; round_style ;
-  } ;
-</PRE>
-
-<P>These are the rounder classes provided by the library:</P>
-
-<BLOCKQUOTE>
-  <P><EM>NOTE: These classes are not intended to be general purpose rounding functions
-    but specific policies for converter&lt;&gt;. This is why <U>they are not function
-    objects</U>.</EM></P>
-  <P>(only the specific parts are shown, see the general policy form above)</P>
-  <PRE>namespace boost { namespace numeric {
-
-  <A NAME="trunc"></A>template&lt;class S&gt;
-  struct Trunc
-  {
-    static source_type nearbyint ( argument_type s )
-      {
-        using std::floor ;
-        using std::ceil  ;
-        return s >= static_cast&lt;S&gt;(0) ? floor(s) : ceil(s) ;
-      }
-
-    typedef mpl::integral_c&lt;std::float_round_style,std::round_toward_zero&gt; round_style ;
-  } ;
-  </PRE>
-  <PRE>  <A NAME="round"></A>template&lt;class S&gt;
-  struct RoundEven
-  {
-    static source_type nearbyint ( argument_type s )
-      {
-        return <i>impl-defined-value</i> ;
-      }
-
-      typedef mpl::integral_c&lt;std::float_round_style,std::round_to_nearest&gt; round_style ;
-  } ;
-</PRE>
-<PRE>  <A NAME="ceil"></A>template&lt;class S&gt;
-  struct Ceil
-  {
-    static source_type nearbyint ( argument_type s )
-    {<br>      using std::ceil ;<br>      return ceil(s) ;<br>    }
-
-    typedef mpl::integral_c&lt;std::float_round_style,std::round_toward_infinity&gt; round_style ;
-  } ;
-</PRE>
-<PRE>  <A NAME="floor"></A>template&lt;class S&gt;
-  struct Floor
-  {
-    static source_type nearbyint ( argument_type s )
-    {<br>      using std::floor ;<br>      return floor(s) ;<br>    }
-
-    typedef mpl::integral_c&lt;std::float_round_style,std::round_toward_neg_infinity&gt; round_style ;
-  } ;
-
-} } // namespace numeric, namespace boost</PRE>
-
-</BLOCKQUOTE>
-<H3>Math Functions used by the rounder policies</H3>
-<P>The rounder policies supplied by this header use math functions floor() and
-  ceil(). The standard versions of these functions are introduced in context by
-  a using directive, so in normal conditions, the standard functions will be used.
-  <br>
-  However, if there are other visible corresponding overloads an ambiguity could
-  arise. In this case, the user can supply her own rounder policy which could,
-  for instance, use a fully qualified call.<br>
-  This technique allows the default rounder policies to be used directly with
-  user defined types. The user only requires that suitable overloads of floor()
-  and ceil() be visible. See also <a HREF="requirements.html">User Defined Numeric Types support</a><br>
-</P>
-<HR>
-<H2><A NAME="rawc">Policy <CODE>RawConverter</CODE></A></H2>
-<P>This <EM>stateless</EM> template policy class is used to perform the actual
-  conversion from Source to Target. It supplies the <CODE>&quot;low_level_convert()&quot;</CODE>
-  static member function exposed by the converter, which means that it <U>publicly
-  inherits from this policy.</U></P>
-<P>The policy must have the following interface:</P>
-<PRE>  template&lt;class Traits&gt;
-  struct YourRawConverterPolicy
-  {
-    typedef typename Traits::result_type   result_type   ;
-    typedef typename Traits::argument_type argument_type ;
-
-    static result_type low_level_convert ( argument_type s ) { return <I>&lt;impl defined&gt;</I> ; }
-  } ;
-</PRE>
-
-<P>This policy is mostly provided as a hook for user defined types which don't
-  support <CODE>static_cast&lt;&gt;</CODE> conversions to some types</P>
-
-<P>This is the only raw converter policy class provided
-by the library:</P>
-<PRE>namespace boost { namespace numeric {
-
-
-  template&lt;class Traits&gt;
-  struct <A NAME="rawnumc">raw_numeric_converter</A>
-  {
-    typedef typename Traits::result_type   result_type   ;
-    typedef typename Traits::argument_type argument_type ;
-
-    static result_type low_level_convert ( argument_type s )
-      { return static_cast&lt;result_type&gt;(s) ; }
-  } ;
-
-}
-</PRE>
-
-<HR>
-<H2><A NAME="rc">Policy <CODE>UserRangeChecker</CODE></A></H2>
-<P>This <EM>stateless</EM> template policy class is used -<u>only if supplied</u>-
-  to <b>override</b> the internal range checking logic.<br>
-  It supplies the <CODE>&quot;validate_range()&quot;</CODE> static member function
-  exposed by the converter, which means that it <U>publicly inherits from this
-  policy.</U></P>
-<P>The policy must have the following interface:</P>
-<PRE>  template&lt;class Traits&gt;
-  struct YourRangeCheckerPolicy
-  {
-     typedef typename Traits::argument_type argument_type ;
-
-     // Determines if the value 's' fits in the range of the Target type.
-     static range_check_result out_of_range ( argument_type s ) ;
-
-     // Checks whether the value 's' is out_of_range()
-     // and passes the result of the check to the OverflowHandler policy.
-     static void validate_range ( argument_type s )
-       {
-         OverflowHandler()( out_of_range(s) ) ;
-       }
-  } ;
-</PRE>
-<P>This policy is <b>only</b> provided as a hook for user defined types which
-  require range checking (which is disabled by default when a UDT is involved).<br>
-  The library provides a class: <A NAME="int_rc"><code>UseInternalRangeChecker{};</code></a> which
-  is a <i>fake</i> RangeChecker policy used to signal the converter to use its
-  internal range checking implementation.
-</P>
-<HR>
-<P>Back to <A HREF="index.html">Numeric Conversion library index</A></P>
-<HR>
-<P>Revised 23 June 2004</P>
-<p>© Copyright Fernando Luis Cacciola Carballal, 2004</p>
-<p> Use, modification, and distribution are subject to the Boost Software
-License, Version 1.0. (See accompanying file <a href="../../../../LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <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
+<HTML>
+
+<HEAD>
+<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
+<LINK REL="stylesheet" TYPE="text/css" HREF="../../../../boost.css">
+<TITLE>Boost Numeric Conversion Library - Converter Policies</TITLE>
+</HEAD>
+
+<BODY BGCOLOR="#FFFFFF" TEXT="#000000" LINK="#0000ff" VLINK="#800080">
+<TABLE BORDER="0" CELLPADDING="7" CELLSPACING="0" WIDTH="100%"
+ SUMMARY="header">
+<TR>
+<TD VALIGN="top" WIDTH="300"> <H3><A HREF="http://www.boost.org"><IMG
+HEIGHT="86" WIDTH="277" ALT="C++ Boost" SRC="../../../../boost.png"
+BORDER="0"></A> </H3>
+</TD>
+<TD VALIGN="top"> <H1 ALIGN="center">Boost Numeric Conversion Library</H1>
+      <H1><A HREF="http://www.boost.org">Header </A><A
+HREF="../../../../boost/numeric/conversion/converter_policies.hpp">boost/numeric/conversion/converter_policies.hpp</A></H1>
+</TD>
+</TR>
+</TABLE>
+<HR>
+<H2>Contents</H2>
+<ol>
+<LI><A HREF="#rcr"><CODE>enumeration range_check_result</CODE></A> </LI>
+<LI><A HREF="#oh"><CODE>Policy OverflowHandler</CODE></A>
+<UL>
+<LI>class <A HREF="#oh_silent"><CODE>silent_overflow_handler</CODE></A></LI>
+<LI>class <A HREF="#oh_def"><CODE>def_overflow_handler</CODE></A> (Default Policy)</LI>
+<ul>
+<LI>class <CODE> <A HREF="#bad_numc">bad_numeric_cast</A></CODE> <a href="#x-note">(see IMPORTANT note)</a></LI>
+<LI>class <A HREF="#negovr"><CODE>negative_overflow</CODE></A></LI>
+<LI>class <A HREF="#posovr"><CODE>positive_overflow</CODE></A></LI>
+</ul>
+</UL>
+</LI>
+<LI><A HREF="#f2i"><CODE>Policy FloatToIntRounder</CODE></A> <UL>
+<LI>class <A HREF="#trunc"><CODE>Trunc&lt;T&gt;</CODE></A> (Default Policy)</LI>
+<LI>class <A HREF="#round"><CODE>RoundEven&lt;T&gt;</CODE></A></LI>
+<LI>class <A HREF="#ceil"><CODE>Ceil&lt;T&gt;</CODE></A></LI>
+<LI>class <A HREF="#floor"><CODE>Floor&lt;T&gt;</CODE></A></LI>
+</UL>
+</LI>
+<LI><A HREF="#rawc"><CODE>Policy RawConverter</CODE></A><UL>
+      <LI>class <A HREF="#rawnumc"><CODE>raw_converter class</CODE></A> (Default)</LI>
+</UL>
+</LI>
+<LI><A HREF="#rc"><CODE>Policy UserRangeChecker</CODE></A><UL>
+      <LI>class <A HREF="#int_rc"><CODE>UseInternalRangeChecker class</CODE></A> (Default)</LI>
+</UL>
+</LI>
+</ol>
+
+<HR>
+<H2><A NAME="types">Types</A></H2>
+<H2><A NAME="rcr"><CODE>enum range_check_result</CODE></A></H2>
+<PRE>namespace boost { namespace numeric {
+
+
+  enum range_check_result
+  {
+    cInRange     ,
+    cNegOverflow ,
+    cPosOverflow
+  } ;
+
+
+} }</PRE>
+
+<P>Defines the values returned by <CODE>boost::numeric::converter&lt;&gt;::out_of_range()</CODE>
+</P>
+<HR>
+<H2><A NAME="oh">Policy <CODE>OverflowHandler</CODE></A></H2>
+<P>This <EM>stateless</EM> non-template policy class must be a <I>function object</I>
+  and is called to administrate the result of the range checking. It can throw
+  an exception if overflow has been detected by the range checking as indicated
+  by its argument. If it throws, is is recommended that it be <CODE>std::bad_cast</CODE>
+  or derived.</P>
+<P>It must have the following interface (it does not has to be a template class):</P>
+<PRE>  struct YourOverflowHandlerPolicy
+  {
+    void operator() ( boost::range_check_result ) ; // throw bad_cast or derived
+  } ;
+</PRE>
+<P>It is called with the result of the converter's <CODE>out_of_range()</CODE>
+  inside <CODE>validate_range()</CODE>.</P>
+<P>These are the two overflow handler classes provided by the
+library:</P>
+<PRE>namespace boost { namespace numeric {
+
+
+  struct <A NAME="oh_def">def_overflow_handler</a>
+  {
+    void operator() ( range_check_result r ) // throw bad_numeric_conversion derived
+    {
+      if ( r == cNegOverflow )
+        throw negative_overflow() ;
+      else if ( r == cPosOverflow )
+             throw positive_overflow() ;
+    }
+  } ;
+
+  struct <A NAME="oh_silent">silent_overflow_handler</a>
+  {
+    void operator() ( range_check_result ) // no-throw
+      {}
+  } ;
+
+} }
+</PRE>
+
+<P>And these are the Exception Classes thrown by the default
+overflow handler <a href="#x-note">(see IMPORTANT note)</a></P>
+<PRE>namespace boost { namespace numeric {
+
+
+  class <a name="bad_numc">bad_numeric_cast</a> : public std::bad_cast
+  {
+    public:
+
+      virtual const char *what() const // throw()
+        {  return &quot;bad numeric conversion: overflow&quot;; }
+  };
+
+  class <a name="negovr">negative_overflow</a> : public bad_numeric_conversion
+  {
+    public:
+
+      virtual const char *what() const // throw()
+        {  return &quot;bad numeric conversion: negative overflow&quot;; }
+  };
+  class <a name="posovr">positive_overflow</a> : public bad_numeric_conversion
+  {
+    public:
+
+      virtual const char *what() const // throw()
+        { return &quot;bad numeric conversion: positive overflow&quot;; }
+  };
+} }
+</PRE>
+
+<a name="x-note"><p><b>IMPORTANT RELEASE NOTE for 1.33</b></p></a>
+<blockquote>
+  <p>Previous to boost version 1.33, the exception class <code>bad_numeric_cast</code> was 
+  named <code>bad_numeric_conversion</code>. However, in 1.33, the old function 
+  <code>numeric_cast&lt;&gt;</code> from <code>boost/cast.hpp</code> was completly replaced by the new 
+  <code>numeric_cast&lt;&gt;</code> in <code>boost/numeric/conversion/cast.hpp</code> 
+  (and <code>boost/cast.hpp</code> is including <code>boost/numeric/conversion/cast.hpp</code> now). That old function which 
+  existed in boost for quite some time used the <code>bad_numeric_cast</code> as its 
+  exception type so I decided to avoid backward compatibility problems by adopting it (guessing 
+  that the user base for the old code is wider than for the new code).</p>
+</blockquote>
+
+<HR>
+<H2><A NAME="f2i">Policy <CODE>FloatToIntRounder</CODE></A></H2>
+<P>This <EM>stateless</EM> template policy class specifies the rounding mode used
+  for<U> float to integral</U> conversions. It supplies the <CODE>&quot;nearbyint()&quot;</CODE>
+  static member function exposed by the converter, which means that it <U>publicly
+  inherits from this policy.</U></P>
+<P>The policy must have the following interface:</P>
+<PRE>  template&lt;class S&gt;
+  struct YourFloat2IntRounderPolicy
+  {
+    typedef S               source_type ;
+    typedef <I>{S or S const&amp;}</I> argument_type ;
+
+    static source_type nearbyint ( argument_type s ) { ... }
+
+    typedef mpl::integral_c&lt;std::float_round_style,std::<i>round_...</i>&gt; round_style ;
+  } ;
+</PRE>
+
+<P>These are the rounder classes provided by the library:</P>
+
+<BLOCKQUOTE>
+  <P><EM>NOTE: These classes are not intended to be general purpose rounding functions
+    but specific policies for converter&lt;&gt;. This is why <U>they are not function
+    objects</U>.</EM></P>
+  <P>(only the specific parts are shown, see the general policy form above)</P>
+  <PRE>namespace boost { namespace numeric {
+
+  <A NAME="trunc"></A>template&lt;class S&gt;
+  struct Trunc
+  {
+    static source_type nearbyint ( argument_type s )
+      {
+        using std::floor ;
+        using std::ceil  ;
+        return s >= static_cast&lt;S&gt;(0) ? floor(s) : ceil(s) ;
+      }
+
+    typedef mpl::integral_c&lt;std::float_round_style,std::round_toward_zero&gt; round_style ;
+  } ;
+  </PRE>
+  <PRE>  <A NAME="round"></A>template&lt;class S&gt;
+  struct RoundEven
+  {
+    static source_type nearbyint ( argument_type s )
+      {
+        return <i>impl-defined-value</i> ;
+      }
+
+      typedef mpl::integral_c&lt;std::float_round_style,std::round_to_nearest&gt; round_style ;
+  } ;
+</PRE>
+<PRE>  <A NAME="ceil"></A>template&lt;class S&gt;
+  struct Ceil
+  {
+    static source_type nearbyint ( argument_type s )
+    {<br>      using std::ceil ;<br>      return ceil(s) ;<br>    }
+
+    typedef mpl::integral_c&lt;std::float_round_style,std::round_toward_infinity&gt; round_style ;
+  } ;
+</PRE>
+<PRE>  <A NAME="floor"></A>template&lt;class S&gt;
+  struct Floor
+  {
+    static source_type nearbyint ( argument_type s )
+    {<br>      using std::floor ;<br>      return floor(s) ;<br>    }
+
+    typedef mpl::integral_c&lt;std::float_round_style,std::round_toward_neg_infinity&gt; round_style ;
+  } ;
+
+} } // namespace numeric, namespace boost</PRE>
+
+</BLOCKQUOTE>
+<H3>Math Functions used by the rounder policies</H3>
+<P>The rounder policies supplied by this header use math functions floor() and
+  ceil(). The standard versions of these functions are introduced in context by
+  a using directive, so in normal conditions, the standard functions will be used.
+  <br>
+  However, if there are other visible corresponding overloads an ambiguity could
+  arise. In this case, the user can supply her own rounder policy which could,
+  for instance, use a fully qualified call.<br>
+  This technique allows the default rounder policies to be used directly with
+  user defined types. The user only requires that suitable overloads of floor()
+  and ceil() be visible. See also <a HREF="requirements.html">User Defined Numeric Types support</a><br>
+</P>
+<HR>
+<H2><A NAME="rawc">Policy <CODE>RawConverter</CODE></A></H2>
+<P>This <EM>stateless</EM> template policy class is used to perform the actual
+  conversion from Source to Target. It supplies the <CODE>&quot;low_level_convert()&quot;</CODE>
+  static member function exposed by the converter, which means that it <U>publicly
+  inherits from this policy.</U></P>
+<P>The policy must have the following interface:</P>
+<PRE>  template&lt;class Traits&gt;
+  struct YourRawConverterPolicy
+  {
+    typedef typename Traits::result_type   result_type   ;
+    typedef typename Traits::argument_type argument_type ;
+
+    static result_type low_level_convert ( argument_type s ) { return <I>&lt;impl defined&gt;</I> ; }
+  } ;
+</PRE>
+
+<P>This policy is mostly provided as a hook for user defined types which don't
+  support <CODE>static_cast&lt;&gt;</CODE> conversions to some types</P>
+
+<P>This is the only raw converter policy class provided
+by the library:</P>
+<PRE>namespace boost { namespace numeric {
+
+
+  template&lt;class Traits&gt;
+  struct <A NAME="rawnumc">raw_numeric_converter</A>
+  {
+    typedef typename Traits::result_type   result_type   ;
+    typedef typename Traits::argument_type argument_type ;
+
+    static result_type low_level_convert ( argument_type s )
+      { return static_cast&lt;result_type&gt;(s) ; }
+  } ;
+
+}
+</PRE>
+
+<HR>
+<H2><A NAME="rc">Policy <CODE>UserRangeChecker</CODE></A></H2>
+<P>This <EM>stateless</EM> template policy class is used -<u>only if supplied</u>-
+  to <b>override</b> the internal range checking logic.<br>
+  It supplies the <CODE>&quot;validate_range()&quot;</CODE> static member function
+  exposed by the converter, which means that it <U>publicly inherits from this
+  policy.</U></P>
+<P>The policy must have the following interface:</P>
+<PRE>  template&lt;class Traits&gt;
+  struct YourRangeCheckerPolicy
+  {
+     typedef typename Traits::argument_type argument_type ;
+
+     // Determines if the value 's' fits in the range of the Target type.
+     static range_check_result out_of_range ( argument_type s ) ;
+
+     // Checks whether the value 's' is out_of_range()
+     // and passes the result of the check to the OverflowHandler policy.
+     static void validate_range ( argument_type s )
+       {
+         OverflowHandler()( out_of_range(s) ) ;
+       }
+  } ;
+</PRE>
+<P>This policy is <b>only</b> provided as a hook for user defined types which
+  require range checking (which is disabled by default when a UDT is involved).<br>
+  The library provides a class: <A NAME="int_rc"><code>UseInternalRangeChecker{};</code></a> which
+  is a <i>fake</i> RangeChecker policy used to signal the converter to use its
+  internal range checking implementation.
+</P>
+<HR>
+<P>Back to <A HREF="index.html">Numeric Conversion library index</A></P>
+<HR>
+<P>Revised 23 June 2004</P>
+<p>© Copyright Fernando Luis Cacciola Carballal, 2004</p>
+<p> Use, modification, and distribution are subject to the Boost Software
+License, Version 1.0. (See accompanying file <a href="../../../../LICENSE_1_0.txt">
+LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
+www.boost.org/LICENSE_1_0.txt</a>)</p>
+</BODY>
+</HTML>

Modified: boost/trunk/libs/numeric/conversion/index.html
===================================================================
--- boost/trunk/libs/numeric/conversion/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/conversion/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,10 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="doc/index.html">doc/index.html</a>.
+<a href="doc/index.html">doc/index.html</a>.&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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
+</html>

Deleted: boost/trunk/libs/numeric/conversion/test/Jamfile
===================================================================
--- boost/trunk/libs/numeric/conversion/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/conversion/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,24 +0,0 @@
-# Boost Numeric Conversion Library test Jamfile
-
-subproject libs/numeric/conversion/test ;
-
-# bring in rules for testing
-SEARCH on testing.jam = $(BOOST_BUILD_PATH) ;
-include testing.jam ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-  # look in BOOST_ROOT for sources first, just in this Jamfile
-  local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-
-  test-suite numeric/conversion :
-     [ run libs/numeric/conversion/test/bounds_test.cpp ]
-     [ run libs/numeric/conversion/test/traits_test.cpp ]
-     [ run libs/numeric/conversion/test/converter_test.cpp ]
-     [ run libs/numeric/conversion/test/udt_support_test.cpp ]
-     [ run libs/numeric/conversion/test/numeric_cast_test.cpp ]
-     [ run libs/numeric/conversion/test/udt_example_0.cpp ]
-  ;
-}

Modified: boost/trunk/libs/numeric/index.html
===================================================================
--- boost/trunk/libs/numeric/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,11 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="ublas/doc/index.htm">ublas/doc/index.htm</a>.
+<a href="ublas/doc/index.htm">ublas/doc/index.htm</a>.&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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

Modified: boost/trunk/libs/numeric/interval/doc/checking.htm
===================================================================
--- boost/trunk/libs/numeric/interval/doc/checking.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/interval/doc/checking.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,35 +1,40 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
-    "http://www.w3.org/TR/html4/loose.dtd">
+"http://www.w3.org/TR/html4/loose.dtd">
+
 <html>
 <head>
-  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
   <link rel="stylesheet" type="text/css" href="../../../../boost.css">
+
   <title>Checking policies</title>
 </head>
 
 <body>
-<h1>Checking policies</h1>
+  <h1>Checking policies</h1>
 
-<p>A checking policy controls how the <code>interval</code> class will deal
-with special cases like: empty intervals, infinite numbers, invalid
-values.</p>
+  <p>A checking policy controls how the <code>interval</code> class will deal
+  with special cases like: empty intervals, infinite numbers, invalid
+  values.</p>
 
-<p>For example, let's consider <code>operator+(interval, T)</code>. The
-second argument could be an invalid value (for a floating-point number, it is
-a NaN). What to do in such a case? First, we could say that the second
-argument can never be an invalid number. Second, we could also say such a
-situation can arise but is forbidden. Third, we could allow such values and
-generate an empty interval when encountered. And there is many other
-possibilities.</p>
+  <p>For example, let's consider <code>operator+(interval, T)</code>. The
+  second argument could be an invalid value (for a floating-point number, it
+  is a NaN). What to do in such a case? First, we could say that the second
+  argument can never be an invalid number. Second, we could also say such a
+  situation can arise but is forbidden. Third, we could allow such values and
+  generate an empty interval when encountered. And there is many other
+  possibilities.</p>
 
-<p>It is the reason why such a policy is used: there is a lot of interesting
-behaviors and it would be sad to arbitrarily select one of these.</p>
+  <p>It is the reason why such a policy is used: there is a lot of
+  interesting behaviors and it would be sad to arbitrarily select one of
+  these.</p>
 
-<h2>Requirements</h2>
+  <h2>Requirements</h2>
 
-<p>The checking class should satisfy the following requirement (in the form
-of an interface):</p>
-<pre>/* requirements for checking policy */
+  <p>The checking class should satisfy the following requirement (in the form
+  of an interface):</p>
+  <pre>
+/* requirements for checking policy */
 struct checking
 {
   static T pos_inf();
@@ -39,41 +44,44 @@
   static T empty_lower();
   static T empty_upper();
   static bool is_empty(const T&amp;, const T&amp;);
-};</pre>
+};
+</pre>
 
-<p>The first two functions, <code>pos_inf</code> and <code>neg_inf</code>,
-are invoked each time the library has to create the infinite bound of an
-interval. For example, <code>interval::whole</code> computes
-<code>interval(checking::neg_inf(), checking::pos_inf())</code>. If infinite
-values are allowed and <code>std::numeric_limits&lt;T&gt;::infinity()</code>
-returns a correct value, such a value can be used.</p>
+  <p>The first two functions, <code>pos_inf</code> and <code>neg_inf</code>,
+  are invoked each time the library has to create the infinite bound of an
+  interval. For example, <code>interval::whole</code> computes
+  <code>interval(checking::neg_inf(), checking::pos_inf())</code>. If
+  infinite values are allowed and
+  <code>std::numeric_limits&lt;T&gt;::infinity()</code> returns a correct
+  value, such a value can be used.</p>
 
-<p>Next comes <code>nan</code>. This function is used each time a function
-need to return a value of type <code>T</code> but is unable to compute it. It
-only happens when one of the arguments of the function is invalid. For
-example, if you ask what the median value of an empty interval is,
-<code>nan</code> will be used. But please remember: <code>lower</code> and
-<code>upper</code> directly return the value stocked in the interval; so, if
-the interval is empty, <code>lower</code> will not answer <code>by</code> a
-call to <code>checking::nan</code> (but will return the same value than
-<code>checking::empty_lower</code> could return).</p>
+  <p>Next comes <code>nan</code>. This function is used each time a function
+  need to return a value of type <code>T</code> but is unable to compute it.
+  It only happens when one of the arguments of the function is invalid. For
+  example, if you ask what the median value of an empty interval is,
+  <code>nan</code> will be used. But please remember: <code>lower</code> and
+  <code>upper</code> directly return the value stocked in the interval; so,
+  if the interval is empty, <code>lower</code> will not answer
+  <code>by</code> a call to <code>checking::nan</code> (but will return the
+  same value than <code>checking::empty_lower</code> could return).</p>
 
-<p><code>empty_lower</code> and <code>empty_upper</code> respectively return
-the lower and upper bound of the empty interval. There is no requirements for
-<code>empty_lower</code> and <code>empty_upper</code> to return the same
-value than <code>checking::nan</code>. For example, if the type
-<code>T</code> does not have any invalid value, the <code>empty_</code>
-functions can return the [1;0] interval.</p>
+  <p><code>empty_lower</code> and <code>empty_upper</code> respectively
+  return the lower and upper bound of the empty interval. There is no
+  requirements for <code>empty_lower</code> and <code>empty_upper</code> to
+  return the same value than <code>checking::nan</code>. For example, if the
+  type <code>T</code> does not have any invalid value, the
+  <code>empty_</code> functions can return the [1;0] interval.</p>
 
-<p><code>is_nan</code> is used to test if a value of type <code>T</code> is
-invalid or not. <code>is_empty</code> tests if the interval formed by the two
-arguments is empty or not. Such tests will generally be at the beginning of
-each function which involves an argument of type <code>T</code>. If one of
-the inputs is declared invalid, the the function will try to produce an
-invalid value or an input interval.</p>
+  <p><code>is_nan</code> is used to test if a value of type <code>T</code> is
+  invalid or not. <code>is_empty</code> tests if the interval formed by the
+  two arguments is empty or not. Such tests will generally be at the
+  beginning of each function which involves an argument of type
+  <code>T</code>. If one of the inputs is declared invalid, the the function
+  will try to produce an invalid value or an input interval.</p>
 
-<h2>Synopsis</h2>
-<pre>namespace boost {
+  <h2>Synopsis</h2>
+  <pre>
+namespace boost {
 namespace numeric {
 namespace interval_lib {
 
@@ -91,133 +99,154 @@
 
 } // namespace numeric
 } // namespace interval_lib
-} // namespace boost</pre>
+} // namespace boost
+</pre>
 
-<h2>Predefined classes</h2>
+  <h2>Predefined classes</h2>
 
-<p>In order to simplify the customization of the policy, some templates are
-already defined in the library.</p>
+  <p>In order to simplify the customization of the policy, some templates are
+  already defined in the library.</p>
 
-<p>First of all, there is <code>checking_base</code>. Thanks to the
-information provided by <code>std::numeric_limits&lt;T&gt;</code>, this class
-is able to generate a base for the policy. If <code>T</code> has quiet NaNs
-(as said by <code>numeric_limits::has_quiet_NaN</code>), then the value is
-used for <code>nan</code>, <code>empty_lower</code>,
-<code>empty_upper</code>; and a basic test is used for <code>is_nan</code>
-(it is <code>x!=x</code>). If <code>T</code> does not have quiet NaNs, then
-<code>nan</code> is an <code>assert(false)</code>, the empty interval is
-[1,0], and <code>is_nan</code> always return <code>false</code>. As for
-<code>nan</code>, <code>pos_inf</code> returns
-<code>numeric_limits::infinity()</code> if possible, or is an
-<code>assert(false</code>) otherwise. <code>neg_inf</code> returns the
-opposite. Finally, <code>is_empty(T l,T u)</code> is always defined by
-<code>!(l&lt;=u)</code>.</p>
+  <p>First of all, there is <code>checking_base</code>. Thanks to the
+  information provided by <code>std::numeric_limits&lt;T&gt;</code>, this
+  class is able to generate a base for the policy. If <code>T</code> has
+  quiet NaNs (as said by <code>numeric_limits::has_quiet_NaN</code>), then
+  the value is used for <code>nan</code>, <code>empty_lower</code>,
+  <code>empty_upper</code>; and a basic test is used for <code>is_nan</code>
+  (it is <code>x!=x</code>). If <code>T</code> does not have quiet NaNs, then
+  <code>nan</code> is an <code>assert(false)</code>, the empty interval is
+  [1,0], and <code>is_nan</code> always return <code>false</code>. As for
+  <code>nan</code>, <code>pos_inf</code> returns
+  <code>numeric_limits::infinity()</code> if possible, or is an
+  <code>assert(false</code>) otherwise. <code>neg_inf</code> returns the
+  opposite. Finally, <code>is_empty(T l,T u)</code> is always defined by
+  <code>!(l&lt;=u)</code>.</p>
 
-<p>Next comes <code>checking_no_empty</code>. Using it means that each time
-an empty interval should be produced (by <code>empty_lower</code> and
-<code>empty_upper</code>), the function object given by the
-<code>Exception</code> argument of the template is invoked and the value it
-returns is propagated. So, if <code>Exception</code> is appropriately defined
-(for example it could throw an exception, hence the name of the argument),
-you can be sure no empty interval will ever be created. So
-<code>is_empty</code> will always return <code>false</code> (since there is
-no need to test for an empty interval). And as explained before, in that case
-we can also replace <code>nan</code> by an <code>assert(false)</code>; you
-will be sure no invalid number will ever be produced. If this template is not
-used, it implicitly means that all the functions can produce empty intervals
-and they correctly deal with empty interval arguments.</p>
+  <p>Next comes <code>checking_no_empty</code>. Using it means that each time
+  an empty interval should be produced (by <code>empty_lower</code> and
+  <code>empty_upper</code>), the function object given by the
+  <code>Exception</code> argument of the template is invoked and the value it
+  returns is propagated. So, if <code>Exception</code> is appropriately
+  defined (for example it could throw an exception, hence the name of the
+  argument), you can be sure no empty interval will ever be created. So
+  <code>is_empty</code> will always return <code>false</code> (since there is
+  no need to test for an empty interval). And as explained before, in that
+  case we can also replace <code>nan</code> by an <code>assert(false)</code>;
+  you will be sure no invalid number will ever be produced. If this template
+  is not used, it implicitly means that all the functions can produce empty
+  intervals and they correctly deal with empty interval arguments.</p>
 
-<p>Finally there are <code>checking_no_nan</code> and
-<code>checking_catch_nan</code>. The first one expresses the functions of the
-library will never get an invalid number as argument. So <code>is_nan</code>
-will only return <code>false</code>. The other one means the arguments can be
-an invalid number but in that case, <code>is_nan</code> will call the
-function object <code>Exception</code> and return <code>false</code>. Indeed,
-this template means invalid numbers should never make their way through to
-the body of the function. If none of this two templates is used, it
-implicitly means that all the functions can get invalid number arguments and
-they will correctly deal with them.</p>
+  <p>Finally there are <code>checking_no_nan</code> and
+  <code>checking_catch_nan</code>. The first one expresses the functions of
+  the library will never get an invalid number as argument. So
+  <code>is_nan</code> will only return <code>false</code>. The other one
+  means the arguments can be an invalid number but in that case,
+  <code>is_nan</code> will call the function object <code>Exception</code>
+  and return <code>false</code>. Indeed, this template means invalid numbers
+  should never make their way through to the body of the function. If none of
+  this two templates is used, it implicitly means that all the functions can
+  get invalid number arguments and they will correctly deal with them.</p>
 
-<p><code>exception_create_empty</code> throws <code>std::runtime_error</code>
-with the message <code>"boost::interval: empty interval created"</code> and
-<code>exception_invalid_number</code> throws
-<code>std::invalid_argument</code> with the message <code>"boost::interval:
-invalid number"</code>.</p>
+  <p><code>exception_create_empty</code> throws
+  <code>std::runtime_error</code> with the message <code>"boost::interval:
+  empty interval created"</code> and <code>exception_invalid_number</code>
+  throws <code>std::invalid_argument</code> with the message
+  <code>"boost::interval: invalid number"</code>.</p>
 
-<h2>Customizing your own checking policy</h2>
+  <h2>Customizing your own checking policy</h2>
 
-<p>In order to define a suitable policy, you need to correctly say what you
-expect from your interval class. First of all, are you interested in getting
-empty intervals at the end of a calculus? If you do not want to obtain empty
-intervals, <code>empty_lower</code> and <code>empty_upper</code> have to fail
-when invoked (they can throw an exception, set a flag, etc). However, if no
-function is able to produce an empty interval, it is no more necessary to do
-the test, so <code>is_empty</code> may always return <code>false</code>. In
-this case, a good compiler will do a lot of optimizations.</p>
+  <p>In order to define a suitable policy, you need to correctly say what you
+  expect from your interval class. First of all, are you interested in
+  getting empty intervals at the end of a calculus? If you do not want to
+  obtain empty intervals, <code>empty_lower</code> and
+  <code>empty_upper</code> have to fail when invoked (they can throw an
+  exception, set a flag, etc). However, if no function is able to produce an
+  empty interval, it is no more necessary to do the test, so
+  <code>is_empty</code> may always return <code>false</code>. In this case, a
+  good compiler will do a lot of optimizations.</p>
 
-<p>You could also be interested in getting empty intervals at the end of the
-calculus. For example, if you need to transform an array of unsure values (or
-intervals) in a new array of intervals, you may not want to stop the
-conversion at the first encountered problem. So <code>empty_lower</code> and
-<code>empty_upper</code> need to return suitable values in order to define an
-empty interval (you can use an upper bound which is not greater or equal than
-the lower bound for example); and <code>is_empty</code> must be able to
-distinguish empty intervals from the valid intervals.</p>
+  <p>You could also be interested in getting empty intervals at the end of
+  the calculus. For example, if you need to transform an array of unsure
+  values (or intervals) in a new array of intervals, you may not want to stop
+  the conversion at the first encountered problem. So
+  <code>empty_lower</code> and <code>empty_upper</code> need to return
+  suitable values in order to define an empty interval (you can use an upper
+  bound which is not greater or equal than the lower bound for example); and
+  <code>is_empty</code> must be able to distinguish empty intervals from the
+  valid intervals.</p>
 
-<p>Another important question is: is it possible that some base numbers
-(objects of type <code>T</code>) are invalid? And if it is possible, are they
-allowed or not ? If it is not possible, no test is necessary;
-<code>is_nan</code> may always return <code>false</code>. In this case too, a
-good compiler will do a lot of optimizations. If function arguments can hold
-invalid numbers, two cases must be considered according to whether they are
-allowed or not. If they are allowed, <code>is_nan</code> just has to test if
-they are invalid or not. If they are forbidden, <code>is_nan</code> should
-fail (exception, assert, etc.) when invoked on an invalid argument and return
-<code>false</code> otherwise. The value returned by <code>nan</code> does not
-have any interest since the interval functions are guaranteed not to produce
-invalid interval bounds unless the user passes invalid numbers to the
-constructors. So you can put an assert inside if you do not trust the
-library. :-)</p>
+  <p>Another important question is: is it possible that some base numbers
+  (objects of type <code>T</code>) are invalid? And if it is possible, are
+  they allowed or not ? If it is not possible, no test is necessary;
+  <code>is_nan</code> may always return <code>false</code>. In this case too,
+  a good compiler will do a lot of optimizations. If function arguments can
+  hold invalid numbers, two cases must be considered according to whether
+  they are allowed or not. If they are allowed, <code>is_nan</code> just has
+  to test if they are invalid or not. If they are forbidden,
+  <code>is_nan</code> should fail (exception, assert, etc.) when invoked on
+  an invalid argument and return <code>false</code> otherwise. The value
+  returned by <code>nan</code> does not have any interest since the interval
+  functions are guaranteed not to produce invalid interval bounds unless the
+  user passes invalid numbers to the constructors. So you can put an assert
+  inside if you do not trust the library. :-)</p>
 
-<p>And finally, you need to decide what to do with <code>nan</code> if it has
-not already been decided at the beginning, and with <code>pos_inf</code> and
-<code>neg_inf</code>. These functions should return a value or start an
-exceptional behavior (especially if the base type does not have corresponding
-values).</p>
+  <p>And finally, you need to decide what to do with <code>nan</code> if it
+  has not already been decided at the beginning, and with
+  <code>pos_inf</code> and <code>neg_inf</code>. These functions should
+  return a value or start an exceptional behavior (especially if the base
+  type does not have corresponding values).</p>
 
-<h2>Some examples</h2>
-<ul>
-  <li>If you need a checking policy that allows the library to correctly
+  <h2>Some examples</h2>
+
+  <ul>
+    <li>If you need a checking policy that allows the library to correctly
     manipulate data, even if they contain invalid numbers and empty
-    intervals, then <code>checking_base&lt;T&gt;</code> is a possibility.</li>
-  <li>If you do not want empty intervals to be created and are not sure all
+    intervals, then <code>checking_base&lt;T&gt;</code> is a
+    possibility.</li>
+
+    <li>If you do not want empty intervals to be created and are not sure all
     the numbers are valid, then <code>checking_catch_nan&lt;T,
     checking_no_empty&lt;T&gt; &gt;</code> can help you.</li>
-  <li>If all the numbers will be valid and if no empty interval is supposed
+
+    <li>If all the numbers will be valid and if no empty interval is supposed
     to be created (or if you do not want them to be created), then you can
     use <code>checking_no_nan&lt;T, checking_no_empty&lt;T&gt; &gt;</code>.
     Please note that if <code>T</code> does not have a way to represent
     invalid numbers, then this policy will behave the same way as
     <code>checking_no_empty&lt;T&gt;</code>. This is the default policy and
     it is also called <code>interval_lib::checking_strict</code>.</li>
-  <li>If all numerical data are valid but the algorithm can produce and
+
+    <li>If all numerical data are valid but the algorithm can produce and
     manipulate empty intervals, then <code>checking_no_nan&lt;T&gt;</code>
     should be used.</li>
-  <li>Similarly, if invalid data have to be signaled and the algorithm can
+
+    <li>Similarly, if invalid data have to be signaled and the algorithm can
     manipulate empty intervals, the <code>checking_catch_nan&lt;T&gt;</code>
     is a solution.</li>
-  <li>If you do not mind having undefined results when an empty interval or
+
+    <li>If you do not mind having undefined results when an empty interval or
     an interval number is produced, your best bet is to create your own
     policy by overloading <code>checking_base</code> and modifying
     <code>is_nan</code> et <code>is_empty</code> in order for them to always
     return <code>false</code>. It is probably the fastest checking policy
     available; however, it suffers from its deficient security.</li>
-</ul>
-<hr>
+  </ul>
+  <hr>
 
-<p>Revised: 2004-02-16<br>
-Copyright (c) Guillaume Melquiond, Sylvain Pion, Hervé Brönnimann, 2002.
-Polytechnic University.<br>
-Copyright (c) Guillaume Melquiond, 2003-2004.</p>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y-%m-%d" startspan -->2006-12-24<!--webbot bot="Timestamp" endspan i-checksum="12172" --></p>
+
+  <p><i>Copyright &copy; 2002 Guillaume Melquiond, Sylvain Pion, Herv&eacute;
+  Br&ouml;nnimann, Polytechnic University<br>
+  Copyright &copy; 2003-2004 Guillaume Melquiond</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/numeric/interval/doc/comparisons.htm
===================================================================
--- boost/trunk/libs/numeric/interval/doc/comparisons.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/interval/doc/comparisons.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,79 +1,90 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
-    "http://www.w3.org/TR/html4/loose.dtd">
+"http://www.w3.org/TR/html4/loose.dtd">
+
 <html>
 <head>
-  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
   <link rel="stylesheet" type="text/css" href="../../../../boost.css">
+
   <title>Comparisons</title>
 </head>
 
 <body>
-<h1>Comparisons</h1>
+  <h1>Comparisons</h1>
 
-<p>As was said before, the definition of the comparison operators induces a
-slight problem. There are many ways to define them, depending of the return
-type or the expected order. It is the reason why the meaning of the operators
-is not fixed once and for all.</p>
+  <p>As was said before, the definition of the comparison operators induces a
+  slight problem. There are many ways to define them, depending of the return
+  type or the expected order. It is the reason why the meaning of the
+  operators is not fixed once and for all.</p>
 
-<p>The way the operators are defined could have been influenced by a policy,
-as it is already the case for the rounding and the checking. However,
-comparisons are more an external property of the the class rather than an
-internal one. They are meant to be locally modified, independantly of the
-type of the intervals.</p>
+  <p>The way the operators are defined could have been influenced by a
+  policy, as it is already the case for the rounding and the checking.
+  However, comparisons are more an external property of the the class rather
+  than an internal one. They are meant to be locally modified, independantly
+  of the type of the intervals.</p>
 
-<p>The operators <code>&lt;</code>, <code>&lt;=</code>, <code>&gt;</code>,
-<code>&gt;=</code>, <code>==</code>, <code>!=</code> are defined each time;
-and like the arithmetic operators they can take an argument of the base type.
-However, due to technical limitations, this base type can only be the second
-argument; so the operators are unfortunately not fully symmetric. The return
-type is not always <code>bool</code>, since some interesting results can be
-achieved by using a tri-state return type. So here is the common signatures
-of the operators:</p>
-<pre>template&lt;class T, class Policies1, class Policies2&gt;
+  <p>The operators <code>&lt;</code>, <code>&lt;=</code>, <code>&gt;</code>,
+  <code>&gt;=</code>, <code>==</code>, <code>!=</code> are defined each time;
+  and like the arithmetic operators they can take an argument of the base
+  type. However, due to technical limitations, this base type can only be the
+  second argument; so the operators are unfortunately not fully symmetric.
+  The return type is not always <code>bool</code>, since some interesting
+  results can be achieved by using a tri-state return type. So here is the
+  common signatures of the operators:</p>
+  <pre>
+template&lt;class T, class Policies1, class Policies2&gt;
 return_type operator== (const interval&lt;T, Policies1&gt;&amp;, const interval&lt;T, Policies2&gt;&amp;);
 
 template&lt;class T, class Policies&gt;
-return_type operator== (const interval&lt;T, Policies&gt;&amp;, const T&amp;);</pre>
+return_type operator== (const interval&lt;T, Policies&gt;&amp;, const T&amp;);
+</pre>
 
-<h2>vided comparisons</h2>
+  <h2>vided comparisons</h2>
 
-<h3>Default comparison</h3>
+  <h3>Default comparison</h3>
 
-<p>If nothing is specified, the meaning of the comparison operators are an
-extension of the operator on the base type. More precisely, if one of the
-argument is invalid or empty, an exception is thrown. If the arguments are
-valid, the following rules are applied to determine the result of
-[<i>a</i>,<i>b</i>] <code>op</code>  [<i>c</i>,<i>d</i>] (just consider
-<i>c</i> <code>==</code> <i>d</i> if the second argument is of type
-<code>T</code>):</p>
-<ul>
-  <li>if &#x2200; <i>x</i> &#x2208; [<i>a</i>,<i>b</i>] &#x2200; <i>y</i>
-    &#x2208; [<i>c</i>,<i>d</i>] <code>(</code><i>x</i> <code>op</code>
+  <p>If nothing is specified, the meaning of the comparison operators are an
+  extension of the operator on the base type. More precisely, if one of the
+  argument is invalid or empty, an exception is thrown. If the arguments are
+  valid, the following rules are applied to determine the result of
+  [<i>a</i>,<i>b</i>] <code>op</code> [<i>c</i>,<i>d</i>] (just consider
+  <i>c</i> <code>==</code> <i>d</i> if the second argument is of type
+  <code>T</code>):</p>
+
+  <ul>
+    <li>if &forall; <i>x</i> &isin; [<i>a</i>,<i>b</i>] &forall; <i>y</i>
+    &isin; [<i>c</i>,<i>d</i>] <code>(</code><i>x</i> <code>op</code>
     y<code>)</code>, then <code>true</code></li>
-  <li>if &#x2200; <i>x</i> &#x2208; [<i>a</i>,<i>b</i>] &#x2200; <i>y</i>
-    &#x2208; [<i>c</i>,<i>d</i>] <code>!(</code><i>x</i> <code>op</code>
+
+    <li>if &forall; <i>x</i> &isin; [<i>a</i>,<i>b</i>] &forall; <i>y</i>
+    &isin; [<i>c</i>,<i>d</i>] <code>!(</code><i>x</i> <code>op</code>
     y<code>)</code>, then <code>false</code></li>
-  <li>otherwise throw an exception.</li>
-</ul>
 
-<p>This comparison allows to replace base types by interval types without
-changing the meaning of a program. Indeed, if no exception is thrown, the
-result is the same as before; and if an exception is thrown, the previous
-comparison was unsure and should have been rewritten.</p>
+    <li>otherwise throw an exception.</li>
+  </ul>
 
-<h3>Other comparisons</h3>
+  <p>This comparison allows to replace base types by interval types without
+  changing the meaning of a program. Indeed, if no exception is thrown, the
+  result is the same as before; and if an exception is thrown, the previous
+  comparison was unsure and should have been rewritten.</p>
 
-<p>The other comparisons are selected by using a namespace. These namespaces
-are located under <code>boost::numeric::interval_lib::compare</code> and are
-invoked by:</p>
-<pre>using namespace boost::numeric::interval_lib::compare::the_comparison_to_select;</pre>
+  <h3>Other comparisons</h3>
 
-<p>After this line, the default meaning of the operators will have been
-replaced by the meaning located in the namespace. Please note that because of
-C++ lookup rules, it is not possible to use two namespaces one after another
-and they must be used in different block hierarchies. Otherwise the compiler
-will complain about ambiguous operators. To summarize:</p>
-<pre>// example 1: BAD
+  <p>The other comparisons are selected by using a namespace. These
+  namespaces are located under
+  <code>boost::numeric::interval_lib::compare</code> and are invoked by:</p>
+  <pre>
+using namespace boost::numeric::interval_lib::compare::the_comparison_to_select;
+</pre>
+
+  <p>After this line, the default meaning of the operators will have been
+  replaced by the meaning located in the namespace. Please note that because
+  of C++ lookup rules, it is not possible to use two namespaces one after
+  another and they must be used in different block hierarchies. Otherwise the
+  compiler will complain about ambiguous operators. To summarize:</p>
+  <pre>
+// example 1: BAD
 using namespace compare1;
 ...
 using namespace compare2;
@@ -89,42 +100,46 @@
 using namespace compare1;
 ...
 { using namespace compare2;
-  ...                       }</pre>
+  ...                       }
+</pre>
 
-<p>Now comes the list of the provided comparisons. They all are located in
-their respective header files under
-<code>&lt;boost/numeric/interval/compare/...&gt;</code>. And as for the
-default comparison, the operators will generally complain by throwing an
-exception if feed by invalid values.</p>
-<ul>
-  <li><code>certain</code>: this comparison is equivalent to the default
+  <p>Now comes the list of the provided comparisons. They all are located in
+  their respective header files under
+  <code>&lt;boost/numeric/interval/compare/...&gt;</code>. And as for the
+  default comparison, the operators will generally complain by throwing an
+  exception if feed by invalid values.</p>
+
+  <ul>
+    <li><code>certain</code>: this comparison is equivalent to the default
     scheme with the exceptional case mapped to <code>false</code>. So these
     operators answer <code>true</code> only when the comparison is verified
     for all pairs of elements.</li>
-  <li><code>possible</code>: this time, the exceptional case is mapped to
+
+    <li><code>possible</code>: this time, the exceptional case is mapped to
     <code>true</code>. The operators answer <code>true</code> as soon as the
-    comparison is verified for a pair of elements.<br>
-  </li>
-  <li><code>lexicographic</code>: the lexicographic order (the lower bounds
+    comparison is verified for a pair of elements.<br></li>
+
+    <li><code>lexicographic</code>: the lexicographic order (the lower bounds
     are first compared, and if it is not enough to know the result, the upper
     bounds are then compared). This order does not have a meaning in interval
     arithmetic. However, since it is the natural total order on pair of
     (totally ordered) numbers, it may be handy in some cases.</li>
-  <li><code>set</code>: the set inclusion partial order. This time, an empty
-    interval is not considered to be invalid (but an invalid number is still
-    invalid). <code>&lt;=</code> and <code>&lt;</code> are the subset and
-    proper subset relations; and <code>&gt;=</code> and <code>&gt;</code> are
-    the superset and proper superset relations.</li>
-  <li><code>tribool</code>: this comparison relies on the Boost tristate
+
+    <li><code>set</code>: the set inclusion partial order. This time, an
+    empty interval is not considered to be invalid (but an invalid number is
+    still invalid). <code>&lt;=</code> and <code>&lt;</code> are the subset
+    and proper subset relations; and <code>&gt;=</code> and <code>&gt;</code>
+    are the superset and proper superset relations.</li>
+
+    <li><code>tribool</code>: this comparison relies on the Boost tristate
     boolean library and changes the default operators so that an explicit
     indeterminate value is returned in the third case instead of throwing an
     exception.</li>
-</ul>
+  </ul>
 
-<h3>Exception</h3>
-
-<p></p>
-<pre>namespace boost {
+  <h3>Exception</h3>
+  <pre>
+namespace boost {
 namespace numeric {
 namespace interval_lib {
 
@@ -132,24 +147,26 @@
 
 } // namespace interval_lib
 } // namespace numeric
-} // namespace boost</pre>
+} // namespace boost
+</pre>
 
-<h2>Explicit comparison functions</h2>
+  <h2>Explicit comparison functions</h2>
 
-<p>In some situation, you may want to perform direct comparisons on the
-bounds and avoid the indeterminate case that appears with default operators.
-Some functions are provided for this purpose. They expect their arguments to
-be valid and return a result after only one comparison. Their names are
-composed by <code>cer</code> (for "certain", if the default comparison is
-true, the result is true) or <code>pos</code> (for "possible", if the default
-comparison is false, the result is false) followed by <code>lt</code>,
-<code>le</code>, <code>gt</code>, <code>ge</code>, <code>eq</code> or
-<code>ne</code>. They are located in
-<code>&lt;boost/numeric/interval/compare/explicit.hpp&gt;</code>. Each of
-these functions takes two parameters and returns a boolean; the parameters
-are expected to be valid, undefined behavior may result otherwise. For
-example, the definition of the "certainly less than" comparison is:</p>
-<pre>namespace boost {
+  <p>In some situation, you may want to perform direct comparisons on the
+  bounds and avoid the indeterminate case that appears with default
+  operators. Some functions are provided for this purpose. They expect their
+  arguments to be valid and return a result after only one comparison. Their
+  names are composed by <code>cer</code> (for "certain", if the default
+  comparison is true, the result is true) or <code>pos</code> (for
+  "possible", if the default comparison is false, the result is false)
+  followed by <code>lt</code>, <code>le</code>, <code>gt</code>,
+  <code>ge</code>, <code>eq</code> or <code>ne</code>. They are located in
+  <code>&lt;boost/numeric/interval/compare/explicit.hpp&gt;</code>. Each of
+  these functions takes two parameters and returns a boolean; the parameters
+  are expected to be valid, undefined behavior may result otherwise. For
+  example, the definition of the "certainly less than" comparison is:</p>
+  <pre>
+namespace boost {
 namespace numeric {
 namespace interval_lib {
 
@@ -164,12 +181,24 @@
 
 } // namespace interval_lib
 } // namespace numeric
-} // namespace boost</pre>
-<hr>
+} // namespace boost
+</pre>
+  <hr>
 
-<p>Revised: 2003-04-22<br>
-Copyright (c) Guillaume Melquiond, Sylvain Pion, Hervé Brönnimann, 2002.
-Polytechnic University.<br>
-Copyright (c) Guillaume Melquiond, 2003.</p>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y-%m-%d" startspan -->2006-12-24<!--webbot bot="Timestamp" endspan i-checksum="12172" --></p>
+
+  <p><i>Copyright &copy; 2002 Guillaume Melquiond, Sylvain Pion, Herv&eacute;
+  Br&ouml;nnimann, Polytechnic University<br>
+  Copyright &copy; 2003 Guillaume Melquiond</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/numeric/interval/doc/examples.htm
===================================================================
--- boost/trunk/libs/numeric/interval/doc/examples.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/interval/doc/examples.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,69 +1,84 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
-    "http://www.w3.org/TR/html4/loose.dtd">
+"http://www.w3.org/TR/html4/loose.dtd">
+
 <html>
 <head>
-  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
   <link rel="stylesheet" type="text/css" href="../../../../boost.css">
+
   <title>Tests and Examples</title>
 </head>
 
 <body lang="en">
-<h1>Tests and Examples</h1>
+  <h1>Tests and Examples</h1>
 
-<h2>A first example</h2>
+  <h2>A first example</h2>
 
-<p>This example shows how to design a function which takes a polynomial and a
-value and returns the sign of this polynomial at this point. This function is
-a filter: if the answer is not guaranteed, the functions says so. The reason
-of using a filter rather than a simple evaluation function is: computations
-with floating-point numbers will incur approximations and it can be enough to
-change the sign of the polynomial. So, in order to validate the result, the
-function will use interval arithmetic.</p>
+  <p>This example shows how to design a function which takes a polynomial and
+  a value and returns the sign of this polynomial at this point. This
+  function is a filter: if the answer is not guaranteed, the functions says
+  so. The reason of using a filter rather than a simple evaluation function
+  is: computations with floating-point numbers will incur approximations and
+  it can be enough to change the sign of the polynomial. So, in order to
+  validate the result, the function will use interval arithmetic.</p>
 
-<p>The first step is the inclusion of the appropriate headers. Because the
-function will handle floating-point bounds, the easiest solution is:</p>
-<pre>#include &lt;boost/numeric/interval.hpp&gt;</pre>
+  <p>The first step is the inclusion of the appropriate headers. Because the
+  function will handle floating-point bounds, the easiest solution is:</p>
+  <pre>
+#include &lt;boost/numeric/interval.hpp&gt;
+</pre>
 
-<p>Now, let's begin the function. The polynomial is given by the array of its
-coefficients and its size (strictly greater to its degree). In order to
-simplify the code, two namespaces of the library are included.</p>
-<pre>int sign_polynomial(double x, double P[], int sz) {
+  <p>Now, let's begin the function. The polynomial is given by the array of
+  its coefficients and its size (strictly greater to its degree). In order to
+  simplify the code, two namespaces of the library are included.</p>
+  <pre>
+int sign_polynomial(double x, double P[], int sz) {
   using namespace boost::numeric;
-  using namespace interval_lib;</pre>
+  using namespace interval_lib;
+</pre>
 
-<p>Then we can define the interval type. Since no special behavior is
-required, the default policies are enough:</p>
-<pre>  typedef interval&lt;double&gt; I;</pre>
+  <p>Then we can define the interval type. Since no special behavior is
+  required, the default policies are enough:</p>
+  <pre>
+  typedef interval&lt;double&gt; I;
+</pre>
 
-<p>For the evaluation, let's just use the Horner scheme with interval
-arithmetic. The library overloads all the arithmetic operators and provides
-mixed operations, so the only difference between the code with and without
-interval arithmetic lies in the type of the iterated value <code>y</code>:</p>
-<pre>  I y = P[sz - 1];
+  <p>For the evaluation, let's just use the Horner scheme with interval
+  arithmetic. The library overloads all the arithmetic operators and provides
+  mixed operations, so the only difference between the code with and without
+  interval arithmetic lies in the type of the iterated value
+  <code>y</code>:</p>
+  <pre>
+  I y = P[sz - 1];
   for(int i = sz - 2; i &gt;= 0; i--)
-    y = y * x + P[i];</pre>
+    y = y * x + P[i];
+</pre>
 
-<p>The last step is the computation of the sign of <code>y</code>. It is done
-by choosing an appropriate comparison scheme and then doing the comparison
-with the usual operators:</p>
-<pre>  using namespace compare::certain;
+  <p>The last step is the computation of the sign of <code>y</code>. It is
+  done by choosing an appropriate comparison scheme and then doing the
+  comparison with the usual operators:</p>
+  <pre>
+  using namespace compare::certain;
   if (y &gt; 0.) return 1;
   if (y &lt; 0.) return -1;
   return 0;
-}</pre>
+}
+</pre>
 
-<p>The answer <code>0</code> does not mean the polynomial is zero at this
-point. It only means the answer is not known since <code>y</code> contains
-zero and thus does not have a precise sign.</p>
+  <p>The answer <code>0</code> does not mean the polynomial is zero at this
+  point. It only means the answer is not known since <code>y</code> contains
+  zero and thus does not have a precise sign.</p>
 
-<p>Now we have the expected function. However, due to the poor
-implementations of floating-point rounding in most of the processors, it can
-be useful to say to optimize the code; or rather, to let the library optimize
-it. The main condition for this optimization is that the interval code should
-not be mixed with floating-point code. In this example, it is the case, since
-all the operations done in the functions involve the library. So the code can
-be rewritten:</p>
-<pre>int sign_polynomial(double x, double P[], int sz) {
+  <p>Now we have the expected function. However, due to the poor
+  implementations of floating-point rounding in most of the processors, it
+  can be useful to say to optimize the code; or rather, to let the library
+  optimize it. The main condition for this optimization is that the interval
+  code should not be mixed with floating-point code. In this example, it is
+  the case, since all the operations done in the functions involve the
+  library. So the code can be rewritten:</p>
+  <pre>
+int sign_polynomial(double x, double P[], int sz) {
   using namespace boost::numeric;
   using namespace interval_lib;
   typedef interval&lt;double&gt; I_aux;
@@ -79,105 +94,118 @@
   if (y &gt; 0.) return 1;
   if (y &lt; 0.) return -1;
   return 0;
-}</pre>
+}
+</pre>
 
-<p>The difference between this code and the previous is the use of another
-interval type. This new type <code>I</code> indicates to the library that all
-the computations can be done without caring for the rounding mode. And
-because of that, it is up to the function to care about it: a rounding object
-need to be alive whenever the optimized type is used.</p>
+  <p>The difference between this code and the previous is the use of another
+  interval type. This new type <code>I</code> indicates to the library that
+  all the computations can be done without caring for the rounding mode. And
+  because of that, it is up to the function to care about it: a rounding
+  object need to be alive whenever the optimized type is used.</p>
 
-<h2>Other tests and examples</h2>
+  <h2>Other tests and examples</h2>
 
-<p>In <code>libs/numeric/interval/test/</code> and
-<code>libs/numeric/interval/examples/</code> are some test and example
-programs.. The examples illustrate a few uses of intervals. For a general
-description and considerations on using this library, and some potential
-domains of application, please read this <a
-href="guide.htm">mini-guide</a>.</p>
+  <p>In <code>libs/numeric/interval/test/</code> and
+  <code>libs/numeric/interval/examples/</code> are some test and example
+  programs.. The examples illustrate a few uses of intervals. For a general
+  description and considerations on using this library, and some potential
+  domains of application, please read this <a href=
+  "guide.htm">mini-guide</a>.</p>
 
-<h3>Tests</h3>
+  <h3>Tests</h3>
 
-<p>The test programs are as follows. Please note that they require the use of
-the Boost.test library and can be automatically tested by using
-<code>bjam</code> (except for interval_test.cpp).</p>
+  <p>The test programs are as follows. Please note that they require the use
+  of the Boost.test library and can be automatically tested by using
+  <code>bjam</code> (except for interval_test.cpp).</p>
 
-<p><b>add.cpp</b> tests if the additive and subtractive operators and the
-respective _std and _opp rounding functions are correctly implemented. It is
-done by using symbolic expressions as a base type.</p>
+  <p><b>add.cpp</b> tests if the additive and subtractive operators and the
+  respective _std and _opp rounding functions are correctly implemented. It
+  is done by using symbolic expressions as a base type.</p>
 
-<p><b>cmp.cpp</b>, <b>cmp_lex.cpp</b>, <b>cmp_set.cpp</b>, and
-<b>cmp_tribool.cpp</b> test if the operators <code>&lt;</code>
-<code>&gt;</code> <code>&lt;=</code> <code>&gt;=</code> <code>==</code>
-<code>!=</code> behave correctly for the default, lexicographic, set, and
-tristate comparisons. <b>cmp_exp.cpp</b> tests the explicit comparison
-functions <code>cer..</code> and <code>pos..</code> behave correctly.
-<b>cmp_exn.cpp</b> tests if the various policies correctly detect exceptional
-cases. All these tests use some simple intervals ([1,2] and [3,4], [1,3] and
-[2,4], [1,2] and [2,3], etc).</p>
+  <p><b>cmp.cpp</b>, <b>cmp_lex.cpp</b>, <b>cmp_set.cpp</b>, and
+  <b>cmp_tribool.cpp</b> test if the operators <code>&lt;</code>
+  <code>&gt;</code> <code>&lt;=</code> <code>&gt;=</code> <code>==</code>
+  <code>!=</code> behave correctly for the default, lexicographic, set, and
+  tristate comparisons. <b>cmp_exp.cpp</b> tests the explicit comparison
+  functions <code>cer..</code> and <code>pos..</code> behave correctly.
+  <b>cmp_exn.cpp</b> tests if the various policies correctly detect
+  exceptional cases. All these tests use some simple intervals ([1,2] and
+  [3,4], [1,3] and [2,4], [1,2] and [2,3], etc).</p>
 
-<p><b>det.cpp</b> tests if the <code>_std</code> and <code>_opp</code>
-versions in protected and unprotected mode produce the same result when Gauss
-scheme is used on an unstable matrix (in order to exercise rounding). The
-tests are done for <code>interval&lt;float&gt;</code> and
-<code>interval&lt;double&gt;</code>.</p>
+  <p><b>det.cpp</b> tests if the <code>_std</code> and <code>_opp</code>
+  versions in protected and unprotected mode produce the same result when
+  Gauss scheme is used on an unstable matrix (in order to exercise rounding).
+  The tests are done for <code>interval&lt;float&gt;</code> and
+  <code>interval&lt;double&gt;</code>.</p>
 
-<p><b>fmod.cpp</b> defines a minimalistic version of
-<code>interval&lt;int&gt;</code> and uses it in order to test
-<code>fmod</code> on some specific interval values.</p>
+  <p><b>fmod.cpp</b> defines a minimalistic version of
+  <code>interval&lt;int&gt;</code> and uses it in order to test
+  <code>fmod</code> on some specific interval values.</p>
 
-<p><b>mul.cpp</b> exercises the multiplication, the finite division, the
-square and the square root with some integer intervals leading to exact
-results.</p>
+  <p><b>mul.cpp</b> exercises the multiplication, the finite division, the
+  square and the square root with some integer intervals leading to exact
+  results.</p>
 
-<p><b>pi.cpp</b> tests if the interval value of &#x3c0; (for
-<code>int</code>, <code>float</code> and <code>double</code> base types)
-contains the number &#x3c0; (defined with 21 decimal digits) and if it is a
-subset of [&#x3c0;±1ulp] (in order to ensure some precision).</p>
+  <p><b>pi.cpp</b> tests if the interval value of &pi; (for <code>int</code>,
+  <code>float</code> and <code>double</code> base types) contains the number
+  &pi; (defined with 21 decimal digits) and if it is a subset of
+  [&pi;&plusmn;1ulp] (in order to ensure some precision).</p>
 
-<p><b>pow.cpp</b> tests if the <code>pow</code> function behaves correctly on
-some simple test cases.</p>
+  <p><b>pow.cpp</b> tests if the <code>pow</code> function behaves correctly
+  on some simple test cases.</p>
 
-<p><b>test_float.cpp</b> exercises the arithmetic operations of the library
-for floating point base types.</p>
+  <p><b>test_float.cpp</b> exercises the arithmetic operations of the library
+  for floating point base types.</p>
 
-<p><b>interval_test.cpp</b> tests if the interval library respects the
-inclusion property of interval arithmetic by computing some functions and
-operations for both <code>double</code> and
-<code>interval&lt;double&gt;</code>.</p>
+  <p><b>interval_test.cpp</b> tests if the interval library respects the
+  inclusion property of interval arithmetic by computing some functions and
+  operations for both <code>double</code> and
+  <code>interval&lt;double&gt;</code>.</p>
 
-<h2>Examples</h2>
+  <h2>Examples</h2>
 
-<p><b>filter.cpp</b> contains filters for computational geometry able to find
-the sign of a determinant. This example is inspired by the article
-<em>Interval arithmetic yields efficient dynamic filters for computational
-geometry</em> by Brönnimann, Burnikel and Pion, 2001.</p>
+  <p><b>filter.cpp</b> contains filters for computational geometry able to
+  find the sign of a determinant. This example is inspired by the article
+  <em>Interval arithmetic yields efficient dynamic filters for computational
+  geometry</em> by Br&ouml;nnimann, Burnikel and Pion, 2001.</p>
 
-<p><b>findroot_demo.cpp</b> finds zeros of some functions by using dichotomy
-and even produces gnuplot data for one of them. The processor has to
-correctly handle elementary functions for this example to properly work.</p>
+  <p><b>findroot_demo.cpp</b> finds zeros of some functions by using
+  dichotomy and even produces gnuplot data for one of them. The processor has
+  to correctly handle elementary functions for this example to properly
+  work.</p>
 
-<p><b>horner.cpp</b> is a really basic example of unprotecting the interval
-operations for a whole function (which computes the value of a polynomial by
-using Horner scheme).</p>
+  <p><b>horner.cpp</b> is a really basic example of unprotecting the interval
+  operations for a whole function (which computes the value of a polynomial
+  by using Horner scheme).</p>
 
-<p><b>io.cpp</b> shows some stream input and output operators for intervals
-.The wide variety of possibilities explains why the library do not implement
-i/o operators and they are left to the user.</p>
+  <p><b>io.cpp</b> shows some stream input and output operators for intervals
+  .The wide variety of possibilities explains why the library do not
+  implement i/o operators and they are left to the user.</p>
 
-<p><b>newton-raphson.cpp</b> is an implementation of a specialized version of
-Newton-Raphson algorithm for finding the zeros of a function knowing its
-derivative. It exercises unprotecting, full division, some set operations and
-empty intervals.</p>
+  <p><b>newton-raphson.cpp</b> is an implementation of a specialized version
+  of Newton-Raphson algorithm for finding the zeros of a function knowing its
+  derivative. It exercises unprotecting, full division, some set operations
+  and empty intervals.</p>
 
-<p><b>transc.cpp</b> implements the transcendental part of the rounding
-policy for <code>double</code> by using an external library (the MPFR subset
-of GMP in this case).</p>
-<hr>
+  <p><b>transc.cpp</b> implements the transcendental part of the rounding
+  policy for <code>double</code> by using an external library (the MPFR
+  subset of GMP in this case).</p>
+  <hr>
 
-<p>Revised: 2003-08-16<br>
-Copyright (c) Guillaume Melquiond, Sylvain Pion, Hervé Brönnimann, 2002.
-Polytechnic University.<br>
-Copyright (c) Guillaume Melquiond, 2003.</p>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y-%m-%d" startspan -->2006-12-24<!--webbot bot="Timestamp" endspan i-checksum="12172" --></p>
+
+  <p><i>Copyright &copy; 2002 Guillaume Melquiond, Sylvain Pion, Herv&eacute;
+  Br&ouml;nnimann, Polytechnic University<br>
+  Copyright &copy; 2003 Guillaume Melquiond</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/numeric/interval/doc/guide.htm
===================================================================
--- boost/trunk/libs/numeric/interval/doc/guide.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/interval/doc/guide.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,108 +1,122 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
-    "http://www.w3.org/TR/html4/loose.dtd">
+"http://www.w3.org/TR/html4/loose.dtd">
+
 <html>
 <head>
-  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
   <link rel="stylesheet" type="text/css" href="../../../../boost.css">
+
   <title>Choosing Your Own Interval Type</title>
 </head>
 
 <body lang="en">
-<h1>Choosing Your Own Interval Type</h1>
+  <h1>Choosing Your Own Interval Type</h1>
 
-<p>First of all, you need to select your base type. In order to obtain an
-useful interval type, the numbers should respect some requirements. Please
-refer to <a href="numbers.htm">this page</a> in order to see them. When your
-base type is robust enough, you can go to the next step: the choice of the
-policies.</p>
+  <p>First of all, you need to select your base type. In order to obtain an
+  useful interval type, the numbers should respect some requirements. Please
+  refer to <a href="numbers.htm">this page</a> in order to see them. When
+  your base type is robust enough, you can go to the next step: the choice of
+  the policies.</p>
 
-<p>As you should already know if you did not come to this page by accident,
-the <code>interval</code> class expect a policies argument describing the <a
-href="rounding.htm">rounding</a> and <a href="checking.htm">checking</a>
-policies. The first thing to do is to verify if the default policies are or
-are not adapted to your case. If your base type is not <code>float</code>,
-<code>double</code>, or <code>long double</code>, the default rounding policy
-is probably not adapted. However, by specializing
-<code>interval_lib::rounded_math</code> to your base type, the default
-rounding policy will be suitable.</p>
+  <p>As you should already know if you did not come to this page by accident,
+  the <code>interval</code> class expect a policies argument describing the
+  <a href="rounding.htm">rounding</a> and <a href="checking.htm">checking</a>
+  policies. The first thing to do is to verify if the default policies are or
+  are not adapted to your case. If your base type is not <code>float</code>,
+  <code>double</code>, or <code>long double</code>, the default rounding
+  policy is probably not adapted. However, by specializing
+  <code>interval_lib::rounded_math</code> to your base type, the default
+  rounding policy will be suitable.</p>
 
-<p>The default policies define an interval type that performs precise
-computations (for <code>float</code>, <code>double</code>, <code>long
-double</code>), detects invalid numbers and throws exception each times an
-empty interval is created. This is a brief description and you should refer
-to the corresponding sections for a more precise description of the default
-policies. Unless you need some special behavior, this default type is usable
-in a lot of situations.</p>
+  <p>The default policies define an interval type that performs precise
+  computations (for <code>float</code>, <code>double</code>, <code>long
+  double</code>), detects invalid numbers and throws exception each times an
+  empty interval is created. This is a brief description and you should refer
+  to the corresponding sections for a more precise description of the default
+  policies. Unless you need some special behavior, this default type is
+  usable in a lot of situations.</p>
 
-<p>After having completely defined the interval type (and its policies), the
-only thing left to do is to verify that the constants are defined and
-<code>std::numeric_limits</code> is correct (if needed). Now you can use your
-brand new interval type.</p>
+  <p>After having completely defined the interval type (and its policies),
+  the only thing left to do is to verify that the constants are defined and
+  <code>std::numeric_limits</code> is correct (if needed). Now you can use
+  your brand new interval type.</p>
 
-<h2>Some Examples</h2>
+  <h2>Some Examples</h2>
 
-<h3>Solving systems</h3>
+  <h3>Solving systems</h3>
 
-<p>If you use the interval library in order to solve equation and inequation
-systems by bisection, something like
-<code>boost::interval&lt;double&gt;</code> is probably what you need. The
-computations are precise, and they may be fast if enclosed in a protected
-rounding mode block (see the <a href="rounding.htm#perf">performance</a>
-section). The comparison are "certain"; it is probably the most used type of
-comparison, and the other comparisons are still accessible by the explicit
-comparison functions. The checking forbid empty interval; they are not needed
-since there would be an empty interval at end of the computation if an empty
-interval is created during the computation, and no root would be inside. The
-checking also forbid invalid numbers (NaN for floating-point numbers). It can
-be a minor performance hit if you only use exact floating-point constants
-(which are clearly not NaNs); however, if performance really does matter, you
-will probably use a good compiler which knows how to inline functions and all
-these annoying little tests will magically disappear (if not, it is time to
-upgrade your compiler).</p>
+  <p>If you use the interval library in order to solve equation and
+  inequation systems by bisection, something like
+  <code>boost::interval&lt;double&gt;</code> is probably what you need. The
+  computations are precise, and they may be fast if enclosed in a protected
+  rounding mode block (see the <a href="rounding.htm#perf">performance</a>
+  section). The comparison are "certain"; it is probably the most used type
+  of comparison, and the other comparisons are still accessible by the
+  explicit comparison functions. The checking forbid empty interval; they are
+  not needed since there would be an empty interval at end of the computation
+  if an empty interval is created during the computation, and no root would
+  be inside. The checking also forbid invalid numbers (NaN for floating-point
+  numbers). It can be a minor performance hit if you only use exact
+  floating-point constants (which are clearly not NaNs); however, if
+  performance really does matter, you will probably use a good compiler which
+  knows how to inline functions and all these annoying little tests will
+  magically disappear (if not, it is time to upgrade your compiler).</p>
 
-<h3>Manipulating wide intervals</h3>
+  <h3>Manipulating wide intervals</h3>
 
-<p>You may want to use the library on intervals with imprecise bounds or on
-inexact numbers. In particular, it may be an existing algorithm that you want
-to rewrite and simplify by using the library. In that case, you are not
-really interested by the inclusion property; you are only interested by the
-computation algorithms the library provides. So you do not need to use any
-rounding; the checking also may not be useful. Use an "exact computation"
-rounding (you are allowed to think the name stangely applies to the
-situation) and a checking that never tests for any invalid numbers or empty
-intervals. By doing that, you will obtain library functions reduced to their
-minimum (an addition of two intervals will only be two additions of
-numbers).</p>
+  <p>You may want to use the library on intervals with imprecise bounds or on
+  inexact numbers. In particular, it may be an existing algorithm that you
+  want to rewrite and simplify by using the library. In that case, you are
+  not really interested by the inclusion property; you are only interested by
+  the computation algorithms the library provides. So you do not need to use
+  any rounding; the checking also may not be useful. Use an "exact
+  computation" rounding (you are allowed to think the name stangely applies
+  to the situation) and a checking that never tests for any invalid numbers
+  or empty intervals. By doing that, you will obtain library functions
+  reduced to their minimum (an addition of two intervals will only be two
+  additions of numbers).</p>
 
-<h3>Computing ranges</h3>
+  <h3>Computing ranges</h3>
 
-<p>The inputs of your program may be empty intervals or invalid values (for
-example, a database can allow undefined values in some field) and the core of
-your program could also do some non-arithmetic computations that do not
-always propagate empty intervals. For example, in the library, the
-<code>hull</code> function can happily receive an empty interval but not
-generate an empty interval if the other input is valid. The
-<code>intersect</code> function is also able to produce empty intervals if
-the intervals do not overlap. In that case, it is not really interesting if
-an exception is thrown each time an empty interval is produced or an invalid
-value is used; it would be better to generate and propagate empty intervals.
-So you need to change the checking policy to something like
-<code>interval_lib::checking_base&lt;T&gt;</code>.</p>
+  <p>The inputs of your program may be empty intervals or invalid values (for
+  example, a database can allow undefined values in some field) and the core
+  of your program could also do some non-arithmetic computations that do not
+  always propagate empty intervals. For example, in the library, the
+  <code>hull</code> function can happily receive an empty interval but not
+  generate an empty interval if the other input is valid. The
+  <code>intersect</code> function is also able to produce empty intervals if
+  the intervals do not overlap. In that case, it is not really interesting if
+  an exception is thrown each time an empty interval is produced or an
+  invalid value is used; it would be better to generate and propagate empty
+  intervals. So you need to change the checking policy to something like
+  <code>interval_lib::checking_base&lt;T&gt;</code>.</p>
 
-<h3>Switching interval types</h3>
+  <h3>Switching interval types</h3>
 
-<p>This example does not deal with a full case, but with a situation that can
-occur often. Sometimes, it can be useful to change the policies of an
-interval by converting it to another type. For example, this happens when you
-use an unprotected version of the interval type in order to speed up the
-computations; it is a change of the rounding policy. It also happens when you
-want to temporarily allow empty intervals to be created; it is a change of
-the checking policy. These changes should not be prohibited: they can greatly
-enhance a program (lisibility, interest, performance).</p>
-<hr>
+  <p>This example does not deal with a full case, but with a situation that
+  can occur often. Sometimes, it can be useful to change the policies of an
+  interval by converting it to another type. For example, this happens when
+  you use an unprotected version of the interval type in order to speed up
+  the computations; it is a change of the rounding policy. It also happens
+  when you want to temporarily allow empty intervals to be created; it is a
+  change of the checking policy. These changes should not be prohibited: they
+  can greatly enhance a program (lisibility, interest, performance).</p>
+  <hr>
 
-<p>Revised: 2003-01-15<br>
-Copyright (c) Guillaume Melquiond, Sylvain Pion, Hervé Brönnimann, 2002.<br>
-Polytechnic University.</p>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y-%m-%d" startspan -->2006-12-24<!--webbot bot="Timestamp" endspan i-checksum="12172" --></p>
+
+  <p><i>Copyright &copy; 2002 Guillaume Melquiond, Sylvain Pion, Herv&eacute;
+  Br&ouml;nnimann, Polytechnic University</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/numeric/interval/doc/includes.htm
===================================================================
--- boost/trunk/libs/numeric/interval/doc/includes.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/interval/doc/includes.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,198 +1,218 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
-    "http://www.w3.org/TR/html4/loose.dtd">
+"http://www.w3.org/TR/html4/loose.dtd">
+
 <html>
 <head>
-  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
   <link rel="stylesheet" type="text/css" href="../../../../boost.css">
+
   <title>Headers Inclusion</title>
 </head>
 
 <body lang="en">
-<h1>Headers Inclusion</h1>
+  <h1>Headers Inclusion</h1>
 
-<p>The easiest way to access to the library is by including the main
-header:</p>
-<pre>#include &lt;boost/numeric/interval.hpp&gt;</pre>
+  <p>The easiest way to access to the library is by including the main
+  header:</p>
+  <pre>
+#include &lt;boost/numeric/interval.hpp&gt;
+</pre>
 
-<p>This header will include almost all the other headers (except the ones
-listed as extensions). However, you may not want to access all the
-functionalities of the library. So this page stands as a reminder for the
-whole structure of the library.
-<code>&lt;boost/numeric/interval.hpp&gt;</code> is the only header to be
-located directly under <code>boost/numeric</code>; all the other headers are
-located in the subdirectory <code>boost/numeric/interval</code>. And each
-time this documentation will refer to <code>interval/something.hpp</code>, it
-is <code>&lt;boost/numeric/interval/something.hpp&gt;</code>.</p>
+  <p>This header will include almost all the other headers (except the ones
+  listed as extensions). However, you may not want to access all the
+  functionalities of the library. So this page stands as a reminder for the
+  whole structure of the library.
+  <code>&lt;boost/numeric/interval.hpp&gt;</code> is the only header to be
+  located directly under <code>boost/numeric</code>; all the other headers
+  are located in the subdirectory <code>boost/numeric/interval</code>. And
+  each time this documentation will refer to
+  <code>interval/something.hpp</code>, it is
+  <code>&lt;boost/numeric/interval/something.hpp&gt;</code>.</p>
 
-<p>Please also note that all the following headers are independent and can
-easily be pre-compiled if necessary (for compilers which support pre-compiled
-headers of course).</p>
+  <p>Please also note that all the following headers are independent and can
+  easily be pre-compiled if necessary (for compilers which support
+  pre-compiled headers of course).</p>
 
-<h2>Function definitions</h2>
+  <h2>Function definitions</h2>
 
-<p>The following headers contain the definition of the <code>interval</code>
-class and all the friendly functions and operators.</p>
+  <p>The following headers contain the definition of the
+  <code>interval</code> class and all the friendly functions and
+  operators.</p>
 
-<h3><code>interval/interval.hpp</code></h3>
+  <h3><code>interval/interval.hpp</code></h3>
 
-<p>This header contains the definition and the declaration of the
-<code>interval</code> class. However, this class is templated and the default
-template parameters are not available by this header. In particular, this
-header does not provide the default specialization of the
-<code>interval</code> class for the floating-point types
-(<code>interval&lt;float&gt;</code>, <code>interval&lt;double&gt;</code> and
-<code>interval&lt;long double&gt;</code>). So, unless you use your own
-policies, this header is not really useful on its own.</p>
+  <p>This header contains the definition and the declaration of the
+  <code>interval</code> class. However, this class is templated and the
+  default template parameters are not available by this header. In
+  particular, this header does not provide the default specialization of the
+  <code>interval</code> class for the floating-point types
+  (<code>interval&lt;float&gt;</code>, <code>interval&lt;double&gt;</code>
+  and <code>interval&lt;long double&gt;</code>). So, unless you use your own
+  policies, this header is not really useful on its own.</p>
 
-<h3><code>interval/utility.hpp</code></h3>
+  <h3><code>interval/utility.hpp</code></h3>
 
-<p>In this header are all the functions that do not expect any arithmetic
-property from the base number type. It only expects the bounds to be ordered;
-but it should not surprise you since it is a requirement of the whole
-library. You will find in this header the definitions of access and related
-functions: <code>lower</code>, <code>upper</code>,
-<code>checked_lower</code>, <code>checked_upper</code>, <code>median</code>,
-<code>width</code>, <code>widen</code>. There are also the set-like
-functions: <code>in,</code> <code>zero_in</code>, <code>empty</code>,
-<code>subset</code>, <code>proper_subset</code>, <code>overlap</code>,
-<code>singleton</code>, <code>equal</code>, <code>intersect</code>,
-<code>hull</code>, <code>bisect</code>. Finally, <code>abs</code>,
-<code>min</code> and <code>max</code> are defined.</p>
+  <p>In this header are all the functions that do not expect any arithmetic
+  property from the base number type. It only expects the bounds to be
+  ordered; but it should not surprise you since it is a requirement of the
+  whole library. You will find in this header the definitions of access and
+  related functions: <code>lower</code>, <code>upper</code>,
+  <code>checked_lower</code>, <code>checked_upper</code>,
+  <code>median</code>, <code>width</code>, <code>widen</code>. There are also
+  the set-like functions: <code>in,</code> <code>zero_in</code>,
+  <code>empty</code>, <code>subset</code>, <code>proper_subset</code>,
+  <code>overlap</code>, <code>singleton</code>, <code>equal</code>,
+  <code>intersect</code>, <code>hull</code>, <code>bisect</code>. Finally,
+  <code>abs</code>, <code>min</code>, and <code>max</code> are defined.</p>
 
-<h3><code>interval/arith.hpp</code></h3>
+  <h3><code>interval/arith.hpp</code></h3>
 
-<p>Here are the binary operators <code>+</code>, <code>-</code>,
-<code>*</code>, <code>/</code> and the unary operator <code>-</code>.</p>
+  <p>Here are the binary operators <code>+</code>, <code>-</code>,
+  <code>*</code>, <code>/</code> and the unary operator <code>-</code>.</p>
 
-<h3><code>interval/arith2.hpp</code></h3>
+  <h3><code>interval/arith2.hpp</code></h3>
 
-<p>This header defines <code>fmod</code>, <code>square</code>,
-<code>sqrt</code> and <code>pow</code>.</p>
+  <p>This header defines <code>fmod</code>, <code>square</code>,
+  <code>sqrt</code>, <code>pow</code>, and <code>root</code>.</p>
 
-<h3><code>interval/arith3.hpp</code></h3>
+  <h3><code>interval/arith3.hpp</code></h3>
 
-<p>The third arithmetic header: it provides the functions <code>add</code>,
-<code>sub</code>, <code>mul</code>, <code>div</code>. The type of their
-arguments is the base number type.</p>
+  <p>The third arithmetic header: it provides the functions <code>add</code>,
+  <code>sub</code>, <code>mul</code>, and <code>div</code>. The type of their
+  arguments is the base number type.</p>
 
-<h3><code>interval/transc.hpp</code></h3>
+  <h3><code>interval/transc.hpp</code></h3>
 
-<p>It is the last of the headers with mathematical functions; it provides the
-following functions: <code>cos</code>, <code>sin</code>, <code>tan</code>,
-<code>acos</code>, <code>asin</code>, <code>atan</code>, <code>cosh</code>,
-<code>sinh</code>, <code>tanh</code>, <code>acosh</code>, <code>asinh</code>,
-<code>atanh</code>, <code>exp</code> and <code>log</code>.</p>
+  <p>It is the last of the headers with mathematical functions; it provides
+  the following functions: <code>cos</code>, <code>sin</code>,
+  <code>tan</code>, <code>acos</code>, <code>asin</code>, <code>atan</code>,
+  <code>cosh</code>, <code>sinh</code>, <code>tanh</code>,
+  <code>acosh</code>, <code>asinh</code>, <code>atanh</code>,
+  <code>exp</code>, and <code>log</code>.</p>
 
-<h2>Policies</h2>
+  <h2>Policies</h2>
 
-<p>The following headers define some policies. They may be needed if you use
-the default policies.</p>
+  <p>The following headers define some policies. They may be needed if you
+  use the default policies.</p>
 
-<h3><code>interval/rounded_arith.hpp</code></h3>
+  <h3><code>interval/rounded_arith.hpp</code></h3>
 
-<p>This header defines the three provided rounding policies for the
-arithmetic functions: <code>rounded_arith_std</code>,
-<code>rounded_arith_opp</code>, <code>rounded_arith_exact</code>.</p>
+  <p>This header defines the three provided rounding policies for the
+  arithmetic functions: <code>rounded_arith_std</code>,
+  <code>rounded_arith_opp</code>, <code>rounded_arith_exact</code>.</p>
 
-<h3><code>interval/rounded_transc.hpp</code></h3>
+  <h3><code>interval/rounded_transc.hpp</code></h3>
 
-<p>This header defines the three provided rounding policies for the
-transcendental functions: <code>rounded_transc_std</code>,
-<code>rounded_transc_opp</code>, <code>rounded_transc_exact</code>. It is
-separated from <code>rounded_arith.hpp</code> since the transcendental part
-of the rounding policy is probably less useful than the arithmetic part.</p>
+  <p>This header defines the three provided rounding policies for the
+  transcendental functions: <code>rounded_transc_std</code>,
+  <code>rounded_transc_opp</code>, <code>rounded_transc_exact</code>. It is
+  separated from <code>rounded_arith.hpp</code> since the transcendental part
+  of the rounding policy is probably less useful than the arithmetic
+  part.</p>
 
-<h3><code>interval/hw_rounding.hpp</code></h3>
+  <h3><code>interval/hw_rounding.hpp</code></h3>
 
-<p>Here are full rounding policies for the basic floating-point types. The
-policies are processor-dependent; and to allow the user code to be portable,
-they only define the common subset of the hardware available functions, which
-are the arithmetic functions of the rounding policy.</p>
+  <p>Here are full rounding policies for the basic floating-point types. The
+  policies are processor-dependent; and to allow the user code to be
+  portable, they only define the common subset of the hardware available
+  functions, which are the arithmetic functions of the rounding policy.</p>
 
-<h3><code>interval/checking.hpp</code></h3>
+  <h3><code>interval/checking.hpp</code></h3>
 
-<p>This header provides the predefined checking policies:
-<code>checking_base</code>, <code>checking_no_empty</code>,
-<code>checking_no_nan</code>, <code>checking_catch_nan</code>,
-<code>checking_strict</code>.</p>
+  <p>This header provides the predefined checking policies:
+  <code>checking_base</code>, <code>checking_no_empty</code>,
+  <code>checking_no_nan</code>, <code>checking_catch_nan</code>,
+  <code>checking_strict</code>.</p>
 
-<h3><code>interval/policies.hpp</code></h3>
+  <h3><code>interval/policies.hpp</code></h3>
 
-<p>Here are defined the helpers for manipulating policies. It contains
-<code>policies</code> (and so is needed for using default policies),
-<code>change_rounding</code>, <code>change_checking</code>,
-<code>unprotect</code>, etc.</p>
+  <p>Here are defined the helpers for manipulating policies. It contains
+  <code>policies</code> (and so is needed for using default policies),
+  <code>change_rounding</code>, <code>change_checking</code>,
+  <code>unprotect</code>, etc.</p>
 
-<h2>Comparisons</h2>
+  <h2>Comparisons</h2>
 
-<h3><code>interval/compare.hpp</code></h3>
+  <h3><code>interval/compare.hpp</code></h3>
 
-<p>This header includes all the following headers. They provide some
-predefined comparison namespaces.</p>
+  <p>This header includes all the following headers. They provide some
+  predefined comparison namespaces.</p>
 
-<h3><code>interval/compare/certain.hpp</code></h3>
+  <h3><code>interval/compare/certain.hpp</code></h3>
 
-<p>Here is <code>compare::certain</code>.</p>
+  <p>Here is <code>compare::certain</code>.</p>
 
-<h3><code>interval/compare/possible.hpp</code></h3>
+  <h3><code>interval/compare/possible.hpp</code></h3>
 
-<p>And here is its friend <code>compare::possible</code>.</p>
+  <p>And here is its friend <code>compare::possible</code>.</p>
 
-<h3><code>interval/compare/explicit.hpp</code></h3>
+  <h3><code>interval/compare/explicit.hpp</code></h3>
 
-<p>The explicit comparison functions <code>cerlt</code>, <code>posge</code>,
-etc are defined in this header.</p>
+  <p>The explicit comparison functions <code>cerlt</code>,
+  <code>posge</code>, etc are defined in this header.</p>
 
-<h3><code>interval/compare/lexicographic.hpp</code></h3>
+  <h3><code>interval/compare/lexicographic.hpp</code></h3>
 
-<p>This header provides <code>compare::lexicographic</code>.</p>
+  <p>This header provides <code>compare::lexicographic</code>.</p>
 
-<h3><code>interval/compare/set.hpp</code></h3>
+  <h3><code>interval/compare/set.hpp</code></h3>
 
-<p>This header provides <code>compare::set</code>.</p>
+  <p>This header provides <code>compare::set</code>.</p>
 
-<h2>Extensions</h2>
+  <h2>Extensions</h2>
 
-<p>The following headers are not included by <code>interval.hpp</code> and
-will usually provide not always desirable capabilities.</p>
+  <p>The following headers are not included by <code>interval.hpp</code> and
+  will usually provide not always desirable capabilities.</p>
 
-<h3><code>interval/io.hpp</code></h3>
+  <h3><code>interval/io.hpp</code></h3>
 
-<p>Here are defined basic stream operators <code>&lt;&lt;</code> and
-<code>&gt;&gt;</code>. They should only be used as a first approach and later
-be replaced by a customized version.</p>
+  <p>Here are defined basic stream operators <code>&lt;&lt;</code> and
+  <code>&gt;&gt;</code>. They should only be used as a first approach and
+  later be replaced by a customized version.</p>
 
-<h3><code>interval/limits.hpp</code></h3>
+  <h3><code>interval/limits.hpp</code></h3>
 
-<p>A specialization of <code>std::numeric_limits</code> adapted to the
-interval type.</p>
+  <p>A specialization of <code>std::numeric_limits</code> adapted to the
+  interval type.</p>
 
-<h3><code>interval/compare/tribool.hpp</code></h3>
+  <h3><code>interval/compare/tribool.hpp</code></h3>
 
-<p>This header provides a comparison namespace <code>compare::tribool</code>
-especially adapted to a tristate boolean.</p>
+  <p>This header provides a comparison namespace
+  <code>compare::tribool</code> especially adapted to a tristate boolean.</p>
 
-<h3><code>interval/ext/integer.hpp</code></h3>
+  <h3><code>interval/ext/integer.hpp</code></h3>
 
-<p>This header provides mixed operations between intervals and integers. It
-is done by converting the integer to the base number type. Because this
-comparison is not always correct (for a big <code>int</code> may not be
-exactly convertible to <code>float</code>), this header is not automatically
-included and the user should ensure that this behavior is compatible with
-what she wants to do (if it is only to multiply some intervals by 2, it
-probably is a good thing to include this header).</p>
+  <p>This header provides mixed operations between intervals and integers. It
+  is done by converting the integer to the base number type. Because this
+  comparison is not always correct (for a big <code>int</code> may not be
+  exactly convertible to <code>float</code>), this header is not
+  automatically included and the user should ensure that this behavior is
+  compatible with what she wants to do (if it is only to multiply some
+  intervals by 2, it probably is a good thing to include this header).</p>
 
-<h3><code>interval/ext/x86_fast_rounding_control.hpp</code></h3>
+  <h3><code>interval/ext/x86_fast_rounding_control.hpp</code></h3>
 
-<p>This header defines a new rounding policy allowing to workaround the
-precision problem of the x86 processors (and so speeding up the
-computations). However, it only is a partial solution and it shouldn't be
-used when there is a possibility of underflow or overflow.</p>
-<hr>
+  <p>This header defines a new rounding policy allowing to workaround the
+  precision problem of the x86 processors (and so speeding up the
+  computations). However, it only is a partial solution and it shouldn't be
+  used when there is a possibility of underflow or overflow.</p>
+  <hr>
 
-<p>Revised: 2003-04-22<br>
-Copyright (c) Guillaume Melquiond, Sylvain Pion, Hervé Brönnimann, 2002.
-Polytechnic University.<br>
-Copyright (c) Guillaume Melquiond, 2003.</p>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y-%m-%d" startspan -->2006-12-24<!--webbot bot="Timestamp" endspan i-checksum="12172" --></p>
+
+  <p><i>Copyright &copy; 2002 Guillaume Melquiond, Sylvain Pion, Herv&eacute;
+  Br&ouml;nnimann, Polytechnic University<br>
+  Copyright &copy; 2003-2006 Guillaume Melquiond, ENS Lyon</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/numeric/interval/doc/index.html
===================================================================
--- boost/trunk/libs/numeric/interval/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/interval/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,10 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="interval.htm">interval.htm</a>.
+<a href="interval.htm">interval.htm</a>.&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
-</html>
+</html>
\ No newline at end of file

Modified: boost/trunk/libs/numeric/interval/doc/interval.htm
===================================================================
--- boost/trunk/libs/numeric/interval/doc/interval.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/interval/doc/interval.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,250 +1,263 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
 "http://www.w3.org/TR/html4/loose.dtd">
+
 <html>
 <head>
-  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
   <link rel="stylesheet" type="text/css" href="../../../../boost.css">
+
   <title>Boost Interval Arithmetic Library</title>
 </head>
 
 <body lang="en">
-<h1><img src="../../../../boost.png" alt="boost.png (6897 bytes)"
-align="middle">
- Interval Arithmetic Library</h1>
+  <h1><img src="../../../../boost.png" alt="boost.png (6897 bytes)" align=
+  "middle"> Interval Arithmetic Library</h1>
 
-<center>
+  <center>
+    <table width="80%" summary="">
+      <tbody>
+        <tr>
+          <td><b>Contents of this page:</b><br>
+          <a href="#intro">Introduction</a><br>
+          <a href="#synopsis">Synopsis</a><br>
+          <a href="#interval">Template class <code>interval</code></a><br>
+          <a href="#opers">Operations and functions</a><br>
+          <a href="#interval_lib">Interval support library</a><br>
+          <!--<a href="#compil">Compilation notes</a><br>-->
+           <a href="#dangers">Common pitfalls and dangers</a><br>
+          <a href="#rationale">Rationale</a><br>
+          <a href="#acks">History and Acknowledgments</a></td>
 
-<table width="80%">
-  <tbody>
-    <tr>
-      <td><b>Contents of this page:</b><br>
-        <a href="#intro">Introduction</a><br>
-        <a href="#synopsis">Synopsis</a><br>
-        <a href="#interval">Template class <code>interval</code></a><br>
-        <a href="#opers">Operations and functions</a><br>
-        <a href="#interval_lib">Interval support library</a><br>
-        <!--<a href="#compil">Compilation notes</a><br>-->
-        <a href="#dangers">Common pitfalls and dangers</a><br>
-        <a href="#rationale">Rationale</a><br>
-        <a href="#acks">History and Acknowledgments</a></td>
-      <td><b>Other pages associated with this page:</b><br>
-        <a href="rounding.htm">Rounding policies</a><br>
-        <a href="checking.htm">Checking policies</a><br>
-        <a href="policies.htm">Policies manipulation</a><br>
-        <a href="comparisons.htm">Comparisons</a><br>
-        <a href="numbers.htm">Base number type requirements</a><br>
-        <a href="guide.htm">Choosing your own interval type</a><br>
-        <a href="examples.htm">Test and example programs</a><br>
-        <a href="includes.htm">Headers inclusion</a><br>
-        <a href="todo.htm">Some items on the todo list</a></td>
-    </tr>
-  </tbody>
-</table>
-</center>
+          <td><b>Other pages associated with this page:</b><br>
+          <a href="rounding.htm">Rounding policies</a><br>
+          <a href="checking.htm">Checking policies</a><br>
+          <a href="policies.htm">Policies manipulation</a><br>
+          <a href="comparisons.htm">Comparisons</a><br>
+          <a href="numbers.htm">Base number type requirements</a><br>
+          <a href="guide.htm">Choosing your own interval type</a><br>
+          <a href="examples.htm">Test and example programs</a><br>
+          <a href="includes.htm">Headers inclusion</a><br>
+          <a href="todo.htm">Some items on the todo list</a></td>
+        </tr>
+      </tbody>
+    </table>
+  </center>
 
-<h2 id="intro">Introduction and Overview</h2>
+  <h2 id="intro">Introduction and Overview</h2>
 
-<p>As implied by its name, this library is intended to help manipulating
-mathematical intervals. It consists of a single header &lt;<a
-href="../../../../boost/numeric/interval.hpp">boost/numeric/interval.hpp</a>&gt;
-and principally a type which can be used as <code>interval&lt;T&gt;</code>.
-In fact, this interval template is declared as
-<code>interval&lt;T,Policies&gt;</code> where <code>Policies</code> is a
-policy class that controls the various behaviours of the interval class;
-<code>interval&lt;T&gt;</code> just happens to pick the default policies for
-the type <code>T</code>.</p>
+  <p>As implied by its name, this library is intended to help manipulating
+  mathematical intervals. It consists of a single header &lt;<a href=
+  "../../../../boost/numeric/interval.hpp">boost/numeric/interval.hpp</a>&gt;
+  and principally a type which can be used as <code>interval&lt;T&gt;</code>.
+  In fact, this interval template is declared as
+  <code>interval&lt;T,Policies&gt;</code> where <code>Policies</code> is a
+  policy class that controls the various behaviours of the interval class;
+  <code>interval&lt;T&gt;</code> just happens to pick the default policies
+  for the type <code>T</code>.</p>
 
-<p><span style="color: #FF0000; font-weight: bold">Warning!</span> Guaranteed interval arithmetic
-for native floating-point format is not supported on every combination of
-processor, operating system, and compiler. This is a list of systems known to
-work correctly when using <code>interval&lt;float&gt;</code> and
-<code>interval&lt;double&gt;</code> with basic arithmetic operators.</p>
+  <p><span style="color: #FF0000; font-weight: bold">Warning!</span>
+  Guaranteed interval arithmetic for native floating-point format is not
+  supported on every combination of processor, operating system, and
+  compiler. This is a list of systems known to work correctly when using
+  <code>interval&lt;float&gt;</code> and <code>interval&lt;double&gt;</code>
+  with basic arithmetic operators.</p>
 
-<ul>
-<li>x86-like hardware is supported by the library with GCC, Visual C++ &ge;
-7.1, Intel compiler (&ge; 8 on Windows), CodeWarrior (&ge; 9), as long as the
-traditional x87 floating-point unit is used for floating-point computations
-(no <code>-mfpmath=sse2</code> support).</li>
-<li>Sparc hardware is supported with GCC and Sun compiler.</li>
-<li>PowerPC hardware is supported with GCC and CodeWarrior, when floating-point
-computations are not done with the Altivec unit.</li>
-<li>Alpha hardware is supported with GCC, except maybe for the square root. The
-options <code>-mfp-rounding-mode=d -mieee</code> have to be used.</li>
-</ul>
+  <ul>
+    <li>x86-like hardware is supported by the library with GCC, Visual C++
+    &ge; 7.1, Intel compiler (&ge; 8 on Windows), CodeWarrior (&ge; 9), as
+    long as the traditional x87 floating-point unit is used for
+    floating-point computations (no <code>-mfpmath=sse2</code> support).</li>
 
-<p>The previous list is not exhaustive. And even if a system does not provide
-guaranteed computations for hardware floating-point types, the interval library
-is still usable with user-defined types and for doing box arithmetic.</p>
+    <li>Sparc hardware is supported with GCC and Sun compiler.</li>
 
-<h3>Interval Arithmetic</h3>
+    <li>PowerPC hardware is supported with GCC and CodeWarrior, when
+    floating-point computations are not done with the Altivec unit.</li>
 
-<p>An interval is a pair of numbers which represents all the numbers between
-these two. (Intervals are considered close so the bounds are included.) The
-purpose of this library is to extend the usual arithmetic functions to
-intervals. These intervals will be written [<i>a</i>,<i>b</i>] to represent
-all the numbers between <i>a</i> and <i>b</i> (included). <i>a</i> and
-<i>b</i> can be infinite (but they can not be the same infinite) and <i>a</i>
-&#x2264; <i>b</i>.</p>
+    <li>Alpha hardware is supported with GCC, except maybe for the square
+    root. The options <code>-mfp-rounding-mode=d -mieee</code> have to be
+    used.</li>
+  </ul>
 
-<p>The fundamental property of interval arithmetic is the
-<em><strong>inclusion property</strong></em>:</p>
-<dl>
+  <p>The previous list is not exhaustive. And even if a system does not
+  provide guaranteed computations for hardware floating-point types, the
+  interval library is still usable with user-defined types and for doing box
+  arithmetic.</p>
+
+  <h3>Interval Arithmetic</h3>
+
+  <p>An interval is a pair of numbers which represents all the numbers
+  between these two. (Intervals are considered close so the bounds are
+  included.) The purpose of this library is to extend the usual arithmetic
+  functions to intervals. These intervals will be written [<i>a</i>,<i>b</i>]
+  to represent all the numbers between <i>a</i> and <i>b</i> (included).
+  <i>a</i> and <i>b</i> can be infinite (but they can not be the same
+  infinite) and <i>a</i> &le; <i>b</i>.</p>
+
+  <p>The fundamental property of interval arithmetic is the
+  <em><strong>inclusion property</strong></em>:</p>
+
+  <dl>
     <dd>``if <i>f</i> is a function on a set of numbers, <i>f</i> can be
-      extended to a new function defined on intervals. This new function
-      <i>f</i> takes one interval argument and returns an interval result
-      such as: &#x2200; <i>x</i> &#x2208; [<i>a</i>,<i>b</i>],
-      <i>f</i>(<i>x</i>) &#x2208; <i>f</i>([<i>a</i>,<i>b</i>]).''</dd>
-</dl>
+    extended to a new function defined on intervals. This new function
+    <i>f</i> takes one interval argument and returns an interval result such
+    as: &forall; <i>x</i> &isin; [<i>a</i>,<i>b</i>], <i>f</i>(<i>x</i>)
+    &isin; <i>f</i>([<i>a</i>,<i>b</i>]).''</dd>
+  </dl>
 
-<p>Such a property is not limited to functions with only one argument.
-Whenever possible, the interval result should be the smallest one able to
-satisfy the property (it is not really useful if the new functions always
-answer [-&#x221e;,+&#x221e;]).</p>
+  <p>Such a property is not limited to functions with only one argument.
+  Whenever possible, the interval result should be the smallest one able to
+  satisfy the property (it is not really useful if the new functions always
+  answer [-&infin;,+&infin;]).</p>
 
-<p>There are at least two reasons a user would like to use this library. The
-obvious one is when the user has to compute with intervals. One example is
-when input data have some builtin imprecision: instead of a number, an input
-variable can be passed as an interval. Another example application is to
-solve equations, by bisecting an interval until the interval width is small
-enough. A third example application is in computer graphics, where
-computations with boxes, segments or rays can be reduced to computations with
-points via intervals.</p>
+  <p>There are at least two reasons a user would like to use this library.
+  The obvious one is when the user has to compute with intervals. One example
+  is when input data have some builtin imprecision: instead of a number, an
+  input variable can be passed as an interval. Another example application is
+  to solve equations, by bisecting an interval until the interval width is
+  small enough. A third example application is in computer graphics, where
+  computations with boxes, segments or rays can be reduced to computations
+  with points via intervals.</p>
 
-<p>Another common reason to use interval arithmetic is when the computer
-doesn't produce exact results: by using intervals, it is possible to quantify
-the propagation of rounding errors. This approach is used often in numerical
-computation. For example, let's assume the computer stores numbers with ten
-decimal significant digits. To the question 1 + 1E-100 - 1, the computer will
-answer 0 although the correct answer would be 1E-100. With the help of
-interval arithmetic, the computer will answer [0,1E-9]. This is quite a huge
-interval for such a little result, but the precision is now known, without
-having to compute error propagation.</p>
+  <p>Another common reason to use interval arithmetic is when the computer
+  doesn't produce exact results: by using intervals, it is possible to
+  quantify the propagation of rounding errors. This approach is used often in
+  numerical computation. For example, let's assume the computer stores
+  numbers with ten decimal significant digits. To the question 1 + 1E-100 -
+  1, the computer will answer 0 although the correct answer would be 1E-100.
+  With the help of interval arithmetic, the computer will answer [0,1E-9].
+  This is quite a huge interval for such a little result, but the precision
+  is now known, without having to compute error propagation.</p>
 
-<h3>Numbers, rounding, and exceptional behavior</h3>
+  <h3>Numbers, rounding, and exceptional behavior</h3>
 
-<p>The <em><strong>base number type</strong></em> is the type that holds the
-bounds of the interval. In order to successfully use interval arithmetic, the
-base number type must present some <a
-href="rounding.htm">characteristics</a>. Firstly, due to the definition of an
-interval, the base numbers have to be totally ordered so, for instance,
-<code>complex&lt;T&gt;</code> is not usable as base number type for
-intervals.  The mathematical functions for the base number type should also
-be compatible with the total order (for instance if x&gt;y and z&gt;t, then
-it should also hold that x+z &gt; y+t), so modulo types are not usable
-either.</p>
+  <p>The <em><strong>base number type</strong></em> is the type that holds
+  the bounds of the interval. In order to successfully use interval
+  arithmetic, the base number type must present some <a href=
+  "rounding.htm">characteristics</a>. Firstly, due to the definition of an
+  interval, the base numbers have to be totally ordered so, for instance,
+  <code>complex&lt;T&gt;</code> is not usable as base number type for
+  intervals. The mathematical functions for the base number type should also
+  be compatible with the total order (for instance if x&gt;y and z&gt;t, then
+  it should also hold that x+z &gt; y+t), so modulo types are not usable
+  either.</p>
 
-<p>Secondly, the computations must be exact or provide some rounding methods
-(for instance, toward minus or plus infinity) if we want to guarantee the
-inclusion property. Note that we also may explicitely specify no rounding,
-for instance if the base number type is exact, i.e. the result of a
-mathematic operation is always computed and represented without loss of
-precision. If the number type is not exact, we may still explicitely specify
-no rounding, with the obvious consequence that the inclusion property is no
-longuer guaranteed.</p>
+  <p>Secondly, the computations must be exact or provide some rounding
+  methods (for instance, toward minus or plus infinity) if we want to
+  guarantee the inclusion property. Note that we also may explicitely specify
+  no rounding, for instance if the base number type is exact, i.e. the result
+  of a mathematic operation is always computed and represented without loss
+  of precision. If the number type is not exact, we may still explicitely
+  specify no rounding, with the obvious consequence that the inclusion
+  property is no longuer guaranteed.</p>
 
-<p>Finally, because heavy loss of precision is always possible, some numbers
-have to represent infinities or an exceptional behavior must be defined. The
-same situation also occurs for NaN (<i>Not a Number</i>).</p>
+  <p>Finally, because heavy loss of precision is always possible, some
+  numbers have to represent infinities or an exceptional behavior must be
+  defined. The same situation also occurs for NaN (<i>Not a Number</i>).</p>
 
-<p>Given all this, one may want to limit the template argument T of the class
-template <code>interval</code> to the floating point types
-<code>float</code>, <code>double</code>, and <code>long double</code>, as
-defined by the IEEE-754 Standard. Indeed, if the interval arithmetic is
-intended to replace the arithmetic provided by the floating point unit of a
-processor, these types are the best choice. Unlike <code>std::complex</code>,
-however, we don't want to limit <code>T</code> to these types. This is why we
-allow the rounding and exceptional behaviors to be given by the two policies
-(rounding and checking). We do nevertheless provide highly optimized rounding
-and checking class specializations for the above-mentioned floating point
-types.</p>
+  <p>Given all this, one may want to limit the template argument T of the
+  class template <code>interval</code> to the floating point types
+  <code>float</code>, <code>double</code>, and <code>long double</code>, as
+  defined by the IEEE-754 Standard. Indeed, if the interval arithmetic is
+  intended to replace the arithmetic provided by the floating point unit of a
+  processor, these types are the best choice. Unlike
+  <code>std::complex</code>, however, we don't want to limit <code>T</code>
+  to these types. This is why we allow the rounding and exceptional behaviors
+  to be given by the two policies (rounding and checking). We do nevertheless
+  provide highly optimized rounding and checking class specializations for
+  the above-mentioned floating point types.</p>
 
-<h3>Operations and functions</h3>
+  <h3>Operations and functions</h3>
 
-<p>It is straightforward to define the elementary arithmetic operations on
-intervals, being guided by the inclusion property. For instance, if [a,b] and
-[c,d] are intervals, [a,b]+[c,d] can be computed by taking the smallest
-interval that contains all the numbers x+y for x in [a,b] and y in [c,d]; in
-this case, rounding a+c down and b+d up will suffice. Other operators and
-functions are similarly defined (see their definitions below).</p>
+  <p>It is straightforward to define the elementary arithmetic operations on
+  intervals, being guided by the inclusion property. For instance, if [a,b]
+  and [c,d] are intervals, [a,b]+[c,d] can be computed by taking the smallest
+  interval that contains all the numbers x+y for x in [a,b] and y in [c,d];
+  in this case, rounding a+c down and b+d up will suffice. Other operators
+  and functions are similarly defined (see their definitions below).</p>
 
-<h3>Comparisons</h3>
+  <h3>Comparisons</h3>
 
-<p>It is also possible to define some comparison operators. Given two
-intervals, the result is a tri-state boolean type
-{<i>false</i>,<i>true,indeterminate</i>}. The answers <i>false</i> and
-<i>true</i> are easy to manipulate since they can directly be mapped on the
-boolean <i>true</i> and <i>false</i>. But it is not the case for the answer
-<em>indeterminate</em> since comparison operators are supposed to be boolean
-functions. So, what to do in order to obtain boolean answers?</p>
+  <p>It is also possible to define some comparison operators. Given two
+  intervals, the result is a tri-state boolean type
+  {<i>false</i>,<i>true,indeterminate</i>}. The answers <i>false</i> and
+  <i>true</i> are easy to manipulate since they can directly be mapped on the
+  boolean <i>true</i> and <i>false</i>. But it is not the case for the answer
+  <em>indeterminate</em> since comparison operators are supposed to be
+  boolean functions. So, what to do in order to obtain boolean answers?</p>
 
-<p>One solution consists of deciding to adopt an exceptional behavior, such
-as a failed assertion or raising an exception. In this case, the exceptional
-behavior will be triggered when the result is indeterminate.</p>
+  <p>One solution consists of deciding to adopt an exceptional behavior, such
+  as a failed assertion or raising an exception. In this case, the
+  exceptional behavior will be triggered when the result is
+  indeterminate.</p>
 
-<p>Another solution is to  map <em>indeterminate</em> always to <i>false,</i>
-or always to <i>true</i>. If <i>false</i> is chosen, the comparison will be
-called "<i>certain</i>;" indeed, the result of [<i>a</i>,<i>b</i>] &lt;
-[<i>c</i>,<i>d</i>] will be <i>true</i> if and only if: &#x2200; <i>x</i>
-&#x2208; [<i>a</i>,<i>b</i>] &#x2200; <i>y</i> &#x2208; [<i>c</i>,<i>d</i>],
-<i>x</i> &lt; <i>y</i>. If <i>true</i> is chosen, the comparison will be
-called "<i>possible</i>;" indeed, the result of [<i>a</i>,<i>b</i>] &lt;
-[<i>c</i>,<i>d</i>] will be <i>true</i> if and only if: &#x2203; <i>x</i>
-&#x2208; [<i>a</i>,<i>b</i>] &#x2203; <i>y</i> &#x2208; [<i>c</i>,<i>d</i>],
-<i>x</i> &lt; <i>y</i>.</p>
+  <p>Another solution is to map <em>indeterminate</em> always to
+  <i>false,</i> or always to <i>true</i>. If <i>false</i> is chosen, the
+  comparison will be called "<i>certain</i>;" indeed, the result of
+  [<i>a</i>,<i>b</i>] &lt; [<i>c</i>,<i>d</i>] will be <i>true</i> if and
+  only if: &forall; <i>x</i> &isin; [<i>a</i>,<i>b</i>] &forall; <i>y</i>
+  &isin; [<i>c</i>,<i>d</i>], <i>x</i> &lt; <i>y</i>. If <i>true</i> is
+  chosen, the comparison will be called "<i>possible</i>;" indeed, the result
+  of [<i>a</i>,<i>b</i>] &lt; [<i>c</i>,<i>d</i>] will be <i>true</i> if and
+  only if: &exist; <i>x</i> &isin; [<i>a</i>,<i>b</i>] &exist; <i>y</i>
+  &isin; [<i>c</i>,<i>d</i>], <i>x</i> &lt; <i>y</i>.</p>
 
-<p>Since any of these solution has a clearly defined semantics, it is not
-clear that we should enforce either of them. For this reason, the default
-behavior consists to mimic the real comparisons by throwing an exception in
-the indeterminate case. Other behaviors can be selected bu using specific
-comparison namespace. There is also a bunch of explicitely named comparison
-functions. See <a href="comparisons.htm">comparisons</a> pages for further
-details.</p>
+  <p>Since any of these solution has a clearly defined semantics, it is not
+  clear that we should enforce either of them. For this reason, the default
+  behavior consists to mimic the real comparisons by throwing an exception in
+  the indeterminate case. Other behaviors can be selected bu using specific
+  comparison namespace. There is also a bunch of explicitely named comparison
+  functions. See <a href="comparisons.htm">comparisons</a> pages for further
+  details.</p>
 
-<h3>Overview of the library, and usage</h3>
+  <h3>Overview of the library, and usage</h3>
 
-<p>This library provides two quite distinct levels of usage. One is to use
-the basic class template <code>interval&lt;T&gt;</code> without specifying
-the policy. This only requires to know and understand the concepts developed
-above and the content of the namespace boost. In addition to the class
-<code>interval&lt;T&gt;</code>, this level of usage provides arithmetic
-operators (<code>+</code>, <code>-</code>, <code>*</code>, <code>/</code>),
-algebraic and piecewise-algebraic functions (<code>abs</code>,
-<code>square</code>, <code>sqrt</code>, <code>pow</code>), transcendental and
-trigonometric functions (<code>exp</code>, <code>log</code>,
-<code>sin</code>, <code>cos</code>, <code>tan</code>, <code>asin</code>,
-<code>acos</code>, <code>atan</code>, <code>sinh</code>, <code>cosh</code>,
-<code>tanh</code>, <code>asinh</code>, <code>acosh</code>,
-<code>atanh</code>), and the standard comparison operators
-(<code>&lt;</code>, <code>&lt;=</code>, <code>&gt;</code>,
-<code>&gt;=</code>, <code>==</code>, <code>!=</code>), as well as several
-interval-specific functions (<code>min</code>, <code>max</code>, which have a
-different meaning than <code>std::min</code> and <code>std::max</code>;
-<code>lower</code>, <code>upper</code>, <code>width</code>,
-<code>median</code>, <code>empty</code>, <code>singleton</code>,
-<code>equal</code>, <code>in</code>, <code>zero_in</code>,
-<code>subset</code>, <code>proper_subset</code>, <code>overlap</code>,
-<code>intersection</code>, <code>hull</code>, <code>bisect</code>).</p>
+  <p>This library provides two quite distinct levels of usage. One is to use
+  the basic class template <code>interval&lt;T&gt;</code> without specifying
+  the policy. This only requires to know and understand the concepts
+  developed above and the content of the namespace boost. In addition to the
+  class <code>interval&lt;T&gt;</code>, this level of usage provides
+  arithmetic operators (<code>+</code>, <code>-</code>, <code>*</code>,
+  <code>/</code>), algebraic and piecewise-algebraic functions
+  (<code>abs</code>, <code>square</code>, <code>sqrt</code>,
+  <code>pow</code>), transcendental and trigonometric functions
+  (<code>exp</code>, <code>log</code>, <code>sin</code>, <code>cos</code>,
+  <code>tan</code>, <code>asin</code>, <code>acos</code>, <code>atan</code>,
+  <code>sinh</code>, <code>cosh</code>, <code>tanh</code>,
+  <code>asinh</code>, <code>acosh</code>, <code>atanh</code>), and the
+  standard comparison operators (<code>&lt;</code>, <code>&lt;=</code>,
+  <code>&gt;</code>, <code>&gt;=</code>, <code>==</code>, <code>!=</code>),
+  as well as several interval-specific functions (<code>min</code>,
+  <code>max</code>, which have a different meaning than <code>std::min</code>
+  and <code>std::max</code>; <code>lower</code>, <code>upper</code>,
+  <code>width</code>, <code>median</code>, <code>empty</code>,
+  <code>singleton</code>, <code>equal</code>, <code>in</code>,
+  <code>zero_in</code>, <code>subset</code>, <code>proper_subset</code>,
+  <code>overlap</code>, <code>intersection</code>, <code>hull</code>,
+  <code>bisect</code>).</p>
 
-<p>For some functions which take several parameters of type
-<code>interval&lt;T&gt;</code>, all combinations of argument types
-<code>T</code> and <code>interval&lt;T&gt;</code> which contain at least one
-<code>interval&lt;T&gt;</code>, are considered in order to avoid a conversion
-from the arguments of type <code>T</code> to a singleton of type
-<code>interval&lt;T&gt;</code>. This is done for efficiency reasons (the fact
-that an argument is a singleton sometimes renders some tests unnecessary).</p>
+  <p>For some functions which take several parameters of type
+  <code>interval&lt;T&gt;</code>, all combinations of argument types
+  <code>T</code> and <code>interval&lt;T&gt;</code> which contain at least
+  one <code>interval&lt;T&gt;</code>, are considered in order to avoid a
+  conversion from the arguments of type <code>T</code> to a singleton of type
+  <code>interval&lt;T&gt;</code>. This is done for efficiency reasons (the
+  fact that an argument is a singleton sometimes renders some tests
+  unnecessary).</p>
 
-<p>A somewhat more advanced usage of this library is to hand-pick the
-policies <code>Rounding</code> and <code>Checking</code> and pass them to
-<code>interval&lt;T, Policies&gt;</code> through the use of <code>Policies :=
-boost::numeric::interval_lib::policies&lt;Rounding,Checking&gt;</code>.
-Appropriate policies can be fabricated by using the various classes provided
-in the namespace <code>boost::numeric::interval_lib</code> as detailed in
-section <a href="#interval_lib">Interval Support Library</a>. It is also
-possible to choose the comparison scheme by overloading operators through
-namespaces.</p>
+  <p>A somewhat more advanced usage of this library is to hand-pick the
+  policies <code>Rounding</code> and <code>Checking</code> and pass them to
+  <code>interval&lt;T, Policies&gt;</code> through the use of <code>Policies
+  := boost::numeric::interval_lib::policies&lt;Rounding,Checking&gt;</code>.
+  Appropriate policies can be fabricated by using the various classes
+  provided in the namespace <code>boost::numeric::interval_lib</code> as
+  detailed in section <a href="#interval_lib">Interval Support Library</a>.
+  It is also possible to choose the comparison scheme by overloading
+  operators through namespaces.</p>
 
-<h2><a name="synopsis"></a>Synopsis</h2>
-<pre>namespace boost {
+  <h2><a name="synopsis" id="synopsis"></a>Synopsis</h2>
+  <pre>
+namespace boost {
 namespace numeric {
 
 namespace interval_lib {
@@ -252,16 +265,19 @@
 /* this declaration is necessary for the declaration of interval */
 template &lt;class T&gt; struct default_policies;
 
-/* ... ; the full synopsis of namespace interval_lib can be found <a href="#interval_lib">here</a> */
+/* ... ; the full synopsis of namespace interval_lib can be found <a href=
+"#interval_lib">here</a> */
 
 } // namespace interval_lib
 
 
-/* template interval_policies; class definition can be found <a href="policies.htm">here</a> */
+/* template interval_policies; class definition can be found <a href=
+"policies.htm">here</a> */
 template&lt;class Rounding, class Checking&gt;
 struct interval_policies;
 
-/* template class interval; class definition can be found <a href="#interval">here</a> */
+/* template class interval; class definition can be found <a href=
+"#interval">here</a> */
 template&lt;class T, class Policies = typename interval_lib::default_policies&lt;T&gt;::type &gt; class interval;
 
 /* arithmetic operators involving intervals */
@@ -284,11 +300,12 @@
 template &lt;class T, class Policies&gt;  interval&lt;T, Policies&gt; operator/(const interval&lt;T, Policies&gt;&amp; x, const T&amp; y);
 template &lt;class T, class Policies&gt;  interval&lt;T, Policies&gt; operator/(const T&amp; r, const interval&lt;T, Policies&gt;&amp; x);
 
-/* algebraic functions: sqrt, abs, square, pow */
+/* algebraic functions: sqrt, abs, square, pow, root */
 template &lt;class T, class Policies&gt;  interval&lt;T, Policies&gt; abs(const interval&lt;T, Policies&gt;&amp; x);
 template &lt;class T, class Policies&gt;  interval&lt;T, Policies&gt; sqrt(const interval&lt;T, Policies&gt;&amp; x);
 template &lt;class T, class Policies&gt;  interval&lt;T, Policies&gt; square(const interval&lt;T, Policies&gt;&amp; x);
 template &lt;class T, class Policies&gt;  interval&lt;T, Policies&gt; pow(const interval&lt;T, Policies&gt;&amp; x, int y);
+template &lt;class T, class Policies&gt;  interval&lt;T, Policies&gt; root(const interval&lt;T, Policies&gt;&amp; x, int y);
 
 /* transcendental functions: exp, log */
 template &lt;class T, class Policies&gt;  interval&lt;T, Policies&gt; exp(const interval&lt;T, Policies&gt;&amp; x);
@@ -363,8 +380,10 @@
 
 template&lt;class T, class Policies&gt;  bool operator&gt;=(const interval&lt;T, Policies&gt;&amp; x, const interval&lt;T, Policies&gt;&amp; y);
 template&lt;class T, class Policies&gt;  bool operator&gt;=(const interval&lt;T, Policies&gt;&amp; x, const T&amp; y);
-template&lt;class T, class Policies&gt;  bool operator&gt;=(const T&amp; x, const interval&lt;T, Policies&gt;&amp; y);</pre>
-<pre>template&lt;class T, class Policies&gt;  bool operator==(const interval&lt;T, Policies&gt;&amp; x, const interval&lt;T, Policies&gt;&amp; y);
+template&lt;class T, class Policies&gt;  bool operator&gt;=(const T&amp; x, const interval&lt;T, Policies&gt;&amp; y);
+</pre>
+  <pre>
+template&lt;class T, class Policies&gt;  bool operator==(const interval&lt;T, Policies&gt;&amp; x, const interval&lt;T, Policies&gt;&amp; y);
 template&lt;class T, class Policies&gt;  bool operator==(const interval&lt;T, Policies&gt;&amp; x, const T&amp; y);
 template&lt;class T, class Policies&gt;  bool operator==(const T&amp; x, const interval&lt;T, Policies&gt;&amp; y);
 
@@ -386,12 +405,14 @@
 } // namespace interval_lib
 
 } // namespace numeric
-} // namespace boost</pre>
+} // namespace boost
+</pre>
 
-<h2><a name="interval"></a>Template class <code>interval</code></h2>
-The public interface of the template class interval itself is kept at a
-simplest minimum:
-<pre>template &lt;class T, class Policies = typename interval_lib::default_policies&lt;T&gt;::type&gt;
+  <h2><a name="interval" id="interval"></a>Template class
+  <code>interval</code></h2>The public interface of the template class
+  interval itself is kept at a simplest minimum:
+  <pre>
+template &lt;class T, class Policies = typename interval_lib::default_policies&lt;T&gt;::type&gt;
 class interval
 {
   public:
@@ -430,233 +451,248 @@
   interval&amp; operator-= (interval const &amp;r);
   interval&amp; operator*= (interval const &amp;r);
   interval&amp; operator/= (interval const &amp;r);
-};</pre>
+};
+</pre>
 
-<p>The constructors create an interval enclosing their arguments. If there
-are two arguments, the first one is assumed to be the left bound and the
-second one is the right bound. Consequently, the arguments need to be
-ordered. If the property !(l &lt;= u) is not respected, the checking policy
-will be used to create an empty interval. If no argument is given, the
-created interval is the singleton zero.</p>
+  <p>The constructors create an interval enclosing their arguments. If there
+  are two arguments, the first one is assumed to be the left bound and the
+  second one is the right bound. Consequently, the arguments need to be
+  ordered. If the property !(l &lt;= u) is not respected, the checking policy
+  will be used to create an empty interval. If no argument is given, the
+  created interval is the singleton zero.</p>
 
-<p>If the type of the arguments is the same as the base number type, the
-values are directly used for the bounds. If it is not the same type, the
-library will use the rounding policy in order to convert the arguments
-(<code>conv_down</code> and <code>conv_up</code>) and create an enclosing
-interval. When the argument is an interval with a different policy, the input
-interval is checked in order to correctly propagate its emptiness (if
-empty).</p>
+  <p>If the type of the arguments is the same as the base number type, the
+  values are directly used for the bounds. If it is not the same type, the
+  library will use the rounding policy in order to convert the arguments
+  (<code>conv_down</code> and <code>conv_up</code>) and create an enclosing
+  interval. When the argument is an interval with a different policy, the
+  input interval is checked in order to correctly propagate its emptiness (if
+  empty).</p>
 
-<p>The assignment operators behave similarly, except they obviously take one
-argument only. There is also an <code>assign</code> function in order to
-directly change the bounds of an interval. It behaves like the two-arguments
-constructors if the bounds are not ordered. There is no assign function that
-directly takes an interval or only one number as a parameter; just use the
-assignment operators in such a case.</p>
+  <p>The assignment operators behave similarly, except they obviously take
+  one argument only. There is also an <code>assign</code> function in order
+  to directly change the bounds of an interval. It behaves like the
+  two-arguments constructors if the bounds are not ordered. There is no
+  assign function that directly takes an interval or only one number as a
+  parameter; just use the assignment operators in such a case.</p>
 
-<p>The type of the bounds and the policies of the interval type define the
-set of values the intervals contain. E.g. with the default policies, intervals
-are subsets of the set of real numbers. The static functions <code>empty</code>
-and <code>whole</code> produce the intervals/subsets that are repectively the
-empty subset and the whole set. They are static member functions rather than
-global functions because they cannot guess their return types. Likewise for
-<code>hull</code>. <code>empty</code> and <code>whole</code> involve the
-checking policy in order to get the bounds of the resulting intervals.</p>
+  <p>The type of the bounds and the policies of the interval type define the
+  set of values the intervals contain. E.g. with the default policies,
+  intervals are subsets of the set of real numbers. The static functions
+  <code>empty</code> and <code>whole</code> produce the intervals/subsets
+  that are repectively the empty subset and the whole set. They are static
+  member functions rather than global functions because they cannot guess
+  their return types. Likewise for <code>hull</code>. <code>empty</code> and
+  <code>whole</code> involve the checking policy in order to get the bounds
+  of the resulting intervals.</p>
 
-<h2><a name="opers"></a>Operations and Functions</h2>
+  <h2><a name="opers" id="opers"></a>Operations and Functions</h2>
 
-<p>Some of the following functions expect <code>min</code> and
-<code>max</code> to be defined for the base type. Those are the only
-requirements for the <code>interval</code> class (but the policies can have
-other requirements).</p>
+  <p>Some of the following functions expect <code>min</code> and
+  <code>max</code> to be defined for the base type. Those are the only
+  requirements for the <code>interval</code> class (but the policies can have
+  other requirements).</p>
 
-<h4>Operators <code>+</code> <code>-</code> <code>*</code> <code>/</code>
-<code>+=</code> <code>-=</code> <code>*=</code> <code>/=</code></h4>
+  <h4>Operators <code>+</code> <code>-</code> <code>*</code> <code>/</code>
+  <code>+=</code> <code>-=</code> <code>*=</code> <code>/=</code></h4>
 
-<p>The basic operations are the unary minus and the binary <code>+</code>
-<code>-</code> <code>*</code> <code>/</code>. The unary minus takes an
-interval and returns an interval. The binary operations take two intervals,
-or one interval and a number, and return an interval. If an argument is a
-number instead of an interval, you can expect the result to be the same as if
-the number was first converted to an interval. This property will be true for
-all the following functions and operators.</p>
+  <p>The basic operations are the unary minus and the binary <code>+</code>
+  <code>-</code> <code>*</code> <code>/</code>. The unary minus takes an
+  interval and returns an interval. The binary operations take two intervals,
+  or one interval and a number, and return an interval. If an argument is a
+  number instead of an interval, you can expect the result to be the same as
+  if the number was first converted to an interval. This property will be
+  true for all the following functions and operators.</p>
 
-<p>There are also some assignment operators <code>+=</code> <code>-=</code>
-<code>*=</code> <code>/=</code>. There is not much to say: <code>x op=
-y</code> is equivalent to <code>x = x op y</code>. If an exception is thrown
-during the computations, the l-value is not modified (but it may be corrupt
-if an exception is thrown by the base type during an assignment).</p>
+  <p>There are also some assignment operators <code>+=</code> <code>-=</code>
+  <code>*=</code> <code>/=</code>. There is not much to say: <code>x op=
+  y</code> is equivalent to <code>x = x op y</code>. If an exception is
+  thrown during the computations, the l-value is not modified (but it may be
+  corrupt if an exception is thrown by the base type during an
+  assignment).</p>
 
-<p>The operators <code>/</code> and <code>/=</code> will try to produce an
-empty interval if the denominator is exactly zero. If the denominator
-contains zero (but not only zero), the result will be the smallest interval
-containing the set of division results; so one of its bound will be infinite,
-but it may not be the whole interval.</p>
+  <p>The operators <code>/</code> and <code>/=</code> will try to produce an
+  empty interval if the denominator is exactly zero. If the denominator
+  contains zero (but not only zero), the result will be the smallest interval
+  containing the set of division results; so one of its bound will be
+  infinite, but it may not be the whole interval.</p>
 
-<h4><code>lower</code> <code>upper</code> <code>median</code>
-<code>width</code> <code>norm</norm></code></h4>
+  <h4><code>lower</code> <code>upper</code> <code>median</code>
+  <code>width</code> <code>norm</code></h4>
 
-<p><code>lower</code>, <code>upper</code>, <code>median</code> respectively
-compute the lower bound, the upper bound, and the median number of an
-interval (<code>(lower+upper)/2</code> rounded to nearest).
-<code>width</code> computes the width of an interval
-(<code>upper-lower</code> rounded toward plus infinity). <code>norm</code>
-computes an upper bound of the interval in absolute value; it is a
-mathematical norm (hence the name) similar to the absolute value for real
-numbers.</p>
+  <p><code>lower</code>, <code>upper</code>, <code>median</code> respectively
+  compute the lower bound, the upper bound, and the median number of an
+  interval (<code>(lower+upper)/2</code> rounded to nearest).
+  <code>width</code> computes the width of an interval
+  (<code>upper-lower</code> rounded toward plus infinity). <code>norm</code>
+  computes an upper bound of the interval in absolute value; it is a
+  mathematical norm (hence the name) similar to the absolute value for real
+  numbers.</p>
 
-<h4><code>min</code> <code>max</code> <code>abs</code> <code>square</code>
-<code>pow</code> <code>division_part?</code>
-<code>multiplicative_inverse</code></h4>
+  <h4><code>min</code> <code>max</code> <code>abs</code> <code>square</code>
+  <code>pow</code> <code>root</code> <code>division_part?</code>
+  <code>multiplicative_inverse</code></h4>
 
-<p>The functions <code>min</code>, <code>max</code> and <code>abs</code> are
-also defined. Please do not mistake them for the functions defined in the
-standard library (aka <code>a&lt;b?a:b</code>, <code>a&gt;b?a:b</code>,
-<code>a&lt;0?-a:a</code>). These functions are compatible with the elementary
-property of interval arithmetic. For example, max([<i>a</i>,<i>b</i>],
-[<i>c</i>,<i>d</i>]) = {max(<i>x</i>,<i>y</i>) such that <i>x</i> in
-[<i>a</i>,<i>b</i>] and <i>y</i> in [<i>c</i>,<i>d</i>]}. They are not
-defined in the <code>std</code> namespace but in the boost namespace in order
-to avoid conflict with the other definitions.</p>
+  <p>The functions <code>min</code>, <code>max</code> and <code>abs</code>
+  are also defined. Please do not mistake them for the functions defined in
+  the standard library (aka <code>a&lt;b?a:b</code>, <code>a&gt;b?a:b</code>,
+  <code>a&lt;0?-a:a</code>). These functions are compatible with the
+  elementary property of interval arithmetic. For example,
+  max([<i>a</i>,<i>b</i>], [<i>c</i>,<i>d</i>]) = {max(<i>x</i>,<i>y</i>)
+  such that <i>x</i> in [<i>a</i>,<i>b</i>] and <i>y</i> in
+  [<i>c</i>,<i>d</i>]}. They are not defined in the <code>std</code>
+  namespace but in the boost namespace in order to avoid conflict with the
+  other definitions.</p>
 
-<p>The <code>square</code> function is quite particular. As you can expect
-from its name, it computes the square of its argument. The reason this
-function is provided is: <code>square(x)</code> is not <code>x*x</code> but
-only a subset when <code>x</code> contains zero. For example, [-2,2]*[-2,2] =
-[-4,4] but [-2,2]² = [0,4]; the result is a smaller interval.  Consequently,
-<code>square(x)</code> should be used instead of <code>x*x</code> because of
-its better accuracy and a small performance improvement.</p>
+  <p>The <code>square</code> function is quite particular. As you can expect
+  from its name, it computes the square of its argument. The reason this
+  function is provided is: <code>square(x)</code> is not <code>x*x</code> but
+  only a subset when <code>x</code> contains zero. For example, [-2,2]*[-2,2]
+  = [-4,4] but [-2,2]&sup2; = [0,4]; the result is a smaller interval.
+  Consequently, <code>square(x)</code> should be used instead of
+  <code>x*x</code> because of its better accuracy and a small performance
+  improvement.</p>
 
-<p>As for <code>square</code>, <code>pow</code> provides an efficient and
-more accurate way to compute the integer power of an interval. Please note:
-when the power is 0 and the interval is not empty, the result is 1, even if
-the input interval contains 0. <code>multiplicative_inverse</code> computes
-1/x.</p>
+  <p>As for <code>square</code>, <code>pow</code> provides an efficient and
+  more accurate way to compute the integer power of an interval. Please note:
+  when the power is 0 and the interval is not empty, the result is 1, even if
+  the input interval contains 0. <code>root</code> computes the integer root
+  of an interval (<code>root(pow(x,k),k)</code> encloses <code>x</code> or
+  <code>abs(x)</code> depending on whether <code>k</code> is odd or even).
+  The behavior of <code>root</code> is not defined if the integer argument is
+  not positive. <code>multiplicative_inverse</code> computes
+  <code>1/x</code>.</p>
 
-<p>The functions <code>division_part1</code> and <code>division_part2</code>
-are useful when the user expects the division to return disjoint intervals if
-necessary. For example, the narrowest closed set containg [2,3] / [-2,1] is
-not ]-&#x221e;,&#x221e;[ but the union of ]-&#x221e;,-1] and [2,&#x221e;[.
-When the result of the division is representable by only one interval,
-<code>division_part1</code> returns this interval and sets the boolean
-reference to <code>false</code>. However, if the result needs two intervals,
-<code>division_part1</code> returns the negative part and sets the boolean
-reference to <code>true</code>; a call to <code>division_part2</code> is now
-needed to get the positive part. This second function can take the boolean
-returned by the first function as last argument. If this bool is not given,
-its value is assumed to be true and the behavior of the function is then
-undetermined if the division does not produce a second interval.</p>
+  <p>The functions <code>division_part1</code> and
+  <code>division_part2</code> are useful when the user expects the division
+  to return disjoint intervals if necessary. For example, the narrowest
+  closed set containg [2,3] / [-2,1] is not ]-&infin;,&infin;[ but the union
+  of ]-&infin;,-1] and [2,&infin;[. When the result of the division is
+  representable by only one interval, <code>division_part1</code> returns
+  this interval and sets the boolean reference to <code>false</code>.
+  However, if the result needs two intervals, <code>division_part1</code>
+  returns the negative part and sets the boolean reference to
+  <code>true</code>; a call to <code>division_part2</code> is now needed to
+  get the positive part. This second function can take the boolean returned
+  by the first function as last argument. If this bool is not given, its
+  value is assumed to be true and the behavior of the function is then
+  undetermined if the division does not produce a second interval.</p>
 
-<h4><code>intersect</code> <code>hull</code> <code>overlap</code>
-<code>in</code> <code>zero_in</code> <code>subset</code>
-<code>proper_subset</code> <code>empty</code> <code>singleton</code>
-<code>equal</code></h4>
+  <h4><code>intersect</code> <code>hull</code> <code>overlap</code>
+  <code>in</code> <code>zero_in</code> <code>subset</code>
+  <code>proper_subset</code> <code>empty</code> <code>singleton</code>
+  <code>equal</code></h4>
 
-<p><code>intersect</code> computes the set intersection of two closed sets,
-<code>hull</code> computes the smallest interval which contains the two
-parameters; those parameters can be numbers or intervals. If one of the
-arguments is an invalid number or an empty interval, the function will only
-use the other argument to compute the resulting interval (if allowed by the
-checking policy).</p>
+  <p><code>intersect</code> computes the set intersection of two closed sets,
+  <code>hull</code> computes the smallest interval which contains the two
+  parameters; those parameters can be numbers or intervals. If one of the
+  arguments is an invalid number or an empty interval, the function will only
+  use the other argument to compute the resulting interval (if allowed by the
+  checking policy).</p>
 
-<p>There is no union function since the union of two intervals is not an
-interval if they do not overlap. If they overlap, the <code>hull</code>
-function computes the union.</p>
+  <p>There is no union function since the union of two intervals is not an
+  interval if they do not overlap. If they overlap, the <code>hull</code>
+  function computes the union.</p>
 
-<p>The function <code>overlap</code> tests if two intervals have some common
-subset. <code>in</code> tests if a number is in an interval;
-<code>zero_in</code> is a variant which tests if zero is in the interval.
-<code>subset</code> tests if the first interval is a subset of the second;
-and <code>proper_subset</code> tests if it is a proper subset.
-<code>empty</code> and <code>singleton</code> test if an interval is empty or
-is a singleton. Finally, <code>equal</code> tests if two intervals are
-equal.</p>
+  <p>The function <code>overlap</code> tests if two intervals have some
+  common subset. <code>in</code> tests if a number is in an interval;
+  <code>zero_in</code> is a variant which tests if zero is in the interval.
+  <code>subset</code> tests if the first interval is a subset of the second;
+  and <code>proper_subset</code> tests if it is a proper subset.
+  <code>empty</code> and <code>singleton</code> test if an interval is empty
+  or is a singleton. Finally, <code>equal</code> tests if two intervals are
+  equal.</p>
 
-<h4><code>sqrt</code> <code>log</code> <code>exp</code> <code>sin</code>
-<code>cos</code> <code>tan</code> <code>asin</code> <code>acos</code>
-<code>atan</code> <code>sinh</code> <code>cosh</code> <code>tanh</code>
-<code>asinh</code> <code>acosh</code> <code>atanh</code>
-<code>fmod</code></h4>
+  <h4><code>sqrt</code> <code>log</code> <code>exp</code> <code>sin</code>
+  <code>cos</code> <code>tan</code> <code>asin</code> <code>acos</code>
+  <code>atan</code> <code>sinh</code> <code>cosh</code> <code>tanh</code>
+  <code>asinh</code> <code>acosh</code> <code>atanh</code>
+  <code>fmod</code></h4>
 
-<p>The functions <code>sqrt</code>, <code>log</code>, <code>exp</code>,
-<code>sin</code>, <code>cos</code>, <code>tan</code>, <code>asin</code>,
-<code>acos</code>, <code>atan</code>, <code>sinh</code>, <code>cosh</code>,
-<code>tanh</code>, <code>asinh</code>, <code>acosh</code>, <code>atanh</code>
-are also defined. There is not much to say; these functions extend the
-traditional functions to the intervals and respect the basic property of
-interval arithmetic. They use the <a href="checking.htm">checking</a> policy to
-produce empty intervals when the input interval is strictly outside of the
-domain of the function.</p>
+  <p>The functions <code>sqrt</code>, <code>log</code>, <code>exp</code>,
+  <code>sin</code>, <code>cos</code>, <code>tan</code>, <code>asin</code>,
+  <code>acos</code>, <code>atan</code>, <code>sinh</code>, <code>cosh</code>,
+  <code>tanh</code>, <code>asinh</code>, <code>acosh</code>,
+  <code>atanh</code> are also defined. There is not much to say; these
+  functions extend the traditional functions to the intervals and respect the
+  basic property of interval arithmetic. They use the <a href=
+  "checking.htm">checking</a> policy to produce empty intervals when the
+  input interval is strictly outside of the domain of the function.</p>
 
-<p>The function <code>fmod(interval x, interval y)</code> expects the lower
-bound of <code>y</code> to be strictly positive and returns an interval
-<code>z</code> such as <code>0 &lt;= z.lower() &lt; y.upper()</code> and such
-as <code>z</code> is a superset of <code>x-n*y</code> (with <code>n</code>
-being an integer). So, if the two arguments are positive singletons, this
-function <code>fmod(interval, interval)</code> will behave like the
-traditional function <code>fmod(double, double)</code>.</p>
+  <p>The function <code>fmod(interval x, interval y)</code> expects the lower
+  bound of <code>y</code> to be strictly positive and returns an interval
+  <code>z</code> such as <code>0 &lt;= z.lower() &lt; y.upper()</code> and
+  such as <code>z</code> is a superset of <code>x-n*y</code> (with
+  <code>n</code> being an integer). So, if the two arguments are positive
+  singletons, this function <code>fmod(interval, interval)</code> will behave
+  like the traditional function <code>fmod(double, double)</code>.</p>
 
-<p>Please note that <code>fmod</code> does not respect the inclusion property
-of arithmetic interval. For example, the result of
-<code>fmod</code>([13,17],[7,8]) should be [0,8] (since it must contain [0,3]
-and [5,8]). But this answer is not really useful when the purpose is to
-restrict an interval in order to compute a periodic function. It is the
-reason why <code>fmod</code> will answer [5,10].</p>
+  <p>Please note that <code>fmod</code> does not respect the inclusion
+  property of arithmetic interval. For example, the result of
+  <code>fmod</code>([13,17],[7,8]) should be [0,8] (since it must contain
+  [0,3] and [5,8]). But this answer is not really useful when the purpose is
+  to restrict an interval in order to compute a periodic function. It is the
+  reason why <code>fmod</code> will answer [5,10].</p>
 
-<h4><code>add</code> <code>sub</code> <code>mul</code> <code>div</code></h4>
+  <h4><code>add</code> <code>sub</code> <code>mul</code>
+  <code>div</code></h4>
 
-<p>These four functions take two numbers and return the enclosing interval
-for the operations. It avoids converting a number to an interval before an
-operation, it can result in a better code with poor optimizers.</p>
+  <p>These four functions take two numbers and return the enclosing interval
+  for the operations. It avoids converting a number to an interval before an
+  operation, it can result in a better code with poor optimizers.</p>
 
-<h3>Constants</h3>
+  <h3>Constants</h3>
 
-<p>Some constants are hidden in the <code>boost::numeric::interval_lib</code>
-namespace. They need to be explicitely templated by the interval type. The
-functions are <code>pi&lt;I&gt;()</code>, <code>pi_half&lt;I&gt;()</code> and
-<code>pi_twice&lt;I&gt;()</code>, and they return an object of interval type
-<code>I</code>. Their respective values are &#x3c0;, &#x3c0;/2 and
-2&#x3c0;.</p>
+  <p>Some constants are hidden in the
+  <code>boost::numeric::interval_lib</code> namespace. They need to be
+  explicitely templated by the interval type. The functions are
+  <code>pi&lt;I&gt;()</code>, <code>pi_half&lt;I&gt;()</code> and
+  <code>pi_twice&lt;I&gt;()</code>, and they return an object of interval
+  type <code>I</code>. Their respective values are &pi;, &pi;/2 and
+  2&pi;.</p>
 
-<h3>Exception throwing</h3>
+  <h3>Exception throwing</h3>
 
-<p>The interval class and all the functions defined around this class never
-throw any exceptions by themselves. However, it does not mean that an
-operation will never throw an exception. For example, let's consider the copy
-constructor. As explained before, it is the default copy constructor
-generated by the compiler. So it will not throw an exception if the copy
-constructor of the base type does not throw an exception.</p>
+  <p>The interval class and all the functions defined around this class never
+  throw any exceptions by themselves. However, it does not mean that an
+  operation will never throw an exception. For example, let's consider the
+  copy constructor. As explained before, it is the default copy constructor
+  generated by the compiler. So it will not throw an exception if the copy
+  constructor of the base type does not throw an exception.</p>
 
-<p>The same situation applies to all the functions: exceptions will only be
-thrown if the base type or one of the two policies throws an exception.</p>
+  <p>The same situation applies to all the functions: exceptions will only be
+  thrown if the base type or one of the two policies throws an exception.</p>
 
-<h2 id="interval_lib">Interval Support Library</h2>
+  <h2 id="interval_lib">Interval Support Library</h2>
 
-<p>The interval support library consists of a collection of classes that can
-be used and combined to fabricate almost various commonly-needed interval
-policies. In contrast to the basic classes and functions which are used in
-conjunction with <code>interval&lt;T&gt;</code> (and the default policies as
-the implicit second template parameter in this type), which belong simply to
-the namespace <code>boost</code>, these components belong to the namespace
-<code>boost::numeric::interval_lib</code>.</p>
+  <p>The interval support library consists of a collection of classes that
+  can be used and combined to fabricate almost various commonly-needed
+  interval policies. In contrast to the basic classes and functions which are
+  used in conjunction with <code>interval&lt;T&gt;</code> (and the default
+  policies as the implicit second template parameter in this type), which
+  belong simply to the namespace <code>boost</code>, these components belong
+  to the namespace <code>boost::numeric::interval_lib</code>.</p>
 
-<p>We merely give the synopsis here and defer each section to a separate web
-page since it is only intended for the advanced user. This allows to expand
-on each topic with examples, without unduly stretching the limits of this
-document.</p>
+  <p>We merely give the synopsis here and defer each section to a separate
+  web page since it is only intended for the advanced user. This allows to
+  expand on each topic with examples, without unduly stretching the limits of
+  this document.</p>
 
-<h4>Synopsis</h4>
-<pre>namespace boost {
+  <h4>Synopsis</h4>
+  <pre>
+namespace boost {
 namespace numeric {
 namespace interval_lib {
 
-<font color="#ff0000">/* built-in rounding policy and its specializations */</font>
+<span style=
+"color: #FF0000">/* built-in rounding policy and its specializations */</span>
 template &lt;class T&gt;  struct rounded_math;
 template &lt;&gt;         struct rounded_math&lt;float&gt;;
 template &lt;&gt;         struct rounded_math&lt;double&gt;;
 template &lt;&gt;         struct rounded_math&lt;long double&gt;;
 
-<span style="color: #FF0000">/* built-in rounding construction blocks */</span>
+<span style=
+"color: #FF0000">/* built-in rounding construction blocks */</span>
 template &lt;class T&gt;  struct rounding_control;
 
 template &lt;class T, class Rounding = rounding_control&lt;T&gt; &gt;  struct rounded_arith_exact;
@@ -671,25 +707,27 @@
 template &lt;class Rounding&gt; struct save_state;
 template &lt;class Rounding&gt; struct save_state_nothing;
 
-<font color="#ff0000">/* built-in checking policies */</font>
+<span style="color: #FF0000">/* built-in checking policies */</span>
 template &lt;class T&gt; struct checking_base;
 template &lt;class T, class Checking = checking_base&lt;T&gt;, class Exception = exception_create_empty&gt;   struct checking_no_empty;
 template &lt;class T, class Checking = checking_base&lt;T&gt; &gt;                                            struct checking_no_nan;
 template &lt;class T, class Checking = checking_base&lt;T&gt;, class Exception = exception_invalid_number&gt; struct checking_catch_nan;
 template &lt;class T&gt; struct checking_strict;
 
-<span style="color: #FF0000">/* some metaprogramming to manipulate interval policies */</span>
+<span style=
+"color: #FF0000">/* some metaprogramming to manipulate interval policies */</span>
 template &lt;class Rounding, class Checking&gt; struct policies;
 template &lt;class OldInterval, class NewRounding&gt; struct change_rounding;
 template &lt;class OldInterval, class NewChecking&gt; struct change_checking;
 template &lt;class OldInterval&gt; struct unprotect;
 
-<span style="color: #FF0000">/* constants, need to be explicitly templated */</span>
+<span style=
+"color: #FF0000">/* constants, need to be explicitly templated */</span>
 template&lt;class I&gt; I pi();
 template&lt;class I&gt; I pi_half();
 template&lt;class I&gt; I pi_twice();
 
-<span style="color: #FF0000">/* interval explicit comparison functions</span><span style="color: #FF0000">:
+<span style="color: #FF0000">/* interval explicit comparison functions:
  * the mode can be cer=certainly or pos=possibly,
  * the function lt=less_than, gt=greater_than, le=less_than_or_equal_to, ge=greater_than_or_equal_to
  *   eq=equal_to, ne= not_equal_to */</span>
@@ -741,7 +779,7 @@
 template &lt;class T, class Policies&gt;  bool posne(const interval&lt;T, Policies&gt;&amp; x, const T&amp; y);
 template &lt;class T, class Policies&gt;  bool posne(const T&amp; x, const interval&lt;T, Policies&gt;&amp; y);
 
-<font color="#ff0000">/* comparison namespaces */</font>
+<span style="color: #FF0000">/* comparison namespaces */</span>
 namespace compare {
   namespace certain;
   namespace possible;
@@ -752,183 +790,201 @@
 
 } // namespace interval_lib
 } // namespace numeric
-} // namespace boost</pre>
+} // namespace boost
+</pre>
 
-<p>Each component of the interval support library is detailed in its own
-page.</p>
-<ul>
-  <li><a href="comparisons.htm">Comparisons</a></li>
-  <li><a href="rounding.htm">Rounding</a></li>
-  <li><a href="checking.htm">Checking</a></li>
-</ul>
+  <p>Each component of the interval support library is detailed in its own
+  page.</p>
 
-<h2 id="dangers">Common Pitfalls and Dangers</h2>
+  <ul>
+    <li><a href="comparisons.htm">Comparisons</a></li>
 
-<h4>Comparisons</h4>
+    <li><a href="rounding.htm">Rounding</a></li>
 
-<p>One of the biggest problems is problably the correct use of the comparison
-functions and operators. First, functions and operators do not try to know if
-two intervals are the same mathematical object. So, if the comparison used is
-"certain", then <code>x != x</code> is always true unless <code>x</code> is a
-singleton interval; and the same problem arises with <code>cereq</code> and
-<code>cerne</code>.</p>
+    <li><a href="checking.htm">Checking</a></li>
+  </ul>
 
-<p>Another misleading interpretation of the comparison is: you cannot always
-expect [a,b] &lt; [c,d] to be !([a,b] &gt;= [c,d]) since the comparison is
-not necessarily total. Equality and less comparison should be seen as two
-distincts relational operators. However the default comparison operators do
-respect this property since they throw an exception whenever [a,b] and [c,d]
-overlap.</p>
+  <h2 id="dangers">Common Pitfalls and Dangers</h2>
 
-<h4>Interval values and references</h4>
+  <h4>Comparisons</h4>
 
-<p>This problem is a corollary of the previous problem with <code>x !=
-x</code>. All the functions of the library only consider the value of an
-interval and not the reference of an interval. In particular, you should not
-expect (unless <code>x</code> is a singleton) the following values to be
-equal: <code>x/x</code> and 1, <code>x*x</code> and <code>square(x)</code>,
-<code>x-x</code> and 0, etc. So the main cause of wide intervals is that
-interval arithmetic does not identify different occurences of the same
-variable. So, whenever possible, the user has to rewrite the formulas to
-eliminate multiple occurences of the same variable. For example,
-<code>square(x)-2*x</code> is far less precise than
-<code>square(x-1)-1</code>.</p>
+  <p>One of the biggest problems is problably the correct use of the
+  comparison functions and operators. First, functions and operators do not
+  try to know if two intervals are the same mathematical object. So, if the
+  comparison used is "certain", then <code>x != x</code> is always true
+  unless <code>x</code> is a singleton interval; and the same problem arises
+  with <code>cereq</code> and <code>cerne</code>.</p>
 
-<h4>Unprotected rounding</h4>
+  <p>Another misleading interpretation of the comparison is: you cannot
+  always expect [a,b] &lt; [c,d] to be !([a,b] &gt;= [c,d]) since the
+  comparison is not necessarily total. Equality and less comparison should be
+  seen as two distincts relational operators. However the default comparison
+  operators do respect this property since they throw an exception whenever
+  [a,b] and [c,d] overlap.</p>
 
-<p>As explained in <a href="rounding.htm#perf">this section</a>, a good way
-to speed up computations when the base type is a basic floating-point type is
-to unprotect the intervals at the hot spots of the algorithm. This method is
-safe and really an improvement for interval computations. But please remember
-that any basic floating-point operation executed inside the unprotection
-blocks will probably have an undefined behavior (but only for the current
-thread). And do not forget to create a rounding object as explained in the <a
-href="rounding.htm#perfexp">example</a>.</p>
+  <h4>Interval values and references</h4>
 
-<h2 id="rationale">Rationale</h2>
+  <p>This problem is a corollary of the previous problem with <code>x !=
+  x</code>. All the functions of the library only consider the value of an
+  interval and not the reference of an interval. In particular, you should
+  not expect (unless <code>x</code> is a singleton) the following values to
+  be equal: <code>x/x</code> and 1, <code>x*x</code> and
+  <code>square(x)</code>, <code>x-x</code> and 0, etc. So the main cause of
+  wide intervals is that interval arithmetic does not identify different
+  occurences of the same variable. So, whenever possible, the user has to
+  rewrite the formulas to eliminate multiple occurences of the same variable.
+  For example, <code>square(x)-2*x</code> is far less precise than
+  <code>square(x-1)-1</code>.</p>
 
-<p>The purpose of this library is to provide an efficient and generalized way
-to deal with interval arithmetic through the use of a templatized class
-<code>boost::interval</code>. The big contention for which we provide a
-rationale is the format of this class template.</p>
+  <h4>Unprotected rounding</h4>
 
-<p>It would have been easier to provide a class interval whose base type is
-double. Or to follow <code>std::complex</code> and allow only specializations
-for <code>float</code>, <code>double</code>, and <code>long double</code>. We
-decided not to do this to allow intervals on custom types, e.g.
-fixed-precision bigfloat library types (MPFR, etc), rational numbers, and so
-on.</p>
+  <p>As explained in <a href="rounding.htm#perf">this section</a>, a good way
+  to speed up computations when the base type is a basic floating-point type
+  is to unprotect the intervals at the hot spots of the algorithm. This
+  method is safe and really an improvement for interval computations. But
+  please remember that any basic floating-point operation executed inside the
+  unprotection blocks will probably have an undefined behavior (but only for
+  the current thread). And do not forget to create a rounding object as
+  explained in the <a href="rounding.htm#perfexp">example</a>.</p>
 
-<p><strong>Policy design.</strong> Although it was tempting to make it a
-class template with only one template argument, the diversity of uses for an
-interval arithmetic practically forced us to use policies. The behavior of
-this class can be fixed by two policies. These policies are packaged into a
-single policy class, rather than making <code>interval</code> with three
-template parameters. This is both for ease of use (the policy class can be
-picked by default) and for readability.</p>
+  <h2 id="rationale">Rationale</h2>
 
-<p>The first policy provides all the mathematical functions on the base type
-needed to define the functions on the interval type. The second one sets the
-way exceptional cases encountered during computations are handled.</p>
+  <p>The purpose of this library is to provide an efficient and generalized
+  way to deal with interval arithmetic through the use of a templatized class
+  <code>boost::interval</code>. The big contention for which we provide a
+  rationale is the format of this class template.</p>
 
-<p>We could foresee situations where any combination of these policies would
-be appropriate. Moreover, we wanted to enable the user of the library to
-reuse the <code>interval</code> class template while at the same time
-choosing his own behavior. See this <a href="guide.htm">page</a>  for some
-examples.</p>
+  <p>It would have been easier to provide a class interval whose base type is
+  double. Or to follow <code>std::complex</code> and allow only
+  specializations for <code>float</code>, <code>double</code>, and <code>long
+  double</code>. We decided not to do this to allow intervals on custom
+  types, e.g. fixed-precision bigfloat library types (MPFR, etc), rational
+  numbers, and so on.</p>
 
-<p><strong>Rounding policy.</strong> The library provides specialized
-implementations of the rounding policy for the primitive types float and
-double. In order for these implementations to be correct and fast, the
-library needs to work a lot with rounding modes. Some processors are directly
-dealt with and some mecanisms are provided in order to speed up the
-computations. It seems to be heavy and hazardous optimizations for a gain of
-only a few computer cycles; but in reality, the speed-up factor can easily go
-past 2 or 3 depending on the computer. Moreover, these optimizations do not
-impact the interface in any major way (with the design we have chosen,
-everything can be added by specialization or by passing different template
-parameters).</p>
+  <p><strong>Policy design.</strong> Although it was tempting to make it a
+  class template with only one template argument, the diversity of uses for
+  an interval arithmetic practically forced us to use policies. The behavior
+  of this class can be fixed by two policies. These policies are packaged
+  into a single policy class, rather than making <code>interval</code> with
+  three template parameters. This is both for ease of use (the policy class
+  can be picked by default) and for readability.</p>
 
-<p><strong>Pred/succ.</strong> In a previous version, two functions
-<code>pred</code> and <code>succ</code>, with various corollaries like
-<code>widen</code>, were supplied. The intent was to enlarge the interval by
-one ulp (as little as possible), e.g. to ensure the inclusion property. Since
-making interval a template of T, we could not define <i>ulp</i> for a random
-parameter. In turn, rounding policies let us eliminate entirely the use of
-ulp while making the intervals tighter (if a result is a representable
-singleton, there is no use to widen the interval). We decided to drop those
-functions.</p>
+  <p>The first policy provides all the mathematical functions on the base
+  type needed to define the functions on the interval type. The second one
+  sets the way exceptional cases encountered during computations are
+  handled.</p>
 
-<p><strong>Specialization of <code>std::less</code>.</strong> Since the
-operator <code>&lt;</code> depends on the comparison namespace locally chosen
-by the user, it is not possible to correctly specialize
-<code>std::less</code>. So you have to explicitely provide such a class to
-all the algorithms and templates that could require it (for example,
-<code>std::map</code>).</p>
+  <p>We could foresee situations where any combination of these policies
+  would be appropriate. Moreover, we wanted to enable the user of the library
+  to reuse the <code>interval</code> class template while at the same time
+  choosing his own behavior. See this <a href="guide.htm">page</a> for some
+  examples.</p>
 
-<p><strong>Input/output.</strong> The interval library does not include I/O
-operators. Printing an interval value allows a lot of customization: some
-people may want to output the bounds, others may want to display the median
-and the width of intervals, and so on. The example file io.cpp<code></code>
-shows some possibilities and may serve as a foundation in order for the user
-to define her own operators.</p>
+  <p><strong>Rounding policy.</strong> The library provides specialized
+  implementations of the rounding policy for the primitive types float and
+  double. In order for these implementations to be correct and fast, the
+  library needs to work a lot with rounding modes. Some processors are
+  directly dealt with and some mecanisms are provided in order to speed up
+  the computations. It seems to be heavy and hazardous optimizations for a
+  gain of only a few computer cycles; but in reality, the speed-up factor can
+  easily go past 2 or 3 depending on the computer. Moreover, these
+  optimizations do not impact the interface in any major way (with the design
+  we have chosen, everything can be added by specialization or by passing
+  different template parameters).</p>
 
-<p><strong>Mixed operations with integers.</strong> When using and reusing
-template codes, it is common there are operations like <code>2*x</code>.
-However, the library does not provide them by default because the conversion
-from <code>int</code> to the base number type is not always correct (think
-about the conversion from a 32bit integer to a single precision
-floating-point number). So the functions have been put in a separate header
-and the user needs to include them explicitely if she wants to benefit from
-these mixed operators. Another point, there is no mixed comparison operators
-due to the technical way they are defined.</p>
+  <p><strong>Pred/succ.</strong> In a previous version, two functions
+  <code>pred</code> and <code>succ</code>, with various corollaries like
+  <code>widen</code>, were supplied. The intent was to enlarge the interval
+  by one ulp (as little as possible), e.g. to ensure the inclusion property.
+  Since making interval a template of T, we could not define <i>ulp</i> for a
+  random parameter. In turn, rounding policies let us eliminate entirely the
+  use of ulp while making the intervals tighter (if a result is a
+  representable singleton, there is no use to widen the interval). We decided
+  to drop those functions.</p>
 
-<p><strong>Interval-aware functions.</strong> All the functions defined by
-the library are obviously aware they manipulate intervals and they do it
-accordingly to general interval arithmetic principles. Consequently they may
-have a different behavior than the one commonly encountered with functions
-not interval-aware. For example, <code>max</code> is defined by canonical set
-extension and the result is not always one of the two arguments (if the
-intervals do not overlap, then the result is one of the two intervals).</p>
+  <p><strong>Specialization of <code>std::less</code>.</strong> Since the
+  operator <code>&lt;</code> depends on the comparison namespace locally
+  chosen by the user, it is not possible to correctly specialize
+  <code>std::less</code>. So you have to explicitely provide such a class to
+  all the algorithms and templates that could require it (for example,
+  <code>std::map</code>).</p>
 
-<p>This behavior is different from <code>std::max</code> which returns a
-reference on one of its arguments. So if the user expects a reference to be
-returned, she should use <code>std::max</code> since it is exactly what this
-function does. Please note that <code>std::max</code> will throw an exception
-when the intervals overlap. This behavior does not predate the one described
-by the C++ standard since the arguments are not "equivalent" and it allows to
-have an equivalence between <code>a &lt;= b</code> and <code>&amp;b ==
-&amp;std::max(a,b)</code>(some particular cases may be
-implementation-defined). However it is different from the one described by
-SGI since it does not return the first argument even if "neither is greater
-than the other".</p>
+  <p><strong>Input/output.</strong> The interval library does not include I/O
+  operators. Printing an interval value allows a lot of customization: some
+  people may want to output the bounds, others may want to display the median
+  and the width of intervals, and so on. The example file io.cpp shows some
+  possibilities and may serve as a foundation in order for the user to define
+  her own operators.</p>
 
-<h2 id="acks">History and Acknowledgments</h2>
+  <p><strong>Mixed operations with integers.</strong> When using and reusing
+  template codes, it is common there are operations like <code>2*x</code>.
+  However, the library does not provide them by default because the
+  conversion from <code>int</code> to the base number type is not always
+  correct (think about the conversion from a 32bit integer to a single
+  precision floating-point number). So the functions have been put in a
+  separate header and the user needs to include them explicitely if she wants
+  to benefit from these mixed operators. Another point, there is no mixed
+  comparison operators due to the technical way they are defined.</p>
 
-<p>This library was mostly inspired by previous work from Jens Maurer. Some
-discussions about his work are reproduced <a
-href="http://www.mscs.mu.edu/%7Egeorgec/IFAQ/maurer1.html">here</a>.
-Jeremy Siek and Maarten Keijzer provided some rounding control for MSVC and
-Sparc platforms.</p>
+  <p><strong>Interval-aware functions.</strong> All the functions defined by
+  the library are obviously aware they manipulate intervals and they do it
+  accordingly to general interval arithmetic principles. Consequently they
+  may have a different behavior than the one commonly encountered with
+  functions not interval-aware. For example, <code>max</code> is defined by
+  canonical set extension and the result is not always one of the two
+  arguments (if the intervals do not overlap, then the result is one of the
+  two intervals).</p>
 
-<p>Guillaume Melquiond, Hervé Brönnimann and Sylvain Pion started from the
-library left by Jens and added the policy design. Guillaume and Sylvain
-worked hard on the code, especially the porting and mostly tuning of the
-rounding modes to the different architectures. Guillaume did most of the
-coding, while Sylvain and Hervé have provided some useful comments in order
-for this library to be written. Hervé reorganized and wrote chapters of the
-documentation based on Guillaume's great starting point.</p>
+  <p>This behavior is different from <code>std::max</code> which returns a
+  reference on one of its arguments. So if the user expects a reference to be
+  returned, she should use <code>std::max</code> since it is exactly what
+  this function does. Please note that <code>std::max</code> will throw an
+  exception when the intervals overlap. This behavior does not predate the
+  one described by the C++ standard since the arguments are not "equivalent"
+  and it allows to have an equivalence between <code>a &lt;= b</code> and
+  <code>&amp;b == &amp;std::max(a,b)</code>(some particular cases may be
+  implementation-defined). However it is different from the one described by
+  SGI since it does not return the first argument even if "neither is greater
+  than the other".</p>
 
-<p>This material is partly based upon work supported by the National Science
-Foundation under NSF CAREER Grant CCR-0133599. Any opinions, findings and
-conclusions or recommendations expressed in this material are those of the
-author(s) and do not necessarily reflect the views of the National Science
-Foundation (NSF).</p>
-<hr>
+  <h2 id="acks">History and Acknowledgments</h2>
 
-<p>Revised: 2006-02-02<br>
-Copyright (c) Guillaume Melquiond, Sylvain Pion, Hervé Brönnimann, 2002.
-Polytechnic University.<br>
-Copyright (c) Guillaume Melquiond, 2003-2006. ENS Lyon.</p>
+  <p>This library was mostly inspired by previous work from Jens Maurer. Some
+  discussions about his work are reproduced <a href=
+  "http://www.mscs.mu.edu/%7Egeorgec/IFAQ/maurer1.html">here</a>. Jeremy Siek
+  and Maarten Keijzer provided some rounding control for MSVC and Sparc
+  platforms.</p>
+
+  <p>Guillaume Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion
+  started from the library left by Jens and added the policy design.
+  Guillaume and Sylvain worked hard on the code, especially the porting and
+  mostly tuning of the rounding modes to the different architectures.
+  Guillaume did most of the coding, while Sylvain and Herv&eacute; have
+  provided some useful comments in order for this library to be written.
+  Herv&eacute; reorganized and wrote chapters of the documentation based on
+  Guillaume's great starting point.</p>
+
+  <p>This material is partly based upon work supported by the National
+  Science Foundation under NSF CAREER Grant CCR-0133599. Any opinions,
+  findings and conclusions or recommendations expressed in this material are
+  those of the author(s) and do not necessarily reflect the views of the
+  National Science Foundation (NSF).</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y-%m-%d" startspan -->2006-12-25<!--webbot bot="Timestamp" endspan i-checksum="12174" --></p>
+
+  <p><i>Copyright &copy; 2002 Guillaume Melquiond, Sylvain Pion, Herv&eacute;
+  Br&ouml;nnimann, Polytechnic University<br>
+  Copyright &copy; 2003-2006 Guillaume Melquiond, ENS Lyon</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/numeric/interval/doc/numbers.htm
===================================================================
--- boost/trunk/libs/numeric/interval/doc/numbers.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/interval/doc/numbers.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,146 +1,176 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
-    "http://www.w3.org/TR/html4/loose.dtd">
+"http://www.w3.org/TR/html4/loose.dtd">
+
 <html>
 <head>
-  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
   <link rel="stylesheet" type="text/css" href="../../../../boost.css">
+
   <title>Numbers Requirements</title>
 </head>
 
 <body lang="en">
-<h1>Numbers Requirements</h1>
+  <h1>Numbers Requirements</h1>
 
-<p>What we call "number" is the base type of the <code>interval</code> class.
-The interval library expect a lot of properties from this base type in order
-to respect the inclusion property. All these properties are already detailed
-in the other sections of this documentation; but we will try to summarize
-them here.</p>
+  <p>What we call "number" is the base type of the <code>interval</code>
+  class. The interval library expect a lot of properties from this base type
+  in order to respect the inclusion property. All these properties are
+  already detailed in the other sections of this documentation; but we will
+  try to summarize them here.</p>
 
-<h3>Ordering</h3>
+  <h3>Ordering</h3>
 
-<p>The numbers need to be supplied with an ordering. This ordering expresses
-itself by the operators <code>&lt; &lt;= =&gt; &gt; == !=</code>. It must be
-a total order (reflexivity, antisymmetry, transitivity, and each pair of
-numbers is ordered). So <code>complex&lt;T&gt;</code> will not be a good
-candidate for the base type; if you need the inclusion property of interval
-property, you should use <code>complex&lt; interval&lt;T&gt; &gt;</code> in
-place of <code>interval&lt; complex&lt;T&gt; &gt;</code> (but unfortunately,
-<code>complex</code> only provides specialization).</p>
+  <p>The numbers need to be supplied with an ordering. This ordering
+  expresses itself by the operators <code>&lt; &lt;= =&gt; &gt; == !=</code>.
+  It must be a total order (reflexivity, antisymmetry, transitivity, and each
+  pair of numbers is ordered). So <code>complex&lt;T&gt;</code> will not be a
+  good candidate for the base type; if you need the inclusion property of
+  interval property, you should use <code>complex&lt; interval&lt;T&gt;
+  &gt;</code> in place of <code>interval&lt; complex&lt;T&gt; &gt;</code>
+  (but unfortunately, <code>complex</code> only provides specialization).</p>
 
-<p>Please note that invalid numbers are not concerned by the order; it can
-even be conceptually better if a comparison with these invalid numbers is
-always <code>false</code> (except for <code>!=</code>). If your checking
-policy uses <code>interval_lib::checking_base</code> and your base type
-contains invalid numbers, then this property is needed: <code>nan!=nan</code>
-(here <code>nan</code> is an invalid number). If this property is not
-present, then you should not use <code>checking_base</code> directly.</p>
+  <p>Please note that invalid numbers are not concerned by the order; it can
+  even be conceptually better if a comparison with these invalid numbers is
+  always <code>false</code> (except for <code>!=</code>). If your checking
+  policy uses <code>interval_lib::checking_base</code> and your base type
+  contains invalid numbers, then this property is needed:
+  <code>nan!=nan</code> (here <code>nan</code> is an invalid number). If this
+  property is not present, then you should not use <code>checking_base</code>
+  directly.</p>
 
-<p>Interval arithmetic involves a lot of comparison to zero. By default, they
-are done by comparing the numbers to <code>static_cast&lt;T&gt;(0)</code>.
-However, if the format of the numbers allows some faster comparisons when
-dealing with zero, the template functions in the
-<code>interval_lib::user</code> namespace can be specialized:</p>
-<pre>namespace user {
+  <p>Interval arithmetic involves a lot of comparison to zero. By default,
+  they are done by comparing the numbers to
+  <code>static_cast&lt;T&gt;(0)</code>. However, if the format of the numbers
+  allows some faster comparisons when dealing with zero, the template
+  functions in the <code>interval_lib::user</code> namespace can be
+  specialized:</p>
+  <pre>
+namespace user {
 template&lt;class T&gt; inline bool is_zero(T const &amp;v) { return v == static_cast&lt;T&gt;(0); }
 template&lt;class T&gt; inline bool is_neg (T const &amp;v) { return v &lt;  static_cast&lt;T&gt;(0); }
 template&lt;class T&gt; inline bool is_pos (T const &amp;v) { return v &gt;  static_cast&lt;T&gt;(0); }
-}</pre>
+}
+</pre>
 
-<h3>Numeric limits</h3>
+  <h3>Numeric limits</h3>
 
-<p>Another remark about the checking policy. It normally is powerful enough
-to handle the exceptional behavior that the basic type could induce; in
-particular infinite and invalid numbers (thanks to the four functions
-<code>pos_inf</code>, <code>neg_inf</code>, <code>nan</code> and
-<code>is_nan</code>). However, if you use
-<code>interval_lib::checking_base</code> (and the default checking policy
-uses it), your base type should have a correctly specialized
-<code>std::numeric_limits&lt;T&gt;</code>. In particular, the values
-<code>has_infinity</code> and <code>has_quiet_NaN</code>, and the functions
-<code>infinity</code> and <code>quiet_NaN</code> should be accordingly
-defined.</p>
+  <p>Another remark about the checking policy. It normally is powerful enough
+  to handle the exceptional behavior that the basic type could induce; in
+  particular infinite and invalid numbers (thanks to the four functions
+  <code>pos_inf</code>, <code>neg_inf</code>, <code>nan</code> and
+  <code>is_nan</code>). However, if you use
+  <code>interval_lib::checking_base</code> (and the default checking policy
+  uses it), your base type should have a correctly specialized
+  <code>std::numeric_limits&lt;T&gt;</code>. In particular, the values
+  <code>has_infinity</code> and <code>has_quiet_NaN</code>, and the functions
+  <code>infinity</code> and <code>quiet_NaN</code> should be accordingly
+  defined.</p>
 
-<p>So, to summarize, if you do not rely on the default policy and do not use
-<code>interval_lib::checking_base</code>, it is not necessary to have a
-specialization of the numeric limits for your base type.</p>
+  <p>So, to summarize, if you do not rely on the default policy and do not
+  use <code>interval_lib::checking_base</code>, it is not necessary to have a
+  specialization of the numeric limits for your base type.</p>
 
-<h3>Mathematical properties</h3>
+  <h3>Mathematical properties</h3>
 
-<p>Ensuring the numbers are correctly ordered is not enough. The basic
-operators should also respect some properties depending on the order. Here
-they are:</p>
-<ul>
-  <li>0 &#x2264; <i>x</x>&#x21d2; -<i>x</i> &#x2264; 0</i></li>
-  <li><i>x</i> &#x2264; <i>y</i> &#x21d2; -<i>y</i> &#x2264; -<i>x</i></li>
-  <li><i>x</i> &#x2264; <i>y</i> &#x21d2; <i>x</i>+<i>z</i> &#x2264;
+  <p>Ensuring the numbers are correctly ordered is not enough. The basic
+  operators should also respect some properties depending on the order. Here
+  they are:</p>
+
+  <ul>
+    <li>0 &le; <i>x</i> &rArr; -<i>x</i> &le; 0</li>
+
+    <li><i>x</i> &le; <i>y</i> &rArr; -<i>y</i> &le; -<i>x</i></li>
+
+    <li><i>x</i> &le; <i>y</i> &rArr; <i>x</i>+<i>z</i> &le;
     <i>y</i>+<i>z</i></li>
-  <li><i>x</i> &#x2264; <i>y</i> and <i>z</i> &#x2265; 0 &#x21d2;
-    <i>x</i>×<i>z</i> &#x2264; <i>y</i>×<i>z</i></li>
-  <li>0 &lt; <i>x</i> &#x2264; <i>y</i> &#x21d2; 0 &lt; 1/<i>y</i> &#x2264;
+
+    <li><i>x</i> &le; <i>y</i> and <i>z</i> &ge; 0 &rArr;
+    <i>x</i>&times;<i>z</i> &le; <i>y</i>&times;<i>z</i></li>
+
+    <li>0 &lt; <i>x</i> &le; <i>y</i> &rArr; 0 &lt; 1/<i>y</i> &le;
     1/<i>x</i></li>
-</ul>
+  </ul>
 
-<p>The previous properties are also used (and enough) for <code>abs</code>,
-<code>square</code> and <code>pow</code>. For all the transcendental
-functions (including <code>sqrt</code>), other properties are needed. These
-functions should have the same properties than the corresponding real
-functions. For example, the expected properties for <code>cos</code> are:</p>
-<ul>
-  <li><code>cos</code> is defined for all the valid numbers;</li>
-  <li>it is 2&#x3c0;-periodic;</li>
-  <li><code>cos</code>(2&#x3c0;-<i>x</i>) is equal to
+  <p>The previous properties are also used (and enough) for <code>abs</code>,
+  <code>square</code> and <code>pow</code>. For all the transcendental
+  functions (including <code>sqrt</code>), other properties are needed. These
+  functions should have the same properties than the corresponding real
+  functions. For example, the expected properties for <code>cos</code>
+  are:</p>
+
+  <ul>
+    <li><code>cos</code> is defined for all the valid numbers;</li>
+
+    <li>it is 2&pi;-periodic;</li>
+
+    <li><code>cos</code>(2&pi;-<i>x</i>) is equal to
     <code>cos</code>(<i>x</i>);</li>
-  <li><code>cos</code> is a decreasing function on [0,2&#x3c0;].</li>
-</ul>
 
-<h3>Rounding</h3>
+    <li><code>cos</code> is a decreasing function on [0,2&pi;].</li>
+  </ul>
 
-<p>If you work with a base type and no inexact result is ever computed, you
-can skip the rest of this paragraph. You can also skip it if you are not
-interested in the inclusion property (if approximate results are enough). If
-you are still reading, it is probably because you want to know the basic
-properties the rounding policy should validate.</p>
+  <h3>Rounding</h3>
 
-<p>Whichever operation or function you consider, the following property
-should be respected: <code>f_down(x,y) &lt;= f(x,y) &lt;= f_up(x,y)</code>.
-Here, <code>f</code> denotes the infinitely precise function computed and
-<code>f_down</code> and <code>f_up</code> are functions which return possibly
-inexact values but of the correct type (the base type). If possible, they
-should try to return the nearest representable value, but it is not always
-easy.</p>
+  <p>If you work with a base type and no inexact result is ever computed, you
+  can skip the rest of this paragraph. You can also skip it if you are not
+  interested in the inclusion property (if approximate results are enough).
+  If you are still reading, it is probably because you want to know the basic
+  properties the rounding policy should validate.</p>
 
-<h3>Constants</h3>
+  <p>Whichever operation or function you consider, the following property
+  should be respected: <code>f_down(x,y) &lt;= f(x,y) &lt;= f_up(x,y)</code>.
+  Here, <code>f</code> denotes the infinitely precise function computed and
+  <code>f_down</code> and <code>f_up</code> are functions which return
+  possibly inexact values but of the correct type (the base type). If
+  possible, they should try to return the nearest representable value, but it
+  is not always easy.</p>
 
-<p>In order for the trigonometric functions to correctly work, the library
-need to know the value of the &#x3c0; constant (and also &#x3c0;/2 and
-2&#x3c0;). Since these constants may not be representable in the base type,
-the library does not have to know the exact value: a lower bound and an upper
-bound are enough. If these values are not provided by the user, the default
-values will be used: they are integer values (so &#x3c0; is bounded by 3 and
-4).</p>
+  <h3>Constants</h3>
 
-<h3>Operators and conversions</h3>
+  <p>In order for the trigonometric functions to correctly work, the library
+  need to know the value of the &pi; constant (and also &pi;/2 and 2&pi;).
+  Since these constants may not be representable in the base type, the
+  library does not have to know the exact value: a lower bound and an upper
+  bound are enough. If these values are not provided by the user, the default
+  values will be used: they are integer values (so &pi; is bounded by 3 and
+  4).</p>
 
-<p>As explained at the beginning, the comparison operators should be defined
-for the base type. The rounding policy defines a lot of functions used by the
-interval library. So the arithmetic operators do not need to be defined for
-the base type (unless required by one of the predefined classes). However,
-there is an exception: the unary minus need to be defined. Moreover, this
-operator should only provide exact results; it is the reason why the rounding
-policy does not provide some negation functions.</p>
+  <h3>Operators and conversions</h3>
 
-<p>The conversion from <code>int</code> to the base type needs to be defined
-(only a few values need to be available: -1, 0, 1, 2). The conversion the
-other way around is provided by the rounding policy (<code>int_down</code>
-and <code>int_up</code> members); and no other conversion is strictly needed.
-However, it may be valuable to provide as much conversions as possible in the
-rounding policy (<code>conv_down</code> and <code>conv_up</code> members) in
-order to benefit from interval conversions.</p>
-<hr>
+  <p>As explained at the beginning, the comparison operators should be
+  defined for the base type. The rounding policy defines a lot of functions
+  used by the interval library. So the arithmetic operators do not need to be
+  defined for the base type (unless required by one of the predefined
+  classes). However, there is an exception: the unary minus need to be
+  defined. Moreover, this operator should only provide exact results; it is
+  the reason why the rounding policy does not provide some negation
+  functions.</p>
 
-<p>Revised: 2004-02-17<br>
-Copyright (c) Guillaume Melquiond, Sylvain Pion, Hervé Brönnimann, 2002.
-Polytechnic University.<br>
-Copyright (c) Guillaume Melquiond, 2004.</p>
+  <p>The conversion from <code>int</code> to the base type needs to be
+  defined (only a few values need to be available: -1, 0, 1, 2). The
+  conversion the other way around is provided by the rounding policy
+  (<code>int_down</code> and <code>int_up</code> members); and no other
+  conversion is strictly needed. However, it may be valuable to provide as
+  much conversions as possible in the rounding policy (<code>conv_down</code>
+  and <code>conv_up</code> members) in order to benefit from interval
+  conversions.</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y-%m-%d" startspan -->2006-12-24<!--webbot bot="Timestamp" endspan i-checksum="12172" --></p>
+
+  <p><i>Copyright &copy; 2002 Guillaume Melquiond, Sylvain Pion, Herv&eacute;
+  Br&ouml;nnimann, Polytechnic University<br>
+  Copyright &copy; 2004 Guillaume Melquiond</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/numeric/interval/doc/policies.htm
===================================================================
--- boost/trunk/libs/numeric/interval/doc/policies.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/interval/doc/policies.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,23 +1,27 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
-    "http://www.w3.org/TR/html4/loose.dtd">
+"http://www.w3.org/TR/html4/loose.dtd">
+
 <html>
 <head>
-  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
   <link rel="stylesheet" type="text/css" href="../../../../boost.css">
+
   <title>Policies</title>
 </head>
 
 <body lang="en">
-<h1>Policies</h1>
+  <h1>Policies</h1>
 
-<p>The <code>interval</code> template requires two arguments. The first
-corresponds to the base type chosen for the bounds. And the second defines
-the <a href="rounding.htm">rounding</a> and <a
-href="checking.htm">checking</a> behaviors of the newly constructed class.
-This second argument is not mandatory but may need some customizations. In
-order to ease the manipulations, some helper templates are provided in
-<code>interval/policies.hpp</code>.</p>
-<pre>namespace boost {
+  <p>The <code>interval</code> template requires two arguments. The first
+  corresponds to the base type chosen for the bounds. And the second defines
+  the <a href="rounding.htm">rounding</a> and <a href=
+  "checking.htm">checking</a> behaviors of the newly constructed class. This
+  second argument is not mandatory but may need some customizations. In order
+  to ease the manipulations, some helper templates are provided in
+  <code>interval/policies.hpp</code>.</p>
+  <pre>
+namespace boost {
 namespace numeric {
 namespace interval_lib {
 
@@ -44,21 +48,33 @@
 
 } // namespace interval_lib
 } // namespace numeric
-} // namespace boost</pre>
+} // namespace boost
+</pre>
 
-<p>The <code>policies</code> template should be used whenever the user needs
-to define a policy structure for an <code>interval</code> class.
-<code>change_rounding</code> and <code>change_checking</code> can be used to
-get the type of a new interval by changing one of the policies of an old
-interval; the new type is available thanks to the type definition
-<code>type</code>. Finally, <code>unprotect</code> looks like
-<code>change_rounding</code> and directly changes the rounding of an interval
-to its unprotected version (a better explanation is available <a
-href="rounding.htm#perfexp">here</a>).</p>
-<hr>
+  <p>The <code>policies</code> template should be used whenever the user
+  needs to define a policy structure for an <code>interval</code> class.
+  <code>change_rounding</code> and <code>change_checking</code> can be used
+  to get the type of a new interval by changing one of the policies of an old
+  interval; the new type is available thanks to the type definition
+  <code>type</code>. Finally, <code>unprotect</code> looks like
+  <code>change_rounding</code> and directly changes the rounding of an
+  interval to its unprotected version (a better explanation is available
+  <a href="rounding.htm#perfexp">here</a>).</p>
+  <hr>
 
-<p>Revised: 2003-01-21<br>
-Copyright (c) Guillaume Melquiond, Sylvain Pion, Hervé Brönnimann, 2002.<br>
-Polytechnic University.</p>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y-%m-%d" startspan -->2006-12-24<!--webbot bot="Timestamp" endspan i-checksum="12172" --></p>
+
+  <p><i>Copyright &copy; 2002 Guillaume Melquiond, Sylvain Pion, Herv&eacute;
+  Br&ouml;nnimann, Polytechnic University</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/numeric/interval/doc/rounding.htm
===================================================================
--- boost/trunk/libs/numeric/interval/doc/rounding.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/interval/doc/rounding.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,161 +1,169 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
-    "http://www.w3.org/TR/html4/loose.dtd">
+"http://www.w3.org/TR/html4/loose.dtd">
+
 <html>
 <head>
-  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
   <link rel="stylesheet" type="text/css" href="../../../../boost.css">
+
   <title>Rounding Policies</title>
 </head>
 
 <body lang="en">
-<h1>Rounding Policies</h1>
+  <h1>Rounding Policies</h1>
 
-<p>In order to be as general as possible, the library uses a class to compute
-all the necessary functions rounded upward or downward. This class is the
-first parameter of <code>policies</code>, it is also the type named
-<code>rounding</code> in the policy definition of <code>interval</code>.</p>
+  <p>In order to be as general as possible, the library uses a class to
+  compute all the necessary functions rounded upward or downward. This class
+  is the first parameter of <code>policies</code>, it is also the type named
+  <code>rounding</code> in the policy definition of
+  <code>interval</code>.</p>
 
-<p>By default, it is <code>interval_lib::rounded_math&lt;T&gt;</code>. The
-class <code>interval_lib::rounded_math</code> is already specialized for the
-standard floating types (<code>float</code> , <code>double</code> and
-<code>long double</code>). So if the base type of your intervals is not one
-of these, a good solution would probably be to provide a specialization of
-this class. But if the default specialization of
-<code>rounded_math&lt;T&gt;</code> for <code>float</code>,
-<code>double</code>, or <code>long double</code> is not what you seek, or you
-do not want to specialize <code>interval_lib::rounded_math&lt;T&gt;</code>
-(say because you prefer to work in your own namespace) you can also define
-your own rounding policy and pass it directly to
-<code>interval_lib::policies</code>.</p>
+  <p>By default, it is <code>interval_lib::rounded_math&lt;T&gt;</code>. The
+  class <code>interval_lib::rounded_math</code> is already specialized for
+  the standard floating types (<code>float</code> , <code>double</code> and
+  <code>long double</code>). So if the base type of your intervals is not one
+  of these, a good solution would probably be to provide a specialization of
+  this class. But if the default specialization of
+  <code>rounded_math&lt;T&gt;</code> for <code>float</code>,
+  <code>double</code>, or <code>long double</code> is not what you seek, or
+  you do not want to specialize
+  <code>interval_lib::rounded_math&lt;T&gt;</code> (say because you prefer to
+  work in your own namespace) you can also define your own rounding policy
+  and pass it directly to <code>interval_lib::policies</code>.</p>
 
-<h2>Requirements</h2>
+  <h2>Requirements</h2>
 
-<p>Here comes what the class is supposed to provide. The domains are written
-next to their respective functions (as you can see, the functions do not have
-to worry about invalid values, but they have to handle infinite
-arguments).</p>
-<pre>/* Rounding requirements */
+  <p>Here comes what the class is supposed to provide. The domains are
+  written next to their respective functions (as you can see, the functions
+  do not have to worry about invalid values, but they have to handle infinite
+  arguments).</p>
+  <pre>
+/* Rounding requirements */
 struct rounding {
   // defaut constructor, destructor
   rounding();
   ~rounding();
   // mathematical operations
-  T add_down(T, T); // [-&#x221e;;+&#x221e;][-&#x221e;;+&#x221e;]
-  T add_up  (T, T); // [-&#x221e;;+&#x221e;][-&#x221e;;+&#x221e;]
-  T sub_down(T, T); // [-&#x221e;;+&#x221e;][-&#x221e;;+&#x221e;]
-  T sub_up  (T, T); // [-&#x221e;;+&#x221e;][-&#x221e;;+&#x221e;]
-  T mul_down(T, T); // [-&#x221e;;+&#x221e;][-&#x221e;;+&#x221e;]
-  T mul_up  (T, T); // [-&#x221e;;+&#x221e;][-&#x221e;;+&#x221e;]
-  T div_down(T, T); // [-&#x221e;;+&#x221e;]([-&#x221e;;+&#x221e;]-{0})
-  T div_up  (T, T); // [-&#x221e;;+&#x221e;]([-&#x221e;;+&#x221e;]-{0})
-  T sqrt_down(T);   // ]0;+&#x221e;]
-  T sqrt_up  (T);   // ]0;+&#x221e;]
-  T exp_down(T);    // [-&#x221e;;+&#x221e;]
-  T exp_up  (T);    // [-&#x221e;;+&#x221e;]
-  T log_down(T);    // ]0;+&#x221e;]
-  T log_up  (T);    // ]0;+&#x221e;]
-  T cos_down(T);    // [0;2&#x3c0;]
-  T cos_up  (T);    // [0;2&#x3c0;]
-  T tan_down(T);    // ]-&#x3c0;/2;&#x3c0;/2[
-  T tan_up  (T);    // ]-&#x3c0;/2;&#x3c0;/2[
+  T add_down(T, T); // [-&infin;;+&infin;][-&infin;;+&infin;]
+  T add_up  (T, T); // [-&infin;;+&infin;][-&infin;;+&infin;]
+  T sub_down(T, T); // [-&infin;;+&infin;][-&infin;;+&infin;]
+  T sub_up  (T, T); // [-&infin;;+&infin;][-&infin;;+&infin;]
+  T mul_down(T, T); // [-&infin;;+&infin;][-&infin;;+&infin;]
+  T mul_up  (T, T); // [-&infin;;+&infin;][-&infin;;+&infin;]
+  T div_down(T, T); // [-&infin;;+&infin;]([-&infin;;+&infin;]-{0})
+  T div_up  (T, T); // [-&infin;;+&infin;]([-&infin;;+&infin;]-{0})
+  T sqrt_down(T);   // ]0;+&infin;]
+  T sqrt_up  (T);   // ]0;+&infin;]
+  T exp_down(T);    // [-&infin;;+&infin;]
+  T exp_up  (T);    // [-&infin;;+&infin;]
+  T log_down(T);    // ]0;+&infin;]
+  T log_up  (T);    // ]0;+&infin;]
+  T cos_down(T);    // [0;2&pi;]
+  T cos_up  (T);    // [0;2&pi;]
+  T tan_down(T);    // ]-&pi;/2;&pi;/2[
+  T tan_up  (T);    // ]-&pi;/2;&pi;/2[
   T asin_down(T);   // [-1;1]
   T asin_up  (T);   // [-1;1]
   T acos_down(T);   // [-1;1]
   T acos_up  (T);   // [-1;1]
-  T atan_down(T);   // [-&#x221e;;+&#x221e;]
-  T atan_up  (T);   // [-&#x221e;;+&#x221e;]
-  T sinh_down(T);   // [-&#x221e;;+&#x221e;]
-  T sinh_up  (T);   // [-&#x221e;;+&#x221e;]
-  T cosh_down(T);   // [-&#x221e;;+&#x221e;]
-  T cosh_up  (T);   // [-&#x221e;;+&#x221e;]
-  T tanh_down(T);   // [-&#x221e;;+&#x221e;]
-  T tanh_up  (T);   // [-&#x221e;;+&#x221e;]
-  T asinh_down(T);  // [-&#x221e;;+&#x221e;]
-  T asinh_up  (T);  // [-&#x221e;;+&#x221e;]
-  T acosh_down(T);  // [1;+&#x221e;]
-  T acosh_up  (T);  // [1;+&#x221e;]
+  T atan_down(T);   // [-&infin;;+&infin;]
+  T atan_up  (T);   // [-&infin;;+&infin;]
+  T sinh_down(T);   // [-&infin;;+&infin;]
+  T sinh_up  (T);   // [-&infin;;+&infin;]
+  T cosh_down(T);   // [-&infin;;+&infin;]
+  T cosh_up  (T);   // [-&infin;;+&infin;]
+  T tanh_down(T);   // [-&infin;;+&infin;]
+  T tanh_up  (T);   // [-&infin;;+&infin;]
+  T asinh_down(T);  // [-&infin;;+&infin;]
+  T asinh_up  (T);  // [-&infin;;+&infin;]
+  T acosh_down(T);  // [1;+&infin;]
+  T acosh_up  (T);  // [1;+&infin;]
   T atanh_down(T);  // [-1;1]
   T atanh_up  (T);  // [-1;1] 
-  T median(T, T);   // [-&#x221e;;+&#x221e;][-&#x221e;;+&#x221e;]
-  T int_down(T);    // [-&#x221e;;+&#x221e;]
-  T int_up  (T);    // [-&#x221e;;+&#x221e;]
+  T median(T, T);   // [-&infin;;+&infin;][-&infin;;+&infin;]
+  T int_down(T);    // [-&infin;;+&infin;]
+  T int_up  (T);    // [-&infin;;+&infin;]
   // conversion functions
   T conv_down(U);
   T conv_up  (U);
   // unprotected rounding class
   typedef ... unprotected_rounding;
-};</pre>
+};
+</pre>
 
-<p>The constructor and destructor of the rounding class have a very important
-semantic requirement: they are responsible for setting and resetting the
-rounding modes of the computation on T. For instance, if T is a standard
-floating point type and floating point computation is performed according to
-the Standard IEEE 754, the constructor can save the current rounding state,
-each <code>_up</code> (resp. <code>_down</code>) function will round up
-(resp. down), and the destructor will restore the saved rounding state.
-Indeed this is the behavior of the default rounding policy.</p>
+  <p>The constructor and destructor of the rounding class have a very
+  important semantic requirement: they are responsible for setting and
+  resetting the rounding modes of the computation on T. For instance, if T is
+  a standard floating point type and floating point computation is performed
+  according to the Standard IEEE 754, the constructor can save the current
+  rounding state, each <code>_up</code> (resp. <code>_down</code>) function
+  will round up (resp. down), and the destructor will restore the saved
+  rounding state. Indeed this is the behavior of the default rounding
+  policy.</p>
 
-<p>The meaning of all the mathematical functions up until
-<code>atanh_up</code> is clear: each function returns number representable in
-the type <code>T</code> which is a lower bound (for<code> _down</code>) or
-upper bound (for <code>_up</code>) on the true mathematical result of the
-corresponding function. The function <code>median</code> computes the average
-of its two arguments rounded to its nearest representable number. The
-functions <code>int_down</code> and <code>int_up</code> compute the nearest
-integer smaller or bigger than their argument. Finally,
-<code>conv_down</code> and <code>conv_up</code> are responsible of the
-conversions of values of other types to the base number type: the first one
-must round down the value and the second one must round it up.</p>
+  <p>The meaning of all the mathematical functions up until
+  <code>atanh_up</code> is clear: each function returns number representable
+  in the type <code>T</code> which is a lower bound (for <code>_down</code>)
+  or upper bound (for <code>_up</code>) on the true mathematical result of
+  the corresponding function. The function <code>median</code> computes the
+  average of its two arguments rounded to its nearest representable number.
+  The functions <code>int_down</code> and <code>int_up</code> compute the
+  nearest integer smaller or bigger than their argument. Finally,
+  <code>conv_down</code> and <code>conv_up</code> are responsible of the
+  conversions of values of other types to the base number type: the first one
+  must round down the value and the second one must round it up.</p>
 
-<p>The type <code>unprotected_rounding</code> allows to remove all controls.
-For reasons why one might to do this, see the <a
-href="#Protection">protection</a> paragraph below.</p>
+  <p>The type <code>unprotected_rounding</code> allows to remove all
+  controls. For reasons why one might to do this, see the <a href=
+  "#Protection">protection</a> paragraph below.</p>
 
-<h2>Overview of the provided classes</h2>
+  <h2>Overview of the provided classes</h2>
 
-<p>A lot of classes are provided. The classes are organized by level. At the
-bottom is the class <code>rounding_control</code>. At the next level come
-<code>rounded_arith_exact</code>, <code>rounded_arith_std</code> and
-<code>rounded_arith_opp</code>. Then there are
-<code>rounded_transc_dummy</code>, <code>rounded_transc_exact</code>,
-<code>rounded_transc_std</code> and <code>rounded_transc_opp</code>. And
-finally are <code>save_state</code> and <code>save_state_nothing</code>. Each
-of these classes provide a set of members that are required by the classes of
-the next level. For example, a <code>rounded_transc_...</code> class needs
-the members of a <code>rounded_arith_...</code> class.</p>
+  <p>A lot of classes are provided. The classes are organized by level. At
+  the bottom is the class <code>rounding_control</code>. At the next level
+  come <code>rounded_arith_exact</code>, <code>rounded_arith_std</code> and
+  <code>rounded_arith_opp</code>. Then there are
+  <code>rounded_transc_dummy</code>, <code>rounded_transc_exact</code>,
+  <code>rounded_transc_std</code> and <code>rounded_transc_opp</code>. And
+  finally are <code>save_state</code> and <code>save_state_nothing</code>.
+  Each of these classes provide a set of members that are required by the
+  classes of the next level. For example, a <code>rounded_transc_...</code>
+  class needs the members of a <code>rounded_arith_...</code> class.</p>
 
-<p>When they exist in two versions <code>_std</code> and <code>_opp</code>,
-the first one does switch the rounding mode each time, and the second one
-tries to keep it oriented toward plus infinity. The main purpose of the
-<code>_opp</code> version is to speed up the computations through the use of
-the "opposite trick" (see the <a href="#perf">performance notes</a>). This
-version requires the rounding mode to be upward before entering any
-computation functions of the class. It guarantees that the rounding mode will
-still be upward at the exit of the functions.</p>
+  <p>When they exist in two versions <code>_std</code> and <code>_opp</code>,
+  the first one does switch the rounding mode each time, and the second one
+  tries to keep it oriented toward plus infinity. The main purpose of the
+  <code>_opp</code> version is to speed up the computations through the use
+  of the "opposite trick" (see the <a href="#perf">performance notes</a>).
+  This version requires the rounding mode to be upward before entering any
+  computation functions of the class. It guarantees that the rounding mode
+  will still be upward at the exit of the functions.</p>
 
-<p>Please note that it is really a very bad idea to mix the <code>_opp</code>
-version with the <code>_std</code> since they do not have compatible
-properties.</p>
+  <p>Please note that it is really a very bad idea to mix the
+  <code>_opp</code> version with the <code>_std</code> since they do not have
+  compatible properties.</p>
 
-<p>There is a third version named <code>_exact</code> which computes the
-functions without changing the rounding mode. It is an "exact" version
-because it is intended for a base type that produces exact results.</p>
+  <p>There is a third version named <code>_exact</code> which computes the
+  functions without changing the rounding mode. It is an "exact" version
+  because it is intended for a base type that produces exact results.</p>
 
-<p>The last version is the <code>_dummy</code> version. It does not do any
-computations but still produces compatible results.</p>
+  <p>The last version is the <code>_dummy</code> version. It does not do any
+  computations but still produces compatible results.</p>
 
-<p>Please note that it is possible to use the "exact" version for an inexact
-base type, e.g. <code>float</code> or <code>double</code>. In that case, the
-inclusion property is no longer guaranteed, but this can be useful to speed
-up the computation when the inclusion property is not desired strictly. For
-instance, in computer graphics, a small error due to floating-point roundoff
-is acceptable as long as an approximate version of the inclusion property
-holds.</p>
+  <p>Please note that it is possible to use the "exact" version for an
+  inexact base type, e.g. <code>float</code> or <code>double</code>. In that
+  case, the inclusion property is no longer guaranteed, but this can be
+  useful to speed up the computation when the inclusion property is not
+  desired strictly. For instance, in computer graphics, a small error due to
+  floating-point roundoff is acceptable as long as an approximate version of
+  the inclusion property holds.</p>
 
-<p>Here comes what each class defines. Later, when they will be described
-more thoroughly, these members will not be repeated. Please come back here in
-order to see them. Inheritance is also used to avoid repetitions.</p>
-<pre>template &lt;class T&gt;
+  <p>Here comes what each class defines. Later, when they will be described
+  more thoroughly, these members will not be repeated. Please come back here
+  in order to see them. Inheritance is also used to avoid repetitions.</p>
+  <pre>
+template &lt;class T&gt;
 struct rounding_control
 {
   typedef ... rounding_mode;
@@ -224,10 +232,12 @@
   save_state_...();
   ~save_state_...();
   typedef ... unprotected_rounding;
-};</pre>
+};
+</pre>
 
-<h2>Synopsis.</h2>
-<pre>namespace boost {
+  <h2>Synopsis.</h2>
+  <pre>
+namespace boost {
 namespace numeric {
 namespace interval_lib {
 
@@ -254,204 +264,215 @@
 template &lt;&gt;  struct rounded_math&lt;float&gt;;
 template &lt;&gt;  struct rounded_math&lt;double&gt;;
 
-<span style="color: #FF0000">/* some metaprogramming to convert a protected to unprotected rounding */</span>
+<span style=
+"color: #FF0000">/* some metaprogramming to convert a protected to unprotected rounding */</span>
 template &lt;class I&gt; struct unprotect;
 
 } // namespace interval_lib
 } // namespace numeric
-} // namespace boost</pre>
+} // namespace boost
+</pre>
 
-<h2>Description of the provided classes</h2>
+  <h2>Description of the provided classes</h2>
 
-<p>We now describe each class in the order they appear in the definition of a
-rounding policy (this outermost-to-innermost order is the reverse order from
-the synopsis).</p>
+  <p>We now describe each class in the order they appear in the definition of
+  a rounding policy (this outermost-to-innermost order is the reverse order
+  from the synopsis).</p>
 
-<h3 id="Protection">Protection control</h3>
+  <h3 id="Protection">Protection control</h3>
 
-<p>Protection refers to the fact that the interval operations will be
-surrounded by rounding mode controls. Unprotecting a class means to remove
-all the rounding controls. Each rounding policy provides a type
-<code>unprotected_rounding</code>. The required type
-<code>unprotected_rounding</code> gives another rounding class that enables
-to work when nested inside rounding. For example, the first three lines below
-should all produce the same result (because the first operation is the
-rounding constructor, and the last is its destructor, which take care of
-setting the rounding modes); and the last line is allowed to have an
-undefined behavior (since no rounding constructor or destructor is ever
-called).</p>
-<pre>T c; { rounding rnd; c = rnd.add_down(a, b); }
+  <p>Protection refers to the fact that the interval operations will be
+  surrounded by rounding mode controls. Unprotecting a class means to remove
+  all the rounding controls. Each rounding policy provides a type
+  <code>unprotected_rounding</code>. The required type
+  <code>unprotected_rounding</code> gives another rounding class that enables
+  to work when nested inside rounding. For example, the first three lines
+  below should all produce the same result (because the first operation is
+  the rounding constructor, and the last is its destructor, which take care
+  of setting the rounding modes); and the last line is allowed to have an
+  undefined behavior (since no rounding constructor or destructor is ever
+  called).</p>
+  <pre>
+T c; { rounding rnd; c = rnd.add_down(a, b); }
 T c; { rounding rnd1; { rounding rnd2; c = rnd2.add_down(a, b); } }
 T c; { rounding rnd1; { rounding::unprotected_rounding rnd2; c = rnd2.add_down(a, b); } }
-T d; { rounding::unprotected_rounding rnd; d = rnd.add_down(a, b); }</pre>
+T d; { rounding::unprotected_rounding rnd; d = rnd.add_down(a, b); }
+</pre>
 
-<p>Naturally <code>rounding::unprotected_rounding</code> may simply be
-<code>rounding</code> itself. But it can improve performance if it is a
-simplified version with empty constructor and destructor. In order to avoid
-undefined behaviors, in the library, an object of type
-<code>rounding::unprotected_rounding</code> is guaranteed to be created only
-when an object of type <code>rounding</code> is already alive. See the <a
-href="#perf">performance notes</a> for some additional details.</p>
+  <p>Naturally <code>rounding::unprotected_rounding</code> may simply be
+  <code>rounding</code> itself. But it can improve performance if it is a
+  simplified version with empty constructor and destructor. In order to avoid
+  undefined behaviors, in the library, an object of type
+  <code>rounding::unprotected_rounding</code> is guaranteed to be created
+  only when an object of type <code>rounding</code> is already alive. See the
+  <a href="#perf">performance notes</a> for some additional details.</p>
 
-<p>The support library defines a metaprogramming class template
-<code>unprotect</code> which takes an interval type <code>I</code> and
-returns an interval type <code>unprotect&lt;I&gt;::type</code>  where the
-rounding policy has been unprotected. Some  information about the types:
-<code>interval&lt;T, interval_lib::policies&lt;Rounding, _&gt;
-&gt;::traits_type::rounding</code> <b>is</b> the same type as
-<code>Rounding</code>, and <code>unprotect&lt;interval&lt;T,
-interval_lib::policies&lt;Rounding, _&gt; &gt; &gt;::type</code> <b>is</b>
-the same type as <code>interval&lt;T,
-interval_lib::policies&lt;Rounding::unprotected, _&gt; &gt;</code>.</p>
+  <p>The support library defines a metaprogramming class template
+  <code>unprotect</code> which takes an interval type <code>I</code> and
+  returns an interval type <code>unprotect&lt;I&gt;::type</code> where the
+  rounding policy has been unprotected. Some information about the types:
+  <code>interval&lt;T, interval_lib::policies&lt;Rounding, _&gt;
+  &gt;::traits_type::rounding</code> <b>is</b> the same type as
+  <code>Rounding</code>, and <code>unprotect&lt;interval&lt;T,
+  interval_lib::policies&lt;Rounding, _&gt; &gt; &gt;::type</code> <b>is</b>
+  the same type as <code>interval&lt;T,
+  interval_lib::policies&lt;Rounding::unprotected, _&gt; &gt;</code>.</p>
 
-<h3>State saving</h3>
+  <h3>State saving</h3>
 
-<p>First comes <code>save_state</code>. This class is responsible for saving
-the current rounding mode and calling init in its constructor, and for
-restoring the saved rounding mode in its destructor. This class also defines
-the <code>unprotected_rounding</code> type.</p>
+  <p>First comes <code>save_state</code>. This class is responsible for
+  saving the current rounding mode and calling init in its constructor, and
+  for restoring the saved rounding mode in its destructor. This class also
+  defines the <code>unprotected_rounding</code> type.</p>
 
-<p>If the rounding mode does not require any state-saving or initialization,
-<code>save_state_nothing</code> can be used instead of
-<code>save_state</code>.</p>
+  <p>If the rounding mode does not require any state-saving or
+  initialization, <code>save_state_nothing</code> can be used instead of
+  <code>save_state</code>.</p>
 
-<h3>Transcendental functions</h3>
+  <h3>Transcendental functions</h3>
 
-<p>The classes <code>rounded_transc_exact</code>,
-<code>rounded_transc_std</code> and <code>rounded_transc_opp</code> expect
-the std namespace to provide the functions exp log cos tan acos asin atan
-cosh sinh tanh acosh asinh atanh. For the <code>_std</code> and
-<code>_opp</code> versions, all these functions should respect the current
-rounding mode fixed by a call to downward or upward.</p>
+  <p>The classes <code>rounded_transc_exact</code>,
+  <code>rounded_transc_std</code> and <code>rounded_transc_opp</code> expect
+  the std namespace to provide the functions exp log cos tan acos asin atan
+  cosh sinh tanh acosh asinh atanh. For the <code>_std</code> and
+  <code>_opp</code> versions, all these functions should respect the current
+  rounding mode fixed by a call to downward or upward.</p>
 
-<p><strong>Please note:</strong> Unfortunately, the latter is rarely the
-case. It is the reason why a class <code>rounded_transc_dummy</code>  is
-provided which does not depend on the functions from the std namespace. There
-is no magic, however. The functions of <code>rounded_transc_dummy</code> do
-not compute anything. They only return valid values. For example,
-<code>cos_down</code> always returns -1. In this way, we do verify the
-inclusion property for the default implementation, even if this has strictly
-no value for the user. In order to have useful values, another policy should
-be used explicitely, which will most likely lead to a violation of the
-inclusion property. In this way, we ensure that the violation is clearly
-pointed out to the user who then knows what he stands against. This class
-could have been used as the default transcendental rounding class, but it was
-decided it would be better for the compilation to fail due to missing
-declarations rather than succeed thanks to valid but unusable functions.</p>
+  <p><strong>Please note:</strong> Unfortunately, the latter is rarely the
+  case. It is the reason why a class <code>rounded_transc_dummy</code> is
+  provided which does not depend on the functions from the std namespace.
+  There is no magic, however. The functions of
+  <code>rounded_transc_dummy</code> do not compute anything. They only return
+  valid values. For example, <code>cos_down</code> always returns -1. In this
+  way, we do verify the inclusion property for the default implementation,
+  even if this has strictly no value for the user. In order to have useful
+  values, another policy should be used explicitely, which will most likely
+  lead to a violation of the inclusion property. In this way, we ensure that
+  the violation is clearly pointed out to the user who then knows what he
+  stands against. This class could have been used as the default
+  transcendental rounding class, but it was decided it would be better for
+  the compilation to fail due to missing declarations rather than succeed
+  thanks to valid but unusable functions.</p>
 
-<h3>Basic arithmetic functions</h3>
+  <h3>Basic arithmetic functions</h3>
 
-<p>The classes <code>rounded_arith_std</code> and
-<code>rounded_arith_opp</code> expect the operators + - * / and the function
-<code>std::sqrt</code> to respect the current rounding mode.</p>
+  <p>The classes <code>rounded_arith_std</code> and
+  <code>rounded_arith_opp</code> expect the operators + - * / and the
+  function <code>std::sqrt</code> to respect the current rounding mode.</p>
 
-<p>The class <code>rounded_arith_exact</code> requires
-<code>std::floor</code> and <code>std::ceil</code> to be defined since it can
-not rely on <code>to_int</code>.</p>
+  <p>The class <code>rounded_arith_exact</code> requires
+  <code>std::floor</code> and <code>std::ceil</code> to be defined since it
+  can not rely on <code>to_int</code>.</p>
 
-<h3>Rounding control</h3>
+  <h3>Rounding control</h3>
 
-<p>The functions defined by each of the previous classes did not need any
-explanation. For example, the behavior of <code>add_down</code> is to compute
-the sum of two numbers rounded downward. For <code>rounding_control</code>,
-the situation is a bit more complex.</p>
+  <p>The functions defined by each of the previous classes did not need any
+  explanation. For example, the behavior of <code>add_down</code> is to
+  compute the sum of two numbers rounded downward. For
+  <code>rounding_control</code>, the situation is a bit more complex.</p>
 
-<p>The basic function is <code>force_rounding</code> which returns its
-argument correctly rounded accordingly to the current rounding mode if it was
-not already the case. This function is necessary to handle delayed rounding.
-Indeed, depending on the way the computations are done, the intermediate
-results may be internaly stored in a more precise format and it can lead to a
-wrong rounding. So the function enforces the rounding. <a
-href="#extreg">Here</a> is an example of what happens when the rounding is
-not enforced.</p>
+  <p>The basic function is <code>force_rounding</code> which returns its
+  argument correctly rounded accordingly to the current rounding mode if it
+  was not already the case. This function is necessary to handle delayed
+  rounding. Indeed, depending on the way the computations are done, the
+  intermediate results may be internaly stored in a more precise format and
+  it can lead to a wrong rounding. So the function enforces the rounding.
+  <a href="#extreg">Here</a> is an example of what happens when the rounding
+  is not enforced.</p>
 
-<p>The function <code>get_rounding_mode</code> returns the current rounding
-mode, <code>set_rounding_mode</code> sets the rounding mode back to a
-previous value returned by <code>get_rounding_mode</code>.
-<code>downward</code>, <code>upward</code> and <code>to_nearest</code> sets
-the rounding mode in one of the three directions. This rounding mode should
-be global to all the functions that use the type <code>T</code>. For example,
-after a call to <code>downward</code>, <code>force_rounding(x+y)</code> is
-expected to return the sum rounded toward -&#x221e;.</p>
+  <p>The function <code>get_rounding_mode</code> returns the current rounding
+  mode, <code>set_rounding_mode</code> sets the rounding mode back to a
+  previous value returned by <code>get_rounding_mode</code>.
+  <code>downward</code>, <code>upward</code> and <code>to_nearest</code> sets
+  the rounding mode in one of the three directions. This rounding mode should
+  be global to all the functions that use the type <code>T</code>. For
+  example, after a call to <code>downward</code>,
+  <code>force_rounding(x+y)</code> is expected to return the sum rounded
+  toward -&infin;.</p>
 
-<p>The function <code>to_int</code> computes the nearest integer accordingly
-to the current rounding mode.</p>
+  <p>The function <code>to_int</code> computes the nearest integer
+  accordingly to the current rounding mode.</p>
 
-<p>The non-specialized version of <code>rounding_control</code> does not do
-anything. The functions for the rounding mode are empty, and
-<code>to_int</code> and <code>force_rounding</code> are identity functions.
-The <code>pi_</code> constant functions return suitable integers (for
-example, <code>pi_up</code> returns <code>T(4)</code>).</p>
+  <p>The non-specialized version of <code>rounding_control</code> does not do
+  anything. The functions for the rounding mode are empty, and
+  <code>to_int</code> and <code>force_rounding</code> are identity functions.
+  The <code>pi_</code> constant functions return suitable integers (for
+  example, <code>pi_up</code> returns <code>T(4)</code>).</p>
 
-<p>The class template <code>rounding_control</code> is specialized for
-<code>float</code>, <code>double</code> and <code>long double</code> in order
-to best use the floating point unit of the computer.</p>
+  <p>The class template <code>rounding_control</code> is specialized for
+  <code>float</code>, <code>double</code> and <code>long double</code> in
+  order to best use the floating point unit of the computer.</p>
 
-<h2>Template class <tt>rounded_math</tt></h2>
+  <h2>Template class <tt>rounded_math</tt></h2>
 
-<p>The default policy (aka <code>rounded_math&lt;T&gt;</code>) is simply
-defined as:</p>
-<pre>template &lt;class T&gt; struct rounded_math&lt;T&gt; : save_state_nothing&lt;rounded_arith_exact&lt;T&gt; &gt; {};</pre>
+  <p>The default policy (aka <code>rounded_math&lt;T&gt;</code>) is simply
+  defined as:</p>
+  <pre>
+template &lt;class T&gt; struct rounded_math&lt;T&gt; : save_state_nothing&lt;rounded_arith_exact&lt;T&gt; &gt; {};
+</pre>
 
-<p>and the specializations for <code>float</code>, <code>double</code> and
-<code>long double</code> use <code>rounded_arith_opp</code>, as in:</p>
-<pre>template &lt;&gt; struct rounded_math&lt;float&gt;       : save_state&lt;rounded_arith_opp&lt;float&gt; &gt;       {};
+  <p>and the specializations for <code>float</code>, <code>double</code> and
+  <code>long double</code> use <code>rounded_arith_opp</code>, as in:</p>
+  <pre>
+template &lt;&gt; struct rounded_math&lt;float&gt;       : save_state&lt;rounded_arith_opp&lt;float&gt; &gt;       {};
 template &lt;&gt; struct rounded_math&lt;double&gt;      : save_state&lt;rounded_arith_opp&lt;double&gt; &gt;      {};
-template &lt;&gt; struct rounded_math&lt;long double&gt; : save_state&lt;rounded_arith_opp&lt;long double&gt; &gt; {};</pre>
+template &lt;&gt; struct rounded_math&lt;long double&gt; : save_state&lt;rounded_arith_opp&lt;long double&gt; &gt; {};
+</pre>
 
-<h2 id="perf">Performance Issues</h2>
+  <h2 id="perf">Performance Issues</h2>
 
-<p>This paragraph deals mostly with the performance of the library with
-intervals using the floating-point unit (FPU) of the computer. Let's consider
-the sum of [<i>a</i>,<i>b</i>] and [<i>c</i>,<i>d</i>] as an example. The
-result is [<code>down</code>(<i>a</i>+<i>c</i>),
-<code>up</code>(<i>b</i>+<i>d</i>)], where <code>down</code> and
-<code>up</code> indicate the rounding mode needed.</p>
+  <p>This paragraph deals mostly with the performance of the library with
+  intervals using the floating-point unit (FPU) of the computer. Let's
+  consider the sum of [<i>a</i>,<i>b</i>] and [<i>c</i>,<i>d</i>] as an
+  example. The result is [<code>down</code>(<i>a</i>+<i>c</i>),
+  <code>up</code>(<i>b</i>+<i>d</i>)], where <code>down</code> and
+  <code>up</code> indicate the rounding mode needed.</p>
 
-<h3>Rounding Mode Switch</h3>
+  <h3>Rounding Mode Switch</h3>
 
-<p>If the FPU is able to use a different rounding mode for each operation,
-there is no problem. For example, it's the case for the Alpha processor: each
-floating-point instruction can specify a different rounding mode. However,
-the IEEE-754 Standard does not require such a behavior. So most of the FPUs
-only provide some instructions to set the rounding mode for all subsequent
-operations. And generally, these instructions need to flush the pipeline of
-the FPU.</p>
+  <p>If the FPU is able to use a different rounding mode for each operation,
+  there is no problem. For example, it's the case for the Alpha processor:
+  each floating-point instruction can specify a different rounding mode.
+  However, the IEEE-754 Standard does not require such a behavior. So most of
+  the FPUs only provide some instructions to set the rounding mode for all
+  subsequent operations. And generally, these instructions need to flush the
+  pipeline of the FPU.</p>
 
-<p>In this situation, the time needed to sum [<i>a</i>,<i>b</i>] and
-[<i>c</i>,<i>d</i>] is far worse than the time needed to calculate
-<i>a</i>+<i>b</i> and <i>c</i>+<i>d</i> since the two additions cannot be
-parallelized. Consequently, the objective is to diminish the number of
-rounding mode switches.</p>
+  <p>In this situation, the time needed to sum [<i>a</i>,<i>b</i>] and
+  [<i>c</i>,<i>d</i>] is far worse than the time needed to calculate
+  <i>a</i>+<i>b</i> and <i>c</i>+<i>d</i> since the two additions cannot be
+  parallelized. Consequently, the objective is to diminish the number of
+  rounding mode switches.</p>
 
-<p>If this library is not used to provide exact computations, but only for
-pair arithmetic, the solution is quite simple: do not use rounding. In that
-case, doing the sum [<i>a</i>,<i>b</i>] and [<i>c</i>,<i>d</i>] will be as
-fast as computing <i>a</i>+<i>b</i> and <i>c</i>+<i>d</i>. Everything is
-perfect.</p>
+  <p>If this library is not used to provide exact computations, but only for
+  pair arithmetic, the solution is quite simple: do not use rounding. In that
+  case, doing the sum [<i>a</i>,<i>b</i>] and [<i>c</i>,<i>d</i>] will be as
+  fast as computing <i>a</i>+<i>b</i> and <i>c</i>+<i>d</i>. Everything is
+  perfect.</p>
 
-<p>However, if exact computations are required, such a solution is totally
-unthinkable. So, are we penniless? No, there is still a trick available.
-Indeed, down(<i>a</i>+<i>c</i>) = -up(-<i>a</i>-<i>c</i>) if the unary minus
-is an exact operation. It is now possible to calculate the whole sum with the
-same rounding mode. Generally, the cost of the mode switching is worse than
-the cost of the sign changes.</p>
+  <p>However, if exact computations are required, such a solution is totally
+  unthinkable. So, are we penniless? No, there is still a trick available.
+  Indeed, down(<i>a</i>+<i>c</i>) = -up(-<i>a</i>-<i>c</i>) if the unary
+  minus is an exact operation. It is now possible to calculate the whole sum
+  with the same rounding mode. Generally, the cost of the mode switching is
+  worse than the cost of the sign changes.</p>
 
-<h4>Speeding up consecutive operations</h4>
+  <h4>Speeding up consecutive operations</h4>
 
-<p>The interval addition is not the only operation; most of the interval
-operations can be computed by setting the rounding direction of the FPU only
-once. So the operations of the floating point rounding policy assume that the
-direction is correctly set. This assumption is usually not true in a program
-(the user and the standard library expect the rounding direction to be to
-nearest), so these operations have to be enclosed in a shell that sets the
-floating point environment. This protection is done by the constructor and
-destructor of the rounding policy.</p>
+  <p>The interval addition is not the only operation; most of the interval
+  operations can be computed by setting the rounding direction of the FPU
+  only once. So the operations of the floating point rounding policy assume
+  that the direction is correctly set. This assumption is usually not true in
+  a program (the user and the standard library expect the rounding direction
+  to be to nearest), so these operations have to be enclosed in a shell that
+  sets the floating point environment. This protection is done by the
+  constructor and destructor of the rounding policy.</p>
 
-<p>Les us now consider the case of two consecutive interval additions:
-[<i>a</i>,<i>b</i>] + [<i>c</i>,<i>d</i>] + [<i>e</i>,<i>f</i>]. The generated
-code should look like:</p>
-<pre>init_rounding_mode();    // rounding object construction during the first addition
+  <p>Les us now consider the case of two consecutive interval additions:
+  [<i>a</i>,<i>b</i>] + [<i>c</i>,<i>d</i>] + [<i>e</i>,<i>f</i>]. The
+  generated code should look like:</p>
+  <pre>
+init_rounding_mode();    // rounding object construction during the first addition
 t1 = -(-a - c);
 t2 = b + d;
 restore_rounding_mode(); // rounding object destruction
@@ -459,38 +480,44 @@
 x = -(-t1 - e);
 y = t2 + f;
 restore_rounding_mode(); // rounding object destruction
-// the result is the interval [x,y]</pre>
+// the result is the interval [x,y]
+</pre>
 
-<p>Between the two operations, the rounding direction is restored, and then
-initialized again. Ideally, compilers should be able to optimize this useless
-code away. But unfortunately they are not, and this slows the code down by an
-order of magnitude. In order to avoid this bottleneck, the user can tell to
-the interval operations that they do not need to be protected anymore. It will
-then be up to the user to protect the interval computations. The compiler will
-then be able to generate such a code:</p>
-<pre>init_rounding_mode();    // done by the user
+  <p>Between the two operations, the rounding direction is restored, and then
+  initialized again. Ideally, compilers should be able to optimize this
+  useless code away. But unfortunately they are not, and this slows the code
+  down by an order of magnitude. In order to avoid this bottleneck, the user
+  can tell to the interval operations that they do not need to be protected
+  anymore. It will then be up to the user to protect the interval
+  computations. The compiler will then be able to generate such a code:</p>
+  <pre>
+init_rounding_mode();    // done by the user
 x = -(-a - c - e);
 y = b + d + f;
-restore_rounding_mode(); // done by the user</pre>
+restore_rounding_mode(); // done by the user
+</pre>
 
-<p>The user will have to create a rounding object. And as long as this object
-is alive, unprotected versions of the interval operations can be used. They
-are selected by using an interval type with a specific rounding policy. If the
-initial interval type is <code>I</code>, then <code>I::traits_type::rounding</code>
-is the type of the rounding object, and <code>interval_lib::unprotect&lt;I&gt;::type</code>
-is the type of the unprotected interval type.</p>
+  <p>The user will have to create a rounding object. And as long as this
+  object is alive, unprotected versions of the interval operations can be
+  used. They are selected by using an interval type with a specific rounding
+  policy. If the initial interval type is <code>I</code>, then
+  <code>I::traits_type::rounding</code> is the type of the rounding object,
+  and <code>interval_lib::unprotect&lt;I&gt;::type</code> is the type of the
+  unprotected interval type.</p>
 
-<p>Because the rounding mode of the FPU is changed during the life of the
-rounding object, any arithmetic floating point operation that does not involve
-the interval library can lead to unexpected results. And reciprocally, using
-unprotected interval operation when no rounding object is alive will produce
-intervals that are not guaranteed anymore to contain the real result.</p>
+  <p>Because the rounding mode of the FPU is changed during the life of the
+  rounding object, any arithmetic floating point operation that does not
+  involve the interval library can lead to unexpected results. And
+  reciprocally, using unprotected interval operation when no rounding object
+  is alive will produce intervals that are not guaranteed anymore to contain
+  the real result.</p>
 
-<h4 id="perfexp">Example</h4>
+  <h4 id="perfexp">Example</h4>
 
-<p>Here is an example of Horner's scheme to compute the value of a polynom.
-The rounding mode switches are disabled for the whole computation.</p>
-<pre>// I is an interval class, the polynom is a simple array
+  <p>Here is an example of Horner's scheme to compute the value of a polynom.
+  The rounding mode switches are disabled for the whole computation.</p>
+  <pre>
+// I is an interval class, the polynom is a simple array
 template&lt;class I&gt;
 I horner(const I&amp; x, const I p[], int n) {
 
@@ -508,79 +535,98 @@
   return y;
 
   // restore the rounding mode with the destruction of rnd
-}</pre>
+}
+</pre>
 
-<p>Please note that a rounding object is specially created in order to protect
-all the interval computations. Each interval of type I is converted in
-an interval of type R before any operations. If this conversion is not done,
-the result is still correct, but the interest of this whole optimization has
-disappeared. Whenever possible, it is good to convert to <code>const
-R&amp;</code> instead of <code>R</code>: indeed, the function could already
-be called inside an unprotection block so the types <code>R</code> and
-<code>I</code> would be the same interval, no need for a conversion.</p>
+  <p>Please note that a rounding object is specially created in order to
+  protect all the interval computations. Each interval of type I is converted
+  in an interval of type R before any operations. If this conversion is not
+  done, the result is still correct, but the interest of this whole
+  optimization has disappeared. Whenever possible, it is good to convert to
+  <code>const R&amp;</code> instead of <code>R</code>: indeed, the function
+  could already be called inside an unprotection block so the types
+  <code>R</code> and <code>I</code> would be the same interval, no need for a
+  conversion.</p>
 
-<h4>Uninteresting remark</h4>
+  <h4>Uninteresting remark</h4>
 
-<p>It was said at the beginning that the Alpha processors can use a specific
-rounding mode for each operation. However, due to the instruction format, the
-rounding toward plus infinity is not available. Only the rounding toward
-minus infinity can be used. So the trick using the change of sign becomes
-essential, but there is no need to save and restore the rounding mode on both
-sides of an operation.</p>
+  <p>It was said at the beginning that the Alpha processors can use a
+  specific rounding mode for each operation. However, due to the instruction
+  format, the rounding toward plus infinity is not available. Only the
+  rounding toward minus infinity can be used. So the trick using the change
+  of sign becomes essential, but there is no need to save and restore the
+  rounding mode on both sides of an operation.</p>
 
-<h3 id="extreg">Extended Registers</h3>
+  <h3 id="extreg">Extended Registers</h3>
 
-<p>There is another problem besides the cost of the rounding mode switch.
-Some FPUs use extended registers (for example, float computations will be
-done with double registers, or double computations with long double
-registers). Consequently, many problems can arise.</p>
+  <p>There is another problem besides the cost of the rounding mode switch.
+  Some FPUs use extended registers (for example, float computations will be
+  done with double registers, or double computations with long double
+  registers). Consequently, many problems can arise.</p>
 
-<p>The first one is due to to the extended precision of the mantissa. The
-rounding is also done on this extended precision. And consequently, we still
-have down(<i>a</i>+<i>b</i>) = -up(-<i>a</i>-<i>b</i>) in the extended
-registers. But back to the standard precision, we now have
-down(<i>a</i>+<i>b</i>) &lt; -up(-<i>a</i>-<i>b</i>) instead of an equality.
-A solution could be not to use this method. But there still are other
-problems, with the comparisons between numbers for example.</p>
+  <p>The first one is due to to the extended precision of the mantissa. The
+  rounding is also done on this extended precision. And consequently, we
+  still have down(<i>a</i>+<i>b</i>) = -up(-<i>a</i>-<i>b</i>) in the
+  extended registers. But back to the standard precision, we now have
+  down(<i>a</i>+<i>b</i>) &lt; -up(-<i>a</i>-<i>b</i>) instead of an
+  equality. A solution could be not to use this method. But there still are
+  other problems, with the comparisons between numbers for example.</p>
 
-<p>Naturally, there is also a problem with the extended precision of the
-exponent. To illustrate this problem, let <i>m</i> be the biggest number
-before +<i>inf</i>. If we calculate 2*[<i>m</i>,<i>m</i>], the answer should
-be [<i>m</i>,<i>inf</i>]. But due to the extended registers, the FPU will
-first store [<i>2m</i>,<i>2m</i>] and then convert it to
-[<i>inf</i>,<i>inf</i>] at the end of the calculus (when the rounding mode is
-toward +<i>inf</i>). So the answer is no more accurate.</p>
+  <p>Naturally, there is also a problem with the extended precision of the
+  exponent. To illustrate this problem, let <i>m</i> be the biggest number
+  before +<i>inf</i>. If we calculate 2*[<i>m</i>,<i>m</i>], the answer
+  should be [<i>m</i>,<i>inf</i>]. But due to the extended registers, the FPU
+  will first store [<i>2m</i>,<i>2m</i>] and then convert it to
+  [<i>inf</i>,<i>inf</i>] at the end of the calculus (when the rounding mode
+  is toward +<i>inf</i>). So the answer is no more accurate.</p>
 
-<p>There is only one solution: to force the FPU to convert the extended
-values back to standard precision after each operation. Some FPUs provide an
-instruction able to do this conversion (for example the PowerPC processors).
-But for the FPUs that do not provide it (the x86 processors), the only
-solution is to write the values to memory and read them back. Such an
-operation is obviously very expensive.</p>
+  <p>There is only one solution: to force the FPU to convert the extended
+  values back to standard precision after each operation. Some FPUs provide
+  an instruction able to do this conversion (for example the PowerPC
+  processors). But for the FPUs that do not provide it (the x86 processors),
+  the only solution is to write the values to memory and read them back. Such
+  an operation is obviously very expensive.</p>
 
-<h2>Some Examples</h2>
+  <h2>Some Examples</h2>
 
-<p>Here come several cases:</p>
-<ul>
-  <li>if you need precise computations with the <code>float</code> or
+  <p>Here come several cases:</p>
+
+  <ul>
+    <li>if you need precise computations with the <code>float</code> or
     <code>double</code> types, use the default
     <code>rounded_math&lt;T&gt;</code>;</li>
-  <li>for fast wide intervals without any rounding nor precision, use
+
+    <li>for fast wide intervals without any rounding nor precision, use
     <code>save_state_nothing&lt;rounded_transc_exact&lt;T&gt;
-  &gt;</code>;</li>
-  <li>for an exact type (like int or rational with a little help for infinite
-    and NaN values) without support for transcendental functions, the
-    solution could be <code>save_state_nothing&lt;rounded_transc_dummy&lt;T,
+    &gt;</code>;</li>
+
+    <li>for an exact type (like int or rational with a little help for
+    infinite and NaN values) without support for transcendental functions,
+    the solution could be
+    <code>save_state_nothing&lt;rounded_transc_dummy&lt;T,
     rounded_arith_exact&lt;T&gt; &gt; &gt;</code> or directly
-    <code>save_state_nothing&lt;rounded_arith_exact&lt;T&gt; &gt;</code>;</li>
-  <li>if it is a more complex case than the previous ones, the best thing is
-    probably to directly define your own policy.</li>
-</ul>
-<hr>
+    <code>save_state_nothing&lt;rounded_arith_exact&lt;T&gt;
+    &gt;</code>;</li>
 
-<p>Revised: 2005-12-19<br>
-Copyright (c) Guillaume Melquiond, Sylvain Pion, Hervé Brönnimann, 2002.
-Polytechnic University.<br>
-Copyright (c) Guillaume Melquiond, 2004-2005. ENS Lyon.</p>
+    <li>if it is a more complex case than the previous ones, the best thing
+    is probably to directly define your own policy.</li>
+  </ul>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y-%m-%d" startspan -->2006-12-24<!--webbot bot="Timestamp" endspan i-checksum="12172" --></p>
+
+  <p><i>Copyright &copy; 2002 Guillaume Melquiond, Sylvain Pion, Herv&eacute;
+  Br&ouml;nnimann, Polytechnic University<br>
+  Copyright &copy; 2004-2005 Guillaume Melquiond, ENS Lyon</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/numeric/interval/doc/todo.htm
===================================================================
--- boost/trunk/libs/numeric/interval/doc/todo.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/interval/doc/todo.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,45 +1,67 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
-    "http://www.w3.org/TR/html4/loose.dtd">
+"http://www.w3.org/TR/html4/loose.dtd">
+
 <html>
 <head>
-  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
   <link rel="stylesheet" type="text/css" href="../../../../boost.css">
+
   <title>Interval-TODO.htm</title>
 </head>
 
 <body lang="en">
-<h1>TODO list for the Interval Arithmetic library</h1>
+  <h1>TODO list for the Interval Arithmetic library</h1>
 
-<h2>Comments from the review process</h2>
-<ul>
-  <li>It would be nice to have a 100% portable Rouding policy class based on
-    LIA-1 only, with no additional requirement such as IEEE 754 or even
+  <h2>Comments from the review process</h2>
+
+  <ul>
+    <li>It would be nice to have a 100% portable Rouding policy class based
+    on LIA-1 only, with no additional requirement such as IEEE 754 or even
     more.</li>
-  <li>For pi and other constants, we should fetch them from the Math
+
+    <li>For pi and other constants, we should fetch them from the Math
     constants library when it is ready.</li>
-</ul>
+  </ul>
 
-<h2>Various items</h2>
-<ul>
-  <li>Support the <code>-mfpmath=sse</code> option of g++ for Pentium IV
-    optimized code.  This requires a different rounding policy class.</li>
-  <li>Have an optimized specialization of <code>interval&lt;double&gt;</code>
-    using SSE2 instructions?  Tricky.</li>
-  <li>Write a traits specialization for <code>interval&lt;MPFR&gt;</code>,
+  <h2>Various items</h2>
+
+  <ul>
+    <li>Support the <code>-mfpmath=sse</code> option of g++ for Pentium IV
+    optimized code. This requires a different rounding policy class.</li>
+
+    <li>Have an optimized specialization of
+    <code>interval&lt;double&gt;</code> using SSE2 instructions? Tricky.</li>
+
+    <li>Write a traits specialization for <code>interval&lt;MPFR&gt;</code>,
     and other non-built-in number types.</li>
-  <li>Have a robust implementation of transcendental functions over the
+
+    <li>Have a robust implementation of transcendental functions over the
     built-in floating point types (e.g. using MPFR)?</li>
-  <li>Safe conversions from <code>interval&lt;double&gt;</code> to
+
+    <li>Safe conversions from <code>interval&lt;double&gt;</code> to
     <code>interval&lt;float&gt;</code>? Requires partial specialization.</li>
-  <li>It would be nice to use the expression template mecanism to
+
+    <li>It would be nice to use the expression template mecanism to
     automatically use the more efficient unprotected rounding mode version
     for small subexpressions (although you can do bigger expressions by
     hand).</li>
-</ul>
-<hr>
+  </ul>
+  <hr>
 
-<p>Revised: 2003-01-19<br>
-Copyright (c) Guillaume Melquiond, Sylvain Pion, Hervé Brönnimann, 2002.<br>
-Polytechnic University.</p>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y-%m-%d" startspan -->2006-12-24<!--webbot bot="Timestamp" endspan i-checksum="12172" --></p>
+
+  <p><i>Copyright &copy; 2002 Guillaume Melquiond, Sylvain Pion, Herv&eacute;
+  Br&ouml;nnimann, Polytechnic University</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Deleted: boost/trunk/libs/numeric/interval/test/Jamfile
===================================================================
--- boost/trunk/libs/numeric/interval/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/interval/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,74 +0,0 @@
-# Boost Interval Library test Jamfile
-#
-# Copyright 2003 Guillaume Melquiond
-#
-# Distributed under the Boost Software License, Version 1.0.
-# (See accompanying file LICENSE_1_0.txt or
-# copy at http://www.boost.org/LICENSE_1_0.txt)
-
-subproject libs/numeric/interval/test ;
-
-# bring in rules for testing
-import testing ;
-
-# Local rule to modify requirements on the fly.
-local rule special-requirements ( toolset variant : properties * )
-{
-    # For this library to work correctly on Alpha hardware, dynamic rounding
-    # mode must be enabled with a compiler flag.
-
-    if $(UNIX) && $(OS) = OSF
-    {
-        switch $(toolset)
-        {
-            case gcc* : properties += <cflags>-mfp-rounding-mode=d ;
-            case tru64cxx* : properties += <cflags>-fprm <cflags>d ;
-        }
-    }
-    
-    return $(properties) ;
-}
-    
-# Local run rule which automatically includes the local requirements.
-local rule local-run ( sources + : args * : input-files * : requirements *
-    : name ? : default-build * : args2 * )
-{
-    return [ run $(sources) : $(args) : $(input-files)
-        : $(requirements) special-requirements
-        : $(name) : $(default-build) : $(args2) ] ;
-}
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-  # look in BOOST_ROOT for sources first, just in this Jamfile
-  local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-
-  test-suite numeric/interval :
-    [ compile libs/numeric/interval/test/integer.cpp : special-requirements ]
-
-    [ local-run libs/numeric/interval/test/add.cpp      ]
-    [ local-run libs/numeric/interval/test/det.cpp      ]
-    [ local-run libs/numeric/interval/test/fmod.cpp     ]
-    [ local-run libs/numeric/interval/test/mul.cpp      ]
-    [ local-run libs/numeric/interval/test/overflow.cpp ]
-    [ local-run libs/numeric/interval/test/pi.cpp       ]
-    [ local-run libs/numeric/interval/test/pow.cpp      ]
-
-    [ local-run libs/numeric/interval/test/cmp.cpp
-        <lib>../../../test/build/boost_test_exec_monitor ]
-    [ local-run libs/numeric/interval/test/cmp_exn.cpp
-        <lib>../../../test/build/boost_test_exec_monitor ]
-    [ local-run libs/numeric/interval/test/cmp_exp.cpp
-        <lib>../../../test/build/boost_test_exec_monitor ]
-    [ local-run libs/numeric/interval/test/cmp_lex.cpp
-        <lib>../../../test/build/boost_test_exec_monitor ]
-    [ local-run libs/numeric/interval/test/cmp_set.cpp
-        <lib>../../../test/build/boost_test_exec_monitor ]
-    [ local-run libs/numeric/interval/test/cmp_tribool.cpp
-        <lib>../../../test/build/boost_test_exec_monitor ]
-    [ local-run libs/numeric/interval/test/test_float.cpp
-        <lib>../../../test/build/boost_test_exec_monitor ]
-  ;
-}

Modified: boost/trunk/libs/numeric/interval/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/numeric/interval/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/interval/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,18 +32,18 @@
     [ run libs/numeric/interval/test/pow.cpp      ]
 
     [ run libs/numeric/interval/test/cmp.cpp
-        ../../../test/build//boost_test_exec_monitor ]
+        ../../../test/build//boost_test_exec_monitor/<link>static ]
     [ run libs/numeric/interval/test/cmp_exn.cpp
-        ../../../test/build//boost_test_exec_monitor ]
+        ../../../test/build//boost_test_exec_monitor/<link>static ]
     [ run libs/numeric/interval/test/cmp_exp.cpp
-        ../../../test/build//boost_test_exec_monitor ]
+        ../../../test/build//boost_test_exec_monitor/<link>static ]
     [ run libs/numeric/interval/test/cmp_lex.cpp
-        ../../../test/build//boost_test_exec_monitor ]
+        ../../../test/build//boost_test_exec_monitor/<link>static ]
     [ run libs/numeric/interval/test/cmp_set.cpp
-        ../../../test/build//boost_test_exec_monitor ]
+        ../../../test/build//boost_test_exec_monitor/<link>static ]
     [ run libs/numeric/interval/test/cmp_tribool.cpp
-        ../../../test/build//boost_test_exec_monitor ]
+        ../../../test/build//boost_test_exec_monitor/<link>static ]
     [ run libs/numeric/interval/test/test_float.cpp
-        ../../../test/build//boost_test_exec_monitor ]
+        ../../../test/build//boost_test_exec_monitor/<link>static ]
   ;
 }

Deleted: boost/trunk/libs/numeric/ublas/bench1/Jamfile
===================================================================
--- boost/trunk/libs/numeric/ublas/bench1/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/ublas/bench1/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,43 +0,0 @@
-#
-#   Copyright (c) 2000-2002
-#   Joerg Walter, Mathias Koch
-#
-#   Permission to use, copy, modify, distribute and sell this software
-#   and its documentation for any purpose is hereby granted without fee,
-#   provided that the above copyright notice appear in all copies and
-#   that both that copyright notice and this permission notice appear
-#   in supporting documentation.  The authors make no representations
-#   about the suitability of this software for any purpose.
-#   It is provided "as is" without express or implied warranty.
-#
-#   The authors gratefully acknowledge the support of
-#   GeNeSys mbH & Co. KG in producing this work.
-#
-
-subproject libs/numeric/ublas/bench1 ;
-
-SOURCES = bench1 bench11 bench12 bench13 ;
-
-exe bench1
-    : $(SOURCES).cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-#      <gcc><release><cxxflags>"-s -static -fomit-frame-pointer -fexpensive-optimizations -funroll-loops -malign-double -fschedule-insns2 -march=pentium4 -msse -mfpmath=sse -finline-functions -finline-limit=2048"
-#      <gcc><*><cxxflags>"-fabi-version=0"
-      <intel-linux><release><cxxflags>"-Xc"
-      <intel-linux><release><cxxflags>"-unroll -march=pentium4 -Zp16"
-    ;
-
-
-
-
-
-
-
-
-
-
-
-
-
-

Deleted: boost/trunk/libs/numeric/ublas/bench2/Jamfile
===================================================================
--- boost/trunk/libs/numeric/ublas/bench2/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/ublas/bench2/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,28 +0,0 @@
-#
-#   Copyright (c) 2000-2002
-#   Joerg Walter, Mathias Koch
-#
-#   Permission to use, copy, modify, distribute and sell this software
-#   and its documentation for any purpose is hereby granted without fee,
-#   provided that the above copyright notice appear in all copies and
-#   that both that copyright notice and this permission notice appear
-#   in supporting documentation.  The authors make no representations
-#   about the suitability of this software for any purpose.
-#   It is provided "as is" without express or implied warranty.
-#
-#   The authors gratefully acknowledge the support of
-#   GeNeSys mbH & Co. KG in producing this work.
-#
-
-subproject libs/numeric/ublas/bench2 ;
-
-SOURCES = bench2 bench21 bench22 bench23 ;
-
-exe bench2
-    : $(SOURCES).cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-#      <gcc><*><cxxflags>"-fabi-version=0"
-      <intel-linux><*><cxxflags>"-Xc"
-    ;
-

Deleted: boost/trunk/libs/numeric/ublas/bench3/Jamfile
===================================================================
--- boost/trunk/libs/numeric/ublas/bench3/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/ublas/bench3/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,29 +0,0 @@
-#
-#   Copyright (c) 2000-2002
-#   Joerg Walter, Mathias Koch
-#
-#   Permission to use, copy, modify, distribute and sell this software
-#   and its documentation for any purpose is hereby granted without fee,
-#   provided that the above copyright notice appear in all copies and
-#   that both that copyright notice and this permission notice appear
-#   in supporting documentation.  The authors make no representations
-#   about the suitability of this software for any purpose.
-#   It is provided "as is" without express or implied warranty.
-#
-#   The authors gratefully acknowledge the support of
-#   GeNeSys mbH & Co. KG in producing this work.
-#
-
-subproject libs/numeric/ublas/bench3 ;
-
-SOURCES = bench3 bench31 bench32 bench33 ;
-
-exe bench3
-    : $(SOURCES).cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-#      <gcc><*><cxxflags>"-fabi-version=0"
-      <intel-linux><*><cxxflags>"-Xc"
-    ;
-
-

Deleted: boost/trunk/libs/numeric/ublas/bench4/Jamfile
===================================================================
--- boost/trunk/libs/numeric/ublas/bench4/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/ublas/bench4/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,30 +0,0 @@
-#
-#   Copyright (c) 2000-2002
-#   Joerg Walter, Mathias Koch
-#
-#   Permission to use, copy, modify, distribute and sell this software
-#   and its documentation for any purpose is hereby granted without fee,
-#   provided that the above copyright notice appear in all copies and
-#   that both that copyright notice and this permission notice appear
-#   in supporting documentation.  The authors make no representations
-#   about the suitability of this software for any purpose.
-#   It is provided "as is" without express or implied warranty.
-#
-#   The authors gratefully acknowledge the support of
-#   GeNeSys mbH & Co. KG in producing this work.
-#
-
-subproject libs/numeric/ublas/bench4 ;
-
-SOURCES = bench4 bench41 bench42 bench43 ;
-
-exe bench4
-    : $(SOURCES).cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <define>BOOST_UBLAS_USE_INTERVAL
-#      <gcc><*><cxxflags>"-fabi-version=0"
-      <intel-linux><*><cxxflags>"-Xc"
-    ;
-
-

Deleted: boost/trunk/libs/numeric/ublas/doc/samples/Jamfile
===================================================================
--- boost/trunk/libs/numeric/ublas/doc/samples/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/ublas/doc/samples/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,433 +0,0 @@
-#
-#   Copyright (c) 2000-2002
-#   Joerg Walter, Mathias Koch
-#
-#   Permission to use, copy, modify, distribute and sell this software
-#   and its documentation for any purpose is hereby granted without fee,
-#   provided that the above copyright notice appear in all copies and
-#   that both that copyright notice and this permission notice appear
-#   in supporting documentation.  The authors make no representations
-#   about the suitability of this software for any purpose.
-#   It is provided "as is" without express or implied warranty.
-#
-#   The authors gratefully acknowledge the support of
-#   GeNeSys mbH & Co. KG in producing this work.
-#
-
-subproject libs/numeric/ublas/doc/samples ;
-
-exe unbounded_array
-    : unbounded_array.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe bounded_array
-    : bounded_array.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe range
-    : range.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe slice
-    : slice.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe map_array
-    : map_array.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe vector
-    : vector.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe unit_vector
-    : unit_vector.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe zero_vector
-    : zero_vector.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe mapped_vector
-    : mapped_vector.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe compressed_vector
-    : compressed_vector.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe coordinate_vector
-    : coordinate_vector.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe vector_range
-    : vector_range.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe vector_range_project
-    : vector_range_project.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe vector_slice
-    : vector_slice.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe vector_slice_project
-    : vector_slice_project.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe vector_unary
-    : vector_unary.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe vector_binary
-    : vector_binary.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe vector_binary_outer
-    : vector_binary_outer.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe vector_binary_scalar
-    : vector_binary_scalar.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe vector_unary_redux
-    : vector_unary_redux.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe vector_binary_redux
-    : vector_binary_redux.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix
-    : matrix.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe identity_matrix
-    : identity_matrix.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe zero_matrix
-    : zero_matrix.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe mapped_matrix
-    : mapped_matrix.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe compressed_matrix
-    : compressed_matrix.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe coordinate_matrix
-    : coordinate_matrix.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_row
-    : matrix_row.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_row_project
-    : matrix_row_project.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_column
-    : matrix_column.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_column_project
-    : matrix_column_project.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_vector_range
-    : matrix_vector_range.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_vector_slice
-    : matrix_vector_slice.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_range
-    : matrix_range.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_range_project
-    : matrix_range_project.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_slice
-    : matrix_slice.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_slice_project
-    : matrix_slice_project.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_unary
-    : matrix_unary.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_binary
-    : matrix_binary.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_binary_scalar
-    : matrix_binary_scalar.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_vector_binary
-    : matrix_vector_binary.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_vector_solve
-    : matrix_vector_solve.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_matrix_binary
-    : matrix_matrix_binary.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe matrix_matrix_solve
-    : matrix_matrix_solve.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe banded_matrix
-    : banded_matrix.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe banded_adaptor
-    : banded_adaptor.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe hermitian_matrix
-    : hermitian_matrix.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe hermitian_adaptor
-    : hermitian_adaptor.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe symmetric_matrix
-    : symmetric_matrix.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe symmetric_adaptor
-    : symmetric_adaptor.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe triangular_matrix
-    : triangular_matrix.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;
-
-exe triangular_adaptor
-    : triangular_adaptor.cpp
-    : <include>$(BOOST_ROOT)
-      <sysinclude>$(BOOST_ROOT)
-      <borland><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-      <kylix><*><cxxflags>"-w-8026 -w-8027 -w-8057 -w-8084 -w-8092"
-    ;

Modified: boost/trunk/libs/numeric/ublas/index.html
===================================================================
--- boost/trunk/libs/numeric/ublas/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/ublas/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,10 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="doc/index.htm">doc/index.htm</a>
+<a href="doc/index.htm">doc/index.htm</a> &nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
-</html>
+</html>
\ No newline at end of file

Deleted: boost/trunk/libs/numeric/ublas/test/Jamfile
===================================================================
--- boost/trunk/libs/numeric/ublas/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/ublas/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,128 +0,0 @@
-#
-#   Copyright (c) 2000-2002
-#   Joerg Walter, Mathias Koch
-#
-#   Permission to use, copy, modify, distribute and sell this software
-#   and its documentation for any purpose is hereby granted without fee,
-#   provided that the above copyright notice appear in all copies and
-#   that both that copyright notice and this permission notice appear
-#   in supporting documentation.  The authors make no representations
-#   about the suitability of this software for any purpose.
-#   It is provided "as is" without express or implied warranty.
-#
-#   The authors gratefully acknowledge the support of
-#   GeNeSys mbH & Co. KG in producing this work.
-#
-
-subproject libs/numeric/ublas/test ;
-# bring in rules for testing
-import testing ;
-
-# Define features to test:
-#  Value types: USE_FLOAT USE_DOUBLE USE_STD_COMPLEX
-#  Proxies: USE_RANGE USE_SLICE
-#  Storage types: USE_BOUNDED_ARRAY USE_UNBOUNDED_ARRAY
-#  Vector types: USE_STD_VECTOR USE_BOUNDED_VECTOR
-#  Matrix types: USE_MATRIX USE_BOUNDED_MATRIX USE_VECTOR_OF_VECTOR
-#  Adaptors: USE_ADAPTOR
-
-UBLAS_TESTSET ?=
-            USE_DOUBLE USE_STD_COMPLEX
-            USE_RANGE USE_SLICE
-            USE_UNBOUNDED_ARRAY USE_BOUNDED_VECTOR USE_MATRIX ;
-
-#  Sparse storage: USE_MAP_ARRAY USE_STD_MAP
-#  Sparse vectors: USE_MAPPED_VECTOR USE_COMPRESSED_VECTOR USE_COORDINATE_VECTOR
-#  Sparse matrices: USE_MAPPED_MATRIX USE_COMPRESSED_MATRIX USE_COORDINATE_MATRIX USE_MAPPED_VECTOR_OF_MAPPED_VECTOR USE_GENERALIZED_VECTOR_OF_VECTOR
-
-UBLAS_TESTSET_SPARSE ?= 
-            USE_DOUBLE USE_STD_COMPLEX
-#            USE_RANGE USE_SLICE    Too complex for regression testing
-            USE_UNBOUNDED_ARRAY
-            USE_STD_MAP
-            USE_MAPPED_VECTOR USE_COMPRESSED_VECTOR USE_COORDINATE_VECTOR
-            USE_MAPPED_MATRIX USE_COMPRESSED_MATRIX USE_COORDINATE_MATRIX ;
-
-
-test-suite numeric/uBLAS
-    : [ run test1/test1.cpp
-            test1/test11.cpp
-            test1/test12.cpp
-            test1/test13.cpp
-        : # args
-        : # input files
-        : # requirements
-            <define>$(UBLAS_TESTSET)
-            <intel-linux><*><cxxflags>"-fpstkchk"    # Try and pick up runtime failures
-            <vacpp><*><define>"BOOST_UBLAS_NO_ELEMENT_PROXIES"
-            [ cond [ is-subset Darwin : $(JAMUNAME) ] : <gcc><*><cxxflags>"-fabi-version=0" ] ]
-      [ run test2/test2.cpp
-            test2/test21.cpp
-            test2/test22.cpp
-            test2/test23.cpp
-        : # args
-        : # input files
-        : # requirements
-            <define>$(UBLAS_TESTSET)
-            <vacpp><*><define>"BOOST_UBLAS_NO_ELEMENT_PROXIES"
-      ]
-      [ run test3/test3.cpp
-            test3/test31.cpp
-            test3/test32.cpp
-            test3/test33.cpp
-        : # args
-        : # input files
-        : # requirements
-            <define>$(UBLAS_TESTSET_SPARSE)
-            <vacpp><*><define>"BOOST_UBLAS_NO_ELEMENT_PROXIES"
-      ]
-      [ run test4/test4.cpp
-            test4/test42.cpp
-            test4/test43.cpp
-        : # args
-        : # input files
-        : # requirements
-            <define>$(UBLAS_TESTSET)
-            <vacpp><*><define>"BOOST_UBLAS_NO_ELEMENT_PROXIES"
-      ]
-      [ run test5/test5.cpp
-            test5/test52.cpp
-            test5/test53.cpp
-        : # args
-        : # input files
-        : # requirements
-            <define>$(UBLAS_TESTSET)
-            <vacpp><*><define>"BOOST_UBLAS_NO_ELEMENT_PROXIES"
-      ]
-      [ run test6/test6.cpp
-            test6/test62.cpp
-            test6/test63.cpp
-        : # args
-        : # input files
-        : # requirements
-            <define>$(UBLAS_TESTSET)
-            <vacpp><*><define>"BOOST_UBLAS_NO_ELEMENT_PROXIES"
-      ]
-# Test7 checks uBLAS operation with interval types.
-# This causes too much compiler badness. Issues need to be addressed for VC7.1 VC8 CW9 and Intel 8 (windows)
-#      [ run test7/test7.cpp
-#            test7/test71.cpp
-#            test7/test72.cpp
-#            test7/test73.cpp
-#        : # args
-#        : # input files
-#        : # requirements
-#            <define>BOOST_UBLAS_USE_INTERVAL
-#            <define>$(UBLAS_TESTSET)
-#            <vacpp><*><define>"BOOST_UBLAS_NO_ELEMENT_PROXIES"
-#      ]
-
-      [ run placement_new.cpp
-      ]
-      [ compile concepts.cpp
-        : # requirements
-            <define>EXTERNAL
-            <intel-linux><*><cxxflags>"-Xc"
-            <vacpp><*><define>"BOOST_UBLAS_NO_ELEMENT_PROXIES"
-      ]
-    ;

Modified: boost/trunk/libs/numeric/ublas/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/numeric/ublas/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/ublas/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -47,52 +47,52 @@
 
 
 test-suite numeric/uBLAS
-    : [ run test1/test1.cpp
-            test1/test11.cpp
-            test1/test12.cpp
-            test1/test13.cpp
+    : [ run test1.cpp
+            test11.cpp
+            test12.cpp
+            test13.cpp
         : # args
         : # input files
         : # requirements
             <define>$(UBLAS_TESTSET)
       ]
-      [ run test2/test2.cpp
-            test2/test21.cpp
-            test2/test22.cpp
-            test2/test23.cpp
+      [ run test2.cpp
+            test21.cpp
+            test22.cpp
+            test23.cpp
         : : :
             <define>$(UBLAS_TESTSET)
       ]
-      [ run test3/test3.cpp
-            test3/test31.cpp
-            test3/test32.cpp
-            test3/test33.cpp
+      [ run test3.cpp
+            test31.cpp
+            test32.cpp
+            test33.cpp
         : : :
             <define>$(UBLAS_TESTSET_SPARSE)
       ]
-      [ run test4/test4.cpp
-            test4/test42.cpp
-            test4/test43.cpp
+      [ run test4.cpp
+            test42.cpp
+            test43.cpp
         : : :
             <define>$(UBLAS_TESTSET)
       ]
-      [ run test5/test5.cpp
-            test5/test52.cpp
-            test5/test53.cpp
+      [ run test5.cpp
+            test52.cpp
+            test53.cpp
         : : :
             <define>$(UBLAS_TESTSET)
       ]
-      [ run test6/test6.cpp
-            test6/test62.cpp
-            test6/test63.cpp
+      [ run test6.cpp
+            test62.cpp
+            test63.cpp
         : : :
             <define>$(UBLAS_TESTSET)
       ]
 # Test commented out, just like in V1 Jamfile
-#      [ run test7/test7.cpp
-#            test7/test71.cpp
-#            test7/test72.cpp
-#            test7/test73.cpp
+#      [ run test7.cpp
+#            test71.cpp
+#            test72.cpp
+#            test73.cpp
 #        : : :
 #            <define>BOOST_UBLAS_USE_INTERVAL
 #            <define>$(UBLAS_TESTSET)

Modified: boost/trunk/libs/numeric/ublas/test/placement_new.cpp
===================================================================
--- boost/trunk/libs/numeric/ublas/test/placement_new.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/numeric/ublas/test/placement_new.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,7 +22,7 @@
     }
     ~udt () {}      // required for GCC prior to 3.4 to generate cookie
 
-	static udt* base_pointer;
+    static udt* base_pointer;
 };
 
 udt* udt::base_pointer;

Copied: boost/trunk/libs/numeric/ublas/test/test1.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test1.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test1.hpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test1.hpp)

Copied: boost/trunk/libs/numeric/ublas/test/test11.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test11.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test12.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test12.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test13.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test13.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test2.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test2.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test2.hpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test2.hpp)

Copied: boost/trunk/libs/numeric/ublas/test/test21.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test21.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test22.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test22.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test23.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test23.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test3.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test3.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test3.hpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test3.hpp)

Copied: boost/trunk/libs/numeric/ublas/test/test31.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test31.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test32.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test32.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test33.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test33.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test4.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test4.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test4.hpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test4.hpp)

Copied: boost/trunk/libs/numeric/ublas/test/test42.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test42.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test43.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test43.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test5.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test5.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test5.hpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test5.hpp)

Copied: boost/trunk/libs/numeric/ublas/test/test52.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test52.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test53.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test53.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test6.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test6.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test6.hpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test6.hpp)

Copied: boost/trunk/libs/numeric/ublas/test/test62.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test62.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test63.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test63.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test7.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test7.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test7.hpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test7.hpp)

Copied: boost/trunk/libs/numeric/ublas/test/test71.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test71.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test72.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test72.cpp)

Copied: boost/trunk/libs/numeric/ublas/test/test73.cpp (from rev 14034, boost/branches/upstream/current/libs/numeric/ublas/test/test73.cpp)

Modified: boost/trunk/libs/optional/doc/optional.html
===================================================================
--- boost/trunk/libs/optional/doc/optional.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/optional/doc/optional.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -127,7 +127,7 @@
   which in our case is either <code>T</code> or <code>nil_t</code>.<br>
   Using the <a href="../../../doc/html/variant.html">Boost.Variant</a> library, this model can be implemented
   in terms of <code>boost::variant&lt;T,nil_t&gt;</code>.<br>
-  There is precedence for a discriminated union as a model for an optional value: the
+  There is precedent for a discriminated union as a model for an optional value: the
   <a href="http://www.haskell.org/"><u>Haskell</u></a> <b>Maybe</b> built-in type constructor. 
 Thus, a discriminated union <code>T+nil_t</code> serves as a conceptual foundation.</p>
 <p>A <code>variant&lt;T,nil_t&gt;</code> follows naturally from the traditional idiom of extending
@@ -1611,4 +1611,4 @@
 HREF="http://www.boost.org">www.boost.org</A>, and the boost
 <A HREF="http://www.boost.org/more/mailing_lists.htm#main">discussion lists</A></P>
 </BODY>
-</HTML>
\ No newline at end of file
+</HTML>

Modified: boost/trunk/libs/optional/index.html
===================================================================
--- boost/trunk/libs/optional/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/optional/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,10 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="doc/optional.html">doc/optional.html</a>.
+<a href="doc/optional.html">doc/optional.html</a>.&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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: boost/trunk/libs/optional/test/.cvsignore
===================================================================
--- boost/trunk/libs/optional/test/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/optional/test/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +0,0 @@
-bin

Deleted: boost/trunk/libs/optional/test/Jamfile
===================================================================
--- boost/trunk/libs/optional/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/optional/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,37 +0,0 @@
-# Boost.Optional Library test Jamfile
-#
-# Copyright (C) 2003, Fernando Luis Cacciola Carballal.
-#
-# Use, modification, and distribution is subject to the Boost Software
-# License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-#
-
-subproject libs/optional/test ;
-
-# bring in rules for testing
-SEARCH on testing.jam = $(BOOST_BUILD_PATH) ;
-include testing.jam ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-  test-suite optional :
-    [ run optional_test.cpp ]
-    [ run optional_test_tie.cpp ]
-    [ run optional_test_ref.cpp ]
-    [ run optional_test_inplace.cpp ]
-    [ run optional_test_io.cpp ]
-    [ compile-fail optional_test_fail1.cpp ]
-    [ compile-fail optional_test_fail2.cpp ]
-    [ compile-fail optional_test_fail3a.cpp ]
-    [ compile-fail optional_test_fail3b.cpp ]
-    [ compile-fail optional_test_ref_fail1.cpp ]
-    [ compile-fail optional_test_ref_fail2.cpp ]
-    [ compile-fail optional_test_ref_fail3.cpp ]
-    [ compile-fail optional_test_ref_fail4.cpp ]
-    [ compile-fail optional_test_inplace_fail.cpp ]
-    [ compile-fail optional_test_inplace_fail2.cpp ]
-  ;
-}

Modified: boost/trunk/libs/parameter/doc/Jamfile.v2
===================================================================
--- boost/trunk/libs/parameter/doc/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/doc/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+# 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)
 import docutils ;
 
 import path ;

Modified: boost/trunk/libs/parameter/doc/html/index.html
===================================================================
--- boost/trunk/libs/parameter/doc/html/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/doc/html/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,1176 +1,2159 @@
-<?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.5: http://docutils.sourceforge.net/" />
-<title>The Boost Parameter Library</title>
-<link rel="stylesheet" href="rst.css" type="text/css" />
-</head>
-<body>
-<div class="document" id="the-boost-parameter-library">
-<h1 class="title">The Boost Parameter Library</h1>
-<p><a class="reference" href="../../../../index.htm"><img alt="Boost" src="../../../../boost.png" /></a></p>
-<hr class="docutils" />
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Abstract:</th><td class="field-body"><p class="first">Use this library to write functions and class templates
-that can accept arguments by name:</p>
-<pre class="literal-block">
-new_window(&quot;alert&quot;, <strong>width=10</strong>, <strong>titlebar=false</strong>);
-
-smart_ptr&lt;
-   Foo
- , <strong>deleter_is&lt;Deallocate&lt;Foo&gt; &gt;</strong>
- , <strong>copy_policy_is&lt;DeepCopy&gt;</strong>&gt; p(new Foo);
-</pre>
-<p class="last">Since named arguments can be passed in any order, they are
-especially useful when a function or template has more than one
-parameter with a useful default value.  The library also supports
-<em>unnamed</em> parameters; that is to say, parameters whose identity
-can be deduced from their types.</p>
-</td>
-</tr>
-</tbody>
-</table>
-<hr class="docutils" />
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Authors:</th><td class="field-body">David Abrahams, Daniel Wallin</td>
-</tr>
-<tr class="field"><th class="field-name">Contact:</th><td class="field-body"><a class="reference" href="mailto:dave&#64;boost-consulting.com">dave&#64;boost-consulting.com</a>, <a class="reference" href="mailto:dalwan01&#64;student.umu.se">dalwan01&#64;student.umu.se</a></td>
-</tr>
-<tr class="field"><th class="field-name">Organization:</th><td class="field-body"><a class="reference" href="http://www.boost-consulting.com">Boost Consulting</a></td>
-</tr>
-<tr class="field"><th class="field-name">Date:</th><td class="field-body">$Date: 2005/07/18 20:34:31 $</td>
-</tr>
-<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Copyright David Abrahams, Daniel Wallin
-2005. Distributed under the Boost Software License,
-Version 1.0. (See accompanying file LICENSE_1_0.txt
-or copy at <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</td>
-</tr>
-</tbody>
-</table>
-<hr class="docutils" />
-<div class="contents topic">
-<p class="topic-title first"><a id="table-of-contents" name="table-of-contents"><strong>Table of Contents</strong></a></p>
-<ul class="auto-toc simple">
-<li><a class="reference" href="#motivation" id="id16" name="id16">1&nbsp;&nbsp;&nbsp;Motivation</a></li>
-<li><a class="reference" href="#tutorial" id="id17" name="id17">2&nbsp;&nbsp;&nbsp;Tutorial</a><ul class="auto-toc">
-<li><a class="reference" href="#headers-and-namespaces" id="id18" name="id18">2.1&nbsp;&nbsp;&nbsp;Headers And Namespaces</a></li>
-<li><a class="reference" href="#the-abstract-interface-to-dfs" id="id19" name="id19">2.2&nbsp;&nbsp;&nbsp;The Abstract Interface to <tt class="docutils literal"><span class="pre">depth_first_search</span></tt></a></li>
-<li><a class="reference" href="#defining-the-keywords" id="id20" name="id20">2.3&nbsp;&nbsp;&nbsp;Defining the Keywords</a></li>
-<li><a class="reference" href="#a-bare-bones-function-interface" id="id21" name="id21">2.4&nbsp;&nbsp;&nbsp;A Bare Bones Function Interface</a><ul class="auto-toc">
-<li><a class="reference" href="#the-signature" id="id22" name="id22">2.4.1&nbsp;&nbsp;&nbsp;The Signature</a></li>
-<li><a class="reference" href="#exercising-the-interface" id="id23" name="id23">2.4.2&nbsp;&nbsp;&nbsp;Exercising the Interface</a></li>
-<li><a class="reference" href="#signature-matching-and-overloading" id="id24" name="id24">2.4.3&nbsp;&nbsp;&nbsp;Signature Matching and Overloading</a></li>
-</ul>
-</li>
-<li><a class="reference" href="#filling-in-the-body" id="id25" name="id25">2.5&nbsp;&nbsp;&nbsp;Filling in the Body</a></li>
-<li><a class="reference" href="#adding-defaults" id="id26" name="id26">2.6&nbsp;&nbsp;&nbsp;Adding Defaults</a><ul class="auto-toc">
-<li><a class="reference" href="#syntax" id="id27" name="id27">2.6.1&nbsp;&nbsp;&nbsp;Syntax</a></li>
-</ul>
-</li>
-<li><a class="reference" href="#deducing-parameter-types" id="id28" name="id28">2.7&nbsp;&nbsp;&nbsp;Deducing Parameter Types</a><ul class="auto-toc">
-<li><a class="reference" href="#forwarding-to-an-implementation-function" id="id29" name="id29">2.7.1&nbsp;&nbsp;&nbsp;Forwarding to an Implementation Function</a></li>
-<li><a class="reference" href="#the-binding-metafunction" id="id30" name="id30">2.7.2&nbsp;&nbsp;&nbsp;The <tt class="docutils literal"><span class="pre">binding</span></tt> <span class="concept">Metafunction</span></a></li>
-<li><a class="reference" href="#binding-with-defaults" id="id31" name="id31">2.7.3&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">binding</span></tt> With Defaults</a></li>
-<li><a class="reference" href="#binding-safely" id="id32" name="id32">2.7.4&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">binding</span></tt> Safely</a></li>
-</ul>
-</li>
-<li><a class="reference" href="#beyond-ordinary-default-arguments" id="id33" name="id33">2.8&nbsp;&nbsp;&nbsp;Beyond Ordinary Default Arguments</a></li>
-<li><a class="reference" href="#more-restrictive-signatures" id="id34" name="id34">2.9&nbsp;&nbsp;&nbsp;More Restrictive Signatures</a><ul class="auto-toc">
-<li><a class="reference" href="#checking-for-convertibility-to-specific-types" id="id35" name="id35">2.9.1&nbsp;&nbsp;&nbsp;Checking for Convertibility to Specific Types</a></li>
-<li><a class="reference" href="#signature-restriction-predicates" id="id36" name="id36">2.9.2&nbsp;&nbsp;&nbsp;Signature Restriction Predicates</a></li>
-</ul>
-</li>
-<li><a class="reference" href="#efficiency-issues" id="id37" name="id37">2.10&nbsp;&nbsp;&nbsp;Efficiency Issues</a><ul class="auto-toc">
-<li><a class="reference" href="#eliminating-copies" id="id38" name="id38">2.10.1&nbsp;&nbsp;&nbsp;Eliminating Copies</a></li>
-<li><a class="reference" href="#lazy-default-computation" id="id39" name="id39">2.10.2&nbsp;&nbsp;&nbsp;Lazy Default Computation</a></li>
-<li><a class="reference" href="#dispatching-based-on-the-presence-of-a-default" id="id40" name="id40">2.10.3&nbsp;&nbsp;&nbsp;Dispatching Based on the Presence of a Default</a></li>
-</ul>
-</li>
-</ul>
-</li>
-<li><a class="reference" href="#portability-considerations" id="id41" name="id41">3&nbsp;&nbsp;&nbsp;Portability Considerations</a><ul class="auto-toc">
-<li><a class="reference" href="#no-sfinae-support" id="id42" name="id42">3.1&nbsp;&nbsp;&nbsp;No SFINAE Support</a></li>
-<li><a class="reference" href="#no-support-for-result-of" id="id43" name="id43">3.2&nbsp;&nbsp;&nbsp;No Support for <tt class="docutils literal"><span class="pre">result_of</span></tt></a></li>
-<li><a class="reference" href="#compiler-can-t-see-references-in-unnamed-namespace" id="id44" name="id44">3.3&nbsp;&nbsp;&nbsp;Compiler Can't See References In Unnamed Namespace</a></li>
-</ul>
-</li>
-<li><a class="reference" href="#reference" id="id45" name="id45">4&nbsp;&nbsp;&nbsp;Reference</a></li>
-<li><a class="reference" href="#acknowledgements" id="id46" name="id46">5&nbsp;&nbsp;&nbsp;Acknowledgements</a></li>
-</ul>
-</div>
-<hr class="docutils" />
-<div class="section">
-<h1><a class="toc-backref" href="#id16" id="motivation" name="motivation">1&nbsp;&nbsp;&nbsp;Motivation</a></h1>
-<p>In C++, arguments are normally given meaning by their positions
-with respect to a parameter list.  That protocol is fine when there
-is at most one parameter with a default value, but when there are
-even a few useful defaults, the positional interface becomes
-burdensome:</p>
-<ul>
-<li><p class="first">Since an argument's meaning is given by its position, we have to
-choose an (often arbitrary) order for parameters with default
-values, making some combinations of defaults unusable:</p>
-<pre class="literal-block">
-window* new_window(
-   char const* name,
-   <strong>int border_width = default_border_width,</strong>
-   bool movable = true,
-   bool initially_visible = true
-   );
-
-const bool movability = false;
-window* w = new_window(&quot;alert box&quot;, movability);
-</pre>
-<p>In the example above we wanted to make an unmoveable window
-with a default <tt class="docutils literal"><span class="pre">border_width</span></tt>, but instead we got a moveable
-window with a <tt class="docutils literal"><span class="pre">border_width</span></tt> of zero.  To get the desired
-effect, we'd need to write:</p>
-<pre class="literal-block">
-window* w = new_window(
-   &quot;alert box&quot;, <strong>default_border_width</strong>, movability);
-</pre>
-</li>
-<li><p class="first">It can become difficult for readers to understand the meaning of
-arguments at the call site:</p>
-<pre class="literal-block">
-window* w = new_window(&quot;alert&quot;, 1, true, false);
-</pre>
-<p>Is this window moveable and initially invisible, or unmoveable
-and initially visible?  The reader needs to remember the order
-of arguments to be sure.</p>
-</li>
-<li><p class="first">The author of the call may not remember the order of the
-arguments either, leading to hard-to-find bugs.</p>
-</li>
-</ul>
-<p>This library addresses the problems outlined above by associating
-each parameter with a keyword object.  Now users can identify
-arguments by keyword, rather than by position:</p>
-<pre class="literal-block">
-window* w = new_window(&quot;alert box&quot;, <strong>movable=</strong>false); // OK!
-</pre>
-<p>It's not uncommon for a function to have parameters that can be
-uniquely identified based on the types of arguments passed.  The
-<tt class="docutils literal"><span class="pre">name</span></tt> parameter to <tt class="docutils literal"><span class="pre">new_window</span></tt> is one such example.  None of
-the other arguments, if valid, can reasonably be converted to a
-<tt class="docutils literal"><span class="pre">char</span> <span class="pre">const*</span></tt>, so in theory a user could pass the window name in
-<em>any</em> argument position without causing ambiguity.  The Parameter
-library's <strong>unnamed parameter</strong> facility can be employed to allow
-that usage:</p>
-<pre class="literal-block">
-window* w = new_window(movable=false, <strong>&quot;alert box&quot;</strong>); // OK!
-</pre>
-<p>Appropriately used, an unnamed parameter interface can free the
-user of the burden of even remembering the formal parameter names.</p>
-<p>The reasoning we've given for named and unnamed parameter
-interfaces applies equally well to class templates as it does to
-functions.  The syntax for passing named template parameters is not
-quite as natural as it is for named function parameters:</p>
-<pre class="literal-block">
-// <em>The ideal would be</em>
-//    <em>smart_ptr&lt;ownership=shared, value_type=Client&gt; p;</em>
-//
-// <em>but instead we must write something like:</em>
-smart_ptr&lt;<strong>ownership&lt;shared&gt;</strong>, <strong>value_type&lt;Client&gt;</strong> &gt; p;
-</pre>
-<p>This small syntactic deficiency makes unnamed parameters an
-especially big win when used with class templates:</p>
-<pre class="literal-block">
-// <em>p and q could be equivalent, given an unnamed</em>
-// <em>parameter interface.</em>
-smart_ptr&lt;<strong>shared</strong>, <strong>Client</strong>&gt; p;
-smart_ptr&lt;<strong>Client</strong>, <strong>shared</strong>&gt; q;
-</pre>
-</div>
-<div class="section">
-<h1><a class="toc-backref" href="#id17" id="tutorial" name="tutorial">2&nbsp;&nbsp;&nbsp;Tutorial</a></h1>
-<p>In this section we'll show how the Parameter library can be used to
-build an expressive interface to the <a class="reference" href="../../../graph/index.html">Boost Graph library</a>'s
-<a class="reference" href="../../../graph/doc/depth_first_search.html"><tt class="docutils literal"><span class="pre">depth_first_search</span></tt></a> algorithm.<a class="footnote-reference" href="#old-interface" id="id2" name="id2"><sup>1</sup></a></p>
-<!-- Revisit this
-
-After laying some groundwork
-and describing the algorithm's abstract interface, we'll show you
-how to build a basic implementation with keyword support.  Then
-we'll add support for default arguments and we'll gradually refine the
-implementation with syntax improvements.  Finally we'll show how to
-streamline the implementation of named parameter interfaces,
-improve their participation in overload resolution, and optimize
-their runtime efficiency. -->
-<div class="section">
-<h2><a class="toc-backref" href="#id18" id="headers-and-namespaces" name="headers-and-namespaces">2.1&nbsp;&nbsp;&nbsp;Headers And Namespaces</a></h2>
-<p>Most components of the Parameter library are declared in a
-header named for the component.  For example,</p>
-<pre class="literal-block">
-#include &lt;boost/parameter/keyword.hpp&gt;
-</pre>
-<p>will ensure <tt class="docutils literal"><span class="pre">boost::parameter::keyword</span></tt> is known to the
-compiler.  There is also a combined header,
-<tt class="docutils literal"><span class="pre">boost/parameter.hpp</span></tt>, that includes most of the library's
-components.  For the the rest of this tutorial, unless we say
-otherwise, you can use the rule above to figure out which header
-to <tt class="docutils literal"><span class="pre">#include</span></tt> to access any given component of the library.</p>
-<p>Also, the examples below will also be written as if the
-namespace alias</p>
-<pre class="literal-block">
-namespace parameter = boost::parameter;
-</pre>
-<p>has been declared: we'll write <tt class="docutils literal"><span class="pre">parameter::xxx</span></tt> instead of
-<tt class="docutils literal"><span class="pre">boost::parameter::xxx</span></tt>.</p>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id19" id="the-abstract-interface-to-dfs" name="the-abstract-interface-to-dfs">2.2&nbsp;&nbsp;&nbsp;The Abstract Interface to <tt class="docutils literal"><span class="pre">depth_first_search</span></tt></a></h2>
-<p>The Graph library's <tt class="docutils literal"><span class="pre">depth_first_search</span></tt> algorithm is a generic function accepting
-from one to four arguments by reference.  If all arguments were
-required, its signature might be as follows:</p>
-<pre class="literal-block">
-template &lt;
-    class Graph, class DFSVisitor, class Index, class ColorMap
-&gt;
-void depth_first_search(
-  , Graph const&amp; graph
-  , DFSVisitor visitor
-  , typename graph_traits&lt;g&gt;::vertex_descriptor root_vertex
-  , IndexMap index_map
-  , ColorMap&amp; color);
-</pre>
-<p>However, most of the parameters have a useful default value, as
-shown in the table below.</p>
-<table border="1" class="docutils" id="default-expressions">
-<span id="parameter-table"></span><caption><a id="default-expressions" name="default-expressions"><span id="parameter-table"></span><tt class="docutils literal"><span class="pre">depth_first_search</span></tt> Parameters</a></caption>
-<colgroup>
-<col width="27%" />
-<col width="17%" />
-<col width="57%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th class="head">Parameter Name</th>
-<th class="head">Dataflow</th>
-<th class="head">Default Value (if any)</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><tt class="docutils literal"><span class="pre">graph</span></tt></td>
-<td>in</td>
-<td>none - this argument is required.</td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">visitor</span></tt></td>
-<td>in</td>
-<td><tt class="docutils literal"><span class="pre">boost::dfs_visitor&lt;&gt;()</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">root_vertex</span></tt></td>
-<td>in</td>
-<td><tt class="docutils literal"><span class="pre">*vertices(graph).first</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">index_map</span></tt></td>
-<td>in</td>
-<td><tt class="docutils literal"><span class="pre">get(boost::vertex_index,graph)</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">color_map</span></tt></td>
-<td>out</td>
-<td>an <tt class="docutils literal"><span class="pre">iterator_property_map</span></tt>
-created from a <tt class="docutils literal"><span class="pre">std::vector</span></tt> of
-<tt class="docutils literal"><span class="pre">default_color_type</span></tt> of size
-<tt class="docutils literal"><span class="pre">num_vertices(graph)</span></tt> and using
-<tt class="docutils literal"><span class="pre">index_map</span></tt> for the index map.</td>
-</tr>
-</tbody>
-</table>
-<p>Don't be intimidated by the complex default values.  For the
-purposes of this exercise, you don't need to understand what they
-mean. Also, we'll show you how the default for <tt class="docutils literal"><span class="pre">color_map</span></tt> is
-computed later in the tutorial; trust us when we say that the
-complexity of its default will become valuable.</p>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id20" id="defining-the-keywords" name="defining-the-keywords">2.3&nbsp;&nbsp;&nbsp;Defining the Keywords</a></h2>
-<p>The point of this exercise is to make it possible to call
-<tt class="docutils literal"><span class="pre">depth_first_search</span></tt> with keyword arguments, leaving out any
-arguments for which the default is appropriate:</p>
-<pre class="literal-block">
-graphs::depth_first_search(g, <strong>color_map=my_color_map</strong>);
-</pre>
-<p>To make that syntax legal, there needs to be an object called
-<tt class="docutils literal"><span class="pre">color_map</span></tt> with an assignment operator that can accept a
-<tt class="docutils literal"><span class="pre">my_color_map</span></tt> argument.  In this step we'll create one such
-<strong>keyword object</strong> for each parameter.  Each keyword object will be
-identified by a unique <strong>keyword tag type</strong>.</p>
-<p>We're going to define our interface in namespace <tt class="docutils literal"><span class="pre">graphs</span></tt>.  Since
-users need access to the keyword objects, but not the tag types,
-we'll define the keyword objects so they're acceessible through
-<tt class="docutils literal"><span class="pre">graphs</span></tt>, and we'll hide the tag types away in a tested
-namespace, <tt class="docutils literal"><span class="pre">graphs::tag</span></tt>.  The library provides a convenient
-macro for that purpose (MSVC6.x users see this <a class="reference" href="#compiler-can-t-see-references-in-unnamed-namespace">note</a>):</p>
-<pre class="literal-block">
-#include &lt;boost/parameter/keyword.hpp&gt;
-
-namespace graphs
-{
-  BOOST_PARAMETER_KEYWORD(tag, graph)    // Note: no semicolon
-  BOOST_PARAMETER_KEYWORD(tag, visitor)
-  BOOST_PARAMETER_KEYWORD(tag, root_vertex)
-  BOOST_PARAMETER_KEYWORD(tag, index_map)
-  BOOST_PARAMETER_KEYWORD(tag, color_map)
-}
-</pre>
-<p>The declaration of the <tt class="docutils literal"><span class="pre">visitor</span></tt> keyword you see here is
-equivalent to:</p>
-<pre class="literal-block">
-namespace graphs
-{
-  namespace tag
-  {
-    // The tag type
-    struct visitor;
-  }
-
-  namespace // unnamed
-  {
-    // A reference to the tag object
-    boost::parameter::keyword&lt;tag::visitor&gt;&amp; visitor
-    = boost::parameter::keyword&lt;tag::visitor&gt;::instance;
-  }
-}
-</pre>
-<p>This “fancy dance” involving the unnamed namespace and references
-is all done to avoid violating the One Definition Rule (ODR)<a class="footnote-reference" href="#odr" id="id5" name="id5"><sup>2</sup></a> when the named parameter interface is used by function
-templates that are instantiated in multiple translation
-units.</p>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id21" id="a-bare-bones-function-interface" name="a-bare-bones-function-interface">2.4&nbsp;&nbsp;&nbsp;A Bare Bones Function Interface</a></h2>
-<p>Next we can write the skeleton of our <tt class="docutils literal"><span class="pre">depth_first_search</span></tt>
-function template.  To declare the function, we'll use the
-<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUNCTION</span></tt> macro:</p>
-<pre class="literal-block">
-#include &lt;boost/parameter/preprocessor.hpp&gt;
-
-namespace graphs
-{
-  BOOST_PARAMETER_FUNCTION(
-      (void),
-      depth_first_search,
-
-      tag,
-      (required (graph,*) )
-      (optional (visitor,*) (root_vertex,*)
-                (index_map,*) (out(color_map),*) )
-  )
-  {
-      // ... body of function goes here...
-  }
-}
-</pre>
-<p>The first argument to <tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUNCTION</span></tt> is the
-function's return type, in parentheses.  These parentheses are
-necessary because some types, such as <tt class="docutils literal"><span class="pre">std::pair&lt;int,int&gt;</span></tt>,
-contain commas that would otherwise confuse the preprocessor.  The
-second argument is the name of the resulting function template.
-The third argument is the name of the namespace in which keyword
-types can be found, but most of the interesting information is in
-the fourth argument, which describes the function signature.</p>
-<div class="section">
-<h3><a class="toc-backref" href="#id22" id="the-signature" name="the-signature">2.4.1&nbsp;&nbsp;&nbsp;The Signature</a></h3>
-<p>The fourth argument to <tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUNCTION</span></tt> is a
-<a class="reference" href="../../preprocessor">Boost.Preprocessor</a> <a class="reference" href="../../preprocessor/doc/data/sequences.html">sequence</a> of two elements, describing the
-required and optional parameters to <tt class="docutils literal"><span class="pre">depth_first_search</span></tt>,
-respectively (if the parameters were all required—or all
-optional—the sequence would have had only one element).  The first
-element specifies a single <tt class="docutils literal"><span class="pre">required</span></tt> parameter, <tt class="docutils literal"><span class="pre">graph</span></tt>:</p>
-<pre class="literal-block">
-(required (graph,*) )
-</pre>
-<p>The <tt class="docutils literal"><span class="pre">*</span></tt> simply indicates that we can pass anything at all to
-<tt class="docutils literal"><span class="pre">depth_first_search</span></tt> as a <tt class="docutils literal"><span class="pre">graph</span></tt>.  The second element of the
-outer sequence lists the <tt class="docutils literal"><span class="pre">optional</span></tt> arguments.
-Since there are multiple optional arguments, their entries are
-composed into another <a class="reference" href="../../preprocessor/doc/data/sequences.html">sequence</a>.  Note that since the <tt class="docutils literal"><span class="pre">color_map</span></tt> is an
-“out” parameter, its name has been enclosed in the <tt class="docutils literal"><span class="pre">out(…)</span></tt>
-construct, which indicates to the library that it should be passed
-by non-const reference (for an “in/out” parameter we'd use
-<tt class="docutils literal"><span class="pre">in_out(…)</span></tt>).  If you refer back to the <a class="reference" href="#parameter-table">parameter table</a> it
-should be clear that, default values aside, this function signature
-describes the same information.</p>
-</div>
-<div class="section">
-<h3><a class="toc-backref" href="#id23" id="exercising-the-interface" name="exercising-the-interface">2.4.2&nbsp;&nbsp;&nbsp;Exercising the Interface</a></h3>
-<p>We've already gained the ability to call our function with a
-mixture of positional and named arguments:</p>
-<pre class="literal-block">
-int main()
-{
-    // Make keyword names available without qualification
-    using namespace graphs;
-
-    graphs::depth_first_search(
-      'G', 'v',                               // Positional args
-      index_map = &quot;hello, world&quot;,             // Named args in
-      root_vertex = 3.5, color_map = false);  // arbitrary order
-}
-</pre>
-</div>
-<div class="section">
-<h3><a class="toc-backref" href="#id24" id="signature-matching-and-overloading" name="signature-matching-and-overloading">2.4.3&nbsp;&nbsp;&nbsp;Signature Matching and Overloading</a></h3>
-<p>We can also observe the effects of using <tt class="docutils literal"><span class="pre">required</span></tt> and
-<tt class="docutils literal"><span class="pre">optional</span></tt> in the function signature.  Any invocation of
-<tt class="docutils literal"><span class="pre">depth_first_search</span></tt> will compile, as long as it has a <tt class="docutils literal"><span class="pre">graph</span></tt>
-parameter:</p>
-<pre class="literal-block">
-depth_first_search(&quot;some-graph&quot;);                        // OK
-depth_first_search(index_map=&quot;hello, world&quot;, graph='G'); // OK
-</pre>
-<p>however, if we leave out the graph argument, the compiler will
-complain that no <tt class="docutils literal"><span class="pre">depth_first_search</span></tt> matches the arguments:</p>
-<pre class="literal-block">
-depth_first_search(root_vertex=3.5);                     // ERROR
-</pre>
-<p>It's important to note that the parameter library is not forcing a
-compilation error in this case.  If we add another overload of
-<tt class="docutils literal"><span class="pre">depth_first_search</span></tt> that <em>does</em> match, the compiler will be
-happy again:</p>
-<pre class="literal-block">
-// New overload; matches anything
-template &lt;class T&gt; void depth_first_search(T) {}
-
-depth_first_search(root_vertex=3.5);                     // OK
-</pre>
-<p>This capability depends on your compiler's support for SFINAE.<a class="footnote-reference" href="#sfinae" id="id6" name="id6"><sup>6</sup></a></p>
-</div>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id25" id="filling-in-the-body" name="filling-in-the-body">2.5&nbsp;&nbsp;&nbsp;Filling in the Body</a></h2>
-<p>Of course, the test above isn't very interesting unless we can see
-the values of the arguments.  Just to get a feel for how things
-work, let's add some temporary code to print the arguments.  The
-most natural approach would be to access the arguments directly, by
-name:</p>
-<pre class="literal-block">
-{
-    std::cout &lt;&lt; &quot;graph:\\t&quot; &lt;&lt; graph &lt;&lt; std::endl;
-    std::cout &lt;&lt; &quot;visitor:\\t&quot; &lt;&lt; visitor &lt;&lt; std::endl;
-    std::cout &lt;&lt; &quot;root_vertex:\\t&quot; &lt;&lt; root_vertex &lt;&lt; std::endl;
-    std::cout &lt;&lt; &quot;index_map:\\t&quot; &lt;&lt; index_map &lt;&lt; std::endl;
-    std::cout &lt;&lt; &quot;color_map:\\t&quot; &lt;&lt; color_map &lt;&lt; std::endl;
-}
-</pre>
-<p>Unfortunately, that won't quite work, because the function whose
-body we'll be writing doesn't have parameters named <tt class="docutils literal"><span class="pre">graph</span></tt>,
-<tt class="docutils literal"><span class="pre">visitor</span></tt>, etc.  It may not be obvious, since the declaration is
-generated by the <tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUNCTION</span></tt> macro, but there is
-actually only a single parameter, called <tt class="docutils literal"><span class="pre">args</span></tt>.  <tt class="docutils literal"><span class="pre">args</span></tt> is what
-is known as an <span class="concept">ArgumentPack</span>: a bundle of references to the actual
-arguments, tagged with their keywords.  To extract each parameter,
-we just need to pass its keyword object to the <span class="concept">ArgumentPack</span>'s
-subscript operator, like this:</p>
-<pre class="literal-block">
-namespace graphs
-{
-  BOOST_PARAMETER_FUNCTION(
-      (void),
-      depth_first_search,
-
-      tag,
-      (required (graph,*) )
-      (optional (visitor,*) (root_vertex,*)
-                (index_map,*) (out(color_map),*) )
-  )
-  {
-      std::cout &lt;&lt; &quot;graph:\t&quot; &lt;&lt; <strong>args[graph]</strong> &lt;&lt; std::endl;
-      std::cout &lt;&lt; &quot;visitor:\t&quot; &lt;&lt; <strong>args[visitor]</strong> &lt;&lt; std::endl;
-      std::cout &lt;&lt; &quot;root_vertex:\t&quot; &lt;&lt; <strong>args[root_vertex]</strong> &lt;&lt; std::endl;
-      std::cout &lt;&lt; &quot;index_map:\t&quot; &lt;&lt; <strong>args[index_map]</strong> &lt;&lt; std::endl;
-      std::cout &lt;&lt; &quot;color_map:\t&quot; &lt;&lt; <strong>args[color_map]</strong> &lt;&lt; std::endl;
-  }
-}
-</pre>
-<p>Now our program will print:</p>
-<pre class="literal-block">
-graph:       G
-visitor:     2
-root_vertex: 3.5
-index_map:   hello, world
-color_map:   false
-</pre>
-<p>Of course, we can pass the arguments in any order without changing
-the result:</p>
-<pre class="literal-block">
-int main()
-{
-    using namespace graphs;
-
-    graphs::depth_first_search(
-      root_vertex = 3.5, graph = 'G', color_map = false,
-      index_map = &quot;hello, world&quot;, visitor = 2);
-}
-</pre>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id26" id="adding-defaults" name="adding-defaults">2.6&nbsp;&nbsp;&nbsp;Adding Defaults</a></h2>
-<p>Despite the use of <tt class="docutils literal"><span class="pre">optional</span></tt> in the signature, all
-the arguments to <tt class="docutils literal"><span class="pre">depth_first_search</span></tt> are actually required.  If
-any parameter can't be found, there will be a compilation error
-where we try to extract it from the <span class="concept">ArgumentPack</span> using the
-subscript operator.  To make it legal to omit an argument we need
-to give it a default value.</p>
-<div class="section">
-<h3><a class="toc-backref" href="#id27" id="syntax" name="syntax">2.6.1&nbsp;&nbsp;&nbsp;Syntax</a></h3>
-<p>To make an optional parameter <em>truly</em> optional, we can follow its keyword
-with the <tt class="docutils literal"><span class="pre">|</span></tt> operator and the parameter's default value within
-the square brackets.  In the following example, we've given
-<tt class="docutils literal"><span class="pre">root_vertex</span></tt> a default of <tt class="docutils literal"><span class="pre">42</span></tt> and <tt class="docutils literal"><span class="pre">color_map</span></tt> a default of
-<tt class="docutils literal"><span class="pre">&quot;hello,</span> <span class="pre">world&quot;</span></tt>.</p>
-<pre class="literal-block">
-namespace graphs
-{
-{
-  BOOST_PARAMETER_FUNCTION(
-      (void),
-      depth_first_search,
-
-      tag,
-      (required (graph,*) )
-      (optional (visitor,*) (root_vertex,*)
-                (index_map,*) (out(color_map),*) )
-  )
-  {
-      std::cout &lt;&lt; &quot;graph:\t&quot; &lt;&lt; args[graph] &lt;&lt; std::endl;
-      std::cout &lt;&lt; &quot;visitor:\t&quot; &lt;&lt; args[visitor] &lt;&lt; std::endl;
-      std::cout &lt;&lt; &quot;root_vertex:\t&quot; &lt;&lt; args[root_vertex<strong>|42</strong>] &lt;&lt; std::endl;
-      std::cout &lt;&lt; &quot;index_map:\t&quot; &lt;&lt; args[index_map] &lt;&lt; std::endl;
-      std::cout &lt;&lt; &quot;color_map:\t&quot; &lt;&lt; args[color_map<strong>|&quot;hello, world&quot;</strong>] &lt;&lt; std::endl;
-  }
-}
-</pre>
-<p>Now we can invoke the function without supplying <tt class="docutils literal"><span class="pre">color_map</span></tt> or
-<tt class="docutils literal"><span class="pre">root_vertex</span></tt>:</p>
-<pre class="literal-block">
-graphs::depth_first_search(
-  graph = 'G', index_map = &quot;index&quot;, visitor = 6);
-</pre>
-<p>The call above would print:</p>
-<pre class="literal-block">
-graph:       G
-visitor:     6
-root_vertex: 42
-index_map:   index
-color_map:   hello, world
-</pre>
-<div class="important">
-<p class="first admonition-title">Important</p>
-<p class="last">The index expression <tt class="docutils literal"><span class="pre">args[…]</span></tt> always yields a <em>reference</em>
-that is bound either to the actual argument passed by the caller
-or, if no argument is passed explicitly, to the specified
-default value.</p>
-</div>
-</div>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id28" id="deducing-parameter-types" name="deducing-parameter-types">2.7&nbsp;&nbsp;&nbsp;Deducing Parameter Types</a></h2>
-<p>Now it's time to put some more realistic defaults in place.  We'll
-have to give up our print statements—at least if we want to see the
-defaults work—since the default values of these
-parameters generally aren't printable.</p>
-<p>Instead, we'll connect local variables to the arguments and use
-those in our algorithm:</p>
-<pre class="literal-block">
-namespace graphs
-{
-  BOOST_PARAMETER_FUNCTION(
-      (void),
-      depth_first_search,
-
-      tag,
-      (required (graph,*) )
-      (optional (visitor,*) (root_vertex,*)
-                (index_map,*) (out(color_map),*) )
-  )
-  {
-      <em>Graph</em>   g = args[graph];
-      <em>Visitor</em> v = args[visitor|<em>default-expression</em><sub>1</sub>];
-      <em>Vertex</em>  s = args[root_vertex|<em>default-expression</em><sub>2</sub>];
-      <em>Index</em>   i = args[index_map|<em>default-expression</em><sub>3</sub>];
-      <em>Color</em>   c = args[color|<em>default-expression</em><sub>4</sub>];
-
-      <em>…use g, v, s, i, and c to implement the algorithm…</em>
-  }
-}
-</pre>
-<p>We'll insert the <a class="reference" href="#default-expressions">default expressions</a> in a moment, but first we
-need to come up with the types <em>Graph</em>, <em>Visitor</em>, <em>Vertex</em>,
-<em>Index</em>, and <em>Color</em>.</p>
-<div class="section">
-<h3><a class="toc-backref" href="#id29" id="forwarding-to-an-implementation-function" name="forwarding-to-an-implementation-function">2.7.1&nbsp;&nbsp;&nbsp;Forwarding to an Implementation Function</a></h3>
-<p>The easiest way to discover the parameter types is to forward them
-on to another function template and allow C++ to do the type
-deduction for us:</p>
-<pre class="literal-block">
-namespace graphs
-{
-  namespace detail
-  {
-    template &lt;
-        class Graph, class Visitor
-      , class Vertex, class Index, class Color&gt;
-    void depth_first_search_impl(
-      Graph const&amp; g, Visitor const&amp; v,
-      Vertex const&amp; s, Index const&amp; i, Color&amp; c)
-    {
-      <em>…use g, v, s, i, and c to implement the algorithm…</em>
-    }
-  }
-
-  BOOST_PARAMETER_FUNCTION(
-      (void),
-      depth_first_search,
-
-      tag,
-      (required (graph,*) )
-      (optional (visitor,*) (root_vertex,*)
-                (index_map,*) (out(color_map),*) )
-  )
-  {
-      detail::depth_first_search_impl(
-        args[graph], args[visitor|<em>default-expression</em><sub>1</sub>],
-        args[root_vertex|<em>default-expression</em><sub>2</sub>],
-        args[index_map|<em>default-expression</em><sub>3</sub>],
-        args[color|<em>default-expression</em><sub>4</sub>]);
-  }
-}
-</pre>
-</div>
-<div class="section">
-<h3><a id="the-binding-metafunction" name="the-binding-metafunction">2.7.2&nbsp;&nbsp;&nbsp;The <tt class="docutils literal"><span class="pre">binding</span></tt> <a class="reference" href="../../../mpl/doc/refmanual/metafunction.html"><span class="concept">Metafunction</span></a></a></h3>
-<p>If for some reason forwarding isn't an option, or if writing a
-separate implementation function is too cumbersome, we can use a
-<a class="reference" href="../../../mpl/doc/refmanual/metafunction.html"><span class="concept">Metafunction</span></a> called <tt class="docutils literal"><span class="pre">binding</span></tt> to compute parameter types
-directly:</p>
-<pre class="literal-block">
-binding&lt;ArgumentPack, Keyword, Default = parameter::void_&gt;
-{ typedef <em>see text</em> type; };
-</pre>
-<p>where <tt class="docutils literal"><span class="pre">Default</span></tt> is the type of the default argument, if any.</p>
-<p>To use <tt class="docutils literal"><span class="pre">binding</span></tt> we need one more piece of information that's
-hidden by the macro generating our declaration: the <em>type</em> of
-<tt class="docutils literal"><span class="pre">args</span></tt>, our ArgumentPack, is quite fittingly available as
-<tt class="docutils literal"><span class="pre">Args</span></tt>.  Now, to directly declare and initialize <tt class="docutils literal"><span class="pre">g</span></tt>, we could
-write:</p>
-<pre class="literal-block">
-typedef typename parameter::binding&lt;
-  Args,<strong>tag::graph</strong>
-&gt;::type Graph;
-
-Graph g = args[graph];
-</pre>
-</div>
-<div class="section">
-<h3><a class="toc-backref" href="#id31" id="binding-with-defaults" name="binding-with-defaults">2.7.3&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">binding</span></tt> With Defaults</a></h3>
-<p>As shown in the <a class="reference" href="#parameter-table">parameter table</a>, <tt class="docutils literal"><span class="pre">graph</span></tt> has no default, so
-the <tt class="docutils literal"><span class="pre">binding</span></tt> invocation for <em>Graph</em> takes only two arguments.
-The default <tt class="docutils literal"><span class="pre">visitor</span></tt> is <tt class="docutils literal"><span class="pre">boost::dfs_visitor&lt;&gt;()</span></tt>, so the
-<tt class="docutils literal"><span class="pre">binding</span></tt> invocation for <em>Visitor</em> takes three arguments:</p>
-<pre class="literal-block">
-typedef typename parameter::binding&lt;
-  Args,<strong>tag::visitor,boost::dfs_visitor&lt;&gt;</strong>
-&gt;::type Visitor;
-
-Visitor v = args[visitor|<strong>boost::dfs_visitor&lt;&gt;()</strong>];
-</pre>
-</div>
-<div class="section">
-<h3><a class="toc-backref" href="#id32" id="binding-safely" name="binding-safely"><span id="dangling"></span>2.7.4&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">binding</span></tt> Safely</a></h3>
-<p>Note that the default <tt class="docutils literal"><span class="pre">visitor</span></tt> is supplied as a <em>temporary</em>
-instance of <tt class="docutils literal"><span class="pre">dfs_visitor</span></tt>.  Because <tt class="docutils literal"><span class="pre">args[…]</span></tt> always yields
-a reference, making <tt class="docutils literal"><span class="pre">v</span></tt> a reference would cause it to bind to
-that temporary, and immediately dangle.  Therefore, it's crucial
-that we passed <tt class="docutils literal"><span class="pre">dfs_visitor&lt;&gt;</span></tt>, and not <tt class="docutils literal"><span class="pre">dfs_visitor&lt;&gt;</span>
-<span class="pre">const&amp;</span></tt>, as the last argument to <tt class="docutils literal"><span class="pre">binding</span></tt>.</p>
-<div class="important">
-<p class="first admonition-title">Important</p>
-<p class="last">Never pass <tt class="docutils literal"><span class="pre">binding</span></tt> a reference type as the default unless
-you know that the default value passed to the <span class="concept">ArgumentPack</span>'s
-indexing operator will outlive the reference you'll bind to it.</p>
-</div>
-<p>Sometimes there's no need to use <tt class="docutils literal"><span class="pre">binding</span></tt> at all.  The
-<tt class="docutils literal"><span class="pre">root_vertex</span></tt> argument is required to be of the graph's
-<tt class="docutils literal"><span class="pre">vertex_descriptor</span></tt> type,<a class="footnote-reference" href="#vertex-descriptor" id="id7" name="id7"><sup>3</sup></a> so we can just
-declare it that way:</p>
-<pre class="literal-block">
-typename <strong>boost::graph_traits&lt;Graph&gt;::vertex_descriptor</strong>
-  s = args[root_vertex|<strong>*vertices(g).first</strong>];
-</pre>
-</div>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id33" id="beyond-ordinary-default-arguments" name="beyond-ordinary-default-arguments">2.8&nbsp;&nbsp;&nbsp;Beyond Ordinary Default Arguments</a></h2>
-<p>Consider how one might bind a variable to the <tt class="docutils literal"><span class="pre">index_map</span></tt>
-parameter:</p>
-<pre class="literal-block">
-typedef typename parameter::binding&lt;
-    ArgumentPack
-  , <a class="reference" href="tag::index_map">tag::index_map</a>
-  , <strong>typename boost::property_map&lt;Graph, vertex_index_t&gt;::const_type</strong>
-&gt;::type Index;
-
-Index i = args[index_map|<strong>get(boost::vertex_index,g)</strong>];
-</pre>
-<p>We have gained two capabilities beyond what plain C++ default
-arguments provide:</p>
-<ol class="arabic">
-<li><p class="first">The default value of the <tt class="docutils literal"><span class="pre">index</span></tt> parameter depends on the
-value of the <tt class="docutils literal"><span class="pre">graph</span></tt> parameter.  That's illegal in plain C++:</p>
-<pre class="literal-block">
-void f(int <strong>graph</strong>, int index = <strong>graph</strong> + 1); // error
-</pre>
-</li>
-<li><p class="first">The <tt class="docutils literal"><span class="pre">index</span></tt> parameter has a useful default, yet it is
-templated and its type can be deduced when  an <tt class="docutils literal"><span class="pre">index</span></tt>
-argument is explicitly specified by the caller.  In plain C++, you
-can <em>specify</em> a default value for a parameter with deduced type,
-but it's not very useful:</p>
-<pre class="literal-block">
-template &lt;class Index&gt;
-int f(Index index <strong>= 42</strong>);  // OK
-int y = f();                // <strong>error; can't deduce Index</strong>
-</pre>
-</li>
-</ol>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id34" id="more-restrictive-signatures" name="more-restrictive-signatures">2.9&nbsp;&nbsp;&nbsp;More Restrictive Signatures</a></h2>
-<p>Currently, our function will be considered for overload resolution
-whenever``depth_first_search`` is called with a <tt class="docutils literal"><span class="pre">graph</span></tt> argument
-and up to four others, of any type.  Compilation may fail inside
-our <tt class="docutils literal"><span class="pre">depth_first_search</span></tt> when it is instantiated if the compiler
-discovers that the argument types don't provide the required
-operations, but that may be too late:</p>
-<ul class="simple">
-<li>By the time our <tt class="docutils literal"><span class="pre">depth_first_search</span></tt> is instantiated, it has
-been selected as the best matching overload.  Some other
-<tt class="docutils literal"><span class="pre">depth_first_search</span></tt> overload might've worked had it been
-chosen instead.  By the time we see a compilation error, there's
-no chance to change that decision.</li>
-<li>Even if there are no overloads, error messages generated at
-instantiation time usually expose users to confusing
-implementation details.  For example, users might see references
-to <tt class="docutils literal"><span class="pre">graphs::detail::depth_first_search_impl</span></tt> or worse (think
-of the kinds of errors you get from your STL implementation when
-you make a mistake).</li>
-<li>The problems with exposing such permissive function template
-signatures have been the subject of much discussion, especially
-in the presence of <a class="reference" href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html#225">unqualified calls</a>.  If all we want is to
-avoid unintentional argument-dependent lookup (ADL), we can
-isolate <tt class="docutils literal"><span class="pre">depth_first_search</span></tt> in a namespace containing no
-types<a class="footnote-reference" href="#using" id="id8" name="id8"><sup>5</sup></a>, but suppose we <em>want</em> it to found via ADL?</li>
-</ul>
-<p>It's usually a good idea to prevent functions from being considered
-for overload resolution when the passed argument types aren't
-appropriate.  We've already seen that the library does this when
-the required <tt class="docutils literal"><span class="pre">graph</span></tt> parameter is not supplied.</p>
-<div class="section">
-<h3><a class="toc-backref" href="#id35" id="checking-for-convertibility-to-specific-types" name="checking-for-convertibility-to-specific-types">2.9.1&nbsp;&nbsp;&nbsp;Checking for Convertibility to Specific Types</a></h3>
-<p>The simplest way to make the signature more restrictive is to
-replace some of the <tt class="docutils literal"><span class="pre">*</span></tt>s with types to which the corresponding
-arguments must be convertible, in parentheses.  For example, the
-following signature will only be matched when the
-<tt class="docutils literal"><span class="pre">graph</span></tt> parameter is convertible to <tt class="docutils literal"><span class="pre">char</span> <span class="pre">const*</span></tt> and the
-<tt class="docutils literal"><span class="pre">root_vertex</span></tt> parameter is convertible to <tt class="docutils literal"><span class="pre">int</span></tt>:</p>
-<pre class="literal-block">
-namespace graphs
-{
-  BOOST_PARAMETER_FUNCTION(
-      (void),
-      depth_first_search,
-
-      tag,
-      (required (graph,<strong>(char const*)</strong>) )
-      (optional (visitor,*) (root_vertex,<strong>(int)</strong>)
-                (index_map,*) (out(color_map),*) )
-  )
-  {
-      <em>…</em>
-  }
-}
-</pre>
-</div>
-<div class="section">
-<h3><a class="toc-backref" href="#id36" id="signature-restriction-predicates" name="signature-restriction-predicates">2.9.2&nbsp;&nbsp;&nbsp;Signature Restriction Predicates</a></h3>
-<p>Sometimes the appropriate restriction can't be expressed in terms
-of convertibility.  In that case, instead of replacing the <tt class="docutils literal"><span class="pre">*</span></tt>,
-you can <em>follow</em> it with a parenthesized unary <a class="reference" href="../../../mpl/doc/refmanual/lambda-expression.html">MPL lambda
-expression</a> that, when applied to the actual type of the argument,
-indicates whether that argument type meets the function's
-requirements for that parameter position.</p>
-<p>For example, if we want to require that the <tt class="docutils literal"><span class="pre">visitor</span></tt> parameter
-be derived from some class <tt class="docutils literal"><span class="pre">VBase</span></tt>, we can write:</p>
-<pre class="literal-block">
-namespace graphs
-{
-  using namespace boost::mpl;
-
-  BOOST_PARAMETER_FUNCTION(
-      (void),
-      depth_first_search,
-
-      tag,
-      (required (graph,(char const*)) )
-      (optional (visitor,<strong>*(boost::is_base_and_derived&lt;VBase,_&gt;)</strong>)
-                (root_vertex,(int)) (index_map,*) (out(color_map),*) )
-  )
-  {
-      <em>…</em>
-  }
-}
-</pre>
-<div class="note">
-<p class="first admonition-title">Note</p>
-<p class="last">The restrictions implemented in this section are not realistic
-ones for use with the graph library, and further examples are
-written under the assumption that no such restrictions are in
-effect.</p>
-</div>
-</div>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id37" id="efficiency-issues" name="efficiency-issues">2.10&nbsp;&nbsp;&nbsp;Efficiency Issues</a></h2>
-<p>The <tt class="docutils literal"><span class="pre">color_map</span></tt> parameter gives us a few efficiency issues to
-consider.  Here's a first cut at extraction and binding:</p>
-<pre class="literal-block">
-typedef
-  vector_property_map&lt;boost::default_color_type, Index&gt;
-default_color_map;
-
-typename parameter::binding&lt;
-    ArgumentPack
-  , tag::color_map
-  , default_color_map
-&gt;::type color = args[color_map|<strong>default_color_map(num_vertices(g),i)</strong>];
-</pre>
-<div class="section">
-<h3><a class="toc-backref" href="#id38" id="eliminating-copies" name="eliminating-copies">2.10.1&nbsp;&nbsp;&nbsp;Eliminating Copies</a></h3>
-<p>The library has no way to know whether an explicitly-supplied
-argument is expensive to copy (or even if it is copyable at all),
-so <tt class="docutils literal"><span class="pre">binding&lt;…,k,…&gt;::type</span></tt> is always a reference type when the
-<em>k</em> parameter is supplied by the caller.  Since <tt class="docutils literal"><span class="pre">args[…]</span></tt>
-yields a reference to the actual argument, <tt class="docutils literal"><span class="pre">color</span></tt> will be bound
-to the actual <tt class="docutils literal"><span class="pre">color_map</span></tt> argument and no copying will be done.</p>
-<p>As described <a class="reference" href="#dangling">above</a>, because the default is a temporary, it's
-important that <tt class="docutils literal"><span class="pre">color</span></tt> be a non-reference when the default is
-used.  In that case, the default value will be <em>copied</em> into
-<tt class="docutils literal"><span class="pre">color</span></tt>.  If we store the default in a named variable, though,
-<tt class="docutils literal"><span class="pre">color</span></tt> can be a reference, thereby eliminating the copy:</p>
-<pre class="literal-block">
-default_color_map default_color(num_vertices(g),i);
-
-typename parameter::binding&lt;
-    ArgumentPack
-  , <a class="reference" href="tag::color_map">tag::color_map</a>
-  , <strong>default_color_map&amp;</strong>
-&gt;::type color = args[color_map|default_color];
-</pre>
-<div class="hint">
-<p class="first admonition-title">Hint</p>
-<p class="last">To avoid making needless copies, pass a <em>reference to the
-default type</em> as the third argument to <tt class="docutils literal"><span class="pre">binding</span></tt>, and store
-the default value in a <em>named</em> variable.</p>
-</div>
-<p>That said,</p>
-<div class="note">
-<p class="first admonition-title">Note</p>
-<p class="last">The extra copy becomes a non-issue if we just use the
-<a class="reference" href="#forwarding-to-an-implementation-function">forwarding</a> technique described earlier.</p>
-</div>
-</div>
-<div class="section">
-<h3><a class="toc-backref" href="#id39" id="lazy-default-computation" name="lazy-default-computation">2.10.2&nbsp;&nbsp;&nbsp;Lazy Default Computation</a></h3>
-<p>Of course it's nice to avoid copying <tt class="docutils literal"><span class="pre">default_color</span></tt>, but the
-more important cost is that of <em>constructing</em> it in the first
-place.  A <tt class="docutils literal"><span class="pre">vector_property_map</span></tt> is cheap to copy, since it holds
-its elements via a <a class="reference" href="../../../smart_ptr/shared_ptr.htm"><tt class="docutils literal"><span class="pre">shared_ptr</span></tt></a>.  On the other hand, construction of
-<tt class="docutils literal"><span class="pre">default_color</span></tt> costs at least two dynamic memory allocations and
-<tt class="docutils literal"><span class="pre">num_vertices(g)</span></tt> copies; it would be better to avoid doing this
-work when the default value won't be needed.</p>
-<p>To that end, the library allows us to supply a callable object
-that—if no argument was supplied by the caller—will be invoked to
-construct the default value.  Instead of following the keyword with
-the <tt class="docutils literal"><span class="pre">|</span></tt> operator, we'll use <tt class="docutils literal"><span class="pre">||</span></tt> and follow it with a
-nullary (zero-argument) function object that constructs a
-default_color_map.  Here, we build the function object using
-<a class="reference" href="../../../lambda/index.html">Boost.Lambda</a>:<a class="footnote-reference" href="#bind" id="id11" name="id11"><sup>4</sup></a></p>
-<pre class="literal-block">
-// After #include &lt;boost/lambda/construct.hpp&gt;
-typename parameter::binding&lt;
-    ArgumentPack
-  , <a class="reference" href="tag::color_map">tag::color_map</a>
-  , default_color_map
-&gt;::type color = args[
-  color_map
-  <strong>|| boost::lambda::construct&lt;default_color_map&gt;(num_vertices(g),i)</strong>
-];
-</pre>
-<div class="sidebar">
-<p class="first sidebar-title">Mnemonics</p>
-<p class="last">To remember the difference between <tt class="docutils literal"><span class="pre">|</span></tt> and <tt class="docutils literal"><span class="pre">||</span></tt>, recall that
-<tt class="docutils literal"><span class="pre">||</span></tt> normally uses short-circuit evaluation: its second
-argument is only evaluated if its first argument is <tt class="docutils literal"><span class="pre">false</span></tt>.
-Similarly, in <tt class="docutils literal"><span class="pre">color_map[param||f]</span></tt>, <tt class="docutils literal"><span class="pre">f</span></tt> is only invoked if
-no <tt class="docutils literal"><span class="pre">color_map</span></tt> argument was supplied.</p>
-</div>
-</div>
-<div class="section">
-<h3><a class="toc-backref" href="#id40" id="dispatching-based-on-the-presence-of-a-default" name="dispatching-based-on-the-presence-of-a-default">2.10.3&nbsp;&nbsp;&nbsp;Dispatching Based on the Presence of a Default</a></h3>
-<p>In fact, the Graph library itself constructs a slightly different
-<tt class="docutils literal"><span class="pre">color_map</span></tt>, to avoid even the overhead of initializing a
-<a class="reference" href="../../../smart_ptr/shared_ptr.htm"><tt class="docutils literal"><span class="pre">shared_ptr</span></tt></a>:</p>
-<pre class="literal-block">
-std::vector&lt;boost::default_color_type&gt;
-  color_vec(num_vertices(g));
-
-boost::iterator_property_map&lt;
-    typename std::vector&lt;
-       boost::default_color_type
-    &gt;::iterator
-  , Index
-&gt; c(color_vec.begin(), i);
-</pre>
-<p>To avoid instantiating that code when it isn't needed, we'll have
-to find a way to select different function implementations, at
-compile time, based on whether a <tt class="docutils literal"><span class="pre">color_map</span></tt> argument was
-supplied.  By using <a class="reference" href="../../../../more/generic_programming.html#tag_dispatching">tag dispatching</a> on the presence of a
-<tt class="docutils literal"><span class="pre">color_map</span></tt> argument, we can do just that:</p>
-<pre class="literal-block">
-#include &lt;boost/type_traits/is_same.hpp&gt;
-#include &lt;boost/mpl/bool.hpp&gt;
-
-namespace graphs
-{
-    template &lt;class ArgumentPack&gt;
-  void dfs_dispatch(ArgumentPack&amp; args, <strong>mpl::true_</strong>)
-  {
-      <em>…use the color map computed in the previous example…</em>
-  }
-
-  template &lt;class ArgumentPack&gt;
-  void dfs_dispatch(ArgumentPack&amp; args, <strong>mpl::false_</strong>)
-  {
-      <em>…use args[color]…</em>
-  }
-
-  BOOST_PARAMETER_FUNCTION(
-      (void),
-      depth_first_search,
-
-      tag,
-      (required (graph,*) )
-      (optional (visitor,*) (root_vertex,*)
-                (index_map,*) (out(color_map),*) )
-  )
-  {
-      typedef typename binding&lt;args,tag::color&gt;::type color_;
-      dfs_dispatch(
-        args, <strong>boost::is_same&lt;color_,parameter::void_&gt;()</strong>);
-  }
-}
-</pre>
-<p>We've used the fact that the default for <tt class="docutils literal"><span class="pre">binding</span></tt>'s third
-argument is <tt class="docutils literal"><span class="pre">parameter::void</span></tt>: because specializations of <tt class="docutils literal"><span class="pre">is_same</span></tt> are
-<tt class="docutils literal"><span class="pre">bool</span></tt>-valued MPL <a class="reference" href="../../../mpl/doc/refmanual/integral-constant.html"><span class="concept">Integral Constant</span></a>s derived either
-from <tt class="docutils literal"><span class="pre">mpl::true_</span></tt> or <tt class="docutils literal"><span class="pre">mpl::false_</span></tt>, the appropriate
-<tt class="docutils literal"><span class="pre">dfs_dispatch</span></tt> implementation will be selected.</p>
-</div>
-</div>
-</div>
-<div class="section">
-<h1><a class="toc-backref" href="#id41" id="portability-considerations" name="portability-considerations">3&nbsp;&nbsp;&nbsp;Portability Considerations</a></h1>
-<p>Use the <a class="reference" href="http://www.boost.org/regression/release/user/parameter.html">regression test results</a> for the latest Boost release of
-the Parameter library to see how it fares on your favorite
-compiler.  Additionally, you may need to be aware of the following
-issues and workarounds for particular compilers.</p>
-<div class="section">
-<h2><a class="toc-backref" href="#id42" id="no-sfinae-support" name="no-sfinae-support">3.1&nbsp;&nbsp;&nbsp;No SFINAE Support</a></h2>
-<p>Some older compilers don't support SFINAE.  If your compiler meets
-that criterion, then Boost headers will <tt class="docutils literal"><span class="pre">#define</span></tt> the preprocessor
-symbol <tt class="docutils literal"><span class="pre">BOOST_NO_SFINAE</span></tt>, and parameter-enabled functions won't be
-removed from the overload set based on their signatures.</p>
-</div>
-<div class="section">
-<h2><a id="no-support-for-result-of" name="no-support-for-result-of">3.2&nbsp;&nbsp;&nbsp;No Support for <a class="reference" href="../../../utility/utility.htm#result_of"><tt class="docutils literal"><span class="pre">result_of</span></tt></a></a></h2>
-<p><a class="reference" href="#lazy-default-computation">Lazy default computation</a> relies on the <tt class="docutils literal"><span class="pre">result_of</span></tt> class
-template to compute the types of default arguments given the type
-of the function object that constructs them.  On compilers that
-don't support <tt class="docutils literal"><span class="pre">result_of</span></tt>, <tt class="docutils literal"><span class="pre">BOOST_NO_RESULT_OF</span></tt> will be
-<tt class="docutils literal"><span class="pre">#define</span></tt>d, and the compiler will expect the function object to
-contain a nested type name, <tt class="docutils literal"><span class="pre">result_type</span></tt>, that indicates its
-return type when invoked without arguments.  To use an ordinary
-function as a default generator on those compilers, you'll need to
-wrap it in a class that provides <tt class="docutils literal"><span class="pre">result_type</span></tt> as a <tt class="docutils literal"><span class="pre">typedef</span></tt>
-and invokes the function via its <tt class="docutils literal"><span class="pre">operator()</span></tt>.</p>
-<!-- Can't Declare |ParameterSpec| via ``typedef``
-=============================================
-
-In principle you can declare a |ParameterSpec| as a ``typedef``
-for a specialization of ``parameters<…>``, but Microsoft Visual C++
-6.x has been seen to choke on that usage.  The workaround is to use
-inheritance and declare your |ParameterSpec| as a class:
-
-.. parsed-literal::
-
-     **struct dfs_parameters
-       :** parameter::parameters<
-           tag::graph, tag::visitor, tag::root_vertex
-         , tag::index_map, tag::color_map
-     > **{};**
-
-
-Default Arguments Unsupported on Nested Templates
-=================================================
-
-As of this writing, Borland compilers don't support the use of
-default template arguments on member class templates.  As a result,
-you have to supply ``BOOST_PARAMETER_MAX_ARITY`` arguments to every
-use of ``parameters<…>::match``.  Since the actual defaults used
-are unspecified, the workaround is to use
-|BOOST_PARAMETER_MATCH|_ to declare default arguments for SFINAE.
-
-.. |BOOST_PARAMETER_MATCH| replace:: ``BOOST_PARAMETER_MATCH`` -->
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id44" id="compiler-can-t-see-references-in-unnamed-namespace" name="compiler-can-t-see-references-in-unnamed-namespace">3.3&nbsp;&nbsp;&nbsp;Compiler Can't See References In Unnamed Namespace</a></h2>
-<p>If you use Microsoft Visual C++ 6.x, you may find that the compiler
-has trouble finding your keyword objects.  This problem has been
-observed, but only on this one compiler, and it disappeared as the
-test code evolved, so we suggest you use it only as a last resort
-rather than as a preventative measure.  The solution is to add
-<em>using-declarations</em> to force the names to be available in the
-enclosing namespace without qualification:</p>
-<pre class="literal-block">
-namespace graphs
-{
-  using graphs::graph;
-  using graphs::visitor;
-  using graphs::root_vertex;
-  using graphs::index_map;
-  using graphs::color_map;
-}
-</pre>
-</div>
-</div>
-<div class="section">
-<h1><a class="toc-backref" href="#id45" id="reference" name="reference">4&nbsp;&nbsp;&nbsp;Reference</a></h1>
-<p>Follow <a class="reference" href="reference.html">this link</a> to the Boost.Parameter reference
-documentation.</p>
-</div>
-<div class="section">
-<h1><a class="toc-backref" href="#id46" id="acknowledgements" name="acknowledgements">5&nbsp;&nbsp;&nbsp;Acknowledgements</a></h1>
-<p>The authors would like to thank all the Boosters who participated
-in the review of this library and its documentation, most
-especially our review manager, Doug Gregor.</p>
-<hr class="docutils" />
-<table class="docutils footnote" frame="void" id="old-interface" rules="none">
-<colgroup><col class="label" /><col /></colgroup>
-<tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id2" name="old-interface">[1]</a></td><td>As of Boost 1.33.0 the Graph library was still
-using an <a class="reference" href="../../../graph/doc/bgl_named_params.html">older named parameter mechanism</a>, but there are
-plans to change it to use Boost.Parameter (this library) in an
-upcoming release, while keeping the old interface available for
-backward-compatibility.</td></tr>
-</tbody>
-</table>
-<table class="docutils footnote" frame="void" id="odr" rules="none">
-<colgroup><col class="label" /><col /></colgroup>
-<tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id5" name="odr">[2]</a></td><td>The <strong>One Definition Rule</strong> says that any given entity in
-a C++ program must have the same definition in all translation
-units (object files) that make up a program.</td></tr>
-</tbody>
-</table>
-<table class="docutils footnote" frame="void" id="vertex-descriptor" rules="none">
-<colgroup><col class="label" /><col /></colgroup>
-<tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id7" name="vertex-descriptor">[3]</a></td><td>If you're not familiar with the Boost Graph
-Library, don't worry about the meaning of any
-Graph-library-specific details you encounter.  In this case you
-could replace all mentions of vertex descriptor types with
-<tt class="docutils literal"><span class="pre">int</span></tt> in the text, and your understanding of the Parameter
-library wouldn't suffer.</td></tr>
-</tbody>
-</table>
-<table class="docutils footnote" frame="void" id="bind" rules="none">
-<colgroup><col class="label" /><col /></colgroup>
-<tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id11" name="bind">[4]</a></td><td><p class="first">The Lambda library is known not to work on <a class="reference" href="http://www.boost.org/regression/release/user/lambda.html">some
-less-conformant compilers</a>.  When using one of those you could
-define</p>
-<pre class="last literal-block">
-  template &lt;class T&gt;
-  struct construct2
-  {
-      typedef T result_type;
-
-      template &lt;class A1, class A2&gt;
-      T operator()(A1 a1, A2 a2) { return T(a1,a2); }
-  };
-
-and use `Boost.Bind`_ to generate the function object::
-
-  boost::bind(construct2&lt;default_color_map&gt;(),num_vertices(g),i)
-</pre>
-</td></tr>
-</tbody>
-</table>
-<table class="docutils footnote" frame="void" id="using" rules="none">
-<colgroup><col class="label" /><col /></colgroup>
-<tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id8" name="using">[5]</a></td><td><p class="first">You can always give the illusion that the function
-lives in an outer namespace by applying a <em>using-declaration</em>:</p>
-<pre class="last literal-block">
-  namespace foo_overloads
-  {
-    // foo declarations here
-    void foo() { ... }
-    ...
-  }
-  using foo_overloads::foo;
-
-This technique for avoiding unintentional argument-dependent
-lookup is due to Herb Sutter.
-</pre>
-</td></tr>
-</tbody>
-</table>
-<table class="docutils footnote" frame="void" id="sfinae" rules="none">
-<colgroup><col class="label" /><col /></colgroup>
-<tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id6" name="sfinae">[6]</a></td><td><strong>SFINAE</strong>: <strong>S</strong>ubstitution <strong>F</strong>ailure <strong>I</strong>s
-<strong>N</strong>ot <strong>A</strong>n <strong>E</strong> rror.  If type substitution during the
-instantiation of a function template results in an invalid type,
-no compilation error is emitted; instead the overload is removed
-from the overload set. By producing an invalid type in the
-function signature depending on the result of some condition,
-we can decide whether or not an overload is considered during overload
-resolution.  The technique is formalized in
-the <a class="reference" href="../../../utility/enable_if.html"><tt class="docutils literal"><span class="pre">enable_if</span></tt></a> utility.  Most recent compilers support SFINAE;
-on compilers that don't support it, the Boost config library
-will <tt class="docutils literal"><span class="pre">#define</span></tt> the symbol <tt class="docutils literal"><span class="pre">BOOST_NO_SFINAE</span></tt>.
-See
-<a class="reference" href="http://www.semantics.org/once_weakly/w02_SFINAE.pdf">http://www.semantics.org/once_weakly/w02_SFINAE.pdf</a> for more
-information on SFINAE.</td></tr>
-</tbody>
-</table>
-</div>
-</div>
-<div class="footer">
-<hr class="footer" />
-Generated on: 2006-05-18 14:54 UTC.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-
-</div>
-</body>
-</html>
+<?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.5: http://docutils.sourceforge.net/" />
+<title>The Boost Parameter Library</title>
+<link rel="stylesheet" href="rst.css" type="text/css" />
+</head>
+<body>
+<div class="document" id="the-boost-parameter-library">
+<h1 class="title">The Boost Parameter Library</h1>
+
+<p><a class="reference" href="../../../../index.htm"><img alt="Boost" src="../../../../boost.png" /></a></p>
+<hr class="docutils" />
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Abstract:</th><td class="field-body"><p class="first">Use this library to write functions and class templates
+that can accept arguments by name:</p>
+<pre class="literal-block">
+new_window(&quot;alert&quot;, <strong>_width=10</strong>, <strong>_titlebar=false</strong>);
+
+smart_ptr&lt;
+   Foo
+ , <strong>deleter&lt;Deallocate&lt;Foo&gt; &gt;</strong>
+ , <strong>copy_policy&lt;DeepCopy&gt;</strong> &gt; p(new Foo);
+</pre>
+<p class="last">Since named arguments can be passed in any order, they are
+especially useful when a function or template has more than one
+parameter with a useful default value.  The library also supports
+<em>deduced</em> parameters; that is to say, parameters whose identity
+can be deduced from their types.</p>
+</td>
+</tr>
+</tbody>
+</table>
+<!-- @jam_prefix.append('''
+project test : requirements <include>. <source>/boost//headers ;''') -->
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+
+namespace test
+{
+  BOOST_PARAMETER_NAME(title)
+  BOOST_PARAMETER_NAME(width)
+  BOOST_PARAMETER_NAME(titlebar)
+
+  BOOST_PARAMETER_FUNCTION(
+     (int), new_window, tag, (required (title,*)(width,*)(titlebar,*)))
+  {
+     return 0;
+  }
+
+  BOOST_PARAMETER_TEMPLATE_KEYWORD(deleter)
+  BOOST_PARAMETER_TEMPLATE_KEYWORD(copy_policy)
+
+  template <class T> struct Deallocate {};
+  struct DeepCopy {};
+
+  namespace parameter = boost::parameter;
+
+  struct Foo {};
+  template <class T, class A0, class A1>
+  struct smart_ptr
+  {
+      smart_ptr(Foo*);
+  };
+}
+using namespace test;
+int x = '''); -->
+<!-- @test('compile') -->
+<hr class="docutils" />
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Authors:</th><td class="field-body">David Abrahams, Daniel Wallin</td>
+</tr>
+<tr class="field"><th class="field-name">Contact:</th><td class="field-body"><a class="reference" href="mailto:dave&#64;boost-consulting.com">dave&#64;boost-consulting.com</a>, <a class="reference" href="mailto:dalwan01&#64;student.umu.se">dalwan01&#64;student.umu.se</a></td>
+</tr>
+<tr class="field"><th class="field-name">Organization:</th><td class="field-body"><a class="reference" href="http://www.boost-consulting.com">Boost Consulting</a></td>
+</tr>
+<tr class="field"><th class="field-name">Date:</th><td class="field-body">$Date: 2005/07/18 20:34:31 $</td>
+</tr>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Copyright David Abrahams, Daniel Wallin 2005.
+Distributed under the Boost Software License,
+Version 1.0. (See accompanying file LICENSE_1_0.txt
+or copy at <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</td>
+</tr>
+</tbody>
+</table>
+<hr class="docutils" />
+<div class="contents topic">
+<p class="topic-title first"><a id="table-of-contents" name="table-of-contents"><strong>Table of Contents</strong></a></p>
+<ul class="auto-toc simple">
+<li><a class="reference" href="#motivation" id="id23" name="id23">1&nbsp;&nbsp;&nbsp;Motivation</a><ul class="auto-toc">
+<li><a class="reference" href="#named-function-parameters" id="id24" name="id24">1.1&nbsp;&nbsp;&nbsp;Named Function Parameters</a></li>
+<li><a class="reference" href="#deduced-function-parameters" id="id25" name="id25">1.2&nbsp;&nbsp;&nbsp;Deduced Function Parameters</a></li>
+<li><a class="reference" href="#class-template-parameter-support" id="id26" name="id26">1.3&nbsp;&nbsp;&nbsp;Class Template Parameter Support</a></li>
+</ul>
+</li>
+<li><a class="reference" href="#tutorial" id="id27" name="id27">2&nbsp;&nbsp;&nbsp;Tutorial</a><ul class="auto-toc">
+<li><a class="reference" href="#parameter-enabled-functions" id="id28" name="id28">2.1&nbsp;&nbsp;&nbsp;Parameter-Enabled Functions</a><ul class="auto-toc">
+<li><a class="reference" href="#headers-and-namespaces" id="id29" name="id29">2.1.1&nbsp;&nbsp;&nbsp;Headers And Namespaces</a></li>
+<li><a class="reference" href="#the-abstract-interface-to-dfs" id="id30" name="id30">2.1.2&nbsp;&nbsp;&nbsp;The Abstract Interface to <tt class="docutils literal"><span class="pre">depth_first_search</span></tt></a></li>
+<li><a class="reference" href="#defining-the-keywords" id="id31" name="id31">2.1.3&nbsp;&nbsp;&nbsp;Defining the Keywords</a></li>
+<li><a class="reference" href="#writing-the-function" id="id32" name="id32">2.1.4&nbsp;&nbsp;&nbsp;Writing the Function</a></li>
+<li><a class="reference" href="#function-signatures" id="id33" name="id33">2.1.5&nbsp;&nbsp;&nbsp;Function Signatures</a><ul class="auto-toc">
+<li><a class="reference" href="#required-parameters" id="id34" name="id34">2.1.5.1&nbsp;&nbsp;&nbsp;Required Parameters</a></li>
+<li><a class="reference" href="#optional-parameters" id="id35" name="id35">2.1.5.2&nbsp;&nbsp;&nbsp;Optional Parameters</a></li>
+<li><a class="reference" href="#handling-out-parameters" id="id36" name="id36">2.1.5.3&nbsp;&nbsp;&nbsp;Handling “Out” Parameters</a></li>
+<li><a class="reference" href="#positional-arguments" id="id37" name="id37">2.1.5.4&nbsp;&nbsp;&nbsp;Positional Arguments</a></li>
+<li><a class="reference" href="#default-expression-evaluation" id="id38" name="id38">2.1.5.5&nbsp;&nbsp;&nbsp;Default Expression Evaluation</a></li>
+<li><a class="reference" href="#signature-matching-and-overloading" id="id39" name="id39">2.1.5.6&nbsp;&nbsp;&nbsp;Signature Matching and Overloading</a><ul class="auto-toc">
+<li><a class="reference" href="#adding-type-requirements" id="id40" name="id40">2.1.5.6.1&nbsp;&nbsp;&nbsp;Adding Type Requirements</a></li>
+<li><a class="reference" href="#predicate-requirements" id="id41" name="id41">2.1.5.6.2&nbsp;&nbsp;&nbsp;Predicate Requirements</a></li>
+</ul>
+</li>
+<li><a class="reference" href="#deduced-parameters" id="id42" name="id42">2.1.5.7&nbsp;&nbsp;&nbsp;Deduced Parameters</a></li>
+</ul>
+</li>
+</ul>
+</li>
+<li><a class="reference" href="#parameter-enabled-member-functions" id="id43" name="id43">2.2&nbsp;&nbsp;&nbsp;Parameter-Enabled Member Functions</a></li>
+<li><a class="reference" href="#parameter-enabled-constructors" id="id44" name="id44">2.3&nbsp;&nbsp;&nbsp;Parameter-Enabled Constructors</a></li>
+<li><a class="reference" href="#parameter-enabled-class-templates" id="id45" name="id45">2.4&nbsp;&nbsp;&nbsp;Parameter-Enabled Class Templates</a><ul class="auto-toc">
+<li><a class="reference" href="#named-template-parameters" id="id46" name="id46">2.4.1&nbsp;&nbsp;&nbsp;Named Template Parameters</a><ul class="auto-toc">
+<li><a class="reference" href="#template-keywords" id="id47" name="id47">2.4.1.1&nbsp;&nbsp;&nbsp;Template Keywords</a></li>
+<li><a class="reference" href="#class-template-skeleton" id="id48" name="id48">2.4.1.2&nbsp;&nbsp;&nbsp;Class Template Skeleton</a></li>
+<li><a class="reference" href="#class-template-signatures" id="id49" name="id49">2.4.1.3&nbsp;&nbsp;&nbsp;Class Template Signatures</a></li>
+<li><a class="reference" href="#argument-packs-and-parameter-extraction" id="id50" name="id50">2.4.1.4&nbsp;&nbsp;&nbsp;Argument Packs and Parameter Extraction</a></li>
+</ul>
+</li>
+<li><a class="reference" href="#exercising-the-code-so-far" id="id51" name="id51">2.4.2&nbsp;&nbsp;&nbsp;Exercising the Code So Far</a></li>
+<li><a class="reference" href="#deduced-template-parameters" id="id52" name="id52">2.4.3&nbsp;&nbsp;&nbsp;Deduced Template Parameters</a></li>
+</ul>
+</li>
+</ul>
+</li>
+<li><a class="reference" href="#advanced-topics" id="id53" name="id53">3&nbsp;&nbsp;&nbsp;Advanced Topics</a><ul class="auto-toc">
+<li><a class="reference" href="#fine-grained-name-control" id="id54" name="id54">3.1&nbsp;&nbsp;&nbsp;Fine-Grained Name Control</a></li>
+<li><a class="reference" href="#more-argumentpacks" id="id55" name="id55">3.2&nbsp;&nbsp;&nbsp;More <span class="concept">ArgumentPack</span>s</a><ul class="auto-toc">
+<li><a class="reference" href="#building-argumentpacks" id="id56" name="id56">3.2.1&nbsp;&nbsp;&nbsp;Building <span class="concept">ArgumentPack</span>s</a></li>
+<li><a class="reference" href="#extracting-parameter-types" id="id57" name="id57">3.2.2&nbsp;&nbsp;&nbsp;Extracting Parameter Types</a></li>
+<li><a class="reference" href="#lazy-default-computation" id="id58" name="id58">3.2.3&nbsp;&nbsp;&nbsp;Lazy Default Computation</a></li>
+</ul>
+</li>
+</ul>
+</li>
+<li><a class="reference" href="#best-practices" id="id59" name="id59">4&nbsp;&nbsp;&nbsp;Best Practices</a><ul class="auto-toc">
+<li><a class="reference" href="#keyword-naming" id="id60" name="id60">4.1&nbsp;&nbsp;&nbsp;Keyword Naming</a></li>
+<li><a class="reference" href="#namespaces" id="id61" name="id61">4.2&nbsp;&nbsp;&nbsp;Namespaces</a></li>
+<li><a class="reference" href="#documentation" id="id62" name="id62">4.3&nbsp;&nbsp;&nbsp;Documentation</a></li>
+</ul>
+</li>
+<li><a class="reference" href="#portability-considerations" id="id63" name="id63">5&nbsp;&nbsp;&nbsp;Portability Considerations</a><ul class="auto-toc">
+<li><a class="reference" href="#no-sfinae-support" id="id64" name="id64">5.1&nbsp;&nbsp;&nbsp;No SFINAE Support</a></li>
+<li><a class="reference" href="#no-support-for-result-of" id="id65" name="id65">5.2&nbsp;&nbsp;&nbsp;No Support for <tt class="docutils literal"><span class="pre">result_of</span></tt></a></li>
+<li><a class="reference" href="#compiler-can-t-see-references-in-unnamed-namespace" id="id66" name="id66">5.3&nbsp;&nbsp;&nbsp;Compiler Can't See References In Unnamed Namespace</a></li>
+</ul>
+</li>
+<li><a class="reference" href="#python-binding" id="id67" name="id67">6&nbsp;&nbsp;&nbsp;Python Binding</a></li>
+<li><a class="reference" href="#reference" id="id68" name="id68">7&nbsp;&nbsp;&nbsp;Reference</a></li>
+<li><a class="reference" href="#glossary" id="id69" name="id69">8&nbsp;&nbsp;&nbsp;Glossary</a></li>
+<li><a class="reference" href="#acknowledgements" id="id70" name="id70">9&nbsp;&nbsp;&nbsp;Acknowledgements</a></li>
+</ul>
+</div>
+<hr class="docutils" />
+<div class="section">
+<h1><a class="toc-backref" href="#id23" id="motivation" name="motivation">1&nbsp;&nbsp;&nbsp;Motivation</a></h1>
+<p>In C++, <a class="reference" href="#arguments">arguments</a> are normally given meaning by their positions
+with respect to a <a class="reference" href="#parameter">parameter</a> list: the first argument passed maps
+onto the first parameter in a function's definition, and so on.
+That protocol is fine when there is at most one parameter with a
+default value, but when there are even a few useful defaults, the
+positional interface becomes burdensome:</p>
+<ul>
+<li><div class="first compound">
+<p class="compound-first">Since an argument's meaning is given by its position, we have to
+choose an (often arbitrary) order for parameters with default
+values, making some combinations of defaults unusable:</p>
+<pre class="compound-middle literal-block">
+window* new_window(
+   char const* name,
+   <strong>int border_width = default_border_width,</strong>
+   bool movable = true,
+   bool initially_visible = true
+   );
+
+const bool movability = false;
+window* w = new_window(&quot;alert box&quot;, movability);
+</pre>
+<p class="compound-middle">In the example above we wanted to make an unmoveable window
+with a default <tt class="docutils literal"><span class="pre">border_width</span></tt>, but instead we got a moveable
+window with a <tt class="docutils literal"><span class="pre">border_width</span></tt> of zero.  To get the desired
+effect, we'd need to write:</p>
+<pre class="compound-last literal-block">
+window* w = new_window(
+   &quot;alert box&quot;, <strong>default_border_width</strong>, movability);
+</pre>
+</div>
+</li>
+<li><div class="first compound">
+<p class="compound-first">It can become difficult for readers to understand the meaning of
+arguments at the call site:</p>
+<pre class="compound-middle literal-block">
+window* w = new_window(&quot;alert&quot;, 1, true, false);
+</pre>
+<p class="compound-last">Is this window moveable and initially invisible, or unmoveable
+and initially visible?  The reader needs to remember the order
+of arguments to be sure.</p>
+</div>
+</li>
+<li><p class="first">The author of the call may not remember the order of the
+arguments either, leading to hard-to-find bugs.</p>
+</li>
+</ul>
+<!-- @ignore(3) -->
+<div class="section">
+<h2><a class="toc-backref" href="#id24" id="named-function-parameters" name="named-function-parameters">1.1&nbsp;&nbsp;&nbsp;Named Function Parameters</a></h2>
+<div class="compound">
+<p class="compound-first">This library addresses the problems outlined above by associating
+each parameter name with a keyword object.  Now users can identify
+arguments by name, rather than by position:</p>
+<pre class="compound-last literal-block">
+window* w = new_window(&quot;alert box&quot;, <strong>movable_=</strong>false); // OK!
+</pre>
+</div>
+<!-- @ignore() -->
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id25" id="deduced-function-parameters" name="deduced-function-parameters">1.2&nbsp;&nbsp;&nbsp;Deduced Function Parameters</a></h2>
+<div class="compound">
+<p class="compound-first">A <strong>deduced parameter</strong> can be passed in any position <em>without</em>
+supplying an explicit parameter name.  It's not uncommon for a
+function to have parameters that can be uniquely identified based
+on the types of arguments passed.  The <tt class="docutils literal"><span class="pre">name</span></tt> parameter to
+<tt class="docutils literal"><span class="pre">new_window</span></tt> is one such example.  None of the other arguments,
+if valid, can reasonably be converted to a <tt class="docutils literal"><span class="pre">char</span> <span class="pre">const*</span></tt>.  With
+a deduced parameter interface, we could pass the window name in
+<em>any</em> argument position without causing ambiguity:</p>
+<pre class="compound-middle literal-block">
+window* w = new_window(movable_=false, <strong>&quot;alert box&quot;</strong>); // OK!
+window* w = new_window(<strong>&quot;alert box&quot;</strong>, movable_=false); // OK!
+</pre>
+<p class="compound-last">Appropriately used, a deduced parameter interface can free the
+user of the burden of even remembering the formal parameter
+names.</p>
+</div>
+<!-- @ignore() -->
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id26" id="class-template-parameter-support" name="class-template-parameter-support">1.3&nbsp;&nbsp;&nbsp;Class Template Parameter Support</a></h2>
+<div class="compound">
+<p class="compound-first">The reasoning we've given for named and deduced parameter
+interfaces applies equally well to class templates as it does to
+functions.  Using the Parameter library, we can create interfaces
+that allow template arguments (in this case <tt class="docutils literal"><span class="pre">shared</span></tt> and
+<tt class="docutils literal"><span class="pre">Client</span></tt>) to be explicitly named, like this:</p>
+<pre class="compound-middle literal-block">
+smart_ptr&lt;<strong>ownership&lt;shared&gt;</strong>, <strong>value_type&lt;Client&gt;</strong> &gt; p;
+</pre>
+<p class="compound-middle">The syntax for passing named template arguments is not quite as
+natural as it is for function arguments (ideally, we'd be able to
+write <tt class="docutils literal"><span class="pre">smart_ptr&lt;ownership=shared,…&gt;</span></tt>).  This small syntactic
+deficiency makes deduced parameters an especially big win when
+used with class templates:</p>
+<pre class="compound-last literal-block">
+// <em>p and q could be equivalent, given a deduced</em>
+// <em>parameter interface.</em>
+smart_ptr&lt;<strong>shared</strong>, <strong>Client</strong>&gt; p;
+smart_ptr&lt;<strong>Client</strong>, <strong>shared</strong>&gt; q;
+</pre>
+</div>
+<!-- @ignore(2) -->
+</div>
+</div>
+<div class="section">
+<h1><a class="toc-backref" href="#id27" id="tutorial" name="tutorial">2&nbsp;&nbsp;&nbsp;Tutorial</a></h1>
+<p>This tutorial shows all the basics—how to build both named- and deduced-parameter
+interfaces to function templates and class templates—and several
+more advanced idioms as well.</p>
+<div class="section">
+<h2><a class="toc-backref" href="#id28" id="parameter-enabled-functions" name="parameter-enabled-functions">2.1&nbsp;&nbsp;&nbsp;Parameter-Enabled Functions</a></h2>
+<p>In this section we'll show how the Parameter library can be used to
+build an expressive interface to the <a class="reference" href="../../../graph/index.html">Boost Graph library</a>'s
+<a class="reference" href="../../../graph/doc/depth_first_search.html"><tt class="docutils literal"><span class="pre">depth_first_search</span></tt></a> algorithm.<a class="footnote-reference" href="#old-interface" id="id2" name="id2"><sup>1</sup></a></p>
+<!-- Revisit this
+
+After laying some groundwork
+and describing the algorithm's abstract interface, we'll show you
+how to build a basic implementation with keyword support.  Then
+we'll add support for default arguments and we'll gradually refine the
+implementation with syntax improvements.  Finally we'll show how to
+streamline the implementation of named parameter interfaces,
+improve their participation in overload resolution, and optimize
+their runtime efficiency. -->
+<div class="section">
+<h3><a class="toc-backref" href="#id29" id="headers-and-namespaces" name="headers-and-namespaces">2.1.1&nbsp;&nbsp;&nbsp;Headers And Namespaces</a></h3>
+<p>Most components of the Parameter library are declared in a
+header named for the component.  For example,</p>
+<pre class="literal-block">
+#include &lt;boost/parameter/keyword.hpp&gt;
+</pre>
+<p>will ensure <tt class="docutils literal"><span class="pre">boost::parameter::keyword</span></tt> is known to the
+compiler.  There is also a combined header,
+<tt class="docutils literal"><span class="pre">boost/parameter.hpp</span></tt>, that includes most of the library's
+components.  For the the rest of this tutorial, unless we say
+otherwise, you can use the rule above to figure out which header
+to <tt class="docutils literal"><span class="pre">#include</span></tt> to access any given component of the library.</p>
+<!-- @example.append('''
+using boost::parameter::keyword;
+''') -->
+<!-- @test('compile') -->
+<p>Also, the examples below will also be written as if the
+namespace alias</p>
+<pre class="literal-block">
+namespace parameter = boost::parameter;
+</pre>
+<!-- @ignore() -->
+<p>has been declared: we'll write <tt class="docutils literal"><span class="pre">parameter::xxx</span></tt> instead of
+<tt class="docutils literal"><span class="pre">boost::parameter::xxx</span></tt>.</p>
+</div>
+<div class="section">
+<h3><a class="toc-backref" href="#id30" id="the-abstract-interface-to-dfs" name="the-abstract-interface-to-dfs">2.1.2&nbsp;&nbsp;&nbsp;The Abstract Interface to <tt class="docutils literal"><span class="pre">depth_first_search</span></tt></a></h3>
+<p>The Graph library's <tt class="docutils literal"><span class="pre">depth_first_search</span></tt> algorithm is a generic function accepting
+from one to four arguments by reference.  If all arguments were
+required, its signature might be as follows:</p>
+<pre class="literal-block">
+template &lt;
+    class Graph, class DFSVisitor, class Index, class ColorMap
+&gt;
+void depth_first_search(
+  , Graph const&amp; graph
+  , DFSVisitor visitor
+  , typename graph_traits&lt;g&gt;::vertex_descriptor root_vertex
+  , IndexMap index_map
+  , ColorMap&amp; color);
+</pre>
+<!-- @ignore() -->
+<p>However, most of the parameters have a useful default value, as
+shown in the table below.</p>
+<table border="1" class="docutils table" id="default-expressions">
+<span id="parameter-table"></span><caption><a id="default-expressions" name="default-expressions"><span id="parameter-table"></span><tt class="docutils literal"><span class="pre">depth_first_search</span></tt> Parameters</a></caption>
+<colgroup>
+<col width="17%" />
+<col width="11%" />
+<col width="35%" />
+<col width="37%" />
+</colgroup>
+<thead valign="bottom">
+<tr><th class="head">Parameter Name</th>
+<th class="head">Dataflow</th>
+<th class="head">Type</th>
+<th class="head">Default Value (if any)</th>
+</tr>
+</thead>
+<tbody valign="top">
+<tr><td><tt class="docutils literal"><span class="pre">graph</span></tt></td>
+<td>in</td>
+<td>Model of <a class="reference" href="../../../graph/doc/IncidenceGraph.html"><span class="concept">Incidence Graph</span></a> and
+<a class="reference" href="../../../graph/doc/VertexListGraph.html"><span class="concept">Vertex List Graph</span></a></td>
+<td>none - this argument is required.</td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">visitor</span></tt></td>
+<td>in</td>
+<td>Model of <a class="reference" href="../../../graph/doc/DFSVisitor.html"><span class="concept">DFS Visitor</span></a></td>
+<td><tt class="docutils literal"><span class="pre">boost::dfs_visitor&lt;&gt;()</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">root_vertex</span></tt></td>
+<td>in</td>
+<td><tt class="docutils literal"><span class="pre">graph</span></tt>'s vertex descriptor
+type.</td>
+<td><tt class="docutils literal"><span class="pre">*vertices(graph).first</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">index_map</span></tt></td>
+<td>in</td>
+<td>Model of <a class="reference" href="../../../property_map/ReadablePropertyMap.html"><span class="concept">Readable Property Map</span></a>
+with key type := <tt class="docutils literal"><span class="pre">graph</span></tt>'s
+vertex descriptor and value type
+an integer type.</td>
+<td><tt class="docutils literal"><span class="pre">get(boost::vertex_index,graph)</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">color_map</span></tt></td>
+<td>in/out</td>
+<td>Model of <a class="reference" href="../../../property_map/ReadWritePropertyMap.html"><span class="concept">Read/Write Property Map</span></a>
+with key type := <tt class="docutils literal"><span class="pre">graph</span></tt>'s
+vertex descriptor type.</td>
+<td>an <tt class="docutils literal"><span class="pre">iterator_property_map</span></tt>
+created from a <tt class="docutils literal"><span class="pre">std::vector</span></tt> of
+<tt class="docutils literal"><span class="pre">default_color_type</span></tt> of size
+<tt class="docutils literal"><span class="pre">num_vertices(graph)</span></tt> and using
+<tt class="docutils literal"><span class="pre">index_map</span></tt> for the index map.</td>
+</tr>
+</tbody>
+</table>
+<p>Don't be intimidated by the information in the second and third
+columns above.  For the purposes of this exercise, you don't need
+to understand them in detail.</p>
+</div>
+<div class="section">
+<h3><a class="toc-backref" href="#id31" id="defining-the-keywords" name="defining-the-keywords">2.1.3&nbsp;&nbsp;&nbsp;Defining the Keywords</a></h3>
+<p>The point of this exercise is to make it possible to call
+<tt class="docutils literal"><span class="pre">depth_first_search</span></tt> with named arguments, leaving out any
+arguments for which the default is appropriate:</p>
+<pre class="literal-block">
+graphs::depth_first_search(g, <strong>color_map_=my_color_map</strong>);
+</pre>
+<!-- @ignore() -->
+<p>To make that syntax legal, there needs to be an object called
+“<tt class="docutils literal"><span class="pre">color_map_</span></tt>” whose assignment operator can accept a
+<tt class="docutils literal"><span class="pre">my_color_map</span></tt> argument.  In this step we'll create one such
+<strong>keyword object</strong> for each parameter.  Each keyword object will be
+identified by a unique <strong>keyword tag type</strong>.</p>
+<!-- Revisit this
+
+We're going to define our interface in namespace ``graphs``.  Since
+users need access to the keyword objects, but not the tag types,
+we'll define the keyword objects so they're accessible through
+``graphs``, and we'll hide the tag types away in a nested
+namespace, ``graphs::tag``.  The library provides a convenient
+macro for that purpose. -->
+<p>We're going to define our interface in namespace <tt class="docutils literal"><span class="pre">graphs</span></tt>.  The
+library provides a convenient macro for defining keyword objects:</p>
+<pre class="literal-block">
+#include &lt;boost/parameter/name.hpp&gt;
+
+namespace graphs
+{
+  BOOST_PARAMETER_NAME(graph)    // Note: no semicolon
+  BOOST_PARAMETER_NAME(visitor)
+  BOOST_PARAMETER_NAME(root_vertex)
+  BOOST_PARAMETER_NAME(index_map)
+  BOOST_PARAMETER_NAME(color_map)
+}
+</pre>
+<!-- @test('compile') -->
+<p>The declaration of the <tt class="docutils literal"><span class="pre">graph</span></tt> keyword you see here is
+equivalent to:</p>
+<pre class="literal-block">
+namespace graphs
+{
+  namespace tag { struct graph; } // keyword tag type
+
+  namespace // unnamed
+  {
+    // A reference to the keyword object
+    boost::parameter::keyword&lt;tag::graph&gt;&amp; _graph
+    = boost::parameter::keyword&lt;tag::graph&gt;::get();
+  }
+}
+</pre>
+<!-- @example.prepend('#include <boost/parameter/keyword.hpp>') -->
+<!-- @test('compile') -->
+<p>It defines a <em>keyword tag type</em> named <tt class="docutils literal"><span class="pre">tag::graph</span></tt> and a <em>keyword
+object</em> reference named <tt class="docutils literal"><span class="pre">_graph</span></tt>.</p>
+<p>This “fancy dance” involving an unnamed namespace and references
+is all done to avoid violating the One Definition Rule (ODR)<a class="footnote-reference" href="#odr" id="id4" name="id4"><sup>2</sup></a> when the named parameter interface is used by function
+templates that are instantiated in multiple translation
+units (MSVC6.x users see <a class="reference" href="#compiler-can-t-see-references-in-unnamed-namespace">this note</a>).</p>
+</div>
+<div class="section">
+<h3><a class="toc-backref" href="#id32" id="writing-the-function" name="writing-the-function">2.1.4&nbsp;&nbsp;&nbsp;Writing the Function</a></h3>
+<p>Now that we have our keywords defined, the function template
+definition follows a simple pattern using the
+<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUNCTION</span></tt> macro:</p>
+<pre class="literal-block">
+#include &lt;boost/parameter/preprocessor.hpp&gt;
+
+namespace graphs
+{
+  BOOST_PARAMETER_FUNCTION(
+      (void),                // 1. parenthesized return type
+      depth_first_search,    // 2. name of the function template
+
+      tag,                   // 3. namespace of tag types
+
+      (required (graph, *) ) // 4. one required parameter, and
+
+      (optional              //    four optional parameters, with defaults
+        (visitor,           *, boost::dfs_visitor&lt;&gt;())
+        (root_vertex,       *, *vertices(graph).first)
+        (index_map,         *, get(boost::vertex_index,graph))
+        (in_out(color_map), *,
+          default_color_map(num_vertices(graph), index_map) )
+      )
+  )
+  {
+      // ... body of function goes here...
+      // use graph, visitor, index_map, and color_map
+  }
+}
+</pre>
+<!-- @example.prepend('''
+#include <boost/parameter/name.hpp>
+
+BOOST_PARAMETER_NAME(graph)
+BOOST_PARAMETER_NAME(visitor)
+BOOST_PARAMETER_NAME(root_vertex)
+BOOST_PARAMETER_NAME(index_map)
+BOOST_PARAMETER_NAME(color_map)
+
+namespace boost {
+
+template <class T = int>
+struct dfs_visitor
+{};
+
+int vertex_index = 0;
+
+}''') -->
+<!-- @test('compile') -->
+<p>The arguments to <tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUNCTION</span></tt> are:</p>
+<ol class="arabic simple">
+<li>The return type of the resulting function template.  Parentheses
+around the return type prevent any commas it might contain from
+confusing the preprocessor, and are always required.</li>
+<li>The name of the resulting function template.</li>
+<li>The name of a namespace where we can find tag types whose names
+match the function's parameter names.</li>
+<li>The function signature.</li>
+</ol>
+</div>
+<div class="section">
+<h3><a class="toc-backref" href="#id33" id="function-signatures" name="function-signatures">2.1.5&nbsp;&nbsp;&nbsp;Function Signatures</a></h3>
+<p>Function signatures are described as one or two adjacent
+parenthesized terms (a <a class="reference" href="../../../preprocessor/index.html">Boost.Preprocessor</a> <a class="reference" href="http://boost-consulting.com/mplbook/preprocessor.html#sequences">sequence</a>) describing
+the function's parameters in the order in which they'd be expected
+if passed positionally.  Any required parameters must come first,
+but the <tt class="docutils literal"><span class="pre">(required</span> <span class="pre">…</span> <span class="pre">)</span></tt> clause can be omitted when all the
+parameters are optional.</p>
+<div class="section">
+<h4><a class="toc-backref" href="#id34" id="required-parameters" name="required-parameters">2.1.5.1&nbsp;&nbsp;&nbsp;Required Parameters</a></h4>
+<div class="compound">
+<p class="compound-first">Required parameters are given first—nested in a <tt class="docutils literal"><span class="pre">(required</span> <span class="pre">…</span> <span class="pre">)</span></tt>
+clause—as a series of two-element tuples describing each parameter
+name and any requirements on the argument type.  In this case there
+is only a single required parameter, so there's just a single
+tuple:</p>
+<pre class="compound-middle literal-block">
+(required <strong>(graph, *)</strong> )
+</pre>
+<p class="compound-last">Since <tt class="docutils literal"><span class="pre">depth_first_search</span></tt> doesn't require any particular type
+for its <tt class="docutils literal"><span class="pre">graph</span></tt> parameter, we use an asterix to indicate that
+any type is allowed.  Required parameters must always precede any
+optional parameters in a signature, but if there are <em>no</em>
+required parameters, the <tt class="docutils literal"><span class="pre">(required</span> <span class="pre">…</span> <span class="pre">)</span></tt> clause can be omitted
+entirely.</p>
+</div>
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+
+BOOST_PARAMETER_NAME(graph)
+
+BOOST_PARAMETER_FUNCTION((void), f, tag,
+''') -->
+<!-- @example.append(') {}') -->
+<!-- @test('compile') -->
+</div>
+<div class="section">
+<h4><a class="toc-backref" href="#id35" id="optional-parameters" name="optional-parameters">2.1.5.2&nbsp;&nbsp;&nbsp;Optional Parameters</a></h4>
+<div class="compound">
+<p class="compound-first">Optional parameters—nested in an <tt class="docutils literal"><span class="pre">(optional</span> <span class="pre">…</span> <span class="pre">)</span></tt> clause—are given
+as a series of adjacent <em>three</em>-element tuples describing the
+parameter name, any requirements on the argument type, <em>and</em> and an
+expression representing the parameter's default value:</p>
+<pre class="compound-last literal-block">
+(optional <strong>    (visitor,           *, boost::dfs_visitor&lt;&gt;())
+    (root_vertex,       *, *vertices(graph).first)
+    (index_map,         *, get(boost::vertex_index,graph))
+    (in_out(color_map), *,
+      default_color_map(num_vertices(graph), index_map) )</strong>
+)
+</pre>
+</div>
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+
+namespace boost
+{
+  int vertex_index = 0;
+
+  template <class T = int>
+  struct dfs_visitor
+  {};
+}
+
+BOOST_PARAMETER_NAME(graph)
+BOOST_PARAMETER_NAME(visitor)
+BOOST_PARAMETER_NAME(root_vertex)
+BOOST_PARAMETER_NAME(index_map)
+BOOST_PARAMETER_NAME(color_map)
+
+BOOST_PARAMETER_FUNCTION((void), f, tag,
+  (required (graph, *))
+''') -->
+<!-- @example.append(') {}') -->
+<!-- @test('compile') -->
+</div>
+<div class="section">
+<h4><a class="toc-backref" href="#id36" id="handling-out-parameters" name="handling-out-parameters">2.1.5.3&nbsp;&nbsp;&nbsp;Handling “Out” Parameters</a></h4>
+<div class="compound">
+<p class="compound-first">Within the function body, a parameter name such as <tt class="docutils literal"><span class="pre">visitor</span></tt> is
+a <em>C++ reference</em>, bound either to an actual argument passed by
+the caller or to the result of evaluating a default expression.
+In most cases, parameter types are of the form <tt class="docutils literal"><span class="pre">T</span> <span class="pre">const&amp;</span></tt> for
+some <tt class="docutils literal"><span class="pre">T</span></tt>.  Parameters whose values are expected to be modified,
+however, must be passed by reference to <em>non</em>-<tt class="docutils literal"><span class="pre">const</span></tt>.  To
+indicate that <tt class="docutils literal"><span class="pre">color_map</span></tt> is both read and written, we wrap
+its name in <tt class="docutils literal"><span class="pre">in_out(…)</span></tt>:</p>
+<pre class="compound-last literal-block">
+(optional
+    (visitor,            *, boost::dfs_visitor&lt;&gt;())
+    (root_vertex,        *, *vertices(graph).first)
+    (index_map,          *, get(boost::vertex_index,graph))
+    (<strong>in_out(color_map)</strong>, *,
+      default_color_map(num_vertices(graph), index_map) )
+)
+</pre>
+</div>
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+
+namespace boost
+{
+  int vertex_index = 0;
+
+  template <class T = int>
+  struct dfs_visitor
+  {};
+}
+
+BOOST_PARAMETER_NAME(graph)
+
+BOOST_PARAMETER_NAME(visitor)
+BOOST_PARAMETER_NAME(root_vertex)
+BOOST_PARAMETER_NAME(index_map)
+BOOST_PARAMETER_NAME(color_map)
+
+BOOST_PARAMETER_FUNCTION((void), f, tag,
+  (required (graph, *))
+''') -->
+<!-- @example.append(') {}') -->
+<!-- @test('compile') -->
+<p>If <tt class="docutils literal"><span class="pre">color_map</span></tt> were strictly going to be modified but not examined,
+we could have written <tt class="docutils literal"><span class="pre">out(color_map)</span></tt>.  There is no functional
+difference between <tt class="docutils literal"><span class="pre">out</span></tt> and <tt class="docutils literal"><span class="pre">in_out</span></tt>; the library provides
+both so you can make your interfaces more self-documenting.</p>
+</div>
+<div class="section">
+<h4><a class="toc-backref" href="#id37" id="positional-arguments" name="positional-arguments">2.1.5.4&nbsp;&nbsp;&nbsp;Positional Arguments</a></h4>
+<p>When arguments are passed positionally (without the use of
+keywords), they will be mapped onto parameters in the order the
+parameters are given in the signature, so for example in this
+call</p>
+<pre class="literal-block">
+graphs::depth_first_search(x, y);
+</pre>
+<!-- @ignore() -->
+<p><tt class="docutils literal"><span class="pre">x</span></tt> will always be interpreted as a graph and <tt class="docutils literal"><span class="pre">y</span></tt> will always
+be interpreted as a visitor.</p>
+</div>
+<div class="section">
+<h4><a class="toc-backref" href="#id38" id="default-expression-evaluation" name="default-expression-evaluation">2.1.5.5&nbsp;&nbsp;&nbsp;Default Expression Evaluation</a></h4>
+<div class="compound">
+<p class="compound-first">Note that in our example, the value of the graph parameter is
+used in the default expressions for <tt class="docutils literal"><span class="pre">root_vertex</span></tt>,
+<tt class="docutils literal"><span class="pre">index_map</span></tt> and <tt class="docutils literal"><span class="pre">color_map</span></tt>.</p>
+<pre class="compound-middle literal-block">
+(required (<strong>graph</strong>, *) )
+(optional
+  (visitor,           *, boost::dfs_visitor&lt;&gt;())
+  (root_vertex,       *, *vertices(<strong>graph</strong>).first)
+  (index_map,         *, get(boost::vertex_index,<strong>graph</strong>))
+  (in_out(color_map), *,
+    default_color_map(num_vertices(<strong>graph</strong>), index_map) )
+)
+</pre>
+<!-- @ignore() -->
+<p class="compound-last">A default expression is evaluated in the context of all preceding
+parameters, so you can use any of their values by name.</p>
+</div>
+<div class="compound">
+<p class="compound-first">A default expression is never evaluated—or even instantiated—if
+an actual argument is passed for that parameter.  We can actually
+demonstrate that with our code so far by replacing the body of
+<tt class="docutils literal"><span class="pre">depth_first_search</span></tt> with something that prints the arguments:</p>
+<pre class="compound-middle literal-block">
+#include &lt;boost/graph/depth_first_search.hpp&gt; // for dfs_visitor
+
+BOOST_PARAMETER_FUNCTION(
+    (void), depth_first_search, tag
+    <em>…signature goes here…</em>
+)
+{
+   std::cout &lt;&lt; &quot;graph=&quot; &lt;&lt; graph &lt;&lt; std::endl;
+   std::cout &lt;&lt; &quot;visitor=&quot; &lt;&lt; visitor &lt;&lt; std::endl;
+   std::cout &lt;&lt; &quot;root_vertex=&quot; &lt;&lt; root_vertex &lt;&lt; std::endl;
+   std::cout &lt;&lt; &quot;index_map=&quot; &lt;&lt; index_map &lt;&lt; std::endl;
+   std::cout &lt;&lt; &quot;color_map=&quot; &lt;&lt; color_map &lt;&lt; std::endl;
+}
+
+int main()
+{
+    depth_first_search(1, 2, 3, 4, 5);
+
+    depth_first_search(
+        &quot;1&quot;, '2', _color_map = '5',
+        _index_map = &quot;4&quot;, _root_vertex = &quot;3&quot;);
+}
+</pre>
+<p class="compound-last">Despite the fact that default expressions such as
+<tt class="docutils literal"><span class="pre">vertices(graph).first</span></tt> are ill-formed for the given <tt class="docutils literal"><span class="pre">graph</span></tt>
+arguments, both calls will compile, and each one will print
+exactly the same thing.</p>
+</div>
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+#include <iostream>
+
+BOOST_PARAMETER_NAME(graph)
+BOOST_PARAMETER_NAME(visitor)
+BOOST_PARAMETER_NAME(root_vertex)
+BOOST_PARAMETER_NAME(index_map)
+BOOST_PARAMETER_NAME(color_map)''') -->
+<!-- @example.replace_emphasis('''
+, (required
+    (graph, *)
+    (visitor, *)
+    (root_vertex, *)
+    (index_map, *)
+    (color_map, *)
+  )
+''') -->
+<!-- @test('compile') -->
+</div>
+<div class="section">
+<h4><a class="toc-backref" href="#id39" id="signature-matching-and-overloading" name="signature-matching-and-overloading">2.1.5.6&nbsp;&nbsp;&nbsp;Signature Matching and Overloading</a></h4>
+<p>In fact, the function signature is so general that any call to
+<tt class="docutils literal"><span class="pre">depth_first_search</span></tt> with fewer than five arguments will match
+our function, provided we pass <em>something</em> for the required
+<tt class="docutils literal"><span class="pre">graph</span></tt> parameter.  That might not seem to be a problem at first;
+after all, if the arguments don't match the requirements imposed by
+the implementation of <tt class="docutils literal"><span class="pre">depth_first_search</span></tt>, a compilation error
+will occur later, when its body is instantiated.</p>
+<p>There are at least three problems with very general function
+signatures.</p>
+<ol class="arabic simple">
+<li>By the time our <tt class="docutils literal"><span class="pre">depth_first_search</span></tt> is instantiated, it has
+been selected as the best matching overload.  Some other
+<tt class="docutils literal"><span class="pre">depth_first_search</span></tt> overload might've worked had it been
+chosen instead.  By the time we see a compilation error, there's
+no chance to change that decision.</li>
+<li>Even if there are no overloads, error messages generated at
+instantiation time usually expose users to confusing
+implementation details.  For example, users might see references
+to names generated by <tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUNCTION</span></tt> such as
+<tt class="docutils literal"><span class="pre">graphs::detail::depth_first_search_with_named_params</span></tt> (or
+worse—think of the kinds of errors you get from your STL
+implementation when you make a mistake).<a class="footnote-reference" href="#conceptcpp" id="id6" name="id6"><sup>4</sup></a></li>
+<li>The problems with exposing such permissive function template
+signatures have been the subject of much discussion, especially
+in the presence of <a class="reference" href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html#225">unqualified calls</a>.  If all we want is to
+avoid unintentional argument-dependent lookup (ADL), we can
+isolate <tt class="docutils literal"><span class="pre">depth_first_search</span></tt> in a namespace containing no
+types<a class="footnote-reference" href="#using" id="id7" name="id7"><sup>7</sup></a>, but suppose we <em>want</em> it to found via ADL?</li>
+</ol>
+<p>It's usually a good idea to prevent functions from being considered
+for overload resolution when the passed argument types aren't
+appropriate.  The library already does this when the required
+<tt class="docutils literal"><span class="pre">graph</span></tt> parameter is not supplied, but we're not likely to see a
+depth first search that doesn't take a graph to operate on.
+Suppose, instead, that we found a different depth first search
+algorithm that could work on graphs that don't model
+<a class="reference" href="../../../graph/doc/IncidenceGraph.html"><span class="concept">Incidence Graph</span></a>?  If we just added a simple overload,
+it would be ambiguous:</p>
+<pre class="literal-block">
+// new overload
+BOOST_PARAMETER_FUNCTION(
+    (void), depth_first_search, (tag), (required (graph,*))( … ))
+{
+    // new algorithm implementation
+}
+
+…
+
+// ambiguous!
+depth_first_search(boost::adjacency_list&lt;&gt;(), 2, &quot;hello&quot;);
+</pre>
+<!-- @ignore() -->
+<div class="section">
+<h5><a class="toc-backref" href="#id40" id="adding-type-requirements" name="adding-type-requirements">2.1.5.6.1&nbsp;&nbsp;&nbsp;Adding Type Requirements</a></h5>
+<p>We really don't want the compiler to consider the original version
+of <tt class="docutils literal"><span class="pre">depth_first_search</span></tt> because the <tt class="docutils literal"><span class="pre">root_vertex</span></tt> argument,
+<tt class="docutils literal"><span class="pre">&quot;hello&quot;</span></tt>, doesn't meet the <a class="reference" href="#parameter-table">requirement</a> that it match the
+<tt class="docutils literal"><span class="pre">graph</span></tt> parameter's vertex descriptor type.  Instead, this call
+should just invoke our new overload.  To take the original
+<tt class="docutils literal"><span class="pre">depth_first_search</span></tt> overload out of contention, we need to tell
+the library about this requirement by replacing the <tt class="docutils literal"><span class="pre">*</span></tt> element
+of the signature with the required type, in parentheses:</p>
+<pre class="literal-block">
+(root_vertex,
+     <strong>(typename boost::graph_traits&lt;graph_type&gt;::vertex_descriptor)</strong>,
+     *vertices(graph).first)
+</pre>
+<!-- @ignore() -->
+<p>Now the original <tt class="docutils literal"><span class="pre">depth_first_search</span></tt> will only be called when
+the <tt class="docutils literal"><span class="pre">root_vertex</span></tt> argument can be converted to the graph's vertex
+descriptor type, and our example that <em>was</em> ambiguous will smoothly
+call the new overload.</p>
+<div class="note">
+<p class="first admonition-title">Note</p>
+<p class="last">The <em>type</em> of the <tt class="docutils literal"><span class="pre">graph</span></tt> argument is available in the
+signature—and in the function body—as <tt class="docutils literal"><span class="pre">graph_type</span></tt>.  In
+general, to access the type of any parameter <em>foo</em>, write <em>foo</em><tt class="docutils literal"><span class="pre">_type</span></tt>.</p>
+</div>
+</div>
+<div class="section">
+<h5><a class="toc-backref" href="#id41" id="predicate-requirements" name="predicate-requirements">2.1.5.6.2&nbsp;&nbsp;&nbsp;Predicate Requirements</a></h5>
+<p>The requirements on other arguments are a bit more interesting than
+those on <tt class="docutils literal"><span class="pre">root_vertex</span></tt>; they can't be described in terms of simple
+type matching.  Instead, they must be described in terms of <a class="reference" href="../../../mpl/doc/refmanual/metafunction.html">MPL
+Metafunctions</a>.  There's no space to give a complete description
+of metafunctions or of graph library details here, but we'll show
+you the complete signature with maximal checking, just to give you
+a feel for how it's done.  Each predicate metafunction is enclosed
+in parentheses <em>and preceded by an asterix</em>, as follows:</p>
+<pre class="literal-block">
+BOOST_PARAMETER_FUNCTION(
+    (void), depth_first_search, graphs
+
+  , (required
+      (graph
+       , <strong>*(boost::mpl::and_&lt;
+               boost::is_convertible&lt;
+                   boost::graph_traits&lt;_&gt;::traversal_category
+                 , boost::incidence_graph_tag
+               &gt;
+             , boost::is_convertible&lt;
+                   boost::graph_traits&lt;_&gt;::traversal_category
+                 , boost::vertex_list_graph_tag
+               &gt;
+           &gt;)</strong> ))
+
+    (optional
+      (visitor, *, boost::dfs_visitor&lt;&gt;()) // not checkable
+
+      (root_vertex
+        , (typename boost::graph_traits&lt;graphs::graph::_&gt;::vertex_descriptor)
+        , *vertices(graph).first)
+
+      (index_map
+        , <strong>*(boost::mpl::and_&lt;
+              boost::is_integral&lt;
+                  boost::property_traits&lt;_&gt;::value_type
+              &gt;
+            , boost::is_same&lt;
+                  typename boost::graph_traits&lt;graphs::graph::_&gt;::vertex_descriptor
+                , boost::property_traits&lt;_&gt;::key_type
+              &gt;
+          &gt;)</strong>
+        , get(boost::vertex_index,graph))
+
+      (in_out(color_map)
+        , <strong>*(boost::is_same&lt;
+              typename boost::graph_traits&lt;graphs::graph::_&gt;::vertex_descriptor
+            , boost::property_traits&lt;_&gt;::key_type
+          &gt;)</strong>
+       , default_color_map(num_vertices(graph), index_map) )
+    )
+)
+</pre>
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+
+BOOST_PARAMETER_NAME((_graph, graphs) graph)
+BOOST_PARAMETER_NAME((_visitor, graphs) visitor)
+BOOST_PARAMETER_NAME((_root_vertex, graphs) root_vertex)
+BOOST_PARAMETER_NAME((_index_map, graphs) index_map)
+BOOST_PARAMETER_NAME((_color_map, graphs) color_map)
+
+using boost::mpl::_;
+
+namespace boost
+{
+  struct incidence_graph_tag {};
+  struct vertex_list_graph_tag {};
+
+  int vertex_index = 0;
+
+  template <class T>
+  struct graph_traits
+  {
+      typedef int traversal_category;
+      typedef int vertex_descriptor;
+  };
+
+  template <class T>
+  struct property_traits
+  {
+      typedef int value_type;
+      typedef int key_type;
+  };
+
+  template <class T = int>
+  struct dfs_visitor
+  {};
+}''') -->
+<!-- @example.append('''
+{}''') -->
+<!-- @test('compile') -->
+<p>We acknowledge that this signature is pretty hairy looking.
+Fortunately, it usually isn't necessary to so completely encode the
+type requirements on arguments to generic functions.  However, it
+is usally worth the effort to do so: your code will be more
+self-documenting and will often provide a better user experience.
+You'll also have an easier transition to an upcoming C++ standard
+with <a class="reference" href="http://www.generic-programming.org/software/ConceptGCC/">language support for concepts</a>.</p>
+</div>
+</div>
+<div class="section">
+<h4><a class="toc-backref" href="#id42" id="deduced-parameters" name="deduced-parameters">2.1.5.7&nbsp;&nbsp;&nbsp;Deduced Parameters</a></h4>
+<p>To illustrate deduced parameter support we'll have to leave behind
+our example from the Graph library.  Instead, consider the example
+of the <a class="reference" href="../../../python/doc/v2/def.html"><tt class="docutils literal"><span class="pre">def</span></tt></a> function from <a class="reference" href="../../../python/doc/index.html">Boost.Python</a>.  Its signature is
+roughly as follows:</p>
+<pre class="literal-block">
+template &lt;
+  class Function, Class KeywordExpression, class CallPolicies
+&gt;
+void def(
+    // Required parameters
+    char const* name, Function func
+
+    // Optional, deduced parameters
+  , char const* docstring = &quot;&quot;
+  , KeywordExpression keywords = no_keywords()
+  , CallPolicies policies = default_call_policies()
+);
+</pre>
+<!-- @ignore() -->
+<p>Try not to be too distracted by the use of the term “keywords” in
+this example: although it means something analogous in Boost.Python
+to what it means in the Parameter library, for the purposes of this
+exercise you can think of it as being completely different.</p>
+<p>When calling <tt class="docutils literal"><span class="pre">def</span></tt>, only two arguments are required.  The
+association between any additional arguments and their parameters
+can be determined by the types of the arguments actually passed, so
+the caller is neither required to remember argument positions or
+explicitly specify parameter names for those arguments.  To
+generate this interface using <tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUNCTION</span></tt>, we need
+only enclose the deduced parameters in a <tt class="docutils literal"><span class="pre">(deduced</span> <span class="pre">…)</span></tt> clause, as
+follows:</p>
+<pre class="literal-block">
+namespace mpl = boost::mpl;
+
+BOOST_PARAMETER_FUNCTION(
+    (void), def, tag,
+
+    (required (name,(char const*)) (func,*) )   // nondeduced
+
+    <strong>(deduced</strong>
+      (optional
+        (docstring, (char const*), &quot;&quot;)
+
+        (keywords
+           , *(is_keyword_expression&lt;mpl::_&gt;) // see<a class="footnote-reference" href="#is-keyword-expression" id="id12" name="id12"><sup>6</sup></a>
+           , no_keywords())
+
+        (policies
+           , *(mpl::not_&lt;
+                 mpl::or_&lt;
+                     boost::is_convertible&lt;mpl::_, char const*&gt;
+                   , is_keyword_expression&lt;mpl::_&gt; // see<a class="footnote-reference" href="#is-keyword-expression" id="id13" name="id13"><sup>6</sup></a>
+                 &gt;
+             &gt;)
+           , default_call_policies()
+         )
+       )
+     <strong>)</strong>
+ )
+ {
+    <em>…</em>
+ }
+</pre>
+<!-- @example.replace_emphasis('') -->
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+
+BOOST_PARAMETER_NAME(name)
+BOOST_PARAMETER_NAME(func)
+BOOST_PARAMETER_NAME(docstring)
+BOOST_PARAMETER_NAME(keywords)
+BOOST_PARAMETER_NAME(policies)
+
+struct default_call_policies
+{};
+
+struct no_keywords
+{};
+
+struct keywords
+{};
+
+template <class T>
+struct is_keyword_expression
+  : boost::mpl::false_
+{};
+
+template <>
+struct is_keyword_expression<keywords>
+  : boost::mpl::true_
+{};
+
+default_call_policies some_policies;
+
+void f()
+{}
+
+''') -->
+<div class="admonition-syntax-note admonition">
+<p class="first admonition-title">Syntax Note</p>
+<p class="last">A <tt class="docutils literal"><span class="pre">(deduced</span> <span class="pre">…)</span></tt> clause always contains a <tt class="docutils literal"><span class="pre">(required</span> <span class="pre">…)</span></tt>
+and/or an <tt class="docutils literal"><span class="pre">(optional</span> <span class="pre">…)</span></tt> subclause, and must follow any
+<tt class="docutils literal"><span class="pre">(required</span> <span class="pre">…)</span></tt> or <tt class="docutils literal"><span class="pre">(optional</span> <span class="pre">…)</span></tt> clauses indicating
+nondeduced parameters at the outer level.</p>
+</div>
+<p>With the declaration above, the following two calls are equivalent:</p>
+<pre class="literal-block">
+def(&quot;f&quot;, f, <strong>some_policies</strong>, <strong>&quot;Documentation for f&quot;</strong>);
+def(&quot;f&quot;, f, <strong>&quot;Documentation for f&quot;</strong>, <strong>some_policies</strong>);
+</pre>
+<!-- @example.prepend('''
+int main()
+{''') -->
+<p>If the user wants to pass a <tt class="docutils literal"><span class="pre">policies</span></tt> argument that was also,
+for some reason, convertible to <tt class="docutils literal"><span class="pre">char</span> <span class="pre">const*</span></tt>, she can always
+specify the parameter name explicitly, as follows:</p>
+<pre class="literal-block">
+def(
+    &quot;f&quot;, f
+   , <strong>_policies = some_policies</strong>, &quot;Documentation for f&quot;);
+</pre>
+<!-- @example.append('}') -->
+<!-- @test('compile', howmany='all') -->
+</div>
+</div>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id43" id="parameter-enabled-member-functions" name="parameter-enabled-member-functions">2.2&nbsp;&nbsp;&nbsp;Parameter-Enabled Member Functions</a></h2>
+<p>The <tt class="docutils literal"><span class="pre">BOOST_PARAMETER_MEMBER_FUNCTION</span></tt> and
+<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_CONST_MEMBER_FUNCTION</span></tt> macros accept exactly the
+same arguments as <tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUNCTION</span></tt>, but are designed to
+be used within the body of a class:</p>
+<pre class="literal-block">
+BOOST_PARAMETER_NAME(arg1)
+BOOST_PARAMETER_NAME(arg2)
+
+struct callable2
+{
+    BOOST_PARAMETER_CONST_MEMBER_FUNCTION(
+        (void), operator(), tag, (required (arg1,(int))(arg2,(int))))
+    {
+        std::cout &lt;&lt; arg1 &lt;&lt; &quot;, &quot; &lt;&lt; arg2 &lt;&lt; std::endl;
+    }
+};
+</pre>
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>''') -->
+<!-- @test('compile') -->
+<p>These macros don't directly allow a function's interface to be
+separated from its implementation, but you can always forward
+arguments on to a separate implementation function:</p>
+<pre class="literal-block">
+struct callable2
+{
+    BOOST_PARAMETER_CONST_MEMBER_FUNCTION(
+        (void), operator(), tag, (required (arg1,(int))(arg2,(int))))
+    {
+        call_impl(arg1,arg2);
+    }
+ private:
+    void call_impl(int, int); // implemented elsewhere.
+};
+</pre>
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+
+BOOST_PARAMETER_NAME(arg1)
+BOOST_PARAMETER_NAME(arg2)''') -->
+<!-- @test('compile') -->
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id44" id="parameter-enabled-constructors" name="parameter-enabled-constructors">2.3&nbsp;&nbsp;&nbsp;Parameter-Enabled Constructors</a></h2>
+<p>The lack of a “delegating constructor”
+feature in C++
+(<a class="reference" href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1986.pdf">http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1986.pdf</a>)
+limits somewhat the quality of interface this library can provide
+for defining parameter-enabled constructors.  The usual workaround
+for a lack of constructor delegation applies: one must factor the
+common logic into a base class.</p>
+<p>Let's build a parameter-enabled constructor that simply prints its
+arguments.  The first step is to write a base class whose
+constructor accepts a single argument known as an <a class="reference" href="reference.html#argumentpack"><span class="concept">ArgumentPack</span></a>:
+a bundle of references to the actual arguments, tagged with their
+keywords.  The values of the actual arguments are extracted from
+the <span class="concept">ArgumentPack</span> by <em>indexing</em> it with keyword objects:</p>
+<pre class="literal-block">
+BOOST_PARAMETER_NAME(name)
+BOOST_PARAMETER_NAME(index)
+
+struct myclass_impl
+{
+    template &lt;class ArgumentPack&gt;
+    myclass_impl(ArgumentPack const&amp; args)
+    {
+        std::cout &lt;&lt; &quot;name = &quot; &lt;&lt; args[_name]
+                  &lt;&lt; &quot;; index = &quot; &lt;&lt; args[_index | 42]
+                  &lt;&lt; std::endl;
+    }
+};
+</pre>
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+#include <iostream>''') -->
+<p>Note that the bitwise or (“<tt class="docutils literal"><span class="pre">|</span></tt>”) operator has a special
+meaning when applied to keyword objects that are passed to an
+<span class="concept">ArgumentPack</span>'s indexing operator: it is used to indicate a
+default value.  In this case if there is no <tt class="docutils literal"><span class="pre">index</span></tt> parameter in
+the <span class="concept">ArgumentPack</span>, <tt class="docutils literal"><span class="pre">42</span></tt> will be used instead.</p>
+<p>Now we are ready to write the parameter-enabled constructor
+interface:</p>
+<pre class="literal-block">
+struct myclass : myclass_impl
+{
+    BOOST_PARAMETER_CONSTRUCTOR(
+        myclass, (myclass_impl), tag
+      , (required (name,*)) (optional (index,*))) // no semicolon
+};
+</pre>
+<p>Since we have supplied a default value for <tt class="docutils literal"><span class="pre">index</span></tt> but not for
+<tt class="docutils literal"><span class="pre">name</span></tt>, only <tt class="docutils literal"><span class="pre">name</span></tt> is required.  We can exercise our new
+interface as follows:</p>
+<pre class="literal-block">
+myclass x(&quot;bob&quot;, 3);                     // positional
+myclass y(_index = 12, _name = &quot;sally&quot;); // named
+myclass z(&quot;june&quot;);                       // positional/defaulted
+</pre>
+<!-- @example.wrap('int main() {', '}') -->
+<!-- @test('run', howmany='all') -->
+<p>For more on <span class="concept">ArgumentPack</span> manipulation, see the <a class="reference" href="#advanced-topics">Advanced Topics</a>
+section.</p>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id45" id="parameter-enabled-class-templates" name="parameter-enabled-class-templates">2.4&nbsp;&nbsp;&nbsp;Parameter-Enabled Class Templates</a></h2>
+<p>In this section we'll use Boost.Parameter to build <a class="reference" href="../../../python/doc/index.html">Boost.Python</a>'s <a class="reference" href="http://www.boost.org/libs/python/doc/v2/class.html#class_-spec">class_</a> template, whose “signature” is:</p>
+<pre class="literal-block">
+template class&lt;
+    ValueType, BaseList = bases&lt;&gt;
+  , HeldType = ValueType, Copyable = void
+&gt;
+class class_;
+</pre>
+<!-- @ignore() -->
+<p>Only the first argument, <tt class="docutils literal"><span class="pre">ValueType</span></tt>, is required.</p>
+<div class="section">
+<h3><a class="toc-backref" href="#id46" id="named-template-parameters" name="named-template-parameters">2.4.1&nbsp;&nbsp;&nbsp;Named Template Parameters</a></h3>
+<p>First, we'll build an interface that allows users to pass arguments
+positionally or by name:</p>
+<pre class="literal-block">
+struct B { virtual ~B() = 0; };
+struct D : B { ~D(); };
+
+class_&lt;
+     <strong>class_type&lt;B&gt;</strong>, <strong>copyable&lt;boost::noncopyable&gt;</strong>
+&gt; …;
+
+class_&lt;
+    <strong>D</strong>, <strong>held_type&lt;std::auto_ptr&lt;D&gt; &gt;</strong>, <strong>base_list&lt;bases&lt;B&gt; &gt;</strong>
+&gt; …;
+</pre>
+<!-- @ignore() -->
+<div class="section">
+<h4><a class="toc-backref" href="#id47" id="template-keywords" name="template-keywords">2.4.1.1&nbsp;&nbsp;&nbsp;Template Keywords</a></h4>
+<p>The first step is to define keywords for each template parameter:</p>
+<pre class="literal-block">
+namespace boost { namespace python {
+
+BOOST_PARAMETER_TEMPLATE_KEYWORD(class_type)
+BOOST_PARAMETER_TEMPLATE_KEYWORD(base_list)
+BOOST_PARAMETER_TEMPLATE_KEYWORD(held_type)
+BOOST_PARAMETER_TEMPLATE_KEYWORD(copyable)
+
+}}
+</pre>
+<!-- @example.prepend('#include <boost/parameter.hpp>') -->
+<!-- @test('compile') -->
+<p>The declaration of the <tt class="docutils literal"><span class="pre">class_type</span></tt> keyword you see here is
+equivalent to:</p>
+<pre class="literal-block">
+namespace boost { namespace python {
+
+namespace tag { struct class_type; } // keyword tag type
+template &lt;class T&gt;
+struct class_type
+  : parameter::template_keyword&lt;tag::class_type,T&gt;
+{};
+
+}}
+</pre>
+<!-- @example.prepend('#include <boost/parameter.hpp>') -->
+<!-- @test('compile') -->
+<p>It defines a keyword tag type named <tt class="docutils literal"><span class="pre">tag::class_type</span></tt> and a
+<em>parameter passing template</em> named <tt class="docutils literal"><span class="pre">class_type</span></tt>.</p>
+</div>
+<div class="section">
+<h4><a class="toc-backref" href="#id48" id="class-template-skeleton" name="class-template-skeleton">2.4.1.2&nbsp;&nbsp;&nbsp;Class Template Skeleton</a></h4>
+<p>The next step is to define the skeleton of our class template,
+which has three optional parameters.  Because the user may pass
+arguments in any order, we don't know the actual identities of
+these parameters, so it would be premature to use descriptive names
+or write out the actual default values for any of them.  Instead,
+we'll give them generic names and use the special type
+<tt class="docutils literal"><span class="pre">boost::parameter::void_</span></tt> as a default:</p>
+<pre class="literal-block">
+namespace boost { namespace python {
+
+template &lt;
+    class A0
+  , class A1 = parameter::void_
+  , class A2 = parameter::void_
+  , class A3 = parameter::void_
+&gt;
+struct class_
+{
+    <em>…</em>
+};
+
+}}
+</pre>
+<!-- @example.prepend('#include <boost/parameter.hpp>') -->
+<!-- @example.replace_emphasis('') -->
+<!-- @test('compile') -->
+</div>
+<div class="section">
+<h4><a class="toc-backref" href="#id49" id="class-template-signatures" name="class-template-signatures">2.4.1.3&nbsp;&nbsp;&nbsp;Class Template Signatures</a></h4>
+<p>Next, we need to build a type, known as a <a class="reference" href="reference.html#parameterspec"><span class="concept">ParameterSpec</span></a>,
+describing the “signature” of <tt class="docutils literal"><span class="pre">boost::python::class_</span></tt>.  A
+<a class="reference" href="reference.html#parameterspec"><span class="concept">ParameterSpec</span></a> enumerates the required and optional parameters in
+their positional order, along with any type requirements (note that
+it does <em>not</em> specify defaults -- those will be dealt with
+separately):</p>
+<pre class="literal-block">
+namespace boost { namespace python {
+
+using boost::mpl::_;
+
+typedef parameter::parameters&lt;
+    required&lt;tag::class_type, is_class&lt;_&gt; &gt;
+  , optional&lt;tag::base_list, mpl::is_sequence&lt;_&gt; &gt;
+  , optional&lt;tag::held_type&gt;
+  , optional&lt;tag::copyable&gt;
+&gt; class_signature;
+
+}}
+</pre>
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+#include <boost/mpl/is_sequence.hpp>
+#include <boost/noncopyable.hpp>
+#include <memory>
+
+using namespace boost::parameter;
+
+namespace boost { namespace python {
+
+BOOST_PARAMETER_TEMPLATE_KEYWORD(class_type)
+BOOST_PARAMETER_TEMPLATE_KEYWORD(base_list)
+BOOST_PARAMETER_TEMPLATE_KEYWORD(held_type)
+BOOST_PARAMETER_TEMPLATE_KEYWORD(copyable)
+
+template <class B = int>
+struct bases
+{};
+
+}}''') -->
+</div>
+<div class="section">
+<h4><a class="toc-backref" href="#id50" id="argument-packs-and-parameter-extraction" name="argument-packs-and-parameter-extraction"><span id="binding-intro"></span>2.4.1.4&nbsp;&nbsp;&nbsp;Argument Packs and Parameter Extraction</a></h4>
+<p>Next, within the body of <tt class="docutils literal"><span class="pre">class_</span></tt> , we use the <span class="concept">ParameterSpec</span>'s nested <tt class="docutils literal"><span class="pre">::bind&lt;</span> <span class="pre">…</span> <span class="pre">&gt;</span></tt> template to bundle the actual arguments
+into an <a class="reference" href="reference.html#argumentpack"><span class="concept">ArgumentPack</span></a> type, and then use the library's <tt class="docutils literal"><span class="pre">binding&lt;</span>
+<span class="pre">…</span> <span class="pre">&gt;</span></tt> metafunction to extract “logical parameters”.  Note that
+defaults are specified by supplying an optional third argument to
+<tt class="docutils literal"><span class="pre">binding&lt;</span> <span class="pre">…</span> <span class="pre">&gt;</span></tt>:</p>
+<pre class="literal-block">
+namespace boost { namespace python {
+
+template &lt;
+    class A0
+  , class A1 = parameter::void_
+  , class A2 = parameter::void_
+  , class A3 = parameter::void_
+&gt;
+struct class_
+{
+    // Create ArgumentPack
+    typedef typename
+      class_signature::bind&lt;A0,A1,A2,A3&gt;::type
+    args;
+
+    // Extract first logical parameter.
+    typedef typename parameter::binding&lt;
+      args, tag::class_type&gt;::type class_type;
+
+    typedef typename parameter::binding&lt;
+      args, tag::base_list, bases&lt;&gt; &gt;::type base_list;
+
+    typedef typename parameter::binding&lt;
+      args, tag::held_type, class_type&gt;::type held_type;
+
+    typedef typename parameter::binding&lt;
+      args, tag::copyable, void&gt;::type copyable;
+};
+
+}}
+</pre>
+</div>
+</div>
+<div class="section">
+<h3><a class="toc-backref" href="#id51" id="exercising-the-code-so-far" name="exercising-the-code-so-far">2.4.2&nbsp;&nbsp;&nbsp;Exercising the Code So Far</a></h3>
+<div class="compound">
+<p class="compound-first">Revisiting our original examples,</p>
+<pre class="compound-middle literal-block">
+typedef boost::python::class_&lt;
+    class_type&lt;B&gt;, copyable&lt;boost::noncopyable&gt;
+&gt; c1;
+
+typedef boost::python::class_&lt;
+    D, held_type&lt;std::auto_ptr&lt;D&gt; &gt;, base_list&lt;bases&lt;B&gt; &gt;
+&gt; c2;
+</pre>
+<!-- @example.prepend('''
+using boost::python::class_type;
+using boost::python::copyable;
+using boost::python::held_type;
+using boost::python::base_list;
+using boost::python::bases;
+
+struct B {};
+struct D {};''') -->
+<p class="compound-middle">we can now examine the intended parameters:</p>
+<pre class="compound-last literal-block">
+BOOST_MPL_ASSERT((boost::is_same&lt;c1::class_type, B&gt;));
+BOOST_MPL_ASSERT((boost::is_same&lt;c1::base_list, bases&lt;&gt; &gt;));
+BOOST_MPL_ASSERT((boost::is_same&lt;c1::held_type, B&gt;));
+BOOST_MPL_ASSERT((
+     boost::is_same&lt;c1::copyable, boost::noncopyable&gt;
+));
+
+BOOST_MPL_ASSERT((boost::is_same&lt;c2::class_type, D&gt;));
+BOOST_MPL_ASSERT((boost::is_same&lt;c2::base_list, bases&lt;B&gt; &gt;));
+BOOST_MPL_ASSERT((
+    boost::is_same&lt;c2::held_type, std::auto_ptr&lt;D&gt; &gt;
+));
+BOOST_MPL_ASSERT((boost::is_same&lt;c2::copyable, void&gt;));
+</pre>
+</div>
+<!-- @test('compile', howmany='all') -->
+</div>
+<div class="section">
+<h3><a class="toc-backref" href="#id52" id="deduced-template-parameters" name="deduced-template-parameters">2.4.3&nbsp;&nbsp;&nbsp;Deduced Template Parameters</a></h3>
+<p>To apply a deduced parameter interface here, we need only make the
+type requirements a bit tighter so the <tt class="docutils literal"><span class="pre">held_type</span></tt> and
+<tt class="docutils literal"><span class="pre">copyable</span></tt> parameters can be crisply distinguished from the
+others.  <a class="reference" href="../../../python/doc/index.html">Boost.Python</a> does this by requiring that <tt class="docutils literal"><span class="pre">base_list</span></tt> be
+a specialization of its <tt class="docutils literal"><span class="pre">bases&lt;</span> <span class="pre">…</span> <span class="pre">&gt;</span></tt> template (as opposed to
+being any old MPL sequence) and by requiring that <tt class="docutils literal"><span class="pre">copyable</span></tt>, if
+explicitly supplied, be <tt class="docutils literal"><span class="pre">boost::noncopyable</span></tt>.  One easy way of
+identifying specializations of <tt class="docutils literal"><span class="pre">bases&lt;</span> <span class="pre">…</span> <span class="pre">&gt;</span></tt> is to derive them all
+from the same class, as an implementation detail:</p>
+<pre class="literal-block">
+namespace boost { namespace python {
+
+namespace detail { struct bases_base {}; }
+
+template &lt;class A0 = void, class A1 = void, class A2 = void <em>…</em> &gt;
+struct bases <strong>: detail::bases_base</strong>
+{};
+
+}}
+</pre>
+<!-- @example.replace_emphasis('') -->
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+#include <boost/mpl/is_sequence.hpp>
+#include <boost/noncopyable.hpp>
+#include <memory>
+
+using namespace boost::parameter;
+using boost::mpl::_;
+
+namespace boost { namespace python {
+
+BOOST_PARAMETER_TEMPLATE_KEYWORD(class_type)
+BOOST_PARAMETER_TEMPLATE_KEYWORD(base_list)
+BOOST_PARAMETER_TEMPLATE_KEYWORD(held_type)
+BOOST_PARAMETER_TEMPLATE_KEYWORD(copyable)
+
+}}''') -->
+<p>Now we can rewrite our signature to make all three optional
+parameters deducible:</p>
+<pre class="literal-block">
+typedef parameter::parameters&lt;
+    required&lt;tag::class_type, is_class&lt;_&gt; &gt;
+
+  , optional&lt;
+        deduced&lt;tag::base_list&gt;
+      , is_base_and_derived&lt;detail::bases_base,_&gt;
+    &gt;
+
+  , optional&lt;
+        deduced&lt;tag::held_type&gt;
+      , mpl::not_&lt;
+            mpl::or_&lt;
+                is_base_and_derived&lt;detail::bases_base,_&gt;
+              , is_same&lt;noncopyable,_&gt;
+            &gt;
+        &gt;
+    &gt;
+
+  , optional&lt;deduced&lt;tag::copyable&gt;, is_same&lt;noncopyable,_&gt; &gt;
+
+&gt; class_signature;
+</pre>
+<!-- @example.prepend('''
+namespace boost { namespace python {''') -->
+<!-- @example.append('''
+template <
+    class A0
+  , class A1 = parameter::void_
+  , class A2 = parameter::void_
+  , class A3 = parameter::void_
+>
+struct class_
+{
+    // Create ArgumentPack
+    typedef typename
+      class_signature::bind<A0,A1,A2,A3>::type
+    args;
+
+    // Extract first logical parameter.
+    typedef typename parameter::binding<
+      args, tag::class_type>::type class_type;
+
+    typedef typename parameter::binding<
+      args, tag::base_list, bases<> >::type base_list;
+
+    typedef typename parameter::binding<
+      args, tag::held_type, class_type>::type held_type;
+
+    typedef typename parameter::binding<
+      args, tag::copyable, void>::type copyable;
+};
+
+}}''') -->
+<p>It may seem like we've added a great deal of complexity, but the
+benefits to our users are greater.  Our original examples can now
+be written without explicit parameter names:</p>
+<pre class="literal-block">
+typedef boost::python::class_&lt;<strong>B</strong>, <strong>boost::noncopyable</strong>&gt; c1;
+
+typedef boost::python::class_&lt;<strong>D</strong>, <strong>std::auto_ptr&lt;D&gt;</strong>, <strong>bases&lt;B&gt;</strong> &gt; c2;
+</pre>
+<!-- @example.prepend('''
+struct B {};
+struct D {};
+
+using boost::python::bases;''') -->
+<!-- @example.append('''
+BOOST_MPL_ASSERT((boost::is_same<c1::class_type, B>));
+BOOST_MPL_ASSERT((boost::is_same<c1::base_list, bases<> >));
+BOOST_MPL_ASSERT((boost::is_same<c1::held_type, B>));
+BOOST_MPL_ASSERT((
+     boost::is_same<c1::copyable, boost::noncopyable>
+));
+
+BOOST_MPL_ASSERT((boost::is_same<c2::class_type, D>));
+BOOST_MPL_ASSERT((boost::is_same<c2::base_list, bases<B> >));
+BOOST_MPL_ASSERT((
+    boost::is_same<c2::held_type, std::auto_ptr<D> >
+));
+BOOST_MPL_ASSERT((boost::is_same<c2::copyable, void>));''') -->
+<!-- @test('compile', howmany='all') -->
+</div>
+</div>
+</div>
+<div class="section">
+<h1><a class="toc-backref" href="#id53" id="advanced-topics" name="advanced-topics">3&nbsp;&nbsp;&nbsp;Advanced Topics</a></h1>
+<p>At this point, you should have a good grasp of the basics.  In this
+section we'll cover some more esoteric uses of the library.</p>
+<div class="section">
+<h2><a class="toc-backref" href="#id54" id="fine-grained-name-control" name="fine-grained-name-control">3.1&nbsp;&nbsp;&nbsp;Fine-Grained Name Control</a></h2>
+<p>If you don't like the leading-underscore naming convention used
+to refer to keyword objects, or you need the name <tt class="docutils literal"><span class="pre">tag</span></tt> for
+something other than the keyword type namespace, there's another
+way to use <tt class="docutils literal"><span class="pre">BOOST_PARAMETER_NAME</span></tt>:</p>
+<pre class="literal-block">
+BOOST_PARAMETER_NAME(<strong>(</strong><em>object-name</em><strong>,</strong> <em>tag-namespace</em><strong>)</strong> <em>parameter-name</em>)
+</pre>
+<!-- @ignore() -->
+<p>Here is a usage example:</p>
+<pre class="literal-block">
+BOOST_PARAMETER_NAME((<strong>pass_foo</strong>, <strong>keywords</strong>) <strong>foo</strong>)
+
+BOOST_PARAMETER_FUNCTION(
+  (int), f,
+  <strong>keywords</strong>, (required (<strong>foo</strong>, *)))
+{
+    return <strong>foo</strong> + 1;
+}
+
+int x = f(<strong>pass_foo</strong> = 41);
+</pre>
+<!-- @example.prepend('#include <boost/parameter.hpp>') -->
+<!-- @example.append('''
+int main()
+{}''') -->
+<!-- @test('run') -->
+<p>Before you use this more verbose form, however, please read the
+section on <a class="reference" href="#keyword-naming">best practices for keyword object naming</a>.</p>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id55" id="more-argumentpacks" name="more-argumentpacks">3.2&nbsp;&nbsp;&nbsp;More <span class="concept">ArgumentPack</span>s</a></h2>
+<p>We've already seen <span class="concept">ArgumentPack</span>s when we looked at
+<a class="reference" href="#parameter-enabled-constructors">parameter-enabled constructors</a> and <a class="reference" href="#binding-intro">class templates</a>.  As you
+might have guessed, <span class="concept">ArgumentPack</span>s actually lie at the heart of
+everything this library does; in this section we'll examine ways to
+build and manipulate them more effectively.</p>
+<div class="section">
+<h3><a class="toc-backref" href="#id56" id="building-argumentpacks" name="building-argumentpacks">3.2.1&nbsp;&nbsp;&nbsp;Building <span class="concept">ArgumentPack</span>s</a></h3>
+<p>The simplest <span class="concept">ArgumentPack</span> is the result of assigning into a
+keyword object:</p>
+<pre class="literal-block">
+BOOST_PARAMETER_NAME(index)
+
+template &lt;class ArgumentPack&gt;
+int print_index(ArgumentPack const&amp; args)
+{
+    std::cout &lt;&lt; &quot;index = &quot; &lt;&lt; args[_index] &lt;&lt; std::endl;
+    return 0;
+}
+
+int x = print_index(_index = 3);  // prints &quot;index = 3&quot;
+</pre>
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+#include <iostream>''') -->
+<p>Also, <span class="concept">ArgumentPack</span>s can be composed using the comma operator.
+The extra parentheses below are used to prevent the compiler from
+seeing two separate arguments to <tt class="docutils literal"><span class="pre">print_name_and_index</span></tt>:</p>
+<pre class="literal-block">
+BOOST_PARAMETER_NAME(name)
+
+template &lt;class ArgumentPack&gt;
+int print_name_and_index(ArgumentPack const&amp; args)
+{
+    std::cout &lt;&lt; &quot;name = &quot; &lt;&lt; args[_name] &lt;&lt; &quot;; &quot;;
+    return print_index(args);
+}
+
+int y = print_name_and_index((_index = 3, _name = &quot;jones&quot;));
+</pre>
+<p>To build an <span class="concept">ArgumentPack</span> with positional arguments, we can use a
+<a class="reference" href="reference.html#parameterspec"><span class="concept">ParameterSpec</span></a>.  As introduced described in the section on <a class="reference" href="#class-template-signatures">Class
+Template Signatures</a>, a <span class="concept">ParameterSpec</span> describes the positional
+order of parameters and any associated type requirements.  Just as
+we can build an <span class="concept">ArgumentPack</span> <em>type</em> with its nested <tt class="docutils literal"><span class="pre">::bind&lt;</span> <span class="pre">…</span>
+<span class="pre">&gt;</span></tt> template, we can build an <span class="concept">ArgumentPack</span> <em>object</em> by invoking
+its function call operator:</p>
+<pre class="literal-block">
+parameter::parameters&lt;
+    required&lt;tag::name, is_convertible&lt;_,char const*&gt; &gt;
+  , optional&lt;tag::index, is_convertible&lt;_,int&gt; &gt;
+&gt; spec;
+
+int z0 = print_name_and_index( <strong>spec(</strong>&quot;sam&quot;, 12<strong>)</strong> );
+
+int z1 = print_name_and_index(
+   <strong>spec(</strong>_index=12, _name=&quot;sam&quot;<strong>)</strong>
+);
+</pre>
+<!-- @example.prepend('''
+namespace parameter = boost::parameter;
+using parameter::required;
+using parameter::optional;
+using boost::is_convertible;
+using boost::mpl::_;''') -->
+<!-- @example.append('''
+int main()
+{}''') -->
+<!-- @test('run', howmany='all') -->
+</div>
+<div class="section">
+<h3><a class="toc-backref" href="#id57" id="extracting-parameter-types" name="extracting-parameter-types">3.2.2&nbsp;&nbsp;&nbsp;Extracting Parameter Types</a></h3>
+<p>If we want to know the types of the arguments passed to
+<tt class="docutils literal"><span class="pre">print_name_and_index</span></tt>, we have a couple of options.  The
+simplest and least error-prone approach is to forward them to a
+function template and allow <em>it</em> to do type deduction:</p>
+<pre class="literal-block">
+BOOST_PARAMETER_NAME(name)
+BOOST_PARAMETER_NAME(index)
+
+template &lt;class Name, class Index&gt;
+int deduce_arg_types_impl(Name&amp; name, Index&amp; index)
+{
+    Name&amp; n2 = name;  // we know the types
+    Index&amp; i2 = index;
+    return index;
+}
+
+template &lt;class ArgumentPack&gt;
+int deduce_arg_types(ArgumentPack const&amp; args)
+{
+    return deduce_arg_types_impl(args[_name], args[_index|42]);
+}
+</pre>
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+#include <cassert>''') -->
+<!-- @example.append('''
+int a1 = deduce_arg_types((_name = "foo"));
+int a2 = deduce_arg_types((_name = "foo", _index = 3));
+
+int main()
+{
+    assert(a1 == 42);
+    assert(a2 == 3);
+}''') -->
+<!-- @test('run') -->
+<p>Occasionally one needs to deduce argument types without an extra
+layer of function call.  For example, suppose we wanted to return
+twice the value of the <tt class="docutils literal"><span class="pre">index</span></tt> parameter?  In that
+case we can use the <tt class="docutils literal"><span class="pre">binding&lt;</span> <span class="pre">…</span> <span class="pre">&gt;</span></tt> metafunction introduced
+<a class="reference" href="#binding-intro">earlier</a>:</p>
+<pre class="literal-block">
+BOOST_PARAMETER_NAME(index)
+
+template &lt;class ArgumentPack&gt;
+typename parameter::binding&lt;ArgumentPack, tag::index, int&gt;::type
+twice_index(ArgumentPack const&amp; args)
+{
+    return 2 * args[_index|42];
+}
+
+int six = twice_index(_index = 3);
+</pre>
+<!-- TODO: binding<> returns a reference. We should use value_type<> here. -->
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+#include <cassert>
+
+namespace parameter = boost::parameter;''') -->
+<!-- @example.append('''
+int main()
+{
+    assert(six == 6);
+}''') -->
+<!-- @test('run') -->
+</div>
+<div class="section">
+<h3><a class="toc-backref" href="#id58" id="lazy-default-computation" name="lazy-default-computation">3.2.3&nbsp;&nbsp;&nbsp;Lazy Default Computation</a></h3>
+<p>When a default value is expensive to compute, it would be
+preferable to avoid it until we're sure it's absolutely necessary.
+<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUNCTION</span></tt> takes care of that problem for us, but
+when using <span class="concept">ArgumentPack</span>s explicitly, we need a tool other than
+<tt class="docutils literal"><span class="pre">operator|</span></tt>:</p>
+<pre class="literal-block">
+BOOST_PARAMETER_NAME(s1)
+BOOST_PARAMETER_NAME(s2)
+BOOST_PARAMETER_NAME(s3)
+
+template &lt;class ArgumentPack&gt;
+std::string f(ArgumentPack const&amp; args)
+{
+    std::string const&amp; s1 = args[_s1];
+    std::string const&amp; s2 = args[_s2];
+    typename parameter::binding&lt;
+        ArgumentPack,tag::s3,std::string
+    &gt;::type s3 = args[_s3|(s1+s2)]; // always constructs s1+s2
+    return s3;
+}
+
+std::string x = f((_s1=&quot;hello,&quot;, _s2=&quot; world&quot;, _s3=&quot;hi world&quot;));
+</pre>
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+#include <string>
+
+namespace parameter = boost::parameter;''') -->
+<!-- @example.append('''
+int main()
+{}''') -->
+<!-- @test('run') -->
+<p>In the example above, the string <tt class="docutils literal"><span class="pre">&quot;hello,</span> <span class="pre">world&quot;</span></tt> is constructed
+despite the fact that the user passed us a value for <tt class="docutils literal"><span class="pre">s3</span></tt>.  To
+remedy that, we can compute the default value <em>lazily</em> (that is,
+only on demand), by combining the logical-or (“``||``”) operator
+with a function object built by the Boost <a class="reference" href="../../../lambda/index.html">Lambda</a> library:<a class="footnote-reference" href="#bind" id="id17" name="id17"><sup>5</sup></a></p>
+<pre class="literal-block">
+namespace lambda = boost::lambda;
+
+typename parameter::binding&lt;
+    ArgumentPack, tag::s3, std::string
+&gt;::type s3 = args[_s3 <strong>|| (lambda::var(s1)+lambda::var(s2))</strong> ];
+</pre>
+<!-- @example.prepend('''
+#include <boost/lambda/lambda.hpp>
+#include <boost/parameter.hpp>
+#include <string>
+
+namespace parameter = boost::parameter;
+
+BOOST_PARAMETER_NAME(s1)
+BOOST_PARAMETER_NAME(s2)
+BOOST_PARAMETER_NAME(s3)
+
+template <class ArgumentPack>
+std::string f(ArgumentPack const& args)
+{
+    std::string const& s1 = args[_s1];
+    std::string const& s2 = args[_s2];''') -->
+<!-- @example.append('''
+    return s3;
+}
+
+std::string x = f((_s1="hello,", _s2=" world", _s3="hi world"));
+
+int main()
+{}''') -->
+<!-- @test('run') -->
+<div class="sidebar">
+<p class="first sidebar-title">Mnemonics</p>
+<p class="last">To remember the difference between <tt class="docutils literal"><span class="pre">|</span></tt> and <tt class="docutils literal"><span class="pre">||</span></tt>, recall that
+<tt class="docutils literal"><span class="pre">||</span></tt> normally uses short-circuit evaluation: its second
+argument is only evaluated if its first argument is <tt class="docutils literal"><span class="pre">false</span></tt>.
+Similarly, in <tt class="docutils literal"><span class="pre">color_map[param||f]</span></tt>, <tt class="docutils literal"><span class="pre">f</span></tt> is only invoked if
+no <tt class="docutils literal"><span class="pre">color_map</span></tt> argument was supplied.</p>
+</div>
+<p>The expression <tt class="docutils literal"><span class="pre">lambda::var(s1)+lambda::var(s2)</span></tt> yields a
+<em>function object</em> that, when invoked, adds the two strings
+together.  That function will only be invoked if no <tt class="docutils literal"><span class="pre">s3</span></tt> argument
+is supplied by the caller.</p>
+</div>
+</div>
+</div>
+<div class="section">
+<h1><a class="toc-backref" href="#id59" id="best-practices" name="best-practices">4&nbsp;&nbsp;&nbsp;Best Practices</a></h1>
+<p>By now you should have a fairly good idea of how to use the
+Parameter library.  This section points out a few more-marginal
+issues that will help you use the library more effectively.</p>
+<div class="section">
+<h2><a class="toc-backref" href="#id60" id="keyword-naming" name="keyword-naming">4.1&nbsp;&nbsp;&nbsp;Keyword Naming</a></h2>
+<p><tt class="docutils literal"><span class="pre">BOOST_PARAMETER_NAME</span></tt> prepends a leading underscore to the names
+of all our keyword objects in order to avoid the following
+usually-silent bug:</p>
+<pre class="literal-block">
+namespace people
+{
+  namespace tag { struct name; struct age;  }
+
+  namespace // unnamed
+  {
+    boost::parameter::keyword&lt;tag::name&gt;&amp; <strong>name</strong>
+    = boost::parameter::keyword&lt;tag::name&gt;::instance;
+    boost::parameter::keyword&lt;tag::age&gt;&amp; <strong>age</strong>
+    = boost::parameter::keyword&lt;tag::age&gt;::instance;
+  }
+
+  BOOST_PARAMETER_FUNCTION(
+      (void), g, tag, (optional (name, *, &quot;bob&quot;)(age, *, 42)))
+  {
+      std::cout &lt;&lt; name &lt;&lt; &quot;:&quot; &lt;&lt; age;
+  }
+
+  void f(int age)
+  {
+  <span class="vellipsis">     .
+     .
+     .
+   </span>
+     g(<strong>age</strong> = 3); // whoops!
+  }
+}
+</pre>
+<!-- @ignore() -->
+<p>Although in the case above, the user was trying to pass the value
+<tt class="docutils literal"><span class="pre">3</span></tt> as the <tt class="docutils literal"><span class="pre">age</span></tt> parameter to <tt class="docutils literal"><span class="pre">g</span></tt>, what happened instead
+was that <tt class="docutils literal"><span class="pre">f</span></tt>'s <tt class="docutils literal"><span class="pre">age</span></tt> argument got reassigned the value 3,
+and was then passed as a positional argument to <tt class="docutils literal"><span class="pre">g</span></tt>.  Since
+<tt class="docutils literal"><span class="pre">g</span></tt>'s first positional parameter is <tt class="docutils literal"><span class="pre">name</span></tt>, the default value
+for <tt class="docutils literal"><span class="pre">age</span></tt> is used, and g prints <tt class="docutils literal"><span class="pre">3:42</span></tt>.  Our leading
+underscore naming convention that makes this problem less likely
+to occur.</p>
+<p>In this particular case, the problem could have been detected if
+f's <tt class="docutils literal"><span class="pre">age</span></tt> parameter had been made <tt class="docutils literal"><span class="pre">const</span></tt>, which is always a
+good idea whenever possible.  Finally, we recommend that you use
+an enclosing namespace for all your code, but particularly for
+names with leading underscores.  If we were to leave out the
+<tt class="docutils literal"><span class="pre">people</span></tt> namespace above, names in the global namespace
+beginning with leading underscores—which are reserved to your C++
+compiler—might become irretrievably ambiguous with those in our
+unnamed namespace.</p>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id61" id="namespaces" name="namespaces">4.2&nbsp;&nbsp;&nbsp;Namespaces</a></h2>
+<p>In our examples we've always declared keyword objects in (an
+unnamed namespace within) the same namespace as the
+Boost.Parameter-enabled functions using those keywords:</p>
+<pre class="literal-block">
+namespace lib
+{
+  <strong>BOOST_PARAMETER_NAME(name)
+  BOOST_PARAMETER_NAME(index)</strong>
+
+  BOOST_PARAMETER_FUNCTION(
+    (int), f, tag,
+    (optional (name,*,&quot;bob&quot;)(index,(int),1))
+  )
+  {
+      std::cout &lt;&lt; name &lt;&lt; &quot;:&quot; &lt;&lt; index &lt;&lt; std::endl;
+      return index;
+  }
+}
+</pre>
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+#include <iostream>''') -->
+<!-- @namespace_setup = str(example) -->
+<!-- @ignore() -->
+<p>Users of these functions have a few choices:</p>
+<ol class="arabic simple">
+<li>Full qualification:</li>
+</ol>
+<blockquote>
+<pre class="literal-block">
+int x = <strong>lib::</strong>f(<strong>lib::</strong>_name = &quot;jill&quot;, <strong>lib::</strong>_index = 1);
+</pre>
+<p>This approach is more verbose than many users would like.</p>
+</blockquote>
+<!-- @example.prepend(namespace_setup) -->
+<!-- @example.append('int main() {}') -->
+<!-- @test('run') -->
+<ol class="arabic simple" start="2">
+<li>Make keyword objects available through
+<em>using-declarations</em>:</li>
+</ol>
+<blockquote>
+<pre class="literal-block">
+<strong>using lib::_name;
+using lib::_index;</strong>
+
+int x = lib::f(_name = &quot;jill&quot;, _index = 1);
+</pre>
+<p>This version is much better at the actual call site, but the
+<em>using-declarations</em> themselves can be verbose and hard-to
+manage.</p>
+</blockquote>
+<!-- @example.prepend(namespace_setup) -->
+<!-- @example.append('int main() {}') -->
+<!-- @test('run') -->
+<ol class="arabic simple" start="3">
+<li>Bring in the entire namespace with a <em>using-directive</em>:</li>
+</ol>
+<blockquote>
+<pre class="literal-block">
+<strong>using namespace lib;</strong>
+int x = <strong>f</strong>(_name = &quot;jill&quot;, _index = 3);
+</pre>
+<p>This option is convenient, but it indiscriminately makes the
+<em>entire</em> contents of <tt class="docutils literal"><span class="pre">lib</span></tt> available without qualification.</p>
+</blockquote>
+<!-- @example.prepend(namespace_setup) -->
+<!-- @example.append('int main() {}') -->
+<!-- @test('run') -->
+<p>If we add an additional namespace around keyword declarations,
+though, we can give users more control:</p>
+<pre class="literal-block">
+namespace lib
+{
+  <strong>namespace keywords
+  {</strong>
+     BOOST_PARAMETER_NAME(name)
+     BOOST_PARAMETER_NAME(index)
+  <strong>}</strong>
+
+  BOOST_PARAMETER_FUNCTION(
+    (int), f, <strong>keywords::</strong>tag,
+    (optional (name,*,&quot;bob&quot;)(index,(int),1))
+  )
+  {
+      std::cout &lt;&lt; name &lt;&lt; &quot;:&quot; &lt;&lt; index &lt;&lt; std::endl;
+      return index;
+  }
+}
+</pre>
+<!-- @example.prepend('''
+#include <boost/parameter.hpp>
+#include <iostream>''') -->
+<p>Now users need only a single <em>using-directive</em> to bring in just the
+names of all keywords associated with <tt class="docutils literal"><span class="pre">lib</span></tt>:</p>
+<pre class="literal-block">
+<strong>using namespace lib::keywords;</strong>
+int y = lib::f(_name = &quot;bob&quot;, _index = 2);
+</pre>
+<!-- @example.append('int main() {}') -->
+<!-- @test('run', howmany='all') -->
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id62" id="documentation" name="documentation">4.3&nbsp;&nbsp;&nbsp;Documentation</a></h2>
+<p>The interface idioms enabled by Boost.Parameter are completely new
+(to C++), and as such are not served by pre-existing documentation
+conventions.</p>
+<div class="note">
+<p class="first admonition-title">Note</p>
+<p class="last">This space is empty because we haven't settled on any
+best practices yet.  We'd be very pleased to link to your
+documentation if you've got a style that you think is worth
+sharing.</p>
+</div>
+</div>
+</div>
+<div class="section">
+<h1><a class="toc-backref" href="#id63" id="portability-considerations" name="portability-considerations">5&nbsp;&nbsp;&nbsp;Portability Considerations</a></h1>
+<p>Use the <a class="reference" href="http://www.boost.org/regression/release/user/parameter.html">regression test results</a> for the latest Boost release of
+the Parameter library to see how it fares on your favorite
+compiler.  Additionally, you may need to be aware of the following
+issues and workarounds for particular compilers.</p>
+<div class="section">
+<h2><a class="toc-backref" href="#id64" id="no-sfinae-support" name="no-sfinae-support">5.1&nbsp;&nbsp;&nbsp;No SFINAE Support</a></h2>
+<p>Some older compilers don't support SFINAE.  If your compiler meets
+that criterion, then Boost headers will <tt class="docutils literal"><span class="pre">#define</span></tt> the preprocessor
+symbol <tt class="docutils literal"><span class="pre">BOOST_NO_SFINAE</span></tt>, and parameter-enabled functions won't be
+removed from the overload set based on their signatures.</p>
+</div>
+<div class="section">
+<h2><a id="no-support-for-result-of" name="no-support-for-result-of">5.2&nbsp;&nbsp;&nbsp;No Support for <a class="reference" href="../../../utility/utility.htm#result_of"><tt class="docutils literal"><span class="pre">result_of</span></tt></a></a></h2>
+<p><a class="reference" href="#lazy-default-computation">Lazy default computation</a> relies on the <tt class="docutils literal"><span class="pre">result_of</span></tt> class
+template to compute the types of default arguments given the type
+of the function object that constructs them.  On compilers that
+don't support <tt class="docutils literal"><span class="pre">result_of</span></tt>, <tt class="docutils literal"><span class="pre">BOOST_NO_RESULT_OF</span></tt> will be
+<tt class="docutils literal"><span class="pre">#define</span></tt>d, and the compiler will expect the function object to
+contain a nested type name, <tt class="docutils literal"><span class="pre">result_type</span></tt>, that indicates its
+return type when invoked without arguments.  To use an ordinary
+function as a default generator on those compilers, you'll need to
+wrap it in a class that provides <tt class="docutils literal"><span class="pre">result_type</span></tt> as a <tt class="docutils literal"><span class="pre">typedef</span></tt>
+and invokes the function via its <tt class="docutils literal"><span class="pre">operator()</span></tt>.</p>
+<!-- Can't Declare |ParameterSpec| via ``typedef``
+=============================================
+
+In principle you can declare a |ParameterSpec| as a ``typedef``
+for a specialization of ``parameters<…>``, but Microsoft Visual C++
+6.x has been seen to choke on that usage.  The workaround is to use
+inheritance and declare your |ParameterSpec| as a class:
+
+.. parsed-literal::
+
+     **struct dfs_parameters
+       :** parameter::parameters<
+           tag::graph, tag::visitor, tag::root_vertex
+         , tag::index_map, tag::color_map
+     > **{};**
+
+
+Default Arguments Unsupported on Nested Templates
+=================================================
+
+As of this writing, Borland compilers don't support the use of
+default template arguments on member class templates.  As a result,
+you have to supply ``BOOST_PARAMETER_MAX_ARITY`` arguments to every
+use of ``parameters<…>::match``.  Since the actual defaults used
+are unspecified, the workaround is to use
+|BOOST_PARAMETER_MATCH|_ to declare default arguments for SFINAE.
+
+.. |BOOST_PARAMETER_MATCH| replace:: ``BOOST_PARAMETER_MATCH`` -->
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id66" id="compiler-can-t-see-references-in-unnamed-namespace" name="compiler-can-t-see-references-in-unnamed-namespace">5.3&nbsp;&nbsp;&nbsp;Compiler Can't See References In Unnamed Namespace</a></h2>
+<p>If you use Microsoft Visual C++ 6.x, you may find that the compiler
+has trouble finding your keyword objects.  This problem has been
+observed, but only on this one compiler, and it disappeared as the
+test code evolved, so we suggest you use it only as a last resort
+rather than as a preventative measure.  The solution is to add
+<em>using-declarations</em> to force the names to be available in the
+enclosing namespace without qualification:</p>
+<pre class="literal-block">
+namespace graphs
+{
+  using graphs::graph;
+  using graphs::visitor;
+  using graphs::root_vertex;
+  using graphs::index_map;
+  using graphs::color_map;
+}
+</pre>
+</div>
+</div>
+<div class="section">
+<h1><a class="toc-backref" href="#id67" id="python-binding" name="python-binding">6&nbsp;&nbsp;&nbsp;Python Binding</a></h1>
+<p>Follow <a class="reference" href="python.html">this link</a> for documentation on how to expose
+Boost.Parameter-enabled functions to Python with <a class="reference" href="../../../python/doc/index.html">Boost.Python</a>.</p>
+</div>
+<div class="section">
+<h1><a class="toc-backref" href="#id68" id="reference" name="reference">7&nbsp;&nbsp;&nbsp;Reference</a></h1>
+<p>Follow <a class="reference" href="reference.html">this link</a> to the Boost.Parameter reference
+documentation.</p>
+</div>
+<div class="section">
+<h1><a class="toc-backref" href="#id69" id="glossary" name="glossary">8&nbsp;&nbsp;&nbsp;Glossary</a></h1>
+<table class="docutils field-list" frame="void" id="arguments" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name" colspan="2">Argument (or “actual argument”):</th></tr>
+<tr><td>&nbsp;</td><td class="field-body">the value actually passed to a
+function or class template</td>
+</tr>
+</tbody>
+</table>
+<table class="docutils field-list" frame="void" id="parameter" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name" colspan="2">Parameter (or “formal parameter”):</th></tr>
+<tr><td>&nbsp;</td><td class="field-body"><p class="first">the name used to refer to an
+argument within a function or class template.  For example, the
+value of <tt class="docutils literal"><span class="pre">f</span></tt>'s <em>parameter</em> <tt class="docutils literal"><span class="pre">x</span></tt> is given by the <em>argument</em>
+<tt class="docutils literal"><span class="pre">3</span></tt>:</p>
+<pre class="last literal-block">
+int f(int x) { return x + 1 }
+int y = f(3);
+</pre>
+</td>
+</tr>
+</tbody>
+</table>
+</div>
+<div class="section">
+<h1><a class="toc-backref" href="#id70" id="acknowledgements" name="acknowledgements">9&nbsp;&nbsp;&nbsp;Acknowledgements</a></h1>
+<p>The authors would like to thank all the Boosters who participated
+in the review of this library and its documentation, most
+especially our review manager, Doug Gregor.</p>
+<hr class="docutils" />
+<table class="docutils footnote" frame="void" id="old-interface" rules="none">
+<colgroup><col class="label" /><col /></colgroup>
+<tbody valign="top">
+<tr><td class="label"><a class="fn-backref" href="#id2" name="old-interface">[1]</a></td><td>As of Boost 1.33.0 the Graph library was still
+using an <a class="reference" href="../../../graph/doc/bgl_named_params.html">older named parameter mechanism</a>, but there are
+plans to change it to use Boost.Parameter (this library) in an
+upcoming release, while keeping the old interface available for
+backward-compatibility.</td></tr>
+</tbody>
+</table>
+<table class="docutils footnote" frame="void" id="odr" rules="none">
+<colgroup><col class="label" /><col /></colgroup>
+<tbody valign="top">
+<tr><td class="label"><a class="fn-backref" href="#id4" name="odr">[2]</a></td><td>The <strong>One Definition Rule</strong> says that any given entity in
+a C++ program must have the same definition in all translation
+units (object files) that make up a program.</td></tr>
+</tbody>
+</table>
+<table class="docutils footnote" frame="void" id="vertex-descriptor" rules="none">
+<colgroup><col class="label" /><col /></colgroup>
+<tbody valign="top">
+<tr><td class="label"><a name="vertex-descriptor">[3]</a></td><td>If you're not familiar with the Boost Graph
+Library, don't worry about the meaning of any
+Graph-library-specific details you encounter.  In this case you
+could replace all mentions of vertex descriptor types with
+<tt class="docutils literal"><span class="pre">int</span></tt> in the text, and your understanding of the Parameter
+library wouldn't suffer.</td></tr>
+</tbody>
+</table>
+<table class="docutils footnote" frame="void" id="conceptcpp" rules="none">
+<colgroup><col class="label" /><col /></colgroup>
+<tbody valign="top">
+<tr><td class="label"><a class="fn-backref" href="#id6" name="conceptcpp">[4]</a></td><td>This is a major motivation behind <a class="reference" href="http://www.generic-programming.org/software/ConceptGCC/">ConceptC++</a>.</td></tr>
+</tbody>
+</table>
+<table class="docutils footnote" frame="void" id="bind" rules="none">
+<colgroup><col class="label" /><col /></colgroup>
+<tbody valign="top">
+<tr><td class="label"><a class="fn-backref" href="#id17" name="bind">[5]</a></td><td><p class="first">The Lambda library is known not to work on <a class="reference" href="http://www.boost.org/regression/release/user/lambda.html">some
+less-conformant compilers</a>.  When using one of those you could
+use <a class="reference" href="../../../bind/index.html">Boost.Bind</a> to generate the function object:</p>
+<pre class="last literal-block">
+boost::bind(std::plus&lt;std::string&gt;(),s1,s2)
+</pre>
+</td></tr>
+</tbody>
+</table>
+<table class="docutils footnote" frame="void" id="is-keyword-expression" rules="none">
+<colgroup><col class="label" /><col /></colgroup>
+<tbody valign="top">
+<tr><td class="label"><a name="is-keyword-expression">[6]</a></td><td><em>(<a class="fn-backref" href="#id12">1</a>, <a class="fn-backref" href="#id13">2</a>)</em> Here we're assuming there's a predicate
+metafunction <tt class="docutils literal"><span class="pre">is_keyword_expression</span></tt> that can be used to
+identify models of Boost.Python's KeywordExpression concept.</td></tr>
+</tbody>
+</table>
+<table class="docutils footnote" frame="void" id="using" rules="none">
+<colgroup><col class="label" /><col /></colgroup>
+<tbody valign="top">
+<tr><td class="label"><a class="fn-backref" href="#id7" name="using">[7]</a></td><td><p class="first">You can always give the illusion that the function
+lives in an outer namespace by applying a <em>using-declaration</em>:</p>
+<pre class="last literal-block">
+  namespace foo_overloads
+  {
+    // foo declarations here
+    void foo() { ... }
+    ...
+  }
+  using foo_overloads::foo;
+
+This technique for avoiding unintentional argument-dependent
+lookup is due to Herb Sutter.
+</pre>
+</td></tr>
+</tbody>
+</table>
+<table class="docutils footnote" frame="void" id="sfinae" rules="none">
+<colgroup><col class="label" /><col /></colgroup>
+<tbody valign="top">
+<tr><td class="label"><a name="sfinae">[8]</a></td><td>This capability depends on your compiler's support for SFINAE.
+<strong>SFINAE</strong>: <strong>S</strong>ubstitution <strong>F</strong>ailure <strong>I</strong>s
+<strong>N</strong>ot <strong>A</strong>n <strong>E</strong> rror.  If type substitution during the
+instantiation of a function template results in an invalid type,
+no compilation error is emitted; instead the overload is removed
+from the overload set. By producing an invalid type in the
+function signature depending on the result of some condition,
+we can decide whether or not an overload is considered during overload
+resolution.  The technique is formalized in
+the <a class="reference" href="../../../utility/enable_if.html"><tt class="docutils literal"><span class="pre">enable_if</span></tt></a> utility.  Most recent compilers support SFINAE;
+on compilers that don't support it, the Boost config library
+will <tt class="docutils literal"><span class="pre">#define</span></tt> the symbol <tt class="docutils literal"><span class="pre">BOOST_NO_SFINAE</span></tt>.
+See
+<a class="reference" href="http://www.semantics.org/once_weakly/w02_SFINAE.pdf">http://www.semantics.org/once_weakly/w02_SFINAE.pdf</a> for more
+information on SFINAE.</td></tr>
+</tbody>
+</table>
+</div>
+</div>
+<div class="footer">
+<hr class="footer" />
+Generated on: 2007-01-03 17:02 UTC.
+Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
+
+</div>
+</body>
+</html>

Modified: boost/trunk/libs/parameter/doc/html/python.html
===================================================================
--- boost/trunk/libs/parameter/doc/html/python.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/doc/html/python.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,48 +5,57 @@
 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
 <meta name="generator" content="Docutils 0.5: http://docutils.sourceforge.net/" />
 <title>The Boost Parameter Library Python Binding Documentation</title>
+<meta name="authors" content="Daniel Wallin" />
+<meta name="organization" content="Boost Consulting" />
+<meta name="date" content="2006-09-21" />
+<meta name="copyright" content="Copyright David Abrahams, Daniel Wallin 2005. Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)" />
 <link rel="stylesheet" href="rst.css" type="text/css" />
 </head>
 <body>
 <div class="document" id="the-boost-parameter-library-python-binding-documentation">
 <h1 class="title">The Boost Parameter Library Python Binding Documentation</h1>
-<p><a class="reference" href="../../../../index.htm"><img alt="Boost" src="../../../../boost.png" /></a></p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
+<table class="docinfo" frame="void" rules="none">
+<col class="docinfo-name" />
+<col class="docinfo-content" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">Authors:</th><td class="field-body">Daniel Wallin</td>
-</tr>
-<tr class="field"><th class="field-name">Contact:</th><td class="field-body"><a class="reference" href="mailto:dalwan01&#64;student.umu.se">dalwan01&#64;student.umu.se</a></td>
-</tr>
-<tr class="field"><th class="field-name">organization:</th><td class="field-body"><a class="reference" href="http://www.boost-consulting.com">Boost Consulting</a></td>
-</tr>
-<tr class="field"><th class="field-name">date:</th><td class="field-body">$Date: 2006/05/18 14:59:38 $</td>
-</tr>
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Copyright David Abrahams, Daniel Wallin
+<tr><th class="docinfo-name">Authors:</th>
+<td>Daniel Wallin</td></tr>
+<tr><th class="docinfo-name">Contact:</th>
+<td><a class="first last reference" href="mailto:dalwan01&#64;student.umu.se">dalwan01&#64;student.umu.se</a></td></tr>
+<tr><th class="docinfo-name">Organization:</th>
+<td><a class="first last reference" href="http://www.boost-consulting.com">Boost Consulting</a></td></tr>
+<tr><th class="docinfo-name">Date:</th>
+<td>2006-09-21</td></tr>
+<tr><th class="docinfo-name">Copyright:</th>
+<td>Copyright David Abrahams, Daniel Wallin
 2005. Distributed under the Boost Software License,
 Version 1.0. (See accompanying file LICENSE_1_0.txt
-or copy at <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</td>
-</tr>
+or copy at <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</td></tr>
 </tbody>
 </table>
+<div class="abstract topic">
+<p class="topic-title first">Abstract</p>
+<p>Makes it possible to bind Boost.Parameter-enabled
+functions, operators and constructors to Python.</p>
+</div>
+<p><a class="reference" href="../../../../index.htm"><img alt="Boost" src="../../../../boost.png" /></a></p>
 <div class="contents topic">
 <p class="topic-title first"><a id="contents" name="contents">Contents</a></p>
 <ul class="simple">
-<li><a class="reference" href="#introduction" id="id7" name="id7">Introduction</a></li>
-<li><a class="reference" href="#tutorial" id="id8" name="id8">Tutorial</a></li>
-<li><a class="reference" href="#concept-keywordsspec" id="id9" name="id9">concept <span class="concept">KeywordsSpec</span></a></li>
-<li><a class="reference" href="#special-keywords" id="id10" name="id10"><em>special</em> keywords</a></li>
-<li><a class="reference" href="#class-template-init" id="id11" name="id11">class template <tt class="docutils literal"><span class="pre">init</span></tt></a></li>
-<li><a class="reference" href="#class-template-call" id="id12" name="id12">class template <tt class="docutils literal"><span class="pre">call</span></tt></a></li>
-<li><a class="reference" href="#class-template-function" id="id13" name="id13">class template <tt class="docutils literal"><span class="pre">function</span></tt></a></li>
-<li><a class="reference" href="#function-template-def" id="id14" name="id14">function template <tt class="docutils literal"><span class="pre">def</span></tt></a></li>
-<li><a class="reference" href="#portability" id="id15" name="id15">Portability</a></li>
+<li><a class="reference" href="#introduction" id="id8" name="id8">Introduction</a></li>
+<li><a class="reference" href="#tutorial" id="id9" name="id9">Tutorial</a></li>
+<li><a class="reference" href="#concept-parameterspec" id="id10" name="id10">concept <span class="concept">ParameterSpec</span></a></li>
+<li><a class="reference" href="#special-keywords" id="id11" name="id11"><em>special</em> keywords</a></li>
+<li><a class="reference" href="#class-template-init" id="id12" name="id12">class template <tt class="docutils literal"><span class="pre">init</span></tt></a></li>
+<li><a class="reference" href="#class-template-call" id="id13" name="id13">class template <tt class="docutils literal"><span class="pre">call</span></tt></a></li>
+<li><a class="reference" href="#class-template-function" id="id14" name="id14">class template <tt class="docutils literal"><span class="pre">function</span></tt></a></li>
+<li><a class="reference" href="#function-template-def" id="id15" name="id15">function template <tt class="docutils literal"><span class="pre">def</span></tt></a></li>
+<li><a class="reference" href="#portability" id="id16" name="id16">Portability</a></li>
 </ul>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id7" id="introduction" name="introduction">Introduction</a></h1>
-<p><tt class="docutils literal"><span class="pre">boost/parameter/python.hpp</span></tt> introduces a group of <a class="reference" href="../../../python/doc/v2/def_visitor.html">def_visitors</a> that can
+<h1><a class="toc-backref" href="#id8" id="introduction" name="introduction">Introduction</a></h1>
+<p><tt class="docutils literal"><span class="pre">boost/parameter/python.hpp</span></tt> introduces a group of <a class="reference" href="../../../python/doc/v2/def_visitor.html"><tt class="docutils literal"><span class="pre">def_visitors</span></tt></a> that can
 be used to easily expose Boost.Parameter-enabled member functions to Python with
 Boost.Python. It also provides a function template <tt class="docutils literal"><span class="pre">def()</span></tt> that can be used
 to expose Boost.Parameter-enabled free functions.</p>
@@ -54,20 +63,25 @@
 must be specified.  Additionally, because Boost.Parameter enabled
 functions are templates, the desired function signature must be
 specified.</p>
-<p>The keyword tags are specified as an <a class="reference" href="../../../mpl/doc/refmanual/sequences.html">MPL Sequence</a>, using the
-pointer qualifications described in <a class="reference" href="#concept-keywordsspec"><span class="concept">KeywordsSpec</span></a> below.  The
-signature is also specifid as an <a class="reference" href="../../../mpl/doc/refmanual/sequences.html">MPL sequence</a> of parameter
-types. Additionally, <tt class="docutils literal"><span class="pre">boost::parameter::python::function</span></tt> and
-<tt class="docutils literal"><span class="pre">boost::parameter::python::def</span></tt> requires a class with forwarding
+<!-- The keyword tags are specified as an `MPL Sequence`_, using the
+pointer qualifications described in |ParameterSpec|_ below.  The
+signature is also specifid as an `MPL sequence`_ of parameter
+types. Additionally, ``boost::parameter::python::function`` and
+``boost::parameter::python::def`` requires a class with forwarding
 overloads. We will take a closer look at how this is done in the
-tutorial section below.</p>
+tutorial section below. -->
+<p>The keyword tags and associated argument types are specified as an <a class="reference" href="../../../mpl/doc/refmanual/sequences.html">MPL
+Sequence</a>, using the function type syntax described in <a class="reference" href="#concept-parameterspec"><span class="concept">ParameterSpec</span></a>
+below. Additionally, <tt class="docutils literal"><span class="pre">boost::parameter::python::function</span></tt> and
+<tt class="docutils literal"><span class="pre">boost::parameter::python::def</span></tt> requires a class with forwarding overloads.
+We will take a closer look at how this is done in the tutorial section below.</p>
 <!-- The last two sentences are terribly vague.  Which namespace is -->
 <!-- ``function`` in?  Isn't the return type always needed?  What -->
 <!-- else are we going to do other than pass these sequences to -->
 <!-- function? -->
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id8" id="tutorial" name="tutorial">Tutorial</a></h1>
+<h1><a class="toc-backref" href="#id9" id="tutorial" name="tutorial">Tutorial</a></h1>
 <p>In this section we will outline the steps needed to bind a simple
 Boost.Parameter-enabled member function to Python. Knowledge of the
 Boost.Parameter <a class="reference" href="index.html">macros</a> are required to understand this section.</p>
@@ -77,6 +91,7 @@
 #include &lt;boost/parameter/keyword.hpp&gt;
 #include &lt;boost/parameter/preprocessor.hpp&gt;
 #include &lt;boost/parameter/python.hpp&gt;
+#include &lt;boost/python.hpp&gt;
 
 // First the keywords
 BOOST_PARAMETER_KEYWORD(tag, title)
@@ -85,7 +100,7 @@
 
 class window
 {
- public:
+public:
     BOOST_PARAMETER_MEMBER_FUNCTION(
       (void), open, tag,
       (required (title, (std::string)))
@@ -93,14 +108,20 @@
                 (height, (unsigned), 400))
     )
     {
-        …
+        <em>… function implementation …</em>
     }
 };
 </pre>
+<!-- @example.prepend('#include <cassert>') -->
+<!-- @example.replace_emphasis('''
+assert(title == "foo");
+assert(height == 20);
+assert(width == 400);
+''') -->
 <p>It defines a set of overloaded member functions called <tt class="docutils literal"><span class="pre">open</span></tt> with one
 required parameter and two optional ones. To bind this member function to
 Python we use the binding utility <tt class="docutils literal"><span class="pre">boost::parameter::python::function</span></tt>.
-<tt class="docutils literal"><span class="pre">boost::parameter::python::function</span></tt> is a <a class="reference" href="../../../python/doc/v2/def_visitor.html">def_visitor</a> that we'll instantiate
+<tt class="docutils literal"><span class="pre">boost::parameter::python::function</span></tt> is a <a class="reference" href="../../../python/doc/v2/def_visitor.html"><tt class="docutils literal"><span class="pre">def_visitor</span></tt></a> that we'll instantiate
 and pass to <tt class="docutils literal"><span class="pre">boost::python::class_::def()</span></tt>.</p>
 <p>To use <tt class="docutils literal"><span class="pre">boost::parameter::python::function</span></tt> we first need to define
 a class with forwarding overloads.</p>
@@ -109,7 +130,8 @@
 {
     template &lt;class A0, class A1, class A2&gt;
     void operator()(
-        boost::type&lt;void&gt;, window&amp; self, A0 const&amp; a0, A1 const&amp; a1, A2 const&amp; a2
+        boost::type&lt;void&gt;, window&amp; self
+      , A0 const&amp; a0, A1 const&amp; a1, A2 const&amp; a2
     )
     {
         self.open(a0, a1, a2);
@@ -136,13 +158,18 @@
 {
     using namespace boost::python;
     namespace py = boost::parameter::python;
+    namespace mpl = boost::mpl;
 
     class_&lt;window&gt;(&quot;window&quot;)
         .def(
             &quot;open&quot;, py::function&lt;
                 open_fwd
-              , mpl::vector&lt;tag::title, tag::width*, tag::height*&gt;
-              , mpl::vector&lt;void, std::string, unsigned, unsigned&gt;
+              , mpl::vector&lt;
+                    void
+                  , tag::title(std::string)
+                  , tag::width*(unsigned)
+                  , tag::height*(unsigned)
+                &gt;
             &gt;()
         );
 }
@@ -155,19 +182,25 @@
   , input = '/boost/python//boost_python'
   , howmany = 'all'
 ) -->
-<!-- @del jam_prefix[-1:] -->
-<p><tt class="docutils literal"><span class="pre">py::function</span></tt> is passed three parameters. The first one is the class
-with forwarding overloads that we defined earlier. The second one is
-an <a class="reference" href="../../../mpl/doc/refmanual/sequences.html">MPL Sequence</a> with the keyword tag types for the function. The
+<!-- @del jam_prefix[:] -->
+<p><tt class="docutils literal"><span class="pre">py::function</span></tt> is passed two parameters. The first one is the class with
+forwarding overloads that we defined earlier. The second one is an <a class="reference" href="../../../mpl/doc/refmanual/sequences.html">MPL
+Sequence</a> with the keyword tag types and argument types for the function
+specified as function types. The pointer syntax used in <tt class="docutils literal"><span class="pre">tag::width*</span></tt> and
+<tt class="docutils literal"><span class="pre">tag::height*</span></tt> means that the parameter is optional. The first element of
+the <a class="reference" href="../../../mpl/doc/refmanual/sequences.html">MPL Sequence</a> is the return type of the function, in this case <tt class="docutils literal"><span class="pre">void</span></tt>.</p>
+<!-- The
 pointer syntax means that the parameter is optional, so in this case
-<tt class="docutils literal"><span class="pre">width</span></tt> and <tt class="docutils literal"><span class="pre">height</span></tt> are optional parameters. The third parameter
-is an <a class="reference" href="../../../mpl/doc/refmanual/sequences.html">MPL Sequence</a> with the desired function signature. The return type comes first, and
-then the parameter types:</p>
-<pre class="literal-block">
-mpl::vector&lt;void,        std::string, unsigned, unsigned&gt;
-            <em>return type</em>  <em>title</em>        <em>width</em>     <em>height</em>
-</pre>
-<!-- @ignore() -->
+``width`` and ``height`` are optional parameters. The third parameter
+is an `MPL Sequence`_ with the desired function signature. The return type comes first, and
+then the parameter types:
+
+.. parsed-literal::
+
+    mpl::vector<void,        std::string, unsigned, unsigned>
+                *return type*  *title*        *width*     *height*
+
+.. @ignore() -->
 <p>That's it! This class can now be used in Python with the expected syntax:</p>
 <pre class="literal-block">
 &gt;&gt;&gt; w = my_module.window()
@@ -207,49 +240,79 @@
 </div>
 <hr class="docutils" />
 <div class="section">
-<h1><a class="toc-backref" href="#id9" id="concept-keywordsspec" name="concept-keywordsspec">concept <span class="concept">KeywordsSpec</span></a></h1>
-<p>A <span class="concept">KeywordsSpec</span> is an <a class="reference" href="../../../mpl/doc/refmanual/sequences.html">MPL sequence</a> where each element is either:</p>
+<h1><a class="toc-backref" href="#id10" id="concept-parameterspec" name="concept-parameterspec">concept <span class="concept">ParameterSpec</span></a></h1>
+<p>A <span class="concept">ParameterSpec</span> is a function type <tt class="docutils literal"><span class="pre">K(T)</span></tt> that describes both the keyword tag,
+<tt class="docutils literal"><span class="pre">K</span></tt>, and the argument type, <tt class="docutils literal"><span class="pre">T</span></tt>, for a parameter.</p>
+<p><tt class="docutils literal"><span class="pre">K</span></tt> is either:</p>
 <ul class="simple">
-<li>A <em>required</em> keyword of the form <tt class="docutils literal"><span class="pre">K</span></tt></li>
-<li><strong>or</strong>, an <em>optional</em> keyword of the form <tt class="docutils literal"><span class="pre">K*</span></tt></li>
-<li><strong>or</strong>, a <em>special</em> keyword of the form <tt class="docutils literal"><span class="pre">K**</span></tt></li>
+<li>A <em>required</em> keyword of the form <tt class="docutils literal"><span class="pre">Tag</span></tt></li>
+<li><strong>or</strong>, an <em>optional</em> keyword of the form <tt class="docutils literal"><span class="pre">Tag*</span></tt></li>
+<li><strong>or</strong>, a <em>special</em> keyword of the form <tt class="docutils literal"><span class="pre">Tag**</span></tt></li>
 </ul>
-<p>where <tt class="docutils literal"><span class="pre">K</span></tt> is a keyword tag type, as used in a specialization
-of boost::parameter::<a class="reference" href="../../../parameter/doc/html/reference.html#keyword">keyword</a>.</p>
-<p>The <strong>arity range</strong> of a <span class="concept">KeywordsSpec</span> is defined as the closed
-range:</p>
+<p>where <tt class="docutils literal"><span class="pre">Tag</span></tt> is a keyword tag type, as used in a specialization
+of <a class="reference" href="../../../parameter/doc/html/reference.html#keyword"><tt class="docutils literal"><span class="pre">boost::parameter::keyword</span></tt></a>.</p>
+<p>The <strong>arity range</strong> for an <a class="reference" href="../../../mpl/doc/refmanual/sequences.html">MPL Sequence</a> of <span class="concept">ParameterSpec</span>'s is
+defined as the closed range:</p>
 <pre class="literal-block">
-[ mpl::size&lt;S&gt; - number of <em>special</em> keyword tags in <tt class="docutils literal"><span class="pre">S</span></tt> , mpl::size&lt;S&gt; ]
+[ mpl::size&lt;S&gt; - number of <em>special</em> keyword tags in <tt class="docutils literal"><span class="pre">S</span></tt>, mpl::size&lt;S&gt; ]
 </pre>
-<p>For example, the <strong>arity range</strong> of <tt class="docutils literal"><span class="pre">mpl::vector2&lt;x,y&gt;</span></tt> is [2,2], the <strong>arity range</strong> of
-<tt class="docutils literal"><span class="pre">mpl::vector2&lt;x,y*&gt;</span></tt> is [2,2] and the <strong>arity range</strong> of <tt class="docutils literal"><span class="pre">mpl::vector2&lt;x,y**&gt;</span></tt> is [1,2].</p>
-<!-- Don't optional keywords affect the arity range? -->
+<p>For example, the <strong>arity range</strong> of <tt class="docutils literal"><span class="pre">mpl::vector2&lt;x(int),y(int)&gt;</span></tt> is <tt class="docutils literal"><span class="pre">[2,2]</span></tt>,
+the <strong>arity range</strong> of <tt class="docutils literal"><span class="pre">mpl::vector2&lt;x(int),y*(int)&gt;</span></tt> is <tt class="docutils literal"><span class="pre">[2,2]</span></tt> and the
+<strong>arity range</strong> of <tt class="docutils literal"><span class="pre">mpl::vector2&lt;x(int),y**(int)&gt;</span></tt> is <tt class="docutils literal"><span class="pre">[1,2]</span></tt>.</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id10" id="special-keywords" name="special-keywords"><em>special</em> keywords</a></h1>
+<h1><a class="toc-backref" href="#id11" id="special-keywords" name="special-keywords"><em>special</em> keywords</a></h1>
 <p>Sometimes it is desirable to have a default value for a parameter that differ
 in type from the parameter. This technique is useful for doing simple tag-dispatching
 based on the presence of a parameter. An <a class="reference" href="index.html#dispatching-based-on-the-presence-of-a-default">example</a> of this is given in the Boost.Parameter
 docs. The example uses a different technique, but could also have been written like this:</p>
 <pre class="literal-block">
-template &lt;class ArgumentPack&gt;
-void dfs_dispatch(ArgumentPack&amp; args, mpl::false_)
+namespace core
 {
-    <em>…compute and use default color map…</em>
-}
+  template &lt;class ArgumentPack&gt;
+  void dfs_dispatch(ArgumentPack const&amp; args, mpl::false_)
+  {
+      <em>…compute and use default color map…</em>
+  }
 
-template &lt;class ArgumentPack, class ColorMap&gt;
-void dfs_dispatch(ArgumentPack&amp; args, ColorMap colormap)
-{
-    <em>…use colormap…</em>
+  template &lt;class ArgumentPack, class ColorMap&gt;
+  void dfs_dispatch(ArgumentPack const&amp; args, ColorMap colormap)
+  {
+      <em>…use colormap…</em>
+  }
 }
 
 template &lt;class ArgumentPack&gt;
-void depth_first_search(ArgumentPack&amp; args)
+void depth_first_search(ArgumentPack const&amp; args)
 {
     core::dfs_dispatch(args, args[color | mpl::false_()]);
 }
 </pre>
+<!-- @example.prepend('''
+#include <boost/parameter/keyword.hpp>
+#include <boost/parameter/parameters.hpp>
+#include <boost/mpl/bool.hpp>
+#include <cassert>
+
+BOOST_PARAMETER_KEYWORD(tag, color);
+
+typedef boost::parameter::parameters<tag::color> params;
+
+namespace mpl = boost::mpl;
+''') -->
+<!-- @example.replace_emphasis('''
+assert(args[color | 1] == 1);
+''') -->
+<!-- @example.replace_emphasis('''
+assert(args[color | 1] == 0);
+''') -->
+<!-- @example.append('''
+int main()
+{
+    depth_first_search(params()());
+    depth_first_search(params()(color = 0));
+}''') -->
+<!-- @build() -->
 <p>In the above example the type of the default for <tt class="docutils literal"><span class="pre">color</span></tt> is <tt class="docutils literal"><span class="pre">mpl::false_</span></tt>, a
 type that is distinct from any color map that the user might supply.</p>
 <p>When binding the case outlined above, the default type for <tt class="docutils literal"><span class="pre">color</span></tt> will not
@@ -258,32 +321,34 @@
 that it needs to generate two overloads, one with the <tt class="docutils literal"><span class="pre">color</span></tt> parameter
 present and one without. Had there been two <em>special</em> keywords, four
 overloads would need to be generated. The number of generated overloads is
-equal to <tt class="docutils literal"><span class="pre">2^N</span></tt>, where <tt class="docutils literal"><span class="pre">N</span></tt> is the number of <em>special</em> keywords.</p>
+equal to 2<sup>N</sup>, where <tt class="docutils literal"><span class="pre">N</span></tt> is the number of <em>special</em> keywords.</p>
 </div>
 <hr class="docutils" />
 <div class="section">
-<h1><a class="toc-backref" href="#id11" id="class-template-init" name="class-template-init">class template <tt class="docutils literal"><span class="pre">init</span></tt></a></h1>
+<h1><a class="toc-backref" href="#id12" id="class-template-init" name="class-template-init">class template <tt class="docutils literal"><span class="pre">init</span></tt></a></h1>
 <p>Defines a named parameter enabled constructor.</p>
 <pre class="literal-block">
-template &lt;class Keywords, class Signature&gt;
-struct init : python::def_visitor&lt;init&lt;Keywords, Signature&gt; &gt;
+template &lt;class ParameterSpecs&gt;
+struct init : python::def_visitor&lt;init&lt;ParameterSpecs&gt; &gt;
 {
     template &lt;class Class&gt;
     void def(Class&amp; class_);
+
+    template &lt;class CallPolicies&gt;
+    <em>def_visitor</em> operator[](CallPolicies const&amp; policies) const;
 };
 </pre>
+<!-- @ignore() -->
 <div class="section">
 <h2><a id="init-requirements" name="init-requirements"><tt class="docutils literal"><span class="pre">init</span></tt> requirements</a></h2>
 <ul>
-<li><p class="first"><tt class="docutils literal"><span class="pre">Keywords</span></tt> is a model of <span class="concept">KeywordsSpec</span>.</p>
+<li><p class="first"><tt class="docutils literal"><span class="pre">ParameterSpecs</span></tt> is an <a class="reference" href="../../../mpl/doc/refmanual/sequences.html">MPL sequence</a> where each element is a
+model of <span class="concept">ParameterSpec</span>.</p>
 </li>
-<li><p class="first"><tt class="docutils literal"><span class="pre">Signature</span></tt> is an MPL sequence of parameter types,
-in the order dictated by <tt class="docutils literal"><span class="pre">Keywords</span></tt>.</p>
-</li>
 <li><p class="first">For every <tt class="docutils literal"><span class="pre">N</span></tt> in <tt class="docutils literal"><span class="pre">[U,V]</span></tt>, where <tt class="docutils literal"><span class="pre">[U,V]</span></tt> is the <strong>arity
-range</strong> of <tt class="docutils literal"><span class="pre">Keywords</span></tt>, <tt class="docutils literal"><span class="pre">Class</span></tt> must support these
+range</strong> of <tt class="docutils literal"><span class="pre">ParameterSpecs</span></tt>, <tt class="docutils literal"><span class="pre">Class</span></tt> must support these
 expressions:</p>
-<table border="1" class="docutils">
+<table border="1" class="docutils table">
 <colgroup>
 <col width="30%" />
 <col width="17%" />
@@ -299,70 +364,107 @@
 </tr>
 </thead>
 <tbody valign="top">
-<tr><td><p class="first last"><tt class="docutils literal"><span class="pre">Class(a0,</span> <span class="pre">...,</span> <span class="pre">aN)</span></tt></p>
+<tr><td><p class="first last"><tt class="docutils literal"><span class="pre">Class(a0,</span> <span class="pre">…,</span> <span class="pre">aN)</span></tt></p>
 </td>
 <td><p class="first last">-</p>
 </td>
-<td><p class="first last"><tt class="docutils literal"><span class="pre">a0</span></tt>..<tt class="docutils literal"><span class="pre">aN</span></tt> are tagged arguments.</p>
+<td><p class="first last"><tt class="docutils literal"><span class="pre">a0</span></tt>…<tt class="docutils literal"><span class="pre">aN</span></tt> are tagged arguments.</p>
 </td>
 </tr>
 </tbody>
 </table>
 </li>
 </ul>
-<!-- Limit the width of these table cells.  Some rst backend -->
-<!-- processors actually produce different results depending on the -->
-<!-- distribution of width. -->
 </div>
 <div class="section">
+<h2><a id="template-class-callpolicies-operator-callpolicies-const" name="template-class-callpolicies-operator-callpolicies-const"><tt class="docutils literal"><span class="pre">template</span> <span class="pre">&lt;class</span> <span class="pre">CallPolicies&gt;</span> <span class="pre">operator[](CallPolicies</span> <span class="pre">const&amp;)</span></tt></a></h2>
+<p>Returns a <tt class="docutils literal"><span class="pre">def_visitor</span></tt> equivalent to <tt class="docutils literal"><span class="pre">*this</span></tt>, except that it
+uses CallPolicies when creating the binding.</p>
+</div>
+<div class="section">
 <h2><a id="id3" name="id3">Example</a></h2>
 <pre class="literal-block">
-struct base { /* ... */ };
+#include &lt;boost/parameter/keyword.hpp&gt;
+#include &lt;boost/parameter/preprocessor.hpp&gt;
+#include &lt;boost/parameter/python.hpp&gt;
+#include &lt;boost/python.hpp&gt;
+#include &lt;boost/mpl/vector.hpp&gt;
 
+BOOST_PARAMETER_KEYWORD(tag, x)
+BOOST_PARAMETER_KEYWORD(tag, y)
+
+struct base
+{
+    template &lt;class ArgumentPack&gt;
+    base(ArgumentPack const&amp; args)
+    {
+        <em>… use args …</em>
+    }
+};
+
 class X : base
 {
 public:
-    BOOST_PARAMETER_CONSTRUCTOR(X, (base),
+    BOOST_PARAMETER_CONSTRUCTOR(X, (base), tag,
         (required (x, *))
         (optional (y, *))
     )
 };
 
-BOOST_PYTHON_MODULE(..)
+BOOST_PYTHON_MODULE(<em>module name</em>)
 {
-    class_&lt;X&gt;(&quot;X&quot;)
+    using namespace boost::python;
+    namespace py = boost::parameter::python;
+    namespace mpl = boost::mpl;
+
+    class_&lt;X&gt;(&quot;X&quot;, no_init)
         .def(
-            init&lt;
-              , mpl::vector2&lt;<a class="reference" href="tag::x">tag::x</a>, <a class="reference" href="tag::y*">tag::y*</a>&gt;
-              , mpl::vector2&lt;int, int&gt;
+            py::init&lt;
+                mpl::vector&lt;tag::x(int), tag::y*(int)&gt;
             &gt;()
         );
 }
 </pre>
+<!-- @example.replace_emphasis('''
+assert(args[x] == 0);
+assert(args[y | 1] == 1);
+''') -->
+<!-- @example.replace_emphasis('my_module') -->
+<!-- @jam_prefix.append('import python ;') -->
+<!-- @jam_prefix.append('stage . : my_module /boost/python//boost_python ;') -->
+<!-- @my_module = build(
+    output = 'my_module'
+  , target_rule = 'python-extension'
+  , input = '/boost/python//boost_python'
+) -->
 </div>
 </div>
 <hr class="docutils" />
 <div class="section">
-<h1><a class="toc-backref" href="#id12" id="class-template-call" name="class-template-call">class template <tt class="docutils literal"><span class="pre">call</span></tt></a></h1>
+<h1><a class="toc-backref" href="#id13" id="class-template-call" name="class-template-call">class template <tt class="docutils literal"><span class="pre">call</span></tt></a></h1>
 <p>Defines a <tt class="docutils literal"><span class="pre">__call__</span></tt> operator, mapped to <tt class="docutils literal"><span class="pre">operator()</span></tt> in C++.</p>
 <pre class="literal-block">
-template &lt;class Keywords, class Signature&gt;
-struct call : python::def_visitor&lt;call&lt;Keywords, Signature&gt; &gt;
+template &lt;class ParameterSpecs&gt;
+struct call : python::def_visitor&lt;call&lt;ParameterSpecs&gt; &gt;
 {
     template &lt;class Class&gt;
     void def(Class&amp; class_);
+
+    template &lt;class CallPolicies&gt;
+    <em>def_visitor</em> operator[](CallPolicies const&amp; policies) const;
 };
 </pre>
+<!-- @ignore() -->
 <div class="section">
 <h2><a id="call-requirements" name="call-requirements"><tt class="docutils literal"><span class="pre">call</span></tt> requirements</a></h2>
 <ul>
-<li><p class="first"><tt class="docutils literal"><span class="pre">Keywords</span></tt> is a model of <span class="concept">KeywordsSpec</span>.</p>
+<li><p class="first"><tt class="docutils literal"><span class="pre">ParameterSpecs</span></tt> is an <a class="reference" href="../../../mpl/doc/refmanual/sequences.html">MPL sequence</a> where each element
+except the first models <span class="concept">ParameterSpec</span>. The first element
+is the result type of <tt class="docutils literal"><span class="pre">c(…)</span></tt>.</p>
 </li>
-<li><p class="first"><tt class="docutils literal"><span class="pre">Signature</span></tt> is an MPL sequence with the types of the keyword parameters,
-in the order dictated by <tt class="docutils literal"><span class="pre">Keywords</span></tt>, and the return type prepended.</p>
-</li>
-<li><p class="first"><tt class="docutils literal"><span class="pre">Class</span></tt> must support these expressions, where <tt class="docutils literal"><span class="pre">c</span></tt> is an instance of <tt class="docutils literal"><span class="pre">Class</span></tt>:</p>
-<table border="1" class="docutils">
+<li><p class="first"><tt class="docutils literal"><span class="pre">Class</span></tt> must support these expressions, where <tt class="docutils literal"><span class="pre">c</span></tt> is an
+instance of <tt class="docutils literal"><span class="pre">Class</span></tt>:</p>
+<table border="1" class="docutils table">
 <colgroup>
 <col width="24%" />
 <col width="26%" />
@@ -378,34 +480,50 @@
 </tr>
 </thead>
 <tbody valign="top">
-<tr><td><p class="first last"><tt class="docutils literal"><span class="pre">c(a0,</span> <span class="pre">...,</span> <span class="pre">aN)</span></tt></p>
+<tr><td><p class="first last"><tt class="docutils literal"><span class="pre">c(a0,</span> <span class="pre">…,</span> <span class="pre">aN)</span></tt></p>
 </td>
 <td><p class="first last">Convertible to <tt class="docutils literal"><span class="pre">R</span></tt></p>
 </td>
-<td><p class="first last"><tt class="docutils literal"><span class="pre">a0</span></tt>..<tt class="docutils literal"><span class="pre">aN</span></tt> are tagged arguments.</p>
+<td><p class="first last"><tt class="docutils literal"><span class="pre">a0</span></tt>…<tt class="docutils literal"><span class="pre">aN</span></tt> are tagged arguments.</p>
 </td>
 </tr>
 </tbody>
 </table>
-<p>For every <tt class="docutils literal"><span class="pre">N</span></tt> in <tt class="docutils literal"><span class="pre">[U,V]</span></tt>, where <tt class="docutils literal"><span class="pre">[U,V]</span></tt> is the <strong>arity range</strong> of <tt class="docutils literal"><span class="pre">Keywords</span></tt>.</p>
+<p>For every <tt class="docutils literal"><span class="pre">N</span></tt> in <tt class="docutils literal"><span class="pre">[U,V]</span></tt>, where <tt class="docutils literal"><span class="pre">[U,V]</span></tt> is the <strong>arity range</strong> of <tt class="docutils literal"><span class="pre">ParameterSpecs</span></tt>.</p>
 </li>
 </ul>
 </div>
 <div class="section">
-<h2><a id="id4" name="id4">Example</a></h2>
+<h2><a id="id4" name="id4"><tt class="docutils literal"><span class="pre">template</span> <span class="pre">&lt;class</span> <span class="pre">CallPolicies&gt;</span> <span class="pre">operator[](CallPolicies</span> <span class="pre">const&amp;)</span></tt></a></h2>
+<p>Returns a <tt class="docutils literal"><span class="pre">def_visitor</span></tt> equivalent to <tt class="docutils literal"><span class="pre">*this</span></tt>, except that it
+uses CallPolicies when creating the binding.</p>
+</div>
+<div class="section">
+<h2><a id="id5" name="id5">Example</a></h2>
 <pre class="literal-block">
+#include &lt;boost/parameter/keyword.hpp&gt;
+#include &lt;boost/parameter/preprocessor.hpp&gt;
+#include &lt;boost/parameter/python.hpp&gt;
+#include &lt;boost/python.hpp&gt;
+#include &lt;boost/mpl/vector.hpp&gt;
+
+BOOST_PARAMETER_KEYWORD(tag, x)
+BOOST_PARAMETER_KEYWORD(tag, y)
+
+namespace parameter = boost::parameter;
+
 typedef parameter::parameters&lt;
-    parameter::required&lt;<a class="reference" href="tag::x">tag::x</a>&gt;
-  , parameter::optional&lt;<a class="reference" href="tag::y">tag::y</a>&gt;
+    parameter::required&lt;tag::x&gt;
+  , parameter::optional&lt;tag::y&gt;
 &gt; call_parameters;
 
 class X
 {
 public:
-    template &lt;class Args&gt;
-    int call_impl(Args const&amp; args)
+    template &lt;class ArgumentPack&gt;
+    int call_impl(ArgumentPack const&amp; args)
     {
-        /* ... */
+        <em>… use args …</em>
     }
 
     template &lt;class A0&gt;
@@ -421,45 +539,60 @@
     }
 };
 
-BOOST_PYTHON_MODULE(..)
+BOOST_PYTHON_MODULE(<em>module name</em>)
 {
+    using namespace boost::python;
+    namespace py = parameter::python;
+    namespace mpl = boost::mpl;
+
     class_&lt;X&gt;(&quot;X&quot;)
-        .def(&quot;f&quot;,
-            call&lt;
-              , mpl::vector2&lt;<a class="reference" href="tag::x">tag::x</a>, <a class="reference" href="tag::y*">tag::y*</a>&gt;
-              , mpl::vector3&lt;int, int, int&gt;
+        .def(
+            py::call&lt;
+                mpl::vector&lt;int, tag::x(int), tag::y*(int)&gt;
             &gt;()
         );
 }
 </pre>
+<!-- @example.replace_emphasis('''
+assert(args[x] == 0);
+assert(args[y | 1] == 1);
+return 0;
+''') -->
+<!-- @example.replace_emphasis('my_module') -->
+<!-- @my_module = build(
+    output = 'my_module'
+  , target_rule = 'python-extension'
+  , input = '/boost/python//boost_python'
+) -->
 </div>
 </div>
 <hr class="docutils" />
 <div class="section">
-<h1><a class="toc-backref" href="#id13" id="class-template-function" name="class-template-function">class template <tt class="docutils literal"><span class="pre">function</span></tt></a></h1>
+<h1><a class="toc-backref" href="#id14" id="class-template-function" name="class-template-function">class template <tt class="docutils literal"><span class="pre">function</span></tt></a></h1>
 <p>Defines a named parameter enabled member function.</p>
 <pre class="literal-block">
-template &lt;class Fwd, class Keywords, class Signature&gt;
-struct function : python::def_visitor&lt;function&lt;Fwd, Keywords, Signature&gt; &gt;
+template &lt;class Fwd, class ParameterSpecs&gt;
+struct function : python::def_visitor&lt;function&lt;Fwd, ParameterSpecs&gt; &gt;
 {
     template &lt;class Class, class Options&gt;
     void def(Class&amp; class_, char const* name, Options const&amp; options);
 };
 </pre>
+<!-- @ignore() -->
 <div class="section">
 <h2><a id="function-requirements" name="function-requirements"><tt class="docutils literal"><span class="pre">function</span></tt> requirements</a></h2>
 <ul>
-<li><p class="first"><tt class="docutils literal"><span class="pre">Keywords</span></tt> is a model of <span class="concept">KeywordsSpec</span>.</p>
+<li><p class="first"><tt class="docutils literal"><span class="pre">ParameterSpecs</span></tt> is an <a class="reference" href="../../../mpl/doc/refmanual/sequences.html">MPL sequence</a> where each element
+except the first models <span class="concept">ParameterSpec</span>. The first element
+is the result type of <tt class="docutils literal"><span class="pre">c.f(…)</span></tt>, where <tt class="docutils literal"><span class="pre">f</span></tt> is the member
+function.</p>
 </li>
-<li><p class="first"><tt class="docutils literal"><span class="pre">Signature</span></tt> is an MPL sequence with the types of the keyword parameters,
-in the order dictated by <tt class="docutils literal"><span class="pre">Keywords</span></tt>, and the return type prepended.</p>
-</li>
 <li><p class="first">An instance of <tt class="docutils literal"><span class="pre">Fwd</span></tt> must support this expression:</p>
-<table border="1" class="docutils">
+<table border="1" class="docutils table">
 <colgroup>
-<col width="40%" />
+<col width="39%" />
 <col width="18%" />
-<col width="42%" />
+<col width="43%" />
 </colgroup>
 <thead valign="bottom">
 <tr><th class="head"><p class="first last">Expression</p>
@@ -476,31 +609,40 @@
 <td><p class="first last">Convertible to <tt class="docutils literal"><span class="pre">R</span></tt></p>
 </td>
 <td><p class="first last"><tt class="docutils literal"><span class="pre">self</span></tt> is a reference to the object on which
-the function should be invoked. <tt class="docutils literal"><span class="pre">a0``…``aN</span></tt>
+the function should be invoked. <tt class="docutils literal"><span class="pre">a0</span></tt>…<tt class="docutils literal"><span class="pre">aN</span></tt>
 are tagged arguments.</p>
 </td>
 </tr>
 </tbody>
 </table>
-<p>For every <tt class="docutils literal"><span class="pre">N</span></tt> in <tt class="docutils literal"><span class="pre">[U,V]</span></tt>, where <tt class="docutils literal"><span class="pre">[U,V]</span></tt> is the <strong>arity range</strong> of <tt class="docutils literal"><span class="pre">Keywords</span></tt>.</p>
+<p>For every <tt class="docutils literal"><span class="pre">N</span></tt> in <tt class="docutils literal"><span class="pre">[U,V]</span></tt>, where <tt class="docutils literal"><span class="pre">[U,V]</span></tt> is the <strong>arity range</strong> of <tt class="docutils literal"><span class="pre">ParameterSpecs</span></tt>.</p>
 </li>
 </ul>
 </div>
 <div class="section">
-<h2><a id="id5" name="id5">Example</a></h2>
-<p>This example exports a member function <tt class="docutils literal"><span class="pre">f(int</span> <span class="pre">x,</span> <span class="pre">int</span> <span class="pre">y</span> <span class="pre">=</span> <span class="pre">…)</span></tt> to Python.
-The <span class="concept">KeywordsSpec</span> <tt class="docutils literal"><span class="pre">mpl::vector2&lt;tag::x,</span> <span class="pre">tag::y*&gt;</span></tt> has an <strong>arity range</strong>
-of [2,2], so we only need one forwarding overload.</p>
+<h2><a id="id6" name="id6">Example</a></h2>
+<p>This example exports a member function <tt class="docutils literal"><span class="pre">f(int</span> <span class="pre">x,</span> <span class="pre">int</span> <span class="pre">y</span> <span class="pre">=</span> <span class="pre">…)</span></tt> to Python. The
+sequence of <span class="concept">ParameterSpec</span>'s <tt class="docutils literal"><span class="pre">mpl::vector2&lt;tag::x(int),</span> <span class="pre">tag::y*(int)&gt;</span></tt> has
+an <strong>arity range</strong> of [2,2], so we only need one forwarding overload.</p>
 <pre class="literal-block">
+#include &lt;boost/parameter/keyword.hpp&gt;
+#include &lt;boost/parameter/preprocessor.hpp&gt;
+#include &lt;boost/parameter/python.hpp&gt;
+#include &lt;boost/python.hpp&gt;
+#include &lt;boost/mpl/vector.hpp&gt;
+
+BOOST_PARAMETER_KEYWORD(tag, x)
+BOOST_PARAMETER_KEYWORD(tag, y)
+
 class X
 {
 public:
     BOOST_PARAMETER_MEMBER_FUNCTION((void), f, tag,
         (required (x, *))
-        (optional (y, *))
+        (optional (y, *, 1))
     )
     {
-        /* … */
+        <em>…</em>
     }
 };
 
@@ -513,43 +655,53 @@
     }
 };
 
-BOOST_PYTHON_MODULE(..)
+BOOST_PYTHON_MODULE(<em>module name</em>)
 {
+    using namespace boost::python;
+    namespace py = boost::parameter::python;
+    namespace mpl = boost::mpl;
+
     class_&lt;X&gt;(&quot;X&quot;)
         .def(&quot;f&quot;,
-            function&lt;
+            py::function&lt;
                 f_fwd
-              , mpl::vector2&lt;<a class="reference" href="tag::x">tag::x</a>, <a class="reference" href="tag::y*">tag::y*</a>&gt;
-              , mpl::vector3&lt;void, int, int&gt;
+              , mpl::vector&lt;void, tag::x(int), tag::y*(int)&gt;
             &gt;()
         );
 }
 </pre>
-<!-- This example is not consistent with your definition of arity -->
-<!-- range, above.  There are no special keywords in play here. -->
+<!-- @example.replace_emphasis('''
+assert(x == 0);
+assert(y == 1);
+''') -->
+<!-- @example.replace_emphasis('my_module') -->
+<!-- @my_module = build(
+    output = 'my_module'
+  , target_rule = 'python-extension'
+  , input = '/boost/python//boost_python'
+) -->
 </div>
 </div>
 <hr class="docutils" />
 <div class="section">
-<h1><a class="toc-backref" href="#id14" id="function-template-def" name="function-template-def">function template <tt class="docutils literal"><span class="pre">def</span></tt></a></h1>
+<h1><a class="toc-backref" href="#id15" id="function-template-def" name="function-template-def">function template <tt class="docutils literal"><span class="pre">def</span></tt></a></h1>
 <p>Defines a named parameter enabled free function in the current Python scope.</p>
 <pre class="literal-block">
-template &lt;class Fwd, class Keywords, class Signature&gt;
+template &lt;class Fwd, class ParameterSpecs&gt;
 void def(char const* name);
 </pre>
+<!-- @ignore() -->
 <div class="section">
 <h2><a id="def-requirements" name="def-requirements"><tt class="docutils literal"><span class="pre">def</span></tt> requirements</a></h2>
 <ul>
-<li><p class="first"><tt class="docutils literal"><span class="pre">Keywords</span></tt> is a model of <span class="concept">KeywordsSpec</span>.</p>
+<li><p class="first"><tt class="docutils literal"><span class="pre">ParameterSpecs</span></tt> is an <a class="reference" href="../../../mpl/doc/refmanual/sequences.html">MPL sequence</a> where each element
+except the first models <span class="concept">ParameterSpec</span>. The first element
+is the result type of <tt class="docutils literal"><span class="pre">f(…)</span></tt>, where <tt class="docutils literal"><span class="pre">f</span></tt> is the function.</p>
 </li>
-<li><p class="first"><tt class="docutils literal"><span class="pre">Signature</span></tt> is an MPL sequence of parameters types,
-in the order dictated by <tt class="docutils literal"><span class="pre">Keywords</span></tt>, with the return type
-prepended.</p>
-</li>
 <li><p class="first">An instance of <tt class="docutils literal"><span class="pre">Fwd</span></tt> must support this expression:</p>
-<table border="1" class="docutils">
+<table border="1" class="docutils table">
 <colgroup>
-<col width="40%" />
+<col width="39%" />
 <col width="21%" />
 <col width="40%" />
 </colgroup>
@@ -567,27 +719,27 @@
 </td>
 <td><p class="first last">Convertible to <tt class="docutils literal"><span class="pre">R</span></tt></p>
 </td>
-<td><p class="first last"><tt class="docutils literal"><span class="pre">a0``…``aN</span></tt> are tagged arguments.</p>
+<td><p class="first last"><tt class="docutils literal"><span class="pre">a0</span></tt>…<tt class="docutils literal"><span class="pre">aN</span></tt> are tagged arguments.</p>
 </td>
 </tr>
 </tbody>
 </table>
-<p>For every <tt class="docutils literal"><span class="pre">N</span></tt> in <tt class="docutils literal"><span class="pre">[U,V]</span></tt>, where <tt class="docutils literal"><span class="pre">[U,V]</span></tt> is the <strong>arity range</strong> of <tt class="docutils literal"><span class="pre">Keywords</span></tt>.</p>
+<p>For every <tt class="docutils literal"><span class="pre">N</span></tt> in <tt class="docutils literal"><span class="pre">[U,V]</span></tt>, where <tt class="docutils literal"><span class="pre">[U,V]</span></tt> is the <strong>arity range</strong> of <tt class="docutils literal"><span class="pre">ParameterSpecs</span></tt>.</p>
 </li>
 </ul>
 </div>
 <div class="section">
-<h2><a id="id6" name="id6">Example</a></h2>
-<p>This example exports a function <tt class="docutils literal"><span class="pre">f(int</span> <span class="pre">x,</span> <span class="pre">int</span> <span class="pre">y</span> <span class="pre">=</span> <span class="pre">…)</span></tt> to Python.
-The <span class="concept">KeywordsSpec</span> <tt class="docutils literal"><span class="pre">mpl::vector2&lt;tag::x,</span> <span class="pre">tag::y*&gt;</span></tt> has an <strong>arity range</strong>
-of [2,2], so we only need one forwarding overload.</p>
+<h2><a id="id7" name="id7">Example</a></h2>
+<p>This example exports a function <tt class="docutils literal"><span class="pre">f(int</span> <span class="pre">x,</span> <span class="pre">int</span> <span class="pre">y</span> <span class="pre">=</span> <span class="pre">…)</span></tt> to Python. The
+sequence of <span class="concept">ParameterSpec</span>'s <tt class="docutils literal"><span class="pre">mpl::vector2&lt;tag::x(int),</span> <span class="pre">tag::y*(int)&gt;</span></tt> has
+an <strong>arity range</strong> of [2,2], so we only need one forwarding overload.</p>
 <pre class="literal-block">
 BOOST_PARAMETER_FUNCTION((void), f, tag,
     (required (x, *))
-    (optional (y, *))
+    (optional (y, *, 1))
 )
 {
-    /* … */
+    <em>…</em>
 }
 
 struct f_fwd
@@ -603,24 +755,25 @@
 {
     def&lt;
         f_fwd
-      , mpl::vector2&lt;<a class="reference" href="tag::x">tag::x</a>, <a class="reference" href="tag::y*">tag::y*</a>&gt;
-      , mpl::vector3&lt;void, int, int&gt;
+      , mpl::vector&lt;
+            void, tag::x(int), tag::y*(int)
+        &gt;
     &gt;(&quot;f&quot;);
 }
 </pre>
+<!-- @ignore() -->
 <!-- again, the undefined ``fwd`` identifier. -->
 </div>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id15" id="portability" name="portability">Portability</a></h1>
-<p>The Boost.Parameter Python binding library requires <em>partial template specialization</em>.</p>
-<!-- Oh.  In that case, we don't have to worry so much about -->
-<!-- compilers that can't parse function types. -->
+<h1><a class="toc-backref" href="#id16" id="portability" name="portability">Portability</a></h1>
+<p>The Boost.Parameter Python binding library requires <em>partial template
+specialization</em>.</p>
 </div>
 </div>
 <div class="footer">
 <hr class="footer" />
-Generated on: 2006-05-18 14:54 UTC.
+Generated on: 2007-01-03 17:02 UTC.
 Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
 
 </div>

Modified: boost/trunk/libs/parameter/doc/html/reference.html
===================================================================
--- boost/trunk/libs/parameter/doc/html/reference.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/doc/html/reference.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,784 +1,914 @@
-<?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.5: http://docutils.sourceforge.net/" />
-<title>The Boost Parameter Library Reference Documentation</title>
-<link rel="stylesheet" href="rst.css" type="text/css" />
-</head>
-<body>
-<div class="document" id="the-boost-parameter-library-reference-documentation">
-<h1 class="title">The Boost Parameter Library Reference Documentation</h1>
-<p><a class="reference" href="../../../../index.htm"><img alt="Boost" src="../../../../boost.png" /></a></p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Authors:</th><td class="field-body">David Abrahams, Daniel Wallin</td>
-</tr>
-<tr class="field"><th class="field-name">Contact:</th><td class="field-body"><a class="reference" href="mailto:dave&#64;boost-consulting.com">dave&#64;boost-consulting.com</a>, <a class="reference" href="mailto:dalwan01&#64;student.umu.se">dalwan01&#64;student.umu.se</a></td>
-</tr>
-<tr class="field"><th class="field-name">organization:</th><td class="field-body"><a class="reference" href="http://www.boost-consulting.com">Boost Consulting</a></td>
-</tr>
-<tr class="field"><th class="field-name">date:</th><td class="field-body">$Date: 2005/07/17 19:53:01 $</td>
-</tr>
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Copyright David Abrahams, Daniel Wallin
-2005. Distributed under the Boost Software License,
-Version 1.0. (See accompanying file LICENSE_1_0.txt
-or copy at <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</td>
-</tr>
-</tbody>
-</table>
-<hr class="docutils" />
-<div class="contents topic">
-<p class="topic-title first"><a id="contents" name="contents">Contents</a></p>
-<ul class="auto-toc simple">
-<li><a class="reference" href="#preliminaries" id="id24" name="id24">1&nbsp;&nbsp;&nbsp;Preliminaries</a><ul class="auto-toc">
-<li><a class="reference" href="#namespaces" id="id25" name="id25">1.1&nbsp;&nbsp;&nbsp;Namespaces</a></li>
-<li><a class="reference" href="#exceptions" id="id26" name="id26">1.2&nbsp;&nbsp;&nbsp;Exceptions</a></li>
-<li><a class="reference" href="#thread-safety" id="id27" name="id27">1.3&nbsp;&nbsp;&nbsp;Thread Safety</a></li>
-<li><a class="reference" href="#typography" id="id28" name="id28">1.4&nbsp;&nbsp;&nbsp;Typography</a></li>
-</ul>
-</li>
-<li><a class="reference" href="#terminology" id="id29" name="id29">2&nbsp;&nbsp;&nbsp;Terminology</a></li>
-<li><a class="reference" href="#concepts" id="id30" name="id30">3&nbsp;&nbsp;&nbsp;Concepts</a><ul class="auto-toc">
-<li><a class="reference" href="#argumentpack" id="id31" name="id31">3.1&nbsp;&nbsp;&nbsp;<span class="concept">ArgumentPack</span></a></li>
-<li><a class="reference" href="#id5" id="id32" name="id32">3.2&nbsp;&nbsp;&nbsp;<span class="concept">ParameterSpec</span></a></li>
-</ul>
-</li>
-<li><a class="reference" href="#class-templates" id="id33" name="id33">4&nbsp;&nbsp;&nbsp;Class Templates</a><ul class="auto-toc">
-<li><a class="reference" href="#id7" id="id34" name="id34">4.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">keyword</span></tt></a></li>
-<li><a class="reference" href="#parameters" id="id35" name="id35">4.2&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">parameters</span></tt></a></li>
-<li><a class="reference" href="#optional-required" id="id36" name="id36">4.3&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">optional</span></tt>, <tt class="docutils literal"><span class="pre">required</span></tt></a></li>
-</ul>
-</li>
-<li><a class="reference" href="#metafunctions" id="id37" name="id37">5&nbsp;&nbsp;&nbsp;Metafunctions</a><ul class="auto-toc">
-<li><a class="reference" href="#binding" id="id38" name="id38">5.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">binding</span></tt></a></li>
-<li><a class="reference" href="#lazy-binding" id="id39" name="id39">5.2&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">lazy_binding</span></tt></a></li>
-</ul>
-</li>
-<li><a class="reference" href="#code-generation-macros" id="id40" name="id40">6&nbsp;&nbsp;&nbsp;Code Generation Macros</a><ul class="auto-toc">
-<li><a class="reference" href="#boost-parameter-fun-r-n-l-h-p" id="id41" name="id41">6.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUN(r,n,l,h,p)</span></tt></a></li>
-<li><a class="reference" href="#boost-parameter-keyword-n-k" id="id42" name="id42">6.2&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_KEYWORD(n,k)</span></tt></a></li>
-<li><a class="reference" href="#boost-parameter-match-p-a-x" id="id43" name="id43">6.3&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_MATCH(p,a,x)</span></tt></a></li>
-</ul>
-</li>
-<li><a class="reference" href="#configuration-macros" id="id44" name="id44">7&nbsp;&nbsp;&nbsp;Configuration Macros</a><ul class="auto-toc">
-<li><a class="reference" href="#boost-parameter-max-arity" id="id45" name="id45">7.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_MAX_ARITY</span></tt></a></li>
-</ul>
-</li>
-<li><a class="reference" href="#tutorial" id="id46" name="id46">8&nbsp;&nbsp;&nbsp;Tutorial</a></li>
-</ul>
-</div>
-<hr class="docutils" />
-<div class="section">
-<h1><a class="toc-backref" href="#id24" id="preliminaries" name="preliminaries">1&nbsp;&nbsp;&nbsp;Preliminaries</a></h1>
-<p>This section covers some basic information you'll need to know in
-order to understand this reference</p>
-<div class="section">
-<h2><a class="toc-backref" href="#id25" id="namespaces" name="namespaces">1.1&nbsp;&nbsp;&nbsp;Namespaces</a></h2>
-<p>In this document, all unqualified identifiers should be assumed to
-be defined in namespace <tt class="docutils literal"><span class="pre">boost::parameter</span></tt> unless otherwise
-specified.</p>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id26" id="exceptions" name="exceptions">1.2&nbsp;&nbsp;&nbsp;Exceptions</a></h2>
-<p>No operation described in this document
-throws an exception unless otherwise specified.</p>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id27" id="thread-safety" name="thread-safety">1.3&nbsp;&nbsp;&nbsp;Thread Safety</a></h2>
-<p>All components of this library can be used safely from multiple
-threads without synchronization.<a class="footnote-reference" href="#thread" id="id2" name="id2"><sup>1</sup></a></p>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id28" id="typography" name="typography">1.4&nbsp;&nbsp;&nbsp;Typography</a></h2>
-<p>Names written in <span class="concept">sans serif type</span> represent <a class="reference" href="../../../../more/generic_programming.html#concept">concepts</a>.</p>
-<p>In code blocks, <em>italic type</em> represents unspecified text that
-satisfies the requirements given in the detailed description that
-follows the code block.</p>
-<p>In a specification of the tokens generated by a macro, <strong>bold
-type</strong> is used to highlight the position of the expanded macro
-argument in the result.</p>
-<p>The special character β represents the value of <a class="reference" href="#boost-parameter-max-arity"><tt class="docutils literal"><span class="pre">BOOST_PARAMETER_MAX_ARITY</span></tt></a>.</p>
-</div>
-</div>
-<hr class="docutils" />
-<div class="section">
-<h1><a class="toc-backref" href="#id29" id="terminology" name="terminology">2&nbsp;&nbsp;&nbsp;Terminology</a></h1>
-<dl class="docutils" id="kw">
-<dt>keyword</dt>
-<dd>The name of a function parameter.</dd>
-</dl>
-<span class="target" id="keyword-tag-type"></span><dl class="docutils">
-<dt>keyword tag type</dt>
-<dd>A type used to uniquely identify a function parameter.  Typically
-its name will be the same as that of the parameter.</dd>
-</dl>
-<span class="target" id="positional"></span><dl class="docutils">
-<dt>positional argument</dt>
-<dd>An argument passed with no explicit keyword.  Its parameter is
-determined in the usual C++ way: by position with respect to a
-parameter list.</dd>
-</dl>
-<span class="target" id="tag-type"></span><dl class="docutils">
-<dt>tag type</dt>
-<dd>Shorthand for “<a class="reference" href="#keyword-tag-type">keyword tag type</a>.”</dd>
-</dl>
-<span class="target" id="keyword-object"></span><dl class="docutils">
-<dt>keyword object</dt>
-<dd>An instance of <a class="reference" href="#keyword"><tt class="docutils literal"><span class="pre">keyword</span></tt></a> <tt class="docutils literal"><span class="pre">&lt;T&gt;</span></tt> for some <a class="reference" href="#tag-type">tag type</a> <tt class="docutils literal"><span class="pre">T</span></tt>.</dd>
-</dl>
-<span class="target" id="tagged-reference"></span><dl class="docutils">
-<dt>tagged reference</dt>
-<dd><p class="first">An object whose type is associated with a <a class="reference" href="#keyword-tag-type">keyword tag type</a> (the
-object's <em>keyword</em>), and that holds a reference (to the object's
-<em>value</em>).</p>
-<p class="last">As a shorthand, a “tagged reference to <tt class="docutils literal"><span class="pre">x</span></tt>” means a tagged
-reference whose <em>value</em> is <tt class="docutils literal"><span class="pre">x</span></tt>.</p>
-</dd>
-</dl>
-<span class="target" id="tagged-default"></span><dl class="docutils">
-<dt>tagged default</dt>
-<dd>A <a class="reference" href="#tagged-reference">tagged reference</a> whose <em>value</em> represents the value of a
-default argument.</dd>
-</dl>
-<span class="target" id="tagged-lazy-default"></span><dl class="docutils">
-<dt>tagged lazy default</dt>
-<dd>A <a class="reference" href="#tagged-reference">tagged reference</a> whose <em>value</em>, when invoked with no
-arguments, computes a default argument value.</dd>
-</dl>
-<span class="target" id="intended-argument-type"></span><dl class="docutils">
-<dt>intended argument type</dt>
-<dd>The <em>intended argument type</em> of a single-element <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> is the
-type of its element's <em>value</em>.  The intended argument type of any other
-type <tt class="docutils literal"><span class="pre">X</span></tt> is <tt class="docutils literal"><span class="pre">X</span></tt> itself.</dd>
-</dl>
-<div class="note">
-<p class="first admonition-title">Note</p>
-<p class="last">In this reference, we will use concept names (and other names)
-to describe both types and objects, depending on context.  So
-for example, “an <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a>” can refer to a type that
-models <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> <em>or</em> an object of such a type.</p>
-</div>
-</div>
-<hr class="docutils" />
-<div class="section">
-<h1><a class="toc-backref" href="#id30" id="concepts" name="concepts">3&nbsp;&nbsp;&nbsp;Concepts</a></h1>
-<p>This section describes the generic type <a class="reference" href="../../../../more/generic_programming.html#concept">concepts</a> used by the Parameter library.</p>
-<div class="section">
-<h2><a class="toc-backref" href="#id31" id="argumentpack" name="argumentpack">3.1&nbsp;&nbsp;&nbsp;<span class="concept">ArgumentPack</span></a></h2>
-<p>An <span class="concept">ArgumentPack</span> is a collection of <a class="reference" href="#tagged-reference">tagged reference</a>s to the
-actual arguments passed to a function.  Every <span class="concept">ArgumentPack</span> is
-also a valid MPL <a class="reference" href="../../../mpl/doc/refmanual/forward-sequence.html"><span class="concept">Forward Sequence</span></a> consisting of the <a class="reference" href="#keyword-tag-type">keyword tag type</a>s in its <a class="reference" href="#tagged-reference">tagged reference</a>s.</p>
-<div class="section">
-<h3><a id="requirements" name="requirements">Requirements</a></h3>
-<p>In the table below,</p>
-<ul class="simple">
-<li><tt class="docutils literal"><span class="pre">A</span></tt> is a model of <span class="concept">ArgumentPack</span></li>
-<li><tt class="docutils literal"><span class="pre">x</span></tt> is an instance of <tt class="docutils literal"><span class="pre">A</span></tt></li>
-<li><tt class="docutils literal"><span class="pre">u</span></tt> is a <a class="reference" href="#keyword-object">keyword object</a> of type <tt class="docutils literal"><span class="pre">K</span></tt></li>
-<li><tt class="docutils literal"><span class="pre">v</span></tt> is a <a class="reference" href="#tagged-default">tagged default</a> with <a class="reference" href="#tag-type">tag type</a> <tt class="docutils literal"><span class="pre">L</span></tt> and <em>value</em> of type <tt class="docutils literal"><span class="pre">D</span></tt></li>
-<li><tt class="docutils literal"><span class="pre">w</span></tt> is a <a class="reference" href="#tagged-lazy-default">tagged lazy default</a> with <a class="reference" href="#tag-type">tag type</a> <tt class="docutils literal"><span class="pre">M</span></tt> and <em>value</em> of type <tt class="docutils literal"><span class="pre">E</span> <span class="pre">const</span></tt></li>
-<li><tt class="docutils literal"><span class="pre">z</span></tt> is an <span class="concept">ArgumentPack</span> containing a single element (as created by <a class="reference" href="#keyword"><tt class="docutils literal"><span class="pre">keyword</span></tt></a><tt class="docutils literal"><span class="pre">&lt;…&gt;::operator=</span></tt>)</li>
-</ul>
-<p>Any exceptions are thrown from the invocation of <tt class="docutils literal"><span class="pre">w</span></tt>'s <em>value</em>
-will be propagated to the caller.</p>
-<table border="1" class="docutils">
-<caption><span class="concept">ArgumentPack</span> requirements</caption>
-<colgroup>
-<col width="11%" />
-<col width="31%" />
-<col width="19%" />
-<col width="40%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th class="head">Expression</th>
-<th class="head">Type</th>
-<th class="head">Requirements</th>
-<th class="head">Semantics/Notes</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><tt class="docutils literal"><span class="pre">x[u]</span></tt></td>
-<td><tt class="docutils literal"><span class="pre">binding&lt;A,K&gt;::type</span></tt></td>
-<td><tt class="docutils literal"><span class="pre">x</span></tt> contains an
-element <em>b</em> whose
-<a class="reference" href="#kw">keyword</a> is <tt class="docutils literal"><span class="pre">K</span></tt></td>
-<td>Returns <em>b</em>'s <em>value</em> (by
-reference).</td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">x[u]</span></tt></td>
-<td><tt class="docutils literal"><span class="pre">binding&lt;A,L,D&gt;::type</span></tt></td>
-<td><em>none</em></td>
-<td>If <tt class="docutils literal"><span class="pre">x</span></tt> contains an element <em>b</em> whose
-<a class="reference" href="#kw">keyword</a> is the same as <tt class="docutils literal"><span class="pre">u</span></tt>'s,
-returns <em>b</em>'s <em>value</em> (by
-reference).  Otherwise, returns <tt class="docutils literal"><span class="pre">u</span></tt>'s <em>value</em>.</td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">x[w]</span></tt></td>
-<td><tt class="docutils literal"><span class="pre">lazy_binding&lt;A,M,E&gt;::type</span></tt></td>
-<td><em>none</em></td>
-<td>If <tt class="docutils literal"><span class="pre">x</span></tt> contains an element <em>b</em> whose
-<a class="reference" href="#kw">keyword</a> is the same as <tt class="docutils literal"><span class="pre">w</span></tt>'s,
-returns <em>b</em>'s <em>value</em> (by
-reference).  Otherwise, invokes <tt class="docutils literal"><span class="pre">w</span></tt>'s <em>value</em> and returns the result.</td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">x,</span> <span class="pre">z</span></tt></td>
-<td>Model of <span class="concept">ArgumentPack</span></td>
-<td><em>none</em></td>
-<td>Returns an <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> containing
-all the elements of both <tt class="docutils literal"><span class="pre">x</span></tt> and
-<tt class="docutils literal"><span class="pre">z</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</div>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id32" id="id5" name="id5"><span id="parameterspec"></span>3.2&nbsp;&nbsp;&nbsp;<span class="concept">ParameterSpec</span></a></h2>
-<p>A <span class="concept">ParameterSpec</span> describes the type requirements for arguments
-corresponding to a given <a class="reference" href="#kw">keyword</a> and indicates whether the argument
-is optional or required.  The table below details the allowed forms
-and describes their condition for satisfaction by an actual
-argument type. In each row,</p>
-<ul class="simple" id="conditions">
-<li><tt class="docutils literal"><span class="pre">K</span></tt> is the <span class="concept">ParameterSpec</span>'s <a class="reference" href="#keyword-tag-type">keyword tag type</a></li>
-<li><tt class="docutils literal"><span class="pre">A</span></tt> is an <a class="reference" href="#intended-argument-type">intended argument type</a> associated with <tt class="docutils literal"><span class="pre">K</span></tt>, if any</li>
-<li><tt class="docutils literal"><span class="pre">F</span></tt> is a unary <a class="reference" href="../../../mpl/doc/refmanual/lambda-expression.html">MPL lambda expression</a></li>
-</ul>
-<table border="1" class="docutils">
-<caption><span class="concept">ParameterSpec</span> allowed forms and conditions of satisfaction</caption>
-<colgroup>
-<col width="32%" />
-<col width="21%" />
-<col width="47%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th class="head">Type</th>
-<th class="head"><tt class="docutils literal"><span class="pre">A</span></tt> required</th>
-<th class="head">Condition <tt class="docutils literal"><span class="pre">A</span></tt> must satisfy</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><a class="reference" href="#keyword"><tt class="docutils literal"><span class="pre">keyword</span></tt></a><tt class="docutils literal"><span class="pre">&lt;K&gt;</span></tt></td>
-<td>no</td>
-<td><em>n/a</em></td>
-</tr>
-<tr><td><a class="reference" href="#optional"><tt class="docutils literal"><span class="pre">optional</span></tt></a><tt class="docutils literal"><span class="pre">&lt;K,F&gt;</span></tt></td>
-<td>no</td>
-<td><tt class="docutils literal"><span class="pre">mpl::apply&lt;F,A&gt;::type::value</span></tt>
-is <tt class="docutils literal"><span class="pre">true</span></tt>.</td>
-</tr>
-<tr><td><a class="reference" href="#required"><tt class="docutils literal"><span class="pre">required</span></tt></a><tt class="docutils literal"><span class="pre">&lt;K,F&gt;</span></tt></td>
-<td>yes</td>
-<td><tt class="docutils literal"><span class="pre">mpl::apply&lt;F,A&gt;::type::value</span></tt>
-is <tt class="docutils literal"><span class="pre">true</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-<p>The information in a <span class="concept">ParameterSpec</span> is used to <a class="reference" href="index.html#controlling-overload-resolution">limit</a> the
-arguments that will be matched by <a class="reference" href="index.html#forwarding-functions">forwarding functions</a>.</p>
-</div>
-</div>
-<hr class="docutils" />
-<div class="section">
-<h1><a class="toc-backref" href="#id33" id="class-templates" name="class-templates">4&nbsp;&nbsp;&nbsp;Class Templates</a></h1>
-<div class="section">
-<h2><a class="toc-backref" href="#id34" id="id7" name="id7"><span id="keyword"></span>4.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">keyword</span></tt></a></h2>
-<p>The type of every <a class="reference" href="#keyword-object">keyword object</a> is a specialization of <tt class="docutils literal"><span class="pre">keyword</span></tt>.</p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/keyword.hpp">boost/parameter/keyword.hpp</a></td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;class Tag&gt;
-struct keyword
-{
-    template &lt;class T&gt; <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> <a class="reference" href="#operator">operator=</a>(T&amp; value) const;
-    template &lt;class T&gt; <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> <a class="reference" href="#operator">operator=</a>(T const&amp; value) const;
-
-    template &lt;class T&gt; <em>tagged default</em> <a class="reference" href="#id9">operator|</a>(T&amp; x) const;
-    template &lt;class T&gt; <em>tagged default</em> <a class="reference" href="#id9">operator|</a>(T const&amp; x) const;
-
-    template &lt;class F&gt; <em>tagged lazy default</em> <a class="reference" href="#id10">operator||</a>(F const&amp;) const;
-
-    static keyword&lt;Tag&gt;&amp; <a class="reference" href="#get">get</a>();
-};
-</pre>
-<dl class="docutils" id="operator">
-<dt><tt class="docutils literal"><span class="pre">operator=</span></tt></dt>
-<dd><pre class="first literal-block">
-template &lt;class T&gt; <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> operator=(T&amp; value) const;
-template &lt;class T&gt; <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> operator=(T const&amp; value) const;
-</pre>
-<table class="last docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body">nothing</td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">an <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a>  containing a single <a class="reference" href="#tagged-reference">tagged reference</a> to
-<tt class="docutils literal"><span class="pre">value</span></tt> with <a class="reference" href="#kw">keyword</a> <tt class="docutils literal"><span class="pre">Tag</span></tt></td>
-</tr>
-</tbody>
-</table>
-</dd>
-</dl>
-<dl class="docutils" id="id9">
-<dt><tt class="docutils literal"><span class="pre">operator|</span></tt></dt>
-<dd><pre class="first literal-block">
-template &lt;class T&gt; <em>tagged default</em> operator|(T&amp; x) const;
-template &lt;class T&gt; <em>tagged default</em> operator|(T const&amp; x) const;
-</pre>
-<table class="last docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">a <a class="reference" href="#tagged-default">tagged default</a> with <em>value</em> <tt class="docutils literal"><span class="pre">x</span></tt> and <a class="reference" href="#kw">keyword</a> <tt class="docutils literal"><span class="pre">Tag</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-</dl>
-<dl class="docutils" id="id10">
-<dt><tt class="docutils literal"><span class="pre">operator||</span></tt></dt>
-<dd><pre class="first literal-block">
-template &lt;class F&gt; <em>tagged lazy default</em> operator||(F const&amp; g) const;
-</pre>
-<table class="last docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">g()</span></tt> is valid, with type <tt class="docutils literal"><span class="pre">boost::</span></tt><a class="reference" href="../../../utility/utility.htm#result_of"><tt class="docutils literal"><span class="pre">result_of</span></tt></a><tt class="docutils literal"><span class="pre">&lt;F()&gt;::type</span></tt>.<a class="footnote-reference" href="#no-result-of" id="id11" name="id11"><sup>2</sup></a></td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">a <a class="reference" href="#tagged-lazy-default">tagged lazy default</a> with <em>value</em> <tt class="docutils literal"><span class="pre">g</span></tt> and <a class="reference" href="#kw">keyword</a> <tt class="docutils literal"><span class="pre">Tag</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-</dl>
-<dl class="docutils" id="get">
-<dt><tt class="docutils literal"><span class="pre">get</span></tt></dt>
-<dd><pre class="first literal-block">
-static keyword&lt;Tag&gt;&amp; get();
-</pre>
-<table class="last docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">a “singleton instance”: the same object will be
-returned on each invocation of <tt class="docutils literal"><span class="pre">get()</span></tt>.</td>
-</tr>
-<tr class="field"><th class="field-name">Thread Safety:</th><td class="field-body"><tt class="docutils literal"><span class="pre">get()</span></tt> can be called from multiple threads
-simultaneously.</td>
-</tr>
-</tbody>
-</table>
-</dd>
-</dl>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id35" id="parameters" name="parameters">4.2&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">parameters</span></tt></a></h2>
-<p>Provides an interface for assembling the actual arguments to a
-<cite>forwarding function</cite> into an <span class="concept">ArgumentPack</span>, in which any
-<a class="reference" href="#positional">positional</a> arguments will be tagged according to the
-corresponding template argument to <tt class="docutils literal"><span class="pre">parameters</span></tt>.</p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/parameters.hpp">boost/parameter/parameters.hpp</a></td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;class P0 = <em>unspecified</em>, class P1 = <em>unspecified</em>, …class Pβ = <em>unspecified</em>&gt;
-struct parameters
-{
-    template &lt;class A0, class A1 = <em>unspecified</em>, …class Aβ = <em>unspecified</em>&gt;
-    struct <a class="reference" href="#match">match</a>
-    {
-        typedef … type;
-    };
-
-    template &lt;class A0&gt;
-    <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> <a class="reference" href="#id13">operator()</a>(A0 const&amp; a0) const;
-
-    template &lt;class A0, class A1&gt;
-    <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> <a class="reference" href="#id13">operator()</a>(A0 const&amp; a0, A1 const&amp; a1) const; <span class="vellipsis">   .
-   .
-   .
- </span>
-    template &lt;class A0, class A1, …class Aβ&gt;
-    <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> <a class="reference" href="#id13">operator()</a>(A0 const&amp; a0, A1 const&amp; a1, …Aβ const&amp; aβ) const;
-};
-</pre>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">P0</span></tt>, <tt class="docutils literal"><span class="pre">P1</span></tt>, … <tt class="docutils literal"><span class="pre">P</span></tt>β are models of <a class="reference" href="#parameterspec"><span class="concept">ParameterSpec</span></a>.</td>
-</tr>
-</tbody>
-</table>
-<div class="note">
-<p class="first admonition-title">Note</p>
-<p>In this section, <tt class="docutils literal"><span class="pre">R</span></tt><em>i</em> and <tt class="docutils literal"><span class="pre">K</span></tt><em>i</em> are defined as
-follows, for any argument type <tt class="docutils literal"><span class="pre">A</span></tt><em>i</em>:</p>
-<blockquote class="last">
-<div class="line-block">
-<div class="line"><tt class="docutils literal"><span class="pre">R</span></tt><em>i</em> is <tt class="docutils literal"><span class="pre">A</span></tt><em>i</em>'s <a class="reference" href="#intended-argument-type">intended argument type</a></div>
-<div class="line"><br /></div>
-<div class="line-block">
-<div class="line">if <tt class="docutils literal"><span class="pre">A</span></tt><em>i</em> is a result type of <tt class="docutils literal"><span class="pre">keyword&lt;T&gt;::</span></tt><a class="reference" href="#operator"><tt class="docutils literal"><span class="pre">operator=</span></tt></a></div>
-<div class="line">then</div>
-<div class="line-block">
-<div class="line"><tt class="docutils literal"><span class="pre">K</span></tt><em>i</em> is <tt class="docutils literal"><span class="pre">T</span></tt></div>
-</div>
-<div class="line">else</div>
-<div class="line-block">
-<div class="line"><tt class="docutils literal"><span class="pre">K</span></tt><em>i</em> is <tt class="docutils literal"><span class="pre">P</span></tt><em>i</em>'s <a class="reference" href="#keyword-tag-type">keyword tag type</a>.</div>
-</div>
-</div>
-</div>
-</blockquote>
-</div>
-<dl class="docutils" id="match">
-<dt><tt class="docutils literal"><span class="pre">match</span></tt></dt>
-<dd><p class="first">A <a class="reference" href="../../../mpl/doc/refmanual/metafunction.html"><span class="concept">Metafunction</span></a> used to remove a <a class="reference" href="index.html#forwarding-functions">forwarding function</a> from overload resolution.</p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">if <tt class="docutils literal"><span class="pre">P0</span></tt>, <tt class="docutils literal"><span class="pre">P1</span></tt>, …<tt class="docutils literal"><span class="pre">P</span></tt>β are <em>satisfied</em> (see
-below), then <tt class="docutils literal"><span class="pre">parameters&lt;P0,P1,…Pβ&gt;</span></tt>.  Otherwise,
-<tt class="docutils literal"><span class="pre">match&lt;A0,A1,…Aβ&gt;::type</span></tt> is not defined.</td>
-</tr>
-</tbody>
-</table>
-<p><tt class="docutils literal"><span class="pre">P0</span></tt>, <tt class="docutils literal"><span class="pre">P1</span></tt>, …<tt class="docutils literal"><span class="pre">P</span></tt>β are <strong>satisfied</strong> if, for
-every <em>j</em> in 0…β, either:</p>
-<ul class="last simple">
-<li><tt class="docutils literal"><span class="pre">P</span></tt><em>j</em> is the <em>unspecified</em> default</li>
-<li><strong>or</strong>, <tt class="docutils literal"><span class="pre">P</span></tt><em>j</em> is a specialization of <a class="reference" href="#keyword"><tt class="docutils literal"><span class="pre">keyword</span></tt></a>,</li>
-<li><strong>or</strong>, <tt class="docutils literal"><span class="pre">P</span></tt><em>j</em> is <a class="reference" href="#optional"><tt class="docutils literal"><span class="pre">optional</span></tt></a> <tt class="docutils literal"><span class="pre">&lt;X,F&gt;</span></tt> and either<ul>
-<li><tt class="docutils literal"><span class="pre">X</span></tt> is not <tt class="docutils literal"><span class="pre">K</span></tt><em>i</em> for any <em>i</em>,</li>
-<li><strong>or</strong> <tt class="docutils literal"><span class="pre">X</span></tt> is some <tt class="docutils literal"><span class="pre">K</span></tt><em>i</em>  and <tt class="docutils literal"><span class="pre">mpl::apply&lt;F,R</span></tt><em>i</em><tt class="docutils literal"><span class="pre">&gt;::type::value</span></tt> is <tt class="docutils literal"><span class="pre">true</span></tt></li>
-</ul>
-</li>
-<li><strong>or</strong>, <tt class="docutils literal"><span class="pre">P</span></tt><em>j</em> is <a class="reference" href="#required"><tt class="docutils literal"><span class="pre">required</span></tt></a> <tt class="docutils literal"><span class="pre">&lt;X,F&gt;</span></tt>, and<ul>
-<li><tt class="docutils literal"><span class="pre">X</span></tt> is some <tt class="docutils literal"><span class="pre">K</span></tt><em>i</em>, <strong>and</strong></li>
-<li><tt class="docutils literal"><span class="pre">mpl::apply&lt;F,R</span></tt><em>i</em><tt class="docutils literal"><span class="pre">&gt;::type::value</span></tt> is <tt class="docutils literal"><span class="pre">true</span></tt></li>
-</ul>
-</li>
-</ul>
-</dd>
-</dl>
-<dl class="docutils" id="id13">
-<dt><tt class="docutils literal"><span class="pre">operator()</span></tt></dt>
-<dd><pre class="first literal-block">
-template &lt;class A0&gt; <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> operator()(A0 const&amp; a0) const; <span class="vellipsis">  .
-  .
-  .
- </span>
-template &lt;class A0, …class Aβ&gt; <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> <a class="reference" href="#id13">operator()</a>(A0 const&amp; a0, …Aβ const&amp; aβ) const;
-</pre>
-<table class="last docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">An <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> containing, for each <tt class="docutils literal"><span class="pre">a</span></tt><em>i</em>,</p>
-<ul class="last simple">
-<li>if <tt class="docutils literal"><span class="pre">a</span></tt><em>i</em>,  is a single-element <span class="concept">ArgumentPack</span>, its element</li>
-<li>Otherwise, a <a class="reference" href="#tagged-reference">tagged reference</a> with <a class="reference" href="#kw">keyword</a> <tt class="docutils literal"><span class="pre">K</span></tt><em>i</em> and <em>value</em> <tt class="docutils literal"><span class="pre">a</span></tt><em>i</em></li>
-</ul>
-</td>
-</tr>
-</tbody>
-</table>
-</dd>
-</dl>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id36" id="optional-required" name="optional-required"><span id="required"></span><span id="optional"></span>4.3&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">optional</span></tt>, <tt class="docutils literal"><span class="pre">required</span></tt></a></h2>
-<p>These templates describe the requirements on a function parameter.</p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/parameters.hpp">boost/parameter/parameters.hpp</a></td>
-</tr>
-</tbody>
-</table>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name" colspan="2">Specializations model:</th></tr>
-<tr><td>&nbsp;</td><td class="field-body"><a class="reference" href="#parameterspec"><span class="concept">ParameterSpec</span></a></td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;class Tag, class Predicate = <em>unspecified</em>&gt;
-struct optional;
-
-template &lt;class Tag, class Predicate = <em>unspecified</em>&gt;
-struct required;
-</pre>
-<p>The default value of <tt class="docutils literal"><span class="pre">Predicate</span></tt> is an unspecified <a class="reference" href="../../../mpl/doc/refmanual/metafunction.html"><span class="concept">Metafunction</span></a> that returns
-<tt class="docutils literal"><span class="pre">mpl::true_</span></tt> for any argument.</p>
-</div>
-</div>
-<hr class="docutils" />
-<div class="section">
-<h1><a class="toc-backref" href="#id37" id="metafunctions" name="metafunctions">5&nbsp;&nbsp;&nbsp;Metafunctions</a></h1>
-<p>A <a class="reference" href="../../../mpl/doc/refmanual/metafunction.html"><span class="concept">Metafunction</span></a> is conceptually a function that operates on, and
-returns, C++ types.</p>
-<div class="section">
-<h2><a class="toc-backref" href="#id38" id="binding" name="binding">5.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">binding</span></tt></a></h2>
-<p>Returns the result type of indexing an argument pack with a
-<a class="reference" href="#keyword-tag-type">keyword tag type</a> or with a <a class="reference" href="#tagged-default">tagged default</a>.</p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Defined n:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/binding.hpp">boost/parameter/binding.hpp</a></td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;class A, class K, class D = void&gt;
-struct binding
-{
-    typedef … type;
-};
-</pre>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">A</span></tt> is a model of <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a>.</td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">the reference type of the <a class="reference" href="#tagged-reference">tagged reference</a> in <tt class="docutils literal"><span class="pre">A</span></tt>
-having <a class="reference" href="#keyword-tag-type">keyword tag type</a> <tt class="docutils literal"><span class="pre">K</span></tt>, if any.  If no such <a class="reference" href="#tagged-reference">tagged reference</a> exists, returns <tt class="docutils literal"><span class="pre">D</span></tt>.</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id39" id="lazy-binding" name="lazy-binding">5.2&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">lazy_binding</span></tt></a></h2>
-<p>Returns the result type of indexing an argument pack with a <a class="reference" href="#tagged-lazy-default">tagged lazy default</a>.</p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/binding.hpp">boost/parameter/binding.hpp</a></td>
-</tr>
-</tbody>
-</table>
-<pre class="literal-block">
-template &lt;class A, class K, class F&gt;
-struct lazy_binding
-{
-    typedef … type;
-};
-</pre>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">A</span></tt> is a model of <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a>.</td>
-</tr>
-<tr class="field"><th class="field-name">Returns:</th><td class="field-body">the reference type of the <a class="reference" href="#tagged-reference">tagged reference</a> in <tt class="docutils literal"><span class="pre">A</span></tt>
-having <a class="reference" href="#keyword-tag-type">keyword tag type</a> <tt class="docutils literal"><span class="pre">K</span></tt>, if any.  If no such <a class="reference" href="#tagged-reference">tagged reference</a> exists, returns <tt class="docutils literal"><span class="pre">boost::</span></tt><a class="reference" href="../../../utility/utility.htm#result_of"><tt class="docutils literal"><span class="pre">result_of</span></tt></a><tt class="docutils literal"><span class="pre">&lt;F()&gt;::type</span></tt>.<a class="footnote-reference" href="#no-result-of" id="id17" name="id17"><sup>2</sup></a></td>
-</tr>
-</tbody>
-</table>
-</div>
-</div>
-<hr class="docutils" />
-<div class="section">
-<h1><a class="toc-backref" href="#id40" id="code-generation-macros" name="code-generation-macros">6&nbsp;&nbsp;&nbsp;Code Generation Macros</a></h1>
-<p>Macros in this section can be used to ease the writing of code
-using the Parameter libray by eliminating repetitive boilerplate.</p>
-<div class="section">
-<h2><a class="toc-backref" href="#id41" id="boost-parameter-fun-r-n-l-h-p" name="boost-parameter-fun-r-n-l-h-p">6.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUN(r,n,l,h,p)</span></tt></a></h2>
-<p>Generates a sequence of <a class="reference" href="index.html#forwarding-functions">forwarding function</a> templates named
-<tt class="docutils literal"><span class="pre">n</span></tt>, with arities ranging from <tt class="docutils literal"><span class="pre">l</span></tt> to <tt class="docutils literal"><span class="pre">h</span></tt> , returning <tt class="docutils literal"><span class="pre">r</span></tt>,
-and using <tt class="docutils literal"><span class="pre">p</span></tt> to control overload resolution and assign tags to
-positional arguments.</p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/macros.hpp">boost/parameter/macros.hpp</a></td>
-</tr>
-</tbody>
-</table>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">l</span></tt> and <tt class="docutils literal"><span class="pre">h</span></tt> are nonnegative integer tokens such
-that <tt class="docutils literal"><span class="pre">l</span></tt> &lt; <tt class="docutils literal"><span class="pre">h</span></tt></td>
-</tr>
-</tbody>
-</table>
-<dl class="docutils">
-<dt>Generates</dt>
-<dd><pre class="first last literal-block">
-template &lt;class A1, class A2, …class A##<strong>l</strong>&gt;
-r name(
-    A1 const&amp; a1, A2 const&amp; a2, …A<strong>l</strong> const&amp; x<strong>l</strong>
-  , typename <strong>p</strong>::match&lt;A1,A2,…A<strong>l</strong>&gt;::type p = <strong>p</strong>())
-{
-   return <strong>name</strong>_with_named_params(<strong>p</strong>(x1,x2,…x<strong>l</strong>));
-}
-
-template &lt;class A1, class A2, …class A<strong>l</strong>, class A##<a class="reference" href="../../../preprocessor/doc/ref/inc.html">BOOST_PP_INC</a>(<strong>l</strong>)&gt;
-r name(
-    A1 const&amp; a1, A2 const&amp; a2, …A<strong>l</strong> const&amp; x<strong>l</strong>
-  , A##<a class="reference" href="../../../preprocessor/doc/ref/inc.html">BOOST_PP_INC</a>(<strong>l</strong>) const&amp; x##<a class="reference" href="../../../preprocessor/doc/ref/inc.html">BOOST_PP_INC</a>(<strong>l</strong>)
-  , typename <strong>p</strong>::match&lt;A1,A2,…A<strong>l</strong>,A##<a class="reference" href="../../../preprocessor/doc/ref/inc.html">BOOST_PP_INC</a>(<strong>l</strong>)&gt;::type p = <strong>p</strong>())
-{
-   return <strong>name</strong>_with_named_params(<strong>p</strong>(x1,x2,…x<strong>l</strong>,x##<a class="reference" href="../../../preprocessor/doc/ref/inc.html">BOOST_PP_INC</a>(<strong>l</strong>)));
-} <span class="vellipsis">  .
-  .
-  .
- </span>
-template &lt;class A1, class A2, …class A<strong>h</strong>&gt;
-r name(
-    A1 const&amp; a1, A2 const&amp; a2, …A<strong>h</strong> const&amp; x<strong>h</strong>
-  , typename <strong>p</strong>::match&lt;A1,A2,…A<strong>h</strong>&gt;::type p = <strong>p</strong>())
-{
-   return <strong>name</strong>_with_named_params(<strong>p</strong>(a1,a2,…a<strong>h</strong>));
-}
-</pre>
-</dd>
-</dl>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id42" id="boost-parameter-keyword-n-k" name="boost-parameter-keyword-n-k">6.2&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_KEYWORD(n,k)</span></tt></a></h2>
-<p>Generates the declaration of a <a class="reference" href="#keyword-tag-type">keyword tag type</a> named <tt class="docutils literal"><span class="pre">k</span></tt> in
-namespace <tt class="docutils literal"><span class="pre">n</span></tt>, and a corresponding <a class="reference" href="#keyword-object">keyword object</a> definition in
-the enclosing namespace.</p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/keyword.hpp">boost/parameter/keyword.hpp</a></td>
-</tr>
-</tbody>
-</table>
-<dl class="docutils">
-<dt>Generates</dt>
-<dd><pre class="first last literal-block">
-namespace <strong>n</strong> { struct <strong>k</strong>; }
-namespace {
-  boost::parameter::keyword&lt;<em>tag-namespace</em>::<strong>k</strong>&gt;&amp; <strong>k</strong>
-  = boost::parameter::keyword&lt;<em>tag-namespace</em>::<strong>k</strong>&gt;::get();
-}
-</pre>
-</dd>
-</dl>
-</div>
-<div class="section">
-<h2><a class="toc-backref" href="#id43" id="boost-parameter-match-p-a-x" name="boost-parameter-match-p-a-x">6.3&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_MATCH(p,a,x)</span></tt></a></h2>
-<p>Generates a defaulted parameter declaration for a <a class="reference" href="index.html#forwarding-functions">forwarding
-function</a>.</p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/match.hpp">boost/parameter/match.hpp</a></td>
-</tr>
-</tbody>
-</table>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><p class="first"><tt class="docutils literal"><span class="pre">a</span></tt> is a <a class="reference" href="http://www.boost.org/libs/preprocessor/doc/data.html">Boost.Preprocessor sequence</a>
-of the form</p>
-<pre class="last literal-block">
-(A0)(A1)…(A<em>n</em>)
-</pre>
-</td>
-</tr>
-</tbody>
-</table>
-<dl class="docutils">
-<dt>Generates</dt>
-<dd><pre class="first last literal-block">
-typename <strong>p</strong>::match&lt;<strong>A0</strong>,<strong>A1</strong>…,<strong>A</strong><em>n</em>&gt;::type <strong>x</strong> = <strong>p</strong>()
-</pre>
-</dd>
-</dl>
-</div>
-</div>
-<div class="section">
-<h1><a class="toc-backref" href="#id44" id="configuration-macros" name="configuration-macros">7&nbsp;&nbsp;&nbsp;Configuration Macros</a></h1>
-<div class="section">
-<h2><a class="toc-backref" href="#id45" id="boost-parameter-max-arity" name="boost-parameter-max-arity">7.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_MAX_ARITY</span></tt></a></h2>
-<p>Determines the maximum number of arguments supported by the
-library.  Will only be <tt class="docutils literal"><span class="pre">#defined</span></tt> by the library if it is not
-already <tt class="docutils literal"><span class="pre">#defined</span></tt>.</p>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/config.hpp">boost/parameter/config.hpp</a></td>
-</tr>
-</tbody>
-</table>
-<table class="docutils field-list" frame="void" rules="none">
-<col class="field-name" />
-<col class="field-body" />
-<tbody valign="top">
-<tr class="field"><th class="field-name">Default Value:</th><td class="field-body"><tt class="docutils literal"><span class="pre">5</span></tt></td>
-</tr>
-</tbody>
-</table>
-</div>
-</div>
-<div class="section">
-<h1><a class="toc-backref" href="#id46" id="tutorial" name="tutorial">8&nbsp;&nbsp;&nbsp;Tutorial</a></h1>
-<p>Follow <a class="reference" href="index.html#tutorial">this link</a> to the Boost.Parameter tutorial
-documentation.</p>
-<hr class="docutils" />
-<table class="docutils footnote" frame="void" id="thread" rules="none">
-<colgroup><col class="label" /><col /></colgroup>
-<tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id2" name="thread">[1]</a></td><td>References to tag objects may be initialized multiple
-times.  This scenario can only occur in the presence of
-threading.  Because the C++ standard doesn't consider threading,
-it doesn't explicitly allow or forbid multiple initialization of
-references.  That said, it's hard to imagine an implementation
-where it could make a difference.</td></tr>
-</tbody>
-</table>
-<table class="docutils footnote" frame="void" id="no-result-of" rules="none">
-<colgroup><col class="label" /><col /></colgroup>
-<tbody valign="top">
-<tr><td class="label"><a name="no-result-of">[2]</a></td><td><em>(<a class="fn-backref" href="#id11">1</a>, <a class="fn-backref" href="#id17">2</a>)</em> Where <a class="reference" href="../../../utility/utility.htm#BOOST_NO_RESULT_OF"><tt class="docutils literal"><span class="pre">BOOST_NO_RESULT_OF</span></tt></a> is <tt class="docutils literal"><span class="pre">#defined</span></tt>,
-<tt class="docutils literal"><span class="pre">boost::</span></tt><a class="reference" href="../../../utility/utility.htm#result_of"><tt class="docutils literal"><span class="pre">result_of</span></tt></a><tt class="docutils literal"><span class="pre">&lt;F()&gt;::type</span></tt> is replaced by
-<tt class="docutils literal"><span class="pre">F::result_type</span></tt>.</td></tr>
-</tbody>
-</table>
-</div>
-</div>
-<div class="footer">
-<hr class="footer" />
-Generated on: 2006-05-06 16:53 UTC.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-
-</div>
-</body>
-</html>
+<?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.5: http://docutils.sourceforge.net/" />
+<title>The Boost Parameter Library Reference Documentation</title>
+<meta name="authors" content="David Abrahams  Daniel Wallin" />
+<meta name="organization" content="Boost Consulting" />
+<meta name="date" content="2005-07-17" />
+<meta name="copyright" content="Copyright David Abrahams, Daniel Wallin 2005. Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)" />
+<link rel="stylesheet" href="rst.css" type="text/css" />
+</head>
+<body>
+<div class="document" id="the-boost-parameter-library-reference-documentation">
+<h1 class="title">The Boost Parameter Library Reference Documentation</h1>
+<table class="docinfo" frame="void" rules="none">
+<col class="docinfo-name" />
+<col class="docinfo-content" />
+<tbody valign="top">
+<tr><th class="docinfo-name">Authors:</th>
+<td>David Abrahams
+<br />Daniel Wallin</td></tr>
+<tr><th class="docinfo-name">Contact:</th>
+<td><a class="first reference" href="mailto:dave&#64;boost-consulting.com">dave&#64;boost-consulting.com</a>, <a class="last reference" href="mailto:dalwan01&#64;student.umu.se">dalwan01&#64;student.umu.se</a></td></tr>
+<tr><th class="docinfo-name">Organization:</th>
+<td><a class="first last reference" href="http://www.boost-consulting.com">Boost Consulting</a></td></tr>
+<tr><th class="docinfo-name">Date:</th>
+<td>2005-07-17</td></tr>
+<tr><th class="docinfo-name">Copyright:</th>
+<td>Copyright David Abrahams, Daniel Wallin
+2005. Distributed under the Boost Software License,
+Version 1.0. (See accompanying file LICENSE_1_0.txt
+or copy at <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</td></tr>
+</tbody>
+</table>
+<p><a class="reference" href="../../../../index.htm"><img alt="Boost" src="../../../../boost.png" /></a></p>
+<hr class="docutils" />
+<div class="contents topic">
+<p class="topic-title first"><a id="contents" name="contents">Contents</a></p>
+<ul class="auto-toc simple">
+<li><a class="reference" href="#preliminaries" id="id26" name="id26">1&nbsp;&nbsp;&nbsp;Preliminaries</a><ul class="auto-toc">
+<li><a class="reference" href="#namespaces" id="id27" name="id27">1.1&nbsp;&nbsp;&nbsp;Namespaces</a></li>
+<li><a class="reference" href="#exceptions" id="id28" name="id28">1.2&nbsp;&nbsp;&nbsp;Exceptions</a></li>
+<li><a class="reference" href="#thread-safety" id="id29" name="id29">1.3&nbsp;&nbsp;&nbsp;Thread Safety</a></li>
+<li><a class="reference" href="#typography" id="id30" name="id30">1.4&nbsp;&nbsp;&nbsp;Typography</a></li>
+</ul>
+</li>
+<li><a class="reference" href="#terminology" id="id31" name="id31">2&nbsp;&nbsp;&nbsp;Terminology</a></li>
+<li><a class="reference" href="#concepts" id="id32" name="id32">3&nbsp;&nbsp;&nbsp;Concepts</a><ul class="auto-toc">
+<li><a class="reference" href="#argumentpack" id="id33" name="id33">3.1&nbsp;&nbsp;&nbsp;<span class="concept">ArgumentPack</span></a></li>
+<li><a class="reference" href="#id5" id="id34" name="id34">3.2&nbsp;&nbsp;&nbsp;<span class="concept">ParameterSpec</span></a></li>
+</ul>
+</li>
+<li><a class="reference" href="#class-templates" id="id35" name="id35">4&nbsp;&nbsp;&nbsp;Class Templates</a><ul class="auto-toc">
+<li><a class="reference" href="#id7" id="id36" name="id36">4.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">keyword</span></tt></a></li>
+<li><a class="reference" href="#parameters" id="id37" name="id37">4.2&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">parameters</span></tt></a></li>
+<li><a class="reference" href="#optional-required" id="id38" name="id38">4.3&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">optional</span></tt>, <tt class="docutils literal"><span class="pre">required</span></tt></a></li>
+</ul>
+</li>
+<li><a class="reference" href="#metafunctions" id="id39" name="id39">5&nbsp;&nbsp;&nbsp;Metafunctions</a><ul class="auto-toc">
+<li><a class="reference" href="#binding" id="id40" name="id40">5.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">binding</span></tt></a></li>
+<li><a class="reference" href="#lazy-binding" id="id41" name="id41">5.2&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">lazy_binding</span></tt></a></li>
+</ul>
+</li>
+<li><a class="reference" href="#code-generation-macros" id="id42" name="id42">6&nbsp;&nbsp;&nbsp;Code Generation Macros</a><ul class="auto-toc">
+<li><a class="reference" href="#boost-parameter-function-result-name-tag-namespace-arguments" id="id43" name="id43">6.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUNCTION(result,name,tag_namespace,arguments)</span></tt></a></li>
+<li><a class="reference" href="#boost-parameter-fun-r-n-l-h-p" id="id44" name="id44">6.2&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUN(r,n,l,h,p)</span></tt></a></li>
+<li><a class="reference" href="#boost-parameter-keyword-n-k" id="id45" name="id45">6.3&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_KEYWORD(n,k)</span></tt></a></li>
+<li><a class="reference" href="#boost-parameter-match-p-a-x" id="id46" name="id46">6.4&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_MATCH(p,a,x)</span></tt></a></li>
+</ul>
+</li>
+<li><a class="reference" href="#configuration-macros" id="id47" name="id47">7&nbsp;&nbsp;&nbsp;Configuration Macros</a><ul class="auto-toc">
+<li><a class="reference" href="#boost-parameter-max-arity" id="id48" name="id48">7.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_MAX_ARITY</span></tt></a></li>
+</ul>
+</li>
+<li><a class="reference" href="#tutorial" id="id49" name="id49">8&nbsp;&nbsp;&nbsp;Tutorial</a></li>
+</ul>
+</div>
+<hr class="docutils" />
+<div class="section">
+<h1><a class="toc-backref" href="#id26" id="preliminaries" name="preliminaries">1&nbsp;&nbsp;&nbsp;Preliminaries</a></h1>
+<p>This section covers some basic information you'll need to know in
+order to understand this reference</p>
+<div class="section">
+<h2><a class="toc-backref" href="#id27" id="namespaces" name="namespaces">1.1&nbsp;&nbsp;&nbsp;Namespaces</a></h2>
+<p>In this document, all unqualified identifiers should be assumed to
+be defined in namespace <tt class="docutils literal"><span class="pre">boost::parameter</span></tt> unless otherwise
+specified.</p>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id28" id="exceptions" name="exceptions">1.2&nbsp;&nbsp;&nbsp;Exceptions</a></h2>
+<p>No operation described in this document
+throws an exception unless otherwise specified.</p>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id29" id="thread-safety" name="thread-safety">1.3&nbsp;&nbsp;&nbsp;Thread Safety</a></h2>
+<p>All components of this library can be used safely from multiple
+threads without synchronization.<a class="footnote-reference" href="#thread" id="id2" name="id2"><sup>1</sup></a></p>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id30" id="typography" name="typography">1.4&nbsp;&nbsp;&nbsp;Typography</a></h2>
+<p>Names written in <span class="concept">sans serif type</span> represent <a class="reference" href="../../../../more/generic_programming.html#concept">concepts</a>.</p>
+<p>In code blocks, <em>italic type</em> represents unspecified text that
+satisfies the requirements given in the detailed description that
+follows the code block.</p>
+<p>In a specification of the tokens generated by a macro, <strong>bold
+type</strong> is used to highlight the position of the expanded macro
+argument in the result.</p>
+<p>The special character β represents the value of <a class="reference" href="#boost-parameter-max-arity"><tt class="docutils literal"><span class="pre">BOOST_PARAMETER_MAX_ARITY</span></tt></a>.</p>
+</div>
+</div>
+<hr class="docutils" />
+<div class="section">
+<h1><a class="toc-backref" href="#id31" id="terminology" name="terminology">2&nbsp;&nbsp;&nbsp;Terminology</a></h1>
+<dl class="docutils" id="kw">
+<dt>keyword</dt>
+<dd>The name of a function parameter.</dd>
+</dl>
+<span class="target" id="keyword-tag-type"></span><dl class="docutils">
+<dt>keyword tag type</dt>
+<dd>A type used to uniquely identify a function parameter.  Typically
+its name will be the same as that of the parameter.</dd>
+</dl>
+<span class="target" id="positional"></span><dl class="docutils">
+<dt>positional argument</dt>
+<dd>An argument passed with no explicit keyword.  Its parameter is
+determined in the usual C++ way: by position with respect to a
+parameter list.</dd>
+</dl>
+<span class="target" id="tag-type"></span><dl class="docutils">
+<dt>tag type</dt>
+<dd>Shorthand for “<a class="reference" href="#keyword-tag-type">keyword tag type</a>.”</dd>
+</dl>
+<span class="target" id="keyword-object"></span><dl class="docutils">
+<dt>keyword object</dt>
+<dd>An instance of <a class="reference" href="#keyword"><tt class="docutils literal"><span class="pre">keyword</span></tt></a> <tt class="docutils literal"><span class="pre">&lt;T&gt;</span></tt> for some <a class="reference" href="#tag-type">tag type</a> <tt class="docutils literal"><span class="pre">T</span></tt>.</dd>
+</dl>
+<span class="target" id="tagged-reference"></span><dl class="docutils">
+<dt>tagged reference</dt>
+<dd><p class="first">An object whose type is associated with a <a class="reference" href="#keyword-tag-type">keyword tag type</a> (the
+object's <em>keyword</em>), and that holds a reference (to the object's
+<em>value</em>).</p>
+<p class="last">As a shorthand, a “tagged reference to <tt class="docutils literal"><span class="pre">x</span></tt>” means a tagged
+reference whose <em>value</em> is <tt class="docutils literal"><span class="pre">x</span></tt>.</p>
+</dd>
+</dl>
+<span class="target" id="tagged-default"></span><dl class="docutils">
+<dt>tagged default</dt>
+<dd>A <a class="reference" href="#tagged-reference">tagged reference</a> whose <em>value</em> represents the value of a
+default argument.</dd>
+</dl>
+<span class="target" id="tagged-lazy-default"></span><dl class="docutils">
+<dt>tagged lazy default</dt>
+<dd>A <a class="reference" href="#tagged-reference">tagged reference</a> whose <em>value</em>, when invoked with no
+arguments, computes a default argument value.</dd>
+</dl>
+<span class="target" id="intended-argument-type"></span><dl class="docutils">
+<dt>intended argument type</dt>
+<dd>The <em>intended argument type</em> of a single-element <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> is the
+type of its element's <em>value</em>.  The intended argument type of any other
+type <tt class="docutils literal"><span class="pre">X</span></tt> is <tt class="docutils literal"><span class="pre">X</span></tt> itself.</dd>
+</dl>
+<div class="note">
+<p class="first admonition-title">Note</p>
+<p class="last">In this reference, we will use concept names (and other names)
+to describe both types and objects, depending on context.  So
+for example, “an <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a>” can refer to a type that
+models <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> <em>or</em> an object of such a type.</p>
+</div>
+</div>
+<hr class="docutils" />
+<div class="section">
+<h1><a class="toc-backref" href="#id32" id="concepts" name="concepts">3&nbsp;&nbsp;&nbsp;Concepts</a></h1>
+<p>This section describes the generic type <a class="reference" href="../../../../more/generic_programming.html#concept">concepts</a> used by the Parameter library.</p>
+<div class="section">
+<h2><a class="toc-backref" href="#id33" id="argumentpack" name="argumentpack">3.1&nbsp;&nbsp;&nbsp;<span class="concept">ArgumentPack</span></a></h2>
+<p>An <span class="concept">ArgumentPack</span> is a collection of <a class="reference" href="#tagged-reference">tagged reference</a>s to the
+actual arguments passed to a function.  Every <span class="concept">ArgumentPack</span> is
+also a valid MPL <a class="reference" href="../../../mpl/doc/refmanual/forward-sequence.html"><span class="concept">Forward Sequence</span></a> consisting of the <a class="reference" href="#keyword-tag-type">keyword tag type</a>s in its <a class="reference" href="#tagged-reference">tagged reference</a>s.</p>
+<div class="section">
+<h3><a id="requirements" name="requirements">Requirements</a></h3>
+<p>In the table below,</p>
+<ul class="simple">
+<li><tt class="docutils literal"><span class="pre">A</span></tt> is a model of <span class="concept">ArgumentPack</span></li>
+<li><tt class="docutils literal"><span class="pre">x</span></tt> is an instance of <tt class="docutils literal"><span class="pre">A</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">u</span></tt> is a <a class="reference" href="#keyword-object">keyword object</a> of type <tt class="docutils literal"><span class="pre">K</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">v</span></tt> is a <a class="reference" href="#tagged-default">tagged default</a> with <a class="reference" href="#tag-type">tag type</a> <tt class="docutils literal"><span class="pre">L</span></tt> and <em>value</em> of type <tt class="docutils literal"><span class="pre">D</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">w</span></tt> is a <a class="reference" href="#tagged-lazy-default">tagged lazy default</a> with <a class="reference" href="#tag-type">tag type</a> <tt class="docutils literal"><span class="pre">M</span></tt> and <em>value</em> of type <tt class="docutils literal"><span class="pre">E</span> <span class="pre">const</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">z</span></tt> is an <span class="concept">ArgumentPack</span> containing a single element (as created by <a class="reference" href="#keyword"><tt class="docutils literal"><span class="pre">keyword</span></tt></a><tt class="docutils literal"><span class="pre">&lt;…&gt;::operator=</span></tt>)</li>
+</ul>
+<p>Any exceptions are thrown from the invocation of <tt class="docutils literal"><span class="pre">w</span></tt>'s <em>value</em>
+will be propagated to the caller.</p>
+<table border="1" class="docutils table">
+<caption><span class="concept">ArgumentPack</span> requirements</caption>
+<colgroup>
+<col width="11%" />
+<col width="31%" />
+<col width="19%" />
+<col width="40%" />
+</colgroup>
+<thead valign="bottom">
+<tr><th class="head">Expression</th>
+<th class="head">Type</th>
+<th class="head">Requirements</th>
+<th class="head">Semantics/Notes</th>
+</tr>
+</thead>
+<tbody valign="top">
+<tr><td><tt class="docutils literal"><span class="pre">x[u]</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">binding&lt;A,K&gt;::type</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">x</span></tt> contains an
+element <em>b</em> whose
+<a class="reference" href="#kw">keyword</a> is <tt class="docutils literal"><span class="pre">K</span></tt></td>
+<td>Returns <em>b</em>'s <em>value</em> (by
+reference).</td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">x[u]</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">binding&lt;A,L,D&gt;::type</span></tt></td>
+<td><em>none</em></td>
+<td>If <tt class="docutils literal"><span class="pre">x</span></tt> contains an element <em>b</em> whose
+<a class="reference" href="#kw">keyword</a> is the same as <tt class="docutils literal"><span class="pre">u</span></tt>'s,
+returns <em>b</em>'s <em>value</em> (by
+reference).  Otherwise, returns <tt class="docutils literal"><span class="pre">u</span></tt>'s <em>value</em>.</td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">x[w]</span></tt></td>
+<td><tt class="docutils literal"><span class="pre">lazy_binding&lt;A,M,E&gt;::type</span></tt></td>
+<td><em>none</em></td>
+<td>If <tt class="docutils literal"><span class="pre">x</span></tt> contains an element <em>b</em> whose
+<a class="reference" href="#kw">keyword</a> is the same as <tt class="docutils literal"><span class="pre">w</span></tt>'s,
+returns <em>b</em>'s <em>value</em> (by
+reference).  Otherwise, invokes <tt class="docutils literal"><span class="pre">w</span></tt>'s <em>value</em> and returns the result.</td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">x,</span> <span class="pre">z</span></tt></td>
+<td>Model of <span class="concept">ArgumentPack</span></td>
+<td><em>none</em></td>
+<td>Returns an <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> containing
+all the elements of both <tt class="docutils literal"><span class="pre">x</span></tt> and
+<tt class="docutils literal"><span class="pre">z</span></tt>.</td>
+</tr>
+</tbody>
+</table>
+</div>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id34" id="id5" name="id5"><span id="parameterspec"></span>3.2&nbsp;&nbsp;&nbsp;<span class="concept">ParameterSpec</span></a></h2>
+<p>A <span class="concept">ParameterSpec</span> describes the type requirements for arguments
+corresponding to a given <a class="reference" href="#kw">keyword</a> and indicates whether the argument
+is optional or required.  The table below details the allowed forms
+and describes their condition for satisfaction by an actual
+argument type. In each row,</p>
+<ul class="simple" id="conditions">
+<li><tt class="docutils literal"><span class="pre">K</span></tt> is the <span class="concept">ParameterSpec</span>'s <a class="reference" href="#keyword-tag-type">keyword tag type</a></li>
+<li><tt class="docutils literal"><span class="pre">A</span></tt> is an <a class="reference" href="#intended-argument-type">intended argument type</a> associated with <tt class="docutils literal"><span class="pre">K</span></tt>, if any</li>
+<li><tt class="docutils literal"><span class="pre">F</span></tt> is a unary <a class="reference" href="../../../mpl/doc/refmanual/lambda-expression.html">MPL lambda expression</a></li>
+</ul>
+<table border="1" class="docutils table">
+<caption><span class="concept">ParameterSpec</span> allowed forms and conditions of satisfaction</caption>
+<colgroup>
+<col width="32%" />
+<col width="21%" />
+<col width="47%" />
+</colgroup>
+<thead valign="bottom">
+<tr><th class="head">Type</th>
+<th class="head"><tt class="docutils literal"><span class="pre">A</span></tt> required</th>
+<th class="head">Condition <tt class="docutils literal"><span class="pre">A</span></tt> must satisfy</th>
+</tr>
+</thead>
+<tbody valign="top">
+<tr><td><a class="reference" href="#keyword"><tt class="docutils literal"><span class="pre">keyword</span></tt></a><tt class="docutils literal"><span class="pre">&lt;K&gt;</span></tt></td>
+<td>no</td>
+<td><em>n/a</em></td>
+</tr>
+<tr><td><a class="reference" href="#optional"><tt class="docutils literal"><span class="pre">optional</span></tt></a><tt class="docutils literal"><span class="pre">&lt;K,F&gt;</span></tt></td>
+<td>no</td>
+<td><tt class="docutils literal"><span class="pre">mpl::apply&lt;F,A&gt;::type::value</span></tt>
+is <tt class="docutils literal"><span class="pre">true</span></tt>.</td>
+</tr>
+<tr><td><a class="reference" href="#required"><tt class="docutils literal"><span class="pre">required</span></tt></a><tt class="docutils literal"><span class="pre">&lt;K,F&gt;</span></tt></td>
+<td>yes</td>
+<td><tt class="docutils literal"><span class="pre">mpl::apply&lt;F,A&gt;::type::value</span></tt>
+is <tt class="docutils literal"><span class="pre">true</span></tt>.</td>
+</tr>
+</tbody>
+</table>
+<p>The information in a <span class="concept">ParameterSpec</span> is used to <a class="reference" href="index.html#controlling-overload-resolution">limit</a> the
+arguments that will be matched by <a class="reference" href="index.html#forwarding-functions">forwarding functions</a>.</p>
+</div>
+</div>
+<hr class="docutils" />
+<div class="section">
+<h1><a class="toc-backref" href="#id35" id="class-templates" name="class-templates">4&nbsp;&nbsp;&nbsp;Class Templates</a></h1>
+<div class="section">
+<h2><a class="toc-backref" href="#id36" id="id7" name="id7"><span id="keyword"></span>4.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">keyword</span></tt></a></h2>
+<p>The type of every <a class="reference" href="#keyword-object">keyword object</a> is a specialization of <tt class="docutils literal"><span class="pre">keyword</span></tt>.</p>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/keyword.hpp">boost/parameter/keyword.hpp</a></td>
+</tr>
+</tbody>
+</table>
+<pre class="literal-block">
+template &lt;class Tag&gt;
+struct keyword
+{
+    template &lt;class T&gt; <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> <a class="reference" href="#operator">operator=</a>(T&amp; value) const;
+    template &lt;class T&gt; <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> <a class="reference" href="#operator">operator=</a>(T const&amp; value) const;
+
+    template &lt;class T&gt; <em>tagged default</em> <a class="reference" href="#id9">operator|</a>(T&amp; x) const;
+    template &lt;class T&gt; <em>tagged default</em> <a class="reference" href="#id9">operator|</a>(T const&amp; x) const;
+
+    template &lt;class F&gt; <em>tagged lazy default</em> <a class="reference" href="#id10">operator||</a>(F const&amp;) const;
+
+    static keyword&lt;Tag&gt;&amp; <a class="reference" href="#get">get</a>();
+};
+</pre>
+<dl class="docutils" id="operator">
+<dt><tt class="docutils literal"><span class="pre">operator=</span></tt></dt>
+<dd><pre class="first literal-block">
+template &lt;class T&gt; <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> operator=(T&amp; value) const;
+template &lt;class T&gt; <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> operator=(T const&amp; value) const;
+</pre>
+<table class="last docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Requires:</th><td class="field-body">nothing</td>
+</tr>
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body">an <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a>  containing a single <a class="reference" href="#tagged-reference">tagged reference</a> to
+<tt class="docutils literal"><span class="pre">value</span></tt> with <a class="reference" href="#kw">keyword</a> <tt class="docutils literal"><span class="pre">Tag</span></tt></td>
+</tr>
+</tbody>
+</table>
+</dd>
+</dl>
+<dl class="docutils" id="id9">
+<dt><tt class="docutils literal"><span class="pre">operator|</span></tt></dt>
+<dd><pre class="first literal-block">
+template &lt;class T&gt; <em>tagged default</em> operator|(T&amp; x) const;
+template &lt;class T&gt; <em>tagged default</em> operator|(T const&amp; x) const;
+</pre>
+<table class="last docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body">a <a class="reference" href="#tagged-default">tagged default</a> with <em>value</em> <tt class="docutils literal"><span class="pre">x</span></tt> and <a class="reference" href="#kw">keyword</a> <tt class="docutils literal"><span class="pre">Tag</span></tt>.</td>
+</tr>
+</tbody>
+</table>
+</dd>
+</dl>
+<dl class="docutils" id="id10">
+<dt><tt class="docutils literal"><span class="pre">operator||</span></tt></dt>
+<dd><pre class="first literal-block">
+template &lt;class F&gt; <em>tagged lazy default</em> operator||(F const&amp; g) const;
+</pre>
+<table class="last docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">g()</span></tt> is valid, with type <tt class="docutils literal"><span class="pre">boost::</span></tt><a class="reference" href="../../../utility/utility.htm#result_of"><tt class="docutils literal"><span class="pre">result_of</span></tt></a><tt class="docutils literal"><span class="pre">&lt;F()&gt;::type</span></tt>.<a class="footnote-reference" href="#no-result-of" id="id11" name="id11"><sup>2</sup></a></td>
+</tr>
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body">a <a class="reference" href="#tagged-lazy-default">tagged lazy default</a> with <em>value</em> <tt class="docutils literal"><span class="pre">g</span></tt> and <a class="reference" href="#kw">keyword</a> <tt class="docutils literal"><span class="pre">Tag</span></tt>.</td>
+</tr>
+</tbody>
+</table>
+</dd>
+</dl>
+<dl class="docutils" id="get">
+<dt><tt class="docutils literal"><span class="pre">get</span></tt></dt>
+<dd><pre class="first literal-block">
+static keyword&lt;Tag&gt;&amp; get();
+</pre>
+<table class="last docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body">a “singleton instance”: the same object will be
+returned on each invocation of <tt class="docutils literal"><span class="pre">get()</span></tt>.</td>
+</tr>
+<tr class="field"><th class="field-name">Thread Safety:</th><td class="field-body"><tt class="docutils literal"><span class="pre">get()</span></tt> can be called from multiple threads
+simultaneously.</td>
+</tr>
+</tbody>
+</table>
+</dd>
+</dl>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id37" id="parameters" name="parameters">4.2&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">parameters</span></tt></a></h2>
+<p>Provides an interface for assembling the actual arguments to a
+<cite>forwarding function</cite> into an <span class="concept">ArgumentPack</span>, in which any
+<a class="reference" href="#positional">positional</a> arguments will be tagged according to the
+corresponding template argument to <tt class="docutils literal"><span class="pre">parameters</span></tt>.</p>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/parameters.hpp">boost/parameter/parameters.hpp</a></td>
+</tr>
+</tbody>
+</table>
+<pre class="literal-block">
+template &lt;class P0 = <em>unspecified</em>, class P1 = <em>unspecified</em>, …class Pβ = <em>unspecified</em>&gt;
+struct parameters
+{
+    template &lt;class A0, class A1 = <em>unspecified</em>, …class Aβ = <em>unspecified</em>&gt;
+    struct <a class="reference" href="#match">match</a>
+    {
+        typedef … type;
+    };
+
+    template &lt;class A0&gt;
+    <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> <a class="reference" href="#id13">operator()</a>(A0 const&amp; a0) const;
+
+    template &lt;class A0, class A1&gt;
+    <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> <a class="reference" href="#id13">operator()</a>(A0 const&amp; a0, A1 const&amp; a1) const; <span class="vellipsis">   .
+   .
+   .
+ </span>
+    template &lt;class A0, class A1, …class Aβ&gt;
+    <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> <a class="reference" href="#id13">operator()</a>(A0 const&amp; a0, A1 const&amp; a1, …Aβ const&amp; aβ) const;
+};
+</pre>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">P0</span></tt>, <tt class="docutils literal"><span class="pre">P1</span></tt>, … <tt class="docutils literal"><span class="pre">P</span></tt>β are models of <a class="reference" href="#parameterspec"><span class="concept">ParameterSpec</span></a>.</td>
+</tr>
+</tbody>
+</table>
+<div class="note">
+<p class="first admonition-title">Note</p>
+<p>In this section, <tt class="docutils literal"><span class="pre">R</span></tt><em>i</em> and <tt class="docutils literal"><span class="pre">K</span></tt><em>i</em> are defined as
+follows, for any argument type <tt class="docutils literal"><span class="pre">A</span></tt><em>i</em>:</p>
+<blockquote class="last">
+<div class="line-block">
+<div class="line"><tt class="docutils literal"><span class="pre">R</span></tt><em>i</em> is <tt class="docutils literal"><span class="pre">A</span></tt><em>i</em>'s <a class="reference" href="#intended-argument-type">intended argument type</a></div>
+<div class="line"><br /></div>
+<div class="line-block">
+<div class="line">if <tt class="docutils literal"><span class="pre">A</span></tt><em>i</em> is a result type of <tt class="docutils literal"><span class="pre">keyword&lt;T&gt;::</span></tt><a class="reference" href="#operator"><tt class="docutils literal"><span class="pre">operator=</span></tt></a></div>
+<div class="line">then</div>
+<div class="line-block">
+<div class="line"><tt class="docutils literal"><span class="pre">K</span></tt><em>i</em> is <tt class="docutils literal"><span class="pre">T</span></tt></div>
+</div>
+<div class="line">else</div>
+<div class="line-block">
+<div class="line"><tt class="docutils literal"><span class="pre">K</span></tt><em>i</em> is <tt class="docutils literal"><span class="pre">P</span></tt><em>i</em>'s <a class="reference" href="#keyword-tag-type">keyword tag type</a>.</div>
+</div>
+</div>
+</div>
+</blockquote>
+</div>
+<dl class="docutils" id="match">
+<dt><tt class="docutils literal"><span class="pre">match</span></tt></dt>
+<dd><p class="first">A <a class="reference" href="../../../mpl/doc/refmanual/metafunction.html"><span class="concept">Metafunction</span></a> used to remove a <a class="reference" href="index.html#forwarding-functions">forwarding function</a> from overload resolution.</p>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body">if <tt class="docutils literal"><span class="pre">P0</span></tt>, <tt class="docutils literal"><span class="pre">P1</span></tt>, …<tt class="docutils literal"><span class="pre">P</span></tt>β are <em>satisfied</em> (see
+below), then <tt class="docutils literal"><span class="pre">parameters&lt;P0,P1,…Pβ&gt;</span></tt>.  Otherwise,
+<tt class="docutils literal"><span class="pre">match&lt;A0,A1,…Aβ&gt;::type</span></tt> is not defined.</td>
+</tr>
+</tbody>
+</table>
+<p><tt class="docutils literal"><span class="pre">P0</span></tt>, <tt class="docutils literal"><span class="pre">P1</span></tt>, …<tt class="docutils literal"><span class="pre">P</span></tt>β are <strong>satisfied</strong> if, for
+every <em>j</em> in 0…β, either:</p>
+<ul class="last simple">
+<li><tt class="docutils literal"><span class="pre">P</span></tt><em>j</em> is the <em>unspecified</em> default</li>
+<li><strong>or</strong>, <tt class="docutils literal"><span class="pre">P</span></tt><em>j</em> is a specialization of <a class="reference" href="#keyword"><tt class="docutils literal"><span class="pre">keyword</span></tt></a>,</li>
+<li><strong>or</strong>, <tt class="docutils literal"><span class="pre">P</span></tt><em>j</em> is <a class="reference" href="#optional"><tt class="docutils literal"><span class="pre">optional</span></tt></a> <tt class="docutils literal"><span class="pre">&lt;X,F&gt;</span></tt> and either<ul>
+<li><tt class="docutils literal"><span class="pre">X</span></tt> is not <tt class="docutils literal"><span class="pre">K</span></tt><em>i</em> for any <em>i</em>,</li>
+<li><strong>or</strong> <tt class="docutils literal"><span class="pre">X</span></tt> is some <tt class="docutils literal"><span class="pre">K</span></tt><em>i</em>  and <tt class="docutils literal"><span class="pre">mpl::apply&lt;F,R</span></tt><em>i</em><tt class="docutils literal"><span class="pre">&gt;::type::value</span></tt> is <tt class="docutils literal"><span class="pre">true</span></tt></li>
+</ul>
+</li>
+<li><strong>or</strong>, <tt class="docutils literal"><span class="pre">P</span></tt><em>j</em> is <a class="reference" href="#required"><tt class="docutils literal"><span class="pre">required</span></tt></a> <tt class="docutils literal"><span class="pre">&lt;X,F&gt;</span></tt>, and<ul>
+<li><tt class="docutils literal"><span class="pre">X</span></tt> is some <tt class="docutils literal"><span class="pre">K</span></tt><em>i</em>, <strong>and</strong></li>
+<li><tt class="docutils literal"><span class="pre">mpl::apply&lt;F,R</span></tt><em>i</em><tt class="docutils literal"><span class="pre">&gt;::type::value</span></tt> is <tt class="docutils literal"><span class="pre">true</span></tt></li>
+</ul>
+</li>
+</ul>
+</dd>
+</dl>
+<dl class="docutils" id="id13">
+<dt><tt class="docutils literal"><span class="pre">operator()</span></tt></dt>
+<dd><pre class="first literal-block">
+template &lt;class A0&gt; <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> operator()(A0 const&amp; a0) const; <span class="vellipsis">  .
+  .
+  .
+ </span>
+template &lt;class A0, …class Aβ&gt; <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> <a class="reference" href="#id13">operator()</a>(A0 const&amp; a0, …Aβ const&amp; aβ) const;
+</pre>
+<table class="last docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><p class="first">An <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a> containing, for each <tt class="docutils literal"><span class="pre">a</span></tt><em>i</em>,</p>
+<ul class="last simple">
+<li>if <tt class="docutils literal"><span class="pre">a</span></tt><em>i</em>,  is a single-element <span class="concept">ArgumentPack</span>, its element</li>
+<li>Otherwise, a <a class="reference" href="#tagged-reference">tagged reference</a> with <a class="reference" href="#kw">keyword</a> <tt class="docutils literal"><span class="pre">K</span></tt><em>i</em> and <em>value</em> <tt class="docutils literal"><span class="pre">a</span></tt><em>i</em></li>
+</ul>
+</td>
+</tr>
+</tbody>
+</table>
+</dd>
+</dl>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id38" id="optional-required" name="optional-required"><span id="required"></span><span id="optional"></span>4.3&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">optional</span></tt>, <tt class="docutils literal"><span class="pre">required</span></tt></a></h2>
+<p>These templates describe the requirements on a function parameter.</p>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/parameters.hpp">boost/parameter/parameters.hpp</a></td>
+</tr>
+</tbody>
+</table>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name" colspan="2">Specializations model:</th></tr>
+<tr><td>&nbsp;</td><td class="field-body"><a class="reference" href="#parameterspec"><span class="concept">ParameterSpec</span></a></td>
+</tr>
+</tbody>
+</table>
+<pre class="literal-block">
+template &lt;class Tag, class Predicate = <em>unspecified</em>&gt;
+struct optional;
+
+template &lt;class Tag, class Predicate = <em>unspecified</em>&gt;
+struct required;
+</pre>
+<p>The default value of <tt class="docutils literal"><span class="pre">Predicate</span></tt> is an unspecified <a class="reference" href="../../../mpl/doc/refmanual/metafunction.html"><span class="concept">Metafunction</span></a> that returns
+<tt class="docutils literal"><span class="pre">mpl::true_</span></tt> for any argument.</p>
+</div>
+</div>
+<hr class="docutils" />
+<div class="section">
+<h1><a class="toc-backref" href="#id39" id="metafunctions" name="metafunctions">5&nbsp;&nbsp;&nbsp;Metafunctions</a></h1>
+<p>A <a class="reference" href="../../../mpl/doc/refmanual/metafunction.html"><span class="concept">Metafunction</span></a> is conceptually a function that operates on, and
+returns, C++ types.</p>
+<div class="section">
+<h2><a class="toc-backref" href="#id40" id="binding" name="binding">5.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">binding</span></tt></a></h2>
+<p>Returns the result type of indexing an argument pack with a
+<a class="reference" href="#keyword-tag-type">keyword tag type</a> or with a <a class="reference" href="#tagged-default">tagged default</a>.</p>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Defined n:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/binding.hpp">boost/parameter/binding.hpp</a></td>
+</tr>
+</tbody>
+</table>
+<pre class="literal-block">
+template &lt;class A, class K, class D = void&gt;
+struct binding
+{
+    typedef … type;
+};
+</pre>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">A</span></tt> is a model of <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a>.</td>
+</tr>
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body">the reference type of the <a class="reference" href="#tagged-reference">tagged reference</a> in <tt class="docutils literal"><span class="pre">A</span></tt>
+having <a class="reference" href="#keyword-tag-type">keyword tag type</a> <tt class="docutils literal"><span class="pre">K</span></tt>, if any.  If no such <a class="reference" href="#tagged-reference">tagged reference</a> exists, returns <tt class="docutils literal"><span class="pre">D</span></tt>.</td>
+</tr>
+</tbody>
+</table>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id41" id="lazy-binding" name="lazy-binding">5.2&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">lazy_binding</span></tt></a></h2>
+<p>Returns the result type of indexing an argument pack with a <a class="reference" href="#tagged-lazy-default">tagged lazy default</a>.</p>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/binding.hpp">boost/parameter/binding.hpp</a></td>
+</tr>
+</tbody>
+</table>
+<pre class="literal-block">
+template &lt;class A, class K, class F&gt;
+struct lazy_binding
+{
+    typedef … type;
+};
+</pre>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">A</span></tt> is a model of <a class="reference" href="#argumentpack"><span class="concept">ArgumentPack</span></a>.</td>
+</tr>
+<tr class="field"><th class="field-name">Returns:</th><td class="field-body">the reference type of the <a class="reference" href="#tagged-reference">tagged reference</a> in <tt class="docutils literal"><span class="pre">A</span></tt>
+having <a class="reference" href="#keyword-tag-type">keyword tag type</a> <tt class="docutils literal"><span class="pre">K</span></tt>, if any.  If no such <a class="reference" href="#tagged-reference">tagged reference</a> exists, returns <tt class="docutils literal"><span class="pre">boost::</span></tt><a class="reference" href="../../../utility/utility.htm#result_of"><tt class="docutils literal"><span class="pre">result_of</span></tt></a><tt class="docutils literal"><span class="pre">&lt;F()&gt;::type</span></tt>.<a class="footnote-reference" href="#no-result-of" id="id17" name="id17"><sup>2</sup></a></td>
+</tr>
+</tbody>
+</table>
+</div>
+</div>
+<hr class="docutils" />
+<div class="section">
+<h1><a class="toc-backref" href="#id42" id="code-generation-macros" name="code-generation-macros">6&nbsp;&nbsp;&nbsp;Code Generation Macros</a></h1>
+<p>Macros in this section can be used to ease the writing of code
+using the Parameter libray by eliminating repetitive boilerplate.</p>
+<div class="section">
+<h2><a class="toc-backref" href="#id43" id="boost-parameter-function-result-name-tag-namespace-arguments" name="boost-parameter-function-result-name-tag-namespace-arguments">6.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUNCTION(result,name,tag_namespace,arguments)</span></tt></a></h2>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/preprocessor.hpp">boost/parameter/preprocessor.hpp</a></td>
+</tr>
+</tbody>
+</table>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><p class="first"><tt class="docutils literal"><span class="pre">result</span></tt> is the parenthesized return type of the function.
+<tt class="docutils literal"><span class="pre">name</span></tt> is the base name of the function, this is the name of the
+generated forwarding functions. <tt class="docutils literal"><span class="pre">tag_namespace</span></tt> is the namespace in
+which the keywords used by the function resides. <tt class="docutils literal"><span class="pre">arguments</span></tt> is
+a list of <em>argument specifiers</em>, as defined below.</p>
+</td>
+</tr>
+<tr class="field"><th class="field-name" colspan="2">Argument specifiers syntax:</th></tr>
+<tr><td>&nbsp;</td><td class="field-body"><pre class="first literal-block">
+argument-specifiers ::= specifier-group {specifier-group}
+
+specifier-group ::= ( '(' 'optional' optional-specifier {optional-specifier} ')' ) |
+                    ( '(' 'required' required-specifier {required-specifier} ')' )
+
+optional-specifier ::= '(' name ',' restriction ',' default-value ')'
+required-specifier ::= '(' name ',' restriction ')'
+
+restriction ::= ('*' '(' lambda-expression ')' ) |
+                ( '(' typename ')' ) |
+                '*'
+</pre>
+<p class="last"><tt class="docutils literal"><span class="pre">name</span></tt> is any valid C++ identifier. <tt class="docutils literal"><span class="pre">default-value</span></tt> is any valid
+C++ expression. <tt class="docutils literal"><span class="pre">typename</span></tt> is the name of a type.
+<tt class="docutils literal"><span class="pre">lambda-expression</span></tt> is an <a class="reference" href="../../../mpl/doc/refmanual/lambda-expression.html">MPL lambda expression</a>.</p>
+</td>
+</tr>
+</tbody>
+</table>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name" colspan="2">Generated names in enclosing scope:</th></tr>
+<tr><td>&nbsp;</td><td class="field-body"><ul class="first last simple">
+<li><tt class="docutils literal"><span class="pre">boost_param_result_</span> <span class="pre">##</span> <span class="pre">__LINE__</span> <span class="pre">##</span> <span class="pre">name</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">boost_param_params_</span> <span class="pre">##</span> <span class="pre">__LINE__</span> <span class="pre">##</span> <span class="pre">name</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">boost_param_parameters_</span> <span class="pre">##</span> <span class="pre">__LINE__</span> <span class="pre">##</span> <span class="pre">name</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">boost_param_impl</span> <span class="pre">##</span> <span class="pre">name</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">boost_param_default_</span> <span class="pre">##</span> <span class="pre">__LINE__</span> <span class="pre">##</span> <span class="pre">name</span></tt></li>
+</ul>
+</td>
+</tr>
+</tbody>
+</table>
+<dl class="docutils">
+<dt>Approximate expansion:</dt>
+<dd><p class="first"><strong>Where</strong>:</p>
+<ul class="simple">
+<li><tt class="docutils literal"><span class="pre">n</span></tt> denotes the <em>minimum</em> arity, as determined from <tt class="docutils literal"><span class="pre">arguments</span></tt>.</li>
+<li><tt class="docutils literal"><span class="pre">m</span></tt> denotes the <em>maximum</em> arity, as determined from <tt class="docutils literal"><span class="pre">arguments</span></tt>.</li>
+</ul>
+<pre class="last literal-block">
+template &lt;class T&gt;
+struct boost_param_result_ ## __LINE__ ## <strong>name</strong>
+{
+    typedef <strong>result</strong> type;
+};
+
+struct boost_param_params_ ## __LINE__ ## <strong>name</strong>
+  : boost::parameter::parameters&lt;
+        <em>list of parameter specifications, based on arguments</em>
+    &gt;
+{};
+
+typedef boost_param_params_ ## __LINE__ ## <strong>name</strong>
+  boost_param_parameters_ ## __LINE__ ## <strong>name</strong>;
+
+template &lt;class A0, …, class A<strong>n</strong>&gt;
+<em>result type</em> <strong>name</strong>(
+    A0 <em>cv</em>&amp; a0, …, A<strong>n</strong> <em>cv</em>&amp; a<strong>n</strong>
+  , typename boost_param_parameters_ ## __LINE__ ## <strong>name</strong>::match&lt;
+      A0 <em>cv</em>, …, A<strong>n</strong> <em>cv</em>
+    &gt;::type = boost_param_parameters_ ## __LINE__ ## <strong>name</strong>()
+)
+{
+    <em>… forward to implementation …</em>
+}
+
+<span class="vellipsis">  .
+  .
+  .
+ </span>
+
+template &lt;class A0, …, class A<strong>m</strong>&gt;
+<em>result type</em> <strong>name</strong>(
+    A0 <em>cv</em>&amp; a0, …, A<strong>m</strong> <em>cv</em>&amp; a<strong>m</strong>
+  , typename boost_param_parameters_ ## __LINE__ ## <strong>name</strong>::match&lt;
+      A0 <em>cv</em>, …, A<strong>m</strong> <em>cv</em>
+    &gt;::type = boost_param_parameters_ ## __LINE__ ## <strong>name</strong>()
+)
+{
+    <em>… forward to implementation …</em>
+}
+
+template &lt;
+    class ResultType
+  , class <em>argument name</em><strong>0</strong> ## _type
+    …
+  , class <em>argument name</em><strong>m</strong> ## _type
+&gt;
+ResultType boost_param_default_ ## __LINE__ ## <strong>name</strong>(
+    (ResultType(*)())
+  , <em>argument name</em><strong>0</strong> ## _type&amp; <em>argument name</em><strong>0</strong>
+    …
+  , <em>argument name</em><strong>m</strong> ## _type&amp; <em>argument name</em><strong>m</strong>
+)
+</pre>
+</dd>
+</dl>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id44" id="boost-parameter-fun-r-n-l-h-p" name="boost-parameter-fun-r-n-l-h-p">6.2&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_FUN(r,n,l,h,p)</span></tt></a></h2>
+<p>Generates a sequence of <a class="reference" href="index.html#forwarding-functions">forwarding function</a> templates named
+<tt class="docutils literal"><span class="pre">n</span></tt>, with arities ranging from <tt class="docutils literal"><span class="pre">l</span></tt> to <tt class="docutils literal"><span class="pre">h</span></tt> , returning <tt class="docutils literal"><span class="pre">r</span></tt>,
+and using <tt class="docutils literal"><span class="pre">p</span></tt> to control overload resolution and assign tags to
+positional arguments.</p>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/macros.hpp">boost/parameter/macros.hpp</a></td>
+</tr>
+</tbody>
+</table>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="docutils literal"><span class="pre">l</span></tt> and <tt class="docutils literal"><span class="pre">h</span></tt> are nonnegative integer tokens such
+that <tt class="docutils literal"><span class="pre">l</span></tt> &lt; <tt class="docutils literal"><span class="pre">h</span></tt></td>
+</tr>
+</tbody>
+</table>
+<dl class="docutils">
+<dt>Generates</dt>
+<dd><pre class="first last literal-block">
+template &lt;class A1, class A2, …class A##<strong>l</strong>&gt;
+r name(
+    A1 const&amp; a1, A2 const&amp; a2, …A<strong>l</strong> const&amp; x<strong>l</strong>
+  , typename <strong>p</strong>::match&lt;A1,A2,…A<strong>l</strong>&gt;::type p = <strong>p</strong>())
+{
+   return <strong>name</strong>_with_named_params(<strong>p</strong>(x1,x2,…x<strong>l</strong>));
+}
+
+template &lt;class A1, class A2, …class A<strong>l</strong>, class A##<a class="reference" href="../../../preprocessor/doc/ref/inc.html">BOOST_PP_INC</a>(<strong>l</strong>)&gt;
+r name(
+    A1 const&amp; a1, A2 const&amp; a2, …A<strong>l</strong> const&amp; x<strong>l</strong>
+  , A##<a class="reference" href="../../../preprocessor/doc/ref/inc.html">BOOST_PP_INC</a>(<strong>l</strong>) const&amp; x##<a class="reference" href="../../../preprocessor/doc/ref/inc.html">BOOST_PP_INC</a>(<strong>l</strong>)
+  , typename <strong>p</strong>::match&lt;A1,A2,…A<strong>l</strong>,A##<a class="reference" href="../../../preprocessor/doc/ref/inc.html">BOOST_PP_INC</a>(<strong>l</strong>)&gt;::type p = <strong>p</strong>())
+{
+   return <strong>name</strong>_with_named_params(<strong>p</strong>(x1,x2,…x<strong>l</strong>,x##<a class="reference" href="../../../preprocessor/doc/ref/inc.html">BOOST_PP_INC</a>(<strong>l</strong>)));
+} <span class="vellipsis">  .
+  .
+  .
+ </span>
+template &lt;class A1, class A2, …class A<strong>h</strong>&gt;
+r name(
+    A1 const&amp; a1, A2 const&amp; a2, …A<strong>h</strong> const&amp; x<strong>h</strong>
+  , typename <strong>p</strong>::match&lt;A1,A2,…A<strong>h</strong>&gt;::type p = <strong>p</strong>())
+{
+   return <strong>name</strong>_with_named_params(<strong>p</strong>(a1,a2,…a<strong>h</strong>));
+}
+</pre>
+</dd>
+</dl>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id45" id="boost-parameter-keyword-n-k" name="boost-parameter-keyword-n-k">6.3&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_KEYWORD(n,k)</span></tt></a></h2>
+<p>Generates the declaration of a <a class="reference" href="#keyword-tag-type">keyword tag type</a> named <tt class="docutils literal"><span class="pre">k</span></tt> in
+namespace <tt class="docutils literal"><span class="pre">n</span></tt>, and a corresponding <a class="reference" href="#keyword-object">keyword object</a> definition in
+the enclosing namespace.</p>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/keyword.hpp">boost/parameter/keyword.hpp</a></td>
+</tr>
+</tbody>
+</table>
+<dl class="docutils">
+<dt>Generates</dt>
+<dd><pre class="first last literal-block">
+namespace <strong>n</strong> { struct <strong>k</strong>; }
+namespace {
+  boost::parameter::keyword&lt;<em>tag-namespace</em>::<strong>k</strong>&gt;&amp; <strong>k</strong>
+  = boost::parameter::keyword&lt;<em>tag-namespace</em>::<strong>k</strong>&gt;::get();
+}
+</pre>
+</dd>
+</dl>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id46" id="boost-parameter-match-p-a-x" name="boost-parameter-match-p-a-x">6.4&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_MATCH(p,a,x)</span></tt></a></h2>
+<p>Generates a defaulted parameter declaration for a <a class="reference" href="index.html#forwarding-functions">forwarding
+function</a>.</p>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/match.hpp">boost/parameter/match.hpp</a></td>
+</tr>
+</tbody>
+</table>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><p class="first"><tt class="docutils literal"><span class="pre">a</span></tt> is a <a class="reference" href="http://www.boost.org/libs/preprocessor/doc/data.html">Boost.Preprocessor sequence</a>
+of the form</p>
+<pre class="last literal-block">
+(A0)(A1)…(A<em>n</em>)
+</pre>
+</td>
+</tr>
+</tbody>
+</table>
+<dl class="docutils">
+<dt>Generates</dt>
+<dd><pre class="first last literal-block">
+typename <strong>p</strong>::match&lt;<strong>A0</strong>,<strong>A1</strong>…,<strong>A</strong><em>n</em>&gt;::type <strong>x</strong> = <strong>p</strong>()
+</pre>
+</dd>
+</dl>
+</div>
+</div>
+<div class="section">
+<h1><a class="toc-backref" href="#id47" id="configuration-macros" name="configuration-macros">7&nbsp;&nbsp;&nbsp;Configuration Macros</a></h1>
+<div class="section">
+<h2><a class="toc-backref" href="#id48" id="boost-parameter-max-arity" name="boost-parameter-max-arity">7.1&nbsp;&nbsp;&nbsp;<tt class="docutils literal"><span class="pre">BOOST_PARAMETER_MAX_ARITY</span></tt></a></h2>
+<p>Determines the maximum number of arguments supported by the
+library.  Will only be <tt class="docutils literal"><span class="pre">#defined</span></tt> by the library if it is not
+already <tt class="docutils literal"><span class="pre">#defined</span></tt>.</p>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Defined in:</th><td class="field-body"><a class="reference" href="../../../../boost/parameter/config.hpp">boost/parameter/config.hpp</a></td>
+</tr>
+</tbody>
+</table>
+<table class="docutils field-list" frame="void" rules="none">
+<col class="field-name" />
+<col class="field-body" />
+<tbody valign="top">
+<tr class="field"><th class="field-name">Default Value:</th><td class="field-body"><tt class="docutils literal"><span class="pre">5</span></tt></td>
+</tr>
+</tbody>
+</table>
+</div>
+</div>
+<div class="section">
+<h1><a class="toc-backref" href="#id49" id="tutorial" name="tutorial">8&nbsp;&nbsp;&nbsp;Tutorial</a></h1>
+<p>Follow <a class="reference" href="index.html#tutorial">this link</a> to the Boost.Parameter tutorial
+documentation.</p>
+<hr class="docutils" />
+<table class="docutils footnote" frame="void" id="thread" rules="none">
+<colgroup><col class="label" /><col /></colgroup>
+<tbody valign="top">
+<tr><td class="label"><a class="fn-backref" href="#id2" name="thread">[1]</a></td><td>References to tag objects may be initialized multiple
+times.  This scenario can only occur in the presence of
+threading.  Because the C++ standard doesn't consider threading,
+it doesn't explicitly allow or forbid multiple initialization of
+references.  That said, it's hard to imagine an implementation
+where it could make a difference.</td></tr>
+</tbody>
+</table>
+<table class="docutils footnote" frame="void" id="no-result-of" rules="none">
+<colgroup><col class="label" /><col /></colgroup>
+<tbody valign="top">
+<tr><td class="label"><a name="no-result-of">[2]</a></td><td><em>(<a class="fn-backref" href="#id11">1</a>, <a class="fn-backref" href="#id17">2</a>)</em> Where <a class="reference" href="../../../utility/utility.htm#BOOST_NO_RESULT_OF"><tt class="docutils literal"><span class="pre">BOOST_NO_RESULT_OF</span></tt></a> is <tt class="docutils literal"><span class="pre">#defined</span></tt>,
+<tt class="docutils literal"><span class="pre">boost::</span></tt><a class="reference" href="../../../utility/utility.htm#result_of"><tt class="docutils literal"><span class="pre">result_of</span></tt></a><tt class="docutils literal"><span class="pre">&lt;F()&gt;::type</span></tt> is replaced by
+<tt class="docutils literal"><span class="pre">F::result_type</span></tt>.</td></tr>
+</tbody>
+</table>
+</div>
+</div>
+<div class="footer">
+<hr class="footer" />
+Generated on: 2007-01-03 17:02 UTC.
+Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
+
+</div>
+</body>
+</html>

Modified: boost/trunk/libs/parameter/doc/html/rst.css
===================================================================
--- boost/trunk/libs/parameter/doc/html/rst.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/doc/html/rst.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+/* 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) 
+*/
+
 @import "../../../../rst.css";
 
 div.section div.section div.section dl {

Modified: boost/trunk/libs/parameter/doc/index.rst
===================================================================
--- boost/trunk/libs/parameter/doc/index.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/doc/index.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,19 +16,58 @@
 
   .. parsed-literal::
 
-    new_window("alert", **width=10**, **titlebar=false**);
+    new_window("alert", **_width=10**, **_titlebar=false**);
 
     smart_ptr<
        Foo 
-     , **deleter_is<Deallocate<Foo> >**
-     , **copy_policy_is<DeepCopy>**> p(new Foo);
+     , **deleter<Deallocate<Foo> >**
+     , **copy_policy<DeepCopy>** > p(new Foo);
     
   Since named arguments can be passed in any order, they are
   especially useful when a function or template has more than one
   parameter with a useful default value.  The library also supports
-  *unnamed* parameters; that is to say, parameters whose identity
+  *deduced* parameters; that is to say, parameters whose identity
   can be deduced from their types.
 
+.. @jam_prefix.append('''
+        project test : requirements <include>. <source>/boost//headers ;''')
+
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
+   
+   namespace test
+   {
+     BOOST_PARAMETER_NAME(title)
+     BOOST_PARAMETER_NAME(width)
+     BOOST_PARAMETER_NAME(titlebar)
+   
+     BOOST_PARAMETER_FUNCTION(
+        (int), new_window, tag, (required (title,*)(width,*)(titlebar,*)))
+     {
+        return 0;
+     }
+     
+     BOOST_PARAMETER_TEMPLATE_KEYWORD(deleter)
+     BOOST_PARAMETER_TEMPLATE_KEYWORD(copy_policy)
+
+     template <class T> struct Deallocate {};
+     struct DeepCopy {};
+
+     namespace parameter = boost::parameter;
+     
+     struct Foo {};
+     template <class T, class A0, class A1>
+     struct smart_ptr
+     {
+         smart_ptr(Foo*);
+     };
+   }
+   using namespace test;
+   int x = ''');
+
+.. @test('compile')
+
+
 -------------------------------------
 
 :Authors:       David Abrahams, Daniel Wallin
@@ -36,8 +75,8 @@
 :Organization:  `Boost Consulting`_
 :Date:          $Date: 2005/07/18 20:34:31 $
 
-:Copyright:     Copyright David Abrahams, Daniel Wallin
-                2005. Distributed under the Boost Software License,
+:Copyright:     Copyright David Abrahams, Daniel Wallin 2005. 
+                Distributed under the Boost Software License,
                 Version 1.0. (See accompanying file LICENSE_1_0.txt
                 or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -59,106 +98,146 @@
 
 -------------------------------------
 
-==============
+============
  Motivation
-==============
+============
 
-In C++, arguments are normally given meaning by their positions
-with respect to a parameter list.  That protocol is fine when there
-is at most one parameter with a default value, but when there are
-even a few useful defaults, the positional interface becomes
-burdensome:
+In C++, arguments_ are normally given meaning by their positions
+with respect to a parameter_ list: the first argument passed maps
+onto the first parameter in a function's definition, and so on.
+That protocol is fine when there is at most one parameter with a
+default value, but when there are even a few useful defaults, the
+positional interface becomes burdensome:
 
-* Since an argument's meaning is given by its position, we have to
-  choose an (often arbitrary) order for parameters with default
-  values, making some combinations of defaults unusable:
+* .. compound::
 
-  .. parsed-literal::
+    Since an argument's meaning is given by its position, we have to
+    choose an (often arbitrary) order for parameters with default
+    values, making some combinations of defaults unusable:
 
-    window* new_window(
-       char const* name, 
-       **int border_width = default_border_width,**
-       bool movable = true,
-       bool initially_visible = true
-       );
+    .. parsed-literal::
 
-    const bool movability = false;
-    window* w = new_window("alert box", movability);
+      window* new_window(
+         char const* name, 
+         **int border_width = default_border_width,**
+         bool movable = true,
+         bool initially_visible = true
+         );
 
-  In the example above we wanted to make an unmoveable window
-  with a default ``border_width``, but instead we got a moveable
-  window with a ``border_width`` of zero.  To get the desired
-  effect, we'd need to write:
+      const bool movability = false;
+      window* w = new_window("alert box", movability);
 
-  .. parsed-literal::
+    In the example above we wanted to make an unmoveable window
+    with a default ``border_width``, but instead we got a moveable
+    window with a ``border_width`` of zero.  To get the desired
+    effect, we'd need to write:
 
-    window* w = new_window(
-       "alert box", **default_border_width**, movability);
+    .. parsed-literal::
 
+       window* w = new_window(
+          "alert box", **default_border_width**, movability);
 
-* It can become difficult for readers to understand the meaning of
-  arguments at the call site::
+* .. compound::
 
-    window* w = new_window("alert", 1, true, false);
+    It can become difficult for readers to understand the meaning of
+    arguments at the call site::
 
-  Is this window moveable and initially invisible, or unmoveable
-  and initially visible?  The reader needs to remember the order
-  of arguments to be sure.  
+      window* w = new_window("alert", 1, true, false);
 
+    Is this window moveable and initially invisible, or unmoveable
+    and initially visible?  The reader needs to remember the order
+    of arguments to be sure.  
+
 * The author of the call may not remember the order of the
   arguments either, leading to hard-to-find bugs.
 
-This library addresses the problems outlined above by associating
-each parameter with a keyword object.  Now users can identify
-arguments by keyword, rather than by position:
+.. @ignore(3)
 
-.. parsed-literal::
+-------------------------
+Named Function Parameters
+-------------------------
 
-  window* w = new_window("alert box", **movable=**\ false); // OK!
+.. compound::
 
-It's not uncommon for a function to have parameters that can be
-uniquely identified based on the types of arguments passed.  The
-``name`` parameter to ``new_window`` is one such example.  None of
-the other arguments, if valid, can reasonably be converted to a
-``char const*``, so in theory a user could pass the window name in
-*any* argument position without causing ambiguity.  The Parameter
-library's **unnamed parameter** facility can be employed to allow
-that usage:
+  This library addresses the problems outlined above by associating
+  each parameter name with a keyword object.  Now users can identify
+  arguments by name, rather than by position:
 
-.. parsed-literal::
+  .. parsed-literal::
 
-  window* w = new_window(movable=false, **"alert box"**); // OK!
+    window* w = new_window("alert box", **movable_=**\ false); // OK!
 
-Appropriately used, an unnamed parameter interface can free the
-user of the burden of even remembering the formal parameter names.
+.. @ignore()
 
-The reasoning we've given for named and unnamed parameter
-interfaces applies equally well to class templates as it does to
-functions.  The syntax for passing named template parameters is not
-quite as natural as it is for named function parameters:
+---------------------------
+Deduced Function Parameters
+---------------------------
 
-.. parsed-literal::
+.. compound::
 
-  // *The ideal would be*
-  //    *smart_ptr<ownership=shared, value_type=Client> p;*
-  // 
-  // *but instead we must write something like:*
-  smart_ptr<**ownership<shared>**, **value_type<Client>** > p;
+  A **deduced parameter** can be passed in any position *without*
+  supplying an explicit parameter name.  It's not uncommon for a
+  function to have parameters that can be uniquely identified based
+  on the types of arguments passed.  The ``name`` parameter to
+  ``new_window`` is one such example.  None of the other arguments,
+  if valid, can reasonably be converted to a ``char const*``.  With
+  a deduced parameter interface, we could pass the window name in
+  *any* argument position without causing ambiguity:
 
-This small syntactic deficiency makes unnamed parameters an
-especially big win when used with class templates:
+  .. parsed-literal::
 
-.. parsed-literal::
+    window* w = new_window(movable_=false, **"alert box"**); // OK!
+    window* w = new_window(**"alert box"**, movable_=false); // OK!
 
-  // *p and q could be equivalent, given an unnamed*
-  // *parameter interface.*
-  smart_ptr<**shared**, **Client**> p;
-  smart_ptr<**Client**, **shared**> q;
+  Appropriately used, a deduced parameter interface can free the
+  user of the burden of even remembering the formal parameter
+  names.
 
+.. @ignore()
+
+--------------------------------
+Class Template Parameter Support
+--------------------------------
+
+.. compound::
+
+  The reasoning we've given for named and deduced parameter
+  interfaces applies equally well to class templates as it does to
+  functions.  Using the Parameter library, we can create interfaces
+  that allow template arguments (in this case ``shared`` and
+  ``Client``) to be explicitly named, like this:
+
+  .. parsed-literal::
+
+    smart_ptr<**ownership<shared>**, **value_type<Client>** > p;
+
+  The syntax for passing named template arguments is not quite as
+  natural as it is for function arguments (ideally, we'd be able to
+  write ``smart_ptr<ownership=shared,…>``).  This small syntactic
+  deficiency makes deduced parameters an especially big win when
+  used with class templates:
+
+  .. parsed-literal::
+
+    // *p and q could be equivalent, given a deduced*
+    // *parameter interface.*
+    smart_ptr<**shared**, **Client**> p;
+    smart_ptr<**Client**, **shared**> q;
+
+.. @ignore(2)
+
 ==========
  Tutorial
 ==========
 
+This tutorial shows all the basics—how to build both named- and deduced-parameter
+interfaces to function templates and class templates—and several
+more advanced idioms as well.
+
+---------------------------
+Parameter-Enabled Functions
+---------------------------
+
 In this section we'll show how the Parameter library can be used to
 build an expressive interface to the `Boost Graph library`__\ 's
 |dfs|_ algorithm. [#old_interface]_ 
@@ -196,11 +275,19 @@
 otherwise, you can use the rule above to figure out which header
 to ``#include`` to access any given component of the library.
 
+.. @example.append('''
+   using boost::parameter::keyword;
+   ''')
+
+.. @test('compile')
+
 Also, the examples below will also be written as if the
 namespace alias ::
 
   namespace parameter = boost::parameter;
 
+.. @ignore()
+
 has been declared: we'll write ``parameter::xxx`` instead of
 ``boost::parameter::xxx``.
 
@@ -221,6 +308,8 @@
      , IndexMap index_map
      , ColorMap& color);
 
+.. @ignore()
+
 However, most of the parameters have a useful default value, as
 shown in the table below.
 
@@ -229,97 +318,124 @@
 
 .. table:: ``depth_first_search`` Parameters
 
-  +----------------+----------+----------------------------------+
-  | Parameter Name | Dataflow | Default Value (if any)           |
-  +================+==========+==================================+
-  |``graph``       | in       |none - this argument is required. |
-  +----------------+----------+----------------------------------+
-  |``visitor``     | in       |``boost::dfs_visitor<>()``        |
-  +----------------+----------+----------------------------------+
-  |``root_vertex`` | in       |``*vertices(graph).first``        |
-  +----------------+----------+----------------------------------+
-  |``index_map``   | in       |``get(boost::vertex_index,graph)``|
-  +----------------+----------+----------------------------------+
-  |``color_map``   | out      |an ``iterator_property_map``      |
-  |                |          |created from a ``std::vector`` of |
-  |                |          |``default_color_type`` of size    |
-  |                |          |``num_vertices(graph)`` and using |
-  |                |          |``index_map`` for the index map.  |
-  +----------------+----------+----------------------------------+
+  +----------------+----------+---------------------------------+----------------------------------+
+  | Parameter Name | Dataflow | Type                            | Default Value (if any)           |
+  +================+==========+=================================+==================================+
+  |``graph``       | in       |Model of |IncidenceGraph|_ and   |none - this argument is required. |
+  |                |          ||VertexListGraph|_               |                                  |
+  |                |          |                                 |                                  |
+  +----------------+----------+---------------------------------+----------------------------------+
+  |``visitor``     | in       |Model of |DFSVisitor|_           |``boost::dfs_visitor<>()``        |
+  +----------------+----------+---------------------------------+----------------------------------+
+  |``root_vertex`` | in       |``graph``'s vertex descriptor    |``*vertices(graph).first``        |
+  |                |          |type.                            |                                  |
+  +----------------+----------+---------------------------------+----------------------------------+
+  |``index_map``   | in       |Model of |ReadablePropertyMap|_  |``get(boost::vertex_index,graph)``|
+  |                |          |with key type := ``graph``'s     |                                  |
+  |                |          |vertex descriptor and value type |                                  |
+  |                |          |an integer type.                 |                                  |
+  +----------------+----------+---------------------------------+----------------------------------+
+  |``color_map``   | in/out   |Model of |ReadWritePropertyMap|_ |an ``iterator_property_map``      |
+  |                |          |with key type := ``graph``'s     |created from a ``std::vector`` of |
+  |                |          |vertex descriptor type.          |``default_color_type`` of size    |
+  |                |          |                                 |``num_vertices(graph)`` and using |
+  |                |          |                                 |``index_map`` for the index map.  |
+  +----------------+----------+---------------------------------+----------------------------------+
 
-Don't be intimidated by the complex default values.  For the
-purposes of this exercise, you don't need to understand what they
-mean. Also, we'll show you how the default for ``color_map`` is
-computed later in the tutorial; trust us when we say that the
-complexity of its default will become valuable.
+.. |IncidenceGraph| replace:: :concept:`Incidence Graph`
+.. |VertexListGraph| replace:: :concept:`Vertex List Graph`
+.. |DFSVisitor| replace:: :concept:`DFS Visitor`
+.. |ReadablePropertyMap| replace:: :concept:`Readable Property Map`
+.. |ReadWritePropertyMap| replace:: :concept:`Read/Write Property Map`
 
+.. _`IncidenceGraph`: ../../../graph/doc/IncidenceGraph.html
+.. _`VertexListGraph`: ../../../graph/doc/VertexListGraph.html
+.. _`DFSVisitor`: ../../../graph/doc/DFSVisitor.html
+.. _`ReadWritePropertyMap`: ../../../property_map/ReadWritePropertyMap.html
+.. _`ReadablePropertyMap`: ../../../property_map/ReadablePropertyMap.html
+
+Don't be intimidated by the information in the second and third
+columns above.  For the purposes of this exercise, you don't need
+to understand them in detail.
+
 Defining the Keywords
 =====================
 
 The point of this exercise is to make it possible to call
-``depth_first_search`` with keyword arguments, leaving out any
+``depth_first_search`` with named arguments, leaving out any
 arguments for which the default is appropriate:
 
 .. parsed-literal::
 
-  graphs::depth_first_search(g, **color_map=my_color_map**);
+  graphs::depth_first_search(g, **color_map_=my_color_map**);
 
+.. @ignore()
+
 To make that syntax legal, there needs to be an object called
-``color_map`` with an assignment operator that can accept a
+“\ ``color_map_``\ ” whose assignment operator can accept a
 ``my_color_map`` argument.  In this step we'll create one such
 **keyword object** for each parameter.  Each keyword object will be
 identified by a unique **keyword tag type**.  
 
-We're going to define our interface in namespace ``graphs``.  Since
-users need access to the keyword objects, but not the tag types,
-we'll define the keyword objects so they're acceessible through
-``graphs``, and we'll hide the tag types away in a tested
-namespace, ``graphs::tag``.  The library provides a convenient
-macro for that purpose (MSVC6.x users see this note__)::
+.. Revisit this
 
-  #include <boost/parameter/keyword.hpp>
+  We're going to define our interface in namespace ``graphs``.  Since
+  users need access to the keyword objects, but not the tag types,
+  we'll define the keyword objects so they're accessible through
+  ``graphs``, and we'll hide the tag types away in a nested
+  namespace, ``graphs::tag``.  The library provides a convenient
+  macro for that purpose.
 
+We're going to define our interface in namespace ``graphs``.  The
+library provides a convenient macro for defining keyword objects::
+
+  #include <boost/parameter/name.hpp>
+
   namespace graphs
   {
-    BOOST_PARAMETER_KEYWORD(tag, graph)    // Note: no semicolon
-    BOOST_PARAMETER_KEYWORD(tag, visitor)
-    BOOST_PARAMETER_KEYWORD(tag, root_vertex)
-    BOOST_PARAMETER_KEYWORD(tag, index_map)
-    BOOST_PARAMETER_KEYWORD(tag, color_map)
+    BOOST_PARAMETER_NAME(graph)    // Note: no semicolon
+    BOOST_PARAMETER_NAME(visitor)
+    BOOST_PARAMETER_NAME(root_vertex)
+    BOOST_PARAMETER_NAME(index_map)
+    BOOST_PARAMETER_NAME(color_map)
   }
 
-__ `Compiler Can't See References In Unnamed Namespace`_
+.. @test('compile')
 
-The declaration of the ``visitor`` keyword you see here is
+The declaration of the ``graph`` keyword you see here is
 equivalent to::
 
   namespace graphs 
   {
-    namespace tag 
-    { 
-      // The tag type
-      struct visitor; 
-    }
+    namespace tag { struct graph; } // keyword tag type
 
     namespace // unnamed
     {
-      // A reference to the tag object
-      boost::parameter::keyword<tag::visitor>& visitor
-      = boost::parameter::keyword<tag::visitor>::instance;
+      // A reference to the keyword object
+      boost::parameter::keyword<tag::graph>& _graph
+      = boost::parameter::keyword<tag::graph>::get();
     }
   }
 
-This “fancy dance” involving the unnamed namespace and references
+.. @example.prepend('#include <boost/parameter/keyword.hpp>')
+.. @test('compile')
+
+It defines a *keyword tag type* named ``tag::graph`` and a *keyword
+object* reference named ``_graph``.
+
+This “fancy dance” involving an unnamed namespace and references
 is all done to avoid violating the One Definition Rule (ODR)
 [#odr]_ when the named parameter interface is used by function
 templates that are instantiated in multiple translation
-units.
+units (MSVC6.x users see `this note`__).
 
-A Bare Bones Function Interface
-===============================
+__ `Compiler Can't See References In Unnamed Namespace`_
 
-Next we can write the skeleton of our ``depth_first_search``
-function template.  To declare the function, we'll use the
+Writing the Function
+====================
+
+Now that we have our keywords defined, the function template
+definition follows a simple pattern using the
 ``BOOST_PARAMETER_FUNCTION`` macro::
 
   #include <boost/parameter/preprocessor.hpp>
@@ -327,640 +443,1441 @@
   namespace graphs
   {
     BOOST_PARAMETER_FUNCTION(
-        (void), 
-        depth_first_search, 
+        (void),                // 1. parenthesized return type
+        depth_first_search,    // 2. name of the function template
 
-        tag,
-        (required (graph,*) )
-        (optional (visitor,*) (root_vertex,*) 
-                  (index_map,*) (out(color_map),*) )
+        tag,                   // 3. namespace of tag types
+
+        (required (graph, *) ) // 4. one required parameter, and
+
+        (optional              //    four optional parameters, with defaults
+          (visitor,           *, boost::dfs_visitor<>()) 
+          (root_vertex,       *, *vertices(graph).first) 
+          (index_map,         *, get(boost::vertex_index,graph)) 
+          (in_out(color_map), *, 
+            default_color_map(num_vertices(graph), index_map) ) 
+        )
     )
     {
         // ... body of function goes here...
+        // use graph, visitor, index_map, and color_map
     }
   }
 
-The first argument to ``BOOST_PARAMETER_FUNCTION`` is the
-function's return type, in parentheses.  These parentheses are
-necessary because some types, such as ``std::pair<int,int>``,
-contain commas that would otherwise confuse the preprocessor.  The
-second argument is the name of the resulting function template.
-The third argument is the name of the namespace in which keyword
-types can be found, but most of the interesting information is in
-the fourth argument, which describes the function signature.
+.. @example.prepend('''
+   #include <boost/parameter/name.hpp>
 
-The Signature
--------------
+   BOOST_PARAMETER_NAME(graph)
+   BOOST_PARAMETER_NAME(visitor)
+   BOOST_PARAMETER_NAME(root_vertex)
+   BOOST_PARAMETER_NAME(index_map)
+   BOOST_PARAMETER_NAME(color_map)
 
-The fourth argument to ``BOOST_PARAMETER_FUNCTION`` is a
-`Boost.Preprocessor`_ sequence_ of two elements, describing the
-required and optional parameters to ``depth_first_search``,
-respectively (if the parameters were all required—or all
-optional—the sequence would have had only one element).  The first
-element specifies a single ``required`` parameter, ``graph``::
+   namespace boost {
 
-   (required (graph,*) )
+   template <class T = int>
+   struct dfs_visitor
+   {};
 
-The ``*`` simply indicates that we can pass anything at all to
-``depth_first_search`` as a ``graph``.  The second element of the
-outer sequence lists the ``optional`` arguments.
-Since there are multiple optional arguments, their entries are
-composed into another sequence_.  Note that since the ``color_map`` is an
-“out” parameter, its name has been enclosed in the ``out(…)``
-construct, which indicates to the library that it should be passed
-by non-const reference (for an “in/out” parameter we'd use
-``in_out(…)``).  If you refer back to the `parameter table`_ it
-should be clear that, default values aside, this function signature
-describes the same information.
+   int vertex_index = 0;
 
+   }''')
 
-.. _`Boost.Preprocessor`: ../../preprocessor
-.. _sequence: ../../preprocessor/doc/data/sequences.html
+.. @test('compile')
 
-Exercising the Interface
-------------------------
+The arguments to ``BOOST_PARAMETER_FUNCTION`` are:
 
-We've already gained the ability to call our function with a
-mixture of positional and named arguments::
+1. The return type of the resulting function template.  Parentheses
+   around the return type prevent any commas it might contain from
+   confusing the preprocessor, and are always required.
 
-  int main()
-  {
-      // Make keyword names available without qualification
-      using namespace graphs;
+2. The name of the resulting function template.
 
-      graphs::depth_first_search(
-        'G', 'v',                               // Positional args
-        index_map = "hello, world",             // Named args in
-        root_vertex = 3.5, color_map = false);  // arbitrary order
-  }
+3. The name of a namespace where we can find tag types whose names
+   match the function's parameter names.
 
-Signature Matching and Overloading
-----------------------------------
+4. The function signature.  
 
-We can also observe the effects of using ``required`` and
-``optional`` in the function signature.  Any invocation of
-``depth_first_search`` will compile, as long as it has a ``graph``
-parameter::
+Function Signatures
+===================
 
-  depth_first_search("some-graph");                        // OK
-  depth_first_search(index_map="hello, world", graph='G'); // OK
+Function signatures are described as one or two adjacent
+parenthesized terms (a Boost.Preprocessor_ sequence_) describing
+the function's parameters in the order in which they'd be expected
+if passed positionally.  Any required parameters must come first,
+but the ``(required … )`` clause can be omitted when all the
+parameters are optional.
 
-however, if we leave out the graph argument, the compiler will
-complain that no ``depth_first_search`` matches the arguments::
+.. _Boost.Preprocessor: ../../../preprocessor/index.html
 
-  depth_first_search(root_vertex=3.5);                     // ERROR
+Required Parameters
+-------------------
 
-It's important to note that the parameter library is not forcing a
-compilation error in this case.  If we add another overload of
-``depth_first_search`` that *does* match, the compiler will be
-happy again::
+.. compound::
 
-  // New overload; matches anything
-  template <class T> void depth_first_search(T) {}
+  Required parameters are given first—nested in a ``(required … )``
+  clause—as a series of two-element tuples describing each parameter
+  name and any requirements on the argument type.  In this case there
+  is only a single required parameter, so there's just a single
+  tuple:
 
-  depth_first_search(root_vertex=3.5);                     // OK
+  .. parsed-literal::
 
-This capability depends on your compiler's support for SFINAE. [#sfinae]_
+     (required **(graph, \*)** )
 
-Filling in the Body
-===================
+  Since ``depth_first_search`` doesn't require any particular type
+  for its ``graph`` parameter, we use an asterix to indicate that
+  any type is allowed.  Required parameters must always precede any
+  optional parameters in a signature, but if there are *no*
+  required parameters, the ``(required … )`` clause can be omitted
+  entirely.
 
-.. |ArgumentPack| replace:: :concept:`ArgumentPack`
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
 
-Of course, the test above isn't very interesting unless we can see
-the values of the arguments.  Just to get a feel for how things
-work, let's add some temporary code to print the arguments.  The
-most natural approach would be to access the arguments directly, by
-name::
+   BOOST_PARAMETER_NAME(graph)
 
-  {
-      std::cout << "graph:\\t" << graph << std::endl;
-      std::cout << "visitor:\\t" << visitor << std::endl;
-      std::cout << "root_vertex:\\t" << root_vertex << std::endl;
-      std::cout << "index_map:\\t" << index_map << std::endl;
-      std::cout << "color_map:\\t" << color_map << std::endl;
-  }
+   BOOST_PARAMETER_FUNCTION((void), f, tag,
+   ''')
 
-Unfortunately, that won't quite work, because the function whose
-body we'll be writing doesn't have parameters named ``graph``,
-``visitor``, etc.  It may not be obvious, since the declaration is
-generated by the ``BOOST_PARAMETER_FUNCTION`` macro, but there is
-actually only a single parameter, called ``args``.  ``args`` is what
-is known as an |ArgumentPack|: a bundle of references to the actual
-arguments, tagged with their keywords.  To extract each parameter,
-we just need to pass its keyword object to the |ArgumentPack|\ 's
-subscript operator, like this:
+.. @example.append(') {}')
+.. @test('compile')
 
-.. parsed-literal::
+Optional Parameters
+-------------------
 
-  namespace graphs
-  {
-    BOOST_PARAMETER_FUNCTION(
-        (void), 
-        depth_first_search, 
+.. compound::
 
-        tag,
-        (required (graph,\*) )
-        (optional (visitor,\*) (root_vertex,\*)
-                  (index_map,\*) (out(color_map),\*) )
+  Optional parameters—nested in an ``(optional … )`` clause—are given
+  as a series of adjacent *three*\ -element tuples describing the
+  parameter name, any requirements on the argument type, *and* and an
+  expression representing the parameter's default value:
+
+  .. parsed-literal::
+
+    (optional **\
+        (visitor,           \*, boost::dfs_visitor<>()) 
+        (root_vertex,       \*, \*vertices(graph).first) 
+        (index_map,         \*, get(boost::vertex_index,graph)) 
+        (in_out(color_map), \*, 
+          default_color_map(num_vertices(graph), index_map) )**
     )
-    {
-        std::cout << "graph:\\t" << **args[graph]** << std::endl;
-        std::cout << "visitor:\\t" << **args[visitor]** << std::endl;
-        std::cout << "root_vertex:\\t" << **args[root_vertex]** << std::endl;
-        std::cout << "index_map:\\t" << **args[index_map]** << std::endl;
-        std::cout << "color_map:\\t" << **args[color_map]** << std::endl;
-    }
-  }
 
-Now our program will print::
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
 
-  graph:       G
-  visitor:     2
-  root_vertex: 3.5
-  index_map:   hello, world
-  color_map:   false
+   namespace boost
+   {
+     int vertex_index = 0;
 
-Of course, we can pass the arguments in any order without changing
-the result::
+     template <class T = int>
+     struct dfs_visitor
+     {};
+   }
 
-  int main()
-  {
-      using namespace graphs;
+   BOOST_PARAMETER_NAME(graph)
+   BOOST_PARAMETER_NAME(visitor)
+   BOOST_PARAMETER_NAME(root_vertex)
+   BOOST_PARAMETER_NAME(index_map)
+   BOOST_PARAMETER_NAME(color_map)
 
-      graphs::depth_first_search(
-        root_vertex = 3.5, graph = 'G', color_map = false, 
-        index_map = "hello, world", visitor = 2);
-  }
+   BOOST_PARAMETER_FUNCTION((void), f, tag,
+     (required (graph, *))
+   ''')
 
-Adding Defaults
-===============
+.. @example.append(') {}')
+.. @test('compile')
 
-Despite the use of ``optional`` in the signature, all
-the arguments to ``depth_first_search`` are actually required.  If
-any parameter can't be found, there will be a compilation error
-where we try to extract it from the |ArgumentPack| using the
-subscript operator.  To make it legal to omit an argument we need
-to give it a default value.
+Handling “Out” Parameters
+-------------------------
 
-Syntax
-------
+.. compound::
 
-To make an optional parameter *truly* optional, we can follow its keyword
-with the ``|`` operator and the parameter's default value within
-the square brackets.  In the following example, we've given
-``root_vertex`` a default of ``42`` and ``color_map`` a default of
-``"hello, world"``.
+  Within the function body, a parameter name such as ``visitor`` is
+  a *C++ reference*, bound either to an actual argument passed by
+  the caller or to the result of evaluating a default expression.
+  In most cases, parameter types are of the form ``T const&`` for
+  some ``T``.  Parameters whose values are expected to be modified,
+  however, must be passed by reference to *non*\ -``const``.  To
+  indicate that ``color_map`` is both read and written, we wrap
+  its name in ``in_out(…)``:
 
-.. parsed-literal::
+  .. parsed-literal::
 
-  namespace graphs 
-  {
-  {
+    (optional
+        (visitor,            \*, boost::dfs_visitor<>()) 
+        (root_vertex,        \*, \*vertices(graph).first) 
+        (index_map,          \*, get(boost::vertex_index,graph)) 
+        (**in_out(color_map)**, \*, 
+          default_color_map(num_vertices(graph), index_map) )
+    )
+
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
+
+   namespace boost
+   {
+     int vertex_index = 0;
+
+     template <class T = int>
+     struct dfs_visitor
+     {};
+   }
+
+   BOOST_PARAMETER_NAME(graph)
+
+   BOOST_PARAMETER_NAME(visitor)
+   BOOST_PARAMETER_NAME(root_vertex)
+   BOOST_PARAMETER_NAME(index_map)
+   BOOST_PARAMETER_NAME(color_map)
+
+   BOOST_PARAMETER_FUNCTION((void), f, tag,
+     (required (graph, *))
+   ''')
+
+.. @example.append(') {}')
+.. @test('compile')
+
+If ``color_map`` were strictly going to be modified but not examined,
+we could have written ``out(color_map)``.  There is no functional
+difference between ``out`` and ``in_out``; the library provides
+both so you can make your interfaces more self-documenting.
+
+Positional Arguments
+--------------------
+
+When arguments are passed positionally (without the use of
+keywords), they will be mapped onto parameters in the order the
+parameters are given in the signature, so for example in this
+call ::
+
+  graphs::depth_first_search(x, y);
+
+.. @ignore()
+
+``x`` will always be interpreted as a graph and ``y`` will always
+be interpreted as a visitor.
+
+.. _sequence: http://boost-consulting.com/mplbook/preprocessor.html#sequences
+
+Default Expression Evaluation
+-----------------------------
+
+.. compound::
+
+  Note that in our example, the value of the graph parameter is
+  used in the default expressions for ``root_vertex``,
+  ``index_map`` and ``color_map``.  
+
+  .. parsed-literal::
+
+        (required (**graph**, \*) )
+        (optional
+          (visitor,           \*, boost::dfs_visitor<>()) 
+          (root_vertex,       \*, \*vertices(**graph**).first) 
+          (index_map,         \*, get(boost::vertex_index,\ **graph**)) 
+          (in_out(color_map), \*, 
+            default_color_map(num_vertices(**graph**), index_map) ) 
+        )
+
+  .. @ignore()
+
+  A default expression is evaluated in the context of all preceding
+  parameters, so you can use any of their values by name.
+
+.. compound::
+
+  A default expression is never evaluated—or even instantiated—if
+  an actual argument is passed for that parameter.  We can actually
+  demonstrate that with our code so far by replacing the body of
+  ``depth_first_search`` with something that prints the arguments:
+
+  .. parsed-literal::
+
+    #include <boost/graph/depth_first_search.hpp> // for dfs_visitor
+
     BOOST_PARAMETER_FUNCTION(
-        (void), 
-        depth_first_search, 
-
-        tag,
-        (required (graph,\*) )
-        (optional (visitor,\*) (root_vertex,\*) 
-                  (index_map,\*) (out(color_map),\*) )
+        (void), depth_first_search, tag
+        *…signature goes here…*
     )
     {
-        std::cout << "graph:\\t" << args[graph] << std::endl;
-        std::cout << "visitor:\\t" << args[visitor] << std::endl;
-        std::cout << "root_vertex:\\t" << args[root_vertex\ **|42**\ ] << std::endl;
-        std::cout << "index_map:\\t" << args[index_map] << std::endl;
-        std::cout << "color_map:\\t" << args[color_map\ **|"hello, world"**\ ] << std::endl;
+       std::cout << "graph=" << graph << std::endl;
+       std::cout << "visitor=" << visitor << std::endl;
+       std::cout << "root_vertex=" << root_vertex << std::endl;
+       std::cout << "index_map=" << index_map << std::endl;
+       std::cout << "color_map=" << color_map << std::endl;
     }
+
+    int main()
+    {
+        depth_first_search(1, 2, 3, 4, 5);
+
+        depth_first_search(
+            "1", '2', _color_map = '5',
+            _index_map = "4", _root_vertex = "3");
+    }
+
+  Despite the fact that default expressions such as
+  ``vertices(graph).first`` are ill-formed for the given ``graph``
+  arguments, both calls will compile, and each one will print
+  exactly the same thing.
+
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
+   #include <iostream>
+
+   BOOST_PARAMETER_NAME(graph)
+   BOOST_PARAMETER_NAME(visitor)
+   BOOST_PARAMETER_NAME(root_vertex)
+   BOOST_PARAMETER_NAME(index_map)
+   BOOST_PARAMETER_NAME(color_map)''')
+
+.. @example.replace_emphasis('''
+   , (required 
+       (graph, *)
+       (visitor, *)
+       (root_vertex, *)
+       (index_map, *)
+       (color_map, *)
+     )
+   ''')
+.. @test('compile')
+
+Signature Matching and Overloading
+----------------------------------
+
+In fact, the function signature is so general that any call to
+``depth_first_search`` with fewer than five arguments will match
+our function, provided we pass *something* for the required
+``graph`` parameter.  That might not seem to be a problem at first;
+after all, if the arguments don't match the requirements imposed by
+the implementation of ``depth_first_search``, a compilation error
+will occur later, when its body is instantiated.
+
+There are at least three problems with very general function
+signatures.  
+
+1. By the time our ``depth_first_search`` is instantiated, it has
+   been selected as the best matching overload.  Some other
+   ``depth_first_search`` overload might've worked had it been
+   chosen instead.  By the time we see a compilation error, there's
+   no chance to change that decision.
+
+2. Even if there are no overloads, error messages generated at
+   instantiation time usually expose users to confusing
+   implementation details.  For example, users might see references
+   to names generated by ``BOOST_PARAMETER_FUNCTION`` such as
+   ``graphs::detail::depth_first_search_with_named_params`` (or
+   worse—think of the kinds of errors you get from your STL
+   implementation when you make a mistake). [#ConceptCpp]_
+
+3. The problems with exposing such permissive function template
+   signatures have been the subject of much discussion, especially
+   in the presence of `unqualified calls`__.  If all we want is to
+   avoid unintentional argument-dependent lookup (ADL), we can
+   isolate ``depth_first_search`` in a namespace containing no
+   types [#using]_, but suppose we *want* it to found via ADL?
+
+__ http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html#225
+
+It's usually a good idea to prevent functions from being considered
+for overload resolution when the passed argument types aren't
+appropriate.  The library already does this when the required
+``graph`` parameter is not supplied, but we're not likely to see a
+depth first search that doesn't take a graph to operate on.
+Suppose, instead, that we found a different depth first search
+algorithm that could work on graphs that don't model
+|IncidenceGraph|_?  If we just added a simple overload,
+it would be ambiguous::
+
+  // new overload
+  BOOST_PARAMETER_FUNCTION(
+      (void), depth_first_search, (tag), (required (graph,*))( … ))
+  {
+      // new algorithm implementation
   }
 
-Now we can invoke the function without supplying ``color_map`` or
-``root_vertex``::
+  …
 
-  graphs::depth_first_search(
-    graph = 'G', index_map = "index", visitor = 6);
+  // ambiguous!
+  depth_first_search(boost::adjacency_list<>(), 2, "hello");
 
-The call above would print::
+.. @ignore()
 
-  graph:       G
-  visitor:     6
-  root_vertex: 42
-  index_map:   index
-  color_map:   hello, world
+Adding Type Requirements
+........................
 
-.. Important::
+We really don't want the compiler to consider the original version
+of ``depth_first_search`` because the ``root_vertex`` argument,
+``"hello"``, doesn't meet the requirement__ that it match the
+``graph`` parameter's vertex descriptor type.  Instead, this call
+should just invoke our new overload.  To take the original
+``depth_first_search`` overload out of contention, we need to tell
+the library about this requirement by replacing the ``*`` element
+of the signature with the required type, in parentheses:
 
-   The index expression ``args[…]`` always yields a *reference*
-   that is bound either to the actual argument passed by the caller
-   or, if no argument is passed explicitly, to the specified
-   default value.
+__ `parameter table`_
 
-Deducing Parameter Types
-========================
+.. parsed-literal::
 
-Now it's time to put some more realistic defaults in place.  We'll
-have to give up our print statements—at least if we want to see the
-defaults work—since the default values of these
-parameters generally aren't printable.
+  (root_vertex,       
+       **(typename boost::graph_traits<graph_type>::vertex_descriptor)**,
+       \*vertices(graph).first) 
 
-Instead, we'll connect local variables to the arguments and use
-those in our algorithm:
+.. @ignore()
 
+Now the original ``depth_first_search`` will only be called when
+the ``root_vertex`` argument can be converted to the graph's vertex
+descriptor type, and our example that *was* ambiguous will smoothly
+call the new overload.
+
+.. Note:: The *type* of the ``graph`` argument is available in the
+   signature—and in the function body—as ``graph_type``.  In
+   general, to access the type of any parameter *foo*, write *foo*\
+   ``_type``.
+
+
+Predicate Requirements
+......................
+
+The requirements on other arguments are a bit more interesting than
+those on ``root_vertex``; they can't be described in terms of simple
+type matching.  Instead, they must be described in terms of `MPL
+Metafunctions`__.  There's no space to give a complete description
+of metafunctions or of graph library details here, but we'll show
+you the complete signature with maximal checking, just to give you
+a feel for how it's done.  Each predicate metafunction is enclosed
+in parentheses *and preceded by an asterix*, as follows:
+
 .. parsed-literal::
 
-  namespace graphs
-  {
     BOOST_PARAMETER_FUNCTION(
-        (void), 
-        depth_first_search, 
+        (void), depth_first_search, graphs
 
-        tag,
-        (required (graph,\*) )
-        (optional (visitor,\*) (root_vertex,\*)
-                  (index_map,\*) (out(color_map),\*) )
+      , (required 
+          (graph 
+           , **\ \*(boost::mpl::and_<
+                   boost::is_convertible<
+                       boost::graph_traits<_>::traversal_category
+                     , boost::incidence_graph_tag
+                   >
+                 , boost::is_convertible<
+                       boost::graph_traits<_>::traversal_category
+                     , boost::vertex_list_graph_tag
+                   >
+               >)** ))
+
+        (optional
+          (visitor, \*, boost::dfs_visitor<>()) // not checkable
+
+          (root_vertex
+            , (typename boost::graph_traits<graphs::graph::_>::vertex_descriptor)
+            , \*vertices(graph).first)
+ 
+          (index_map
+            , **\ \*(boost::mpl::and_<
+                  boost::is_integral<
+                      boost::property_traits<_>::value_type
+                  >
+                , boost::is_same<
+                      typename boost::graph_traits<graphs::graph::_>::vertex_descriptor
+                    , boost::property_traits<_>::key_type
+                  >
+              >)**
+            , get(boost::vertex_index,graph))
+ 
+          (in_out(color_map)
+            , **\ \*(boost::is_same<
+                  typename boost::graph_traits<graphs::graph::_>::vertex_descriptor
+                , boost::property_traits<_>::key_type
+              >)**
+           , default_color_map(num_vertices(graph), index_map) ) 
+        )
     )
-    {
-        *Graph*   g = args[graph];
-        *Visitor* v = args[visitor|\ *default-expression*\ :sub:`1`\ ];
-        *Vertex*  s = args[root_vertex|\ *default-expression*\ :sub:`2`\ ];
-        *Index*   i = args[index_map|\ *default-expression*\ :sub:`3`\ ];
-        *Color*   c = args[color|\ *default-expression*\ :sub:`4`\ ];
 
-        *…use g, v, s, i, and c to implement the algorithm…*
-    }
-  }
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
 
-We'll insert the `default expressions`_ in a moment, but first we
-need to come up with the types *Graph*, *Visitor*, *Vertex*,
-*Index*, and *Color*.
+   BOOST_PARAMETER_NAME((_graph, graphs) graph) 
+   BOOST_PARAMETER_NAME((_visitor, graphs) visitor) 
+   BOOST_PARAMETER_NAME((_root_vertex, graphs) root_vertex) 
+   BOOST_PARAMETER_NAME((_index_map, graphs) index_map) 
+   BOOST_PARAMETER_NAME((_color_map, graphs) color_map)
 
-Forwarding to an Implementation Function
-----------------------------------------
+   using boost::mpl::_;
 
-The easiest way to discover the parameter types is to forward them
-on to another function template and allow C++ to do the type
-deduction for us:
+   namespace boost
+   {
+     struct incidence_graph_tag {};
+     struct vertex_list_graph_tag {};
 
+     int vertex_index = 0;
+
+     template <class T>
+     struct graph_traits
+     {
+         typedef int traversal_category;
+         typedef int vertex_descriptor;
+     };
+
+     template <class T>
+     struct property_traits
+     {
+         typedef int value_type;
+         typedef int key_type;
+     };
+
+     template <class T = int>
+     struct dfs_visitor 
+     {};
+   }''')
+
+.. @example.append('''
+   {}''')
+
+.. @test('compile')
+
+__ ../../../mpl/doc/refmanual/metafunction.html
+
+We acknowledge that this signature is pretty hairy looking.
+Fortunately, it usually isn't necessary to so completely encode the
+type requirements on arguments to generic functions.  However, it
+is usally worth the effort to do so: your code will be more
+self-documenting and will often provide a better user experience.
+You'll also have an easier transition to an upcoming C++ standard
+with `language support for concepts`__.
+
+__ `ConceptC++`_
+
+Deduced Parameters
+------------------
+
+To illustrate deduced parameter support we'll have to leave behind
+our example from the Graph library.  Instead, consider the example
+of the |def|_ function from Boost.Python_.  Its signature is
+roughly as follows::
+
+  template <
+    class Function, Class KeywordExpression, class CallPolicies
+  >
+  void def(
+      // Required parameters
+      char const* name, Function func
+
+      // Optional, deduced parameters
+    , char const* docstring = ""
+    , KeywordExpression keywords = no_keywords()
+    , CallPolicies policies = default_call_policies()
+  );
+
+.. @ignore()
+
+Try not to be too distracted by the use of the term “keywords” in
+this example: although it means something analogous in Boost.Python
+to what it means in the Parameter library, for the purposes of this
+exercise you can think of it as being completely different.
+
+When calling ``def``, only two arguments are required.  The
+association between any additional arguments and their parameters
+can be determined by the types of the arguments actually passed, so
+the caller is neither required to remember argument positions or
+explicitly specify parameter names for those arguments.  To
+generate this interface using ``BOOST_PARAMETER_FUNCTION``, we need
+only enclose the deduced parameters in a ``(deduced …)`` clause, as
+follows: 
+
 .. parsed-literal::
 
-  namespace graphs
+  namespace mpl = boost::mpl;
+
+  BOOST_PARAMETER_FUNCTION(
+      (void), def, tag,
+
+      (required (name,(char const\*)) (func,\*) )   // nondeduced
+
+      **(deduced** 
+        (optional 
+          (docstring, (char const\*), "")
+
+          (keywords
+             , \*(is_keyword_expression<mpl::_>) // see [#is_keyword_expression]_
+             , no_keywords())
+
+          (policies
+             , \*(mpl::not_<
+                   mpl::or_<
+                       boost::is_convertible<mpl::_, char const\*>
+                     , is_keyword_expression<mpl::_> // see [#is_keyword_expression]_
+                   >
+               >)
+             , default_call_policies()
+           )
+         )
+       **)**
+   )
+   {
+      *…*
+   }
+
+.. @example.replace_emphasis('')
+
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
+
+   BOOST_PARAMETER_NAME(name)
+   BOOST_PARAMETER_NAME(func)
+   BOOST_PARAMETER_NAME(docstring)
+   BOOST_PARAMETER_NAME(keywords)
+   BOOST_PARAMETER_NAME(policies)
+
+   struct default_call_policies
+   {};
+
+   struct no_keywords
+   {};
+
+   struct keywords
+   {};
+
+   template <class T>
+   struct is_keyword_expression
+     : boost::mpl::false_
+   {};
+
+   template <>
+   struct is_keyword_expression<keywords>
+     : boost::mpl::true_
+   {};
+
+   default_call_policies some_policies;
+
+   void f()
+   {}
+
+   ''')
+
+.. Admonition:: Syntax Note
+
+  A ``(deduced …)`` clause always contains a ``(required …)``
+  and/or an ``(optional …)`` subclause, and must follow any
+  ``(required …)`` or ``(optional …)`` clauses indicating
+  nondeduced parameters at the outer level.
+
+With the declaration above, the following two calls are equivalent:
+
+.. parsed-literal::
+
+  def("f", f, **some_policies**, **"Documentation for f"**);
+  def("f", f, **"Documentation for f"**, **some_policies**);
+
+.. @example.prepend('''
+   int main()
+   {''')
+
+If the user wants to pass a ``policies`` argument that was also,
+for some reason, convertible to ``char const*``, she can always
+specify the parameter name explicitly, as follows:
+
+.. parsed-literal::
+
+  def(
+      "f", f
+     , **_policies = some_policies**, "Documentation for f");
+
+.. @example.append('}')
+.. @test('compile', howmany='all')
+
+.. _Boost.Python: ../../../python/doc/index.html
+.. |def| replace:: ``def``
+.. _def: ../../../python/doc/v2/def.html
+
+----------------------------------
+Parameter-Enabled Member Functions
+----------------------------------
+
+
+The ``BOOST_PARAMETER_MEMBER_FUNCTION`` and
+``BOOST_PARAMETER_CONST_MEMBER_FUNCTION`` macros accept exactly the
+same arguments as ``BOOST_PARAMETER_FUNCTION``, but are designed to
+be used within the body of a class::
+
+  BOOST_PARAMETER_NAME(arg1)
+  BOOST_PARAMETER_NAME(arg2)
+
+  struct callable2
   {
-    namespace detail
-    {
-      template <
-          class Graph, class Visitor
-        , class Vertex, class Index, class Color>
-      void depth_first_search_impl(
-        Graph const& g, Visitor const& v, 
-        Vertex const& s, Index const& i, Color& c)
+      BOOST_PARAMETER_CONST_MEMBER_FUNCTION(
+          (void), operator(), tag, (required (arg1,(int))(arg2,(int))))
       {
-        *…use g, v, s, i, and c to implement the algorithm…*
+          std::cout << arg1 << ", " << arg2 << std::endl;
       }
-    }
+  };
 
-    BOOST_PARAMETER_FUNCTION(
-        (void), 
-        depth_first_search, 
+.. @example.prepend('''
+   #include <boost/parameter.hpp>''')
 
-        tag,
-        (required (graph,\*) )
-        (optional (visitor,\*) (root_vertex,\*) 
-                  (index_map,\*) (out(color_map),\*) )
-    )
-    {
-        detail::depth_first_search_impl(
-          args[graph], args[visitor|\ *default-expression*\ :sub:`1`\ ],
-          args[root_vertex|\ *default-expression*\ :sub:`2`\ ],
-          args[index_map|\ *default-expression*\ :sub:`3`\ ],
-          args[color|\ *default-expression*\ :sub:`4`\ ]);
-    }
-  }
+.. @test('compile')
 
-The ``binding`` |Metafunction|_
--------------------------------
+These macros don't directly allow a function's interface to be
+separated from its implementation, but you can always forward
+arguments on to a separate implementation function::
 
-If for some reason forwarding isn't an option, or if writing a
-separate implementation function is too cumbersome, we can use a
-|Metafunction|_ called ``binding`` to compute parameter types
-directly:
+  struct callable2
+  {
+      BOOST_PARAMETER_CONST_MEMBER_FUNCTION(
+          (void), operator(), tag, (required (arg1,(int))(arg2,(int))))
+      {
+          call_impl(arg1,arg2);
+      }
+   private:
+      void call_impl(int, int); // implemented elsewhere.
+  };
 
-.. parsed-literal::
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
 
-  binding<ArgumentPack, Keyword, Default = parameter::void\ _>
-  { typedef *see text* type; };
+   BOOST_PARAMETER_NAME(arg1)
+   BOOST_PARAMETER_NAME(arg2)''')
 
-where ``Default`` is the type of the default argument, if any.
+.. @test('compile')
 
-To use ``binding`` we need one more piece of information that's
-hidden by the macro generating our declaration: the *type* of
-``args``, our ArgumentPack, is quite fittingly available as
-``Args``.  Now, to directly declare and initialize ``g``, we could
-write:
+------------------------------
+Parameter-Enabled Constructors
+------------------------------
 
+The lack of a “delegating constructor”
+feature in C++
+(http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1986.pdf)
+limits somewhat the quality of interface this library can provide
+for defining parameter-enabled constructors.  The usual workaround
+for a lack of constructor delegation applies: one must factor the
+common logic into a base class.  
+
+Let's build a parameter-enabled constructor that simply prints its
+arguments.  The first step is to write a base class whose
+constructor accepts a single argument known as an |ArgumentPack|_:
+a bundle of references to the actual arguments, tagged with their
+keywords.  The values of the actual arguments are extracted from
+the |ArgumentPack| by *indexing* it with keyword objects::
+
+  BOOST_PARAMETER_NAME(name)
+  BOOST_PARAMETER_NAME(index)
+
+  struct myclass_impl
+  {
+      template <class ArgumentPack>
+      myclass_impl(ArgumentPack const& args)
+      {
+          std::cout << "name = " << args[_name] 
+                    << "; index = " << args[_index | 42] 
+                    << std::endl;
+      }
+  };
+
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
+   #include <iostream>''')
+
+Note that the bitwise or (“\ ``|``\ ”) operator has a special
+meaning when applied to keyword objects that are passed to an
+|ArgumentPack|\ 's indexing operator: it is used to indicate a
+default value.  In this case if there is no ``index`` parameter in
+the |ArgumentPack|, ``42`` will be used instead.
+
+Now we are ready to write the parameter-enabled constructor
+interface::
+
+  struct myclass : myclass_impl
+  {
+      BOOST_PARAMETER_CONSTRUCTOR(
+          myclass, (myclass_impl), tag
+        , (required (name,*)) (optional (index,*))) // no semicolon
+  };
+
+Since we have supplied a default value for ``index`` but not for
+``name``, only ``name`` is required.  We can exercise our new
+interface as follows::
+
+  myclass x("bob", 3);                     // positional
+  myclass y(_index = 12, _name = "sally"); // named
+  myclass z("june");                       // positional/defaulted
+
+.. @example.wrap('int main() {', '}')
+.. @test('run', howmany='all')
+
+For more on |ArgumentPack| manipulation, see the `Advanced Topics`_
+section.
+
+---------------------------------
+Parameter-Enabled Class Templates
+---------------------------------
+
+In this section we'll use Boost.Parameter to build Boost.Python_\
+'s `class_`_ template, whose “signature” is:
+
 .. parsed-literal::
 
-  typedef typename parameter::binding<
-    Args,\ **tag::graph**
-  >::type Graph;
+  template class<
+      ValueType, BaseList = bases<>
+    , HeldType = ValueType, Copyable = void
+  >
+  class class\_;
 
-  Graph g = args[graph];
+.. @ignore()
 
-``binding`` With Defaults
--------------------------
+Only the first argument, ``ValueType``, is required.
 
-As shown in the `parameter table`_, ``graph`` has no default, so
-the ``binding`` invocation for *Graph* takes only two arguments.
-The default ``visitor`` is ``boost::dfs_visitor<>()``, so the
-``binding`` invocation for *Visitor* takes three arguments:
+.. _class_: http://www.boost.org/libs/python/doc/v2/class.html#class_-spec
 
+Named Template Parameters
+=========================
+
+First, we'll build an interface that allows users to pass arguments
+positionally or by name:
+
 .. parsed-literal::
 
-  typedef typename parameter::binding<
-    Args,\ **tag::visitor,boost::dfs_visitor<>**
-  >::type Visitor;
+  struct B { virtual ~B() = 0; };
+  struct D : B { ~D(); };
 
-  Visitor v = args[visitor|\ **boost::dfs_visitor<>()**\ ];
+  class_<
+       **class_type<B>**, **copyable<boost::noncopyable>** 
+  > …;
 
+  class_<
+      **D**, **held_type<std::auto_ptr<D> >**, **base_list<bases<B> >**
+  > …;
 
-.. _dangling:
+.. @ignore()
 
-``binding`` Safely
-------------------
+Template Keywords
+-----------------
 
-Note that the default ``visitor`` is supplied as a *temporary*
-instance of ``dfs_visitor``.  Because ``args[…]`` always yields
-a reference, making ``v`` a reference would cause it to bind to
-that temporary, and immediately dangle.  Therefore, it's crucial
-that we passed ``dfs_visitor<>``, and not ``dfs_visitor<>
-const&``, as the last argument to ``binding``.
+The first step is to define keywords for each template parameter::
 
-.. Important:: 
+  namespace boost { namespace python {
 
-   Never pass ``binding`` a reference type as the default unless
-   you know that the default value passed to the |ArgumentPack|\ 's
-   indexing operator will outlive the reference you'll bind to it.
+  BOOST_PARAMETER_TEMPLATE_KEYWORD(class_type)
+  BOOST_PARAMETER_TEMPLATE_KEYWORD(base_list)
+  BOOST_PARAMETER_TEMPLATE_KEYWORD(held_type)
+  BOOST_PARAMETER_TEMPLATE_KEYWORD(copyable)
 
-Sometimes there's no need to use ``binding`` at all.  The
-``root_vertex`` argument is required to be of the graph's
-``vertex_descriptor`` type, [#vertex_descriptor]_ so we can just
-declare it that way:
+  }}
 
-.. parsed-literal::
+.. @example.prepend('#include <boost/parameter.hpp>')
+.. @test('compile')
 
-  typename **boost::graph_traits<Graph>::vertex_descriptor**
-    s = args[root_vertex|\ ***vertices(g).first**\ ];
+The declaration of the ``class_type`` keyword you see here is
+equivalent to::
 
-.. |Metafunction| replace:: :concept:`Metafunction`
+  namespace boost { namespace python {
 
-.. _Metafunction: ../../../mpl/doc/refmanual/metafunction.html
+  namespace tag { struct class_type; } // keyword tag type
+  template <class T>
+  struct class_type
+    : parameter::template_keyword<tag::class_type,T>
+  {};
 
+  }}
 
-Beyond Ordinary Default Arguments
-=================================
+.. @example.prepend('#include <boost/parameter.hpp>')
+.. @test('compile')
 
-Consider how one might bind a variable to the ``index_map``
-parameter:
+It defines a keyword tag type named ``tag::class_type`` and a
+*parameter passing template* named ``class_type``.
 
+Class Template Skeleton
+-----------------------
+
+The next step is to define the skeleton of our class template,
+which has three optional parameters.  Because the user may pass
+arguments in any order, we don't know the actual identities of
+these parameters, so it would be premature to use descriptive names
+or write out the actual default values for any of them.  Instead,
+we'll give them generic names and use the special type
+``boost::parameter::void_`` as a default:
+
 .. parsed-literal::
 
-  typedef typename parameter::binding<
-      ArgumentPack
-    , tag::index_map
-    , **typename boost::property_map<Graph, vertex_index_t>::const_type**
-  >::type Index;
+  namespace boost { namespace python {
 
-  Index i = args[index_map|\ **get(boost::vertex_index,g)**\ ];
+  template <
+      class A0
+    , class A1 = parameter::void\_
+    , class A2 = parameter::void\_
+    , class A3 = parameter::void\_
+  >
+  struct class\_
+  {
+      *…*
+  };
 
-We have gained two capabilities beyond what plain C++ default
-arguments provide:
+  }}
 
-1. The default value of the ``index`` parameter depends on the
-   value of the ``graph`` parameter.  That's illegal in plain C++:
-   
-   .. parsed-literal::
+.. @example.prepend('#include <boost/parameter.hpp>')
+.. @example.replace_emphasis('')
+.. @test('compile')
 
-     void f(int **graph**, int index = **graph** + 1); // error
+Class Template Signatures
+-------------------------
 
-2. The ``index`` parameter has a useful default, yet it is
-   templated and its type can be deduced when  an ``index``
-   argument is explicitly specified by the caller.  In plain C++, you
-   can *specify* a default value for a parameter with deduced type,
-   but it's not very useful:
+Next, we need to build a type, known as a |ParameterSpec|_,
+describing the “signature” of ``boost::python::class_``.  A
+|ParameterSpec|_ enumerates the required and optional parameters in
+their positional order, along with any type requirements (note that
+it does *not* specify defaults -- those will be dealt with
+separately)::
 
-   .. parsed-literal::
+  namespace boost { namespace python {
 
-     template <class Index>
-     int f(Index index **= 42**);  // OK
-     int y = f();                // **error; can't deduce Index**
+  using boost::mpl::_;
 
-More Restrictive Signatures
+  typedef parameter::parameters<
+      required<tag::class_type, is_class<_> >
+    , optional<tag::base_list, mpl::is_sequence<_> >
+    , optional<tag::held_type>
+    , optional<tag::copyable>
+  > class_signature;
+
+  }}
+
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
+   #include <boost/mpl/is_sequence.hpp>
+   #include <boost/noncopyable.hpp>
+   #include <memory>
+
+   using namespace boost::parameter;
+
+   namespace boost { namespace python {
+
+   BOOST_PARAMETER_TEMPLATE_KEYWORD(class_type)
+   BOOST_PARAMETER_TEMPLATE_KEYWORD(base_list)
+   BOOST_PARAMETER_TEMPLATE_KEYWORD(held_type)
+   BOOST_PARAMETER_TEMPLATE_KEYWORD(copyable)
+
+   template <class B = int>
+   struct bases
+   {};
+
+   }}''')
+
+.. |ParameterSpec| replace:: :concept:`ParameterSpec`
+
+.. _ParameterSpec: reference.html#parameterspec
+
+.. _binding_intro:
+
+Argument Packs and Parameter Extraction
+---------------------------------------
+
+Next, within the body of ``class_`` , we use the |ParameterSpec|\
+'s nested ``::bind< … >`` template to bundle the actual arguments
+into an |ArgumentPack|_ type, and then use the library's ``binding<
+… >`` metafunction to extract “logical parameters”.  Note that
+defaults are specified by supplying an optional third argument to
+``binding< … >``::
+
+  namespace boost { namespace python {
+
+  template <
+      class A0
+    , class A1 = parameter::void_
+    , class A2 = parameter::void_
+    , class A3 = parameter::void_
+  >
+  struct class_
+  {
+      // Create ArgumentPack
+      typedef typename 
+        class_signature::bind<A0,A1,A2,A3>::type 
+      args;
+
+      // Extract first logical parameter.
+      typedef typename parameter::binding<
+        args, tag::class_type>::type class_type;
+      
+      typedef typename parameter::binding<
+        args, tag::base_list, bases<> >::type base_list;
+      
+      typedef typename parameter::binding<
+        args, tag::held_type, class_type>::type held_type;
+      
+      typedef typename parameter::binding<
+        args, tag::copyable, void>::type copyable;
+  };
+
+  }}
+
+.. |ArgumentPack| replace:: :concept:`ArgumentPack`
+.. _ArgumentPack: reference.html#argumentpack
+
+Exercising the Code So Far
+==========================
+
+.. compound::
+
+  Revisiting our original examples, ::
+
+    typedef boost::python::class_<
+        class_type<B>, copyable<boost::noncopyable> 
+    > c1;
+
+    typedef boost::python::class_<
+        D, held_type<std::auto_ptr<D> >, base_list<bases<B> > 
+    > c2;
+
+  .. @example.prepend('''
+     using boost::python::class_type;
+     using boost::python::copyable;
+     using boost::python::held_type;
+     using boost::python::base_list;
+     using boost::python::bases;
+
+     struct B {};
+     struct D {};''')
+
+  we can now examine the intended parameters::
+
+    BOOST_MPL_ASSERT((boost::is_same<c1::class_type, B>));
+    BOOST_MPL_ASSERT((boost::is_same<c1::base_list, bases<> >));
+    BOOST_MPL_ASSERT((boost::is_same<c1::held_type, B>));
+    BOOST_MPL_ASSERT((
+         boost::is_same<c1::copyable, boost::noncopyable>
+    ));
+
+    BOOST_MPL_ASSERT((boost::is_same<c2::class_type, D>));
+    BOOST_MPL_ASSERT((boost::is_same<c2::base_list, bases<B> >));
+    BOOST_MPL_ASSERT((
+        boost::is_same<c2::held_type, std::auto_ptr<D> >
+    ));
+    BOOST_MPL_ASSERT((boost::is_same<c2::copyable, void>));
+
+.. @test('compile', howmany='all')
+
+Deduced Template Parameters
 ===========================
 
-Currently, our function will be considered for overload resolution
-whenever``depth_first_search`` is called with a ``graph`` argument
-and up to four others, of any type.  Compilation may fail inside
-our ``depth_first_search`` when it is instantiated if the compiler
-discovers that the argument types don't provide the required
-operations, but that may be too late:
+To apply a deduced parameter interface here, we need only make the
+type requirements a bit tighter so the ``held_type`` and
+``copyable`` parameters can be crisply distinguished from the
+others.  Boost.Python_ does this by requiring that ``base_list`` be
+a specialization of its ``bases< … >`` template (as opposed to
+being any old MPL sequence) and by requiring that ``copyable``, if
+explicitly supplied, be ``boost::noncopyable``.  One easy way of
+identifying specializations of ``bases< … >`` is to derive them all
+from the same class, as an implementation detail:
 
-* By the time our ``depth_first_search`` is instantiated, it has
-  been selected as the best matching overload.  Some other
-  ``depth_first_search`` overload might've worked had it been
-  chosen instead.  By the time we see a compilation error, there's
-  no chance to change that decision.
+.. parsed-literal::
 
-* Even if there are no overloads, error messages generated at
-  instantiation time usually expose users to confusing
-  implementation details.  For example, users might see references
-  to ``graphs::detail::depth_first_search_impl`` or worse (think
-  of the kinds of errors you get from your STL implementation when
-  you make a mistake).
+  namespace boost { namespace python {
 
-* The problems with exposing such permissive function template
-  signatures have been the subject of much discussion, especially
-  in the presence of `unqualified calls`__.  If all we want is to
-  avoid unintentional argument-dependent lookup (ADL), we can
-  isolate ``depth_first_search`` in a namespace containing no
-  types [#using]_, but suppose we *want* it to found via ADL?
+  namespace detail { struct bases_base {}; }
 
+  template <class A0 = void, class A1 = void, class A2 = void *…* >
+  struct bases **: detail::bases_base**
+  {};
 
-It's usually a good idea to prevent functions from being considered
-for overload resolution when the passed argument types aren't
-appropriate.  We've already seen that the library does this when
-the required ``graph`` parameter is not supplied.
+  }}  
 
-__ http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html#225
+.. @example.replace_emphasis('')
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
+   #include <boost/mpl/is_sequence.hpp>
+   #include <boost/noncopyable.hpp>
+   #include <memory>
 
-Checking for Convertibility to Specific Types
----------------------------------------------
+   using namespace boost::parameter;
+   using boost::mpl::_;
 
-The simplest way to make the signature more restrictive is to
-replace some of the ``*``\ s with types to which the corresponding
-arguments must be convertible, in parentheses.  For example, the
-following signature will only be matched when the
-``graph`` parameter is convertible to ``char const*`` and the
-``root_vertex`` parameter is convertible to ``int``:
+   namespace boost { namespace python {
 
+   BOOST_PARAMETER_TEMPLATE_KEYWORD(class_type)
+   BOOST_PARAMETER_TEMPLATE_KEYWORD(base_list)
+   BOOST_PARAMETER_TEMPLATE_KEYWORD(held_type)
+   BOOST_PARAMETER_TEMPLATE_KEYWORD(copyable)
+
+   }}''')
+
+Now we can rewrite our signature to make all three optional
+parameters deducible::
+
+  typedef parameter::parameters<
+      required<tag::class_type, is_class<_> >
+
+    , optional<
+          deduced<tag::base_list>
+        , is_base_and_derived<detail::bases_base,_>
+      >
+
+    , optional<
+          deduced<tag::held_type>
+        , mpl::not_<
+              mpl::or_<
+                  is_base_and_derived<detail::bases_base,_>
+                , is_same<noncopyable,_>
+              >
+          >
+      >
+
+    , optional<deduced<tag::copyable>, is_same<noncopyable,_> >
+
+  > class_signature;
+
+.. @example.prepend('''
+   namespace boost { namespace python {''')
+
+.. @example.append('''
+   template <
+       class A0
+     , class A1 = parameter::void_
+     , class A2 = parameter::void_
+     , class A3 = parameter::void_
+   >
+   struct class_
+   {
+       // Create ArgumentPack
+       typedef typename 
+         class_signature::bind<A0,A1,A2,A3>::type 
+       args;
+ 
+       // Extract first logical parameter.
+       typedef typename parameter::binding<
+         args, tag::class_type>::type class_type;
+      
+       typedef typename parameter::binding<
+         args, tag::base_list, bases<> >::type base_list;
+      
+       typedef typename parameter::binding<
+         args, tag::held_type, class_type>::type held_type;
+      
+       typedef typename parameter::binding<
+         args, tag::copyable, void>::type copyable;
+   };
+
+   }}''')
+
+It may seem like we've added a great deal of complexity, but the
+benefits to our users are greater.  Our original examples can now
+be written without explicit parameter names:
+
 .. parsed-literal::
 
-  namespace graphs
-  {
-    BOOST_PARAMETER_FUNCTION(
-        (void), 
-        depth_first_search, 
+  typedef boost::python::class_<**B**, **boost::noncopyable**> c1;
 
-        tag,
-        (required (graph,\ **(char const\*)**) )
-        (optional (visitor,\*) (root_vertex,\ **(int)**) 
-                  (index_map,\*) (out(color_map),\*) )
-    )
-    {
-        *…*
-    }
-  }
+  typedef boost::python::class_<**D**, **std::auto_ptr<D>**, **bases<B>** > c2;
 
-Signature Restriction Predicates
---------------------------------
+.. @example.prepend('''
+   struct B {};
+   struct D {};
 
-Sometimes the appropriate restriction can't be expressed in terms
-of convertibility.  In that case, instead of replacing the ``*``,
-you can *follow* it with a parenthesized unary `MPL lambda
-expression`_ that, when applied to the actual type of the argument,
-indicates whether that argument type meets the function's
-requirements for that parameter position.
+   using boost::python::bases;''')
 
-.. _`MPL lambda expression`: ../../../mpl/doc/refmanual/lambda-expression.html
+.. @example.append('''
+   BOOST_MPL_ASSERT((boost::is_same<c1::class_type, B>));
+   BOOST_MPL_ASSERT((boost::is_same<c1::base_list, bases<> >));
+   BOOST_MPL_ASSERT((boost::is_same<c1::held_type, B>));
+   BOOST_MPL_ASSERT((
+        boost::is_same<c1::copyable, boost::noncopyable>
+   ));
 
-For example, if we want to require that the ``visitor`` parameter
-be derived from some class ``VBase``, we can write:
+   BOOST_MPL_ASSERT((boost::is_same<c2::class_type, D>));
+   BOOST_MPL_ASSERT((boost::is_same<c2::base_list, bases<B> >));
+   BOOST_MPL_ASSERT((
+       boost::is_same<c2::held_type, std::auto_ptr<D> >
+   ));
+   BOOST_MPL_ASSERT((boost::is_same<c2::copyable, void>));''')
 
+.. @test('compile', howmany='all')
+
+===============
+Advanced Topics
+===============
+
+At this point, you should have a good grasp of the basics.  In this
+section we'll cover some more esoteric uses of the library.
+
+-------------------------
+Fine-Grained Name Control
+-------------------------
+
+If you don't like the leading-underscore naming convention used
+to refer to keyword objects, or you need the name ``tag`` for
+something other than the keyword type namespace, there's another
+way to use ``BOOST_PARAMETER_NAME``:
+
 .. parsed-literal::
 
-  namespace graphs
-  {
-    using namespace boost::mpl;
+   BOOST_PARAMETER_NAME(\ **(**\ *object-name*\ **,** *tag-namespace*\ **)** *parameter-name*\ )
 
-    BOOST_PARAMETER_FUNCTION(
-        (void), 
-        depth_first_search, 
+.. @ignore()
 
-        tag,
-        (required (graph,(char const\*)) )
-        (optional (visitor,\ ***\ (boost::is_base_and_derived<VBase,_>)**)
-                  (root_vertex,(int)) (index_map,\*) (out(color_map),\*) )
-    )
-    {
-        *…*
-    }
+Here is a usage example:
+
+.. parsed-literal::
+
+  BOOST_PARAMETER_NAME((**pass_foo**, **keywords**) **foo**)
+
+  BOOST_PARAMETER_FUNCTION(
+    (int), f, 
+    **keywords**, (required (**foo**, \*)))
+  {
+      return **foo** + 1;
   }
 
-.. Note::
+  int x = f(**pass_foo** = 41);
 
-   The restrictions implemented in this section are not realistic
-   ones for use with the graph library, and further examples are
-   written under the assumption that no such restrictions are in
-   effect.
+.. @example.prepend('#include <boost/parameter.hpp>')
+.. @example.append('''
+   int main()
+   {}''')
+.. @test('run')
 
-Efficiency Issues
-=================
+Before you use this more verbose form, however, please read the
+section on `best practices for keyword object naming`__.
 
-The ``color_map`` parameter gives us a few efficiency issues to
-consider.  Here's a first cut at extraction and binding:
+__ `Keyword Naming`_
 
-.. parsed-literal::
+-----------------------
+More |ArgumentPack|\ s
+-----------------------
 
-  typedef 
-    vector_property_map<boost::default_color_type, Index>
-  default_color_map;
+We've already seen |ArgumentPack|\ s when we looked at
+`parameter-enabled constructors`_ and `class templates`__.  As you
+might have guessed, |ArgumentPack|\ s actually lie at the heart of
+everything this library does; in this section we'll examine ways to
+build and manipulate them more effectively.
 
-  typename parameter::binding<
-      ArgumentPack
-    , tag::color_map
-    , default_color_map
-  >::type color = args[color_map|\ **default_color_map(num_vertices(g),i)**\ ];
+__ binding_intro_
 
-Eliminating Copies
-------------------
+Building |ArgumentPack|\ s
+==========================
 
-The library has no way to know whether an explicitly-supplied
-argument is expensive to copy (or even if it is copyable at all),
-so ``binding<…,k,…>::type`` is always a reference type when the
-*k* parameter is supplied by the caller.  Since ``args[…]``
-yields a reference to the actual argument, ``color`` will be bound
-to the actual ``color_map`` argument and no copying will be done.
+The simplest |ArgumentPack| is the result of assigning into a
+keyword object::
 
-As described above__, because the default is a temporary, it's
-important that ``color`` be a non-reference when the default is
-used.  In that case, the default value will be *copied* into
-``color``.  If we store the default in a named variable, though,
-``color`` can be a reference, thereby eliminating the copy:
+   BOOST_PARAMETER_NAME(index)
 
+   template <class ArgumentPack>
+   int print_index(ArgumentPack const& args)
+   {
+       std::cout << "index = " << args[_index] << std::endl;
+       return 0;
+   }
+
+   int x = print_index(_index = 3);  // prints "index = 3"
+
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
+   #include <iostream>''')
+
+Also, |ArgumentPack|\ s can be composed using the comma operator.
+The extra parentheses below are used to prevent the compiler from
+seeing two separate arguments to ``print_name_and_index``::
+
+   BOOST_PARAMETER_NAME(name)
+
+   template <class ArgumentPack>
+   int print_name_and_index(ArgumentPack const& args)
+   {
+       std::cout << "name = " << args[_name] << "; ";
+       return print_index(args);
+   }
+
+   int y = print_name_and_index((_index = 3, _name = "jones"));
+
+To build an |ArgumentPack| with positional arguments, we can use a
+|ParameterSpec|_.  As introduced described in the section on `Class
+Template Signatures`_, a |ParameterSpec| describes the positional
+order of parameters and any associated type requirements.  Just as
+we can build an |ArgumentPack| *type* with its nested ``::bind< …
+>`` template, we can build an |ArgumentPack| *object* by invoking
+its function call operator:
+
 .. parsed-literal::
 
-  default_color_map default_color(num_vertices(g),i);
+  parameter::parameters<
+      required<tag::\ name, is_convertible<_,char const*> >
+    , optional<tag::\ index, is_convertible<_,int> >
+  > spec;
 
-  typename parameter::binding<
-      ArgumentPack
-    , tag::color_map
-    , **default_color_map&**
-  >::type color = args[color_map|default_color];
+  int z0 = print_name_and_index( **spec(**\ "sam", 12\ **)** );
 
-__ dangling_
+  int z1 = print_name_and_index( 
+     **spec(**\ _index=12, _name="sam"\ **)** 
+  );
 
-.. Hint:: 
+.. @example.prepend('''
+   namespace parameter = boost::parameter;
+   using parameter::required;
+   using parameter::optional;
+   using boost::is_convertible;
+   using boost::mpl::_;''')
 
-   To avoid making needless copies, pass a *reference to the
-   default type* as the third argument to ``binding``, and store
-   the default value in a *named* variable.
+.. @example.append('''
+   int main()
+   {}''')
 
+.. @test('run', howmany='all')
 
-That said,
+Extracting Parameter Types
+==========================
 
-.. Note::
+If we want to know the types of the arguments passed to
+``print_name_and_index``, we have a couple of options.  The
+simplest and least error-prone approach is to forward them to a
+function template and allow *it* to do type deduction::
 
-   The extra copy becomes a non-issue if we just use the
-   forwarding_ technique described earlier.
+   BOOST_PARAMETER_NAME(name)
+   BOOST_PARAMETER_NAME(index)
 
-.. _forwarding: `Forwarding to an Implementation Function`_
+   template <class Name, class Index>
+   int deduce_arg_types_impl(Name& name, Index& index)
+   {
+       Name& n2 = name;  // we know the types
+       Index& i2 = index;
+       return index;
+   }
 
+   template <class ArgumentPack>
+   int deduce_arg_types(ArgumentPack const& args)
+   {
+       return deduce_arg_types_impl(args[_name], args[_index|42]);
+   }
+
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
+   #include <cassert>''')
+
+.. @example.append('''
+   int a1 = deduce_arg_types((_name = "foo"));
+   int a2 = deduce_arg_types((_name = "foo", _index = 3));
+
+   int main()
+   {
+       assert(a1 == 42);
+       assert(a2 == 3);
+   }''')
+
+.. @test('run')
+
+Occasionally one needs to deduce argument types without an extra
+layer of function call.  For example, suppose we wanted to return
+twice the value of the ``index`` parameter?  In that
+case we can use the ``binding< … >`` metafunction introduced
+`earlier`__::
+
+   BOOST_PARAMETER_NAME(index)
+
+   template <class ArgumentPack>
+   typename parameter::binding<ArgumentPack, tag::index, int>::type
+   twice_index(ArgumentPack const& args)
+   {
+       return 2 * args[_index|42];
+   }
+
+   int six = twice_index(_index = 3);
+
+.. TODO: binding<> returns a reference. We should use value_type<> here.
+
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
+   #include <cassert>
+
+   namespace parameter = boost::parameter;''')
+
+.. @example.append('''
+   int main()
+   {
+       assert(six == 6);
+   }''')
+
+.. @test('run')
+
+__ binding_intro_
+
 Lazy Default Computation
-------------------------
+========================
 
-Of course it's nice to avoid copying ``default_color``, but the
-more important cost is that of *constructing* it in the first
-place.  A ``vector_property_map`` is cheap to copy, since it holds
-its elements via a |shared_ptr|_.  On the other hand, construction of
-``default_color`` costs at least two dynamic memory allocations and
-``num_vertices(g)`` copies; it would be better to avoid doing this
-work when the default value won't be needed.
+When a default value is expensive to compute, it would be
+preferable to avoid it until we're sure it's absolutely necessary.
+``BOOST_PARAMETER_FUNCTION`` takes care of that problem for us, but
+when using |ArgumentPack|\ s explicitly, we need a tool other than
+``operator|``::
 
-.. |shared_ptr| replace:: ``shared_ptr``
+   BOOST_PARAMETER_NAME(s1)
+   BOOST_PARAMETER_NAME(s2)
+   BOOST_PARAMETER_NAME(s3)
 
-.. _shared_ptr: ../../../smart_ptr/shared_ptr.htm
+   template <class ArgumentPack>
+   std::string f(ArgumentPack const& args)
+   {
+       std::string const& s1 = args[_s1];
+       std::string const& s2 = args[_s2];
+       typename parameter::binding<
+           ArgumentPack,tag::s3,std::string
+       >::type s3 = args[_s3|(s1+s2)]; // always constructs s1+s2
+       return s3;
+   }
 
-To that end, the library allows us to supply a callable object
-that—if no argument was supplied by the caller—will be invoked to
-construct the default value.  Instead of following the keyword with
-the ``|`` operator, we'll use ``||`` and follow it with a
-nullary (zero-argument) function object that constructs a
-default_color_map.  Here, we build the function object using
-Boost.Lambda_: [#bind]_
+   std::string x = f((_s1="hello,", _s2=" world", _s3="hi world"));
 
-.. _Boost.Lambda: ../../../lambda/index.html
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
+   #include <string>
+   
+   namespace parameter = boost::parameter;''')
 
+.. @example.append('''
+   int main()
+   {}''')
+
+.. @test('run')
+
+In the example above, the string ``"hello, world"`` is constructed
+despite the fact that the user passed us a value for ``s3``.  To
+remedy that, we can compute the default value *lazily* (that is,
+only on demand), by combining the logical-or (“``||``”) operator
+with a function object built by the Boost Lambda_ library: [#bind]_
+
 .. parsed-literal::
 
-  // After #include <boost/lambda/construct.hpp>
-  typename parameter::binding<
-      ArgumentPack
-    , tag::color_map
-    , default_color_map
-  >::type color = args[
-    color_map
-    **|| boost::lambda::construct<default_color_map>(num_vertices(g),i)**
-  ];
+   namespace lambda = boost::lambda;
 
+   typename parameter::binding<
+       ArgumentPack, tag::s3, std::string
+   >::type s3 = args[_s3 **|| (lambda::var(s1)+lambda::var(s2))** ];
+
+.. @example.prepend('''
+   #include <boost/lambda/lambda.hpp>
+   #include <boost/parameter.hpp>
+   #include <string>
+
+   namespace parameter = boost::parameter;
+
+   BOOST_PARAMETER_NAME(s1)
+   BOOST_PARAMETER_NAME(s2)
+   BOOST_PARAMETER_NAME(s3)
+
+   template <class ArgumentPack>
+   std::string f(ArgumentPack const& args)
+   {
+       std::string const& s1 = args[_s1];
+       std::string const& s2 = args[_s2];''')
+
+.. @example.append('''
+       return s3;
+   }
+
+   std::string x = f((_s1="hello,", _s2=" world", _s3="hi world"));
+
+   int main()
+   {}''')
+
+.. @test('run')
+
+.. _Lambda: ../../../lambda/index.html
+
 .. sidebar:: Mnemonics
 
    To remember the difference between ``|`` and ``||``, recall that
@@ -969,76 +1886,207 @@
    Similarly, in ``color_map[param||f]``, ``f`` is only invoked if
    no ``color_map`` argument was supplied.
 
-Dispatching Based on the Presence of a Default
-----------------------------------------------
+The expression ``lambda::var(s1)+lambda::var(s2)`` yields a
+*function object* that, when invoked, adds the two strings
+together.  That function will only be invoked if no ``s3`` argument
+is supplied by the caller.
 
-In fact, the Graph library itself constructs a slightly different
-``color_map``, to avoid even the overhead of initializing a
-|shared_ptr|_::
+================ 
+ Best Practices
+================
 
-   std::vector<boost::default_color_type> 
-     color_vec(num_vertices(g));
+By now you should have a fairly good idea of how to use the
+Parameter library.  This section points out a few more-marginal
+issues that will help you use the library more effectively.
 
-   boost::iterator_property_map<
-       typename std::vector<
-          boost::default_color_type
-       >::iterator
-     , Index
-   > c(color_vec.begin(), i);
+--------------
+Keyword Naming
+--------------
 
-To avoid instantiating that code when it isn't needed, we'll have
-to find a way to select different function implementations, at
-compile time, based on whether a ``color_map`` argument was
-supplied.  By using `tag dispatching`_ on the presence of a
-``color_map`` argument, we can do just that:
+``BOOST_PARAMETER_NAME`` prepends a leading underscore to the names
+of all our keyword objects in order to avoid the following
+usually-silent bug:
 
-.. _`tag dispatching`: ../../../../more/generic_programming.html#tag_dispatching
-
 .. parsed-literal::
 
-  #include <boost/type_traits/is_same.hpp>
-  #include <boost/mpl/bool.hpp>
+  namespace people
+  {
+    namespace tag { struct name; struct age;  }
 
-  namespace graphs 
-  { 
-      template <class ArgumentPack>
-    void dfs_dispatch(ArgumentPack& args, **mpl::true_**)
+    namespace // unnamed
     {
-        *…use the color map computed in the previous example…*
+      boost::parameter::keyword<tag::name>& **name**
+      = boost::parameter::keyword<tag::name>::instance;
+      boost::parameter::keyword<tag::age>& **age**
+      = boost::parameter::keyword<tag::age>::instance;
     }
-    
-    template <class ArgumentPack>
-    void dfs_dispatch(ArgumentPack& args, **mpl::false_**)
+
+    BOOST_PARAMETER_FUNCTION(
+        (void), g, tag, (optional (name, \*, "bob")(age, \*, 42)))
     {
-        *…use args[color]…*
+        std::cout << name << ":" << age;
     }
-    
+
+    void f(int age)
+    {
+    :vellipsis:`\ 
+       .
+       .
+       .
+     ` 
+       g(**age** = 3); // whoops!
+    }
+  }
+
+.. @ignore()
+
+Although in the case above, the user was trying to pass the value
+``3`` as the ``age`` parameter to ``g``, what happened instead
+was that ``f``\ 's ``age`` argument got reassigned the value 3,
+and was then passed as a positional argument to ``g``.  Since
+``g``'s first positional parameter is ``name``, the default value
+for ``age`` is used, and g prints ``3:42``.  Our leading
+underscore naming convention that makes this problem less likely
+to occur.
+
+In this particular case, the problem could have been detected if
+f's ``age`` parameter had been made ``const``, which is always a
+good idea whenever possible.  Finally, we recommend that you use
+an enclosing namespace for all your code, but particularly for
+names with leading underscores.  If we were to leave out the
+``people`` namespace above, names in the global namespace
+beginning with leading underscores—which are reserved to your C++
+compiler—might become irretrievably ambiguous with those in our
+unnamed namespace.
+
+----------
+Namespaces
+----------
+
+In our examples we've always declared keyword objects in (an
+unnamed namespace within) the same namespace as the
+Boost.Parameter-enabled functions using those keywords:
+
+.. parsed-literal::
+
+  namespace lib
+  {
+    **BOOST_PARAMETER_NAME(name)
+    BOOST_PARAMETER_NAME(index)**
+
     BOOST_PARAMETER_FUNCTION(
-        (void), 
-        depth_first_search, 
+      (int), f, tag, 
+      (optional (name,*,"bob")(index,(int),1))
+    )
+    {
+        std::cout << name << ":" << index << std::endl;
+        return index;
+    }
+  }
 
-        tag,
-        (required (graph,*) )
-        (optional (visitor,*) (root_vertex,*) 
-                  (index_map,*) (out(color_map),*) )
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
+   #include <iostream>''')
+.. @namespace_setup = str(example)
+.. @ignore()
+
+Users of these functions have a few choices:
+
+1. Full qualification:
+
+  .. parsed-literal::
+
+    int x = **lib::**\ f(**lib::**\ _name = "jill", **lib::**\ _index = 1);
+
+  This approach is more verbose than many users would like.
+
+.. @example.prepend(namespace_setup)
+.. @example.append('int main() {}')
+.. @test('run')
+
+2. Make keyword objects available through
+   *using-declarations*:
+
+  .. parsed-literal::
+
+    **using lib::_name;
+    using lib::_index;**
+
+    int x = lib::f(_name = "jill", _index = 1);
+
+  This version is much better at the actual call site, but the
+  *using-declarations* themselves can be verbose and hard-to
+  manage.
+
+.. @example.prepend(namespace_setup)
+.. @example.append('int main() {}')
+.. @test('run')
+
+3. Bring in the entire namespace with a *using-directive*:
+
+  .. parsed-literal::
+
+    **using namespace lib;**
+    int x = **f**\ (_name = "jill", _index = 3);
+
+  This option is convenient, but it indiscriminately makes the
+  *entire* contents of ``lib`` available without qualification.
+
+.. @example.prepend(namespace_setup)
+.. @example.append('int main() {}')
+.. @test('run')
+
+If we add an additional namespace around keyword declarations,
+though, we can give users more control:
+
+.. parsed-literal::
+
+  namespace lib
+  {
+    **namespace keywords
+    {**
+       BOOST_PARAMETER_NAME(name)
+       BOOST_PARAMETER_NAME(index)
+    **}**
+
+    BOOST_PARAMETER_FUNCTION(
+      (int), f, **keywords::**\ tag, 
+      (optional (name,*,"bob")(index,(int),1))
     )
     {
-        typedef typename binding<args,tag::color>::type color\_;
-        dfs_dispatch(
-          args, **boost::is_same<color\_,parameter::void_>()**\ );
+        std::cout << name << ":" << index << std::endl;
+        return index;
     }
   }
 
-We've used the fact that the default for ``binding``\ 's third
-argument is ``parameter::void``: because specializations of ``is_same`` are
-``bool``-valued MPL |Integral Constant|_\ s derived either
-from ``mpl::true_`` or ``mpl::false_``, the appropriate
-``dfs_dispatch`` implementation will be selected.
+.. @example.prepend('''
+   #include <boost/parameter.hpp>
+   #include <iostream>''')
 
-.. |Integral Constant| replace:: :concept:`Integral Constant`
+Now users need only a single *using-directive* to bring in just the
+names of all keywords associated with ``lib``:
 
-.. _`Integral Constant`: ../../../mpl/doc/refmanual/integral-constant.html
+.. parsed-literal::
+  
+  **using namespace lib::keywords;**
+  int y = lib::f(_name = "bob", _index = 2);
 
+.. @example.append('int main() {}')
+.. @test('run', howmany='all')
+
+-------------
+Documentation
+-------------
+
+The interface idioms enabled by Boost.Parameter are completely new
+(to C++), and as such are not served by pre-existing documentation
+conventions.  
+
+.. Note:: This space is empty because we haven't settled on any
+   best practices yet.  We'd be very pleased to link to your
+   documentation if you've got a style that you think is worth
+   sharing.
+
 ============================
  Portability Considerations
 ============================
@@ -1050,16 +2098,18 @@
 
 .. _`regression test results`: http://www.boost.org/regression/release/user/parameter.html
 
+-----------------
 No SFINAE Support
-=================
+-----------------
 
 Some older compilers don't support SFINAE.  If your compiler meets
 that criterion, then Boost headers will ``#define`` the preprocessor
 symbol ``BOOST_NO_SFINAE``, and parameter-enabled functions won't be
 removed from the overload set based on their signatures.
 
+---------------------------
 No Support for |result_of|_
-===========================
+---------------------------
 
 .. |result_of| replace:: ``result_of``
 
@@ -1106,8 +2156,9 @@
 
   .. |BOOST_PARAMETER_MATCH| replace:: ``BOOST_PARAMETER_MATCH``
 
+--------------------------------------------------
 Compiler Can't See References In Unnamed Namespace
-==================================================
+--------------------------------------------------
 
 If you use Microsoft Visual C++ 6.x, you may find that the compiler
 has trouble finding your keyword objects.  This problem has been
@@ -1126,6 +2177,17 @@
       using graphs::color_map;
     }
 
+================
+ Python Binding
+================
+
+.. _python: python.html
+
+Follow `this link`__ for documentation on how to expose
+Boost.Parameter-enabled functions to Python with `Boost.Python`_.
+
+__ python.html
+
 ===========
  Reference
 ===========
@@ -1137,6 +2199,25 @@
 
 __ reference.html
 
+==========
+ Glossary
+==========
+
+.. _arguments:
+
+:Argument (or “actual argument”): the value actually passed to a
+  function or class template
+
+.. _parameter:
+
+:Parameter (or “formal parameter”): the name used to refer to an
+  argument within a function or class template.  For example, the
+  value of ``f``'s *parameter* ``x`` is given by the *argument*
+  ``3``::
+
+    int f(int x) { return x + 1 }
+    int y = f(3);
+
 ==================
  Acknowledgements
 ==================
@@ -1166,25 +2247,22 @@
    ``int`` in the text, and your understanding of the Parameter
    library wouldn't suffer.
 
+.. [#ConceptCpp] This is a major motivation behind `ConceptC++`_.
+
+.. _`ConceptC++`: http://www.generic-programming.org/software/ConceptGCC/
+
 .. [#bind] The Lambda library is known not to work on `some
    less-conformant compilers`__.  When using one of those you could
-   define ::
-   
-      template <class T>
-      struct construct2
-      {
-          typedef T result_type;
+   use `Boost.Bind`_ to generate the function object::
 
-          template <class A1, class A2>
-          T operator()(A1 a1, A2 a2) { return T(a1,a2); }
-      };
+      boost::bind(std::plus<std::string>(),s1,s2)
 
-    and use `Boost.Bind`_ to generate the function object::
+.. [#is_keyword_expression] Here we're assuming there's a predicate
+   metafunction ``is_keyword_expression`` that can be used to
+   identify models of Boost.Python's KeywordExpression concept.
 
-      boost::bind(construct2<default_color_map>(),num_vertices(g),i)
-
 __ http://www.boost.org/regression/release/user/lambda.html
-.. _Boost.Bind: ../../../libs/bind/index.html
+.. _Boost.Bind: ../../../bind/index.html
 
 
 .. [#using] You can always give the illusion that the function
@@ -1202,7 +2280,8 @@
     lookup is due to Herb Sutter.
 
 
-.. [#sfinae] **SFINAE**: **S**\ ubstitution **F**\ ailure **I**\ s
+.. [#sfinae] This capability depends on your compiler's support for SFINAE. 
+   **SFINAE**: **S**\ ubstitution **F**\ ailure **I**\ s
    **N**\ ot **A**\ n **E** rror.  If type substitution during the
    instantiation of a function template results in an invalid type,
    no compilation error is emitted; instead the overload is removed

Modified: boost/trunk/libs/parameter/doc/python.rst
===================================================================
--- boost/trunk/libs/parameter/doc/python.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/doc/python.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,23 +2,26 @@
  The Boost Parameter Library Python Binding Documentation 
 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 
-|(logo)|__
-
-.. |(logo)| image:: ../../../../boost.png
-   :alt: Boost
-
-__ ../../../../index.htm
-
 :Authors:       Daniel Wallin
 :Contact:       dalwan01 at student.umu.se
 :organization:  `Boost Consulting`_
-:date:          $Date: 2006/05/15 07:13:57 $
+:date:          $Date: 2006/09/21 17:33:28 $
 
 :copyright:     Copyright David Abrahams, Daniel Wallin
                 2005. Distributed under the Boost Software License,
                 Version 1.0. (See accompanying file LICENSE_1_0.txt
                 or copy at http://www.boost.org/LICENSE_1_0.txt)
 
+:abstract:      Makes it possible to bind Boost.Parameter-enabled
+                functions, operators and constructors to Python.
+
+|(logo)|__
+
+.. |(logo)| image:: ../../../../boost.png
+   :alt: Boost
+
+__ ../../../../index.htm
+
 .. _`Boost Consulting`: http://www.boost-consulting.com
 
 
@@ -31,7 +34,7 @@
 .. role:: function
     :class: function
 
-.. |KeywordsSpec| replace:: :concept:`KeywordsSpec`
+.. |ParameterSpec| replace:: :concept:`ParameterSpec`
 
 .. contents::
     :depth: 1
@@ -39,11 +42,14 @@
 Introduction
 ------------
 
-``boost/parameter/python.hpp`` introduces a group of def_visitors_ that can
+``boost/parameter/python.hpp`` introduces a group of |def_visitors|_ that can
 be used to easily expose Boost.Parameter-enabled member functions to Python with 
 Boost.Python. It also provides a function template ``def()`` that can be used
 to expose Boost.Parameter-enabled free functions.
 
+.. |def_visitor| replace:: ``def_visitor``
+.. |def_visitors| replace:: ``def_visitors``
+
 .. _def_visitor: def_visitors_
 .. _def_visitors: ../../../python/doc/v2/def_visitor.html
 
@@ -52,21 +58,27 @@
 functions are templates, the desired function signature must be
 specified.
 
-The keyword tags are specified as an `MPL Sequence`_, using the
-pointer qualifications described in |KeywordsSpec|_ below.  The
-signature is also specifid as an `MPL sequence`_ of parameter
-types. Additionally, ``boost::parameter::python::function`` and
-``boost::parameter::python::def`` requires a class with forwarding
-overloads. We will take a closer look at how this is done in the
-tutorial section below.
+..  The keyword tags are specified as an `MPL Sequence`_, using the
+    pointer qualifications described in |ParameterSpec|_ below.  The
+    signature is also specifid as an `MPL sequence`_ of parameter
+    types. Additionally, ``boost::parameter::python::function`` and
+    ``boost::parameter::python::def`` requires a class with forwarding
+    overloads. We will take a closer look at how this is done in the
+    tutorial section below.
 
+The keyword tags and associated argument types are specified as an `MPL
+Sequence`_, using the function type syntax described in |ParameterSpec|_
+below. Additionally, ``boost::parameter::python::function`` and
+``boost::parameter::python::def`` requires a class with forwarding overloads.
+We will take a closer look at how this is done in the tutorial section below.
+
 .. The last two sentences are terribly vague.  Which namespace is
 .. ``function`` in?  Isn't the return type always needed?  What
 .. else are we going to do other than pass these sequences to
 .. function?
 
 .. _`MPL Sequence`: ../../../mpl/doc/refmanual/sequences.html
-.. _keywordsspec: `concept KeywordsSpec`_
+.. _parameterspec: `concept ParameterSpec`_
 
 Tutorial
 --------
@@ -78,11 +90,14 @@
 .. _macros: index.html
 
 The class and member function we are interested in binding looks
-like this::
+like this:
 
+.. parsed-literal::
+
   #include <boost/parameter/keyword.hpp>
   #include <boost/parameter/preprocessor.hpp>
   #include <boost/parameter/python.hpp>
+  #include <boost/python.hpp>
 
   // First the keywords
   BOOST_PARAMETER_KEYWORD(tag, title)
@@ -91,7 +106,7 @@
 
   class window
   {
-   public:
+  public:
       BOOST_PARAMETER_MEMBER_FUNCTION(
         (void), open, tag,
         (required (title, (std::string)))
@@ -99,14 +114,21 @@
                   (height, (unsigned), 400))
       )
       {
-          …
+          *… function implementation …*
       }
   };
 
+.. @example.prepend('#include <cassert>')
+.. @example.replace_emphasis('''
+   assert(title == "foo");
+   assert(height == 20);
+   assert(width == 400);
+   ''')
+
 It defines a set of overloaded member functions called ``open`` with one
 required parameter and two optional ones. To bind this member function to
 Python we use the binding utility ``boost::parameter::python::function``.
-``boost::parameter::python::function`` is a def_visitor_ that we'll instantiate
+``boost::parameter::python::function`` is a |def_visitor|_ that we'll instantiate
 and pass to ``boost::python::class_::def()``.
 
 To use ``boost::parameter::python::function`` we first need to define
@@ -118,7 +140,8 @@
   {
       template <class A0, class A1, class A2>
       void operator()(
-          boost::type<void>, window& self, A0 const& a0, A1 const& a1, A2 const& a2
+          boost::type<void>, window& self
+        , A0 const& a0, A1 const& a1, A2 const& a2
       )
       {
           self.open(a0, a1, a2);
@@ -149,13 +172,18 @@
   {
       using namespace boost::python;
       namespace py = boost::parameter::python;
+      namespace mpl = boost::mpl;
 
       class_<window>("window")
           .def(
               "open", py::function<
                   open_fwd
-                , mpl::vector<tag::title, tag::width*, tag::height*>
-                , mpl::vector<void, std::string, unsigned, unsigned>
+                , mpl::vector<
+                      void
+                    , tag::title(std::string)
+                    , tag::width*(unsigned)
+                    , tag::height*(unsigned)
+                  >
               >()
           );
   }
@@ -169,23 +197,28 @@
       , howmany = 'all'
     )
 
-.. @del jam_prefix[-1:]
+.. @del jam_prefix[:]
 
-``py::function`` is passed three parameters. The first one is the class
-with forwarding overloads that we defined earlier. The second one is
-an `MPL Sequence`_ with the keyword tag types for the function. The
-pointer syntax means that the parameter is optional, so in this case
-``width`` and ``height`` are optional parameters. The third parameter
-is an `MPL Sequence`_ with the desired function signature. The return type comes first, and
-then the parameter types:
+``py::function`` is passed two parameters. The first one is the class with
+forwarding overloads that we defined earlier. The second one is an `MPL
+Sequence`_ with the keyword tag types and argument types for the function
+specified as function types. The pointer syntax used in ``tag::width*`` and
+``tag::height*`` means that the parameter is optional. The first element of
+the `MPL Sequence`_ is the return type of the function, in this case ``void``.
 
-.. parsed-literal::
+..  The
+    pointer syntax means that the parameter is optional, so in this case
+    ``width`` and ``height`` are optional parameters. The third parameter
+    is an `MPL Sequence`_ with the desired function signature. The return type comes first, and
+    then the parameter types:
 
-    mpl::vector<void,        std::string, unsigned, unsigned>
-                *return type*  *title*        *width*     *height*
+    .. parsed-literal::
 
-.. @ignore()
+        mpl::vector<void,        std::string, unsigned, unsigned>
+                    *return type*  *title*        *width*     *height*
 
+    .. @ignore()
+
 That's it! This class can now be used in Python with the expected syntax::
 
     >>> w = my_module.window()
@@ -226,31 +259,35 @@
 
 ------------------------------------------------------------------------------
 
-concept |KeywordsSpec|
-----------------------
+concept |ParameterSpec|
+-----------------------
 
-A |KeywordsSpec| is an `MPL sequence`_ where each element is either:
+A |ParameterSpec| is a function type ``K(T)`` that describes both the keyword tag,
+``K``, and the argument type, ``T``, for a parameter.
 
-* A *required* keyword of the form ``K``
-* **or**, an *optional* keyword of the form ``K*``
-* **or**, a *special* keyword of the form ``K**``
+``K`` is either:
 
-where ``K`` is a keyword tag type, as used in a specialization 
-of boost::parameter::keyword__.
+* A *required* keyword of the form ``Tag``
+* **or**, an *optional* keyword of the form ``Tag*``
+* **or**, a *special* keyword of the form ``Tag**``
 
+where ``Tag`` is a keyword tag type, as used in a specialization
+of |keyword|__.
+
+.. |keyword| replace:: ``boost::parameter::keyword``
 __ ../../../parameter/doc/html/reference.html#keyword
 
-The **arity range** of a |KeywordsSpec| is defined as the closed
-range:
+The **arity range** for an `MPL Sequence`_ of |ParameterSpec|'s is
+defined as the closed range:
 
 .. parsed-literal::
 
-    [ mpl::size<S> - number of *special* keyword tags in ``S`` , mpl::size<S> ]
+  [ mpl::size<S> - number of *special* keyword tags in ``S``, mpl::size<S> ]
 
-For example, the **arity range** of ``mpl::vector2<x,y>`` is [2,2], the **arity range** of
-``mpl::vector2<x,y*>`` is [2,2] and the **arity range** of ``mpl::vector2<x,y**>`` is [1,2].
+For example, the **arity range** of ``mpl::vector2<x(int),y(int)>`` is ``[2,2]``,
+the **arity range** of ``mpl::vector2<x(int),y*(int)>`` is ``[2,2]`` and the
+**arity range** of ``mpl::vector2<x(int),y**(int)>`` is ``[1,2]``.
 
-.. Don't optional keywords affect the arity range?
 
 
 *special* keywords
@@ -263,24 +300,57 @@
 
 .. parsed-literal::
 
-  template <class ArgumentPack>
-  void dfs_dispatch(ArgumentPack& args, mpl::false\_)
+  namespace core
   {
-      *…compute and use default color map…*
+    template <class ArgumentPack>
+    void dfs_dispatch(ArgumentPack const& args, mpl::false\_)
+    {
+        *…compute and use default color map…*
+    }
+
+    template <class ArgumentPack, class ColorMap>
+    void dfs_dispatch(ArgumentPack const& args, ColorMap colormap)
+    {
+        *…use colormap…*
+    }
   }
-  
-  template <class ArgumentPack, class ColorMap>
-  void dfs_dispatch(ArgumentPack& args, ColorMap colormap)
-  {
-      *…use colormap…*
-  }
-  
+
   template <class ArgumentPack>
-  void depth_first_search(ArgumentPack& args)
+  void depth_first_search(ArgumentPack const& args)
   {
       core::dfs_dispatch(args, args[color | mpl::false_()]);
   }
 
+.. @example.prepend('''
+   #include <boost/parameter/keyword.hpp>
+   #include <boost/parameter/parameters.hpp>
+   #include <boost/mpl/bool.hpp>
+   #include <cassert>
+
+   BOOST_PARAMETER_KEYWORD(tag, color);
+
+   typedef boost::parameter::parameters<tag::color> params;
+
+   namespace mpl = boost::mpl;
+   ''')
+
+.. @example.replace_emphasis('''
+   assert(args[color | 1] == 1);
+   ''')
+
+.. @example.replace_emphasis('''
+   assert(args[color | 1] == 0);
+   ''')
+
+.. @example.append('''
+   int main()
+   {
+       depth_first_search(params()());
+       depth_first_search(params()(color = 0));
+   }''')
+
+.. @build()
+
 .. _example: index.html#dispatching-based-on-the-presence-of-a-default
 
 In the above example the type of the default for ``color`` is ``mpl::false_``, a
@@ -292,9 +362,8 @@
 that it needs to generate two overloads, one with the ``color`` parameter
 present and one without. Had there been two *special* keywords, four
 overloads would need to be generated. The number of generated overloads is
-equal to ``2^N``, where ``N`` is the number of *special* keywords.
+equal to 2\ :sup:`N`, where ``N`` is the number of *special* keywords.
 
-
 ------------------------------------------------------------------------------
 
 class template ``init``
@@ -304,62 +373,103 @@
 
 .. parsed-literal::
 
-    template <class Keywords, class Signature>
-    struct init : python::def_visitor<init<Keywords, Signature> >
+    template <class ParameterSpecs>
+    struct init : python::def_visitor<init<ParameterSpecs> >
     {
         template <class Class> 
         void def(Class& class\_);
+
+        template <class CallPolicies>
+        *def\_visitor* operator[](CallPolicies const& policies) const;
     };
 
+.. @ignore()
+
 ``init`` requirements 
 ~~~~~~~~~~~~~~~~~~~~~
 
-* ``Keywords`` is a model of |KeywordsSpec|. 
-* ``Signature`` is an MPL sequence of parameter types, 
-  in the order dictated by ``Keywords``.
+* ``ParameterSpecs`` is an `MPL sequence`_ where each element is a
+  model of |ParameterSpec|. 
 * For every ``N`` in ``[U,V]``, where ``[U,V]`` is the **arity
-  range** of ``Keywords``, ``Class`` must support these
+  range** of ``ParameterSpecs``, ``Class`` must support these
   expressions: 
 
   ======================= ============= =========================================
   Expression              Return type   Requirements
   ======================= ============= =========================================
-  ``Class(a0, ..., aN)``  \-            ``a0``..\ ``aN`` are tagged arguments.
+  ``Class(a0, …, aN)``    \-            ``a0``\ …\ ``aN`` are tagged arguments.
   ======================= ============= =========================================
 
-.. Limit the width of these table cells.  Some rst backend
-.. processors actually produce different results depending on the
-.. distribution of width.
 
-  
 
+``template <class CallPolicies> operator[](CallPolicies const&)``
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+
+Returns a ``def_visitor`` equivalent to ``*this``, except that it
+uses CallPolicies when creating the binding.
+
+
 Example
 ~~~~~~~
 
 .. parsed-literal::
 
-    struct base { /\* ... \*/ };
+    #include <boost/parameter/keyword.hpp>
+    #include <boost/parameter/preprocessor.hpp>
+    #include <boost/parameter/python.hpp>
+    #include <boost/python.hpp>
+    #include <boost/mpl/vector.hpp>
 
+    BOOST_PARAMETER_KEYWORD(tag, x)
+    BOOST_PARAMETER_KEYWORD(tag, y)
+
+    struct base 
+    { 
+        template <class ArgumentPack>
+        base(ArgumentPack const& args)
+        {
+            *… use args …*
+        }
+    };
+
     class X : base
     {
     public:
-        BOOST_PARAMETER_CONSTRUCTOR(X, (base),
+        BOOST_PARAMETER_CONSTRUCTOR(X, (base), tag,
             (required (x, \*))
             (optional (y, \*))
         )
     };
 
-    BOOST_PYTHON_MODULE(..)
+    BOOST_PYTHON_MODULE(*module name*)
     {
-        class_<X>("X")
+        using namespace boost::python;
+        namespace py = boost::parameter::python;
+        namespace mpl = boost::mpl;
+
+        class_<X>("X", no_init)
             .def(
-                init<
-                  , mpl::vector2<tag::x, tag::y\*>
-                  , mpl::vector2<int, int>
+                py::init<
+                    mpl::vector<tag::x(int), tag::y\*(int)>
                 >()
             );
     }
 
+.. @example.replace_emphasis('''
+   assert(args[x] == 0);
+   assert(args[y | 1] == 1);
+   ''')
+
+.. @example.replace_emphasis('my_module')
+
+.. @jam_prefix.append('import python ;')
+.. @jam_prefix.append('stage . : my_module /boost/python//boost_python ;')
+.. @my_module = build(
+        output = 'my_module'
+      , target_rule = 'python-extension'
+      , input = '/boost/python//boost_python'
+    )
+
 ------------------------------------------------------------------------------
 
 class template ``call``
@@ -369,34 +479,59 @@
 
 .. parsed-literal::
 
-    template <class Keywords, class Signature>
-    struct call : python::def_visitor<call<Keywords, Signature> >
+    template <class ParameterSpecs>
+    struct call : python::def_visitor<call<ParameterSpecs> >
     {
         template <class Class> 
         void def(Class& class\_);
+
+        template <class CallPolicies>
+        *def\_visitor* operator[](CallPolicies const& policies) const;
     };
 
+.. @ignore()
+
 ``call`` requirements 
 ~~~~~~~~~~~~~~~~~~~~~
 
-* ``Keywords`` is a model of |KeywordsSpec|. 
-* ``Signature`` is an MPL sequence with the types of the keyword parameters, 
-  in the order dictated by ``Keywords``, and the return type prepended.
-* ``Class`` must support these expressions, where ``c`` is an instance of ``Class``:
+* ``ParameterSpecs`` is an `MPL sequence`_ where each element
+  except the first models |ParameterSpec|. The first element
+  is the result type of ``c(…)``.
+* ``Class`` must support these expressions, where ``c`` is an 
+  instance of ``Class``:
 
   =================== ==================== =======================================
   Expression          Return type          Requirements
   =================== ==================== =======================================
-  ``c(a0, ..., aN)``  Convertible to ``R`` ``a0``..\ ``aN`` are tagged arguments.
+  ``c(a0, …, aN)``    Convertible to ``R`` ``a0``\ …\ ``aN`` are tagged arguments.
   =================== ==================== =======================================
 
-  For every ``N`` in ``[U,V]``, where ``[U,V]`` is the **arity range** of ``Keywords``.
+  For every ``N`` in ``[U,V]``, where ``[U,V]`` is the **arity range** of ``ParameterSpecs``.
 
+
+``template <class CallPolicies> operator[](CallPolicies const&)``
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+
+Returns a ``def_visitor`` equivalent to ``*this``, except that it
+uses CallPolicies when creating the binding.
+
+
 Example
 ~~~~~~~
 
 .. parsed-literal::
 
+    #include <boost/parameter/keyword.hpp>
+    #include <boost/parameter/preprocessor.hpp>
+    #include <boost/parameter/python.hpp>
+    #include <boost/python.hpp>
+    #include <boost/mpl/vector.hpp>
+
+    BOOST_PARAMETER_KEYWORD(tag, x)
+    BOOST_PARAMETER_KEYWORD(tag, y)
+
+    namespace parameter = boost::parameter;
+
     typedef parameter::parameters<
         parameter::required<tag::x>
       , parameter::optional<tag::y>
@@ -405,10 +540,10 @@
     class X
     {
     public:
-        template <class Args>
-        int call_impl(Args const& args)
+        template <class ArgumentPack>
+        int call_impl(ArgumentPack const& args)
         {
-            /\* ... \*/
+            *… use args …*
         }
 
         template <class A0>
@@ -424,17 +559,34 @@
         }
     };
 
-    BOOST_PYTHON_MODULE(..)
+    BOOST_PYTHON_MODULE(*module name*)
     {
+        using namespace boost::python;
+        namespace py = parameter::python;
+        namespace mpl = boost::mpl;
+
         class_<X>("X")
-            .def("f",
-                call<
-                  , mpl::vector2<tag::x, tag::y\*>
-                  , mpl::vector3<int, int, int>
+            .def(
+                py::call<
+                    mpl::vector<int, tag::x(int), tag::y\*(int)>
                 >()
             );
     }    
 
+.. @example.replace_emphasis('''
+   assert(args[x] == 0);
+   assert(args[y | 1] == 1);
+   return 0;
+   ''')
+
+.. @example.replace_emphasis('my_module')
+
+.. @my_module = build(
+        output = 'my_module'
+      , target_rule = 'python-extension'
+      , input = '/boost/python//boost_python'
+    )
+
 ------------------------------------------------------------------------------
 
 class template ``function``
@@ -444,50 +596,62 @@
 
 .. parsed-literal::
 
-    template <class Fwd, class Keywords, class Signature>
-    struct function : python::def_visitor<function<Fwd, Keywords, Signature> >
+    template <class Fwd, class ParameterSpecs>
+    struct function : python::def_visitor<function<Fwd, ParameterSpecs> >
     {
         template <class Class, class Options> 
         void def(Class& class\_, char const* name, Options const& options);
     };
 
+.. @ignore()
+
 ``function`` requirements 
 ~~~~~~~~~~~~~~~~~~~~~~~~~
 
-* ``Keywords`` is a model of |KeywordsSpec|. 
-* ``Signature`` is an MPL sequence with the types of the keyword parameters, 
-  in the order dictated by ``Keywords``, and the return type prepended.
+* ``ParameterSpecs`` is an `MPL sequence`_ where each element
+  except the first models |ParameterSpec|. The first element
+  is the result type of ``c.f(…)``, where ``f`` is the member
+  function.
 * An instance of ``Fwd`` must support this expression:
 
-  ============================================ ==================== ==============================================
+  ============================================ ==================== =================================================
   Expression                                   Return type          Requirements
-  ============================================ ==================== ==============================================
+  ============================================ ==================== =================================================
   ``fwd(boost::type<R>(), self, a0, …, aN)``   Convertible to ``R`` ``self`` is a reference to the object on which
-                                                                    the function should be invoked. ``a0``…``aN``
+                                                                    the function should be invoked. ``a0``\ …\ ``aN``
                                                                     are tagged arguments.
-  ============================================ ==================== ==============================================
+  ============================================ ==================== =================================================
 
-  For every ``N`` in ``[U,V]``, where ``[U,V]`` is the **arity range** of ``Keywords``.
+  For every ``N`` in ``[U,V]``, where ``[U,V]`` is the **arity range** of ``ParameterSpecs``.
 
 
 Example
 ~~~~~~~
 
-This example exports a member function ``f(int x, int y = …)`` to Python.
-The |KeywordsSpec| ``mpl::vector2<tag::x, tag::y*>`` has an **arity range**
-of [2,2], so we only need one forwarding overload.
+This example exports a member function ``f(int x, int y = …)`` to Python. The
+sequence of |ParameterSpec|'s ``mpl::vector2<tag::x(int), tag::y*(int)>`` has
+an **arity range** of [2,2], so we only need one forwarding overload.
 
 .. parsed-literal::
 
+    #include <boost/parameter/keyword.hpp>
+    #include <boost/parameter/preprocessor.hpp>
+    #include <boost/parameter/python.hpp>
+    #include <boost/python.hpp>
+    #include <boost/mpl/vector.hpp>
+
+    BOOST_PARAMETER_KEYWORD(tag, x)
+    BOOST_PARAMETER_KEYWORD(tag, y)
+
     class X
     {
     public:
         BOOST_PARAMETER_MEMBER_FUNCTION((void), f, tag,
             (required (x, \*))
-            (optional (y, \*))
+            (optional (y, \*, 1))
         )
         {
-            /\* … \*/
+            *…*
         }
     };
 
@@ -500,21 +664,34 @@
         }
     };
 
-    BOOST_PYTHON_MODULE(..)
+    BOOST_PYTHON_MODULE(*module name*)
     {
+        using namespace boost::python;
+        namespace py = boost::parameter::python;
+        namespace mpl = boost::mpl;
+
         class_<X>("X")
             .def("f",
-                function<
+                py::function<
                     f_fwd
-                  , mpl::vector2<tag::x, tag::y\*>
-                  , mpl::vector3<void, int, int>
+                  , mpl::vector<void, tag::x(int), tag::y\*(int)>
                 >()
             );
     }
 
-.. This example is not consistent with your definition of arity
-.. range, above.  There are no special keywords in play here.
+.. @example.replace_emphasis('''
+   assert(x == 0);
+   assert(y == 1);
+   ''')
 
+.. @example.replace_emphasis('my_module')
+
+.. @my_module = build(
+        output = 'my_module'
+      , target_rule = 'python-extension'
+      , input = '/boost/python//boost_python'
+    )
+
 ------------------------------------------------------------------------------
 
 function template ``def``
@@ -524,42 +701,43 @@
 
 .. parsed-literal::
 
-    template <class Fwd, class Keywords, class Signature>
+    template <class Fwd, class ParameterSpecs>
     void def(char const* name);
 
+.. @ignore()
+
 ``def`` requirements 
 ~~~~~~~~~~~~~~~~~~~~
 
-* ``Keywords`` is a model of |KeywordsSpec|. 
-* ``Signature`` is an MPL sequence of parameters types, 
-  in the order dictated by ``Keywords``, with the return type
-  prepended. 
+* ``ParameterSpecs`` is an `MPL sequence`_ where each element
+  except the first models |ParameterSpec|. The first element
+  is the result type of ``f(…)``, where ``f`` is the function.
 * An instance of ``Fwd`` must support this expression:
 
-  ====================================== ==================== ======================================
+  ====================================== ==================== =======================================
   Expression                             Return type          Requirements
-  ====================================== ==================== ======================================
-  ``fwd(boost::type<R>(), a0, …, aN)``   Convertible to ``R`` ``a0``…``aN`` are tagged arguments.
-  ====================================== ==================== ======================================
+  ====================================== ==================== =======================================
+  ``fwd(boost::type<R>(), a0, …, aN)``   Convertible to ``R`` ``a0``\ …\ ``aN`` are tagged arguments.
+  ====================================== ==================== =======================================
 
-  For every ``N`` in ``[U,V]``, where ``[U,V]`` is the **arity range** of ``Keywords``.
+  For every ``N`` in ``[U,V]``, where ``[U,V]`` is the **arity range** of ``ParameterSpecs``.
 
 
 Example
 ~~~~~~~
 
-This example exports a function ``f(int x, int y = …)`` to Python.
-The |KeywordsSpec| ``mpl::vector2<tag::x, tag::y*>`` has an **arity range**
-of [2,2], so we only need one forwarding overload.
+This example exports a function ``f(int x, int y = …)`` to Python. The
+sequence of |ParameterSpec|'s ``mpl::vector2<tag::x(int), tag::y*(int)>`` has
+an **arity range** of [2,2], so we only need one forwarding overload.
 
 .. parsed-literal::
 
     BOOST_PARAMETER_FUNCTION((void), f, tag,
         (required (x, \*))
-        (optional (y, \*))
+        (optional (y, \*, 1))
     )
     {
-        /\* … \*/
+        *…*
     }
 
     struct f_fwd
@@ -575,17 +753,19 @@
     {
         def<
             f_fwd
-          , mpl::vector2<tag::x, tag::y\*>
-          , mpl::vector3<void, int, int>
+          , mpl::vector<
+                void, tag::\ x(int), tag::\ y\*(int)
+            >
         >("f");
     }
 
+.. @ignore()
+
 .. again, the undefined ``fwd`` identifier.
 
 Portability
 -----------
 
-The Boost.Parameter Python binding library requires *partial template specialization*.
+The Boost.Parameter Python binding library requires *partial template
+specialization*.
 
-.. Oh.  In that case, we don't have to worry so much about
-.. compilers that can't parse function types.

Modified: boost/trunk/libs/parameter/doc/reference.rst
===================================================================
--- boost/trunk/libs/parameter/doc/reference.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/doc/reference.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,13 +2,6 @@
  The Boost Parameter Library Reference Documentation 
 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 
-|(logo)|__
-
-.. |(logo)| image:: ../../../../boost.png
-   :alt: Boost
-
-__ ../../../../index.htm
-
 :Authors:       David Abrahams, Daniel Wallin
 :Contact:       dave at boost-consulting.com, dalwan01 at student.umu.se
 :organization:  `Boost Consulting`_
@@ -19,6 +12,13 @@
                 Version 1.0. (See accompanying file LICENSE_1_0.txt
                 or copy at http://www.boost.org/LICENSE_1_0.txt)
 
+|(logo)|__
+
+.. |(logo)| image:: ../../../../boost.png
+   :alt: Boost
+
+__ ../../../../index.htm
+
 .. _`Boost Consulting`: http://www.boost-consulting.com
 
 
@@ -554,6 +554,113 @@
 Macros in this section can be used to ease the writing of code
 using the Parameter libray by eliminating repetitive boilerplate.
 
+``BOOST_PARAMETER_FUNCTION(result,name,tag_namespace,arguments)``
+-----------------------------------------------------------------
+
+:Defined in: `boost/parameter/preprocessor.hpp`__
+
+__ ../../../../boost/parameter/preprocessor.hpp
+
+:Requires: ``result`` is the parenthesized return type of the function.
+  ``name`` is the base name of the function, this is the name of the
+  generated forwarding functions. ``tag_namespace`` is the namespace in
+  which the keywords used by the function resides. ``arguments`` is
+  a list of *argument specifiers*, as defined below.
+
+
+:Argument specifiers syntax:
+  .. parsed-literal::
+
+    argument-specifiers ::= specifier-group {specifier-group}
+
+    specifier-group ::= ( '(' 'optional' optional-specifier {optional-specifier} ')' ) |
+                        ( '(' 'required' required-specifier {required-specifier} ')' )
+
+    optional-specifier ::= '(' name ',' restriction ',' default-value ')'
+    required-specifier ::= '(' name ',' restriction ')'
+
+    restriction ::= ('*' '(' lambda-expression ')' ) |
+                    ( '(' typename ')' ) |
+                    '*'
+
+  ``name`` is any valid C++ identifier. ``default-value`` is any valid
+  C++ expression. ``typename`` is the name of a type.
+  ``lambda-expression`` is an `MPL lambda expression`_.
+
+.. _`MPL lambda expression`: ../../../mpl/doc/refmanual/lambda-expression.html
+
+:Generated names in enclosing scope:
+  * ``boost_param_result_ ## __LINE__ ## name``
+  * ``boost_param_params_ ## __LINE__ ## name``
+  * ``boost_param_parameters_ ## __LINE__ ## name``
+  * ``boost_param_impl ## name``
+  * ``boost_param_default_ ## __LINE__ ## name``
+
+
+Approximate expansion:
+  **Where**:
+
+  * ``n`` denotes the *minimum* arity, as determined from ``arguments``.
+  * ``m`` denotes the *maximum* arity, as determined from ``arguments``.
+
+  .. parsed-literal::
+
+    template <class T>
+    struct boost_param_result\_ ## __LINE__ ## **name**
+    {
+        typedef **result** type;
+    };
+
+    struct boost_param_params\_ ## __LINE__ ## **name**
+      : boost::parameter::parameters<
+            *list of parameter specifications, based on arguments*
+        >
+    {};
+
+    typedef boost_param_params\_ ## __LINE__ ## **name** 
+      boost_param_parameters\_ ## __LINE__ ## **name**;
+
+    template <class A0, …, class A\ **n**>
+    *result type* **name**\ (
+        A0 *cv*\ & a0, …, A\ **n** *cv*\ & a\ **n**
+      , typename boost_param_parameters\_ ## __LINE__ ## **name**::match<
+          A0 *cv*, …, A\ **n** *cv*
+        >::type = boost_param_parameters\_ ## __LINE__ ## **name**\ ()
+    )
+    {
+        *… forward to implementation …*
+    }
+
+    :vellipsis:`\
+      .
+      .
+      .
+     `
+
+    template <class A0, …, class A\ **m**>
+    *result type* **name**\ (
+        A0 *cv*\ & a0, …, A\ **m** *cv*\ & a\ **m**
+      , typename boost_param_parameters\_ ## __LINE__ ## **name**::match<
+          A0 *cv*, …, A\ **m** *cv*
+        >::type = boost_param_parameters\_ ## __LINE__ ## **name**\ ()
+    )
+    {
+        *… forward to implementation …*
+    }
+
+    template <
+        class ResultType
+      , class *argument name*\ **0** ## _type
+        …
+      , class *argument name*\ **m** ## _type
+    >
+    ResultType boost_param_default\_ ## __LINE__ ## **name**\ (
+        (ResultType(*)())
+      , *argument name*\ **0** ## _type& *argument name*\ **0**
+        …
+      , *argument name*\ **m** ## _type& *argument name*\ **m**
+    )
+
 ``BOOST_PARAMETER_FUN(r,n,l,h,p)``
 ----------------------------------
 
@@ -691,4 +798,5 @@
 .. _result_of: ../../../utility/utility.htm#result_of
 
 .. |BOOST_NO_RESULT_OF| replace:: ``BOOST_NO_RESULT_OF``
-.. _BOOST_NO_RESULT_OF: ../../../utility/utility.htm#BOOST_NO_RESULT_OF
\ No newline at end of file
+.. _BOOST_NO_RESULT_OF: ../../../utility/utility.htm#BOOST_NO_RESULT_OF
+

Deleted: boost/trunk/libs/parameter/test/Jamfile
===================================================================
--- boost/trunk/libs/parameter/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,38 +0,0 @@
-# Boost Parameter Library test Jamfile
-
-subproject libs/parameter/test ;
-
-# bring in rules for testing
-import testing ;
-
-test-suite "parameter"
-  :  [ run basics.cpp ]
-     [ run sfinae.cpp ]
-     [ run macros.cpp ]
-     [ run unnamed.cpp ]
-     [ run earwicker.cpp ]
-     [ run tutorial.cpp ]
-     [ run singular.cpp ]
-     [ run mpl.cpp ]
-     [ run preprocessor.cpp ]
-     [ run efficiency.cpp : : : : : release ]
-     [ run maybe.cpp ]
-     [ compile ntp.cpp ]
-     [ compile unwrap_cv_reference.cpp ]
-     [ compile-fail duplicates.cpp ]
-     [ compile-fail unnamed_fail.cpp ]
-     [ compile compose.cpp ]
-  ;
-
-import python ;
-
-extension python_parameter 
-  : python.cpp
-    <template>@boost/libs/python/build/extension
-  ;
-
-boost-python-runtest python-parameter-test
-  : python.py
-    <pyd>python_parameter
-  ;
-

Modified: boost/trunk/libs/parameter/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/parameter/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,11 @@
+# Copyright David Abrahams, Daniel Wallin 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)
+
 # Boost Parameter Library test Jamfile
 
+import python ;
+
 project boost/parameter
   : default-build <warnings>off
   ;
@@ -8,18 +14,23 @@
   :  [ run basics.cpp ]
      [ run sfinae.cpp ]
      [ run macros.cpp ]
-     [ run unnamed.cpp ]
      [ run earwicker.cpp ]
      [ run tutorial.cpp ]
      [ run singular.cpp ]
      [ run mpl.cpp ]
      [ run preprocessor.cpp ]
+     [ run preprocessor_deduced.cpp ]
      [ run efficiency.cpp : : : : : <variant>release ]
      [ run maybe.cpp ]
+     [ run deduced.cpp ]
+     [ run optional_deduced_sfinae.cpp ]
+     [ run deduced_dependent_predicate.cpp ]
+     [ run normalized_argument_types.cpp ]
      [ compile ntp.cpp ]
      [ compile unwrap_cv_reference.cpp ]
      [ compile-fail duplicates.cpp ]
-     [ compile-fail unnamed_fail.cpp ]
+     [ compile-fail deduced_unmatched_arg.cpp ]
      [ compile compose.cpp ]
+     [ bpl-test python_test ]
   ;
 

Modified: boost/trunk/libs/parameter/test/basics.cpp
===================================================================
--- boost/trunk/libs/parameter/test/basics.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/test/basics.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,7 +11,6 @@
 
 #include "basics.hpp"
 
-
 namespace test
 {
   // A separate function for getting the "value" key, so we can deduce

Copied: boost/trunk/libs/parameter/test/deduced.cpp (from rev 14034, boost/branches/upstream/current/libs/parameter/test/deduced.cpp)

Copied: boost/trunk/libs/parameter/test/deduced.hpp (from rev 14034, boost/branches/upstream/current/libs/parameter/test/deduced.hpp)

Copied: boost/trunk/libs/parameter/test/deduced_dependent_predicate.cpp (from rev 14034, boost/branches/upstream/current/libs/parameter/test/deduced_dependent_predicate.cpp)

Copied: boost/trunk/libs/parameter/test/deduced_unmatched_arg.cpp (from rev 14034, boost/branches/upstream/current/libs/parameter/test/deduced_unmatched_arg.cpp)

Modified: boost/trunk/libs/parameter/test/maybe.cpp
===================================================================
--- boost/trunk/libs/parameter/test/maybe.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/test/maybe.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -30,5 +30,6 @@
     assert(f(unused = 0) == 1);
     assert(f((kw = maybe<int>(), unused = 0)) == 1);
     assert(f((kw = maybe<int>(2), unused = 0)) == 2);
+    return 0;
 }
 

Modified: boost/trunk/libs/parameter/test/mpl.cpp
===================================================================
--- boost/trunk/libs/parameter/test/mpl.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/test/mpl.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,9 +9,7 @@
 #include <boost/mpl/size.hpp>
 #include <boost/type_traits/add_pointer.hpp>
 
-# include <boost/type_traits/is_same.hpp>
-# include <boost/mpl/find.hpp>
-# include <boost/mpl/end.hpp>
+# include <boost/mpl/contains.hpp>
 
 namespace test
 {
@@ -23,13 +21,7 @@
       template <class T>
       void operator()(T*)
       {
-#if 1 // mpl::set is too unreliable in this release.
-          typedef typename mpl::find<Set,T>::type pos;
-          typedef typename mpl::end<Set>::type not_found;
-          BOOST_MPL_ASSERT_NOT((boost::is_same<pos, not_found>));
-#else 
-          BOOST_MPL_ASSERT((mpl::has_key<Set,T>));
-#endif 
+          BOOST_MPL_ASSERT((mpl::contains<Set,T>));
       }
   };
 
@@ -42,7 +34,7 @@
         , ==
         , mpl::size<Params>::value
       );
-      
+
       mpl::for_each<Params, boost::add_pointer<mpl::_1> >(assert_in_set<Expected>());
   }
 

Copied: boost/trunk/libs/parameter/test/normalized_argument_types.cpp (from rev 14034, boost/branches/upstream/current/libs/parameter/test/normalized_argument_types.cpp)

Modified: boost/trunk/libs/parameter/test/ntp.cpp
===================================================================
--- boost/trunk/libs/parameter/test/ntp.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/test/ntp.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -43,8 +43,9 @@
 {
     typedef typename parameter::parameters<
         a0_is<>, a1_is<>, a2_is<>
-      , parameter::unnamed<
-            a3_is<>, boost::is_base_and_derived<X, mpl::_>
+      , parameter::optional<
+            parameter::deduced<a3_is<> >
+          , boost::is_base_and_derived<X, mpl::_>
         >
     >::bind<A0,A1,A2,A3
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
@@ -100,10 +101,10 @@
 >));
 
 BOOST_MPL_ASSERT((boost::is_same<
-    with_ntp<Y>::type, void(*)(void*,void*,void*, Y)
+    with_ntp<a0_is<int>, Y>::type, void(*)(int,void*,void*, Y)
 >));
 
 BOOST_MPL_ASSERT((boost::is_same<
-    with_ntp<int&, Y, a2_is<char> >::type, void(*)(int&,void*,char, Y)
+    with_ntp<int&, a2_is<char>, Y>::type, void(*)(int&,void*,char, Y)
 >));
 

Copied: boost/trunk/libs/parameter/test/optional_deduced_sfinae.cpp (from rev 14034, boost/branches/upstream/current/libs/parameter/test/optional_deduced_sfinae.cpp)

Modified: boost/trunk/libs/parameter/test/preprocessor.cpp
===================================================================
--- boost/trunk/libs/parameter/test/preprocessor.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/test/preprocessor.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -77,7 +77,10 @@
     )
 )
 {
-    BOOST_MPL_ASSERT((boost::is_same<index_type, int const>));
+# if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) \
+  && !BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
+    BOOST_MPL_ASSERT((boost::is_same<index_type, int>));
+# endif
 
     tester(
         name
@@ -99,7 +102,10 @@
     )
 )
 {
-    BOOST_MPL_ASSERT((boost::is_same<index_type, int const>));
+# if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) \
+  && !BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
+    BOOST_MPL_ASSERT((boost::is_same<index_type, int>));
+# endif
 
     tester(
         name
@@ -205,6 +211,22 @@
         tester(name, value, index);
         return 1;
     }
+
+
+    BOOST_PARAMETER_MEMBER_FUNCTION((int), static f_static, tag,
+        (required
+          (tester, *)
+          (name, *)
+        )
+        (optional
+          (value, *, 1.f)
+          (index, *, 2)
+        )
+    )
+    {
+        tester(name, value, index);
+        return 1;
+    }
 };
 
 BOOST_PARAMETER_FUNCTION(
@@ -232,14 +254,91 @@
 }
 #endif
 
+#if BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x580))
+
+// Sun has problems with this syntax:
+//
+//   template1< r* ( template2<x> ) >
+//
+// Workaround: factor template2<x> into a separate typedef
+typedef boost::is_convertible<boost::mpl::_, std::string> predicate;
+
+BOOST_PARAMETER_FUNCTION(
+    (int), sfinae1, tag,
+    (required
+       (name, *(predicate))
+    )
+)
+{
+    return 1;
 }
 
+#else
+
+BOOST_PARAMETER_FUNCTION(
+    (int), sfinae1, tag,
+    (required
+       (name, *(boost::is_convertible<boost::mpl::_, std::string>))
+    )
+)
+{
+    return 1;
+}
+#endif 
+
+#ifndef BOOST_NO_SFINAE
+// On compilers that actually support SFINAE, add another overload
+// that is an equally good match and can only be in the overload set
+// when the others are not.  This tests that the SFINAE is actually
+// working.  On all other compilers we're just checking that
+// everything about SFINAE-enabled code will work, except of course
+// the SFINAE.
+template<class A0>
+typename boost::enable_if<boost::is_same<int,A0>, int>::type
+sfinae1(A0 const& a0)
+{
+    return 0;
+}
+#endif
+
+template <class T>
+T const& as_lvalue(T const& x)
+{
+    return x;
+}
+
+struct udt
+{
+    udt(int foo, int bar)
+      : foo(foo)
+      , bar(bar)
+    {}
+
+    int foo;
+    int bar;
+};
+
+BOOST_PARAMETER_FUNCTION((int), lazy_defaults, tag,
+    (required
+      (name, *)
+    )
+    (optional
+      (value, *, name.foo)
+      (index, *, name.bar)
+    )
+)
+{
+    return 0;
+}
+
+} // namespace test
+
 int main()
 {
     using namespace test;
 
     f(
-        tester = values(S("foo"), 1.f, 2)
+        values(S("foo"), 1.f, 2)
       , S("foo")
     );
 
@@ -249,41 +348,56 @@
     );
 
     int index_lvalue = 2;
-    
+
     f(
         tester = values(S("foo"), 1.f, 2)
       , name = S("foo")
+      , value = 1.f
+      , test::index = index_lvalue
+    );
+
+    f(
+        values(S("foo"), 1.f, 2)
+      , S("foo")
       , 1.f
       , index_lvalue
     );
 
     g(
-        tester = values(S("foo"), 1.f, 2)
-      , name = S("foo")
+        values(S("foo"), 1.f, 2)
+      , S("foo")
       , 1.f
+#if BOOST_WORKAROUND(BOOST_MSVC, == 1300)
+      , as_lvalue(2)
+#else
       , 2
+#endif
     );
 
     h(
-        tester = values(S("foo"), 1.f, 2)
-      , name = S("foo")
+        values(S("foo"), 1.f, 2)
+      , S("foo")
       , 1.f
+#if BOOST_WORKAROUND(BOOST_MSVC, == 1300)
+      , as_lvalue(2)
+#else
       , 2
+#endif
     );
 
     h2(
         tester = values(S("foo"), 1.f, 2)
       , name = S("foo")
-      , 1.f
+      , value = 1.f
     );
-    
+
     class_ x(
-        tester = values(S("foo"), 1.f, 2)
+        values(S("foo"), 1.f, 2)
       , S("foo"), test::index = 2
     );
 
     x.f(
-        tester = values(S("foo"), 1.f, 2)
+        values(S("foo"), 1.f, 2)
       , S("foo")
     );
 
@@ -293,7 +407,7 @@
     );
 
     x.f2(
-        tester = values(S("foo"), 1.f, 2)
+        values(S("foo"), 1.f, 2)
       , S("foo")
     );
 
@@ -305,7 +419,7 @@
     class_ const& x_const = x;
 
     x_const.f(
-        tester = values(S("foo"), 1.f, 2)
+        values(S("foo"), 1.f, 2)
       , S("foo")
     );
 
@@ -315,7 +429,7 @@
     );
 
     x_const.f2(
-        tester = values(S("foo"), 1.f, 2)
+        values(S("foo"), 1.f, 2)
       , S("foo")
     );
 
@@ -329,10 +443,40 @@
       , name = S("foo")
     );
 
+    class_::f_static(
+        values(S("foo"), 1.f, 2)
+      , S("foo")
+    );
+
+    class_::f_static(
+        tester = values(S("foo"), 1.f, 2)
+      , name = S("foo")
+    );
+
 #ifndef BOOST_NO_SFINAE
     assert(sfinae("foo") == 1);
     assert(sfinae(1) == 0);
+
+# if !BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x580))
+    // Sun actually eliminates the desired overload for some reason.
+    // Disabling this part of the test because SFINAE abilities are
+    // not the point of this test.
+    assert(sfinae1("foo") == 1);
+# endif
+    
+    assert(sfinae1(1) == 0);
 #endif
+
+    lazy_defaults(
+        name = udt(0,1)
+    );
+
+    lazy_defaults(
+        name = 0
+      , value = 1
+      , test::index = 2
+    );
+
     return 0;
 }
 

Copied: boost/trunk/libs/parameter/test/preprocessor_deduced.cpp (from rev 14034, boost/branches/upstream/current/libs/parameter/test/preprocessor_deduced.cpp)

Deleted: boost/trunk/libs/parameter/test/python.cpp
===================================================================
--- boost/trunk/libs/parameter/test/python.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/test/python.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,120 +0,0 @@
-// Copyright Daniel Wallin 2006. Use, modification and distribution is
-// subject to the Boost Software License, Version 1.0. (See accompanying
-// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include <boost/parameter/preprocessor.hpp>
-#include <boost/parameter/keyword.hpp>
-#include <boost/parameter/python.hpp>
-#include <boost/python.hpp>
-#include <boost/utility/enable_if.hpp>
-
-namespace test {
-
-BOOST_PARAMETER_KEYWORD(tag, x)
-BOOST_PARAMETER_KEYWORD(tag, y)
-BOOST_PARAMETER_KEYWORD(tag, z)
-
-struct Xbase
-{
-    // We need the disable_if part for VC7.1/8.0.
-    template <class Args>
-    Xbase(
-        Args const& args
-      , typename boost::disable_if<
-            boost::is_base_and_derived<Xbase, Args>
-        >::type* = 0
-    )
-      : value(std::string(args[x | "foo"]) + args[y | "bar"])
-    {}
-
-    std::string value;
-};
-
-struct X : Xbase
-{
-    BOOST_PARAMETER_CONSTRUCTOR(X, (Xbase), tag,
-        (optional
-         (x, *)
-         (y, *)
-        )
-    )
-
-    BOOST_PARAMETER_MEMBER_FUNCTION((int), f, tag,
-        (required
-         (x, *)
-         (y, *)
-        )
-        (optional
-         (z, *)
-        )
-    )
-    {
-        return args[x] + args[y] + args[z | 0];
-    }
-
-    BOOST_PARAMETER_MEMBER_FUNCTION((std::string), g, tag,
-        (optional
-         (x, *)
-         (y, *)
-        )
-    )
-    {
-        return std::string(args[x | "foo"]) + args[y | "bar"];
-    }
-};
-
-} // namespace test
-
-struct f_fwd
-{
-    template <class R, class T, class A0, class A1, class A2>
-    R operator()(boost::type<R>, T& self, A0 const& a0, A1 const& a1, A2 const& a2)
-    {
-        return self.f(a0,a1,a2);
-    }
-};
-
-struct g_fwd
-{
-    template <class R, class T, class A0, class A1>
-    R operator()(boost::type<R>, T& self, A0 const& a0, A1 const& a1)
-    {
-        return self.g(a0,a1);
-    }
-};
-
-BOOST_PYTHON_MODULE(python_parameter)
-{
-    namespace mpl = boost::mpl;
-    using namespace test;
-    using namespace boost::python;
-
-    class_<X>("X")
-        .def(
-            boost::parameter::python::init<
-                mpl::vector<
-                    tag::x*(std::string), tag::y*(std::string)
-                >
-            >()
-        )
-        .def(
-            "f"
-          , boost::parameter::python::function<
-                f_fwd
-              , mpl::vector<
-                    int, tag::x(int), tag::y(int), tag::z*(int)
-                >
-            >()
-        )
-        .def(
-            "g"
-          , boost::parameter::python::function<
-                g_fwd
-              , mpl::vector<
-                    std::string, tag::x*(std::string), tag::y*(std::string)
-                >
-            >()
-        )
-        .def_readonly("value", &X::value);
-}
-

Deleted: boost/trunk/libs/parameter/test/python.py
===================================================================
--- boost/trunk/libs/parameter/test/python.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/test/python.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,33 +0,0 @@
-'''
->>> from python_parameter import X
->>> x = X(y = 'baz')
->>> x.value
-'foobaz'
->>> x.f(1,2)
-3
->>> x.f(1,2,3)
-6
->>> x.f(1,2, z = 3)
-6
->>> x.f(z = 3, y = 2, x = 1)
-6
->>> x.g()
-'foobar'
->>> x.g(y = "baz")
-'foobaz'
->>> x.g(x = "baz")
-'bazbar'
->>> x.g(y = "foo", x = "bar")
-'barfoo'
-'''
-
-def run(args = None):
-    if args is not None:
-        import sys
-        sys.argv = args
-    import doctest, python 
-    return doctest.testmod(python)
-
-if __name__ == '__main__':
-    import sys
-    sys.exit(run()[0])

Copied: boost/trunk/libs/parameter/test/python_test.cpp (from rev 14034, boost/branches/upstream/current/libs/parameter/test/python_test.cpp)

Copied: boost/trunk/libs/parameter/test/python_test.py (from rev 14034, boost/branches/upstream/current/libs/parameter/test/python_test.py)

Deleted: boost/trunk/libs/parameter/test/unnamed.cpp
===================================================================
--- boost/trunk/libs/parameter/test/unnamed.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/test/unnamed.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,75 +0,0 @@
-// Copyright David Abrahams, Daniel Wallin 2003. Use, modification and 
-// distribution is subject to the Boost Software License, Version 1.0. 
-// (See accompanying file LICENSE_1_0.txt or copy at 
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#include <boost/parameter.hpp>
-#include <boost/parameter/match.hpp>
-#include <cassert>
-#include <boost/bind.hpp>
-#include <boost/ref.hpp>
-#include <boost/static_assert.hpp>
-#include <boost/type_traits/is_convertible.hpp>
-#include <string>
-
-namespace test
-{
-  using namespace boost::parameter;
-  namespace mpl = boost::mpl;
-
-  BOOST_PARAMETER_KEYWORD(tag, name)
-  BOOST_PARAMETER_KEYWORD(tag, value)
-
-  struct g_parameters
-    : parameters<
-          unnamed<tag::name, boost::is_convertible<mpl::_, std::string> >
-        , unnamed<tag::value, boost::is_convertible<mpl::_, float> >
-      >
-  {};
-
-
-  // Keeping this out here avoids an ICE with vc-6.x
-  std::string const foo("foo");
-  
-  template<class Params>
-  int g_(Params const& p)
-  {
-      assert(p[name] == foo);
-      assert(p[value] == 3.14f);
-      return 1;
-  }
-  
-  template<class A0>
-  int g(A0 const& a0, BOOST_PARAMETER_MATCH(g_parameters, (A0), args))
-  {
-      return g_(args(a0));
-  }
-  
-  template<class A0, class A1>
-  int g(A0 const& a0, A1 const& a1, BOOST_PARAMETER_MATCH(g_parameters, (A0)(A1), args))
-  {
-      return g_(args(a0, a1));
-  }
-
-}
-
-#include <typeinfo>
-#include <iostream>
-
-int main()
-{
-   using test::g;
-   using test::name;
-   using test::value;
-
-   g("foo", 3.14f);
-   g(3.14f, "foo");
-
-   g(value = 3.14f, "foo");
-   g(name = "foo", 3.14f);
-   g(3.14f, name = "foo");
-   g(name = "foo", value = 3.14f);
-   
-   return 0;
-}
-

Deleted: boost/trunk/libs/parameter/test/unnamed_fail.cpp
===================================================================
--- boost/trunk/libs/parameter/test/unnamed_fail.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/parameter/test/unnamed_fail.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,67 +0,0 @@
-// Copyright David Abrahams, Daniel Wallin 2003. Use, modification and 
-// distribution is subject to the Boost Software License, Version 1.0. 
-// (See accompanying file LICENSE_1_0.txt or copy at 
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#include <boost/parameter.hpp>
-#include <boost/parameter/match.hpp>
-#include <cassert>
-#include <boost/bind.hpp>
-#include <boost/ref.hpp>
-#include <boost/static_assert.hpp>
-#include <boost/type_traits/is_convertible.hpp>
-#include <string>
-
-namespace test
-{
-  using namespace boost::parameter;
-  namespace mpl = boost::mpl;
-
-  BOOST_PARAMETER_KEYWORD(tag, name)
-  BOOST_PARAMETER_KEYWORD(tag, value)
-
-  struct g_parameters
-    : parameters<
-          unnamed<tag::name, boost::is_convertible<mpl::_, std::string> >
-        , unnamed<tag::value, boost::is_convertible<mpl::_, float> >
-      >
-  {};
-
-
-  // Keeping this out here avoids an ICE with vc-6.x
-  std::string const foo("foo");
-  
-  template<class Params>
-  int g_(Params const& p)
-  {
-      return 1;
-  }
-  
-  template<class A0>
-  int g(A0 const& a0, BOOST_PARAMETER_MATCH(g_parameters, (A0), args))
-  {
-      return g_(args(a0));
-  }
-  
-  template<class A0, class A1>
-  int g(A0 const& a0, A1 const& a1, BOOST_PARAMETER_MATCH(g_parameters, (A0)(A1), args))
-  {
-      return g_(args(a0, a1));
-  }
-
-}
-
-#include <typeinfo>
-#include <iostream>
-
-int main()
-{
-   using test::g;
-   using test::name;
-   using test::value;
-
-   g("foo", "bar");
-
-   return 0;
-}
-

Modified: boost/trunk/libs/pool/TODO.txt
===================================================================
--- boost/trunk/libs/pool/TODO.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/TODO.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+Copyright (C) 2000 Stephen Cleary
+
+Distributed under the Boost Software License, Version 1.0. (See accompany-
+ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 Here's a list of things TODO on the Pool library; these things will be done on an "as-I-get-around-to-it" basis:
   . Evaluate changes necessary for MSVC 6sp4 (Could use some help from people who own MSVC...)
   . Create more exhaustive test/example files, possibly other timing tests; convert to the new Boost testing harness

Modified: boost/trunk/libs/pool/doc/concepts.html
===================================================================
--- boost/trunk/libs/pool/doc/concepts.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/concepts.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,176 +1,407 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>Pool Concepts</TITLE>
-<LINK HREF="pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>Pool Concepts</H1>
+  <title>Pool Concepts</title>
+</head>
 
-<P>
-<BLOCKQUOTE>
-&quot;Dynamic memory allocation has been a fundamental part of most computer systems since roughly 1960...&quot;<SUP><A HREF="#ref1">1</A></SUP>
-</BLOCKQUOTE>
+<body>
+  <img src="../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<p>
-Everyone uses dynamic memory allocation.  If you have ever called <SPAN CLASS="code">malloc</SPAN> or <SPAN CLASS="code">new</SPAN>, then you have used dynamic memory allocation.  Most programmers have a tendency to treat the heap as a &quot;magic bag&quot;: we ask it for memory, and it magically creates some for us.  Sometimes we run into problems because the heap is <EM>not</EM> magic.
+  <h1 align="center">Pool Concepts</h1>
 
-<p>
-The heap is limited.  Even on large systems (i.e., not embedded) with huge amounts of virtual memory available, there is a limit.  Everyone is aware of the physical limit, but there is a more subtle, &quot;virtual&quot; limit, that limit at which your program (or the entire system) slows down due to the use of virtual memory.  This virtual limit is much closer to your program than the physical limit, especially if you are running on a multitasking system.  Therefore, when running on a large system, it is considered &quot;nice&quot; to make your program use as few resources as necessary, and release them as soon as possible.  When using an embedded system, programmers usually have no memory to waste.
+  <blockquote>
+    "Dynamic memory allocation has been a fundamental part of most computer
+    systems since roughly 1960..."<sup><a href="#ref1">1</a></sup>
+  </blockquote>
 
-<P>
-The heap is complicated.  It has to satisfy any type of memory request, for any size, and do it <EM>fast</EM>.  The common approaches to memory management have to do with splitting the memory up into portions, and keeping them ordered by size in some sort of a tree or list structure.  Add in other factors, such as locality and estimating lifetime, and heaps quickly become very complicated.  So complicated, in fact, that there is no known &quot;perfect&quot; answer to the problem of how to do dynamic memory allocation.  The diagrams below illustrate how most common memory managers work: for each chunk of memory, it uses part of that memory to maintain its internal tree or list structure.  Even when a chunk is <SPAN CLASS="code">malloc</SPAN>'ed out to a program, the memory manager must &quot;save&quot; some information in it &mdash; usually just its size.  Then, when the block is <SPAN CLASS="code">free</SPAN>'d, the memory manager can easily tell how large it is.
+  <p>Everyone uses dynamic memory allocation. If you have ever called
+  <span class="code">malloc</span> or <span class="code">new</span>, then you
+  have used dynamic memory allocation. Most programmers have a tendency to
+  treat the heap as a "magic bag": we ask it for memory, and it magically
+  creates some for us. Sometimes we run into problems because the heap is
+  <em>not</em> magic.</p>
 
-<TABLE CELLSPACING="0" BORDER="3" RULES="none" STYLE="float: left; clear: both;">
-<CAPTION><EM>Memory block, not allocated</EM></CAPTION>
-<TR><TD STYLE="background-color: red; text-align: center;">Memory not belonging to process</TD></TR>
-<TR><TD STYLE="padding: 1em 0em; background-color: silver; text-align: center;">Memory used internally by memory allocator algorithm (usually 8-12 bytes)</TD></TR>
-<TR><TD STYLE="padding: 2em 0em; background-color: gray; text-align: center">Unused memory</TD></TR>
-<TR><TD STYLE="background-color: red; text-align: center;">Memory not belonging to process</TD></TR>
-</TABLE>
+  <p>The heap is limited. Even on large systems (i.e., not embedded) with
+  huge amounts of virtual memory available, there is a limit. Everyone is
+  aware of the physical limit, but there is a more subtle, "virtual" limit,
+  that limit at which your program (or the entire system) slows down due to
+  the use of virtual memory. This virtual limit is much closer to your
+  program than the physical limit, especially if you are running on a
+  multitasking system. Therefore, when running on a large system, it is
+  considered "nice" to make your program use as few resources as necessary,
+  and release them as soon as possible. When using an embedded system,
+  programmers usually have no memory to waste.</p>
 
-<TABLE CELLSPACING="0" BORDER="3" RULES="none" STYLE="float: right; clear: both;">
-<CAPTION><EM>Memory block, allocated (used by program)</EM></CAPTION>
-<TR><TD STYLE="background-color: red; text-align: center;">Memory not belonging to process</TD></TR>
-<TR><TD STYLE="background-color: silver; text-align: center;">Memory used internally by memory allocator algorithm (usually 4 bytes)</TD></TR>
-<TR><TD STYLE="padding: 3em 0em; background-color: yellow; text-align: center">Memory usable by program</TD></TR>
-<TR><TD STYLE="background-color: red; text-align: center;">Memory not belonging to process</TD></TR>
-</TABLE>
+  <p>The heap is complicated. It has to satisfy any type of memory request,
+  for any size, and do it <em>fast</em>. The common approaches to memory
+  management have to do with splitting the memory up into portions, and
+  keeping them ordered by size in some sort of a tree or list structure. Add
+  in other factors, such as locality and estimating lifetime, and heaps
+  quickly become very complicated. So complicated, in fact, that there is no
+  known "perfect" answer to the problem of how to do dynamic memory
+  allocation. The diagrams below illustrate how most common memory managers
+  work: for each chunk of memory, it uses part of that memory to maintain its
+  internal tree or list structure. Even when a chunk is <span class=
+  "code">malloc</span>'ed out to a program, the memory manager must "save"
+  some information in it &mdash; usually just its size. Then, when the block
+  is <span class="code">free</span>'d, the memory manager can easily tell how
+  large it is.</p>
 
-<P>
-Because of the complication of dynamic memory allocation, it is often inefficient in terms of time and/or space.  Most memory allocation algorithms store some form of information with each memory block, either the block size or some relational information, such as its position in the internal tree or list structure.  It is common for such &quot;header fields&quot; to take up one machine word in a block that is being used by the program.  The obvious problem, then, is when small objects are dynamically allocated.  For example, if <SPAN CLASS="code">int</SPAN>s were dynamically allocated, then automatically the algorithm will reserve space for the header fields as well, and we end up with a 50% waste of memory.  Of course, this is a worst-case scenario.  However, more modern programs are making use of small objects on the heap; and that is making this problem more and more apparent.  Wilson <EM>et. al.</EM> state that an average-case memory overhead is about ten to twenty percent<SUP><A HREF="#ref2">2</A></SUP>.  This memory overhead will grow higher as more programs use more smaller objects.  It is this memory overhead that brings programs closer to the virtual limit.
+  <table cellspacing="0" border="3" rules="none" style=
+  "float: left; clear: both;" summary="">
+    <caption>
+      <em>Memory block, not allocated</em>
+    </caption>
 
-<P>
-In larger systems, the memory overhead is not as big of a problem (compared to the amount of time it would take to work around it), and thus is often ignored.  However, there are situations where many allocations and/or deallocations of smaller objects are taking place as part of a time-critical algorithm, and in these situations, the system-supplied memory allocator is often too slow.
+    <tr>
+      <td style="background-color: red; text-align: center;">Memory not
+      belonging to process</td>
+    </tr>
 
-<P>
-Simple segregated storage addresses both of these issues.  Almost all memory overhead is done away with, and all allocations can take place in a small amount of (amortized) constant time.  However, this is done at the loss of generality; simple segregated storage only can allocate memory chunks of a single size.
+    <tr>
+      <td style=
+      "padding: 1em 0em; background-color: silver; text-align: center;">
+      Memory used internally by memory allocator algorithm (usually 8-12
+      bytes)</td>
+    </tr>
 
-<P>
-<HR>
+    <tr>
+      <td style=
+      "padding: 2em 0em; background-color: gray; text-align: center">Unused
+      memory</td>
+    </tr>
 
-<P>
-<H1 ALIGN=CENTER>Simple Segregated Storage</H1>
+    <tr>
+      <td style="background-color: red; text-align: center;">Memory not
+      belonging to process</td>
+    </tr>
+  </table>
 
-<P>
-Simple Segregated Storage is the basic idea behind the Boost Pool library.  Simple Segregated Storage is the simplest, and probably the fastest, memory allocation/deallocation algorithm.  It begins by <EM>partitioning</EM> a memory <EM>block</EM> into fixed-size <EM>chunks</EM>.  Where the block comes from is not important until implementation time.  A <EM>Pool</EM> is some object that uses Simple Segregated Storage in this fashion.  To illustrate:
+  <table cellspacing="0" border="3" rules="none" style=
+  "float: right; clear: both;" summary="">
+    <caption>
+      <em>Memory block, allocated (used by program)</em>
+    </caption>
 
-<TABLE CELLSPACING="0" BORDER="3" RULES="none" ALIGN=CENTER STYLE="clear: both;">
-<CAPTION><EM>Memory block, split into chunks</EM></CAPTION>
-<TR><TD STYLE="background-color: red; text-align: center;">Memory not belonging to process</TD></TR>
-<TR><TD STYLE="padding: 1em 0em; background-color: gray; text-align: center;">Chunk 0</TD></TR>
-<TR><TD STYLE="padding: 1em 0em; background-color: gray; text-align: center;">Chunk 1</TD></TR>
-<TR><TD STYLE="padding: 1em 0em; background-color: gray; text-align: center;">Chunk 2</TD></TR>
-<TR><TD STYLE="padding: 1em 0em; background-color: gray; text-align: center;">Chunk 3</TD></TR>
-<TR><TD STYLE="background-color: red; text-align: center;">Memory not belonging to process</TD></TR>
-</TABLE>
+    <tr>
+      <td style="background-color: red; text-align: center;">Memory not
+      belonging to process</td>
+    </tr>
 
-<P>
-Each of the chunks in any given block are <STRONG>always</STRONG> the same size.  This is the fundamental restriction of Simple Segregated Storage: you cannot ask for chunks of different sizes.  For example, you cannot ask a Pool of integers for a character, or a Pool of characters for an integer (assuming that characters and integers are different sizes).
+    <tr>
+      <td style="background-color: silver; text-align: center;">Memory used
+      internally by memory allocator algorithm (usually 4 bytes)</td>
+    </tr>
 
-<P>
-Simple Segregated Storage works by interleaving a <EM>free list</EM> within the unused chunks.  For example:
+    <tr>
+      <td style=
+      "padding: 3em 0em; background-color: yellow; text-align: center">Memory
+      usable by program</td>
+    </tr>
 
-<TABLE CELLSPACING="0" BORDER="3" RULES="none" STYLE="float: left; clear: both;">
-<CAPTION><EM>Memory block, with no chunks allocated</EM></CAPTION>
-<TR><TD STYLE="background-color: red; text-align: center;">Memory not belonging to process</TD></TR>
-<TR><TD STYLE="padding: 1em 0em; background-color: gray; text-align: center;">Chunk 0; points to Chunk 1</TD></TR>
-<TR><TD STYLE="padding: 1em 0em; background-color: gray; text-align: center;">Chunk 1; points to Chunk 2</TD></TR>
-<TR><TD STYLE="padding: 1em 0em; background-color: gray; text-align: center;">Chunk 2; points to Chunk 3</TD></TR>
-<TR><TD STYLE="padding: 1em 0em; background-color: gray; text-align: center;">Chunk 3; end-of-list</TD></TR>
-<TR><TD STYLE="background-color: red; text-align: center;">Memory not belonging to process</TD></TR>
-</TABLE>
+    <tr>
+      <td style="background-color: red; text-align: center;">Memory not
+      belonging to process</td>
+    </tr>
+  </table>
 
-<TABLE CELLSPACING="0" BORDER="3" RULES="none" STYLE="float: right; clear: both;">
-<CAPTION><EM>Memory block, with two chunks allocated</EM></CAPTION>
-<TR><TD STYLE="background-color: red; text-align: center;">Memory not belonging to process</TD></TR>
-<TR><TD STYLE="padding: 1em 0em; background-color: gray; text-align: center;">Chunk 0; points to Chunk 2</TD></TR>
-<TR><TD STYLE="padding: 1em 0em; background-color: silver; text-align: center;">Chunk 1 (in use by process)</TD></TR>
-<TR><TD STYLE="padding: 1em 0em; background-color: gray; text-align: center;">Chunk 2; end-of-list</TD></TR>
-<TR><TD STYLE="padding: 1em 0em; background-color: silver; text-align: center;">Chunk 3 (in use by process)</TD></TR>
-<TR><TD STYLE="background-color: red; text-align: center;">Memory not belonging to process</TD></TR>
-</TABLE>
+  <p>Because of the complication of dynamic memory allocation, it is often
+  inefficient in terms of time and/or space. Most memory allocation
+  algorithms store some form of information with each memory block, either
+  the block size or some relational information, such as its position in the
+  internal tree or list structure. It is common for such "header fields" to
+  take up one machine word in a block that is being used by the program. The
+  obvious problem, then, is when small objects are dynamically allocated. For
+  example, if <span class="code">int</span>s were dynamically allocated, then
+  automatically the algorithm will reserve space for the header fields as
+  well, and we end up with a 50% waste of memory. Of course, this is a
+  worst-case scenario. However, more modern programs are making use of small
+  objects on the heap; and that is making this problem more and more
+  apparent. Wilson <em>et. al.</em> state that an average-case memory
+  overhead is about ten to twenty percent<sup><a href="#ref2">2</a></sup>.
+  This memory overhead will grow higher as more programs use more smaller
+  objects. It is this memory overhead that brings programs closer to the
+  virtual limit.</p>
 
-<P>
-By interleaving the free list inside the chunks, each Simple Segregated Storage only has the overhead of a single pointer (the pointer to the first element in the list).  It has <EM>no</EM> memory overhead for chunks that are in use by the process.
+  <p>In larger systems, the memory overhead is not as big of a problem
+  (compared to the amount of time it would take to work around it), and thus
+  is often ignored. However, there are situations where many allocations
+  and/or deallocations of smaller objects are taking place as part of a
+  time-critical algorithm, and in these situations, the system-supplied
+  memory allocator is often too slow.</p>
 
-<P>
-Simple Segregated Storage is also extremely fast.  In the simplest case, memory allocation is merely removing the first chunk from the free list, a O(1) operation.  In the case where the free list is empty, another block may have to be acquired and partitioned, which would result in an amortized O(1) time.  Memory deallocation may be as simple as adding that chunk to the front of the free list, a O(1) operation.  However, more complicated uses of Simple Segregated Storage may require a sorted free list, which makes deallocation O(N).
+  <p>Simple segregated storage addresses both of these issues. Almost all
+  memory overhead is done away with, and all allocations can take place in a
+  small amount of (amortized) constant time. However, this is done at the
+  loss of generality; simple segregated storage only can allocate memory
+  chunks of a single size.</p>
+  <hr>
 
-<P>
-Simple Segregated Storage gives faster execution and less memory overhead than a system-supplied allocator, but at the loss of generality.  A good place to use a Pool is in situations where many (noncontiguous) small objects may be allocated on the heap, or if allocation and deallocation of the same-sized objects happens repeatedly.
+  <h1 align="center">Simple Segregated Storage</h1>
 
-<P>
-<HR>
+  <p>Simple Segregated Storage is the basic idea behind the Boost Pool
+  library. Simple Segregated Storage is the simplest, and probably the
+  fastest, memory allocation/deallocation algorithm. It begins by
+  <em>partitioning</em> a memory <em>block</em> into fixed-size
+  <em>chunks</em>. Where the block comes from is not important until
+  implementation time. A <em>Pool</em> is some object that uses Simple
+  Segregated Storage in this fashion. To illustrate:</p>
 
-<P>
-<H2>References</H2>
+  <table cellspacing="0" border="3" rules="none" align="center" style=
+  "clear: both;" summary="">
+    <caption>
+      <em>Memory block, split into chunks</em>
+    </caption>
 
-<P>
-<OL>
-<LI><A NAME="ref1">Doug Lea, <EM>A Memory Allocator</EM>.</A>  Available on the web at <A HREF="http://gee.cs.oswego.edu/dl/html/malloc.html">http://gee.cs.oswego.edu/dl/html/malloc.html</A></LI>
-<LI><A NAME="ref2">Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles, &quot;Dynamic Storage Allocation: A Survey and Critical Review&quot; in <EM>International Workshop on Memory Management</EM>, September 1995, pg. 28, 36.</A>  Available on the web at <A HREF="ftp://ftp.cs.utexas.edu/pub/garbage/allocsrv.ps">ftp://ftp.cs.utexas.edu/pub/garbage/allocsrv.ps</A></LI>
-</OL>
+    <tr>
+      <td style="background-color: red; text-align: center;">Memory not
+      belonging to process</td>
+    </tr>
 
-<P>
-<H2>Other Implementations</H2>
+    <tr>
+      <td style=
+      "padding: 1em 0em; background-color: gray; text-align: center;">Chunk
+      0</td>
+    </tr>
 
-<P>
-Pool allocators are found in many programming languages, and in many variations.  The beginnings of many implementations may be found in common programming literature; some of these are given below.  Note that none of these are complete implementations of a Pool; most of these leave some aspects of a Pool as a user exercise.  However, in each case, even though some aspects are missing, these examples use the same underlying concept of a Simple Segregated Storage described in this document.
+    <tr>
+      <td style=
+      "padding: 1em 0em; background-color: gray; text-align: center;">Chunk
+      1</td>
+    </tr>
 
-<P>
-<UL>
+    <tr>
+      <td style=
+      "padding: 1em 0em; background-color: gray; text-align: center;">Chunk
+      2</td>
+    </tr>
 
-<LI>
-&quot;The C++ Programming Language&quot;, 3rd ed., by Bjarne Stroustrup, Section 19.4.2.  Missing aspects:
- <OL>
- <LI>Not portable</LI>
- <LI>Cannot handle allocations of arbitrary numbers of objects (this was left as an exercise)</LI>
- <LI>Not thread-safe</LI>
- <LI>Suffers from the static initialization problem</LI>
- </OL>
-</LI>
+    <tr>
+      <td style=
+      "padding: 1em 0em; background-color: gray; text-align: center;">Chunk
+      3</td>
+    </tr>
 
-<LI>
-&quot;MicroC/OS-II: The Real-Time Kernel&quot;, by Jean J. Labrosse, Chapter 7 and Appendix B.04.  This is an example of the Simple Segregated Storage scheme at work in the internals of an actual OS.  Missing aspects:
- <OL>
- <LI>Not portable (though this is OK, since it's part of its own OS)</LI>
- <LI>Cannot handle allocations of arbitrary numbers of blocks (which is also OK, since this feature is not needed)</LI>
- <LI>Requires non-intuitive user code to create and destroy the Pool</LI>
- </OL>
-</LI>
+    <tr>
+      <td style="background-color: red; text-align: center;">Memory not
+      belonging to process</td>
+    </tr>
+  </table>
 
-<LI>
-&quot;Efficient C++: Performance Programming Techniques&quot;, by Dov Bulka and David Mayhew, Chapters 6 and 7.  This is a good example of iteratively developing a Pool solution; however, their premise (that the system-supplied allocation mechanism is hopelessly inefficient) is flawed on every system I've tested on.  Run their timings on your system before you accept their conclusions.  Missing aspects:
- <OL>
- <LI>Requires non-intuitive user code to create and destroy the Pool</LI>
- </OL>
-</LI>
+  <p>Each of the chunks in any given block are <strong>always</strong> the
+  same size. This is the fundamental restriction of Simple Segregated
+  Storage: you cannot ask for chunks of different sizes. For example, you
+  cannot ask a Pool of integers for a character, or a Pool of characters for
+  an integer (assuming that characters and integers are different sizes).</p>
 
-<LI>
-&quot;Advanced C++: Programming Styles and Idioms&quot;, by James O. Coplien, Section 3.6.  This has examples of both static and dynamic pooling.  Missing aspects:
- <OL>
- <LI>Not thread-safe</LI>
- <LI>The static pooling example is not portable</LI>
- </OL>
-</LI>
+  <p>Simple Segregated Storage works by interleaving a <em>free list</em>
+  within the unused chunks. For example:</p>
 
-</UL>
+  <table cellspacing="0" border="3" rules="none" style=
+  "float: left; clear: both;" summary="">
+    <caption>
+      <em>Memory block, with no chunks allocated</em>
+    </caption>
 
-<P>
-<HR>
+    <tr>
+      <td style="background-color: red; text-align: center;">Memory not
+      belonging to process</td>
+    </tr>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+    <tr>
+      <td style=
+      "padding: 1em 0em; background-color: gray; text-align: center;">Chunk
+      0; points to Chunk 1</td>
+    </tr>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="copyright.html">copyright.html</A>
+    <tr>
+      <td style=
+      "padding: 1em 0em; background-color: gray; text-align: center;">Chunk
+      1; points to Chunk 2</td>
+    </tr>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+    <tr>
+      <td style=
+      "padding: 1em 0em; background-color: gray; text-align: center;">Chunk
+      2; points to Chunk 3</td>
+    </tr>
 
-</BODY>
-</HTML>
+    <tr>
+      <td style=
+      "padding: 1em 0em; background-color: gray; text-align: center;">Chunk
+      3; end-of-list</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: red; text-align: center;">Memory not
+      belonging to process</td>
+    </tr>
+  </table>
+
+  <table cellspacing="0" border="3" rules="none" style=
+  "float: right; clear: both;" summary="">
+    <caption>
+      <em>Memory block, with two chunks allocated</em>
+    </caption>
+
+    <tr>
+      <td style="background-color: red; text-align: center;">Memory not
+      belonging to process</td>
+    </tr>
+
+    <tr>
+      <td style=
+      "padding: 1em 0em; background-color: gray; text-align: center;">Chunk
+      0; points to Chunk 2</td>
+    </tr>
+
+    <tr>
+      <td style=
+      "padding: 1em 0em; background-color: silver; text-align: center;">Chunk
+      1 (in use by process)</td>
+    </tr>
+
+    <tr>
+      <td style=
+      "padding: 1em 0em; background-color: gray; text-align: center;">Chunk
+      2; end-of-list</td>
+    </tr>
+
+    <tr>
+      <td style=
+      "padding: 1em 0em; background-color: silver; text-align: center;">Chunk
+      3 (in use by process)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: red; text-align: center;">Memory not
+      belonging to process</td>
+    </tr>
+  </table>
+
+  <p>By interleaving the free list inside the chunks, each Simple Segregated
+  Storage only has the overhead of a single pointer (the pointer to the first
+  element in the list). It has <em>no</em> memory overhead for chunks that
+  are in use by the process.</p>
+
+  <p>Simple Segregated Storage is also extremely fast. In the simplest case,
+  memory allocation is merely removing the first chunk from the free list, a
+  O(1) operation. In the case where the free list is empty, another block may
+  have to be acquired and partitioned, which would result in an amortized
+  O(1) time. Memory deallocation may be as simple as adding that chunk to the
+  front of the free list, a O(1) operation. However, more complicated uses of
+  Simple Segregated Storage may require a sorted free list, which makes
+  deallocation O(N).</p>
+
+  <p>Simple Segregated Storage gives faster execution and less memory
+  overhead than a system-supplied allocator, but at the loss of generality. A
+  good place to use a Pool is in situations where many (noncontiguous) small
+  objects may be allocated on the heap, or if allocation and deallocation of
+  the same-sized objects happens repeatedly.<br clear="all"></p>
+  <hr>
+
+  <h2>References</h2>
+
+  <ol>
+    <li><a name="ref1" id="ref1">Doug Lea, <em>A Memory Allocator</em>.</a>
+    Available on the web at <a href=
+    "http://gee.cs.oswego.edu/dl/html/malloc.html">http://gee.cs.oswego.edu/dl/html/malloc.html</a></li>
+
+    <li><a name="ref2" id="ref2">Paul R. Wilson, Mark S. Johnstone, Michael
+    Neely, and David Boles, "Dynamic Storage Allocation: A Survey and
+    Critical Review" in <em>International Workshop on Memory Management</em>,
+    September 1995, pg. 28, 36.</a> Available on the web at <a href=
+    "ftp://ftp.cs.utexas.edu/pub/garbage/allocsrv.ps">ftp://ftp.cs.utexas.edu/pub/garbage/allocsrv.ps</a></li>
+  </ol>
+
+  <h2>Other Implementations</h2>
+
+  <p>Pool allocators are found in many programming languages, and in many
+  variations. The beginnings of many implementations may be found in common
+  programming literature; some of these are given below. Note that none of
+  these are complete implementations of a Pool; most of these leave some
+  aspects of a Pool as a user exercise. However, in each case, even though
+  some aspects are missing, these examples use the same underlying concept of
+  a Simple Segregated Storage described in this document.</p>
+
+  <ul>
+    <li>"The C++ Programming Language", 3rd ed., by Bjarne Stroustrup,
+    Section 19.4.2. Missing aspects:
+
+      <ol>
+        <li>Not portable</li>
+
+        <li>Cannot handle allocations of arbitrary numbers of objects (this
+        was left as an exercise)</li>
+
+        <li>Not thread-safe</li>
+
+        <li>Suffers from the static initialization problem</li>
+      </ol>
+    </li>
+
+    <li>"MicroC/OS-II: The Real-Time Kernel", by Jean J. Labrosse, Chapter 7
+    and Appendix B.04. This is an example of the Simple Segregated Storage
+    scheme at work in the internals of an actual OS. Missing aspects:
+
+      <ol>
+        <li>Not portable (though this is OK, since it's part of its own
+        OS)</li>
+
+        <li>Cannot handle allocations of arbitrary numbers of blocks (which
+        is also OK, since this feature is not needed)</li>
+
+        <li>Requires non-intuitive user code to create and destroy the
+        Pool</li>
+      </ol>
+    </li>
+
+    <li>"Efficient C++: Performance Programming Techniques", by Dov Bulka and
+    David Mayhew, Chapters 6 and 7. This is a good example of iteratively
+    developing a Pool solution; however, their premise (that the
+    system-supplied allocation mechanism is hopelessly inefficient) is flawed
+    on every system I've tested on. Run their timings on your system before
+    you accept their conclusions. Missing aspects:
+
+      <ol>
+        <li>Requires non-intuitive user code to create and destroy the
+        Pool</li>
+      </ol>
+    </li>
+
+    <li>"Advanced C++: Programming Styles and Idioms", by James O. Coplien,
+    Section 3.6. This has examples of both static and dynamic pooling.
+    Missing aspects:
+
+      <ol>
+        <li>Not thread-safe</li>
+
+        <li>The static pooling example is not portable</li>
+      </ol>
+    </li>
+  </ul>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Deleted: boost/trunk/libs/pool/doc/copyright.html
===================================================================
--- boost/trunk/libs/pool/doc/copyright.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/copyright.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,25 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>Pool Copyright</TITLE>
-</HEAD>
-<BODY>
-
-<IMG SRC="../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
-
-<H1 ALIGN="CENTER">Pool Copyright</H1>
-
-<P>
-Copyright &copy; 2000 Stephen Cleary (scleary AT jerviswebb DOT com)
-
-<P>
-Permission to copy, use, and distribute this software and its documentation is granted, provided that the above copyright notice appears in all copies and that that copyright notice appear in supporting documentation.
-
-<P>
-Permission to modify the software and its documentation, and to distribute modified software and documentation is granted, provided that: the above copyright notice appears in all copies <STRONG>AND</STRONG> that copyright notice appears in supporting documentation, <STRONG>AND</STRONG> a notice that the software was modified appears with the copyright notice.
-
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
-
-</BODY>
-</HTML>
\ No newline at end of file

Modified: boost/trunk/libs/pool/doc/implementation/alignment.html
===================================================================
--- boost/trunk/libs/pool/doc/implementation/alignment.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/implementation/alignment.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,383 +1,871 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>Guaranteeing Alignment</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>Guaranteeing Alignment</H1>
+  <title>Guaranteeing Alignment</title>
+</head>
 
-<P>
-<H2>Terminology</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-Review the <A HREF="../concepts.html">concepts document</A> if you are not already familiar with it.  Remember that <EM>block</EM> is a contiguous section of memory, which is <EM>partitioned</EM> or <EM>segregated</EM> into fixed-size <EM>chunks</EM>.  These <EM>chunks</EM> are what are allocated and deallocated by the user.
+  <h1 align="center">Guaranteeing Alignment</h1>
 
-<P>
-<H2>Overview</H2>
+  <h2>Terminology</h2>
 
-<P>
-Each <SPAN CLASS="code">Pool</SPAN> has a single free list that can extend over a number of memory blocks.  Thus, <SPAN CLASS="code">Pool</SPAN> also has a linked list of allocated memory blocks.  Each memory block, by default, is allocated using <SPAN CLASS="code">new[]</SPAN>, and all memory blocks are freed on destruction.  It is the use of <SPAN CLASS="code">new[]</SPAN> that allows us to guarantee alignment.
+  <p>Review the <a href="../concepts.html">concepts document</a> if you are 
+  not already familiar with it. Remember that <em>block</em> is a contiguous 
+  section of memory, which is <em>partitioned</em> or <em>segregated</em>
+  into fixed-size <em>chunks</em>. These <em>chunks</em> are what are 
+  allocated and deallocated by the user.</p>
 
-<P>
-<H2>Proof of Concept: Guaranteeing Alignment</H2>
+  <h2>Overview</h2>
 
-<P>
-Each block of memory is allocated as a POD type (specifically, an array of characters) through <SPAN CLASS="code">operator new[]</SPAN>.  Let <EM>POD_size</EM> be the number of characters allocated.
+  <p>Each <span class="code">Pool</span> has a single free list that can 
+  extend over a number of memory blocks. Thus, <span class="code">Pool</span>
+  also has a linked list of allocated memory blocks. Each memory block, by 
+  default, is allocated using <span class="code">new[]</span>, and all memory 
+  blocks are freed on destruction. It is the use of <span class=
+  "code">new[]</span> that allows us to guarantee alignment.</p>
 
-<P>
-<H3>Predicate 1: Arrays may not have padding</H3>
+  <h2>Proof of Concept: Guaranteeing Alignment</h2>
 
-<P>
-This follows from the following quote:
+  <p>Each block of memory is allocated as a POD type (specifically, an array 
+  of characters) through <span class="code">operator new[]</span>. Let
+  <em>POD_size</em> be the number of characters allocated.</p>
 
-<P>
-[5.3.3/2] (Expressions::Unary expressions::Sizeof) &quot;... When applied to an array, the result is the total number of bytes in the array.  This implies that the size of an array of <EM>n</EM> elements is <EM>n</EM> times the size of an element.&quot;
+  <h3>Predicate 1: Arrays may not have padding</h3>
 
-<P>
-Therefore, arrays cannot contain padding, though the elements within the arrays may contain padding.
+  <p>This follows from the following quote:</p>
 
-<P>
-<H3>Predicate 2: Any block of memory allocated as an array of characters through <SPAN CLASS="code">operator new[]</SPAN> (hereafter referred to as <EM>the block</EM>) is properly aligned for any object of that size or smaller</H3>
+  <p>[5.3.3/2] (Expressions::Unary expressions::Sizeof) &quot;... When applied to 
+  an array, the result is the total number of bytes in the array. This implies 
+  that the size of an array of <em>n</em> elements is <em>n</em>
+  times the size of an element.&quot;</p>
 
-<P>
-This follows from:
+  <p>Therefore, arrays cannot contain padding, though the elements within the 
+  arrays may contain padding.</p>
 
-<UL>
-<LI>[3.7.3.1/2] (Basic concepts::Storage duration::Dynamic storage duration::Allocation functions) &quot;... The pointer returned shall be suitably aligned so that it can be converted to a pointer of any complete object type and then used to access the object or array in the storage allocated ...&quot;</LI>
-<LI>[5.3.4/10] (Expressions::Unary expressions::New) &quot;... For arrays of <SPAN CLASS="code">char</SPAN> and <SPAN CLASS="code">unsigned char</SPAN>, the difference between the result of the <EM>new-expression</EM> and the address returned by the allocation function shall be an integral multiple of the most stringent alignment requirement (3.9) of any object type whose size is no greater than the size of the array being created.  [<EM>Note:</EM> Because allocation functions are assumed to return pointers to storage that is appropriately aligned for objects of any type, this constraint on array allocation overhead permits the common idiom of allocating character arrays into which objects of other types will later be placed. ]&quot;</LI>
-</UL>
+  <h3>Predicate 2: Any block of memory allocated as an array of characters 
+  through <span class="code">operator new[]</span> (hereafter referred to as
+  <em>the block</em>) is properly aligned for any object of that size or 
+  smaller</h3>
 
-<P>
-<H3>Consider: imaginary object type <EM>Element</EM> of a size which is a multiple of some actual object size; assume sizeof(Element) &gt; POD_size</H3>
+  <p>This follows from:</p>
 
-<P>
-Note that an object of that size <EM>can</EM> exist.  One object of that size is an array of the &quot;actual&quot; objects.
+  <ul>
+    <li>[3.7.3.1/2] (Basic concepts::Storage duration::Dynamic storage 
+    duration::Allocation functions) &quot;... The pointer returned shall be 
+    suitably aligned so that it can be converted to a pointer of any complete 
+    object type and then used to access the object or array in the storage 
+    allocated ...&quot;</li>
 
-<P>
-Note that the block is properly aligned for an Element.  This directly follows from Predicate 2.
+    <li>[5.3.4/10] (Expressions::Unary expressions::New) &quot;... For arrays of
+    <span class="code">char</span> and <span class="code">unsigned char</span>, 
+    the difference between the result of the
+    <em>new-expression</em> and the address returned by the allocation 
+    function shall be an integral multiple of the most stringent alignment 
+    requirement (3.9) of any object type whose size is no greater than the 
+    size of the array being created. [<em>Note:</em> Because allocation 
+    functions are assumed to return pointers to storage that is appropriately 
+    aligned for objects of any type, this constraint on array allocation 
+    overhead permits the common idiom of allocating character arrays into 
+    which objects of other types will later be placed. ]&quot;</li>
+  </ul>
 
-<P>
-<H3>Corollary 1: The block is properly aligned for an array of Elements</H3>
+  <h3>Consider: imaginary object type <em>Element</em> of a size which is a 
+  multiple of some actual object size; assume sizeof(Element) &gt; POD_size</h3>
 
-<P>
-This follows from Predicates 1 and 2, and the following quote:
+  <p>Note that an object of that size <em>can</em> exist. One object of that 
+  size is an array of the &quot;actual&quot; objects.</p>
 
-<P>
-[3.9/9] (Basic concepts::Types) &quot;An <EM>object type</EM> is a (possibly cv-qualified) type that is not a function type, not a reference type, and not a void type.&quot;  (Specifically, array types are object types.)
+  <p>Note that the block is properly aligned for an Element. This directly 
+  follows from Predicate 2.</p>
 
-<P>
-<H3>Corollary 2: For any pointer <EM>p</EM> and integer <EM>i</EM>, if p is properly aligned for the type it points to, then p + i (when well-defined) is properly aligned for that type; in other words, if an array is properly aligned, then each element in that array is properly aligned</H3>
+  <h3>Corollary 1: The block is properly aligned for an array of Elements</h3>
 
-<P>
-There are no quotes from the Standard to directly support this argument, but it fits the common conception of the meaning of &quot;alignment&quot;.
+  <p>This follows from Predicates 1 and 2, and the following quote:</p>
 
-<P>
-Note that the conditions for p + i being well-defined are outlined in [5.7/5].  We do not quote that here, but only make note that it is well-defined if p and p + i both point into or one past the same array.
+  <p>[3.9/9] (Basic concepts::Types) &quot;An <em>object type</em> is a (possibly 
+  cv-qualified) type that is not a function type, not a reference type, and 
+  not a void type.&quot; (Specifically, array types are object types.)</p>
 
-<P>
-<H3>Let: sizeof(Element) be the least common multiple of sizes of several actual objects (T<SUB>1</SUB>, T<SUB>2</SUB>, T<SUB>3</SUB>, ...)</H3>
+  <h3>Corollary 2: For any pointer <em>p</em> and integer <em>i</em>, if p is 
+  properly aligned for the type it points to, then p + i (when well-defined) 
+  is properly aligned for that type; in other words, if an array is properly 
+  aligned, then each element in that array is properly aligned</h3>
 
-<P>
-<H3>Let: <EM>block</EM> be a pointer to the memory block, <EM>pe</EM> be (Element *) block, and <EM>p<SUB>n</SUB></EM> be (T<SUB>n</SUB> *) block</H3>
+  <p>There are no quotes from the Standard to directly support this argument, 
+  but it fits the common conception of the meaning of &quot;alignment&quot;.</p>
 
-<P>
-<H3>Corollary 3: For each integer <EM>i</EM>, such that pe + i is well-defined, then for each <EM>n</EM>, there exists some integer <EM>j<SUB>n</SUB></EM> such that p<SUB>n</SUB> + j<SUB>n</SUB> is well-defined and refers to the same memory address as pe + i</H3>
+  <p>Note that the conditions for p + i being well-defined are outlined in 
+  [5.7/5]. We do not quote that here, but only make note that it is 
+  well-defined if p and p + i both point into or one past the same array.</p>
 
-<P>
-This follows naturally, since the memory block is an array of Elements, and for each n, sizeof(Element) % sizeof(T<SUB>n</SUB>) == 0; thus, the boundary of each element in the array of Elements is also a boundary of each element in each array of T<SUB>n</SUB>.
+  <h3>Let: sizeof(Element) be the least common multiple of sizes of several 
+  actual objects (T<sub>1</sub>, T<sub>2</sub>, T<sub>3</sub>, ...)</h3>
 
-<P>
-<H3>Theorem: For each integer <EM>i</EM>, such that pe + i is well-defined, that address (pe + i) is properly aligned for each type T<SUB>n</SUB></H3>
+  <h3>Let: <em>block</em> be a pointer to the memory block, <em>pe</em> be 
+  (Element *) block, and <em>p<sub>n</sub></em> be (T<sub>n</sub> *) block</h3>
 
-<P>
-Since pe + i is well-defined, then by Corollary 3, p<SUB>n</SUB> + j<SUB>n</SUB> is well-defined.  It is properly aligned from Predicate 2 and Corollaries 1 and 2.
+  <h3>Corollary 3: For each integer <em>i</em>, such that pe + i is 
+  well-defined, then for each <em>n</em>, there exists some integer
+  <em>j<sub>n</sub></em> such that p<sub>n</sub> + j<sub>n</sub> is 
+  well-defined and refers to the same memory address as pe + i</h3>
 
-<P>
-<H2>Use of the Theorem</H2>
+  <p>This follows naturally, since the memory block is an array of Elements, 
+  and for each n, sizeof(Element) % sizeof(T<sub>n</sub>) == 0; thus, the 
+  boundary of each element in the array of Elements is also a boundary of each 
+  element in each array of T<sub>n</sub>.</p>
 
-<P>
-The proof above covers alignment requirements for cutting chunks out of a block.  The implementation uses actual object sizes of:
+  <h3>Theorem: For each integer <em>i</em>, such that pe + i is well-defined, 
+  that address (pe + i) is properly aligned for each type T<sub>n</sub></h3>
 
-<UL>
-<LI>The requested object size (requested_size); this is the size of chunks requested by the user</LI>
-<LI>void * (pointer to void); this is because we interleave our free list through the chunks</LI>
-<LI>size_type; this is because we store the size of the next block within each memory block</LI>
-</UL>
+  <p>Since pe + i is well-defined, then by Corollary 3, p<sub>n</sub> + j<sub>n</sub> 
+  is well-defined. It is properly aligned from Predicate 2 and Corollaries 1 
+  and 2.</p>
 
-<P>
-Each block also contains a pointer to the next block; but that is stored as a pointer to void and cast when necessary, to simplify alignment requirements to the three types above.
+  <h2>Use of the Theorem</h2>
 
-<P>
-Therefore, <SPAN CLASS="code">alloc_size</SPAN> is defined to be the lcm of the sizes of the three types above.
+  <p>The proof above covers alignment requirements for cutting chunks out of a 
+  block. The implementation uses actual object sizes of:</p>
 
-<P>
-<H2>A Look at the Memory Block</H2>
+  <ul>
+    <li>The requested object size (requested_size); this is the size of chunks 
+    requested by the user</li>
 
-<P>
-Each memory block consists of three main sections.  The first section is the part that chunks are cut out of, and contains the interleaved free list.  The second section is the pointer to the next block, and the third section is the size of the next block.
+    <li>void * (pointer to void); this is because we interleave our free list 
+    through the chunks</li>
 
-<P>
-Each of these sections may contain padding as necessary to guarantee alignment for each of the next sections.  The size of the first section is number_of_chunks * lcm(requested_size, sizeof(void *), sizeof(size_type)); the size of the second section is lcm(sizeof(void *), sizeof(size_type); and the size of the third section is sizeof(size_type).
+    <li>size_type; this is because we store the size of the next block within 
+    each memory block</li>
+  </ul>
 
-<P>
-Here's an example memory block, where requested_size == sizeof(void *) == sizeof(size_type) == 4:
+  <p>Each block also contains a pointer to the next block; but that is stored 
+  as a pointer to void and cast when necessary, to simplify alignment 
+  requirements to the three types above.</p>
 
-<TABLE CELLSPACING="0" CELLPADDING="0" BORDER="3" STYLE="clear: both;" ALIGN=CENTER>
-<CAPTION><EM>Memory block containing 4 chunks, showing overlying array structures; FLP = Interleaved Free List Pointer</EM></CAPTION>
+  <p>Therefore, <span class="code">alloc_size</span> is defined to be the lcm 
+  of the sizes of the three types above.</p>
 
-<TR><TH>Sections<TH>size_type alignment<TH>void * alignment<TH>requested_size alignment
+  <h2>A Look at the Memory Block</h2>
 
-<TR><TD STYLE="background-color: red; text-align: center;" COLSPAN="4">Memory not belonging to process
+  <p>Each memory block consists of three main sections. The first section is 
+  the part that chunks are cut out of, and contains the interleaved free list. 
+  The second section is the pointer to the next block, and the third section 
+  is the size of the next block.</p>
 
-<TR><TD STYLE="background-color: gray; text-align: center;" ROWSPAN="4">Chunks section (16 bytes)
- <TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">FLP for Chunk 1 (4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">Chunk 1 (4 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">FLP for Chunk 2 (4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">Chunk 2 (4 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">FLP for Chunk 3 (4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">Chunk 3 (4 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">FLP for Chunk 4 (4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">Chunk 4 (4 bytes)
+  <p>Each of these sections may contain padding as necessary to guarantee 
+  alignment for each of the next sections. The size of the first section is 
+  number_of_chunks * lcm(requested_size, sizeof(void *), sizeof(size_type)); 
+  the size of the second section is lcm(sizeof(void *), sizeof(size_type); and 
+  the size of the third section is sizeof(size_type).</p>
 
-<TR><TD STYLE="background-color: silver; text-align: center;">Pointer to next Block (4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">Pointer to next Block (4 bytes)
+  <p>Here's an example memory block, where requested_size == sizeof(void *) == 
+  sizeof(size_type) == 4:</p>
 
-<TR><TD STYLE="background-color: gray; text-align: center;">Size of next Block (4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">Size of next Block (4 bytes)
+  <table cellspacing="0" cellpadding="0" border="3" style="clear: both;"
+  align="center" summary="">
+    <caption>
+      <em>Memory block containing 4 chunks, showing overlying array 
+      structures; FLP = Interleaved Free List Pointer</em>
+    </caption>
 
-<TR><TD STYLE="background-color: red; text-align: center;" COLSPAN="4">Memory not belonging to process
-</TABLE>
+    <tr>
+      <th>Sections</th>
 
-<P>
-To show a visual example of possible padding, here's an example memory block where requested_size == 8 and sizeof(void *) == sizeof(size_type) == 4:
+      <th>size_type alignment</th>
 
-<TABLE CELLSPACING="0" CELLPADDING="0" BORDER="3" STYLE="clear: both;" ALIGN=CENTER>
-<CAPTION><EM>Memory block containing 4 chunks, showing overlying array structures; FLP = Interleaved Free List Pointer</EM></CAPTION>
+      <th>void * alignment</th>
 
-<TR><TH>Sections<TH>size_type alignment<TH>void * alignment<TH>requested_size alignment
+      <th>requested_size alignment</th>
+    </tr>
 
-<TR><TD STYLE="background-color: red; text-align: center;" COLSPAN="4">Memory not belonging to process
+    <tr>
+      <td style="background-color: red; text-align: center;" colspan="4">
+      Memory not belonging to process</td>
+    </tr>
 
-<TR><TD STYLE="background-color: gray; text-align: center;" ROWSPAN="8">Chunks section (32 bytes)
- <TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">FLP for Chunk 1 (4 bytes)
- <TD STYLE="background-color: gray; text-align: center;" ROWSPAN="2">Chunk 1 (8 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">(4 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">FLP for Chunk 2 (4 bytes)
- <TD STYLE="background-color: silver; text-align: center;" ROWSPAN="2">Chunk 2 (8 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">(4 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">FLP for Chunk 3 (4 bytes)
- <TD STYLE="background-color: gray; text-align: center;" ROWSPAN="2">Chunk 3 (8 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">(4 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">FLP for Chunk 4 (4 bytes)
- <TD STYLE="background-color: silver; text-align: center;" ROWSPAN="2">Chunk 4 (8 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">(4 bytes)
+    <tr>
+      <td style="background-color: gray; text-align: center;" rowspan="4">
+      Chunks section (16 bytes)</td>
 
-<TR><TD STYLE="background-color: silver; text-align: center;">Pointer to next Block (4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">Pointer to next Block (4 bytes)
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
 
-<TR><TD STYLE="background-color: gray; text-align: center;">Size of next Block (4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">Size of next Block (4 bytes)
+      <td style="background-color: gray; text-align: center;">FLP for Chunk 1 
+      (4 bytes)</td>
 
-<TR><TD STYLE="background-color: red; text-align: center;" COLSPAN="4">Memory not belonging to process
-</TABLE>
+      <td style="background-color: gray; text-align: center;">Chunk 1 (4 
+      bytes)</td>
+    </tr>
 
-<P>
-Finally, here is a convoluted example where the requested_size is 7, sizeof(void *) == 3, and sizeof(size_type) == 5, showing how the least common multiple guarantees alignment requirements even in the oddest of circumstances:
+    <tr>
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
 
-<TABLE CELLSPACING="0" CELLPADDING="0" BORDER="3" STYLE="clear: both;" ALIGN=CENTER>
-<CAPTION><EM>Memory block containing 2 chunks, showing overlying array structures</EM></CAPTION>
+      <td style="background-color: silver; text-align: center;">FLP for Chunk 
+      2 (4 bytes)</td>
 
-<TR><TH>Sections<TH>size_type alignment<TH>void * alignment<TH>requested_size alignment
+      <td style="background-color: silver; text-align: center;">Chunk 2 (4 
+      bytes)</td>
+    </tr>
 
-<TR><TD STYLE="background-color: red; text-align: center;" COLSPAN="4">Memory not belonging to process
+    <tr>
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
 
-<!-- First Section -->
+      <td style="background-color: gray; text-align: center;">FLP for Chunk 3 
+      (4 bytes)</td>
 
-<TR><TD STYLE="background-color: gray; text-align: center;" ROWSPAN="42">Chunks section (210 bytes)
- <TD STYLE="background-color: gray; text-align: center;">(5 bytes)
- <TD STYLE="background-color: gray; text-align: center;" ROWSPAN="3">Interleaved free list pointer for Chunk 1 (15 bytes; 3 used)
- <TD STYLE="background-color: gray; text-align: center;" ROWSPAN="21">Chunk 1 (105 bytes; 7 used)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
- <TD STYLE="background-color: silver; text-align: center;" ROWSPAN="3">(15 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
- <TD STYLE="background-color: gray; text-align: center;" ROWSPAN="3">(15 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
- <TD STYLE="background-color: silver; text-align: center;" ROWSPAN="3">(15 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
- <TD STYLE="background-color: gray; text-align: center;" ROWSPAN="3">(15 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
- <TD STYLE="background-color: silver; text-align: center;" ROWSPAN="3">(15 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
- <TD STYLE="background-color: gray; text-align: center;" ROWSPAN="3">(15 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
- <TD STYLE="background-color: silver; text-align: center;" ROWSPAN="3">Interleaved free list pointer for Chunk 2 (15 bytes; 3 used)
- <TD STYLE="background-color: silver; text-align: center;" ROWSPAN="21">Chunk 2 (105 bytes; 7 used)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
- <TD STYLE="background-color: gray; text-align: center;" ROWSPAN="3">(15 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
- <TD STYLE="background-color: silver; text-align: center;" ROWSPAN="3">(15 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
- <TD STYLE="background-color: gray; text-align: center;" ROWSPAN="3">(15 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
- <TD STYLE="background-color: silver; text-align: center;" ROWSPAN="3">(15 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
- <TD STYLE="background-color: gray; text-align: center;" ROWSPAN="3">(15 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
- <TD STYLE="background-color: silver; text-align: center;" ROWSPAN="3">(15 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
+      <td style="background-color: gray; text-align: center;">Chunk 3 (4 
+      bytes)</td>
+    </tr>
 
-<!-- Second Section -->
+    <tr>
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
 
-<TR><TD STYLE="background-color: silver; text-align: center;" ROWSPAN="3">Pointer to next Block (15 bytes; 3 used)
- <TD STYLE="background-color: gray; text-align: center;">(5 bytes)
- <TD STYLE="background-color: gray; text-align: center;" ROWSPAN="3">Pointer to next Block (15 bytes; 3 used)
-<TR><TD STYLE="background-color: silver; text-align: center;">(5 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(5 bytes)
+      <td style="background-color: silver; text-align: center;">FLP for Chunk 
+      4 (4 bytes)</td>
 
-<!-- Third Section -->
+      <td style="background-color: silver; text-align: center;">Chunk 4 (4 
+      bytes)</td>
+    </tr>
 
-<TR><TD STYLE="background-color: gray; text-align: center;">Size of next Block (5 bytes; 5 used)
- <TD STYLE="background-color: silver; text-align: center;">Size of next Block (5 bytes; 5 used)
+    <tr>
+      <td style="background-color: silver; text-align: center;">Pointer to 
+      next Block (4 bytes)</td>
 
-<TR><TD STYLE="background-color: red; text-align: center;" COLSPAN="4">Memory not belonging to process
-</TABLE>
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
 
-<P>
-<H2>How Contiguous Chunks are Handled</H2>
+      <td style="background-color: gray; text-align: center;">Pointer to next 
+      Block (4 bytes)</td>
+    </tr>
 
-<P>
-The theorem above guarantees all alignment requirements for allocating chunks and also implementation details such as the interleaved free list.  However, it does so by adding padding when necessary; therefore, we have to treat allocations of contiguous chunks in a different way.
+    <tr>
+      <td style="background-color: gray; text-align: center;">Size of next 
+      Block (4 bytes)</td>
 
-<P>
-Using array arguments similar to the above, we can translate any request for contiguous memory for <EM>n</EM> objects of requested_size into a request for <EM>m</EM> contiguous chunks.  <EM>m</EM> is simply ceil(n * requested_size / alloc_size), where alloc_size is the actual size of the chunks.  To illustrate:
+      <td style="background-color: silver; text-align: center;">Size of next 
+      Block (4 bytes)</td>
+    </tr>
 
-<P>
-Here's an example memory block, where requested_size == 1 and sizeof(void *) == sizeof(size_type) == 4:
+    <tr>
+      <td style="background-color: red; text-align: center;" colspan="4">
+      Memory not belonging to process</td>
+    </tr>
+  </table>
 
-<TABLE CELLSPACING="0" CELLPADDING="0" BORDER="3" STYLE="clear: both;" ALIGN=CENTER>
-<CAPTION><EM>Memory block containing 4 chunks; requested_size is 1</EM></CAPTION>
+  <p>To show a visual example of possible padding, here's an example memory 
+  block where requested_size == 8 and sizeof(void *) == sizeof(size_type) == 
+  4:</p>
 
-<TR><TH>Sections<TH>size_type alignment<TH>void * alignment<TH>requested_size alignment
+  <table cellspacing="0" cellpadding="0" border="3" style="clear: both;"
+  align="center" summary="">
+    <caption>
+      <em>Memory block containing 4 chunks, showing overlying array 
+      structures; FLP = Interleaved Free List Pointer</em>
+    </caption>
 
-<TR><TD STYLE="background-color: red; text-align: center;" COLSPAN="4">Memory not belonging to process
+    <tr>
+      <th>Sections</th>
 
-<TR><TD STYLE="background-color: gray; text-align: center;" ROWSPAN="4">Chunks section (16 bytes)
- <TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">FLP to Chunk 2 (4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">Chunk 1 (4 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">FLP to Chunk 3 (4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">Chunk 2 (4 bytes)
-<TR><TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">FLP to Chunk 4 (4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">Chunk 3 (4 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">FLP to end-of-list (4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">Chunk 4 (4 bytes)
+      <th>size_type alignment</th>
 
-<TR><TD STYLE="background-color: silver; text-align: center;">Pointer to next Block (4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">Ptr to end-of-list (4 bytes)
+      <th>void * alignment</th>
 
-<TR><TD STYLE="background-color: gray; text-align: center;">Size of next Block (4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">0 (4 bytes)
+      <th>requested_size alignment</th>
+    </tr>
 
-<TR><TD STYLE="background-color: red; text-align: center;" COLSPAN="4">Memory not belonging to process
-</TABLE>
+    <tr>
+      <td style="background-color: red; text-align: center;" colspan="4">
+      Memory not belonging to process</td>
+    </tr>
 
-<TABLE CELLSPACING="0" CELLPADDING="0" BORDER="3" STYLE="clear: both;" ALIGN=CENTER>
-<CAPTION><EM>After user requests 7 contiguous elements of requested_size</EM></CAPTION>
+    <tr>
+      <td style="background-color: gray; text-align: center;" rowspan="8">
+      Chunks section (32 bytes)</td>
 
-<TR><TH>Sections<TH>size_type alignment<TH>void * alignment<TH>requested_size alignment
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
 
-<TR><TD STYLE="background-color: red; text-align: center;" COLSPAN="4">Memory not belonging to process
+      <td style="background-color: gray; text-align: center;">FLP for Chunk 1 
+      (4 bytes)</td>
 
-<TR><TD STYLE="background-color: gray; text-align: center;" ROWSPAN="4">Chunks section (16 bytes)
- <TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">4 bytes in use by program
-<TR><TD STYLE="background-color: silver; text-align: center;">(4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">(4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">3 bytes in use by program (1 byte unused)
-<TR><TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">FLP to Chunk 4 (4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">Chunk 3 (4 bytes)
-<TR><TD STYLE="background-color: silver; text-align: center;">(4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">FLP to end-of-list (4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">Chunk 4 (4 bytes)
+      <td style="background-color: gray; text-align: center;" rowspan="2">
+      Chunk 1 (8 bytes)</td>
+    </tr>
 
-<TR><TD STYLE="background-color: silver; text-align: center;">Pointer to next Block (4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">(4 bytes)
- <TD STYLE="background-color: gray; text-align: center;">Ptr to end-of-list (4 bytes)
+    <tr>
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
 
-<TR><TD STYLE="background-color: gray; text-align: center;">Size of next Block (4 bytes)
- <TD STYLE="background-color: silver; text-align: center;">0 (4 bytes)
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
+    </tr>
 
-<TR><TD STYLE="background-color: red; text-align: center;" COLSPAN="4">Memory not belonging to process
-</TABLE>
+    <tr>
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
 
-<P>
-Then, when the user deallocates the contiguous memory, we can split it up into chunks again.
+      <td style="background-color: gray; text-align: center;">FLP for Chunk 2 
+      (4 bytes)</td>
 
-<P>
-Note that the implementation provided for allocating contiguous chunks uses a linear instead of quadratic algorithm.  This means that it <STRONG>may not find</STRONG> contiguous free chunks if the free list is not ordered.  Thus, it is recommended to always use an ordered free list when dealing with contiguous allocation of chunks.  (In the example above, if Chunk 1 pointed to Chunk 3 pointed to Chunk 2 pointed to Chunk 4, instead of being in order, the contiguous allocation algorithm would have failed to find any of the contiguous chunks).
+      <td style="background-color: silver; text-align: center;" rowspan="2">
+      Chunk 2 (8 bytes)</td>
+    </tr>
 
-<P>
-<HR>
+    <tr>
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
+    </tr>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+    <tr>
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+      <td style="background-color: gray; text-align: center;">FLP for Chunk 3 
+      (4 bytes)</td>
 
-</BODY>
-</HTML>
\ No newline at end of file
+      <td style="background-color: gray; text-align: center;" rowspan="2">
+      Chunk 3 (8 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">FLP for Chunk 4 
+      (4 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;" rowspan="2">
+      Chunk 4 (8 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">Pointer to 
+      next Block (4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">Pointer to next 
+      Block (4 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">Size of next 
+      Block (4 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;">Size of next 
+      Block (4 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: red; text-align: center;" colspan="4">
+      Memory not belonging to process</td>
+    </tr>
+  </table>
+
+  <p>Finally, here is a convoluted example where the requested_size is 7, 
+  sizeof(void *) == 3, and sizeof(size_type) == 5, showing how the least 
+  common multiple guarantees alignment requirements even in the oddest of 
+  circumstances:</p>
+
+  <table cellspacing="0" cellpadding="0" border="3" style="clear: both;"
+  align="center" summary="">
+    <caption>
+      <em>Memory block containing 2 chunks, showing overlying array structures</em>
+    </caption>
+
+    <tr>
+      <th>Sections</th>
+
+      <th>size_type alignment</th>
+
+      <th>void * alignment</th>
+
+      <th>requested_size alignment</th>
+    </tr>
+
+    <tr>
+      <td style="background-color: red; text-align: center;" colspan="4">
+      Memory not belonging to process <!-- First Section --></td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;" rowspan="42">
+      Chunks section (210 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;" rowspan="3">
+      Interleaved free list pointer for Chunk 1 (15 bytes; 3 used)</td>
+
+      <td style="background-color: gray; text-align: center;" rowspan="21">
+      Chunk 1 (105 bytes; 7 used)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;" rowspan="3">
+      (15 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;" rowspan="3">(15 
+      bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;" rowspan="3">
+      (15 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;" rowspan="3">(15 
+      bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;" rowspan="3">
+      (15 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;" rowspan="3">(15 
+      bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;" rowspan="3">
+      Interleaved free list pointer for Chunk 2 (15 bytes; 3 used)</td>
+
+      <td style="background-color: silver; text-align: center;" rowspan="21">
+      Chunk 2 (105 bytes; 7 used)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;" rowspan="3">(15 
+      bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;" rowspan="3">
+      (15 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;" rowspan="3">(15 
+      bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;" rowspan="3">
+      (15 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;" rowspan="3">(15 
+      bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;" rowspan="3">
+      (15 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes) 
+      <!-- Second Section --></td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;" rowspan="3">
+      Pointer to next Block (15 bytes; 3 used)</td>
+
+      <td style="background-color: gray; text-align: center;">(5 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;" rowspan="3">
+      Pointer to next Block (15 bytes; 3 used)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(5 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(5 bytes) 
+      <!-- Third Section --></td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">Size of next 
+      Block (5 bytes; 5 used)</td>
+
+      <td style="background-color: silver; text-align: center;">Size of next 
+      Block (5 bytes; 5 used)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: red; text-align: center;" colspan="4">
+      Memory not belonging to process</td>
+    </tr>
+  </table>
+
+  <h2>How Contiguous Chunks are Handled</h2>
+
+  <p>The theorem above guarantees all alignment requirements for allocating 
+  chunks and also implementation details such as the interleaved free list. 
+  However, it does so by adding padding when necessary; therefore, we have to 
+  treat allocations of contiguous chunks in a different way.</p>
+
+  <p>Using array arguments similar to the above, we can translate any request 
+  for contiguous memory for <em>n</em> objects of requested_size into a 
+  request for <em>m</em> contiguous chunks. <em>m</em> is simply ceil(n * 
+  requested_size / alloc_size), where alloc_size is the actual size of the 
+  chunks. To illustrate:</p>
+
+  <p>Here's an example memory block, where requested_size == 1 and sizeof(void 
+  *) == sizeof(size_type) == 4:</p>
+
+  <table cellspacing="0" cellpadding="0" border="3" style="clear: both;"
+  align="center" summary="">
+    <caption>
+      <em>Memory block containing 4 chunks; requested_size is 1</em>
+    </caption>
+
+    <tr>
+      <th>Sections</th>
+
+      <th>size_type alignment</th>
+
+      <th>void * alignment</th>
+
+      <th>requested_size alignment</th>
+    </tr>
+
+    <tr>
+      <td style="background-color: red; text-align: center;" colspan="4">
+      Memory not belonging to process</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;" rowspan="4">
+      Chunks section (16 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">FLP to Chunk 2 
+      (4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">Chunk 1 (4 
+      bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;">FLP to Chunk 3 
+      (4 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;">Chunk 2 (4 
+      bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">FLP to Chunk 4 
+      (4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">Chunk 3 (4 
+      bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;">FLP to 
+      end-of-list (4 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;">Chunk 4 (4 
+      bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">Pointer to 
+      next Block (4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">Ptr to 
+      end-of-list (4 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">Size of next 
+      Block (4 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;">0 (4 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: red; text-align: center;" colspan="4">
+      Memory not belonging to process</td>
+    </tr>
+  </table>
+<br>
+  <table cellspacing="0" cellpadding="0" border="3" style="clear: both;"
+  align="center" summary="">
+    <caption>
+      <em>After user requests 7 contiguous elements of requested_size</em>
+    </caption>
+
+    <tr>
+      <th>Sections</th>
+
+      <th>size_type alignment</th>
+
+      <th>void * alignment</th>
+
+      <th>requested_size alignment</th>
+    </tr>
+
+    <tr>
+      <td style="background-color: red; text-align: center;" colspan="4">
+      Memory not belonging to process</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;" rowspan="4">
+      Chunks section (16 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">4 bytes in use 
+      by program</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;">3 bytes in use 
+      by program (1 byte unused)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">FLP to Chunk 4 
+      (4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">Chunk 3 (4 
+      bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;">FLP to 
+      end-of-list (4 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;">Chunk 4 (4 
+      bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: silver; text-align: center;">Pointer to 
+      next Block (4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">(4 bytes)</td>
+
+      <td style="background-color: gray; text-align: center;">Ptr to 
+      end-of-list (4 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: gray; text-align: center;">Size of next 
+      Block (4 bytes)</td>
+
+      <td style="background-color: silver; text-align: center;">0 (4 bytes)</td>
+    </tr>
+
+    <tr>
+      <td style="background-color: red; text-align: center;" colspan="4">
+      Memory not belonging to process</td>
+    </tr>
+  </table>
+
+  <p>Then, when the user deallocates the contiguous memory, we can split it up 
+  into chunks again.</p>
+
+  <p>Note that the implementation provided for allocating contiguous chunks 
+  uses a linear instead of quadratic algorithm. This means that it
+  <strong>may not find</strong> contiguous free chunks if the free list is not 
+  ordered. Thus, it is recommended to always use an ordered free list when 
+  dealing with contiguous allocation of chunks. (In the example above, if 
+  Chunk 1 pointed to Chunk 3 pointed to Chunk 2 pointed to Chunk 4, instead of 
+  being in order, the contiguous allocation algorithm would have failed to 
+  find any of the contiguous chunks).</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See 
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/implementation/ct_gcd_lcm.html
===================================================================
--- boost/trunk/libs/pool/doc/implementation/ct_gcd_lcm.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/implementation/ct_gcd_lcm.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,24 +1,28 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>ct_gcd_lcm - Compile-Time GCD and LCM</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>ct_gcd_lcm - Compile-Time GCD and LCM</H1>
+  <title>ct_gcd_lcm - Compile-Time GCD and LCM</title>
+</head>
 
-<P>
-<H2>Introduction</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-detail/ct_gcd_lcm.hpp provides two compile-time algorithms: greatest common divisor and least common multiple.
+  <h1 align="center">ct_gcd_lcm - Compile-Time GCD and LCM</h1>
 
-<P>
-<H2>Synopsis</H2>
-<PRE CLASS="code">namespace details {
+  <h2>Introduction</h2>
+
+  <p>detail/ct_gcd_lcm.hpp provides two compile-time algorithms: greatest
+  common divisor and least common multiple.</p>
+
+  <h2>Synopsis</h2>
+  <pre class="code">
+namespace details {
 namespace pool {
 
 template &lt;unsigned A, unsigned B&gt;
@@ -33,62 +37,120 @@
 };
 
 } // namespace pool
-} // namespace details</PRE>
+} // namespace details
+</pre>
 
-<P>
-<H2>Semantics</H2>
+  <h2>Semantics</h2>
 
-<TABLE ALIGN=CENTER BORDER>
-<CAPTION><EM>Symbol Table</EM></CAPTION>
-<TR><TH>Symbol<TH>Meaning</TR>
-<TR><TD CLASS="code">A, B<TD>compile-time unsigned integer constants<A HREF="#5.19/1"><SUP>[5.19/1]</SUP></A></TR>
-</TABLE>
+  <table align="center" border summary="">
+    <caption>
+      <em>Symbol Table</em>
+    </caption>
 
-<TABLE ALIGN=CENTER BORDER>
-<CAPTION><EM>Semantics</EM></CAPTION>
-<TR><TH>Expression<TH>Result Type<TH>Value<TH>Precondition
-<TR><TD CLASS="code">ct_gcd&lt;A, B&gt;::value<TD>compile-time unsigned integer constant<TD>The greatest common divisor of <SPAN CLASS="code">A</SPAN> and <SPAN CLASS="code">B</SPAN><TD CLASS="code">A != 0 &amp;&amp; B != 0
-<TR><TD CLASS="code">ct_lcm&lt;A, B&gt;::value<TD>compile-time unsigned integer constant<TD>The least common multiple of <SPAN CLASS="code">A</SPAN> and <SPAN CLASS="code">B</SPAN><TD CLASS="code">A != 0 &amp;&amp; B != 0
-</TABLE>
+    <tr>
+      <th>Symbol</th>
 
-<P>
-<H2>Notes</H2>
+      <th>Meaning</th>
+    </tr>
 
-<P>
-Since these are compile-time algorithms, violation of the preconditions will result in a compile-time error.
+    <tr>
+      <td class="code">A, B</td>
 
-<P>
-<H2>Dependencies</H2>
+      <td>compile-time unsigned integer constants<a href=
+      "#s519p1"><sup>[5.19/1]</sup></a></td>
+    </tr>
+  </table><br>
 
-<UL>
-<LI>&lt;boost/static_assert.hpp&gt; (see <A HREF="../../../static_assert/static_assert.htm">Boost.Static_Assert</A>), to ensure preconditions are met.</LI>
-<LI>&lt;boost/type_traits/ice.hpp&gt; (see <A HREF="../../../../more/int_const_guidelines.htm">Coding Guidelines for Integral Constant Expressions</A>), to help with portability.</LI>
-</UL>
+  <table align="center" border summary="">
+    <caption>
+      <em>Semantics</em>
+    </caption>
 
-<P>
-<H2>Selected Quotations from the Standard</H2>
+    <tr>
+      <th>Expression</th>
 
-<P>
-<A NAME="5.19/1">
-<STRONG>5.19/1: Expressions: Constant Expressions:</STRONG> &quot;. . . An <EM>integral constant expression</EM> can involve only literals (2.13), enumerators, <SPAN CLASS="code">const</SPAN> variables or static data members of integral or enumeration types initialized with constant expressions (8.5), non-type template parameters of integral or enumeration types, and <SPAN CLASS="code">sizeof</SPAN> expressions.  Floating literals (2.13.3) can appear only if they are cast to integral or enumeration types.  Only type conversions to integral or enumeration types can be used.  In particular, except in <SPAN CLASS="code">sizeof</SPAN> expressions, functions, class objects, pointers, or references shall not be used, and assignment, increment, decrement, function-call, or comma operators shall not be used.&quot;</A>
+      <th>Result Type</th>
 
-<P>
-<H2>Future Directions</H2>
+      <th>Value</th>
 
-<P>
-This header may be replaced by a Boost compile-time algorithms library.
+      <th>Precondition</th>
+    </tr>
 
-<P>
-<HR>
+    <tr>
+      <td class="code">ct_gcd&lt;A, B&gt;::value</td>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+      <td>compile-time unsigned integer constant</td>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+      <td>The greatest common divisor of <span class="code">A</span> and
+      <span class="code">B</span></td>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+      <td class="code">A != 0 &amp;&amp; B != 0</td>
+    </tr>
 
-</BODY>
-</HTML>
\ No newline at end of file
+    <tr>
+      <td class="code">ct_lcm&lt;A, B&gt;::value</td>
+
+      <td>compile-time unsigned integer constant</td>
+
+      <td>The least common multiple of <span class="code">A</span> and
+      <span class="code">B</span></td>
+
+      <td class="code">A != 0 &amp;&amp; B != 0</td>
+    </tr>
+  </table>
+
+  <h2>Notes</h2>
+
+  <p>Since these are compile-time algorithms, violation of the preconditions
+  will result in a compile-time error.</p>
+
+  <h2>Dependencies</h2>
+
+  <ul>
+    <li>&lt;boost/static_assert.hpp&gt; (see <a href=
+    "../../../static_assert/static_assert.htm">Boost.Static_Assert</a>), to
+    ensure preconditions are met.</li>
+
+    <li>&lt;boost/type_traits/ice.hpp&gt; (see <a href=
+    "../../../../more/int_const_guidelines.htm">Coding Guidelines for
+    Integral Constant Expressions</a>), to help with portability.</li>
+  </ul>
+
+  <h2>Selected Quotations from the Standard</h2>
+
+  <p><a name="s519p1" id="s519p1"></a><strong>5.19/1: Expressions: Constant
+  Expressions:</strong> ". . . An <em>integral constant expression</em> can
+  involve only literals (2.13), enumerators, <span class="code">const</span>
+  variables or static data members of integral or enumeration types
+  initialized with constant expressions (8.5), non-type template parameters
+  of integral or enumeration types, and <span class="code">sizeof</span>
+  expressions. Floating literals (2.13.3) can appear only if they are cast to
+  integral or enumeration types. Only type conversions to integral or
+  enumeration types can be used. In particular, except in <span class=
+  "code">sizeof</span> expressions, functions, class objects, pointers, or
+  references shall not be used, and assignment, increment, decrement,
+  function-call, or comma operators shall not be used."</p>
+
+  <h2>Future Directions</h2>
+
+  <p>This header may be replaced by a Boost compile-time algorithms
+  library.</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/implementation/for.html
===================================================================
--- boost/trunk/libs/pool/doc/implementation/for.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/implementation/for.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,75 +1,179 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>for - m4 FOR Macro</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>for - m4 FOR Macro</H1>
+  <title>for - m4 FOR Macro</title>
+</head>
 
-<P>
-<H2>Introduction</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-detail/for.m4 provides <SPAN CLASS="code">BOOST_M4_FOR</SPAN>, an <STRONG>m4</STRONG> macro that provides the equivalent of a <SPAN CLASS="code">#for</SPAN> preprocessor instruction.
+  <h1 align="center">for - m4 FOR Macro</h1>
 
-<P>
-<H2>Usage</H2>
+  <h2>Introduction</h2>
 
-<P>
-This macro must be used by an <STRONG>m4</STRONG> file.  This file assumes that the option <SPAN CLASS="code">-P</SPAN> is used, to force an <SPAN CLASS="code">m4_</SPAN> prefix on all builtin symbols.
+  <p>detail/for.m4 provides <span class="code">BOOST_M4_FOR</span>, an
+  <strong>m4</strong> macro that provides the equivalent of a <span class=
+  "code">#for</span> preprocessor instruction.</p>
 
-<P>
-<H2>Arguments</H2>
+  <h2>Usage</h2>
 
-<OL>
-<LI>The name of a variable to hold the current value.</LI>
-<LI>The starting value of the variable.</LI>
-<LI>The ending value of the variable.</LI>
-<LI>The text to repeat.  This text may contain references to the variable, which will be replaced with the variable's current value.</LI>
-<LI>The delimeter text (optional).</LI>
-</OL>
+  <p>This macro must be used by an <strong>m4</strong> file. This file
+  assumes that the option <span class="code">-P</span> is used, to force an
+  <span class="code">m4_</span> prefix on all builtin symbols.</p>
 
-<P>
-If called with the wrong number of arguments (less than 4 or more than 5), <SPAN CLASS="code">BOOST_M4_FOR</SPAN> will exit with an error.  If the starting value (<SPAN CLASS="code">$2</SPAN>) is greater than or equal to the ending  value (<SPAN CLASS="code">$3</SPAN>), <SPAN CLASS="code">BOOST_M4_FOR</SPAN> will do nothing.  Otherwise, it will repeat the text (<SPAN CLASS="code">$4</SPAN>), binding the variable (<SPAN CLASS="code">$1</SPAN>) to the values in the range [starting value (<SPAN CLASS="code">$2</SPAN>), ending value (<SPAN CLASS="code">$3</SPAN>)), and repeat the delimeter text (<SPAN CLASS="code">$5</SPAN>) in-between each occurrence of the repeat text (<SPAN CLASS="code">$4</SPAN>).
+  <h2>Arguments</h2>
 
-<P>
-<H2>Examples</H2>
+  <ol>
+    <li>The name of a variable to hold the current value.</li>
 
-<P>
-Note of the quotation marks (<SPAN CLASS="m4">&quot;</SPAN>) used in the table below are in the input or output; they are shown to delimit whitespace.  All code within a pair of quotation marks is intended to be on one line.
+    <li>The starting value of the variable.</li>
 
-<P>
-<TABLE BORDER ALIGN="center">
-<TR><TH>Input<TH>Output</TR>
-<TR><TD CLASS="m4">&quot;BOOST_M4_FOR(i, 1, 3)&quot;<TD>Boost m4 script: BOOST_M4_FOR: Wrong number of arguments (3)</TR>
-<TR><TD CLASS="m4">&quot;BOOST_M4_FOR(i, 1, 3, i, ` ', 13)&quot;<TD>Boost m4 script: BOOST_M4_FOR: Wrong number of arguments (6)</TR>
-<TR><TD CLASS="m4">&quot;BOOST_M4_FOR(i, 7, 0, i )&quot;<TD>(nothing)</TR>
-<TR><TD CLASS="m4">&quot;BOOST_M4_FOR(i, 0, 0, i )&quot;<TD>(nothing)</TR>
-<TR><TD CLASS="m4">&quot;BOOST_M4_FOR(i, 0, 7, i )&quot;<TD CLASS="m4">&quot;0 1 2 3 4 5 6 &quot;</TR>
-<TR><TD CLASS="m4">&quot;BOOST_M4_FOR(i, -13, -10, i )&quot;<TD CLASS="m4">&quot;-13 -12 -11 &quot;</TR>
-<TR><TD CLASS="m4">&quot;BOOST_M4_FOR(i, 0, 8, BOOST_M4_FOR(j, 0, 4, (i, j) )&quot;<BR>&quot;)&quot;<TD CLASS="m4">&quot;(0, 0) (0, 1) (0, 2) (0, 3) &quot;<BR>&quot;(1, 0) (1, 1) (1, 2) (1, 3) &quot;<BR>&quot;(2, 0) (2, 1) (2, 2) (2, 3) &quot;<BR>&quot;(3, 0) (3, 1) (3, 2) (3, 3) &quot;<BR>&quot;(4, 0) (4, 1) (4, 2) (4, 3) &quot;<BR>&quot;(5, 0) (5, 1) (5, 2) (5, 3) &quot;<BR>&quot;(6, 0) (6, 1) (6, 2) (6, 3) &quot;<BR>&quot;(7, 0) (7, 1) (7, 2) (7, 3) &quot;<BR>&quot;&quot;</TR>
-<TR><TD CLASS="m4">&quot;BOOST_M4_FOR(i, 7, 0, i, |)&quot;<TD>(nothing)</TR>
-<TR><TD CLASS="m4">&quot;BOOST_M4_FOR(i, 0, 0, i, |)&quot;<TD>(nothing)</TR>
-<TR><TD CLASS="m4">&quot;BOOST_M4_FOR(i, 0, 7, i, |)&quot;<TD CLASS="m4">&quot;0|1|2|3|4|5|6&quot;</TR>
-<TR><TD CLASS="m4">&quot;BOOST_M4_FOR(i, -13, -10, i, `, ')&quot;<TD CLASS="m4">&quot;-13, -12, -11&quot;</TR>
-<TR><TD CLASS="m4">&quot;BOOST_M4_FOR(i, 0, 8, `[BOOST_M4_FOR(j, 0, 4, (i, j), `, ')]', `,&quot;<BR>&quot;')&quot;<TD CLASS="m4">&quot;[(0, 0), (0, 1), (0, 2), (0, 3)],&quot;<BR>&quot;[(1, 0), (1, 1), (1, 2), (1, 3)],&quot;<BR>&quot;[(2, 0), (2, 1), (2, 2), (2, 3)],&quot;<BR>&quot;[(3, 0), (3, 1), (3, 2), (3, 3)],&quot;<BR>&quot;[(4, 0), (4, 1), (4, 2), (4, 3)],&quot;<BR>&quot;[(5, 0), (5, 1), (5, 2), (5, 3)],&quot;<BR>&quot;[(6, 0), (6, 1), (6, 2), (6, 3)],&quot;<BR>&quot;[(7, 0), (7, 1), (7, 2), (7, 3)]&quot;</TR>
-</TABLE>
+    <li>The ending value of the variable.</li>
 
-<P>
-<HR>
+    <li>The text to repeat. This text may contain references to the variable,
+    which will be replaced with the variable's current value.</li>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+    <li>The delimeter text (optional).</li>
+  </ol>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+  <p>If called with the wrong number of arguments (less than 4 or more than
+  5), <span class="code">BOOST_M4_FOR</span> will exit with an error. If the
+  starting value (<span class="code">$2</span>) is greater than or equal to
+  the ending value (<span class="code">$3</span>), <span class=
+  "code">BOOST_M4_FOR</span> will do nothing. Otherwise, it will repeat the
+  text (<span class="code">$4</span>), binding the variable (<span class=
+  "code">$1</span>) to the values in the range [starting value (<span class=
+  "code">$2</span>), ending value (<span class="code">$3</span>)), and repeat
+  the delimeter text (<span class="code">$5</span>) in-between each
+  occurrence of the repeat text (<span class="code">$4</span>).</p>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+  <h2>Examples</h2>
 
-</BODY>
-</HTML>
\ No newline at end of file
+  <p>Note of the quotation marks (<span class="m4">"</span>) used in the
+  table below are in the input or output; they are shown to delimit
+  whitespace. All code within a pair of quotation marks is intended to be on
+  one line.</p>
+
+  <table border align="center" summary="">
+    <tr>
+      <th>Input</th>
+
+      <th>Output</th>
+    </tr>
+
+    <tr>
+      <td class="m4">"BOOST_M4_FOR(i, 1, 3)"</td>
+
+      <td>Boost m4 script: BOOST_M4_FOR: Wrong number of arguments (3)</td>
+    </tr>
+
+    <tr>
+      <td class="m4">"BOOST_M4_FOR(i, 1, 3, i, ` ', 13)"</td>
+
+      <td>Boost m4 script: BOOST_M4_FOR: Wrong number of arguments (6)</td>
+    </tr>
+
+    <tr>
+      <td class="m4">"BOOST_M4_FOR(i, 7, 0, i )"</td>
+
+      <td>(nothing)</td>
+    </tr>
+
+    <tr>
+      <td class="m4">"BOOST_M4_FOR(i, 0, 0, i )"</td>
+
+      <td>(nothing)</td>
+    </tr>
+
+    <tr>
+      <td class="m4">"BOOST_M4_FOR(i, 0, 7, i )"</td>
+
+      <td class="m4">"0 1 2 3 4 5 6 "</td>
+    </tr>
+
+    <tr>
+      <td class="m4">"BOOST_M4_FOR(i, -13, -10, i )"</td>
+
+      <td class="m4">"-13 -12 -11 "</td>
+    </tr>
+
+    <tr>
+      <td class="m4">"BOOST_M4_FOR(i, 0, 8, BOOST_M4_FOR(j, 0, 4, (i, j)
+      )"<br>
+      ")"</td>
+
+      <td class="m4">"(0, 0) (0, 1) (0, 2) (0, 3) "<br>
+      "(1, 0) (1, 1) (1, 2) (1, 3) "<br>
+      "(2, 0) (2, 1) (2, 2) (2, 3) "<br>
+      "(3, 0) (3, 1) (3, 2) (3, 3) "<br>
+      "(4, 0) (4, 1) (4, 2) (4, 3) "<br>
+      "(5, 0) (5, 1) (5, 2) (5, 3) "<br>
+      "(6, 0) (6, 1) (6, 2) (6, 3) "<br>
+      "(7, 0) (7, 1) (7, 2) (7, 3) "<br>
+      ""</td>
+    </tr>
+
+    <tr>
+      <td class="m4">"BOOST_M4_FOR(i, 7, 0, i, |)"</td>
+
+      <td>(nothing)</td>
+    </tr>
+
+    <tr>
+      <td class="m4">"BOOST_M4_FOR(i, 0, 0, i, |)"</td>
+
+      <td>(nothing)</td>
+    </tr>
+
+    <tr>
+      <td class="m4">"BOOST_M4_FOR(i, 0, 7, i, |)"</td>
+
+      <td class="m4">"0|1|2|3|4|5|6"</td>
+    </tr>
+
+    <tr>
+      <td class="m4">"BOOST_M4_FOR(i, -13, -10, i, `, ')"</td>
+
+      <td class="m4">"-13, -12, -11"</td>
+    </tr>
+
+    <tr>
+      <td class="m4">"BOOST_M4_FOR(i, 0, 8, `[BOOST_M4_FOR(j, 0, 4, (i, j),
+      `, ')]', `,"<br>
+      "')"</td>
+
+      <td class="m4">"[(0, 0), (0, 1), (0, 2), (0, 3)],"<br>
+      "[(1, 0), (1, 1), (1, 2), (1, 3)],"<br>
+      "[(2, 0), (2, 1), (2, 2), (2, 3)],"<br>
+      "[(3, 0), (3, 1), (3, 2), (3, 3)],"<br>
+      "[(4, 0), (4, 1), (4, 2), (4, 3)],"<br>
+      "[(5, 0), (5, 1), (5, 2), (5, 3)],"<br>
+      "[(6, 0), (6, 1), (6, 2), (6, 3)],"<br>
+      "[(7, 0), (7, 1), (7, 2), (7, 3)]"</td>
+    </tr>
+  </table>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/implementation/gcd_lcm.html
===================================================================
--- boost/trunk/libs/pool/doc/implementation/gcd_lcm.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/implementation/gcd_lcm.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,24 +1,28 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>gcd_lcm - GCD and LCM</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>gcd_lcm - GCD and LCM</H1>
+  <title>gcd_lcm - GCD and LCM</title>
+</head>
 
-<P>
-<H2>Introduction</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-detail/gcd_lcm.hpp provides two generic integer algorithms: greatest common divisor and least common multiple.
+  <h1 align="center">gcd_lcm - GCD and LCM</h1>
 
-<P>
-<H2>Synopsis</H2>
-<PRE CLASS="code">namespace details {
+  <h2>Introduction</h2>
+
+  <p>detail/gcd_lcm.hpp provides two generic integer algorithms: greatest
+  common divisor and least common multiple.</p>
+
+  <h2>Synopsis</h2>
+  <pre class="code">
+namespace details {
 namespace pool {
 
 template &lt;typename Integer&gt;
@@ -28,54 +32,100 @@
 Integer lcm(Integer A, Integer B);
 
 } // namespace pool
-} // namespace details</PRE>
+} // namespace details
+</pre>
 
-<P>
-<H2>Semantics</H2>
+  <h2>Semantics</h2>
 
-<TABLE ALIGN=CENTER BORDER>
-<CAPTION><EM>Symbol Table</EM></CAPTION>
-<TR><TH>Symbol<TH>Meaning</TR>
-<TR><TD CLASS="code">Integer<TD>An integral type</TR>
-<TR><TD CLASS="code">A, B<TD>Values of type <SPAN CLASS="code">Integer</SPAN></TR>
-</TABLE>
+  <table align="center" border summary="">
+    <caption>
+      <em>Symbol Table</em>
+    </caption>
 
-<TABLE ALIGN=CENTER BORDER>
-<CAPTION><EM>Semantics</EM></CAPTION>
-<TR><TH>Expression<TH>Result Type<TH>Precondition<TH>Notes
-<TR><TD CLASS="code">gcd(A, B)<TD>Integer<TD CLASS="code">A &gt; 0 &amp;&amp; B &gt; 0<TD>Returns the greatest common divisor of <SPAN CLASS="code">A</SPAN> and <SPAN CLASS="code">B</SPAN>
-<TR><TD CLASS="code">lcm(A, B)<TD>Integer<TD CLASS="code">A &gt; 0 &amp;&amp; B &gt; 0<TD>Returns the least common multiple of <SPAN CLASS="code">A</SPAN> and <SPAN CLASS="code">B</SPAN>
-</TABLE>
+    <tr>
+      <th>Symbol</th>
 
-<P>
-<H2>Implementation Notes</H2>
+      <th>Meaning</th>
+    </tr>
 
-<P>
-For faster results, ensure <SPAN CLASS="code">A &gt; B</SPAN>
+    <tr>
+      <td class="code">Integer</td>
 
-<P>
-<H2>Dependencies</H2>
+      <td>An integral type</td>
+    </tr>
 
-<P>
-None.
+    <tr>
+      <td class="code">A, B</td>
 
-<P>
-<H2>Future Directions</H2>
+      <td>Values of type <span class="code">Integer</span></td>
+    </tr>
+  </table><br>
 
-<P>
-This header may be replaced by a Boost algorithms library.
+  <table align="center" border summary="">
+    <caption>
+      <em>Semantics</em>
+    </caption>
 
-<P>
-<HR>
+    <tr>
+      <th>Expression</th>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+      <th>Result Type</th>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+      <th>Precondition</th>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+      <th>Notes</th>
+    </tr>
 
-</BODY>
-</HTML>
\ No newline at end of file
+    <tr>
+      <td class="code">gcd(A, B)</td>
+
+      <td>Integer</td>
+
+      <td class="code">A &gt; 0 &amp;&amp; B &gt; 0</td>
+
+      <td>Returns the greatest common divisor of <span class="code">A</span>
+      and <span class="code">B</span></td>
+    </tr>
+
+    <tr>
+      <td class="code">lcm(A, B)</td>
+
+      <td>Integer</td>
+
+      <td class="code">A &gt; 0 &amp;&amp; B &gt; 0</td>
+
+      <td>Returns the least common multiple of <span class="code">A</span>
+      and <span class="code">B</span></td>
+    </tr>
+  </table>
+
+  <h2>Implementation Notes</h2>
+
+  <p>For faster results, ensure <span class="code">A &gt; B</span></p>
+
+  <h2>Dependencies</h2>
+
+  <p>None.</p>
+
+  <h2>Future Directions</h2>
+
+  <p>This header may be replaced by a Boost algorithms library.</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/implementation/guard.html
===================================================================
--- boost/trunk/libs/pool/doc/implementation/guard.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/implementation/guard.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,25 +1,31 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>guard - Auto-lock/unlock-er</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>guard - Auto-lock/unlock-er</H1>
+  <title>guard - Auto-lock/unlock-er</title>
+</head>
 
-<P>
-<H2>Introduction</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-detail/guard.hpp provides a type <SPAN CLASS="code">guard&lt;Mutex&gt;</SPAN> that allows scoped access to the <SPAN CLASS="code">Mutex</SPAN>'s locking and unlocking operations.  It is used to ensure that a <SPAN CLASS="code">Mutex</SPAN> is unlocked, even if an exception is thrown.
+  <h1 align="center">guard - Auto-lock/unlock-er</h1>
 
-<P>
-<H2>Synopsis</H2>
+  <h2>Introduction</h2>
 
-<PRE CLASS="code">namespace details {
+  <p>detail/guard.hpp provides a type <span class=
+  "code">guard&lt;Mutex&gt;</span> that allows scoped access to the
+  <span class="code">Mutex</span>'s locking and unlocking operations. It is
+  used to ensure that a <span class="code">Mutex</span> is unlocked, even if
+  an exception is thrown.</p>
+
+  <h2>Synopsis</h2>
+  <pre class="code">
+namespace details {
 namespace pool {
 
 template &lt;typename Mutex&gt;
@@ -35,77 +41,139 @@
 };
 
 } // namespace pool
-} // namespace details</PRE>
+} // namespace details
+</pre>
 
-<P>
-<H2>Semantics</H2>
+  <h2>Semantics</h2>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Symbol Table</EM></CAPTION>
-<TR><TH>Symbol<TH>Meaning
-<TR><TD CLASS="code">T<TD><SPAN CLASS="code">guard&lt;Mutex&gt;</SPAN>
-<TR><TD CLASS="code">m<TD>value of type <SPAN CLASS="code">Mutex &amp;</SPAN>
-<TR><TD CLASS="code">g<TD>value of type <SPAN CLASS="code">guard&lt;Mutex&gt;</SPAN>
-</TABLE>
+  <table border align="center" summary="">
+    <caption>
+      <em>Symbol Table</em>
+    </caption>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Requirements on <SPAN CLASS="code">Mutex</SPAN></EM></CAPTION>
-<TR><TH>Expression<TH>Return Type<TH>Assertion/Note/Pre/Post-Condition
-<TR><TD CLASS="code">m.lock()<TD>not used<TD>Locks the mutex referred to by <SPAN CLASS="code">m</SPAN>
-<TR><TD CLASS="code">m.unlock()<TD>not used<TD>Unlocks the mutex referred to by <SPAN CLASS="code">m</SPAN>
-</TABLE>
+    <tr>
+      <th>Symbol</th>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Requirements satisfied by <SPAN CLASS="code">guard</SPAN></EM></CAPTION>
-<TR><TH>Expression<TH>Assertion/Note/Pre/Post-Condition
-<TR><TD CLASS="code">T(m)<TD>Locks the mutex referred to by <SPAN CLASS="code">m</SPAN>; binds <SPAN CLASS="code">T(m)</SPAN> to <SPAN CLASS="code">m</SPAN>
-<TR><TD CLASS="code">(&amp;g)->~T()<TD>Unlocks the mutex that <SPAN CLASS="code">g</SPAN> is bound to
-</TABLE>
+      <th>Meaning</th>
+    </tr>
 
-<P>
-<H2>Example</H2>
+    <tr>
+      <td class="code">T</td>
 
-<P>
-Given a (platform-specific) <SPAN CLASS="code">mutex</SPAN> class, we can wrap code as follows:
-<PRE CLASS="code">extern mutex global_lock;
+      <td><span class="code">guard&lt;Mutex&gt;</span></td>
+    </tr>
 
+    <tr>
+      <td class="code">m</td>
+
+      <td>value of type <span class="code">Mutex &amp;</span></td>
+    </tr>
+
+    <tr>
+      <td class="code">g</td>
+
+      <td>value of type <span class="code">guard&lt;Mutex&gt;</span></td>
+    </tr>
+  </table><br>
+
+  <table border align="center" summary="">
+    <caption>
+      <em>Requirements on <span class="code">Mutex</span></em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Return Type</th>
+
+      <th>Assertion/Note/Pre/Post-Condition</th>
+    </tr>
+
+    <tr>
+      <td class="code">m.lock()</td>
+
+      <td>not used</td>
+
+      <td>Locks the mutex referred to by <span class="code">m</span></td>
+    </tr>
+
+    <tr>
+      <td class="code">m.unlock()</td>
+
+      <td>not used</td>
+
+      <td>Unlocks the mutex referred to by <span class="code">m</span></td>
+    </tr>
+  </table><br>
+
+  <table border align="center" summary="">
+    <caption>
+      <em>Requirements satisfied by <span class="code">guard</span></em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Assertion/Note/Pre/Post-Condition</th>
+    </tr>
+
+    <tr>
+      <td class="code">T(m)</td>
+
+      <td>Locks the mutex referred to by <span class="code">m</span>; binds
+      <span class="code">T(m)</span> to <span class="code">m</span></td>
+    </tr>
+
+    <tr>
+      <td class="code">(&amp;g)-&gt;~T()</td>
+
+      <td>Unlocks the mutex that <span class="code">g</span> is bound to</td>
+    </tr>
+  </table>
+
+  <h2>Example</h2>
+
+  <p>Given a (platform-specific) <span class="code">mutex</span> class, we
+  can wrap code as follows:</p>
+  <pre class="code">
+extern mutex global_lock;
+
 static void f()
 {
   boost::details::pool::guard&lt;mutex&gt; g(global_lock);
-  // g's constructor locks &quot;global_lock&quot;
+  // g's constructor locks "global_lock"
 
   ... // do anything:
       //   throw exceptions
       //   return
       //   or just fall through
-} // g's destructor unlocks &quot;global_lock&quot;</PRE>
+} // g's destructor unlocks "global_lock"
+</pre>
 
-<P>
-<H2>Dependencies</H2>
+  <h2>Dependencies</h2>
 
-<P>
-None.
+  <p>None.</p>
 
-<P>
-<H2>Future Directions</H2>
+  <h2>Future Directions</h2>
 
-<P>
-This header will eventually be replaced by a Boost multithreading library.
+  <p>This header will eventually be replaced by a Boost multithreading
+  library.</p>
+  <hr>
 
-<P>
-<HR>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
-
-</BODY>
-</HTML>
\ No newline at end of file
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/implementation/mutex.html
===================================================================
--- boost/trunk/libs/pool/doc/implementation/mutex.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/implementation/mutex.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,31 +1,38 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>mutex - Mutex</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>mutex - Mutex</H1>
+  <title>mutex - Mutex</title>
+</head>
 
-<P>
-<H2>Introduction</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-detail/mutex.hpp provides several mutex types that provide a consistent interface for OS-supplied mutex types.  These are all thread-level mutexes; interprocess mutexes are not supported.
+  <h1 align="center">mutex - Mutex</h1>
 
-<P>
-<H2>Configuration</H2>
+  <h2>Introduction</h2>
 
-<P>
-This header file will try to guess what kind of system it is on.  It will auto-configure itself for Win32 or POSIX+pthread systems.  To stub out all mutex code, bypassing the auto-configuration, <SPAN CLASS="code">#define BOOST_NO_MT</SPAN> before any inclusion of this header.  To prevent ODR violations, this should be defined in <STRONG>every</STRONG> translation unit in your project, including any library files.
+  <p>detail/mutex.hpp provides several mutex types that provide a consistent
+  interface for OS-supplied mutex types. These are all thread-level mutexes;
+  interprocess mutexes are not supported.</p>
 
-<P>
-<H2>Synopsis</H2>
+  <h2>Configuration</h2>
 
-<PRE CLASS="code">namespace details {
+  <p>This header file will try to guess what kind of system it is on. It will
+  auto-configure itself for Win32 or POSIX+pthread systems. To stub out all
+  mutex code, bypassing the auto-configuration, <span class="code">#define
+  BOOST_NO_MT</span> before any inclusion of this header. To prevent ODR
+  violations, this should be defined in <strong>every</strong> translation
+  unit in your project, including any library files.</p>
+
+  <h2>Synopsis</h2>
+  <pre class="code">
+namespace details {
 namespace pool {
 
 // Only present if on a Win32 system
@@ -77,53 +84,99 @@
 typedef ... default_mutex;
 
 } // namespace pool
-} // namespace details</PRE>
+} // namespace details
+</pre>
 
-<P>
-<H2>Semantics</H2>
+  <h2>Semantics</h2>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Symbol Table</EM></CAPTION>
-<TR><TH>Symbol<TH>Meaning
-<TR><TD CLASS="code">Mutex<TD>Any type defined in this header
-<TR><TD CLASS="code">t<TD>value of type <SPAN CLASS="code">Mutex</SPAN>
-</TABLE>
+  <table border align="center" summary="">
+    <caption>
+      <em>Symbol Table</em>
+    </caption>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Requirements satisfied by <SPAN CLASS="code">mutex</SPAN></EM></CAPTION>
-<TR><TH>Expression<TH>Return Type<TH>Assertion/Note/Pre/Post-Condition
-<TR><TD CLASS="code">m.lock()<TD>not used<TD>Locks the mutex
-<TR><TD CLASS="code">m.unlock()<TD>not used<TD>Unlocks the mutex
-</TABLE>
+    <tr>
+      <th>Symbol</th>
 
-<P>
-Each mutex is always either owned or unowned.  If owned, then it is owned by a particular thread.  To &quot;lock&quot; a mutex means to wait until the mutex is unowned, and then make it owned by the current thread.  To &quot;unlock&quot; a mutex means to release ownership from the current thread (note that the current thread <STRONG>must</STRONG> own the mutex to release that ownership!).  As a special case, the <SPAN CLASS="code">null_mutex</SPAN> never waits.
+      <th>Meaning</th>
+    </tr>
 
-<P>
-<H2>Dependencies</H2>
+    <tr>
+      <td class="code">Mutex</td>
 
-<P>
-May include the system headers <SPAN CLASS="code">&lt;windows.h&gt;</SPAN>, <SPAN CLASS="code">&lt;unistd.h&gt;</SPAN>, and/or <SPAN CLASS="code">&lt;pthread.h&gt;</SPAN>.
+      <td>Any type defined in this header</td>
+    </tr>
 
-<P>
-<H2>Future Directions</H2>
+    <tr>
+      <td class="code">t</td>
 
-<P>
-This header will eventually be replaced by a Boost multithreading library.
+      <td>value of type <span class="code">Mutex</span></td>
+    </tr>
+  </table><br>
 
-<P>
-<HR>
+  <table border align="center" summary="">
+    <caption>
+      <em>Requirements satisfied by <span class="code">mutex</span></em>
+    </caption>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+    <tr>
+      <th>Expression</th>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+      <th>Return Type</th>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+      <th>Assertion/Note/Pre/Post-Condition</th>
+    </tr>
 
-</BODY>
-</HTML>
\ No newline at end of file
+    <tr>
+      <td class="code">m.lock()</td>
+
+      <td>not used</td>
+
+      <td>Locks the mutex</td>
+    </tr>
+
+    <tr>
+      <td class="code">m.unlock()</td>
+
+      <td>not used</td>
+
+      <td>Unlocks the mutex</td>
+    </tr>
+  </table>
+
+  <p>Each mutex is always either owned or unowned. If owned, then it is owned
+  by a particular thread. To "lock" a mutex means to wait until the mutex is
+  unowned, and then make it owned by the current thread. To "unlock" a mutex
+  means to release ownership from the current thread (note that the current
+  thread <strong>must</strong> own the mutex to release that ownership!). As
+  a special case, the <span class="code">null_mutex</span> never waits.</p>
+
+  <h2>Dependencies</h2>
+
+  <p>May include the system headers <span class=
+  "code">&lt;windows.h&gt;</span>, <span class=
+  "code">&lt;unistd.h&gt;</span>, and/or <span class=
+  "code">&lt;pthread.h&gt;</span>.</p>
+
+  <h2>Future Directions</h2>
+
+  <p>This header will eventually be replaced by a Boost multithreading
+  library.</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/implementation/object_pool.html
===================================================================
--- boost/trunk/libs/pool/doc/implementation/object_pool.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/implementation/object_pool.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,70 +1,85 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>Object Pool Implementation</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>Object Pool Implementation</H1>
+  <title>Object Pool Implementation</title>
+</head>
 
-<P>
-<H2>Dependencies</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-Includes the Boost header <SPAN CLASS="code">&quot;pool.hpp&quot;</SPAN> (see <A HREF="pool.html">pool.html</A>).
+  <h1 align="center">Object Pool Implementation</h1>
 
-<P>
-<H2>Extensions to Public Interface</H2>
+  <h2>Dependencies</h2>
 
-<P>
-Whenever an object of type <SPAN CLASS="code">ObjectPool</SPAN> needs memory from the system, it will request it from its <SPAN CLASS="code">UserAllocator</SPAN> template parameter.  The amount requested is determined using a doubling algorithm; that is, each time more system memory is allocated, the amount of system memory requested is doubled.  Users may control the doubling algorithm by using the following extensions.
+  <p>Includes the Boost header <span class="code">"pool.hpp"</span> (see
+  <a href="pool.html">pool.html</a>).</p>
 
-<P>
-<H3>Additional constructor parameter</H3>
+  <h2>Extensions to Public Interface</h2>
 
-<P>
-Users may pass an additional constructor parameter to <SPAN CLASS="code">ObjectPool</SPAN>.  This parameter is of type <SPAN CLASS="code">size_type</SPAN>, and is the number of chunks to request from the system the first time that object needs to allocate system memory.  The default is 32.  This parameter may not be 0.
+  <p>Whenever an object of type <span class="code">ObjectPool</span> needs
+  memory from the system, it will request it from its <span class=
+  "code">UserAllocator</span> template parameter. The amount requested is
+  determined using a doubling algorithm; that is, each time more system
+  memory is allocated, the amount of system memory requested is doubled.
+  Users may control the doubling algorithm by using the following
+  extensions.</p>
 
-<P>
-<H3><SPAN CLASS="code">next_size</SPAN> accessor functions</H3>
+  <h3>Additional constructor parameter</h3>
 
-<P>
-The pair of functions <SPAN CLASS="code">size_type get_next_size() const;</SPAN> and <SPAN CLASS="code">void set_next_size(size_type);</SPAN> allow users to explicitly read and write the <SPAN CLASS="code">next_size</SPAN> value.  This value is the number of chunks to request from the system the next time that object needs to allocate system memory.  This value should never be set to 0.
+  <p>Users may pass an additional constructor parameter to <span class=
+  "code">ObjectPool</span>. This parameter is of type <span class=
+  "code">size_type</span>, and is the number of chunks to request from the
+  system the first time that object needs to allocate system memory. The
+  default is 32. This parameter may not be 0.</p>
 
-<P>
-<H2>Protected Interface</H2>
+  <h3><span class="code">next_size</span> accessor functions</h3>
 
-<P>
-<H3>Synopsis</H3>
+  <p>The pair of functions <span class="code">size_type get_next_size()
+  const;</span> and <span class="code">void set_next_size(size_type);</span>
+  allow users to explicitly read and write the <span class=
+  "code">next_size</span> value. This value is the number of chunks to
+  request from the system the next time that object needs to allocate system
+  memory. This value should never be set to 0.</p>
 
-<PRE CLASS="code">template &lt;typename ElementType, typename UserAllocator = default_user_allocator_new_delete&gt;
+  <h2>Protected Interface</h2>
+
+  <h3>Synopsis</h3>
+  <pre class="code">
+template &lt;typename ElementType, typename UserAllocator = default_user_allocator_new_delete&gt;
 class object_pool: protected pool&lt;UserAllocator&gt;
 {
   ... // public interface
-};</PRE>
+};
+</pre>
 
-<P>
-<H3>Protected Derivation</H3>
+  <h3>Protected Derivation</h3>ObjectPool derives from a simple segregated
+  storage via protected derivation; this exposes all the <a href=
+  "pool.html">Pool implementation details</a> to all classes derived from
+  ObjectPool as well.
 
-ObjectPool derives from a simple segregated storage via protected derivation; this exposes all the <A HREF="pool.html">Pool implementation details</A> to all classes derived from ObjectPool as well.
+  <h2><a href="../interfaces/object_pool.html">Interface Description</a></h2>
+  <hr>
 
-<P>
-<H2><A HREF="../interfaces/object_pool.html">Interface Description</A></H2>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<P>
-<HR>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
-
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
-
-</BODY>
-</HTML>
\ No newline at end of file
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/implementation/pool.html
===================================================================
--- boost/trunk/libs/pool/doc/implementation/pool.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/implementation/pool.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,29 +1,40 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>Pool Implementation</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>Pool Implementation</H1>
+  <title>Pool Implementation</title>
+</head>
 
-<P>
-<H2>Dependencies</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-Includes the system headers <SPAN CLASS="code">&lt;functional&gt;</SPAN>, <SPAN CLASS="code">&lt;new&gt;</SPAN>, <SPAN CLASS="code">&lt;cstddef&gt;</SPAN>, <SPAN CLASS="code">&lt;cstdlib&gt;</SPAN>, and <SPAN CLASS="code">&lt;exception&gt;</SPAN>.
+  <h1 align="center">Pool Implementation</h1>
 
-<P>
-Includes the Boost headers <SPAN CLASS="code">&quot;detail/ct_gcd_lcm.hpp&quot;</SPAN> (see <A HREF="ct_gcd_lcm.html">ct_gcd_lcm.html</A>), <SPAN CLASS="code">&quot;detail/gcd_lcm.hpp&quot;</SPAN> (see <A HREF="gcd_lcm.html">gcd_lcm.html</A>), and <SPAN CLASS="code">&quot;simple_segregated_storage.hpp&quot;</SPAN> (see <A HREF="simple_segregated_storage.html">simple_segregated_storage.html</A>).
+  <h2>Dependencies</h2>
 
-<P>
-<H2>Synopsis</H2>
+  <p>Includes the system headers <span class=
+  "code">&lt;functional&gt;</span>, <span class="code">&lt;new&gt;</span>,
+  <span class="code">&lt;cstddef&gt;</span>, <span class=
+  "code">&lt;cstdlib&gt;</span>, and <span class=
+  "code">&lt;exception&gt;</span>.</p>
 
-<PRE CLASS="code">namespace details {
+  <p>Includes the Boost headers <span class=
+  "code">"detail/ct_gcd_lcm.hpp"</span> (see <a href=
+  "ct_gcd_lcm.html">ct_gcd_lcm.html</a>), <span class=
+  "code">"detail/gcd_lcm.hpp"</span> (see <a href=
+  "gcd_lcm.html">gcd_lcm.html</a>), and <span class=
+  "code">"simple_segregated_storage.hpp"</span> (see <a href=
+  "simple_segregated_storage.html">simple_segregated_storage.html</a>).</p>
 
+  <h2>Synopsis</h2>
+  <pre class="code">
+namespace details {
+
 template &lt;typename SizeType&gt;
 class PODptr
 {
@@ -37,17 +48,17 @@
 
     bool valid() const;
     void invalidate();
-    char * & begin();
+    char * &amp; begin();
     char * begin() const;
     char * end() const;
     size_type total_size() const;
     size_type element_size() const;
 
-    size_type & next_size() const;
-    char * & next_ptr() const;
+    size_type &amp; next_size() const;
+    char * &amp; next_ptr() const;
 
     PODptr next() const;
-    void next(const PODptr & arg) const;
+    void next(const PODptr &amp; arg) const;
 };
 
 } // namespace details
@@ -60,8 +71,8 @@
   protected:
     details::PODptr&lt;size_type&gt; list;
 
-    simple_segregated_storage&lt;size_type&gt; & store();
-    const simple_segregated_storage&lt;size_type&gt; & store() const;
+    simple_segregated_storage&lt;size_type&gt; &amp; store();
+    const simple_segregated_storage&lt;size_type&gt; &amp; store() const;
 
     const size_type requested_size;
     size_type next_size;
@@ -74,143 +85,201 @@
     pool(size_type requested_size, size_type next_size);
     size_type get_next_size() const;
     void set_next_size(size_type);
-};</PRE>
+};
+</pre>
 
-<P>
-<H2>Extensions to Public Interface</H2>
+  <h2>Extensions to Public Interface</h2>
 
-<P>
-Whenever an object of type <SPAN CLASS="code">pool</SPAN> needs memory from the system, it will request it from its <SPAN CLASS="code">UserAllocator</SPAN> template parameter.  The amount requested is determined using a doubling algorithm; that is, each time more system memory is allocated, the amount of system memory requested is doubled.  Users may control the doubling algorithm by using the following extensions.
+  <p>Whenever an object of type <span class="code">pool</span> needs memory
+  from the system, it will request it from its <span class=
+  "code">UserAllocator</span> template parameter. The amount requested is
+  determined using a doubling algorithm; that is, each time more system
+  memory is allocated, the amount of system memory requested is doubled.
+  Users may control the doubling algorithm by using the following
+  extensions.</p>
 
-<P>
-<H3>Additional constructor parameter</H3>
+  <h3>Additional constructor parameter</h3>
 
-<P>
-Users may pass an additional constructor parameter to <SPAN CLASS="code">pool</SPAN>.  This parameter is of type <SPAN CLASS="code">size_type</SPAN>, and is the number of chunks to request from the system the first time that object needs to allocate system memory.  The default is 32.  This parameter may not be 0.
+  <p>Users may pass an additional constructor parameter to <span class=
+  "code">pool</span>. This parameter is of type <span class=
+  "code">size_type</span>, and is the number of chunks to request from the
+  system the first time that object needs to allocate system memory. The
+  default is 32. This parameter may not be 0.</p>
 
-<P>
-<H3><SPAN CLASS="code">next_size</SPAN> accessor functions</H3>
+  <h3><span class="code">next_size</span> accessor functions</h3>
 
-<P>
-The pair of functions <SPAN CLASS="code">size_type get_next_size() const;</SPAN> and <SPAN CLASS="code">void set_next_size(size_type);</SPAN> allow users to explicitly read and write the <SPAN CLASS="code">next_size</SPAN> value.  This value is the number of chunks to request from the system the next time that object needs to allocate system memory.  This value should never be set to 0.
+  <p>The pair of functions <span class="code">size_type get_next_size()
+  const;</span> and <span class="code">void set_next_size(size_type);</span>
+  allow users to explicitly read and write the <span class=
+  "code">next_size</span> value. This value is the number of chunks to
+  request from the system the next time that object needs to allocate system
+  memory. This value should never be set to 0.</p>
 
-<P>
-<H2>Class <SPAN CLASS="code">PODptr</SPAN></H2>
+  <h2>Class <span class="code">PODptr</span></h2>
 
-<P>
-<SPAN CLASS="code">PODptr</SPAN> is a class that pretends to be a &quot;pointer&quot; to different class types that don't really exist.  It provides member functions to access the &quot;data&quot; of the &quot;object&quot; it points to.  Since these &quot;class&quot; types are of differing sizes, and contain some information at the end of their memory (for alignment reasons), <SPAN CLASS="code">PODptr</SPAN> must contain the size of this &quot;class&quot; as well as the pointer to this &quot;object&quot;.
+  <p><span class="code">PODptr</span> is a class that pretends to be a
+  "pointer" to different class types that don't really exist. It provides
+  member functions to access the "data" of the "object" it points to. Since
+  these "class" types are of differing sizes, and contain some information at
+  the end of their memory (for alignment reasons), <span class=
+  "code">PODptr</span> must contain the size of this "class" as well as the
+  pointer to this "object".</p>
 
-<P>
-A <SPAN CLASS="code">PODptr</SPAN> holds the location and size of a memory block allocated from the system.  Each memory block is split logically into three sections:
-<OL>
-<LI>Chunk area.  This section may be different sizes.  <SPAN CLASS="code">PODptr</SPAN> does not care what the size of the chunks is, but it does care (and keep track of) the total size of the chunk area.</LI>
-<LI>Next pointer.  This section is always the same size for a given <SPAN CLASS="code">SizeType</SPAN>.  It holds a pointer to the location of the next memory block in the memory block list, or 0 if there is no such block.</LI>
-<LI>Next size.  This section is always the same size for a given <SPAN CLASS="code">SizeType</SPAN>.  It holds the size of the next memory block in the memory block list.</LI>
-</OL>
+  <p>A <span class="code">PODptr</span> holds the location and size of a
+  memory block allocated from the system. Each memory block is split
+  logically into three sections:</p>
 
-<P>
-The <SPAN CLASS="code">PODptr</SPAN> class just provides cleaner ways of dealing with raw memory blocks.
+  <ol>
+    <li>Chunk area. This section may be different sizes. <span class=
+    "code">PODptr</span> does not care what the size of the chunks is, but it
+    does care (and keep track of) the total size of the chunk area.</li>
 
-<P>
-<H3>Validity</H3>
+    <li>Next pointer. This section is always the same size for a given
+    <span class="code">SizeType</span>. It holds a pointer to the location of
+    the next memory block in the memory block list, or 0 if there is no such
+    block.</li>
 
-<P>
-A <SPAN CLASS="code">PODptr</SPAN> object is either <EM>valid</EM> or <EM>invalid</EM>.  An invalid <SPAN CLASS="code">PODptr</SPAN> is analogous to a null pointer.
+    <li>Next size. This section is always the same size for a given
+    <span class="code">SizeType</span>. It holds the size of the next memory
+    block in the memory block list.</li>
+  </ol>
 
-<P>
-The default constructor for <SPAN CLASS="code">PODptr</SPAN> will result in an invalid object.  Calling the member function <SPAN CLASS="code">invalidate</SPAN> will result in that object becoming invalid.  The member function <SPAN CLASS="code">valid</SPAN> can be used to test for validity.
+  <p>The <span class="code">PODptr</span> class just provides cleaner ways of
+  dealing with raw memory blocks.</p>
 
-<P>
-<H3>Getting <SPAN CLASS="code">PODptr</SPAN> objects</H3>
+  <h3>Validity</h3>
 
-<P>
-A <SPAN CLASS="code">PODptr</SPAN> may be created to point to a memory block by passing the address and size of that memory block into the constructor.  A <SPAN CLASS="code">PODptr</SPAN> constructed in this way is valid.  
+  <p>A <span class="code">PODptr</span> object is either <em>valid</em> or
+  <em>invalid</em>. An invalid <span class="code">PODptr</span> is analogous
+  to a null pointer.</p>
 
-<P>
-A <SPAN CLASS="code">PODptr</SPAN> may also be created by a call to the member function <SPAN CLASS="code">next</SPAN>, which returns a <SPAN CLASS="code">PODptr</SPAN> which points to the next memory block in the memory block list, or an invalid <SPAN CLASS="code">PODptr</SPAN> if there is no such block.
+  <p>The default constructor for <span class="code">PODptr</span> will result
+  in an invalid object. Calling the member function <span class=
+  "code">invalidate</span> will result in that object becoming invalid. The
+  member function <span class="code">valid</span> can be used to test for
+  validity.</p>
 
-<P>
-<H3>Accessing the &quot;pointer&quot; data</H3>
+  <h3>Getting <span class="code">PODptr</span> objects</h3>
 
-<P>
-Each <SPAN CLASS="code">PODptr</SPAN> keeps the address and size of its memory block.  The address may be read or written by the member functions <SPAN CLASS="code">begin</SPAN>.  The size of the memory block may only be read, and is done so by the member function <SPAN CLASS="code">total_size</SPAN>.
+  <p>A <span class="code">PODptr</span> may be created to point to a memory
+  block by passing the address and size of that memory block into the
+  constructor. A <span class="code">PODptr</span> constructed in this way is
+  valid.</p>
 
-<P>
-<H3>Accessing the sections of the memory block</H3>
+  <p>A <span class="code">PODptr</span> may also be created by a call to the
+  member function <span class="code">next</span>, which returns a
+  <span class="code">PODptr</span> which points to the next memory block in
+  the memory block list, or an invalid <span class="code">PODptr</span> if
+  there is no such block.</p>
 
-<P>
-The chunk area may be accessed by the member functions <SPAN CLASS="code">begin</SPAN> and <SPAN CLASS="code">end</SPAN>, in conjunction with <SPAN CLASS="code">element_size</SPAN>.  The value returned by <SPAN CLASS="code">end</SPAN> is always the value returned by <SPAN CLASS="code">begin</SPAN> plus <SPAN CLASS="code">element_size</SPAN>.  Only <SPAN CLASS="code">begin</SPAN> is writeable.  <SPAN CLASS="code">end</SPAN> is a past-the-end value; using pointers beginning at <SPAN CLASS="code">begin</SPAN> and ending before <SPAN CLASS="code">end</SPAN> allows one to iterate through the chunks in a memory block.
+  <h3>Accessing the "pointer" data</h3>
 
-<P>
-The next pointer area may be accessed by the member function <SPAN CLASS="code">next_ptr</SPAN>.  The next size area may be accessed by the member function <SPAN CLASS="code">next_size</SPAN>.  Both of these are writeable.  They may both be read or set at the same time through the member function <SPAN CLASS="code">next</SPAN>.
+  <p>Each <span class="code">PODptr</span> keeps the address and size of its
+  memory block. The address may be read or written by the member functions
+  <span class="code">begin</span>. The size of the memory block may only be
+  read, and is done so by the member function <span class=
+  "code">total_size</span>.</p>
 
-<P>
-<H2>Protected Interface</H2>
+  <h3>Accessing the sections of the memory block</h3>
 
-<P>
-<H3>Protected Derivation</H3>
+  <p>The chunk area may be accessed by the member functions <span class=
+  "code">begin</span> and <span class="code">end</span>, in conjunction with
+  <span class="code">element_size</span>. The value returned by <span class=
+  "code">end</span> is always the value returned by <span class=
+  "code">begin</span> plus <span class="code">element_size</span>. Only
+  <span class="code">begin</span> is writeable. <span class="code">end</span>
+  is a past-the-end value; using pointers beginning at <span class=
+  "code">begin</span> and ending before <span class="code">end</span> allows
+  one to iterate through the chunks in a memory block.</p>
 
-Pool derives from a simple segregated storage via protected derivation; this exposes all the <A HREF="simple_segregated_storage.html">simple segregated storage implementation details</A> to all classes derived from Pool as well.
+  <p>The next pointer area may be accessed by the member function
+  <span class="code">next_ptr</span>. The next size area may be accessed by
+  the member function <span class="code">next_size</span>. Both of these are
+  writeable. They may both be read or set at the same time through the member
+  function <span class="code">next</span>.</p>
 
-<P>
-<H3 CLASS="code">details::PODptr&lt;size_type&gt; list;</H3>
+  <h2>Protected Interface</h2>
 
-<P>
-This is the list of memory blocks that have been allocated by this Pool object.  It is <STRONG>not</STRONG> the same as the list of free memory chunks (exposed by simple segregated storage as <SPAN CLASS="code">first</SPAN>).
+  <h3>Protected Derivation</h3>Pool derives from a simple segregated storage
+  via protected derivation; this exposes all the <a href=
+  "simple_segregated_storage.html">simple segregated storage implementation
+  details</a> to all classes derived from Pool as well.
 
-<P>
-<H3><SPAN CLASS="code">store</SPAN> functions</H3>
+  <h3 class="code">details::PODptr&lt;size_type&gt; list;</h3>
 
-<P>
-These are convenience functions, used to return the base simple segregated storage object.
+  <p>This is the list of memory blocks that have been allocated by this Pool
+  object. It is <strong>not</strong> the same as the list of free memory
+  chunks (exposed by simple segregated storage as <span class=
+  "code">first</span>).</p>
 
-<P>
-<H3 CLASS="code">const size_type requested_size;</H3>
+  <h3><span class="code">store</span> functions</h3>
 
-<P>
-The first argument passed into the constructor.  Represents the number of bytes in each chunk requested by the user.  The actual size of the chunks may be different; see <SPAN CLASS="code">alloc_size</SPAN>, below.
+  <p>These are convenience functions, used to return the base simple
+  segregated storage object.</p>
 
-<P>
-<H3 CLASS="code">size_type next_size</H3>
+  <h3 class="code">const size_type requested_size;</h3>
 
-<P>
-The number of chunks to request from the <SPAN CLASS="code">UserAllocator</SPAN> the next time we need to allocate system memory.  See the extensions descriptions, above.
+  <p>The first argument passed into the constructor. Represents the number of
+  bytes in each chunk requested by the user. The actual size of the chunks
+  may be different; see <span class="code">alloc_size</span>, below.</p>
 
-<P>
-<H3 CLASS="code">details::PODptr&lt;size_type&gt; find_POD(void * chunk) const;</H3>
+  <h3 class="code">size_type next_size</h3>
 
-<P>
-Searches through the memory block list, looking for the block that <SPAN CLASS="code">chunk</SPAN> was allocated from or may be allocated from in the future.  Returns that block if found, or an invalid value if <SPAN CLASS="code">chunk</SPAN> has been allocated from another Pool or may be allocated from another Pool in the future.  Results for other values of <SPAN CLASS="code">chunk</SPAN> may be wrong.
+  <p>The number of chunks to request from the <span class=
+  "code">UserAllocator</span> the next time we need to allocate system
+  memory. See the extensions descriptions, above.</p>
 
-<P>
-<H3 CLASS="code">static bool is_from(void * chunk, char * i, size_type sizeof_i);</H3>
+  <h3 class="code">details::PODptr&lt;size_type&gt; find_POD(void * chunk)
+  const;</h3>
 
-<P>
-Tests <SPAN CLASS="code">chunk</SPAN> to see if it has been allocated from the memory chunk at <SPAN CLASS="code">i</SPAN> with an element size of <SPAN CLASS="code">sizeof_i</SPAN>.  Note that <SPAN CLASS="code">sizeof_i</SPAN> is the size of the chunk area of that block, not the total size of that block.
+  <p>Searches through the memory block list, looking for the block that
+  <span class="code">chunk</span> was allocated from or may be allocated from
+  in the future. Returns that block if found, or an invalid value if
+  <span class="code">chunk</span> has been allocated from another Pool or may
+  be allocated from another Pool in the future. Results for other values of
+  <span class="code">chunk</span> may be wrong.</p>
 
-<P>
-Returns <SPAN CLASS="code">true</SPAN> if <SPAN CLASS="code">chunk</SPAN> has been allocated from that memory block or may be allocated from that block in the future.  Returns <SPAN CLASS="code">false</SPAN> if <SPAN CLASS="code">chunk</SPAN> has been allocated from another block or may be allocated from another block in the future.  Results for other values of <SPAN CLASS="code">chunk</SPAN> may be wrong.
+  <h3 class="code">static bool is_from(void * chunk, char * i, size_type
+  sizeof_i);</h3>
 
-<P>
-<H3 CLASS="code">size_type alloc_size() const;</H3>
+  <p>Tests <span class="code">chunk</span> to see if it has been allocated
+  from the memory chunk at <span class="code">i</span> with an element size
+  of <span class="code">sizeof_i</span>. Note that <span class=
+  "code">sizeof_i</span> is the size of the chunk area of that block, not the
+  total size of that block.</p>
 
-<P>
-Returns the calculated size of the memory chunks that will be allocated by this Pool.  For <A HREF="alignment.html">alignment reasons</A>, this is defined to be <SPAN CLASS="code">lcm(requested_size, sizeof(void *), sizeof(size_type))</SPAN>.
+  <p>Returns <span class="code">true</span> if <span class=
+  "code">chunk</span> has been allocated from that memory block or may be
+  allocated from that block in the future. Returns <span class=
+  "code">false</span> if <span class="code">chunk</span> has been allocated
+  from another block or may be allocated from another block in the future.
+  Results for other values of <span class="code">chunk</span> may be
+  wrong.</p>
 
-<P>
-<H2><A HREF="../interfaces/pool.html">Interface Description</A></H2>
+  <h3 class="code">size_type alloc_size() const;</h3>
 
-<P>
-<HR>
+  <p>Returns the calculated size of the memory chunks that will be allocated
+  by this Pool. For <a href="alignment.html">alignment reasons</a>, this is
+  defined to be <span class="code">lcm(requested_size, sizeof(void *),
+  sizeof(size_type))</span>.</p>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+  <h2><a href="../interfaces/pool.html">Interface Description</a></h2>
+  <hr>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
 
-</BODY>
-</HTML>
\ No newline at end of file
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/implementation/pool_alloc.html
===================================================================
--- boost/trunk/libs/pool/doc/implementation/pool_alloc.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/implementation/pool_alloc.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,28 +1,35 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>pool_alloc - Boost Pool Standard Allocators Implementation</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>pool_alloc - Boost Pool Standard Allocators Implementation</H1>
+  <title>pool_alloc - Boost Pool Standard Allocators Implementation</title>
+</head>
 
-<P>
-<H2>Dependencies</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-Includes the system headers <SPAN CLASS="code">&lt;new&gt;</SPAN> and <SPAN CLASS="code">&lt;limits&gt;</SPAN>.
+  <h1 align="center">pool_alloc - Boost Pool Standard Allocators
+  Implementation</h1>
 
-<P>
-Includes the Boost headers <SPAN CLASS="code">&quot;singleton_pool.hpp&quot;</SPAN> (see <A HREF="singleton_pool.html">singleton_pool.html</A>) and <SPAN CLASS="code">&quot;detail/mutex.hpp&quot;</SPAN> (see <A HREF="mutex.html">mutex.html</A>).
+  <h2>Dependencies</h2>
 
-<P>
-<H2>Synopsis</H2>
+  <p>Includes the system headers <span class="code">&lt;new&gt;</span> and
+  <span class="code">&lt;limits&gt;</span>.</p>
 
-<PRE CLASS="code">template &lt;typename T,
+  <p>Includes the Boost headers <span class=
+  "code">"singleton_pool.hpp"</span> (see <a href=
+  "singleton_pool.html">singleton_pool.html</a>) and <span class=
+  "code">"detail/mutex.hpp"</span> (see <a href=
+  "mutex.html">mutex.html</a>).</p>
+
+  <h2>Synopsis</h2>
+  <pre class="code">
+template &lt;typename T,
     typename UserAllocator = default_user_allocator_new_delete,
     typename Mutex = details::pool::default_mutex,
     unsigned NextSize = 32&gt;
@@ -60,68 +67,77 @@
     {
       typedef fast_pool_allocator&lt;U, UserAllocator, Mutex, NextSize&gt; other;
     };
-};</PRE>
+};
+</pre>
 
-<P>
-<H2>Extensions to Public Interface</H2>
+  <h2>Extensions to Public Interface</h2>
 
-<P>
-<H3>Additional template parameters</H3>
+  <h3>Additional template parameters</h3>
 
-<P>
-<H4 CLASS="code">Mutex</H4>
+  <h4 class="code">Mutex</h4>
 
-<P>
-This parameter allows the user to determine the type of synchronization to be used on the underlying singleton pool.  See the extensions to the public interface of <A HREF="singleton_pool.html">singleton pool</A> for more information.
+  <p>This parameter allows the user to determine the type of synchronization
+  to be used on the underlying singleton pool. See the extensions to the
+  public interface of <a href="singleton_pool.html">singleton pool</a> for
+  more information.</p>
 
-<P>
-<H4 CLASS="code">NextSize</H4>
+  <h4 class="code">NextSize</h4>
 
-<P>
-The value of this parameter is passed to the underlying Pool when it is created.  See the extensions to the public interface of <A HREF="pool.html">pool</A> for more information.
+  <p>The value of this parameter is passed to the underlying Pool when it is
+  created. See the extensions to the public interface of <a href=
+  "pool.html">pool</a> for more information.</p>
 
-<P>
-<H3>Modification of <SPAN CLASS="code">rebind</SPAN></H3>
+  <h3>Modification of <span class="code">rebind</span></h3>
 
-<P>
-The struct <SPAN CLASS="code">rebind</SPAN> has been redefined to preserve the values of the additional template parameters.
+  <p>The struct <span class="code">rebind</span> has been redefined to
+  preserve the values of the additional template parameters.</p>
 
-<P>
-<H3>Additional members</H3>
+  <h3>Additional members</h3>
 
-<P>
-The typedef <SPAN CLASS="code">mutex</SPAN> and the static const value <SPAN CLASS="code">next_size</SPAN> publish the values of the template parameters <SPAN CLASS="code">Mutex</SPAN> and <SPAN CLASS="code">NextSize</SPAN>, respectively.
+  <p>The typedef <span class="code">mutex</span> and the static const value
+  <span class="code">next_size</span> publish the values of the template
+  parameters <span class="code">Mutex</span> and <span class=
+  "code">NextSize</span>, respectively.</p>
 
-<P>
-<H2>Notes</H2>
+  <h2>Notes</h2>
 
-<P>
-A number of common STL libraries contain bugs in their using of allocators.  Specifically, they pass null pointers to the <SPAN CLASS="code">deallocate</SPAN> function, which is explicitly forbidden by the Standard [20.1.5 Table 32].  PoolAlloc will work around these libraries if it detects them; currently, workarounds are in place for:
-<UL>
-<LI>Borland C++ (Builder and command-line compiler) with default (RogueWave) library, ver. 5 and earlier</LI>
-<LI>STLport (with any compiler), ver. 4.0 and earlier</LI>
-</UL>
+  <p>A number of common STL libraries contain bugs in their using of
+  allocators. Specifically, they pass null pointers to the <span class=
+  "code">deallocate</span> function, which is explicitly forbidden by the
+  Standard [20.1.5 Table 32]. PoolAlloc will work around these libraries if
+  it detects them; currently, workarounds are in place for:</p>
 
-<P>
-<H2>Future Directions</H2>
+  <ul>
+    <li>Borland C++ (Builder and command-line compiler) with default
+    (RogueWave) library, ver. 5 and earlier</li>
 
-<P>
-When the Boost multithreading library is completed, the <SPAN CLASS="code">Mutex</SPAN> parameter will be replaced by something from that library providing the same flexibility and will move from an implementation detail into the interface specification.
+    <li>STLport (with any compiler), ver. 4.0 and earlier</li>
+  </ul>
 
-<P>
-<H2><A HREF="../interfaces/pool_alloc.html">Interface Description</A></H2>
+  <h2>Future Directions</h2>
 
-<P>
-<HR>
+  <p>When the Boost multithreading library is completed, the <span class=
+  "code">Mutex</span> parameter will be replaced by something from that
+  library providing the same flexibility and will move from an implementation
+  detail into the interface specification.</p>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+  <h2><a href="../interfaces/pool_alloc.html">Interface Description</a></h2>
+  <hr>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
 
-</BODY>
-</HTML>
\ No newline at end of file
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/implementation/pool_construct.html
===================================================================
--- boost/trunk/libs/pool/doc/implementation/pool_construct.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/implementation/pool_construct.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,62 +1,83 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>Object Pool Constructors Generator</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>Object Pool Constructors Generator</H1>
+  <title>Object Pool Constructors Generator</title>
+</head>
 
-<P>
-<H2>Description</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-The template class <SPAN CLASS="code">object_pool</SPAN> (see <A HREF="object_pool.html">object_pool.html</A>) contains a number of functions <SPAN CLASS="code">construct(..)</SPAN>, which both allocate and construct an object in a single operation.
+  <h1 align="center">Object Pool Constructors Generator</h1>
 
-<P>
-Since the number and type of arguments to this function is totally arbitrary, a simple system has been set up to automatically generate template <SPAN CLASS="code">construct</SPAN> functions.  This system is based on the macro preprocessor <STRONG>m4</STRONG>, which is standard on UNIX systems and also available for Win32 systems.
+  <h2>Description</h2>
 
-<P>
-detail/pool_construct.m4, when run with <STRONG>m4</STRONG>, will create the file detail/pool_construct.inc, which only defines the <SPAN CLASS="code">construct</SPAN> functions for the proper number of arguments.  The number of arguments may be passed into the file as an m4 macro, <SPAN CLASS="code">NumberOfArguments</SPAN>; if not provided, it will default to <SPAN CLASS="code">3</SPAN>.
+  <p>The template class <span class="code">object_pool</span> (see <a href=
+  "object_pool.html">object_pool.html</a>) contains a number of functions
+  <span class="code">construct(..)</span>, which both allocate and construct
+  an object in a single operation.</p>
 
-<P>
-For each different number of arguments (<SPAN CLASS="code">1</SPAN> to <SPAN CLASS="code">NumberOfArguments</SPAN>), a template function is generated.  There are the same number of template parameters as there are arguments, and each argument's type is a reference to that (possibly cv-qualified) template argument.  Each possible permutation of the cv-qualifications is also generated.
+  <p>Since the number and type of arguments to this function is totally
+  arbitrary, a simple system has been set up to automatically generate
+  template <span class="code">construct</span> functions. This system is
+  based on the macro preprocessor <strong>m4</strong>, which is standard on
+  UNIX systems and also available for Win32 systems.</p>
 
-<P>
-Because each permutation is generated for each possible number of arguments, the included file size grows exponentially in terms of the number of constructor arguments, not linearly.  For the sake of rational compile times, only use as many arguments as you need.
+  <p>detail/pool_construct.m4, when run with <strong>m4</strong>, will create
+  the file detail/pool_construct.inc, which only defines the <span class=
+  "code">construct</span> functions for the proper number of arguments. The
+  number of arguments may be passed into the file as an m4 macro,
+  <span class="code">NumberOfArguments</span>; if not provided, it will
+  default to <span class="code">3</span>.</p>
 
-<P>
-detail/pool_construct.bat and detail/pool_construct.sh are also provided to call <STRONG>m4</STRONG>, defining <SPAN CLASS="code">NumberOfArguments</SPAN> to be their command-line parameter.  See these files for more details.
+  <p>For each different number of arguments (<span class="code">1</span> to
+  <span class="code">NumberOfArguments</span>), a template function is
+  generated. There are the same number of template parameters as there are
+  arguments, and each argument's type is a reference to that (possibly
+  cv-qualified) template argument. Each possible permutation of the
+  cv-qualifications is also generated.</p>
 
-<P>
-<H2>Dependencies</H2>
+  <p>Because each permutation is generated for each possible number of
+  arguments, the included file size grows exponentially in terms of the
+  number of constructor arguments, not linearly. For the sake of rational
+  compile times, only use as many arguments as you need.</p>
 
-<P>
-Dependent on for.m4 (see <A HREF="for.html">for.html</A>).
+  <p>detail/pool_construct.bat and detail/pool_construct.sh are also provided
+  to call <strong>m4</strong>, defining <span class=
+  "code">NumberOfArguments</span> to be their command-line parameter. See
+  these files for more details.</p>
 
-<P>
-<H2>Future Directions</H2>
+  <h2>Dependencies</h2>
 
-<P>
-This system may be complemented by or replaced by a Python (or some other language) script.
+  <p>Dependent on for.m4 (see <a href="for.html">for.html</a>).</p>
 
-<P>
-<H2><A HREF="../interfaces/object_pool.html">Interface Description</A></H2>
+  <h2>Future Directions</h2>
 
-<P>
-<HR>
+  <p>This system may be complemented by or replaced by a Python (or some
+  other language) script.</p>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+  <h2><a href="../interfaces/object_pool.html">Interface Description</a></h2>
+  <hr>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
 
-</BODY>
-</HTML>
\ No newline at end of file
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/implementation/simple_segregated_storage.html
===================================================================
--- boost/trunk/libs/pool/doc/implementation/simple_segregated_storage.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/implementation/simple_segregated_storage.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,76 +1,96 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>Simple Segregated Storage Implementation</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>Simple Segregated Storage Implementation</H1>
+  <title>Simple Segregated Storage Implementation</title>
+</head>
 
-<P>
-<H2>Dependencies</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-Includes the system headers <SPAN CLASS="code">&lt;cstddef&gt;</SPAN> and <SPAN CLASS="code">&lt;functional&gt;</SPAN>.
+  <h1 align="center">Simple Segregated Storage Implementation</h1>
 
-<P>
-<H2>Protected Interface</H2>
+  <h2>Dependencies</h2>
 
-<P>
-<H3>Synopsis</H3>
+  <p>Includes the system headers <span class="code">&lt;cstddef&gt;</span>
+  and <span class="code">&lt;functional&gt;</span>.</p>
 
-<PRE CLASS="code">template &lt;typename SizeType = std::size_t&gt;
+  <h2>Protected Interface</h2>
+
+  <h3>Synopsis</h3>
+  <pre class="code">
+template &lt;typename SizeType = std::size_t&gt;
 class simple_segregated_storage
 {
   ... // Public interface
 
   protected:
     void * first;
-    static void * & nextof(void * const ptr);
+    static void * &amp; nextof(void * const ptr);
     void * find_prev(void * ptr);
-};</PRE>
+};
+</pre>
 
-<P>
-<H3 CLASS="code">void * first;</H3>
+  <h3 class="code">void * first;</h3>
 
-<P>
-This data member is the free list.  It points to the first chunk in the free list, or is equal to 0 if the free list is empty.
+  <p>This data member is the free list. It points to the first chunk in the
+  free list, or is equal to 0 if the free list is empty.</p>
 
-<P>
-<H3 CLASS="code">static void * & nextof(void * const ptr);</H3>
+  <h3 class="code">static void * &amp; nextof(void * const ptr);</h3>
 
-<P>
-This is a convenience function.  It helps clean up code dealing with the free list by making it more readable.  The return value is just <SPAN CLASS="code">*ptr</SPAN> cast to the appropriate type.  <SPAN CLASS="code">ptr</SPAN> must not be 0.
+  <p>This is a convenience function. It helps clean up code dealing with the
+  free list by making it more readable. The return value is just <span class=
+  "code">*ptr</span> cast to the appropriate type. <span class=
+  "code">ptr</span> must not be 0.</p>
 
-<P>
-As an example, let us assume that we want to truncate the free list after the first chunk.  That is, we want to set <SPAN CLASS="code">*first</SPAN> to 0; this will result in a free list with only one entry.  The normal way to do this is to first cast <SPAN CLASS="code">first</SPAN> to a pointer to a pointer to void, and then dereference and assign (<SPAN CLASS="code">*static_cast&lt;void **&gt;(first) = 0;</SPAN>).  This can be done more easily through the use of this convenience function (<SPAN CLASS="code">nextof(first) = 0;</SPAN>).
+  <p>As an example, let us assume that we want to truncate the free list
+  after the first chunk. That is, we want to set <span class=
+  "code">*first</span> to 0; this will result in a free list with only one
+  entry. The normal way to do this is to first cast <span class=
+  "code">first</span> to a pointer to a pointer to void, and then dereference
+  and assign (<span class="code">*static_cast&lt;void **&gt;(first) =
+  0;</span>). This can be done more easily through the use of this
+  convenience function (<span class="code">nextof(first) = 0;</span>).</p>
 
-<P>
-<H3 CLASS="code">void * find_prev(void * ptr);</H3>
+  <h3 class="code">void * find_prev(void * ptr);</h3>
 
-<P>
-Traverses the free list referred to by <SPAN CLASS="code">first</SPAN>, and returns the pointer previous to where <SPAN CLASS="code">ptr</SPAN> would go if it was in the free list.  Returns 0 if <SPAN CLASS="code">ptr</SPAN> would go at the beginning of the free list (i.e., before <SPAN CLASS="code">first</SPAN>).
+  <p>Traverses the free list referred to by <span class="code">first</span>,
+  and returns the pointer previous to where <span class="code">ptr</span>
+  would go if it was in the free list. Returns 0 if <span class=
+  "code">ptr</span> would go at the beginning of the free list (i.e., before
+  <span class="code">first</span>).</p>
 
-<P>
-Note that this function finds the location previous to where <SPAN CLASS="code">ptr</SPAN> <STRONG>would</STRONG> go <STRONG>if it was</STRONG> in the free list.  It does <STRONG>not</STRONG> find the entry in the free list before <SPAN CLASS="code">ptr</SPAN> (unless <SPAN CLASS="code">ptr</SPAN> is already in the free list).  Specifically, <SPAN CLASS="code">find_prev(0)</SPAN> will return 0, <STRONG>not</STRONG> the last entry in the free list.
+  <p>Note that this function finds the location previous to where
+  <span class="code">ptr</span> <strong>would</strong> go <strong>if it
+  was</strong> in the free list. It does <strong>not</strong> find the entry
+  in the free list before <span class="code">ptr</span> (unless <span class=
+  "code">ptr</span> is already in the free list). Specifically, <span class=
+  "code">find_prev(0)</span> will return 0, <strong>not</strong> the last
+  entry in the free list.</p>
 
-<P>
-<H2><A HREF="../interfaces/simple_segregated_storage.html">Interface Description</A></H2>
+  <h2><a href="../interfaces/simple_segregated_storage.html">Interface
+  Description</a></h2>
+  <hr>
 
-<P>
-<HR>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
-
-</BODY>
-</HTML>
\ No newline at end of file
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/implementation/singleton.html
===================================================================
--- boost/trunk/libs/pool/doc/implementation/singleton.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/implementation/singleton.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,25 +1,29 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>singleton - Singleton</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>singleton - Singleton</H1>
+  <title>singleton - Singleton</title>
+</head>
 
-<P>
-<H2>Introduction</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-detail/singleton.hpp provides a way to access a Singleton of a class type.  This is <STRONG>not</STRONG> a general Singleton solution!  It is restricted in that the class type must have a default constructor.
+  <h1 align="center">singleton - Singleton</h1>
 
-<P>
-<H2>Synopsis</H2>
+  <h2>Introduction</h2>
 
-<PRE CLASS="code">namespace details {
+  <p>detail/singleton.hpp provides a way to access a Singleton of a class
+  type. This is <strong>not</strong> a general Singleton solution! It is
+  restricted in that the class type must have a default constructor.</p>
+
+  <h2>Synopsis</h2>
+  <pre class="code">
+namespace details {
 namespace pool {
 
 template &lt;typename T&gt;
@@ -31,64 +35,97 @@
   public:
     typedef T object_type;
 
-    static object_type & instance();
+    static object_type &amp; instance();
 };
 
 } // namespace pool
-} // namespace details</PRE>
+} // namespace details
+</pre>
 
-<P>
-<H2>Semantics</H2>
+  <h2>Semantics</h2>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Symbol Table</EM></CAPTION>
-<TR><TH>Symbol<TH>Meaning
-<TR><TD CLASS="code">T<TD>Any class with a non-throwing default constructor and non-throwing destructor
-</TABLE>
+  <table border align="center" summary="">
+    <caption>
+      <em>Symbol Table</em>
+    </caption>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Requirements satisfied by <SPAN CLASS="code">singleton_default&lt;T&gt;</SPAN></EM></CAPTION>
-<TR><TH>Expression<TH>Return Type<TH>Assertion/Note/Pre/Post-Condition
-<TR><TD CLASS="code">singleton_default&lt;T&gt;::instance()<TD CLASS="code">T &amp;<TD>Returns a reference to the singleton instance
-</TABLE>
+    <tr>
+      <th>Symbol</th>
 
-<P>
-<H2>Guarantees</H2>
+      <th>Meaning</th>
+    </tr>
 
-<P>
-The singleton instance is guaranteed to be constructed before <SPAN CLASS="code">main()</SPAN> begins, and destructed after <SPAN CLASS="code">main()</SPAN> ends.  Furthermore, it is guaranteed to be constructed before the first call to <SPAN CLASS="code">singleton_default&lt;T&gt;::instance()</SPAN> is complete (even if called before <SPAN CLASS="code">main()</SPAN> begins).  Thus, if there are not multiple threads running except within <SPAN CLASS="code">main()</SPAN>, and if all access to the singleton is restricted by mutexes, then this guarantee allows a thread-safe singleton.
+    <tr>
+      <td class="code">T</td>
 
-<P>
-<H2>Details</H2>
+      <td>Any class with a non-throwing default constructor and non-throwing
+      destructor</td>
+    </tr>
+  </table><br>
 
-<P>
-For details on how we provide the guarantees above, see the comments in the header file.
+  <table border align="center" summary="">
+    <caption>
+      <em>Requirements satisfied by <span class=
+      "code">singleton_default&lt;T&gt;</span></em>
+    </caption>
 
-<P>
-<H2>Dependencies</H2>
+    <tr>
+      <th>Expression</th>
 
-<P>
-None.
+      <th>Return Type</th>
 
-<P>
-<H2>Future Directions</H2>
+      <th>Assertion/Note/Pre/Post-Condition</th>
+    </tr>
 
-<P>
-This header may be replaced by a Boost singleton library.
+    <tr>
+      <td class="code">singleton_default&lt;T&gt;::instance()</td>
 
-<P>
-<HR>
+      <td class="code">T &amp;</td>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+      <td>Returns a reference to the singleton instance</td>
+    </tr>
+  </table>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+  <h2>Guarantees</h2>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+  <p>The singleton instance is guaranteed to be constructed before
+  <span class="code">main()</span> begins, and destructed after <span class=
+  "code">main()</span> ends. Furthermore, it is guaranteed to be constructed
+  before the first call to <span class=
+  "code">singleton_default&lt;T&gt;::instance()</span> is complete (even if
+  called before <span class="code">main()</span> begins). Thus, if there are
+  not multiple threads running except within <span class=
+  "code">main()</span>, and if all access to the singleton is restricted by
+  mutexes, then this guarantee allows a thread-safe singleton.</p>
 
-</BODY>
-</HTML>
\ No newline at end of file
+  <h2>Details</h2>
+
+  <p>For details on how we provide the guarantees above, see the comments in
+  the header file.</p>
+
+  <h2>Dependencies</h2>
+
+  <p>None.</p>
+
+  <h2>Future Directions</h2>
+
+  <p>This header may be replaced by a Boost singleton library.</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/implementation/singleton_pool.html
===================================================================
--- boost/trunk/libs/pool/doc/implementation/singleton_pool.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/implementation/singleton_pool.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,25 +1,33 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>Singleton Pool Implementation</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>Singleton Pool Implementation</H1>
+  <title>Singleton Pool Implementation</title>
+</head>
 
-<P>
-<H2>Dependencies</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-Includes the Boost headers <SPAN CLASS="code">&quot;pool.hpp&quot;</SPAN> (see <A HREF="pool.html">pool.html</A>), <SPAN CLASS="code">&quot;detail/singleton.hpp&quot;</SPAN> (see <A HREF="singleton.html">singleton.html</A>), <SPAN CLASS="code">&quot;detail/mutex.hpp&quot;</SPAN> (see <A HREF="mutex.html">mutex.html</A>), and <SPAN CLASS="code">&quot;detail/guard.hpp&quot;</SPAN> (see <A HREF="guard.html">guard.html</A>).
+  <h1 align="center">Singleton Pool Implementation</h1>
 
-<P>
-<H2>Synopsis</H2>
+  <h2>Dependencies</h2>
 
-<PRE CLASS="code">template &lt;typename Tag,
+  <p>Includes the Boost headers <span class="code">"pool.hpp"</span> (see
+  <a href="pool.html">pool.html</a>), <span class=
+  "code">"detail/singleton.hpp"</span> (see <a href=
+  "singleton.html">singleton.html</a>), <span class=
+  "code">"detail/mutex.hpp"</span> (see <a href="mutex.html">mutex.html</a>),
+  and <span class="code">"detail/guard.hpp"</span> (see <a href=
+  "guard.html">guard.html</a>).</p>
+
+  <h2>Synopsis</h2>
+  <pre class="code">
+template &lt;typename Tag,
     unsigned RequestedSize,
     typename UserAllocator = default_user_allocator_new_delete,
     typename Mutex = details::pool::default_mutex,
@@ -31,52 +39,60 @@
   public: // extensions to public interface
     typedef Mutex mutex;
     static const unsigned next_size = NextSize;
-};</PRE>
+};
+</pre>
 
-<P>
-<H2>Extensions to Public Interface</H2>
+  <h2>Extensions to Public Interface</h2>
 
-<P>
-<H3>Additional template parameters</H3>
+  <h3>Additional template parameters</h3>
 
-<P>
-<H4 CLASS="code">Mutex</H4>
+  <h4 class="code">Mutex</h4>
 
-<P>
-This class is the type of <A HREF="mutex.html">mutex</A> to use to protect simultaneous access to the underlying Pool.  It is exposed so that users may declare some singleton pools normally (i.e., with synchronization), but some singleton pools without synchronization (by specifying <SPAN CLASS="code">details::pool::null_mutex</SPAN>) for efficiency reasons.
+  <p>This class is the type of <a href="mutex.html">mutex</a> to use to
+  protect simultaneous access to the underlying Pool. It is exposed so that
+  users may declare some singleton pools normally (i.e., with
+  synchronization), but some singleton pools without synchronization (by
+  specifying <span class="code">details::pool::null_mutex</span>) for
+  efficiency reasons.</p>
 
-<P>
-<H4 CLASS="code">NextSize</H4>
+  <h4 class="code">NextSize</h4>
 
-<P>
-The value of this parameter is passed to the underlying Pool when it is created.  See the extensions to the public interface of <A HREF="pool.html">pool</A> for more information.
+  <p>The value of this parameter is passed to the underlying Pool when it is
+  created. See the extensions to the public interface of <a href=
+  "pool.html">pool</a> for more information.</p>
 
-<P>
-<H3>Additional members</H3>
+  <h3>Additional members</h3>
 
-<P>
-The typedef <SPAN CLASS="code">mutex</SPAN> and the static const value <SPAN CLASS="code">next_size</SPAN> publish the values of the template parameters <SPAN CLASS="code">Mutex</SPAN> and <SPAN CLASS="code">NextSize</SPAN>, respectively.
+  <p>The typedef <span class="code">mutex</span> and the static const value
+  <span class="code">next_size</span> publish the values of the template
+  parameters <span class="code">Mutex</span> and <span class=
+  "code">NextSize</span>, respectively.</p>
 
-<P>
-<H2>Future Directions</H2>
+  <h2>Future Directions</h2>
 
-<P>
-When the Boost multithreading library is completed, the <SPAN CLASS="code">Mutex</SPAN> parameter will be replaced by something from that library providing the same flexibility and will move from an implementation detail into the interface specification.
+  <p>When the Boost multithreading library is completed, the <span class=
+  "code">Mutex</span> parameter will be replaced by something from that
+  library providing the same flexibility and will move from an implementation
+  detail into the interface specification.</p>
 
-<P>
-<H2><A HREF="../interfaces/singleton_pool.html">Interface Description</A></H2>
+  <h2><a href="../interfaces/singleton_pool.html">Interface
+  Description</a></h2>
+  <hr>
 
-<P>
-<HR>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
-
-</BODY>
-</HTML>
\ No newline at end of file
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/index.html
===================================================================
--- boost/trunk/libs/pool/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,154 +1,231 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>Boost Pool Library</TITLE>
-<LINK HREF="pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>Boost Pool Library</H1>
+  <title>Boost Pool Library</title>
+</head>
 
-<P>
-<H2>Introduction</H2>
+<body>
+  <img src="../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-<H3>What is Pool?</H3>
+  <h1 align="center">Boost Pool Library</h1>
 
-<P>
-Pool allocation is a memory allocation scheme that is very fast, but limited in its usage.  For more information on pool allocation (also called &quot;simple segregated storage&quot;), see <A HREF="concepts.html">the concepts document</A>.
+  <h2>Introduction</h2>
 
-<P>
-<H3>Why should I use Pool?</H3>
+  <h3>What is Pool?</h3>
 
-<P>
-Using Pools gives you more control over how memory is used in your program.  For example, you could have a situation where you want to allocate a bunch of small objects at one point, and then reach a point in your program where none of them are needed any more.  Using pool interfaces, you can choose to run their destructors or just drop them off into oblivion; the pool interface will guarantee that there are no system memory leaks.
+  <p>Pool allocation is a memory allocation scheme that is very fast, but 
+  limited in its usage. For more information on pool allocation (also called 
+  &quot;simple segregated storage&quot;), see <a href="concepts.html">the concepts 
+  document</a>.</p>
 
-<P>
-<H3>When should I use Pool?</H3>
+  <h3>Why should I use Pool?</h3>
 
-<P>
-Pools are generally used when there is a lot of allocation and deallocation of small objects.  Another common usage is the situation above, where many objects may be dropped out of memory.
+  <p>Using Pools gives you more control over how memory is used in your 
+  program. For example, you could have a situation where you want to allocate 
+  a bunch of small objects at one point, and then reach a point in your 
+  program where none of them are needed any more. Using pool interfaces, you 
+  can choose to run their destructors or just drop them off into oblivion; the 
+  pool interface will guarantee that there are no system memory leaks.</p>
 
-<P>
-In general, use Pools when you need a more efficient way to do unusual memory control.
+  <h3>When should I use Pool?</h3>
 
-<P>
-<H3>How do I use Pool?</H3>
+  <p>Pools are generally used when there is a lot of allocation and 
+  deallocation of small objects. Another common usage is the situation above, 
+  where many objects may be dropped out of memory.</p>
 
-<P>
-See the <A HREF="interfaces.html">pool interfaces document</A>, which covers the different Pool interfaces supplied by this library.
+  <p>In general, use Pools when you need a more efficient way to do unusual 
+  memory control.</p>
 
-<P>
-<H2>Library Structure and Dependencies</H2>
+  <h3>How do I use Pool?</h3>
 
-<P>
-Forward declarations of all the exposed symbols for this library are in the header <SPAN CLASS="code">&lt;boost/pool/poolfwd.hpp&gt;</SPAN>.
+  <p>See the <a href="interfaces.html">pool interfaces document</a>, which 
+  covers the different Pool interfaces supplied by this library.</p>
 
-<P>
-The library may use macros, which will be prefixed with <SPAN CLASS="code">BOOST_POOL_</SPAN>.  The exception to this rule are the include file guards, which (for file <EM>xxx</EM>.hpp) is <SPAN CLASS="code">BOOST_<EM>xxx</EM>_HPP</SPAN>.
+  <h2>Library Structure and Dependencies</h2>
 
-<P>
-All exposed symbols defined by the library will be in namespace <SPAN CLASS="code">boost</SPAN>.  All symbols used only by the implementation will be in namespace <SPAN CLASS="code">boost::details::pool</SPAN>.
+  <p>Forward declarations of all the exposed symbols for this library are in 
+  the header <span class="code">&lt;boost/pool/poolfwd.hpp&gt;</span>.</p>
 
-<P>
-Every header used only by the implementation is in the subdirectory <SPAN CLASS="code">detail/</SPAN>.
+  <p>The library may use macros, which will be prefixed with <span class=
+  "code">BOOST_POOL_</span>. The exception to this rule are the include file 
+  guards, which (for file <em>xxx</em>.hpp) is <span class=
+  "code">BOOST_<em>xxx</em>_HPP</span>.</p>
 
-<P>
-Any header in the library may include any other header in the library or any system-supplied header at its discretion.
+  <p>All exposed symbols defined by the library will be in namespace
+  <span class="code">boost</span>. All symbols used only by the implementation 
+  will be in namespace <span class=
+  "code">boost::details::pool</span>.</p>
 
-<P>
-<H2>Installation</H2>
+  <p>Every header used only by the implementation is in the subdirectory
+  <span class="code">detail/</span>.</p>
 
-<P>
-The Boost Pool library is a header file library.  That means there is no .lib, .dll, or .so to build; just add the Boost directory to your compiler's include file path, and you should be good to go!
+  <p>Any header in the library may include any other header in the library or 
+  any system-supplied header at its discretion.</p>
 
-<P>
-<H2>Building the Test Programs</H2>
+  <h2>Installation</h2>
 
-<P>
-The subdirectory &quot;build&quot; contains subdirectories for several different platforms.  These subdirectories contain all necessary work-around code for that platform, as well as makefiles or IDE project files as appropriate.
+  <p>The Boost Pool library is a header file library. That means there is no 
+  .lib, .dll, or .so to build; just add the Boost directory to your compiler's 
+  include file path, and you should be good to go!</p>
 
-<P>
-Read the &quot;readme.txt&quot; in the proper subdirectory, if it exists.
+  <h2>Building the Test Programs</h2>
 
-<P>
-The standard makefile targets are &quot;all&quot;, &quot;clean&quot; (which deletes any intermediate files), and &quot;veryclean&quot; (which deletes any intermediate files and executables).  All intermediate and executable files are built in the same directory as the makefile/project file.  If there is a project file supplied instead of a makefile, &quot;clean&quot; and &quot;veryclean&quot; shell scripts/batch files will be provided.
+  <p>The subdirectory &quot;build&quot; contains subdirectories for several different 
+  platforms. These subdirectories contain all necessary work-around code for 
+  that platform, as well as makefiles or IDE project files as appropriate.</p>
 
-<P>
-Project files and makefiles for additional platforms may be sent to Stephen Cleary at scleary AT jerviswebb DOT com.
+  <p>Read the &quot;readme.txt&quot; in the proper subdirectory, if it exists.</p>
 
-<P>
-<H2>Documentation Map</H2>
+  <p>The standard makefile targets are &quot;all&quot;, &quot;clean&quot; (which deletes any 
+  intermediate files), and &quot;veryclean&quot; (which deletes any intermediate files 
+  and executables). All intermediate and executable files are built in the 
+  same directory as the makefile/project file. If there is a project file 
+  supplied instead of a makefile, &quot;clean&quot; and &quot;veryclean&quot; shell scripts/batch 
+  files will be provided.</p>
 
-<UL>
-<LI>Overview of Pooling
- <UL>
- <LI><A HREF="concepts.html">concepts.html</A> - The basic ideas behind pooling.</LI>
- <LI><A HREF="implementation/alignment.html">implementation/alignment.html</A> - How we guarantee alignment portably.</LI>
- <LI><A HREF="interfaces.html">interfaces.html</A> - What interfaces are provided and when to use each one.</LI>
- </UL>
-</LI>
-<LI>Pool Exposed Interfaces
- <UL>
- <LI><A HREF="interfaces/simple_segregated_storage.html">interfaces/simple_segregated_storage.html</A> - Not for the faint of heart; embedded programmers only.</LI>
- <LI><A HREF="interfaces/pool.html">interfaces/pool.html</A> - The basic pool interface.</LI>
- <LI><A HREF="interfaces/singleton_pool.html">interfaces/singleton_pool.html</A> - The basic pool interface as a thread-safe singleton.</LI>
- <LI><A HREF="interfaces/object_pool.html">interfaces/object_pool.html</A> - A type-oriented (instead of size-oriented) pool interface.</LI>
- <LI><A HREF="interfaces/pool_alloc.html">interfaces/pool_alloc.html</A> - A Standard Allocator pool interface based on singleton_pool.</LI>
- <LI><A HREF="interfaces/user_allocator.html">interfaces/user_allocator.html</A> - OK, not a pool interface, but it describes how the user can control how Pools allocate system memory.</LI>
- </UL>
-</LI>
-<LI>Pool Implementation Details and Extensions
- <UL>
- <LI>Interface Implementations and Extensions
-  <UL>
-  <LI><A HREF="implementation/simple_segregated_storage.html">implementation/simple_segregated_storage.html</A></LI>
-  <LI><A HREF="implementation/pool.html">implementation/pool.html</A></LI>
-  <LI><A HREF="implementation/singleton_pool.html">implementation/singleton_pool.html</A></LI>
-  <LI><A HREF="implementation/object_pool.html">implementation/object_pool.html</A></LI>
-  <LI><A HREF="implementation/pool_alloc.html">implementation/pool_alloc.html</A></LI>
-  </UL>
- </LI>
- <LI>Components Used Only by the Implementation
-  <UL>
-  <LI><A HREF="implementation/ct_gcd_lcm.html">implementation/ct_gcd_lcm.html</A> - Compile-time GCD and LCM.</LI>
-  <LI><A HREF="implementation/for.html">implementation/for.html</A> - Description of an m4 component.</LI>
-  <LI><A HREF="implementation/gcd_lcm.html">implementation/gcd_lcm.html</A> - Run-time GCD and LCM.</LI>
-  <LI><A HREF="implementation/guard.html">implementation/guard.html</A> - Auto lock/unlock for mutex.</LI>
-  <LI><A HREF="implementation/mutex.html">implementation/mutex.html</A> - Platform-dependent mutex type.</LI>
-  <LI><A HREF="implementation/pool_construct.html">implementation/pool_construct.html</A> - The system for supporting more constructor arguments in object_pool.</LI>
-  <LI><A HREF="implementation/singleton.html">implementation/singleton.html</A> - Singleton that avoids static initialization problem.</LI>
-  </UL>
- </LI>
- </UL>
-</LI>
-</UL>
+  <p>Project files and makefiles for additional platforms may be sent to 
+  Stephen Cleary at scleary AT jerviswebb DOT com.</p>
 
-<P>
-<H2>Future Directions</H2>
+  <h2>Documentation Map</h2>
 
-<P>
-Another pool interface will be written: a base class for per-class pool allocation.
+  <ul>
+    <li>Overview of Pooling
 
-<P>
-<H2>Acknowledgements</H2>
+      <ul>
+        <li><a href="concepts.html">concepts.html</a> - The basic ideas behind 
+        pooling.</li>
 
-<P>
-Many, many thanks to the Boost peers, notably Jeff Garland, Beman Dawes, Ed Brey, Gary Powell, Peter Dimov, and Jens Maurer for providing helpful suggestions!
+        <li><a href=
+        "implementation/alignment.html">implementation/alignment.html</a> - 
+        How we guarantee alignment portably.</li>
 
-<P>
-<HR>
+        <li><a href="interfaces.html">interfaces.html</a> - What interfaces 
+        are provided and when to use each one.</li>
+      </ul>
+    </li>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+    <li>Pool Exposed Interfaces
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="copyright.html">copyright.html</A>
+      <ul>
+        <li><a href=
+        "interfaces/simple_segregated_storage.html">
+        interfaces/simple_segregated_storage.html</a>
+        - Not for the faint of heart; embedded programmers only.</li>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+        <li><a href="interfaces/pool.html">interfaces/pool.html</a> - The 
+        basic pool interface.</li>
 
-</BODY>
-</HTML>
\ No newline at end of file
+        <li><a href=
+        "interfaces/singleton_pool.html">interfaces/singleton_pool.html</a> - 
+        The basic pool interface as a thread-safe singleton.</li>
+
+        <li><a href=
+        "interfaces/object_pool.html">interfaces/object_pool.html</a> - A 
+        type-oriented (instead of size-oriented) pool interface.</li>
+
+        <li><a href=
+        "interfaces/pool_alloc.html">interfaces/pool_alloc.html</a> - A 
+        Standard Allocator pool interface based on singleton_pool.</li>
+
+        <li><a href=
+        "interfaces/user_allocator.html">interfaces/user_allocator.html</a> - 
+        OK, not a pool interface, but it describes how the user can control 
+        how Pools allocate system memory.</li>
+      </ul>
+    </li>
+
+    <li>Pool Implementation Details and Extensions
+
+      <ul>
+        <li>Interface Implementations and Extensions
+
+          <ul>
+            <li><a href=
+            "implementation/simple_segregated_storage.html">
+            implementation/simple_segregated_storage.html</a></li>
+
+            <li><a href=
+            "implementation/pool.html">implementation/pool.html</a></li>
+
+            <li><a href=
+            "implementation/singleton_pool.html">
+            implementation/singleton_pool.html</a></li>
+
+            <li><a href=
+            "implementation/object_pool.html">implementation/object_pool.html</a></li>
+
+            <li><a href=
+            "implementation/pool_alloc.html">implementation/pool_alloc.html</a></li>
+          </ul>
+        </li>
+
+        <li>Components Used Only by the Implementation
+
+          <ul>
+            <li><a href=
+            "implementation/ct_gcd_lcm.html">implementation/ct_gcd_lcm.html</a>
+            - Compile-time GCD and LCM.</li>
+
+            <li><a href="implementation/for.html">implementation/for.html</a>
+            - Description of an m4 component.</li>
+
+            <li><a href=
+            "implementation/gcd_lcm.html">implementation/gcd_lcm.html</a> - 
+            Run-time GCD and LCM.</li>
+
+            <li><a href=
+            "implementation/guard.html">implementation/guard.html</a> - Auto 
+            lock/unlock for mutex.</li>
+
+            <li><a href=
+            "implementation/mutex.html">implementation/mutex.html</a> - 
+            Platform-dependent mutex type.</li>
+
+            <li><a href=
+            "implementation/pool_construct.html">
+            implementation/pool_construct.html</a>
+            - The system for supporting more constructor arguments in 
+            object_pool.</li>
+
+            <li><a href=
+            "implementation/singleton.html">implementation/singleton.html</a>
+            - Singleton that avoids static initialization problem.</li>
+          </ul>
+        </li>
+      </ul>
+    </li>
+  </ul>
+
+  <h2>Future Directions</h2>
+
+  <p>Another pool interface will be written: a base class for per-class pool 
+  allocation.</p>
+
+  <h2>Acknowledgements</h2>
+
+  <p>Many, many thanks to the Boost peers, notably Jeff Garland, Beman Dawes, 
+  Ed Brey, Gary Powell, Peter Dimov, and Jens Maurer for providing helpful 
+  suggestions!</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See 
+  accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or 
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/interfaces/object_pool.html
===================================================================
--- boost/trunk/libs/pool/doc/interfaces/object_pool.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/interfaces/object_pool.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,25 +1,30 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>object_pool - Boost Object Pool Allocator</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>object_pool - Boost Object Pool Allocator</H1>
+  <title>object_pool - Boost Object Pool Allocator</title>
+</head>
 
-<P>
-<H2>Introduction</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-object_pool.hpp provides a template type that can be used for fast and efficient memory allocation.  It also provides automatic destruction of non-deallocated objects.  For information on other pool-based interfaces, see <A HREF="../interfaces.html">the other pool interfaces</A>.
+  <h1 align="center">object_pool - Boost Object Pool Allocator</h1>
 
-<P>
-<H2>Synopsis</H2>
+  <h2>Introduction</h2>
 
-<PRE CLASS="code">template &lt;typename ElementType, typename UserAllocator = default_user_allocator_new_delete&gt;
+  <p>object_pool.hpp provides a template type that can be used for fast and 
+  efficient memory allocation. It also provides automatic destruction of 
+  non-deallocated objects. For information on other pool-based interfaces, see <a href="../interfaces.html">
+  the other pool interfaces</a>.</p>
+
+  <h2>Synopsis</h2>
+  <pre class="code">
+template &lt;typename ElementType, typename UserAllocator = default_user_allocator_new_delete&gt;
 class object_pool
 {
   private:
@@ -42,87 +47,241 @@
     element_type * construct();
     // other construct() functions
     void destroy(element_type * p);
-};</PRE>
+};
+</pre>
 
-<P>
-<H2>Template Parameters</H2>
+  <h2>Template Parameters</h2>
 
-<P>
-<H3>ElementType</H3>
+  <h3>ElementType</h3>
 
-<P>
-The template parameter is the type of object to allocate/deallocate.  It must have a non-throwing destructor.
+  <p>The template parameter is the type of object to allocate/deallocate. It 
+  must have a non-throwing destructor.</p>
 
-<P>
-<H3>UserAllocator</H3>
+  <h3>UserAllocator</h3>
 
-<P>
-Defines the method that the underlying Pool will use to allocate memory from the system.  See <A HREF="user_allocator.html">User Allocators</A> for details.
+  <p>Defines the method that the underlying Pool will use to allocate memory 
+  from the system. See <a href="user_allocator.html">User Allocators</a> for 
+  details.</p>
 
-<P>
-<H2>Semantics</H2>
+  <h2>Semantics</h2>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Symbol Table</EM></CAPTION>
-<TR><TH>Symbol<TH>Meaning
-<TR><TD CLASS="code">ObjectPool<TD><SPAN CLASS="code">object_pool&lt;ElementType, UserAllocator&gt;</SPAN>
-<TR><TD CLASS="code">t<TD>value of type <SPAN CLASS="code">ObjectPool</SPAN>
-<TR><TD CLASS="code">u<TD>value of type <SPAN CLASS="code">const ObjectPool</SPAN>
-<TR><TD CLASS="code">p<TD>value of type <SPAN CLASS="code">ElementType *</SPAN>
-</TABLE>
+  <table border align="center" summary="">
+    <caption>
+      <em>Symbol Table</em>
+    </caption>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Typedefs</EM></CAPTION>
-<TR><TH>Expression<TH>Type
-<TR><TD CLASS="code">ObjectPool::element_type<TD CLASS="code">ElementType
-<TR><TD CLASS="code">ObjectPool::user_allocator<TD CLASS="code">UserAllocator
-<TR><TD CLASS="code">ObjectPool::size_type<TD CLASS="code">pool&lt;UserAllocator&gt;::size_type
-<TR><TD CLASS="code">ObjectPool::difference_type<TD CLASS="code">pool&lt;UserAllocator&gt;::difference_type
-</TABLE>
+    <tr>
+      <th>Symbol</th>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Constructors, Destructors, and Testing</EM></CAPTION>
-<TR><TH>Expression<TH>Return Type<TH>Notes
-<TR><TD CLASS="code">ObjectPool()<TD>not used<TD>Constructs a new empty <SPAN CLASS="code">ObjectPool</SPAN>
-<TR><TD CLASS="code">(&amp;t)->~ObjectPool()<TD>not used<TD>Destructs the <SPAN CLASS="code">ObjectPool</SPAN>; <SPAN CLASS="code">~ElementType()</SPAN> is called for each allocated ElementType that has not been deallocated.  O(N).
-<TR><TD CLASS="code">u.is_from(p)<TD CLASS="code">bool<TD>Returns <SPAN CLASS="code">true</SPAN> if <SPAN CLASS="code">p</SPAN> was allocated from <SPAN CLASS="code">u</SPAN> or may be returned as the result of a future allocation from <SPAN CLASS="code">u</SPAN>.  Returns <SPAN CLASS="code">false</SPAN> if <SPAN CLASS="code">p</SPAN> was allocated from some other pool or may be returned as the result of a future allocation from some other pool.  Otherwise, the return value is meaningless; note that this function may <STRONG>not</STRONG> be used to reliably test random pointer values.
-</TABLE>
+      <th>Meaning</th>
+    </tr>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Allocation and Deallocation</EM></CAPTION>
-<TR><TH>Expression<TH>Return Type<TH>Pre-Condition<TH>Semantic Equivalence<TH>Notes
-<TR><TD CLASS="code">t.malloc()<TD CLASS="code">ElementType *<TD><TD><TD>Allocates memory that can hold an object of type <SPAN CLASS="code">ElementType</SPAN>.  If out of memory, returns <SPAN CLASS="code">0</SPAN>.  Amortized O(1).
-<TR><TD CLASS="code">t.free(p)<TD>not used<TD><SPAN CLASS="code">p</SPAN> must have been previously allocated from <SPAN CLASS="code">t</SPAN><TD><TD>Deallocates a chunk of memory.  Note that <SPAN CLASS="code">p</SPAN> may not be <SPAN CLASS="code">0</SPAN>.  Note that the destructor for <SPAN CLASS="code">p</SPAN> is not called.  O(N).
-<TR><TD CLASS="code">t.construct(???)<TD CLASS="code">ElementType *<TD><SPAN CLASS="code">ElementType</SPAN> must have a constructor matching <SPAN CLASS="code">???</SPAN>; the number of parameters given must not exceed what is supported through <A HREF="../implementation/pool_construct.html">pool_construct</A><TD><TD>Allocates and initializes an object of type <SPAN CLASS="code">ElementType</SPAN>.  If out of memory, returns <SPAN CLASS="code">0</SPAN>.  Amortized O(1).
-<TR><TD CLASS="code">t.destroy(p)<TD>not used<TD><SPAN CLASS="code">p</SPAN> must have been previously allocated from <SPAN CLASS="code">t</SPAN><TD CLASS="code">p->~ElementType(); t.free(p);<TD>
-</TABLE>
+    <tr>
+      <td class="code">ObjectPool</td>
 
-<P>
-<H2>Symbols</H2>
+      <td><span class="code">object_pool&lt;ElementType, UserAllocator&gt;</span></td>
+    </tr>
 
-<P>
-<UL>
-<LI>boost::object_pool</LI>
-</UL>
+    <tr>
+      <td class="code">t</td>
 
-<P>
-<H2><A HREF="../implementation/object_pool.html">Implementation Details</A></H2>
+      <td>value of type <span class="code">ObjectPool</span></td>
+    </tr>
 
-<P>
-<HR>
+    <tr>
+      <td class="code">u</td>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+      <td>value of type <span class="code">const ObjectPool</span></td>
+    </tr>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+    <tr>
+      <td class="code">p</td>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+      <td>value of type <span class="code">ElementType *</span></td>
+    </tr>
+  </table><br>
 
-</BODY>
-</HTML>
\ No newline at end of file
+  <table border align="center" summary="">
+    <caption>
+      <em>Typedefs</em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Type</th>
+    </tr>
+
+    <tr>
+      <td class="code">ObjectPool::element_type</td>
+
+      <td class="code">ElementType</td>
+    </tr>
+
+    <tr>
+      <td class="code">ObjectPool::user_allocator</td>
+
+      <td class="code">UserAllocator</td>
+    </tr>
+
+    <tr>
+      <td class="code">ObjectPool::size_type</td>
+
+      <td class="code">pool&lt;UserAllocator&gt;::size_type</td>
+    </tr>
+
+    <tr>
+      <td class="code">ObjectPool::difference_type</td>
+
+      <td class="code">pool&lt;UserAllocator&gt;::difference_type</td>
+    </tr>
+  </table><br>
+
+  <table border align="center" summary="">
+    <caption>
+      <em>Constructors, Destructors, and Testing</em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Return Type</th>
+
+      <th>Notes</th>
+    </tr>
+
+    <tr>
+      <td class="code">ObjectPool()</td>
+
+      <td>not used</td>
+
+      <td>Constructs a new empty <span class="code">ObjectPool</span></td>
+    </tr>
+
+    <tr>
+      <td class="code">(&amp;t)-&gt;~ObjectPool()</td>
+
+      <td>not used</td>
+
+      <td>Destructs the <span class="code">ObjectPool</span>; <span class=
+      "code">~ElementType()</span> is called for each allocated ElementType 
+      that has not been deallocated. O(N).</td>
+    </tr>
+
+    <tr>
+      <td class="code">u.is_from(p)</td>
+
+      <td class="code">bool</td>
+
+      <td>Returns <span class="code">true</span> if <span class=
+      "code">p</span> was allocated from <span class="code">u</span> or may be 
+      returned as the result of a future allocation from <span class=
+      "code">u</span>. Returns <span class="code">false</span> if
+      <span class="code">p</span> was allocated from some other pool or may be 
+      returned as the result of a future allocation from some other pool. 
+      Otherwise, the return value is meaningless; note that this function may
+      <strong>not</strong> be used to reliably test random pointer values.</td>
+    </tr>
+  </table><br>
+
+  <table border align="center" summary="">
+    <caption>
+      <em>Allocation and Deallocation</em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Return Type</th>
+
+      <th>Pre-Condition</th>
+
+      <th>Semantic Equivalence</th>
+
+      <th>Notes</th>
+    </tr>
+
+    <tr>
+      <td class="code">t.malloc()</td>
+
+      <td class="code">ElementType *</td>
+
+      <td></td>
+
+      <td></td>
+
+      <td>Allocates memory that can hold an object of type <span class=
+      "code">ElementType</span>. If out of memory, returns <span class=
+      "code">0</span>. Amortized O(1).</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.free(p)</td>
+
+      <td>not used</td>
+
+      <td><span class="code">p</span> must have been previously allocated from <span class="code">
+      t</span></td>
+
+      <td></td>
+
+      <td>Deallocates a chunk of memory. Note that <span class=
+      "code">p</span> may not be <span class="code">0</span>. Note that the 
+      destructor for <span class="code">p</span> is not called. O(N).</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.construct(???)</td>
+
+      <td class="code">ElementType *</td>
+
+      <td><span class="code">ElementType</span> must have a constructor 
+      matching <span class="code">???</span>; the number of parameters given 
+      must not exceed what is supported through <a href=
+      "../implementation/pool_construct.html">pool_construct</a></td>
+
+      <td></td>
+
+      <td>Allocates and initializes an object of type <span class=
+      "code">ElementType</span>. If out of memory, returns <span class=
+      "code">0</span>. Amortized O(1).</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.destroy(p)</td>
+
+      <td>not used</td>
+
+      <td><span class="code">p</span> must have been previously allocated from <span class="code">
+      t</span></td>
+
+      <td class="code">p-&gt;~ElementType(); t.free(p);</td>
+
+      <td></td>
+    </tr>
+  </table>
+
+  <h2>Symbols</h2>
+
+  <ul>
+    <li>boost::object_pool</li>
+  </ul>
+
+  <h2><a href="../implementation/object_pool.html">Implementation Details</a></h2>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See 
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/interfaces/pool.html
===================================================================
--- boost/trunk/libs/pool/doc/interfaces/pool.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/interfaces/pool.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,30 +1,39 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>Pool</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>Pool</H1>
+  <title>Pool</title>
+</head>
 
-<P>
-<H2>Introduction</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-<SPAN CLASS="code">pool</SPAN> is a fast memory allocator, and guarantees proper alignment of all allocated chunks.
+  <h1 align="center">Pool</h1>
 
-<P>
-pool.hpp provides two <A HREF="user_allocator.html">UserAllocator</A> classes and a template class <SPAN CLASS="code">pool</SPAN>, which extends and generalizes the framework provided by the <A HREF="simple_segregated_storage.html">simple segregated storage</A> solution.  For information on other pool-based interfaces, see <A HREF="../interfaces.html">the other pool interfaces</A>.
+  <h2>Introduction</h2>
 
-<P>
-<H2>Synopsis</H2>
+  <p><span class="code">pool</span> is a fast memory allocator, and
+  guarantees proper alignment of all allocated chunks.</p>
 
-<PRE CLASS="code">struct default_user_allocator_new_delete; // see <A HREF="user_allocator.html">User Allocators</A>
-struct default_user_allocator_malloc_free; // see <A HREF="user_allocator.html">User Allocators</A>
+  <p>pool.hpp provides two <a href="user_allocator.html">UserAllocator</a>
+  classes and a template class <span class="code">pool</span>, which extends
+  and generalizes the framework provided by the <a href=
+  "simple_segregated_storage.html">simple segregated storage</a> solution.
+  For information on other pool-based interfaces, see <a href=
+  "../interfaces.html">the other pool interfaces</a>.</p>
 
+  <h2>Synopsis</h2>
+  <pre class="code">
+struct default_user_allocator_new_delete; // see <a href=
+"user_allocator.html">User Allocators</a>
+struct default_user_allocator_malloc_free; // see <a href=
+"user_allocator.html">User Allocators</a>
+
 template &lt;typename UserAllocator = default_user_allocator_new_delete&gt;
 class pool
 {
@@ -54,90 +63,317 @@
     void ordered_free(void * chunk);
     void free(void * chunks, size_type n);
     void ordered_free(void * chunks, size_type n);
-};</PRE>
+};
+</pre>
 
-<P>
-<H2>Template Parameters</H2>
+  <h2>Template Parameters</h2>
 
-<P>
-<H3>UserAllocator</H3>
+  <h3>UserAllocator</h3>
 
-<P>
-Defines the method that the Pool will use to allocate memory from the system.  See <A HREF="user_allocator.html">User Allocators</A> for details.
+  <p>Defines the method that the Pool will use to allocate memory from the
+  system. See <a href="user_allocator.html">User Allocators</a> for
+  details.</p>
 
-<P>
-<H2>Semantics</H2>
+  <h2>Semantics</h2>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Symbol Table</EM></CAPTION>
-<TR><TH>Symbol<TH>Meaning
-<TR><TD CLASS="code">Pool<TD CLASS="code">pool&lt;UserAllocator&gt;
-<TR><TD CLASS="code">t<TD>value of type <SPAN CLASS="code">Pool</SPAN>
-<TR><TD CLASS="code">u<TD>value of type <SPAN CLASS="code">const Pool</SPAN>
-<TR><TD CLASS="code">chunk<TD>value of type <SPAN CLASS="code">void *</SPAN>
-<TR><TD CLASS="code">n<TD>value of type <SPAN CLASS="code">size_type</SPAN>
-<TR><TD CLASS="code">RequestedSize<TD>value of type <SPAN CLASS="code">Pool::size_type</SPAN>; must be greater than 0
-</TABLE>
+  <table border align="center" summary="">
+    <caption>
+      <em>Symbol Table</em>
+    </caption>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Typedefs</EM></CAPTION>
-<TR><TH>Expression<TH>Type
-<TR><TD CLASS="code">Pool::user_allocator<TD CLASS="code">UserAllocator
-<TR><TD CLASS="code">Pool::size_type<TD CLASS="code">UserAllocator::size_type
-<TR><TD CLASS="code">Pool::difference_type<TD CLASS="code">UserAllocator::difference_type
-</TABLE>
+    <tr>
+      <th>Symbol</th>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Constructors, Destructors, and Testing</EM></CAPTION>
-<TR><TH>Expression<TH>Return Type<TH>Notes
-<TR><TD CLASS="code">Pool(RequestedSize)<TD>not used<TD>Constructs a new empty <SPAN CLASS="code">Pool</SPAN> that can be used to allocate chunks of size <SPAN CLASS="code">RequestedSize</SPAN>
-<TR><TD CLASS="code">(&amp;t)->~Pool()<TD>not used<TD>Destructs the <SPAN CLASS="code">Pool</SPAN>, freeing its list of memory blocks
-<TR><TD CLASS="code">u.is_from(chunk)<TD CLASS="code">bool<TD>Returns <SPAN CLASS="code">true</SPAN> if <SPAN CLASS="code">chunk</SPAN> was allocated from <SPAN CLASS="code">u</SPAN> or may be returned as the result of a future allocation from <SPAN CLASS="code">u</SPAN>.  Returns <SPAN CLASS="code">false</SPAN> if <SPAN CLASS="code">chunk</SPAN> was allocated from some other pool or may be returned as the result of a future allocation from some other pool.  Otherwise, the return value is meaningless; note that this function may <STRONG>not</STRONG> be used to reliably test random pointer values.
-<TR><TD CLASS="code">u.get_requested_size()<TD CLASS="code">size_type<TD>Returns the value passed into the constructor.  This value will not change during the lifetime of a <SPAN CLASS="code">Pool</SPAN> object.
-</TABLE>
+      <th>Meaning</th>
+    </tr>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Allocation and Deallocation</EM></CAPTION>
-<TR><TH>Expression<TH>Return Type<TH>Pre-Condition<TH>Notes
-<TR><TD CLASS="code">t.malloc()<TD CLASS="code">void *<TD><TD>Allocates a chunk of memory.  Searches in the list of memory blocks for a block that has a free chunk, and returns that free chunk if found.  Otherwise, creates a new memory block, adds its free list to <SPAN CLASS="code">t</SPAN>'s free list, and returns a free chunk from that block.  If a new memory block cannot be allocated, returns <SPAN CLASS="code">0</SPAN>.  Amortized O(1).
-<TR><TD CLASS="code">t.ordered_malloc()<TD CLASS="code">void *<TD><TD>Same as above, only merges the free lists, to preserve order.  Amortized O(1).
-<TR><TD CLASS="code">t.ordered_malloc(n)<TD CLASS="code">void *<TD><TD>Same as above, only allocates enough contiguous chunks to cover <SPAN CLASS="code">n * requested_size</SPAN> bytes.  Amortized O(n).
-<TR><TD CLASS="code">t.free(chunk)<TD CLASS="code">void<TD><SPAN CLASS="code">chunk</SPAN> must have been previously returned by <SPAN CLASS="code">t.malloc()</SPAN> or <SPAN CLASS="code">t.ordered_malloc()</SPAN>.<TD>Deallocates a chunk of memory.  Note that <SPAN CLASS="code">chunk</SPAN> may not be <SPAN CLASS="code">0</SPAN>.  O(1).
-<TR><TD CLASS="code">t.ordered_free(chunk)<TD CLASS="code">void<TD>Same as above<TD>Same as above, but is order-preserving.  Note that <SPAN CLASS="code">chunk</SPAN> may not be <SPAN CLASS="code">0</SPAN>.  O(N) with respect to the size of the free list
-<TR><TD CLASS="code">t.free(chunk, n)<TD CLASS="code">void<TD><SPAN CLASS="code">chunk</SPAN> must have been previously returned by <SPAN CLASS="code">t.ordered_malloc(n)</SPAN>.<TD>Assumes that <SPAN CLASS="code">chunk</SPAN> actually refers to a block of chunks spanning <SPAN CLASS="code">n * partition_sz</SPAN> bytes; deallocates each chunk in that block.  Note that <SPAN CLASS="code">chunk</SPAN> may not be <SPAN CLASS="code">0</SPAN>.  O(n).
-<TR><TD CLASS="code">t.ordered_free(chunk, n)<TD CLASS="code">void<TD><SPAN CLASS="code">chunk</SPAN> must have been previously returned by <SPAN CLASS="code">t.ordered_malloc(n)</SPAN>.<TD>Assumes that <SPAN CLASS="code">chunk</SPAN> actually refers to a block of chunks spanning <SPAN CLASS="code">n * partition_sz</SPAN> bytes; deallocates each chunk in that block.  Note that <SPAN CLASS="code">chunk</SPAN> may not be <SPAN CLASS="code">0</SPAN>.  Order-preserving.  O(N + n) where N is the size of the free list.
-<TR><TD CLASS="code">t.release_memory()<TD CLASS="code">bool<TD><SPAN CLASS="code">t</SPAN> must be ordered.<TD>Frees every memory block that doesn't have any allocated chunks.  Returns <SPAN CLASS="code">true</SPAN> if at least one memory block was freed.
-<TR><TD CLASS="code">t.purge_memory()<TD CLASS="code">bool<TD><TD>Frees every memory block.  This function invalidates any pointers previously returned by allocation functions of <SPAN CLASS="code">t</SPAN>.  Returns <SPAN CLASS="code">true</SPAN> if at least one memory block was freed.
-</TABLE>
+    <tr>
+      <td class="code">Pool</td>
 
-<P>
-<H2>Symbols</H2>
+      <td class="code">pool&lt;UserAllocator&gt;</td>
+    </tr>
 
-<P>
-<UL>
-<LI>boost::default_user_allocator_new_delete</LI>
-<LI>boost::default_user_allocator_malloc_new</LI>
-<LI>boost::pool</LI>
-</UL>
+    <tr>
+      <td class="code">t</td>
 
-<P>
-<H2><A HREF="../implementation/pool.html">Implementation Details</A></H2>
+      <td>value of type <span class="code">Pool</span></td>
+    </tr>
 
-<P>
-<HR>
+    <tr>
+      <td class="code">u</td>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+      <td>value of type <span class="code">const Pool</span></td>
+    </tr>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+    <tr>
+      <td class="code">chunk</td>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+      <td>value of type <span class="code">void *</span></td>
+    </tr>
 
-</BODY>
-</HTML>
\ No newline at end of file
+    <tr>
+      <td class="code">n</td>
+
+      <td>value of type <span class="code">size_type</span></td>
+    </tr>
+
+    <tr>
+      <td class="code">RequestedSize</td>
+
+      <td>value of type <span class="code">Pool::size_type</span>; must be
+      greater than 0</td>
+    </tr>
+  </table><br>
+
+  <table border align="center" summary="">
+    <caption>
+      <em>Typedefs</em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Type</th>
+    </tr>
+
+    <tr>
+      <td class="code">Pool::user_allocator</td>
+
+      <td class="code">UserAllocator</td>
+    </tr>
+
+    <tr>
+      <td class="code">Pool::size_type</td>
+
+      <td class="code">UserAllocator::size_type</td>
+    </tr>
+
+    <tr>
+      <td class="code">Pool::difference_type</td>
+
+      <td class="code">UserAllocator::difference_type</td>
+    </tr>
+  </table><br>
+
+  <table border align="center" summary="">
+    <caption>
+      <em>Constructors, Destructors, and Testing</em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Return Type</th>
+
+      <th>Notes</th>
+    </tr>
+
+    <tr>
+      <td class="code">Pool(RequestedSize)</td>
+
+      <td>not used</td>
+
+      <td>Constructs a new empty <span class="code">Pool</span> that can be
+      used to allocate chunks of size <span class=
+      "code">RequestedSize</span></td>
+    </tr>
+
+    <tr>
+      <td class="code">(&amp;t)-&gt;~Pool()</td>
+
+      <td>not used</td>
+
+      <td>Destructs the <span class="code">Pool</span>, freeing its list of
+      memory blocks</td>
+    </tr>
+
+    <tr>
+      <td class="code">u.is_from(chunk)</td>
+
+      <td class="code">bool</td>
+
+      <td>Returns <span class="code">true</span> if <span class=
+      "code">chunk</span> was allocated from <span class="code">u</span> or
+      may be returned as the result of a future allocation from <span class=
+      "code">u</span>. Returns <span class="code">false</span> if
+      <span class="code">chunk</span> was allocated from some other pool or
+      may be returned as the result of a future allocation from some other
+      pool. Otherwise, the return value is meaningless; note that this
+      function may <strong>not</strong> be used to reliably test random
+      pointer values.</td>
+    </tr>
+
+    <tr>
+      <td class="code">u.get_requested_size()</td>
+
+      <td class="code">size_type</td>
+
+      <td>Returns the value passed into the constructor. This value will not
+      change during the lifetime of a <span class="code">Pool</span>
+      object.</td>
+    </tr>
+  </table><br>
+
+  <table border align="center" summary="">
+    <caption>
+      <em>Allocation and Deallocation</em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Return Type</th>
+
+      <th>Pre-Condition</th>
+
+      <th>Notes</th>
+    </tr>
+
+    <tr>
+      <td class="code">t.malloc()</td>
+
+      <td class="code">void *</td>
+
+      <td></td>
+
+      <td>Allocates a chunk of memory. Searches in the list of memory blocks
+      for a block that has a free chunk, and returns that free chunk if
+      found. Otherwise, creates a new memory block, adds its free list to
+      <span class="code">t</span>'s free list, and returns a free chunk from
+      that block. If a new memory block cannot be allocated, returns
+      <span class="code">0</span>. Amortized O(1).</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.ordered_malloc()</td>
+
+      <td class="code">void *</td>
+
+      <td></td>
+
+      <td>Same as above, only merges the free lists, to preserve order.
+      Amortized O(1).</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.ordered_malloc(n)</td>
+
+      <td class="code">void *</td>
+
+      <td></td>
+
+      <td>Same as above, only allocates enough contiguous chunks to cover
+      <span class="code">n * requested_size</span> bytes. Amortized
+      O(n).</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.free(chunk)</td>
+
+      <td class="code">void</td>
+
+      <td><span class="code">chunk</span> must have been previously returned
+      by <span class="code">t.malloc()</span> or <span class=
+      "code">t.ordered_malloc()</span>.</td>
+
+      <td>Deallocates a chunk of memory. Note that <span class=
+      "code">chunk</span> may not be <span class="code">0</span>. O(1).</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.ordered_free(chunk)</td>
+
+      <td class="code">void</td>
+
+      <td>Same as above</td>
+
+      <td>Same as above, but is order-preserving. Note that <span class=
+      "code">chunk</span> may not be <span class="code">0</span>. O(N) with
+      respect to the size of the free list</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.free(chunk, n)</td>
+
+      <td class="code">void</td>
+
+      <td><span class="code">chunk</span> must have been previously returned
+      by <span class="code">t.ordered_malloc(n)</span>.</td>
+
+      <td>Assumes that <span class="code">chunk</span> actually refers to a
+      block of chunks spanning <span class="code">n * partition_sz</span>
+      bytes; deallocates each chunk in that block. Note that <span class=
+      "code">chunk</span> may not be <span class="code">0</span>. O(n).</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.ordered_free(chunk, n)</td>
+
+      <td class="code">void</td>
+
+      <td><span class="code">chunk</span> must have been previously returned
+      by <span class="code">t.ordered_malloc(n)</span>.</td>
+
+      <td>Assumes that <span class="code">chunk</span> actually refers to a
+      block of chunks spanning <span class="code">n * partition_sz</span>
+      bytes; deallocates each chunk in that block. Note that <span class=
+      "code">chunk</span> may not be <span class="code">0</span>.
+      Order-preserving. O(N + n) where N is the size of the free list.</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.release_memory()</td>
+
+      <td class="code">bool</td>
+
+      <td><span class="code">t</span> must be ordered.</td>
+
+      <td>Frees every memory block that doesn't have any allocated chunks.
+      Returns <span class="code">true</span> if at least one memory block was
+      freed.</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.purge_memory()</td>
+
+      <td class="code">bool</td>
+
+      <td></td>
+
+      <td>Frees every memory block. This function invalidates any pointers
+      previously returned by allocation functions of <span class=
+      "code">t</span>. Returns <span class="code">true</span> if at least one
+      memory block was freed.</td>
+    </tr>
+  </table>
+
+  <h2>Symbols</h2>
+
+  <ul>
+    <li>boost::default_user_allocator_new_delete</li>
+
+    <li>boost::default_user_allocator_malloc_new</li>
+
+    <li>boost::pool</li>
+  </ul>
+
+  <h2><a href="../implementation/pool.html">Implementation Details</a></h2>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/interfaces/pool_alloc.html
===================================================================
--- boost/trunk/libs/pool/doc/interfaces/pool_alloc.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/interfaces/pool_alloc.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,26 +1,33 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>pool_alloc - Boost Pool Standard Allocators</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>pool_alloc - Boost Pool Standard Allocators</H1>
+  <title>pool_alloc - Boost Pool Standard Allocators</title>
+</head>
 
-<P>
-<H2>Introduction</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-pool_alloc.hpp provides two template types that can be used for fast and efficient memory allocation.  These types both satisfy the Standard Allocator requirements [20.1.5] and the additional requirements in [20.1.5/4], so they can be used with Standard or user-supplied containers.  For information on other pool-based interfaces, see <A HREF="../interfaces.html">the other pool interfaces</A>.
+  <h1 align="center">pool_alloc - Boost Pool Standard Allocators</h1>
 
-<P>
-<H2>Synopsis</H2>
+  <h2>Introduction</h2>
 
-<PRE CLASS="code">struct pool_allocator_tag { };
+  <p>pool_alloc.hpp provides two template types that can be used for fast and
+  efficient memory allocation. These types both satisfy the Standard
+  Allocator requirements [20.1.5] and the additional requirements in
+  [20.1.5/4], so they can be used with Standard or user-supplied containers.
+  For information on other pool-based interfaces, see <a href=
+  "../interfaces.html">the other pool interfaces</a>.</p>
 
+  <h2>Synopsis</h2>
+  <pre class="code">
+struct pool_allocator_tag { };
+
 template &lt;typename T,
     typename UserAllocator = default_user_allocator_new_delete&gt;
 class pool_allocator
@@ -106,97 +113,166 @@
 
     static pointer allocate();
     static void deallocate(pointer ptr);
-};</PRE>
+};
+</pre>
 
-<P>
-<H2>Template Parameters</H2>
+  <h2>Template Parameters</h2>
 
-<P>
-<H3>T</H3>
+  <h3>T</h3>
 
-<P>
-The first template parameter is the type of object to allocate/deallocate.
+  <p>The first template parameter is the type of object to
+  allocate/deallocate.</p>
 
-<P>
-<H3>UserAllocator</H3>
+  <h3>UserAllocator</h3>
 
-<P>
-Defines the method that the underlying Pool will use to allocate memory from the system.  See <A HREF="user_allocator.html">User Allocators</A> for details.
+  <p>Defines the method that the underlying Pool will use to allocate memory
+  from the system. See <a href="user_allocator.html">User Allocators</a> for
+  details.</p>
 
-<P>
-<H2>Semantics</H2>
+  <h2>Semantics</h2>
 
-<P>
-Both of the pool allocators above satisfy all Standard Allocator requirements, as laid out in the Standard [20.1.5].  They also both satisfy the additional requirements found in [20.1.5/4]; this permits their usage with any Standard-compliant container.
+  <p>Both of the pool allocators above satisfy all Standard Allocator
+  requirements, as laid out in the Standard [20.1.5]. They also both satisfy
+  the additional requirements found in [20.1.5/4]; this permits their usage
+  with any Standard-compliant container.</p>
 
-<P>
-In addition, the <SPAN CLASS="code">fast_pool_allocator</SPAN> also provides an additional allocation and an additional deallocation function:
+  <p>In addition, the <span class="code">fast_pool_allocator</span> also
+  provides an additional allocation and an additional deallocation
+  function:</p>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Symbol Table</EM></CAPTION>
-<TR><TH>Symbol<TH>Meaning
-<TR><TD CLASS="code">PoolAlloc<TD><SPAN CLASS="code">fast_pool_allocator&lt;T, UserAllocator&gt;</SPAN>
-<TR><TD CLASS="code">p<TD>value of type <SPAN CLASS="code">T *</SPAN>
-</TABLE>
+  <table border align="center" summary="">
+    <caption>
+      <em>Symbol Table</em>
+    </caption>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Additional allocation/deallocation functions (<SPAN CLASS="code">fast_pool_allocator</SPAN> only)</EM></CAPTION>
-<TR><TH>Expression<TH>Return Type<TH>Semantic Equivalence
-<TR><TD CLASS="code">PoolAlloc::allocate()<TD CLASS="code">T *<TD CLASS="code">PoolAlloc::allocate(1)
-<TR><TD CLASS="code">PoolAlloc::deallocate(p)<TD>void<TD CLASS="code">PoolAlloc::deallocate(p, 1)
-</TABLE>
+    <tr>
+      <th>Symbol</th>
 
-<P>
-The typedef <SPAN CLASS="code">user_allocator</SPAN> publishes the value of the <SPAN CLASS="code">UserAllocator</SPAN> template parameter.
+      <th>Meaning</th>
+    </tr>
 
-<P>
-<H2>Notes</H2>
+    <tr>
+      <td class="code">PoolAlloc</td>
 
-<P>
-If the allocation functions run out of memory, they will throw <SPAN CLASS="code">std::bad_alloc</SPAN>.
+      <td><span class="code">fast_pool_allocator&lt;T,
+      UserAllocator&gt;</span></td>
+    </tr>
 
-<P>
-The underlying Pool type used by the allocators is accessible through the <A HREF="singleton_pool.html">Singleton Pool Interface</A>.  The identifying tag used for <SPAN CLASS="code">pool_allocator</SPAN> is <SPAN CLASS="code">pool_allocator_tag</SPAN>, and the tag used for <SPAN CLASS="code">fast_pool_allocator</SPAN> is <SPAN CLASS="code">fast_pool_allocator_tag</SPAN>.  All template parameters of the allocators (including <A HREF="../implementation/pool_alloc.html">implementation-specific ones</A>) determine the type of the underlying Pool, with the exception of the first parameter <SPAN CLASS="code">T</SPAN>, whose size is used instead.
+    <tr>
+      <td class="code">p</td>
 
-<P>
-Since the size of <SPAN CLASS="code">T</SPAN> is used to determine the type of the underlying Pool, each allocator for different types of the same size <EM>will share</EM> the same underlying pool.  The tag class prevents pools from being shared between <SPAN CLASS="code">pool_allocator</SPAN> and <SPAN CLASS="code">fast_pool_allocator</SPAN>.  For example, on a system where sizeof(int) == sizeof(void *), <SPAN CLASS="code">pool_allocator&lt;int&gt;</SPAN> and <SPAN CLASS="code">pool_allocator&lt;void *&gt;</SPAN> will both allocate/deallocate from/to the same pool.
+      <td>value of type <span class="code">T *</span></td>
+    </tr>
+  </table><br>
 
-<P>
-If there is only one thread running before <SPAN CLASS="code">main()</SPAN> starts and after <SPAN CLASS="code">main()</SPAN> ends, then both allocators are completely thread-safe.
+  <table border align="center" summary="">
+    <caption>
+      <em>Additional allocation/deallocation functions (<span class=
+      "code">fast_pool_allocator</span> only)</em>
+    </caption>
 
-<P>
-<H2>The Fast Pool Allocator</H2>
+    <tr>
+      <th>Expression</th>
 
-<P>
-<SPAN CLASS="code">pool_allocator</SPAN> is a more general-purpose solution, geared towards efficiently servicing requests for any number of contiguous chunks.  <SPAN CLASS="code">fast_pool_allocator</SPAN> is also a general-purpose solution, but is geared towards efficiently servicing requests for one chunk at a time; it will work for contiguous chunks, but not as well as <SPAN CLASS="code">pool_allocator</SPAN>.  If you are seriously concerned about performance, use <SPAN CLASS="code">fast_pool_allocator</SPAN> when dealing with containers such as <SPAN CLASS="code">std::list</SPAN>, and use <SPAN CLASS="code">pool_allocator</SPAN> when dealing with containers such as <SPAN CLASS="code">std::vector</SPAN>.
+      <th>Return Type</th>
 
-<P>
-<H2>Symbols</H2>
+      <th>Semantic Equivalence</th>
+    </tr>
 
-<P>
-<UL>
-<LI>boost::pool_allocator</LI>
-<LI>boost::pool_allocator_tag</LI>
-<LI>boost::fast_pool_allocator</LI>
-<LI>boost::fast_pool_allocator_tag</LI>
-</UL>
+    <tr>
+      <td class="code">PoolAlloc::allocate()</td>
 
-<P>
-<H2><A HREF="../implementation/pool_alloc.html">Implementation Details</A></H2>
+      <td class="code">T *</td>
 
-<P>
-<HR>
+      <td class="code">PoolAlloc::allocate(1)</td>
+    </tr>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+    <tr>
+      <td class="code">PoolAlloc::deallocate(p)</td>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+      <td>void</td>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+      <td class="code">PoolAlloc::deallocate(p, 1)</td>
+    </tr>
+  </table>
 
-</BODY>
-</HTML>
\ No newline at end of file
+  <p>The typedef <span class="code">user_allocator</span> publishes the value
+  of the <span class="code">UserAllocator</span> template parameter.</p>
+
+  <h2>Notes</h2>
+
+  <p>If the allocation functions run out of memory, they will throw
+  <span class="code">std::bad_alloc</span>.</p>
+
+  <p>The underlying Pool type used by the allocators is accessible through
+  the <a href="singleton_pool.html">Singleton Pool Interface</a>. The
+  identifying tag used for <span class="code">pool_allocator</span> is
+  <span class="code">pool_allocator_tag</span>, and the tag used for
+  <span class="code">fast_pool_allocator</span> is <span class=
+  "code">fast_pool_allocator_tag</span>. All template parameters of the
+  allocators (including <a href=
+  "../implementation/pool_alloc.html">implementation-specific ones</a>)
+  determine the type of the underlying Pool, with the exception of the first
+  parameter <span class="code">T</span>, whose size is used instead.</p>
+
+  <p>Since the size of <span class="code">T</span> is used to determine the
+  type of the underlying Pool, each allocator for different types of the same
+  size <em>will share</em> the same underlying pool. The tag class prevents
+  pools from being shared between <span class="code">pool_allocator</span>
+  and <span class="code">fast_pool_allocator</span>. For example, on a system
+  where sizeof(int) == sizeof(void *), <span class=
+  "code">pool_allocator&lt;int&gt;</span> and <span class=
+  "code">pool_allocator&lt;void *&gt;</span> will both allocate/deallocate
+  from/to the same pool.</p>
+
+  <p>If there is only one thread running before <span class=
+  "code">main()</span> starts and after <span class="code">main()</span>
+  ends, then both allocators are completely thread-safe.</p>
+
+  <h2>The Fast Pool Allocator</h2>
+
+  <p><span class="code">pool_allocator</span> is a more general-purpose
+  solution, geared towards efficiently servicing requests for any number of
+  contiguous chunks. <span class="code">fast_pool_allocator</span> is also a
+  general-purpose solution, but is geared towards efficiently servicing
+  requests for one chunk at a time; it will work for contiguous chunks, but
+  not as well as <span class="code">pool_allocator</span>. If you are
+  seriously concerned about performance, use <span class=
+  "code">fast_pool_allocator</span> when dealing with containers such as
+  <span class="code">std::list</span>, and use <span class=
+  "code">pool_allocator</span> when dealing with containers such as
+  <span class="code">std::vector</span>.</p>
+
+  <h2>Symbols</h2>
+
+  <ul>
+    <li>boost::pool_allocator</li>
+
+    <li>boost::pool_allocator_tag</li>
+
+    <li>boost::fast_pool_allocator</li>
+
+    <li>boost::fast_pool_allocator_tag</li>
+  </ul>
+
+  <h2><a href="../implementation/pool_alloc.html">Implementation
+  Details</a></h2>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/interfaces/simple_segregated_storage.html
===================================================================
--- boost/trunk/libs/pool/doc/interfaces/simple_segregated_storage.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/interfaces/simple_segregated_storage.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,25 +1,35 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>Simple Segregated Storage</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>Simple Segregated Storage</H1>
+  <title>Simple Segregated Storage</title>
+</head>
 
-<P>
-<H2>Introduction</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-simple_segregated_storage.hpp provides a template class <SPAN CLASS="code">simple_segregated_storage</SPAN> that controls access to a <EM>free list</EM> of memory chunks.  Please note that this is a <STRONG>very</STRONG> simple class, with preconditions on almost all its functions.  It is intended to be the fastest and smallest possible quick memory allocator &mdash; e.g., something to use in embedded systems.  This class delegates many difficult preconditions to the user (i.e., alignment issues).  For more general usage, see <A HREF="../interfaces.html">the other pool interfaces</A>.
+  <h1 align="center">Simple Segregated Storage</h1>
 
-<P>
-<H2>Synopsis</H2>
+  <h2>Introduction</h2>
 
-<PRE CLASS="code">template &lt;typename SizeType = std::size_t&gt;
+  <p>simple_segregated_storage.hpp provides a template class <span class=
+  "code">simple_segregated_storage</span> that controls access to a <em>free
+  list</em> of memory chunks. Please note that this is a
+  <strong>very</strong> simple class, with preconditions on almost all its
+  functions. It is intended to be the fastest and smallest possible quick
+  memory allocator &mdash; e.g., something to use in embedded systems. This
+  class delegates many difficult preconditions to the user (i.e., alignment
+  issues). For more general usage, see <a href="../interfaces.html">the other
+  pool interfaces</a>.</p>
+
+  <h2>Synopsis</h2>
+  <pre class="code">
+template &lt;typename SizeType = std::size_t&gt;
 class simple_segregated_storage
 {
   private:
@@ -50,101 +60,396 @@
         size_type partition_sz);
     void ordered_free_n(void * chunks, size_type n,
         size_type partition_sz);
-};</PRE>
+};
+</pre>
 
-<P>
-<H2>Semantics</H2>
+  <h2>Semantics</h2>
 
-<P>
-An object of type <SPAN CLASS="code">simple_segregated_storage&lt;SizeType&gt;</SPAN> is <EM>empty</EM> if its free list is empty.  If it is not empty, then it is <EM>ordered</EM> if its free list is ordered.  A free list is ordered if repeated calls to <SPAN CLASS="code">malloc()</SPAN> will result in a constantly-increasing sequence of values, as determined by <SPAN CLASS="code">std::less&lt;void *&gt;</SPAN>.  A member function is <EM>order-preserving</EM> if the free list maintains its order orientation (that is, an ordered free list is still ordered after the member function call).
+  <p>An object of type <span class=
+  "code">simple_segregated_storage&lt;SizeType&gt;</span> is <em>empty</em>
+  if its free list is empty. If it is not empty, then it is <em>ordered</em>
+  if its free list is ordered. A free list is ordered if repeated calls to
+  <span class="code">malloc()</span> will result in a constantly-increasing
+  sequence of values, as determined by <span class="code">std::less&lt;void
+  *&gt;</span>. A member function is <em>order-preserving</em> if the free
+  list maintains its order orientation (that is, an ordered free list is
+  still ordered after the member function call).</p>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Symbol Table</EM></CAPTION>
-<TR><TH>Symbol<TH>Meaning
-<TR><TD CLASS="code">Store<TD CLASS="code">simple_segregated_storage&lt;SizeType&gt;
-<TR><TD CLASS="code">t<TD>value of type <SPAN CLASS="code">Store</SPAN>
-<TR><TD CLASS="code">u<TD>value of type <SPAN CLASS="code">const Store</SPAN>
-<TR><TD CLASS="code">block, chunk, end<TD>values of type <SPAN CLASS="code">void *</SPAN>
-<TR><TD CLASS="code">partition_sz, sz, n<TD>values of type <SPAN CLASS="code">Store::size_type</SPAN>
-</TABLE>
+  <table border align="center" summary="">
+    <caption>
+      <em>Symbol Table</em>
+    </caption>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Template Parameters</EM></CAPTION>
-<TR><TH>Parameter<TH>Default<TH>Requirements
-<TR><TD CLASS="code">SizeType<TD CLASS="code">std::size_t<TD>An unsigned integral type
-</TABLE>
+    <tr>
+      <th>Symbol</th>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Typedefs</EM></CAPTION>
-<TR><TH>Symbol<TH>Type
-<TR><TD CLASS="code">size_type<TD CLASS="code">SizeType
-</TABLE>
+      <th>Meaning</th>
+    </tr>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Constructors, Destructors, and State</EM></CAPTION>
-<TR><TH>Expression<TH>Return Type<TH>Post-Condition<TH>Notes
-<TR><TD CLASS="code">Store()<TD>not used<TD CLASS="code">empty()<TD>Constructs a new <SPAN CLASS="code">Store</SPAN>
-<TR><TD CLASS="code">(&amp;t)->~Store()<TD>not used<TD><TD>Destructs the <SPAN CLASS="code">Store</SPAN>
-<TR><TD CLASS="code">u.empty()<TD CLASS="code">bool<TD><TD>Returns <SPAN CLASS="code">true</SPAN> if <SPAN CLASS="code">u</SPAN> is empty.  Order-preserving.
-</TABLE>
+    <tr>
+      <td class="code">Store</td>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Segregation</EM></CAPTION>
-<TR><TH>Expression<TH>Return Type<TH>Pre-Condition<TH>Post-Condition<TH>Semantic Equivalence<TH>Notes
+      <td class="code">simple_segregated_storage&lt;SizeType&gt;</td>
+    </tr>
 
-<TR><TD CLASS="code">Store::segregate(block, sz, partition_sz, end)<TD CLASS="code">void *<TD><SPAN CLASS="code">partition_sz &gt;= sizeof(void *)</SPAN><BR><SPAN CLASS="code">partition_sz = sizeof(void *) * i</SPAN>, for some integer <SPAN CLASS="code">i</SPAN><BR><SPAN CLASS="code">sz &gt;= partition_sz</SPAN><BR><SPAN CLASS="code">block</SPAN> is properly aligned for an array of objects of size <SPAN CLASS="code">partition_sz</SPAN><BR><SPAN CLASS="code">block</SPAN> is properly aligned for an array of <SPAN CLASS="code">void *</SPAN><TD><TD><TD>Interleaves a free list through the memory block specified by <SPAN CLASS="code">block</SPAN> of size <SPAN CLASS="code">sz</SPAN> bytes, partitioning it into as many <SPAN CLASS="code">partition_sz</SPAN>-sized chunks as possible.  The last chunk is set to point to <SPAN CLASS="code">end</SPAN>, and a pointer to the first chunck is returned (this is always equal to <SPAN CLASS="code">block</SPAN>).  This interleaved free list is ordered.  O(sz).
+    <tr>
+      <td class="code">t</td>
 
-<TR><TD CLASS="code">Store::segregate(block, sz, partition_sz)<TD CLASS="code">void *<TD>Same as above<TD><TD CLASS="code">Store::segregate(block, sz, partition_sz, 0)<TD>
+      <td>value of type <span class="code">Store</span></td>
+    </tr>
 
-<TR><TD CLASS="code">t.add_block(block, sz, partition_sz)<TD CLASS="code">void<TD>Same as above<TD CLASS="code">!t.empty()<TD><TD>Segregates the memory block specified by <SPAN CLASS="code">block</SPAN> of size <SPAN CLASS="code">sz</SPAN> bytes into <SPAN CLASS="code">partition_sz</SPAN>-sized chunks, and adds that free list to its own.  If <SPAN CLASS="code">t</SPAN> was empty before this call, then it is ordered after this call.  O(sz).
+    <tr>
+      <td class="code">u</td>
 
-<TR><TD CLASS="code">t.add_ordered_block(block, sz, partition_sz)<TD CLASS="code">void<TD>Same as above<TD CLASS="code">!t.empty()<TD><TD>Segregates the memory block specified by <SPAN CLASS="code">block</SPAN> of size <SPAN CLASS="code">sz</SPAN> bytes into <SPAN CLASS="code">partition_sz</SPAN>-sized chunks, and merges that free list into its own.  Order-preserving.  O(sz).
-</TABLE>
+      <td>value of type <span class="code">const Store</span></td>
+    </tr>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Allocation and Deallocation</EM></CAPTION>
-<TR><TH>Expression<TH>Return Type<TH>Pre-Condition<TH>Post-Condition<TH>Semantic Equivalence<TH>Notes
-<TR><TD CLASS="code">t.malloc()<TD CLASS="code">void *<TD CLASS="code">!t.empty()<TD><TD><TD>Takes the first available chunk from the free list and returns it.  Order-preserving.  O(1).
+    <tr>
+      <td class="code">block, chunk, end</td>
 
-<TR><TD CLASS="code">t.free(chunk)<TD CLASS="code">void<TD><SPAN CLASS="code">chunk</SPAN> was previously returned from a call to <SPAN CLASS="code">t.malloc()</SPAN><TD CLASS="code">!t.empty()<TD><TD>Places <SPAN CLASS="code">chunk</SPAN> back on the free list.  Note that <SPAN CLASS="code">chunk</SPAN> may not be <SPAN CLASS="code">0</SPAN>.  O(1).
+      <td>values of type <span class="code">void *</span></td>
+    </tr>
 
-<TR><TD CLASS="code">t.ordered_free(chunk)<TD CLASS="code">void<TD>Same as above<TD CLASS="code">!t.empty()<TD><TD>Places <SPAN CLASS="code">chunk</SPAN> back on the free list.    Note that <SPAN CLASS="code">chunk</SPAN> may not be <SPAN CLASS="code">0</SPAN>.  Order-preserving.  O(N) with respect to the size of the free list.
+    <tr>
+      <td class="code">partition_sz, sz, n</td>
 
-<TR><TD CLASS="code">t.malloc_n(n, partition_sz)<TD CLASS="code">void *<TD><TD><TD><TD>Attempts to find a contiguous sequence of <SPAN CLASS="code">n</SPAN> <SPAN CLASS="code">partition_sz</SPAN>-sized chunks.  If found, removes them all from the free list and returns a pointer to the first.  If not found, returns <SPAN CLASS="code">0</SPAN>.  It is strongly recommended (but not required) that the free list be ordered, as this algorithm will fail to find a contiguous sequence unless it is contiguous in the free list as well.  Order-preserving.  O(N) with respect to the size of the free list.
+      <td>values of type <span class="code">Store::size_type</span></td>
+    </tr>
+  </table><br>
 
-<TR><TD CLASS="code">t.free_n(chunk, n, partition_sz)<TD CLASS="code">void<TD><SPAN CLASS="code">chunk</SPAN> was previously returned from a call to <SPAN CLASS="code">t.malloc_n(n, partition_sz)</SPAN><TD CLASS="code">!t.empty()<TD CLASS="code">t.add_block(chunk, n * partition_sz, partition_sz)<TD>Assumes that <SPAN CLASS="code">chunk</SPAN> actually refers to a block of chunks spanning <SPAN CLASS="code">n * partition_sz</SPAN> bytes; segregates and adds in that block.  Note that <SPAN CLASS="code">chunk</SPAN> may not be <SPAN CLASS="code">0</SPAN>.  O(n).
+  <table border align="center" summary="">
+    <caption>
+      <em>Template Parameters</em>
+    </caption>
 
-<TR><TD CLASS="code">t.ordered_free_n(chunk, n, partition_sz)<TD CLASS="code">void<TD>same as above<TD>same as above<TD CLASS="code">t.add_ordered_block(chunk, n * partition_sz, partition_sz)<TD>Same as above, except it merges in the free list.  Order-preserving.  O(N + n) where N is the size of the free list.
-</TABLE>
+    <tr>
+      <th>Parameter</th>
 
-<P>
-<H2>Symbols</H2>
+      <th>Default</th>
 
-<P>
-<UL>
-<LI>boost::simple_segregated_storage</LI>
-</UL>
+      <th>Requirements</th>
+    </tr>
 
-<P>
-<H2><A HREF="../implementation/simple_segregated_storage.html">Implementation Details</A></H2>
+    <tr>
+      <td class="code">SizeType</td>
 
-<P>
-<HR>
+      <td class="code">std::size_t</td>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+      <td>An unsigned integral type</td>
+    </tr>
+  </table><br>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+  <table border align="center" summary="">
+    <caption>
+      <em>Typedefs</em>
+    </caption>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+    <tr>
+      <th>Symbol</th>
 
-</BODY>
-</HTML>
\ No newline at end of file
+      <th>Type</th>
+    </tr>
+
+    <tr>
+      <td class="code">size_type</td>
+
+      <td class="code">SizeType</td>
+    </tr>
+  </table><br>
+
+  <table border align="center" summary="">
+    <caption>
+      <em>Constructors, Destructors, and State</em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Return Type</th>
+
+      <th>Post-Condition</th>
+
+      <th>Notes</th>
+    </tr>
+
+    <tr>
+      <td class="code">Store()</td>
+
+      <td>not used</td>
+
+      <td class="code">empty()</td>
+
+      <td>Constructs a new <span class="code">Store</span></td>
+    </tr>
+
+    <tr>
+      <td class="code">(&amp;t)-&gt;~Store()</td>
+
+      <td>not used</td>
+
+      <td></td>
+
+      <td>Destructs the <span class="code">Store</span></td>
+    </tr>
+
+    <tr>
+      <td class="code">u.empty()</td>
+
+      <td class="code">bool</td>
+
+      <td></td>
+
+      <td>Returns <span class="code">true</span> if <span class=
+      "code">u</span> is empty. Order-preserving.</td>
+    </tr>
+  </table><br>
+
+  <table border align="center" summary="">
+    <caption>
+      <em>Segregation</em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Return Type</th>
+
+      <th>Pre-Condition</th>
+
+      <th>Post-Condition</th>
+
+      <th>Semantic Equivalence</th>
+
+      <th>Notes</th>
+    </tr>
+
+    <tr>
+      <td class="code">Store::segregate(block, sz, partition_sz, end)</td>
+
+      <td class="code">void *</td>
+
+      <td><span class="code">partition_sz &gt;= sizeof(void *)</span><br>
+      <span class="code">partition_sz = sizeof(void *) * i</span>, for some
+      integer <span class="code">i</span><br>
+      <span class="code">sz &gt;= partition_sz</span><br>
+      <span class="code">block</span> is properly aligned for an array of
+      objects of size <span class="code">partition_sz</span><br>
+      <span class="code">block</span> is properly aligned for an array of
+      <span class="code">void *</span></td>
+
+      <td></td>
+
+      <td></td>
+
+      <td>Interleaves a free list through the memory block specified by
+      <span class="code">block</span> of size <span class="code">sz</span>
+      bytes, partitioning it into as many <span class=
+      "code">partition_sz</span>-sized chunks as possible. The last chunk is
+      set to point to <span class="code">end</span>, and a pointer to the
+      first chunck is returned (this is always equal to <span class=
+      "code">block</span>). This interleaved free list is ordered.
+      O(sz).</td>
+    </tr>
+
+    <tr>
+      <td class="code">Store::segregate(block, sz, partition_sz)</td>
+
+      <td class="code">void *</td>
+
+      <td>Same as above</td>
+
+      <td></td>
+
+      <td class="code">Store::segregate(block, sz, partition_sz, 0)</td>
+
+      <td></td>
+    </tr>
+
+    <tr>
+      <td class="code">t.add_block(block, sz, partition_sz)</td>
+
+      <td class="code">void</td>
+
+      <td>Same as above</td>
+
+      <td class="code">!t.empty()</td>
+
+      <td></td>
+
+      <td>Segregates the memory block specified by <span class=
+      "code">block</span> of size <span class="code">sz</span> bytes into
+      <span class="code">partition_sz</span>-sized chunks, and adds that free
+      list to its own. If <span class="code">t</span> was empty before this
+      call, then it is ordered after this call. O(sz).</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.add_ordered_block(block, sz, partition_sz)</td>
+
+      <td class="code">void</td>
+
+      <td>Same as above</td>
+
+      <td class="code">!t.empty()</td>
+
+      <td></td>
+
+      <td>Segregates the memory block specified by <span class=
+      "code">block</span> of size <span class="code">sz</span> bytes into
+      <span class="code">partition_sz</span>-sized chunks, and merges that
+      free list into its own. Order-preserving. O(sz).</td>
+    </tr>
+  </table><br>
+
+  <table border align="center" summary="">
+    <caption>
+      <em>Allocation and Deallocation</em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Return Type</th>
+
+      <th>Pre-Condition</th>
+
+      <th>Post-Condition</th>
+
+      <th>Semantic Equivalence</th>
+
+      <th>Notes</th>
+    </tr>
+
+    <tr>
+      <td class="code">t.malloc()</td>
+
+      <td class="code">void *</td>
+
+      <td class="code">!t.empty()</td>
+
+      <td></td>
+
+      <td></td>
+
+      <td>Takes the first available chunk from the free list and returns it.
+      Order-preserving. O(1).</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.free(chunk)</td>
+
+      <td class="code">void</td>
+
+      <td><span class="code">chunk</span> was previously returned from a call
+      to <span class="code">t.malloc()</span></td>
+
+      <td class="code">!t.empty()</td>
+
+      <td></td>
+
+      <td>Places <span class="code">chunk</span> back on the free list. Note
+      that <span class="code">chunk</span> may not be <span class=
+      "code">0</span>. O(1).</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.ordered_free(chunk)</td>
+
+      <td class="code">void</td>
+
+      <td>Same as above</td>
+
+      <td class="code">!t.empty()</td>
+
+      <td></td>
+
+      <td>Places <span class="code">chunk</span> back on the free list. Note
+      that <span class="code">chunk</span> may not be <span class=
+      "code">0</span>. Order-preserving. O(N) with respect to the size of the
+      free list.</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.malloc_n(n, partition_sz)</td>
+
+      <td class="code">void *</td>
+
+      <td></td>
+
+      <td></td>
+
+      <td></td>
+
+      <td>Attempts to find a contiguous sequence of <span class=
+      "code">n</span> <span class="code">partition_sz</span>-sized chunks. If
+      found, removes them all from the free list and returns a pointer to the
+      first. If not found, returns <span class="code">0</span>. It is
+      strongly recommended (but not required) that the free list be ordered,
+      as this algorithm will fail to find a contiguous sequence unless it is
+      contiguous in the free list as well. Order-preserving. O(N) with
+      respect to the size of the free list.</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.free_n(chunk, n, partition_sz)</td>
+
+      <td class="code">void</td>
+
+      <td><span class="code">chunk</span> was previously returned from a call
+      to <span class="code">t.malloc_n(n, partition_sz)</span></td>
+
+      <td class="code">!t.empty()</td>
+
+      <td class="code">t.add_block(chunk, n * partition_sz,
+      partition_sz)</td>
+
+      <td>Assumes that <span class="code">chunk</span> actually refers to a
+      block of chunks spanning <span class="code">n * partition_sz</span>
+      bytes; segregates and adds in that block. Note that <span class=
+      "code">chunk</span> may not be <span class="code">0</span>. O(n).</td>
+    </tr>
+
+    <tr>
+      <td class="code">t.ordered_free_n(chunk, n, partition_sz)</td>
+
+      <td class="code">void</td>
+
+      <td>same as above</td>
+
+      <td>same as above</td>
+
+      <td class="code">t.add_ordered_block(chunk, n * partition_sz,
+      partition_sz)</td>
+
+      <td>Same as above, except it merges in the free list. Order-preserving.
+      O(N + n) where N is the size of the free list.</td>
+    </tr>
+  </table>
+
+  <h2>Symbols</h2>
+
+  <ul>
+    <li>boost::simple_segregated_storage</li>
+  </ul>
+
+  <h2><a href=
+  "../implementation/simple_segregated_storage.html">Implementation
+  Details</a></h2>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/interfaces/singleton_pool.html
===================================================================
--- boost/trunk/libs/pool/doc/interfaces/singleton_pool.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/interfaces/singleton_pool.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,25 +1,31 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>Singleton Pool</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>Singleton Pool</H1>
+  <title>Singleton Pool</title>
+</head>
 
-<P>
-<H2>Introduction</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-singleton_pool.hpp provides a template class <SPAN CLASS="code">singleton_pool</SPAN>, which provides access to a <SPAN CLASS="code">pool</SPAN> as a singleton object.  For information on other pool-based interfaces, see <A HREF="../interfaces.html">the other pool interfaces</A>.
+  <h1 align="center">Singleton Pool</h1>
 
-<P>
-<H2>Synopsis</H2>
+  <h2>Introduction</h2>
 
-<PRE CLASS="code">template &lt;typename Tag, unsigned RequestedSize,
+  <p>singleton_pool.hpp provides a template class <span class=
+  "code">singleton_pool</span>, which provides access to a <span class=
+  "code">pool</span> as a singleton object. For information on other
+  pool-based interfaces, see <a href="../interfaces.html">the other pool
+  interfaces</a>.</p>
+
+  <h2>Synopsis</h2>
+  <pre class="code">
+template &lt;typename Tag, unsigned RequestedSize,
     typename UserAllocator = default_user_allocator_new_delete&gt;
 struct singleton_pool
 {
@@ -50,108 +56,253 @@
 
     static bool release_memory();
     static bool purge_memory();
-};</PRE>
+};
+</pre>
 
-<P>
-<H2>Notes</H2>
+  <h2>Notes</h2>
 
-<P>
-The underlying pool <SPAN CLASS="code">p</SPAN> referenced by the static functions in <SPAN CLASS="code">singleton_pool</SPAN> is actually declared in a way that it is:
-<UL>
-<LI>Thread-safe if there is only one thread running before main() begins and after main() ends -- all of the static functions of <SPAN CLASS="code">singleton_pool</SPAN> synchronize their access to <SPAN CLASS="code">p</SPAN>.</LI>
-<LI>Guaranteed to be constructed before it is used -- thus, the simple static object in the synopsis above would actually be an incorrect implementation.  The actual <A HREF="../implementation/singleton_pool.html">implementation</A> to guarantee this is considerably more complicated.
-</UL>
+  <p>The underlying pool <span class="code">p</span> referenced by the static
+  functions in <span class="code">singleton_pool</span> is actually declared
+  in a way that it is:</p>
 
-<P>
-Note that a different underlying pool <SPAN CLASS="code">p</SPAN> exists for each different set of template parameters, including <A HREF="../implementation/singleton_pool.html">implementation-specific ones</A>.
+  <ul>
+    <li>Thread-safe if there is only one thread running before main() begins
+    and after main() ends -- all of the static functions of <span class=
+    "code">singleton_pool</span> synchronize their access to <span class=
+    "code">p</span>.</li>
 
-<P>
-<H2>Template Parameters</H2>
+    <li>Guaranteed to be constructed before it is used -- thus, the simple
+    static object in the synopsis above would actually be an incorrect
+    implementation. The actual <a href=
+    "../implementation/singleton_pool.html">implementation</a> to guarantee
+    this is considerably more complicated.</li>
+  </ul>
 
-<P>
-<H3>Tag</H3>
+  <p>Note that a different underlying pool <span class="code">p</span> exists
+  for each different set of template parameters, including <a href=
+  "../implementation/singleton_pool.html">implementation-specific
+  ones</a>.</p>
 
-<P>
-The <SPAN CLASS="code">Tag</SPAN> template parameter allows different unbounded sets of singleton pools to exist.  For example, the <A HREF="pool_alloc.html">pool allocators</A> use two tag classes to ensure that the two different allocator types never share the same underlying singleton pool.
+  <h2>Template Parameters</h2>
 
-<P>
-<SPAN CLASS="code">Tag</SPAN> is never actually used by <SPAN CLASS="code">singleton_pool</SPAN>.
+  <h3>Tag</h3>
 
-<P>
-<H3>RequestedSize</H3>
+  <p>The <span class="code">Tag</span> template parameter allows different
+  unbounded sets of singleton pools to exist. For example, the <a href=
+  "pool_alloc.html">pool allocators</a> use two tag classes to ensure that
+  the two different allocator types never share the same underlying singleton
+  pool.</p>
 
-<P>
-The requested size of memory chunks to allocate.  This is passed as a constructor parameter to the underlying <SPAN CLASS="code">pool</SPAN>.  Must be greater than 0.
+  <p><span class="code">Tag</span> is never actually used by <span class=
+  "code">singleton_pool</span>.</p>
 
-<P>
-<H3>UserAllocator</H3>
+  <h3>RequestedSize</h3>
 
-<P>
-Defines the method that the underlying <SPAN CLASS="code">pool</SPAN> will use to allocate memory from the system.  See <A HREF="user_allocator.html">User Allocators</A> for details.
+  <p>The requested size of memory chunks to allocate. This is passed as a
+  constructor parameter to the underlying <span class="code">pool</span>.
+  Must be greater than 0.</p>
 
-<P>
-<H2>Semantics</H2>
+  <h3>UserAllocator</h3>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Symbol Table</EM></CAPTION>
-<TR><TH>Symbol<TH>Meaning
-<TR><TD CLASS="code">SingletonPool<TD CLASS="code">singleton_pool&lt;Tag, RequestedSize, UserAllocator&gt;
-<TR><TD CLASS="code">chunk<TD>value of type <SPAN CLASS="code">void *</SPAN>
-<TR><TD CLASS="code">n<TD>value of type <SPAN CLASS="code">size_type</SPAN>
-</TABLE>
+  <p>Defines the method that the underlying <span class="code">pool</span>
+  will use to allocate memory from the system. See <a href=
+  "user_allocator.html">User Allocators</a> for details.</p>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Typedefs/Static Const Values</EM></CAPTION>
-<TR><TH>Expression<TH>Type/Value
-<TR><TD CLASS="code">SingletonPool::tag<TD CLASS="code">Tag
-<TR><TD CLASS="code">SingletonPool::user_allocator<TD CLASS="code">UserAllocator
-<TR><TD CLASS="code">SingletonPool::size_type<TD CLASS="code">pool&lt;UserAllocator&gt;::size_type
-<TR><TD CLASS="code">SingletonPool::difference_type<TD CLASS="code">pool&lt;UserAllocator&gt;::difference_type
-<TR><TD CLASS="code">SingletonPool::requested_size<TD CLASS="code">RequestedSize
-</TABLE>
+  <h2>Semantics</h2>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Functions</EM></CAPTION>
-<TR><TH>Expression<TH>Return Type<TH>Semantic Equivalent
-<TR><TD CLASS="code">SingletonPool::is_from(chunk)<TD CLASS="code">bool<TD><SPAN CLASS="code">SingletonPool::p.is_from(chunk);</SPAN> synchronized
-<TR><TD CLASS="code">SingletonPool::malloc()<TD CLASS="code">void *<TD><SPAN CLASS="code">SingletonPool::p.malloc();</SPAN> synchronized
-<TR><TD CLASS="code">SingletonPool::ordered_malloc(n)<TD CLASS="code">void *<TD><SPAN CLASS="code">SingletonPool::p.ordered_malloc(n);</SPAN> synchronized
-<TR><TD CLASS="code">SingletonPool::free(chunk)<TD CLASS="code">void<TD><SPAN CLASS="code">SingletonPool::p.free(chunk);</SPAN> synchronized
-<TR><TD CLASS="code">SingletonPool::ordered_free(chunk)<TD CLASS="code">void<TD><SPAN CLASS="code">SingletonPool::p.ordered_free(chunk);</SPAN> synchronized
-<TR><TD CLASS="code">SingletonPool::free(chunk, n)<TD CLASS="code">void<TD><SPAN CLASS="code">SingletonPool::p.free(chunk, n);</SPAN> synchronized
-<TR><TD CLASS="code">SingletonPool::ordered_free(chunk, n)<TD CLASS="code">void<TD><SPAN CLASS="code">SingletonPool::p.ordered_free(chunk, n);</SPAN> synchronized
-<TR><TD CLASS="code">SingletonPool::release_memory()<TD CLASS="code">bool<TD><SPAN CLASS="code">SingletonPool::p.release_memory();</SPAN> synchronized
-<TR><TD CLASS="code">SingletonPool::purge_memory()<TD CLASS="code">bool<TD><SPAN CLASS="code">SingletonPool::p.purge_memory();</SPAN> synchronized
-</TABLE>
+  <table border align="center" summary="">
+    <caption>
+      <em>Symbol Table</em>
+    </caption>
 
-<P>
-For more information on the semantics of these functions, see the <A HREF="pool.html">pool interface</A>.
+    <tr>
+      <th>Symbol</th>
 
-<P>
-<H2>Symbols</H2>
+      <th>Meaning</th>
+    </tr>
 
-<P>
-<UL>
-<LI>boost::singleton_pool</LI>
-</UL>
+    <tr>
+      <td class="code">SingletonPool</td>
 
-<P>
-<H2><A HREF="../implementation/singleton_pool.html">Implementation Details</A></H2>
+      <td class="code">singleton_pool&lt;Tag, RequestedSize,
+      UserAllocator&gt;</td>
+    </tr>
 
-<P>
-<HR>
+    <tr>
+      <td class="code">chunk</td>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+      <td>value of type <span class="code">void *</span></td>
+    </tr>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+    <tr>
+      <td class="code">n</td>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
+      <td>value of type <span class="code">size_type</span></td>
+    </tr>
+  </table><br>
 
-</BODY>
-</HTML>
\ No newline at end of file
+  <table border align="center" summary="">
+    <caption>
+      <em>Typedefs/Static Const Values</em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Type/Value</th>
+    </tr>
+
+    <tr>
+      <td class="code">SingletonPool::tag</td>
+
+      <td class="code">Tag</td>
+    </tr>
+
+    <tr>
+      <td class="code">SingletonPool::user_allocator</td>
+
+      <td class="code">UserAllocator</td>
+    </tr>
+
+    <tr>
+      <td class="code">SingletonPool::size_type</td>
+
+      <td class="code">pool&lt;UserAllocator&gt;::size_type</td>
+    </tr>
+
+    <tr>
+      <td class="code">SingletonPool::difference_type</td>
+
+      <td class="code">pool&lt;UserAllocator&gt;::difference_type</td>
+    </tr>
+
+    <tr>
+      <td class="code">SingletonPool::requested_size</td>
+
+      <td class="code">RequestedSize</td>
+    </tr>
+  </table><br>
+
+  <table border align="center" summary="">
+    <caption>
+      <em>Functions</em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Return Type</th>
+
+      <th>Semantic Equivalent</th>
+    </tr>
+
+    <tr>
+      <td class="code">SingletonPool::is_from(chunk)</td>
+
+      <td class="code">bool</td>
+
+      <td><span class="code">SingletonPool::p.is_from(chunk);</span>
+      synchronized</td>
+    </tr>
+
+    <tr>
+      <td class="code">SingletonPool::malloc()</td>
+
+      <td class="code">void *</td>
+
+      <td><span class="code">SingletonPool::p.malloc();</span>
+      synchronized</td>
+    </tr>
+
+    <tr>
+      <td class="code">SingletonPool::ordered_malloc(n)</td>
+
+      <td class="code">void *</td>
+
+      <td><span class="code">SingletonPool::p.ordered_malloc(n);</span>
+      synchronized</td>
+    </tr>
+
+    <tr>
+      <td class="code">SingletonPool::free(chunk)</td>
+
+      <td class="code">void</td>
+
+      <td><span class="code">SingletonPool::p.free(chunk);</span>
+      synchronized</td>
+    </tr>
+
+    <tr>
+      <td class="code">SingletonPool::ordered_free(chunk)</td>
+
+      <td class="code">void</td>
+
+      <td><span class="code">SingletonPool::p.ordered_free(chunk);</span>
+      synchronized</td>
+    </tr>
+
+    <tr>
+      <td class="code">SingletonPool::free(chunk, n)</td>
+
+      <td class="code">void</td>
+
+      <td><span class="code">SingletonPool::p.free(chunk, n);</span>
+      synchronized</td>
+    </tr>
+
+    <tr>
+      <td class="code">SingletonPool::ordered_free(chunk, n)</td>
+
+      <td class="code">void</td>
+
+      <td><span class="code">SingletonPool::p.ordered_free(chunk, n);</span>
+      synchronized</td>
+    </tr>
+
+    <tr>
+      <td class="code">SingletonPool::release_memory()</td>
+
+      <td class="code">bool</td>
+
+      <td><span class="code">SingletonPool::p.release_memory();</span>
+      synchronized</td>
+    </tr>
+
+    <tr>
+      <td class="code">SingletonPool::purge_memory()</td>
+
+      <td class="code">bool</td>
+
+      <td><span class="code">SingletonPool::p.purge_memory();</span>
+      synchronized</td>
+    </tr>
+  </table>
+
+  <p>For more information on the semantics of these functions, see the
+  <a href="pool.html">pool interface</a>.</p>
+
+  <h2>Symbols</h2>
+
+  <ul>
+    <li>boost::singleton_pool</li>
+  </ul>
+
+  <h2><a href="../implementation/singleton_pool.html">Implementation
+  Details</a></h2>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See 
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/interfaces/user_allocator.html
===================================================================
--- boost/trunk/libs/pool/doc/interfaces/user_allocator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/interfaces/user_allocator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,59 +1,130 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>Pool</TITLE>
-<LINK HREF="../pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="../pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>User Allocators</H1>
+  <title>Pool</title>
+</head>
 
-<P>
-<H2>Introduction</H2>
+<body>
+  <img src="../../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-Pool objects need to request memory blocks from the system, which the Pool then splits into chunks to allocate to the user.  By specifying a <SPAN CLASS="code">UserAllocator</SPAN> template parameter to various Pool interfaces, users can control how those system memory blocks are allocated.
+  <h1 align="center">User Allocators</h1>
 
-<P>
-<H2>Semantics</H2>
+  <h2>Introduction</h2>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Symbol Table</EM></CAPTION>
-<TR><TH>Symbol<TH>Meaning
-<TR><TD CLASS="code">UserAllocator<TD>A User Allocator type
-<TR><TD CLASS="code">block<TD>value of type <SPAN CLASS="code">char *</SPAN>
-<TR><TD CLASS="code">n<TD>value of type <SPAN CLASS="code">UserAllocator::size_type</SPAN>
-</TABLE>
+  <p>Pool objects need to request memory blocks from the system, which the
+  Pool then splits into chunks to allocate to the user. By specifying a
+  <span class="code">UserAllocator</span> template parameter to various Pool
+  interfaces, users can control how those system memory blocks are
+  allocated.</p>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Typedefs</EM></CAPTION>
-<TR><TH>Expression<TH>Type
-<TR><TD CLASS="code">UserAllocator::size_type<TD>An unsigned integral type that can represent the size of the largest object to be allocated
-<TR><TD CLASS="code">UserAllocator::difference_type<TD>A signed integral type that can represent the difference of any two pointers
-</TABLE>
+  <h2>Semantics</h2>
 
-<P>
-<TABLE BORDER ALIGN=CENTER>
-<CAPTION><EM>Allocation and Deallocation</EM></CAPTION>
-<TR><TH>Expression<TH>Return Type<TH>Pre-Condition/Notes
-<TR><TD CLASS="code">UserAllocator::malloc(n)<TD CLASS="code">char *<TD>Attempts to allocate <SPAN CLASS="code">n</SPAN> bytes from the system.  Returns 0 if out-of-memory.
-<TR><TD CLASS="code">UserAllocator::free(block)<TD CLASS="code">void<TD><SPAN CLASS="code">block</SPAN> must have been previously returned from a call to <SPAN CLASS="code">UserAllocator::malloc</SPAN>.
-</TABLE>
+  <table border align="center" summary="">
+    <caption>
+      <em>Symbol Table</em>
+    </caption>
 
-<P>
-<H2>Provided Implementations</H2>
+    <tr>
+      <th>Symbol</th>
 
-<P>
-There are two <SPAN CLASS="code">UserAllocator</SPAN> classes provided.  Both of them are in pool.hpp (see <A HREF="pool.html">pool</A>).  The default value for the template parameter <SPAN CLASS="code">UserAllocator</SPAN> is always <SPAN CLASS="code">default_user_allocator_new_delete</SPAN>.
+      <th>Meaning</th>
+    </tr>
 
-<P>
-<H3>Synopsis</H3>
+    <tr>
+      <td class="code">UserAllocator</td>
 
-<PRE CLASS="code">struct default_user_allocator_new_delete
+      <td>A User Allocator type</td>
+    </tr>
+
+    <tr>
+      <td class="code">block</td>
+
+      <td>value of type <span class="code">char *</span></td>
+    </tr>
+
+    <tr>
+      <td class="code">n</td>
+
+      <td>value of type <span class=
+      "code">UserAllocator::size_type</span></td>
+    </tr>
+  </table><br>
+
+  <table border align="center" summary="">
+    <caption>
+      <em>Typedefs</em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Type</th>
+    </tr>
+
+    <tr>
+      <td class="code">UserAllocator::size_type</td>
+
+      <td>An unsigned integral type that can represent the size of the
+      largest object to be allocated</td>
+    </tr>
+
+    <tr>
+      <td class="code">UserAllocator::difference_type</td>
+
+      <td>A signed integral type that can represent the difference of any two
+      pointers</td>
+    </tr>
+  </table><br>
+
+  <table border align="center" summary="">
+    <caption>
+      <em>Allocation and Deallocation</em>
+    </caption>
+
+    <tr>
+      <th>Expression</th>
+
+      <th>Return Type</th>
+
+      <th>Pre-Condition/Notes</th>
+    </tr>
+
+    <tr>
+      <td class="code">UserAllocator::malloc(n)</td>
+
+      <td class="code">char *</td>
+
+      <td>Attempts to allocate <span class="code">n</span> bytes from the
+      system. Returns 0 if out-of-memory.</td>
+    </tr>
+
+    <tr>
+      <td class="code">UserAllocator::free(block)</td>
+
+      <td class="code">void</td>
+
+      <td><span class="code">block</span> must have been previously returned
+      from a call to <span class="code">UserAllocator::malloc</span>.</td>
+    </tr>
+  </table>
+
+  <h2>Provided Implementations</h2>
+
+  <p>There are two <span class="code">UserAllocator</span> classes provided.
+  Both of them are in pool.hpp (see <a href="pool.html">pool</a>). The
+  default value for the template parameter <span class=
+  "code">UserAllocator</span> is always <span class=
+  "code">default_user_allocator_new_delete</span>.</p>
+
+  <h3>Synopsis</h3>
+  <pre class="code">
+struct default_user_allocator_new_delete
 {
   typedef std::size_t size_type;
   typedef std::ptrdiff_t difference_type;
@@ -73,19 +144,24 @@
   { return reinterpret_cast&lt;char *&gt;(std::malloc(bytes)); }
   static void free(char * const block)
   { std::free(block); }
-};</PRE>
+};
+</pre>
+  <hr>
 
-<P>
-<HR>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="../copyright.html">copyright.html</A>
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT
+  com)</i></p>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
-
-</BODY>
-</HTML>
\ No newline at end of file
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
+  or copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/interfaces.html
===================================================================
--- boost/trunk/libs/pool/doc/interfaces.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/interfaces.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,137 +1,153 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 
-<HTML>
-<HEAD>
-<TITLE>Boost Pool Interfaces</TITLE>
-<LINK HREF="pool.css" REL="stylesheet" TYPE="text/css">
-</HEAD>
-<BODY>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
 
-<IMG SRC="../../../boost.png" WIDTH=276 HEIGHT=86 ALT="C++ Boost">
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link href="pool.css" rel="stylesheet" type="text/css">
 
-<H1 ALIGN=CENTER>Boost Pool Interfaces</H1>
+  <title>Boost Pool Interfaces</title>
+</head>
 
-<P>
-<H2>Introduction</H2>
+<body>
+  <img src="../../../boost.png" width="276" height="86" alt="C++ Boost">
 
-<P>
-There are several interfaces provided which allow users great flexibility in how they want to use Pools.  Review the <A HREF="concepts.html">concepts document</A> to get the basic understanding of how Pools work.
+  <h1 align="center">Boost Pool Interfaces</h1>
 
-<P>
-<H2>Terminology and Tradeoffs</H2>
+  <h2>Introduction</h2>
 
-<P>
-<H3>Object Usage vs. Singleton Usage</H3>
+  <p>There are several interfaces provided which allow users great flexibility 
+  in how they want to use Pools. Review the <a href=
+  "concepts.html">concepts document</a> to get the basic understanding of how 
+  Pools work.</p>
 
-<P>
-<EM>Object Usage</EM> is the method where each Pool is an object that may be created and destroyed.  Destroying a Pool implicitly frees all chunks that have been allocated from it.
+  <h2>Terminology and Tradeoffs</h2>
 
-<P>
-<EM>Singleton Usage</EM> is the method where each Pool is an object with static duration; that is, it will not be destroyed until program exit.  Pool objects with Singleton Usage may be shared; thus, Singleton Usage implies thread-safety as well.  System memory allocated by Pool objects with Singleton Usage may be freed through <SPAN CLASS="code">release_memory</SPAN> or <SPAN CLASS="code">purge_memory</SPAN>.
+  <h3>Object Usage vs. Singleton Usage</h3>
 
-<P>
-<H3>Out-of-Memory Conditions: Exceptions vs. Null Return</H3>
+  <p><em>Object Usage</em> is the method where each Pool is an object that may 
+  be created and destroyed. Destroying a Pool implicitly frees all chunks that 
+  have been allocated from it.</p>
 
-<P>
-Some Pool interfaces throw exceptions when out-of-memory; others will return 0.  In general, unless mandated by the Standard, Pool interfaces will always prefer to return 0 instead of throw an exception.
+  <p><em>Singleton Usage</em> is the method where each Pool is an object with 
+  static duration; that is, it will not be destroyed until program exit. Pool 
+  objects with Singleton Usage may be shared; thus, Singleton Usage implies 
+  thread-safety as well. System memory allocated by Pool objects with 
+  Singleton Usage may be freed through <span class=
+  "code">release_memory</span> or <span class="code">purge_memory</span>.</p>
 
-<P>
-<H2>The Interfaces</H2>
+  <h3>Out-of-Memory Conditions: Exceptions vs. Null Return</h3>
 
-<P>
-<H3>pool</H3>
+  <p>Some Pool interfaces throw exceptions when out-of-memory; others will 
+  return 0. In general, unless mandated by the Standard, Pool interfaces will 
+  always prefer to return 0 instead of throw an exception.</p>
 
-<P>
-The <A HREF="interfaces/pool.html">pool interface</A> is a simple Object Usage interface with Null Return.
+  <h2>The Interfaces</h2>
 
-<P>
-Example:
-<PRE CLASS="code">void func()
+  <h3>pool</h3>
+
+  <p>The <a href="interfaces/pool.html">pool interface</a> is a simple Object 
+  Usage interface with Null Return.</p>
+
+  <p>Example:</p>
+  <pre class="code">
+void func()
 {
   boost::pool&lt;&gt; p(sizeof(int));
-  for (int i = 0; i < 10000; ++i)
+  for (int i = 0; i &lt; 10000; ++i)
   {
     int * const t = p.malloc();
     ... // Do something with t; don't take the time to free() it
   }
-} // on function exit, p is destroyed, and all malloc()'ed ints are implicitly freed</PRE>
+} // on function exit, p is destroyed, and all malloc()'ed ints are implicitly freed
+</pre>
 
-<P>
-<H3>object_pool</H3>
+  <h3>object_pool</h3>
 
-<P>
-The <A HREF="interfaces/object_pool.html">object_pool interface</A> is an Object Usage interface with Null Return, but is aware of the type of the object for which it is allocating chunks.  On destruction, any chunks that have been allocated from that object_pool will have their destructors called.
+  <p>The <a href="interfaces/object_pool.html">object_pool interface</a> is an 
+  Object Usage interface with Null Return, but is aware of the type of the 
+  object for which it is allocating chunks. On destruction, any chunks that 
+  have been allocated from that object_pool will have their destructors 
+  called.</p>
 
-<P>
-Example:
-<PRE CLASS="code">struct X { ... }; // has destructor with side-effects
+  <p>Example:</p>
+  <pre class="code">
+struct X { ... }; // has destructor with side-effects
 
 void func()
 {
   boost::object_pool&lt;X&gt; p;
-  for (int i = 0; i < 10000; ++i)
+  for (int i = 0; i &lt; 10000; ++i)
   {
     X * const t = p.malloc();
     ... // Do something with t; don't take the time to free() it
   }
-} // on function exit, p is destroyed, and all destructors for the X objects are called</PRE>
+} // on function exit, p is destroyed, and all destructors for the X objects are called
+</pre>
 
-<P>
-<H3>singleton_pool</H3>
+  <h3>singleton_pool</h3>
 
-<P>
-The <A HREF="interfaces/singleton_pool.html">singleton_pool interface</A> is a Singleton Usage interface with Null Return.  It's just the same as the pool interface but with Singleton Usage instead.
+  <p>The <a href="interfaces/singleton_pool.html">singleton_pool interface</a> 
+  is a Singleton Usage interface with Null Return. It's just the same as the 
+  pool interface but with Singleton Usage instead.</p>
 
-<P>
-Example:
-<PRE CLASS="code">struct MyPoolTag { };
+  <p>Example:</p>
+  <pre class="code">
+struct MyPoolTag { };
 
 typedef boost::singleton_pool&lt;MyPoolTag, sizeof(int)&gt; my_pool;
 void func()
 {
-  for (int i = 0; i < 10000; ++i)
+  for (int i = 0; i &lt; 10000; ++i)
   {
     int * const t = my_pool::malloc();
     ... // Do something with t; don't take the time to free() it
   }
   // Explicitly free all malloc()'ed int's
   my_pool::purge_memory();
-}</PRE>
+}
+</pre>
 
-<P>
-<H3>pool_alloc</H3>
+  <h3>pool_alloc</h3>
 
-<P>
-The <A HREF="interfaces/pool_alloc.html">pool_alloc interface</A> is a Singleton Usage interface with Exceptions.  It is built on the singleton_pool interface, and provides a Standard Allocator-compliant class (for use in containers, etc.).
+  <p>The <a href="interfaces/pool_alloc.html">pool_alloc interface</a> is a 
+  Singleton Usage interface with Exceptions. It is built on the singleton_pool 
+  interface, and provides a Standard Allocator-compliant class (for use in 
+  containers, etc.).</p>
 
-<P>
-Example:
-<PRE CLASS="code">void func()
+  <p>Example:</p>
+  <pre class="code">
+void func()
 {
   std::vector&lt;int, boost::pool_allocator&lt;int&gt; &gt; v;
-  for (int i = 0; i < 10000; ++i)
+  for (int i = 0; i &lt; 10000; ++i)
     v.push_back(13);
 } // Exiting the function does NOT free the system memory allocated by the pool allocator
   // You must call
   //  boost::singleton_pool&lt;boost::pool_allocator_tag, sizeof(int)&gt;::release_memory()
-  // in order to force that</PRE>
+  // in order to force that
+</pre>
 
-<P>
-<H2>Future Directions</H2>
+  <h2>Future Directions</h2>
 
-<P>
-Another pool interface will be written: a base class for per-class pool allocation.  This &quot;pool_base&quot; interface will be Singleton Usage with Exceptions, and built on the singleton_pool interface.
+  <p>Another pool interface will be written: a base class for per-class pool 
+  allocation. This &quot;pool_base&quot; interface will be Singleton Usage with 
+  Exceptions, and built on the singleton_pool interface.</p>
+  <hr>
 
-<P>
-<HR>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<P>
-Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
 
-<P>
-This file can be redistributed and/or modified under the terms found in <A HREF="copyright.html">copyright.html</A>
+  <p><i>Copyright &copy; 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)</i></p>
 
-<P>
-This software and its documentation is provided &quot;as is&quot; without express or implied warranty, and with no claim as to its suitability for any purpose.
-
-</BODY>
-</HTML>
\ No newline at end of file
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See 
+  accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or 
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/pool/doc/pool.css
===================================================================
--- boost/trunk/libs/pool/doc/pool.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/doc/pool.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,9 @@
 /*
    Copyright (C) 2000 Stephen Cleary
 
-   This file can be redistributed and/or modified under the terms found
-    in "copyright.html"
-   This software and its documentation is provided "as is" without express or
-    implied warranty, and with no claim as to its suitability for any purpose.
+   Distributed under the Boost Software License, Version 1.0. (See accompany-
+   ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 */
 
 *.code { font-family: monospace; }
-*.m4 { white-space: pre; font-family: monospace; font-size: 75% }
+*.m4 { white-space: pre; font-family: monospace; font-size: 75% }
\ No newline at end of file

Modified: boost/trunk/libs/pool/index.html
===================================================================
--- boost/trunk/libs/pool/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/pool/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,10 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="doc/index.html">doc/index.html</a>.
+<a href="doc/index.html">doc/index.html</a>.&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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

Modified: boost/trunk/libs/preprocessor/doc/acknowledgements.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/acknowledgements.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/acknowledgements.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -43,13 +43,16 @@
 		In particular, thanks to Aleksey Gurtovoy for his suggestions and to Ralf W. Grosse-Kunstleve for providing
 		access to several compilers for testing.
 	</div>
-<hr size="1">
-<div style="margin-left: 0px;">
-	<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
-</div>
-<div style="margin-left: 0px;">
-Permission to copy, use, modify, sell and distribute this document is granted provided this copyright notice appears in all copies.&nbsp;
-This document is provided "as is" without express or implied warranty and with no claim as to its suitability for any purpose.
-</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/bibliography.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/bibliography.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/bibliography.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -43,13 +43,16 @@
 		<td>Abelson, Sussman, Sussman:&nbsp; <i>Structure and Interpretation of Computer Programs</i>, ISBN 0521576814</td>
 	</tr>
 </table>
-<hr size="1">
-<div style="margin-left: 0px;">
-	<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
-</div>
-<div style="margin-left: 0px;">
-Permission to copy, use, modify, sell and distribute this document is granted provided this copyright notice appears in all copies.&nbsp;
-This document is provided "as is" without express or implied warranty and with no claim as to its suitability for any purpose.
-</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/contents.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/contents.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/contents.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,5 +17,13 @@
 <h4><a href="examples.html">Examples</h4>
 <h4><a href="miscellanea.html">Miscellanea</h4>
 
+<!--
+© Copyright Housemarque Oy 2002
+© Copyright Paul Mensonides 2002
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 </body>
 </html>	

Modified: boost/trunk/libs/preprocessor/doc/data/arrays.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/data/arrays.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/data/arrays.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -38,5 +38,16 @@
 			<li><a href="../ref/array_elem.html">BOOST_PP_ARRAY_ELEM</a></li>
 			<li><a href="../ref/array_size.html">BOOST_PP_ARRAY_SIZE</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/data/lists.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/data/lists.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/data/lists.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -31,5 +31,16 @@
 			<li><a href="../ref/list_rest.html">BOOST_PP_LIST_REST</a></li>
 			<li><a href="../ref/nil.html">BOOST_PP_NIL</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/data/sequences.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/data/sequences.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/data/sequences.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -60,5 +60,16 @@
 			<li>
 				<a href="../ref/seq_elem.html">BOOST_PP_SEQ_ELEM</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/data/tuples.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/data/tuples.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/data/tuples.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -27,5 +27,16 @@
 		<ul>
 			<li><a href="../ref/tuple_elem.html">BOOST_PP_TUPLE_ELEM</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/data.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/data.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/data.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,5 +14,14 @@
 			<li><a href="data/sequences.html">sequences</a></li>
 			<li><a href="data/tuples.html">tuples</a></li>
 		</ul>
+
+<!--
+© Copyright Housemarque Oy 2002
+© Copyright Paul Mensonides 2002
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/examples.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/examples.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/examples.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,5 +14,14 @@
 	<li><a href="examples/is_integral.cpp">is_integral.cpp</a></li>
 	<li><a href="examples/linear_fib.c">linear_fib.c</a></li>
 </ul>
+
+<!--
+© Copyright Housemarque Oy 2002
+© Copyright Paul Mensonides 2002
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/arithmetic/add.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/arithmetic/add.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/arithmetic/add.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/add.html">BOOST_PP_ADD</a></li>
 			<li><a href="../../ref/add_d.html">BOOST_PP_ADD_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/arithmetic/dec.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/arithmetic/dec.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/arithmetic/dec.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/dec.html">BOOST_PP_DEC</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/arithmetic/div.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/arithmetic/div.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/arithmetic/div.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/div.html">BOOST_PP_DIV</a></li>
 			<li><a href="../../ref/div_d.html">BOOST_PP_DIV_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/arithmetic/inc.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/arithmetic/inc.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/arithmetic/inc.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/inc.html">BOOST_PP_INC</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/arithmetic/mod.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/arithmetic/mod.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/arithmetic/mod.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/mod.html">BOOST_PP_MOD</a></li>
 			<li><a href="../../ref/mod_d.html">BOOST_PP_MOD_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/arithmetic/mul.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/arithmetic/mul.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/arithmetic/mul.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/mul.html">BOOST_PP_MUL</a></li>
 			<li><a href="../../ref/mul_d.html">BOOST_PP_MUL_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/arithmetic/sub.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/arithmetic/sub.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/arithmetic/sub.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/sub.html">BOOST_PP_SUB</a></li>
 			<li><a href="../../ref/sub_d.html">BOOST_PP_SUB_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/arithmetic.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/arithmetic.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/arithmetic.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,5 +21,16 @@
 			<li><a href="arithmetic/mul.html">&lt;boost/preprocessor/arithmetic/mul.hpp&gt;</a></li>
 			<li><a href="arithmetic/sub.html">&lt;boost/preprocessor/arithmetic/sub.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/array/data.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/array/data.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/array/data.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/array_data.html">BOOST_PP_ARRAY_DATA</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/array/elem.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/array/elem.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/array/elem.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/array_elem.html">BOOST_PP_ARRAY_ELEM</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/array/insert.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/array/insert.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/array/insert.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/array_insert.html">BOOST_PP_ARRAY_INSERT</a></li>
 			<li><a href="../../ref/array_insert_d.html">BOOST_PP_ARRAY_INSERT_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/array/pop_back.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/array/pop_back.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/array/pop_back.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/array_pop_back.html">BOOST_PP_ARRAY_POP_BACK</a></li>
 			<li><a href="../../ref/array_pop_back_z.html">BOOST_PP_ARRAY_POP_BACK_Z</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/array/pop_front.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/array/pop_front.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/array/pop_front.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/array_pop_front.html">BOOST_PP_ARRAY_POP_FRONT</a></li>
 			<li><a href="../../ref/array_pop_front_z.html">BOOST_PP_ARRAY_POP_FRONT_Z</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/array/push_back.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/array/push_back.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/array/push_back.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/array_push_back.html">BOOST_PP_ARRAY_PUSH_BACK</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/array/push_front.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/array/push_front.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/array/push_front.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/array_push_front.html">BOOST_PP_ARRAY_PUSH_FRONT</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/array/remove.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/array/remove.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/array/remove.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/array_remove.html">BOOST_PP_ARRAY_REMOVE</a></li>
 			<li><a href="../../ref/array_remove_d.html">BOOST_PP_ARRAY_REMOVE_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/array/replace.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/array/replace.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/array/replace.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/array_replace.html">BOOST_PP_ARRAY_REPLACE</a></li>
 			<li><a href="../../ref/array_replace_d.html">BOOST_PP_ARRAY_REPLACE_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/array/reverse.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/array/reverse.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/array/reverse.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/array_reverse.html">BOOST_PP_ARRAY_REVERSE</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/array/size.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/array/size.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/array/size.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/array_size.html">BOOST_PP_ARRAY_SIZE</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/array.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/array.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/array.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -25,5 +25,16 @@
 			<li><a href="array/reverse.html">&lt;boost/preprocessor/array/reverse.hpp&gt;</a></li>
 			<li><a href="array/size.html">&lt;boost/preprocessor/array/size.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/assert_msg.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/assert_msg.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/assert_msg.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="debug/assert.html">&lt;boost/preprocessor/debug/assert.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/cat.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/cat.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/cat.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../ref/cat.html">BOOST_PP_CAT</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/comma.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/comma.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/comma.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="punctuation/comma.html">&lt;boost/preprocessor/punctuation/comma.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/comma_if.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/comma_if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/comma_if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="punctuation/comma_if.html">&lt;boost/preprocessor/punctuation/comma_if.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/comparison/equal.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/comparison/equal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/comparison/equal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/equal.html">BOOST_PP_EQUAL</a></li>
 			<li><a href="../../ref/equal_d.html">BOOST_PP_EQUAL_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/comparison/greater.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/comparison/greater.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/comparison/greater.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/greater.html">BOOST_PP_GREATER</a></li>
 			<li><a href="../../ref/greater_d.html">BOOST_PP_GREATER_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/comparison/greater_equal.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/comparison/greater_equal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/comparison/greater_equal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/greater_equal.html">BOOST_PP_GREATER_EQUAL</a></li>
 			<li><a href="../../ref/greater_equal_d.html">BOOST_PP_GREATER_EQUAL_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/comparison/less.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/comparison/less.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/comparison/less.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/less.html">BOOST_PP_LESS</a></li>
 			<li><a href="../../ref/less_d.html">BOOST_PP_LESS_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/comparison/less_equal.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/comparison/less_equal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/comparison/less_equal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/less_equal.html">BOOST_PP_LESS_EQUAL</a></li>
 			<li><a href="../../ref/less_equal_d.html">BOOST_PP_LESS_EQUAL_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/comparison/not_equal.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/comparison/not_equal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/comparison/not_equal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/not_equal.html">BOOST_PP_NOT_EQUAL</a></li>
 			<li><a href="../../ref/not_equal_d.html">BOOST_PP_NOT_EQUAL_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/comparison.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/comparison.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/comparison.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,5 +20,16 @@
 			<li><a href="comparison/less_equal.html">&lt;boost/preprocessor/comparison/less_equal.hpp&gt;</a></li>
 			<li><a href="comparison/not_equal.html">&lt;boost/preprocessor/comparison/not_equal.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/config/limits.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/config/limits.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/config/limits.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -29,5 +29,16 @@
 			<li><a href="../../ref/limit_tuple.html">BOOST_PP_LIMIT_TUPLE</a></li>
 			<li><a href="../../ref/limit_while.html">BOOST_PP_LIMIT_WHILE</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/control/deduce_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/control/deduce_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/control/deduce_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/deduce_d.html">BOOST_PP_DEDUCE_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/control/expr_if.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/control/expr_if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/control/expr_if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/expr_if.html">BOOST_PP_EXPR_IF</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/control/expr_iif.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/control/expr_iif.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/control/expr_iif.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/expr_iif.html">BOOST_PP_EXPR_IIF</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/control/if.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/control/if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/control/if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/if.html">BOOST_PP_IF</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/control/iif.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/control/iif.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/control/iif.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/iif.html">BOOST_PP_IIF</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/control/while.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/control/while.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/control/while.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/while.html">BOOST_PP_WHILE</a></li>
 			<li><a href="../../ref/while_d.html">BOOST_PP_WHILE_<i>d</i></a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/control.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/control.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/control.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,5 +20,16 @@
 			<li><a href="control/iif.html">&lt;boost/preprocessor/control/iif.hpp&gt;</a></li>
 			<li><a href="control/while.html">&lt;boost/preprocessor/control/while.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/debug/assert.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/debug/assert.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/debug/assert.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/assert.html">BOOST_PP_ASSERT</a></li>
 			<li><a href="../../ref/assert_msg.html">BOOST_PP_ASSERT_MSG</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/debug/line.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/debug/line.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/debug/line.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/line.html">BOOST_PP_LINE</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/debug.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/debug.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/debug.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="debug/assert.html">&lt;boost/preprocessor/debug/assert.hpp&gt;</a></li>
 			<li><a href="debug/line.html">&lt;boost/preprocessor/debug/line.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/dec.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/dec.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/dec.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="arithmetic/dec.html">&lt;boost/preprocessor/arithmetic/dec.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/empty.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/empty.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/empty.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="facilities/empty.html">&lt;boost/preprocessor/facilities/empty.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/enum.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/enum.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/enum.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="repetition/enum.html">&lt;boost/preprocessor/repetition/enum.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/enum_params.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/enum_params.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/enum_params.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="repetition/enum_params.html">&lt;boost/preprocessor/repetition/enum_params.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/enum_shifted.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/enum_shifted.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/enum_shifted.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="repetition/enum_shifted.html">&lt;boost/preprocessor/repetition/enum_shifted.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/enum_shifted_params.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/enum_shifted_params.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/enum_shifted_params.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="repetition/enum_shifted_params.html">&lt;boost/preprocessor/repetition/enum_shifted_params.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/epwad.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/epwad.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/epwad.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="repetition/epwad.html">&lt;boost/preprocessor/repetition/enum_params_with_a_default.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/epwd.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/epwd.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/epwd.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="repetition/epwd.html">&lt;boost/preprocessor/repetition/enum_params_with_defaults.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/expand.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/expand.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/expand.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="facilities/expand.html">&lt;boost/preprocessor/facilities/expand.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/expr_if.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/expr_if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/expr_if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="control/expr_if.html">&lt;boost/preprocessor/control/expr_if.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/facilities/apply.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/facilities/apply.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/facilities/apply.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/apply.html">BOOST_PP_APPLY</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/facilities/empty.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/facilities/empty.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/facilities/empty.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/empty.html">BOOST_PP_EMPTY</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/facilities/expand.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/facilities/expand.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/facilities/expand.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/expand.html">BOOST_PP_EXPAND</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/facilities/identity.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/facilities/identity.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/facilities/identity.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/identity.html">BOOST_PP_IDENTITY</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/facilities/intercept.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/facilities/intercept.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/facilities/intercept.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/intercept.html">BOOST_PP_INTERCEPT</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/facilities.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/facilities.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/facilities.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 			<li><a href="facilities/identity.html">&lt;boost/preprocessor/facilities/identity.hpp&gt;</a></li>
 			<li><a href="facilities/intercept.html">&lt;boost/preprocessor/facilities/intercept.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/for.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/for.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/for.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="repetition/for.html">&lt;boost/preprocessor/repetition/for.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/identity.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/identity.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/identity.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="facilities/identity.html">&lt;boost/preprocessor/facilities/identity.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/if.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="control/if.html">&lt;boost/preprocessor/control/if.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/inc.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/inc.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/inc.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="arithmetic/inc.html">&lt;boost/preprocessor/arithmetic/inc.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/iterate.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/iterate.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/iterate.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="iteration/iterate.html">&lt;boost/preprocessor/iteration/iterate.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/iteration/iterate.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/iteration/iterate.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/iteration/iterate.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -28,5 +28,16 @@
 			<li><a href="../../ref/relative_iteration.html">BOOST_PP_RELATIVE_ITERATION</a></li>
 			<li><a href="../../ref/relative_start.html">BOOST_PP_RELATIVE_START</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/iteration/local.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/iteration/local.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/iteration/local.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/local_iterate.html">BOOST_PP_LOCAL_ITERATE</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/iteration/self.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/iteration/self.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/iteration/self.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/include_self.html">BOOST_PP_INCLUDE_SELF</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/iteration.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/iteration.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/iteration.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,5 +17,16 @@
 			<li><a href="iteration/local.html">&lt;boost/preprocessor/iteration/local.hpp&gt;</a></li>
 			<li><a href="iteration/self.html">&lt;boost/preprocessor/iteration/self.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/library.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/library.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/library.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,5 +11,16 @@
 		<div class="code">
 			#include <b>&lt;boost/preprocessor/library.hpp&gt;</b>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/limits.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/limits.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/limits.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/adt.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/adt.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/adt.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,5 +20,16 @@
 			<li><a href="../../ref/list_nil.html">BOOST_PP_LIST_NIL</a></li>
 			<li><a href="../../ref/list_rest.html">BOOST_PP_LIST_REST</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/append.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/append.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/append.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/list_append.html">BOOST_PP_LIST_APPEND</a></li>
 			<li><a href="../../ref/list_append_d.html">BOOST_PP_LIST_APPEND_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/at.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/at.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/at.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/list_at.html">BOOST_PP_LIST_AT</a></li>
 			<li><a href="../../ref/list_at_d.html">BOOST_PP_LIST_AT_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/cat.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/cat.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/cat.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/list_cat.html">BOOST_PP_LIST_CAT</a></li>
 			<li><a href="../../ref/list_cat_d.html">BOOST_PP_LIST_CAT_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/enum.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/enum.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/enum.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/list_enum.html">BOOST_PP_LIST_ENUM</a></li>
 			<li><a href="../../ref/list_enum_r.html">BOOST_PP_LIST_ENUM_R</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/filter.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/filter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/filter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/list_filter.html">BOOST_PP_LIST_FILTER</a></li>
 			<li><a href="../../ref/list_filter_d.html">BOOST_PP_LIST_FILTER_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/first_n.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/first_n.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/first_n.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/list_first_n.html">BOOST_PP_LIST_FIRST_N</a></li>
 			<li><a href="../../ref/list_first_n_d.html">BOOST_PP_LIST_FIRST_N_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/fold_left.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/fold_left.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/fold_left.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 			<li><a href="../../ref/list_fold_left_d.html">BOOST_PP_LIST_FOLD_LEFT_<i>d</i></a></li>
 			<li><a href="../../ref/list_fold_left_d_old.html">BOOST_PP_LIST_FOLD_LEFT_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/fold_right.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/fold_right.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/fold_right.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 			<li><a href="../../ref/list_fold_right_d.html">BOOST_PP_LIST_FOLD_RIGHT_<i>d</i></a></li>
 			<li><a href="../../ref/list_fold_right_d_old.html">BOOST_PP_LIST_FOLD_RIGHT_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/for_each.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/for_each.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/for_each.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/list_for_each.html">BOOST_PP_LIST_FOR_EACH</a></li>
 			<li><a href="../../ref/list_for_each_r.html">BOOST_PP_LIST_FOR_EACH_R</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/for_each_i.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/for_each_i.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/for_each_i.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/list_for_each_i.html">BOOST_PP_LIST_FOR_EACH_I</a></li>
 			<li><a href="../../ref/list_for_each_i_r.html">BOOST_PP_LIST_FOR_EACH_I_R</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/for_each_product.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/for_each_product.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/for_each_product.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/list_for_each_product.html">BOOST_PP_LIST_FOR_EACH_PRODUCT</a></li>
 			<li><a href="../../ref/list_for_each_product_r.html">BOOST_PP_LIST_FOR_EACH_PRODUCT_R</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/rest_n.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/rest_n.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/rest_n.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/list_rest_n.html">BOOST_PP_LIST_REST_N</a></li>
 			<li><a href="../../ref/list_rest_n_d.html">BOOST_PP_LIST_REST_N_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/reverse.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/reverse.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/reverse.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/list_reverse.html">BOOST_PP_LIST_REVERSE</a></li>
 			<li><a href="../../ref/list_reverse_d.html">BOOST_PP_LIST_REVERSE_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/size.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/size.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/size.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/list_size.html">BOOST_PP_LIST_SIZE</a></li>
 			<li><a href="../../ref/list_size_d.html">BOOST_PP_LIST_SIZE_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/to_tuple.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/to_tuple.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/to_tuple.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/list_to_tuple.html">BOOST_PP_LIST_TO_TUPLE</a></li>
 			<li><a href="../../ref/list_to_tuple_r.html">BOOST_PP_LIST_TO_TUPLE_R</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list/transform.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list/transform.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list/transform.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/list_transform.html">BOOST_PP_LIST_TRANSFORM</a></li>
 			<li><a href="../../ref/list_transform_d.html">BOOST_PP_LIST_TRANSFORM_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/list.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/list.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/list.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -31,5 +31,16 @@
 			<li><a href="list/to_tuple.html">&lt;boost/preprocessor/list/to_tuple.hpp&gt;</a></li>
 			<li><a href="list/transform.html">&lt;boost/preprocessor/list/transform.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/logical/and.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/logical/and.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/logical/and.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/and.html">BOOST_PP_AND</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/logical/bitand.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/logical/bitand.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/logical/bitand.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/bitand.html">BOOST_PP_BITAND</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/logical/bitnor.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/logical/bitnor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/logical/bitnor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/bitnor.html">BOOST_PP_BITNOR</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/logical/bitor.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/logical/bitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/logical/bitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/bitor.html">BOOST_PP_BITOR</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/logical/bitxor.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/logical/bitxor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/logical/bitxor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/bitxor.html">BOOST_PP_BITXOR</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/logical/bool.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/logical/bool.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/logical/bool.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/bool.html">BOOST_PP_BOOL</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/logical/compl.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/logical/compl.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/logical/compl.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/compl.html">BOOST_PP_COMPL</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/logical/nor.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/logical/nor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/logical/nor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/nor.html">BOOST_PP_NOR</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/logical/not.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/logical/not.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/logical/not.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/not.html">BOOST_PP_NOT</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/logical/or.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/logical/or.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/logical/or.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/or.html">BOOST_PP_OR</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/logical/xor.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/logical/xor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/logical/xor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/xor.html">BOOST_PP_XOR</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/logical.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/logical.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/logical.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -25,5 +25,16 @@
 			<li><a href="logical/or.html">&lt;boost/preprocessor/logical/or.hpp&gt;</a></li>
 			<li><a href="logical/xor.html">&lt;boost/preprocessor/logical/xor.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/max.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/max.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/max.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="selection/max.html">&lt;boost/preprocessor/selection/max.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/min.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/min.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/min.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="selection/min.html">&lt;boost/preprocessor/selection/min.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/preprocessor.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/preprocessor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/preprocessor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,5 +11,16 @@
 		<div class="code">
 			#include <b>&lt;boost/preprocessor.hpp&gt;</b>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/punctuation/comma.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/punctuation/comma.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/punctuation/comma.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/comma.html">BOOST_PP_COMMA</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/punctuation/comma_if.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/punctuation/comma_if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/punctuation/comma_if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/comma_if.html">BOOST_PP_COMMA_IF</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/punctuation/paren.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/punctuation/paren.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/punctuation/paren.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/lparen.html">BOOST_PP_LPAREN</a></li>
 			<li><a href="../../ref/rparen.html">BOOST_PP_RPAREN</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/punctuation/paren_if.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/punctuation/paren_if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/punctuation/paren_if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/lparen_if.html">BOOST_PP_LPAREN_IF</a></li>
 			<li><a href="../../ref/rparen_if.html">BOOST_PP_RPAREN_IF</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/punctuation.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/punctuation.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/punctuation.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,5 +18,16 @@
 			<li><a href="punctuation/paren.html">&lt;boost/preprocessor/punctuation/paren.hpp&gt;</a></li>
 			<li><a href="punctuation/paren_if.html">&lt;boost/preprocessor/punctuation/paren_if.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repeat.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repeat.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repeat.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="repetition/repeat.html">&lt;boost/preprocessor/repetition/repeat.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repeat_2nd.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repeat_2nd.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repeat_2nd.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="repetition/repeat.html">&lt;boost/preprocessor/repetition/repeat.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repeat_3rd.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repeat_3rd.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repeat_3rd.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="repetition/repeat.html">&lt;boost/preprocessor/repetition/repeat.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repeat_from_to.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repeat_from_to.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repeat_from_to.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="repetition/repeat_from_to.html">&lt;boost/preprocessor/repetition/repeat_from_to.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repeat_from_to_2nd.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repeat_from_to_2nd.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repeat_from_to_2nd.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="repetition/repeat_from_to.html">&lt;boost/preprocessor/repetition/repeat_from_to.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repeat_from_to_3rd.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repeat_from_to_3rd.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repeat_from_to_3rd.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="repetition/repeat_from_to.html">&lt;boost/preprocessor/repetition/repeat_from_to.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/deduce_r.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/deduce_r.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/deduce_r.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/deduce_r.html">BOOST_PP_DEDUCE_R</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/deduce_z.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/deduce_z.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/deduce_z.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/deduce_z.html">BOOST_PP_DEDUCE_Z</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/enum.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/enum.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/enum.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/enum.html">BOOST_PP_ENUM</a></li>
 			<li><a href="../../ref/enum_z.html">BOOST_PP_ENUM_<i>z</i></a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/enum_binary_params.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/enum_binary_params.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/enum_binary_params.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/enum_binary_params.html">BOOST_PP_ENUM_BINARY_PARAMS</a></li>
 			<li><a href="../../ref/enum_binary_params_z.html">BOOST_PP_ENUM_BINARY_PARAMS_Z</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/enum_params.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/enum_params.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/enum_params.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/enum_params.html">BOOST_PP_ENUM_PARAMS</a></li>
 			<li><a href="../../ref/enum_params_z.html">BOOST_PP_ENUM_PARAMS_Z</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/enum_shifted.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/enum_shifted.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/enum_shifted.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/enum_shifted.html">BOOST_PP_ENUM_SHIFTED</a></li>
 			<li><a href="../../ref/enum_shifted_z.html">BOOST_PP_ENUM_SHIFTED_<i>z</i></a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/enum_shifted_params.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/enum_shifted_params.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/enum_shifted_params.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/enum_shifted_params.html">BOOST_PP_ENUM_SHIFTED_PARAMS</a></li>
 			<li><a href="../../ref/enum_shifted_params_z.html">BOOST_PP_ENUM_SHIFTED_PARAMS_<i>z</i></a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/enum_trailing.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/enum_trailing.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/enum_trailing.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/enum_trailing.html">BOOST_PP_ENUM_TRAILING</a></li>
 			<li><a href="../../ref/enum_trailing_z.html">BOOST_PP_ENUM_TRAILING_<i>z</i></a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/enum_trailing_params.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/enum_trailing_params.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/enum_trailing_params.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/enum_trailing_params.html">BOOST_PP_ENUM_TRAILING_PARAMS</a></li>
 			<li><a href="../../ref/enum_trailing_params_z.html">BOOST_PP_ENUM_TRAILING_PARAMS_Z</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/epwad.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/epwad.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/epwad.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/enum_params_with_a_default.html">BOOST_PP_ENUM_PARAMS_WITH_A_DEFAULT</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/epwd.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/epwd.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/epwd.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/enum_params_with_defaults.html">BOOST_PP_ENUM_PARAMS_WITH_DEFAULTS</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/esbp.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/esbp.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/esbp.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/esbp.html">BOOST_PP_ENUM_SHIFTED_BINARY_PARAMS</a></li>
 			<li><a href="../../ref/esbpz.html">BOOST_PP_ENUM_SHIFTED_BINARY_PARAMS_Z</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/etbp.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/etbp.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/etbp.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/etbp.html">BOOST_PP_ENUM_TRAILING_BINARY_PARAMS</a></li>
 			<li><a href="../../ref/etbpz.html">BOOST_PP_ENUM_TRAILING_BINARY_PARAMS_Z</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/for.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/for.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/for.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/for.html">BOOST_PP_FOR</a></li>
 			<li><a href="../../ref/for_r.html">BOOST_PP_FOR_<i>r</i></a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/repeat.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/repeat.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/repeat.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 			<li><a href="../../ref/repeat_3rd.html">BOOST_PP_REPEAT_3RD</a></li>
 			<li><a href="../../ref/repeat_z.html">BOOST_PP_REPEAT_<i>z</i></a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition/repeat_from_to.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition/repeat_from_to.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition/repeat_from_to.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,5 +21,16 @@
 			<li><a href="../../ref/repeat_from_to_d_z.html">BOOST_PP_REPEAT_FROM_TO_D_<i>z</i></a></li>
 			<li><a href="../../ref/repeat_from_to_z.html">BOOST_PP_REPEAT_FROM_TO_<i>z</i></a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/repetition.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/repetition.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/repetition.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -29,5 +29,16 @@
 			<li><a href="repetition/repeat.html">&lt;boost/preprocessor/repetition/repeat.hpp&gt;</a></li>
 			<li><a href="repetition/repeat_from_to.html">&lt;boost/preprocessor/repetition/repeat_from_to.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/selection/max.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/selection/max.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/selection/max.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/max.html">BOOST_PP_MAX</a></li>
 			<li><a href="../../ref/max_d.html">BOOST_PP_MAX_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/selection/min.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/selection/min.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/selection/min.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/min.html">BOOST_PP_MIN</a></li>
 			<li><a href="../../ref/min_d.html">BOOST_PP_MIN_D</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/selection.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/selection.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/selection.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="selection/max.html">&lt;boost/preprocessor/selection/max.hpp&gt;</a></li>
 			<li><a href="selection/min.html">&lt;boost/preprocessor/selection/min.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/cat.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/cat.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/cat.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,5 +23,16 @@
 			<li>
 				<a href="../../ref/seq_cat_s.html">BOOST_PP_SEQ_CAT_S</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/elem.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/elem.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/elem.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,5 +20,16 @@
 			<li>
 				<a href="../../ref/seq_elem.html">BOOST_PP_SEQ_ELEM</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/enum.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/enum.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/enum.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,5 +20,16 @@
 			<li>
 				<a href="../../ref/seq_enum.html">BOOST_PP_SEQ_ENUM</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/filter.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/filter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/filter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,5 +22,16 @@
 			<li>
 				<a href="../../ref/seq_filter_s.html">BOOST_PP_SEQ_FILTER_S</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/first_n.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/first_n.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/first_n.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,5 +21,16 @@
 			<li>
 				<a href="../../ref/seq_first_n.html">BOOST_PP_SEQ_FIRST_N</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/fold_left.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/fold_left.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/fold_left.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,5 +23,16 @@
 			<li>
 				<a href="../../ref/seq_fold_left_s.html">BOOST_PP_SEQ_FOLD_LEFT_<i>s</i></a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/fold_right.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/fold_right.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/fold_right.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,5 +23,16 @@
 			<li>
 				<a href="../../ref/seq_fold_right_s.html">BOOST_PP_SEQ_FOLD_RIGHT_<i>s</i></a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/for_each.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/for_each.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/for_each.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,5 +23,16 @@
 			<li>
 				<a href="../../ref/seq_for_each_r.html">BOOST_PP_SEQ_FOR_EACH_R</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/for_each_i.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/for_each_i.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/for_each_i.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,5 +23,16 @@
 			<li>
 				<a href="../../ref/seq_for_each_i_r.html">BOOST_PP_SEQ_FOR_EACH_I_R</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/for_each_product.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/for_each_product.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/for_each_product.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,5 +23,16 @@
 			<li>
 				<a href="../../ref/seq_for_each_product_r.html">BOOST_PP_SEQ_FOR_EACH_PRODUCT_R</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/insert.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/insert.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/insert.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,5 +20,16 @@
 			<li>
 				<a href="../../ref/seq_insert.html">BOOST_PP_SEQ_INSERT</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/pop_back.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/pop_back.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/pop_back.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,5 +21,16 @@
 			<li>
 				<a href="../../ref/seq_pop_back.html">BOOST_PP_SEQ_POP_BACK</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/pop_front.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/pop_front.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/pop_front.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,5 +21,16 @@
 			<li>
 				<a href="../../ref/seq_pop_front.html">BOOST_PP_SEQ_POP_FRONT</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/push_back.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/push_back.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/push_back.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,5 +20,16 @@
 			<li>
 				<a href="../../ref/seq_push_back.html">BOOST_PP_SEQ_PUSH_BACK</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/push_front.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/push_front.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/push_front.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,5 +20,16 @@
 			<li>
 				<a href="../../ref/seq_push_front.html">BOOST_PP_SEQ_PUSH_FRONT</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/remove.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/remove.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/remove.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,5 +20,16 @@
 			<li>
 				<a href="../../ref/seq_remove.html">BOOST_PP_SEQ_REMOVE</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/replace.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/replace.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/replace.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,5 +20,16 @@
 			<li>
 				<a href="../../ref/seq_replace.html">BOOST_PP_SEQ_REPLACE</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/rest_n.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/rest_n.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/rest_n.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,5 +21,16 @@
 			<li>
 				<a href="../../ref/seq_rest_n.html">BOOST_PP_SEQ_REST_N</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/reverse.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/reverse.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/reverse.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,5 +22,16 @@
 			<li>
 				<a href="../../ref/seq_reverse_s.html">BOOST_PP_SEQ_REVERSE_S</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/seq.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/seq.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/seq.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,5 +24,16 @@
 			<li>
 				<a href="../../ref/seq_tail.html">BOOST_PP_SEQ_TAIL</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/size.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/size.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/size.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,5 +20,16 @@
 			<li>
 				<a href="../../ref/seq_size.html">BOOST_PP_SEQ_SIZE</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/subseq.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/subseq.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/subseq.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,5 +20,16 @@
 			<li>
 				<a href="../../ref/seq_subseq.html">BOOST_PP_SEQ_SUBSEQ</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/to_array.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/to_array.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/to_array.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,5 +21,16 @@
 			<li>
 				<a href="../../ref/seq_to_array.html">BOOST_PP_SEQ_TO_ARRAY</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/to_tuple.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/to_tuple.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/to_tuple.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,5 +21,16 @@
 			<li>
 				<a href="../../ref/seq_to_tuple.html">BOOST_PP_SEQ_TO_TUPLE</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq/transform.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq/transform.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq/transform.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,5 +22,16 @@
 			<li>
 				<a href="../../ref/seq_transform_s.html">BOOST_PP_SEQ_TRANSFORM_S</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/seq.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/seq.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/seq.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -68,5 +68,16 @@
 			<li>
 				<a href="seq/transform.html">&lt;boost/preprocessor/seq/transform.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/slot/counter.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/slot/counter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/slot/counter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/counter.html">BOOST_PP_COUNTER</a></li>
 			<li><a href="../../ref/update_counter.html">BOOST_PP_UPDATE_COUNTER</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/slot/slot.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/slot/slot.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/slot/slot.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/assign_slot.html">BOOST_PP_ASSIGN_SLOT</a></li>
 			<li><a href="../../ref/slot.html">BOOST_PP_SLOT</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/slot.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/slot.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/slot.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="slot/slot.html">&lt;boost/preprocessor/slot/slot.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/stringize.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/stringize.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/stringize.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../ref/stringize.html">BOOST_PP_STRINGIZE</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/tuple/eat.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/tuple/eat.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/tuple/eat.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/tuple_eat.html">BOOST_PP_TUPLE_EAT</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/tuple/elem.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/tuple/elem.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/tuple/elem.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/tuple_elem.html">BOOST_PP_TUPLE_ELEM</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/tuple/rem.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/tuple/rem.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/tuple/rem.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 			<li><a href="../../ref/tuple_rem.html">BOOST_PP_TUPLE_REM</a></li>
 			<li><a href="../../ref/tuple_rem_ctor.html">BOOST_PP_TUPLE_REM_CTOR</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/tuple/reverse.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/tuple/reverse.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/tuple/reverse.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/tuple_reverse.html">BOOST_PP_TUPLE_REVERSE</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/tuple/to_list.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/tuple/to_list.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/tuple/to_list.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../../ref/tuple_to_list.html">BOOST_PP_TUPLE_TO_LIST</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/tuple/to_seq.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/tuple/to_seq.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/tuple/to_seq.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,5 +21,16 @@
 			<li>
 				<a href="../../ref/tuple_to_seq.html">BOOST_PP_TUPLE_TO_SEQ</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/tuple.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/tuple.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/tuple.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 			<li><a href="tuple/reverse.html">&lt;boost/preprocessor/tuple/reverse.hpp&gt;</a></li>
 			<li><a href="tuple/to_list.html">&lt;boost/preprocessor/tuple/to_list.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/while.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/while.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/while.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,16 @@
 		<ul>
 			<li><a href="control/while.html">&lt;boost/preprocessor/control/while.hpp&gt;</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers/wstringize.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers/wstringize.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers/wstringize.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,5 +15,16 @@
 		<ul>
 			<li><a href="../ref/wstringize.html">BOOST_PP_WSTRINGIZE</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/headers.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/headers.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/headers.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -203,5 +203,14 @@
 			<li><a href="headers/while.html">while.hpp*</a></li>
 			<li><a href="headers/wstringize.html">wstringize.hpp</a></li>
 		</ul>
+
+<!--
+© Copyright Housemarque Oy 2002
+© Copyright Paul Mensonides 2002
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/index.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,4 +11,13 @@
 		<noframes>
 			..</noframes>
 	</frameset>
+
+<!--
+© Copyright Housemarque Oy 2002
+© Copyright Paul Mensonides 2002
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 </html>

Modified: boost/trunk/libs/preprocessor/doc/miscellanea.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/miscellanea.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/miscellanea.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,5 +11,14 @@
 	<li><a href="acknowledgements.html">acknowledgements</a></li>
 	<li><a href="bibliography.html">bibliography</a></li>
 </ul>
+
+<!--
+© Copyright Housemarque Oy 2002
+© Copyright Paul Mensonides 2002
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/add.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/add.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/add.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -53,5 +53,16 @@
 
 <a href="add.html">BOOST_PP_ADD</a>(4, 3) // expands to 7
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/add_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/add_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/add_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -75,5 +75,16 @@
 STRIDE(10, 2) // expands to 14
 STRIDE(51, 6) // expands to 63
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/and.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/and.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/and.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,5 +49,16 @@
 <a href="and.html">BOOST_PP_AND</a>(4, 3) // expands to 1
 <a href="and.html">BOOST_PP_AND</a>(5, 0) // expands to 0
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/apply.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/apply.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/apply.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,5 +49,16 @@
 CV(0) // expands to nothing
 CV(1) // expands to const
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_data.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_data.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_data.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -34,5 +34,16 @@
 
 <a href="array_data.html">BOOST_PP_ARRAY_DATA</a>(ARRAY) // expands to (x, y, z)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_elem.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_elem.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_elem.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,5 +36,16 @@
 <a href="array_elem.html">BOOST_PP_ARRAY_ELEM</a>(0, ARRAY) // expands to a
 <a href="array_elem.html">BOOST_PP_ARRAY_ELEM</a>(3, ARRAY) // expands to d
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_insert.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_insert.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_insert.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -56,5 +56,16 @@
 
 <a href="array_insert.html">BOOST_PP_ARRAY_INSERT</a>(ARRAY, 2, c) // expands to (4, (a, b, c, d))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_insert_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_insert_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_insert_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -48,5 +48,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/array/insert.html">&lt;boost/preprocessor/array/insert.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_pop_back.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_pop_back.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_pop_back.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -44,5 +44,16 @@
 
 <a href="array_pop_back.html">BOOST_PP_ARRAY_POP_BACK</a>(ARRAY) // expands to (2, (a, b))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_pop_back_z.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_pop_back_z.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_pop_back_z.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,5 +36,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/array/pop_back.html">&lt;boost/preprocessor/array/pop_back.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_pop_front.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_pop_front.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_pop_front.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -44,5 +44,16 @@
 
 <a href="array_pop_front.html">BOOST_PP_ARRAY_POP_FRONT</a>(ARRAY) // expands to (2, (b, c))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_pop_front_z.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_pop_front_z.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_pop_front_z.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,5 +36,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/array/pop_front.html">&lt;boost/preprocessor/array/pop_front.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_push_back.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_push_back.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_push_back.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -34,5 +34,16 @@
 
 <a href="array_push_back.html">BOOST_PP_ARRAY_PUSH_BACK</a>(ARRAY, d) // expands to (4, (a, b, c, d))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_push_front.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_push_front.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_push_front.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -34,5 +34,16 @@
 
 <a href="array_push_front.html">BOOST_PP_ARRAY_PUSH_FRONT</a>(ARRAY, a) // expands to (4, (a, b, c, d))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_remove.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_remove.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_remove.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -45,5 +45,16 @@
 
 <a href="array_remove.html">BOOST_PP_ARRAY_REMOVE</a>(ARRAY, 2) // expands to (2, (a, b))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_remove_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_remove_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_remove_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,5 +36,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/array/remove.html">&lt;boost/preprocessor/array/remove.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_replace.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_replace.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_replace.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,5 +49,16 @@
 
 <a href="array_replace.html">BOOST_PP_ARRAY_REPLACE</a>(ARRAY, 1, b) // expands to (3, (a, b, c))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_replace_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_replace_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_replace_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -40,5 +40,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/array/replace.html">&lt;boost/preprocessor/array/replace.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_reverse.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_reverse.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_reverse.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -30,5 +30,16 @@
 
 <a href="array_reverse.html">BOOST_PP_ARRAY_REVERSE</a>(ARRAY) // expands to (3, (c, b, a))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/array_size.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/array_size.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/array_size.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -30,5 +30,16 @@
 
 <a href="array_size.html">BOOST_PP_ARRAY_SIZE</a>(ARRAY) // expands to 3
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/assert.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/assert.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/assert.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -99,5 +99,16 @@
 
 MACRO(10)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/assert_msg.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/assert_msg.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/assert_msg.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -51,5 +51,16 @@
    "incorrect line numbering detected" \
 )
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/assign_slot.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/assign_slot.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/assign_slot.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -46,5 +46,16 @@
 
 <a href="slot.html">BOOST_PP_SLOT</a>(1) // expands to 10
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/bitand.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/bitand.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/bitand.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -50,5 +50,16 @@
 <a href="bitand.html">BOOST_PP_BITAND</a>(1, 0) // expands to 0
 <a href="bitand.html">BOOST_PP_BITAND</a>(1, 1) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/bitnor.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/bitnor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/bitnor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -50,5 +50,16 @@
 <a href="bitnor.html">BOOST_PP_BITNOR</a>(1, 0) // expands to 0
 <a href="bitnor.html">BOOST_PP_BITNOR</a>(1, 1) // expands to 0
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/bitor.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/bitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/bitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -50,5 +50,16 @@
 <a href="bitor.html">BOOST_PP_BITOR</a>(1, 0) // expands to 1
 <a href="bitor.html">BOOST_PP_BITOR</a>(1, 1) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/bitxor.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/bitxor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/bitxor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -51,5 +51,16 @@
 <a href="bitxor.html">BOOST_PP_BITXOR</a>(1, 0) // expands to 1
 <a href="bitxor.html">BOOST_PP_BITXOR</a>(1, 1) // expands to 0
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/bool.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/bool.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/bool.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -39,5 +39,16 @@
 <a href="bool.html">BOOST_PP_BOOL</a>(6) // expands to 1
 <a href="bool.html">BOOST_PP_BOOL</a>(0) // expands to 0
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/cat.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/cat.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/cat.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -42,5 +42,16 @@
 
 <a href="cat.html">BOOST_PP_CAT</a>(x, <a href="cat.html">BOOST_PP_CAT</a>(y, z)) // expands to xyz
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/comma.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/comma.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/comma.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -28,5 +28,16 @@
 
 <a href="if.html">BOOST_PP_IF</a>(1, <a href="comma.html">BOOST_PP_COMMA</a>, <a href="empty.html">BOOST_PP_EMPTY</a>)() // expands to ,
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/comma_if.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/comma_if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/comma_if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -45,5 +45,16 @@
 
 <a href="repeat.html">BOOST_PP_REPEAT</a>(3, MACRO, class) // expands to class, class, class
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/compl.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/compl.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/compl.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -43,5 +43,16 @@
 <a href="compl.html">BOOST_PP_COMPL</a>(1) // expands to 0
 <a href="compl.html">BOOST_PP_COMPL</a>(0) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/config_extended_line_info.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/config_extended_line_info.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/config_extended_line_info.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -39,5 +39,16 @@
 			<li>
 				<a href="line.html">BOOST_PP_LINE</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/counter.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/counter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/counter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -43,5 +43,16 @@
 
 <a href="counter.html">BOOST_PP_COUNTER</a> // 3
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/dec.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/dec.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/dec.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -39,5 +39,16 @@
 <a href="dec.html">BOOST_PP_DEC</a>(<a href="dec.html">BOOST_PP_DEC</a>(6)) // expands to 4
 <a href="dec.html">BOOST_PP_DEC</a>(0) // expands to 0
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/deduce_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/deduce_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/deduce_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -67,5 +67,16 @@
 
 RANGE(5, 10) // expands to 5, 6, 7, 8, 9, 10
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/deduce_r.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/deduce_r.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/deduce_r.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -33,5 +33,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/repetition/deduce_r.html">&lt;boost/preprocessor/repetition/deduce_r.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/deduce_z.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/deduce_z.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/deduce_z.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -33,5 +33,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/repetition/deduce_z.html">&lt;boost/preprocessor/repetition/deduce_z.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/div.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/div.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/div.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -48,5 +48,16 @@
 
 <a href="div.html">BOOST_PP_DIV</a>(11, 5) // expands to 2
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/div_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/div_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/div_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -70,5 +70,16 @@
 HALVE(8, 2) // expands to 2
 HALVE(16, 1) // expands to 8
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/empty.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/empty.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/empty.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,5 +32,16 @@
 MACRO(0) // expands to nothing
 MACRO(1) // expands to result
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -65,5 +65,16 @@
 
 <a href="enum.html">BOOST_PP_ENUM</a>(4, TEXT, class) // expands to class, class, class, class
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_binary_params.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_binary_params.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_binary_params.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -61,5 +61,16 @@
 
 <a href="enum_binary_params.html">BOOST_PP_ENUM_BINARY_PARAMS</a>(3, T, p) // expands to T0 p0, T1 p1, T2 p2
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_binary_params_z.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_binary_params_z.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_binary_params_z.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -78,5 +78,16 @@
    template&lt;class T0, class T1&gt; void f(T0 p0, T1 p1) { }
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_params.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_params.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_params.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -54,5 +54,16 @@
 
 <a href="enum_params.html">BOOST_PP_ENUM_PARAMS</a>(3, class T) // expands to class T0, class T1, class T2
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_params_with_a_default.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_params_with_a_default.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_params_with_a_default.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -68,5 +68,16 @@
 <a href="enum_binary_params.html">BOOST_PP_ENUM_BINARY_PARAMS</a>(3, class T, = int <a href="intercept.html">BOOST_PP_INTERCEPT</a>)
    // expands to T0 = int, T1 = int, T2 = int
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_params_with_defaults.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_params_with_defaults.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_params_with_defaults.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -69,5 +69,16 @@
 <a href="enum_binary_params.html">BOOST_PP_ENUM_BINARY_PARAMS</a>(3, class T, = U)
    // expands to T0 = U0, T1 = U1, T2 = U2
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_params_z.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_params_z.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_params_z.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -67,5 +67,16 @@
    template&lt;class T0, class T1&gt; class X1 { };
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_shifted.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_shifted.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_shifted.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -67,5 +67,16 @@
 <a href="enum.html">BOOST_PP_ENUM</a>(5, TYPE, int) // expands to int, int, int, int, int
 <a href="enum_shifted.html">BOOST_PP_ENUM_SHIFTED</a>(5, TYPE, int) // expands to int, int, int, int
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_shifted_params.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_shifted_params.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_shifted_params.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -58,5 +58,16 @@
 
 <a href="enum_shifted_params.html">BOOST_PP_ENUM_SHIFTED_PARAMS</a>(3, class T) // expands to class T1, class T2
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_shifted_params_z.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_shifted_params_z.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_shifted_params_z.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -64,5 +64,16 @@
 
 <a href="repeat.html">BOOST_PP_REPEAT</a>(5, ADD_F, nil)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_shifted_z.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_shifted_z.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_shifted_z.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -78,5 +78,16 @@
 
 <a href="repeat.html">BOOST_PP_REPEAT</a>(3, MACRO, class) // expands to () (class) (class, class)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_trailing.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_trailing.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_trailing.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -68,5 +68,16 @@
 class X { };
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_trailing_params.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_trailing_params.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_trailing_params.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -51,5 +51,16 @@
 class X <a href="enum_trailing_params.html">BOOST_PP_ENUM_TRAILING_PARAMS</a>(2, class T)
    // expands to class X, class T0, class T1, class T2
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_trailing_params_z.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_trailing_params_z.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_trailing_params_z.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -66,5 +66,16 @@
    template&lt;class, class T0&gt; class X1 { };
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_trailing_z.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_trailing_z.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_trailing_z.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -81,5 +81,16 @@
       template&lt;class, class, class&gt; class T2
    */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/enum_z.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/enum_z.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/enum_z.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -81,5 +81,16 @@
       template&lt;class, class, class&gt; class T2
    */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/equal.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/equal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/equal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,5 +49,16 @@
 <a href="equal.html">BOOST_PP_EQUAL</a>(4, 3) // expands to 0
 <a href="equal.html">BOOST_PP_EQUAL</a>(5, 5) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/equal_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/equal_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/equal_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -54,5 +54,16 @@
 <a href="equal_d.html">BOOST_PP_EQUAL_D</a>(1, 4, 3) // expands to 0
 <a href="equal_d.html">BOOST_PP_EQUAL_D</a>(1, 5, 5) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/esbp.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/esbp.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/esbp.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -50,5 +50,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/repetition/esbp.html">&lt;boost/preprocessor/repetition/enum_shifted_binary_params.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/esbpz.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/esbpz.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/esbpz.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -52,5 +52,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/repetition/esbp.html">&lt;boost/preprocessor/repetition/enum_shifted_binary_params.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/etbp.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/etbp.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/etbp.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -68,5 +68,16 @@
 }
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/etbpz.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/etbpz.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/etbpz.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -52,5 +52,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/repetition/etbp.html">&lt;boost/preprocessor/repetition/enum_trailing_binary_params.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/expand.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/expand.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/expand.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -52,5 +52,16 @@
 SAMPLE(0) // expands to (a)(b)(c)
 SAMPLE(1) // expands to (x)(y)(z)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/expr_if.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/expr_if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/expr_if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -55,5 +55,16 @@
 CV(0) // expands to nothing
 CV(1) // expands to const
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/expr_iif.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/expr_iif.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/expr_iif.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -52,5 +52,16 @@
 INSERT_AND(2, 3, abc) // expands to abc
 INSERT_AND(0, 7, xyz) // expands to nothing
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/filename_x.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/filename_x.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/filename_x.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -37,5 +37,16 @@
 			<li><a href="iterate.html">BOOST_PP_ITERATE</a></li>
 			<li><a href="iteration_limits.html">BOOST_PP_ITERATION_LIMITS</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/for.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/for.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/for.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -90,5 +90,16 @@
 
 <a href="for.html">BOOST_PP_FOR</a>((5, 10), PRED, OP, MACRO) // expands to 5 6 7 8 9 10
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/for_r.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/for_r.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/for_r.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -140,5 +140,16 @@
    template&lt;class, class, class, class&gt; class T4
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/frame_finish.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/frame_finish.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/frame_finish.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -27,5 +27,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/iteration/iterate.html">&lt;boost/preprocessor/iteration/iterate.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/frame_flags.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/frame_flags.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/frame_flags.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -27,5 +27,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/iteration/iterate.html">&lt;boost/preprocessor/iteration/iterate.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/frame_iteration.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/frame_iteration.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/frame_iteration.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -58,5 +58,16 @@
 
 #endif
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/frame_start.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/frame_start.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/frame_start.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -27,5 +27,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/iteration/iterate.html">&lt;boost/preprocessor/iteration/iterate.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/greater.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/greater.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/greater.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -50,5 +50,16 @@
 <a href="greater.html">BOOST_PP_GREATER</a>(4, 3) // expands to 1
 <a href="greater.html">BOOST_PP_GREATER</a>(5, 5) // expands to 0
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/greater_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/greater_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/greater_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -54,5 +54,16 @@
 
 <a href="list_filter.html">BOOST_PP_LIST_FILTER</a>(PRED, nil, LIST) // expands to (3, (4, (5, <a href="nil.html">BOOST_PP_NIL</a>)))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/greater_equal.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/greater_equal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/greater_equal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -50,5 +50,16 @@
 <a href="greater_equal.html">BOOST_PP_GREATER_EQUAL</a>(4, 3) // expands to 1
 <a href="greater_equal.html">BOOST_PP_GREATER_EQUAL</a>(5, 5) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/greater_equal_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/greater_equal_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/greater_equal_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -54,5 +54,16 @@
 
 <a href="list_filter.html">BOOST_PP_LIST_FILTER</a>(PRED, nil, LIST) // expands to (4, (5, <a href="nil.html">BOOST_PP_NIL</a>))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/identity.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/identity.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/identity.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -42,5 +42,16 @@
 MACRO(0) // expands to nothing
 MACRO(1) // expands to x
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/if.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -48,5 +48,16 @@
 <a href="if.html">BOOST_PP_IF</a>(10, a, b) // expands to a
 <a href="if.html">BOOST_PP_IF</a>(0, a, b) // expands to b
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/iif.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/iif.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/iif.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -51,5 +51,16 @@
 OR_IF(1, 0, abc, xyz) // expands to abc
 OR_IF(0, 0, abc, xyz) // expands to xyz
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/inc.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/inc.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/inc.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -39,5 +39,16 @@
 <a href="inc.html">BOOST_PP_INC</a>(<a href="inc.html">BOOST_PP_INC</a>(6)) // expands to 8
 <a href="inc.html">BOOST_PP_INC</a>(4) // expands to 5
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/include_self.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/include_self.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/include_self.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -86,5 +86,16 @@
 
 #endif
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/indirect_self.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/indirect_self.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/indirect_self.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -30,5 +30,16 @@
 		<ul>
 			<li><a href="include_self.html">BOOST_PP_INCLUDE_SELF</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/intercept.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/intercept.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/intercept.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,5 +36,16 @@
 <a href="enum_binary_params.html">BOOST_PP_ENUM_BINARY_PARAMS</a>(3, class T, = int <a href="intercept.html">BOOST_PP_INTERCEPT</a>)
 // expands to class T0 = int, class T1 = int, class T2 = int
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/is_iterating.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/is_iterating.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/is_iterating.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,5 +23,16 @@
 		<div>
 			This macro is defined to guard a file from infinite inclusion.
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/is_selfish.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/is_selfish.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/is_selfish.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,5 +23,16 @@
 		<div>
 			This macro is defined to guard a file from infinite inclusion.
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/iterate.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/iterate.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/iterate.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -68,5 +68,16 @@
 
 #endif
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/iteration.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/iteration.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/iteration.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -40,5 +40,16 @@
 
 #endif
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/iteration_depth.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/iteration_depth.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/iteration_depth.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -58,5 +58,16 @@
 
 #endif
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/iteration_finish.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/iteration_finish.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/iteration_finish.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -42,5 +42,16 @@
 
 #endif
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/iteration_flags.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/iteration_flags.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/iteration_flags.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -53,5 +53,16 @@
 
 #endif
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/iteration_limits.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/iteration_limits.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/iteration_limits.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -44,5 +44,16 @@
 			<li><a href="iterate.html">BOOST_PP_ITERATE</a></li>
 			<li><a href="limit_iteration.html">BOOST_PP_LIMIT_ITERATION</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/iteration_params_x.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/iteration_params_x.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/iteration_params_x.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -62,5 +62,16 @@
 			<li><a href="iterate.html">BOOST_PP_ITERATE</a></li>
 			<li><a href="limit_iteration.html">BOOST_PP_LIMIT_ITERATION</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/iteration_start.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/iteration_start.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/iteration_start.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -42,5 +42,16 @@
 
 #endif
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/less.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/less.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/less.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -50,5 +50,16 @@
 <a href="less.html">BOOST_PP_LESS</a>(4, 3) // expands to 0
 <a href="less.html">BOOST_PP_LESS</a>(3, 4) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/less_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/less_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/less_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -55,5 +55,16 @@
 <a href="list_filter.html">BOOST_PP_LIST_FILTER</a>(PRED, nil, LIST)
    // expands to (1, (2, <a href="nil.html">BOOST_PP_NIL</a>))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/less_equal.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/less_equal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/less_equal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -50,5 +50,16 @@
 <a href="less_equal.html">BOOST_PP_LESS_EQUAL</a>(4, 3) // expands to 0
 <a href="less_equal.html">BOOST_PP_LESS_EQUAL</a>(5, 5) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/less_equal_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/less_equal_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/less_equal_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -55,5 +55,16 @@
 <a href="list_filter.html">BOOST_PP_LIST_FILTER</a>(PRED, nil, LIST)
    // expands to (1, (2, (3, (4, <a href="nil.html">BOOST_PP_NIL</a>))))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/limit_dim.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/limit_dim.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/limit_dim.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,5 +20,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/limit_for.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/limit_for.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/limit_for.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/limit_iteration.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/limit_iteration.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/limit_iteration.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/limit_iteration_dim.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/limit_iteration_dim.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/limit_iteration_dim.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/limit_mag.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/limit_mag.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/limit_mag.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/limit_repeat.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/limit_repeat.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/limit_repeat.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/limit_seq.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/limit_seq.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/limit_seq.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -26,5 +26,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/limit_slot_count.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/limit_slot_count.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/limit_slot_count.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/limit_slot_sig.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/limit_slot_sig.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/limit_slot_sig.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/limit_tuple.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/limit_tuple.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/limit_tuple.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/limit_while.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/limit_while.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/limit_while.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/line.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/line.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/line.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -97,5 +97,16 @@
 
 #endif
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_append.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_append.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_append.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -54,5 +54,16 @@
 <a href="list_append.html">BOOST_PP_LIST_APPEND</a>(L1, L2)
    // expands to (a, (b, (c, (x, (y, (z, <a href="nil.html">BOOST_PP_NIL</a>))))))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_append_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_append_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_append_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -81,5 +81,16 @@
 LIST_MULTIPLY(3, LIST)
    // expands to (1, (2, (3, (1, (2, (3, (1, (2, (3, <a href="nil.html">BOOST_PP_NIL</a>)))))))))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_at.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_at.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_at.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -46,5 +46,16 @@
 <a href="list_at.html">BOOST_PP_LIST_AT</a>(LIST, 0) // expands to a
 <a href="list_at.html">BOOST_PP_LIST_AT</a>(LIST, 2) // expands to c
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_at_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_at_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_at_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -48,5 +48,16 @@
 
 <a href="while.html">BOOST_PP_WHILE</a>(PRED, OP, LIST) // expands to (0, (1, <a href="nil.html">BOOST_PP_NIL</a>))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_cat.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_cat.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_cat.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -43,5 +43,16 @@
 
 <a href="list_cat.html">BOOST_PP_LIST_CAT</a>(LIST) // expands to abc
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_cat_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_cat_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_cat_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -52,5 +52,16 @@
 
 <a href="list_fold_left.html">BOOST_PP_LIST_FOLD_LEFT</a>(OP, _, LISTS) // expands to _abcdef
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_cons.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_cons.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_cons.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -72,5 +72,16 @@
 <a href="list_rest.html">BOOST_PP_LIST_REST</a>(OLD) == <a href="list_rest.html">BOOST_PP_LIST_REST</a>(NEW)
    // expands to (b, (c, <a href="nil.html">BOOST_PP_NIL</a>)) == (b, (c, <a href="nil.html">BOOST_PP_NIL</a>))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_enum.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_enum.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_enum.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -47,5 +47,16 @@
 
 <a href="list_enum.html">BOOST_PP_LIST_ENUM</a>(LIST) // expands to w, x, y, z
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_enum_r.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_enum_r.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_enum_r.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -54,5 +54,16 @@
 <a href="for.html">BOOST_PP_FOR</a>(LIST, PRED, OP, MACRO)
    // expands to [x, y, z] [y, z] [z]
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_filter.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_filter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_filter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -61,5 +61,16 @@
 <a href="list_filter.html">BOOST_PP_LIST_FILTER</a>(PRED, 3, LIST)
    // expands to (1, (3, (2, <a href="nil.html">BOOST_PP_NIL</a>)))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_filter_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_filter_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_filter_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -71,5 +71,16 @@
       <a href="nil.html">BOOST_PP_NIL</a>))))
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_first.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_first.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_first.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -47,5 +47,16 @@
 <a href="list_rest.html">BOOST_PP_LIST_REST</a>(OLD) == <a href="list_rest.html">BOOST_PP_LIST_REST</a>(NEW)
    // expands to (b, (c, <a href="nil.html">BOOST_PP_NIL</a>)) == (b, (c, <a href="nil.html">BOOST_PP_NIL</a>))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_first_n.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_first_n.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_first_n.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -47,5 +47,16 @@
 
 <a href="list_first_n.html">BOOST_PP_LIST_FIRST_N</a>(2, LIST) // expands to (a, (b, <a href="nil.html">BOOST_PP_NIL</a>))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_first_n_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_first_n_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_first_n_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -56,5 +56,16 @@
    ((a, (b, <a href="nil.html">BOOST_PP_NIL</a>)) , <a href="nil.html">BOOST_PP_NIL</a> )))
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_fold_left.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_fold_left.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_fold_left.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -60,5 +60,16 @@
 
 <a href="list_fold_left.html">BOOST_PP_LIST_FOLD_LEFT</a>(OP, _, LIST) // expands to _abc
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_fold_left_2nd.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_fold_left_2nd.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_fold_left_2nd.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -60,5 +60,16 @@
 
 <a href="list_fold_left_2nd.html">BOOST_PP_LIST_FOLD_LEFT_2ND</a>(OP, _, LIST) // expands to _abc
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_fold_left_2nd_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_fold_left_2nd_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_fold_left_2nd_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -71,5 +71,16 @@
    (_abc , (_abc , (_abc , <a href="nil.html">BOOST_PP_NIL</a>)))
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_fold_left_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_fold_left_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_fold_left_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -66,5 +66,16 @@
    (_abc, (_abc, (_abc, <a href="nil.html">BOOST_PP_NIL</a>)))
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_fold_left_d_old.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_fold_left_d_old.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_fold_left_d_old.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -71,5 +71,16 @@
    (_abc, (_abc, (_abc, <a href="nil.html">BOOST_PP_NIL</a>)))
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_fold_right.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_fold_right.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_fold_right.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -64,5 +64,16 @@
 
 <a href="list_fold_right.html">BOOST_PP_LIST_FOLD_RIGHT</a>(OP, _, LIST) // expands to _cba
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_fold_right_2nd.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_fold_right_2nd.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_fold_right_2nd.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -64,5 +64,16 @@
 
 <a href="list_fold_right_2nd.html">BOOST_PP_LIST_FOLD_RIGHT_2ND</a>(OP, _, LIST) // expands to _cba
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_fold_right_2nd_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_fold_right_2nd_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_fold_right_2nd_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -71,5 +71,16 @@
    (_cba , (_cba , (_cba , <a href="nil.html">BOOST_PP_NIL</a>)))
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_fold_right_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_fold_right_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_fold_right_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -66,5 +66,16 @@
    (_cba, (_cba, (_cba, <a href="nil.html">BOOST_PP_NIL</a>)))
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_fold_right_d_old.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_fold_right_d_old.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_fold_right_d_old.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -75,5 +75,16 @@
    (_cba, (_cba, (_cba, <a href="nil.html">BOOST_PP_NIL</a>)))
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_for_each.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_for_each.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_for_each.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -60,5 +60,16 @@
 
 <a href="list_for_each.html">BOOST_PP_LIST_FOR_EACH</a>(MACRO, _, LIST) // expands to w_ x_ y_ z_
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_for_each_i.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_for_each_i.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_for_each_i.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -60,5 +60,16 @@
 
 <a href="list_for_each_i.html">BOOST_PP_LIST_FOR_EACH_I</a>(MACRO, _, LIST) // expands to w_0 x_1 y_2 z_3
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_for_each_i_r.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_for_each_i_r.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_for_each_i_r.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -67,5 +67,16 @@
 <a href="for.html">BOOST_PP_FOR</a>(LIST, PRED, OP, MACRO)
    // expands to [x0 y1 z2] [y0 z1] [z0]
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_for_each_product.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_for_each_product.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_for_each_product.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -71,5 +71,16 @@
 <a href="list_for_each_product.html">BOOST_PP_LIST_FOR_EACH_PRODUCT</a>(MACRO, 2, (L1, L2))
    // expands to (a, x) (a, y) (a, z) (b, x) (b, y) (b, z) (c, x) (c, y) (c, z)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_for_each_product_r.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_for_each_product_r.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_for_each_product_r.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -103,5 +103,16 @@
 <a href="for.html">BOOST_PP_FOR</a>((2, (L1, L2)), PRED, OP, MACRO)
    // expands to (x, x) (x, y) (y, x) (y, y) (a, a) (a, b) (b, a) (b, b)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_for_each_r.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_for_each_r.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_for_each_r.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -66,5 +66,16 @@
 <a href="for.html">BOOST_PP_FOR</a>(LIST, PRED, OP, MACRO)
    // expands to [x y z] [y z] [z]
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_is_cons.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_is_cons.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_is_cons.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,5 +36,16 @@
 <a href="list_is_cons.html">BOOST_PP_LIST_IS_CONS</a>(LIST) // expands to 1
 <a href="list_is_cons.html">BOOST_PP_LIST_IS_CONS</a>(<a href="list_rest.html">BOOST_PP_LIST_REST</a>(LIST)) // expands to 0
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_is_nil.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_is_nil.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_is_nil.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,5 +36,16 @@
 <a href="list_is_nil.html">BOOST_PP_LIST_IS_NIL</a>(LIST) // expands to 0
 <a href="list_is_nil.html">BOOST_PP_LIST_IS_NIL</a>(<a href="list_rest.html">BOOST_PP_LIST_REST</a>(LIST)) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_nil.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_nil.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_nil.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -53,5 +53,16 @@
 <a href="list_rest.html">BOOST_PP_LIST_REST</a>(OLD) == <a href="list_rest.html">BOOST_PP_LIST_RESTK</a>(NEW)
    // expands to (b, (c, <a href="nil.html">BOOST_PP_NIL</a>)) == (b, (c, <a href="nil.html">BOOST_PP_NIL</a>))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_rest.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_rest.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_rest.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -47,5 +47,16 @@
 <a href="list_rest.html">BOOST_PP_LIST_REST</a>(OLD) == <a href="list_rest.html">BOOST_PP_LIST_REST</a>(NEW)
    // expands to (b, (c, <a href="nil.html">BOOST_PP_NIL</a>)) == (b, (c, <a href="nil.html">BOOST_PP_NIL</a>))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_rest_n.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_rest_n.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_rest_n.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -47,5 +47,16 @@
 
 <a href="list_rest_n.html">BOOST_PP_LIST_REST_N</a>(2, LIST) // expands to (c, (d, <a href="nil.html">BOOST_PP_NIL</a>))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_rest_n_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_rest_n_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_rest_n_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -56,5 +56,16 @@
    ((c, (d, <a href="nil.html">BOOST_PP_NIL</a>)), <a href="nil.html">BOOST_PP_NIL</a>)))
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_reverse.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_reverse.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_reverse.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -40,5 +40,16 @@
 
 <a href="list_reverse.html">BOOST_PP_LIST_REVERSE</a>(LIST) // expands to (3, (2, (1, (0, <a href="nil.html">BOOST_PP_NIL</a>))))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_reverse_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_reverse_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_reverse_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -48,5 +48,16 @@
    ((d, (c, (b, (a, <a href="nil.html">BOOST_PP_NIL</a>)))), <a href="nil.html">BOOST_PP_NIL</a>)))
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_size.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_size.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_size.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -40,5 +40,16 @@
 
 <a href="list_size.html">BOOST_PP_LIST_SIZE</a>(LIST) // expands to 4
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_size_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_size_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_size_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -52,5 +52,16 @@
 
 <a href="list_fold_left.html">BOOST_PP_LIST_FOLD_LEFT</a>(OP, 0, LIST) // expands to 7
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_to_tuple.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_to_tuple.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_to_tuple.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -47,5 +47,16 @@
 
 <a href="list_to_tuple.html">BOOST_PP_LIST_TO_TUPLE</a>(LIST) // expands to (w, x, y, z)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_to_tuple_r.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_to_tuple_r.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_to_tuple_r.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -54,5 +54,16 @@
 <a href="for.html">BOOST_PP_FOR</a>(LIST, PRED, OP, MACRO)
    // expands to (x, y, z) (y, z) (z)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_transform.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_transform.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_transform.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -63,5 +63,16 @@
 <a href="list_transform.html">BOOST_PP_LIST_TRANSFORM</a>(OP, 3, LIST)
    // expands to (0, (2, (1, (4, <a href="nil.html">BOOST_PP_NIL</a>))))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/list_transform_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/list_transform_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/list_transform_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -71,5 +71,16 @@
    <a href="nil.html">BOOST_PP_NIL</a>))))
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/local_iterate.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/local_iterate.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/local_iterate.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -47,5 +47,16 @@
 template&lt;&gt; struct sample&lt;5&gt; { enum { value = 5 }; };
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/local_limits.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/local_limits.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/local_limits.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -65,5 +65,16 @@
 template&lt;&gt; struct sample&lt;5&gt; { enum { value = 5 }; };
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/local_macro.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/local_macro.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/local_macro.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,5 +49,16 @@
 template&lt;&gt; struct sample&lt;5&gt; { enum { value = 5 }; };
 */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/lparen.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/lparen.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/lparen.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -37,5 +37,16 @@
 
 MACRO((10) Y <a href="lparen.html">BOOST_PP_LPAREN</a>(), result) // expands to 10
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/lparen_if.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/lparen_if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/lparen_if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -46,5 +46,16 @@
 MACRO(0, text) // expands to text
 MACRO(1, text) // expands to (text)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/max.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/max.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/max.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,5 +49,16 @@
 <a href="max.html">BOOST_PP_MAX</a>(5, 7) // expands to 7
 <a href="max.html">BOOST_PP_MAX</a>(3, 3) // expands to 3
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/max_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/max_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/max_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -55,5 +55,16 @@
 
 LIST_MAX(LIST) // expands to 5
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/min.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/min.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/min.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,5 +49,16 @@
 <a href="min.html">BOOST_PP_MIN</a>(5, 7) // expands to 5
 <a href="min.html">BOOST_PP_MIN</a>(3, 3) // expands to 3
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/min_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/min_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/min_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -55,5 +55,16 @@
 
 LIST_MIN(LIST) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/mod.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/mod.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/mod.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -48,5 +48,16 @@
 
 <a href="mod.html">BOOST_PP_MOD</a>(11, 5) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/mod_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/mod_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/mod_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -60,5 +60,16 @@
 
 ODD(LIST) // expands to (1, (3, (5, <a href="nil.html">BOOST_PP_NIL</a>)))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/mul.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/mul.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/mul.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -53,5 +53,16 @@
 
 <a href="mul.html">BOOST_PP_MUL</a>(4, 4) // expands to 16
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/mul_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/mul_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/mul_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -76,5 +76,16 @@
 EXP(4, 2) // expands to 16
 EXP(2, 3) // expands to 8
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/nil.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/nil.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/nil.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -26,5 +26,16 @@
 <a href="list_first.html">BOOST_PP_LIST_FIRST</a>(x) // expands to x
 <a href="list_rest.html">BOOST_PP_LIST_REST</a>(x) // expands to (y, (z, <a href="nil.html">BOOST_PP_NIL</a>))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/nor.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/nor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/nor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,5 +49,16 @@
 <a href="nor.html">BOOST_PP_NOR</a>(4, 0) // expands to 0
 <a href="nor.html">BOOST_PP_NOR</a>(0, 0) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/not.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/not.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/not.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -44,5 +44,16 @@
 <a href="not.html">BOOST_PP_NOT</a>(55) // expands to 0
 <a href="not.html">BOOST_PP_NOT</a>(0) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/not_equal.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/not_equal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/not_equal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,5 +49,16 @@
 <a href="not_equal.html">BOOST_PP_NOT_EQUAL</a>(4, 3) // expands to 1
 <a href="not_equal.html">BOOST_PP_NOT_EQUAL</a>(5, 5) // expands to 0
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/not_equal_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/not_equal_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/not_equal_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -54,5 +54,16 @@
 <a href="not_equal_d.html">BOOST_PP_NOT_EQUAL_D</a>(1, 4, 3) // expands to 1
 <a href="not_equal_d.html">BOOST_PP_NOT_EQUAL_D</a>(1, 5, 5) // expands to 0
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/or.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/or.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/or.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,5 +49,16 @@
 <a href="or.html">BOOST_PP_OR</a>(4, 3) // expands to 1
 <a href="or.html">BOOST_PP_OR</a>(5, 0) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/relative_finish.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/relative_finish.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/relative_finish.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -31,5 +31,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/iteration/iterate.html">&lt;boost/preprocessor/iteration/iterate.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/relative_flags.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/relative_flags.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/relative_flags.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -31,5 +31,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/iteration/iterate.html">&lt;boost/preprocessor/iteration/iterate.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/relative_iteration.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/relative_iteration.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/relative_iteration.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -86,5 +86,16 @@
 
 #endif
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/relative_start.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/relative_start.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/relative_start.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -31,5 +31,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/iteration/iterate.html">&lt;boost/preprocessor/iteration/iterate.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/repeat.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/repeat.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/repeat.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -65,5 +65,16 @@
 
 <a href="repeat.html">BOOST_PP_REPEAT</a>(5, DECL, int x)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/repeat_1st.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/repeat_1st.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/repeat_1st.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -67,5 +67,16 @@
 
 <a href="repeat_1st.html">BOOST_PP_REPEAT_1ST</a>(5, DECL, int x)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/repeat_2nd.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/repeat_2nd.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/repeat_2nd.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -67,5 +67,16 @@
 
 <a href="repeat_2nd.html">BOOST_PP_REPEAT_2ND</a>(5, DECL, int x)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/repeat_3rd.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/repeat_3rd.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/repeat_3rd.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -67,5 +67,16 @@
 
 <a href="repeat_3rd.html">BOOST_PP_REPEAT_3RD</a>(5, DECL, int x)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/repeat_from_to.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/repeat_from_to.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/repeat_from_to.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -87,5 +87,16 @@
       int x8 = 8; int x9 = 9;
    */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_1st.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_1st.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_1st.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -76,5 +76,16 @@
 <a href="repeat_from_to_1st.html">BOOST_PP_REPEAT_FROM_TO_1ST</a>(1, 6, MACRO, nil)
    // expands to (1) (2) (3) (4) (5)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_2nd.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_2nd.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_2nd.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -76,5 +76,16 @@
 <a href="repeat_from_to_2nd.html">BOOST_PP_REPEAT_FROM_TO_2ND</a>(1, 6, MACRO, nil)
    // expands to (1) (2) (3) (4) (5)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_3rd.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_3rd.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_3rd.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -76,5 +76,16 @@
 <a href="repeat_from_to_3rd.html">BOOST_PP_REPEAT_FROM_TO_3RD</a>(1, 6, MACRO, nil)
    // expands to (1) (2) (3) (4) (5)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -68,5 +68,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/repetition/repeat_from_to.html">&lt;boost/preprocessor/repetition/repeat_from_to.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_d_z.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_d_z.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_d_z.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -69,5 +69,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/repetition/repeat_from_to.html">&lt;boost/preprocessor/repetition/repeat_from_to.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_z.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_z.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/repeat_from_to_z.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -90,5 +90,16 @@
       (1 xyz 2 xyz 3 xyz)
    */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/repeat_z.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/repeat_z.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/repeat_z.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -85,5 +85,16 @@
       template&lt;class, class, class&gt; class T2
    */
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/rparen.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/rparen.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/rparen.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -38,5 +38,16 @@
 
 MACRO(<a href="empty.html">BOOST_PP_EMPTY</a> <a href="rparen.html">BOOST_PP_RPAREN</a>()(), 10) // expands to 10
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/rparen_if.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/rparen_if.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/rparen_if.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -46,5 +46,16 @@
 MACRO(0, text) // expands to text
 MACRO(1, text) // expands to (text)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_cat.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_cat.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_cat.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -56,5 +56,16 @@
 <a href="seq_cat.html">BOOST_PP_SEQ_CAT</a>(SEQ) // expands to abc
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_cat_s.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_cat_s.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_cat_s.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -46,5 +46,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/seq/cat.html">&lt;boost/preprocessor/seq/cat.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_elem.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_elem.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_elem.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -64,5 +64,16 @@
 <a href="seq_elem.html">BOOST_PP_SEQ_ELEM</a>(88, SEQ) // expands to 88
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_enum.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_enum.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_enum.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -51,5 +51,16 @@
 <a href="seq_enum.html">BOOST_PP_SEQ_ENUM</a>(SEQ) // expands to B, O, O, S, T
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_filter.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_filter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_filter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -78,5 +78,16 @@
    // expands to (1)(3)(2)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_filter_s.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_filter_s.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_filter_s.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -64,5 +64,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/seq/filter.html">&lt;boost/preprocessor/seq/filter.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_first_n.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_first_n.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_first_n.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -59,5 +59,16 @@
 <a href="seq_first_n.html">BOOST_PP_SEQ_FIRST_N</a>(2, SEQ) // expands to (a)(b)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_fold_left.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_fold_left.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_fold_left.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -75,5 +75,16 @@
 <a href="seq_fold_left.html">BOOST_PP_SEQ_FOLD_LEFT</a>(OP, <a href="seq_head.html">BOOST_PP_SEQ_HEAD</a>(SEQ), <a href="seq_tail.html">BOOST_PP_SEQ_TAIL</a>(SEQ)) // expands to boost
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_fold_left_s.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_fold_left_s.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_fold_left_s.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -81,5 +81,16 @@
 // expands to (_abc)(_abc)(_abc)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_fold_right.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_fold_right.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_fold_right.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -77,5 +77,16 @@
 <a href="seq_fold_right.html">BOOST_PP_SEQ_FOLD_RIGHT</a>(OP, <a href="seq_elem.html">BOOST_PP_SEQ_ELEM</a>(4, SEQ), <a href="seq_pop_back.html">BOOST_PP_SEQ_POP_BACK</a>(SEQ)) // expands to boost
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_fold_right_s.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_fold_right_s.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_fold_right_s.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -82,5 +82,16 @@
 // expands to (_cba)(_cba)(_cba)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_for_each.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_for_each.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_for_each.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -75,5 +75,16 @@
 <a href="seq_for_each.html">BOOST_PP_SEQ_FOR_EACH</a>(MACRO, _, SEQ) // expands to w_ x_ y_ z_
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_for_each_i.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_for_each_i.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_for_each_i.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -76,5 +76,16 @@
 <a href="seq_for_each_i.html">BOOST_PP_SEQ_FOR_EACH_I</a>(MACRO, _, SEQ) // expands to a_0 b_1 c_2 d_3
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_for_each_i_r.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_for_each_i_r.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_for_each_i_r.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -63,5 +63,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/seq/for_each_i.html">&lt;boost/preprocessor/seq/for_each_i.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_for_each_product.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_for_each_product.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_for_each_product.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -85,5 +85,16 @@
    //   (c, x, p) (c, x, q) (c, y, p) (c, y, q) (c, z, p) (c, z, q)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_for_each_product_r.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_for_each_product_r.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_for_each_product_r.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -66,5 +66,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/seq/for_each_product.html">&lt;boost/preprocessor/seq/for_each_product.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_for_each_r.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_for_each_r.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_for_each_r.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -62,5 +62,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/seq/for_each.html">&lt;boost/preprocessor/seq/for_each.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_head.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_head.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_head.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -48,5 +48,16 @@
 <a href="seq_tail.html">BOOST_PP_SEQ_TAIL</a>(SEQ) // expands to (b)(c)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_insert.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_insert.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_insert.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -55,5 +55,16 @@
 <a href="seq_insert.html">BOOST_PP_SEQ_INSERT</a>(SEQ, 2, c) // expands to (a)(b)(c)(d)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_nil.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_nil.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_nil.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -85,5 +85,16 @@
 // expands to (b)(a)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_pop_back.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_pop_back.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_pop_back.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -53,5 +53,16 @@
 <a href="seq_pop_back.html">BOOST_PP_SEQ_POP_BACK</a>(SEQ) // expands to (a)(b)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_pop_front.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_pop_front.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_pop_front.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -53,5 +53,16 @@
 <a href="seq_pop_front.html">BOOST_PP_SEQ_POP_FRONT</a>(SEQ) // expands to (b)(c)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_push_back.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_push_back.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_push_back.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -61,5 +61,16 @@
 <a href="seq_push_back.html">BOOST_PP_SEQ_PUSH_BACK</a>(SEQ, c) // expands to (a)(b)(c)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_push_front.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_push_front.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_push_front.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -63,5 +63,16 @@
 <a href="seq_push_front.html">BOOST_PP_SEQ_PUSH_FRONT</a>(SEQ, a) // expands to (a)(b)(c)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_remove.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_remove.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_remove.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -51,5 +51,16 @@
 <a href="seq_remove.html">BOOST_PP_SEQ_REMOVE</a>(SEQ, 2) // expands to (a)(b)(c)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_replace.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_replace.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_replace.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -56,5 +56,16 @@
 <a href="seq_replace.html">BOOST_PP_SEQ_REPLACE</a>(SEQ, 2, c) // expands to (a)(b)(c)(d)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_rest_n.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_rest_n.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_rest_n.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -105,5 +105,16 @@
 SUPER_SUB(67, 25) // expands to 42
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_reverse.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_reverse.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_reverse.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -53,5 +53,16 @@
 <a href="seq_reverse.html">BOOST_PP_SEQ_REVERSE</a>(SEQ) // expands to (3)(2)(1)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_reverse_s.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_reverse_s.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_reverse_s.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -40,5 +40,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/seq/reverse.html">&lt;boost/preprocessor/seq/reverse.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_size.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_size.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_size.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -40,5 +40,16 @@
 <a href="seq_size.html">BOOST_PP_SEQ_SIZE</a>(SEQ) // expands to 3
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_subseq.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_subseq.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_subseq.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -54,5 +54,16 @@
 <a href="seq_subseq.html">BOOST_PP_SEQ_SUBSEQ</a>(SEQ, 2, 3) // expands to (2)(3)(4)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_tail.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_tail.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_tail.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -48,5 +48,16 @@
 <a href="seq_tail.html">BOOST_PP_SEQ_TAIL</a>(SEQ) // expands to (b)(c)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_to_array.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_to_array.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_to_array.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -40,5 +40,16 @@
 <a href="seq_to_array.html">BOOST_PP_SEQ_TO_ARRAY</a>(SEQ) // expands to (3, (a, b, c))
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_to_tuple.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_to_tuple.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_to_tuple.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -40,5 +40,16 @@
 <a href="seq_to_tuple.html">BOOST_PP_SEQ_TO_TUPLE</a>(SEQ) // expands to (a, b, c)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_transform.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_transform.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_transform.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -78,5 +78,16 @@
    // expands to (0)(2)(1)(4)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/seq_transform_s.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/seq_transform_s.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/seq_transform_s.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -64,5 +64,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/seq/transform.html">&lt;boost/preprocessor/seq/transform.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/slot.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/slot.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/slot.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -45,5 +45,16 @@
 
 <a href="slot.html">BOOST_PP_SLOT</a>(1) // expands to 10
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/stringize.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/stringize.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/stringize.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -35,5 +35,16 @@
 
 <a href="stringize.html">BOOST_PP_STRINGIZE</a>(<a href="cat.html">BOOST_PP_CAT</a>(a, b)) // expands to "ab"
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/sub.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/sub.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/sub.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -48,5 +48,16 @@
 
 <a href="sub.html">BOOST_PP_SUB</a>(4, 3) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/sub_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/sub_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/sub_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -70,5 +70,16 @@
 STRIDE(10, 2) // expands to 6
 STRIDE(14, 6) // expands to 2
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/tuple_eat.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/tuple_eat.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/tuple_eat.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -43,5 +43,16 @@
 MACRO(0) // expands to nothing
 MACRO(1) // expands to (1, 2)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/tuple_elem.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/tuple_elem.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/tuple_elem.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -50,5 +50,16 @@
 <a href="tuple_elem.html">BOOST_PP_TUPLE_ELEM</a>(4, 0, TUPLE) // expands to a
 <a href="tuple_elem.html">BOOST_PP_TUPLE_ELEM</a>(4, 3, TUPLE) // expands to d
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/tuple_rem.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/tuple_rem.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/tuple_rem.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -37,5 +37,16 @@
 
 <a href="tuple_rem.html">BOOST_PP_TUPLE_REM</a>(3)(x, y, z) // expands to x, y, z
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/tuple_rem_ctor.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/tuple_rem_ctor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/tuple_rem_ctor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -41,5 +41,16 @@
 
 <a href="tuple_rem_ctor.html">BOOST_PP_TUPLE_REM_CTOR</a>(3, (x, y, z)) // expands to x, y, z
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/tuple_reverse.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/tuple_reverse.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/tuple_reverse.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -41,5 +41,16 @@
 
 <a href="tuple_reverse.html">BOOST_PP_TUPLE_REVERSE</a>(3, (x, y, z)) // expands to (z, y, x)
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/tuple_to_list.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/tuple_to_list.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/tuple_to_list.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -42,5 +42,16 @@
 <a href="tuple_to_list.html">BOOST_PP_TUPLE_TO_LIST</a>(3, (x, y, z))
    // expands to (x, (y, (z, <a href="nil.html">BOOST_PP_NIL</a>)))
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/tuple_to_seq.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/tuple_to_seq.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/tuple_to_seq.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -42,5 +42,16 @@
 <a href="tuple_to_seq.html">BOOST_PP_TUPLE_TO_SEQ</a>(3, (a, b, c)) // expands to (a)(b)(c)
 </pre>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/update_counter.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/update_counter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/update_counter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,16 @@
 		<div>
 			<b>Header:</b> &nbsp;<a href="../headers/slot/counter.html">&lt;boost/preprocessor/slot/counter.hpp&gt;</a>
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/value.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/value.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/value.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,5 +22,16 @@
 		<ul>
 			<li><a href="assign_slot.html">BOOST_PP_ASSIGN_SLOT</a></li>
 		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/while.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/while.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/while.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -101,5 +101,16 @@
 SUMMATION(3) // expands to 6
 SUMMATION(4) // expands to 10
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/while_d.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/while_d.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/while_d.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -114,5 +114,16 @@
 
 ACCUMULATE_D(1, ARRAY)// expands to 10
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/wstringize.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/wstringize.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/wstringize.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -34,5 +34,16 @@
 
 <a href="wstringize.html">BOOST_PP_WSTRINGIZE</a>(some text) // expands to L"some text"
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref/xor.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref/xor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref/xor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,5 +49,16 @@
 <a href="xor.html">BOOST_PP_XOR</a>(4, 3) // expands to 0
 <a href="xor.html">BOOST_PP_XOR</a>(5, 0) // expands to 1
 </pre></div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/ref.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/ref.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/ref.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -273,5 +273,14 @@
 			<!-- X -->
 			<li><a href="ref/xor.html">XOR</a></li>
 		</ul>
+
+<!--
+© Copyright Housemarque Oy 2002
+© Copyright Paul Mensonides 2002
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 	</body>
 </html>
\ No newline at end of file

Modified: boost/trunk/libs/preprocessor/doc/styles.css
===================================================================
--- boost/trunk/libs/preprocessor/doc/styles.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/styles.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -77,3 +77,11 @@
 	margin-top:  10px; margin-bottom:  10px; margin-left:  20px;
 	padding-left:  17px;
 }
+
+/*
+© Copyright Housemarque Oy 2002
+© Copyright Paul Mensonides 2002
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+*/

Modified: boost/trunk/libs/preprocessor/doc/syntax.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/syntax.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/syntax.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -278,5 +278,14 @@
 	<!-- X -->
 	<br>BOOST_PP_XOR
 </div>
+
+<!--
+© Copyright Housemarque Oy 2002
+© Copyright Paul Mensonides 2002
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/terms/evaluated.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/terms/evaluated.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/terms/evaluated.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -12,5 +12,16 @@
 		In other words, if the value is dependent on some macro, it will no longer be dependent on that macro after it is evaluated.&nbsp;
 		This disables the lazy-evaluation that the preprocessor normallly uses.
 	</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/terms/named_external.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/terms/named_external.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/terms/named_external.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,5 +10,16 @@
 		There is no way to pass arguments to a file directly, so they must be passed to files in the form of macros with known names that are defined by the user.&nbsp;
 		Every time that the library uses this idiom, the file that is included automatically undefines the macro in order to better simulate <i>normal</i> parameters.
 	</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/terms.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/terms.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/terms.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,5 +10,14 @@
 	<li><a href="terms/evaluated.html">evaluated parameter</a></li>
 	<li><a href="terms/named_external.html">named external argument</a></li>
 </ul>
+
+<!--
+© Copyright Housemarque Oy 2002
+© Copyright Paul Mensonides 2002
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/title.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/title.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/title.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,5 +9,14 @@
 		An excerpt from <i>C++ Template Metaprogramming: Concepts, Tools, and Techniques from Boost and Beyond</i> by Dave Abrahams and Aleksey Gurtovoy has been made available <a href="http://boost-consulting.com/tmpbook/preprocessor.html" target="_top"><font color="blue"><b><u><i>online</i></u></font></b></a>.
 		This excerpt contains a basic introduction to the Preprocessor library and preprocessor metaprogramming which may help users new to the library and users interested in seeing some of the facilities offered by the library.
 	</div>
+
+<!--
+© Copyright Housemarque Oy 2002
+© Copyright Paul Mensonides 2002
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/top.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/top.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/top.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,5 +19,14 @@
 				</td>
 			</tr>
 		</table>
+
+<!--
+© Copyright Housemarque Oy 2002
+© Copyright Paul Mensonides 2002
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/topics/evaluated_slots.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/topics/evaluated_slots.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/topics/evaluated_slots.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -142,5 +142,16 @@
 	<li><a href="../ref/value.html">BOOST_PP_VALUE</a></li>
 </ul>
 <div class="sig">- Paul Mensonides</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/topics/file_iteration.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/topics/file_iteration.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/topics/file_iteration.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1029,5 +1029,16 @@
 		<div class="sig">
 			- Paul Mensonides
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/topics/incompatible.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/topics/incompatible.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/topics/incompatible.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -125,5 +125,16 @@
 		<li><a href="../ref/while.html">BOOST_PP_WHILE</a></li>
 	</ul>
 	<div class="sig">- Paul Mensonides</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/topics/local_iteration.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/topics/local_iteration.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/topics/local_iteration.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -141,5 +141,16 @@
 	<li><a href="../ref/local_macro.html">BOOST_PP_LOCAL_MACRO</a></li>
 </ul>
 <div class="sig">- Paul Mensonides</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>
\ No newline at end of file

Modified: boost/trunk/libs/preprocessor/doc/topics/motivation.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/topics/motivation.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/topics/motivation.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -104,5 +104,16 @@
 Permission to copy, use, modify, sell and distribute this document is granted provided this copyright notice appears in all copies.&nbsp;
 This document is provided "as is" without express or implied warranty and with no claim as to its suitability for any purpose.
 </div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/topics/problems.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/topics/problems.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/topics/problems.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -120,5 +120,16 @@
 Permission to copy, use, modify, sell and distribute this document is granted provided this copyright notice appears in all copies.&nbsp;
 This document is provided "as is" without express or implied warranty and with no claim as to its suitability for any purpose.
 </div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/topics/reentrancy.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/topics/reentrancy.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/topics/reentrancy.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -283,5 +283,16 @@
 		<div class="sig">
 			- Paul Mensonides
 		</div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 	</body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/topics/techniques.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/topics/techniques.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/topics/techniques.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -335,5 +335,16 @@
 Permission to copy, use, modify, sell and distribute this document is granted provided this copyright notice appears in all copies.&nbsp;
 This document is provided "as is" without express or implied warranty and with no claim as to its suitability for any purpose.
 </div>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
+		</br><i>© Copyright Paul Mensonides 2002</i>
+	</div>
+	<div style="margin-left: 0px;">
+		<p><small>Distributed under the Boost Software License, Version 1.0. (See
+		accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+		copy at <a href=
+		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+	</div>
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/doc/topics.html
===================================================================
--- boost/trunk/libs/preprocessor/doc/topics.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/doc/topics.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,5 +16,14 @@
 	<li><a href="topics/file_iteration.html">file iteration</a></li>
 	<li><a href="topics/evaluated_slots.html">evaluated slots</a></li>
 </ul>
+
+<!--
+© Copyright Housemarque Oy 2002
+© Copyright Paul Mensonides 2002
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 </body>
 </html>

Modified: boost/trunk/libs/preprocessor/index.html
===================================================================
--- boost/trunk/libs/preprocessor/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/preprocessor/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,5 +5,14 @@
 <body>
 Automatic redirection failed, please go to
 <a href="doc/index.html">doc/index.html</a>.
+
+<!--
+© Copyright Housemarque Oy 2002
+© Copyright Paul Mensonides 2002
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 </body>
 </html>
\ No newline at end of file

Deleted: boost/trunk/libs/program_options/build/Jamfile
===================================================================
--- boost/trunk/libs/program_options/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/program_options/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,49 +0,0 @@
-
-subproject libs/program_options/build ;
-
-SOURCES = cmdline config_file options_description parsers variables_map 
-          value_semantic positional_options utf8_codecvt_facet convert
-          winmain
-;
-
-lib boost_program_options
-     : ../src/$(SOURCES).cpp
-     : # build requirements
-       [ common-names ] # magic for install and auto-link features
-       <include>$(BOOST_ROOT) <sysinclude>$(BOOST_ROOT)
-       std::locale-support
-     : debug release  # build variants
-     ;
-
-dll boost_program_options
-     : ../src/$(SOURCES).cpp
-     : # build requirements
-       [ common-names ]  # magic for install and auto-link features
-       <define>BOOST_ALL_DYN_LINK=1  # tell source we're building dll's
-       <runtime-link>dynamic  # build only for dynamic runtimes
-       <include>$(BOOST_ROOT) <sysinclude>$(BOOST_ROOT)
-       # The following really turns on static runtime linking
-       # which leads to runtime crashes when using DLL, so
-       # seem DLL is not usable on Metrowerks 8
-       # std::facet-support std::locale-support
-     : debug release  # build variants
-     ;
-
-install program_options lib
-     : <lib>boost_program_options <dll>boost_program_options
-     ;
-
-stage stage/lib : <lib>boost_program_options <dll>boost_program_options
-    :
-        # copy to a path rooted at BOOST_ROOT:
-        <locate>$(BOOST_ROOT)
-        # make sure the names of the libraries are correctly named:
-        [ common-names ]
-        # add this target to the "stage" and "all" psuedo-targets:
-        <target>stage
-        <target>all
-    :
-        debug release
-    ;
-
-# end

Modified: boost/trunk/libs/program_options/doc/index.html
===================================================================
--- boost/trunk/libs/program_options/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/program_options/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,11 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="../../../doc/html/program_options.html">../../../doc/html/program_options.html</a>
+<a href="../../../doc/html/program_options.html">../../../doc/html/program_options.html</a> 
+&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
 </html>

Deleted: boost/trunk/libs/program_options/example/Jamfile
===================================================================
--- boost/trunk/libs/program_options/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/program_options/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,23 +0,0 @@
-
-subproject libs/program_options/example ;
-
-rule program-options-example ( name extra-sources * )
-{
-    exe $(name) : $(name).cpp <lib>../build/boost_program_options $(extra-sources)
-    : <include>$(BOOST_ROOT) ;
-}
-
-program-options-example first ;
-program-options-example options_description ;
-program-options-example multiple_sources ;
-program-options-example custom_syntax ;
-program-options-example response_file ;
-program-options-example option_groups ;
-program-options-example real ;
-program-options-example regex <lib>../../regex/build/boost_regex ;
-
-
-#program-options-example prefix ;
-
-
-

Modified: boost/trunk/libs/program_options/index.html
===================================================================
--- boost/trunk/libs/program_options/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/program_options/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,11 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="../../doc/html/program_options.html">../../doc/html/program_options.html</a>
+<a href="../../doc/html/program_options.html">../../doc/html/program_options.html</a> 
+&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
-</html>
+</html>
\ No newline at end of file

Modified: boost/trunk/libs/program_options/src/options_description.cpp
===================================================================
--- boost/trunk/libs/program_options/src/options_description.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/program_options/src/options_description.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -411,9 +411,9 @@
                 
                         if (last_space != line_begin)
                         {                 
-                            // is last_space within the second half ot the 
+                            // is last_space within the second half of the 
                             // current line
-                            if (unsigned(distance(last_space, line_end)) < 
+                            if ((unsigned)std::distance(last_space, line_end) < 
                                 (line_length - indent) / 2)
                             {
                                 line_end = last_space;

Modified: boost/trunk/libs/program_options/src/variables_map.cpp
===================================================================
--- boost/trunk/libs/program_options/src/variables_map.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/program_options/src/variables_map.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -35,8 +35,11 @@
 
         std::set<std::string> new_final;
 
+        // Declared once, to please Intel in VC++ mode;
+        unsigned i;
+
         // First, convert/store all given options
-        for (size_t i = 0; i < options.options.size(); ++i) {
+        for (i = 0; i < options.options.size(); ++i) {
 
             const string& name = options.options[i].string_key;
             // Skip positional options without name
@@ -92,7 +95,7 @@
         
         // Second, apply default values.
         const vector<shared_ptr<option_description> >& all = desc.options();
-        for(unsigned i = 0; i < all.size(); ++i)
+        for(i = 0; i < all.size(); ++i)
         {
             const option_description& d = *all[i];
             string key = d.key("");

Deleted: boost/trunk/libs/program_options/test/Jamfile
===================================================================
--- boost/trunk/libs/program_options/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/program_options/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,47 +0,0 @@
-
-subproject libs/program_options/test ;
-
-import testing ;
-
-rule program-options-test ( name )
-{
-    return [ 
-      run $(name).cpp <lib>../build/boost_program_options
-        <lib>../../test/build/boost_test_exec_monitor : :
-        : <include>$(BOOST_ROOT) 
-          std::locale-support ]
-    ;
-}
-
-rule program-options-dll-test ( name )
-{
-    return [ 
-      run $(name).cpp <dll>../build/boost_program_options
-        <lib>../../test/build/boost_test_exec_monitor : :
-        : <include>$(BOOST_ROOT) 
-          <define>BOOST_ALL_DYN_LINK=1
-          <runtime-link>dynamic
-        : $(name)_dll ]
-    ;
-}
-
-
-test-suite program_options : 
-    [ program-options-test options_description_test ]
-    [ program-options-test parsers_test ]
-    [ program-options-test variable_map_test ]
-    [ program-options-test cmdline_test ]
-    [ program-options-test positional_options_test ]
-    [ program-options-test unicode_test ]
-    [ program-options-test winmain ] 
-    [ program-options-dll-test options_description_test ]
-    [ program-options-dll-test parsers_test ]
-    [ program-options-dll-test variable_map_test ]
-    [ program-options-dll-test cmdline_test ]
-    [ program-options-dll-test positional_options_test ]
-    [ program-options-dll-test unicode_test ]
-    [ program-options-dll-test winmain ] 
-    
-    
-    ;
-

Modified: boost/trunk/libs/program_options/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/program_options/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/program_options/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
 project
     : requirements 
     <library>../build//boost_program_options
-    <library>/boost/test//boost_test_exec_monitor
+    <library>/boost/test//boost_test_exec_monitor/<link>static
     <link>static
     
 #    <define>_GLIBCXX_CONCEPT_CHECKS
@@ -13,7 +13,7 @@
 {
     return
         [ run $(source) ]
-	[ run $(source) : : : <link>shared <define>BOOST_ALL_DYN_LINK=1
+	[ run $(source) : : : <link>shared <define>BOOST_PROGRAM_OPTIONS_DYN_LINK=1
 	  : $(source:B)_dll ] 
     ;	
 }    

Modified: boost/trunk/libs/property_map/identity_property_map.html
===================================================================
--- boost/trunk/libs/property_map/identity_property_map.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/property_map/identity_property_map.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,7 +49,7 @@
 boost::property_traits&lt;identity_property_map&gt;::value_type
 </tt></td>
 <td>
-This type is <tt>void</tt>; the map functions are templated.
+This type is <tt>std::size_t</tt>; the map functions are templated.
 </td>
 </tr>
 
@@ -58,7 +58,7 @@
 boost::property_traits&lt;identity_property_map&gt;::key_type
 </tt></td>
 <td>
-This type is <tt>void</tt>; the map functions are templated.
+This type is <tt>std::size_t</tt>; the map functions are templated.
 </td>
 </tr>
 

Modified: boost/trunk/libs/property_map/index.html
===================================================================
--- boost/trunk/libs/property_map/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/property_map/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,10 @@
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="property_map.html">property_map.html</a>.
+<a href="property_map.html">property_map.html</a>.&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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: boost/trunk/libs/property_map/test/Jamfile
===================================================================
--- boost/trunk/libs/property_map/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/property_map/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,20 +0,0 @@
-# Function library
-
-# Copyright (C) 2005 Trustees of Indiana University
-#
-# Author: Douglas Gregor
-#
-# Use, modification and distribution is subject to the Boost Software License, 
-# Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at 
-# http://www.boost.org/LICENSE_1_0.txt) 
-
-# For more information, see http://www.boost.org/
-
-subproject libs/property_map/test ;
-
-import testing ;
-
-test-suite property_map
-  : [ compile property_map_cc.cpp ]
-    [ run     dynamic_properties_test.cpp ]
-  ;

Modified: boost/trunk/libs/ptr_container/doc/Jamfile.v2
===================================================================
--- boost/trunk/libs/ptr_container/doc/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,14 @@
+//
+// Boost.Pointer Container
+//
+//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+//  distribution is subject to the Boost Software License, Version
+//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt)
+//
+// For more information, see http://www.boost.org/libs/ptr_container/
+//
+
 project boost/ptr_container/doc ;
 
 import boostbook : boostbook ;

Modified: boost/trunk/libs/ptr_container/doc/associative_ptr_container.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/associative_ptr_container.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/associative_ptr_container.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.4 $
+:Date: $Date: 2006/11/22 22:01:00 $
+:Revision: $Revision: 1.4.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -292,20 +292,28 @@
 <div class="section">
 <h1><a id="class-associative-ptr-container" name="class-associative-ptr-container">Class <tt class="docutils literal"><span class="pre">associative_ptr_container</span></tt></a></h1>
 <p>This section describes all the common operations for all associative
-pointer containers (in addition to <tt class="docutils literal"><span class="pre">reversible_ptr_container</span></tt>):</p>
+pointer containers (in addition to <tt class="docutils literal"><span class="pre">reversible_ptr_container</span></tt>).</p>
+<p><strong>Hierarchy:</strong></p>
 <ul class="simple">
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><tt class="docutils literal"><span class="pre">associative_ptr_container</span></tt><ul>
+<li><a class="reference" href="ptr_set_adapter.html">ptr_set_adapter</a></li>
+<li><a class="reference" href="ptr_multiset_adapter.html">ptr_multiset_adapter</a></li>
 <li><a class="reference" href="ptr_map_adapter.html">ptr_map_adapter</a></li>
-<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multimap_adapter</a></li>
+<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multi_map_adapter</a><ul>
+<li><a class="reference" href="ptr_set.html">ptr_set</a></li>
+<li><a class="reference" href="ptr_multiset.html">ptr_multi_set</a></li>
 <li><a class="reference" href="ptr_map.html">ptr_map</a></li>
 <li><a class="reference" href="ptr_multimap.html">ptr_multimap</a></li>
-<li><a class="reference" href="ptr_set_adapter.html">ptr_set_adapter</a></li>
-<li><a class="reference" href="ptr_multiset.html">ptr_multiset_adapter</a></li>
-<li><a class="reference" href="ptr_set.html">ptr_set</a></li>
-<li><a class="reference" href="ptr_multiset.html">ptr_multiset</a></li>
 </ul>
+</li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>See also:</strong></p>
 <ul class="simple">
-<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
 <li><a class="reference" href="http://www.boost.org/libs/range/doc/utility_class.html#iter_range">iterator_range</a></li>
 </ul>
 <p><strong>Navigate:</strong></p>
@@ -521,11 +529,11 @@
 - Effects: returns the object with key ``key``
 
 - Throws: ``bad_ptr_container_operation`` if the key does not exist                                  -->
-<table class="docutils field-list" frame="void" id="pointer-container-requirements" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/associative_ptr_container.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/associative_ptr_container.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/associative_ptr_container.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,33 +8,28 @@
 -------------------------------------
 
 This section describes all the common operations for all associative
-pointer containers (in addition to ``reversible_ptr_container``):
+pointer containers (in addition to ``reversible_ptr_container``).
 
-- ptr_map_adapter_
-- ptr_multimap_adapter_
-- ptr_map_
-- ptr_multimap_
-- ptr_set_adapter_
-- ptr_multiset_adapter_
-- ptr_set_
-- ptr_multiset_
+**Hierarchy:**
 
-.. _ptr_map_adapter : ptr_map_adapter.html
-.. _ptr_multimap_adapter: ptr_multimap_adapter.html
-.. _ptr_map: ptr_map.html
-.. _ptr_multimap: ptr_multimap.html
-.. _ptr_set_adapter: ptr_set_adapter.html
-.. _ptr_multiset_adapter: ptr_multiset.html
-.. _ptr_set: ptr_set.html
-.. _ptr_multiset: ptr_multiset.html
+- `reversible_ptr_container <reversible_ptr_container.html>`_
 
+  - ``associative_ptr_container`` 
+  
+    - `ptr_set_adapter <ptr_set_adapter.html>`_
+    - `ptr_multiset_adapter <ptr_multiset_adapter.html>`_
+    - `ptr_map_adapter <ptr_map_adapter.html>`_
+    - `ptr_multi_map_adapter <ptr_multimap_adapter.html>`_
+
+      - `ptr_set <ptr_set.html>`_
+      - `ptr_multi_set <ptr_multiset.html>`_ 
+      - `ptr_map <ptr_map.html>`_
+      - `ptr_multimap <ptr_multimap.html>`_
+
 **See also:**
 
-- reversible_ptr_container__
 - `iterator_range <http://www.boost.org/libs/range/doc/utility_class.html#iter_range>`_
 
-__ reversible_ptr_container.html  
-
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -219,6 +214,11 @@
 
 .. _`pointer container requirements`:
 
+.. raw:: html 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+        <hr>
+	
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
 
+__ http://www.boost.org/LICENSE_1_0.txt
+

Modified: boost/trunk/libs/ptr_container/doc/comp.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,14 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 sh comp_ptr_container.sh
 sh comp_reversible_ptr_container.sh
 sh comp_ptr_sequence_adapter.sh

Modified: boost/trunk/libs/ptr_container/doc/comp_all.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_all.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_all.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,14 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 sh comp_ptr_container.sh
 sh comp_reference.sh
 sh comp_faq.sh

Modified: boost/trunk/libs/ptr_container/doc/comp_assoc_ptr_container.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_assoc_ptr_container.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_assoc_ptr_container.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py associative_ptr_container.rst > associative_ptr_container.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_conventions.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_conventions.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_conventions.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,12 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py conventions.rst > conventions.html

Modified: boost/trunk/libs/ptr_container/doc/comp_examples.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_examples.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_examples.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py examples.rst > examples.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_faq.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_faq.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_faq.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py faq.rst > faq.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_guidelines.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_guidelines.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_guidelines.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py guidelines.rst > guidelines.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_headers.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_headers.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_headers.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py headers.rst > headers.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_indirect_fun.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_indirect_fun.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_indirect_fun.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py indirect_fun.rst > indirect_fun.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_ptr_array.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_ptr_array.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_ptr_array.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py ptr_array.rst > ptr_array.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_ptr_container.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_ptr_container.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_ptr_container.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py ptr_container.rst > ptr_container.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_ptr_deque.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_ptr_deque.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_ptr_deque.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py ptr_deque.rst > ptr_deque.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_ptr_list.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_ptr_list.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_ptr_list.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py ptr_list.rst > ptr_list.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_ptr_map.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_ptr_map.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_ptr_map.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py ptr_map.rst > ptr_map.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_ptr_map_adapter.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_ptr_map_adapter.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_ptr_map_adapter.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py ptr_map_adapter.rst > ptr_map_adapter.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_ptr_multimap.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_ptr_multimap.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_ptr_multimap.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py ptr_multimap.rst > ptr_multimap.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_ptr_multimap_adapter.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_ptr_multimap_adapter.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_ptr_multimap_adapter.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py ptr_multimap_adapter.rst > ptr_multimap_adapter.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_ptr_multiset.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_ptr_multiset.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_ptr_multiset.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py ptr_multiset.rst > ptr_multiset.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_ptr_multiset_adapter.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_ptr_multiset_adapter.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_ptr_multiset_adapter.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py ptr_multiset_adapter.rst > ptr_multiset_adapter.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_ptr_sequence_adapter.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_ptr_sequence_adapter.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_ptr_sequence_adapter.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py ptr_sequence_adapter.rst > ptr_sequence_adapter.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_ptr_set.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_ptr_set.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_ptr_set.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py ptr_set.rst > ptr_set.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_ptr_set_adapter.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_ptr_set_adapter.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_ptr_set_adapter.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py ptr_set_adapter.rst > ptr_set_adapter.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_ptr_vector.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_ptr_vector.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_ptr_vector.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py ptr_vector.rst > ptr_vector.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_reference.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_reference.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_reference.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,12 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py reference.rst > reference.html

Modified: boost/trunk/libs/ptr_container/doc/comp_rever_ptr_container.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_rever_ptr_container.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_rever_ptr_container.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py reversible_ptr_container.rst > reversible_ptr_container.html
 

Modified: boost/trunk/libs/ptr_container/doc/comp_tutorial.sh
===================================================================
--- boost/trunk/libs/ptr_container/doc/comp_tutorial.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/comp_tutorial.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,13 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
+
 rst2html.py tutorial.rst > tutorial.html
 

Modified: boost/trunk/libs/ptr_container/doc/conventions.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/conventions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/conventions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.5 $
+:Date: $Date: 2006/11/22 22:01:00 $
+:Revision: $Revision: 1.5.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -295,21 +295,21 @@
 and provides almost the same interface.  The new conventions are:</p>
 <div class="contents local topic">
 <ul class="simple">
-<li><a class="reference" href="#null-pointers-are-not-allowed-by-default" id="id3" name="id3">Null pointers are not allowed by default</a></li>
-<li><a class="reference" href="#all-default-iterators-apply-an-extra-layer-of-indirection" id="id4" name="id4">All default iterators apply an extra layer of indirection</a></li>
-<li><a class="reference" href="#all-comparison-operations-are-done-on-the-pointed-to-objects-and-not-at-the-pointer-level" id="id5" name="id5">All comparison operations are done on the pointed to objects and not at the pointer level</a></li>
-<li><a class="reference" href="#the-containers-are-neither-copy-constructible-nor-assignable" id="id6" name="id6">The containers are neither Copy Constructible nor Assignable</a></li>
-<li><a class="reference" href="#stored-elements-are-required-to-be-clonable-for-a-subset-of-the-operations" id="id7" name="id7">Stored elements are required to be Clonable for a subset of the operations</a></li>
-<li><a class="reference" href="#whenever-objects-are-inserted-into-a-container-they-are-cloned-before-insertion" id="id8" name="id8">Whenever objects are inserted into a container, they are cloned before insertion</a></li>
-<li><a class="reference" href="#whenever-pointers-are-inserted-into-a-container-ownership-is-transferred-to-the-container" id="id9" name="id9">Whenever pointers are inserted into a container, ownership is transferred to the container</a></li>
-<li><a class="reference" href="#ownership-can-be-transferred-from-a-container-on-a-per-pointer-basis" id="id10" name="id10">Ownership can be transferred from a container on a per pointer basis</a></li>
-<li><a class="reference" href="#ownership-can-be-transferred-from-a-container-to-another-container-on-a-per-iterator-range-basis" id="id11" name="id11">Ownership can be transferred from a container to another container on a per iterator range basis</a></li>
-<li><a class="reference" href="#a-container-can-be-cheaply-returned-from-functions-either-by-making-a-clone-or-by-giving-up-ownership-of-the-container" id="id12" name="id12">A container can be cheaply returned from functions either by making a clone or by giving up ownership of the container</a></li>
-<li><a class="reference" href="#iterators-are-invalidated-as-in-the-corresponding-standard-container" id="id13" name="id13">Iterators are invalidated as in the corresponding standard container</a></li>
+<li><a class="reference" href="#null-pointers-are-not-allowed-by-default" id="id4" name="id4">Null pointers are not allowed by default</a></li>
+<li><a class="reference" href="#all-default-iterators-apply-an-extra-layer-of-indirection" id="id5" name="id5">All default iterators apply an extra layer of indirection</a></li>
+<li><a class="reference" href="#all-comparison-operations-are-done-on-the-pointed-to-objects-and-not-at-the-pointer-level" id="id6" name="id6">All comparison operations are done on the pointed to objects and not at the pointer level</a></li>
+<li><a class="reference" href="#the-containers-are-neither-copy-constructible-nor-assignable" id="id7" name="id7">The containers are neither Copy Constructible nor Assignable</a></li>
+<li><a class="reference" href="#stored-elements-are-required-to-be-clonable-for-a-subset-of-the-operations" id="id8" name="id8">Stored elements are required to be Clonable for a subset of the operations</a></li>
+<li><a class="reference" href="#whenever-objects-are-inserted-into-a-container-they-are-cloned-before-insertion" id="id9" name="id9">Whenever objects are inserted into a container, they are cloned before insertion</a></li>
+<li><a class="reference" href="#whenever-pointers-are-inserted-into-a-container-ownership-is-transferred-to-the-container" id="id10" name="id10">Whenever pointers are inserted into a container, ownership is transferred to the container</a></li>
+<li><a class="reference" href="#ownership-can-be-transferred-from-a-container-on-a-per-pointer-basis" id="id11" name="id11">Ownership can be transferred from a container on a per pointer basis</a></li>
+<li><a class="reference" href="#ownership-can-be-transferred-from-a-container-to-another-container-on-a-per-iterator-range-basis" id="id12" name="id12">Ownership can be transferred from a container to another container on a per iterator range basis</a></li>
+<li><a class="reference" href="#a-container-can-be-cheaply-returned-from-functions-either-by-making-a-clone-or-by-giving-up-ownership-of-the-container" id="id13" name="id13">A container can be cheaply returned from functions either by making a clone or by giving up ownership of the container</a></li>
+<li><a class="reference" href="#iterators-are-invalidated-as-in-the-corresponding-standard-container" id="id14" name="id14">Iterators are invalidated as in the corresponding standard container</a></li>
 </ul>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id3" id="null-pointers-are-not-allowed-by-default" name="null-pointers-are-not-allowed-by-default">Null pointers are not allowed by default</a></h1>
+<h1><a class="toc-backref" href="#id4" id="null-pointers-are-not-allowed-by-default" name="null-pointers-are-not-allowed-by-default">Null pointers are not allowed by default</a></h1>
 <p>If the user tries to insert the null pointer, the operation will throw a 
 <tt class="docutils literal"><span class="pre">bad_pointer</span></tt> exception (see <a class="reference" href="examples.html">Example 1</a>).</p>
 <p>Use <a class="reference" href="reference.html#class-nullable">nullable</a> to allow null pointers.</p>
@@ -325,7 +325,7 @@
 </pre>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id4" id="all-default-iterators-apply-an-extra-layer-of-indirection" name="all-default-iterators-apply-an-extra-layer-of-indirection">All default iterators apply an extra layer of indirection</a></h1>
+<h1><a class="toc-backref" href="#id5" id="all-default-iterators-apply-an-extra-layer-of-indirection" name="all-default-iterators-apply-an-extra-layer-of-indirection">All default iterators apply an extra layer of indirection</a></h1>
 <p>This is done to 
 make the containers easier and safer to use.  It promotes a kind of 
 pointer-less programming and the user of a class needs not worry about 
@@ -336,14 +336,14 @@
 stored pointers.</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id5" id="all-comparison-operations-are-done-on-the-pointed-to-objects-and-not-at-the-pointer-level" name="all-comparison-operations-are-done-on-the-pointed-to-objects-and-not-at-the-pointer-level">All comparison operations are done on the pointed to objects and not at the pointer level</a></h1>
+<h1><a class="toc-backref" href="#id6" id="all-comparison-operations-are-done-on-the-pointed-to-objects-and-not-at-the-pointer-level" name="all-comparison-operations-are-done-on-the-pointed-to-objects-and-not-at-the-pointer-level">All comparison operations are done on the pointed to objects and not at the pointer level</a></h1>
 <p>For example, in <tt class="docutils literal"><span class="pre">ptr_set&lt;T&gt;</span></tt> the ordering is by default done by 
 <tt class="docutils literal"><span class="pre">boost::ptr_less&lt;T&gt;</span></tt> which compares the indirected pointers. 
 Similarly, <tt class="docutils literal"><span class="pre">operator==()</span></tt> for <tt class="docutils literal"><span class="pre">container&lt;Foo&gt;</span></tt> compares all objects
 with <tt class="docutils literal"><span class="pre">operator==(const</span> <span class="pre">Foo&amp;,</span> <span class="pre">const</span> <span class="pre">Foo&amp;)</span></tt>.</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id6" id="the-containers-are-neither-copy-constructible-nor-assignable" name="the-containers-are-neither-copy-constructible-nor-assignable">The containers are neither Copy Constructible nor Assignable</a></h1>
+<h1><a class="toc-backref" href="#id7" id="the-containers-are-neither-copy-constructible-nor-assignable" name="the-containers-are-neither-copy-constructible-nor-assignable">The containers are neither Copy Constructible nor Assignable</a></h1>
 <p>This is 
 because cloning a lot of pointers can be a very expensive operation; 
 instead functions are provided to transfer ownership.  If a deep-copy is 
@@ -358,35 +358,35 @@
 subset of the operations are still workable.</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id8" id="whenever-objects-are-inserted-into-a-container-they-are-cloned-before-insertion" name="whenever-objects-are-inserted-into-a-container-they-are-cloned-before-insertion">Whenever objects are inserted into a container, they are cloned before insertion</a></h1>
+<h1><a class="toc-backref" href="#id9" id="whenever-objects-are-inserted-into-a-container-they-are-cloned-before-insertion" name="whenever-objects-are-inserted-into-a-container-they-are-cloned-before-insertion">Whenever objects are inserted into a container, they are cloned before insertion</a></h1>
 <p>This is necessary because all pointer containers take ownerships of stored objects
 (see <a class="reference" href="examples.html">Example 5</a>).</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id9" id="whenever-pointers-are-inserted-into-a-container-ownership-is-transferred-to-the-container" name="whenever-pointers-are-inserted-into-a-container-ownership-is-transferred-to-the-container">Whenever pointers are inserted into a container, ownership is transferred to the container</a></h1>
+<h1><a class="toc-backref" href="#id10" id="whenever-pointers-are-inserted-into-a-container-ownership-is-transferred-to-the-container" name="whenever-pointers-are-inserted-into-a-container-ownership-is-transferred-to-the-container">Whenever pointers are inserted into a container, ownership is transferred to the container</a></h1>
 <p>All containers take ownership of the stored pointers and therefore a 
 container needs to have its own copies (see <a class="reference" href="examples.html">Example 5</a>).</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id10" id="ownership-can-be-transferred-from-a-container-on-a-per-pointer-basis" name="ownership-can-be-transferred-from-a-container-on-a-per-pointer-basis">Ownership can be transferred from a container on a per pointer basis</a></h1>
+<h1><a class="toc-backref" href="#id11" id="ownership-can-be-transferred-from-a-container-on-a-per-pointer-basis" name="ownership-can-be-transferred-from-a-container-on-a-per-pointer-basis">Ownership can be transferred from a container on a per pointer basis</a></h1>
 <p>This can of course also be convenient.  Whenever it happens, an 
 <tt class="docutils literal"><span class="pre">SmartContainer::auto_type</span></tt> object is used to provide an exception-safe transfer 
 (see <a class="reference" href="examples.html">Example 6</a>).</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id11" id="ownership-can-be-transferred-from-a-container-to-another-container-on-a-per-iterator-range-basis" name="ownership-can-be-transferred-from-a-container-to-another-container-on-a-per-iterator-range-basis">Ownership can be transferred from a container to another container on a per iterator range basis</a></h1>
+<h1><a class="toc-backref" href="#id12" id="ownership-can-be-transferred-from-a-container-to-another-container-on-a-per-iterator-range-basis" name="ownership-can-be-transferred-from-a-container-to-another-container-on-a-per-iterator-range-basis">Ownership can be transferred from a container to another container on a per iterator range basis</a></h1>
 <p>This makes it possible to exchange data safely between different pointer 
 containers without cloning the objects again (see <a class="reference" href="examples.html">Example 7</a>).</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id12" id="a-container-can-be-cheaply-returned-from-functions-either-by-making-a-clone-or-by-giving-up-ownership-of-the-container" name="a-container-can-be-cheaply-returned-from-functions-either-by-making-a-clone-or-by-giving-up-ownership-of-the-container">A container can be cheaply returned from functions either by making a clone or by giving up ownership of the container</a></h1>
+<h1><a class="toc-backref" href="#id13" id="a-container-can-be-cheaply-returned-from-functions-either-by-making-a-clone-or-by-giving-up-ownership-of-the-container" name="a-container-can-be-cheaply-returned-from-functions-either-by-making-a-clone-or-by-giving-up-ownership-of-the-container">A container can be cheaply returned from functions either by making a clone or by giving up ownership of the container</a></h1>
 <p>Two special member functions, <tt class="docutils literal"><span class="pre">clone()</span></tt> and <tt class="docutils literal"><span class="pre">release()</span></tt>, both return an 
 <tt class="docutils literal"><span class="pre">auto_ptr&lt;SmartContainer&gt;</span></tt> which can be assigned to another pointer container.  This 
 effectively reduces the cost of returning a container to one 
 heap-allocation plus a call to <tt class="docutils literal"><span class="pre">swap()</span></tt> (see <a class="reference" href="examples.html">Example 3</a>).</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id13" id="iterators-are-invalidated-as-in-the-corresponding-standard-container" name="iterators-are-invalidated-as-in-the-corresponding-standard-container">Iterators are invalidated as in the corresponding standard container</a></h1>
+<h1><a class="toc-backref" href="#id14" id="iterators-are-invalidated-as-in-the-corresponding-standard-container" name="iterators-are-invalidated-as-in-the-corresponding-standard-container">Iterators are invalidated as in the corresponding standard container</a></h1>
 <p>Because the containers in this library wrap standard containers, the
 rules for invalidation of iterators are the same as the rules
 of the corresponding standard container.</p>
@@ -394,16 +394,16 @@
 insertion and deletion only invalidates the deleted
 element and elements following it; all elements before the inserted/deleted
 element remain valid.</p>
-<p><strong>Navigate:</strong></p>
+<hr><p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
 <li><a class="reference" href="reference.html">reference</a></li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/conventions.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/conventions.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/conventions.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -113,11 +113,21 @@
 element and elements following it; all elements before the inserted/deleted
 element remain valid.
 
+.. raw:: html 
 
+        <hr>
+
 **Navigate:**
 
 - `home <ptr_container.html>`_
 - `reference <reference.html>`_
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+.. raw:: html 
 
+        <hr>
+
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/examples.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/examples.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/examples.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.4 $
+:Date: $Date: 2006/11/22 22:01:00 $
+:Revision: $Revision: 1.4.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -293,26 +293,29 @@
 <p>Some examples are given here and in the accompanying test files:</p>
 <div class="contents local topic">
 <ul class="simple">
-<li><a class="reference" href="#null-pointers-cannot-be-stored-in-the-containers" id="id1" name="id1">1. Null pointers cannot be stored in the containers</a></li>
-<li><a class="reference" href="#iterators-and-other-operations-return-indirected-values" id="id2" name="id2">2. Iterators and other operations return indirected values</a></li>
-<li><a class="reference" href="#copy-semantics-of-pointer-containers" id="id3" name="id3">3. Copy-semantics of pointer containers</a></li>
-<li><a class="reference" href="#making-a-non-copyable-type-clonable" id="id4" name="id4">4. Making a non-copyable type Clonable</a></li>
-<li><a class="reference" href="#objects-are-cloned-before-insertion-inserted-pointers-are-owned-by-the-container" id="id5" name="id5">5. Objects are cloned before insertion, inserted pointers are owned by the container</a></li>
-<li><a class="reference" href="#transferring-ownership-of-a-single-element" id="id6" name="id6">6. Transferring ownership of a single element</a></li>
-<li><a class="reference" href="#transferring-ownership-of-pointers-between-different-pointer-containers" id="id7" name="id7">7. Transferring ownership of pointers between different pointer containers</a></li>
-<li><a class="reference" href="#selected-test-files" id="id8" name="id8">8. Selected test files</a></li>
+<li><a class="reference" href="#null-pointers-cannot-be-stored-in-the-containers" id="id2" name="id2">1. Null pointers cannot be stored in the containers</a></li>
+<li><a class="reference" href="#iterators-and-other-operations-return-indirected-values" id="id3" name="id3">2. Iterators and other operations return indirected values</a></li>
+<li><a class="reference" href="#copy-semantics-of-pointer-containers" id="id4" name="id4">3. Copy-semantics of pointer containers</a></li>
+<li><a class="reference" href="#making-a-non-copyable-type-clonable" id="id5" name="id5">4. Making a non-copyable type Clonable</a></li>
+<li><a class="reference" href="#objects-are-cloned-before-insertion-inserted-pointers-are-owned-by-the-container" id="id6" name="id6">5. Objects are cloned before insertion, inserted pointers are owned by the container</a></li>
+<li><a class="reference" href="#transferring-ownership-of-a-single-element" id="id7" name="id7">6. Transferring ownership of a single element</a></li>
+<li><a class="reference" href="#transferring-ownership-of-pointers-between-different-pointer-containers" id="id8" name="id8">7. Transferring ownership of pointers between different pointer containers</a></li>
+<li><a class="reference" href="#selected-test-files" id="id9" name="id9">8. Selected test files</a></li>
+<li><a class="reference" href="#a-large-example" id="id10" name="id10">9. A large example</a></li>
 </ul>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id1" id="null-pointers-cannot-be-stored-in-the-containers" name="null-pointers-cannot-be-stored-in-the-containers"><span id="example-1"></span>1. Null pointers cannot be stored in the containers</a></h1>
+<h1><a class="toc-backref" href="#id2" id="null-pointers-cannot-be-stored-in-the-containers" name="null-pointers-cannot-be-stored-in-the-containers"><span id="example-1"></span>1. Null pointers cannot be stored in the containers</a></h1>
 <pre class="literal-block">
 my_container.push_back( 0 );            // throws bad_ptr 
 my_container.replace( an_iterator, 0 ); // throws bad_ptr
-my_container.insert( an_iterator, 0 );  // throws bad_ptr                                                                 
+my_container.insert( an_iterator, 0 );  // throws bad_ptr       
+std::auto_ptr&lt;T&gt; p( 0 );
+my_container.push_back( p );            // throws bad_ptr                                                          
 </pre>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id2" id="iterators-and-other-operations-return-indirected-values" name="iterators-and-other-operations-return-indirected-values"><span id="example-2"></span>2. Iterators and other operations return indirected values</a></h1>
+<h1><a class="toc-backref" href="#id3" id="iterators-and-other-operations-return-indirected-values" name="iterators-and-other-operations-return-indirected-values"><span id="example-2"></span>2. Iterators and other operations return indirected values</a></h1>
 <pre class="literal-block">
 ptr_vector&lt;X&gt; pvec; 
 std::vector&lt;X*&gt; vec;
@@ -325,7 +328,7 @@
 </pre>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id3" id="copy-semantics-of-pointer-containers" name="copy-semantics-of-pointer-containers"><span id="example-3"></span>3. Copy-semantics of pointer containers</a></h1>
+<h1><a class="toc-backref" href="#id4" id="copy-semantics-of-pointer-containers" name="copy-semantics-of-pointer-containers"><span id="example-3"></span>3. Copy-semantics of pointer containers</a></h1>
 <pre class="literal-block">
 ptr_vector&lt;T&gt; vec1; 
 ...
@@ -337,12 +340,12 @@
 </pre>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id4" id="making-a-non-copyable-type-clonable" name="making-a-non-copyable-type-clonable"><span id="example-4"></span>4. Making a non-copyable type Clonable</a></h1>
+<h1><a class="toc-backref" href="#id5" id="making-a-non-copyable-type-clonable" name="making-a-non-copyable-type-clonable"><span id="example-4"></span>4. Making a non-copyable type Clonable</a></h1>
 <pre class="literal-block">
  // a class that has no normal copy semantics
 class X : boost::noncopyable { public: X* clone() const; ... };
                                                                    
-// this will be found by the library by argument dependent lookup                                                                   
+// this will be found by the library by argument dependent lookup (ADL)                                                                  
 X* new_clone( const X&amp; x ) 
 { return x.clone(); }
                                                                    
@@ -354,19 +357,21 @@
 </pre>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id5" id="objects-are-cloned-before-insertion-inserted-pointers-are-owned-by-the-container" name="objects-are-cloned-before-insertion-inserted-pointers-are-owned-by-the-container"><span id="example-5"></span>5. Objects are cloned before insertion, inserted pointers are owned by the container</a></h1>
+<h1><a class="toc-backref" href="#id6" id="objects-are-cloned-before-insertion-inserted-pointers-are-owned-by-the-container" name="objects-are-cloned-before-insertion-inserted-pointers-are-owned-by-the-container"><span id="example-5"></span>5. Objects are cloned before insertion, inserted pointers are owned by the container</a></h1>
 <pre class="literal-block">
 class X { ... };                     // assume 'X' is Clonable 
 X x;                                 // and 'X' can be stack-allocated 
 ptr_list&lt;X&gt; list; 
-list.push_back( x );                 // clone 'x' and then insert the resulting pointer 
-list.push_back( new_clone( x );      // do it manually
+list.push_back( new_clone( x ) );    // insert a clone
 list.push_back( new X );             // always give the pointer directly to the container to avoid leaks
 list.push_back( &amp;x );                // don't do this!!! 
+std::auto_ptr&lt;X&gt; p( new X );
+list.push_back( p );                 // give up ownership
+BOOST_ASSERT( p.get() == 0 );
 </pre>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id6" id="transferring-ownership-of-a-single-element" name="transferring-ownership-of-a-single-element"><span id="example-6"></span>6. Transferring ownership of a single element</a></h1>
+<h1><a class="toc-backref" href="#id7" id="transferring-ownership-of-a-single-element" name="transferring-ownership-of-a-single-element"><span id="example-6"></span>6. Transferring ownership of a single element</a></h1>
 <pre class="literal-block">
 ptr_deque&lt;T&gt;                    deq; 
 typedef ptr_deque&lt;T&gt;::auto_type auto_type;
@@ -376,10 +381,12 @@
 auto_type ptr  = deq.release_back();             // remove back element from container and give up ownership
 auto_type ptr2 = deq.release( deq.begin() + 2 ); // use an iterator to determine the element to release
 ptr            = deq.release_front();            // supported for 'ptr_list' and 'ptr_deque'
+                                
+deq.push_back( ptr.release() );                  // give ownership back to the container
 </pre>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id7" id="transferring-ownership-of-pointers-between-different-pointer-containers" name="transferring-ownership-of-pointers-between-different-pointer-containers"><span id="example-7"></span>7. Transferring ownership of pointers between different pointer containers</a></h1>
+<h1><a class="toc-backref" href="#id8" id="transferring-ownership-of-pointers-between-different-pointer-containers" name="transferring-ownership-of-pointers-between-different-pointer-containers"><span id="example-7"></span>7. Transferring ownership of pointers between different pointer containers</a></h1>
 <pre class="literal-block">
 ptr_list&lt;X&gt; list; ptr_vector&lt;X&gt; vec;
 ...
@@ -389,9 +396,10 @@
 list.transfer( list.begin(), vec.begin(), vec );           // make the first element of 'vec' the first element of 'list'
 vec.transfer( vec.end(), list.begin(), list.end(), list ); // put all the lists element into the vector                                 
 </pre>
+<p>We can also transfer objects from <tt class="docutils literal"><span class="pre">ptr_container&lt;Derived&gt;</span></tt> to <tt class="docutils literal"><span class="pre">ptr_container&lt;Base</span></tt> without any problems.</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id8" id="selected-test-files" name="selected-test-files"><span id="example-8"></span>8. Selected test files</a></h1>
+<h1><a class="toc-backref" href="#id9" id="selected-test-files" name="selected-test-files"><span id="example-8"></span>8. Selected test files</a></h1>
 <table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
@@ -401,7 +409,7 @@
 </tr>
 <tr class="field"><th class="field-name" colspan="2"><a class="reference" href="../test/simple_test.cpp">simple_test.cpp</a>:</th></tr>
 <tr><td>&nbsp;</td><td class="field-body">Shows how the usage of pointer container compares with a 
-container of pointer pointers</td>
+container of smart pointers</td>
 </tr>
 <tr class="field"><th class="field-name" colspan="2"><a class="reference" href="../test/view_example.cpp">view_example.cpp</a>:</th></tr>
 <tr><td>&nbsp;</td><td class="field-body">Shows how to use a pointer container as a view into other container</td>
@@ -412,16 +420,377 @@
 </tr>
 </tbody>
 </table>
-<!-- 9. A large example
-++++++++++++++++++
-
-This examples shows many of the most common
-features at work.
-
-.. raw:: html
-        :file: tut1.html
-
-10. Changing the Clone Allocator
+</div>
+<div class="section">
+<h1><a class="toc-backref" href="#id10" id="a-large-example" name="a-large-example">9. A large example</a></h1>
+<p>This examples shows many of the most common
+features at work. The example provide lots of comments.</p>
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title> </title>
+<link rel="stylesheet" href="style.css" type="text/css">
+</head>
+
+<body>
+    <pre><span class=comment>//
+// Boost.Pointer Container
+//
+//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+//  distribution is subject to the Boost Software License, Version
+//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt)
+//
+// For more information, see http://www.boost.org/libs/ptr_container/
+//
+
+//
+// This example is intended to get you started.
+// Notice how the smart container
+//
+// 1. takes ownership of objects
+// 2. transfers ownership
+// 3. applies indirection to iterators 
+// 4. clones objects from other smart containers
+// 
+
+//
+// First we select which container to use.
+//</span>
+<span class=preprocessor>#include</span> <span class=special>&lt;</span><span class=identifier>boost</span><span class=special>/</span><span class=identifier>ptr_container</span><span class=special>/</span><span class=identifier>ptr_deque</span><span class=special>.</span><span class=identifier>hpp</span><span class=special>&gt;</span>
+
+<span class=comment>//
+// we need these later in the example
+//</span>
+<span class=preprocessor>#include</span> <span class=special>&lt;</span><span class=identifier>boost</span><span class=special>/</span><span class=identifier>assert</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>string</span><span class=special>&gt;</span>
+<span class=preprocessor>#include</span> <span class=special>&lt;</span><span class=identifier>exception</span><span class=special>&gt;</span>
+
+
+<span class=comment>//
+// Then we define a small polymorphic class
+// hierarchy.
+//</span> 
+
+<span class=keyword>class</span> <span class=identifier>animal</span> <span class=special>:</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>noncopyable</span>
+<span class=special>{</span>
+    <span class=keyword>virtual</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span> <span class=identifier>do_speak</span><span class=special>()</span> <span class=keyword>const</span> <span class=special>=</span> <span class=number>0</span><span class=special>;</span>
+    <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span> <span class=identifier>name_</span><span class=special>;</span>
+
+<span class=keyword>protected</span><span class=special>:</span>
+    <span class=comment>//
+    // Animals cannot be copied...
+    //</span>
+    <span class=identifier>animal</span><span class=special>(</span> <span class=keyword>const</span> <span class=identifier>animal</span><span class=special>&amp;</span> <span class=identifier>r</span> <span class=special>)</span> <span class=special>:</span> <span class=identifier>name_</span><span class=special>(</span> <span class=identifier>r</span><span class=special>.</span><span class=identifier>name_</span> <span class=special>)</span>           <span class=special>{</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>animal</span><span class=special>&amp;</span> <span class=special>);</span>
+
+<span class=keyword>private</span><span class=special>:</span>
+    <span class=comment>//
+    // ...but due to advances in genetics, we can clone them!
+    //</span>
+
+    <span class=keyword>virtual</span> <span class=identifier>animal</span><span class=special>*</span> <span class=identifier>do_clone</span><span class=special>()</span> <span class=keyword>const</span> <span class=special>=</span> <span class=number>0</span><span class=special>;</span>
+        
+<span class=keyword>public</span><span class=special>:</span>
+    <span class=identifier>animal</span><span class=special>(</span> <span class=keyword>const</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span><span class=special>&amp;</span> <span class=identifier>name</span> <span class=special>)</span> <span class=special>:</span> <span class=identifier>name_</span><span class=special>(</span><span class=identifier>name</span><span class=special>)</span>        <span class=special>{</span> <span class=special>}</span>
+    <span class=keyword>virtual</span> <span class=special>~</span><span class=identifier>animal</span><span class=special>()</span> <span class=keyword>throw</span><span class=special>()</span>                              <span class=special>{</span> <span class=special>}</span>
+    
+    <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span> <span class=identifier>speak</span><span class=special>()</span> <span class=keyword>const</span>
+    <span class=special>{</span>
+        <span class=keyword>return</span> <span class=identifier>do_speak</span><span class=special>();</span>
+    <span class=special>}</span>
+
+    <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span> <span class=identifier>name</span><span class=special>()</span> <span class=keyword>const</span>
+    <span class=special>{</span>
+        <span class=keyword>return</span> <span class=identifier>name_</span><span class=special>;</span>
+    <span class=special>}</span>
+
+    <span class=identifier>animal</span><span class=special>*</span> <span class=identifier>clone</span><span class=special>()</span> <span class=keyword>const</span>
+    <span class=special>{</span>
+        <span class=keyword>return</span> <span class=identifier>do_clone</span><span class=special>();</span>
+    <span class=special>}</span>
+<span class=special>};</span>
+
+<span class=comment>//
+// An animal is still not Clonable. We need this last hook.
+//
+// Notice that we pass the animal by const reference
+// and return by pointer.
+//</span>
+
+<span class=identifier>animal</span><span class=special>*</span> <span class=identifier>new_clone</span><span class=special>(</span> <span class=keyword>const</span> <span class=identifier>animal</span><span class=special>&amp;</span> <span class=identifier>a</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>clone</span><span class=special>();</span>
+<span class=special>}</span>
+
+<span class=comment>//
+// We do not need to define 'delete_clone()' since
+// since the default is to call the default 'operator delete()'.
+//</span>
+
+<span class=keyword>const</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span> <span class=identifier>muuuh</span> <span class=special>=</span> <span class=string>&quot;Muuuh!&quot;</span><span class=special>;</span>
+<span class=keyword>const</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span> <span class=identifier>oiink</span> <span class=special>=</span> <span class=string>&quot;Oiiink&quot;</span><span class=special>;</span>
+
+<span class=keyword>class</span> <span class=identifier>cow</span> <span class=special>:</span> <span class=keyword>public</span> <span class=identifier>animal</span>
+<span class=special>{</span>
+    <span class=keyword>virtual</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span> <span class=identifier>do_speak</span><span class=special>()</span> <span class=keyword>const</span>
+    <span class=special>{</span>
+        <span class=keyword>return</span> <span class=identifier>muuuh</span><span class=special>;</span>
+    <span class=special>}</span>
+
+    <span class=keyword>virtual</span> <span class=identifier>animal</span><span class=special>*</span> <span class=identifier>do_clone</span><span class=special>()</span> <span class=keyword>const</span>
+    <span class=special>{</span>
+        <span class=keyword>return</span> <span class=keyword>new</span> <span class=identifier>cow</span><span class=special>(</span> <span class=special>*</span><span class=keyword>this</span> <span class=special>);</span>
+    <span class=special>}</span>
+
+<span class=keyword>public</span><span class=special>:</span>
+    <span class=identifier>cow</span><span class=special>(</span> <span class=keyword>const</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span><span class=special>&amp;</span> <span class=identifier>name</span> <span class=special>)</span> <span class=special>:</span> <span class=identifier>animal</span><span class=special>(</span><span class=identifier>name</span><span class=special>)</span>          <span class=special>{</span> <span class=special>}</span>
+<span class=special>};</span>
+
+<span class=keyword>class</span> <span class=identifier>pig</span> <span class=special>:</span> <span class=keyword>public</span> <span class=identifier>animal</span>
+<span class=special>{</span>
+    <span class=keyword>virtual</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span> <span class=identifier>do_speak</span><span class=special>()</span> <span class=keyword>const</span>
+    <span class=special>{</span>
+        <span class=keyword>return</span> <span class=identifier>oiink</span><span class=special>;</span>
+    <span class=special>}</span>
+
+    <span class=keyword>virtual</span> <span class=identifier>animal</span><span class=special>*</span> <span class=identifier>do_clone</span><span class=special>()</span> <span class=keyword>const</span>
+    <span class=special>{</span>
+        <span class=keyword>return</span> <span class=keyword>new</span> <span class=identifier>pig</span><span class=special>(</span> <span class=special>*</span><span class=keyword>this</span> <span class=special>);</span>
+    <span class=special>}</span>
+    
+<span class=keyword>public</span><span class=special>:</span>
+    <span class=identifier>pig</span><span class=special>(</span> <span class=keyword>const</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span><span class=special>&amp;</span> <span class=identifier>name</span> <span class=special>)</span> <span class=special>:</span> <span class=identifier>animal</span><span class=special>(</span><span class=identifier>name</span><span class=special>)</span>          <span class=special>{</span> <span class=special>}</span>
+<span class=special>};</span>
+
+<span class=comment>//
+// Then we, of course, need a place to put all
+// those animals.
+//</span>
+
+<span class=keyword>class</span> <span class=identifier>farm</span>
+<span class=special>{</span>
+    <span class=comment>//
+    // This is where the smart containers are handy
+    //</span>
+    <span class=keyword>typedef</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>ptr_deque</span><span class=special>&lt;</span><span class=identifier>animal</span><span class=special>&gt;</span> <span class=identifier>barn_type</span><span class=special>;</span>
+    <span class=identifier>barn_type</span>                        <span class=identifier>barn</span><span class=special>;</span>
+
+    <span class=comment>//
+    // An error type
+    //</span>
+    <span class=keyword>struct</span> <span class=identifier>farm_trouble</span> <span class=special>:</span> <span class=keyword>public</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>exception</span>           <span class=special>{</span> <span class=special>};</span>
+
+<span class=keyword>public</span><span class=special>:</span>
+    <span class=comment>// 
+    // We would like to make it possible to
+    // iterate over the animals in the farm
+    //</span>
+    <span class=keyword>typedef</span> <span class=identifier>barn_type</span><span class=special>::</span><span class=identifier>iterator</span>  <span class=identifier>animal_iterator</span><span class=special>;</span>
+
+    <span class=comment>//
+    // We also need to count the farm's size...
+    //</span>
+    <span class=keyword>typedef</span> <span class=identifier>barn_type</span><span class=special>::</span><span class=identifier>size_type</span> <span class=identifier>size_type</span><span class=special>;</span>
+    
+    <span class=comment>//
+    // And we also want to transfer an animal
+    // safely around. The easiest way to think
+    // about '::auto_type' is to imagine a simplified
+    // 'std::auto_ptr&lt;T&gt;' ... this means you can expect
+    // 
+    //   T* operator-&gt;()
+    //   T* release()
+    //   deleting destructor
+    //
+    // but not more.
+    //</span>
+    <span class=keyword>typedef</span> <span class=identifier>barn_type</span><span class=special>::</span><span class=identifier>auto_type</span>  <span class=identifier>animal_transport</span><span class=special>;</span>
+
+    <span class=comment>// 
+    // Create an empty farm.
+    //</span>
+    <span class=identifier>farm</span><span class=special>()</span>                                                 <span class=special>{</span> <span class=special>}</span>
+    
+    <span class=comment>//
+    // We need a constructor that can make a new
+    // farm by cloning a range of animals.
+    //</span>
+    <span class=identifier>farm</span><span class=special>(</span> <span class=identifier>animal_iterator</span> <span class=identifier>begin</span><span class=special>,</span> <span class=identifier>animal_iterator</span> <span class=identifier>end</span> <span class=special>)</span>
+     <span class=special>:</span> 
+        <span class=comment>//
+        // Objects are always cloned before insertion
+        // unless we explicitly add a pointer or 
+        // use 'release()'. Therefore we actually
+        // clone all animals in the range
+        //</span>
+        <span class=identifier>barn</span><span class=special>(</span> <span class=identifier>begin</span><span class=special>,</span> <span class=identifier>end</span> <span class=special>)</span>                               <span class=special>{</span> <span class=special>}</span>
+    
+    <span class=comment>//
+    // ... so we need some other function too
+    //</span>
+
+    <span class=identifier>animal_iterator</span> <span class=identifier>begin</span><span class=special>()</span>
+    <span class=special>{</span>
+        <span class=keyword>return</span> <span class=identifier>barn</span><span class=special>.</span><span class=identifier>begin</span><span class=special>();</span>
+    <span class=special>}</span>
+
+    <span class=identifier>animal_iterator</span> <span class=identifier>end</span><span class=special>()</span>
+    <span class=special>{</span>
+        <span class=keyword>return</span> <span class=identifier>barn</span><span class=special>.</span><span class=identifier>end</span><span class=special>();</span>
+    <span class=special>}</span>
+    
+    <span class=comment>//
+    // Here it is quite ok to have an 'animal*' argument.
+    // The smart container will handle all ownership
+    // issues.
+    //</span>
+    <span class=keyword>void</span> <span class=identifier>buy_animal</span><span class=special>(</span> <span class=identifier>animal</span><span class=special>*</span> <span class=identifier>a</span> <span class=special>)</span>
+    <span class=special>{</span>
+        <span class=identifier>barn</span><span class=special>.</span><span class=identifier>push_back</span><span class=special>(</span> <span class=identifier>a</span> <span class=special>);</span>
+    <span class=special>}</span>
+
+    <span class=comment>//
+    // The farm can also be in economical trouble and
+    // therefore be in the need to sell animals.
+    //</span>
+    <span class=identifier>animal_transport</span> <span class=identifier>sell_animal</span><span class=special>(</span> <span class=identifier>animal_iterator</span> <span class=identifier>to_sell</span> <span class=special>)</span>
+    <span class=special>{</span>
+        <span class=keyword>if</span><span class=special>(</span> <span class=identifier>to_sell</span> <span class=special>==</span> <span class=identifier>end</span><span class=special>()</span> <span class=special>)</span>
+            <span class=keyword>throw</span> <span class=identifier>farm_trouble</span><span class=special>();</span>
+
+        <span class=comment>//
+        // Here we remove the animal from the barn,
+        // but the animal is not deleted yet...it's
+        // up to the buyer to decide what
+        // to do with it.
+        //</span>
+        <span class=keyword>return</span> <span class=identifier>barn</span><span class=special>.</span><span class=identifier>release</span><span class=special>(</span> <span class=identifier>to_sell</span> <span class=special>);</span>
+    <span class=special>}</span>
+
+    <span class=comment>//
+    // How big a farm do we have?
+    //</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=keyword>return</span> <span class=identifier>barn</span><span class=special>.</span><span class=identifier>size</span><span class=special>();</span>
+    <span class=special>}</span>
+
+    <span class=comment>//
+    // If things are bad, we might choose to sell all animals :-(
+    //</span>
+    <span class=identifier>std</span><span class=special>::</span><span class=identifier>auto_ptr</span><span class=special>&lt;</span><span class=identifier>barn_type</span><span class=special>&gt;</span> <span class=identifier>sell_farm</span><span class=special>()</span>
+    <span class=special>{</span>
+        <span class=keyword>return</span> <span class=identifier>barn</span><span class=special>.</span><span class=identifier>release</span><span class=special>();</span>
+    <span class=special>}</span>
+
+    <span class=comment>//
+    // However, if things are good, we might buy somebody
+    // else's farm :-)
+    //</span>
+
+    <span class=keyword>void</span> <span class=identifier>buy_farm</span><span class=special>(</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>auto_ptr</span><span class=special>&lt;</span><span class=identifier>barn_type</span><span class=special>&gt;</span> <span class=identifier>other</span> <span class=special>)</span>
+    <span class=special>{</span>
+        <span class=comment>//
+        // This line inserts all the animals from 'other'
+        // and is guaranteed either to succeed or to have no
+        // effect
+        //</span>
+        <span class=identifier>barn</span><span class=special>.</span><span class=identifier>transfer</span><span class=special>(</span> <span class=identifier>barn</span><span class=special>.</span><span class=identifier>end</span><span class=special>(),</span> <span class=comment>// insert new animals at the end</span>
+                         <span class=special>*</span><span class=identifier>other</span> <span class=special>);</span>     <span class=comment>// we want to transfer all animals,
+                                       // so we use the whole container as argument
+        //
+        // You might think you would have to do
+        //
+        // other.release();
+        //
+        // but '*other' is empty and can go out of scope as it wants
+        //</span>
+        <span class=identifier>BOOST_ASSERT</span><span class=special>(</span> <span class=identifier>other</span><span class=special>-&gt;</span><span class=identifier>empty</span><span class=special>()</span> <span class=special>);</span>
+    <span class=special>}</span>
+    
+<span class=special>};</span> <span class=comment>// class 'farm'.</span>
+
+<span class=keyword>int</span> <span class=identifier>main</span><span class=special>()</span>
+<span class=special>{</span>
+    <span class=comment>//
+    // First we make a farm
+    //</span>
+    <span class=identifier>farm</span> <span class=identifier>animal_farm</span><span class=special>;</span>
+    <span class=identifier>BOOST_ASSERT</span><span class=special>(</span> <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>size</span><span class=special>()</span> <span class=special>==</span> <span class=number>0u</span> <span class=special>);</span>
+    
+    <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>buy_animal</span><span class=special>(</span> <span class=keyword>new</span> <span class=identifier>pig</span><span class=special>(</span><span class=string>&quot;Betty&quot;</span><span class=special>)</span> <span class=special>);</span>
+    <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>buy_animal</span><span class=special>(</span> <span class=keyword>new</span> <span class=identifier>pig</span><span class=special>(</span><span class=string>&quot;Benny&quot;</span><span class=special>)</span> <span class=special>);</span>
+    <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>buy_animal</span><span class=special>(</span> <span class=keyword>new</span> <span class=identifier>pig</span><span class=special>(</span><span class=string>&quot;Jeltzin&quot;</span><span class=special>)</span> <span class=special>);</span>
+    <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>buy_animal</span><span class=special>(</span> <span class=keyword>new</span> <span class=identifier>cow</span><span class=special>(</span><span class=string>&quot;Hanz&quot;</span><span class=special>)</span> <span class=special>);</span>
+    <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>buy_animal</span><span class=special>(</span> <span class=keyword>new</span> <span class=identifier>cow</span><span class=special>(</span><span class=string>&quot;Mary&quot;</span><span class=special>)</span> <span class=special>);</span>
+    <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>buy_animal</span><span class=special>(</span> <span class=keyword>new</span> <span class=identifier>cow</span><span class=special>(</span><span class=string>&quot;Frederik&quot;</span><span class=special>)</span> <span class=special>);</span>
+    <span class=identifier>BOOST_ASSERT</span><span class=special>(</span> <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>size</span><span class=special>()</span> <span class=special>==</span> <span class=number>6u</span> <span class=special>);</span>
+
+    <span class=comment>//
+    // Then we make another farm...it will actually contain
+    // a clone of the other farm.
+    //</span>
+    <span class=identifier>farm</span> <span class=identifier>new_farm</span><span class=special>(</span> <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span> <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>end</span><span class=special>()</span> <span class=special>);</span>
+    <span class=identifier>BOOST_ASSERT</span><span class=special>(</span> <span class=identifier>new_farm</span><span class=special>.</span><span class=identifier>size</span><span class=special>()</span> <span class=special>==</span> <span class=number>6u</span> <span class=special>);</span>
+
+    <span class=comment>//
+    // Is it really clones in the new farm?
+    //</span>
+    <span class=identifier>BOOST_ASSERT</span><span class=special>(</span> <span class=identifier>new_farm</span><span class=special>.</span><span class=identifier>begin</span><span class=special>()-&gt;</span><span class=identifier>name</span><span class=special>()</span> <span class=special>==</span> <span class=string>&quot;Betty&quot;</span> <span class=special>);</span>
+    
+    <span class=comment>//
+    // Then we search for an animal, Mary (the Crown Princess of Denmark),
+    // because we would like to buy her ...
+    //</span>
+    <span class=keyword>typedef</span> <span class=identifier>farm</span><span class=special>::</span><span class=identifier>animal_iterator</span> <span class=identifier>iterator</span><span class=special>;</span>
+    <span class=identifier>iterator</span> <span class=identifier>to_sell</span><span class=special>;</span>
+    <span class=keyword>for</span><span class=special>(</span> <span class=identifier>iterator</span> <span class=identifier>i</span>   <span class=special>=</span> <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span>
+                  <span class=identifier>end</span> <span class=special>=</span> <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>end</span><span class=special>();</span>
+         <span class=identifier>i</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=special>{</span>
+        <span class=keyword>if</span><span class=special>(</span> <span class=identifier>i</span><span class=special>-&gt;</span><span class=identifier>name</span><span class=special>()</span> <span class=special>==</span> <span class=string>&quot;Mary&quot;</span> <span class=special>)</span>
+        <span class=special>{</span>
+            <span class=identifier>to_sell</span> <span class=special>=</span> <span class=identifier>i</span><span class=special>;</span>
+            <span class=keyword>break</span><span class=special>;</span>
+        <span class=special>}</span>
+    <span class=special>}</span>
+
+    <span class=identifier>farm</span><span class=special>::</span><span class=identifier>animal_transport</span> <span class=identifier>mary</span> <span class=special>=</span> <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>sell_animal</span><span class=special>(</span> <span class=identifier>to_sell</span> <span class=special>);</span>
+
+
+    <span class=keyword>if</span><span class=special>(</span> <span class=identifier>mary</span><span class=special>-&gt;</span><span class=identifier>speak</span><span class=special>()</span> <span class=special>==</span> <span class=identifier>muuuh</span> <span class=special>)</span>
+        <span class=comment>//
+        // Great, Mary is a cow, and she may live longer
+        //</span>
+        <span class=identifier>new_farm</span><span class=special>.</span><span class=identifier>buy_animal</span><span class=special>(</span> <span class=identifier>mary</span><span class=special>.</span><span class=identifier>release</span><span class=special>()</span> <span class=special>);</span>
+    <span class=keyword>else</span>
+        <span class=comment>//
+        // Then the animal would be destroyed (!)
+        // when we go out of scope.
+        //</span>
+        <span class=special>;</span>
+
+    <span class=comment>//
+    // Now we can observe some changes to the two farms...
+    //</span>
+    <span class=identifier>BOOST_ASSERT</span><span class=special>(</span> <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>size</span><span class=special>()</span> <span class=special>==</span> <span class=number>5u</span> <span class=special>);</span>
+    <span class=identifier>BOOST_ASSERT</span><span class=special>(</span> <span class=identifier>new_farm</span><span class=special>.</span><span class=identifier>size</span><span class=special>()</span>    <span class=special>==</span> <span class=number>7u</span> <span class=special>);</span>
+
+    <span class=comment>//
+    // The new farm has however underestimated how much
+    // it cost to feed Mary and its owner is forced to sell the farm...
+    //</span>
+    <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>buy_farm</span><span class=special>(</span> <span class=identifier>new_farm</span><span class=special>.</span><span class=identifier>sell_farm</span><span class=special>()</span> <span class=special>);</span>
+
+    <span class=identifier>BOOST_ASSERT</span><span class=special>(</span> <span class=identifier>new_farm</span><span class=special>.</span><span class=identifier>size</span><span class=special>()</span>    <span class=special>==</span> <span class=number>0u</span> <span class=special>);</span>
+    <span class=identifier>BOOST_ASSERT</span><span class=special>(</span> <span class=identifier>animal_farm</span><span class=special>.</span><span class=identifier>size</span><span class=special>()</span> <span class=special>==</span> <span class=number>12u</span> <span class=special>);</span>     
+<span class=special>}</span>
+</pre>
+</body>
+
+</html>
+<!-- 10. Changing the Clone Allocator
 ++++++++++++++++++++++++++++++++
 
 This example shows how we can change 
@@ -430,16 +799,16 @@
 
 .. raw:: html
         :file: tut2.html -->
-<p><strong>Navigate:</strong></p>
+<hr><p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
 <li><a class="reference" href="reference.html">reference</a></li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/examples.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/examples.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/examples.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,7 +22,9 @@
 
         my_container.push_back( 0 );            // throws bad_ptr 
         my_container.replace( an_iterator, 0 ); // throws bad_ptr
-        my_container.insert( an_iterator, 0 );  // throws bad_ptr                                                                 
+        my_container.insert( an_iterator, 0 );  // throws bad_ptr       
+	std::auto_ptr<T> p( 0 );
+	my_container.push_back( p );            // throws bad_ptr                                                          
 
 .. _`Example 2`:
 
@@ -67,7 +69,7 @@
          // a class that has no normal copy semantics
         class X : boost::noncopyable { public: X* clone() const; ... };
                                                                            
-        // this will be found by the library by argument dependent lookup                                                                   
+        // this will be found by the library by argument dependent lookup (ADL)                                                                  
         X* new_clone( const X& x ) 
         { return x.clone(); }
                                                                            
@@ -88,10 +90,12 @@
         class X { ... };                     // assume 'X' is Clonable 
         X x;                                 // and 'X' can be stack-allocated 
         ptr_list<X> list; 
-        list.push_back( x );                 // clone 'x' and then insert the resulting pointer 
-        list.push_back( new_clone( x );      // do it manually
+        list.push_back( new_clone( x ) );    // insert a clone
         list.push_back( new X );             // always give the pointer directly to the container to avoid leaks
         list.push_back( &x );                // don't do this!!! 
+	std::auto_ptr<X> p( new X );
+	list.push_back( p );                 // give up ownership
+	BOOST_ASSERT( p.get() == 0 );
 
 
 .. _`Example 6`:
@@ -110,8 +114,9 @@
         auto_type ptr2 = deq.release( deq.begin() + 2 ); // use an iterator to determine the element to release
         ptr            = deq.release_front();            // supported for 'ptr_list' and 'ptr_deque'
                                         
+	deq.push_back( ptr.release() );                  // give ownership back to the container
+	
 
-
 .. _`Example 7`:
 
 7. Transferring ownership of pointers between different pointer containers 
@@ -127,7 +132,8 @@
         //
         list.transfer( list.begin(), vec.begin(), vec );           // make the first element of 'vec' the first element of 'list'
         vec.transfer( vec.end(), list.begin(), list.end(), list ); // put all the lists element into the vector                                 
-                                
+                      
+We can also transfer objects from ``ptr_container<Derived>`` to ``ptr_container<Base`` without any problems.		  
 
 .. _`Example 8`:
 
@@ -138,7 +144,7 @@
 
 :incomplete_type_test.cpp_: Shows how to implement the Composite pattern.
 :simple_test.cpp_: Shows how the usage of pointer container compares with a 
-  container of pointer pointers
+  container of smart pointers
 :view_example.cpp_: Shows how to use a pointer container as a view into other container
 :tree_test.cpp_: Shows how to make a tree-structure
 :array_test.cpp_: Shows how to make an n-ary tree 
@@ -150,16 +156,17 @@
 .. _array_test.cpp : ../test/ptr_array.cpp
 
 
-..
-		9. A large example
-		++++++++++++++++++
 
-		This examples shows many of the most common
-		features at work.
+9. A large example
+++++++++++++++++++
 
-		.. raw:: html
-			:file: tut1.html
+This examples shows many of the most common
+features at work. The example provide lots of comments.
 
+.. raw:: html
+	:file: tutorial_example.html
+
+..
 		10. Changing the Clone Allocator
 		++++++++++++++++++++++++++++++++
 
@@ -170,10 +177,21 @@
 		.. raw:: html
 			:file: tut2.html
 
+.. raw:: html 
+
+        <hr>
+
 **Navigate:**
 
 - `home <ptr_container.html>`_
 - `reference <reference.html>`_
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+.. raw:: html 
 
+        <hr>
+
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/faq.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/faq.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/faq.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.5 $
+:Date: $Date: 2006/11/22 22:01:00 $
+:Revision: $Revision: 1.5.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -292,27 +292,27 @@
 <h2 class="subtitle" id="faq">FAQ</h2>
 <div class="contents local topic">
 <ul class="simple">
-<li><a class="reference" href="#since-a-pointer-container-is-not-copy-constructible-and-assignable-i-cannot-put-them-into-standard-containers-what-do-i-do" id="id4" name="id4">Since a pointer container is not Copy Constructible and Assignable, I cannot put them into standard containers; what do I do?</a></li>
-<li><a class="reference" href="#calling-assign-is-very-costly-and-i-do-not-really-need-to-store-cloned-objects-i-merely-need-to-overwrite-the-existing-ones-what-do-i-do" id="id5" name="id5">Calling <tt class="docutils literal"><span class="pre">assign()</span></tt> is very costly and I do not really need to store cloned objects; I merely need to overwrite the existing ones; what do I do?</a></li>
-<li><a class="reference" href="#which-mutating-algorithms-are-safe-to-use-with-pointers" id="id6" name="id6">Which mutating algorithms are safe to use with pointers?</a></li>
-<li><a class="reference" href="#why-does-ptr-map-t-insert-replace-take-two-arguments-the-key-and-the-pointer-instead-of-one-std-pair-and-why-is-the-key-passed-by-non-const-reference" id="id7" name="id7">Why does <tt class="docutils literal"><span class="pre">ptr_map&lt;T&gt;::insert()/replace()</span></tt> take two arguments (the key and the pointer) instead of one <tt class="docutils literal"><span class="pre">std::pair</span></tt>? And why is the key passed by non-const reference?</a></li>
-<li><a class="reference" href="#when-instantiating-a-pointer-container-with-a-type-t-is-t-then-allowed-to-be-incomplete-at-that-point" id="id8" name="id8">When instantiating a pointer container with a type <tt class="docutils literal"><span class="pre">T</span></tt>, is <tt class="docutils literal"><span class="pre">T</span></tt> then allowed to be incomplete at that point?</a></li>
-<li><a class="reference" href="#why-do-iterator-range-inserts-give-the-strong-exception-safety-guarantee" id="id9" name="id9">Why do iterator-range inserts give the strong exception-safety guarantee?</a></li>
-<li><a class="reference" href="#what-is-the-polymorphic-class-problem" id="id10" name="id10">What is the polymorphic class problem?</a></li>
-<li><a class="reference" href="#are-the-pointer-containers-faster-and-do-they-have-a-better-memory-footprint-than-a-container-of-pointer-pointers" id="id11" name="id11">Are the pointer containers faster and do they have a better memory  footprint than a container of pointer pointers?</a></li>
-<li><a class="reference" href="#when-the-stored-pointers-cannot-be-0-how-do-i-allow-this-empty-behavior-anyway" id="id12" name="id12">When the stored pointers cannot be <tt class="docutils literal"><span class="pre">0</span></tt>, how do I allow this &quot;empty&quot; behavior anyway?</a></li>
+<li><a class="reference" href="#since-a-pointer-container-is-not-copy-constructible-and-assignable-i-cannot-put-them-into-standard-containers-what-do-i-do" id="id5" name="id5">Since a pointer container is not Copy Constructible and Assignable, I cannot put them into standard containers; what do I do?</a></li>
+<li><a class="reference" href="#calling-assign-is-very-costly-and-i-do-not-really-need-to-store-cloned-objects-i-merely-need-to-overwrite-the-existing-ones-what-do-i-do" id="id6" name="id6">Calling <tt class="docutils literal"><span class="pre">assign()</span></tt> is very costly and I do not really need to store cloned objects; I merely need to overwrite the existing ones; what do I do?</a></li>
+<li><a class="reference" href="#which-mutating-algorithms-are-safe-to-use-with-pointers" id="id7" name="id7">Which mutating algorithms are safe to use with pointers?</a></li>
+<li><a class="reference" href="#why-does-ptr-map-t-insert-replace-take-two-arguments-the-key-and-the-pointer-instead-of-one-std-pair-and-why-is-the-key-passed-by-non-const-reference" id="id8" name="id8">Why does <tt class="docutils literal"><span class="pre">ptr_map&lt;T&gt;::insert()/replace()</span></tt> take two arguments (the key and the pointer) instead of one <tt class="docutils literal"><span class="pre">std::pair</span></tt>? And why is the key passed by non-const reference?</a></li>
+<li><a class="reference" href="#when-instantiating-a-pointer-container-with-a-type-t-is-t-then-allowed-to-be-incomplete-at-that-point" id="id9" name="id9">When instantiating a pointer container with a type <tt class="docutils literal"><span class="pre">T</span></tt>, is <tt class="docutils literal"><span class="pre">T</span></tt> then allowed to be incomplete at that point?</a></li>
+<li><a class="reference" href="#why-do-iterator-range-inserts-give-the-strong-exception-safety-guarantee" id="id10" name="id10">Why do iterator-range inserts give the strong exception-safety guarantee?</a></li>
+<li><a class="reference" href="#what-is-the-polymorphic-class-problem" id="id11" name="id11">What is the polymorphic class problem?</a></li>
+<li><a class="reference" href="#are-the-pointer-containers-faster-and-do-they-have-a-better-memory-footprint-than-a-container-of-smart-pointers" id="id12" name="id12">Are the pointer containers faster and do they have a better memory  footprint than a container of smart pointers?</a></li>
+<li><a class="reference" href="#when-the-stored-pointers-cannot-be-0-how-do-i-allow-this-empty-behavior-anyway" id="id13" name="id13">When the stored pointers cannot be <tt class="docutils literal"><span class="pre">0</span></tt>, how do I allow this &quot;empty&quot; behavior anyway?</a></li>
 </ul>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id4" id="since-a-pointer-container-is-not-copy-constructible-and-assignable-i-cannot-put-them-into-standard-containers-what-do-i-do" name="since-a-pointer-container-is-not-copy-constructible-and-assignable-i-cannot-put-them-into-standard-containers-what-do-i-do">Since a pointer container is not Copy Constructible and Assignable, I cannot put them into standard containers; what do I do?</a></h1>
+<h1><a class="toc-backref" href="#id5" id="since-a-pointer-container-is-not-copy-constructible-and-assignable-i-cannot-put-them-into-standard-containers-what-do-i-do" name="since-a-pointer-container-is-not-copy-constructible-and-assignable-i-cannot-put-them-into-standard-containers-what-do-i-do">Since a pointer container is not Copy Constructible and Assignable, I cannot put them into standard containers; what do I do?</a></h1>
 <p>Since they are <a class="reference" href="ptr_container.html#the-clonable-concept">Clonable</a>, you simply put them in a pointer container.</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id5" id="calling-assign-is-very-costly-and-i-do-not-really-need-to-store-cloned-objects-i-merely-need-to-overwrite-the-existing-ones-what-do-i-do" name="calling-assign-is-very-costly-and-i-do-not-really-need-to-store-cloned-objects-i-merely-need-to-overwrite-the-existing-ones-what-do-i-do">Calling <tt class="docutils literal docutils literal"><span class="pre">assign()</span></tt> is very costly and I do not really need to store cloned objects; I merely need to overwrite the existing ones; what do I do?</a></h1>
+<h1><a class="toc-backref" href="#id6" id="calling-assign-is-very-costly-and-i-do-not-really-need-to-store-cloned-objects-i-merely-need-to-overwrite-the-existing-ones-what-do-i-do" name="calling-assign-is-very-costly-and-i-do-not-really-need-to-store-cloned-objects-i-merely-need-to-overwrite-the-existing-ones-what-do-i-do">Calling <tt class="docutils literal docutils literal"><span class="pre">assign()</span></tt> is very costly and I do not really need to store cloned objects; I merely need to overwrite the existing ones; what do I do?</a></h1>
 <p>Call <tt class="docutils literal"><span class="pre">std::copy(</span> <span class="pre">first,</span> <span class="pre">last,</span> <span class="pre">c.begin()</span> <span class="pre">);</span></tt>.</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id6" id="which-mutating-algorithms-are-safe-to-use-with-pointers" name="which-mutating-algorithms-are-safe-to-use-with-pointers">Which mutating algorithms are safe to use with pointers?</a></h1>
+<h1><a class="toc-backref" href="#id7" id="which-mutating-algorithms-are-safe-to-use-with-pointers" name="which-mutating-algorithms-are-safe-to-use-with-pointers">Which mutating algorithms are safe to use with pointers?</a></h1>
 <p>Any mutating algorithm that moves elements around by swapping them.  An 
 important example is <tt class="docutils literal"><span class="pre">std::sort()</span></tt>; examples of unsafe algorithms are 
 <tt class="docutils literal"><span class="pre">std::unique()</span></tt> and <tt class="docutils literal"><span class="pre">std::remove()</span></tt>.</p>
@@ -320,7 +320,7 @@
 provided as member functions.   -->
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id7" id="why-does-ptr-map-t-insert-replace-take-two-arguments-the-key-and-the-pointer-instead-of-one-std-pair-and-why-is-the-key-passed-by-non-const-reference" name="why-does-ptr-map-t-insert-replace-take-two-arguments-the-key-and-the-pointer-instead-of-one-std-pair-and-why-is-the-key-passed-by-non-const-reference">Why does <tt class="docutils literal docutils literal"><span class="pre">ptr_map&lt;T&gt;::insert()/replace()</span></tt> take two arguments (the key and the pointer) instead of one <tt class="docutils literal docutils literal"><span class="pre">std::pair</span></tt>? And why is the key passed by non-const reference?</a></h1>
+<h1><a class="toc-backref" href="#id8" id="why-does-ptr-map-t-insert-replace-take-two-arguments-the-key-and-the-pointer-instead-of-one-std-pair-and-why-is-the-key-passed-by-non-const-reference" name="why-does-ptr-map-t-insert-replace-take-two-arguments-the-key-and-the-pointer-instead-of-one-std-pair-and-why-is-the-key-passed-by-non-const-reference">Why does <tt class="docutils literal docutils literal"><span class="pre">ptr_map&lt;T&gt;::insert()/replace()</span></tt> take two arguments (the key and the pointer) instead of one <tt class="docutils literal docutils literal"><span class="pre">std::pair</span></tt>? And why is the key passed by non-const reference?</a></h1>
 <p>This is the only way the function can be implemented in an exception-safe 
 manner; since the copy-constructor of the key might throw, and since 
 function arguments are not guaranteed to be evaluated from left to right, 
@@ -328,7 +328,7 @@
 Passing the key as a reference achieves just that.</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id8" id="when-instantiating-a-pointer-container-with-a-type-t-is-t-then-allowed-to-be-incomplete-at-that-point" name="when-instantiating-a-pointer-container-with-a-type-t-is-t-then-allowed-to-be-incomplete-at-that-point">When instantiating a pointer container with a type <tt class="docutils literal docutils literal"><span class="pre">T</span></tt>, is <tt class="docutils literal docutils literal"><span class="pre">T</span></tt> then allowed to be incomplete at that point?</a></h1>
+<h1><a class="toc-backref" href="#id9" id="when-instantiating-a-pointer-container-with-a-type-t-is-t-then-allowed-to-be-incomplete-at-that-point" name="when-instantiating-a-pointer-container-with-a-type-t-is-t-then-allowed-to-be-incomplete-at-that-point">When instantiating a pointer container with a type <tt class="docutils literal docutils literal"><span class="pre">T</span></tt>, is <tt class="docutils literal docutils literal"><span class="pre">T</span></tt> then allowed to be incomplete at that point?</a></h1>
 <p>No. This is a distinct property of <tt class="docutils literal"><span class="pre">shared_ptr</span></tt> which implies some overhead.</p>
 <p>However, one can leave <tt class="docutils literal"><span class="pre">T</span></tt> incomplete in the header file:</p>
 <pre class="literal-block">
@@ -348,22 +348,22 @@
 </pre>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id9" id="why-do-iterator-range-inserts-give-the-strong-exception-safety-guarantee" name="why-do-iterator-range-inserts-give-the-strong-exception-safety-guarantee">Why do iterator-range inserts give the strong exception-safety guarantee?</a></h1>
+<h1><a class="toc-backref" href="#id10" id="why-do-iterator-range-inserts-give-the-strong-exception-safety-guarantee" name="why-do-iterator-range-inserts-give-the-strong-exception-safety-guarantee">Why do iterator-range inserts give the strong exception-safety guarantee?</a></h1>
 <p>Is this not very inefficient?  It is because it is actually affordable to 
 do so; the overhead is one heap-allocation which is relatively small 
 compared to cloning N objects.</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id10" id="what-is-the-polymorphic-class-problem" name="what-is-the-polymorphic-class-problem">What is the <span class="target" id="polymorphic-class-problem">polymorphic class problem</span>?</a></h1>
+<h1><a class="toc-backref" href="#id11" id="what-is-the-polymorphic-class-problem" name="what-is-the-polymorphic-class-problem">What is the <span class="target" id="polymorphic-class-problem">polymorphic class problem</span>?</a></h1>
 <p>The problem refers to the relatively troublesome way C++ supports Object 
 Oriented programming in connection with containers of pointers to 
 polymorphic objects.  In a language without garbage collection, you end up 
-using either a container of pointer pointers or a container that takes 
+using either a container of smart pointers or a container that takes 
 ownership of the pointers.  The hard part is to find a safe, fast and 
 elegant solution.</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id11" id="are-the-pointer-containers-faster-and-do-they-have-a-better-memory-footprint-than-a-container-of-pointer-pointers" name="are-the-pointer-containers-faster-and-do-they-have-a-better-memory-footprint-than-a-container-of-pointer-pointers">Are the pointer containers faster and do they have a better memory  footprint than a container of pointer pointers?</a></h1>
+<h1><a class="toc-backref" href="#id12" id="are-the-pointer-containers-faster-and-do-they-have-a-better-memory-footprint-than-a-container-of-smart-pointers" name="are-the-pointer-containers-faster-and-do-they-have-a-better-memory-footprint-than-a-container-of-smart-pointers">Are the pointer containers faster and do they have a better memory  footprint than a container of smart pointers?</a></h1>
 <p>The short answer is yes: they are faster and they do use less memory; in 
 fact, they are the only way to obtain the zero-overhead hallmark of C++.  
 Smart pointers usually have one word or more of memory overhead per 
@@ -374,15 +374,15 @@
 these references: <a class="reference" href="ptr_container.html#references">[11]</a> and <a class="reference" href="ptr_container.html#references">[12]</a>.</p>
 </div>
 <div class="section">
-<h1><a class="toc-backref" href="#id12" id="when-the-stored-pointers-cannot-be-0-how-do-i-allow-this-empty-behavior-anyway" name="when-the-stored-pointers-cannot-be-0-how-do-i-allow-this-empty-behavior-anyway">When the stored pointers cannot be <tt class="docutils literal docutils literal"><span class="pre">0</span></tt>, how do I allow this &quot;empty&quot; behavior anyway?</a></h1>
+<h1><a class="toc-backref" href="#id13" id="when-the-stored-pointers-cannot-be-0-how-do-i-allow-this-empty-behavior-anyway" name="when-the-stored-pointers-cannot-be-0-how-do-i-allow-this-empty-behavior-anyway">When the stored pointers cannot be <tt class="docutils literal docutils literal"><span class="pre">0</span></tt>, how do I allow this &quot;empty&quot; behavior anyway?</a></h1>
 <p>Storing a null-pointer among a list of pointers does not fit well into the Object Oriented paradigm. 
 The most elegant design is to use the Null-Object Pattern where one basically makes a concrete
 class with dummy implementations of the virtual functions. See <a class="reference" href="ptr_container.html#references">[13]</a> for details.</p>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/faq.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/faq.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/faq.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
  
 .. |Boost| image:: boost.png
 
-===
+
 FAQ
 ===
 
@@ -75,11 +75,11 @@
 The problem refers to the relatively troublesome way C++ supports Object 
 Oriented programming in connection with containers of pointers to 
 polymorphic objects.  In a language without garbage collection, you end up 
-using either a container of pointer pointers or a container that takes 
+using either a container of smart pointers or a container that takes 
 ownership of the pointers.  The hard part is to find a safe, fast and 
 elegant solution.  
 
-Are the pointer containers faster and do they have a better memory  footprint than a container of pointer pointers?  
+Are the pointer containers faster and do they have a better memory  footprint than a container of smart pointers?  
 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 
 The short answer is yes: they are faster and they do use less memory; in 
@@ -98,6 +98,12 @@
 The most elegant design is to use the Null-Object Pattern where one basically makes a concrete
 class with dummy implementations of the virtual functions. See `[13] <ptr_container.html#references>`_ for details.
 
+.. raw:: html 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+        <hr>
 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/guidelines.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/guidelines.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/guidelines.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.4 $
+:Date: $Date: 2006/11/22 22:01:00 $
+:Revision: $Revision: 1.4.2.5 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -290,6 +290,20 @@
 <div class="document" id="boost-pointer-container-library">
 <h1 class="title"><img alt="Boost" src="boost.png" /> Pointer Container Library</h1>
 <h2 class="subtitle" id="usage-guidelines">Usage Guidelines</h2>
+<div class="contents local topic">
+<ul class="simple">
+<li><a class="reference" href="#choosing-the-right-container" id="id8" name="id8">Choosing the right container</a></li>
+<li><a class="reference" href="#recommended-practice-for-object-oriented-programming" id="id9" name="id9">Recommended practice for Object-Oriented Programming</a><ul>
+<li><a class="reference" href="#make-base-classes-abstract-and-without-data" id="id10" name="id10">1. Make base classes abstract and without data</a></li>
+<li><a class="reference" href="#make-virtual-functions-private-and-provide-a-non-virtual-public-forwarding-function" id="id11" name="id11">2. Make virtual functions private and provide a non-virtual public forwarding function</a></li>
+<li><a class="reference" href="#derive-your-base-class-from-boost-noncopyable" id="id12" name="id12">3. Derive your base class from <tt class="docutils literal"><span class="pre">boost::noncopyable</span></tt></a></li>
+<li><a class="reference" href="#avoid-null-pointers-in-containers-if-possible" id="id13" name="id13">4. Avoid null-pointers in containers (if possible)</a></li>
+</ul>
+</li>
+</ul>
+</div>
+<div class="section">
+<h1><a class="toc-backref" href="#id8" id="choosing-the-right-container" name="choosing-the-right-container">Choosing the right container</a></h1>
 <p>The recommended usage pattern of the container classes are the same as the 
 for normal standard containers.</p>
 <p><tt class="docutils literal"><span class="pre">ptr_vector</span></tt>, <tt class="docutils literal"><span class="pre">ptr_list</span></tt> and <tt class="docutils literal"><span class="pre">ptr_deque</span></tt> offer the programmer different 
@@ -306,19 +320,115 @@
 <tt class="docutils literal"><span class="pre">ptr_set</span></tt> and <tt class="docutils literal"><span class="pre">ptr_map</span></tt> support unique keys.  
 <tt class="docutils literal"><span class="pre">ptr_multiset</span></tt> and <tt class="docutils literal"><span class="pre">ptr_multimap</span></tt> 
 support equivalent keys.</p>
-<p><strong>Navigate:</strong></p>
+</div>
+<div class="section">
+<h1><a class="toc-backref" href="#id9" id="recommended-practice-for-object-oriented-programming" name="recommended-practice-for-object-oriented-programming">Recommended practice for Object-Oriented Programming</a></h1>
+<p>Idiomtic Object-Oriented Programming in C++ looks a bit different from 
+the way it is done in other languages. This is partly because C++ 
+has both value and reference semantics, and partly because C++ is more flexible
+than other languages. Below is a list of recommendations that you are
+encouraged to follow:</p>
+<div class="section">
+<h2><a class="toc-backref" href="#id10" id="make-base-classes-abstract-and-without-data" name="make-base-classes-abstract-and-without-data">1. Make base classes abstract and without data</a></h2>
+<p>The has the following advantages:</p>
+<blockquote>
+<ol class="loweralpha simple">
+<li>It reduces <em>coupling</em> because you do not have to maintain or update state</li>
+</ol>
+<!--  -->
+<ol class="loweralpha simple" start="2">
+<li>It helps you to avoid <em>slicing</em></li>
+</ol>
+<!--  -->
+<ol class="loweralpha simple" start="3">
+<li>It ensures you <em>override</em> the right function</li>
+</ol>
+</blockquote>
+<p>You might also want to read the following articles:</p>
 <ul class="simple">
+<li>Kevlin Henney's <a class="reference" href="http://www.two-sdg.demon.co.uk/curbralan/papers/SixOfTheBest.pdf">Six of the best</a></li>
+</ul>
+<ul class="simple">
+<li>Jack Reeves' <a class="reference" href="http://www.ddj.com/documents/s=10011/q=1/cuj0602reeves/0602reeves.html">Multiple Inheritance Considered Useful</a></li>
+</ul>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id11" id="make-virtual-functions-private-and-provide-a-non-virtual-public-forwarding-function" name="make-virtual-functions-private-and-provide-a-non-virtual-public-forwarding-function">2. Make virtual functions private and provide a non-virtual public forwarding function</a></h2>
+<p>In code:</p>
+<pre class="literal-block">
+class Polymorphic
+{
+private:
+    virtual int do_foo() = 0;
+    
+public:
+    int foo()
+    {
+        return do_foo();
+    }
+    ...
+};      
+</pre>
+<p>This has the following advantages:</p>
+<blockquote>
+<ol class="loweralpha simple">
+<li>It makes sure all calls to the virtual function always goes through one place in your code</li>
+</ol>
+<!--  -->
+<ol class="loweralpha simple" start="2">
+<li>It enables you to check preconditions and postconditions inside the forwarding function</li>
+</ol>
+</blockquote>
+<p>You might also want to read Herb Sutter's article <a class="reference" href="http://www.gotw.ca/publications/mill18.htm">Virtuality</a>.</p>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id12" id="derive-your-base-class-from-boost-noncopyable" name="derive-your-base-class-from-boost-noncopyable">3. Derive your base class from <tt class="docutils literal docutils literal"><span class="pre">boost::noncopyable</span></tt></a></h2>
+<p>Having an abstact base class prevents slicing when the base class is involved, but
+it does not prevent it for classes further down the hierarchy. This is where
+<a class="reference" href="http://www.boost.org/libs/utility/utility.htm#Class_noncopyable">boost::noncopyable</a> is handy to use:</p>
+<pre class="literal-block">
+class Polymorphic : boost::noncopyable
+{
+  ...
+};
+</pre>
+</div>
+<div class="section">
+<h2><a class="toc-backref" href="#id13" id="avoid-null-pointers-in-containers-if-possible" name="avoid-null-pointers-in-containers-if-possible">4. Avoid null-pointers in containers (if possible)</a></h2>
+<p>By default the pointer containers do not allow you to store null-pointer in them.
+As you might know, this behavior can be changed explicitly with the use
+of <a class="reference" href="reference.html#class-nullable">boost::nullable</a>.</p>
+<p>The primary reason to avoid null-pointers 
+is that you have to check for null-pointers every time the container is
+used. This extra checking is easy to forget, and it is somewhat contradictory to
+the spirit of OO where you replace special cases with dynamic dispatch.</p>
+<p>Often, however, you need to place some special object in the container because you
+do not have enough information to construct a full object. In that case
+you might be able to use the Null Object pattern which simply dictates that
+you implement virtual functions from the abstract base-class 
+as empty functions or with dummy return values. This means that
+your OO-code still does not need to worry about null-pointers.</p>
+<p>You might want to read</p>
+<ul class="simple">
+<li>Kevlin Henney's <a class="reference" href="http://www.two-sdg.demon.co.uk/curbralan/papers/europlop/NullObject.pdf">Null Object - Something for Nothing</a></li>
+</ul>
+<p>Finally you might end up in a situation where not even the Null Object can help
+you. That is when you truly need <tt class="docutils literal"><span class="pre">container&lt;</span> <span class="pre">nullable&lt;T&gt;</span> <span class="pre">&gt;</span></tt>.</p>
+<hr><p><strong>Navigate:</strong></p>
+<ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
 <li><a class="reference" href="reference.html">reference</a></li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>
 </div>
+</div>
+</div>
 </body>
 </html>

Modified: boost/trunk/libs/ptr_container/doc/guidelines.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/guidelines.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/guidelines.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,6 +8,11 @@
 Usage Guidelines
 ================
 
+.. contents:: :local: 
+
+Choosing the right container
+----------------------------
+
 The recommended usage pattern of the container classes are the same as the 
 for normal standard containers.  
 
@@ -27,10 +32,131 @@
 ``ptr_multiset`` and ``ptr_multimap`` 
 support equivalent keys.  
 
+Recommended practice for Object-Oriented Programming
+----------------------------------------------------
+
+Idiomtic Object-Oriented Programming in C++ looks a bit different from 
+the way it is done in other languages. This is partly because C++ 
+has both value and reference semantics, and partly because C++ is more flexible
+than other languages. Below is a list of recommendations that you are
+encouraged to follow:
+
+1. Make base classes abstract and without data
+++++++++++++++++++++++++++++++++++++++++++++++
+
+The has the following advantages:
+
+	a. It reduces *coupling* because you do not have to maintain or update state
+
+	..
+		
+        b. It helps you to avoid *slicing*
+	
+	..
+	
+        c. It ensures you *override* the right function
+
+You might also want to read the following articles:
+
+- Kevlin Henney's `Six of the best`__
+
+.. __: http://www.two-sdg.demon.co.uk/curbralan/papers/SixOfTheBest.pdf
+
+- Jack Reeves' `Multiple Inheritance Considered Useful`__
+
+.. __: http://www.ddj.com/documents/s=10011/q=1/cuj0602reeves/0602reeves.html
+
+  
+2. Make virtual functions private and provide a non-virtual public forwarding function
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+
+In code::
+
+	class Polymorphic
+	{
+	private:
+	    virtual int do_foo() = 0;
+	    
+        public:
+	    int foo()
+	    {
+	        return do_foo();
+	    }
+	    ...
+	};	
+	
+This has the following advantages:
+
+	a. It makes sure all calls to the virtual function always goes through one place in your code
+	
+	..
+	
+	b. It enables you to check preconditions and postconditions inside the forwarding function
+
+You might also want to read Herb Sutter's article `Virtuality`__.
+
+.. __: http://www.gotw.ca/publications/mill18.htm
+
+3. Derive your base class from ``boost::noncopyable``
++++++++++++++++++++++++++++++++++++++++++++++++++++++
+
+Having an abstact base class prevents slicing when the base class is involved, but
+it does not prevent it for classes further down the hierarchy. This is where
+`boost::noncopyable`__ is handy to use::
+
+	class Polymorphic : boost::noncopyable
+	{
+	  ...
+	};
+
+.. __ : http://www.boost.org/libs/utility/utility.htm#Class_noncopyable
+
+
+4. Avoid null-pointers in containers (if possible)
+++++++++++++++++++++++++++++++++++++++++++++++++++
+
+By default the pointer containers do not allow you to store null-pointer in them.
+As you might know, this behavior can be changed explicitly with the use
+of `boost::nullable`__. 
+
+The primary reason to avoid null-pointers 
+is that you have to check for null-pointers every time the container is
+used. This extra checking is easy to forget, and it is somewhat contradictory to
+the spirit of OO where you replace special cases with dynamic dispatch.
+
+.. __: reference.html#class-nullable
+
+Often, however, you need to place some special object in the container because you
+do not have enough information to construct a full object. In that case
+you might be able to use the Null Object pattern which simply dictates that
+you implement virtual functions from the abstract base-class 
+as empty functions or with dummy return values. This means that
+your OO-code still does not need to worry about null-pointers.
+
+You might want to read
+
+- Kevlin Henney's `Null Object - Something for Nothing`__
+
+.. __: http://www.two-sdg.demon.co.uk/curbralan/papers/europlop/NullObject.pdf
+
+Finally you might end up in a situation where not even the Null Object can help
+you. That is when you truly need ``container< nullable<T> >``. 
+
+.. raw:: html 
+
+        <hr>
+
 **Navigate:**
 
 - `home <ptr_container.html>`_
 - `reference <reference.html>`_
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+.. raw:: html 
 
+        <hr>
+
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/headers.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/headers.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/headers.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.6 $
+:Date: $Date: 2006/11/22 22:01:00 $
+:Revision: $Revision: 1.6.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -334,16 +334,16 @@
 </tr>
 <tr><td><tt class="docutils literal"><span class="pre">&lt;boost/ptr_container/exception.hpp&gt;</span></tt></td>
 <td><dl class="first last docutils">
-<dt>classes <tt class="docutils literal"><span class="pre">bad_ptr_container_operation</span></tt>, <tt class="docutils literal"><span class="pre">bad_index</span></tt></dt>
-<dd>and <tt class="docutils literal"><span class="pre">bad_pointer</span></tt></dd>
+<dt>classes <a class="reference" href="reference.html#exception-classes">bad_ptr_container_operation</a>, <a class="reference" href="reference.html#exception-classes">bad_index</a></dt>
+<dd>and <a class="reference" href="reference.html#exception-classes">bad_pointer</a></dd>
 </dl>
 </td>
 </tr>
 <tr><td><tt class="docutils literal"><span class="pre">&lt;boost/ptr_container/indirect_fun.hpp&gt;</span></tt></td>
-<td>class <tt class="docutils literal"><span class="pre">indirect_fun</span></tt></td>
+<td>class <a class="reference" href="indirect_fun.html">indirect_fun</a></td>
 </tr>
 <tr><td><tt class="docutils literal"><span class="pre">&lt;boost/ptr_container/nullable.hpp&gt;</span></tt></td>
-<td>class <tt class="docutils literal"><span class="pre">nullable</span></tt></td>
+<td>class <a class="reference" href="reference.html#class-nullable">nullable</a></td>
 </tr>
 </tbody>
 </table>
@@ -352,11 +352,11 @@
 <li><a class="reference" href="ptr_container.html">home</a></li>
 <li><a class="reference" href="reference.html">reference</a></li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/headers.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/headers.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/headers.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -34,21 +34,33 @@
 
 ``<boost/ptr_container/ptr_map_adapter.hpp>``            classes `ptr_map_adapter <ptr_map_adapter.html>`_ and `ptr_multimap_adapter <ptr_multimap_adapter.html>`_
 
-``<boost/ptr_container/exception.hpp>``                  classes ``bad_ptr_container_operation``, ``bad_index``
-                                                           and ``bad_pointer``
-``<boost/ptr_container/indirect_fun.hpp>``               class ``indirect_fun``
+``<boost/ptr_container/exception.hpp>``                  classes `bad_ptr_container_operation`_, `bad_index`_
+                                                           and `bad_pointer`_
+``<boost/ptr_container/indirect_fun.hpp>``               class `indirect_fun`_
 
-``<boost/ptr_container/nullable.hpp>``                   class ``nullable``
+``<boost/ptr_container/nullable.hpp>``                   class `nullable`_
 ======================================================= =============================================================
 
 .. _`heap_clone_allocator`: reference.html#the-clone-allocator-concept
 .. _`view_clone_allocator`: reference.html#the-clone-allocator-concept
+.. _`bad_ptr_container_operation`: reference.html#exception-classes
+.. _`bad_index`: reference.html#exception-classes
+.. _`bad_pointer`: reference.html#exception-classes
+.. _`nullable`: reference.html#class-nullable
+.. _`indirect_fun`: indirect_fun.html
 
+
 **Navigate:**
 
 - `home <ptr_container.html>`_
 - `reference <reference.html>`_
 
+.. raw:: html 
 
-:copyright:     Thorsten Ottosen 2004-2005.
+        <hr>
 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/indirect_fun.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/indirect_fun.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/indirect_fun.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.4 $
+:Date: $Date: 2006/11/22 22:01:00 $
+:Revision: $Revision: 1.4.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -401,11 +401,11 @@
          
 } // namespace 'boost'  
 </pre>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/indirect_fun.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/indirect_fun.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/indirect_fun.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -125,6 +125,12 @@
                  
         } // namespace 'boost'  
         
+.. raw:: html 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+        <hr>
 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/ptr_array.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_array.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_array.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.4 $
+:Date: $Date: 2006/11/22 22:01:00 $
+:Revision: $Revision: 1.4.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -293,13 +293,20 @@
 <h1><a id="class-ptr-array" name="class-ptr-array">Class <tt class="docutils literal"><span class="pre">ptr_array</span></tt></a></h1>
 <p>A <tt class="docutils literal"><span class="pre">ptr_array&lt;T,size&gt;</span></tt> is a pointer container that uses an underlying <tt class="docutils literal"><span class="pre">boost::array&lt;void*,size&gt;</span></tt>
 to store the pointers. The class is useful when there is no requirement
-of dynamic expansion and when absolute no overhead is tolerable.</p>
-<p><strong>See also:</strong></p>
+of dynamic expansion and when no overhead is tolerable.</p>
+<p><strong>Hierarchy:</strong></p>
 <ul class="simple">
-<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
-<li><a class="reference" href="ptr_sequence_adapter.html">ptr_sequence_adapter</a></li>
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><a class="reference" href="ptr_sequence_adapter.html">ptr_sequence_adapter</a><ul>
 <li><a class="reference" href="ptr_vector.html">ptr_vector</a></li>
+<li><a class="reference" href="ptr_list.html">ptr_list</a></li>
+<li><a class="reference" href="ptr_deque.html">ptr_deque</a></li>
+<li><tt class="docutils literal"><span class="pre">ptr_array</span></tt></li>
 </ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
@@ -545,11 +552,11 @@
 </blockquote>
 </li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/ptr_array.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_array.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_array.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,18 +9,19 @@
 
 A ``ptr_array<T,size>`` is a pointer container that uses an underlying ``boost::array<void*,size>``
 to store the pointers. The class is useful when there is no requirement
-of dynamic expansion and when absolute no overhead is tolerable.
+of dynamic expansion and when no overhead is tolerable.
 
-**See also:**
+**Hierarchy:**
 
-- reversible_ptr_container_
-- ptr_sequence_adapter_
-- ptr_vector_
+- `reversible_ptr_container <reversible_ptr_container.html>`_
 
-.. _reversible_ptr_container: reversible_ptr_container.html 
-.. _ptr_sequence_adapter: ptr_sequence_adapter.html
-.. _ptr_vector: ptr_vector.html
+  - `ptr_sequence_adapter <ptr_sequence_adapter.html>`_
 
+    - `ptr_vector <ptr_vector.html>`_
+    - `ptr_list <ptr_list.html>`_ 
+    - `ptr_deque <ptr_deque.html>`_
+    - ``ptr_array``
+
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -250,5 +251,12 @@
 
     - Exception safety: Nothrow guarantee
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+.. raw:: html 
 
+        <hr>
+
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/ptr_container.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_container.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_container.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,15 +6,15 @@
 <meta name="generator" content="Docutils 0.3.10: http://docutils.sourceforge.net/" />
 <title>Boost Pointer Container Library</title>
 <meta name="author" content="Thorsten Ottosen" />
-<meta name="date" content="3rd of May 2005" />
-<meta name="copyright" content="Thorsten Ottosen 2004-2005. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt)." />
+<meta name="date" content="29th of April 2006" />
+<meta name="copyright" content="Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt)." />
 <style type="text/css">
 
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.7 $
+:Date: $Date: 2006/11/22 22:01:00 $
+:Revision: $Revision: 1.7.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -299,13 +299,13 @@
 <tr><th class="docinfo-name">Author:</th>
 <td>Thorsten Ottosen</td></tr>
 <tr><th class="docinfo-name">Contact:</th>
-<td><a class="first last reference" href="mailto:nesotto&#64;cs.aau.dk">nesotto&#64;cs.aau.dk</a></td></tr>
-<tr class="field"><th class="docinfo-name">organizations:</th><td class="field-body"><a class="reference" href="http://www.cs.aau.dk">Department of Computer Science</a>, Aalborg University, and <a class="reference" href="http://www.dezide.com">Dezide Aps</a></td>
+<td><a class="first reference" href="mailto:nesotto&#64;cs.aau.dk">nesotto&#64;cs.aau.dk</a> or <a class="last reference" href="mailto:tottosen&#64;dezide.com">tottosen&#64;dezide.com</a></td></tr>
+<tr class="field"><th class="docinfo-name">Organizations:</th><td class="field-body"><a class="reference" href="http://www.cs.aau.dk">Department of Computer Science</a>, Aalborg University, and <a class="reference" href="http://www.dezide.com">Dezide Aps</a></td>
 </tr>
 <tr><th class="docinfo-name">Date:</th>
-<td>3rd of May 2005</td></tr>
+<td>29th of April 2006</td></tr>
 <tr><th class="docinfo-name">Copyright:</th>
-<td>Thorsten Ottosen 2004-2005. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td></tr>
+<td>Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td></tr>
 </tbody>
 </table>
 <div class="section">
@@ -318,48 +318,48 @@
 <ul class="simple">
 <li><a class="reference" href="#motivation">Motivation</a></li>
 <li><a class="reference" href="tutorial.html">Tutorial</a></li>
-<li><a class="reference" href="reference.html">Reference</a><ul>
-<li><a class="reference" href="conventions.html">Conventions</a></li>
-<li><a class="reference" href="reference.html#the-clonable-concept">The Clonable Concept</a></li>
-<li><a class="reference" href="reference.html#the-clone-allocator-concept">The Clone Allocator Concept</a></li>
-<li><a class="reference" href="reference.html#pointer-container-adapters">Pointer container adapters</a></li>
-<li><a class="reference" href="reference.html#sequence-containers">Sequence container classes</a><ul>
-<li><a class="reference" href="ptr_vector.html">ptr_vector</a></li>
-<li><a class="reference" href="ptr_deque.html">ptr_deque</a></li>
-<li><a class="reference" href="ptr_list.html">ptr_list</a></li>
-<li><a class="reference" href="ptr_array.html">ptr_array</a></li>
-</ul>
-</li>
-<li><a class="reference" href="reference.html#associative-containers">Associative container classes</a><ul>
-<li><a class="reference" href="ptr_set.html">ptr_set</a></li>
-<li><a class="reference" href="ptr_multiset.html">ptr_multiset</a></li>
-<li><a class="reference" href="ptr_map.html">ptr_map</a></li>
-<li><a class="reference" href="ptr_multimap.html">ptr_multimap</a></li>
-</ul>
-</li>
-<li><a class="reference" href="indirect_fun.html">Indirected functions</a></li>
-<li><a class="reference" href="reference.html#class-nullable">Class nullable</a></li>
-<li><a class="reference" href="reference.html#exception-classes">Exception classes</a></li>
-</ul>
-</li>
+<li><a class="reference" href="reference.html">Reference</a></li>
 <li><a class="reference" href="guidelines.html">Usage guidelines</a></li>
 <li><a class="reference" href="examples.html">Examples</a></li>
 <li><a class="reference" href="headers.html">Library headers</a></li>
 <li><a class="reference" href="faq.html">FAQ</a></li>
+<li><a class="reference" href="#upgrading-from-boost-v-1-33">Upgrading from Boost v. 1.33.*</a></li>
 <li><a class="reference" href="#acknowledgements">Acknowledgements</a></li>
 <li><a class="reference" href="#references">References</a></li>
 </ul>
+<!-- - `Conventions <conventions.html>`_
+- `The Clonable Concept <reference.html#the-clonable-concept>`_
+- `The Clone Allocator Concept <reference.html#the-clone-allocator-concept>`_
+- `Pointer container adapters <reference.html#pointer-container-adapters>`_
+- `Sequence container classes <reference.html#sequence-containers>`_
+
+  - `ptr_vector <ptr_vector.html>`_
+  - `ptr_deque <ptr_deque.html>`_
+  - `ptr_list <ptr_list.html>`_
+  - `ptr_array <ptr_array.html>`_
+- `Associative container classes  <reference.html#associative-containers>`_
+
+  - `ptr_set <ptr_set.html>`_
+  - `ptr_multiset <ptr_multiset.html>`_
+  - `ptr_map <ptr_map.html>`_
+  - `ptr_multimap <ptr_multimap.html>`_
+- `Indirected functions <indirect_fun.html>`_
+- `Class nullable <reference.html#class-nullable>`_
+- `Exception classes <reference.html#exception-classes>`_ -->
 </div>
 <div class="section">
 <h1><a id="motivation" name="motivation">Motivation</a></h1>
 <p>Whenever a programmer wants to have a container of pointers to
 heap-allocated objects, there is usually only one exception-safe way:
-to make a container of pointer pointers like <tt class="docutils literal"><span class="pre">boost::shared_ptr</span></tt>.
+to make a container of smart pointers like <a class="reference" href="../../smart_ptr/shared_ptr.htm">boost::shared_ptr</a>
 This approach is suboptimal if</p>
 <ol class="arabic simple">
 <li>the stored objects are not shared, but owned exclusively, or</li>
-<li>the overhead implied by pointer pointers is inappropriate</li>
 </ol>
+<!--  -->
+<ol class="arabic simple" start="2">
+<li>the overhead implied by smart pointers is inappropriate</li>
+</ol>
 <p>This library therefore provides standard-like containers that are for storing
 heap-allocated or <a class="reference" href="reference.html#the-clonable-concept">cloned</a> objects (or in case of a map, the mapped object must be
 a heap-allocated or cloned object). For each of the standard
@@ -370,21 +370,88 @@
 <p>The advantages of pointer containers are</p>
 <ol class="arabic simple">
 <li>Exception-safe pointer storage and manipulation.</li>
+</ol>
+<!--  -->
+<ol class="arabic simple" start="2">
 <li>Notational convenience compared to the use of containers of pointers.</li>
+</ol>
+<!--  -->
+<ol class="arabic simple" start="3">
 <li>Can be used for types that are neither Assignable nor Copy Constructible.</li>
-<li>No memory-overhead as containers of pointer pointers can have (see <a class="footnote-reference" href="#id21" id="id2" name="id2">[11]</a> and <a class="footnote-reference" href="#id23" id="id3" name="id3">[12]</a>).</li>
-<li>Usually faster than using containers of pointer pointers (see <a class="footnote-reference" href="#id21" id="id4" name="id4">[11]</a> and <a class="footnote-reference" href="#id23" id="id5" name="id5">[12]</a>).</li>
+</ol>
+<!--  -->
+<ol class="arabic simple" start="4">
+<li>No memory-overhead as containers of smart pointers can have (see <a class="footnote-reference" href="#id23" id="id2" name="id2">[11]</a> and <a class="footnote-reference" href="#id25" id="id3" name="id3">[12]</a>).</li>
+</ol>
+<!--  -->
+<ol class="arabic simple" start="5">
+<li>Usually faster than using containers of smart pointers (see <a class="footnote-reference" href="#id23" id="id4" name="id4">[11]</a> and <a class="footnote-reference" href="#id25" id="id5" name="id5">[12]</a>).</li>
+</ol>
+<!--  -->
+<ol class="arabic simple" start="6">
 <li>The interface is slightly changed towards the domain of pointers
 instead of relying on the normal value-based interface. For example,
 now it is possible for <tt class="docutils literal"><span class="pre">pop_back()</span></tt> to return the removed element.</li>
-<li>Propagates constness s.t. one cannot modify the objects via a <tt class="docutils literal"><span class="pre">const_iterator</span></tt></li>
 </ol>
+<!--  -->
+<ol class="arabic simple" start="7">
+<li>Propagates constness s.t. one cannot modify the objects via a <tt class="docutils literal"><span class="pre">const_iterator</span></tt>.</li>
+</ol>
+<!--  -->
+<ol class="arabic simple" start="8">
+<li>Built-in support for deep-copy semantics via the <a class="reference" href="reference.html#the-clonable-concept">The Clobable Concept</a></li>
+</ol>
 <p>The disadvantages are</p>
 <ol class="arabic simple">
 <li>Less flexible than containers of smart pointers like <a class="reference" href="../../smart_ptr/shared_ptr.htm">boost::shared_ptr</a></li>
 </ol>
+<p>When you do need shared semantics, this library is not what you need.</p>
 </div>
 <div class="section">
+<h1><a id="upgrading-from-boost-v-1-33" name="upgrading-from-boost-v-1-33">Upgrading from Boost v. <tt class="docutils literal"><span class="pre">1.33.*</span></tt></a></h1>
+<p>If you upgrade from one of these versions of Boost, then there has been one
+major interface change: map iterators now mimic iterators from <tt class="docutils literal"><span class="pre">std::map</span></tt>.
+Previously you may have written</p>
+<pre class="literal-block">
+for( boost::ptr_map&lt;std::string,T&gt;::iterator i = m.begin(), e = m.end();
+     i != e; ++i )
+{
+  std::cout &lt;&lt; &quot;key:&quot; &lt;&lt; i.key();
+  std::cout &lt;&lt; &quot;value:&quot; &lt;&lt; *i;
+  i-&gt;foo(); // call T::foo()
+}
+</pre>
+<p>and this now needs to be converted into</p>
+<pre class="literal-block">
+for( boost::ptr_map&lt;std::string,T&gt;::iterator i = m.begin(), e = m.end();
+     i != e; ++i )
+{
+  std::cout &lt;&lt; &quot;key:&quot; &lt;&lt; i-&gt;first;
+  std::cout &lt;&lt; &quot;value:&quot; &lt;&lt; *i-&gt;second;
+  i-&gt;second-&gt;foo(); // call T::foo()
+}
+</pre>
+<p>Apart from the above change, the library now also introduces</p>
+<ul>
+<li><p class="first"><tt class="docutils literal"><span class="pre">std::auto_ptr&lt;T&gt;</span></tt> overloads:</p>
+<pre class="literal-block">
+std::auto_ptr&lt;T&gt; p( new T );
+container.push_back( p );
+</pre>
+</li>
+<li><p class="first">Derived-to-Base conversion in <tt class="docutils literal"><span class="pre">transfer()</span></tt>:</p>
+<pre class="literal-block">
+boost::ptr_vector&lt;Base&gt;  vec;
+boost::ptr_list&lt;Derived&gt; list;
+...
+vec.transfer( vec.begin(), list ); // now ok
+</pre>
+</li>
+</ul>
+<p>Also note that <a class="reference" href="../../assign/index.html">Boost.Assign</a> introduces better support
+for pointer containers.</p>
+</div>
+<div class="section">
 <h1><a id="acknowledgements" name="acknowledgements">Acknowledgements</a></h1>
 <p>The following people have been very helpful:</p>
 <ul class="simple">
@@ -401,97 +468,98 @@
 <li>Russell Hind for help with Borland compatibility</li>
 <li>Jonathan Wakely for his great help with GCC compatibility and bug fixes</li>
 <li>Pavel Chikulaev for comments and bug-fixes</li>
+<li>Andreas Hommel for fixing the nasty Metrowerks bug</li>
 </ul>
 </div>
 <div class="section">
 <h1><a id="references" name="references">References</a></h1>
-<table class="docutils footnote" frame="void" id="id6" rules="none">
+<table class="docutils footnote" frame="void" id="id8" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a name="id6">[1]</a></td><td>Matt Austern: <a class="reference" href="http://www.cuj.com/documents/s=7990/cujcexp1910austern/">&quot;The Standard Librarian: Containers of Pointers&quot;</a> , C/C++ Users Journal Experts Forum.</td></tr>
+<tr><td class="label"><a name="id8">[1]</a></td><td>Matt Austern: <a class="reference" href="http://www.cuj.com/documents/s=7990/cujcexp1910austern/">&quot;The Standard Librarian: Containers of Pointers&quot;</a> , C/C++ Users Journal Experts Forum.</td></tr>
 </tbody>
 </table>
-<table class="docutils footnote" frame="void" id="id8" rules="none">
+<table class="docutils footnote" frame="void" id="id10" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a name="id8">[2]</a></td><td>Bjarne Stroustrup, &quot;The C++ Programming Language&quot;, <a class="reference" href="http://www.research.att.com/~bs/3rd_safe.pdf">Appendix E: &quot;Standard-Library Exception Safety&quot;</a></td></tr>
+<tr><td class="label"><a name="id10">[2]</a></td><td>Bjarne Stroustrup, &quot;The C++ Programming Language&quot;, <a class="reference" href="http://www.research.att.com/~bs/3rd_safe.pdf">Appendix E: &quot;Standard-Library Exception Safety&quot;</a></td></tr>
 </tbody>
 </table>
-<table class="docutils footnote" frame="void" id="id10" rules="none">
+<table class="docutils footnote" frame="void" id="id12" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a name="id10">[3]</a></td><td>Herb Sutter, &quot;Exceptional C++&quot;.</td></tr>
+<tr><td class="label"><a name="id12">[3]</a></td><td>Herb Sutter, &quot;Exceptional C++&quot;.</td></tr>
 </tbody>
 </table>
-<table class="docutils footnote" frame="void" id="id11" rules="none">
+<table class="docutils footnote" frame="void" id="id13" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a name="id11">[4]</a></td><td>Herb Sutter, &quot;More Exceptional C++&quot;.</td></tr>
+<tr><td class="label"><a name="id13">[4]</a></td><td>Herb Sutter, &quot;More Exceptional C++&quot;.</td></tr>
 </tbody>
 </table>
-<table class="docutils footnote" frame="void" id="id12" rules="none">
+<table class="docutils footnote" frame="void" id="id14" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a name="id12">[5]</a></td><td>Kevlin Henney: <a class="reference" href="http://www.cuj.com/documents/s=7986/cujcexp2002henney/henney.htm">&quot;From Mechanism to Method: The Safe Stacking of Cats&quot;</a> , C++ Experts Forum, February 2002.</td></tr>
+<tr><td class="label"><a name="id14">[5]</a></td><td>Kevlin Henney: <a class="reference" href="http://www.cuj.com/documents/s=7986/cujcexp2002henney/henney.htm">&quot;From Mechanism to Method: The Safe Stacking of Cats&quot;</a> , C++ Experts Forum, February 2002.</td></tr>
 </tbody>
 </table>
-<table class="docutils footnote" frame="void" id="id14" rules="none">
+<table class="docutils footnote" frame="void" id="id16" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a name="id14">[6]</a></td><td>Some of the few earlier attempts of pointer containers I have seen are the rather interesting <a class="reference" href="http://www.ntllib.org/asp.html">NTL</a> and the 
+<tr><td class="label"><a name="id16">[6]</a></td><td>Some of the few earlier attempts of pointer containers I have seen are the rather interesting <a class="reference" href="http://www.ntllib.org/asp.html">NTL</a> and the 
 <a class="reference" href="http://ootips.org/yonat/4dev/pointainer.h">pointainer</a>. 
 As of this writing both libraries are not exceptions-safe and can leak.</td></tr>
 </tbody>
 </table>
-<table class="docutils footnote" frame="void" id="id15" rules="none">
+<table class="docutils footnote" frame="void" id="id17" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a name="id15">[7]</a></td><td>INTERNATIONAL STANDARD, Programming languages --- C++, ISO/IEC 14882, 1998. See section 23 in particular.</td></tr>
+<tr><td class="label"><a name="id17">[7]</a></td><td>INTERNATIONAL STANDARD, Programming languages --- C++, ISO/IEC 14882, 1998. See section 23 in particular.</td></tr>
 </tbody>
 </table>
-<table class="docutils footnote" frame="void" id="id16" rules="none">
+<table class="docutils footnote" frame="void" id="id18" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a name="id16">[8]</a></td><td>C++ Standard Library Closed Issues List (Revision 27), 
+<tr><td class="label"><a name="id18">[8]</a></td><td>C++ Standard Library Closed Issues List (Revision 27), 
 Item 218, <a class="reference" href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-closed.html#218">Algorithms do not use binary predicate objects for default comparisons</a>.</td></tr>
 </tbody>
 </table>
-<table class="docutils footnote" frame="void" id="id18" rules="none">
+<table class="docutils footnote" frame="void" id="id20" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a name="id18">[9]</a></td><td>C++ Standard Library Active Issues List (Revision 27), 
+<tr><td class="label"><a name="id20">[9]</a></td><td>C++ Standard Library Active Issues List (Revision 27), 
 Item 226, <a class="reference" href="http://gcc.gnu.org/onlinedocs/libstdc++/ext/lwg-active.html#226">User supplied specializations or overloads of namespace std function templates</a>.</td></tr>
 </tbody>
 </table>
-<table class="docutils footnote" frame="void" id="id20" rules="none">
+<table class="docutils footnote" frame="void" id="id22" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a name="id20">[10]</a></td><td>Harald Nowak, &quot;A remove_if for vector&quot;, C/C++ Users Journal, July 2001.</td></tr>
+<tr><td class="label"><a name="id22">[10]</a></td><td>Harald Nowak, &quot;A remove_if for vector&quot;, C/C++ Users Journal, July 2001.</td></tr>
 </tbody>
 </table>
-<table class="docutils footnote" frame="void" id="id21" rules="none">
+<table class="docutils footnote" frame="void" id="id23" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a name="id21">[11]</a></td><td><em>(<a class="fn-backref" href="#id2">1</a>, <a class="fn-backref" href="#id4">2</a>)</em> Boost smart pointer <a class="reference" href="http://www.boost.org/libs/smart_ptr/smarttests.htm">timings</a></td></tr>
+<tr><td class="label"><a name="id23">[11]</a></td><td><em>(<a class="fn-backref" href="#id2">1</a>, <a class="fn-backref" href="#id4">2</a>)</em> Boost smart pointer <a class="reference" href="http://www.boost.org/libs/smart_ptr/smarttests.htm">timings</a></td></tr>
 </tbody>
 </table>
-<table class="docutils footnote" frame="void" id="id23" rules="none">
+<table class="docutils footnote" frame="void" id="id25" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a name="id23">[12]</a></td><td><em>(<a class="fn-backref" href="#id3">1</a>, <a class="fn-backref" href="#id5">2</a>)</em> <a class="reference" href="http://www.ntllib.org/asp.html">NTL</a>: Array vs std::vector and boost::shared_ptr</td></tr>
+<tr><td class="label"><a name="id25">[12]</a></td><td><em>(<a class="fn-backref" href="#id3">1</a>, <a class="fn-backref" href="#id5">2</a>)</em> <a class="reference" href="http://www.ntllib.org/asp.html">NTL</a>: Array vs std::vector and boost::shared_ptr</td></tr>
 </tbody>
 </table>
-<table class="docutils footnote" frame="void" id="id24" rules="none">
+<table class="docutils footnote" frame="void" id="id26" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a name="id24">[13]</a></td><td>Kevlin Henney, <a class="reference" href="http://www.two-sdg.demon.co.uk/curbralan/papers/europlop/NullObject.pdf">Null Object</a>, 2002.</td></tr>
+<tr><td class="label"><a name="id26">[13]</a></td><td>Kevlin Henney, <a class="reference" href="http://www.two-sdg.demon.co.uk/curbralan/papers/europlop/NullObject.pdf">Null Object</a>, 2002.</td></tr>
 </tbody>
 </table>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006.</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/ptr_container.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_container.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_container.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,10 +8,10 @@
 
 
 :Authors:       Thorsten Ottosen
-:Contact:       nesotto at cs.aau.dk
-:organizations: `Department of Computer Science`_, Aalborg University, and `Dezide Aps`_
-:date:          3rd of May 2005
-:copyright:     Thorsten Ottosen 2004-2005. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+:Contact:       nesotto at cs.aau.dk or tottosen at dezide.com
+:Organizations: `Department of Computer Science`_, Aalborg University, and `Dezide Aps`_
+:date:          29th of April 2006
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
 
 __ http://www.boost.org/LICENSE_1_0.txt
 
@@ -31,34 +31,37 @@
 * Motivation_
 * Tutorial_
 * Reference_
-
-  - `Conventions <conventions.html>`_
-  - `The Clonable Concept <reference.html#the-clonable-concept>`_
-  - `The Clone Allocator Concept <reference.html#the-clone-allocator-concept>`_
-  - `Pointer container adapters <reference.html#pointer-container-adapters>`_
-  - `Sequence container classes <reference.html#sequence-containers>`_
-
-    - `ptr_vector <ptr_vector.html>`_
-    - `ptr_deque <ptr_deque.html>`_
-    - `ptr_list <ptr_list.html>`_
-    - `ptr_array <ptr_array.html>`_
-  - `Associative container classes  <reference.html#associative-containers>`_
-
-    - `ptr_set <ptr_set.html>`_
-    - `ptr_multiset <ptr_multiset.html>`_
-    - `ptr_map <ptr_map.html>`_
-    - `ptr_multimap <ptr_multimap.html>`_
-  - `Indirected functions <indirect_fun.html>`_
-  - `Class nullable <reference.html#class-nullable>`_
-  - `Exception classes <reference.html#exception-classes>`_
 * `Usage guidelines`_
 * Examples_
 * `Library headers`_
 * FAQ_
+* `Upgrading from Boost v. 1.33.*`_
 * Acknowledgements_
 * References_
 
+..
+	  - `Conventions <conventions.html>`_
+	  - `The Clonable Concept <reference.html#the-clonable-concept>`_
+	  - `The Clone Allocator Concept <reference.html#the-clone-allocator-concept>`_
+	  - `Pointer container adapters <reference.html#pointer-container-adapters>`_
+	  - `Sequence container classes <reference.html#sequence-containers>`_
+	
+	    - `ptr_vector <ptr_vector.html>`_
+	    - `ptr_deque <ptr_deque.html>`_
+	    - `ptr_list <ptr_list.html>`_
+	    - `ptr_array <ptr_array.html>`_
+	  - `Associative container classes  <reference.html#associative-containers>`_
+	
+	    - `ptr_set <ptr_set.html>`_
+	    - `ptr_multiset <ptr_multiset.html>`_
+	    - `ptr_map <ptr_map.html>`_
+	    - `ptr_multimap <ptr_multimap.html>`_
+	  - `Indirected functions <indirect_fun.html>`_
+	  - `Class nullable <reference.html#class-nullable>`_
+	  - `Exception classes <reference.html#exception-classes>`_
+	  
 
+
 .. _Tutorial: tutorial.html
 
 
@@ -79,12 +82,15 @@
 
 Whenever a programmer wants to have a container of pointers to
 heap-allocated objects, there is usually only one exception-safe way:
-to make a container of pointer pointers like ``boost::shared_ptr``.
+to make a container of smart pointers like `boost::shared_ptr <../../smart_ptr/shared_ptr.htm>`_
 This approach is suboptimal if
 
 1. the stored objects are not shared, but owned exclusively, or
-2. the overhead implied by pointer pointers is inappropriate
 
+..
+
+2. the overhead implied by smart pointers is inappropriate
+
 This library therefore provides standard-like containers that are for storing
 heap-allocated or `cloned <reference.html#the-clonable-concept>`_ objects (or in case of a map, the mapped object must be
 a heap-allocated or cloned object). For each of the standard
@@ -97,19 +103,88 @@
 The advantages of pointer containers are
 
 1. Exception-safe pointer storage and manipulation.
+
+..
+
 2. Notational convenience compared to the use of containers of pointers.
+
+..
+
 3. Can be used for types that are neither Assignable nor Copy Constructible.
-4. No memory-overhead as containers of pointer pointers can have (see [11]_ and [12]_).
-5. Usually faster than using containers of pointer pointers (see [11]_ and [12]_).
+
+..
+
+4. No memory-overhead as containers of smart pointers can have (see [11]_ and [12]_).
+
+..
+
+5. Usually faster than using containers of smart pointers (see [11]_ and [12]_).
+
+..
+
 6. The interface is slightly changed towards the domain of pointers
    instead of relying on the normal value-based interface. For example,
    now it is possible for ``pop_back()`` to return the removed element.
-7. Propagates constness s.t. one cannot modify the objects via a ``const_iterator``
+   
+.. 
+ 
+7. Propagates constness s.t. one cannot modify the objects via a ``const_iterator``.
 
+..
+
+8. Built-in support for deep-copy semantics via the `The Clobable Concept`__
+
+.. __: reference.html#the-clonable-concept
+
 The disadvantages are
 
 1. Less flexible than containers of smart pointers like `boost::shared_ptr <../../smart_ptr/shared_ptr.htm>`_
 
+When you do need shared semantics, this library is not what you need.
+
+====================================
+ Upgrading from Boost v. ``1.33.*``
+====================================
+
+If you upgrade from one of these versions of Boost, then there has been one
+major interface change: map iterators now mimic iterators from ``std::map``.
+Previously you may have written ::
+
+  for( boost::ptr_map<std::string,T>::iterator i = m.begin(), e = m.end();
+       i != e; ++i )
+  {
+    std::cout << "key:" << i.key();
+    std::cout << "value:" << *i;
+    i->foo(); // call T::foo()
+  }
+  
+and this now needs to be converted into ::
+       
+  for( boost::ptr_map<std::string,T>::iterator i = m.begin(), e = m.end();
+       i != e; ++i )
+  {
+    std::cout << "key:" << i->first;
+    std::cout << "value:" << *i->second;
+    i->second->foo(); // call T::foo()
+  }
+
+Apart from the above change, the library now also introduces
+
+- ``std::auto_ptr<T>`` overloads::
+
+	std::auto_ptr<T> p( new T );
+	container.push_back( p );
+
+- Derived-to-Base conversion in ``transfer()``::
+
+	boost::ptr_vector<Base>  vec;
+	boost::ptr_list<Derived> list;
+	...
+	vec.transfer( vec.begin(), list ); // now ok
+
+Also note that `Boost.Assign <../../assign/index.html>`_ introduces better support
+for pointer containers. 
+
 ================
 Acknowledgements
 ================
@@ -129,6 +204,7 @@
 - Russell Hind for help with Borland compatibility
 - Jonathan Wakely for his great help with GCC compatibility and bug fixes
 - Pavel Chikulaev for comments and bug-fixes
+- Andreas Hommel for fixing the nasty Metrowerks bug
 
 ==========
 References
@@ -177,5 +253,9 @@
 .. _pointainer: http://ootips.org/yonat/4dev/pointainer.h 
 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+.. raw:: html 
 
+        <hr>
+
+:Copyright: Thorsten Ottosen 2004-2006. 
+

Modified: boost/trunk/libs/ptr_container/doc/ptr_deque.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_deque.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_deque.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.4 $
+:Date: $Date: 2006/11/22 22:01:00 $
+:Revision: $Revision: 1.4.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -293,11 +293,19 @@
 <h1><a id="class-ptr-deque" name="class-ptr-deque">Class <tt class="docutils literal"><span class="pre">ptr_deque</span></tt></a></h1>
 <p>A <tt class="docutils literal"><span class="pre">ptr_deque&lt;T&gt;</span></tt> is a pointer container that uses an underlying <tt class="docutils literal"><span class="pre">std:deque&lt;void*&gt;</span></tt>
 to store the pointers.</p>
-<p><strong>See also:</strong></p>
+<p><strong>Hierarchy:</strong></p>
 <ul class="simple">
-<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
-<li><a class="reference" href="ptr_sequence_adapter.html">ptr_sequence_adapter</a></li>
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><a class="reference" href="ptr_sequence_adapter.html">ptr_sequence_adapter</a><ul>
+<li><a class="reference" href="ptr_vector.html">ptr_vector</a></li>
+<li><a class="reference" href="ptr_list.html">ptr_list</a></li>
+<li><tt class="docutils literal"><span class="pre">ptr_deque</span></tt></li>
+<li><a class="reference" href="ptr_array.html">ptr_array</a></li>
 </ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
@@ -444,11 +452,11 @@
 </blockquote>
 </li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/ptr_deque.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_deque.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_deque.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,14 +10,17 @@
 A ``ptr_deque<T>`` is a pointer container that uses an underlying ``std:deque<void*>``
 to store the pointers. 
 
-**See also:**
+**Hierarchy:**
 
-- reversible_ptr_container_
-- ptr_sequence_adapter_
+- `reversible_ptr_container <reversible_ptr_container.html>`_
 
-.. _reversible_ptr_container: reversible_ptr_container.html 
-.. _ptr_map: ptr_map.html
+  - `ptr_sequence_adapter <ptr_sequence_adapter.html>`_
 
+    - `ptr_vector <ptr_vector.html>`_
+    - `ptr_list <ptr_list.html>`_ 
+    - ``ptr_deque``
+    - `ptr_array <ptr_array.html>`_
+
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -165,6 +168,12 @@
 
     - Exception safety: Nothrow guarantee
 
+.. raw:: html 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+        <hr>
 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/ptr_list.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_list.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_list.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.5 $
+:Date: $Date: 2006/11/22 22:01:00 $
+:Revision: $Revision: 1.5.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -293,11 +293,19 @@
 <h1><a id="class-ptr-list" name="class-ptr-list">Class <tt class="docutils literal"><span class="pre">ptr_list</span></tt></a></h1>
 <p>A <tt class="docutils literal"><span class="pre">ptr_list&lt;T&gt;</span></tt> is a pointer container that uses an underlying <tt class="docutils literal"><span class="pre">std:list&lt;void*&gt;</span></tt>
 to store the pointers.</p>
-<p><strong>See also:</strong></p>
+<p><strong>Hierarchy:</strong></p>
 <ul class="simple">
-<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
-<li><a class="reference" href="ptr_sequence_adapter.html">ptr_sequence_adapter</a></li>
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><a class="reference" href="ptr_sequence_adapter.html">ptr_sequence_adapter</a><ul>
+<li><a class="reference" href="ptr_vector.html">ptr_vector</a></li>
+<li><tt class="docutils literal"><span class="pre">ptr_list</span></tt></li>
+<li><a class="reference" href="ptr_deque.html">ptr_deque</a></li>
+<li><a class="reference" href="ptr_array.html">ptr_array</a></li>
 </ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
@@ -418,11 +426,11 @@
 </blockquote>
 </li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/ptr_list.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_list.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_list.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,15 +10,17 @@
 A ``ptr_list<T>`` is a pointer container that uses an underlying ``std:list<void*>``
 to store the pointers. 
 
-**See also:**
+**Hierarchy:**
 
-- reversible_ptr_container_
-- ptr_sequence_adapter_
+- `reversible_ptr_container <reversible_ptr_container.html>`_
 
-.. _reversible_ptr_container: reversible_ptr_container.html 
-.. _ptr_array: ptr_array.html
-.. _`ptr_sequence_adapter`: ptr_sequence_adapter.html
+  - `ptr_sequence_adapter <ptr_sequence_adapter.html>`_
 
+    - `ptr_vector <ptr_vector.html>`_
+    - ``ptr_list`` 
+    - `ptr_deque <ptr_deque.html>`_
+    - `ptr_array <ptr_array.html>`_
+    
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -142,6 +144,12 @@
 
     - Throws: nothing
 
+.. raw:: html 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+        <hr>
 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/ptr_map.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_map.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_map.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.4 $
+:Date: $Date: 2006/11/22 22:01:02 $
+:Revision: $Revision: 1.4.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -292,14 +292,25 @@
 <h2 class="subtitle" id="class-ptr-map">Class <tt class="docutils literal"><span class="pre">ptr_map</span></tt></h2>
 <p>A <tt class="docutils literal"><span class="pre">ptr_map&lt;Key,T&gt;</span></tt> is a pointer container that uses an underlying <tt class="docutils literal"><span class="pre">std::map&lt;Key,void*&gt;</span></tt>
 to store the pointers.</p>
-<p><strong>See also:</strong></p>
+<p><strong>Hierarchy:</strong></p>
 <ul class="simple">
-<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
-<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a></li>
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a><ul>
+<li><a class="reference" href="ptr_set_adapter.html">ptr_set_adapter</a></li>
+<li><a class="reference" href="ptr_multiset_adapter.html">ptr_multiset_adapter</a></li>
 <li><a class="reference" href="ptr_map_adapter.html">ptr_map_adapter</a></li>
-<li><a class="reference" href="reference.html#map-iterator-operations">new map iterators</a></li>
+<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multi_map_adapter</a><ul>
+<li><a class="reference" href="ptr_set.html">ptr_set</a></li>
+<li><a class="reference" href="ptr_multiset.html">ptr_multi_set</a></li>
+<li><tt class="docutils literal"><span class="pre">ptr_map</span></tt></li>
+<li><a class="reference" href="ptr_multimap.html">ptr_multimap</a></li>
 </ul>
-<!-- class `indirect_fun <indirect_fun.html>`_ -->
+</li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
@@ -331,11 +342,11 @@
 
 } // namespace 'boost'  
 </pre>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/ptr_map.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_map.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_map.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,19 +10,22 @@
 A ``ptr_map<Key,T>`` is a pointer container that uses an underlying ``std::map<Key,void*>``
 to store the pointers.
 
-**See also:**
+**Hierarchy:**
 
-- reversible_ptr_container_
-- associative_ptr_container_
-- ptr_map_adapter_
-- `new map iterators <reference.html#map-iterator-operations>`_
+- `reversible_ptr_container <reversible_ptr_container.html>`_
 
-.. _reversible_ptr_container: reversible_ptr_container.html 
-.. _associative_ptr_container: associative_ptr_container.html
-.. _ptr_map_adapter: ptr_map_adapter.html
-.. class `indirect_fun <indirect_fun.html>`_
- 
+  - `associative_ptr_container <associative_ptr_container.html>`_
+  
+    - `ptr_set_adapter <ptr_set_adapter.html>`_
+    - `ptr_multiset_adapter <ptr_multiset_adapter.html>`_
+    - `ptr_map_adapter <ptr_map_adapter.html>`_
+    - `ptr_multi_map_adapter <ptr_multimap_adapter.html>`_
 
+      - `ptr_set <ptr_set.html>`_
+      - `ptr_multi_set <ptr_multiset.html>`_ 
+      - ``ptr_map``
+      - `ptr_multimap <ptr_multimap.html>`_
+
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -58,6 +61,12 @@
         
         } // namespace 'boost'  
 
+.. raw:: html 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+        <hr>
 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/ptr_map_adapter.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_map_adapter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_map_adapter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.4 $
+:Date: $Date: 2006/11/22 22:01:02 $
+:Revision: $Revision: 1.4.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -294,13 +294,25 @@
 <p>This class is used to build custom pointer containers with
 an underlying map-like container. The interface of the class is an extension
 of the interface from <tt class="docutils literal"><span class="pre">associative_ptr_container</span></tt>.</p>
-<p><strong>See also:</strong></p>
+<p><strong>Hierarchy:</strong></p>
 <ul class="simple">
-<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
-<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a></li>
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a><ul>
+<li><a class="reference" href="ptr_set_adapter.html">ptr_set_adapter</a></li>
+<li><a class="reference" href="ptr_multiset_adapter.html">ptr_multiset_adapter</a></li>
+<li><tt class="docutils literal"><span class="pre">ptr_map_adapter</span></tt></li>
+<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multi_map_adapter</a><ul>
+<li><a class="reference" href="ptr_set.html">ptr_set</a></li>
+<li><a class="reference" href="ptr_multiset.html">ptr_multi_set</a></li>
 <li><a class="reference" href="ptr_map.html">ptr_map</a></li>
-<li><a class="reference" href="reference.html#map-iterator-operations">new map iterators</a></li>
+<li><a class="reference" href="ptr_multimap.html">ptr_multimap</a></li>
 </ul>
+</li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
@@ -318,6 +330,16 @@
     &gt;
     class ptr_map_adapter 
     {
+    public: // <a class="reference" href="#typedefs">typedefs</a>
+        typedef VoidPtrMap::key_type key_type;
+        typedef T*                   mapped_type;
+        typedef T&amp;                   mapped_reference;
+        typedef const T&amp;             const_mapped_reference;
+        typedef ...                  value_type;
+        typedef ...                  reference;
+        typedef ...                  const_reference;
+        typedef ...                  pointer;
+        typedef ...                  const_pointer;  
         
     public: // <a class="reference" href="#modifiers">modifiers</a>         
         std::pair&lt;iterator,bool&gt;  insert( key_type&amp; k, T* x );                         
@@ -344,6 +366,33 @@
 <div class="section">
 <h1><a id="semantics" name="semantics">Semantics</a></h1>
 <div class="section">
+<h2><a id="semantics-typedefs" name="semantics-typedefs"><span id="typedefs"></span>Semantics: typedefs</a></h2>
+<p>The following types are implementation defined:</p>
+<pre class="literal-block">
+typedef ... value_type;
+typedef ... reference;
+typedef ... const_reference;
+typedef ... pointer;
+typedef ... const_pointer;  
+</pre>
+<p>However, the structure of the type mimics <tt class="docutils literal"><span class="pre">std::pair</span></tt> s.t. one
+can use <tt class="docutils literal"><span class="pre">first</span></tt> and <tt class="docutils literal"><span class="pre">second</span></tt> members. The reference-types
+are not real references and the pointer-types are not real pointers.
+However, one may still write</p>
+<pre class="literal-block">
+map_type::value_type       a_value      = *m.begin();
+a_value.second-&gt;foo();
+map_type::reference        a_reference  = *m.begin();
+a_reference.second-&gt;foo();
+map_type::const_reference  a_creference = *const_begin(m);
+map_type::pointer          a_pointer    = &amp;*m.begin();
+a_pointer-&gt;second-&gt;foo();
+map_type::const_pointer    a_cpointer   = &amp;*const_begin(m);
+</pre>
+<p>The difference compared to <tt class="docutils literal"><span class="pre">std::map&lt;Key,T*&gt;</span></tt> is that constness
+is propagated to the pointer (that is, to <tt class="docutils literal"><span class="pre">second</span></tt>) in <tt class="docutils literal"><span class="pre">const_itertor</span></tt>.</p>
+</div>
+<div class="section">
 <h2><a id="semantics-modifiers" name="semantics-modifiers"><span id="modifiers"></span>Semantics: modifiers</a></h2>
 <ul>
 <li><p class="first"><tt class="docutils literal"><span class="pre">std::pair&lt;iterator,bool&gt;</span> <span class="pre">insert(</span> <span class="pre">key_type&amp;</span> <span class="pre">k,</span> <span class="pre">value_type</span> <span class="pre">x</span> <span class="pre">);</span></tt></p>
@@ -433,11 +482,11 @@
 </blockquote>
 </li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/ptr_map_adapter.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_map_adapter.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_map_adapter.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,17 +11,22 @@
 an underlying map-like container. The interface of the class is an extension
 of the interface from ``associative_ptr_container``.
 
-**See also:**
+**Hierarchy:**
 
-- reversible_ptr_container_
-- associative_ptr_container_
-- ptr_map_
-- `new map iterators <reference.html#map-iterator-operations>`_
+- `reversible_ptr_container <reversible_ptr_container.html>`_
 
-.. _reversible_ptr_container: reversible_ptr_container.html 
-.. _associative_ptr_container: associative_ptr_container.html
-.. _ptr_map: ptr_map.html
+  - `associative_ptr_container <associative_ptr_container.html>`_
+  
+    - `ptr_set_adapter <ptr_set_adapter.html>`_
+    - `ptr_multiset_adapter <ptr_multiset_adapter.html>`_
+    - ``ptr_map_adapter``
+    - `ptr_multi_map_adapter <ptr_multimap_adapter.html>`_
 
+      - `ptr_set <ptr_set.html>`_
+      - `ptr_multi_set <ptr_multiset.html>`_ 
+      - `ptr_map <ptr_map.html>`_
+      - `ptr_multimap <ptr_multimap.html>`_
+      
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -42,6 +47,16 @@
             >
             class ptr_map_adapter 
             {
+	    public: // `typedefs`_
+		typedef VoidPtrMap::key_type key_type;
+		typedef T*                   mapped_type;
+		typedef T&                   mapped_reference;
+		typedef const T&             const_mapped_reference;
+		typedef ...                  value_type;
+		typedef ...                  reference;
+		typedef ...                  const_reference;
+		typedef ...                  pointer;
+		typedef ...                  const_pointer;  
                 
             public: // `modifiers`_         
                 std::pair<iterator,bool>  insert( key_type& k, T* x );                         
@@ -68,6 +83,36 @@
 Semantics
 ---------
 
+.. _`typedefs`:
+
+Semantics: typedefs
+^^^^^^^^^^^^^^^^^^^
+
+The following types are implementation defined::
+
+	typedef ... value_type;
+	typedef ... reference;
+	typedef ... const_reference;
+	typedef ... pointer;
+	typedef ... const_pointer;  
+        
+However, the structure of the type mimics ``std::pair`` s.t. one
+can use ``first`` and ``second`` members. The reference-types
+are not real references and the pointer-types are not real pointers.
+However, one may still write ::
+
+    map_type::value_type       a_value      = *m.begin();
+    a_value.second->foo();
+    map_type::reference        a_reference  = *m.begin();
+    a_reference.second->foo();
+    map_type::const_reference  a_creference = *const_begin(m);
+    map_type::pointer          a_pointer    = &*m.begin();
+    a_pointer->second->foo();
+    map_type::const_pointer    a_cpointer   = &*const_begin(m);
+
+The difference compared to ``std::map<Key,T*>`` is that constness
+is propagated to the pointer (that is, to ``second``) in ``const_itertor``. 	
+
 .. _`modifiers`:
 
 Semantics: modifiers
@@ -147,6 +192,12 @@
 
    - Effects: ``return transfer( from.begin(), from.end(), from );``.
 
+.. raw:: html 
+
+        <hr>
  
-:copyright:     Thorsten Ottosen 2004-2005. 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
 
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/ptr_multimap.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_multimap.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_multimap.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.4 $
+:Date: $Date: 2006/11/22 22:01:02 $
+:Revision: $Revision: 1.4.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -292,13 +292,25 @@
 <h2 class="subtitle" id="class-ptr-multimap">Class <tt class="docutils literal"><span class="pre">ptr_multimap</span></tt></h2>
 <p>A <tt class="docutils literal"><span class="pre">ptr_multimap&lt;Key,T&gt;</span></tt> is a pointer container that uses an underlying <tt class="docutils literal"><span class="pre">std::multimap&lt;Key,void*&gt;</span></tt>
 to store the pointers.</p>
-<p><strong>See also:</strong></p>
+<p><strong>Hierarchy:</strong></p>
 <ul class="simple">
-<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
-<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a></li>
-<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multimap_adapter</a></li>
-<li><a class="reference" href="reference.html#map-iterator-operations">new map iterators</a></li>
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a><ul>
+<li><a class="reference" href="ptr_set_adapter.html">ptr_set_adapter</a></li>
+<li><a class="reference" href="ptr_multiset_adapter.html">ptr_multiset_adapter</a></li>
+<li><a class="reference" href="ptr_map_adapter.html">ptr_map_adapter</a></li>
+<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multi_map_adapter</a><ul>
+<li><a class="reference" href="ptr_set.html">ptr_set</a></li>
+<li><a class="reference" href="ptr_multiset.html">ptr_multi_set</a></li>
+<li><a class="reference" href="ptr_map.html">ptr_map</a></li>
+<li><tt class="docutils literal"><span class="pre">ptr_multimap</span></tt></li>
 </ul>
+</li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
@@ -333,7 +345,7 @@
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/ptr_multimap.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_multimap.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_multimap.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,13 +10,23 @@
 A ``ptr_multimap<Key,T>`` is a pointer container that uses an underlying ``std::multimap<Key,void*>``
 to store the pointers.
 
-**See also:**
 
-- reversible_ptr_container_
-- associative_ptr_container_
-- ptr_multimap_adapter_
-- `new map iterators <reference.html#map-iterator-operations>`_
+**Hierarchy:**
 
+- `reversible_ptr_container <reversible_ptr_container.html>`_
+
+  - `associative_ptr_container <associative_ptr_container.html>`_
+  
+    - `ptr_set_adapter <ptr_set_adapter.html>`_
+    - `ptr_multiset_adapter <ptr_multiset_adapter.html>`_
+    - `ptr_map_adapter <ptr_map_adapter.html>`_
+    - `ptr_multi_map_adapter <ptr_multimap_adapter.html>`_
+
+      - `ptr_set <ptr_set.html>`_
+      - `ptr_multi_set <ptr_multiset.html>`_ 
+      - `ptr_map <ptr_map.html>`_
+      - ``ptr_multimap``
+
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -57,5 +67,8 @@
         } // namespace 'boost'  
 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
 
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/ptr_multimap_adapter.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_multimap_adapter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_multimap_adapter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.5 $
+:Date: $Date: 2006/11/22 22:01:03 $
+:Revision: $Revision: 1.5.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -294,13 +294,25 @@
 <p>This class is used to build custom pointer containers with
 an underlying multimap-like container. The interface of the class is an extension
 of the interface from <tt class="docutils literal"><span class="pre">associative_ptr_container</span></tt>.</p>
-<p><strong>See also:</strong></p>
+<p><strong>Hierarchy:</strong></p>
 <ul class="simple">
-<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
-<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a></li>
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a><ul>
+<li><a class="reference" href="ptr_set_adapter.html">ptr_set_adapter</a></li>
+<li><a class="reference" href="ptr_multiset_adapter.html">ptr_multiset_adapter</a></li>
+<li><a class="reference" href="ptr_map_adapter.html">ptr_map_adapter</a></li>
+<li><tt class="docutils literal"><span class="pre">ptr_multi_map_adapter</span></tt><ul>
+<li><a class="reference" href="ptr_set.html">ptr_set</a></li>
+<li><a class="reference" href="ptr_multiset.html">ptr_multi_set</a></li>
+<li><a class="reference" href="ptr_map.html">ptr_map</a></li>
 <li><a class="reference" href="ptr_multimap.html">ptr_multimap</a></li>
-<li><a class="reference" href="ptr_container.html#map-iterator-operations">new map iterators</a></li>
 </ul>
+</li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
@@ -318,6 +330,16 @@
     &gt;
     class ptr_multimap_adapter 
     {
+    public: // <a class="reference" href="#typedefs">typedefs</a>
+        typedef VoidPtrMap::key_type key_type;
+        typedef T*                   mapped_type;
+        typedef T&amp;                   mapped_reference;
+        typedef const T&amp;             const_mapped_reference;
+        typedef ...                  value_type;
+        typedef ...                  reference;
+        typedef ...                  const_reference;
+        typedef ...                  pointer;
+        typedef ...                  const_pointer;  
         
     public: // <a class="reference" href="#modifiers">modifiers</a>         
         iterator  insert( key_type&amp; k, T* x ); 
@@ -338,7 +360,35 @@
 </div>
 <div class="section">
 <h1><a id="semantics" name="semantics">Semantics</a></h1>
+<p>. <span class="target" id="typedefs">typedefs</span>:</p>
 <div class="section">
+<h2><a id="semantics-typedefs" name="semantics-typedefs">Semantics: typedefs</a></h2>
+<p>The following types are implementation defined:</p>
+<pre class="literal-block">
+typedef ... value_type;
+typedef ... reference;
+typedef ... const_reference;
+typedef ... pointer;
+typedef ... const_pointer;  
+</pre>
+<p>However, the structure of the type mimics <tt class="docutils literal"><span class="pre">std::pair</span></tt> s.t. one
+can use <tt class="docutils literal"><span class="pre">first</span></tt> and <tt class="docutils literal"><span class="pre">second</span></tt> members. The reference-types
+are not real references and the pointer-types are not real pointers.
+However, one may still write</p>
+<pre class="literal-block">
+map_type::value_type       a_value      = *m.begin();
+a_value.second-&gt;foo();
+map_type::reference        a_reference  = *m.begin();
+a_reference.second-&gt;foo();
+map_type::const_reference  a_creference = *const_begin(m);
+map_type::pointer          a_pointer    = &amp;*m.begin();
+a_pointer-&gt;second-&gt;foo();
+map_type::const_pointer    a_cpointer   = &amp;*const_begin(m);
+</pre>
+<p>The difference compared to <tt class="docutils literal"><span class="pre">std::map&lt;Key,T*&gt;</span></tt> is that constness
+is propagated to the pointer (that is, to <tt class="docutils literal"><span class="pre">second</span></tt>) in <tt class="docutils literal"><span class="pre">const_itertor</span></tt>.</p>
+</div>
+<div class="section">
 <h2><a id="semantics-modifiers" name="semantics-modifiers"><span id="modifiers"></span>Semantics: modifiers</a></h2>
 <ul>
 <li><p class="first"><tt class="docutils literal"><span class="pre">iterator</span> <span class="pre">insert(</span> <span class="pre">key_type&amp;</span> <span class="pre">k,</span> <span class="pre">T*</span> <span class="pre">x</span> <span class="pre">);</span></tt></p>
@@ -416,11 +466,11 @@
 </blockquote>
 </li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/ptr_multimap_adapter.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_multimap_adapter.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_multimap_adapter.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,18 +11,22 @@
 an underlying multimap-like container. The interface of the class is an extension
 of the interface from ``associative_ptr_container``.
 
-**See also:**
+**Hierarchy:**
 
-- reversible_ptr_container_
-- associative_ptr_container_
-- ptr_multimap_
-- `new map iterators`__
+- `reversible_ptr_container <reversible_ptr_container.html>`_
 
-.. _reversible_ptr_container: reversible_ptr_container.html 
-.. _associative_ptr_container: associative_ptr_container.html
-.. _ptr_multimap: ptr_multimap.html
-__ ptr_container.html#map-iterator-operations
+  - `associative_ptr_container <associative_ptr_container.html>`_
+  
+    - `ptr_set_adapter <ptr_set_adapter.html>`_
+    - `ptr_multiset_adapter <ptr_multiset_adapter.html>`_
+    - `ptr_map_adapter <ptr_map_adapter.html>`_
+    - ``ptr_multi_map_adapter``
 
+      - `ptr_set <ptr_set.html>`_
+      - `ptr_multi_set <ptr_multiset.html>`_ 
+      - `ptr_map <ptr_map.html>`_
+      - `ptr_multimap <ptr_multimap.html>`_
+
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -43,6 +47,16 @@
             >
             class ptr_multimap_adapter 
             {
+    	    public: // `typedefs`_
+		typedef VoidPtrMap::key_type key_type;
+		typedef T*                   mapped_type;
+		typedef T&                   mapped_reference;
+		typedef const T&             const_mapped_reference;
+		typedef ...                  value_type;
+		typedef ...                  reference;
+		typedef ...                  const_reference;
+		typedef ...                  pointer;
+		typedef ...                  const_pointer;  
                 
             public: // `modifiers`_         
                 iterator  insert( key_type& k, T* x ); 
@@ -64,6 +78,36 @@
 Semantics
 ---------
 
+. _`typedefs`:
+
+Semantics: typedefs
+^^^^^^^^^^^^^^^^^^^
+
+The following types are implementation defined::
+
+	typedef ... value_type;
+	typedef ... reference;
+	typedef ... const_reference;
+	typedef ... pointer;
+	typedef ... const_pointer;  
+        
+However, the structure of the type mimics ``std::pair`` s.t. one
+can use ``first`` and ``second`` members. The reference-types
+are not real references and the pointer-types are not real pointers.
+However, one may still write ::
+
+    map_type::value_type       a_value      = *m.begin();
+    a_value.second->foo();
+    map_type::reference        a_reference  = *m.begin();
+    a_reference.second->foo();
+    map_type::const_reference  a_creference = *const_begin(m);
+    map_type::pointer          a_pointer    = &*m.begin();
+    a_pointer->second->foo();
+    map_type::const_pointer    a_cpointer   = &*const_begin(m);
+
+The difference compared to ``std::map<Key,T*>`` is that constness
+is propagated to the pointer (that is, to ``second``) in ``const_itertor``. 	
+
 .. _`modifiers`:
 
 Semantics: modifiers
@@ -143,6 +187,12 @@
 
    - Exception safety: Basic guarantee
  
+.. raw:: html 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+        <hr>
 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/ptr_multiset.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_multiset.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_multiset.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.4 $
+:Date: $Date: 2006/11/22 22:01:03 $
+:Revision: $Revision: 1.4.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -292,11 +292,27 @@
 <h2 class="subtitle" id="class-ptr-multiset">Class <tt class="docutils literal"><span class="pre">ptr_multiset</span></tt></h2>
 <p>A <tt class="docutils literal"><span class="pre">ptr_multiset&lt;T&gt;</span></tt> is a pointer container that uses an underlying <tt class="docutils literal"><span class="pre">std::multiset&lt;void*&gt;</span></tt>
 to store the pointers.</p>
+<p><strong>Hierarchy:</strong></p>
+<ul class="simple">
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a><ul>
+<li><a class="reference" href="ptr_set_adapter.html">ptr_set_adapter</a></li>
+<li><a class="reference" href="ptr_multiset_adapter.html">ptr_multiset_adapter</a></li>
+<li><a class="reference" href="ptr_map_adapter.html">ptr_map_adapter</a></li>
+<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multi_map_adapter</a><ul>
+<li><a class="reference" href="ptr_set.html">ptr_set</a></li>
+<li><tt class="docutils literal"><span class="pre">ptr_multi_set</span></tt></li>
+<li><a class="reference" href="ptr_map.html">ptr_map</a></li>
+<li><a class="reference" href="ptr_multimap.html">ptr_multimap</a></li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>See also:</strong></p>
 <ul class="simple">
-<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
-<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a></li>
-<li><a class="reference" href="ptr_multiset_adapter.html">ptr_multiset_adapter</a></li>
 <li><a class="reference" href="indirect_fun.html">void_ptr_indirect_fun</a></li>
 </ul>
 <p><strong>Navigate:</strong></p>
@@ -333,11 +349,11 @@
 <ul class="simple">
 <li>Using <tt class="docutils literal"><span class="pre">nullable&lt;T&gt;</span></tt> as <tt class="docutils literal"><span class="pre">Key</span></tt> is meaningless and not allowed</li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/ptr_multiset.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_multiset.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_multiset.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,18 +10,26 @@
 A ``ptr_multiset<T>`` is a pointer container that uses an underlying ``std::multiset<void*>``
 to store the pointers.
 
+**Hierarchy:**
+
+- `reversible_ptr_container <reversible_ptr_container.html>`_
+
+  - `associative_ptr_container <associative_ptr_container.html>`_
+  
+    - `ptr_set_adapter <ptr_set_adapter.html>`_
+    - `ptr_multiset_adapter <ptr_multiset_adapter.html>`_
+    - `ptr_map_adapter <ptr_map_adapter.html>`_
+    - `ptr_multi_map_adapter <ptr_multimap_adapter.html>`_
+
+      - `ptr_set <ptr_set.html>`_
+      - ``ptr_multi_set`` 
+      - `ptr_map <ptr_map.html>`_
+      - `ptr_multimap <ptr_multimap.html>`_
+
 **See also:**
 
-- reversible_ptr_container_
-- associative_ptr_container_
-- ptr_multiset_adapter_
 - `void_ptr_indirect_fun <indirect_fun.html>`_
 
-.. _reversible_ptr_container: reversible_ptr_container.html 
-.. _associative_ptr_container: associative_ptr_container.html
-.. _ptr_multiset_adapter: ptr_multiset_adapter.html
-.. _`indirect predicates`: indirect_fun.html 
-
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -60,6 +68,12 @@
 
 - Using ``nullable<T>`` as ``Key`` is meaningless and not allowed
 
+.. raw:: html 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+        <hr>
 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/ptr_multiset_adapter.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_multiset_adapter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_multiset_adapter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.4 $
+:Date: $Date: 2006/11/22 22:01:03 $
+:Revision: $Revision: 1.4.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -294,12 +294,25 @@
 <p>This class is used to build custom pointer containers with
 an underlying multiset-like container. The interface of the class is an extension
 of the interface from <tt class="docutils literal"><span class="pre">associative_ptr_container</span></tt>.</p>
-<p><strong>See also:</strong></p>
+<p><strong>Hierarchy:</strong></p>
 <ul class="simple">
-<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
-<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a></li>
-<li><a class="reference" href="ptr_multiset.html">ptr_multiset</a></li>
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a><ul>
+<li><a class="reference" href="ptr_set_adapter.html">ptr_set_adapter</a></li>
+<li><tt class="docutils literal"><span class="pre">ptr_multiset_adapter</span></tt></li>
+<li><a class="reference" href="ptr_map_adapter.html">ptr_map_adapter</a></li>
+<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multi_map_adapter</a><ul>
+<li><a class="reference" href="ptr_set.html">ptr_set</a></li>
+<li><a class="reference" href="ptr_multiset.html">ptr_multi_set</a></li>
+<li><a class="reference" href="ptr_map.html">ptr_map</a></li>
+<li><a class="reference" href="ptr_multimap.html">ptr_multimap</a></li>
 </ul>
+</li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
@@ -404,11 +417,11 @@
 </blockquote>
 </li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/ptr_multiset_adapter.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_multiset_adapter.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_multiset_adapter.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,16 +11,22 @@
 an underlying multiset-like container. The interface of the class is an extension
 of the interface from ``associative_ptr_container``.
 
-**See also:**
+**Hierarchy:**
 
-- reversible_ptr_container_
-- associative_ptr_container_
-- ptr_multiset_
+- `reversible_ptr_container <reversible_ptr_container.html>`_
 
-.. _reversible_ptr_container: reversible_ptr_container.html 
-.. _associative_ptr_container: associative_ptr_container.html
-.. _ptr_multiset: ptr_multiset.html
+  - `associative_ptr_container <associative_ptr_container.html>`_
+  
+    - `ptr_set_adapter <ptr_set_adapter.html>`_
+    - ``ptr_multiset_adapter``
+    - `ptr_map_adapter <ptr_map_adapter.html>`_
+    - `ptr_multi_map_adapter <ptr_multimap_adapter.html>`_
 
+      - `ptr_set <ptr_set.html>`_
+      - `ptr_multi_set <ptr_multiset.html>`_ 
+      - `ptr_map <ptr_map.html>`_
+      - `ptr_multimap <ptr_multimap.html>`_
+
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -126,6 +132,12 @@
 
    - Exception safety: Basic guarantee
  
+.. raw:: html 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+        <hr>
 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/ptr_sequence_adapter.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_sequence_adapter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_sequence_adapter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.7 $
+:Date: $Date: 2006/11/22 22:01:03 $
+:Revision: $Revision: 1.7.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -294,16 +294,25 @@
 <p>This section describes all the common operations for all the pointer
 sequences:</p>
 <ul class="simple">
-<li><a class="reference" href="ptr_vector.html">ptr_vector</a>,</li>
-<li><a class="reference" href="ptr_list.html">ptr_list</a>,</li>
-<li><a class="reference" href="ptr_deque.html">ptr_deque</a>,</li>
+<li><a class="reference" href="ptr_vector.html">ptr_vector</a></li>
+<li><a class="reference" href="ptr_list.html">ptr_list</a></li>
+<li><a class="reference" href="ptr_deque.html">ptr_deque</a></li>
 </ul>
 <p>The <tt class="docutils literal"><span class="pre">ptr_sequence_adapter</span></tt> is also a concrete class that you can use to create custom pointer
 containers from.</p>
-<p><strong>See also:</strong></p>
+<p><strong>Hierarchy:</strong></p>
 <ul class="simple">
-<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><tt class="docutils literal"><span class="pre">ptr_sequence_adapter</span></tt><ul>
+<li><a class="reference" href="ptr_vector.html">ptr_vector</a></li>
+<li><a class="reference" href="ptr_list.html">ptr_list</a></li>
+<li><a class="reference" href="ptr_deque.html">ptr_deque</a></li>
+<li><a class="reference" href="ptr_array.html">ptr_array</a></li>
 </ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
@@ -352,15 +361,17 @@
         iterator  erase( const Range&amp; r );
 
     public: // <a class="reference" href="#pointer-container-requirements">pointer container requirements</a>
+        template&lt; class PtrSequence &gt;
+        void transfer( iterator before, typename PtrSequence::iterator object,
+                       PtrSequence&amp; from );                             
+        template&lt; class PtrSequence &gt;
+        void transfer( iterator before, typename PtrSequence::iterator first, typename PtrSequence::iterator last,
+                       PtrSequence&amp; from );
+        void template&lt; class PtrSequence, class Range &gt;
+        void transfer( iterator before, const Range&amp; r, PtrSequence&amp; from );
+        template&lt; class PtrSequence &gt;
+        void transfer( iterator before, PtrSequence&amp; from );
 
-        void  transfer( iterator before, iterator object,
-                        ptr_sequence_adapter&amp; from );
-        void  transfer( iterator before, iterator first, iterator last,
-                        ptr_sequence_adapter&amp; from );
-        void template&lt; class Range&gt;
-        void transfer( iterator before, const Range&amp; r, ptr_sequence_adapter&amp; from );
-        void transfer( iterator before, ptr_sequence_adapter&amp; from );
-
     public: // <a class="reference" href="#algorithms">algorithms</a>
 
         void sort();
@@ -608,47 +619,49 @@
 </div>
 <div class="section">
 <h2><a id="semantics-pointer-container-requirements" name="semantics-pointer-container-requirements"><span id="pointer-container-requirements"></span>Semantics: pointer container requirements</a></h2>
-<p>You cannot use <tt class="docutils literal"><span class="pre">transfer()</span></tt> to move elements between two
-different types of containers. This is to avoid
-problems with different allocators. The requirement might be
-weakened in the future.</p>
+<p>You can use <tt class="docutils literal"><span class="pre">transfer()</span></tt> to move elements between two containers of the same type. Furthermore,
+you can also move elements from a container of type <tt class="docutils literal"><span class="pre">T</span></tt> to a container of type <tt class="docutils literal"><span class="pre">U</span></tt> as long as
+<tt class="docutils literal"><span class="pre">T::value_type</span></tt> is convertible to <tt class="docutils literal"><span class="pre">U::value_type</span></tt>. An example would be transferring from <tt class="docutils literal"><span class="pre">boost::ptr_vector&lt;Derived&gt;</span></tt>
+to <tt class="docutils literal"><span class="pre">boost::ptr_deque&lt;Base&gt;</span></tt>.</p>
+<p>(<strong>Remark:</strong> <em>When moving elements between two different containers, it is your responsibility to make sure the allocators are compatible.</em> 
+<em>The special latitude of being able to transfer between two different containers is only available for Sequences and not for Associative Containers.</em>)</p>
+<!--  -->
 <ul>
-<li><p class="first"><tt class="docutils literal"><span class="pre">void</span> <span class="pre">transfer(</span> <span class="pre">iterator</span> <span class="pre">before,</span> <span class="pre">iterator</span> <span class="pre">object,</span> <span class="pre">ptr_sequence_adapter&amp;</span> <span class="pre">from</span> <span class="pre">);</span></tt></p>
+<li><p class="first"><tt class="docutils literal"><span class="pre">template&lt;</span> <span class="pre">class</span> <span class="pre">PtrSequence</span> <span class="pre">&gt;</span> <span class="pre">void</span> <span class="pre">transfer(</span> <span class="pre">iterator</span> <span class="pre">before,</span> <span class="pre">typename</span> <span class="pre">PtrSequence::iterator</span> <span class="pre">object,</span> <span class="pre">PtrSequence&amp;</span> <span class="pre">from</span> <span class="pre">);</span></tt></p>
 <blockquote>
 <ul class="simple">
-<li>Requirements: <tt class="docutils literal"><span class="pre">not</span> <span class="pre">from.empty()</span></tt></li>
 <li>Effects: Inserts the object defined by <tt class="docutils literal"><span class="pre">object</span></tt> into the container and remove it from <tt class="docutils literal"><span class="pre">from</span></tt>.
 Insertion takes place before <tt class="docutils literal"><span class="pre">before</span></tt>.</li>
-<li>Postconditions: <tt class="docutils literal"><span class="pre">size()</span></tt> is one more, <tt class="docutils literal"><span class="pre">from.size()</span></tt> is one less.</li>
+<li>Postconditions: If <tt class="docutils literal"><span class="pre">from.empty()</span></tt>, nothing happens. Otherwise
+<tt class="docutils literal"><span class="pre">size()</span></tt> is one more, <tt class="docutils literal"><span class="pre">from.size()</span></tt> is one less.</li>
 <li>Exception safety: Strong guarantee</li>
 </ul>
 </blockquote>
 </li>
-<li><p class="first"><tt class="docutils literal"><span class="pre">void</span> <span class="pre">transfer(</span> <span class="pre">iterator</span> <span class="pre">before,</span> <span class="pre">iterator</span> <span class="pre">first,</span> <span class="pre">iterator</span> <span class="pre">last,</span> <span class="pre">ptr_sequence_adapter&amp;</span> <span class="pre">from</span> <span class="pre">);</span></tt></p>
+<li><p class="first"><tt class="docutils literal"><span class="pre">template&lt;</span> <span class="pre">class</span> <span class="pre">PtrSequence</span> <span class="pre">&gt;</span> <span class="pre">void</span> <span class="pre">transfer(</span> <span class="pre">iterator</span> <span class="pre">before,</span> <span class="pre">typename</span> <span class="pre">PtrSequence::iterator</span> <span class="pre">first,</span> <span class="pre">typename</span> <span class="pre">PtrSequence::iterator</span> <span class="pre">last,</span> <span class="pre">PtrSequence&amp;</span> <span class="pre">from</span> <span class="pre">);</span></tt></p>
 <blockquote>
 <ul class="simple">
-<li>Requirements: <tt class="docutils literal"><span class="pre">not</span> <span class="pre">from.empty()</span></tt></li>
+<li>Requirements: <tt class="docutils literal"><span class="pre">from.size()</span> <span class="pre">&gt;=</span> <span class="pre">std::distance(first,last)</span></tt></li>
 <li>Effects: Inserts the objects defined by the range <tt class="docutils literal"><span class="pre">[first,last)</span></tt> into the container and remove it from <tt class="docutils literal"><span class="pre">from</span></tt>.
 Insertion takes place before <tt class="docutils literal"><span class="pre">before</span></tt>.</li>
-<li>Postconditions: Let <tt class="docutils literal"><span class="pre">N</span> <span class="pre">==</span> <span class="pre">std::distance(first,last);</span></tt> then <tt class="docutils literal"><span class="pre">size()</span></tt> is <tt class="docutils literal"><span class="pre">N</span></tt> more, <tt class="docutils literal"><span class="pre">from.size()</span></tt> is <tt class="docutils literal"><span class="pre">N</span></tt> less.</li>
+<li>Postconditions: If <tt class="docutils literal"><span class="pre">from.empty()</span></tt>, nothing happens. Otherwise, 
+let <tt class="docutils literal"><span class="pre">N</span> <span class="pre">==</span> <span class="pre">std::distance(first,last);</span></tt> then <tt class="docutils literal"><span class="pre">size()</span></tt> is <tt class="docutils literal"><span class="pre">N</span></tt> more, <tt class="docutils literal"><span class="pre">from.size()</span></tt> is <tt class="docutils literal"><span class="pre">N</span></tt> less.</li>
 <li>Exception safety: Strong guarantee</li>
+<li>Complexity: Linear or better</li>
 </ul>
 </blockquote>
 </li>
-<li><p class="first"><tt class="docutils literal"><span class="pre">template&lt;</span> <span class="pre">class</span> <span class="pre">Range&gt;</span> <span class="pre">void</span> <span class="pre">transfer(</span> <span class="pre">iterator</span> <span class="pre">before,</span> <span class="pre">const</span> <span class="pre">Range&amp;</span> <span class="pre">r,</span> <span class="pre">ptr_sequence_adapter&amp;</span> <span class="pre">from</span> <span class="pre">);</span></tt></p>
+<li><p class="first"><tt class="docutils literal"><span class="pre">void</span> <span class="pre">template&lt;</span> <span class="pre">class</span> <span class="pre">PtrSequence,</span> <span class="pre">class</span> <span class="pre">Range</span> <span class="pre">&gt;</span> <span class="pre">void</span> <span class="pre">transfer(</span> <span class="pre">iterator</span> <span class="pre">before,</span> <span class="pre">const</span> <span class="pre">Range&amp;</span> <span class="pre">r,</span> <span class="pre">PtrSequence&amp;</span> <span class="pre">from</span> <span class="pre">);</span></tt></p>
 <blockquote>
 <ul class="simple">
 <li>Effects: <tt class="docutils literal"><span class="pre">transfer(before,</span> <span class="pre">boost::begin(r),</span> <span class="pre">boost::end(r),</span> <span class="pre">from);</span></tt></li>
 </ul>
 </blockquote>
 </li>
-<li><p class="first"><tt class="docutils literal"><span class="pre">void</span> <span class="pre">transfer(</span> <span class="pre">iterator</span> <span class="pre">before,</span> <span class="pre">ptr_sequence_adapter&amp;</span> <span class="pre">from</span> <span class="pre">);</span></tt></p>
+<li><p class="first"><tt class="docutils literal"><span class="pre">template&lt;</span> <span class="pre">class</span> <span class="pre">PtrSequence&gt;</span> <span class="pre">void</span> <span class="pre">transfer(</span> <span class="pre">iterator</span> <span class="pre">before,</span> <span class="pre">PtrSequence&amp;</span> <span class="pre">from</span> <span class="pre">);</span></tt></p>
 <blockquote>
 <ul class="simple">
-<li>Effects: Transfers all objects from <tt class="docutils literal"><span class="pre">from</span></tt> into the container. Insertion
-takes place before <tt class="docutils literal"><span class="pre">before</span></tt>.</li>
-<li>Postconditions: <tt class="docutils literal"><span class="pre">from.empty();</span></tt></li>
-<li>Exception safety: Strong guarantee</li>
+<li>Effects: <tt class="docutils literal"><span class="pre">transfer(before,</span> <span class="pre">from,</span> <span class="pre">from);</span></tt></li>
 </ul>
 </blockquote>
 </li>
@@ -722,11 +735,11 @@
 </blockquote>
 </li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/ptr_sequence_adapter.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_sequence_adapter.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_sequence_adapter.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,24 +10,25 @@
 This section describes all the common operations for all the pointer
 sequences:
 
-- ptr_vector_,
-- ptr_list_,
-- ptr_deque_,
+- `ptr_vector <ptr_vector.html>`_
+- `ptr_list <ptr_list.html>`_ 
+- `ptr_deque <ptr_deque.html>`_
 
-.. _ptr_vector : ptr_vector.html
-.. _ptr_list : ptr_list.html
-.. _ptr_deque : ptr_deque.html
 
-
 The ``ptr_sequence_adapter`` is also a concrete class that you can use to create custom pointer
 containers from.
 
-**See also:**
+**Hierarchy:**
 
-- reversible_ptr_container__
+- `reversible_ptr_container <reversible_ptr_container.html>`_
 
-__ reversible_ptr_container.html
+  - ``ptr_sequence_adapter``
 
+    - `ptr_vector <ptr_vector.html>`_
+    - `ptr_list <ptr_list.html>`_ 
+    - `ptr_deque <ptr_deque.html>`_
+    - `ptr_array <ptr_array.html>`_
+
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -79,15 +80,17 @@
                 iterator  erase( const Range& r );
 
             public: // `pointer container requirements`_
+		template< class PtrSequence >
+                void transfer( iterator before, typename PtrSequence::iterator object,
+                               PtrSequence& from );				
+		template< class PtrSequence >
+                void transfer( iterator before, typename PtrSequence::iterator first, typename PtrSequence::iterator last,
+                               PtrSequence& from );
+                void template< class PtrSequence, class Range >
+                void transfer( iterator before, const Range& r, PtrSequence& from );
+		template< class PtrSequence >
+                void transfer( iterator before, PtrSequence& from );
 
-                void  transfer( iterator before, iterator object,
-                                ptr_sequence_adapter& from );
-                void  transfer( iterator before, iterator first, iterator last,
-                                ptr_sequence_adapter& from );
-                void template< class Range>
-                void transfer( iterator before, const Range& r, ptr_sequence_adapter& from );
-                void transfer( iterator before, ptr_sequence_adapter& from );
-
             public: // `algorithms`_
 
                 void sort();
@@ -330,48 +333,49 @@
 Semantics: pointer container requirements
 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
 
-You cannot use ``transfer()`` to move elements between two
-different types of containers. This is to avoid
-problems with different allocators. The requirement might be
-weakened in the future.
+You can use ``transfer()`` to move elements between two containers of the same type. Furthermore,
+you can also move elements from a container of type ``T`` to a container of type ``U`` as long as
+``T::value_type`` is convertible to ``U::value_type``. An example would be transferring from ``boost::ptr_vector<Derived>``
+to ``boost::ptr_deque<Base>``.
 
+(**Remark:** *When moving elements between two different containers, it is your responsibility to make sure the allocators are compatible.* 
+*The special latitude of being able to transfer between two different containers is only available for Sequences and not for Associative Containers.*)
 
-- ``void transfer( iterator before, iterator object, ptr_sequence_adapter& from );``
+..
 
-    - Requirements: ``not from.empty()``
+- ``template< class PtrSequence > void transfer( iterator before, typename PtrSequence::iterator object, PtrSequence& from );``   
 
     - Effects: Inserts the object defined by ``object`` into the container and remove it from ``from``.
       Insertion takes place before ``before``.
 
-    - Postconditions: ``size()`` is one more, ``from.size()`` is one less.
+    - Postconditions: If ``from.empty()``, nothing happens. Otherwise
+      ``size()`` is one more, ``from.size()`` is one less.
 
     - Exception safety: Strong guarantee
 
 
-- ``void transfer( iterator before, iterator first, iterator last, ptr_sequence_adapter& from );``
+- ``template< class PtrSequence > void transfer( iterator before, typename PtrSequence::iterator first, typename PtrSequence::iterator last, PtrSequence& from );``
 
-    - Requirements: ``not from.empty()``
+    - Requirements: ``from.size() >= std::distance(first,last)``
 
     - Effects: Inserts the objects defined by the range ``[first,last)`` into the container and remove it from ``from``.
       Insertion takes place before ``before``.
 
-    - Postconditions: Let ``N == std::distance(first,last);`` then ``size()`` is ``N`` more, ``from.size()`` is ``N`` less.
+    - Postconditions: If ``from.empty()``, nothing happens. Otherwise, 
+      let ``N == std::distance(first,last);`` then ``size()`` is ``N`` more, ``from.size()`` is ``N`` less.
 
     - Exception safety: Strong guarantee
+    
+    - Complexity: Linear or better
 
-- ``template< class Range> void transfer( iterator before, const Range& r, ptr_sequence_adapter& from );``
+- ``void template< class PtrSequence, class Range > void transfer( iterator before, const Range& r, PtrSequence& from );``
 
     - Effects: ``transfer(before, boost::begin(r), boost::end(r), from);``
 
-- ``void transfer( iterator before, ptr_sequence_adapter& from );``
+- ``template< class PtrSequence> void transfer( iterator before, PtrSequence& from );``
 
-    - Effects: Transfers all objects from ``from`` into the container. Insertion
-      takes place before ``before``.
+    - Effects: ``transfer(before, from, from);``
 
-    - Postconditions: ``from.empty();``
-
-    - Exception safety: Strong guarantee
-
 .. _`algorithms`:
 
 Semantics: algorithms
@@ -420,6 +424,12 @@
     - Postconditions: (Container versions) ``r.empty()``  
     - Exception safety: nothrow guarantee (the behavior is undefined if the comparison operator throws)
 
+.. raw:: html 
+
+        <hr>
     
-:copyright:     Thorsten Ottosen 2004-2005. 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
     

Modified: boost/trunk/libs/ptr_container/doc/ptr_set.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_set.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_set.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.5 $
+:Date: $Date: 2006/11/22 22:01:03 $
+:Revision: $Revision: 1.5.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -292,11 +292,27 @@
 <h2 class="subtitle" id="class-ptr-set">Class <tt class="docutils literal"><span class="pre">ptr_set</span></tt></h2>
 <p>A <tt class="docutils literal"><span class="pre">ptr_set&lt;T&gt;</span></tt> is a pointer container that uses an underlying <tt class="docutils literal"><span class="pre">std::set&lt;void*&gt;</span></tt>
 to store the pointers.</p>
+<p><strong>Hierarchy:</strong></p>
+<ul class="simple">
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a><ul>
+<li><a class="reference" href="ptr_set_adapter.html">ptr_set_adapter</a></li>
+<li><a class="reference" href="ptr_multiset_adapter.html">ptr_multiset_adapter</a></li>
+<li><a class="reference" href="ptr_map_adapter.html">ptr_map_adapter</a></li>
+<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multi_map_adapter</a><ul>
+<li><tt class="docutils literal"><span class="pre">ptr_set</span></tt></li>
+<li><a class="reference" href="ptr_multiset.html">ptr_multi_set</a></li>
+<li><a class="reference" href="ptr_map.html">ptr_map</a></li>
+<li><a class="reference" href="ptr_multimap.html">ptr_multimap</a></li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>See also:</strong></p>
 <ul class="simple">
-<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
-<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a></li>
-<li><a class="reference" href="ptr_set_adapter.html">ptr_set_adapter</a></li>
 <li><a class="reference" href="indirect_fun.html">void_ptr_indirect_fun</a></li>
 </ul>
 <p><strong>Navigate:</strong></p>
@@ -334,11 +350,11 @@
 <ul class="simple">
 <li>Using <tt class="docutils literal"><span class="pre">nullable&lt;T&gt;</span></tt> as <tt class="docutils literal"><span class="pre">Key</span></tt> is meaningless and not allowed</li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/ptr_set.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_set.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_set.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,17 +10,27 @@
 A ``ptr_set<T>`` is a pointer container that uses an underlying ``std::set<void*>``
 to store the pointers.
 
+**Hierarchy:**
+
+- `reversible_ptr_container <reversible_ptr_container.html>`_
+
+  - `associative_ptr_container <associative_ptr_container.html>`_
+  
+    - `ptr_set_adapter <ptr_set_adapter.html>`_
+    - `ptr_multiset_adapter  <ptr_multiset_adapter.html>`_
+    - `ptr_map_adapter <ptr_map_adapter.html>`_
+    - `ptr_multi_map_adapter <ptr_multimap_adapter.html>`_
+
+      - ``ptr_set``
+      - `ptr_multi_set <ptr_multiset.html>`_ 
+      - `ptr_map <ptr_map.html>`_
+      - `ptr_multimap <ptr_multimap.html>`_
+
+    
 **See also:**
 
-- reversible_ptr_container_
-- associative_ptr_container_
-- ptr_set_adapter_
 - `void_ptr_indirect_fun <indirect_fun.html>`_
 
-.. _reversible_ptr_container: reversible_ptr_container.html 
-.. _associative_ptr_container: associative_ptr_container.html
-.. _ptr_set_adapter: ptr_set_adapter.html
-
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -60,6 +70,12 @@
 
 - Using ``nullable<T>`` as ``Key`` is meaningless and not allowed
 
+.. raw:: html 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+        <hr>
 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/ptr_set_adapter.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_set_adapter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_set_adapter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.4 $
+:Date: $Date: 2006/11/22 22:01:03 $
+:Revision: $Revision: 1.4.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -294,12 +294,25 @@
 <p>This class is used to build custom pointer containers with
 an underlying set-like container. The interface of the class is an extension
 of the interface from <tt class="docutils literal"><span class="pre">associative_ptr_container</span></tt>.</p>
-<p><strong>See also:</strong></p>
+<p><strong>Hierarchy:</strong></p>
 <ul class="simple">
-<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
-<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a></li>
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a><ul>
+<li><tt class="docutils literal"><span class="pre">ptr_set_adapter</span></tt></li>
+<li><a class="reference" href="ptr_multiset_adapter.html">ptr_multiset_adapter</a></li>
+<li><a class="reference" href="ptr_map_adapter.html">ptr_map_adapter</a></li>
+<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multi_map_adapter</a><ul>
 <li><a class="reference" href="ptr_set.html">ptr_set</a></li>
+<li><a class="reference" href="ptr_multiset.html">ptr_multi_set</a></li>
+<li><a class="reference" href="ptr_map.html">ptr_map</a></li>
+<li><a class="reference" href="ptr_multimap.html">ptr_multimap</a></li>
 </ul>
+</li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
@@ -404,11 +417,11 @@
 </blockquote>
 </li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/ptr_set_adapter.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_set_adapter.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_set_adapter.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,12 +11,22 @@
 an underlying set-like container. The interface of the class is an extension
 of the interface from ``associative_ptr_container``.
 
-**See also:**
+**Hierarchy:**
 
-- reversible_ptr_container_
-- associative_ptr_container_
-- ptr_set_
+- `reversible_ptr_container <reversible_ptr_container.html>`_
 
+  - `associative_ptr_container <associative_ptr_container.html>`_
+  
+    - ``ptr_set_adapter``
+    - `ptr_multiset_adapter <ptr_multiset_adapter.html>`_
+    - `ptr_map_adapter <ptr_map_adapter.html>`_
+    - `ptr_multi_map_adapter <ptr_multimap_adapter.html>`_
+
+      - `ptr_set <ptr_set.html>`_
+      - `ptr_multi_set <ptr_multiset.html>`_ 
+      - `ptr_map <ptr_map.html>`_
+      - `ptr_multimap <ptr_multimap.html>`_
+
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -124,6 +134,12 @@
 
    - Effects: ``return transfer( from.begin(), from.end(), from );``.
 
+.. raw:: html 
+
+        <hr>
  
-:copyright:     Thorsten Ottosen 2004-2005. 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
 
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/ptr_vector.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_vector.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_vector.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.4 $
+:Date: $Date: 2006/11/22 22:01:03 $
+:Revision: $Revision: 1.4.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -293,12 +293,19 @@
 <h1><a id="class-ptr-vector" name="class-ptr-vector">Class <tt class="docutils literal"><span class="pre">ptr_vector</span></tt></a></h1>
 <p>A <tt class="docutils literal"><span class="pre">ptr_vector&lt;T&gt;</span></tt> is a pointer container that uses an underlying <tt class="docutils literal"><span class="pre">std::vector&lt;void*&gt;</span></tt>
 to store the pointers.</p>
-<p><strong>See also:</strong></p>
+<p><strong>Hierarchy:</strong></p>
 <ul class="simple">
-<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
-<li><a class="reference" href="ptr_sequence_adapter.html">ptr_sequence_adapter</a></li>
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><a class="reference" href="ptr_sequence_adapter.html">ptr_sequence_adapter</a><ul>
+<li><tt class="docutils literal"><span class="pre">ptr_vector</span></tt></li>
+<li><a class="reference" href="ptr_list.html">ptr_list</a></li>
+<li><a class="reference" href="ptr_deque.html">ptr_deque</a></li>
 <li><a class="reference" href="ptr_array.html">ptr_array</a></li>
 </ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
@@ -440,11 +447,11 @@
 </blockquote>
 </li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/ptr_vector.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/ptr_vector.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/ptr_vector.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,16 +10,17 @@
 A ``ptr_vector<T>`` is a pointer container that uses an underlying ``std::vector<void*>``
 to store the pointers. 
 
-**See also:**
+**Hierarchy:**
 
-- reversible_ptr_container_
-- ptr_sequence_adapter_
-- ptr_array_
+- `reversible_ptr_container <reversible_ptr_container.html>`_
 
-.. _reversible_ptr_container: reversible_ptr_container.html 
-.. _ptr_sequence_adapter: ptr_sequence_adapter.html
-.. _ptr_array: ptr_array.html
+  - `ptr_sequence_adapter <ptr_sequence_adapter.html>`_
 
+    - ``ptr_vector``
+    - `ptr_list <ptr_list.html>`_
+    - `ptr_deque <ptr_deque.html>`_
+    - `ptr_array <ptr_array.html>`_
+
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -154,6 +155,12 @@
 
     - Exception safety: Nothrow guarantee
 
+.. raw:: html 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+        <hr>
 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/reference.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/reference.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/reference.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.5 $
+:Date: $Date: 2006/11/22 22:01:03 $
+:Revision: $Revision: 1.5.2.5 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -291,8 +291,8 @@
 <h1 class="title"><img alt="Boost" src="boost.png" /> Pointer Container Library</h1>
 <h2 class="subtitle" id="reference">Reference</h2>
 <p>The documentation is divided into a an explanation for 
-each container. All the common interface is explained only once,
-but links are always provided to the relevant links.
+each container. When containers have the same interface, that common interface is explained only once,
+but links are always provided to more relevant information.
 Please make sure you understand 
 the <a class="reference" href="reference.html#the-clonable-concept">Clonable</a> concept and 
 the <a class="reference" href="reference.html#the-clone-allocator-concept">Clone Allocator</a> concept.</p>
@@ -300,40 +300,63 @@
 <li><a class="reference" href="conventions.html">Conventions</a></li>
 <li><a class="reference" href="#the-clonable-concept">The Clonable concept</a></li>
 <li><a class="reference" href="#the-clone-allocator-concept">The Clone Allocator concept</a></li>
-<li>Class <a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a></li>
-<li>Class <a class="reference" href="associative_ptr_container.html">associative_ptr_container</a></li>
-<li><a class="reference" href="#pointer-container-adapters">Pointer container adapters</a><ul>
-<li><a class="reference" href="ptr_sequence_adapter.html">ptr_sequence_adapter</a></li>
-<li><a class="reference" href="ptr_set_adapter.html">ptr_set_adapter</a></li>
-<li><a class="reference" href="ptr_multiset_adapter.html">ptr_multiset_adapter</a></li>
-<li><a class="reference" href="ptr_map_adapter.html">ptr_map_adapter</a></li>
-<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multimap_adapter</a></li>
-</ul>
-</li>
-<li><a class="reference" href="#sequence-containers">Sequence containers</a><ul>
+<li><a class="reference" href="#class-hierarchy">Class hierarchy</a>:<ul>
+<li><a class="reference" href="reversible_ptr_container.html">reversible_ptr_container</a><ul>
+<li><a class="reference" href="ptr_sequence_adapter.html">ptr_sequence_adapter</a><ul>
 <li><a class="reference" href="ptr_vector.html">ptr_vector</a></li>
+<li><a class="reference" href="ptr_list.html">ptr_list</a></li>
 <li><a class="reference" href="ptr_deque.html">ptr_deque</a></li>
-<li><a class="reference" href="ptr_list.html">ptr_list</a></li>
 <li><a class="reference" href="ptr_array.html">ptr_array</a></li>
 </ul>
 </li>
-<li><a class="reference" href="#associative-containers">Associative containers</a><ul>
+<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a><ul>
+<li><a class="reference" href="ptr_set_adapter.html">ptr_set_adapter</a></li>
+<li><a class="reference" href="ptr_multiset_adapter.html">ptr_multiset_adapter</a></li>
+<li><a class="reference" href="ptr_map_adapter.html">ptr_map_adapter</a></li>
+<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multi_map_adapter</a><ul>
 <li><a class="reference" href="ptr_set.html">ptr_set</a></li>
-<li><a class="reference" href="ptr_multiset.html">ptr_multiset</a></li>
+<li><a class="reference" href="ptr_multiset.html">ptr_multi_set</a></li>
 <li><a class="reference" href="ptr_map.html">ptr_map</a></li>
 <li><a class="reference" href="ptr_multimap.html">ptr_multimap</a></li>
 </ul>
 </li>
-<li><a class="reference" href="#map-iterator-operations">Map iterator operations</a></li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
+</li>
+<li><a class="reference" href="#serialization">Serialization</a></li>
 <li><a class="reference" href="indirect_fun.html">Indirected functions</a></li>
 <li><a class="reference" href="#class-nullable">Class nullable</a></li>
 <li><a class="reference" href="#exception-classes">Exception classes</a></li>
+<li><a class="reference" href="#disabling-the-use-of-exceptions">Disabling the use of exceptions</a></li>
 </ul>
+<!-- - Class `reversible_ptr_container <reversible_ptr_container.html>`_
+- Class `associative_ptr_container <associative_ptr_container.html>`_
+- `Pointer container adapters`_
+
+  - `ptr_sequence_adapter <ptr_sequence_adapter.html>`_
+  - `ptr_set_adapter <ptr_set_adapter.html>`_
+  - `ptr_multiset_adapter <ptr_multiset_adapter.html>`_
+  - `ptr_map_adapter <ptr_map_adapter.html>`_
+  - `ptr_multimap_adapter <ptr_multimap_adapter.html>`_    
+- `Sequence containers`_
+
+  - `ptr_vector <ptr_vector.html>`_
+  - `ptr_deque <ptr_deque.html>`_
+  - `ptr_list <ptr_list.html>`_
+  - `ptr_array <ptr_array.html>`_
+- `Associative containers`_
+
+  - `ptr_set <ptr_set.html>`_
+  - `ptr_multiset <ptr_multiset.html>`_
+  - `ptr_map <ptr_map.html>`_
+  - `ptr_multimap <ptr_multimap.html>`_ -->
 <div class="section">
 <h1><a id="the-clonable-concept" name="the-clonable-concept">The Clonable concept</a></h1>
 <p><strong>Refinement of</strong></p>
 <ul class="simple">
-<li>Copy Constructible</li>
 <li>Heap Allocable</li>
 <li>Heap Deallocable</li>
 </ul>
@@ -365,22 +388,26 @@
 <p><strong>Valid expressions</strong></p>
 <table border="1" class="docutils">
 <colgroup>
-<col width="24%" />
-<col width="18%" />
-<col width="58%" />
+<col width="19%" />
+<col width="14%" />
+<col width="46%" />
+<col width="20%" />
 </colgroup>
 <tbody valign="top">
 <tr><td><strong>Expression</strong></td>
 <td><strong>Type</strong></td>
 <td><strong>Semantics</strong></td>
+<td><strong>Postcondition</strong></td>
 </tr>
 <tr><td><tt class="docutils literal"><span class="pre">new_clone(a);</span></tt></td>
 <td><tt class="docutils literal"><span class="pre">T*</span></tt></td>
 <td>Allocate a new object that can be considered equivalent to the <tt class="docutils literal"><span class="pre">a</span></tt> object</td>
+<td><tt class="docutils literal"><span class="pre">typeid(*new_clone(a))</span> <span class="pre">==</span> <span class="pre">typeid(a)</span></tt></td>
 </tr>
 <tr><td><tt class="docutils literal"><span class="pre">delete_clone(ptr);</span></tt></td>
 <td><tt class="docutils literal"><span class="pre">void</span></tt></td>
 <td>Deallocate an object previously allocated with <tt class="docutils literal"><span class="pre">allocate_clone()</span></tt>. Must not throw</td>
+<td>&nbsp;</td>
 </tr>
 </tbody>
 </table>
@@ -413,6 +440,7 @@
 the function is the boost namespace, but it can be placed together with 
 the rest of the interface of the class.  If you are implementing a class 
 inline in headers, remember to forward declare the functions.</p>
+<p><strong>Warning: We are considering to remove the default implementation above. Therefore always make sure that you overload the functions for your types and do not rely on the defaults in any way.</strong></p>
 </div>
 </div>
 <div class="section">
@@ -425,13 +453,13 @@
 <p>More information can be found below:</p>
 <div class="contents local topic">
 <ul class="simple">
-<li><a class="reference" href="#clone-allocator-requirements" id="id14" name="id14">Clone Allocator requirements</a></li>
-<li><a class="reference" href="#class-heap-clone-allocator" id="id15" name="id15">Class <tt class="docutils literal"><span class="pre">heap_clone_allocator</span></tt></a></li>
-<li><a class="reference" href="#class-view-clone-allocator" id="id16" name="id16">Class <tt class="docutils literal"><span class="pre">view_clone_allocator</span></tt></a></li>
+<li><a class="reference" href="#clone-allocator-requirements" id="id19" name="id19">Clone Allocator requirements</a></li>
+<li><a class="reference" href="#class-heap-clone-allocator" id="id20" name="id20">Class <tt class="docutils literal"><span class="pre">heap_clone_allocator</span></tt></a></li>
+<li><a class="reference" href="#class-view-clone-allocator" id="id21" name="id21">Class <tt class="docutils literal"><span class="pre">view_clone_allocator</span></tt></a></li>
 </ul>
 </div>
 <div class="section">
-<h2><a class="toc-backref" href="#id14" id="clone-allocator-requirements" name="clone-allocator-requirements">Clone Allocator requirements</a></h2>
+<h2><a class="toc-backref" href="#id19" id="clone-allocator-requirements" name="clone-allocator-requirements">Clone Allocator requirements</a></h2>
 <p><strong>Notation</strong></p>
 <table border="1" class="docutils">
 <colgroup>
@@ -457,29 +485,36 @@
 <p><strong>Valid expressions</strong></p>
 <table border="1" class="docutils">
 <colgroup>
-<col width="25%" />
-<col width="6%" />
-<col width="69%" />
+<col width="23%" />
+<col width="7%" />
+<col width="39%" />
+<col width="31%" />
 </colgroup>
 <tbody valign="top">
 <tr><td><strong>Expression</strong></td>
 <td><strong>Type</strong></td>
 <td><strong>Semantics</strong></td>
+<td><strong>Postcondition</strong></td>
 </tr>
 <tr><td><tt class="docutils literal"><span class="pre">CloneAllocator::allocate_clone(a);</span></tt></td>
 <td><tt class="docutils literal"><span class="pre">T*</span></tt></td>
-<td>Allocate a new object that can be considered equivalent to the <tt class="docutils literal"><span class="pre">a</span></tt> object</td>
+<td>Allocate a new object that can be considered equivalent to the
+<tt class="docutils literal"><span class="pre">a</span></tt> object</td>
+<td><tt class="docutils literal"><span class="pre">typeid(*CloneAllocator::allocate_clone(a))</span> <span class="pre">==</span> <span class="pre">typeid(a)</span></tt></td>
 </tr>
 <tr><td><tt class="docutils literal"><span class="pre">CloneAllocator::deallocate_clone(ptr);</span></tt></td>
 <td><tt class="docutils literal"><span class="pre">void</span></tt></td>
-<td>Deallocate an object previously allocated with <tt class="docutils literal"><span class="pre">CloneAllocator::allocate_clone()</span></tt> or a compatible allocator. Must not throw.</td>
+<td>Deallocate an object previously allocated with
+<tt class="docutils literal"><span class="pre">CloneAllocator::allocate_clone()</span></tt> or a compatible allocator.
+Must not throw.</td>
+<td>&nbsp;</td>
 </tr>
 </tbody>
 </table>
 <p>The library comes with two predefined clone allocators.</p>
 </div>
 <div class="section">
-<h2><a class="toc-backref" href="#id15" id="class-heap-clone-allocator" name="class-heap-clone-allocator">Class <tt class="docutils literal docutils literal"><span class="pre">heap_clone_allocator</span></tt></a></h2>
+<h2><a class="toc-backref" href="#id20" id="class-heap-clone-allocator" name="class-heap-clone-allocator">Class <tt class="docutils literal docutils literal"><span class="pre">heap_clone_allocator</span></tt></a></h2>
 <p>This is the default clone allocator used by all pointer containers. For most
 purposes you will never have to change this default.</p>
 <p><strong>Definition</strong></p>
@@ -506,7 +541,7 @@
 schemes by relying on <tt class="docutils literal"><span class="pre">new_clone()</span></tt> and <tt class="docutils literal"><span class="pre">delete_clone()</span></tt>.</p>
 </div>
 <div class="section">
-<h2><a class="toc-backref" href="#id16" id="class-view-clone-allocator" name="class-view-clone-allocator">Class <tt class="docutils literal docutils literal"><span class="pre">view_clone_allocator</span></tt></a></h2>
+<h2><a class="toc-backref" href="#id21" id="class-view-clone-allocator" name="class-view-clone-allocator">Class <tt class="docutils literal docutils literal"><span class="pre">view_clone_allocator</span></tt></a></h2>
 <p>This class provides a way to remove ownership properties of the
 pointer containers. As its name implies, this means that you can
 instead use the pointer containers as a view into an existing
@@ -531,14 +566,21 @@
     };
 }
 </pre>
-<p><strong>See also</strong></p>
-<ul class="simple">
-<li><a class="reference" href="examples.html#changing-the-clone-allocator">Changing the clone allocator</a></li>
-</ul>
+<!-- **See also**
+
+- `Changing the clone allocator <examples.html#changing-the-clone-allocator>`_ -->
 </div>
 </div>
 <div class="section">
-<h1><a id="pointer-container-adapters" name="pointer-container-adapters">Pointer container adapters</a></h1>
+<h1><a id="class-hierarchy" name="class-hierarchy">Class hierarchy</a></h1>
+<p>The library consists of the following types of classes:</p>
+<ol class="arabic simple">
+<li>Pointer container adapters</li>
+</ol>
+<!--  -->
+<ol class="arabic simple" start="2">
+<li>Pointer containers</li>
+</ol>
 <p>The pointer container adapters are used when you
 want to make a pointer container starting from
 your own &quot;normal&quot; container. For example, you
@@ -547,67 +589,143 @@
 to use your map class as a basis for a new
 pointer container.</p>
 <p>The library provides an adapter for each type
-of standard container:</p>
+of standard container highlighted as links below:</p>
 <ul class="simple">
-<li><a class="reference" href="ptr_sequence_adapter.html">ptr_sequence_adapter</a></li>
+<li><tt class="docutils literal"><span class="pre">reversible_ptr_container</span></tt><ul>
+<li><a class="reference" href="ptr_sequence_adapter.html">ptr_sequence_adapter</a><ul>
+<li><tt class="docutils literal"><span class="pre">ptr_vector</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">ptr_list</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">ptr_deque</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">ptr_array</span></tt></li>
+</ul>
+</li>
+<li><tt class="docutils literal"><span class="pre">associative_ptr_container</span></tt><ul>
 <li><a class="reference" href="ptr_set_adapter.html">ptr_set_adapter</a></li>
 <li><a class="reference" href="ptr_multiset_adapter.html">ptr_multiset_adapter</a></li>
 <li><a class="reference" href="ptr_map_adapter.html">ptr_map_adapter</a></li>
-<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multimap_adapter</a></li>
+<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multi_map_adapter</a><ul>
+<li><tt class="docutils literal"><span class="pre">ptr_set</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">ptr_multi_set</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">ptr_map</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">ptr_multimap</span></tt></li>
 </ul>
-</div>
-<div class="section">
-<h1><a id="pointer-containers" name="pointer-containers">Pointer containers</a></h1>
+</li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
 <p>The pointer containers of this library are all built using
-the <a class="reference" href="#pointer-container-adapters">pointer container adapters</a>. There is a pointer container
-for each type of &quot;normal&quot; standard container:</p>
-<div class="section">
-<h2><a id="sequence-containers" name="sequence-containers">Sequence containers</a></h2>
-<blockquote>
+the adapters. There is a pointer container
+for each type of &quot;normal&quot; standard container highlighted as links below.</p>
 <ul class="simple">
+<li><tt class="docutils literal"><span class="pre">reversible_ptr_container</span></tt><ul>
+<li><tt class="docutils literal"><span class="pre">ptr_sequence_adapter</span></tt><ul>
 <li><a class="reference" href="ptr_vector.html">ptr_vector</a></li>
+<li><a class="reference" href="ptr_list.html">ptr_list</a></li>
 <li><a class="reference" href="ptr_deque.html">ptr_deque</a></li>
-<li><a class="reference" href="ptr_list.html">ptr_list</a></li>
 <li><a class="reference" href="ptr_array.html">ptr_array</a></li>
 </ul>
-</blockquote>
-</div>
-<div class="section">
-<h2><a id="associative-containers" name="associative-containers">Associative containers</a></h2>
-<blockquote>
-<ul class="simple">
+</li>
+<li><tt class="docutils literal"><span class="pre">associative_ptr_container</span></tt><ul>
+<li><tt class="docutils literal"><span class="pre">ptr_set_adapter</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">ptr_multiset_adapter</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">ptr_map_adapter</span></tt></li>
+<li><tt class="docutils literal"><span class="pre">ptr_multi_map_adapter</span></tt><ul>
 <li><a class="reference" href="ptr_set.html">ptr_set</a></li>
-<li><a class="reference" href="ptr_multiset.html">ptr_multiset</a></li>
+<li><a class="reference" href="ptr_multiset.html">ptr_multi_set</a></li>
 <li><a class="reference" href="ptr_map.html">ptr_map</a></li>
 <li><a class="reference" href="ptr_multimap.html">ptr_multimap</a></li>
 </ul>
-</blockquote>
+</li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
 </div>
-</div>
 <div class="section">
-<h1><a id="map-iterator-operations" name="map-iterator-operations">Map iterator operations</a></h1>
-<p>The map iterators are a bit different compared to the normal ones.  The 
-reason is that it is a bit clumsy to access the key and the mapped object 
-through i-&gt;first and i-&gt;second, and one tends to forget what is what. 
-Moreover, and more importantly, we also want to hide the pointer as much as possibble.
-The new style can be illustrated with a small example:</p>
+<h1><a id="serialization" name="serialization">Serialization</a></h1>
+<p>As of version 1.34.0 of Boost, the library support
+serialization as defined by <a class="reference" href="../../serialization/index.html">Boost.Serialization</a>.</p>
+<p>Of course, for serialization to work it is required
+that the stored type itself is serializable. For maps, both
+the key type and the mapped type must be serializable.</p>
+<p>When dealing with serialization (and serialization of polymophic objects in particular), 
+pay special attention to these parts of Boost.Serialization:</p>
+<ol class="arabic">
+<li><p class="first">Output/saving requires a const-reference:</p>
 <pre class="literal-block">
-typedef ptr_map&lt;string,int&gt; map_t;
-map_t  m;
-m[ &quot;foo&quot; ] = 4; // insert pair
-m[ &quot;bar&quot; ] = 5; // ditto
+//
+// serialization helper: we can't save a non-const object
+// 
+template&lt; class T &gt;
+inline T const&amp; as_const( T const&amp; r )
+{
+    return r;
+}
 ...
-for( map_t::iterator i = m.begin(); i != m.end(); ++i )
+Container cont;
+
+std::ofstream ofs(&quot;filename&quot;);
+boost::archive::text_oarchive oa(ofs);
+oa &lt;&lt; as_const(cont);
+</pre>
+<p>See <a class="reference" href="../../serialization/doc/rationale.html#trap">Compile time trap when saving a non-const value</a> for
+details.</p>
+</li>
+</ol>
+<ol class="arabic" start="2">
+<li><p class="first">Derived classes need to call <tt class="docutils literal"><span class="pre">base_object()</span></tt> function:</p>
+<pre class="literal-block">
+struct Derived : Base
 {
-         *i += 42; // add 42 to each value
-         cout &lt;&lt; &quot;value=&quot; &lt;&lt; *i &lt;&lt; &quot;, key=&quot; &lt;&lt; i.key() &lt;&lt; &quot;n&quot;;
-} 
+    template&lt; class Archive &gt;
+    void serialize( Archive&amp; ar, const unsigned int version )
+    {
+        ar &amp; boost::serialization::base_object&lt;Base&gt;( *this );
+        ...
+    }   
+};
 </pre>
-<p>So the difference from the normal map iterator is that</p>
-<ul class="simple">
-<li><tt class="docutils literal"><span class="pre">operator*()</span></tt> returns a reference to the mapped object (normally it returns a reference to a <tt class="docutils literal"><span class="pre">std::pair</span></tt>, and</li>
-<li>that the key can be accessed through the <tt class="docutils literal"><span class="pre">key()</span></tt> function.</li>
-</ul>
+<p>For details, see <a class="reference" href="../../serialization/doc/tutorial.html#derivedclasses">Derived Classes</a>.</p>
+</li>
+</ol>
+<ol class="arabic" start="3">
+<li><p class="first">You need to use <tt class="docutils literal"><span class="pre">BOOST_CLASS_EXPORT</span></tt> to register the
+derived classes in your class hierarchy:</p>
+<pre class="literal-block">
+BOOST_CLASS_EXPORT( Derived )
+</pre>
+<p>See <a class="reference" href="../../serialization/doc/traits.html#export">Export Key</a> and <a class="reference" href="../../serialization/doc/special.html">Object Tracking</a>
+for details.</p>
+</li>
+</ol>
+<p>Remember these three issues and it will save you a lot of trouble.</p>
+<!-- Map iterator operations
++++++++++++++++++++++++
+
+The map iterators are a bit different compared to the normal ones.  The 
+reason is that it is a bit clumsy to access the key and the mapped object 
+through i->first and i->second, and one tends to forget what is what. 
+Moreover, and more importantly, we also want to hide the pointer as much as possibble.
+The new style can be illustrated with a small example:: 
+
+    typedef ptr_map<string,int> map_t;
+    map_t  m;
+    m[ "foo" ] = 4; // insert pair
+    m[ "bar" ] = 5; // ditto
+    ...
+    for( map_t::iterator i = m.begin(); i != m.end(); ++i )
+    {
+             *i += 42; // add 42 to each value
+             cout << "value=" << *i << ", key=" << i.key() << "n";
+    } 
+    
+So the difference from the normal map iterator is that 
+
+- ``operator*()`` returns a reference to the mapped object (normally it returns a reference to a ``std::pair``, and
+- that the key can be accessed through the ``key()`` function.  -->
 </div>
 <div class="section">
 <h1><a id="class-nullable" name="class-nullable">Class <tt class="docutils literal"><span class="pre">nullable</span></tt></a></h1>
@@ -629,8 +747,9 @@
 does not make sense to do</p>
 <pre class="literal-block">
 boost::ptr_vector&lt; boost::nullable&lt;T&gt; &gt; vec;
-vec.push_back( new boost::nullable&lt;T&gt; ); // no no
-boost::nullable&lt;T&gt;&amp; ref = vec[0];        // also no no
+vec.push_back( 0 );                      // ok
+vec.push_back( new boost::nullable&lt;T&gt; ); // no no!
+boost::nullable&lt;T&gt;&amp; ref = vec[0];        // also no no!
 </pre>
 </div>
 <div class="section">
@@ -660,14 +779,32 @@
     };
 }
 </pre>
+</div>
+<div class="section">
+<h1><a id="disabling-the-use-of-exceptions" name="disabling-the-use-of-exceptions">Disabling the use of exceptions</a></h1>
+<p>As of version 1.34.0 of Boost, the library allows you to disable exceptions
+completely. This means the library is more fit for domains where exceptions
+are not used. Furthermore, it also speeds up a operations a little. Instead
+of throwing an exception, the library simply calls <a class="reference" href="../../utility/assert.html">BOOST_ASSERT</a>.</p>
+<p>To diable exceptions, simly define this macro before including any header:</p>
+<pre class="literal-block">
+#define BOOST_PTR_CONTAINER_NO_EXCEPTIONS 1
+#include &lt;boost/ptr_container/ptr_vector.hpp&gt;
+</pre>
+<p>It is, however, recommended that you define the macro on the command-line, so
+you are absolutely certain that all headers are compiled the same way. Otherwise
+you might end up breaking the One Definition Rule.</p>
+<p>If <tt class="docutils literal"><span class="pre">BOOST_NO_EXCEPTIONS</span></tt> is defined, then <tt class="docutils literal"><span class="pre">BOOST_PTR_CONTAINER_NO_EXCEPTIONS</span></tt>
+is also defined.</p>
+<hr><p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/reference.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/reference.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/reference.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,8 +9,8 @@
 =========
 
 The documentation is divided into a an explanation for 
-each container. All the common interface is explained only once,
-but links are always provided to the relevant links.
+each container. When containers have the same interface, that common interface is explained only once,
+but links are always provided to more relevant information.
 Please make sure you understand 
 the `Clonable <reference.html#the-clonable-concept>`_ concept and 
 the `Clone Allocator <reference.html#the-clone-allocator-concept>`_ concept. 
@@ -18,41 +18,67 @@
 - `Conventions <conventions.html>`_
 - `The Clonable concept`_
 - `The Clone Allocator concept`_
-- Class `reversible_ptr_container <reversible_ptr_container.html>`_
-- Class `associative_ptr_container <associative_ptr_container.html>`_
-- `Pointer container adapters`_
 
-  - `ptr_sequence_adapter <ptr_sequence_adapter.html>`_
-  - `ptr_set_adapter <ptr_set_adapter.html>`_
-  - `ptr_multiset_adapter <ptr_multiset_adapter.html>`_
-  - `ptr_map_adapter <ptr_map_adapter.html>`_
-  - `ptr_multimap_adapter <ptr_multimap_adapter.html>`_    
-- `Sequence containers`_
+- `Class hierarchy`_:
 
-  - `ptr_vector <ptr_vector.html>`_
-  - `ptr_deque <ptr_deque.html>`_
-  - `ptr_list <ptr_list.html>`_
-  - `ptr_array <ptr_array.html>`_
-- `Associative containers`_
+  - `reversible_ptr_container <reversible_ptr_container.html>`_
 
-  - `ptr_set <ptr_set.html>`_
-  - `ptr_multiset <ptr_multiset.html>`_
-  - `ptr_map <ptr_map.html>`_
-  - `ptr_multimap <ptr_multimap.html>`_
-- `Map iterator operations`_  
+    - `ptr_sequence_adapter <ptr_sequence_adapter.html>`_
+
+      - `ptr_vector <ptr_vector.html>`_
+      - `ptr_list <ptr_list.html>`_ 
+      - `ptr_deque <ptr_deque.html>`_
+      - `ptr_array <ptr_array.html>`_
+    
+    - `associative_ptr_container <associative_ptr_container.html>`_ 
+  
+      - `ptr_set_adapter <ptr_set_adapter.html>`_
+      - `ptr_multiset_adapter <ptr_multiset_adapter.html>`_
+      - `ptr_map_adapter <ptr_map_adapter.html>`_
+      - `ptr_multi_map_adapter <ptr_multimap_adapter.html>`_
+
+        - `ptr_set <ptr_set.html>`_
+        - `ptr_multi_set <ptr_multiset.html>`_ 
+        - `ptr_map <ptr_map.html>`_
+        - `ptr_multimap <ptr_multimap.html>`_
+      
+- `Serialization`_  
 - `Indirected functions <indirect_fun.html>`_  
 - `Class nullable`_     
-- `Exception classes`_         
+- `Exception classes`_   
+- `Disabling the use of exceptions`_      
 
 
+..
+	- Class `reversible_ptr_container <reversible_ptr_container.html>`_
+	- Class `associative_ptr_container <associative_ptr_container.html>`_
+	- `Pointer container adapters`_
+	
+	  - `ptr_sequence_adapter <ptr_sequence_adapter.html>`_
+	  - `ptr_set_adapter <ptr_set_adapter.html>`_
+	  - `ptr_multiset_adapter <ptr_multiset_adapter.html>`_
+	  - `ptr_map_adapter <ptr_map_adapter.html>`_
+	  - `ptr_multimap_adapter <ptr_multimap_adapter.html>`_    
+	- `Sequence containers`_
+	
+	  - `ptr_vector <ptr_vector.html>`_
+	  - `ptr_deque <ptr_deque.html>`_
+	  - `ptr_list <ptr_list.html>`_
+	  - `ptr_array <ptr_array.html>`_
+	- `Associative containers`_
+	
+	  - `ptr_set <ptr_set.html>`_
+	  - `ptr_multiset <ptr_multiset.html>`_
+	  - `ptr_map <ptr_map.html>`_
+	  - `ptr_multimap <ptr_multimap.html>`_
 
 
+
 The Clonable concept
 ++++++++++++++++++++
 
 **Refinement of**
 
-- Copy Constructible
 - Heap Allocable
 - Heap Deallocable
 
@@ -70,11 +96,11 @@
        
 **Valid expressions**
 
-===================================== =========================== ========================================================================================
-     **Expression**                          **Type**                  **Semantics**
-   ``new_clone(a);``                         ``T*``                  Allocate a new object that can be considered equivalent to the ``a`` object
+===================================== =========================== ======================================================================================== ===================================
+     **Expression**                          **Type**                  **Semantics**                                                                        **Postcondition**
+   ``new_clone(a);``                         ``T*``                  Allocate a new object that can be considered equivalent to the ``a`` object            ``typeid(*new_clone(a)) == typeid(a)``
    ``delete_clone(ptr);``                    ``void``                Deallocate an object previously allocated with ``allocate_clone()``. Must not throw 
-===================================== =========================== ========================================================================================
+===================================== =========================== ======================================================================================== ===================================
 
 
 Default implementation
@@ -102,7 +128,7 @@
 
 
 Notice that this implementation  makes normal Copy Constructible classes are automatically 
-Clonable unless ``operator new()`` or ``operator delete()`` are hidden.  
+Clonable unless ``operator new()`` or ``operator delete()`` are hidden. 
 
 The two functions represent a layer of indirection which is necessary to support 
 classes that are not Copy Constructible by default.  Notice that the implementation 
@@ -111,6 +137,8 @@
 the function is the boost namespace, but it can be placed together with 
 the rest of the interface of the class.  If you are implementing a class 
 inline in headers, remember to forward declare the functions.
+ 
+**Warning: We are considering to remove the default implementation above. Therefore always make sure that you overload the functions for your types and do not rely on the defaults in any way.**  
 
 The Clone Allocator concept
 +++++++++++++++++++++++++++
@@ -140,11 +168,14 @@
 
 **Valid expressions**
 
-====================================================== ============= ======================================================================================================================================================
-     **Expression**                                      **Type**                              **Semantics**
-  ``CloneAllocator::allocate_clone(a);``                   ``T*``                          Allocate a new object that can be considered equivalent to the ``a`` object      
-  ``CloneAllocator::deallocate_clone(ptr);``              ``void``                          Deallocate an object previously allocated with ``CloneAllocator::allocate_clone()`` or a compatible allocator. Must not throw.
-====================================================== ============= ======================================================================================================================================================
+============================================== ============= ============================================================================= =============================================================
+     **Expression**                              **Type**                              **Semantics**                                                                  **Postcondition**
+  ``CloneAllocator::allocate_clone(a);``          ``T*``             Allocate a new object that can be considered equivalent to the 
+                                                                     ``a`` object                                                          ``typeid(*CloneAllocator::allocate_clone(a)) == typeid(a)``
+  ``CloneAllocator::deallocate_clone(ptr);``     ``void``            Deallocate an object previously allocated with 
+                                                                     ``CloneAllocator::allocate_clone()`` or a compatible allocator. 
+								     Must not throw.
+============================================== ============= ============================================================================= =============================================================
 
 
 
@@ -211,13 +242,21 @@
         };
     }
 
-**See also**
+.. **See also**
 
-- `Changing the clone allocator <examples.html#changing-the-clone-allocator>`_
+  - `Changing the clone allocator <examples.html#changing-the-clone-allocator>`_
 
-Pointer container adapters
-++++++++++++++++++++++++++
+Class hierarchy
++++++++++++++++
 
+The library consists of the following types of classes:
+
+1. Pointer container adapters
+
+..
+
+2. Pointer containers
+
 The pointer container adapters are used when you
 want to make a pointer container starting from
 your own "normal" container. For example, you
@@ -227,79 +266,147 @@
 pointer container.
 
 The library provides an adapter for each type
-of standard container:
+of standard container highlighted as links below:
 
-- ptr_sequence_adapter_
-- ptr_set_adapter_
-- ptr_multiset_adapter_
-- ptr_map_adapter_
-- ptr_multimap_adapter_
+- ``reversible_ptr_container``
 
-.. _ptr_sequence_adapter: ptr_sequence_adapter.html
-.. _ptr_set_adapter: ptr_set_adapter.html
-.. _ptr_multiset_adapter: ptr_multiset_adapter.html
-.. _ptr_map_adapter: ptr_map_adapter.html
-.. _ptr_multimap_adapter: ptr_multimap_adapter.html
+  - `ptr_sequence_adapter <ptr_sequence_adapter.html>`_
 
+    - ``ptr_vector``
+    - ``ptr_list``
+    - ``ptr_deque``
+    - ``ptr_array`` 
+    
+  - ``associative_ptr_container``
+ 
+    - `ptr_set_adapter <ptr_set_adapter.html>`_
+    - `ptr_multiset_adapter <ptr_multiset_adapter.html>`_
+    - `ptr_map_adapter <ptr_map_adapter.html>`_
+    - `ptr_multi_map_adapter <ptr_multimap_adapter.html>`_
 
-Pointer containers
-++++++++++++++++++
+      - ``ptr_set``
+      - ``ptr_multi_set``
+      - ``ptr_map``
+      - ``ptr_multimap``
 
+
 The pointer containers of this library are all built using
-the `pointer container adapters`_. There is a pointer container
-for each type of "normal" standard container:
+the adapters. There is a pointer container
+for each type of "normal" standard container highlighted as links below.
 
-Sequence containers
--------------------
+- ``reversible_ptr_container``
 
-    - ptr_vector_
-    - ptr_deque_
-    - ptr_list_
-    - ptr_array_
+  - ``ptr_sequence_adapter``
 
-Associative containers
-----------------------
+    - `ptr_vector <ptr_vector.html>`_
+    - `ptr_list <ptr_list.html>`_ 
+    - `ptr_deque <ptr_deque.html>`_
+    - `ptr_array <ptr_array.html>`_
+    
+  - ``associative_ptr_container`` 
+  
+    - ``ptr_set_adapter``
+    - ``ptr_multiset_adapter``
+    - ``ptr_map_adapter``
+    - ``ptr_multi_map_adapter`` 
 
-    - ptr_set_
-    - ptr_multiset_
-    - ptr_map_
-    - ptr_multimap_   
-     
-.. _ptr_vector: ptr_vector.html
-.. _ptr_deque: ptr_deque.html
-.. _ptr_list: ptr_list.html
-.. _ptr_array: ptr_array.html
-.. _ptr_set: ptr_set.html
-.. _ptr_multiset: ptr_multiset.html
-.. _ptr_map: ptr_map.html
-.. _ptr_multimap: ptr_multimap.html
+      - `ptr_set <ptr_set.html>`_
+      - `ptr_multi_set <ptr_multiset.html>`_ 
+      - `ptr_map <ptr_map.html>`_
+      - `ptr_multimap <ptr_multimap.html>`_
 
+Serialization
++++++++++++++
 
-Map iterator operations
-+++++++++++++++++++++++
+As of version 1.34.0 of Boost, the library support
+serialization as defined by `Boost.Serialization`__.
 
-The map iterators are a bit different compared to the normal ones.  The 
-reason is that it is a bit clumsy to access the key and the mapped object 
-through i->first and i->second, and one tends to forget what is what. 
-Moreover, and more importantly, we also want to hide the pointer as much as possibble.
-The new style can be illustrated with a small example:: 
+.. __: ../../serialization/index.html
 
-    typedef ptr_map<string,int> map_t;
-    map_t  m;
-    m[ "foo" ] = 4; // insert pair
-    m[ "bar" ] = 5; // ditto
-    ...
-    for( map_t::iterator i = m.begin(); i != m.end(); ++i )
-    {
-             *i += 42; // add 42 to each value
-             cout << "value=" << *i << ", key=" << i.key() << "n";
-    } 
-    
-So the difference from the normal map iterator is that 
+Of course, for serialization to work it is required
+that the stored type itself is serializable. For maps, both
+the key type and the mapped type must be serializable.
 
-- ``operator*()`` returns a reference to the mapped object (normally it returns a reference to a ``std::pair``, and
-- that the key can be accessed through the ``key()`` function. 
+When dealing with serialization (and serialization of polymophic objects in particular), 
+pay special attention to these parts of Boost.Serialization:
 
+1. Output/saving requires a const-reference::
+
+	//
+	// serialization helper: we can't save a non-const object
+	// 
+	template< class T >
+	inline T const& as_const( T const& r )
+	{
+	    return r;
+	}
+	...
+	Container cont;
+
+	std::ofstream ofs("filename");
+	boost::archive::text_oarchive oa(ofs);
+	oa << as_const(cont);
+
+   See `Compile time trap when saving a non-const value`__ for
+   details.
+   
+.. __: ../../serialization/doc/rationale.html#trap
+
+2. Derived classes need to call ``base_object()`` function::
+
+	struct Derived : Base
+	{
+	    template< class Archive >
+	    void serialize( Archive& ar, const unsigned int version )
+	    {
+		ar & boost::serialization::base_object<Base>( *this );
+		...
+	    }	
+	};
+	
+   For details, see `Derived Classes`_.
+   
+.. _`Derived Classes`: ../../serialization/doc/tutorial.html#derivedclasses
+	    
+3. You need to use ``BOOST_CLASS_EXPORT`` to register the
+   derived classes in your class hierarchy::
+  
+	BOOST_CLASS_EXPORT( Derived )
+
+   See `Export Key`__ and `Object Tracking`_
+   for details.
+   
+.. __: ../../serialization/doc/traits.html#export 
+.. _`Object Tracking`: ../../serialization/doc/special.html
+	
+Remember these three issues and it will save you a lot of trouble.
+
+..
+	Map iterator operations
+	+++++++++++++++++++++++
+	
+	The map iterators are a bit different compared to the normal ones.  The 
+	reason is that it is a bit clumsy to access the key and the mapped object 
+	through i->first and i->second, and one tends to forget what is what. 
+	Moreover, and more importantly, we also want to hide the pointer as much as possibble.
+	The new style can be illustrated with a small example:: 
+	
+	    typedef ptr_map<string,int> map_t;
+	    map_t  m;
+	    m[ "foo" ] = 4; // insert pair
+	    m[ "bar" ] = 5; // ditto
+	    ...
+	    for( map_t::iterator i = m.begin(); i != m.end(); ++i )
+	    {
+		     *i += 42; // add 42 to each value
+		     cout << "value=" << *i << ", key=" << i.key() << "n";
+	    } 
+	    
+	So the difference from the normal map iterator is that 
+	
+	- ``operator*()`` returns a reference to the mapped object (normally it returns a reference to a ``std::pair``, and
+	- that the key can be accessed through the ``key()`` function. 
+
 Class ``nullable``
 ++++++++++++++++++
 
@@ -321,8 +428,9 @@
 does not make sense to do ::
 
     boost::ptr_vector< boost::nullable<T> > vec;
-    vec.push_back( new boost::nullable<T> ); // no no
-    boost::nullable<T>& ref = vec[0];        // also no no
+    vec.push_back( 0 );                      // ok
+    vec.push_back( new boost::nullable<T> ); // no no!
+    boost::nullable<T>& ref = vec[0];        // also no no!
 
 Exception classes
 +++++++++++++++++
@@ -352,9 +460,43 @@
                 bad_pointer( const char* what );
             };
         }
+	
+Disabling the use of exceptions
++++++++++++++++++++++++++++++++
 
+As of version 1.34.0 of Boost, the library allows you to disable exceptions
+completely. This means the library is more fit for domains where exceptions
+are not used. Furthermore, it also speeds up a operations a little. Instead
+of throwing an exception, the library simply calls `BOOST_ASSERT`__.
+
+.. __: ../../utility/assert.html
+
+To diable exceptions, simly define this macro before including any header::
+
+	#define BOOST_PTR_CONTAINER_NO_EXCEPTIONS 1
+	#include <boost/ptr_container/ptr_vector.hpp>
+	
+It is, however, recommended that you define the macro on the command-line, so
+you are absolutely certain that all headers are compiled the same way. Otherwise
+you might end up breaking the One Definition Rule.
+
+If ``BOOST_NO_EXCEPTIONS`` is defined, then ``BOOST_PTR_CONTAINER_NO_EXCEPTIONS``
+is also defined.
+
+.. raw:: html 
+
+        <hr>
+
+**Navigate:**
+
 - `home <ptr_container.html>`_
 
+.. raw:: html 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+        <hr>
 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+

Modified: boost/trunk/libs/ptr_container/doc/reversible_ptr_container.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/reversible_ptr_container.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/reversible_ptr_container.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.6 $
+:Date: $Date: 2006/11/22 22:01:03 $
+:Revision: $Revision: 1.6.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -293,6 +293,32 @@
 <h1><a id="class-reversible-ptr-container" name="class-reversible-ptr-container">Class <tt class="docutils literal"><span class="pre">reversible_ptr_container</span></tt></a></h1>
 <p>This class is not a real class that can be found in the library. 
 Its purpose is to present the general interface of all the pointer containers.</p>
+<p><strong>Hierarchy:</strong></p>
+<ul class="simple">
+<li><tt class="docutils literal"><span class="pre">reversible_ptr_container</span></tt><ul>
+<li><a class="reference" href="ptr_sequence_adapter.html">ptr_sequence_adapter</a><ul>
+<li><a class="reference" href="ptr_vector.html">ptr_vector</a></li>
+<li><a class="reference" href="ptr_list.html">ptr_list</a></li>
+<li><a class="reference" href="ptr_deque.html">ptr_deque</a></li>
+<li><a class="reference" href="ptr_array.html">ptr_array</a></li>
+</ul>
+</li>
+<li><a class="reference" href="associative_ptr_container.html">associative_ptr_container</a><ul>
+<li><a class="reference" href="ptr_set_adapter.html">ptr_set_adapter</a></li>
+<li><a class="reference" href="ptr_multiset_adapter.html">ptr_multiset_adapter</a></li>
+<li><a class="reference" href="ptr_map_adapter.html">ptr_map_adapter</a></li>
+<li><a class="reference" href="ptr_multimap_adapter.html">ptr_multi_map_adapter</a><ul>
+<li><a class="reference" href="ptr_set.html">ptr_set</a></li>
+<li><a class="reference" href="ptr_multiset.html">ptr_multi_set</a></li>
+<li><a class="reference" href="ptr_map.html">ptr_map</a></li>
+<li><a class="reference" href="ptr_multimap.html">ptr_multimap</a></li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
+</li>
+</ul>
 <p><strong>Navigate:</strong></p>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
@@ -352,13 +378,18 @@
         void      clear():
     
     public: // <a class="reference" href="#pointer-container-requirements">pointer container requirements</a>
-    
         auto_type                                replace( iterator position, T* x );
         template&lt; class U &gt;
         auto_type                                replace( iterator position, std::auto_ptr&lt;U&gt; x );    
         std::auto_ptr&lt;reversible_ptr_container&gt;  clone() const;    
         std::auto_ptr&lt;reversible_ptr_container&gt;  release();
         auto_type                                release( iterator position );
+        
+    public: // <a class="reference" href="#serialization">serialization</a>
+        template&lt; class Archive &gt;
+        void save( Archive&amp; ar, const unsigned version ) const;  
+        template&lt; class Archive &gt;
+        void load( Archive&amp; ar, const unsigned version );       
     
     }; //  class 'reversible_ptr_container'
 
@@ -446,12 +477,13 @@
 <li><tt class="docutils literal"><span class="pre">typedef</span> <span class="pre">...</span> <span class="pre">auto_type</span></tt></li>
 </ul>
 <p>This declaration hides a pointer pointer type. You can rely on the following
-operations:</p>
+operations</p>
 <pre class="literal-block">
 T* operator-&gt;() const;
 T&amp; operator*() const;
 T* release();
 ~auto_type();
+operator <em>implementation-defined bool</em>();
 </pre>
 <p>The destructor will delete the stored object. It might help to
 think it is just an <tt class="docutils literal"><span class="pre">std::auto_ptr&lt;T&gt;</span></tt>.</p>
@@ -626,10 +658,10 @@
 </ul>
 </blockquote>
 </li>
-<li><p class="first"><tt class="docutils literal"><span class="pre">template&lt;class</span> <span class="pre">U&gt;</span> <span class="pre">auto_type</span> <span class="pre">replace(</span> <span class="pre">iterator</span> <span class="pre">position,</span> <span class="pre">std::auto_ptr&lt;U&gt;</span> <span class="pre">x</span> <span class="pre">);</span></tt></p>
+<li><p class="first"><tt class="docutils literal"><span class="pre">template&lt;</span> <span class="pre">class</span> <span class="pre">U</span> <span class="pre">&gt;</span> <span class="pre">auto_type</span> <span class="pre">replace(</span> <span class="pre">iterator</span> <span class="pre">position,</span> <span class="pre">std::auto_ptr&lt;U&gt;</span> <span class="pre">x</span> <span class="pre">);</span></tt></p>
 <blockquote>
 <ul class="simple">
-<li>Effects: <tt class="docutils literal"><span class="pre">return</span> <span class="pre">replace(</span> <span class="pre">position,</span> <span class="pre">x.release()</span> <span class="pre">)</span></tt></li>
+<li>Effects: <tt class="docutils literal"><span class="pre">return</span> <span class="pre">replace(</span> <span class="pre">position,</span> <span class="pre">x.release()</span> <span class="pre">);</span></tt></li>
 </ul>
 </blockquote>
 </li>
@@ -703,11 +735,39 @@
 </blockquote>
 </li>
 </ul>
-<table class="docutils field-list" frame="void" rules="none">
+</div>
+<div class="section">
+<h2><a id="semantics-serialization" name="semantics-serialization"><span id="serialization"></span>Semantics: serialization</a></h2>
+<p>All containers can be serialized by means of
+<a class="reference" href="../../serialization/index.html">Boost.Serialization</a>. For an overview, see
+<a class="reference" href="reference.html#serialization">Serialization of Pointer Containers</a>.</p>
+<ul>
+<li><p class="first"><tt class="docutils literal"><span class="pre">template&lt;</span> <span class="pre">class</span> <span class="pre">Archive</span> <span class="pre">&gt;</span> <span class="pre">void</span> <span class="pre">save(</span> <span class="pre">Archive&amp;</span> <span class="pre">ar,</span> <span class="pre">const</span> <span class="pre">unsigned</span> <span class="pre">version</span> <span class="pre">)</span> <span class="pre">const;</span></tt></p>
+<blockquote>
+<ul class="simple">
+<li>Effects: Saves the container to the archive.</li>
+<li>Remarks: This function is called automatically be stream operators in
+Boost.Serialization</li>
+</ul>
+</blockquote>
+</li>
+<li><p class="first"><tt class="docutils literal"><span class="pre">template&lt;</span> <span class="pre">class</span> <span class="pre">Archive</span> <span class="pre">&gt;</span>
+<span class="pre">void</span> <span class="pre">load(</span> <span class="pre">Archive&amp;</span> <span class="pre">ar,</span> <span class="pre">const</span> <span class="pre">unsigned</span> <span class="pre">version</span> <span class="pre">);</span></tt></p>
+<blockquote>
+<ul class="simple">
+<li>Effects: Clears the container and then loads a new container from the archive.</li>
+<li>Remarks: This function is called automatically be stream operators in
+Boost.Serialization</li>
+<li>Exception safety: Basic guarantee</li>
+</ul>
+</blockquote>
+</li>
+</ul>
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/reversible_ptr_container.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/reversible_ptr_container.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/reversible_ptr_container.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,6 +10,29 @@
 This class is not a real class that can be found in the library. 
 Its purpose is to present the general interface of all the pointer containers.
 
+**Hierarchy:**
+
+- ``reversible_ptr_container``
+
+  - `ptr_sequence_adapter <ptr_sequence_adapter.html>`_
+
+    - `ptr_vector <ptr_vector.html>`_
+    - `ptr_list <ptr_list.html>`_ 
+    - `ptr_deque <ptr_deque.html>`_
+    - `ptr_array <ptr_array.html>`_
+    
+  - `associative_ptr_container <associative_ptr_container.html>`_ 
+  
+    - `ptr_set_adapter <ptr_set_adapter.html>`_
+    - `ptr_multiset_adapter <ptr_multiset_adapter.html>`_
+    - `ptr_map_adapter <ptr_map_adapter.html>`_
+    - `ptr_multi_map_adapter <ptr_multimap_adapter.html>`_
+
+      - `ptr_set <ptr_set.html>`_
+      - `ptr_multi_set <ptr_multiset.html>`_ 
+      - `ptr_map <ptr_map.html>`_
+      - `ptr_multimap <ptr_multimap.html>`_
+
 **Navigate:**
 
 - `home <ptr_container.html>`_
@@ -71,13 +94,18 @@
                 void      clear():
             
             public: // `pointer container requirements`_
-            
                 auto_type                                replace( iterator position, T* x );
 		template< class U >
 		auto_type                                replace( iterator position, std::auto_ptr<U> x );    
                 std::auto_ptr<reversible_ptr_container>  clone() const;    
                 std::auto_ptr<reversible_ptr_container>  release();
                 auto_type                                release( iterator position );
+		
+	    public: // `serialization`_
+	        template< class Archive >
+	        void save( Archive& ar, const unsigned version ) const;  
+	        template< class Archive >
+	        void load( Archive& ar, const unsigned version );	
             
             }; //  class 'reversible_ptr_container'
 
@@ -167,12 +195,15 @@
 - ``typedef ... auto_type``
 
 This declaration hides a pointer pointer type. You can rely on the following
-operations::
+operations 
 
+.. parsed-literal:: 
+
     T* operator->() const;
     T& operator*() const;
     T* release();
     ~auto_type();
+    operator *implementation-defined bool*\ ();
 
 The destructor will delete the stored object. It might help to
 think it is just an ``std::auto_ptr<T>``.
@@ -399,6 +430,41 @@
 
     - Returns: ``*i.base() == 0;``
 
+.. _`serialization`:
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+Semantics: serialization
+^^^^^^^^^^^^^^^^^^^^^^^^
 
+All containers can be serialized by means of
+`Boost.Serialization`__. For an overview, see
+`Serialization of Pointer Containers`_.
+
+.. __: ../../serialization/index.html
+.. _`Serialization of Pointer Containers`: reference.html#serialization
+
+- ``template< class Archive > void save( Archive& ar, const unsigned version ) const;``
+    
+    - Effects: Saves the container to the archive.
+  
+    - Remarks: This function is called automatically be stream operators in
+      Boost.Serialization
+	
+- ``template< class Archive >
+  void load( Archive& ar, const unsigned version );``	
+
+    - Effects: Clears the container and then loads a new container from the archive.
+  
+    - Remarks: This function is called automatically be stream operators in
+      Boost.Serialization
+	     
+    - Exception safety: Basic guarantee
+
+
+.. raw:: html 
+
+        <hr>
+
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+

Copied: boost/trunk/libs/ptr_container/doc/style.css (from rev 14034, boost/branches/upstream/current/libs/ptr_container/doc/style.css)

Modified: boost/trunk/libs/ptr_container/doc/todo.txt
===================================================================
--- boost/trunk/libs/ptr_container/doc/todo.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/todo.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,34 +1,83 @@
+#//
+#// Boost.Pointer Container
+#//
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+#//
+#// For more information, see http://www.boost.org/libs/ptr_container/
+#//
 
-2. add new ptr_map typedefs
+1. use splice() to speed up transfer for list
 
-3. remove ptr_map iterators description
+5. small usage exmaple with each class
 
-4. ptr_map definition
+10. update tutorial to show boost::assign link + auto_ptr
 
-5. small usage exmaple with each class
 
-7. update concept for clonable: typeid(x) == typeid(clone)
+11. should find_key() be added to ptr_map?
 
-8. use static class hierarchy to ease navigation
 
-9. guidelines on good OO programming:
 
-   1. base classes abstract
-  
-   2. make virtuals private
+13. transfer for set/map may need to
+be revisted (rg. !from.empty() precondition)
 
-   3. derive from boost::copyable
 
-   4. don't allow nulls if you can avoid it, Null Object
+15. Some of the headlines are too  big...
 
-10. update tutorial to show boost::assign link
 
-11. should find_key() be added to ptr_map?
+18. range-based sort() needs to be provided for list. use stable_sort for this purpose.
 
-12. serialization
 
-13. no exceptions
+19. use flat_set,flat_map internally when certain situations arise, eg. when the size of the objects
+    is small, eg. 4bytes (does this affect key=string?
 
 
 
- 
\ No newline at end of file
+21. map::at() should throw bad_index
+
+auto_type skal være converter-bar til std::auto_ptr<U>, if the deleter is
+trivial (heap_clone_allocator)
+
+(Spørg Thomas Witt om denne ændring can komme med...kan ikke ødelægge existerende kode, som
+vill have kaldt .release()) Kræve en hel del ambiguity resolution pga auto_ptr augument er
+templates og ikke non-templates! Desuden kan vi ikke bruge non-template argument, da alle
+converterings operatorer for auto_ptr tager en & argument og ikke en by-value!!! måske
+skal der blot et hack til, hvor vi tilføjer en ny ukenkt klasse og overloader kun for 
+den, og så laver en implicit konvertering til denne i static_move_ptr
+
+The easiert implementation would be to detect its presence in the
+body of the range based overloads and then dispatch to that implementation.
+
+
+22. hvor gode er kompilere til at optimere release() for en auto_ptr. Hvordan med move_ptr
+and auto_ptr interaction? Contracts må kunne fortælle kompileren at den skal
+genere optimeret kode
+
+template< class T >
+class auto_ptr
+{
+   T* get() const;
+
+   //
+   // this expresses that the constructor is a no-op if
+   // the condition is true. This might be useful in many other 
+   // context
+   //
+   ~auto_ptr()
+     precondition { if( get() == 0 ) return; }
+
+   T* release()
+    postcondition { get() == 0; }
+}
+
+...
+
+std::auto_ptr<T> p( new T );
+foo( p.release() );
+// don't generate destructor
+
+Does raw_storage iterator have an impact on in-place consrtcution
+
+

Modified: boost/trunk/libs/ptr_container/doc/tutorial.html
===================================================================
--- boost/trunk/libs/ptr_container/doc/tutorial.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/tutorial.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,8 +10,8 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:Date: $Date: 2006/03/10 09:14:55 $
-:Revision: $Revision: 1.5 $
+:Date: $Date: 2006/11/22 22:01:03 $
+:Revision: $Revision: 1.5.2.4 $
 :Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
@@ -303,6 +303,7 @@
 <li><a class="reference" href="#null-values">Null values</a></li>
 <li><a class="reference" href="#clonability">Clonability</a></li>
 <li><a class="reference" href="#new-functions">New functions</a></li>
+<li><a class="reference" href="#std-auto-ptr-u-overloads">std::auto_ptr&lt;U&gt; overloads</a></li>
 <li><a class="reference" href="#algorithms">Algorithms</a></li>
 </ul>
 <div class="section">
@@ -315,8 +316,9 @@
 class animal : <a class="reference" href="http://www.boost.org/libs/utility/utility.htm#Class_noncopyable">boost::noncopyable</a>
 {
 public:
-    virtual      ~animal() {}
-    virtual void eat() = 0;
+    virtual      ~animal()   {}
+    virtual void eat()       = 0;
+    virtual int  age() const = 0;
     // ...
 };
 
@@ -453,7 +455,23 @@
 animals[&quot;bobo&quot;].set_name(&quot;bobo&quot;);
 </pre>
 <p>This requires a default constructor for animals and
-a function to do the initialization, in this case <tt class="docutils literal"><span class="pre">set_name()</span></tt>;</p>
+a function to do the initialization, in this case <tt class="docutils literal"><span class="pre">set_name()</span></tt>.</p>
+<p>A better alternative is to use <a class="reference" href="../../assign/index.html">Boost.Assign</a>
+to help you out. In particular, consider</p>
+<ul class="simple">
+<li><a class="reference" href="../../assign/doc/index.html#ptr_push_back">ptr_push_back(), ptr_push_front(), ptr_insert() and ptr_map_insert()</a></li>
+<li><a class="reference" href="../../assign/doc/index.html#ptr_list_of">ptr_list_of()</a></li>
+</ul>
+<p>For example, the above insertion may now be written</p>
+<pre class="literal-block">
+boost::ptr_multimap&lt;std::string,animal&gt; animals;
+
+using namespace boost::assign;
+ptr_map_insert&lt;monkey&gt;( animals )( &quot;bobo&quot;, &quot;bobo&quot; );
+ptr_map_insert&lt;elephant&gt;( animals )( &quot;bobo&quot;, &quot;bobo&quot; );
+ptr_map_insert&lt;whale&gt;( animals )( &quot;anna&quot;, &quot;anna&quot; );
+ptr_map_insert&lt;emu&gt;( animals )( &quot;anna&quot;, &quot;anna&quot; );
+</pre>
 </div>
 <div class="section">
 <h1><a id="null-values" name="null-values">Null values</a></h1>
@@ -519,7 +537,7 @@
 another_zoo.assign( zoo.begin(), zoo.end() );
 </pre>
 <p>will fill another zoo with clones of the first zoo. Similarly,
-insert() can now insert clones into your pointer container</p>
+<tt class="docutils literal"><span class="pre">insert()</span></tt> can now insert clones into your pointer container</p>
 <pre class="literal-block">
 another_zoo.insert( another_zoo.begin(), zoo.begin(), zoo.end() );
 </pre>
@@ -542,7 +560,15 @@
 <p>You can think of <tt class="docutils literal"><span class="pre">auto_type</span></tt> as a non-copyable form of 
 <tt class="docutils literal"><span class="pre">std::auto_ptr</span></tt>. Notice that when you release an object, the
 pointer is removed from the container and the containers size
-shrinks. You can also release the entire container if you
+shrinks. For containers that store nulls, we can exploit that
+<tt class="docutils literal"><span class="pre">auto_type</span></tt> is convertible to <tt class="docutils literal"><span class="pre">bool</span></tt>:</p>
+<pre class="literal-block">
+if( ptr_vector&lt; nullable&lt;T&gt; &gt;::auto_type r = vec.pop_back() )
+{
+  ...
+}  
+</pre>
+<p>You can also release the entire container if you
 want to return it from a function</p>
 <pre class="literal-block">
 std::auto_ptr&lt; boost::ptr_deque&lt;animal&gt; &gt; get_zoo()
@@ -570,24 +596,26 @@
 zoo_type::auto_type old_animal = zoo.replace( zoo.begin(), new monkey(&quot;bibi&quot;) ); 
 zoo.replace( 2, old_animal.release() ); // for random access containers
 </pre>
-<p>A map is a little different to iterator over than standard maps.
+<p>A map is slightly different to iterator over than standard maps.
 Now we say</p>
 <pre class="literal-block">
 typedef boost::ptr_map&lt;std::string, boost::nullable&lt;animal&gt; &gt; animal_map;
 animal_map map;
 ...
-for( animal_map::iterator i = map.begin();
-     i != map.end(); ++i )
+for( animal_map::const_iterator i = map.begin(), e = map.end(); i != e; ++i )
 {
-    std::cout &lt;&lt; &quot;\n key: &quot; &lt;&lt; i.key();
+    std::cout &lt;&lt; &quot;\n key: &quot; &lt;&lt; i-&gt;first;
     std::cout &lt;&lt; &quot;\n age: &quot;;
     
     if( boost::is_null(i) )
         std::cout &lt;&lt; &quot;unknown&quot;;
     else
-        std::cout &lt;&lt; i-&gt;age(); 
+        std::cout &lt;&lt; i-&gt;second-&gt;age(); 
  }
 </pre>
+<p>Except for the check for null, this looks like it would with a normal map. But if <tt class="docutils literal"><span class="pre">age()</span></tt> had 
+not been a <tt class="docutils literal"><span class="pre">const</span></tt> member function,
+it would not have compiled.</p>
 <p>Maps can also be indexed with bounds-checking</p>
 <pre class="literal-block">
 try
@@ -601,6 +629,24 @@
 </pre>
 </div>
 <div class="section">
+<h1><a id="std-auto-ptr-u-overloads" name="std-auto-ptr-u-overloads"><tt class="docutils literal"><span class="pre">std::auto_ptr&lt;U&gt;</span></tt> overloads</a></h1>
+<p>Evetime there is a function that takes a <tt class="docutils literal"><span class="pre">T*</span></tt> parameter, there is
+also a function taking an <tt class="docutils literal"><span class="pre">std::auto_ptr&lt;U&gt;</span></tt> parameter. This is of course done
+to make the library intregrate seamless with <tt class="docutils literal"><span class="pre">std::auto_ptr</span></tt>. For example</p>
+<pre class="literal-block">
+std::ptr_vector&lt;Base&gt; vec;
+vec.push_back( new Base );
+</pre>
+<p>is complemented by</p>
+<pre class="literal-block">
+std::auto_ptr&lt;Derived&gt; p( new Derived );
+vec.push_back( p );   
+</pre>
+<p>Notice that the template argument for <tt class="docutils literal"><span class="pre">std::auto_ptr</span></tt> does not need to
+follow the template argument for <tt class="docutils literal"><span class="pre">ptr_vector</span></tt> as long as <tt class="docutils literal"><span class="pre">Derived*</span></tt>
+can be implicitly converted to <tt class="docutils literal"><span class="pre">Base*</span></tt>.</p>
+</div>
+<div class="section">
 <h1><a id="algorithms" name="algorithms">Algorithms</a></h1>
 <p>Unfortunately it is not possible to use pointer containers with
 mutating algorithms from the standard library. However,
@@ -631,18 +677,21 @@
 BOOST_ASSERT( another_zoo.empty() );    
 </pre>
 <p>That is all; now you have learned all the basics!</p>
+<hr><p><strong>See also</strong></p>
+<ul class="simple">
+<li><a class="reference" href="guidelines.html">Usage guidelines</a></li>
+<li><a class="reference" href="../../conversion/cast.htm#Polymorphic_castl">Cast utilities</a></li>
+</ul>
 <p><strong>Navigate</strong></p>
-<blockquote>
 <ul class="simple">
 <li><a class="reference" href="ptr_container.html">home</a></li>
 <li><a class="reference" href="examples.html">examples</a></li>
 </ul>
-</blockquote>
-<table class="docutils field-list" frame="void" rules="none">
+<hr><table class="docutils field-list" frame="void" rules="none">
 <col class="field-name" />
 <col class="field-body" />
 <tbody valign="top">
-<tr class="field"><th class="field-name">copyright:</th><td class="field-body">Thorsten Ottosen 2004-2005.</td>
+<tr class="field"><th class="field-name">Copyright:</th><td class="field-body">Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td>
 </tr>
 </tbody>
 </table>

Modified: boost/trunk/libs/ptr_container/doc/tutorial.rst
===================================================================
--- boost/trunk/libs/ptr_container/doc/tutorial.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/doc/tutorial.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,6 +21,7 @@
 * `Null values`_
 * `Clonability`_
 * `New functions`_
+* `std::auto_ptr<U> overloads`_
 * `Algorithms`_
 
 Basic usage
@@ -37,8 +38,9 @@
     class animal : `boost::noncopyable <http://www.boost.org/libs/utility/utility.htm#Class_noncopyable>`_
     {
     public:
-        virtual      ~animal() {}
-        virtual void eat() = 0;
+        virtual      ~animal()   {}
+        virtual void eat()       = 0;
+	virtual int  age() const = 0;
         // ...
     };
     
@@ -181,7 +183,25 @@
     animals["bobo"].set_name("bobo");
 
 This requires a default constructor for animals and
-a function to do the initialization, in this case ``set_name()``;
+a function to do the initialization, in this case ``set_name()``.
+
+A better alternative is to use `Boost.Assign <../../assign/index.html>`_
+to help you out. In particular, consider
+
+- `ptr_push_back(), ptr_push_front(), ptr_insert() and ptr_map_insert() <../../assign/doc/index.html#ptr_push_back>`_
+
+- `ptr_list_of() <../../assign/doc/index.html#ptr_list_of>`_
+
+For example, the above insertion may now be written ::
+	
+     boost::ptr_multimap<std::string,animal> animals;
+
+     using namespace boost::assign;
+     ptr_map_insert<monkey>( animals )( "bobo", "bobo" );
+     ptr_map_insert<elephant>( animals )( "bobo", "bobo" );
+     ptr_map_insert<whale>( animals )( "anna", "anna" );
+     ptr_map_insert<emu>( animals )( "anna", "anna" );
+					
     
 Null values
 -----------
@@ -249,7 +269,7 @@
     another_zoo.assign( zoo.begin(), zoo.end() );
 
 will fill another zoo with clones of the first zoo. Similarly,
-insert() can now insert clones into your pointer container ::
+``insert()`` can now insert clones into your pointer container ::
 
     another_zoo.insert( another_zoo.begin(), zoo.begin(), zoo.end() );
 
@@ -273,7 +293,15 @@
 You can think of ``auto_type`` as a non-copyable form of 
 ``std::auto_ptr``. Notice that when you release an object, the
 pointer is removed from the container and the containers size
-shrinks. You can also release the entire container if you
+shrinks. For containers that store nulls, we can exploit that
+``auto_type`` is convertible to ``bool``::
+
+    if( ptr_vector< nullable<T> >::auto_type r = vec.pop_back() )
+    {
+      ...
+    }  
+
+You can also release the entire container if you
 want to return it from a function ::
 
     std::auto_ptr< boost::ptr_deque<animal> > get_zoo()
@@ -302,23 +330,26 @@
     zoo_type::auto_type old_animal = zoo.replace( zoo.begin(), new monkey("bibi") ); 
     zoo.replace( 2, old_animal.release() ); // for random access containers
 
-A map is a little different to iterator over than standard maps.
+A map is slightly different to iterator over than standard maps.
 Now we say ::
 
     typedef boost::ptr_map<std::string, boost::nullable<animal> > animal_map;
     animal_map map;
     ...
-    for( animal_map::iterator i = map.begin();
-         i != map.end(); ++i )
+    for( animal_map::const_iterator i = map.begin(), e = map.end(); i != e; ++i )
     {
-        std::cout << "\n key: " << i.key();
+        std::cout << "\n key: " << i->first;
         std::cout << "\n age: ";
         
         if( boost::is_null(i) )
             std::cout << "unknown";
         else
-            std::cout << i->age(); 
+            std::cout << i->second->age(); 
      }
+
+Except for the check for null, this looks like it would with a normal map. But if ``age()`` had 
+not been a ``const`` member function,
+it would not have compiled.
             
 Maps can also be indexed with bounds-checking ::
 
@@ -331,6 +362,25 @@
         // "bobo" not found
     }        
 
+``std::auto_ptr<U>`` overloads
+------------------------------
+
+Evetime there is a function that takes a ``T*`` parameter, there is
+also a function taking an ``std::auto_ptr<U>`` parameter. This is of course done
+to make the library intregrate seamless with ``std::auto_ptr``. For example ::
+
+  std::ptr_vector<Base> vec;
+  vec.push_back( new Base );
+  
+is complemented by ::
+
+  std::auto_ptr<Derived> p( new Derived );
+  vec.push_back( p );  	
+
+Notice that the template argument for ``std::auto_ptr`` does not need to
+follow the template argument for ``ptr_vector`` as long as ``Derived*``
+can be implicitly converted to ``Base*``.
+
 Algorithms
 ----------
 
@@ -367,11 +417,26 @@
          
 That is all; now you have learned all the basics!
 
+.. raw:: html 
+
+        <hr>
+	
+**See also**
+
+- `Usage guidelines <guidelines.html>`_ 
+
+- `Cast utilities <../../conversion/cast.htm#Polymorphic_castl>`_
+
 **Navigate**
 
-  - `home <ptr_container.html>`_
-  - `examples <examples.html>`_
+- `home <ptr_container.html>`_
+- `examples <examples.html>`_
 
+.. raw:: html 
 
-:copyright:     Thorsten Ottosen 2004-2005. 
+        <hr>
 
+:Copyright:     Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+

Copied: boost/trunk/libs/ptr_container/doc/tutorial_example.html (from rev 14034, boost/branches/upstream/current/libs/ptr_container/doc/tutorial_example.html)

Modified: boost/trunk/libs/ptr_container/index.html
===================================================================
--- boost/trunk/libs/ptr_container/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,7 +11,10 @@
 <body>
 Automatic redirection failed, please go to
 <a href="doc/ptr_container.html">doc/pointer_container.html</a>
+<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
-</html></body>
-</html>
-
+</html>
\ No newline at end of file

Deleted: boost/trunk/libs/ptr_container/test/Jamfile
===================================================================
--- boost/trunk/libs/ptr_container/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,54 +0,0 @@
-#
-# Boost.Pointer Container
-#
-#  Copyright Thorsten Ottosen 2003-2005. Use, modification and
-#  distribution is subject to the Boost Software License, Version
-#  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-#  http://www.boost.org/LICENSE_1_0.txt)
-#
-# For more information, see http://www.boost.org/libs/ptr_container/
-#
-
-subproject libs/ptr_container/test ;
-
-import testing ;
-import ../../serialization/build/serialization ;
-
-rule sc-test ( name : requirements * )
-{
-    return [ 
-      run $(name).cpp 
-      <lib>../../test/build/boost_unit_test_framework
-      : : :
-           ]
-    ;
-}
-
-rule sc-serialization-test ( name : requirements * )
-{
-    return [ 
-      run $(name).cpp 
-      <lib>../../test/build/boost_unit_test_framework
-      <lib>../../serialization/build/boost_serialization
-      : : :
-        toolset::require-boost-spirit-support   ]
-    ;
-}
-
-
-test-suite ptr_container :
-    [ sc-test ptr_vector ]
-    [ sc-test ptr_list ]
-    [ sc-test ptr_deque ]
-    [ sc-test ptr_set ]  
-    [ sc-test ptr_map ]
-    [ sc-test ptr_array : <vacpp><*><build>no ]
-    [ sc-test tree_test ]   
-    [ sc-test incomplete_type_test ]
-    [ sc-test view_example ]
-    [ sc-test iterator_test ]
-    [ sc-test tut1 ]   
-    [ sc-test indirect_fun ]
-    [ sc-serialization-test serialization ]
-    [ sc-test no_exceptions ]
-    ;

Modified: boost/trunk/libs/ptr_container/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/ptr_container/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
 rule sc-test ( name : extra-sources * )
 {
     return [ 
-      run $(name).cpp /boost/test//boost_unit_test_framework $(extra-sources) ]
+      run $(name).cpp /boost/test//boost_unit_test_framework/<link>static $(extra-sources) ]
     ;
 }
 

Modified: boost/trunk/libs/ptr_container/test/ptr_map.cpp
===================================================================
--- boost/trunk/libs/ptr_container/test/ptr_map.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/test/ptr_map.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -325,9 +325,13 @@
     map_type::reference        a_reference  = *m2.begin();
     a_reference.second->foo();
     map_type::const_reference  a_creference = *const_begin(m2);
-    map_type::pointer          a_pointer    = &*m2.begin();
-    a_pointer->second->foo();
-    map_type::const_pointer    a_cpointer   = &*const_begin(m2);
+    //
+    // @remark: taking the adress of an rvalue is not valid, thought
+    //          many compilers accept it.
+    //
+    // map_type::pointer          a_pointer    = &*m2.begin();
+    //a_pointer->second->foo();
+    //map_type::const_pointer    a_cpointer   = &*const_begin(m2);
    
     //
     //

Modified: boost/trunk/libs/ptr_container/test/serialization.cpp
===================================================================
--- boost/trunk/libs/ptr_container/test/serialization.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/ptr_container/test/serialization.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -125,7 +125,10 @@
     BOOST_CHECK_EQUAL( vec.size(), vec2.size() );
     BOOST_CHECK_EQUAL( (*vec2.begin()).i, -1 );
     BOOST_CHECK_EQUAL( (*--vec2.end()).i, 0 );
-    BOOST_CHECK_EQUAL( dynamic_cast<Derived&>(*--vec2.end()).i2, 1 );
+    typename Cont::iterator i = vec2.end();
+    --i;
+    Derived* d = dynamic_cast<Derived*>( &*i ); 
+    BOOST_CHECK_EQUAL( d->i2, 1 );
 }
 
 template< class Map >
@@ -153,7 +156,9 @@
     BOOST_CHECK_EQUAL( m.size(), m2.size() );
     BOOST_CHECK_EQUAL( m2.find(key1)->second->i, -1 );
     BOOST_CHECK_EQUAL( m2.find(key2)->second->i, 0 );
-    BOOST_CHECK_EQUAL( dynamic_cast<Derived&>( *m2.find(key2)->second ).i2, 1 );
+    typename Map::iterator i = m2.find(key2);
+    Derived* d = dynamic_cast<Derived*>( i->second ); 
+    BOOST_CHECK_EQUAL( d->i2, 1 );
     
 }
 

Deleted: boost/trunk/libs/python/build/Jamfile
===================================================================
--- boost/trunk/libs/python/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,100 +0,0 @@
-#  (C) Copyright David Abrahams 2001. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears
-#  in all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
-#
-# Boost.Python library Jamfile
-
-
-# declare the location of this subproject relative to the root
-subproject libs/python/build ;
-
-# bring in the rules for python
-import python ;
-
-if [ check-python-config ]
-{
-    
-  local bpl-linkflags ;
-
-  if $(UNIX) && ( $(OS) = AIX )
-  {
-      bpl-linkflags = <linkflags>"-e initlibboost_python" ;
-  }
-
-  # Enabling intrinsics (/0i) or maximize speed (/02) seem to cause
-  # internal compiler errors with this toolset.
-  local msvc-stlport-workarounds
-    = <optimization>off "<cxxflags>-Ogty -O1 -Gs" ;
-    
-  local sources =
-    numeric.cpp
-    list.cpp
-    long.cpp
-    dict.cpp
-    tuple.cpp
-    str.cpp
-    slice.cpp
-
-    aix_init_module.cpp
-    converter/from_python.cpp
-    converter/registry.cpp
-    converter/type_id.cpp
-    object/enum.cpp
-    object/class.cpp
-    object/function.cpp
-    object/inheritance.cpp
-    object/life_support.cpp
-    object/pickle_support.cpp
-    errors.cpp
-    module.cpp
-    converter/builtin_converters.cpp
-    converter/arg_to_python_base.cpp
-    object/iterator.cpp
-    object/stl_iterator.cpp
-    object_protocol.cpp
-    object_operators.cpp
-    wrapper.cpp
-    exec.cpp
-    import.cpp
-    ;
-  
-  dll boost_python
-    : ../src/$(sources)
-    : $(BOOST_PYTHON_V2_PROPERTIES)
-      <define>BOOST_PYTHON_SOURCE
-      $(bpl-linkflags)
-        <msvc-stlport><release>$(msvc-stlport-workarounds)
-        <darwin><*><linkflags>-bind_at_load
-        <gcc-3_3-darwin><*><linkflags>-bind_at_load
-        <gcc><*><linkflags>-lpython$(PYTHON_VERSION)
-      ;
-
-  template extension
-    : <dll>boost_python
-    : <sysinclude>../../..
-    ;
-  
-  lib boost_python
-    : # sources
-      ../src/$(sources)
-        
-    : # requirements
-      $(BOOST_PYTHON_V2_PROPERTIES)
-      <define>BOOST_PYTHON_SOURCE
-      <define>BOOST_STATIC_LIB
-      $(bpl-linkflags)
-        <msvc-stlport><release>$(msvc-stlport-workarounds)
-      ;
-
-  stage bin-stage : <dll>boost_python <lib>boost_python
-    : <tag><debug>"_debug"
-      <tag><debug-python>"_pydebug"
-    :
-        debug release
-    ;
-
-  install python lib
-    : <dll>boost_python <lib>boost_python
-    ;
-}

Modified: boost/trunk/libs/python/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/python/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright David Abrahams 2001-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)
+
 import os ;
 import modules ;
 
@@ -8,21 +12,6 @@
 
 project boost/python
     : source-location ../src
-        : requirements 
-	#<include>$(PYTHON_PATH)/include
-        #  $(lib_condition)<library-path>$(PYTHON_PATH)/libs
-        #    <link>shared:<library>$(PYTHON_LIB)
-        #    <define>$(defines)
-        #: usage-requirements # requirement that will be propageted to *users* of this library
-        #  <include>$(PYTHON_PATH)/include
-
-# We have a bug which causes us to conclude that conditionalized
-# properties in this section are not free.
-#          $(lib_condition)<library-path>$(PYTHON_PATH)/lib/python2.2/config
-#            <shared>true:<find-library>$(PYTHON_LIB)
-            
-        # <library-path>$(PYTHON_PATH)/lib/python2.2/config
-        #    <library>$(PYTHON_LIB)
     ;
 
 lib boost_python
@@ -59,7 +48,21 @@
     :   # requirements
         <link>static:<define>BOOST_PYTHON_STATIC_LIB 
         <define>BOOST_PYTHON_SOURCE
-     	<library>/python//python
+      
+        # On Windows, all code using Python has to link to the Python
+        # import library.
+        #
+        # On *nix we never link libboost_python to libpython.  When
+        # extending Python, all Python symbols are provided by the
+        # Python interpreter executable.  When embedding Python, the
+        # client executable is expected to explicitly link to
+        # /python//python (the target representing libpython) itself.
+        #
+        # python_for_extensions is a target defined by Boost.Build to
+        # provide the Python include paths, and on Windows, the Python
+        # import library, as usage requirements.
+        <library>/python//python_for_extensions
+      
     :   # default build
         <link>shared
     :   # usage requirements

Modified: boost/trunk/libs/python/doc/PyConDC_2003/bpl.html
===================================================================
--- boost/trunk/libs/python/doc/PyConDC_2003/bpl.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/PyConDC_2003/bpl.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,11 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 3.2//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/PyConDC_2003/bpl.txt
===================================================================
--- boost/trunk/libs/python/doc/PyConDC_2003/bpl.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/PyConDC_2003/bpl.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,5 @@
+.. 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 has been moved to http://www.boost-consulting.com/writing/bpl.txt.

Modified: boost/trunk/libs/python/doc/PyConDC_2003/bpl_mods.txt
===================================================================
--- boost/trunk/libs/python/doc/PyConDC_2003/bpl_mods.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/PyConDC_2003/bpl_mods.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+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 is a comment. Note how any initial comments are moved by
    transforms to after the document title, subtitle, and docinfo.
 
@@ -23,7 +27,7 @@
           Somerville, MA 02143
 :Contact: dave at boost-consulting.com
 :organization: `Boost Consulting`_
-:date: $Date: 2005/02/27 17:28:12 $
+:date: $Date: 2006/09/11 22:27:25 $
 :status: This is a "work in progress"
 :version: 1
 :copyright: Copyright David Abrahams 2002. All rights reserved

Modified: boost/trunk/libs/python/doc/PyConDC_2003/default.css
===================================================================
--- boost/trunk/libs/python/doc/PyConDC_2003/default.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/PyConDC_2003/default.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,12 @@
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:date: $Date: 2003/01/10 15:11:05 $
-:version: $Revision: 1.1 $
+:date: $Date: 2006/09/20 22:49:18 $
+:version: $Revision: 1.1.20.1 $
 :copyright: This stylesheet has been placed in the public domain.
 
+boostinspect:nolicense
+
 Default cascading style sheet for the HTML output of Docutils.
 */
 

Modified: boost/trunk/libs/python/doc/boost.css
===================================================================
--- boost/trunk/libs/python/doc/boost.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/boost.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+/* 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)
+*/
 H1
 {
     FONT-SIZE: 200%

Modified: boost/trunk/libs/python/doc/building.html
===================================================================
--- boost/trunk/libs/python/doc/building.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/building.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=
@@ -63,11 +66,9 @@
     <hr>
 
     <h2><a name="requirements">Requirements</a></h2>
-    <b>Boost.Python</b> version 2 requires <a href=
+    <b>Boost.Python</b> requires <a href=
     "http://www.python.org/2.2">Python 2.2</a> <i>or <a href=
-    "http://www.python.org">newer</a></i>. An unsupported archive of
-    Boost.Python version 1, which works with versions of Python since 1.5.2,
-    is available <a href="../build/python_v1.zip">here</a>. 
+    "http://www.python.org">newer</a></i>. 
 
     <h2><a name="building">Building Boost.Python</a></h2>
 

Modified: boost/trunk/libs/python/doc/index.html
===================================================================
--- boost/trunk/libs/python/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/news.html
===================================================================
--- boost/trunk/libs/python/doc/news.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/news.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
 <head>
   <meta name="generator" content=
@@ -42,7 +45,7 @@
 
         <li>Support for converting <code>void*</code> to/from python,
         with <code><a
-        href="v2/opaque_pointer_converter.html">opaque_pointer_converter</a></code>
+        href="v2/opaque.html">opaque_pointer_converter</a></code>
         as the return value policy.  Thanks to Niall Douglas for the
         initial patch.
       </ul>
@@ -216,7 +219,7 @@
 
     <dd><a href="mailto:Gottfried.Ganssauge-at-haufe.de">Gottfried
     Gan&szlig;auge</a> has contributed <a href=
-    "v2/opaque_pointer_converter.html">opaque pointer support</a>.<br>
+    "v2/opaque.html">opaque pointer support</a>.<br>
     <a href="mailto:nicodemus-at-globalite.com.br">Bruno da Silva de
     Oliveira</a> has contributed the exciting <a href=
     "../pyste/index.html">Pyste</a> ("Pie-steh") package.</dd>

Modified: boost/trunk/libs/python/doc/polymorphism.txt
===================================================================
--- boost/trunk/libs/python/doc/polymorphism.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/polymorphism.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+.. 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)
+
 How Runtime Polymorphism is expressed in Boost.Python:
 -----------------------------------------------------
 

Modified: boost/trunk/libs/python/doc/projects.html
===================================================================
--- boost/trunk/libs/python/doc/projects.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/projects.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
 <head>
   <meta name="generator" content=
@@ -304,7 +307,7 @@
       <p>The SourceForge cctbx project is organized in modules to facilitate
       use in non-crystallographic applications. The scitbx module implements
       a general purpose array family for scientific applications and pure C++
-      ports of FFTPACK and the LBFGS conjugate gradient minimizer.</p>
+      ports of FFTPACK and the L-BFGS quasi-Newton minimizer.</p>
     </dd>
 
     <dt><a href="http://www.llnl.gov/CASC/emsolve"><b>EMSolve</b></a></dt>

Modified: boost/trunk/libs/python/doc/support.html
===================================================================
--- boost/trunk/libs/python/doc/support.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/support.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/tutorial/doc/Jamfile.v2
===================================================================
--- boost/trunk/libs/python/doc/tutorial/doc/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/tutorial/doc/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+# Copyright Joel de Guzman 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)
 project boost/libs/python/doc/tutorial/doc ;
 
 import boostbook : boostbook ;

Modified: boost/trunk/libs/python/doc/tutorial/doc/html/boostbook.css
===================================================================
--- boost/trunk/libs/python/doc/tutorial/doc/html/boostbook.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/tutorial/doc/html/boostbook.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,23 +23,24 @@
 
     p 
     {
-        text-align: justify;
-        font-size: 11pt; 
-        line-height: 1.2;
+        text-align: left;
+        font-size: 10pt; 
+        line-height: 1.15;
     }
 
 /*=============================================================================
     Program listings
 =============================================================================*/
 
-    tt.computeroutput
+    /* Code on paragraphs */
+    p tt.computeroutput
     {
-        font-size: 10pt;
+        font-size: 9pt;
     }
 
     pre.synopsis
     {
-        font-size: 10pt;
+        font-size: 90%;
         margin: 1pc 4% 0pc 4%;
         padding: 0.5pc 0.5pc 0.5pc 0.5pc;
     }
@@ -47,32 +48,36 @@
     .programlisting, 
     .screen
     {
-        font-size: 10pt;
+        font-size: 9pt;
         display: block;
         margin: 1pc 4% 0pc 4%;
         padding: 0.5pc 0.5pc 0.5pc 0.5pc;
     }
 
+    /* Program listings in tables don't get borders */
+    td .programlisting, 
+    td .screen
+    {
+        margin: 0pc 0pc 0pc 0pc;
+        padding:  0pc 0pc 0pc 0pc;
+    }
+
 /*=============================================================================
     Headings
 =============================================================================*/
 
-    h1, 
-    h2, 
-    h3, 
-    h4, 
-    h5, 
-    h6 
+    h1, h2, h3, h4, h5, h6 
     { 
         text-align: left; 
-        margin-top: 2pc; 
+        margin: 1em 0em 0.5em 0em;
+        font-weight: bold;
     }
 
-    h1 { font: 170% }
+    h1 { font: 140% }
     h2 { font: bold 140% }
-    h3 { font: bold 120% }
-    h4 { font: bold 100% }
-    h5 { font: italic 100% }
+    h3 { font: bold 130% }
+    h4 { font: bold 120% }
+    h5 { font: italic 110% }
     h6 { font: italic 100% }
 
     /* Top page titles */
@@ -89,33 +94,62 @@
         margin-bottom: 1pc;
     }
 
-    h1.title { font-size: 220% }
-    h2.title { font-size: 220% }
-    h3.title { font-size: 170% }
-    h4.title { font-size: 140% }
-    h5.title { font-size: 120% }
-    h6.title { font-size: 120% }
+    h1.title { font-size: 140% }
+    h2.title { font-size: 140% }
+    h3.title { font-size: 130% }
+    h4.title { font-size: 120% }
+    h5.title { font-size: 110% }
+    h6.title { font-size: 100% }
 
+    .section h1 
+    {
+        margin: 0em 0em 0.5em 0em;
+        font-size: 140%;
+    }
+
+    .section h2 { font-size: 140% }
+    .section h3 { font-size: 130% }
+    .section h4 { font-size: 120% }
+    .section h5 { font-size: 110% }
+    .section h6 { font-size: 100% }
+
+    /* Code on titles */
+    h1 tt.computeroutput { font-size: 140% }
+    h2 tt.computeroutput { font-size: 140% }
+    h3 tt.computeroutput { font-size: 130% }
+    h4 tt.computeroutput { font-size: 120% }
+    h5 tt.computeroutput { font-size: 110% }
+    h6 tt.computeroutput { font-size: 100% }
+
 /*=============================================================================
+    Author
+=============================================================================*/
+
+    h3.author 
+    { 
+        font-size: 100% 
+    }
+
+/*=============================================================================
     Lists
 =============================================================================*/
 
     li
     {
-        font-size: 11pt;
+        font-size: 10pt;
         line-height: 1.3;
     }
     
     /* Unordered lists */
     ul 
     {
-        text-align: justify;
+        text-align: left;
     }
     
     /* Ordered lists */
     ol 
     {
-        text-align: justify;
+        text-align: left;
     }
 
 /*=============================================================================
@@ -159,9 +193,9 @@
     .toc
     {
        margin: 1pc 4% 0pc 4%;
-       padding: 0.5pc;
-       font-size: 11pt; 
-       line-height: 1.3;
+       padding: 0.1pc 1pc 0.1pc 1pc;
+       font-size: 80%; 
+       line-height: 1.15;
     }
     
     .boost-toc
@@ -180,7 +214,6 @@
         margin-left: 4%;
         padding-right: 0.5em; 
         padding-left: 0.5em;
-        font-size: 120%;
     }
     
     .informaltable table, 
@@ -202,8 +235,8 @@
     div.table table tr td
     {
         padding: 0.5em;
-        text-align: justify;
-        font-size: 11pt;
+        text-align: left;
+        font-size: 9pt;
     }
 
     div.informaltable table tr th, 
@@ -211,51 +244,76 @@
     {
         padding: 0.5em 0.5em 0.5em 0.5em;
         border: 1pt solid white;
+        font-size: 80%;
     }
 
 /*=============================================================================
     Blurbs
 =============================================================================*/
 
-    div.informaltable table tr td.blurb
+    div.note,
+    div.tip,
+    div.important,
+    div.caution,
+    div.warning,
+    p.blurb
     {
-        font-size: 10pt; /* A little bit smaller than the main text */
+        font-size: 9pt; /* A little bit smaller than the main text */
         line-height: 1.2;
+        display: block;
+        margin: 1pc 4% 0pc 4%;
+        padding: 0.5pc 0.5pc 0.5pc 0.5pc;
     }
     
-    td.blurb img
+    p.blurb img
     {
         padding: 1pt;
     }
 
 /*=============================================================================
-    Misc
+    Variable Lists
 =============================================================================*/
 
-    /* Tone down the title of Parameter lists */
-    div.variablelist p.title
+    /* Make the terms in definition lists bold */
+    div.variablelist dl dt,
+    span.term
     {
         font-weight: bold;
-        font-size: 100%;
+        font-size: 10pt;
+    }
+
+    div.variablelist table tbody tr td
+    {
         text-align: left;
+        vertical-align: top;
+        padding: 0em 2em 0em 0em;
+        font-size: 10pt;
+        margin: 0em 0em 0.5em 0em;
+        line-height: 1;
     }
-    
-    /* Tabularize parameter lists */
+
     div.variablelist dl dt
     {
-        float: left;
-        clear: left;
-        display: block;
-        font-style: italic;
+        margin-bottom: 0.2em;
     }
-    
+
     div.variablelist dl dd
     {
-        display: block;
-        clear:   right;
-        padding-left: 8pc;
+        margin: 0em 0em 0.5em 2em;
+        font-size: 10pt;
     }
 
+    div.variablelist table tbody tr td p,
+    div.variablelist dl dd p
+    {
+        margin: 0em 0em 0.5em 0em;
+        line-height: 1;
+    }
+
+/*=============================================================================
+    Misc
+=============================================================================*/
+
     /* Title of books and articles in bibliographies */
     span.title
     {
@@ -294,6 +352,14 @@
         {
             color: #9c5a9c;
         }
+
+        h1 a, h2 a, h3 a, h4 a, h5 a, h6 a,
+        h1 a:hover, h2 a:hover, h3 a:hover, h4 a:hover, h5 a:hover, h6 a:hover,
+        h1 a:visited, h2 a:visited, h3 a:visited, h4 a:visited, h5 a:visited, h6 a:visited
+        {
+            text-decoration: none; /* no underline */
+            color: #000000;
+        }
     
     /* Syntax Highlighting */
         .keyword        { color: #0000AA; }
@@ -322,41 +388,50 @@
     /* Program listing */
         pre.synopsis
         {
-            background-color: #F3F3F3;
-            border: 1pt solid #C0C0C0;
+            border: 1px solid #DCDCDC;
         }
     
         .programlisting, 
         .screen
         {
-            background-color: #F3F3F3;
-            border: 1pt solid #C0C0C0;
+            border: 1px solid #DCDCDC;
         }
     
+        td .programlisting, 
+        td .screen
+        {
+            border: 0px solid #DCDCDC;
+        }
+    
     /* Blurbs */
-        div.informaltable table tr td.blurb
+        div.note,
+        div.tip,
+        div.important,
+        div.caution,
+        div.warning,
+        p.blurb
         {
-            background-color: #FFFFF0;
-            border: 1pt solid #707070;
+            border: 1px solid #DCDCDC;
         }
     
     /* Table of contents */
         .toc
         {
-            background-color: #F3F3F3;
+            border: 1px solid #DCDCDC;
         }
     
     /* Tables */
         div.informaltable table tr td, 
         div.table table tr td
         {
-            background-color: #F0F0F0;
+            border: 1px solid #DCDCDC;
         }
     
         div.informaltable table tr th, 
         div.table table tr th
         {
-            background-color: #E4E4E4;
+            background-color: #F0F0F0;
+            border: 1px solid #DCDCDC;
         }
     
     /* Misc */
@@ -396,6 +471,12 @@
             border: 1px solid gray;
         }
     
+        td .programlisting, 
+        td .screen
+        {
+            border: 0px solid #DCDCDC;
+        }
+    
     /* Table of contents */
         .toc
         {

Modified: boost/trunk/libs/python/doc/tutorial/doc/html/index.html
===================================================================
--- boost/trunk/libs/python/doc/tutorial/doc/html/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/tutorial/doc/html/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
@@ -31,7 +34,7 @@
 <div><p class="copyright">Copyright © 2002-2005 Joel
       de Guzman, David Abrahams</p></div>
 <div><div class="legalnotice">
-<a name="id372676"></a><p>
+<a name="id376848"></a><p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">
         http://www.boost.org/LICENSE_1_0.txt </a>)
@@ -94,7 +97,7 @@
       (IDL).
     </p>
 <a name="quickstart.hello_world"></a><h2>
-<a name="id372867"></a>
+<a name="id447173"></a>
       Hello World
     </h2>
 <p>
@@ -139,7 +142,7 @@
 </div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><small><p>Last revised: February 14, 2006 at 02:23:06 GMT</p></small></td>
+<td align="left"><small><p>Last revised: August 31, 2006 at 05:59:58 GMT</p></small></td>
 <td align="right"><small></small></td>
 </tr></table>
 <hr>

Modified: boost/trunk/libs/python/doc/tutorial/doc/html/python/embedding.html
===================================================================
--- boost/trunk/libs/python/doc/tutorial/doc/html/python/embedding.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/tutorial/doc/html/python/embedding.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
@@ -40,7 +43,7 @@
       Python/C API at all. So stay tuned... <span class="inlinemediaobject"><img src="../images/smiley.png" alt="smiley"></span>
     </p>
 <a name="embedding.building_embedded_programs"></a><h2>
-<a name="id458605"></a>
+<a name="id462650"></a>
       Building embedded programs
     </h2>
 <p>
@@ -84,7 +87,7 @@
     &lt;find-library&gt;$(PYTHON_EMBEDDED_LIBRARY) ;
 </pre>
 <a name="embedding.getting_started"></a><h2>
-<a name="id458703"></a>
+<a name="id462747"></a>
       Getting started
     </h2>
 <p>
@@ -93,9 +96,7 @@
     </p>
 <div class="orderedlist"><ol type="1">
 <li>
-        
-#include
-         <tt class="literal">&lt;boost/python.hpp&gt;</tt><br><br>
+        #include <tt class="literal">&lt;boost/python.hpp&gt;</tt><br><br>
 </li>
 <li>
         Call <a href="http://www.python.org/doc/current/api/initialization.html#l2h-652" target="_top">Py_Initialize</a>()
@@ -131,7 +132,7 @@
         automate the process.
       </p>
 <a name="using_the_interpreter.reference_counting_handles_and_objects"></a><h2>
-<a name="id458870"></a>
+<a name="id462914"></a>
         Reference-counting handles and objects
       </h2>
 <p>
@@ -165,20 +166,17 @@
         a new reference is <a href="http://www.python.org/doc/current/api/veryhigh.html#l2h-55" target="_top">PyRun_String</a>
         which we'll discuss in the next section.
       </p>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> <span class="bold"><b>Handle is a class
-              <span class="emphasis"><em>template</em></span>, so why haven't we been using any template
-              parameters?</b></span><br> <br> <tt class="literal">handle</tt> has a
-              single template parameter specifying the type of the managed object.
-              This type is <tt class="literal">PyObject</tt> 99% of the time, so the parameter
-              was defaulted to <tt class="literal">PyObject</tt> for convenience. Therefore
-              we can use the shorthand <tt class="literal">handle&lt;&gt;</tt> instead
-              of the longer, but equivalent, <tt class="literal">handle&lt;PyObject&gt;</tt>.
-              </td></tr></tbody>
-</table></div>
+<p class="blurb">
+        <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> <span class="bold"><b>Handle is a class <span class="emphasis"><em>template</em></span>,
+        so why haven't we been using any template parameters?</b></span><br> <br>
+        <tt class="literal">handle</tt> has a single template parameter specifying the
+        type of the managed object. This type is <tt class="literal">PyObject</tt> 99%
+        of the time, so the parameter was defaulted to <tt class="literal">PyObject</tt>
+        for convenience. Therefore we can use the shorthand <tt class="literal">handle&lt;&gt;</tt>
+        instead of the longer, but equivalent, <tt class="literal">handle&lt;PyObject&gt;</tt>.
+      </p>
 <a name="using_the_interpreter.running_python_code"></a><h2>
-<a name="id459217"></a>
+<a name="id463241"></a>
         Running Python code
       </h2>
 <p>
@@ -201,7 +199,7 @@
       </p>
 <div class="informaltable">
 <h4>
-<a name="id459396"></a>
+<a name="id463420"></a>
           <span class="table-title">Start symbols</span>
         </h4>
 <table class="table">
@@ -274,18 +272,16 @@
         This should create a file called 'hello.txt' in the current directory containing
         a phrase that is well-known in programming circles.
       </p>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> <span class="bold"><b>Note</b></span> that
-              we wrap the return value of <a href="http://www.python.org/doc/current/api/veryhigh.html#l2h-55" target="_top">PyRun_String</a>
-              in a (nameless) <tt class="literal">handle</tt> even though we are not interested
-              in it. If we didn't do this, the the returned object would be kept
-              alive unnecessarily. Unless you want to be a Dr. Frankenstein, always
-              wrap <tt class="literal">PyObject*</tt>s in <tt class="literal">handle</tt>s.
-              </td></tr></tbody>
-</table></div>
+<p class="blurb">
+        <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> <span class="bold"><b>Note</b></span> that we wrap
+        the return value of <a href="http://www.python.org/doc/current/api/veryhigh.html#l2h-55" target="_top">PyRun_String</a>
+        in a (nameless) <tt class="literal">handle</tt> even though we are not interested
+        in it. If we didn't do this, the the returned object would be kept alive
+        unnecessarily. Unless you want to be a Dr. Frankenstein, always wrap <tt class="literal">PyObject*</tt>s
+        in <tt class="literal">handle</tt>s.
+      </p>
 <a name="using_the_interpreter.beyond_handles"></a><h2>
-<a name="id459921"></a>
+<a name="id463926"></a>
         Beyond handles
       </h2>
 <p>
@@ -331,17 +327,15 @@
 
 <span class="keyword">int</span> <span class="identifier">five_squared</span> <span class="special">=</span> <span class="identifier">extract</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">result</span><span class="special">);</span>
 </pre>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> <span class="bold"><b>Note</b></span> that
-              <tt class="literal">object</tt>'s member function to return the wrapped
-              <tt class="literal">PyObject*</tt> is called <tt class="literal">ptr</tt> instead
-              of <tt class="literal">get</tt>. This makes sense if you take into account
-              the different functions that <tt class="literal">object</tt> and <tt class="literal">handle</tt>
-              perform. </td></tr></tbody>
-</table></div>
+<p class="blurb">
+        <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> <span class="bold"><b>Note</b></span> that <tt class="literal">object</tt>'s
+        member function to return the wrapped <tt class="literal">PyObject*</tt> is called
+        <tt class="literal">ptr</tt> instead of <tt class="literal">get</tt>. This makes sense
+        if you take into account the different functions that <tt class="literal">object</tt>
+        and <tt class="literal">handle</tt> perform.
+      </p>
 <a name="using_the_interpreter.exception_handling"></a><h2>
-<a name="id460562"></a>
+<a name="id464549"></a>
         Exception handling
       </h2>
 <p>

Modified: boost/trunk/libs/python/doc/tutorial/doc/html/python/exception.html
===================================================================
--- boost/trunk/libs/python/doc/tutorial/doc/html/python/exception.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/tutorial/doc/html/python/exception.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">

Modified: boost/trunk/libs/python/doc/tutorial/doc/html/python/exposing.html
===================================================================
--- boost/trunk/libs/python/doc/tutorial/doc/html/python/exposing.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/tutorial/doc/html/python/exposing.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
@@ -379,13 +382,10 @@
         The <tt class="computeroutput"><span class="identifier">wrapper</span></tt> template makes
         the job of wrapping classes that are meant to overridden in Python, easier.
       </p>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/alert.png" alt="alert"></span> <span class="bold"><b>MSVC6/7 Workaround</b></span><br>
-              <br> If you are using Microsoft Visual C++ 6 or 7, you have to write
-              <tt class="computeroutput"><span class="identifier">f</span></tt> as:<br> <br>
-              <tt class="computeroutput"><span class="keyword">return</span> <span class="identifier">call</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="keyword">this</span><span class="special">-&gt;</span><span class="identifier">get_override</span><span class="special">(</span><span class="string">"f"</span><span class="special">).</span><span class="identifier">ptr</span><span class="special">());</span></tt>.</td></tr></tbody>
-</table></div>
+<p class="blurb">
+        <span class="inlinemediaobject"><img src="../images/alert.png" alt="alert"></span> <span class="bold"><b>MSVC6/7 Workaround</b></span><br>
+        <br> If you are using Microsoft Visual C++ 6 or 7, you have to write <tt class="computeroutput"><span class="identifier">f</span></tt> as:<br> <br> <tt class="computeroutput"><span class="keyword">return</span> <span class="identifier">call</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="keyword">this</span><span class="special">-&gt;</span><span class="identifier">get_override</span><span class="special">(</span><span class="string">"f"</span><span class="special">).</span><span class="identifier">ptr</span><span class="special">());</span></tt>.
+      </p>
 <p>
         BaseWrap's overridden virtual member function <tt class="computeroutput"><span class="identifier">f</span></tt>
         in effect calls the corresponding method of the Python object through <tt class="computeroutput"><span class="identifier">get_override</span></tt>.
@@ -403,14 +403,10 @@
         that the function <tt class="computeroutput"><span class="identifier">f</span></tt> is a
         pure virtual function.
       </p>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> <span class="bold"><b>member function and
-              methods</b></span><br> <br> Python, like many object oriented languages
-              uses the term <span class="bold"><b>methods</b></span>. Methods correspond
-              roughly to C++'s <span class="bold"><b>member functions</b></span>
-</td></tr></tbody>
-</table></div>
+<p class="blurb">
+        <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> <span class="bold"><b>member function and methods</b></span><br>
+        <br> Python, like many object oriented languages uses the term <span class="bold"><b>methods</b></span>. Methods correspond roughly to C++'s <span class="bold"><b>member functions</b></span>
+      </p>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
@@ -464,12 +460,11 @@
         we have to check if there is an override for <tt class="computeroutput"><span class="identifier">f</span></tt>.
         If none, then we call <tt class="computeroutput"><span class="identifier">Base</span><span class="special">::</span><span class="identifier">f</span><span class="special">()</span></tt>.
       </p>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/alert.png" alt="alert"></span> <span class="bold"><b>MSVC6/7 Workaround</b></span><br>
-              <br> If you are using Microsoft Visual C++ 6 or 7, you have to rewrite
-              the line with the <tt class="computeroutput"><span class="special">*</span><span class="identifier">note</span><span class="special">*</span></tt> as:<br> <br> <tt class="computeroutput"><span class="keyword">return</span> <span class="identifier">call</span><span class="special">&lt;</span><span class="keyword">char</span> <span class="keyword">const</span><span class="special">*&gt;(</span><span class="identifier">f</span><span class="special">.</span><span class="identifier">ptr</span><span class="special">());</span></tt>.</td></tr></tbody>
-</table></div>
+<p class="blurb">
+        <span class="inlinemediaobject"><img src="../images/alert.png" alt="alert"></span> <span class="bold"><b>MSVC6/7 Workaround</b></span><br>
+        <br> If you are using Microsoft Visual C++ 6 or 7, you have to rewrite
+        the line with the <tt class="computeroutput"><span class="special">*</span><span class="identifier">note</span><span class="special">*</span></tt> as:<br> <br> <tt class="computeroutput"><span class="keyword">return</span> <span class="identifier">call</span><span class="special">&lt;</span><span class="keyword">char</span> <span class="keyword">const</span><span class="special">*&gt;(</span><span class="identifier">f</span><span class="special">.</span><span class="identifier">ptr</span><span class="special">());</span></tt>.
+      </p>
 <p>
         Finally, exposing:
       </p>
@@ -516,7 +511,7 @@
 <div class="titlepage"><div><div><h3 class="title">
 <a name="python.class_operators_special_functions"></a>Class Operators/Special Functions</h3></div></div></div>
 <a name="class_operators_special_functions.python_operators"></a><h2>
-<a name="id448928"></a>
+<a name="id453009"></a>
         Python Operators
       </h2>
 <p>
@@ -565,7 +560,7 @@
         expressions".
       </p>
 <a name="class_operators_special_functions.special_methods"></a><h2>
-<a name="id449680"></a>
+<a name="id453761"></a>
         Special Methods
       </h2>
 <p>
@@ -593,11 +588,12 @@
 <p>
         Need we say more?
       </p>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> What is the business of <tt class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;&lt;</span></tt>? Well, the method <tt class="computeroutput"><span class="identifier">str</span></tt> requires the <tt class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;&lt;</span></tt> to do its work (i.e. <tt class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;&lt;</span></tt>
-              is used by the method defined by <tt class="computeroutput"><span class="identifier">def</span><span class="special">(</span><span class="identifier">str</span><span class="special">(</span><span class="identifier">self</span><span class="special">))</span></tt>.</td></tr></tbody>
-</table></div>
+<p class="blurb">
+        <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> What is the business of <tt class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;&lt;</span></tt>? Well, the method <tt class="computeroutput"><span class="identifier">str</span></tt>
+        requires the <tt class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;&lt;</span></tt>
+        to do its work (i.e. <tt class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;&lt;</span></tt> is used by the method defined by
+        <tt class="computeroutput"><span class="identifier">def</span><span class="special">(</span><span class="identifier">str</span><span class="special">(</span><span class="identifier">self</span><span class="special">))</span></tt>.
+      </p>
 </div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: boost/trunk/libs/python/doc/tutorial/doc/html/python/functions.html
===================================================================
--- boost/trunk/libs/python/doc/tutorial/doc/html/python/functions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/tutorial/doc/html/python/functions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
@@ -206,7 +209,7 @@
 <li><span class="bold"><b>BOOM!</b></span></li>
 </ol></div>
 <a name="call_policies.call_policies"></a><h2>
-<a name="id451559"></a>
+<a name="id455614"></a>
         Call Policies
       </h2>
 <p>
@@ -287,13 +290,11 @@
           and hold the instance
         </li>
 </ul></div>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/smiley.png" alt="smiley"></span> <span class="bold"><b>Remember the Zen, Luke:</b></span><br>
-              <br> "Explicit is better than implicit"<br> "In
-              the face of ambiguity, refuse the temptation to guess"<br>
-              </td></tr></tbody>
-</table></div>
+<p class="blurb">
+        <span class="inlinemediaobject"><img src="../images/smiley.png" alt="smiley"></span> <span class="bold"><b>Remember the Zen, Luke:</b></span><br>
+        <br> "Explicit is better than implicit"<br> "In the face
+        of ambiguity, refuse the temptation to guess"<br>
+      </p>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
@@ -404,7 +405,7 @@
         </li>
 </ul></div>
 <a name="default_arguments.boost_python_function_overloads"></a><h2>
-<a name="id453611"></a>
+<a name="id457647"></a>
         BOOST_PYTHON_FUNCTION_OVERLOADS
       </h2>
 <p>
@@ -434,7 +435,7 @@
 <span class="identifier">def</span><span class="special">(</span><span class="string">"foo"</span><span class="special">,</span> <span class="identifier">foo</span><span class="special">,</span> <span class="identifier">foo_overloads</span><span class="special">());</span>
 </pre>
 <a name="default_arguments.boost_python_member_function_overloads"></a><h2>
-<a name="id453927"></a>
+<a name="id457963"></a>
         BOOST_PYTHON_MEMBER_FUNCTION_OVERLOADS
       </h2>
 <p>
@@ -480,7 +481,7 @@
         reference</a> for details.
       </p>
 <a name="default_arguments.init_and_optional"></a><h2>
-<a name="id454288"></a>
+<a name="id458323"></a>
         init and optional
       </h2>
 <p>
@@ -547,14 +548,14 @@
         Then...
       </p>
 <pre class="programlisting">
-<span class="special">.</span><span class="identifier">def</span><span class="special">(</span><span class="string">"foo"</span><span class="special">,</span> <span class="identifier">foo</span><span class="special">,</span> <span class="identifier">foo_overloads</span><span class="special">());</span>
+<span class="special">.</span><span class="identifier">def</span><span class="special">(</span><span class="string">"foo"</span><span class="special">,</span> <span class="special">(</span><span class="keyword">void</span><span class="special">(*)(</span><span class="keyword">bool</span><span class="special">,</span> <span class="keyword">int</span><span class="special">,</span> <span class="keyword">char</span><span class="special">))</span><span class="number">0</span><span class="special">,</span> <span class="identifier">foo_overloads</span><span class="special">());</span>
 </pre>
 <p>
         Notice though that we have a situation now where we have a minimum of zero
         (0) arguments and a maximum of 3 arguments.
       </p>
 <a name="auto_overloading.manual_wrapping"></a><h2>
-<a name="id455013"></a>
+<a name="id459095"></a>
         Manual Wrapping
       </h2>
 <p>

Modified: boost/trunk/libs/python/doc/tutorial/doc/html/python/hello.html
===================================================================
--- boost/trunk/libs/python/doc/tutorial/doc/html/python/hello.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/tutorial/doc/html/python/hello.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
@@ -26,7 +29,7 @@
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="python.hello"></a> Building Hello World</h2></div></div></div>
 <a name="hello.from_start_to_finish"></a><h2>
-<a name="id373240"></a>
+<a name="id377427"></a>
       From Start To Finish
     </h2>
 <p>
@@ -35,17 +38,16 @@
       necessary to achieve that. We shall use the build tool that comes bundled with
       every boost distribution: <span class="bold"><b>bjam</b></span>.
     </p>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> <span class="bold"><b>Building without bjam</b></span><br>
-            <br> Besides bjam, there are of course other ways to get your module
-            built. What's written here should not be taken as "the one and only
-            way". There are of course other build tools apart from <tt class="literal">bjam</tt>.<br>
-            <br> Take note however that the preferred build tool for Boost.Python
-            is bjam. There are so many ways to set up the build incorrectly. Experience
-            shows that 90% of the "I can't build Boost.Python" problems
-            come from people who had to use a different tool. </td></tr></tbody>
-</table></div>
+<p class="blurb">
+      <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> <span class="bold"><b>Building without bjam</b></span><br>
+      <br> Besides bjam, there are of course other ways to get your module built.
+      What's written here should not be taken as "the one and only way".
+      There are of course other build tools apart from <tt class="literal">bjam</tt>.<br>
+      <br> Take note however that the preferred build tool for Boost.Python is
+      bjam. There are so many ways to set up the build incorrectly. Experience shows
+      that 90% of the "I can't build Boost.Python" problems come from people
+      who had to use a different tool.
+    </p>
 <p>
       We shall skip over the details. Our objective will be to simply create the
       hello world module and run it in Python. For a complete reference to building
@@ -99,7 +101,7 @@
       platforms. The complete list of Bjam executables can be found <a href="http://sourceforge.net/project/showfiles.php?group_id=7586" target="_top">here</a>.
     </p>
 <a name="hello.let_s_jam_"></a><h2>
-<a name="id373448"></a>
+<a name="id377613"></a>
       Let's Jam!
     </h2>
 <p>
@@ -150,7 +152,7 @@
       The last part tells BJam that we are depending on the Boost Python Library.
     </p>
 <a name="hello.running_bjam"></a><h2>
-<a name="id373586"></a>
+<a name="id377751"></a>
       Running bjam
     </h2>
 <p>
@@ -178,11 +180,10 @@
       The above assumes that the Python installation is in <tt class="literal">c:/dev/tools/python</tt>
       and that we are using Python version 2.2. You'll have to tweak these appropriately.
     </p>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Be sure not to include a third number, e.g. <span class="bold"><b>not</b></span> "2.2.1", even if that's the version
-            you have.</td></tr></tbody>
-</table></div>
+<p class="blurb">
+      <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Be sure not to include a third number, e.g. <span class="bold"><b>not</b></span> "2.2.1", even if that's the version you
+      have.
+    </p>
 <p>
       Take note that you may also do that through the Jamrules file we put in our
       project as detailed above. The file has <a href="../../../../../example/tutorial/Jamrules" target="_top">detailed

Modified: boost/trunk/libs/python/doc/tutorial/doc/html/python/iterators.html
===================================================================
--- boost/trunk/libs/python/doc/tutorial/doc/html/python/iterators.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/tutorial/doc/html/python/iterators.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">

Modified: boost/trunk/libs/python/doc/tutorial/doc/html/python/object.html
===================================================================
--- boost/trunk/libs/python/doc/tutorial/doc/html/python/object.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/tutorial/doc/html/python/object.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
@@ -176,12 +179,11 @@
         % x,y,z</tt> in Python, which is useful since there's no easy way to
         do that in std C++.
       </p>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/alert.png" alt="alert"></span> <span class="bold"><b>Beware</b></span> the
-              common pitfall of forgetting that the constructors of most of Python's
-              mutable types make copies, just as in Python. </td></tr></tbody>
-</table></div>
+<p class="blurb">
+        <span class="inlinemediaobject"><img src="../images/alert.png" alt="alert"></span> <span class="bold"><b>Beware</b></span> the common
+        pitfall of forgetting that the constructors of most of Python's mutable types
+        make copies, just as in Python.
+      </p>
 <p>
         Python:
       </p>
@@ -197,7 +199,7 @@
 </span><span class="identifier">d</span><span class="special">[</span><span class="char">'whatever'</span><span class="special">]</span> <span class="special">=</span> <span class="number">3</span><span class="special">;</span>           <span class="comment">// modifies the copy
 </span></pre>
 <a name="derived_object_types.class__lt_t_gt__as_objects"></a><h2>
-<a name="id457004"></a>
+<a name="id461067"></a>
         class_&lt;T&gt; as objects
       </h2>
 <p>
@@ -295,14 +297,12 @@
         above creates a Python class derived from Python's <tt class="literal">int</tt>
         type which is associated with the C++ type passed as its first parameter.
       </p>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> <span class="bold"><b>what is a scope?</b></span><br>
-              <br> The scope is a class that has an associated global Python object
-              which controls the Python namespace in which new extension classes
-              and wrapped functions will be defined as attributes. Details can be
-              found <a href="../../../../v2/scope.html" target="_top">here</a>.</td></tr></tbody>
-</table></div>
+<p class="blurb">
+        <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> <span class="bold"><b>what is a scope?</b></span><br>
+        <br> The scope is a class that has an associated global Python object which
+        controls the Python namespace in which new extension classes and wrapped
+        functions will be defined as attributes. Details can be found <a href="../../../../v2/scope.html" target="_top">here</a>.
+      </p>
 <p>
         You can access those values in Python as
       </p>

Modified: boost/trunk/libs/python/doc/tutorial/doc/html/python/techniques.html
===================================================================
--- boost/trunk/libs/python/doc/tutorial/doc/html/python/techniques.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/tutorial/doc/html/python/techniques.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
@@ -96,13 +99,12 @@
         Compiling these files will generate the following Python extensions: <tt class="literal">core.pyd</tt>,
         <tt class="literal">io.pyd</tt> and <tt class="literal">filters.pyd</tt>.
       </p>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> The extension <tt class="literal">.pyd</tt> is used
-              for python extension modules, which are just shared libraries. Using
-              the default for your system, like <tt class="literal">.so</tt> for Unix and
-              <tt class="literal">.dll</tt> for Windows, works just as well.</td></tr></tbody>
-</table></div>
+<p class="blurb">
+        <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> The extension <tt class="literal">.pyd</tt> is used for python
+        extension modules, which are just shared libraries. Using the default for
+        your system, like <tt class="literal">.so</tt> for Unix and <tt class="literal">.dll</tt>
+        for Windows, works just as well.
+      </p>
 <p>
         Now, we create this directory structure for our Python package:
       </p>
@@ -425,19 +427,17 @@
         exporting it to Python at the same time: changes in a class will only demand
         the compilation of a single cpp, instead of the entire wrapper code.
       </p>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> If you're exporting your classes with <a href="../../../../../pyste/index.html" target="_top">Pyste</a>,
-              take a look at the <tt class="literal">--multiple</tt> option, that generates
-              the wrappers in various files as demonstrated here.</td></tr></tbody>
-</table></div>
-<div class="informaltable"><table class="table">
-<colgroup><col></colgroup>
-<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> This method is useful too if you are getting the
-              error message <span class="emphasis"><em>"fatal error C1204:Compiler limit:internal
-              structure overflow"</em></span> when compiling a large source file,
-              as explained in the <a href="../../../../v2/faq.html#c1204" target="_top">FAQ</a>.</td></tr></tbody>
-</table></div>
+<p class="blurb">
+        <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> If you're exporting your classes with <a href="../../../../../pyste/index.html" target="_top">Pyste</a>,
+        take a look at the <tt class="literal">--multiple</tt> option, that generates the
+        wrappers in various files as demonstrated here.
+      </p>
+<p class="blurb">
+        <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span> This method is useful too if you are getting the error
+        message <span class="emphasis"><em>"fatal error C1204:Compiler limit:internal structure
+        overflow"</em></span> when compiling a large source file, as explained
+        in the <a href="../../../../v2/faq.html#c1204" target="_top">FAQ</a>.
+      </p>
 </div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: boost/trunk/libs/python/doc/tutorial/doc/tutorial.qbk
===================================================================
--- boost/trunk/libs/python/doc/tutorial/doc/tutorial.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/tutorial/doc/tutorial.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1100,7 +1100,7 @@
 
 Then...
 
-    .def("foo", foo, foo_overloads());
+    .def("foo", (void(*)(bool, int, char))0, foo_overloads());
 
 Notice though that we have a situation now where we have a minimum of zero
 (0) arguments and a maximum of 3 arguments.

Modified: boost/trunk/libs/python/doc/tutorial/index.html
===================================================================
--- boost/trunk/libs/python/doc/tutorial/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/tutorial/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,18 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<!-- 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) -->
 <html>
   <head>
     <meta http-equiv="refresh" content="0; URL=doc/html/index.html">
   </head>
   <body>
     Automatic redirection failed, click this 
-    <a href="doc/html/index.html">link</a>
+    <a href="doc/html/index.html">link</a> &nbsp;<hr>
+    <p>© Copyright Beman Dawes, 2001</p>
+    <p>Distributed under the Boost Software License, Version 1.0. (See 
+    accompanying file <a href="../../../LICENSE_1_0.txt">
+    LICENSE_1_0.txt</a> or copy at
+    <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
   </body>
-</html>
+</html>
\ No newline at end of file

Modified: boost/trunk/libs/python/doc/v2/Apr2002.html
===================================================================
--- boost/trunk/libs/python/doc/v2/Apr2002.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/Apr2002.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">

Modified: boost/trunk/libs/python/doc/v2/CallPolicies.html
===================================================================
--- boost/trunk/libs/python/doc/v2/CallPolicies.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/CallPolicies.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/Dereferenceable.html
===================================================================
--- boost/trunk/libs/python/doc/v2/Dereferenceable.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/Dereferenceable.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">

Modified: boost/trunk/libs/python/doc/v2/Extractor.html
===================================================================
--- boost/trunk/libs/python/doc/v2/Extractor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/Extractor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">

Modified: boost/trunk/libs/python/doc/v2/HolderGenerator.html
===================================================================
--- boost/trunk/libs/python/doc/v2/HolderGenerator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/HolderGenerator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">

Modified: boost/trunk/libs/python/doc/v2/Jun2002.html
===================================================================
--- boost/trunk/libs/python/doc/v2/Jun2002.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/Jun2002.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">

Modified: boost/trunk/libs/python/doc/v2/Mar2002.html
===================================================================
--- boost/trunk/libs/python/doc/v2/Mar2002.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/Mar2002.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">

Modified: boost/trunk/libs/python/doc/v2/May2002.html
===================================================================
--- boost/trunk/libs/python/doc/v2/May2002.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/May2002.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">

Modified: boost/trunk/libs/python/doc/v2/ObjectWrapper.html
===================================================================
--- boost/trunk/libs/python/doc/v2/ObjectWrapper.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/ObjectWrapper.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/ResultConverter.html
===================================================================
--- boost/trunk/libs/python/doc/v2/ResultConverter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/ResultConverter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">

Modified: boost/trunk/libs/python/doc/v2/acknowledgments.html
===================================================================
--- boost/trunk/libs/python/doc/v2/acknowledgments.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/acknowledgments.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/args.html
===================================================================
--- boost/trunk/libs/python/doc/v2/args.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/args.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/call.html
===================================================================
--- boost/trunk/libs/python/doc/v2/call.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/call.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">

Modified: boost/trunk/libs/python/doc/v2/call_method.html
===================================================================
--- boost/trunk/libs/python/doc/v2/call_method.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/call_method.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/callbacks.html
===================================================================
--- boost/trunk/libs/python/doc/v2/callbacks.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/callbacks.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/callbacks.txt
===================================================================
--- boost/trunk/libs/python/doc/v2/callbacks.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/callbacks.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. 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)
+
 Here's the plan:
 
 I aim to provide an interface similar to that of Boost.Python v1's

Modified: boost/trunk/libs/python/doc/v2/class.html
===================================================================
--- boost/trunk/libs/python/doc/v2/class.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/class.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
 <head>
   <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/configuration.html
===================================================================
--- boost/trunk/libs/python/doc/v2/configuration.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/configuration.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/copy_const_reference.html
===================================================================
--- boost/trunk/libs/python/doc/v2/copy_const_reference.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/copy_const_reference.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/copy_non_const_reference.html
===================================================================
--- boost/trunk/libs/python/doc/v2/copy_non_const_reference.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/copy_non_const_reference.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/data_members.html
===================================================================
--- boost/trunk/libs/python/doc/v2/data_members.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/data_members.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/def.html
===================================================================
--- boost/trunk/libs/python/doc/v2/def.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/def.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/def_visitor.html
===================================================================
--- boost/trunk/libs/python/doc/v2/def_visitor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/def_visitor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -132,4 +132,6 @@
   </p>
 
 
-    <p><i>&copy; Copyright Joel de Guzman 2003. </i>
\ No newline at end of file
+    <p><i>&copy; Copyright Joel de Guzman 2003. </i> Distributed under the Boost
+   Software License, Version 1.0. (See accompanying
+   file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) 

Modified: boost/trunk/libs/python/doc/v2/default_call_policies.html
===================================================================
--- boost/trunk/libs/python/doc/v2/default_call_policies.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/default_call_policies.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -165,6 +165,8 @@
   <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
 
 
-    <p><i>&copy; Copyright <a href="../../../../people/dave_abrahams.htm">Dave
-    Abrahams</a> 2002. </i>
+  <p><i>&copy; Copyright <a href="../../../../people/dave_abrahams.htm">Dave
+  Abrahams</a> 2002.</i> Distributed under the Boost Software License,
+  Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt)</p>
 

Modified: boost/trunk/libs/python/doc/v2/definitions.html
===================================================================
--- boost/trunk/libs/python/doc/v2/definitions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/definitions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/dict.html
===================================================================
--- boost/trunk/libs/python/doc/v2/dict.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/dict.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/docstring_options.html
===================================================================
--- boost/trunk/libs/python/doc/v2/docstring_options.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/docstring_options.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
 <head>
   <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/enum.html
===================================================================
--- boost/trunk/libs/python/doc/v2/enum.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/enum.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/errors.html
===================================================================
--- boost/trunk/libs/python/doc/v2/errors.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/errors.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/exception_translator.html
===================================================================
--- boost/trunk/libs/python/doc/v2/exception_translator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/exception_translator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/exec.html
===================================================================
--- boost/trunk/libs/python/doc/v2/exec.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/exec.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">

Modified: boost/trunk/libs/python/doc/v2/extract.html
===================================================================
--- boost/trunk/libs/python/doc/v2/extract.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/extract.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/faq.html
===================================================================
--- boost/trunk/libs/python/doc/v2/faq.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/faq.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/feb2002.html
===================================================================
--- boost/trunk/libs/python/doc/v2/feb2002.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/feb2002.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -360,7 +360,8 @@
   <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
 
 
-    <p class="c3">&copy; Copyright <a href= 
-    "../../../../people/dave_abrahams.htm">Dave Abrahams</a>
-    2002. 
+  <p class="c3">&copy; Copyright <a href=
+  "../../../../people/dave_abrahams.htm">Dave Abrahams</a> 2002. Distributed
+  under the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)</p>
 

Modified: boost/trunk/libs/python/doc/v2/handle.html
===================================================================
--- boost/trunk/libs/python/doc/v2/handle.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/handle.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/has_back_reference.html
===================================================================
--- boost/trunk/libs/python/doc/v2/has_back_reference.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/has_back_reference.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/implicit.html
===================================================================
--- boost/trunk/libs/python/doc/v2/implicit.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/implicit.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/import.html
===================================================================
--- boost/trunk/libs/python/doc/v2/import.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/import.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">

Modified: boost/trunk/libs/python/doc/v2/index.html
===================================================================
--- boost/trunk/libs/python/doc/v2/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 3.2//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/indexing.html
===================================================================
--- boost/trunk/libs/python/doc/v2/indexing.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/indexing.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,7 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/init.html
===================================================================
--- boost/trunk/libs/python/doc/v2/init.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/init.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/instance_holder.html
===================================================================
--- boost/trunk/libs/python/doc/v2/instance_holder.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/instance_holder.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content="HTML Tidy, see www.w3.org">

Modified: boost/trunk/libs/python/doc/v2/iterator.html
===================================================================
--- boost/trunk/libs/python/doc/v2/iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/list.html
===================================================================
--- boost/trunk/libs/python/doc/v2/list.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/list.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/long.html
===================================================================
--- boost/trunk/libs/python/doc/v2/long.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/long.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/lvalue_from_pytype.html
===================================================================
--- boost/trunk/libs/python/doc/v2/lvalue_from_pytype.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/lvalue_from_pytype.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/make_function.html
===================================================================
--- boost/trunk/libs/python/doc/v2/make_function.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/make_function.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/manage_new_object.html
===================================================================
--- boost/trunk/libs/python/doc/v2/manage_new_object.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/manage_new_object.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/module.html
===================================================================
--- boost/trunk/libs/python/doc/v2/module.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/module.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -104,5 +104,7 @@
 
 
     <p><i>&copy; Copyright <a href="../../../../people/dave_abrahams.htm">Dave
-    Abrahams</a> 2002. </i>
+    Abrahams</a> 2002. </i> Distributed
+  under the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)</p>
 

Modified: boost/trunk/libs/python/doc/v2/numeric.html
===================================================================
--- boost/trunk/libs/python/doc/v2/numeric.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/numeric.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,102 +1,105 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<!-- 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) -->
 
 <html>
-  <head>
-    <meta name="generator" content=
-    "HTML Tidy for Windows (vers 1st August 2002), see www.w3.org">
-    <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-    <link rel="stylesheet" type="text/css" href="../boost.css">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 1 September 2005), see www.w3.org">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link rel="stylesheet" type="text/css" href="../boost.css">
 
-    <title>Boost.Python - &lt;boost/python/numeric.hpp&gt;</title>
-  </head>
+  <title>Boost.Python - &lt;boost/python/numeric.hpp&gt;</title>
+</head>
 
-  <body>
-    <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-      <tr>
-        <td valign="top" width="300">
-          <h3><a href="../../../../index.htm"><img height="86" width="277"
-          alt="C++ Boost" src="../../../../boost.png" border="0"></a></h3>
-        </td>
+<body>
+  <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
+  "header">
+    <tr>
+      <td valign="top" width="300">
+        <h3><a href="../../../../index.htm"><img height="86" width="277" alt=
+        "C++ Boost" src="../../../../boost.png" border="0"></a></h3>
+      </td>
 
-        <td valign="top">
-          <h1 align="center"><a href="../index.html">Boost.Python</a></h1>
+      <td valign="top">
+        <h1 align="center"><a href="../index.html">Boost.Python</a></h1>
 
-          <h2 align="center">Header &lt;boost/python/numeric.hpp&gt;</h2>
-        </td>
-      </tr>
-    </table>
-    <hr>
+        <h2 align="center">Header &lt;boost/python/numeric.hpp&gt;</h2>
+      </td>
+    </tr>
+  </table>
+  <hr>
 
-    <h2>Contents</h2>
+  <h2>Contents</h2>
 
-    <dl class="page-index">
-      <dt><a href="#introduction">Introduction</a></dt>
+  <dl class="page-index">
+    <dt><a href="#introduction">Introduction</a></dt>
 
-      <dt><a href="#classes">Classes</a></dt>
+    <dt><a href="#classes">Classes</a></dt>
 
-      <dd>
-        <dl class="page-index">
-          <dt><a href="#array-spec">Class <code>array</code></a></dt>
+    <dd>
+      <dl class="page-index">
+        <dt><a href="#array-spec">Class <code>array</code></a></dt>
 
-          <dd>
-            <dl class="page-index">
-              <dt><a href="#array-spec-synopsis">Class <code>array</code>
-              synopsis</a></dt>
+        <dd>
+          <dl class="page-index">
+            <dt><a href="#array-spec-synopsis">Class <code>array</code>
+            synopsis</a></dt>
 
-              <dt><a href="#array-spec-observers">Class <code>array</code>
-              observer functions</a></dt>
+            <dt><a href="#array-spec-observers">Class <code>array</code>
+            observer functions</a></dt>
 
-              <dt><a href="#array-spec-statics">Class <code>array</code>
-              static functions</a></dt>
-            </dl>
-          </dd>
-        </dl>
-      </dd>
+            <dt><a href="#array-spec-statics">Class <code>array</code> static
+            functions</a></dt>
+          </dl>
+        </dd>
+      </dl>
+    </dd>
 
-      <dt><a href="#examples">Example(s)</a></dt>
-    </dl>
-    <hr>
+    <dt><a href="#examples">Example(s)</a></dt>
+  </dl>
+  <hr>
 
-    <h2><a name="introduction"></a>Introduction</h2>
+  <h2><a name="introduction" id="introduction"></a>Introduction</h2>
 
-    <p>Exposes a <a href=
-    "ObjectWrapper.html#TypeWrapper-concept">TypeWrapper</a> for the Python
-    <a href=
-    "http://www.python.org/dev/doc/devel/lib/typesmapping.html">array</a>
-    type.</p>
+  <p>Exposes a <a href=
+  "ObjectWrapper.html#TypeWrapper-concept">TypeWrapper</a> for the Python
+  <a href=
+  "http://www.python.org/dev/doc/devel/lib/typesmapping.html">array</a>
+  type.</p>
 
-    <h2><a name="classes"></a>Classes</h2>
+  <h2><a name="classes" id="classes"></a>Classes</h2>
 
-    <h3><a name="array-spec"></a>Class <code>array</code></h3>
+  <h3><a name="array-spec" id="array-spec"></a>Class <code>array</code></h3>
 
-    <p>Provides access to the array types of <a href=
-    "http://www.pfdubois.com/numpy/">Numerical Python</a>'s <a href=
-    "http://www.pfdubois.com/numpy/#Numeric">Numeric</a> and <a href=
-    "http://stsdas.stsci.edu/numarray/index.html">NumArray</a> modules. With
-    the exception of the functions documented <a href=
-    "#array-spec-observers">below</a>, the semantics of the constructors and
-    member functions defined below can be fully understood by reading the <a
-    href="ObjectWrapper.html#TypeWrapper-concept">TypeWrapper</a> concept
-    definition. Since <code>array</code> is publicly derived from <code><a
-    href="object.html#object-spec">object</a></code>, the public object
-    interface applies to <code>array</code> instances as well.</p>
+  <p>Provides access to the array types of <a href=
+  "http://www.pfdubois.com/numpy/">Numerical Python</a>'s <a href=
+  "http://www.pfdubois.com/numpy/#Numeric">Numeric</a> and <a href=
+  "http://stsdas.stsci.edu/numarray/index.html">NumArray</a> modules. With
+  the exception of the functions documented <a href=
+  "#array-spec-observers">below</a>, the semantics of the constructors and
+  member functions defined below can be fully understood by reading the
+  <a href="ObjectWrapper.html#TypeWrapper-concept">TypeWrapper</a> concept
+  definition. Since <code>array</code> is publicly derived from
+  <code><a href="object.html#object-spec">object</a></code>, the public
+  object interface applies to <code>array</code> instances as well.</p>
 
-    <p><a name="default_search"></a>The default behavior is to use
-    <code>numarray.NDArray</code> as the associated Python type if the
-    <code>numarray</code> module is installed in the default location.
-    Otherwise it falls back to use <code>Numeric.ArrayType</code>. If neither
-    extension module is installed, conversions to arguments of type
-    <code>numeric::array</code> will cause overload resolution to reject the
-    overload, and other attempted uses of <code>numeric::array</code> will <a
-    href="definitions.html#raise">raise</a> an appropriate Python exception.
-    The associated Python type can be set manually using the <code><a href=
-    "#array-spec-statics">set_module_and_type</a>(...)</code> static
-    function.</p>
+  <p><a name="default_search" id="default_search"></a>The default behavior is
+  to use <code>numarray.NDArray</code> as the associated Python type if the
+  <code>numarray</code> module is installed in the default location.
+  Otherwise it falls back to use <code>Numeric.ArrayType</code>. If neither
+  extension module is installed, overloads of wrapped C++ functions with
+  <code>numeric::array</code> parameters will never be matched, and other
+  attempted uses of <code>numeric::array</code> will <a href=
+  "definitions.html#raise">raise</a> an appropriate Python exception. The
+  associated Python type can be set manually using the <code><a href=
+  "#array-spec-statics">set_module_and_type</a>(...)</code> static
+  function.</p>
 
-    <h4><a name="array-spec-synopsis"></a>Class <code>array</code>
-    synopsis</h4>
-<pre>
+  <h4><a name="array-spec-synopsis" id="array-spec-synopsis"></a>Class
+  <code>array</code> synopsis</h4>
+  <pre>
 namespace boost { namespace python { namespace numeric
 {
    class array : public object
@@ -107,7 +110,7 @@
       object astype(Type const&amp; type_);
 
       template &lt;class Type&gt;
-      object new_(Type const&amp; type_) const;
+      array new_(Type const&amp; type_) const;
 
       template &lt;class Sequence&gt; 
       void resize(Sequence const&amp; x);
@@ -133,14 +136,14 @@
       void tofile(File const&amp; f) const;
 
       object factory();
-      template &lt;class Buffer&gt;
-      object factory(Buffer const&amp;);
-      template &lt;class Buffer, class Type&gt;
-      object factory(Buffer const&amp;, Type const&amp;);
-      template &lt;class Buffer, class Type, class Shape&gt;
-      object factory(Buffer const&amp;, Type const&amp;, Shape const&amp;, bool copy = true, bool savespace = false);
-      template &lt;class Buffer, class Type, class Shape&gt;
-      object factory(Buffer const&amp;, Type const&amp;, Shape const&amp;, bool copy, bool savespace, char typecode);
+      template &lt;class Sequence&gt;
+      object factory(Sequence const&amp;);
+      template &lt;class Sequence, class Typecode&gt;
+      object factory(Sequence const&amp;, Typecode const&amp;, bool copy = true, bool savespace = false);
+      template &lt;class Sequence, class Typecode, class Type&gt;
+      object factory(Sequence const&amp;, Typecode const&amp;, bool copy, bool savespace, Type const&amp;);
+      template &lt;class Sequence, class Typecode, class Type, class Shape&gt;
+      object factory(Sequence const&amp;, Typecode const&amp;, bool copy, bool savespace, Type const&amp;, Shape const&amp;);
 
       template &lt;class T1&gt;
       explicit array(T1 const&amp; x1);
@@ -152,6 +155,7 @@
 
       static void set_module_and_type();
       static void set_module_and_type(char const* package_path = 0, char const* type_name = 0);
+      static void get_module_name();
 
       object argmax(long axis=-1);
 
@@ -200,54 +204,60 @@
 }}}
 </pre>
 
-    <h4><a name="array-spec-observers"></a>Class <code>array</code> observer
-    functions</h4>
-<pre>
+  <h4><a name="array-spec-observers" id="array-spec-observers"></a>Class
+  <code>array</code> observer functions</h4>
+  <pre>
 object factory();
-template &lt;class Buffer&gt;
-object factory(Buffer const&amp;);
-template &lt;class Buffer, class Type&gt;
-object factory(Buffer const&amp;, Type const&amp;);
-template &lt;class Buffer, class Type, class Shape&gt;
-object factory(Buffer const&amp;, Type const&amp;, Shape const&amp;, bool copy = true, bool savespace = false);
-template &lt;class Buffer, class Type, class Shape&gt;
-object factory(Buffer const&amp;, Type const&amp;, Shape const&amp;, bool copy, bool savespace, char typecode);
-</pre>
-    These functions map to the underlying array type's <code>array()</code>
-    function family. They are not called "<code>array</code>" because of the
-    C++ limitation that you can't define a member function with the same name
-    as its enclosing class. 
-<pre>
+template &lt;class Sequence&gt;
+object factory(Sequence const&amp;);
+template &lt;class Sequence, class Typecode&gt;
+object factory(Sequence const&amp;, Typecode const&amp;, bool copy = true, bool savespace = false);
+template &lt;class Sequence, class Typecode, class Type&gt;
+object factory(Sequence const&amp;, Typecode const&amp;, bool copy, bool savespace, Type const&amp;);
+template &lt;class Sequence, class Typecode, class Type, class Shape&gt;
+object factory(Sequence const&amp;, Typecode const&amp;, bool copy, bool savespace, Type const&amp;, Shape const&amp;);
+</pre>These functions map to the underlying array type's <code>array()</code>
+function family. They are not called "<code>array</code>" because of the C++
+limitation that you can't define a member function with the same name as its
+enclosing class.
+  <pre>
 template &lt;class Type&gt;
-object new_(Type const&amp;) const;
-</pre>
-    This function maps to the underlying array type's <code>new()</code>
-    function. It is not called "<code>new</code>" because that is a keyword
-    in C++. 
+array new_(Type const&amp;) const;
+</pre>This function maps to the underlying array type's <code>new()</code>
+function. It is not called "<code>new</code>" because that is a keyword in
+C++.
 
-    <h4><a name="array-spec-statics"></a>Class <code>array</code> static
-    functions</h4>
-<pre>
+  <h4><a name="array-spec-statics" id="array-spec-statics"></a>Class
+  <code>array</code> static functions</h4>
+  <pre>
 static void set_module_and_type(char const* package_path, char const* type_name);
 static void set_module_and_type();
 </pre>
 
-    <dl class="function-semantics">
-      <dt><b>Requires:</b> <code>package_path</code> and
-      <code>type_name</code>, if supplied, is an <a href=
-      "definitions.html#ntbs">ntbs</a>.</dt>
+  <dl class="function-semantics">
+    <dt><b>Requires:</b> <code>package_path</code> and
+    <code>type_name</code>, if supplied, is an <a href=
+    "definitions.html#ntbs">ntbs</a>.</dt>
 
-      <dt><b>Effects:</b> The first form sets the package path of the module
-      which supplies the type named by <code>type_name</code> to
-      <code>package_path</code>. The second form restores the <a href=
-      "#default_search">default search behavior</a>. The associated Python
-      type will be searched for only the first time it is needed, and
-      thereafter the first time it is needed after an invocation of
-      <code>set_module_and_type</code>.</dt>
-    </dl>
+    <dt><b>Effects:</b> The first form sets the package path of the module
+    that supplies the type named by <code>type_name</code> to
+    <code>package_path</code>. The second form restores the <a href=
+    "#default_search">default search behavior</a>. The associated Python type
+    will be searched for only the first time it is needed, and thereafter the
+    first time it is needed after an invocation of
+    <code>set_module_and_type</code>.</dt>
+  </dl>
+  <pre>
+static std::string get_module_name()
+</pre>
 
-    <h2><a name="examples"></a>Example</h2>
-<pre>
+  <dl class="function-semantics">
+    <dt><b>Effects:</b> Returns the name of the module containing the class
+    that will be held by new <code>numeric::array</code> instances.</dt>
+  </dl>
+
+  <h2><a name="examples" id="examples"></a>Example</h2>
+  <pre>
 #include &lt;boost/python/numeric.hpp&gt;
 #include &lt;boost/python/tuple.hpp&gt;
 
@@ -258,10 +268,9 @@
 }
 </pre>
 
-    <p>Revised 03 October, 2002</p>
+  <p>Revised 07 October, 2006</p>
 
-    <p><i>&copy; Copyright <a href=
-    "../../../../people/dave_abrahams.htm">Dave Abrahams</a> 2002.</i></p>
-  </body>
+  <p><i>&copy; Copyright <a href="../../../../people/dave_abrahams.htm">Dave
+  Abrahams</a> 2002-2006.</i></p>
+</body>
 </html>
-

Modified: boost/trunk/libs/python/doc/v2/object.html
===================================================================
--- boost/trunk/libs/python/doc/v2/object.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/object.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=
@@ -851,12 +854,12 @@
     </dl>
 <pre>
 <a name="comparisons-spec"></a>
-template&lt;class L,class R&gt; bool operator&gt;(L const&amp;l,R const&amp;r);
-template&lt;class L,class R&gt; bool operator&gt;=(L const&amp;l,R const&amp;r);
-template&lt;class L,class R&gt; bool operator&lt;(L const&amp;l,R const&amp;r);
-template&lt;class L,class R&gt; bool operator&lt;=(L const&amp;l,R const&amp;r);
-template&lt;class L,class R&gt; bool operator==(L const&amp;l,R const&amp;r);
-template&lt;class L,class R&gt; bool operator!=(L const&amp;l,R const&amp;r);
+template&lt;class L,class R&gt; object operator&gt;(L const&amp;l,R const&amp;r);
+template&lt;class L,class R&gt; object operator&gt;=(L const&amp;l,R const&amp;r);
+template&lt;class L,class R&gt; object operator&lt;(L const&amp;l,R const&amp;r);
+template&lt;class L,class R&gt; object operator&lt;=(L const&amp;l,R const&amp;r);
+template&lt;class L,class R&gt; object operator==(L const&amp;l,R const&amp;r);
+template&lt;class L,class R&gt; object operator!=(L const&amp;l,R const&amp;r);
 </pre>
 
     <dl class="function-semantics">

Copied: boost/trunk/libs/python/doc/v2/opaque.html (from rev 14034, boost/branches/upstream/current/libs/python/doc/v2/opaque.html)

Deleted: boost/trunk/libs/python/doc/v2/opaque_pointer_converter.html
===================================================================
--- boost/trunk/libs/python/doc/v2/opaque_pointer_converter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/opaque_pointer_converter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,142 +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">
-    <link rel="stylesheet" type="text/css" href="../boost.css">
-
-    <title>Boost.Python - &lt;boost/python/opaque_pointer_converter.hpp&gt;</title>
-  </head>
-
-  <body>
-    <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-      <tr>
-        <td valign="top" width="300">
-          <h3><a href="../../../../index.htm"><img height="86" width="277"
-          alt="C++ Boost" src="../../../../boost.png" border="0"></a></h3>
-        </td>
-
-        <td valign="top">
-          <h1 align="center"><a href="../index.html">Boost.Python</a></h1>
-
-          <h2 align="center">Header
-          &lt;boost/python/opaque_pointer_converter.hpp&gt;</h2>
-        </td>
-      </tr>
-    </table>
-    <hr>
-
-    <h2>Contents</h2>
-
-    <dl class="page-index">
-      <dt><a href="#classes">Classes</a></dt>
-
-      <dd>
-        <dl class="page-index">
-          <dt><a href="#opaque_pointer_converter-spec">Class template
-          <code>opaque_pointer_converter&lt;P&gt;</code></a></dt>
-
-          <dd>
-            <dl class="page-index">
-              <dt><a href="#opaque_pointer_converter-spec-synopsis">Class template
-              <code>opaque_pointer_converter</code> synopsis</a></dt>
-            </dl>
-          </dd>
-        </dl>
-      </dd>
-
-      <dt><a href="#macros">Macros</a></dt>
-      <dd>
-        <dl class="page-index">
-          <dt><a href="#BOOST_PYTHON_OPAQUE_SPECIALIZED_TYPE_ID-spec">Macro
-          <code>BOOST_PYTHON_OPAQUE_SPECIALIZED_TYPE_ID</code></a></dt>
-        </dl>
-      </dd>
-
-      <dt><a href="#examples">Example</a></dt>
-
-      <dt><a href="#see-also">See Also</a></dt>
-    </dl>
-    <hr>
-
-    <h2><a name="classes"></a>Classes</h2>
-
-    <h3><a name="opaque_pointer_converter-spec"></a>Class template
-    <code>opaque_pointer_converter&lt;P&gt;</code></h3>
-
-    <p><code>opaque_pointer_converter&lt;&gt;</code> is derived from 
-          <a href="to_python_converter.html#to_python_converter-spec">
-            <code>to_python_converter</code></a>
-          and registers itself as an
-          <a href="lvalue_from_pytype.html#lvalue_from_pytype-spec">
-            <code>lvalue_from_pytype</code></a> converter from Python objects
-          into pointers to undefined types.
-            Thus it may be used as a converter from opaque pointers into
-          Python objects and vice versa.</p>
-
-    <h4><a name="opaque_pointer_converter-spec-synopsis"></a>Class template
-    <code>opaque_pointer_converter</code> synopsis</h4>
-<pre>
-namespace boost { namespace python
-{
-    template&lt;class Pointer&gt;
-    struct opaque_pointer_converter
-        : to_python_converter&lt;
-          Pointer, opaque_pointer_converter&lt;Pointer&gt; &gt;
-    {
-        explicit opaque_pointer_converter(char const* name);
-    };
-}}
-</pre>
-
-    <h4><a name="opaque_pointer_converter-spec-constructor"></a>Class template
-    <code>opaque_pointer_converter</code> constructor</h4>
-<pre>
-explicit opaque_pointer_converter(char const* name);
-</pre>
-
-    <dl class="function-semantics">
-      <dt><b>Effects:</b>
-            <p>Registers the instance as a 
-            <a href="lvalue_from_pytype.html#lvalue_from_pytype-spec">
-              <code>lvalue_from_pytype</code></a> converter from Python objects
-            into opaque pointers.</p>
-            <p>The name is used for the type of the Python Objects created;
-              it should be printable but needn't be an 
-              <a href="definitions.html#ntbs">ntbs</a> because the object type is
-              not supposed to be user constructible within python scripts.</p>
-          </dt>
-    </dl>
-
-    <h2><a name="macros"></a>Macros</h2>
-
-    <h3><a name="BOOST_PYTHON_OPAQUE_SPECIALIZED_TYPE_ID-spec"></a>
-      Macro BOOST_PYTHON_OPAQUE_SPECIALIZED_TYPE_ID(Pointee)</h3>
-    <p>This macro must be used to define specializations of the 
-      <a href="type_id.html#type_id-spec">type_id</a> function
-      which can't be instantiated for incomplete types.</p>
-    <h4>Note</h4>
-    <p>In order for this to work in a cross-module environment the macro must
-      be invoked in every translation unit which uses the
-      opaque_pointer_converter.</p>
-
-    <h2><a name="examples"></a>Example</h2>
-
-        please see example for <a href="return_opaque_pointer.html#examples">
-          return_opaque_pointer</a>.
-
-    <h2><a name="see-also"></a>See Also</h2>
-        <p>
-          <a href="return_opaque_pointer.html">return_opaque_pointer</a>
-        </p>
-
-    <p>Revised 
-  10 March, 2003
-    </p>
-
-    <p><i>&copy; Copyright 2003 Haufe Mediengruppe. All Rights
-    Reserved.</i></p>
-  </body>
-</html>
-

Modified: boost/trunk/libs/python/doc/v2/operators.html
===================================================================
--- boost/trunk/libs/python/doc/v2/operators.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/operators.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/overloads.html
===================================================================
--- boost/trunk/libs/python/doc/v2/overloads.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/overloads.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/pickle.html
===================================================================
--- boost/trunk/libs/python/doc/v2/pickle.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/pickle.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -320,11 +320,9 @@
 
 <hr>
 
-&copy; Copyright Ralf W. Grosse-Kunstleve 2001-2004. Permission to copy,
-use, modify, sell and distribute this document is granted provided this
-copyright notice appears in all copies. This document is provided "as
-is" without express or implied warranty, and with no claim as to its
-suitability for any purpose.
+&copy; Copyright Ralf W. Grosse-Kunstleve 2001-2004. Distributed under
+  the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 <p>
 Updated: Feb 2004.

Modified: boost/trunk/libs/python/doc/v2/platforms.html
===================================================================
--- boost/trunk/libs/python/doc/v2/platforms.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/platforms.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/pointee.html
===================================================================
--- boost/trunk/libs/python/doc/v2/pointee.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/pointee.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -112,5 +112,8 @@
 
 
     <p><i>&copy; Copyright <a href="../../../../people/dave_abrahams.htm">Dave
-    Abrahams</a> 2002. </i>
+    Abrahams</a> 2002. </i>   Distributed
+  under the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)</p>
 
+

Modified: boost/trunk/libs/python/doc/v2/progress_reports.html
===================================================================
--- boost/trunk/libs/python/doc/v2/progress_reports.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/progress_reports.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">

Modified: boost/trunk/libs/python/doc/v2/ptr.html
===================================================================
--- boost/trunk/libs/python/doc/v2/ptr.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/ptr.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -259,5 +259,7 @@
 
 
     <p><i>&copy; Copyright <a href="../../../../people/dave_abrahams.htm">Dave
-    Abrahams</a> 2002. </i>
+    Abrahams</a> 2002. </i> Distributed
+  under the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)</p>
 

Modified: boost/trunk/libs/python/doc/v2/python.html
===================================================================
--- boost/trunk/libs/python/doc/v2/python.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/python.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/raw_function.html
===================================================================
--- boost/trunk/libs/python/doc/v2/raw_function.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/raw_function.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/reference.html
===================================================================
--- boost/trunk/libs/python/doc/v2/reference.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/reference.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=
@@ -904,26 +907,26 @@
       </dd>
 
       <dt><a href=
-      "opaque_pointer_converter.html">opaque_pointer_converter.hpp</a></dt>
+      "opaque.html">opaque_pointer_converter.hpp</a></dt>
 
       <dd>
         <dl class="index">
           <dt><a href=
-          "opaque_pointer_converter.html#classes">Classes</a></dt>
+          "opaque.html#classes">Classes</a></dt>
 
           <dd>
             <dl class="index">
               <dt><a href=
-              "opaque_pointer_converter.html#opaque_pointer_converter-spec">opaque_pointer_converter</a></dt>
+              "opaque.html#opaque-spec">opaque</a></dt>
             </dl>
           </dd>
 
-          <dt><a href="opaque_pointer_converter.html#macros">Macros</a></dt>
+          <dt><a href="opaque.html#macros">Macros</a></dt>
 
           <dd>
             <dl class="index">
               <dt><a href=
-              "opaque_pointer_converter.html#BOOST_PYTHON_OPAQUE_SPECIALIZED_TYPE_ID-spec">
+              "opaque.html#BOOST_PYTHON_OPAQUE_SPECIALIZED_TYPE_ID-spec">
               BOOST_PYTHON_OPAQUE_SPECIALIZED_TYPE_ID</a></dt>
             </dl>
           </dd>
@@ -1091,6 +1094,16 @@
           </dd>
         </dl>
       </dd>
+
+      <dt><a href="ssize_t.html">ssize_t.hpp</a></dt>
+
+      <dd>
+        <dl class="index">
+          <dt><a href="ssize_t.html#typedefs">Typedefs</a></dt>
+
+          <dt><a href="ssize_t.html#constants">Constants</a></dt>
+        </dl>
+      </dd>
     </dl>
 
     <h2><a name="topics">Topics</a></h2>

Modified: boost/trunk/libs/python/doc/v2/reference_existing_object.html
===================================================================
--- boost/trunk/libs/python/doc/v2/reference_existing_object.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/reference_existing_object.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/register_ptr_to_python.html
===================================================================
--- boost/trunk/libs/python/doc/v2/register_ptr_to_python.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/register_ptr_to_python.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">

Modified: boost/trunk/libs/python/doc/v2/return_arg.html
===================================================================
--- boost/trunk/libs/python/doc/v2/return_arg.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/return_arg.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/return_by_value.html
===================================================================
--- boost/trunk/libs/python/doc/v2/return_by_value.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/return_by_value.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/return_internal_reference.html
===================================================================
--- boost/trunk/libs/python/doc/v2/return_internal_reference.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/return_internal_reference.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/return_opaque_pointer.html
===================================================================
--- boost/trunk/libs/python/doc/v2/return_opaque_pointer.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/return_opaque_pointer.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
@@ -67,7 +70,7 @@
           undefined types such that the return value is copied into a
           new Python object.</p>
         <p>In addition to specifying the <code>return_opaque_pointer</code>
-          policy the <a href="opaque_pointer_converter.html#BOOST_PYTHON_OPAQUE_SPECIALIZED_TYPE_ID-spec">
+          policy the <a href="opaque.html#BOOST_PYTHON_OPAQUE_SPECIALIZED_TYPE_ID-spec">
           <code>BOOST_PYTHON_OPAQUE_SPECIALIZED_TYPE_ID</code></a> macro must be
           used to define specializations for the 
           <a href="type_id.html#type_id-spec">type_id</a> function
@@ -174,8 +177,8 @@
 
     <h2><a name="see-also"></a>See Also</h2>
         <p>
-          <a href="opaque_pointer_converter.html">
-            opaque_pointer_converter</a>
+          <a href="opaque.html">
+            opaque</a>
         </p>
 
     <p>Revised 

Modified: boost/trunk/libs/python/doc/v2/return_value_policy.html
===================================================================
--- boost/trunk/libs/python/doc/v2/return_value_policy.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/return_value_policy.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/scope.html
===================================================================
--- boost/trunk/libs/python/doc/v2/scope.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/scope.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/slice.html
===================================================================
--- boost/trunk/libs/python/doc/v2/slice.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/slice.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,7 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<!-- 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) -->
 <html>
 <head>
   <meta name="generator"

Copied: boost/trunk/libs/python/doc/v2/ssize_t.html (from rev 14034, boost/branches/upstream/current/libs/python/doc/v2/ssize_t.html)

Modified: boost/trunk/libs/python/doc/v2/stl_iterator.html
===================================================================
--- boost/trunk/libs/python/doc/v2/stl_iterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/stl_iterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
 

Modified: boost/trunk/libs/python/doc/v2/str.html
===================================================================
--- boost/trunk/libs/python/doc/v2/str.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/str.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/to_python_converter.html
===================================================================
--- boost/trunk/libs/python/doc/v2/to_python_converter.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/to_python_converter.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/to_python_indirect.html
===================================================================
--- boost/trunk/libs/python/doc/v2/to_python_indirect.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/to_python_indirect.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -190,5 +190,7 @@
 
 
     <p><i>&copy; Copyright <a href="../../../../people/dave_abrahams.htm">Dave
-    Abrahams</a> 2002. </i>
+    Abrahams</a> 2002. </i> Distributed
+  under the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)</p>
 

Modified: boost/trunk/libs/python/doc/v2/to_python_value.html
===================================================================
--- boost/trunk/libs/python/doc/v2/to_python_value.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/to_python_value.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -97,5 +97,7 @@
 
 
     <p><i>&copy; Copyright <a href="../../../../people/dave_abrahams.htm">Dave
-    Abrahams</a> 2002. </i>
+    Abrahams</a> 2002. </i> Distributed under the Boost Software License,
+  Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt)</p>
 

Modified: boost/trunk/libs/python/doc/v2/tuple.html
===================================================================
--- boost/trunk/libs/python/doc/v2/tuple.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/tuple.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,8 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/type_id.html
===================================================================
--- boost/trunk/libs/python/doc/v2/type_id.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/type_id.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -215,7 +215,9 @@
     </p>
 
     <p class="c4">&copy; Copyright <a href=
-    "../../../../people/dave_abrahams.htm">Dave Abrahams</a> 2002.</p>
+    "../../../../people/dave_abrahams.htm">Dave Abrahams</a> 2002.  Distributed under the Boost Software License,
+  Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt)<
 
   </body>
 </html>

Modified: boost/trunk/libs/python/doc/v2/with_custodian_and_ward.html
===================================================================
--- boost/trunk/libs/python/doc/v2/with_custodian_and_ward.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/with_custodian_and_ward.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,7 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<!-- 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) -->
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/libs/python/doc/v2/wrapper.html
===================================================================
--- boost/trunk/libs/python/doc/v2/wrapper.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/doc/v2/wrapper.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -232,5 +232,7 @@
 
 
     <p><i>&copy; Copyright <a href="../../../../people/dave_abrahams.htm">Dave
-    Abrahams</a> 2004</i>
+    Abrahams</a> 2004</i> Distributed under the Boost Software License,
+  Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt)</p>
 

Deleted: boost/trunk/libs/python/example/Jamfile
===================================================================
--- boost/trunk/libs/python/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,81 +0,0 @@
-# Copyright David Abrahams 2003. See accompanying LICENSE for terms
-# and conditions of use.
-
-# This is the top of our own project tree
-project-root ;
-
-# Declares the following targets:
-#    
-#  1. an extension module called "getting_started1", which is
-#     built from "getting_started1.cpp". Built by default
-#
-#  2. A test target called my-test.test which runs
-#     test_getting_started1.py with the extension module above. Built
-#     when out-of date, but only if invoked by name or if the global
-#     "test" target is invoked.
-#
-#  3. A test target called my-test.run wihch runs the above test
-#     unconditionally. Built only when invoked by name.
-#
-# To see verbose test output, add "-sPYTHON_TEST_ARGS=-v" to the bjam
-# command-line before the first target.
-#
-
-# Include definitions needed for Python modules
-import python ;
-
-# ----- getting_started1 -------
-
-# Declare a Python extension called getting_started1
-extension getting_started1
-: # sources
-  getting_started1.cpp
-  
-  # requirements and dependencies for Boost.Python extensions
-  <template>@boost/libs/python/build/extension
-  ;
-
-# Declare a test for the extension module
-boost-python-runtest test1
-    :  # Python test driver
-    test_getting_started1.py
-    # extension modules to use
-    <pyd>getting_started1 ;
-    
-
-    
-# ----- getting_started2 -------
-    
-# Declare a Python extension called getting_started2
-extension getting_started2
-:  # sources
-   getting_started2.cpp
-  
-  # requirements and dependencies for Boost.Python extensions
-  <template>@boost/libs/python/build/extension
-  ;
-
-# Declare a test for the extension module
-boost-python-runtest test2
-    :  # Python test driver
-    test_getting_started2.py
-    # extension modules to use
-    <pyd>getting_started2 ;    
-
-# ----- std_pair -------
-
-# Declare a Python extension called std_pair
-extension std_pair_ext
-: # sources
-  std_pair.cpp
-  
-  # requirements and dependencies for Boost.Python extensions
-  <template>@boost/libs/python/build/extension
-  ;
-
-# Declare a test for the extension module
-boost-python-runtest test3
-    :  # Python test driver
-    test_std_pair.py
-    # extension modules to use
-    <pyd>std_pair_ext ;

Modified: boost/trunk/libs/python/example/Jamfile.v2
===================================================================
--- boost/trunk/libs/python/example/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/example/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,36 @@
-# This is the Jamfile for Boost.Build v2, which is currently in
-# prerelease.  Ignore this file unless you are a bleading edge sort of
-# person.
+# 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)
 
 project : requirements <library>/boost/python//boost_python ;
     
 python-extension getting_started1 : getting_started1.cpp ;
+
+bpl-test test1 
+    :  # Python test driver
+    test_getting_started1.py
+    # extension modules to use
+    getting_started1 ;
+
+
 python-extension getting_started2 : getting_started2.cpp ;
 
+bpl-test test2
+    :  # Python test driver
+    test_getting_started2.py
+    # extension modules to use
+    getting_started2 ;    
+
+python-extension std_pair : std_pair.cpp ;
+
+bpl-test test3
+    :  # Python test driver
+    test_std_pair.py
+    # extension modules to use
+    std_pair_ext ;
+    
+# Don't run tests by default
+explicit test1 test2 test3 ;
+alias test : test1 test2 test3 ;
+explicit test ;
+

Copied: boost/trunk/libs/python/example/Jamroot (from rev 14034, boost/branches/upstream/current/libs/python/example/Jamroot)

Modified: boost/trunk/libs/python/example/README
===================================================================
--- boost/trunk/libs/python/example/README	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/example/README	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,19 +1,16 @@
+.. 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)
+
 To get started with the Boost Python Library, use the examples
-getting_started1.cpp and getting_started2.cpp.
+getting_started1.cpp and getting_started2.cpp.  Invoking
 
-    bjam -sTOOLS=your-toolset test
+    bjam --toolset=your-toolset test
 
-in this directory will build and run the examples.
+in this directory will build and run the examples.  See
+http://www.boost.org/more/getting_started.html for details about the
+--toolset= option.
 
-Other configuration variables may need to be set as described in
-http://www.boost.org/libs/python/doc/building.html.  These can be
-supplied by the environment, on the command-line with
-
-  -sVARIABLENAME=value
-
-or in the local Jamrules file.
-
 If you move this example from its place in the Boost development tree
-you'll need to edit at least one line in Jamrules and one line in
+you'll need to edit the two lines indicated in Jamroot and
 boost-build.jam.
-

Modified: boost/trunk/libs/python/example/boost-build.jam
===================================================================
--- boost/trunk/libs/python/example/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/example/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,7 @@
-# Copyright David Abrahams 2003. See accompanying LICENSE for terms
-# and conditions of use.
+# 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)
 
-# Edit this path to point at the tools/build/v1 subdirectory of your
+# Edit this path to point at the tools/build/v2 subdirectory of your
 # Boost installation.  Absolute paths work, too.
-boost-build ../../../tools/build/v1 ;
+boost-build ../../../tools/build/v2 ;

Modified: boost/trunk/libs/python/example/test_getting_started1.py
===================================================================
--- boost/trunk/libs/python/example/test_getting_started1.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/example/test_getting_started1.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+# Copyright Ralf W. Grosse-Kunstleve 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)
 r'''>>> import getting_started1
     >>> print getting_started1.greet()
     hello, world

Modified: boost/trunk/libs/python/example/test_getting_started2.py
===================================================================
--- boost/trunk/libs/python/example/test_getting_started2.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/example/test_getting_started2.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+# Copyright Ralf W. Grosse-Kunstleve 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)
 r'''>>> from getting_started2 import *
     >>> hi = hello('California')
     >>> hi.greet()

Modified: boost/trunk/libs/python/example/test_std_pair.py
===================================================================
--- boost/trunk/libs/python/example/test_std_pair.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/example/test_std_pair.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+# Copyright Ralf W. Grosse-Kunstleve 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)
 import std_pair_ext
 assert std_pair_ext.foo() == (3, 5)
 print "OK"

Deleted: boost/trunk/libs/python/example/tutorial/Jamfile
===================================================================
--- boost/trunk/libs/python/example/tutorial/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/example/tutorial/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,18 +0,0 @@
-#   Hello World Example from the tutorial
-#   Copyright Joel de Guzman 2002-2004. Distributed under the Boost
-#   Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt 
-#   or copy at http://www.boost.org/LICENSE_1_0.txt)
-#   [Joel de Guzman 10/9/2002]
-
-# This is the top of our own project tree
-project-root ;
-
-#   Include definitions needed for Python modules
-import python ;
-
-extension hello                     # Declare a Python extension called hello
-:   hello.cpp                       # source
-    # requirements and dependencies for Boost.Python extensions
-    <template>@boost/libs/python/build/extension
-    ;
-

Copied: boost/trunk/libs/python/example/tutorial/Jamroot (from rev 14034, boost/branches/upstream/current/libs/python/example/tutorial/Jamroot)

Deleted: boost/trunk/libs/python/example/tutorial/Jamrules
===================================================================
--- boost/trunk/libs/python/example/tutorial/Jamrules	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/example/tutorial/Jamrules	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,36 +0,0 @@
-# Copyright David Abrahams 2003. See accompanying LICENSE for terms
-# and conditions of use.
-
-# If you move this example from its place in the Boost tree, edit this
-# path to point at the root directory of your Boost installation (the
-# one containing a subdirectory called "boost/" and a sub-subdirectory
-# "boost/python/" full of .hpp files).  Absolute paths work, too.
-#
-path-global BOOST_ROOT : ../../../.. ;
-
-# Boost.Python configuration variables, as described in
-# http://www.boost.org/libs/python/doc/building.html#configuration.
-# Usually you don't need to set these; the defaults will work.  If you
-# do set them, try to change as few of them as possible, starting with
-# the first ones.
-
-  # PYTHON_VERSION = <the two-part Major.Minor version number, e.g. 2.2> ;
-  # PYTHON_ROOT = <root directory of your Python installation, e.g. /usr> ;
-  # PYTHON_INCLUDES = <path to Python #include directories> ;
-  # PYTHON_LIB_PATH = <path to Python library object> ;
-
-# You may need to configure your compiler toolset, especially if you
-# want to build with a compiler that is not the "system default" or if
-# it is installed in a nonstandard place; see
-# http://www.boost.org/more/getting_started.html#Configuring for
-# details.  
-
-# Makes a project id for boost so that other Boost.Build projects can
-# refer to it by name.
-#
-project boost : $(BOOST_ROOT) ;
-
-# Change this setting to have all your built products placed under a
-# single directory:
-#
-# ALL_LOCATE_TARGET = <root directory for all built products>

Modified: boost/trunk/libs/python/index.html
===================================================================
--- boost/trunk/libs/python/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+<!-- 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) -->
 <html>
 <head>
 <meta http-equiv="refresh" content="0; URL=doc/index.html">

Modified: boost/trunk/libs/python/pyste/NEWS
===================================================================
--- boost/trunk/libs/python/pyste/NEWS	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/NEWS	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Copyright Bruno da Silva de Oliveira 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)
+
 25 April 2005
 - Fixed bug where the code for wrappers of member functions were defined outside 
 the pyste namespace. Reported by Dan Haffey.

Modified: boost/trunk/libs/python/pyste/README
===================================================================
--- boost/trunk/libs/python/pyste/README	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/README	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Copyright Bruno da Silva de Oliveira 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)
+
 Pyste - Python Semi-Automatic Exporter
 ======================================
 

Modified: boost/trunk/libs/python/pyste/TODO
===================================================================
--- boost/trunk/libs/python/pyste/TODO	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/TODO	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+.. Copyright Bruno da Silva de Oliveira 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)
+
 - Make Pyste accept already-generated xml files
 
 - throw() declaration in virtual wrapper's member functions

Deleted: boost/trunk/libs/python/pyste/dist/.cvsignore
===================================================================
--- boost/trunk/libs/python/pyste/dist/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/dist/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +0,0 @@
-*.zip
-*.pyc

Modified: boost/trunk/libs/python/pyste/dist/create_build.py
===================================================================
--- boost/trunk/libs/python/pyste/dist/create_build.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/dist/create_build.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright Bruno da Silva de Oliveira 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)
+
 import os
 import sys
 import shutil

Modified: boost/trunk/libs/python/pyste/dist/setup.py
===================================================================
--- boost/trunk/libs/python/pyste/dist/setup.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/dist/setup.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright Bruno da Silva de Oliveira 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)
+
 from distutils.core import setup
 import py2exe
 import sys

Modified: boost/trunk/libs/python/pyste/doc/adding_new_methods.html
===================================================================
--- boost/trunk/libs/python/pyste/doc/adding_new_methods.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/doc/adding_new_methods.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -72,9 +72,8 @@
 </table>
 <br>
 <hr size="1"><p class="copyright">Copyright &copy; 2003 Bruno da Silva de Oliveira<br>Copyright &copy; 2002-2003 Joel de Guzman<br><br>
-<font size="2">Permission to copy, use, modify, sell and distribute this document
- is granted provided this copyright notice appears in all copies. This document
- is provided &quot;as is&quot; without express or implied warranty, and with
- no claim as to its suitability for any purpose. </font> </p>
+<font size="2">Distributed under
+  the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 </body>
 </html>

Modified: boost/trunk/libs/python/pyste/doc/exporting_an_entire_header.html
===================================================================
--- boost/trunk/libs/python/pyste/doc/exporting_an_entire_header.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/doc/exporting_an_entire_header.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -78,9 +78,8 @@
 </table>
 <br>
 <hr size="1"><p class="copyright">Copyright &copy; 2003 Bruno da Silva de Oliveira<br>Copyright &copy; 2002-2003 Joel de Guzman<br><br>
-<font size="2">Permission to copy, use, modify, sell and distribute this document
- is granted provided this copyright notice appears in all copies. This document
- is provided &quot;as is&quot; without express or implied warranty, and with
- no claim as to its suitability for any purpose. </font> </p>
+<font size="2">Distributed under
+  the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 </body>
 </html>

Modified: boost/trunk/libs/python/pyste/doc/global_variables.html
===================================================================
--- boost/trunk/libs/python/pyste/doc/global_variables.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/doc/global_variables.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -42,9 +42,8 @@
 </table>
 <br>
 <hr size="1"><p class="copyright">Copyright &copy; 2003 Bruno da Silva de Oliveira<br>Copyright &copy; 2002-2003 Joel de Guzman<br><br>
-<font size="2">Permission to copy, use, modify, sell and distribute this document
- is granted provided this copyright notice appears in all copies. This document
- is provided &quot;as is&quot; without express or implied warranty, and with
- no claim as to its suitability for any purpose. </font> </p>
+<font size="2">Distributed under
+  the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 </body>
 </html>

Modified: boost/trunk/libs/python/pyste/doc/inserting_code.html
===================================================================
--- boost/trunk/libs/python/pyste/doc/inserting_code.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/doc/inserting_code.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -65,9 +65,8 @@
 </table>
 <br>
 <hr size="1"><p class="copyright">Copyright &copy; 2003 Bruno da Silva de Oliveira<br>Copyright &copy; 2002-2003 Joel de Guzman<br><br>
-<font size="2">Permission to copy, use, modify, sell and distribute this document
- is granted provided this copyright notice appears in all copies. This document
- is provided &quot;as is&quot; without express or implied warranty, and with
- no claim as to its suitability for any purpose. </font> </p>
+<font size="2">Distributed under
+  the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 </body>
 </html>

Modified: boost/trunk/libs/python/pyste/doc/introduction.html
===================================================================
--- boost/trunk/libs/python/pyste/doc/introduction.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/doc/introduction.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -66,9 +66,8 @@
 </table>
 <br>
 <hr size="1"><p class="copyright">Copyright &copy; 2003 Bruno da Silva de Oliveira<br>Copyright &copy; 2002-2003 Joel de Guzman<br><br>
-<font size="2">Permission to copy, use, modify, sell and distribute this document
- is granted provided this copyright notice appears in all copies. This document
- is provided &quot;as is&quot; without express or implied warranty, and with
- no claim as to its suitability for any purpose. </font> </p>
+<font size="2">Distributed under
+  the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 </body>
 </html>

Modified: boost/trunk/libs/python/pyste/doc/policies.html
===================================================================
--- boost/trunk/libs/python/pyste/doc/policies.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/doc/policies.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -83,9 +83,8 @@
 </table>
 <br>
 <hr size="1"><p class="copyright">Copyright &copy; 2003 Bruno da Silva de Oliveira<br>Copyright &copy; 2002-2003 Joel de Guzman<br><br>
-<font size="2">Permission to copy, use, modify, sell and distribute this document
- is granted provided this copyright notice appears in all copies. This document
- is provided &quot;as is&quot; without express or implied warranty, and with
- no claim as to its suitability for any purpose. </font> </p>
+<font size="2">Distributed under
+  the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 </body>
 </html>

Modified: boost/trunk/libs/python/pyste/doc/pyste.txt
===================================================================
--- boost/trunk/libs/python/pyste/doc/pyste.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/doc/pyste.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 [doc Pyste Documentation]
 
+[/ Copyright 2003 Bruno da Silva de Oliveira and Joel de Guzman.
+Distributed under the Boost Software License, Version 1.0. (See
+accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt) ]
+
 [def GCCXML             [@http://www.gccxml.org GCCXML]]
 [def Boost.Python       [@../../index.html Boost.Python]]
 

Modified: boost/trunk/libs/python/pyste/doc/renaming_and_excluding.html
===================================================================
--- boost/trunk/libs/python/pyste/doc/renaming_and_excluding.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/doc/renaming_and_excluding.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -80,9 +80,8 @@
 </table>
 <br>
 <hr size="1"><p class="copyright">Copyright &copy; 2003 Bruno da Silva de Oliveira<br>Copyright &copy; 2002-2003 Joel de Guzman<br><br>
-<font size="2">Permission to copy, use, modify, sell and distribute this document
- is granted provided this copyright notice appears in all copies. This document
- is provided &quot;as is&quot; without express or implied warranty, and with
- no claim as to its suitability for any purpose. </font> </p>
+<font size="2">Distributed under
+  the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 </body>
 </html>

Modified: boost/trunk/libs/python/pyste/doc/running_pyste.html
===================================================================
--- boost/trunk/libs/python/pyste/doc/running_pyste.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/doc/running_pyste.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -193,9 +193,8 @@
 </table>
 <br>
 <hr size="1"><p class="copyright">Copyright &copy; 2003 Bruno da Silva de Oliveira<br>Copyright &copy; 2002-2003 Joel de Guzman<br><br>
-<font size="2">Permission to copy, use, modify, sell and distribute this document
- is granted provided this copyright notice appears in all copies. This document
- is provided &quot;as is&quot; without express or implied warranty, and with
- no claim as to its suitability for any purpose. </font> </p>
+<font size="2">Distributed under
+  the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 </body>
 </html>

Modified: boost/trunk/libs/python/pyste/doc/smart_pointers.html
===================================================================
--- boost/trunk/libs/python/pyste/doc/smart_pointers.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/doc/smart_pointers.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -77,9 +77,8 @@
 </table>
 <br>
 <hr size="1"><p class="copyright">Copyright &copy; 2003 Bruno da Silva de Oliveira<br>Copyright &copy; 2002-2003 Joel de Guzman<br><br>
-<font size="2">Permission to copy, use, modify, sell and distribute this document
- is granted provided this copyright notice appears in all copies. This document
- is provided &quot;as is&quot; without express or implied warranty, and with
- no claim as to its suitability for any purpose. </font> </p>
+<font size="2">Distributed under
+  the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 </body>
 </html>

Modified: boost/trunk/libs/python/pyste/doc/templates.html
===================================================================
--- boost/trunk/libs/python/pyste/doc/templates.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/doc/templates.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -95,9 +95,8 @@
 </table>
 <br>
 <hr size="1"><p class="copyright">Copyright &copy; 2003 Bruno da Silva de Oliveira<br>Copyright &copy; 2002-2003 Joel de Guzman<br><br>
-<font size="2">Permission to copy, use, modify, sell and distribute this document
- is granted provided this copyright notice appears in all copies. This document
- is provided &quot;as is&quot; without express or implied warranty, and with
- no claim as to its suitability for any purpose. </font> </p>
+<font size="2">Distributed under
+  the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 </body>
 </html>

Modified: boost/trunk/libs/python/pyste/doc/the_interface_files.html
===================================================================
--- boost/trunk/libs/python/pyste/doc/the_interface_files.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/doc/the_interface_files.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -95,9 +95,8 @@
 </table>
 <br>
 <hr size="1"><p class="copyright">Copyright &copy; 2003 Bruno da Silva de Oliveira<br>Copyright &copy; 2002-2003 Joel de Guzman<br><br>
-<font size="2">Permission to copy, use, modify, sell and distribute this document
- is granted provided this copyright notice appears in all copies. This document
- is provided &quot;as is&quot; without express or implied warranty, and with
- no claim as to its suitability for any purpose. </font> </p>
+<font size="2">Distributed under
+  the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 </body>
 </html>

Modified: boost/trunk/libs/python/pyste/doc/theme/style.css
===================================================================
--- boost/trunk/libs/python/pyste/doc/theme/style.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/doc/theme/style.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,11 @@
+/*=============================================================================
+    Copyright (c) 2003 Bruno da Silva de Oliveira
+
+    Use, modification and distribution is subject to the Boost Software
+    License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+    http://www.boost.org/LICENSE_1_0.txt)
+=============================================================================*/
+
 body
 {
     background-image: url(bkd.gif);

Modified: boost/trunk/libs/python/pyste/doc/wrappers.html
===================================================================
--- boost/trunk/libs/python/pyste/doc/wrappers.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/doc/wrappers.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -117,9 +117,8 @@
 </table>
 <br>
 <hr size="1"><p class="copyright">Copyright &copy; 2003 Bruno da Silva de Oliveira<br>Copyright &copy; 2002-2003 Joel de Guzman<br><br>
-<font size="2">Permission to copy, use, modify, sell and distribute this document
- is granted provided this copyright notice appears in all copies. This document
- is provided &quot;as is&quot; without express or implied warranty, and with
- no claim as to its suitability for any purpose. </font> </p>
+<font size="2">Distributed under
+  the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 </body>
 </html>

Modified: boost/trunk/libs/python/pyste/index.html
===================================================================
--- boost/trunk/libs/python/pyste/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -83,9 +83,8 @@
 </table>
 <br>
 <hr size="1"><p class="copyright">Copyright &copy; 2003 Bruno da Silva de Oliveira<br>Copyright &copy; 2002-2003 Joel de Guzman<br><br>
-<font size="2">Permission to copy, use, modify, sell and distribute this document
- is granted provided this copyright notice appears in all copies. This document
- is provided &quot;as is&quot; without express or implied warranty, and with
- no claim as to its suitability for any purpose. </font> </p>
+<font size="2">Distributed under
+  the Boost Software License, Version 1.0. (See accompanying file
+  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 </body>
 </html>

Modified: boost/trunk/libs/python/pyste/install/pyste.py
===================================================================
--- boost/trunk/libs/python/pyste/install/pyste.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/install/pyste.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
 #!/usr/bin/env python
 
+# Copyright Bruno da Silva de Oliveira 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)
+
 from Pyste import pyste
 pyste.main()

Modified: boost/trunk/libs/python/pyste/install/setup.py
===================================================================
--- boost/trunk/libs/python/pyste/install/setup.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/install/setup.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,6 @@
-# contributed by Prabhu Ramachandran
+# Copyright Prabhu Ramachandran 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)
 
 from distutils.core import setup
 import sys

Deleted: boost/trunk/libs/python/pyste/src/Pyste/.cvsignore
===================================================================
--- boost/trunk/libs/python/pyste/src/Pyste/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/src/Pyste/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +0,0 @@
-*.pyc
-.project

Deleted: boost/trunk/libs/python/pyste/tests/.cvsignore
===================================================================
--- boost/trunk/libs/python/pyste/tests/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/pyste/tests/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +0,0 @@
-*.pyc
-*.exp
-*.lib
-*.obj
-*.arg
-*.dll
-.sconsign
-cache
-*.cpp
-*.pch
\ No newline at end of file

Modified: boost/trunk/libs/python/release_notes.txt
===================================================================
--- boost/trunk/libs/python/release_notes.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/release_notes.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+.. 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)
+
+These are old release notes for Boost.Python v1
+
 2000-11-22 10:00
     Ullrich fixed bug in operator_dispatcher<op_long>.
     

Modified: boost/trunk/libs/python/src/converter/builtin_converters.cpp
===================================================================
--- boost/trunk/libs/python/src/converter/builtin_converters.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/src/converter/builtin_converters.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -304,13 +304,16 @@
       static std::wstring extract(PyObject* intermediate)
       {
           std::wstring result(::PyObject_Length(intermediate), L' ');
-          int err = PyUnicode_AsWideChar(
-              (PyUnicodeObject *)intermediate
-            , result.size() ? &result[0] : 0
-            , result.size());
+          if (!result.empty())
+          {
+              int err = PyUnicode_AsWideChar(
+                  (PyUnicodeObject *)intermediate
+                , &result[0]
+                , result.size());
 
-          if (err == -1)
-              throw_error_already_set();
+              if (err == -1)
+                  throw_error_already_set();
+          }
           return result;
       }
   };

Modified: boost/trunk/libs/python/src/converter/type_id.cpp
===================================================================
--- boost/trunk/libs/python/src/converter/type_id.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/src/converter/type_id.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,7 +14,7 @@
 
 #if defined(__QNXNTO__)
 # include <ostream>
-#else 						/*	defined(__QNXNTO__)	*/
+#else                       /*  defined(__QNXNTO__) */
 
 #if !defined(__GNUC__) || __GNUC__ >= 3 || __SGI_STL_PORT || __EDG_VERSION__
 # include <ostream>
@@ -35,7 +35,7 @@
 #    include <cxxabi.h>
 #   endif
 #  endif 
-#endif 						/*	defined(__QNXNTO__)	*/
+#endif                      /*  defined(__QNXNTO__) */
 
 namespace boost { namespace python {
 
@@ -45,7 +45,7 @@
 namespace cxxabi {
 extern "C" char* __cxa_demangle(char const*, char*, std::size_t*, int*);
 }
-#   else 					/*	defined(__QNXNTO__)	*/
+#   else                    /*  defined(__QNXNTO__) */
 
 #    ifdef __GNUC__
 #     if __GNUC__ < 3
@@ -61,10 +61,10 @@
 {
   extern "C" char* __cxa_demangle(char const*, char*, std::size_t*, int*);
 }
-#      endif			/*	__GNUC__ == 3 && __GNUC_MINOR__ == 0	*/
-#     endif				/*	__GNUC__ < 3							*/
-#    endif 				/*	__GNUC__								*/ 
-#   endif 				/*	defined(__QNXNTO__)						*/ 
+#      endif            /*  __GNUC__ == 3 && __GNUC_MINOR__ == 0    */
+#     endif             /*  __GNUC__ < 3                            */
+#    endif              /*  __GNUC__                                */
+#   endif               /*  defined(__QNXNTO__)                     */
 
 namespace
 {

Modified: boost/trunk/libs/python/src/exec.cpp
===================================================================
--- boost/trunk/libs/python/src/exec.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/src/exec.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,7 +13,7 @@
 namespace python 
 {
 
-object exec(str string, object global, object local)
+object BOOST_PYTHON_DECL exec(str string, object global, object local)
 {
   // should be 'char const *' but older python versions don't use 'const' yet.
   char *s = python::extract<char *>(string);
@@ -25,7 +25,7 @@
 // Execute python source code from file filename.
 // global and local are the global and local scopes respectively,
 // used during execution.
-object exec_file(str filename, object global, object local)
+object BOOST_PYTHON_DECL exec_file(str filename, object global, object local)
 {
   // should be 'char const *' but older python versions don't use 'const' yet.
   char *f = python::extract<char *>(filename);
@@ -34,9 +34,9 @@
   if (!pyfile) throw std::invalid_argument(std::string(f) + " : no such file");
   python::handle<> file(pyfile);
   PyObject* result = PyRun_File(PyFile_AsFile(file.get()),
-				f,
-				Py_file_input,
-				global.ptr(), local.ptr());
+                f,
+                Py_file_input,
+                global.ptr(), local.ptr());
   if (!result) throw_error_already_set();
   return object(detail::new_reference(result));
 }

Modified: boost/trunk/libs/python/src/import.cpp
===================================================================
--- boost/trunk/libs/python/src/import.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/src/import.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,7 +13,7 @@
 namespace python 
 {
 
-object import(str name)
+object BOOST_PYTHON_DECL import(str name)
 {
   // should be 'char const *' but older python versions don't use 'const' yet.
   char *n = python::extract<char *>(name);

Modified: boost/trunk/libs/python/src/list.cpp
===================================================================
--- boost/trunk/libs/python/src/list.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/src/list.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,6 +3,7 @@
 // accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 #include <boost/python/list.hpp>
+#include <boost/python/ssize_t.hpp>
 
 namespace boost { namespace python { namespace detail {
 
@@ -53,7 +54,7 @@
     return result;
 }
 
-void list_base::insert(Py_ssize_t index, object_cref item)
+void list_base::insert(ssize_t index, object_cref item)
 {
     if (PyList_CheckExact(this->ptr()))
     {
@@ -79,7 +80,7 @@
     return this->attr("pop")();
 }
 
-object list_base::pop(Py_ssize_t index)
+object list_base::pop(ssize_t index)
 {
     return this->pop(object(index));
 }

Modified: boost/trunk/libs/python/src/numeric.cpp
===================================================================
--- boost/trunk/libs/python/src/numeric.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/src/numeric.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -90,8 +90,13 @@
     module_name = package_name ? package_name : "" ;
     type_name = type_attribute_name ? type_attribute_name : "" ;
 }
-  
 
+std::string array::get_module_name()
+{
+    load(false);
+    return module_name;
+}
+
 namespace aux
 {
   bool array_object_manager_traits::check(PyObject* obj)
@@ -173,9 +178,9 @@
       return extract<bool>(attr("isbyteswapped")());
   }
   
-  object array_base::new_(object type) const
+  array array_base::new_(object type) const
   {
-      return attr("new")(type);
+      return extract<array>(attr("new")(type))();
   }
   
   void array_base::sort()
@@ -197,15 +202,17 @@
   {
       return extract<char>(attr("typecode")());
   }
-  
-  object array_base::factory(object const& buffer
-        , object const& type
-        , object const& shape
+
+  object array_base::factory(
+          object const& sequence
+        , object const& typecode
         , bool copy
         , bool savespace
-        , object typecode)
+        , object type
+        , object shape
+  )
   {
-      return attr("array")(buffer, type, shape, copy, savespace, typecode);
+      return attr("factory")(sequence, typecode, copy, savespace, type, shape);
   }
 
   object array_base::getflat() const

Modified: boost/trunk/libs/python/src/object/class.cpp
===================================================================
--- boost/trunk/libs/python/src/object/class.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/src/object/class.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,6 +20,7 @@
 #include <boost/python/self.hpp>
 #include <boost/python/dict.hpp>
 #include <boost/python/str.hpp>
+#include <boost/python/ssize_t.hpp>
 #include <functional>
 #include <vector>
 #include <cstddef>
@@ -506,14 +507,14 @@
       // were declared, we'll use our class_type() as the single base
       // class.
       std::size_t const num_bases = (std::max)(num_types - 1, static_cast<std::size_t>(1));
-      assert(num_bases <= PY_SSIZE_T_MAX);
-      handle<> bases(PyTuple_New(static_cast<Py_ssize_t>(num_bases)));
+      assert(num_bases <= ssize_t_max);
+      handle<> bases(PyTuple_New(static_cast<ssize_t>(num_bases)));
 
       for (std::size_t i = 1; i <= num_bases; ++i)
       {
           type_handle c = (i >= num_types) ? class_type() : get_class(types[i]);
           // PyTuple_SET_ITEM steals this reference
-          PyTuple_SET_ITEM(bases.get(), static_cast<Py_ssize_t>(i - 1), upcast<PyObject>(c.release()));
+          PyTuple_SET_ITEM(bases.get(), static_cast<ssize_t>(i - 1), upcast<PyObject>(c.release()));
       }
 
       // Call the class metatype to create a new class
@@ -531,10 +532,6 @@
       if (scope().ptr() != Py_None)
           scope().attr(name) = result;
 
-      // For pickle. Will lead to informative error messages if pickling
-      // is not enabled.
-      result.attr("__reduce__") = object(make_instance_reduce_function());
-
       return result;
     }
   }
@@ -632,6 +629,7 @@
 
   void class_base::enable_pickling_(bool getstate_manages_dict)
   {
+      setattr("__reduce__", object(make_instance_reduce_function()));
       setattr("__safe_for_unpickling__", object(true));
       
       if (getstate_manages_dict)

Modified: boost/trunk/libs/python/src/object/function.cpp
===================================================================
--- boost/trunk/libs/python/src/object/function.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/src/object/function.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,6 +14,7 @@
 #include <boost/python/extract.hpp>
 #include <boost/python/tuple.hpp>
 #include <boost/python/list.hpp>
+#include <boost/python/ssize_t.hpp>
 
 #include <boost/python/detail/signature.hpp>
 #include <boost/mpl/vector/vector10.hpp>
@@ -64,7 +65,7 @@
             = max_arity > num_keywords ? max_arity - num_keywords : 0;
 
 
-        Py_ssize_t tuple_size = num_keywords ? max_arity : 0;
+        ssize_t tuple_size = num_keywords ? max_arity : 0;
         m_arg_names = object(handle<>(PyTuple_New(tuple_size)));
 
         if (num_keywords != 0)
@@ -158,9 +159,9 @@
                     else
                     {
                         // build a new arg tuple, will adjust its size later
-                        assert(max_arity <= PY_SSIZE_T_MAX);
+                        assert(max_arity <= ssize_t_max);
                         inner_args = handle<>(
-                            PyTuple_New(static_cast<Py_ssize_t>(max_arity)));
+                            PyTuple_New(static_cast<ssize_t>(max_arity)));
 
                         // Fill in the positional arguments
                         for (std::size_t i = 0; i < n_unnamed_actual; ++i)
@@ -295,7 +296,7 @@
         % make_tuple(this->m_namespace, this->m_name);
     
     list actual_args;
-    for (Py_ssize_t i = 0; i < PyTuple_Size(args); ++i)
+    for (ssize_t i = 0; i < PyTuple_Size(args); ++i)
     {
         char const* name = PyTuple_GetItem(args, i)->ob_type->tp_name;
         actual_args.append(str(name));

Modified: boost/trunk/libs/python/src/object/pickle_support.cpp
===================================================================
--- boost/trunk/libs/python/src/object/pickle_support.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/src/object/pickle_support.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,7 +8,6 @@
 #include <boost/python/tuple.hpp>
 #include <boost/python/list.hpp>
 #include <boost/python/dict.hpp>
-#include <boost/python/str.hpp>
 
 namespace boost { namespace python {
 
@@ -20,22 +19,6 @@
       object instance_class(instance_obj.attr("__class__"));
       result.append(instance_class);
       object none;
-      if (!getattr(instance_obj, "__safe_for_unpickling__", none))
-      {
-          str type_name(getattr(instance_class, "__name__"));
-          str module_name(getattr(instance_class, "__module__", object("")));
-          if (module_name)
-              module_name += ".";
-
-          PyErr_SetObject(
-               PyExc_RuntimeError,
-               ( "Pickling of \"%s\" instances is not enabled"
-                 " (http://www.boost.org/libs/python/doc/v2/pickle.html)"
-                  % (module_name+type_name)).ptr()
-          );
-
-          throw_error_already_set();
-      }
       object getinitargs = getattr(instance_obj, "__getinitargs__", none);
       tuple initargs;
       if (getinitargs.ptr() != none.ptr()) {

Modified: boost/trunk/libs/python/src/object_operators.cpp
===================================================================
--- boost/trunk/libs/python/src/object_operators.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/src/object_operators.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,6 +8,24 @@
 
 namespace boost { namespace python { namespace api {
 
+# define BOOST_PYTHON_COMPARE_OP(op, opid)                              \
+BOOST_PYTHON_DECL object operator op(object const& l, object const& r)  \
+{                                                                       \
+    return object(                                                      \
+        detail::new_reference(                                          \
+            PyObject_RichCompare(                                       \
+                l.ptr(), r.ptr(), opid))                                \
+            );                                                          \
+}
+BOOST_PYTHON_COMPARE_OP(>, Py_GT)
+BOOST_PYTHON_COMPARE_OP(>=, Py_GE)
+BOOST_PYTHON_COMPARE_OP(<, Py_LT)
+BOOST_PYTHON_COMPARE_OP(<=, Py_LE)
+BOOST_PYTHON_COMPARE_OP(==, Py_EQ)
+BOOST_PYTHON_COMPARE_OP(!=, Py_NE)
+# undef BOOST_PYTHON_COMPARE_OP
+    
+
 #define BOOST_PYTHON_BINARY_OPERATOR(op, name)                          \
 BOOST_PYTHON_DECL object operator op(object const& l, object const& r)  \
 {                                                                       \

Modified: boost/trunk/libs/python/src/object_protocol.cpp
===================================================================
--- boost/trunk/libs/python/src/object_protocol.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/src/object_protocol.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,6 +6,7 @@
 #include <boost/python/object_protocol.hpp>
 #include <boost/python/errors.hpp>
 #include <boost/python/object.hpp>
+#include <boost/python/ssize_t.hpp>
 
 namespace boost { namespace python { namespace api {
 
@@ -106,7 +107,7 @@
       PySequenceMethods *sq = tp->tp_as_sequence;
 
       if (sq && sq->sq_slice && ISINT(v) && ISINT(w)) {
-          Py_ssize_t ilow = 0, ihigh = PY_SSIZE_T_MAX;
+          ssize_t ilow = 0, ihigh = ssize_t_max;
           if (!_PyEval_SliceIndex(v, &ilow))
               return NULL;
           if (!_PyEval_SliceIndex(w, &ihigh))
@@ -133,7 +134,7 @@
       PySequenceMethods *sq = tp->tp_as_sequence;
 
       if (sq && sq->sq_slice && ISINT(v) && ISINT(w)) {
-          Py_ssize_t ilow = 0, ihigh = PY_SSIZE_T_MAX;
+          ssize_t ilow = 0, ihigh = ssize_t_max;
           if (!_PyEval_SliceIndex(v, &ilow))
               return -1;
           if (!_PyEval_SliceIndex(w, &ihigh))

Modified: boost/trunk/libs/python/src/str.cpp
===================================================================
--- boost/trunk/libs/python/src/str.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/src/str.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,6 +3,7 @@
 // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #include <boost/python/str.hpp>
 #include <boost/python/extract.hpp>
+#include <boost/python/ssize_t.hpp>
 
 namespace boost { namespace python { namespace detail {
 
@@ -23,13 +24,13 @@
 
 namespace {
 
-    Py_ssize_t str_size_as_py_ssize_t(std::size_t n)
+    ssize_t str_size_as_py_ssize_t(std::size_t n)
     {
-      if (n > PY_SSIZE_T_MAX)
+      if (n > ssize_t_max)
       {
-          throw std::range_error("str size > PY_SSIZE_T_MAX");
+          throw std::range_error("str size > ssize_t_max");
       }
-      return static_cast<Py_ssize_t>(n);
+      return static_cast<ssize_t>(n);
     }
 
 } // namespace <anonymous>

Deleted: boost/trunk/libs/python/test/Jamfile
===================================================================
--- boost/trunk/libs/python/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,233 +0,0 @@
-#
-# To run all tests quietly: jam test
-# To run all tests with verbose output: jam -sPYTHON_TEST_ARGS=-v test
-#
-subproject libs/python/test ;
-
-# bring in the rules for python and testing
-import python ;
-
-if [ check-python-config ]
-{
-
-# A bug in the Win32 intel compilers causes compilation of one of our
-# tests to take forever when debug symbols are enabled. This rule
-# turns them off when added to the requirements section
-rule turn-off-intel-debug-symbols ( toolset variant : properties * )
-{
-    if $(NT) && [ MATCH (.*intel.*) : $(toolset) ]
-    {
-        properties = [ difference $(properties) : <debug-symbols>on ] <debug-symbols>off ;
-    }
-    return $(properties) ;
-}
-
-# Some tests hang when compiled with HP-CXX and executed on Tru64.
-rule disable-for-cxx-tru64 ( toolset variant : properties * )
-{
-    if $(UNIX) && $(OS) = OSF
-    {
-        switch $(toolset)
-        {
-            case tru64cxx* : properties =
-                [ replace-properties $(properties) : <build>no ] ;
-        }
-    }
-    return $(properties) ;
-}
-
-template py-unit-test
-  :
-  : $(PYTHON_PROPERTIES) <define>BOOST_PYTHON_SUPPRESS_REGISTRY_INITIALIZATION
-    [ difference $(PYTHON_PROPERTIES) : <define>BOOST_PYTHON_DYNAMIC_LIB ] <define>BOOST_PYTHON_STATIC_LIB
-      ;
-  
-# Convenience rule makes declaring tests faster
-rule bpl-test ( name ? : files * : requirements * )
-{
-    files ?= $(name).py $(name).cpp ;
-
-    local modules ;
-    local py ;
-    for local f in $(files)
-    {
-        if $(f:S) = .py
-        {
-            if $(py)
-            {
-                EXIT too many python drivers specified: "$(py)" "$(f)" ;
-            }
-            py = $(f) ;
-        }
-    }
-
-    name ?= $(py:S=) ;
-
-    for local f in $(files)
-    {
-        if $(f:S) != .py
-        {
-            local m = $(f:S=) ;
-
-            if $(m) = $(py:S=)
-            {
-                m = $(name) ;
-
-                if $(m) = $(py:S=)
-                {
-                    m = $(m)_ext ;
-                }
-            }
-            extension $(m) : $(f) <template>../build/extension : $(requirements) ;
-            modules += $(m) ;
-        }
-    }
-
-    return [ boost-python-runtest $(name) : $(py) <pyd>$(modules) : $(requirements) : : -v ] ;
-}
-
-test-suite python
-  :
-  [
-    run ../test/exec.cpp <lib>../build/boost_python
-      : # program args
-      : exec.py
-      : # requirements
-      $(PYTHON_PROPERTIES)
-        <define>BOOST_PYTHON_STATIC_LIB
-        <define>BOOST_PYTHON_STATIC_MODULE
-        <library-path>$(PYTHON_LIB_PATH)
-          <$(gcc-compilers)><debug-python><library-path>$(CYGWIN_PYTHON_DEBUG_DLL_PATH)
-            <$(gcc-compilers)><*><library-path>$(CYGWIN_PYTHON_DLL_PATH)
-              <find-library>$(PYTHON_EMBEDDED_LIBRARY)
-  ]
-
-[
-bpl-test crossmod_exception
-  : crossmod_exception.py crossmod_exception_a.cpp crossmod_exception_b.cpp
-]
-
-[ bpl-test injected ]
-[ bpl-test properties ]
-[ bpl-test return_arg ]
-[ bpl-test staticmethod ]
-[ bpl-test shared_ptr ]
-[ bpl-test andreas_beyer ]
-[ bpl-test polymorphism ]
-[ bpl-test polymorphism2 ]
-  
-[ bpl-test wrapper_held_type ]
-[ bpl-test polymorphism2_auto_ptr ]
-  
-[ bpl-test auto_ptr ]
-[ bpl-test minimal ]
-[ bpl-test args ]
-[ bpl-test raw_ctor ]
-[ bpl-test numpy ]
-[ bpl-test enum ]
-[ bpl-test exception_translator ]
-[ bpl-test pearu1 : test_cltree.py cltree.cpp ]
-[ bpl-test try : newtest.py m1.cpp m2.cpp ]
-[ bpl-test const_argument ]
-
-[ bpl-test keywords : keywords.cpp keywords_test.py ]
-
-[ extension builtin_converters : test_builtin_converters.cpp <template>../build/extension ]
-[ boost-python-runtest builtin_converters : test_builtin_converters.py <pyd>builtin_converters : : : -v ]
-
-[ bpl-test test_pointer_adoption ]
-[ bpl-test operators ]
-[ bpl-test callbacks ]
-[ bpl-test defaults ]
-
-[ bpl-test object ]
-[ bpl-test list ]
-[ bpl-test long ]
-[ bpl-test dict ]
-[ bpl-test tuple ]
-[ bpl-test str ]
-[ bpl-test slice ]
-
-[ bpl-test virtual_functions ]
-[ bpl-test back_reference ]
-[ bpl-test implicit ]
-[ bpl-test data_members ]
-
-[ bpl-test ben_scott1 ]
-
-[ bpl-test bienstman1 ]
-[ bpl-test bienstman2 ]
-[ bpl-test bienstman3 ]
-
-[ bpl-test multi_arg_constructor
-  : # files
-  : # requirements
-  turn-off-intel-debug-symbols ] # debug symbols slow the build down too much
-
-[ bpl-test iterator : iterator.py iterator.cpp input_iterator.cpp ]
-
-[ bpl-test stl_iterator : stl_iterator.py stl_iterator.cpp ]
-
-[ bpl-test extract ]
-
-[ bpl-test opaque ]
-[ bpl-test voidptr ]
-
-[ bpl-test pickle1 ]
-[ bpl-test pickle2 ]
-[ bpl-test pickle3 ]
-[ bpl-test pickle4 ]
-
-[ bpl-test nested ]
-
-[ bpl-test docstring ]
-
-[ bpl-test vector_indexing_suite ]
-[ bpl-test pointer_vector
-  : # files
-  : # requirements
-  disable-for-cxx-tru64 # Runs forever when executed.
-]
-
-[ extension map_indexing_suite_ext
-    : map_indexing_suite.cpp int_map_indexing_suite.cpp <template>../build/extension ]
-      
-[ boost-python-runtest 
-    map_indexing_suite : map_indexing_suite.py <pyd>map_indexing_suite_ext : : : -v ]
-
-# if $(TEST_BIENSTMAN_NON_BUGS)
-# {
-#     bpl-test bienstman4 ;
-#     bpl-test bienstman5 ;
-# }
-
-# --- unit tests of library components ---
-
-[ compile indirect_traits_test.cpp ]
-[ run destroy_test.cpp ]
-[ run pointer_type_id_test.cpp <template>py-unit-test ]
-[ run bases.cpp  <template>py-unit-test ]
-[ run if_else.cpp ]
-[ run pointee.cpp  <template>py-unit-test ]
-[ run result.cpp ]
-
-[ compile string_literal.cpp ]
-[ compile borrowed.cpp  <template>py-unit-test ]
-[ compile object_manager.cpp   <template>py-unit-test ]
-[ compile copy_ctor_mutates_rhs.cpp   <template>py-unit-test ]
-
-[ run upcast.cpp <template>py-unit-test ]
-  
-[ compile select_holder.cpp <template>py-unit-test ]
-  
-[ run select_from_python_test.cpp ../src/converter/type_id.cpp
-  <template>py-unit-test ]
-
-[ compile select_arg_to_python_test.cpp <template>py-unit-test ]
-
-[ compile-fail ./raw_pyobject_fail1.cpp <template>py-unit-test ]
-[ compile-fail ./raw_pyobject_fail2.cpp <template>py-unit-test ]
-[ compile-fail ./as_to_python_function.cpp <template>py-unit-test ]
-[ compile-fail ./object_fail1.cpp <template>py-unit-test ]
-  ;
-}

Modified: boost/trunk/libs/python/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/python/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+# 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)
 
 use-project /boost/python : ../build ;
 project /boost/python/test ;
@@ -2,7 +5,11 @@
 
-project : requirements <threading>multi ;
-
 rule py-run ( sources * )
 {
-    return [ run $(sources) /boost/python//boost_python ] ;
+    return [ run $(sources) /boost/python//boost_python /python//python
+      : # args
+      : # input files
+      : #requirements
+        <define>BOOST_PYTHON_SUPPRESS_REGISTRY_INITIALIZATION
+ 
+    ] ;
 }
@@ -20,11 +27,7 @@
 }
 
 
-project :
-     requirements <define>BOOST_PYTHON_SUPPRESS_REGISTRY_INITIALIZATION
-     ;
 
-
 #template py-unit-test
 #  :
 #  : $(PYTHON_PROPERTIES) <define>BOOST_PYTHON_SUPPRESS_REGISTRY_INITIALIZATION
@@ -36,7 +39,7 @@
   :
 
   [
-    run exec.cpp ../build//boost_python/<link>static
+    run exec.cpp ../build//boost_python/<link>static /python//python
       : # program args
       : exec.py
       : # requirements
@@ -65,7 +68,7 @@
 [ bpl-test minimal ]
 [ bpl-test args ]
 [ bpl-test raw_ctor ]
-[ bpl-test numpy ]
+[ bpl-test numpy : numpy.py printer.py numeric_tests.py numarray_tests.py numpy.cpp ]
 [ bpl-test enum ]
 [ bpl-test exception_translator ]
 [ bpl-test pearu1 : test_cltree.py cltree.cpp ]
@@ -116,6 +119,10 @@
 
 [ bpl-test extract ]
 
+[
+bpl-test crossmod_opaque
+  : crossmod_opaque.py crossmod_opaque_a.cpp crossmod_opaque_b.cpp
+]
 [ bpl-test opaque ]
 [ bpl-test voidptr ]
 

Modified: boost/trunk/libs/python/test/andreas_beyer.cpp
===================================================================
--- boost/trunk/libs/python/test/andreas_beyer.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/andreas_beyer.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+// 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)
 #include <boost/python.hpp>
 #include <boost/enable_shared_from_this.hpp>
 #include <boost/shared_ptr.hpp>

Modified: boost/trunk/libs/python/test/args.cpp
===================================================================
--- boost/trunk/libs/python/test/args.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/args.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,6 +14,10 @@
 
 using namespace boost::python;
 
+#if BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x580))
+# define make_tuple boost::python::make_tuple
+#endif 
+
 tuple f(int x = 1, double y = 4.25, char const* z = "wow")
 {
     return make_tuple(x, y, z);

Modified: boost/trunk/libs/python/test/args.py
===================================================================
--- boost/trunk/libs/python/test/args.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/args.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -84,8 +84,6 @@
 (2, 4.25, 'wow')
 >>> q.f1()
 (1, 4.25, 'wow')
->>> q.f2.__doc__.splitlines()[-3]
-"f2's docstring"
 
 >>> X.f.__doc__.splitlines()[:2]
 ["This is X.f's docstring", 'C++ signature:']

Modified: boost/trunk/libs/python/test/crossmod_exception.py
===================================================================
--- boost/trunk/libs/python/test/crossmod_exception.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/crossmod_exception.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,6 @@
-# Copyright (C) 2003 Rational Discovery LLC
-# Permission to copy, use, modify, sell and distribute this software
-# is granted provided this copyright notice appears in all
-# copies. This software is provided "as is" without express or
-# implied warranty, and with no claim as to its suitability for any
-# purpose.
+# Copyright (C) 2003 Rational Discovery LLC.  Distributed under the Boost
+# Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy
+# at http://www.boost.org/LICENSE_1_0.txt)
 
 print "running..."
 

Copied: boost/trunk/libs/python/test/crossmod_opaque.py (from rev 14034, boost/branches/upstream/current/libs/python/test/crossmod_opaque.py)

Copied: boost/trunk/libs/python/test/crossmod_opaque_a.cpp (from rev 14034, boost/branches/upstream/current/libs/python/test/crossmod_opaque_a.cpp)

Copied: boost/trunk/libs/python/test/crossmod_opaque_b.cpp (from rev 14034, boost/branches/upstream/current/libs/python/test/crossmod_opaque_b.cpp)

Modified: boost/trunk/libs/python/test/defaults.cpp
===================================================================
--- boost/trunk/libs/python/test/defaults.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/defaults.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,6 +17,10 @@
 
 using namespace boost::python;
 
+#if BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x580))
+# define make_tuple boost::python::make_tuple
+#endif 
+
 char const* const format = "int(%s); char(%s); string(%s); double(%s); ";
 
 ///////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/python/test/exec.cpp
===================================================================
--- boost/trunk/libs/python/test/exec.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/exec.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -54,7 +54,7 @@
   // Register the module with the interpreter
   if (PyImport_AppendInittab("embedded_hello", initembedded_hello) == -1)
     throw std::runtime_error("Failed to add embedded_hello to the interpreter's "
-			     "builtin modules");
+                 "builtin modules");
   // Retrieve the main module
   python::object main = python::import("__main__");
   

Modified: boost/trunk/libs/python/test/exec.py
===================================================================
--- boost/trunk/libs/python/test/exec.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/exec.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,6 @@
+# Copyright Stefan Seefeld 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)
+
 print 'Hello World !'
 number = 42

Modified: boost/trunk/libs/python/test/keywords.cpp
===================================================================
--- boost/trunk/libs/python/test/keywords.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/keywords.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -103,7 +103,6 @@
                , init<optional<int, double, const std::string &> >()
    )
       .def("set", &Bar::set, bar_set())
-      .def("set2", &Bar::set, bar_set("set2's docstring"))
       .def("seta", &Bar::seta, arg("a"))
        
       .def("a", &Bar::geta)

Modified: boost/trunk/libs/python/test/keywords_test.py
===================================================================
--- boost/trunk/libs/python/test/keywords_test.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/keywords_test.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -80,8 +80,6 @@
 >>> f.set(1,1.0,"1")
 >>> f.a(), f.b(), f.n()
 (1, 1.0, '1')
->>> f.set2.__doc__.splitlines()[-3]
-"set2's docstring"
 '''
 
 

Modified: boost/trunk/libs/python/test/module_tail.cpp
===================================================================
--- boost/trunk/libs/python/test/module_tail.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/module_tail.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -32,7 +32,7 @@
 #include <boost/python/str.hpp>
 struct test_failure : std::exception
 {
-    test_failure(char const* expr, char const* /*function*/, char const* file, unsigned line)
+    test_failure(char const* expr, char const* function, char const* file, unsigned line)
       : msg(file + boost::python::str(":%s:") % line + ": Boost.Python assertion failure: " + expr)
     {}
 

Copied: boost/trunk/libs/python/test/numarray_tests.py (from rev 14034, boost/branches/upstream/current/libs/python/test/numarray_tests.py)

Copied: boost/trunk/libs/python/test/numeric_tests.py (from rev 14034, boost/branches/upstream/current/libs/python/test/numeric_tests.py)

Modified: boost/trunk/libs/python/test/numpy.cpp
===================================================================
--- boost/trunk/libs/python/test/numpy.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/numpy.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,9 +7,14 @@
 #include <boost/python/tuple.hpp>
 #include <boost/python/module.hpp>
 #include <boost/python/def.hpp>
+#include <boost/python/str.hpp>
 
 using namespace boost::python;
 
+#if BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x580))
+# define make_tuple boost::python::make_tuple
+#endif 
+
 // See if we can invoke array() from C++
 object new_array()
 {
@@ -35,16 +40,42 @@
     z.info();
 }
 
+namespace
+{
+  object handle_error()
+  {
+      PyObject* type, *value, *traceback;                                 
+      PyErr_Fetch(&type, &value, &traceback);                             
+      handle<> ty(type), v(value), tr(traceback);
+      return object("exception");
+      str format("exception type: %sn");                                 
+      format += "exception value: %sn";                                  
+      format += "traceback:n%s" ;                                        
+      object ret = format % boost::python::make_tuple(ty, v, tr);
+      return ret;
+  }
+}
+#define CHECK(expr)                                                         \
+{                                                                           \
+    object result;                                                          \
+    try { result = object(expr); }                                          \
+    catch(error_already_set)                                                \
+    {                                                                       \
+        result = handle_error();                                            \
+    }                                                                       \
+    check(result);                                                          \
+}
+
 // Tests which work on both Numeric and numarray array objects. Of
 // course all of the operators "just work" since numeric::array
 // inherits that behavior from object.
 void exercise(numeric::array& y, object check)
 {
     y[make_tuple(2,1)] = 3;
-    check(y);
-    check(y.astype('D'));
-    check(y.copy());
-    check(y.typecode());
+    CHECK(y);
+    CHECK(y.astype('D'));
+    CHECK(y.copy());
+    CHECK(y.typecode());
 }
 
 // numarray-specific tests.  check is a callable object which we can
@@ -52,43 +83,46 @@
 // the results of corresponding python operations.
 void exercise_numarray(numeric::array& y, object check)
 {
-    check(y.astype());
+    CHECK(str(y));
     
-    check(y.argmax());
-    check(y.argmax(0));
+    CHECK(y.argmax());
+    CHECK(y.argmax(0));
     
-    check(y.argmin());
-    check(y.argmin(0));
+    CHECK(y.argmin());
+    CHECK(y.argmin(0));
     
-    check(y.argsort());
-    check(y.argsort(1));
+    CHECK(y.argsort());
+    CHECK(y.argsort(1));
 
     y.byteswap();
-    check(y);
+    CHECK(y);
     
-    check(y.diagonal());
-    check(y.diagonal(1));
-    check(y.diagonal(0, 1));
-    check(y.diagonal(0, 1, 0));
+    CHECK(y.diagonal());
+    CHECK(y.diagonal(1));
+    CHECK(y.diagonal(0, 0));
+    CHECK(y.diagonal(0, 1, 0));
 
-    check(y.is_c_array());
-    check(y.isbyteswapped());
+    CHECK(y.is_c_array());
+    CHECK(y.isbyteswapped());
 
-    check(y.trace());
-    check(y.trace(1));
-    check(y.trace(0, 1));
-    check(y.trace(0, 1, 0));
+    CHECK(y.trace());
+    CHECK(y.trace(1));
+    CHECK(y.trace(0, 0));
+    CHECK(y.trace(0, 1, 0));
 
-    check(y.new_('D'));
+    CHECK(y.new_("D").getshape());
+    CHECK(y.new_("D").type());
     y.sort();
-    check(y);
-    check(y.type());
+    CHECK(y);
+    CHECK(y.type());
 
-    check(y.factory(make_tuple(1.2, 3.4)));
-    check(y.factory(make_tuple(1.2, 3.4), "Double"));
-    check(y.factory(make_tuple(1.2, 3.4), "Double", make_tuple(1,2,1)));
-    check(y.factory(make_tuple(1.2, 3.4), "Double", make_tuple(2,1,1), false));
-    check(y.factory(make_tuple(1.2, 3.4), "Double", make_tuple(2), true, true));
+    CHECK(y.factory(make_tuple(1.2, 3.4)));
+    CHECK(y.factory(make_tuple(1.2, 3.4), "f8"));
+    CHECK(y.factory(make_tuple(1.2, 3.4), "f8", true));
+    CHECK(y.factory(make_tuple(1.2, 3.4), "f8", true, false));
+    CHECK(y.factory(make_tuple(1.2, 3.4), "f8", true, false, object()));
+    CHECK (y.factory(make_tuple(1.2, 3.4), "f8", true, false, object(), make_tuple(1,2,1)));
+
 }
 
 BOOST_PYTHON_MODULE(numpy_ext)
@@ -98,6 +132,7 @@
     def("exercise", exercise);
     def("exercise_numarray", exercise_numarray);
     def("set_module_and_type", &numeric::array::set_module_and_type);
+    def("get_module_name", &numeric::array::get_module_name);
     def("info", info);
 }
 

Modified: boost/trunk/libs/python/test/numpy.py
===================================================================
--- boost/trunk/libs/python/test/numpy.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/numpy.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,141 +2,36 @@
 # Software License, Version 1.0. (See accompanying
 # file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
-# Unfortunately the doctest module works differently in Python versions
-# 2.2, 2.3, and 2.4. Newer versions evaluate all docstrings, even that
-# of objects with names starting with an underscore. To portably disable
-# tests based on the availability of Numeric and numarray, the corresponding
-# test functions are simply deleted below if necessary.
-
-def numeric_tests():
-    '''
-    >>> from numpy_ext import *
-    >>> x = new_array()
-    >>> x[1,1] = 0.0
-
-    >>> try: take_array(3)
-    ... except TypeError: pass
-    ... else: print 'expected a TypeError'
-
-    >>> take_array(x)
-
-    >>> print x
-    [[1 2 3]
-     [4 0 6]
-     [7 8 9]]
-
-    >>> y = x.copy()
-
-
-    >>> p = _printer()
-    >>> check = p.check
-    >>> exercise(x, p)
-    >>> y[2,1] = 3
-    >>> check(y);
-
-    >>> check(y.astype('D'));
-
-    >>> check(y.copy());
-
-    >>> check(y.typecode());
-
-    >>> p.results
-    []
-    >>> del p
-    '''
-    pass
-
-def _numarray_tests():
-    '''
-    >>> from numpy_ext import *
-    >>> x = new_array()
-    >>> y = x.copy()
-    >>> p = _printer()
-    >>> check = p.check
-    >>> exercise_numarray(x, p)
-
-    >>> check(y.astype());
-
-    >>> check(y.argmax());
-    >>> check(y.argmax(0));
-
-    >>> check(y.argmin());
-    >>> check(y.argmin(0));
-
-    >>> check(y.argsort());
-    >>> check(y.argsort(1));
-    
-    >>> y.byteswap();
-    >>> check(y);
-
-    >>> check(y.diagonal());
-    >>> check(y.diagonal(1));
-    >>> check(y.diagonal(0, 1));
-    >>> check(y.diagonal(0, 1, 0));
-
-    >>> check(y.is_c_array());
-    >>> check(y.isbyteswapped());
-
-    >>> check(y.trace());
-    >>> check(y.trace(1));
-    >>> check(y.trace(0, 1));
-    >>> check(y.trace(0, 1, 0));
-
-    >>> check(y.new('D'));
-    >>> y.sort();
-    >>> check(y);
-    >>> check(y.type());
-
-    >>> check(y.array((1.2, 3.4)));
-    >>> check(y.array((1.2, 3.4), "Double"));
-    >>> check(y.array((1.2, 3.4), "Double", (1,2,1)));
-    >>> check(y.array((1.2, 3.4), "Double", (2,1,1), false));
-    >>> check(y.array((1.2, 3.4), "Double", (2,), true, true));
-    
-    >>> p.results
-    []
-    >>> del p
-    '''
-    pass
-
 false = 0;
 true = 1;
-class _printer(object):
-    def __init__(self):
-        self.results = [];
-    def __call__(self, *stuff):
-        self.results += [ str(x) for x in stuff ]
-    def check(self, x):
-        if self.results[0] == str(x):
-            del self.results[0]
-        else:
-            print '  Expected:\n %s\n  but got:\n %s' % (x, self.results[0])
 
+import doctest, numeric_tests
+def _count_failures(test_modules = (numeric_tests,)):
+    failures = 0
+    for m in test_modules:
+        failures += doctest.testmod(m)[0]
+    return failures
+
 def _run(args = None):
-    import sys
-    import doctest
+    import sys, numarray_tests, numeric_tests
 
     if args is not None:
         sys.argv = args
 
     # See which of the numeric modules are installed
     has_numeric = 0
-    try:
-        import Numeric
-        m = Numeric
+    try: import Numeric
+    except ImportError: pass
+    else:
         has_numeric = 1
-    except ImportError:
-      global numeric_tests
-      numeric_tests = None
+        m = Numeric
 
     has_numarray = 0
-    try:
-        import numarray
-        m = numarray
+    try: import numarray
+    except ImportError: pass
+    else:
         has_numarray = 1
-    except ImportError:
-      global _numarray_tests
-      _numarray_tests = None
+        m = numarray
     
     # Bail if neither one is installed
     if not (has_numeric or has_numarray):
@@ -156,31 +51,32 @@
     #
     
     # run all the tests with default module search
-    print 'testing default extension module'
-    failures += doctest.testmod(sys.modules.get(__name__))[0]
+    print 'testing default extension module:', \
+          numpy_ext.get_module_name() or '[numeric support not installed]'
 
+    failures += _count_failures()
+        
     # test against Numeric if installed
     if has_numeric:
         print 'testing Numeric module explicitly'
         numpy_ext.set_module_and_type('Numeric', 'ArrayType')
-        failures += doctest.testmod(sys.modules.get(__name__))[0]
-    
-    global __test__
+        
+        failures += _count_failures()
+            
     if has_numarray:
-        # Add the _numarray_tests to the list of things to test in
-        # this case.
-        __test__ = { 'numarray_tests':_numarray_tests,
-                     'numeric_tests': numeric_tests }
         print 'testing numarray module explicitly'
         numpy_ext.set_module_and_type('numarray', 'NDArray')
-        failures += doctest.testmod(sys.modules.get(__name__))[0]
-        del __test__
+        # Add the _numarray_tests to the list of things to test in
+        # this case.
+        failures += _count_failures((numarray_tests, numeric_tests))
 
     # see that we can go back to the default
-    print 'testing default module again'
     numpy_ext.set_module_and_type('', '')
-    failures += doctest.testmod(sys.modules.get(__name__))[0]
+    print 'testing default module again:', \
+          numpy_ext.get_module_name() or '[numeric support not installed]'
     
+    failures += _count_failures()
+    
     return failures
     
 if __name__ == '__main__':

Modified: boost/trunk/libs/python/test/opaque.py
===================================================================
--- boost/trunk/libs/python/test/opaque.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/opaque.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,9 @@
 # -*- coding: iso-latin-1 -*-
-# Copyright Gottfried Ganßauge 2003. Permission to copy, use,
-# modify, sell and distribute this software is granted provided this
-# copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as
-# to its suitability for any purpose.
+# Copyright Gottfried Ganßauge 2003..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)
 
+
 """
 >>> from opaque_ext import *
 
@@ -66,6 +65,11 @@
 >>> try: use2(get())
 ... except TypeError: pass
 ... else: print 'expected a TypeError'
+
+   This used to result in a segmentation violation
+
+>>> type(get()) != type (get2())
+1
 """
 def run(args = None):
     import sys

Copied: boost/trunk/libs/python/test/operators_wrapper.cpp (from rev 14034, boost/branches/upstream/current/libs/python/test/operators_wrapper.cpp)

Copied: boost/trunk/libs/python/test/operators_wrapper.py (from rev 14034, boost/branches/upstream/current/libs/python/test/operators_wrapper.py)

Modified: boost/trunk/libs/python/test/pickle1.cpp
===================================================================
--- boost/trunk/libs/python/test/pickle1.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/pickle1.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -45,8 +45,6 @@
     }
   };
 
-  // To support test of "pickling not enabled" error message.
-  struct noop {};
 }
 
 BOOST_PYTHON_MODULE(pickle1_ext)
@@ -56,7 +54,4 @@
       .def("greet", &world::greet)
       .def_pickle(world_pickle_suite())
       ;
-
-  // To support test of "pickling not enabled" error message.
-  class_<noop>("noop");
 }

Modified: boost/trunk/libs/python/test/pickle1.py
===================================================================
--- boost/trunk/libs/python/test/pickle1.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/pickle1.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,11 +18,6 @@
     Hello from California!
     >>> print wl.greet()
     Hello from California!
-
-    >>> noop = pickle1_ext.noop()
-    >>> try: pickle.dumps(noop)
-    ... except RuntimeError, e: print str(e)[:55]
-    Pickling of "pickle1_ext.noop" instances is not enabled
 '''
 
 def run(args = None):

Modified: boost/trunk/libs/python/test/pickle3.cpp
===================================================================
--- boost/trunk/libs/python/test/pickle3.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/pickle3.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -25,6 +25,10 @@
 #include <boost/python/extract.hpp>
 #include <boost/python/back_reference.hpp>
 
+#if BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x580))
+# define make_tuple boost::python::make_tuple
+#endif 
+
 namespace { // Avoid cluttering the global namespace.
 
   // A friendly class.

Modified: boost/trunk/libs/python/test/pointer_vector.cpp
===================================================================
--- boost/trunk/libs/python/test/pointer_vector.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/pointer_vector.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,6 @@
+// Copyright Joel de Guzman 2005-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)
 #include <boost/python.hpp>
 #include <boost/python/suite/indexing/vector_indexing_suite.hpp>
 #include <vector>

Copied: boost/trunk/libs/python/test/printer.py (from rev 14034, boost/branches/upstream/current/libs/python/test/printer.py)

Modified: boost/trunk/libs/python/test/slice.cpp
===================================================================
--- boost/trunk/libs/python/test/slice.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/slice.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,6 @@
 #include <boost/python.hpp>
 #include <boost/python/slice.hpp>
+#include <boost/python/str.hpp>
 #include <vector>
 
 // Copyright (c) 2004 Jonathan Brandmeyer
@@ -9,6 +10,10 @@
 
 using namespace boost::python;
 
+#if BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x580))
+# define make_tuple boost::python::make_tuple
+#endif 
+
 // These checks are only valid under Python 2.3
 // (rich slicing wasn't supported for builtins under Python 2.2)
 bool check_string_rich_slice()
@@ -39,10 +44,21 @@
     return s[slice(2,-1)][slice(1,-1)]  == "lo, wor";
 }
 
+// Tried to get more info into the error message (actual array
+// contents) but Numeric complains that treating an array as a boolean
+// value doesn't make any sense.
+#define ASSERT_EQUAL( e1, e2 ) \
+    if (!all((e1) == (e2)))                                                             \
+        return "assertion failed: " #e1 " == " #e2 "\nLHS:\n%s\nRHS:\n%s" % make_tuple(e1,e2);    \
+else
+
 // These tests work with Python 2.2, but you must have Numeric installed.
-bool check_numeric_array_rich_slice()
+object check_numeric_array_rich_slice(
+    char const* module_name, char const* array_type_name, object all)
 {
     using numeric::array;
+    array::set_module_and_type(module_name, array_type_name);
+    
     array original = array( make_tuple( make_tuple( 11, 12, 13, 14),
                                         make_tuple( 21, 22, 23, 24),
                                         make_tuple( 31, 32, 33, 34),
@@ -60,22 +76,21 @@
     // The following comments represent equivalent Python expressions used
     // to validate the array behavior.
     // original[::] == original
-    if (original[slice()] != original)
-        return false;
+    ASSERT_EQUAL(original[slice()],original);
+        
     // original[:2,:2] == array( [[11, 12], [21, 22]])
-    if (original[make_tuple(slice(_,2), slice(_,2))] != upper_left_quadrant)
-        return false;
+    ASSERT_EQUAL(original[make_tuple(slice(_,2), slice(_,2))],upper_left_quadrant);
+        
     // original[::2,::2] == array( [[11, 13], [31, 33]])
-    if (original[make_tuple( slice(_,_,2), slice(_,_,2))] != odd_cells)
-        return false;
+    ASSERT_EQUAL(original[make_tuple( slice(_,_,2), slice(_,_,2))],odd_cells);
+    
     // original[1::2, 1::2] == array( [[22, 24], [42, 44]])
-    if (original[make_tuple( slice(1,_,2), slice(1,_,2))] != even_cells)
-        return false;
+    ASSERT_EQUAL(original[make_tuple( slice(1,_,2), slice(1,_,2))],even_cells);
+
     // original[:-3:-1, :-3,-1] == array( [[44, 43], [34, 33]])
-    if (original[make_tuple( slice(_,-3,-1), slice(_,-3,-1))] != lower_right_quadrant_reversed)
-        return false;
+    ASSERT_EQUAL(original[make_tuple( slice(_,-3,-1), slice(_,-3,-1))],lower_right_quadrant_reversed);
 
-    return true;
+    return object(1);
 }
 
 // Verify functions accepting a slice argument can be called

Modified: boost/trunk/libs/python/test/slice.py
===================================================================
--- boost/trunk/libs/python/test/slice.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/slice.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -12,23 +12,20 @@
 ...     print "test passed"
 ...
 test passed
->>> have_numeric = 0
 >>> try:
 ...     from Numeric import array
-...     have_numeric = 1
 ... except:
-...     pass
+...     print 1
+... else:
+...     check_numeric_array_rich_slice('Numeric', 'ArrayType', lambda x:x)
 ...
+1
 >>> try:
-...     from numarray import array
-...     have_numeric = 1
+...     from numarray import array, all
 ... except:
-...     pass
-...
->>> if have_numeric:
-...     check_numeric_array_rich_slice()
-... else:
 ...     print 1
+... else:
+...     check_numeric_array_rich_slice('numarray', 'NDArray', all)
 ...
 1
 >>> import sys

Modified: boost/trunk/libs/python/test/voidptr.cpp
===================================================================
--- boost/trunk/libs/python/test/voidptr.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/python/test/voidptr.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -12,23 +12,23 @@
 
 void *get()
 {
-	return test;
+    return test;
 }
 
 void *getnull()
 {
-	return 0;
+    return 0;
 }
 
 void use(void *a)
 {
-	if(a!=test)
+    if(a!=test)
         throw std::runtime_error(std::string("failed"));
 }
 
 int useany(void *a)
 {
-	return a ? 1 : 0;
+    return a ? 1 : 0;
 }
 
 
@@ -36,8 +36,8 @@
 
 BOOST_PYTHON_MODULE(voidptr_ext)
 {
-	bpl::def("get", &::get, bpl::return_value_policy<bpl::return_opaque_pointer>());
-	bpl::def("getnull", &::getnull, bpl::return_value_policy<bpl::return_opaque_pointer>());
-	bpl::def("use", &::use);
-	bpl::def("useany", &::useany);
+    bpl::def("get", &::get, bpl::return_value_policy<bpl::return_opaque_pointer>());
+    bpl::def("getnull", &::getnull, bpl::return_value_policy<bpl::return_opaque_pointer>());
+    bpl::def("use", &::use);
+    bpl::def("useany", &::useany);
 }

Modified: boost/trunk/libs/random/index.html
===================================================================
--- boost/trunk/libs/random/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/random/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,161 +1,209 @@
+<!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 http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<title>Boost Random Number Library</title>
+  <title>Boost Random Number Library</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-<table border="1" bgcolor="#007F7F" cellpadding="2">
-  <tr>
-    <td bgcolor="#FFFFFF"><img src="../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-    <td><a href="../../index.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>Home</big></font></a></td>
-    <td><a href="../libraries.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>Libraries</big></font></a></td>
-    <td><a href="../../people/people.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>People</big></font></a></td>
-    <td><a href="../../more/faq.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>FAQ</big></font></a></td>
-    <td><a href="../../more/index.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>More</big></font></a></td>
-  </tr>
-</table>
+      <td><a href="../../index.htm"><font face="Arial,Helvetica" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-<h1>Boost Random Number Library</h1>
+      <td><a href="../libraries.htm"><font face="Arial,Helvetica" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
 
-Random numbers are useful in a variety of applications.  The Boost
-Random Number Library (Boost.Random for short) provides a vast variety
-of generators and distributions to produce random numbers having
-useful properties, such as uniform distribution.  
-<p>
-You should read the
-<a href="random-concepts.html">concepts documentation</a>
-for an introduction and the definition of the basic concepts.  For a
-quick start, it may be sufficient to have a look at <a
-href="random_demo.cpp">random_demo.cpp</a>.
-<p>
-For a very quick start, here's an example:
-<pre>
+      <td><a href="../../people/people.htm"><font face="Arial,Helvetica"
+      color="#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../../more/faq.htm"><font face="Arial,Helvetica" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../../more/index.htm"><font face="Arial,Helvetica" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <h1>Boost Random Number Library</h1>
+
+  <p>Random numbers are useful in a variety of applications. The Boost Random
+  Number Library (Boost.Random for short) provides a vast variety of
+  generators and distributions to produce random numbers having useful
+  properties, such as uniform distribution.</p>
+
+  <p>You should read the <a href="random-concepts.html">concepts
+  documentation</a> for an introduction and the definition of the basic
+  concepts. For a quick start, it may be sufficient to have a look at
+  <a href="random_demo.cpp">random_demo.cpp</a>.</p>
+
+  <p>For a very quick start, here's an example:</p>
+  <pre>
   boost::mt19937 rng;                 // produces randomness out of thin air
                                       // see pseudo-random number generators
-  boost::uniform_int&lt;> six(1,6)       // distribution that maps to 1..6
+  boost::uniform_int&lt;&gt; six(1,6)       // distribution that maps to 1..6
                                       // see random number distributions
-  boost::variate_generator&lt;boost::mt19937&amp;, boost::uniform_int&lt;> >
+  boost::variate_generator&lt;boost::mt19937&amp;, boost::uniform_int&lt;&gt; &gt;
            die(rng, six);             // glues randomness with mapping
   int x = die();                      // simulate rolling a die
 </pre>
 
-<h2>Library Organization</h2>
+  <h2>Library Organization</h2>
 
-The library is separated into several header files, all within the
-<code>boost/random/</code> directory.  Additionally, a convenience
-header file which includes all other headers in
-<code>boost/random/</code> is available as
-<code><a href="../../boost/random.hpp">boost/random.hpp</a></code>.
-<p>
+  <p>The library is separated into several header files, all within the
+  <code>boost/random/</code> directory. Additionally, a convenience header
+  file which includes all other headers in <code>boost/random/</code> is
+  available as <code><a href=
+  "../../boost/random.hpp">boost/random.hpp</a></code>.</p>
 
-A front-end class template called <code>variate_generate</code> is
-provided; please read the
-<a href="random-variate.html">documentation</a> about it.
-<ul>
-<li><code><a href="../../boost/random/variate_generator.hpp">boost/random/variate_generator.hpp</a></code>
-</ul>
+  <p>A front-end class template called <code>variate_generate</code> is
+  provided; please read the <a href="random-variate.html">documentation</a>
+  about it.</p>
 
-Several random number generators are available in the following
-header files; please read the
-<a href="random-generators.html">documentation</a> about these.
+  <ul>
+    <li><code><a href=
+    "../../boost/random/variate_generator.hpp">boost/random/variate_generator.hpp</a></code></li>
+  </ul>Several random number generators are available in the following header
+  files; please read the <a href="random-generators.html">documentation</a>
+  about these.
 
-<ul>
-<li><code><a href="../../boost/random/linear_congruential.hpp">boost/random/linear_congruential.hpp</a></code>
-<li><code><a href="../../boost/random/additive_combine.hpp">boost/random/additive_combine.hpp</a></code>
-<li><code><a href="../../boost/random/inversive_congruential.hpp">boost/random/inversive_congruential.hpp</a></code>
-<li><code><a href="../../boost/random/shuffle_output.hpp">boost/random/shuffle_output.hpp</a></code>
-<li><code><a href="../../boost/random/mersenne_twister.hpp">boost/random/mersenne_twister.hpp</a></code>
-<li><code><a href="../../boost/random/lagged_fibonacci.hpp">boost/random/lagged_fibonacci.hpp</a></code>
-</ul>
+  <ul>
+    <li><code><a href=
+    "../../boost/random/linear_congruential.hpp">boost/random/linear_congruential.hpp</a></code></li>
 
+    <li><code><a href=
+    "../../boost/random/additive_combine.hpp">boost/random/additive_combine.hpp</a></code></li>
 
-Similarly, several random number distributions are available in the
-following header files; please read the
-<a href="random-distributions.html">documentation</a> about these.
+    <li><code><a href=
+    "../../boost/random/inversive_congruential.hpp">boost/random/inversive_congruential.hpp</a></code></li>
 
-<ul>
-<li><code><a href="../../boost/random/uniform_smallint.hpp">boost/random/uniform_smallint.hpp</a></code>
-<li><code><a href="../../boost/random/uniform_int.hpp">boost/random/uniform_int.hpp</a></code>
-<li><code><a href="../../boost/random/uniform_01.hpp">boost/random/uniform_01.hpp</a></code>
-<li><code><a href="../../boost/random/uniform_real.hpp">boost/random/uniform_real.hpp</a></code>
-<li><code><a href="../../boost/random/triangle_distribution.hpp">boost/random/triangle_distribution.hpp</a></code>
-<li><code><a href="../../boost/random/bernoulli_distribution.hpp">boost/random/bernoulli_distribution.hpp</a></code>
-<li><code><a href="../../boost/random/cauchy_distribution.hpp">boost/random/cauchy_distribution.hpp</a></code>
-<li><code><a href="../../boost/random/exponential_distribution.hpp">boost/random/exponential_distribution.hpp</a></code>
-<li><code><a href="../../boost/random/geometric_distribution.hpp">boost/random/geometric_distribution.hpp</a></code>
-<li><code><a href="../../boost/random/normal_distribution.hpp">boost/random/normal_distribution.hpp</a></code>
-<li><code><a href="../../boost/random/lognormal_distribution.hpp">boost/random/lognormal_distribution.hpp</a></code>
-<li><code><a href="../../boost/random/uniform_on_sphere.hpp">boost/random/uniform_on_sphere.hpp</a></code>
-</ul>
+    <li><code><a href=
+    "../../boost/random/shuffle_output.hpp">boost/random/shuffle_output.hpp</a></code></li>
 
-Additionally, non-deterministic random number generators are available
-in the header 
-<code><a href="../../boost/nondet_random.hpp">&lt;boost/nondet_random.hpp&gt;</a></code>.
-<a href="nondet_random.html">Documentation</a> is also available.
+    <li><code><a href=
+    "../../boost/random/mersenne_twister.hpp">boost/random/mersenne_twister.hpp</a></code></li>
 
-<p>
+    <li><code><a href=
+    "../../boost/random/lagged_fibonacci.hpp">boost/random/lagged_fibonacci.hpp</a></code></li>
+  </ul>Similarly, several random number distributions are available in the
+  following header files; please read the <a href=
+  "random-distributions.html">documentation</a> about these.
 
-In order to map the interface of the generators and distribution functions
-to other concepts, some <a href="random-misc.html">decorators</a> are available.
+  <ul>
+    <li><code><a href=
+    "../../boost/random/uniform_smallint.hpp">boost/random/uniform_smallint.hpp</a></code></li>
 
-<h2>Tests</h2>
+    <li><code><a href=
+    "../../boost/random/uniform_int.hpp">boost/random/uniform_int.hpp</a></code></li>
 
-An extensive test suite for the pseudo-random number generators and
-distributions is available as
-<a href="random_test.cpp">random_test.cpp</a>.
-<p>
-Some <a href="random-performance.html">performance results</a> obtained
-using <a href="random_speed.cpp">random_speed.cpp</a> are also available.
+    <li><code><a href=
+    "../../boost/random/uniform_01.hpp">boost/random/uniform_01.hpp</a></code></li>
 
-<h2>Rationale</h2>
+    <li><code><a href=
+    "../../boost/random/uniform_real.hpp">boost/random/uniform_real.hpp</a></code></li>
 
-The methods for generating and evaluating deterministic and
-non-deterministic random numbers differ radically.  Furthermore, due
-to the inherent deterministic design of present-day computers, it is
-often difficult to implement non-deterministic random number
-generation facilities.  Thus, the random number library is split into
-separate header files, mirroring the two different application
-domains.
+    <li><code><a href=
+    "../../boost/random/triangle_distribution.hpp">boost/random/triangle_distribution.hpp</a></code></li>
 
+    <li><code><a href=
+    "../../boost/random/bernoulli_distribution.hpp">boost/random/bernoulli_distribution.hpp</a></code></li>
 
-<h2>History and Acknowledgements</h2>
+    <li><code><a href=
+    "../../boost/random/cauchy_distribution.hpp">boost/random/cauchy_distribution.hpp</a></code></li>
 
-In November 1999, Jeet Sukumaran proposed a framework based on virtual
-functions, and later sketched a template-based approach.  Ed Brey
-pointed out that Microsoft Visual C++ does not support in-class member
-initializations and suggested the <code>enum</code> workaround.  Dave
-Abrahams highlighted quantization issues.
-<p>
-The first public release of this random number library materialized in
-March 2000 after extensive discussions on the boost mailing list.
-Many thanks to Beman Dawes for his original <code>min_rand</code>
-class, portability fixes, documentation suggestions, and general
-guidance.  Harry Erwin sent a header file which provided additional
-insight into the requirements.  Ed Brey and Beman Dawes wanted an
-iterator-like interface.
-<p>
-Beman Dawes managed the formal review, during which Matthias Troyer,
-Csaba Szepesvari, and Thomas Holenstein gave detailed comments.  The
-reviewed version became an official part of boost on 17 June 2000.
-<p>
-Gary Powell contributed suggestions for code cleanliness.  Dave
-Abrahams and Howard Hinnant suggested to move the basic generator
-templates from namespace <code>boost::detail</code> to
-<code>boost::random</code>.
-<p>
-Ed Brey asked to remove superfluous warnings and helped with
-<code>uint64_t</code> handling.  Andreas Scherer tested with MSVC.
-Matthias Troyer contributed a lagged Fibonacci generator.  Michael
-Stevens found a bug in the copy semantics of normal_distribution and
-suggested documentation improvements.
-<p>
-<hr>
-<a href="../../people/jens_maurer.htm">Jens Maurer</a>,
-2001-08-31
+    <li><code><a href=
+    "../../boost/random/exponential_distribution.hpp">boost/random/exponential_distribution.hpp</a></code></li>
 
+    <li><code><a href=
+    "../../boost/random/geometric_distribution.hpp">boost/random/geometric_distribution.hpp</a></code></li>
+
+    <li><code><a href=
+    "../../boost/random/normal_distribution.hpp">boost/random/normal_distribution.hpp</a></code></li>
+
+    <li><code><a href=
+    "../../boost/random/lognormal_distribution.hpp">boost/random/lognormal_distribution.hpp</a></code></li>
+
+    <li><code><a href=
+    "../../boost/random/uniform_on_sphere.hpp">boost/random/uniform_on_sphere.hpp</a></code></li>
+  </ul>Additionally, non-deterministic random number generators are available
+  in the header <code><a href=
+  "../../boost/nondet_random.hpp">&lt;boost/nondet_random.hpp&gt;</a></code>.
+  <a href="nondet_random.html">Documentation</a> is also available.
+
+  <p>In order to map the interface of the generators and distribution
+  functions to other concepts, some <a href="random-misc.html">decorators</a>
+  are available.</p>
+
+  <h2>Tests</h2>
+
+  <p>An extensive test suite for the pseudo-random number generators and
+  distributions is available as <a href=
+  "random_test.cpp">random_test.cpp</a>.</p>
+
+  <p>Some <a href="random-performance.html">performance results</a> obtained
+  using <a href="random_speed.cpp">random_speed.cpp</a> are also
+  available.</p>
+
+  <h2>Rationale</h2>
+
+  <p>The methods for generating and evaluating deterministic and
+  non-deterministic random numbers differ radically. Furthermore, due to the
+  inherent deterministic design of present-day computers, it is often
+  difficult to implement non-deterministic random number generation
+  facilities. Thus, the random number library is split into separate header
+  files, mirroring the two different application domains.</p>
+
+  <h2>History and Acknowledgements</h2>
+
+  <p>In November 1999, Jeet Sukumaran proposed a framework based on virtual
+  functions, and later sketched a template-based approach. Ed Brey pointed
+  out that Microsoft Visual C++ does not support in-class member
+  initializations and suggested the <code>enum</code> workaround. Dave
+  Abrahams highlighted quantization issues.</p>
+
+  <p>The first public release of this random number library materialized in
+  March 2000 after extensive discussions on the boost mailing list. Many
+  thanks to Beman Dawes for his original <code>min_rand</code> class,
+  portability fixes, documentation suggestions, and general guidance. Harry
+  Erwin sent a header file which provided additional insight into the
+  requirements. Ed Brey and Beman Dawes wanted an iterator-like
+  interface.</p>
+
+  <p>Beman Dawes managed the formal review, during which Matthias Troyer,
+  Csaba Szepesvari, and Thomas Holenstein gave detailed comments. The
+  reviewed version became an official part of boost on 17 June 2000.</p>
+
+  <p>Gary Powell contributed suggestions for code cleanliness. Dave Abrahams
+  and Howard Hinnant suggested to move the basic generator templates from
+  namespace <code>boost::detail</code> to <code>boost::random</code>.</p>
+
+  <p>Ed Brey asked to remove superfluous warnings and helped with
+  <code>uint64_t</code> handling. Andreas Scherer tested with MSVC. Matthias
+  Troyer contributed a lagged Fibonacci generator. Michael Stevens found a
+  bug in the copy semantics of normal_distribution and suggested
+  documentation improvements.</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000-2005 <a href=
+  "../../people/jens_maurer.htm">Jens Maurer</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/random/nondet_random.html
===================================================================
--- boost/trunk/libs/random/nondet_random.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/random/nondet_random.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,38 +1,40 @@
+<!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 http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<title>Boost RNG Library - Non-Deterministic Random Number Generators</title>
+  <title>Boost RNG Library - Non-Deterministic Random Number
+  Generators</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <h1><img src="../../boost.png" alt="boost.png (6897 bytes)" align="middle"
+  width="277" height="86">Header <a href=
+  "../../boost/nondet_random.hpp">&lt;boost/nondet_random.hpp&gt;</a></h1>
 
-<h1><img src="../../boost.png" alt="boost.png (6897 bytes)"
-align="center" width="277" height="86">Header
-<a href="../../boost/nondet_random.hpp">&lt;boost/nondet_random.hpp&gt;</a></h1>
+  <ul>
+    <li><a href="#synopsis">Synopsis</a></li>
 
-<ul>
-<li><a href="#synopsis">Synopsis</a>
-<li><a href="#random_device">Class <code>random_device</code></a>
-<li><a href="#performance">Performance</a>
-</ul>
+    <li><a href="#random_device">Class <code>random_device</code></a></li>
 
-<h2><a name="synopsis">Header</a><code>&lt;boost/nondet_random.hpp&gt;</code>
-Synopsis</h2>
+    <li><a href="#performance">Performance</a></li>
+  </ul>
 
-<pre>
+  <h2><a name="synopsis" id=
+  "synopsis">Header</a><code>&lt;boost/nondet_random.hpp&gt;</code>
+  Synopsis</h2>
+  <pre>
 namespace boost {
   class random_device;
 } // namespace boost
 </pre>
 
+  <h2><a name="random_device" id="random_device">Class
+  <code>random_device</code></a></h2>
 
-<h2><a name="random_device">Class <code>random_device</code></a></h2>
-
-<h3>Synopsis</h3>
-
-<pre>
+  <h3>Synopsis</h3>
+  <pre>
 class random_device : noncopyable
 {
 public:
@@ -42,90 +44,102 @@
   static const result_type max_value = /* implementation defined */;
   result_type min() const;
   result_type max() const;
-  explicit random_device(const std::string& token = default_token);
+  explicit random_device(const std::string&amp; token = default_token);
   ~random_device();
   double entropy() const;
   unsigned int operator()();
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Class <code>random_device</code> models a
-<a href="random-concepts.html#nondet-rng">non-deterministic random number
-generator</a>.
-It uses one or more implementation-defined stochastic processes to
-generate a sequence of uniformly distributed non-deterministic random
-numbers. For those environments where a non-deterministic random
-number generator is not available, class <code>random_device</code>
-must not be implemented.  See
-<blockquote>
-"Randomness Recommendations for Security", D. Eastlake, S.
-Crocker, J. Schiller, Network Working Group, RFC 1750, December 1994
-</blockquote>
-for further discussions.
+  <p>Class <code>random_device</code> models a <a href=
+  "random-concepts.html#nondet-rng">non-deterministic random number
+  generator</a>. It uses one or more implementation-defined stochastic
+  processes to generate a sequence of uniformly distributed non-deterministic
+  random numbers. For those environments where a non-deterministic random
+  number generator is not available, class <code>random_device</code> must
+  not be implemented. See</p>
 
-<p>
-<em>Note:</em> Some operating systems abstract the computer hardware
-enough to make it difficult to non-intrusively monitor stochastic
-processes.  However, several do provide a special device for exactly
-this purpose.  It seems to be impossible to emulate the functionality
-using Standard C++ only, so users should be aware that this class may
-not be available on all platforms.
+  <blockquote>
+    "Randomness Recommendations for Security", D. Eastlake, S. Crocker, J.
+    Schiller, Network Working Group, RFC 1750, December 1994
+  </blockquote>for further discussions.
 
-<h3>Members</h3>
+  <p><em>Note:</em> Some operating systems abstract the computer hardware
+  enough to make it difficult to non-intrusively monitor stochastic
+  processes. However, several do provide a special device for exactly this
+  purpose. It seems to be impossible to emulate the functionality using
+  Standard C++ only, so users should be aware that this class may not be
+  available on all platforms.</p>
 
-<pre>explicit random_device(const std::string& token = default_token)</pre>
+  <h3>Members</h3>
+  <pre>
+explicit random_device(const std::string&amp; token = default_token)
+</pre><strong>Effects:</strong> Constructs a <code>random_device</code>,
+optionally using the given <code>token</code> as an access specification (for
+example, a URL) to some implementation-defined service for monitoring a
+stochastic process.
+  <pre>
+    double entropy() const
+</pre><strong>Returns:</strong> An entropy estimate for the random numbers
+returned by operator(), in the range <code>min()</code> to log<sub>2</sub>(
+<code>max()</code>+1). A deterministic random number generator (e.g. a
+pseudo-random number engine) has entropy 0.<br>
+  <strong>Throws:</strong> Nothing.
 
-<strong>Effects:</strong> Constructs a <code>random_device</code>,
-optionally using the given <code>token</code> as an access
-specification (for example, a URL) to some implementation-defined
-service for monitoring a stochastic process.
+  <h3>Implementation Note for Linux</h3>
 
-<pre>    double entropy() const</pre>
-<strong>Returns:</strong> An entropy estimate for the random numbers
-returned by operator(), in the range <code>min()</code> to
-log<sub>2</sub>( <code>max()</code>+1).  A deterministic random
-number generator (e.g. a pseudo-random number engine) has entropy 0.
-<br>
-<strong>Throws:</strong> Nothing.
+  <p>On the Linux operating system, <code>token</code> is interpreted as a
+  filesystem path. It is assumed that this path denotes an operating system
+  pseudo-device which generates a stream of non-deterministic random numbers.
+  The pseudo-device should never signal an error or end-of-file. Otherwise,
+  <code>std::ios_base::failure</code> is thrown. By default,
+  <code>random_device</code> uses the <code>/dev/urandom</code> pseudo-device
+  to retrieve the random numbers. Another option would be to specify the
+  <code>/dev/random</code> pseudo-device, which blocks on reads if the
+  entropy pool has no more random bits available.</p>
 
+  <h2><a name="performance" id="performance">Performance</a></h2>
 
-<h3>Implementation Note for Linux</h3>
+  <p>The test program <a href=
+  "nondet_random_speed.cpp">nondet_random_speed.cpp</a> measures the
+  execution times of the <a href=
+  "../../boost/nondet_random.hpp">nondet_random.hpp</a> implementation of the
+  above algorithms in a tight loop. The performance has been evaluated on a
+  Pentium Pro 200 MHz with gcc 2.95.2, Linux 2.2.13, glibc 2.1.2.</p>
 
-On the Linux operating system, <code>token</code> is interpreted as a
-filesystem path.  It is assumed that this path denotes an operating
-system pseudo-device which generates a stream of non-deterministic
-random numbers.  The pseudo-device should never signal an error or
-end-of-file.  Otherwise, <code>std::ios_base::failure</code> is
-thrown.  By default, <code>random_device</code> uses the
-<code>/dev/urandom</code> pseudo-device to retrieve the random
-numbers.  Another option would be to specify the
-<code>/dev/random</code> pseudo-device, which blocks on reads if the
-entropy pool has no more random bits available.
+  <table border="1" summary="">
+    <tr>
+      <th>class</th>
 
+      <th>time per invocation [usec]</th>
+    </tr>
 
-<h2><a name="performance">Performance</a></h2>
+    <tr>
+      <td>random_device</td>
 
-The test program <a href="nondet_random_speed.cpp">nondet_random_speed.cpp</a>
-measures the execution times of the
-<a href="../../boost/nondet_random.hpp">nondet_random.hpp</a> implementation of the above
-algorithms in a tight loop.  The performance has been evaluated on a
-Pentium Pro 200 MHz with gcc 2.95.2, Linux 2.2.13, glibc 2.1.2.
+      <td>92.0</td>
+    </tr>
+  </table>
 
-<p>
-<table border=1>
-<tr><th>class</th><th>time per invocation [usec]</th></tr>
-<tr><td>random_device</td><td>92.0</td></tr>
-</table>
+  <p>The measurement error is estimated at +/- 1 usec.</p>
+  <hr>
 
-<p>
-The measurement error is estimated at +/- 1 usec.
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<p>
-<hr>
-Jens Maurer, 2000-06-19
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
 
+  <p><i>Copyright &copy; 2000-2003 <a href=
+  "../../people/jens_maurer.htm">Jens Maurer</a></i></p>
 
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
-</html>
\ No newline at end of file
+</html>

Modified: boost/trunk/libs/random/random-concepts.html
===================================================================
--- boost/trunk/libs/random/random-concepts.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/random/random-concepts.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,429 +1,503 @@
+<!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 http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<title>Boost Random Number Library Concepts</title>
+  <title>Boost Random Number Library Concepts</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <h1>Random Number Generator Library Concepts</h1>
 
-<h1>Random Number Generator Library Concepts</h1>
+  <h2>Introduction</h2>
 
+  <p>Random numbers are required in a number of different problem domains,
+  such as</p>
 
-<h2>Introduction</h2>
+  <ul>
+    <li>numerics (simulation, Monte-Carlo integration)</li>
 
-Random numbers are required in a number of different problem domains,
-such as
-<ul>
-<li>numerics (simulation, Monte-Carlo integration)
-<li>games (non-deterministic enemy behavior)
-<li>security (key generation)
-<li>testing (random coverage in white-box tests)
-</ul>
+    <li>games (non-deterministic enemy behavior)</li>
 
-The Boost Random Number Generator Library provides a framework
-for random number generators with well-defined properties so that the
-generators can be used in the demanding numerics and security domains.
+    <li>security (key generation)</li>
 
-For a general introduction to random numbers in numerics, see
-<blockquote>
-"Numerical Recipes in C: The art of scientific computing", William
-H. Press, Saul A. Teukolsky, William A. Vetterling, Brian P. Flannery,
-2nd ed., 1992, pp. 274-328
-</blockquote>
+    <li>testing (random coverage in white-box tests)</li>
+  </ul>The Boost Random Number Generator Library provides a framework for
+  random number generators with well-defined properties so that the
+  generators can be used in the demanding numerics and security domains. For
+  a general introduction to random numbers in numerics, see
 
-Depending on the requirements of the problem domain, different
-variations of random number generators are appropriate:
+  <blockquote>
+    "Numerical Recipes in C: The art of scientific computing", William H.
+    Press, Saul A. Teukolsky, William A. Vetterling, Brian P. Flannery, 2nd
+    ed., 1992, pp. 274-328
+  </blockquote>Depending on the requirements of the problem domain, different
+  variations of random number generators are appropriate:
 
-<ul>
-<li>non-deterministic random number generator
-<li>pseudo-random number generator
-<li>quasi-random number generator
-</ul>
+  <ul>
+    <li>non-deterministic random number generator</li>
 
-All variations have some properties in common, these concepts (in the
-STL sense) are called NumberGenerator and
-UniformRandomNumberGenerator. Each concept will be defined in a
-subsequent section.
+    <li>pseudo-random number generator</li>
 
-<p>
+    <li>quasi-random number generator</li>
+  </ul>All variations have some properties in common, these concepts (in the
+  STL sense) are called NumberGenerator and UniformRandomNumberGenerator.
+  Each concept will be defined in a subsequent section.
 
-The goals for this library are the following:
-<ul>
-<li>allow easy integration of third-party random-number generators
-<li>define a validation interface for the generators
-<li>provide easy-to-use front-end classes which model popular
-distributions
-<li>provide maximum efficiency
-<li>allow control on quantization effects in front-end processing
-(not yet done)
-</ul>
+  <p>The goals for this library are the following:</p>
 
+  <ul>
+    <li>allow easy integration of third-party random-number generators</li>
 
-<h2><a name="number_generator">Number Generator</a></h2>
+    <li>define a validation interface for the generators</li>
 
-A number generator is a <em>function object</em> (std:20.3
-[lib.function.objects]) that takes zero arguments.  Each call to
-<code>operator()</code> returns a number.
+    <li>provide easy-to-use front-end classes which model popular
+    distributions</li>
 
+    <li>provide maximum efficiency</li>
 
-In the following table, <code>X</code> denotes a number generator
-class returning objects of type <code>T</code>, and <code>u</code> is
-a value of <code>X</code>.
+    <li>allow control on quantization effects in front-end processing (not
+    yet done)</li>
+  </ul>
 
-<p>
+  <h2><a name="number_generator" id="number_generator">Number
+  Generator</a></h2>
 
-<table border=1>
-<tr><th colspan=3 align=center><code>NumberGenerator</code>
-requirements</th></tr>
-<tr><td>expression</td><td>return&nbsp;type</td>
-<td>pre/post-condition</td></tr>
-<tr><td><code>X::result_type</code></td><td>T</td>
-<td><code>std::numeric_limits&lt;T&gt;::is_specialized</code> is true,
-<code>T</code> is <code>LessThanComparable</code></td></tr>
-<tr><td><code>u.operator()()</code></td><td>T</td><td>-</td></tr>
-</table>
+  <p>A number generator is a <em>function object</em> (std:20.3
+  [lib.function.objects]) that takes zero arguments. Each call to
+  <code>operator()</code> returns a number. In the following table,
+  <code>X</code> denotes a number generator class returning objects of type
+  <code>T</code>, and <code>u</code> is a value of <code>X</code>.</p>
 
-<p>
+  <table border="1">
+    <tr>
+      <th colspan="3" align="center"><code>NumberGenerator</code>
+      requirements</th>
+    </tr>
 
-<em>Note:</em> The NumberGenerator requirements do not impose any
-restrictions on the characteristics of the returned numbers.
+    <tr>
+      <td>expression</td>
 
+      <td>return&nbsp;type</td>
 
-<h2><a name="uniform-rng">Uniform Random Number Generator</a></h2>
+      <td>pre/post-condition</td>
+    </tr>
 
-A uniform random number generator is a NumberGenerator that provides a
-sequence of random numbers uniformly distributed on a given range.
-The range can be compile-time fixed or available (only) after run-time
-construction of the object.
+    <tr>
+      <td><code>X::result_type</code></td>
 
-<p>
-The <em>tight lower bound</em> of some (finite) set S is the (unique)
-member l in S, so that for all v in S, l <= v holds.  Likewise, the
-<em>tight upper bound</em> of some (finite) set S is the (unique)
-member u in S, so that for all v in S, v <= u holds.
+      <td>T</td>
 
-<p>
-In the following table, <code>X</code> denotes a number generator
-class returning objects of type <code>T</code>, and <code>v</code> is
-a const value of <code>X</code>.
+      <td><code>std::numeric_limits&lt;T&gt;::is_specialized</code> is true,
+      <code>T</code> is <code>LessThanComparable</code></td>
+    </tr>
 
-<p>
+    <tr>
+      <td><code>u.operator()()</code></td>
 
-<table border=1>
-<tr><th colspan=3 align=center><code>UniformRandomNumberGenerator</code>
-requirements</th></tr>
-<tr><td>expression</td><td>return&nbsp;type</td>
-<td>pre/post-condition</td></tr>
-<tr><td><code>X::has_fixed_range</code></td><td><code>bool</code></td>
-<td>compile-time constant; if <code>true</code>, the range on which
-the random numbers are uniformly distributed is known at compile-time
-and members <code>min_value</code> and <code>max_value</code>
-exist.  <em>Note:</em> This flag may also be <code>false</code> due to
-compiler limitations.</td></tr>
-<tr><td><code>X::min_value</code></td><td><code>T</code></td>
-<td>compile-time constant; <code>min_value</code> is equal to
-<code>v.min()</code></td></tr>
-<tr><td><code>X::max_value</code></td><td><code>T</code></td>
-<td>compile-time constant; <code>max_value</code> is equal to
-<code>v.max()</code></td></tr>
-<tr><td><code>v.min()</code></td><td><code>T</code></td>
-<td>tight lower bound on the set of all values returned by
-<code>operator()</code>. The return value of this function shall not
-change during the lifetime of the object.</td></tr>
-<tr><td><code>v.max()</code></td><td><code>T</code></td>
-<td>if <code>std::numeric_limits&lt;T&gt;::is_integer</code>, tight
-upper bound on the set of all values returned by
-<code>operator()</code>, otherwise, the smallest representable number
-larger than the tight upper bound on the set of all values returned by
-<code>operator()</code>.  In any case, the return value of this
-function shall not change during the lifetime of the
-object.</code></td></tr>
-</table>
+      <td>T</td>
 
-<p>
-The member functions <code>min</code>, <code>max</code>, and
-<code>operator()</code> shall have amortized constant time complexity.
+      <td>-</td>
+    </tr>
+  </table>
 
-<p>
-<em>Note:</em> For integer generators (i.e. integer <code>T</code>),
-the generated values <code>x</code> fulfill <code>min() <= x <=
-max()</code>, for non-integer generators (i.e. non-integer
-<code>T</code>), the generated values <code>x</code> fulfill
-<code>min() <= x < max()</code>.
-<br>
-<em>Rationale:</em> The range description with <code>min</code> and
-<code>max</code> serves two purposes.  First, it allows scaling of the
-values to some canonical range, such as [0..1).  Second, it describes
-the significant bits of the values, which may be relevant for further
-processing.
-<br>
-The range is a closed interval [min,max] for integers, because the
-underlying type may not be able to represent the half-open interval
-[min,max+1).  It is a half-open interval [min, max) for non-integers,
-because this is much more practical for borderline cases of continuous
-distributions.
-<p>
+  <p><em>Note:</em> The NumberGenerator requirements do not impose any
+  restrictions on the characteristics of the returned numbers.</p>
 
-<em>Note:</em> The UniformRandomNumberGenerator concept does not
-require <code>operator()(long)</code> and thus it does not fulfill the
-RandomNumberGenerator (std:25.2.11 [lib.alg.random.shuffle])
-requirements.  Use the
-<a href="random-misc.html#random_number_generator"><code>random_number_generator</code></a>
-adapter for that.
-<br>
+  <h2><a name="uniform-rng" id="uniform-rng">Uniform Random Number
+  Generator</a></h2>
 
-<em>Rationale:</em> <code>operator()(long)</code> is not provided,
-because mapping the output of some generator with integer range to a
-different integer range is not trivial.
+  <p>A uniform random number generator is a NumberGenerator that provides a
+  sequence of random numbers uniformly distributed on a given range. The
+  range can be compile-time fixed or available (only) after run-time
+  construction of the object.</p>
 
+  <p>The <em>tight lower bound</em> of some (finite) set S is the (unique)
+  member l in S, so that for all v in S, l &lt;= v holds. Likewise, the
+  <em>tight upper bound</em> of some (finite) set S is the (unique) member u
+  in S, so that for all v in S, v &lt;= u holds.</p>
 
-<h2><a name="nondet-rng">Non-deterministic Uniform Random Number
-Generator</a></h2>
+  <p>In the following table, <code>X</code> denotes a number generator class
+  returning objects of type <code>T</code>, and <code>v</code> is a const
+  value of <code>X</code>.</p>
 
-A non-deterministic uniform random number generator is a
-UniformRandomNumberGenerator that is based on some stochastic process.
-Thus, it provides a sequence of truly-random numbers. Examples for
-such processes are nuclear decay, noise of a Zehner diode, tunneling
-of quantum particles, rolling a die, drawing from an urn, and tossing
-a coin.  Depending on the environment, inter-arrival times of network
-packets or keyboard events may be close approximations of stochastic
-processes.
-<p>
+  <table border="1">
+    <tr>
+      <th colspan="3" align="center">
+      <code>UniformRandomNumberGenerator</code> requirements</th>
+    </tr>
 
-The class
-<code><a href="nondet_random.html#random_device">random_device</a></code>
-is a model for a non-deterministic random number generator.
+    <tr>
+      <td>expression</td>
 
-<p>
+      <td>return&nbsp;type</td>
 
-<em>Note:</em> This type of random-number generator is useful for
-security applications, where it is important to prevent that an
-outside attacker guesses the numbers and thus obtains your
-encryption or authentication key.  Thus, models of this concept should
-be cautious not to leak any information, to the extent possible by the
-environment.  For example, it might be advisable to explicitly clear
-any temporary storage as soon as it is no longer needed.
+      <td>pre/post-condition</td>
+    </tr>
 
+    <tr>
+      <td><code>X::has_fixed_range</code></td>
 
-<h2><a name="pseudo-rng">Pseudo-Random Number Generator</a></h2>
+      <td><code>bool</code></td>
 
-A pseudo-random number generator is a UniformRandomNumberGenerator
-which provides a deterministic sequence of pseudo-random numbers,
-based on some algorithm and internal state. Linear congruential and
-inversive congruential generators are examples of such pseudo-random
-number generators.  Often, these generators are very sensitive to
-their parameters.  In order to prevent wrong implementations from
-being used, an external testsuite should check that the generated
-sequence and the validation value provided do indeed match.
-<p>
+      <td>compile-time constant; if <code>true</code>, the range on which the
+      random numbers are uniformly distributed is known at compile-time and
+      members <code>min_value</code> and <code>max_value</code> exist.
+      <em>Note:</em> This flag may also be <code>false</code> due to compiler
+      limitations.</td>
+    </tr>
 
-Donald E. Knuth gives an extensive overview on pseudo-random number
-generation in his book "The Art of Computer Programming, Vol. 2, 3rd
-edition, Addison-Wesley, 1997".  The descriptions for the specific
-generators contain additional references.
-<p>
+    <tr>
+      <td><code>X::min_value</code></td>
 
-<em>Note:</em> Because the state of a pseudo-random number generator
-is necessarily finite, the sequence of numbers returned by the
-generator will loop eventually.
+      <td><code>T</code></td>
 
-<p>
-In addition to the UniformRandomNumberGenerator requirements, a
-pseudo-random number generator has some additional requirements.  In
-the following table, <code>X</code> denotes a pseudo-random number
-generator class returning objects of type <code>T</code>,
-<code>x</code> is a value of <code>T</code>, <code>u</code> is a value
-of <code>X</code>, and <code>v</code> is a <code>const</code> value of
-<code>X</code>.
+      <td>compile-time constant; <code>min_value</code> is equal to
+      <code>v.min()</code></td>
+    </tr>
 
-<p>
+    <tr>
+      <td><code>X::max_value</code></td>
 
-<table border=1>
-<tr><th colspan=3 align=center><code>PseudoRandomNumberGenerator</code>
-requirements</th></tr>
-<tr><td>expression</td><td>return&nbsp;type</td>
-<td>pre/post-condition</td></tr>
-<tr><td><code>X()</code></td><td>-</td>
-<td>creates a generator in some implementation-defined
-state. <em>Note:</em> Several generators thusly created may possibly
-produce dependent or identical sequences of random numbers.</td></tr>
-<tr><td><code>explicit X(...)</code></td><td>-</td>
-<td>creates a generator with user-provided state; the implementation
-shall specify the constructor argument(s)</td></tr>
-<tr><td><code>u.seed(...)</code></td><td>void</td>
-<td>sets the current state according to the argument(s); at least
-functions with the same signature as the non-default
-constructor(s) shall be provided.
-<tr><td><code>X::validation(x)</code></td><td><code>bool</code></td>
-<td>compares the pre-computed and hardcoded 10001th element in the
-generator's random number sequence with <code>x</code>.  The generator
-must have been constructed by its default constructor and
-<code>seed</code> must not have been called for the validation to
-be meaningful.
-</table>
+      <td><code>T</code></td>
 
-<p>
+      <td>compile-time constant; <code>max_value</code> is equal to
+      <code>v.max()</code></td>
+    </tr>
 
-<em>Note:</em> The <code>seed</code> member function is similar to the
-<code>assign</code> member function in STL containers.  However, the
-naming did not seem appropriate.
+    <tr>
+      <td><code>v.min()</code></td>
 
-<p>
+      <td><code>T</code></td>
 
-Classes which model a pseudo-random number generator shall also model
-EqualityComparable, i.e. implement <code>operator==</code>.  Two
-pseudo-random number generators are defined to be <em>equivalent</em>
-if they both return an identical sequence of numbers starting from a
-given state.
-<p>
-Classes which model a pseudo-random number generator should also model
-the Streamable concept, i.e. implement <code>operator&lt;&lt;</code>
-and <code>operator&gt;&gt;</code>.  If so,
-<code>operator&lt;&lt;</code> writes all current state of the
-pseudo-random number generator to the given <code>ostream</code> so
-that <code>operator&gt;&gt;</code> can restore the state at a later
-time.  The state shall be written in a platform-independent manner,
-but it is assumed that the <code>locale</code>s used for writing and
-reading be the same.
+      <td>tight lower bound on the set of all values returned by
+      <code>operator()</code>. The return value of this function shall not
+      change during the lifetime of the object.</td>
+    </tr>
 
-The pseudo-random number generator with the restored state and the
-original at the just-written state shall be equivalent.
-<p>
+    <tr>
+      <td><code>v.max()</code></td>
 
-Classes which model a pseudo-random number generator may also model
-the CopyConstructible and Assignable concepts.  However, note that the
-sequences of the original and the copy are strongly correlated (in
-fact, they are identical), which may make them unsuitable for some
-problem domains.  Thus, copying pseudo-random number generators is
-discouraged; they should always be passed by (non-<code>const</code>)
-reference.
+      <td><code>T</code></td>
 
-<p>
+      <td>if <code>std::numeric_limits&lt;T&gt;::is_integer</code>, tight
+      upper bound on the set of all values returned by
+      <code>operator()</code>, otherwise, the smallest representable number
+      larger than the tight upper bound on the set of all values returned by
+      <code>operator()</code>. In any case, the return value of this function
+      shall not change during the lifetime of the object.</td>
+    </tr>
+  </table>
 
-The classes
-<code><a href="random-generators.html#rand48">rand48</a></code>,
-<code><a href="random-generators.html#linear_congruential">minstd_rand</a></code>,
-and
-<code><a href="random-generators.html#mersenne_twister">mt19937</a></code>
-are models for a pseudo-random number generator.
+  <p>The member functions <code>min</code>, <code>max</code>, and
+  <code>operator()</code> shall have amortized constant time complexity.</p>
 
-<p>
-<em>Note:</em> This type of random-number generator is useful for
-numerics, games and testing.  The non-zero arguments constructor(s)
-and the <code>seed()</code> member function(s) allow for a
-user-provided state to be installed in the generator.  This is useful
-for debugging Monte-Carlo algorithms and analyzing particular test
-scenarios.  The Streamable concept allows to save/restore the state of
-the generator, for example to re-run a test suite at a later time.
+  <p><em>Note:</em> For integer generators (i.e. integer <code>T</code>), the
+  generated values <code>x</code> fulfill <code>min() &lt;= x &lt;=
+  max()</code>, for non-integer generators (i.e. non-integer <code>T</code>),
+  the generated values <code>x</code> fulfill <code>min() &lt;= x &lt;
+  max()</code>.<br>
+  <em>Rationale:</em> The range description with <code>min</code> and
+  <code>max</code> serves two purposes. First, it allows scaling of the
+  values to some canonical range, such as [0..1). Second, it describes the
+  significant bits of the values, which may be relevant for further
+  processing.<br>
+  The range is a closed interval [min,max] for integers, because the
+  underlying type may not be able to represent the half-open interval
+  [min,max+1). It is a half-open interval [min, max) for non-integers,
+  because this is much more practical for borderline cases of continuous
+  distributions.</p>
 
-<h2><a name="random-dist">Random Distribution</a></h2>
+  <p><em>Note:</em> The UniformRandomNumberGenerator concept does not require
+  <code>operator()(long)</code> and thus it does not fulfill the
+  RandomNumberGenerator (std:25.2.11 [lib.alg.random.shuffle]) requirements.
+  Use the <a href=
+  "random-misc.html#random_number_generator"><code>random_number_generator</code></a>
+  adapter for that.<br>
+  <em>Rationale:</em> <code>operator()(long)</code> is not provided, because
+  mapping the output of some generator with integer range to a different
+  integer range is not trivial.</p>
 
-A radom distribution produces random numbers distributed according to
-some distribution, given uniformly distributed random values as input.
+  <h2><a name="nondet-rng" id="nondet-rng">Non-deterministic Uniform Random
+  Number Generator</a></h2>
 
-In the following table, <code>X</code> denotes a random distribution
-class returning objects of type <code>T</code>, <code>u</code> is a
-value of <code>X</code>, <code>x</code> is a (possibly const)
-value of <code>X</code>, and <code>e</code> is an lvalue of an
-arbitrary type that meets the requirements of a uniform random number
-generator, returning values of type <code>U</code>.
-<p>
+  <p>A non-deterministic uniform random number generator is a
+  UniformRandomNumberGenerator that is based on some stochastic process.
+  Thus, it provides a sequence of truly-random numbers. Examples for such
+  processes are nuclear decay, noise of a Zehner diode, tunneling of quantum
+  particles, rolling a die, drawing from an urn, and tossing a coin.
+  Depending on the environment, inter-arrival times of network packets or
+  keyboard events may be close approximations of stochastic processes.</p>
 
+  <p>The class <code><a href=
+  "nondet_random.html#random_device">random_device</a></code> is a model for
+  a non-deterministic random number generator.</p>
 
-<table border=1>
-<tr>
-<th colspan=4 align=center>Random distribution requirements
-(in addition to number generator,
-<code>CopyConstructible</code>, and <code>Assignable</code>)</th>
-<tr><td>expression</td><td>return&nbsp;type</td>
-<td>pre/post-condition</td>
-<td>complexity</td>
-</tr>
+  <p><em>Note:</em> This type of random-number generator is useful for
+  security applications, where it is important to prevent that an outside
+  attacker guesses the numbers and thus obtains your encryption or
+  authentication key. Thus, models of this concept should be cautious not to
+  leak any information, to the extent possible by the environment. For
+  example, it might be advisable to explicitly clear any temporary storage as
+  soon as it is no longer needed.</p>
 
-<tr>
-<td><code>X::input_type</code></td>
-<td>U</td>
-<td>-</td>
-<td>compile-time</td>
-</tr>
+  <h2><a name="pseudo-rng" id="pseudo-rng">Pseudo-Random Number
+  Generator</a></h2>
 
-<tr>
-<td><code>u.reset()</code></td>
-<td><code>void</code></td>
-<td>subsequent uses of <code>u</code> do not depend on values
-produced by <code>e</code> prior to invoking <code>reset</code>.</td>
-<td>constant</td>
-</tr>
+  <p>A pseudo-random number generator is a UniformRandomNumberGenerator which
+  provides a deterministic sequence of pseudo-random numbers, based on some
+  algorithm and internal state. Linear congruential and inversive
+  congruential generators are examples of such pseudo-random number
+  generators. Often, these generators are very sensitive to their parameters.
+  In order to prevent wrong implementations from being used, an external
+  testsuite should check that the generated sequence and the validation value
+  provided do indeed match.</p>
 
-<tr>
-<td><code>u(e)</code></td>
-<td><code>T</code></td>
-<td>the sequence of numbers returned by successive invocations with
-the same object <code>e</code> is randomly distributed with some
-probability density function p(x)</td>
-<td>amortized constant number of invocations of <code>e</code></td>
-</tr>
+  <p>Donald E. Knuth gives an extensive overview on pseudo-random number
+  generation in his book "The Art of Computer Programming, Vol. 2, 3rd
+  edition, Addison-Wesley, 1997". The descriptions for the specific
+  generators contain additional references.</p>
 
-<tr>
-<td><code>os &lt;&lt; x</code></td>
-<td><code>std::ostream&</code></td>
-<td>writes a textual representation for the parameters and additional
-internal data of the distribution <code>x</code> to <code>os</code>.
-<br>
-post: The <code>os.<em>fmtflags</em></code> and fill character are
-unchanged.</td>
-<td>O(size of state)</td>
-</tr>
+  <p><em>Note:</em> Because the state of a pseudo-random number generator is
+  necessarily finite, the sequence of numbers returned by the generator will
+  loop eventually.</p>
 
-<tr>
-<td><code>is &gt;&gt; u</code></td>
-<td><code>std::istream&</code></td>
-<td>restores the parameters and additional internal data of the
-distribution <code>u</code>.
-<br>
-pre: <code>is</code> provides a textual representation that was
-previously written by <code>operator&lt;&lt;</code>
-<br>
-post: The <code>is.<em>fmtflags</em></code> are unchanged.</td>
-<td>O(size of state)</td>
-</tr>
+  <p>In addition to the UniformRandomNumberGenerator requirements, a
+  pseudo-random number generator has some additional requirements. In the
+  following table, <code>X</code> denotes a pseudo-random number generator
+  class returning objects of type <code>T</code>, <code>x</code> is a value
+  of <code>T</code>, <code>u</code> is a value of <code>X</code>, and
+  <code>v</code> is a <code>const</code> value of <code>X</code>.</p>
 
-</table>
-<p>
+  <table border="1">
+    <tr>
+      <th colspan="3" align="center"><code>PseudoRandomNumberGenerator</code>
+      requirements</th>
+    </tr>
 
-Additional requirements:   The sequence of numbers produced by
-repeated invocations of <code>x(e)</code> does not change whether or
-not <code>os &lt;&lt; x</code> is invoked between any of the
-invocations <code>x(e)</code>.   If a textual representation
-is written using <code>os &lt;&lt; x</code> and that representation
-is restored into the same or a different object <code>y</code> of the
-same type using <code>is &gt;&gt; y</code>, repeated invocations of
-<code>y(e)</code> produce the same sequence of random numbers as would
-repeated invocations of <code>x(e)</code>.
-<p>
+    <tr>
+      <td>expression</td>
 
-<h2><a name="quasi-rng">Quasi-Random Number Generators</a></h2>
+      <td>return&nbsp;type</td>
 
-A quasi-random number generator is a Number Generator which provides a
-deterministic sequence of numbers, based on some algorithm and
-internal state.   The numbers do not have any statistical properties
-(such as uniform distribution or independence of successive values).
+      <td>pre/post-condition</td>
+    </tr>
 
-<p>
+    <tr>
+      <td><code>X()</code></td>
 
-<em>Note:</em> Quasi-random number generators are useful for
-Monte-Carlo integrations where specially crafted sequences of random
-numbers will make the approximation converge faster.
+      <td>-</td>
 
-<p>
+      <td>creates a generator in some implementation-defined state.
+      <em>Note:</em> Several generators thusly created may possibly produce
+      dependent or identical sequences of random numbers.</td>
+    </tr>
 
-<em>[Does anyone have a model?]</em>
+    <tr>
+      <td><code>explicit X(...)</code></td>
 
-<p>
-<hr>
-Jens Maurer, 2000-02-23
+      <td>-</td>
 
+      <td>creates a generator with user-provided state; the implementation
+      shall specify the constructor argument(s)</td>
+    </tr>
+
+    <tr>
+      <td><code>u.seed(...)</code></td>
+
+      <td>void</td>
+
+      <td>sets the current state according to the argument(s); at least
+      functions with the same signature as the non-default constructor(s)
+      shall be provided.</td>
+    </tr>
+
+    <tr>
+      <td><code>X::validation(x)</code></td>
+
+      <td><code>bool</code></td>
+
+      <td>compares the pre-computed and hardcoded 10001th element in the
+      generator's random number sequence with <code>x</code>. The generator
+      must have been constructed by its default constructor and
+      <code>seed</code> must not have been called for the validation to be
+      meaningful.</td>
+    </tr>
+  </table>
+
+  <p><em>Note:</em> The <code>seed</code> member function is similar to the
+  <code>assign</code> member function in STL containers. However, the naming
+  did not seem appropriate.</p>
+
+  <p>Classes which model a pseudo-random number generator shall also model
+  EqualityComparable, i.e. implement <code>operator==</code>. Two
+  pseudo-random number generators are defined to be <em>equivalent</em> if
+  they both return an identical sequence of numbers starting from a given
+  state.</p>
+
+  <p>Classes which model a pseudo-random number generator should also model
+  the Streamable concept, i.e. implement <code>operator&lt;&lt;</code> and
+  <code>operator&gt;&gt;</code>. If so, <code>operator&lt;&lt;</code> writes
+  all current state of the pseudo-random number generator to the given
+  <code>ostream</code> so that <code>operator&gt;&gt;</code> can restore the
+  state at a later time. The state shall be written in a platform-independent
+  manner, but it is assumed that the <code>locale</code>s used for writing
+  and reading be the same. The pseudo-random number generator with the
+  restored state and the original at the just-written state shall be
+  equivalent.</p>
+
+  <p>Classes which model a pseudo-random number generator may also model the
+  CopyConstructible and Assignable concepts. However, note that the sequences
+  of the original and the copy are strongly correlated (in fact, they are
+  identical), which may make them unsuitable for some problem domains. Thus,
+  copying pseudo-random number generators is discouraged; they should always
+  be passed by (non-<code>const</code>) reference.</p>
+
+  <p>The classes <code><a href=
+  "random-generators.html#rand48">rand48</a></code>, <code><a href=
+  "random-generators.html#linear_congruential">minstd_rand</a></code>, and
+  <code><a href="random-generators.html#mersenne_twister">mt19937</a></code>
+  are models for a pseudo-random number generator.</p>
+
+  <p><em>Note:</em> This type of random-number generator is useful for
+  numerics, games and testing. The non-zero arguments constructor(s) and the
+  <code>seed()</code> member function(s) allow for a user-provided state to
+  be installed in the generator. This is useful for debugging Monte-Carlo
+  algorithms and analyzing particular test scenarios. The Streamable concept
+  allows to save/restore the state of the generator, for example to re-run a
+  test suite at a later time.</p>
+
+  <h2><a name="random-dist" id="random-dist">Random Distribution</a></h2>
+
+  <p>A radom distribution produces random numbers distributed according to
+  some distribution, given uniformly distributed random values as input. In
+  the following table, <code>X</code> denotes a random distribution class
+  returning objects of type <code>T</code>, <code>u</code> is a value of
+  <code>X</code>, <code>x</code> is a (possibly const) value of
+  <code>X</code>, and <code>e</code> is an lvalue of an arbitrary type that
+  meets the requirements of a uniform random number generator, returning
+  values of type <code>U</code>.</p>
+
+  <table border="1">
+    <tr>
+      <th colspan="4" align="center">Random distribution requirements (in
+      addition to number generator, <code>CopyConstructible</code>, and
+      <code>Assignable</code>)</th>
+    </tr>
+
+    <tr>
+      <td>expression</td>
+
+      <td>return&nbsp;type</td>
+
+      <td>pre/post-condition</td>
+
+      <td>complexity</td>
+    </tr>
+
+    <tr>
+      <td><code>X::input_type</code></td>
+
+      <td>U</td>
+
+      <td>-</td>
+
+      <td>compile-time</td>
+    </tr>
+
+    <tr>
+      <td><code>u.reset()</code></td>
+
+      <td><code>void</code></td>
+
+      <td>subsequent uses of <code>u</code> do not depend on values produced
+      by <code>e</code> prior to invoking <code>reset</code>.</td>
+
+      <td>constant</td>
+    </tr>
+
+    <tr>
+      <td><code>u(e)</code></td>
+
+      <td><code>T</code></td>
+
+      <td>the sequence of numbers returned by successive invocations with the
+      same object <code>e</code> is randomly distributed with some
+      probability density function p(x)</td>
+
+      <td>amortized constant number of invocations of <code>e</code></td>
+    </tr>
+
+    <tr>
+      <td><code>os &lt;&lt; x</code></td>
+
+      <td><code>std::ostream&amp;</code></td>
+
+      <td>writes a textual representation for the parameters and additional
+      internal data of the distribution <code>x</code> to
+      <code>os</code>.<br>
+      post: The <code>os.<em>fmtflags</em></code> and fill character are
+      unchanged.</td>
+
+      <td>O(size of state)</td>
+    </tr>
+
+    <tr>
+      <td><code>is &gt;&gt; u</code></td>
+
+      <td><code>std::istream&amp;</code></td>
+
+      <td>restores the parameters and additional internal data of the
+      distribution <code>u</code>.<br>
+      pre: <code>is</code> provides a textual representation that was
+      previously written by <code>operator&lt;&lt;</code><br>
+      post: The <code>is.<em>fmtflags</em></code> are unchanged.</td>
+
+      <td>O(size of state)</td>
+    </tr>
+  </table>
+
+  <p>Additional requirements: The sequence of numbers produced by repeated
+  invocations of <code>x(e)</code> does not change whether or not <code>os
+  &lt;&lt; x</code> is invoked between any of the invocations
+  <code>x(e)</code>. If a textual representation is written using <code>os
+  &lt;&lt; x</code> and that representation is restored into the same or a
+  different object <code>y</code> of the same type using <code>is &gt;&gt;
+  y</code>, repeated invocations of <code>y(e)</code> produce the same
+  sequence of random numbers as would repeated invocations of
+  <code>x(e)</code>.</p>
+
+  <h2><a name="quasi-rng" id="quasi-rng">Quasi-Random Number
+  Generators</a></h2>
+
+  <p>A quasi-random number generator is a Number Generator which provides a
+  deterministic sequence of numbers, based on some algorithm and internal
+  state. The numbers do not have any statistical properties (such as uniform
+  distribution or independence of successive values).</p>
+
+  <p><em>Note:</em> Quasi-random number generators are useful for Monte-Carlo
+  integrations where specially crafted sequences of random numbers will make
+  the approximation converge faster.</p>
+
+  <p><em>[Does anyone have a model?]</em></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000-2003 <a href=
+  "../../people/jens_maurer.htm">Jens Maurer</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/random/random-distributions.html
===================================================================
--- boost/trunk/libs/random/random-distributions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/random/random-distributions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,180 +1,220 @@
+<!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 http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<title>Boost Random Number Library Distributions</title>
+  <title>Boost Random Number Library Distributions</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <h1>Random Number Library Distributions</h1>
 
-<h1>Random Number Library Distributions</h1>
+  <ul>
+    <li><a href="#intro">Introduction</a></li>
 
-<ul>
-<li><a href="#intro">Introduction</a>
-<li><a href="#synopsis">Synopsis</a>
-<li><a href="#uniform_smallint">Class template
-<code>uniform_smallint</code></a>
-<li><a href="#uniform_int">Class template <code>uniform_int</code></a>
-<li><a href="#uniform_01">Class template <code>uniform_01</code></a>
-<li><a href="#uniform_real">Class template
-<code>uniform_real</code></a>
-<li><a href="#bernoulli_distribution">Class template
-<code>bernoulli_distribution</code></a>
-<li><a href="#geometric_distribution">Class template
-<code>geometric_distribution</code></a>
-<li><a href="#triangle_distribution">Class template
-<code>triangle_distribution</code></a>
-<li><a href="#exponential_distribution">Class template
-<code>exponential_distribution</code></a>
-<li><a href="#normal_distribution">Class template
-<code>normal_distribution</code></a>
-<li><a href="#lognormal_distribution">Class template
-<code>lognormal_distribution</code></a>
-<li><a href="#uniform_on_sphere">Class template
-<code>uniform_on_sphere</code></a>
-</ul>
+    <li><a href="#synopsis">Synopsis</a></li>
 
-<h2><a name="intro">Introduction</a></h2>
+    <li><a href="#uniform_smallint">Class template
+    <code>uniform_smallint</code></a></li>
 
-In addition to the <a href="random-generators.html">random number
-generators</a>, this library provides distribution functions which map
-one distribution (often a uniform distribution provided by some
-generator) to another.
+    <li><a href="#uniform_int">Class template
+    <code>uniform_int</code></a></li>
 
-<p>
-Usually, there are several possible implementations of any given
-mapping.  Often, there is a choice between using more space, more
-invocations of the underlying source of random numbers, or more
-time-consuming arithmetic such as trigonometric functions.  This
-interface description does not mandate any specific implementation.
-However, implementations which cannot reach certain values of the
-specified distribution or otherwise do not converge statistically to
-it are not acceptable.
+    <li><a href="#uniform_01">Class template <code>uniform_01</code></a></li>
 
-<p>
-<table border="1">
-<tr><th>distribution</th><th>explanation</th><th>example</th></tr>
+    <li><a href="#uniform_real">Class template
+    <code>uniform_real</code></a></li>
 
-<tr>
-<td><code><a href="#uniform_smallint">uniform_smallint</a></code></td>
-<td>discrete uniform distribution on a small set of integers (much
-smaller than the range of the underlying generator)</td>
-<td>drawing from an urn</td>
-</tr>
+    <li><a href="#bernoulli_distribution">Class template
+    <code>bernoulli_distribution</code></a></li>
 
-<tr>
-<td><code><a href="#uniform_int">uniform_int</a></code></td>
-<td>discrete uniform distribution on a set of integers; the underlying
-generator may be called several times to gather enough randomness for
-the output</td>
-<td>drawing from an urn</td>
-</tr>
+    <li><a href="#geometric_distribution">Class template
+    <code>geometric_distribution</code></a></li>
 
-<tr>
-<td><code><a href="#uniform_01">uniform_01</a></code></td>
-<td>continuous uniform distribution on the range [0,1); important
-basis for other distributions</td>
-<td>-</td>
-</tr>
+    <li><a href="#triangle_distribution">Class template
+    <code>triangle_distribution</code></a></li>
 
-<tr>
-<td><code><a href="#uniform_real">uniform_real</a></code></td>
-<td>continuous uniform distribution on some range [min, max) of real
-numbers</td>
-<td>for the range [0, 2pi): randomly dropping a stick and measuring
-its angle in radiants (assuming the angle is uniformly
-distributed)</td>
-</tr>
+    <li><a href="#exponential_distribution">Class template
+    <code>exponential_distribution</code></a></li>
 
-<tr>
-<td><code><a href="#bernoulli_distribution">bernoulli_distribution</a></code></td>
-<td>Bernoulli experiment: discrete boolean valued distribution with
-configurable probability</td>
-<td>tossing a coin (p=0.5)</td>
-</tr>
+    <li><a href="#normal_distribution">Class template
+    <code>normal_distribution</code></a></li>
 
-<tr>
-<td><code><a href="#geometric_distribution">geometric_distribution</a></code></td>
-<td>measures distance between outcomes of repeated Bernoulli experiments</td>
-<td>throwing a die several times and counting the number of tries
-until a "6" appears for the first time</td>
-</tr>
+    <li><a href="#lognormal_distribution">Class template
+    <code>lognormal_distribution</code></a></li>
 
-<tr>
-<td><code><a href="#triangle_distribution">triangle_distribution</a></code></td>
-<td>?</td>
-<td>?</td>
-</tr>
+    <li><a href="#uniform_on_sphere">Class template
+    <code>uniform_on_sphere</code></a></li>
+  </ul>
 
-<tr>
-<td><code><a href="#exponential_distribution">exponential_distribution</a></code></td>
-<td>exponential distribution</td>
-<td>measuring the inter-arrival time of alpha particles emitted by
-radioactive matter</td>
-</tr>
+  <h2><a name="intro" id="intro">Introduction</a></h2>
 
-<tr>
-<td><code><a href="#normal_distribution">normal_distribution</a></code></td>
-<td>counts outcomes of (infinitely) repeated Bernoulli experiments</td>
-<td>tossing a coin 10000 times and counting how many front sides are shown</td>
-</tr>
+  <p>In addition to the <a href="random-generators.html">random number
+  generators</a>, this library provides distribution functions which map one
+  distribution (often a uniform distribution provided by some generator) to
+  another.</p>
 
-<tr>
-<td><code><a href="#lognormal_distribution">lognormal_distribution</a></code></td>
-<td>lognormal distribution (sometimes used in simulations)</td>
-<td>measuring the job completion time of an assembly line worker</td>
-</tr>
+  <p>Usually, there are several possible implementations of any given
+  mapping. Often, there is a choice between using more space, more
+  invocations of the underlying source of random numbers, or more
+  time-consuming arithmetic such as trigonometric functions. This interface
+  description does not mandate any specific implementation. However,
+  implementations which cannot reach certain values of the specified
+  distribution or otherwise do not converge statistically to it are not
+  acceptable.</p>
 
-<tr>
-<td><code><a href="#uniform_on_sphere">uniform_on_sphere</a></code></td>
-<td>uniform distribution on a unit sphere of arbitrary dimension</td>
-<td>choosing a random point on Earth (assumed to be a sphere) where to
-spend the next vacations</td>
-</tr>
+  <table border="1" summary="">
+    <tr>
+      <th>distribution</th>
 
-</table>
+      <th>explanation</th>
 
-<p>
+      <th>example</th>
+    </tr>
 
-The template parameters of the distribution functions are always in
-the order
-<ul>
-<li>Underlying source of random numbers
-<li>If applicable, return type, with a default to a reasonable type.
-</ul>
+    <tr>
+      <td><code><a href="#uniform_smallint">uniform_smallint</a></code></td>
 
-<p>
-<em>The distribution functions no longer satisfy the input iterator
-requirements (std:24.1.1 [lib.input.iterators]), because this is
-redundant given the Generator interface and imposes a run-time
-overhead on all users.  Moreover, a Generator interface appeals to
-random number generation as being more "natural".  Use an
-<a href="../utility/iterator_adaptors.htm">iterator adaptor</a>
-if you need to wrap any of the generators in an input iterator
-interface.</em>
-<p>
+      <td>discrete uniform distribution on a small set of integers (much
+      smaller than the range of the underlying generator)</td>
 
-All of the distribution functions described below store a non-const
-reference to the underlying source of random numbers.  Therefore, the
-distribution functions are not Assignable.  However, they are
-CopyConstructible.  Copying a distribution function will copy the
-parameter values.  Furthermore, both the copy and the original will
-refer to the same underlying source of random numbers.  Therefore,
-both the copy and the original will obtain their underlying random
-numbers from a single sequence.
+      <td>drawing from an urn</td>
+    </tr>
 
-<p>
-In this description, I have refrained from documenting those members
-in detail which are already defined in the
-<a href="random-concepts.html">concept documentation</a>.
+    <tr>
+      <td><code><a href="#uniform_int">uniform_int</a></code></td>
 
+      <td>discrete uniform distribution on a set of integers; the underlying
+      generator may be called several times to gather enough randomness for
+      the output</td>
 
-<h2><a name="synopsis">Synopsis of the distributions</a> available from header
-<code>&lt;boost/random.hpp&gt;</code> </h2>
+      <td>drawing from an urn</td>
+    </tr>
 
-<pre>
+    <tr>
+      <td><code><a href="#uniform_01">uniform_01</a></code></td>
+
+      <td>continuous uniform distribution on the range [0,1); important basis
+      for other distributions</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td><code><a href="#uniform_real">uniform_real</a></code></td>
+
+      <td>continuous uniform distribution on some range [min, max) of real
+      numbers</td>
+
+      <td>for the range [0, 2pi): randomly dropping a stick and measuring its
+      angle in radiants (assuming the angle is uniformly distributed)</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#bernoulli_distribution">bernoulli_distribution</a></code></td>
+
+      <td>Bernoulli experiment: discrete boolean valued distribution with
+      configurable probability</td>
+
+      <td>tossing a coin (p=0.5)</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#geometric_distribution">geometric_distribution</a></code></td>
+
+      <td>measures distance between outcomes of repeated Bernoulli
+      experiments</td>
+
+      <td>throwing a die several times and counting the number of tries until
+      a "6" appears for the first time</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#triangle_distribution">triangle_distribution</a></code></td>
+
+      <td>?</td>
+
+      <td>?</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#exponential_distribution">exponential_distribution</a></code></td>
+
+      <td>exponential distribution</td>
+
+      <td>measuring the inter-arrival time of alpha particles emitted by
+      radioactive matter</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#normal_distribution">normal_distribution</a></code></td>
+
+      <td>counts outcomes of (infinitely) repeated Bernoulli experiments</td>
+
+      <td>tossing a coin 10000 times and counting how many front sides are
+      shown</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#lognormal_distribution">lognormal_distribution</a></code></td>
+
+      <td>lognormal distribution (sometimes used in simulations)</td>
+
+      <td>measuring the job completion time of an assembly line worker</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#uniform_on_sphere">uniform_on_sphere</a></code></td>
+
+      <td>uniform distribution on a unit sphere of arbitrary dimension</td>
+
+      <td>choosing a random point on Earth (assumed to be a sphere) where to
+      spend the next vacations</td>
+    </tr>
+  </table>
+
+  <p>The template parameters of the distribution functions are always in the
+  order</p>
+
+  <ul>
+    <li>Underlying source of random numbers</li>
+
+    <li>If applicable, return type, with a default to a reasonable type.</li>
+  </ul>
+
+  <p><em>The distribution functions no longer satisfy the input iterator
+  requirements (std:24.1.1 [lib.input.iterators]), because this is redundant
+  given the Generator interface and imposes a run-time overhead on all users.
+  Moreover, a Generator interface appeals to random number generation as
+  being more "natural". Use an <a href=
+  "../utility/iterator_adaptors.htm">iterator adaptor</a> if you need to wrap
+  any of the generators in an input iterator interface.</em></p>
+
+  <p>All of the distribution functions described below store a non-const
+  reference to the underlying source of random numbers. Therefore, the
+  distribution functions are not Assignable. However, they are
+  CopyConstructible. Copying a distribution function will copy the parameter
+  values. Furthermore, both the copy and the original will refer to the same
+  underlying source of random numbers. Therefore, both the copy and the
+  original will obtain their underlying random numbers from a single
+  sequence.</p>
+
+  <p>In this description, I have refrained from documenting those members in
+  detail which are already defined in the <a href=
+  "random-concepts.html">concept documentation</a>.</p>
+
+  <h2><a name="synopsis" id="synopsis">Synopsis of the distributions</a>
+  available from header <code>&lt;boost/random.hpp&gt;</code></h2>
+  <pre>
 namespace boost {
   template&lt;class IntType = int&gt;
   class uniform_smallint;
@@ -206,14 +246,14 @@
 }
 </pre>
 
-<h2><a name="uniform_smallint">Class template
-<code>uniform_smallint</code></a></h2>
+  <h2><a name="uniform_smallint" id="uniform_smallint">Class template
+  <code>uniform_smallint</code></a></h2>
 
-<h3>Synopsis</h3>
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/uniform_smallint.hpp">boost/random/uniform_smallint.hpp</a>&gt;
 
-<pre>
-#include &lt;<a href="../../boost/random/uniform_smallint.hpp">boost/random/uniform_smallint.hpp</a>&gt;
-
 template&lt;class IntType = int&gt;
 class uniform_smallint
 {
@@ -226,79 +266,77 @@
   result_type max() const;
   void reset();
   template&lt;class UniformRandomNumberGenerator&gt;
-  result_type operator()(UniformRandomNumberGenerator& urng);
+  result_type operator()(UniformRandomNumberGenerator&amp; urng);
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-The distribution function <code>uniform_smallint</code> models a
-<a href="random-concepts.html#random-dist">random distribution</a>.
-On each invocation, it returns a random integer value
-uniformly distributed in the set of integer numbers {min, min+1,
-min+2, ..., max}.  It assumes that the desired range (max-min+1) is
-small compared to the range of the underlying source of random
-numbers and thus makes no attempt to limit quantization errors.
-<p>
-Let r<sub>out</sub>=(max-min+1) the desired range of integer numbers,
-and let r<sub>base</sub> be the range of the underlying source of
-random numbers.  Then, for the uniform distribution, the theoretical
-probability for any number i in the range r<sub>out</sub> will be
-p<sub>out</sub>(i) = 1/r<sub>out</sub>.  Likewise, assume a uniform
-distribution on r<sub>base</sub> for the underlying source of random
-numbers, i.e. p<sub>base</sub>(i) = 1/r<sub>base</sub>.  Let
-p<sub>out_s</sub>(i) denote the random distribution generated by
-<code>uniform_smallint</code>.  Then the sum over all i in
-r<sub>out</sub> of (p<sub>out_s</sub>(i)/p<sub>out</sub>(i)
--1)<sup>2</sup> shall not exceed
-r<sub>out</sub>/r<sub>base</sub><sup>2</sup> (r<sub>base</sub> mod
-r<sub>out</sub>)(r<sub>out</sub> - r<sub>base</sub> mod
-r<sub>out</sub>).
-<p>
+  <p>The distribution function <code>uniform_smallint</code> models a
+  <a href="random-concepts.html#random-dist">random distribution</a>. On each
+  invocation, it returns a random integer value uniformly distributed in the
+  set of integer numbers {min, min+1, min+2, ..., max}. It assumes that the
+  desired range (max-min+1) is small compared to the range of the underlying
+  source of random numbers and thus makes no attempt to limit quantization
+  errors.</p>
 
-The template parameter <code>IntType</code> shall denote an
-integer-like value type.
+  <p>Let r<sub>out</sub>=(max-min+1) the desired range of integer numbers,
+  and let r<sub>base</sub> be the range of the underlying source of random
+  numbers. Then, for the uniform distribution, the theoretical probability
+  for any number i in the range r<sub>out</sub> will be p<sub>out</sub>(i) =
+  1/r<sub>out</sub>. Likewise, assume a uniform distribution on
+  r<sub>base</sub> for the underlying source of random numbers, i.e.
+  p<sub>base</sub>(i) = 1/r<sub>base</sub>. Let p<sub>out_s</sub>(i) denote
+  the random distribution generated by <code>uniform_smallint</code>. Then
+  the sum over all i in r<sub>out</sub> of
+  (p<sub>out_s</sub>(i)/p<sub>out</sub>(i) -1)<sup>2</sup> shall not exceed
+  r<sub>out</sub>/r<sub>base</sub><sup>2</sup> (r<sub>base</sub> mod
+  r<sub>out</sub>)(r<sub>out</sub> - r<sub>base</sub> mod
+  r<sub>out</sub>).</p>
 
-<p>
-<em>Note:</em> The property above is the square sum of the relative
-differences in probabilities between the desired uniform distribution
-p<sub>out</sub>(i) and the generated distribution
-p<sub>out_s</sub>(i).  The property can be fulfilled with the
-calculation (base_rng mod r<sub>out</sub>), as follows: Let r =
-r<sub>base</sub> mod r<sub>out</sub>.  The base distribution on
-r<sub>base</sub> is folded onto the range r<sub>out</sub>.  The
-numbers i &lt; r have assigned (r<sub>base</sub> div
-r<sub>out</sub>)+1 numbers of the base distribution, the rest has only
-(r<sub>base</sub> div r<sub>out</sub>).  Therefore,
-p<sub>out_s</sub>(i) = ((r<sub>base</sub> div r<sub>out</sub>)+1) /
-r<sub>base</sub> for i &lt; r and p<sub>out_s</sub>(i) =
-(r<sub>base</sub> div r<sub>out</sub>)/r<sub>base</sub> otherwise.
-Substituting this in the above sum formula leads to the desired
-result.
-<p>
-<em>Note:</em> The upper bound for (r<sub>base</sub> mod r<sub>out</sub>)(r<sub>out</sub> - r<sub>base</sub>
-mod r<sub>out</sub>) is r<sub>out</sub><sup>2</sup>/4.  Regarding the upper bound for the square
-sum of the relative quantization error of r<sub>out</sub><sup>3</sup>/(4*r<sub>base</sub><sup>2</sup>), it
-seems wise to either choose r<sub>base</sub> so that r<sub>base</sub> &gt; 10*r<sub>out</sub><sup>2</sup> or
-ensure that r<sub>base</sub> is divisible by r<sub>out</sub>.
+  <p>The template parameter <code>IntType</code> shall denote an integer-like
+  value type.</p>
 
+  <p><em>Note:</em> The property above is the square sum of the relative
+  differences in probabilities between the desired uniform distribution
+  p<sub>out</sub>(i) and the generated distribution p<sub>out_s</sub>(i). The
+  property can be fulfilled with the calculation (base_rng mod
+  r<sub>out</sub>), as follows: Let r = r<sub>base</sub> mod r<sub>out</sub>.
+  The base distribution on r<sub>base</sub> is folded onto the range
+  r<sub>out</sub>. The numbers i &lt; r have assigned (r<sub>base</sub> div
+  r<sub>out</sub>)+1 numbers of the base distribution, the rest has only
+  (r<sub>base</sub> div r<sub>out</sub>). Therefore, p<sub>out_s</sub>(i) =
+  ((r<sub>base</sub> div r<sub>out</sub>)+1) / r<sub>base</sub> for i &lt; r
+  and p<sub>out_s</sub>(i) = (r<sub>base</sub> div
+  r<sub>out</sub>)/r<sub>base</sub> otherwise. Substituting this in the above
+  sum formula leads to the desired result.</p>
 
-<h3>Members</h3>
+  <p><em>Note:</em> The upper bound for (r<sub>base</sub> mod
+  r<sub>out</sub>)(r<sub>out</sub> - r<sub>base</sub> mod r<sub>out</sub>) is
+  r<sub>out</sub><sup>2</sup>/4. Regarding the upper bound for the square sum
+  of the relative quantization error of
+  r<sub>out</sub><sup>3</sup>/(4*r<sub>base</sub><sup>2</sup>), it seems wise
+  to either choose r<sub>base</sub> so that r<sub>base</sub> &gt;
+  10*r<sub>out</sub><sup>2</sup> or ensure that r<sub>base</sub> is divisible
+  by r<sub>out</sub>.</p>
 
-<pre>uniform_smallint(IntType min, IntType max)</pre>
+  <h3>Members</h3>
+  <pre>
+uniform_smallint(IntType min, IntType max)
+</pre>
 
-<strong>Effects:</strong> Constructs a <code>uniform_smallint</code>
-functor. <code>min</code> and <code>max</code> are the lower and upper
-bounds of the output range, respectively.
+  <p><strong>Effects:</strong> Constructs a <code>uniform_smallint</code>
+  functor. <code>min</code> and <code>max</code> are the lower and upper
+  bounds of the output range, respectively.</p>
 
+  <h2><a name="uniform_int" id="uniform_int">Class template
+  <code>uniform_int</code></a></h2>
 
-<h2><a name="uniform_int">Class template <code>uniform_int</code></a></h2>
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/uniform_int.hpp">boost/random/uniform_int.hpp</a>&gt;
 
-<h3>Synopsis</h3>
-
-<pre>
-#include &lt;<a href="../../boost/random/uniform_int.hpp">boost/random/uniform_int.hpp</a>&gt;
-
 template&lt;class IntType = int&gt;
 class uniform_int
 {
@@ -311,55 +349,59 @@
   result_type max() const;
   void reset();
   template&lt;class UniformRandomNumberGenerator&gt;
-  result_type operator()(UniformRandomNumberGenerator& urng);
+  result_type operator()(UniformRandomNumberGenerator&amp; urng);
   template&lt;class UniformRandomNumberGenerator&gt;
-  result_type operator()(UniformRandomNumberGenerator& urng, result_type n);
+  result_type operator()(UniformRandomNumberGenerator&amp; urng, result_type n);
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-The distribution function <code>uniform_int</code> models a
-<a href="random-concepts.html#random-dist">random distribution</a>.
-On each invocation, it returns a random integer
-value uniformly distributed in the set of integer numbers
-{min, min+1, min+2, ..., max}.
-<p>
+  <p>The distribution function <code>uniform_int</code> models a <a href=
+  "random-concepts.html#random-dist">random distribution</a>. On each
+  invocation, it returns a random integer value uniformly distributed in the
+  set of integer numbers {min, min+1, min+2, ..., max}.</p>
 
-The template parameter <code>IntType</code> shall denote an
-integer-like value type.
+  <p>The template parameter <code>IntType</code> shall denote an integer-like
+  value type.</p>
 
-<h3>Members</h3>
+  <h3>Members</h3>
+  <pre>
+    uniform_int(IntType min = 0, IntType max = 9)
+</pre>
 
-<pre>    uniform_int(IntType min = 0, IntType max = 9)</pre>
-<strong>Requires:</strong> min &lt;= max
-<br>
-<strong>Effects:</strong> Constructs a <code>uniform_int</code>
-object.  <code>min</code> and <code>max</code> are the parameters of
-the distribution.
+  <p><strong>Requires:</strong> min &lt;= max<br>
+  <strong>Effects:</strong> Constructs a <code>uniform_int</code> object.
+  <code>min</code> and <code>max</code> are the parameters of the
+  distribution.</p>
+  <pre>
+    result_type min() const
+</pre>
 
-<pre>    result_type min() const</pre>
-<strong>Returns:</strong> The "min" parameter of the distribution.
+  <p><strong>Returns:</strong> The "min" parameter of the distribution.</p>
+  <pre>
+    result_type max() const
+</pre>
 
-<pre>    result_type max() const</pre>
-<strong>Returns:</strong> The "max" parameter of the distribution.
+  <p><strong>Returns:</strong> The "max" parameter of the distribution.</p>
+  <pre>
+    result_type operator()(UniformRandomNumberGenerator&amp; urng, result_type 
+n)
+</pre>
 
-<pre>    result_type operator()(UniformRandomNumberGenerator& urng, result_type 
-n)</pre>
-<strong>Returns:</strong> A uniform random number x in the range 0
-&lt;= x &lt; n.  <em>[Note: This allows a
-<code>variate_generator</code> object with a <code>uniform_int</code>
-distribution to be used with std::random_shuffe, see
-[lib.alg.random.shuffle]. ]</em>
+  <p><strong>Returns:</strong> A uniform random number x in the range 0 &lt;=
+  x &lt; n. <em>[Note: This allows a <code>variate_generator</code> object
+  with a <code>uniform_int</code> distribution to be used with
+  std::random_shuffe, see [lib.alg.random.shuffle]. ]</em></p>
 
+  <h2><a name="uniform_01" id="uniform_01">Class template
+  <code>uniform_01</code></a></h2>
 
-<h2><a name="uniform_01">Class template <code>uniform_01</code></a></h2>
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/uniform_01.hpp">boost/random/uniform_01.hpp</a>&gt;
 
-<h3>Synopsis</h3>
-
-<pre>
-#include &lt;<a href="../../boost/random/uniform_01.hpp">boost/random/uniform_01.hpp</a>&gt;
-
 template&lt;class UniformRandomNumberGenerator, class RealType = double&gt;
 class uniform_01
 {
@@ -367,58 +409,54 @@
   typedef UniformRandomNumberGenerator base_type;
   typedef RealType result_type;
   static const bool has_fixed_range = false;
-  explicit uniform_01(base_type & rng);
+  explicit uniform_01(base_type &amp; rng);
   result_type operator()();
   result_type min() const;
   result_type max() const;
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-The distribution function <code>uniform_01</code> models a
-<a href="random-concepts.html#random-dist">random distribution</a>.
-On each invocation, it returns a random floating-point value uniformly
-distributed in the range [0..1).
+  <p>The distribution function <code>uniform_01</code> models a <a href=
+  "random-concepts.html#random-dist">random distribution</a>. On each
+  invocation, it returns a random floating-point value uniformly distributed
+  in the range [0..1). The value is computed using
+  <code>std::numeric_limits&lt;RealType&gt;::digits</code> random binary
+  digits, i.e. the mantissa of the floating-point value is completely filled
+  with random bits. [<em>Note:</em> Should this be configurable?]</p>
 
-The value is computed using
-<code>std::numeric_limits&lt;RealType&gt;::digits</code> random binary
-digits, i.e. the mantissa of the floating-point value is completely
-filled with random bits. [<em>Note:</em> Should this be configurable?]
+  <p>The template parameter <code>RealType</code> shall denote a float-like
+  value type with support for binary operators +, -, and /. It must be large
+  enough to hold floating-point numbers of value
+  <code>rng.max()-rng.min()+1</code>.</p>
 
-<p>
-The template parameter <code>RealType</code> shall denote a float-like
-value type with support for binary operators +, -, and /.  It must be
-large enough to hold floating-point numbers of value
-<code>rng.max()-rng.min()+1</code>.
-<p>
-<code>base_type::result_type</code> must be a number-like value type,
-it must support <code>static_cast&lt;&gt;</code> to
-<code>RealType</code> and binary operator -.
+  <p><code>base_type::result_type</code> must be a number-like value type, it
+  must support <code>static_cast&lt;&gt;</code> to <code>RealType</code> and
+  binary operator -.</p>
 
-<p>
+  <p><em>Note:</em> The current implementation is buggy, because it may not
+  fill all of the mantissa with random bits. I'm unsure how to fill a
+  (to-be-invented) <code>boost::bigfloat</code> class with random bits
+  efficiently. It's probably time for a traits class.</p>
 
-<em>Note:</em> The current implementation is buggy, because it may not
-fill all of the mantissa with random bits.  I'm unsure how to fill a
-(to-be-invented) <code>boost::bigfloat</code> class with random bits
-efficiently.  It's probably time for a traits class.
+  <h3>Members</h3>
+  <pre>
+explicit uniform_01(base_type &amp; rng)
+</pre>
 
-<h3>Members</h3>
+  <p><strong>Effects:</strong> Constructs a <code>uniform_01</code> functor
+  with the given uniform random number generator as the underlying source of
+  random numbers.</p>
 
-<pre>explicit uniform_01(base_type & rng)</pre>
+  <h2><a name="uniform_real" id="uniform_real">Class template
+  <code>uniform_real</code></a></h2>
 
-<strong>Effects:</strong> Constructs a <code>uniform_01</code> functor
-with the given uniform random number generator as the underlying
-source of random numbers.
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/uniform_real.hpp">boost/random/uniform_real.hpp</a>&gt;
 
-
-<h2><a name="uniform_real">Class template <code>uniform_real</code></a></h2>
-
-<h3>Synopsis</h3>
-
-<pre>
-#include &lt;<a href="../../boost/random/uniform_real.hpp">boost/random/uniform_real.hpp</a>&gt;
-
 template&lt;class RealType = double&gt;
 class uniform_real
 {
@@ -431,94 +469,96 @@
   result_type max() const;
   void reset();
   template&lt;class UniformRandomNumberGenerator&gt;
-  result_type operator()(UniformRandomNumberGenerator& urng);
+  result_type operator()(UniformRandomNumberGenerator&amp; urng);
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-The distribution function <code>uniform_real</code> models a
-<a href="random-concepts.html#random-dist">random distribution</a>.
-On each invocation, it returns a random floating-point
-value uniformly distributed in the range [min..max). The value is
-computed using
-<code>std::numeric_limits&lt;RealType&gt;::digits</code> random binary
-digits, i.e. the mantissa of the floating-point value is completely
-filled with random bits.
-<p>
+  <p>The distribution function <code>uniform_real</code> models a <a href=
+  "random-concepts.html#random-dist">random distribution</a>. On each
+  invocation, it returns a random floating-point value uniformly distributed
+  in the range [min..max). The value is computed using
+  <code>std::numeric_limits&lt;RealType&gt;::digits</code> random binary
+  digits, i.e. the mantissa of the floating-point value is completely filled
+  with random bits.</p>
 
-<em>Note:</em> The current implementation is buggy, because it may not
-fill all of the mantissa with random bits.
+  <p><em>Note:</em> The current implementation is buggy, because it may not
+  fill all of the mantissa with random bits.</p>
 
+  <h3>Members</h3>
+  <pre>
+    uniform_real(RealType min = RealType(0), RealType max = RealType(1))
+</pre>
 
-<h3>Members</h3>
+  <p><strong>Requires:</strong> min &lt;= max<br>
+  <strong>Effects:</strong> Constructs a <code>uniform_real</code> object;
+  <code>min</code> and <code>max</code> are the parameters of the
+  distribution.</p>
+  <pre>
+    result_type min() const
+</pre>
 
-<pre>    uniform_real(RealType min = RealType(0), RealType max = RealType(1))</pre>
-<strong>Requires:</strong> min &lt;= max
-<br>
-<strong>Effects:</strong> Constructs a
-<code>uniform_real</code> object; <code>min</code> and
-<code>max</code> are the parameters of the distribution.
+  <p><strong>Returns:</strong> The "min" parameter of the distribution.</p>
+  <pre>
+    result_type max() const
+</pre>
 
-<pre>    result_type min() const</pre>
-<strong>Returns:</strong> The "min" parameter of the distribution.
+  <p><strong>Returns:</strong> The "max" parameter of the distribution.</p>
 
-<pre>    result_type max() const</pre>
-<strong>Returns:</strong> The "max" parameter of the distribution.
+  <h2><a name="bernoulli_distribution" id="bernoulli_distribution">Class
+  template <code>bernoulli_distribution</code></a></h2>
 
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/bernoulli_distribution.hpp">boost/random/bernoulli_distribution.hpp</a>&gt;
 
-<h2><a name="bernoulli_distribution">Class template
-<code>bernoulli_distribution</code></a></h2>
-
-<h3>Synopsis</h3>
-
-<pre>
-#include &lt;<a href="../../boost/random/bernoulli_distribution.hpp">boost/random/bernoulli_distribution.hpp</a>&gt;
-
-template&lt;class RealType = double>
+template&lt;class RealType = double&gt;
 class bernoulli_distribution
 {
 public:
   typedef int input_type;
   typedef bool result_type;
 
-  explicit bernoulli_distribution(const RealType& p = RealType(0.5));
+  explicit bernoulli_distribution(const RealType&amp; p = RealType(0.5));
   RealType p() const;
   void reset();
   template&lt;class UniformRandomNumberGenerator&gt;
-  result_type operator()(UniformRandomNumberGenerator& urng);
+  result_type operator()(UniformRandomNumberGenerator&amp; urng);
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Instantiations of class template <code>bernoulli_distribution</code>
-model a <a href="random-concepts.html#random-dist">random
-distribution</a>.  Such a random distribution produces
-<code>bool</code> values distributed with probabilities P(true) = p
-and P(false) = 1-p.  p is the parameter of the distribution.
+  <p>Instantiations of class template <code>bernoulli_distribution</code>
+  model a <a href="random-concepts.html#random-dist">random distribution</a>.
+  Such a random distribution produces <code>bool</code> values distributed
+  with probabilities P(true) = p and P(false) = 1-p. p is the parameter of
+  the distribution.</p>
 
-<h3>Members</h3>
+  <h3>Members</h3>
+  <pre>
+    bernoulli_distribution(const RealType&amp; p = RealType(0.5))
+</pre>
 
-<pre>    bernoulli_distribution(const RealType& p = RealType(0.5))</pre>
+  <p><strong>Requires:</strong> 0 &lt;= p &lt;= 1<br>
+  <strong>Effects:</strong> Constructs a <code>bernoulli_distribution</code>
+  object. <code>p</code> is the parameter of the distribution.</p>
+  <pre>
+    RealType p() const
+</pre>
 
-<strong>Requires:</strong> 0 &lt;= p &lt;= 1
-<br>
-<strong>Effects:</strong> Constructs a
-<code>bernoulli_distribution</code> object.  <code>p</code> is the
-parameter of the distribution.
+  <p><strong>Returns:</strong> The "p" parameter of the distribution.</p>
 
-<pre>    RealType p() const</pre>
-<strong>Returns:</strong> The "p" parameter of the distribution.
+  <h2><a name="geometric_distribution" id="geometric_distribution">Class
+  template <code>geometric_distribution</code></a></h2>
 
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/geometric_distribution.hpp">boost/random/geometric_distribution.hpp</a>&gt;
 
-<h2><a name="geometric_distribution">Class template
-<code>geometric_distribution</code></a></h2>
-
-<h3>Synopsis</h3>
-<pre>
-#include &lt;<a href="../../boost/random/geometric_distribution.hpp">boost/random/geometric_distribution.hpp</a>&gt;
-
 template&lt;class UniformRandomNumberGenerator, class IntType = int&gt;
 class geometric_distribution
 {
@@ -526,46 +566,44 @@
   typedef RealType input_type;
   typedef IntType result_type;
 
-  explicit geometric_distribution(const RealType& p = RealType(0.5));
+  explicit geometric_distribution(const RealType&amp; p = RealType(0.5));
   RealType p() const;
   void reset();
   template&lt;class UniformRandomNumberGenerator&gt;
-  result_type operator()(UniformRandomNumberGenerator& urng);
+  result_type operator()(UniformRandomNumberGenerator&amp; urng);
 };
 </pre>
 
+  <h3>Description</h3>
 
-<h3>Description</h3>
+  <p>Instantiations of class template <code>geometric_distribution</code>
+  model a <a href="random-concepts.html#random-dist">random distribution</a>.
+  A <code>geometric_distribution</code> random distribution produces integer
+  values <em>i</em> &gt;= 1 with p(i) = (1-p) * p<sup>i-1</sup>. p is the
+  parameter of the distribution.</p>
 
-Instantiations of class template <code>geometric_distribution</code>
-model a
-<a href="random-concepts.html#random-dist">random distribution</a>.
-A <code>geometric_distribution</code> random distribution produces
-integer values <em>i</em> &gt;= 1 with p(i) = (1-p) * p<sup>i-1</sup>.
-p is the parameter of the distribution.
+  <h3>Members</h3>
+  <pre>
+    geometric_distribution(const RealType&amp; p = RealType(0.5))
+</pre>
 
+  <p><strong>Requires:</strong> 0 &lt; p &lt; 1<br>
+  <strong>Effects:</strong> Constructs a <code>geometric_distribution</code>
+  object; <code>p</code> is the parameter of the distribution.</p>
+  <pre>
+   RealType p() const
+</pre>
 
-<h3>Members</h3>
+  <p><strong>Returns:</strong> The "p" parameter of the distribution.</p>
 
-<pre>    geometric_distribution(const RealType& p = RealType(0.5))</pre>
+  <h2><a name="triangle_distribution" id="triangle_distribution">Class
+  template <code>triangle_distribution</code></a></h2>
 
-<strong>Requires:</strong> 0 &lt; p &lt; 1
-<br>
-<strong>Effects:</strong> Constructs a
-<code>geometric_distribution</code> object; <code>p</code> is the
-parameter of the distribution.
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/triangle_distribution.hpp">boost/random/triangle_distribution.hpp</a>&gt;
 
-<pre>   RealType p() const</pre>
-<strong>Returns:</strong> The "p" parameter of the distribution.
-
-
-<h2><a name="triangle_distribution">Class template
-<code>triangle_distribution</code></a></h2>
-
-<h3>Synopsis</h3>
-<pre>
-#include &lt;<a href="../../boost/random/triangle_distribution.hpp">boost/random/triangle_distribution.hpp</a>&gt;
-
 template&lt;class RealType = double&gt;
 class triangle_distribution
 {
@@ -578,184 +616,181 @@
   result_type c() const;
   void reset();
   template&lt;class UniformRandomNumberGenerator&gt;
-  result_type operator()(UniformRandomNumberGenerator& urng);
+  result_type operator()(UniformRandomNumberGenerator&amp; urng);
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Instantiations of class template <code>triangle_distribution</code>
-model a <a href="random-concepts.html#random-dist">random
-distribution</a>.  The returned floating-point values <code>x</code>
-satisfy <code>a <= x <= c</code>; <code>x</code> has a triangle
-distribution, where <code>b</code> is the most probable value for
-<code>x</code>.
+  <p>Instantiations of class template <code>triangle_distribution</code>
+  model a <a href="random-concepts.html#random-dist">random distribution</a>.
+  The returned floating-point values <code>x</code> satisfy <code>a &lt;= x
+  &lt;= c</code>; <code>x</code> has a triangle distribution, where
+  <code>b</code> is the most probable value for <code>x</code>.</p>
 
-<h3>Members</h3>
+  <h3>Members</h3>
+  <pre>
+triangle_distribution(result_type a, result_type b, result_type c)
+</pre>
 
-<pre>triangle_distribution(result_type a, result_type b, result_type c)</pre>
+  <p><strong>Effects:</strong> Constructs a
+  <code>triangle_distribution</code> functor. <code>a, b, c</code> are the
+  parameters for the distribution.</p>
 
-<strong>Effects:</strong> Constructs a
-<code>triangle_distribution</code> functor. <code>a, b, c</code> are
-the parameters for the distribution.
-<p>
+  <h2><a name="exponential_distribution" id="exponential_distribution">Class
+  template <code>exponential_distribution</code></a></h2>
 
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/exponential_distribution.hpp">boost/random/exponential_distribution.hpp</a>&gt;
 
-<h2><a name="exponential_distribution">Class template
-<code>exponential_distribution</code></a></h2>
-
-<h3>Synopsis</h3>
-<pre>
-#include &lt;<a href="../../boost/random/exponential_distribution.hpp">boost/random/exponential_distribution.hpp</a>&gt;
-
 template&lt;class RealType = double&gt;
 class exponential_distribution
 {
 public:
   typedef RealType input_type;
   typedef RealType result_type;
-  explicit exponential_distribution(const result_type& lambda);
+  explicit exponential_distribution(const result_type&amp; lambda);
   RealType lambda() const;
   void reset();
   template&lt;class UniformRandomNumberGenerator&gt;
-  result_type operator()(UniformRandomNumberGenerator& urng);
+  result_type operator()(UniformRandomNumberGenerator&amp; urng);
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Instantiations of class template <code>exponential_distribution</code>
-model a <a href="random-concepts.html#random-dist">random
-distribution</a>.  Such a distribution produces random numbers x &gt;
-0 distributed with probability density function p(x) = lambda *
-exp(-lambda * x), where lambda is the parameter of the distribution.
+  <p>Instantiations of class template <code>exponential_distribution</code>
+  model a <a href="random-concepts.html#random-dist">random distribution</a>.
+  Such a distribution produces random numbers x &gt; 0 distributed with
+  probability density function p(x) = lambda * exp(-lambda * x), where lambda
+  is the parameter of the distribution.</p>
 
-<h3>Members</h3>
+  <h3>Members</h3>
+  <pre>
+    exponential_distribution(const result_type&amp; lambda = result_type(1))
+</pre>
 
-<pre>    exponential_distribution(const result_type& lambda = result_type(1))</pre>
-<strong>Requires:</strong> lambda &gt; 0
-<br>
-<strong>Effects:</strong> Constructs an
-<code>exponential_distribution</code> object with <code>rng</code> as
-the reference to the underlying source of random
-numbers. <code>lambda</code> is the parameter for the distribution.
+  <p><strong>Requires:</strong> lambda &gt; 0<br>
+  <strong>Effects:</strong> Constructs an
+  <code>exponential_distribution</code> object with <code>rng</code> as the
+  reference to the underlying source of random numbers. <code>lambda</code>
+  is the parameter for the distribution.</p>
+  <pre>
+    RealType lambda() const
+</pre>
 
-<pre>    RealType lambda() const</pre>
-<strong>Returns:</strong> The "lambda" parameter of the distribution.
+  <p><strong>Returns:</strong> The "lambda" parameter of the
+  distribution.</p>
 
+  <h2><a name="normal_distribution" id="normal_distribution">Class template
+  <code>normal_distribution</code></a></h2>
 
-<h2><a name="normal_distribution">Class template
-<code>normal_distribution</code></a></h2>
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/normal_distribution.hpp">boost/random/normal_distribution.hpp</a>&gt;
 
-<h3>Synopsis</h3>
-
-<pre>
-#include &lt;<a href="../../boost/random/normal_distribution.hpp">boost/random/normal_distribution.hpp</a>&gt;
-
 template&lt;class RealType = double&gt;
 class normal_distribution
 {
 public:
   typedef RealType input_type;
   typedef RealType result_type;
-  explicit normal_distribution(const result_type& mean = 0,
-			       const result_type& sigma = 1);
+  explicit normal_distribution(const result_type&amp; mean = 0,
+                               const result_type&amp; sigma = 1);
   RealType mean() const;
   RealType sigma() const;
   void reset();
   template&lt;class UniformRandomNumberGenerator&gt;
-  result_type operator()(UniformRandomNumberGenerator& urng);
+  result_type operator()(UniformRandomNumberGenerator&amp; urng);
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Instantiations of class template <code>normal_distribution</code>
-model a <a href="random-concepts.html#random-dist">random
-distribution</a>.  Such a distribution produces random numbers x
-distributed with probability density function p(x) =
-1/sqrt(2*pi*sigma) * exp(- (x-mean)<sup>2</sup> /
-(2*sigma<sup>2</sup>) ), where mean and sigma are the parameters of
-the distribution.
+  <p>Instantiations of class template <code>normal_distribution</code> model
+  a <a href="random-concepts.html#random-dist">random distribution</a>. Such
+  a distribution produces random numbers x distributed with probability
+  density function p(x) = 1/sqrt(2*pi*sigma) * exp(- (x-mean)<sup>2</sup> /
+  (2*sigma<sup>2</sup>) ), where mean and sigma are the parameters of the
+  distribution.</p>
 
+  <h3>Members</h3>
+  <pre>
+    explicit normal_distribution(const result_type&amp; mean = 0,
+                                 const result_type&amp; sigma = 1);
+</pre>
 
-<h3>Members</h3>
+  <p><strong>Requires:</strong> sigma &gt; 0<br>
+  <strong>Effects:</strong> Constructs a <code>normal_distribution</code>
+  object; <code>mean</code> and <code>sigma</code> are the parameters for the
+  distribution.</p>
+  <pre>
+    RealType mean() const
+</pre>
 
-<pre>
-    explicit normal_distribution(const result_type& mean = 0,
-                                 const result_type& sigma = 1);
+  <p><strong>Returns:</strong> The "mean" parameter of the distribution.</p>
+  <pre>
+    RealType sigma() const
 </pre>
 
-<strong>Requires:</strong> sigma &gt; 0
-<br>
-<strong>Effects:</strong> Constructs a
-<code>normal_distribution</code> object; <code>mean</code> and
-<code>sigma</code> are the parameters for the distribution.
+  <p><strong>Returns:</strong> The "sigma" parameter of the distribution.</p>
 
-<pre>    RealType mean() const</pre>
-<strong>Returns:</strong> The "mean" parameter of the distribution.
+  <h2><a name="lognormal_distribution" id="lognormal_distribution">Class
+  template <code>lognormal_distribution</code></a></h2>
 
-<pre>    RealType sigma() const</pre>
-<strong>Returns:</strong> The "sigma" parameter of the distribution.
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/lognormal_distribution.hpp">boost/random/lognormal_distribution.hpp</a>&gt;
 
-
-<h2><a name="lognormal_distribution">Class template
-<code>lognormal_distribution</code></a></h2>
-
-<h3>Synopsis</h3>
-
-<pre>
-#include &lt;<a href="../../boost/random/lognormal_distribution.hpp">boost/random/lognormal_distribution.hpp</a>&gt;
-
 template&lt;class RealType = double&gt;
 class lognormal_distribution
 {
 public:
   typedef typename normal_distribution&lt;RealType&gt;::input_type
   typedef RealType result_type;
-  explicit lognormal_distribution(const result_type& mean = 1.0,
-			          const result_type& sigma = 1.0);
-  RealType& mean() const;
-  RealType& sigma() const;                                 
+  explicit lognormal_distribution(const result_type&amp; mean = 1.0,
+                                  const result_type&amp; sigma = 1.0);
+  RealType&amp; mean() const;
+  RealType&amp; sigma() const;                                 
   void reset();
   template&lt;class UniformRandomNumberGenerator&gt;
-  result_type operator()(UniformRandomNumberGenerator& urng);
+  result_type operator()(UniformRandomNumberGenerator&amp; urng);
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Instantiations of class template <code>lognormal_distribution</code>
-model a <a href="random-concepts.html#random-dist">random
-distribution</a>.  Such a distribution produces random numbers
-with p(x) = 1/(x * normal_sigma * sqrt(2*pi)) * exp(
--(log(x)-normal_mean)<sup>2</sup> / (2*normal_sigma<sup>2</sup>) )
-for x > 0,
-where normal_mean = log(mean<sup>2</sup>/sqrt(sigma<sup>2</sup>
-+ mean<sup>2</sup>))
-and normal_sigma = sqrt(log(1 + sigma<sup>2</sup>/mean<sup>2</sup>)).
+  <p>Instantiations of class template <code>lognormal_distribution</code>
+  model a <a href="random-concepts.html#random-dist">random distribution</a>.
+  Such a distribution produces random numbers with p(x) = 1/(x * normal_sigma
+  * sqrt(2*pi)) * exp( -(log(x)-normal_mean)<sup>2</sup> /
+  (2*normal_sigma<sup>2</sup>) ) for x &gt; 0, where normal_mean =
+  log(mean<sup>2</sup>/sqrt(sigma<sup>2</sup> + mean<sup>2</sup>)) and
+  normal_sigma = sqrt(log(1 + sigma<sup>2</sup>/mean<sup>2</sup>)).</p>
 
+  <h3>Members</h3>
+  <pre>
+lognormal_distribution(const result_type&amp; mean,
+                       const result_type&amp; sigma)
+</pre>
 
-<h3>Members</h3>
+  <p><strong>Effects:</strong> Constructs a
+  <code>lognormal_distribution</code> functor. <code>mean</code> and
+  <code>sigma</code> are the mean and standard deviation of the lognormal
+  distribution.</p>
 
-<pre>lognormal_distribution(const result_type& mean,
-	   	       const result_type& sigma)</pre>
+  <h2><a name="uniform_on_sphere" id="uniform_on_sphere">Class template
+  <code>uniform_on_sphere</code></a></h2>
 
-<strong>Effects:</strong> Constructs a
-<code>lognormal_distribution</code> functor. <code>mean</code> and
-<code>sigma</code> are the mean and standard deviation of the
-lognormal distribution.
-<p>
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/uniform_on_sphere.hpp">boost/random/uniform_on_sphere.hpp</a>&gt;
 
-
-<h2><a name="uniform_on_sphere">Class template
-<code>uniform_on_sphere</code></a></h2>
-
-<h3>Synopsis</h3>
-
-<pre>
-#include &lt;<a href="../../boost/random/uniform_on_sphere.hpp">boost/random/uniform_on_sphere.hpp</a>&gt;
-
 template&lt;class RealType = double,
   class Cont = std::vector&lt;RealType&gt; &gt;
 class uniform_on_sphere
@@ -766,31 +801,43 @@
   explicit uniform_on_sphere(int dim = 2);
   void reset();
   template&lt;class UniformRandomNumberGenerator&gt;
-  const result_type & operator()(UniformRandomNumberGenerator& urng);
+  const result_type &amp; operator()(UniformRandomNumberGenerator&amp; urng);
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Instantiations of class template <code>uniform_on_sphere</code> model a
-<a href="random-concepts.html#random-dist">random distribution</a>.
-Such a distribution produces random numbers uniformly distributed on
-the unit sphere of arbitrary dimension <code>dim</code>.  The
-<code>Cont</code> template parameter must be a STL-like container type
-with <code>begin</code> and <code>end</code> operations returning
-non-const ForwardIterators of type <code>Cont::iterator</code>.
+  <p>Instantiations of class template <code>uniform_on_sphere</code> model a
+  <a href="random-concepts.html#random-dist">random distribution</a>. Such a
+  distribution produces random numbers uniformly distributed on the unit
+  sphere of arbitrary dimension <code>dim</code>. The <code>Cont</code>
+  template parameter must be a STL-like container type with
+  <code>begin</code> and <code>end</code> operations returning non-const
+  ForwardIterators of type <code>Cont::iterator</code>.</p>
 
-<h3>Members</h3>
+  <h3>Members</h3>
+  <pre>
+explicit uniform_on_sphere(int dim = 2)
+</pre>
 
-<pre>explicit uniform_on_sphere(int dim = 2)</pre>
+  <p><strong>Effects:</strong> Constructs a <code>uniform_on_sphere</code>
+  functor. <code>dim</code> is the dimension of the sphere.</p>
+  <hr>
 
-<strong>Effects:</strong> Constructs a <code>uniform_on_sphere</code>
-functor. <code>dim</code> is the dimension of the sphere.
-<p>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<p>
-<hr>
-Jens Maurer, 2003-10-25
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
 
+  <p><i>Copyright &copy; 2000-2004 <a href=
+  "../../people/jens_maurer.htm">Jens Maurer</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/random/random-generators.html
===================================================================
--- boost/trunk/libs/random/random-generators.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/random/random-generators.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,260 +1,336 @@
+<!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 http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<title>Boost Random Number Library Generators</title>
+  <title>Boost Random Number Library Generators</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <h1>Random Number Library Generators</h1>
 
-<h1>Random Number Library Generators</h1>
+  <ul>
+    <li><a href="#intro">Introduction</a></li>
 
-<ul>
-<li><a href="#intro">Introduction</a>
-<li><a href="#synopsis">Synopsis</a>
-<li><a href="#const_mod">Class template
-<code>random::const_mod</code></a>
-<li><a href="#linear_congruential">Class template
-<code>random::linear_congruential</code></a>
-<li><a href="#rand48">Class <code>rand48</code></a>
-<li><a href="#additive_combine">Class template
-<code>random::additive_combined</code></a>
-<li><a href="#shuffle_output">Class template
-<code>random::shuffle_output</code></a>
-<li><a href="#inversive_congruential">Class template
-<code>random::inversive_congruential</code></a>
-<li><a href="#mersenne_twister">Class template
-<code>random::mersenne_twister</code></a>
-<li><a href="#lagged_fibonacci">Class template
-<code>random::lagged_fibonacci</code></a>
-<li><a href="#performance">Performance</a>
-</ul>
+    <li><a href="#synopsis">Synopsis</a></li>
 
-<h2><a name="intro">Introduction</a></h2>
+    <li><a href="#const_mod">Class template
+    <code>random::const_mod</code></a></li>
 
-This library provides several pseudo-random number generators.  The
-quality of a pseudo-random number generator crucially depends on both
-the algorithm and its parameters.  This library implements the
-algorithms as class templates with template value parameters, hidden
-in namespace <code>boost::random</code>.  Any particular choice of
-parameters is represented as the appropriately specializing
-<code>typedef</code> in namespace <code>boost</code>.
-<p>
+    <li><a href="#linear_congruential">Class template
+    <code>random::linear_congruential</code></a></li>
 
-Pseudo-random number generators should not be constructed
-(initialized) frequently during program execution, for two reasons.
-First, initialization requires full initialization of the internal
-state of the generator.  Thus, generators with a lot of internal state
-(see below) are costly to initialize.  Second, initialization always
-requires some value used as a "seed" for the generated sequence.  It
-is usually difficult to obtain several good seed values.  For example,
-one method to obtain a seed is to determine the current time at the
-highest resolution available, e.g. microseconds or nanoseconds.  When
-the pseudo-random number generator is initialized again with the
-then-current time as the seed, it is likely that this is at a
-near-constant (non-random) distance from the time given as the seed
-for first initialization.  The distance could even be zero if the
-resolution of the clock is low, thus the generator re-iterates the
-same sequence of random numbers.  For some applications, this is
-inappropriate.
-<p>
+    <li><a href="#rand48">Class <code>rand48</code></a></li>
 
-Note that all pseudo-random number generators described below are
-CopyConstructible and Assignable.  Copying or assigning a generator
-will copy all its internal state, so the original and the copy will
-generate the identical sequence of random numbers.  Often, such
-behavior is not wanted.  In particular, beware of the algorithms from
-the standard library such as std::generate.  They take a functor
-argument by value, thereby invoking the copy constructor when called.
-<p>
+    <li><a href="#additive_combine">Class template
+    <code>random::additive_combined</code></a></li>
 
-The following table gives an overview of some characteristics of the
-generators.  The cycle length is a rough estimate of the quality of
-the generator; the approximate relative speed is a performance
-measure, higher numbers mean faster random number generation.
+    <li><a href="#shuffle_output">Class template
+    <code>random::shuffle_output</code></a></li>
 
-<p>
-<table border="1">
-<tr>
-<th>generator</th>
-<th>length of cycle</th>
-<th>approx. memory requirements</th>
-<th>approx. relative speed</th>
-<th>comment</th>
-</tr>
+    <li><a href="#inversive_congruential">Class template
+    <code>random::inversive_congruential</code></a></li>
 
-<tr>
-<td><a href="#minstd_rand"><code>minstd_rand</code></a></td>
-<td>2<sup>31</sup>-2</td>
-<td><code>sizeof(int32_t)</code></td>
-<td>40</td>
-<td>-</td>
-</tr>
+    <li><a href="#mersenne_twister">Class template
+    <code>random::mersenne_twister</code></a></li>
 
-<tr>
-<td><a href="#rand48"><code>rand48</code></a></td>
-<td>2<sup>48</sup>-1</td>
-<td><code>sizeof(uint64_t)</code></td>
-<td>80</td>
-<td>-</td>
-</tr>
+    <li><a href="#lagged_fibonacci">Class template
+    <code>random::lagged_fibonacci</code></a></li>
 
-<tr>
-<td><code>lrand48</code> (C library)</td>
-<td>2<sup>48</sup>-1</td>
-<td>-</td>
-<td>20</td>
-<td>global state</td>
-</tr>
+    <li><a href="#performance">Performance</a></li>
+  </ul>
 
-<tr>
-<td><a href="#ecuyer1988"><code>ecuyer1988</code></a></td>
-<td>approx. 2<sup>61</sup></td>
-<td><code>2*sizeof(int32_t)</code></td>
-<td>20</td>
-<td>-</td>
-</tr>
+  <h2><a name="intro" id="intro">Introduction</a></h2>
 
-<tr>
-<td><code><a href="#kreutzer1986">kreutzer1986</a></code></td>
-<td>?</td>
-<td><code>1368*sizeof(uint32_t)</code></td>
-<td>60</td>
-<td>-</td>
-</tr>
+  <p>This library provides several pseudo-random number generators. The
+  quality of a pseudo-random number generator crucially depends on both the
+  algorithm and its parameters. This library implements the algorithms as
+  class templates with template value parameters, hidden in namespace
+  <code>boost::random</code>. Any particular choice of parameters is
+  represented as the appropriately specializing <code>typedef</code> in
+  namespace <code>boost</code>.</p>
 
-<tr>
-<td><code><a href="#hellekalek1995">hellekalek1995</a></code></td>
-<td>2<sup>31</sup>-1</td>
-<td><code>sizeof(int32_t)</code></td>
-<td>3</td>
-<td>good uniform distribution in several dimensions</td>
-</tr>
+  <p>Pseudo-random number generators should not be constructed (initialized)
+  frequently during program execution, for two reasons. First, initialization
+  requires full initialization of the internal state of the generator. Thus,
+  generators with a lot of internal state (see below) are costly to
+  initialize. Second, initialization always requires some value used as a
+  "seed" for the generated sequence. It is usually difficult to obtain
+  several good seed values. For example, one method to obtain a seed is to
+  determine the current time at the highest resolution available, e.g.
+  microseconds or nanoseconds. When the pseudo-random number generator is
+  initialized again with the then-current time as the seed, it is likely that
+  this is at a near-constant (non-random) distance from the time given as the
+  seed for first initialization. The distance could even be zero if the
+  resolution of the clock is low, thus the generator re-iterates the same
+  sequence of random numbers. For some applications, this is
+  inappropriate.</p>
 
-<tr>
-<td><code><a href="#mt11213b">mt11213b</a></code></td>
-<td>2<sup>11213</sup>-1</td>
-<td><code>352*sizeof(uint32_t)</code></td>
-<td>100</td>
-<td>good uniform distribution in up to 350 dimensions</td>
-</tr>
+  <p>Note that all pseudo-random number generators described below are
+  CopyConstructible and Assignable. Copying or assigning a generator will
+  copy all its internal state, so the original and the copy will generate the
+  identical sequence of random numbers. Often, such behavior is not wanted.
+  In particular, beware of the algorithms from the standard library such as
+  std::generate. They take a functor argument by value, thereby invoking the
+  copy constructor when called.</p>
 
-<tr>
-<td><code><a href="#mt19937">mt19937</a></code></td>
-<td>2<sup>19937</sup>-1</td>
-<td><code>625*sizeof(uint32_t)</code></td>
-<td>100</td>
-<td>good uniform distribution in up to 623 dimensions</td>
-</tr>
+  <p>The following table gives an overview of some characteristics of the
+  generators. The cycle length is a rough estimate of the quality of the
+  generator; the approximate relative speed is a performance measure, higher
+  numbers mean faster random number generation.</p>
 
-<tr>
-<td><code><a href="#lagged_fibonacci_spec">lagged_fibonacci607</a></code></td>
-<td>approx. 2<sup>32000</sup></td>
-<td><code>607*sizeof(double)</code></td>
-<td>150</td>
-<td>-</td>
-</tr>
+  <table border="1" summary="">
+    <tr>
+      <th>generator</th>
 
-<tr>
-<td><code><a href="#lagged_fibonacci_spec">lagged_fibonacci1279</a></code></td>
-<td>approx. 2<sup>67000</sup></td>
-<td><code>1279*sizeof(double)</code></td>
-<td>150</td>
-<td>-</td>
-</tr>
+      <th>length of cycle</th>
 
-<tr>
-<td><code><a href="#lagged_fibonacci_spec">lagged_fibonacci2281</a></code></td>
-<td>approx. 2<sup>120000</sup></td>
-<td><code>2281*sizeof(double)</code></td>
-<td>150</td>
-<td>-</td>
-</tr>
+      <th>approx. memory requirements</th>
 
-<tr>
-<td><code><a href="#lagged_fibonacci_spec">lagged_fibonacci3217</a></code></td>
-<td>approx. 2<sup>170000</sup></td>
-<td><code>3217*sizeof(double)</code></td>
-<td>150</td>
-<td>-</td>
-</tr>
+      <th>approx. relative speed</th>
 
-<tr>
-<td><code><a href="#lagged_fibonacci_spec">lagged_fibonacci4423</a></code></td>
-<td>approx. 2<sup>230000</sup></td>
-<td><code>4423*sizeof(double)</code></td>
-<td>150</td>
-<td>-</td>
-</tr>
+      <th>comment</th>
+    </tr>
 
-<tr>
-<td><code><a href="#lagged_fibonacci_spec">lagged_fibonacci9689</a></code></td>
-<td>approx. 2<sup>510000</sup></td>
-<td><code>9689*sizeof(double)</code></td>
-<td>150</td>
-<td>-</td>
-</tr>
+    <tr>
+      <td><a href="#minstd_rand"><code>minstd_rand</code></a></td>
 
-<tr>
-<td><code><a href="#lagged_fibonacci_spec">lagged_fibonacci19937</a></code></td>
-<td>approx. 2<sup>1050000</sup></td>
-<td><code>19937*sizeof(double)</code></td>
-<td>150</td>
-<td>-</td>
-</tr>
+      <td>2<sup>31</sup>-2</td>
 
-<tr>
-<td><code><a href="#lagged_fibonacci_spec">lagged_fibonacci23209</a></code></td>
-<td>approx. 2<sup>1200000</sup></td>
-<td><code>23209*sizeof(double)</code></td>
-<td>140</td>
-<td>-</td>
-</tr>
+      <td><code>sizeof(int32_t)</code></td>
 
-<tr>
-<td><code><a href="#lagged_fibonacci_spec">lagged_fibonacci44497</a></code></td>
-<td>approx. 2<sup>2300000</sup></td>
-<td><code>44497*sizeof(double)</code></td>
-<td>60</td>
-<td>-</td>
-</tr>
+      <td>40</td>
 
-</table>
+      <td>-</td>
+    </tr>
 
-<p>
-As observable from the table, there is generally a
-quality/performance/memory trade-off to be decided upon when choosing
-a random-number generator.  The multitude of generators provided in
-this library allows the application programmer to optimize the
-trade-off with regard to his application domain.  Additionally,
-employing several fundamentally different random number generators for
-a given application of Monte Carlo simulation will improve the
-confidence in the results.
-<p>
+    <tr>
+      <td><a href="#rand48"><code>rand48</code></a></td>
 
-If the names of the generators don't ring any bell and you have no
-idea which generator to use, it is reasonable to employ
-<code>mt19937</code> for a start: It is fast and has acceptable
-quality.
+      <td>2<sup>48</sup>-1</td>
 
-<p>
-<em>Note:</em> These random number generators are not intended for use
-in applications where non-deterministic random numbers are required.
-See <a href="nondet_random.html">nondet_random.html</a> for a choice
-of (hopefully) non-deterministic random number generators.
+      <td><code>sizeof(uint64_t)</code></td>
 
-<p>
-In this description, I have refrained from documenting those members
-in detail which are already defined in the
-<a href="random-concepts.html">concept documentation</a>.
+      <td>80</td>
 
+      <td>-</td>
+    </tr>
 
-<h2><a name="synopsis">Synopsis of the generators</a> available from header
-<code>&lt;boost/random.hpp&gt;</code></h2>
+    <tr>
+      <td><code>lrand48</code> (C library)</td>
 
-<pre>
+      <td>2<sup>48</sup>-1</td>
+
+      <td>-</td>
+
+      <td>20</td>
+
+      <td>global state</td>
+    </tr>
+
+    <tr>
+      <td><a href="#ecuyer1988"><code>ecuyer1988</code></a></td>
+
+      <td>approx. 2<sup>61</sup></td>
+
+      <td><code>2*sizeof(int32_t)</code></td>
+
+      <td>20</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td><code><a href="#kreutzer1986">kreutzer1986</a></code></td>
+
+      <td>?</td>
+
+      <td><code>1368*sizeof(uint32_t)</code></td>
+
+      <td>60</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td><code><a href="#hellekalek1995">hellekalek1995</a></code></td>
+
+      <td>2<sup>31</sup>-1</td>
+
+      <td><code>sizeof(int32_t)</code></td>
+
+      <td>3</td>
+
+      <td>good uniform distribution in several dimensions</td>
+    </tr>
+
+    <tr>
+      <td><code><a href="#mt11213b">mt11213b</a></code></td>
+
+      <td>2<sup>11213</sup>-1</td>
+
+      <td><code>352*sizeof(uint32_t)</code></td>
+
+      <td>100</td>
+
+      <td>good uniform distribution in up to 350 dimensions</td>
+    </tr>
+
+    <tr>
+      <td><code><a href="#mt19937">mt19937</a></code></td>
+
+      <td>2<sup>19937</sup>-1</td>
+
+      <td><code>625*sizeof(uint32_t)</code></td>
+
+      <td>100</td>
+
+      <td>good uniform distribution in up to 623 dimensions</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#lagged_fibonacci_spec">lagged_fibonacci607</a></code></td>
+
+      <td>approx. 2<sup>32000</sup></td>
+
+      <td><code>607*sizeof(double)</code></td>
+
+      <td>150</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#lagged_fibonacci_spec">lagged_fibonacci1279</a></code></td>
+
+      <td>approx. 2<sup>67000</sup></td>
+
+      <td><code>1279*sizeof(double)</code></td>
+
+      <td>150</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#lagged_fibonacci_spec">lagged_fibonacci2281</a></code></td>
+
+      <td>approx. 2<sup>120000</sup></td>
+
+      <td><code>2281*sizeof(double)</code></td>
+
+      <td>150</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#lagged_fibonacci_spec">lagged_fibonacci3217</a></code></td>
+
+      <td>approx. 2<sup>170000</sup></td>
+
+      <td><code>3217*sizeof(double)</code></td>
+
+      <td>150</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#lagged_fibonacci_spec">lagged_fibonacci4423</a></code></td>
+
+      <td>approx. 2<sup>230000</sup></td>
+
+      <td><code>4423*sizeof(double)</code></td>
+
+      <td>150</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#lagged_fibonacci_spec">lagged_fibonacci9689</a></code></td>
+
+      <td>approx. 2<sup>510000</sup></td>
+
+      <td><code>9689*sizeof(double)</code></td>
+
+      <td>150</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#lagged_fibonacci_spec">lagged_fibonacci19937</a></code></td>
+
+      <td>approx. 2<sup>1050000</sup></td>
+
+      <td><code>19937*sizeof(double)</code></td>
+
+      <td>150</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#lagged_fibonacci_spec">lagged_fibonacci23209</a></code></td>
+
+      <td>approx. 2<sup>1200000</sup></td>
+
+      <td><code>23209*sizeof(double)</code></td>
+
+      <td>140</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td><code><a href=
+      "#lagged_fibonacci_spec">lagged_fibonacci44497</a></code></td>
+
+      <td>approx. 2<sup>2300000</sup></td>
+
+      <td><code>44497*sizeof(double)</code></td>
+
+      <td>60</td>
+
+      <td>-</td>
+    </tr>
+  </table>
+
+  <p>As observable from the table, there is generally a
+  quality/performance/memory trade-off to be decided upon when choosing a
+  random-number generator. The multitude of generators provided in this
+  library allows the application programmer to optimize the trade-off with
+  regard to his application domain. Additionally, employing several
+  fundamentally different random number generators for a given application of
+  Monte Carlo simulation will improve the confidence in the results.</p>
+
+  <p>If the names of the generators don't ring any bell and you have no idea
+  which generator to use, it is reasonable to employ <code>mt19937</code> for
+  a start: It is fast and has acceptable quality.</p>
+
+  <p><em>Note:</em> These random number generators are not intended for use
+  in applications where non-deterministic random numbers are required. See
+  <a href="nondet_random.html">nondet_random.html</a> for a choice of
+  (hopefully) non-deterministic random number generators.</p>
+
+  <p>In this description, I have refrained from documenting those members in
+  detail which are already defined in the <a href=
+  "random-concepts.html">concept documentation</a>.</p>
+
+  <h2><a name="synopsis" id="synopsis">Synopsis of the generators</a>
+  available from header <code>&lt;boost/random.hpp&gt;</code></h2>
+  <pre>
 namespace boost {
   namespace random {
     template&lt;class IntType, IntType m&gt;
@@ -290,13 +366,11 @@
 } // namespace boost
 </pre>
 
+  <h2><a name="const_mod" id="const_mod">Class template
+  <code>random::const_mod</code></a></h2>
 
-<h2><a name="const_mod">Class template
-<code>random::const_mod</code></a></h2>
-
-<h3>Synopsis</h3>
-
-<pre>
+  <h3>Synopsis</h3>
+  <pre>
 template&lt;class IntType, IntType m&gt;
 class random::const_mod
 {
@@ -316,56 +390,57 @@
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Class template <code>const_mod</code> provides functions performing
-modular arithmetic, carefully avoiding overflows.  All member
-functions are static; there shall be no objects of type
-<code>const_mod&lt;&gt;</code>.
-<p>
+  <p>Class template <code>const_mod</code> provides functions performing
+  modular arithmetic, carefully avoiding overflows. All member functions are
+  static; there shall be no objects of type
+  <code>const_mod&lt;&gt;</code>.</p>
 
-The template parameter <code>IntType</code> shall denote an integral
-type, <code>m</code> is the modulus.
-<p>
+  <p>The template parameter <code>IntType</code> shall denote an integral
+  type, <code>m</code> is the modulus.</p>
 
-<em>Note:</em> For modulo multiplications with large m, a trick allows
-fast computation under certain conditions, see
-<blockquote>
-"A more portable FORTRAN random number generator", Linus Schrage, ACM
-Transactions on Mathematical Software, Vol. 5, No. 2, June 1979, pp. 132-138
-</blockquote>
+  <p><em>Note:</em> For modulo multiplications with large m, a trick allows
+  fast computation under certain conditions, see</p>
 
+  <blockquote>
+    "A more portable FORTRAN random number generator", Linus Schrage, ACM
+    Transactions on Mathematical Software, Vol. 5, No. 2, June 1979, pp.
+    132-138
+  </blockquote>
 
-<h3>Member functions</h3>
+  <h3>Member functions</h3>
+  <pre>
+template&lt;IntType c&gt; static IntType add(IntType x)
+</pre>
 
-<pre>template&lt;IntType c&gt; static IntType add(IntType x)</pre>
+  <p><strong>Returns:</strong> (x+c) mod m</p>
+  <pre>
+template&lt;IntType a&gt; static IntType mult(IntType x)
+</pre>
 
-<strong>Returns:</strong> (x+c) mod m
+  <p><strong>Returns:</strong> (a*x) mod m</p>
+  <pre>
+template&lt;IntType a, IntType c&gt; static IntType
+mult_add(IntType x)
+</pre>
 
-<pre>template&lt;IntType a&gt; static IntType mult(IntType x)</pre>
+  <p><strong>Returns:</strong> (a*x+c) mod m</p>
+  <pre>
+static IntType invert(IntType x)
+</pre>
 
-<strong>Returns:</strong> (a*x) mod m
+  <p><strong>Returns:</strong> i so that (a*i) mod m == 1<br>
+  <strong>Precondition:</strong> m is prime</p>
 
-<pre>template&lt;IntType a, IntType c&gt; static IntType
-mult_add(IntType x)</pre>
+  <h2><a name="linear_congruential" id="linear_congruential">Class template
+  <code>random::linear_congruential</code></a></h2>
 
-<strong>Returns:</strong> (a*x+c) mod m
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/linear_congruential.hpp">boost/random/linear_congruential.hpp</a>&gt;
 
-<pre>static IntType invert(IntType x)</pre>
-
-<strong>Returns:</strong> i so that (a*i) mod m == 1
-<br>
-<strong>Precondition:</strong> m is prime
-
-
-<h2><a name="linear_congruential">Class template
-<code>random::linear_congruential</code></a></h2>
-
-<h3>Synopsis</h3>
-
-<pre>
-#include &lt;<a href="../../boost/random/linear_congruential.hpp">boost/random/linear_congruential.hpp</a>&gt;
-
 template&lt;class IntType, IntType a, IntType c, IntType m, IntType val&gt;
 class linear_congruential
 {
@@ -389,74 +464,70 @@
      399268537L&gt; minstd_rand;
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Instantiations of class template <code>linear_congruential</code>
-model a <a href="random-concepts.html#pseudo-rng">pseudo-random number
-generator</a>.  Linear congruential pseudo-random number generators
-are described in:
-<blockquote>
-&quot;Mathematical methods in large-scale computing units&quot;, D. H. Lehmer,
-Proc. 2nd Symposium on Large-Scale Digital Calculating Machines,
-Harvard University Press, 1951, pp. 141-146 
-</blockquote>
+  <p>Instantiations of class template <code>linear_congruential</code> model
+  a <a href="random-concepts.html#pseudo-rng">pseudo-random number
+  generator</a>. Linear congruential pseudo-random number generators are
+  described in:</p>
 
-Let x(n) denote the sequence of numbers returned by
-some pseudo-random number generator.  Then for the linear congruential
-generator, x(n+1) := (a * x(n) + c) mod m.  Parameters for the
-generator are x(0), a, c, m.
+  <blockquote>
+    "Mathematical methods in large-scale computing units", D. H. Lehmer,
+    Proc. 2nd Symposium on Large-Scale Digital Calculating Machines, Harvard
+    University Press, 1951, pp. 141-146
+  </blockquote>Let x(n) denote the sequence of numbers returned by some
+  pseudo-random number generator. Then for the linear congruential generator,
+  x(n+1) := (a * x(n) + c) mod m. Parameters for the generator are x(0), a,
+  c, m. The template parameter <code>IntType</code> shall denote an integral
+  type. It must be large enough to hold values a, c, and m. The template
+  parameters a and c must be smaller than m.
 
-The template parameter <code>IntType</code> shall denote an
-integral type.  It must be large enough to hold values a, c, and m.
-The template parameters a and c must be smaller than m.
+  <p><em>Note:</em> The quality of the generator crucially depends on the
+  choice of the parameters. User code should use one of the sensibly
+  parameterized generators such as <code>minstd_rand</code> instead.<br>
+  For each choice of the parameters a, c, m, some distinct type is defined,
+  so that the <code>static</code> members do not interfere with regard to the
+  one definition rule.</p>
 
-<p>
+  <h3>Members</h3>
+  <pre>
+explicit linear_congruential(IntType x0 = 1)
+</pre>
 
-<em>Note:</em> The quality of the generator crucially depends on the
-choice of the parameters.  User code should use one of the sensibly
-parameterized generators such as <code>minstd_rand</code> instead.
-<br>
-For each choice of the parameters a, c, m, some distinct type is
-defined, so that the <code>static</code> members do not interfere with
-regard to the one definition rule.
+  <p><strong>Effects:</strong> Constructs a <code>linear_congruential</code>
+  generator with x(0) := <code>x0</code>.</p>
+  <pre>
+void seed(IntType x0)
+</pre>
 
-<h3>Members</h3>
+  <p><strong>Effects:</strong> Changes the current value x(n) of the
+  generator to <code>x0</code>.</p>
 
-<pre>explicit linear_congruential(IntType x0 = 1)</pre>
+  <h3><a name="minstd_rand" id="minstd_rand">Specializations</a></h3>
 
-<strong>Effects:</strong> Constructs a
-<code>linear_congruential</code> generator with x(0) :=
-<code>x0</code>.
+  <p>The specialization <code>minstd_rand0</code> was originally suggested
+  in</p>
 
-<pre>void seed(IntType x0)</pre>
+  <blockquote>
+    A pseudo-random number generator for the System/360, P.A. Lewis, A.S.
+    Goodman, J.M. Miller, IBM Systems Journal, Vol. 8, No. 2, 1969, pp.
+    136-146
+  </blockquote>It is examined more closely together with
+  <code>minstd_rand</code> in
 
-<strong>Effects:</strong> Changes the current value x(n) of the
-generator to <code>x0</code>.
+  <blockquote>
+    "Random Number Generators: Good ones are hard to find", Stephen K. Park
+    and Keith W. Miller, Communications of the ACM, Vol. 31, No. 10, October
+    1988, pp. 1192-1201
+  </blockquote>
 
-<h3><a name="minstd_rand">Specializations</a></h3>
+  <h2><a name="rand48" id="rand48">Class <code>rand48</code></a></h2>
 
-The specialization <code>minstd_rand0</code> was originally suggested
-in
-<blockquote>
-A pseudo-random number generator for the System/360, P.A. Lewis,
-A.S. Goodman, J.M. Miller, IBM Systems Journal, Vol. 8, No. 2, 1969,
-pp. 136-146
-</blockquote>
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/linear_congruential.hpp">boost/random/linear_congruential.hpp</a>&gt;
 
-It is examined more closely together with <code>minstd_rand</code> in
-<blockquote>
-"Random Number Generators: Good ones are hard to find", Stephen
-K. Park and Keith W. Miller, Communications of the ACM, Vol. 31,
-No. 10, October 1988, pp. 1192-1201
-</blockquote>
-
-
-<h2><a name="rand48">Class <code>rand48</code></h2>
-
-<h3>Synopsis</h3>
-<pre>
-#include &lt;<a href="../../boost/random/linear_congruential.hpp">boost/random/linear_congruential.hpp</a>&gt;
-
 class rand48 
 {
 public:
@@ -474,52 +545,55 @@
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Class <code>rand48</code> models a
-<a href="random-concepts.html#pseudo-rng">pseudo-random number
-generator</a>.  It uses the linear congruential algorithm with the
-parameters a = 0x5DEECE66D, c = 0xB, m = 2**48.  It delivers identical
-results to the <code>lrand48()</code> function available on some
-systems (assuming <code>lcong48</code> has not been called).
-<p>
-It is only available on systems where <code>uint64_t</code> is
-provided as an integral type, so that for example static in-class
-constants and/or enum definitions with large <code>uint64_t</code>
-numbers work.
+  <p>Class <code>rand48</code> models a <a href=
+  "random-concepts.html#pseudo-rng">pseudo-random number generator</a>. It
+  uses the linear congruential algorithm with the parameters a = 0x5DEECE66D,
+  c = 0xB, m = 2**48. It delivers identical results to the
+  <code>lrand48()</code> function available on some systems (assuming
+  <code>lcong48</code> has not been called).</p>
 
-<h3>Constructors</h3>
+  <p>It is only available on systems where <code>uint64_t</code> is provided
+  as an integral type, so that for example static in-class constants and/or
+  enum definitions with large <code>uint64_t</code> numbers work.</p>
 
-<pre>rand48(int32_t x0)</pre>
+  <h3>Constructors</h3>
+  <pre>
+rand48(int32_t x0)
+</pre>
 
-<strong>Effects:</strong> Constructs a <code>rand48</code> generator
-with x(0) := (<code>x0</code> << 16) | 0x330e.
+  <p><strong>Effects:</strong> Constructs a <code>rand48</code> generator
+  with x(0) := (<code>x0</code> &lt;&lt; 16) | 0x330e.</p>
+  <pre>
+rand48(uint64_t x0)
+</pre>
 
-<pre>rand48(uint64_t x0)</pre>
+  <p><strong>Effects:</strong> Constructs a <code>rand48</code> generator
+  with x(0) := <code>x0</code>.</p>
 
-<strong>Effects:</strong> Constructs a <code>rand48</code> generator
-with x(0) := <code>x0</code>.
+  <h3>Seeding</h3>
+  <pre>
+void seed(int32_t x0)
+</pre>
 
-<h3>Seeding</h3>
-<pre>void seed(int32_t x0)</pre>
+  <p><strong>Effects:</strong> Changes the current value x(n) of the
+  generator to (<code>x0</code> &lt;&lt; 16) | 0x330e.</p>
+  <pre>
+void seed(uint64_t x0)
+</pre>
 
-<strong>Effects:</strong> Changes the current value x(n) of the
-generator to (<code>x0</code> << 16) | 0x330e.
+  <p><strong>Effects:</strong> Changes the current value x(n) of the
+  generator to <code>x0</code>.</p>
 
-<pre>void seed(uint64_t x0)</pre>
+  <h2><a name="additive_combine" id="additive_combine">Class template
+  <code>random::additive_combine</code></a></h2>
 
-<strong>Effects:</strong> Changes the current value x(n) of the
-generator to <code>x0</code>.
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/additive_combine.hpp">boost/random/additive_combine.hpp</a>&gt;
 
-
-<h2><a name="additive_combine">Class template
-<code>random::additive_combine</code></a></h2>
-
-<h3>Synopsis</h3>
-
-<pre>
-#include &lt;<a href="../../boost/random/additive_combine.hpp">boost/random/additive_combine.hpp</a>&gt;
-
 template&lt;class MLCG1, class MLCG2, typename MLCG1::result_type val&gt;
 class random::additive_combine
 {
@@ -532,7 +606,7 @@
   static const result_type max_value = MLCG1::max_value-1;
   additive_combine();
   additive_combine(typename MLCG1::result_type seed1, 
-		   typename MLCG2::result_type seed2);
+                   typename MLCG2::result_type seed2);
   result_type operator()();
   bool validation(result_type x) const;
 };
@@ -544,59 +618,56 @@
 
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Instatiations of class template <code>additive_combine</code> model a
-<a href="random-concepts.html#pseudo-rng">pseudo-random number
-generator</a>.  It combines two multiplicative linear congruential
-number generators, i.e. those with c = 0.  It is described in
-<blockquote>
-"Efficient and Portable Combined Random Number Generators", Pierre
-L'Ecuyer, Communications of the ACM, Vol. 31, No. 6, June 1988,
-pp. 742-749, 774
-</blockquote>
+  <p>Instatiations of class template <code>additive_combine</code> model a
+  <a href="random-concepts.html#pseudo-rng">pseudo-random number
+  generator</a>. It combines two multiplicative linear congruential number
+  generators, i.e. those with c = 0. It is described in</p>
 
-The template parameters <code>MLCG1</code> and <code>MLCG2</code>
-shall denote two different linear congruential number generators, each
-with c = 0.  Each invocation returns a random number X(n) := (MLCG1(n)
-- MLCG2(n)) mod (m1 - 1), where m1 denotes the modulus of
-<code>MLCG1</code>.
+  <blockquote>
+    "Efficient and Portable Combined Random Number Generators", Pierre
+    L'Ecuyer, Communications of the ACM, Vol. 31, No. 6, June 1988, pp.
+    742-749, 774
+  </blockquote>The template parameters <code>MLCG1</code> and
+  <code>MLCG2</code> shall denote two different linear congruential number
+  generators, each with c = 0. Each invocation returns a random number X(n)
+  := (MLCG1(n) - MLCG2(n)) mod (m1 - 1), where m1 denotes the modulus of
+  <code>MLCG1</code>.
 
-<p>
-The template parameter <code>val</code> is the validation value
-checked by <code>validation</code>.
+  <p>The template parameter <code>val</code> is the validation value checked
+  by <code>validation</code>.</p>
 
+  <h3>Members</h3>
+  <pre>
+additive_combine()
+</pre>
 
-<h3>Members</h3>
+  <p><strong>Effects:</strong> Constructs an <code>additive_combine</code>
+  generator using the default constructors of the two base generators.</p>
+  <pre>
+additive_combine(typename MLCG1::result_type seed1, 
+                 typename MLCG2::result_type seed2)
+</pre>
 
-<pre>additive_combine()</pre>
+  <p><strong>Effects:</strong> Constructs an <code>additive_combine</code>
+  generator, using <code>seed1</code> and <code>seed2</code> as the
+  constructor argument to the first and second base generator,
+  respectively.</p>
 
-<strong>Effects:</strong> Constructs an <code>additive_combine</code>
-generator using the default constructors of the two base generators.
+  <h3><a name="ecuyer1988" id="ecuyer1988">Specialization</a></h3>
 
-<pre>additive_combine(typename MLCG1::result_type seed1, 
- 		 typename MLCG2::result_type seed2)</pre>
+  <p>The specialization <code>ecuyer1988</code> was suggested in the above
+  paper.</p>
 
-<strong>Effects:</strong> Constructs an <code>additive_combine</code>
-generator, using <code>seed1</code> and <code>seed2</code> as the
-constructor argument to the first and second base generator,
-respectively.
+  <h2><a name="shuffle_output" id="shuffle_output">Class template
+  <code>random::shuffle_output</code></a></h2>
 
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/shuffle_output.hpp">boost/random/shuffle_output.hpp</a>&gt;
 
-<h3><a name="ecuyer1988">Specialization</a></h3>
-
-The specialization <code>ecuyer1988</code> was suggested in the above
-paper.
-
-
-<h2><a name="shuffle_output">Class template
-<code>random::shuffle_output</code></a></h2>
-
-<h3>Synopsis</h3>
-
-<pre>
-#include &lt;<a href="../../boost/random/shuffle_output.hpp">boost/random/shuffle_output.hpp</a>&gt;
-
 template&lt;class UniformRandomNumberGenerator, int k, 
   typename UniformRandomNumberGenerator::result_type val = 0&gt;
 class random::shuffle_output
@@ -618,92 +689,90 @@
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Instatiations of class template <code>shuffle_output</code> model a
-<a href="random-concepts.html#pseudo-rng">pseudo-random number
-generator</a>. It mixes the output of some (usually linear
-congruential) uniform random number generator to get better
-statistical properties.  According to Donald E. Knuth, "The Art of
-Computer Programming, Vol. 2", the algorithm is described in
-<blockquote>
-"Improving a poor random number generator", Carter Bays and
-S.D. Durham, ACM Transactions on Mathematical Software, Vol. 2, 1979,
-pp. 59-64.
-</blockquote>
-The output of the base generator is buffered in an array of length
-k. Every output X(n) has a second role: It gives an index into the
-array where X(n+1) will be retrieved.  Used array elements are
-replaced with fresh output from the base generator.
+  <p>Instatiations of class template <code>shuffle_output</code> model a
+  <a href="random-concepts.html#pseudo-rng">pseudo-random number
+  generator</a>. It mixes the output of some (usually linear congruential)
+  uniform random number generator to get better statistical properties.
+  According to Donald E. Knuth, "The Art of Computer Programming, Vol. 2",
+  the algorithm is described in</p>
 
-<p>
+  <blockquote>
+    "Improving a poor random number generator", Carter Bays and S.D. Durham,
+    ACM Transactions on Mathematical Software, Vol. 2, 1979, pp. 59-64.
+  </blockquote>The output of the base generator is buffered in an array of
+  length k. Every output X(n) has a second role: It gives an index into the
+  array where X(n+1) will be retrieved. Used array elements are replaced with
+  fresh output from the base generator.
 
-Template parameters are the base generator and the array length k,
-which should be around 100.  The template parameter
-<code>val</code> is the validation value checked by
-<code>validation</code>.
+  <p>Template parameters are the base generator and the array length k, which
+  should be around 100. The template parameter <code>val</code> is the
+  validation value checked by <code>validation</code>.</p>
 
+  <h3>Members</h3>
+  <pre>
+shuffle_output()
+</pre>
 
-<h3>Members</h3>
+  <p><strong>Effects:</strong> Constructs a <code>shuffle_output</code>
+  generator by invoking the default constructor of the base generator.</p>
 
-<pre>shuffle_output()</pre>
+  <p><strong>Complexity:</strong> Exactly k+1 invocations of the base
+  generator.</p>
+  <pre>
+template&lt;class T&gt; explicit shuffle_output(T seed)
+</pre>
 
-<strong>Effects:</strong> Constructs a <code>shuffle_output</code>
-generator by invoking the default constructor of the base generator.
-<p>
-<strong>Complexity:</strong> Exactly k+1 invocations of the base
-generator.
+  <p><strong>Effects:</strong> Constructs a <code>shuffle_output</code>
+  generator by invoking the one-argument constructor of the base generator
+  with the parameter <code>seed</code>.</p>
 
-<pre>template&lt;class T&gt; explicit shuffle_output(T seed)</pre>
+  <p><strong>Complexity:</strong> Exactly k+1 invocations of the base
+  generator.</p>
+  <pre>
+explicit shuffle_output(const base_type &amp; rng)
+</pre>
 
-<strong>Effects:</strong> Constructs a <code>shuffle_output</code>
-generator by invoking the one-argument constructor of the base
-generator with the parameter <code>seed</code>.
-<p>
-<strong>Complexity:</strong> Exactly k+1 invocations of the base
-generator.
+  <p><strong>Precondition:</strong> The template argument
+  <code>UniformRandomNumberGenerator</code> shall denote a CopyConstructible
+  type.</p>
 
-<pre>explicit shuffle_output(const base_type & rng)</pre>
+  <p><strong>Effects:</strong> Constructs a <code>shuffle_output</code>
+  generator by using a copy of the provided generator.</p>
 
-<strong>Precondition:</strong> The template argument
-<code>UniformRandomNumberGenerator</code> shall denote a
-CopyConstructible type.
-<p>
-<strong>Effects:</strong> Constructs a <code>shuffle_output</code>
-generator by using a copy of the provided generator.
-<p>
-<strong>Complexity:</strong> Exactly k+1 invocations of the base
-generator.
+  <p><strong>Complexity:</strong> Exactly k+1 invocations of the base
+  generator.</p>
+  <pre>
+template&lt;class T&gt; void seed(T s)
+</pre>
 
-<pre>template&lt;class T&gt; void seed(T s)</pre>
+  <p><strong>Effects:</strong> Invokes the one-argument <code>seed</code>
+  method of the base generator with the parameter <code>seed</code> and
+  re-initializes the internal buffer array.</p>
 
-<strong>Effects:</strong> Invokes the one-argument <code>seed</code>
-method of the base generator with the parameter <code>seed</code> and
-re-initializes the internal buffer array.
-<p>
-<strong>Complexity:</strong> Exactly k+1 invocations of the base
-generator.
+  <p><strong>Complexity:</strong> Exactly k+1 invocations of the base
+  generator.</p>
 
+  <h3><a name="kreutzer1986" id="kreutzer1986">Specializations</a></h3>
 
-<h3><a name="kreutzer1986">Specializations</a></h3>
+  <p>According to Harry Erwin (private e-mail), the specialization
+  <code>kreutzer1986</code> was suggested in:</p>
 
-According to Harry Erwin (private e-mail), the specialization
-<code>kreutzer1986</code> was suggested in:
-<blockquote>
-"System Simulation: programming Styles and Languages (International
-Computer Science Series)", Wolfgang Kreutzer, Addison-Wesley, December
-1986.
-</blockquote>
+  <blockquote>
+    "System Simulation: programming Styles and Languages (International
+    Computer Science Series)", Wolfgang Kreutzer, Addison-Wesley, December
+    1986.
+  </blockquote>
 
+  <h2><a name="inversive_congruential" id="inversive_congruential">Class
+  template <code>random::inversive_congruential</code></a></h2>
 
-<h2><a name="inversive_congruential">Class template
-<code>random::inversive_congruential</code></a></h2> 
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/inversive_congruential.hpp">boost/random/inversive_congruential.hpp</a>&gt;
 
-<h3>Synopsis</h3>
-
-<pre>
-#include &lt;<a href="../../boost/random/inversive_congruential.hpp">boost/random/inversive_congruential.hpp</a>&gt;
-
 template&lt;class IntType, IntType a, IntType b, IntType p&gt;
 class random::inversive_congruential
 {
@@ -723,67 +792,63 @@
 typedef random::inversive_congruential&lt;int32_t, 9102, 2147483647-36884165, 2147483647&gt; hellekalek1995;
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Instantiations of class template <code>inversive_congruential</code> model a
-<a href="random-concepts.html#pseudo-rng">pseudo-random number
-generator</a>.  It uses the inversive congruential algorithm (ICG)
-described in
-<blockquote>
-"Inversive pseudorandom number generators: concepts, results and
-links", Peter Hellekalek, In: "Proceedings of the 1995 Winter
-Simulation Conference", C. Alexopoulos, K. Kang, W.R. Lilegdon, and
-D. Goldsman (editors), 1995, pp. 255-262.
-<a href="ftp://random.mat.sbg.ac.at/pub/data/wsc95.ps">ftp://random.mat.sbg.ac.at/pub/data/wsc95.ps</a>
-</blockquote>
+  <p>Instantiations of class template <code>inversive_congruential</code>
+  model a <a href="random-concepts.html#pseudo-rng">pseudo-random number
+  generator</a>. It uses the inversive congruential algorithm (ICG) described
+  in</p>
 
-The output sequence is defined by x(n+1) = (a*inv(x(n)) - b) (mod p),
-where x(0), a, b, and the prime number p are parameters of the
-generator.  The expression inv(k) denotes the multiplicative inverse
-of k in the field of integer numbers modulo p, with inv(0) := 0.
+  <blockquote>
+    "Inversive pseudorandom number generators: concepts, results and links",
+    Peter Hellekalek, In: "Proceedings of the 1995 Winter Simulation
+    Conference", C. Alexopoulos, K. Kang, W.R. Lilegdon, and D. Goldsman
+    (editors), 1995, pp. 255-262. <a href=
+    "ftp://random.mat.sbg.ac.at/pub/data/wsc95.ps">ftp://random.mat.sbg.ac.at/pub/data/wsc95.ps</a>
+  </blockquote>The output sequence is defined by x(n+1) = (a*inv(x(n)) - b)
+  (mod p), where x(0), a, b, and the prime number p are parameters of the
+  generator. The expression inv(k) denotes the multiplicative inverse of k in
+  the field of integer numbers modulo p, with inv(0) := 0.
 
-<p>
+  <p>The template parameter <code>IntType</code> shall denote a signed
+  integral type large enough to hold p; a, b, and p are the parameters of the
+  generators.</p>
 
-The template parameter <code>IntType</code> shall denote a signed
-integral type large enough to hold p; a, b, and p are the parameters
-of the generators.
-<p>
-<em>Note:</em> The implementation currently uses the Euclidian
-Algorithm to compute the multiplicative inverse.  Therefore, the
-inversive generators are about 10-20 times slower than the others (see
-section"<a href="#performance">performance</a>").  However, the paper
-talks of only 3x slowdown, so the Euclidian Algorithm is probably not
-optimal for calculating the multiplicative inverse.
+  <p><em>Note:</em> The implementation currently uses the Euclidian Algorithm
+  to compute the multiplicative inverse. Therefore, the inversive generators
+  are about 10-20 times slower than the others (see section"<a href=
+  "#performance">performance</a>"). However, the paper talks of only 3x
+  slowdown, so the Euclidian Algorithm is probably not optimal for
+  calculating the multiplicative inverse.</p>
 
+  <h3>Members</h3>
+  <pre>
+inversive_congruential(IntType y0 = 1)
+</pre>
 
-<h3>Members</h3>
+  <p><strong>Effects:</strong> Constructs an
+  <code>inversive_congruential</code> generator with <code>y0</code> as the
+  initial state.</p>
+  <pre>
+void seed(IntType y0)
+</pre>
 
-<pre>inversive_congruential(IntType y0 = 1)</pre>
+  <p><strong>Effects:</strong> Changes the current state to
+  <code>y0</code>.</p>
 
-<strong>Effects:</strong> Constructs an
-<code>inversive_congruential</code> generator with
-<code>y0</code> as the initial state.
+  <h3><a name="hellekalek1995" id="hellekalek1995">Specialization</a></h3>
 
-<pre>void seed(IntType y0)</pre>
+  <p>The specialization <code>hellekalek1995</code> was suggested in the
+  above paper.</p>
 
-<strong>Effects:</strong>
-Changes the current state to <code>y0</code>.
+  <h2><a name="mersenne_twister" id="mersenne_twister">Class template
+  <code>random::mersenne_twister</code></a></h2>
 
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/mersenne_twister.hpp">boost/random/mersenne_twister.hpp</a>&gt;
 
-<h3><a name="hellekalek1995">Specialization</a></h3>
-
-The specialization <code>hellekalek1995</code> was suggested in the
-above paper.
-
-
-<h2><a name="mersenne_twister">Class template
-<code>random::mersenne_twister</code></a></h2>
-
-<h3>Synopsis</h3>
-
-<pre>
-#include &lt;<a href="../../boost/random/mersenne_twister.hpp">boost/random/mersenne_twister.hpp</a>&gt;
-
 template&lt;class DataType, int w, int n, int m, int r, DataType a, int u,
 int s, DataType b, int t, DataType c, int l, IntType val&gt;
 class random::mersenne_twister
@@ -808,106 +873,105 @@
 typedef mersenne_twister&lt;uint32_t,624,397,31,0x9908b0df,11,7,0x9d2c5680,15,0xefc60000,18, 3346425566U&gt; mt19937;
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Instantiations of class template <code>mersenne_twister</code> model a
-<a href="random-concepts.html#pseudo-rng">pseudo-random number
-generator</a>.  It uses the algorithm described in
+  <p>Instantiations of class template <code>mersenne_twister</code> model a
+  <a href="random-concepts.html#pseudo-rng">pseudo-random number
+  generator</a>. It uses the algorithm described in</p>
 
-<blockquote>
-"Mersenne Twister: A 623-dimensionally equidistributed uniform
-pseudo-random number generator", Makoto Matsumoto and Takuji Nishimura,
-ACM Transactions on Modeling and Computer Simulation: Special Issue
-on Uniform Random Number Generation, Vol. 8, No. 1, January 1998,
-pp. 3-30.
-<!-- <a href="http://www.math.keio.ac.jp/matumoto/emt.html">http://www.math.keio.ac.jp/matumoto/emt.html</a> -->
-</blockquote>
+  <blockquote>
+    "Mersenne Twister: A 623-dimensionally equidistributed uniform
+    pseudo-random number generator", Makoto Matsumoto and Takuji Nishimura,
+    ACM Transactions on Modeling and Computer Simulation: Special Issue on
+    Uniform Random Number Generation, Vol. 8, No. 1, January 1998, pp. 3-30. 
+    <!-- <a href="http://www.math.keio.ac.jp/matumoto/emt.html">http://www.math.keio.ac.jp/matumoto/emt.html</a> -->
+  </blockquote><em>Note:</em> The boost variant has been implemented from
+  scratch and does not derive from or use mt19937.c provided on the above WWW
+  site. However, it was verified that both produce identical output.<br>
+  The seeding from an integer was changed in April 2005 to address a <a href=
+  "http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/MT2002/emt19937ar.html">weakness</a>.<br>
 
-<em>Note:</em> The boost variant has been implemented from scratch
-and does not derive from or use mt19937.c provided on the above WWW
-site. However, it was verified that both produce identical output.
-<br>
-The seeding from an integer was changed in April 2005 to address a
-<a href="http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/MT2002/emt19937ar.html">weakness</a>.
+  The quality of the generator crucially depends on the choice of the
+  parameters. User code should employ one of the sensibly parameterized
+  generators such as <code>mt19937</code> instead.<br>
+  The generator requires considerable amounts of memory for the storage of
+  its state array. For example, <code>mt11213b</code> requires about 1408
+  bytes and <code>mt19937</code> requires about 2496 bytes.
 
-<br>
-The quality of the generator crucially depends on the choice of the
-parameters.  User code should employ one of the sensibly parameterized
-generators such as <code>mt19937</code> instead.
-<br>
-The generator requires considerable amounts of memory for the storage
-of its state array.  For example, <code>mt11213b</code> requires about
-1408 bytes and <code>mt19937</code> requires about 2496 bytes.
+  <h3>Constructors</h3>
+  <pre>
+mersenne_twister()
+</pre>
 
-<h3>Constructors</h3>
+  <p><strong>Effects:</strong> Constructs a <code>mersenne_twister</code> and
+  calls <code>seed()</code>.</p>
+  <pre>
+explicit mersenne_twister(result_type value)
+</pre>
 
-<pre>mersenne_twister()</pre>
+  <p><strong>Effects:</strong> Constructs a <code>mersenne_twister</code> and
+  calls <code>seed(value)</code>.</p>
+  <pre>
+template&lt;class Generator&gt; explicit mersenne_twister(Generator &amp; gen)
+</pre>
 
-<strong>Effects:</strong> Constructs a <code>mersenne_twister</code>
-and calls <code>seed()</code>.
+  <p><strong>Effects:</strong> Constructs a <code>mersenne_twister</code> and
+  calls <code>seed(gen)</code>.</p>
 
-<pre>explicit mersenne_twister(result_type value)</pre>
+  <p><em>Note:</em> When using direct-initialization syntax with an lvalue
+  (e.g. in the variable definition <code>Gen gen2(gen);</code>), this
+  templated constructor will be preferred over the compiler-generated copy
+  constructor. For variable definitions which should copy the state of
+  another <code>mersenne_twister</code>, use e.g. <code>Gen gen2 =
+  gen;</code>, which is copy-initialization syntax and guaranteed to invoke
+  the copy constructor.</p>
 
-<strong>Effects:</strong> Constructs a <code>mersenne_twister</code>
-and calls <code>seed(value)</code>.
+  <h3>Seeding</h3>
+  <pre>
+void seed()
+</pre>
 
-<pre>template&lt;class Generator&gt; explicit mersenne_twister(Generator &amp; gen)</pre>
+  <p><strong>Effects:</strong> Calls
+  <code>seed(result_type(5489))</code>.</p>
+  <pre>
+void seed(result_type value)
+</pre>
 
-<strong>Effects:</strong> Constructs a <code>mersenne_twister</code>
-and calls <code>seed(gen)</code>.
-<p>
-<em>Note:</em> When using direct-initialization syntax with an lvalue
-(e.g. in the variable definition <code>Gen gen2(gen);</code>), this
-templated constructor will be preferred over the compiler-generated
-copy constructor.  For variable definitions which should copy the
-state of another <code>mersenne_twister</code>, use e.g. <code>Gen
-gen2 = gen;</code>, which is copy-initialization syntax and guaranteed
-to invoke the copy constructor.
+  <p><strong>Effects:</strong> Sets the state x(0) to v mod 2<sup>w</sup>.
+  Then, iteratively,<br>
+  sets x(i) to (i + 1812433253 * (x(i-1) <em>xor</em> (x(i-1) <em>rshift</em>
+  w-2))) mod 2<sup>w</sup> for i = 1 .. n-1. x(n) is the first value to be
+  returned by operator().</p>
+  <pre>
+template&lt;class Generator&gt; void seed(Generator &amp; gen)
+</pre>
 
-<h3>Seeding</h3>
+  <p><strong>Effects:</strong> Sets the state of this
+  <code>mersenne_twister</code> to the values returned by <code>n</code>
+  invocations of <code>gen</code>.</p>
 
-<pre>void seed()</pre>
+  <p><strong>Complexity:</strong> Exactly <code>n</code> invocations of
+  <code>gen</code>.</p>
 
-<strong>Effects:</strong> Calls <code>seed(result_type(5489))</code>.
+  <p><em>Note:</em> When invoking <code>seed</code> with an lvalue, overload
+  resolution chooses the function template unless the type of the argument
+  exactly matches <code>result_type</code>. For other integer types, you
+  should convert the argument to <code>result_type</code> explicitly.</p>
 
-<pre>void seed(result_type value)</pre>
+  <h3><a name="mt11213b" id="mt11213b"></a><a name="mt19937" id=
+  "mt19937">Specializations</a></h3>
 
-<strong>Effects:</strong> 
-Sets the state x(0) to v mod 2<sup>w</sup>.  Then,
-iteratively,<br> sets x(i) to (i + 1812433253 * (x(i-1) <em>xor</em>
-(x(i-1) <em>rshift</em> w-2))) mod 2<sup>w</sup> for i = 1 .. n-1.
-x(n) is the first value to be returned by operator().
+  <p>The specializations <code>mt11213b</code> and <code>mt19937</code> are
+  from the paper cited above.</p>
 
-<pre>template&lt;class Generator&gt; void seed(Generator &amp; gen)</pre>
+  <h2><a name="lagged_fibonacci" id="lagged_fibonacci">Class template
+  <code>random::lagged_fibonacci</code></a></h2>
 
-<strong>Effects:</strong> Sets the state of this
-<code>mersenne_twister</code> to the values returned by <code>n</code>
-invocations of <code>gen</code>.
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/lagged_fibonacci.hpp">boost/random/lagged_fibonacci.hpp</a>&gt;
 
-<p>
-
-<strong>Complexity:</strong> Exactly <code>n</code> invocations of
-<code>gen</code>.
-<p>
-<em>Note:</em> When invoking <code>seed</code> with an lvalue,
-overload resolution chooses the function template unless the type of
-the argument exactly matches <code>result_type</code>.  For other
-integer types, you should convert the argument to
-<code>result_type</code> explicitly.
-
-<h3><a name="mt11213b"></a><a name="mt19937">Specializations</a></h3>
-
-The specializations <code>mt11213b</code> and <code>mt19937</code> are
-from the paper cited above.
-
-<h2><a name="lagged_fibonacci">Class template
-<code>random::lagged_fibonacci</code></a></h2>
-
-<h3>Synopsis</h3>
-
-<pre>
-#include &lt;<a href="../../boost/random/lagged_fibonacci.hpp">boost/random/lagged_fibonacci.hpp</a>&gt;
-
 template&lt;class FloatType, unsigned int p, unsigned int q&gt;
 class lagged_fibonacci
 {
@@ -921,10 +985,10 @@
   lagged_fibonacci();
   explicit lagged_fibonacci(uint32_t value);
   template&lt;class Generator&gt;
-  explicit lagged_fibonacci(Generator & gen);
+  explicit lagged_fibonacci(Generator &amp; gen);
   // compiler-generated copy ctor and assignment operator are fine
   void seed(uint32_t value = 331u);
-  template&lt;class Generator&gt; void seed(Generator & gen);
+  template&lt;class Generator&gt; void seed(Generator &amp; gen);
   result_type operator()();
   bool validation(result_type x) const;
 };
@@ -940,104 +1004,202 @@
 typedef random::lagged_fibonacci&lt;double, 44497, 21034&gt; lagged_fibonacci44497;
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Instantiations of class template <code>lagged_fibonacci</code> model a
-<a href="random-concepts.html#pseudo-rng">pseudo-random number
-generator</a>.  It uses a lagged Fibonacci algorithm with two lags p
-and q, evaluated in floating-point arithmetic:  x(i) = x(i-p) + x(i-q)
-(mod 1) with p > q.  See
+  <p>Instantiations of class template <code>lagged_fibonacci</code> model a
+  <a href="random-concepts.html#pseudo-rng">pseudo-random number
+  generator</a>. It uses a lagged Fibonacci algorithm with two lags p and q,
+  evaluated in floating-point arithmetic: x(i) = x(i-p) + x(i-q) (mod 1) with
+  p &gt; q. See</p>
 
-<blockquote>
-"Uniform random number generators for supercomputers", Richard Brent,
-Proc. of Fifth Australian Supercomputer Conference, Melbourne,
-Dec. 1992, pp. 704-706.
-</blockquote>
+  <blockquote>
+    "Uniform random number generators for supercomputers", Richard Brent,
+    Proc. of Fifth Australian Supercomputer Conference, Melbourne, Dec. 1992,
+    pp. 704-706.
+  </blockquote>
 
-<p>
-<em>Note:</em> The quality of the generator crucially depends on the
-choice of the parameters.  User code should employ one of the sensibly
-parameterized generators such as <code>lagged_fibonacci607</code>
-instead.
-<br>
-The generator requires considerable amounts of memory for the storage
-of its state array.  For example, <code>lagged_fibonacci607</code>
-requires about 4856 bytes and <code>lagged_fibonacci44497</code>
-requires about 350 KBytes.
+  <p><em>Note:</em> The quality of the generator crucially depends on the
+  choice of the parameters. User code should employ one of the sensibly
+  parameterized generators such as <code>lagged_fibonacci607</code>
+  instead.<br>
+  The generator requires considerable amounts of memory for the storage of
+  its state array. For example, <code>lagged_fibonacci607</code> requires
+  about 4856 bytes and <code>lagged_fibonacci44497</code> requires about 350
+  KBytes.</p>
 
-<h3>Constructors</h3>
+  <h3>Constructors</h3>
+  <pre>
+lagged_fibonacci()
+</pre>
 
-<pre>lagged_fibonacci()</pre>
-<strong>Effects:</strong> Constructs a <code>lagged_fibonacci</code>
-generator and calls <code>seed()</code>.
+  <p><strong>Effects:</strong> Constructs a <code>lagged_fibonacci</code>
+  generator and calls <code>seed()</code>.</p>
+  <pre>
+explicit lagged_fibonacci(uint32_t value)
+</pre>
 
-<pre>explicit lagged_fibonacci(uint32_t value)</pre>
-<strong>Effects:</strong> Constructs a <code>lagged_fibonacci</code>
-generator and calls <code>seed(value)</code>.
+  <p><strong>Effects:</strong> Constructs a <code>lagged_fibonacci</code>
+  generator and calls <code>seed(value)</code>.</p>
+  <pre>
+template&lt;class Generator&gt; explicit lagged_fibonacci(Generator &amp; gen)
+</pre>
 
-<pre>template&lt;class Generator&gt; explicit lagged_fibonacci(Generator &amp; gen)</pre>
-<strong>Effects:</strong> Constructs a <code>lagged_fibonacci</code>
-generator and calls <code>seed(gen)</code>.
+  <p><strong>Effects:</strong> Constructs a <code>lagged_fibonacci</code>
+  generator and calls <code>seed(gen)</code>.</p>
 
-<h3>Seeding</h3>
+  <h3>Seeding</h3>
+  <pre>
+void seed()
+</pre>
 
-<pre>void seed()</pre>
-<strong>Effects:</strong> Calls <code>seed(331u)</code>.
+  <p><strong>Effects:</strong> Calls <code>seed(331u)</code>.</p>
+  <pre>
+void seed(uint32_t value)
+</pre>
 
-<pre>void seed(uint32_t value)</pre>
-<strong>Effects:</strong> Constructs a <code>minstd_rand0</code>
-generator with the constructor parameter <code>value</code> and calls
-<code>seed</code> with it.
+  <p><strong>Effects:</strong> Constructs a <code>minstd_rand0</code>
+  generator with the constructor parameter <code>value</code> and calls
+  <code>seed</code> with it.</p>
+  <pre>
+template&lt;class Generator&gt; void seed(Generator &amp; gen)
+</pre>
 
-<pre>template&lt;class Generator&gt; void seed(Generator &amp; gen)</pre>
-<strong>Effects:</strong> Sets the state of this
-<code>lagged_fibonacci</code> to the values returned by <code>p</code>
-invocations of <code>uniform_01&lt;gen, FloatType&gt;</code>.
-<br>
-<strong>Complexity:</strong> Exactly <code>p</code> invocations of
-<code>gen</code>.
+  <p><strong>Effects:</strong> Sets the state of this
+  <code>lagged_fibonacci</code> to the values returned by <code>p</code>
+  invocations of <code>uniform_01&lt;gen, FloatType&gt;</code>.<br>
+  <strong>Complexity:</strong> Exactly <code>p</code> invocations of
+  <code>gen</code>.</p>
 
-<h3><a name="lagged_fibonacci_spec"></a>Specializations</h3>
-The specializations <code>lagged_fibonacci607</code>
-... <code>lagged_fibonacci44497</code> (see above) use well tested
-lags. (References will be added later.)
+  <h3><a name="lagged_fibonacci_spec" id=
+  "lagged_fibonacci_spec"></a>Specializations</h3>
 
+  <p>The specializations <code>lagged_fibonacci607</code> ...
+  <code>lagged_fibonacci44497</code> (see above) use well tested lags.
+  (References will be added later.)</p>
 
-<h2><a name="performance">Performance</a></h2>
+  <h2><a name="performance" id="performance">Performance</a></h2>
 
-The test program <a href="random_speed.cpp">random_speed.cpp</a>
-measures the execution times of the
-<a href="../../boost/random.hpp">random.hpp</a> implementation of the above
-algorithms in a tight loop.  The performance has been evaluated on a
-Pentium Pro 200 MHz with gcc 2.95.2, Linux 2.2.13, glibc 2.1.2.
+  <p>The test program <a href="random_speed.cpp">random_speed.cpp</a>
+  measures the execution times of the <a href=
+  "../../boost/random.hpp">random.hpp</a> implementation of the above
+  algorithms in a tight loop. The performance has been evaluated on a Pentium
+  Pro 200 MHz with gcc 2.95.2, Linux 2.2.13, glibc 2.1.2.</p>
 
-<p>
+  <table border="1" summary="">
+    <tr>
+      <th>class</th>
 
-<table border=1>
-<tr><th>class</th><th>time per invocation [usec]</th></tr>
-<tr><td>rand48</td><td>0.096</td></tr>
-<tr><td>rand48 run-time configurable</td><td>0.697</td></tr>
-<tr><td>lrand48 glibc 2.1.2</td><td>0.844</td></tr>
-<tr><td>minstd_rand</td><td>0.174</td></tr>
-<tr><td>ecuyer1988</td><td>0.445</td></tr>
-<tr><td>kreutzer1986</td><td>0.249</td></tr>
-<tr><td>hellekalek1995 (inversive)</td><td>4.895</td></tr>
-<tr><td>mt11213b</td><td>0.165</td></tr>
-<tr><td>mt19937</td><td>0.165</td></tr>
-<tr><td>mt19937 original</td><td>0.185</td></tr>
-<tr><td>lagged_fibonacci607</td><td>0.111</td></tr>
-<tr><td>lagged_fibonacci4423</td><td>0.112</td></tr>
-<tr><td>lagged_fibonacci19937</td><td>0.113</td></tr>
-<tr><td>lagged_fibonacci23209</td><td>0.122</td></tr>
-<tr><td>lagged_fibonacci44497</td><td>0.263</td></tr>
-</table>
+      <th>time per invocation [usec]</th>
+    </tr>
 
-<p>
-The measurement error is estimated at +/- 10 nsec.
+    <tr>
+      <td>rand48</td>
 
-<p>
-<hr>
-Jens Maurer, 2001-04-15
+      <td>0.096</td>
+    </tr>
 
+    <tr>
+      <td>rand48 run-time configurable</td>
+
+      <td>0.697</td>
+    </tr>
+
+    <tr>
+      <td>lrand48 glibc 2.1.2</td>
+
+      <td>0.844</td>
+    </tr>
+
+    <tr>
+      <td>minstd_rand</td>
+
+      <td>0.174</td>
+    </tr>
+
+    <tr>
+      <td>ecuyer1988</td>
+
+      <td>0.445</td>
+    </tr>
+
+    <tr>
+      <td>kreutzer1986</td>
+
+      <td>0.249</td>
+    </tr>
+
+    <tr>
+      <td>hellekalek1995 (inversive)</td>
+
+      <td>4.895</td>
+    </tr>
+
+    <tr>
+      <td>mt11213b</td>
+
+      <td>0.165</td>
+    </tr>
+
+    <tr>
+      <td>mt19937</td>
+
+      <td>0.165</td>
+    </tr>
+
+    <tr>
+      <td>mt19937 original</td>
+
+      <td>0.185</td>
+    </tr>
+
+    <tr>
+      <td>lagged_fibonacci607</td>
+
+      <td>0.111</td>
+    </tr>
+
+    <tr>
+      <td>lagged_fibonacci4423</td>
+
+      <td>0.112</td>
+    </tr>
+
+    <tr>
+      <td>lagged_fibonacci19937</td>
+
+      <td>0.113</td>
+    </tr>
+
+    <tr>
+      <td>lagged_fibonacci23209</td>
+
+      <td>0.122</td>
+    </tr>
+
+    <tr>
+      <td>lagged_fibonacci44497</td>
+
+      <td>0.263</td>
+    </tr>
+  </table>
+
+  <p>The measurement error is estimated at +/- 10 nsec.</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2000-2005 <a href=
+  "../../people/jens_maurer.htm">Jens Maurer</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/random/random-misc.html
===================================================================
--- boost/trunk/libs/random/random-misc.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/random/random-misc.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,47 +1,44 @@
+<!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 http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<title>Boost Random Number Generator Library (Miscellaneous)</title>
+  <title>Boost Random Number Generator Library (Miscellaneous)</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <h1>Random Number Generator Library --- Miscellaneous Decorators</h1>
 
-<h1>Random Number Generator Library --- Miscellaneous Decorators</h1>
+  <ul>
+    <li><a href="#random_number_generator">Class template
+    <code>random_number_generator</code></a></li>
+  </ul>
 
-<ul>
-<li><a href="#random_number_generator">Class template
-<code>random_number_generator</code></a>
-</ul>
+  <h2>Introduction</h2>
 
-<h2>Introduction</h2>
+  <p>These decorator class templates allow adaptation of the random number
+  generators and distribution functions to concepts found in the C++ Standard
+  Library, in particular the RandomNumberGenerator and the InputIterator
+  concepts. The latter adaptation is useful, because the the basic random
+  number generators do not implement the InputIterator requirements per se,
+  in contrast to the distribution functions.</p>
 
-These decorator class templates allow adaptation of the random number
-generators and distribution functions to concepts found in the C++
-Standard Library, in particular the RandomNumberGenerator and the
-InputIterator concepts.  The latter adaptation is useful, because the
-the basic random number generators do not implement the InputIterator
-requirements per se, in contrast to the distribution functions.
-
-
-<h2><a name="synopsis">Synopsis</a> of miscellaneous decorators in
-header <code>&lt;boost/random.hpp&gt;</code></h2>
-
-<pre>
+  <h2><a name="synopsis" id="synopsis">Synopsis</a> of miscellaneous
+  decorators in header <code>&lt;boost/random.hpp&gt;</code></h2>
+  <pre>
 namespace boost {
   template&lt;class UniformRandomNumberGenerator, class IntType = long&gt;
   class random_number_generator;
 } // namespace boost
 </pre>
 
+  <h2><a name="random_number_generator" id="random_number_generator">Class
+  template <code>random_number_generator</code></a></h2>
 
-<h2><a name="random_number_generator">Class template
-<code>random_number_generator</code></a></h2>
-
-<h3>Synopsis</h3>
-<pre>
+  <h3>Synopsis</h3>
+  <pre>
 template&lt;class UniformRandomNumberGenerator, class IntType = long&gt;
 class random_number_generator
 {
@@ -49,41 +46,54 @@
   typedef UniformRandomNumberGenerator base_type;
   typedef IntType argument_type;
   typedef IntType result_type;
-  random_number_generator(base_type & rng);
+  random_number_generator(base_type &amp; rng);
   result_type operator()(argument_type n);
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Instantiations of class template <code>random_number_generator</code>
-model a RandomNumberGenerator (std:25.2.11 [lib.alg.random.shuffle]).
-On each invocation, it returns a uniformly distributed integer in
-the range [0..<code>n</code>).
-<p>
-The template parameter <code>IntType</code> shall denote some
-integer-like value type.
-<p>
+  <p>Instantiations of class template <code>random_number_generator</code>
+  model a RandomNumberGenerator (std:25.2.11 [lib.alg.random.shuffle]). On
+  each invocation, it returns a uniformly distributed integer in the range
+  [0..<code>n</code>).</p>
 
-<em>Note:</em> I consider it unfortunate that the C++ Standard uses
-the name RandomNumberGenerator for something rather specific.
+  <p>The template parameter <code>IntType</code> shall denote some
+  integer-like value type.</p>
 
-<h3>Members</h3>
+  <p><em>Note:</em> I consider it unfortunate that the C++ Standard uses the
+  name RandomNumberGenerator for something rather specific.</p>
 
-<pre>random_number_generator(base_type & rng)</pre>
+  <h3>Members</h3>
+  <pre>
+random_number_generator(base_type &amp; rng)
+</pre>
 
-<strong>Effects:</strong> Constructs a
-<code>random_number_generator</code> functor with the given uniform
-random number generator as the underlying source of random numbers.
+  <p><strong>Effects:</strong> Constructs a
+  <code>random_number_generator</code> functor with the given uniform random
+  number generator as the underlying source of random numbers.</p>
+  <pre>
+result_type operator()(argument_type n)
+</pre>
 
-<pre>result_type operator()(argument_type n)</pre>
+  <p><strong>Returns:</strong> The value of
+  <code>uniform_int&lt;base_type&gt;(rng, 0, n-1)()</code>.</p>
+  <hr>
 
-<strong>Returns:</strong> The value of
-<code>uniform_int&lt;base_type&gt;(rng, 0, n-1)()</code>.
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<p>
-<hr>
-Jens Maurer, 2001-11-19
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
 
+  <p><i>Copyright &copy; 2000-2005 <a href=
+  "../../people/jens_maurer.htm">Jens Maurer</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/random/random-performance.html
===================================================================
--- boost/trunk/libs/random/random-performance.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/random/random-performance.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,241 +1,338 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<title>Boost Random Number Library Performance</title>
+  <title>Boost Random Number Library Performance</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <h1>Random Number Library Performance</h1>
 
-<h1>Random Number Library Performance</h1>
+  <p>For some people, performance of random number generation is an important
+  consideration when choosing a random number generator or a particular
+  distribution function. This page provides numerous performance tests with
+  the wide variety of generators and distributions available in the boost
+  library.</p>
 
-For some people, performance of random number generation is an
-important consideration when choosing a random number generator or a
-particular distribution function.  This page provides numerous
-performance tests with the wide variety of generators and
-distributions available in the boost library.
-<p>
-The performance has been evaluated on a Pentium Pro 200 MHz with gcc
-2.95.2, Linux 2.2.13, glibc 2.1.2.  The speed is reported in million
-random numbers per second (M rn/sec), generated in a tight loop.
-<p>
+  <p>The performance has been evaluated on a Pentium Pro 200 MHz with gcc
+  2.95.2, Linux 2.2.13, glibc 2.1.2. The speed is reported in million random
+  numbers per second (M rn/sec), generated in a tight loop.</p>
 
+  <h2>Basic Generators</h2>
 
-<h2>Basic Generators</h2>
+  <table border="1" summary="">
+    <tr>
+      <th>generator</th>
 
-<table border="1">
+      <th>M rn/sec</th>
 
-<tr>
-<th>generator</th>
-<th>M rn/sec</th>
-<th>time per random number [usec]</th>
-<th>relative speed compared to fastest [percent]</th>
-</tr>
+      <th>time per random number [usec]</th>
 
-<tr>
-<td>rand48</td>
-<td>5.38</td>
-<td>0.183</td>
-<td>61%</td>
-</tr>
+      <th>relative speed compared to fastest [percent]</th>
+    </tr>
 
-<tr>
-<td>rand48 run-time configurable</td>
-<td>1.48</td>
-<td>0.677</td>
-<td>17%</td>
-</tr>
+    <tr>
+      <td>rand48</td>
 
-<tr>
-<td>lrand48 glibc 2.1.2</td>
-<td>1.19</td>
-<td>0.843</td>
-<td>13%</td>
-</tr>
+      <td>5.38</td>
 
-<tr>
-<td>minstd_rand</td>
-<td>2.39</td>
-<td>0.318</td>
-<td>35%</td>
-</tr>
+      <td>0.183</td>
 
-<tr>
-<td>ecuyer1988</td>
-<td>1.12</td>
-<td>0.892</td>
-<td>13%</td>
-</tr>
+      <td>61%</td>
+    </tr>
 
-<tr>
-<td>kreutzer1986</td>
-<td>3.87</td>
-<td>0.258</td>
-<td>43%</td>
-</tr>
+    <tr>
+      <td>rand48 run-time configurable</td>
 
-<tr>
-<td>hellekalek1995 (inversive)</td>
-<td>0.20</td>
-<td>5.12</td>
-<td>2%</td>
-</tr>
+      <td>1.48</td>
 
-<tr>
-<td>mt11213b</td>
-<td>6.07</td>
-<td>0.165</td>
-<td>68%</td>
-</tr>
+      <td>0.677</td>
 
-<tr>
-<td>mt19937</td>
-<td>6.06</td>
-<td>0.165</td>
-<td>68%</td>
-</tr>
+      <td>17%</td>
+    </tr>
 
-<tr>
-<td>mt19937 original</td>
-<td>5.33</td>
-<td>0.188</td>
-<td>60%</td>
-</tr>
+    <tr>
+      <td>lrand48 glibc 2.1.2</td>
 
-<tr>
-<td>lagged_fibonacci607</td>
-<td>8.90</td>
-<td>0.112</td>
-<td>100%</td>
-</tr>
+      <td>1.19</td>
 
-<tr>
-<td>lagged_fibonacci4423</td>
-<td>8.54</td>
-<td>0.117</td>
-<td>96%</td>
-</tr>
+      <td>0.843</td>
 
-<tr>
-<td>lagged_fibonacci19937</td>
-<td>7.49</td>
-<td>0.133</td>
-<td>84%</td>
-</tr>
+      <td>13%</td>
+    </tr>
 
-<tr>
-<td>lagged_fibonacci23209</td>
-<td>6.63</td>
-<td>0.151</td>
-<td>74%</td>
-</tr>
+    <tr>
+      <td>minstd_rand</td>
 
-<tr>
-<td>lagged_fibonacci44497</td>
-<td>4.01</td>
-<td>0.250</td>
-<td>45%</td>
-</tr>
+      <td>2.39</td>
 
-</table>
-<p>
-Note that the lagged Fibonacci generators produce floating-point
-numbers, whereas all others produce integers.
+      <td>0.318</td>
 
-<h2>Distributions</h2>
+      <td>35%</td>
+    </tr>
 
-<table border="1">
+    <tr>
+      <td>ecuyer1988</td>
 
-<tr>
-<th>[M rn/sec]</th>
-<th>minstd_rand</th>
-<th>kreutzer1986</th>
-<th>mt19937</th>
-<th>lagged_fibonacci607</th>
-</tr>
+      <td>1.12</td>
 
-<tr>
-<th>uniform_smallint</th>
-<td>1.26</td>
-<td>1.55</td>
-<td>1.93</td>
-<td>-</td>
-</tr>
+      <td>0.892</td>
 
-<tr>
-<th>uniform_01</th>
-<td>1.79</td>
-<td>1.88</td>
-<td>3.03</td>
-<td>7.74</td>
-</tr>
+      <td>13%</td>
+    </tr>
 
-<tr>
-<th>uniform_real</th>
-<td>1.74</td>
-<td>1.56</td>
-<td>2.34</td>
-<td>6.62</td>
-</tr>
+    <tr>
+      <td>kreutzer1986</td>
 
-<tr>
-<th>geometric</th>
-<td>0.593</td>
-<td>0.629</td>
-<td>0.753</td>
-<td>0.916</td>
-</tr>
+      <td>3.87</td>
 
-<tr>
-<th>triangle</th>
-<td>0.97</td>
-<td>1.02</td>
-<td>1.35</td>
-<td>1.31</td>
-</tr>
+      <td>0.258</td>
 
-<tr>
-<th>exponential</th>
-<td>0.849</td>
-<td>0.828</td>
-<td>0.887</td>
-<td>1.53</td>
-</tr>
+      <td>43%</td>
+    </tr>
 
-<tr>
-<th>normal (polar method)</th>
-<td>0.608</td>
-<td>0.626</td>
-<td>0.738</td>
-<td>0.755</td>
-</tr>
+    <tr>
+      <td>hellekalek1995 (inversive)</td>
 
-<tr>
-<th>lognormal</th>
-<td>0.417</td>
-<td>0.442</td>
-<td>0.470</td>
-<td>0.481</td>
-</tr>
+      <td>0.20</td>
 
-<tr>
-<th>uniform_on_sphere</th>
-<td>0.154</td>
-<td>0.155</td>
-<td>0.174</td>
-<td>0.218</td>
-</tr>
+      <td>5.12</td>
 
-</table>
-<p>
-Note that the lagged Fibonacci generator is at least 2.5 times faster
-than the Mersenne twister when generating uniformly distributed
-floating-point numbers.  For more sophisticated distributions, the
-speed improvement is less.  Note however that these distributions have
-not been optimized for speed, yet.
-<p>
-<hr>
-Jens Maurer, 2001-04-15
+      <td>2%</td>
+    </tr>
 
+    <tr>
+      <td>mt11213b</td>
+
+      <td>6.07</td>
+
+      <td>0.165</td>
+
+      <td>68%</td>
+    </tr>
+
+    <tr>
+      <td>mt19937</td>
+
+      <td>6.06</td>
+
+      <td>0.165</td>
+
+      <td>68%</td>
+    </tr>
+
+    <tr>
+      <td>mt19937 original</td>
+
+      <td>5.33</td>
+
+      <td>0.188</td>
+
+      <td>60%</td>
+    </tr>
+
+    <tr>
+      <td>lagged_fibonacci607</td>
+
+      <td>8.90</td>
+
+      <td>0.112</td>
+
+      <td>100%</td>
+    </tr>
+
+    <tr>
+      <td>lagged_fibonacci4423</td>
+
+      <td>8.54</td>
+
+      <td>0.117</td>
+
+      <td>96%</td>
+    </tr>
+
+    <tr>
+      <td>lagged_fibonacci19937</td>
+
+      <td>7.49</td>
+
+      <td>0.133</td>
+
+      <td>84%</td>
+    </tr>
+
+    <tr>
+      <td>lagged_fibonacci23209</td>
+
+      <td>6.63</td>
+
+      <td>0.151</td>
+
+      <td>74%</td>
+    </tr>
+
+    <tr>
+      <td>lagged_fibonacci44497</td>
+
+      <td>4.01</td>
+
+      <td>0.250</td>
+
+      <td>45%</td>
+    </tr>
+  </table>
+
+  <p>Note that the lagged Fibonacci generators produce floating-point
+  numbers, whereas all others produce integers.</p>
+
+  <h2>Distributions</h2>
+
+  <table border="1" summary="">
+    <tr>
+      <th>[M rn/sec]</th>
+
+      <th>minstd_rand</th>
+
+      <th>kreutzer1986</th>
+
+      <th>mt19937</th>
+
+      <th>lagged_fibonacci607</th>
+    </tr>
+
+    <tr>
+      <th>uniform_smallint</th>
+
+      <td>1.26</td>
+
+      <td>1.55</td>
+
+      <td>1.93</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <th>uniform_01</th>
+
+      <td>1.79</td>
+
+      <td>1.88</td>
+
+      <td>3.03</td>
+
+      <td>7.74</td>
+    </tr>
+
+    <tr>
+      <th>uniform_real</th>
+
+      <td>1.74</td>
+
+      <td>1.56</td>
+
+      <td>2.34</td>
+
+      <td>6.62</td>
+    </tr>
+
+    <tr>
+      <th>geometric</th>
+
+      <td>0.593</td>
+
+      <td>0.629</td>
+
+      <td>0.753</td>
+
+      <td>0.916</td>
+    </tr>
+
+    <tr>
+      <th>triangle</th>
+
+      <td>0.97</td>
+
+      <td>1.02</td>
+
+      <td>1.35</td>
+
+      <td>1.31</td>
+    </tr>
+
+    <tr>
+      <th>exponential</th>
+
+      <td>0.849</td>
+
+      <td>0.828</td>
+
+      <td>0.887</td>
+
+      <td>1.53</td>
+    </tr>
+
+    <tr>
+      <th>normal (polar method)</th>
+
+      <td>0.608</td>
+
+      <td>0.626</td>
+
+      <td>0.738</td>
+
+      <td>0.755</td>
+    </tr>
+
+    <tr>
+      <th>lognormal</th>
+
+      <td>0.417</td>
+
+      <td>0.442</td>
+
+      <td>0.470</td>
+
+      <td>0.481</td>
+    </tr>
+
+    <tr>
+      <th>uniform_on_sphere</th>
+
+      <td>0.154</td>
+
+      <td>0.155</td>
+
+      <td>0.174</td>
+
+      <td>0.218</td>
+    </tr>
+  </table>
+
+  <p>Note that the lagged Fibonacci generator is at least 2.5 times faster
+  than the Mersenne twister when generating uniformly distributed
+  floating-point numbers. For more sophisticated distributions, the speed
+  improvement is less. Note however that these distributions have not been
+  optimized for speed, yet.</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2001 <a href="../../people/jens_maurer.htm">Jens
+  Maurer</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/random/random-variate.html
===================================================================
--- boost/trunk/libs/random/random-variate.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/random/random-variate.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,30 +1,29 @@
+<!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 http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<title>Boost Random Number Library Variate Generator</title>
+  <title>Boost Random Number Library Variate Generator</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <h1>Boost Random Number Library Variate Generator</h1>
 
-<h1>Boost Random Number Library Variate Generator</h1>
+  <p>A random variate generator is used to join a random number generator
+  together with a random number distribution. Boost.Random provides a vast
+  choice of <a href="random-generators.html">generators</a> as well as
+  <a href="random-distributions.html">distributions</a> .</p>
 
-A random variate generator is used to join a random number generator
-together with a random number distribution.
-Boost.Random provides a vast choice of 
-<a href="random-generators.html">generators</a>
-as well as
-<a href="random-distributions.html">distributions</a>
-.
+  <h2><a name="variate_generator" id="variate_generator">Class template
+  <code>variate_generator</code></a></h2>
 
+  <h3>Synopsis</h3>
+  <pre>
+#include &lt;<a href=
+"../../boost/random/variate_generator.hpp">boost/random/variate_generator.hpp</a>&gt;
 
-<h2><a name="variate_generator">Class template <code>variate_generator</code></h2>
-
-<h3>Synopsis</h3>
-<pre>
-#include &lt;<a href="../../boost/random/variate_generator.hpp">boost/random/variate_generator.hpp</a>&gt;
-
 template&lt;class Engine, class Distribution&gt;
 class variate_generator
 {
@@ -47,98 +46,119 @@
 };
 </pre>
 
-<h3>Description</h3>
+  <h3>Description</h3>
 
-Instantations of class template <code>variate_generator</code> model a
-<a href="random-concepts.html#number_generator">number generator</a>. 
-<p>
-The argument for the template parameter <code>Engine</code> shall be
-of the form U, U&, or U*, where U models a uniform random number
-generator.  Then, the member <code>engine_value_type</code> names U
-(not the pointer or reference to U).
-<p>
+  <p>Instantations of class template <code>variate_generator</code> model a
+  <a href="random-concepts.html#number_generator">number generator</a>.</p>
 
-Specializations of <code>variate_generator</code> satisfy the
-requirements of CopyConstructible. They also satisfy the requirements
-of Assignable unless the template parameter Engine is of the form U&amp;. 
-<p>
+  <p>The argument for the template parameter <code>Engine</code> shall be of
+  the form U, U&amp;, or U*, where U models a uniform random number
+  generator. Then, the member <code>engine_value_type</code> names U (not the
+  pointer or reference to U).</p>
 
-The complexity of all functions specified in this section is
-constant. No function described in this section except the constructor
-throws an exception. 
+  <p>Specializations of <code>variate_generator</code> satisfy the
+  requirements of CopyConstructible. They also satisfy the requirements of
+  Assignable unless the template parameter Engine is of the form U&amp;.</p>
 
-<pre>    variate_generator(engine_type eng, distribution_type d)</pre>
-<strong>Effects:</strong> Constructs a <code>variate_generator</code>
-object with the associated uniform random number generator
-<code>eng</code> and the associated random distribution
-<code>d</code>.
-<br>
-<strong>Throws:</strong> If and what the copy constructor of Engine or
-Distribution throws.
+  <p>The complexity of all functions specified in this section is constant.
+  No function described in this section except the constructor throws an
+  exception.</p>
+  <pre>
+    variate_generator(engine_type eng, distribution_type d)
+</pre>
 
-<pre>    result_type operator()()</pre>
-<strong>Returns:</strong> <code>distribution()(e)</code>
-<br>
-<strong>Notes:</strong> The sequence of numbers produced by the
-uniform random number generator <code>e</code>, s<sub>e</sub>, is
-obtained from the sequence of numbers produced by the associated
-uniform random number generator <code>eng</code>, s<sub>eng</sub>, as
-follows: Consider the values of
-<code>numeric_limits&lt;<em>T</em>&gt;::is_integer</code> for
-<code><em>T</em></code> both <code>Distribution::input_type</code> and
-<code>engine_value_type::result_type</code>.  If the values for both
-types are <code>true</code>, then s<sub>e</sub> is identical to
-s<sub>eng</sub>.  Otherwise, if the values for both types are
-<code>false</code>, then the numbers in s<sub>eng</sub> are divided by
-<code>engine().max()-engine().min()</code> to obtain the
-numbers in s<sub>e</sub>.  Otherwise, if the value for
-<code>engine_value_type::result_type</code> is <code>true</code> and
-the value for <code>Distribution::input_type</code> is
-<code>false</code>, then the numbers in s<sub>eng</sub> are divided by
-<code>engine().max()-engine().min()+1</code> to obtain the
-numbers in s<sub>e</sub>.  Otherwise, the mapping from s<sub>eng</sub>
-to s<sub>e</sub> is implementation-defined.  In all cases, an implicit
-conversion from <code>engine_value_type::result_type</code> to
-<code>Distribution::input_type</code> is performed.  If such a
-conversion does not exist, the program is ill-formed.
+  <p><strong>Effects:</strong> Constructs a <code>variate_generator</code>
+  object with the associated uniform random number generator <code>eng</code>
+  and the associated random distribution <code>d</code>.<br>
+  <strong>Throws:</strong> If and what the copy constructor of Engine or
+  Distribution throws.</p>
+  <pre>
+    result_type operator()()
+</pre>
 
-<pre>    template&lt;class T> result_type operator()(T value)</pre>
-<strong>Returns:</strong> <code>distribution()(e, value)</code>.  For
-the semantics of <code>e</code>, see the description of
-<code>operator()()</code>.
+  <p><strong>Returns:</strong> <code>distribution()(e)</code><br>
+  <strong>Notes:</strong> The sequence of numbers produced by the uniform
+  random number generator <code>e</code>, s<sub>e</sub>, is obtained from the
+  sequence of numbers produced by the associated uniform random number
+  generator <code>eng</code>, s<sub>eng</sub>, as follows: Consider the
+  values of <code>numeric_limits&lt;<em>T</em>&gt;::is_integer</code> for
+  <code><em>T</em></code> both <code>Distribution::input_type</code> and
+  <code>engine_value_type::result_type</code>. If the values for both types
+  are <code>true</code>, then s<sub>e</sub> is identical to s<sub>eng</sub>.
+  Otherwise, if the values for both types are <code>false</code>, then the
+  numbers in s<sub>eng</sub> are divided by
+  <code>engine().max()-engine().min()</code> to obtain the numbers in
+  s<sub>e</sub>. Otherwise, if the value for
+  <code>engine_value_type::result_type</code> is <code>true</code> and the
+  value for <code>Distribution::input_type</code> is <code>false</code>, then
+  the numbers in s<sub>eng</sub> are divided by
+  <code>engine().max()-engine().min()+1</code> to obtain the numbers in
+  s<sub>e</sub>. Otherwise, the mapping from s<sub>eng</sub> to s<sub>e</sub>
+  is implementation-defined. In all cases, an implicit conversion from
+  <code>engine_value_type::result_type</code> to
+  <code>Distribution::input_type</code> is performed. If such a conversion
+  does not exist, the program is ill-formed.</p>
+  <pre>
+    template&lt;class T&gt; result_type operator()(T value)
+</pre>
 
-<pre>    engine_value_type& engine()</pre>
-<strong>Returns:</strong> A reference to the associated uniform random
-number generator.
+  <p><strong>Returns:</strong> <code>distribution()(e, value)</code>. For the
+  semantics of <code>e</code>, see the description of
+  <code>operator()()</code>.</p>
+  <pre>
+    engine_value_type&amp; engine()
+</pre>
 
-<pre>    const engine_value_type& engine() const</pre>
-<strong>Returns:</strong> A reference to the associated uniform random
-number generator.
+  <p><strong>Returns:</strong> A reference to the associated uniform random
+  number generator.</p>
+  <pre>
+    const engine_value_type&amp; engine() const
+</pre>
 
-<pre>    distribution_type& distribution()</pre>
-<strong>Returns:</strong> A reference to the associated random
-distribution.
+  <p><strong>Returns:</strong> A reference to the associated uniform random
+  number generator.</p>
+  <pre>
+    distribution_type&amp; distribution()
+</pre>
 
-<pre>    const distribution_type& distribution() const</pre>
-<strong>Returns:</strong> A reference to the associated random
-distribution.
+  <p><strong>Returns:</strong> A reference to the associated random
+  distribution.</p>
+  <pre>
+    const distribution_type&amp; distribution() const
+</pre>
 
-<pre>    result_type min() const</pre>
-<strong>Precondition:</strong> <code>distribution().min()</code> is
-well-formed
-<br>
-<strong>Returns:</strong> <code>distribution().min()</code>
+  <p><strong>Returns:</strong> A reference to the associated random
+  distribution.</p>
+  <pre>
+    result_type min() const
+</pre>
 
-<pre>    result_type max() const</pre>
-<strong>Precondition:</strong> <code>distribution().max()</code> is
-well-formed
-<br>
-<strong>Returns:</strong> <code>distribution().max()</code>
+  <p><strong>Precondition:</strong> <code>distribution().min()</code> is
+  well-formed<br>
+  <strong>Returns:</strong> <code>distribution().min()</code></p>
+  <pre>
+    result_type max() const
+</pre>
 
-<p>
-<hr>
-<a href="../../people/jens_maurer.htm">Jens Maurer</a>,
-2003-10-25
+  <p><strong>Precondition:</strong> <code>distribution().max()</code> is
+  well-formed<br>
+  <strong>Returns:</strong> <code>distribution().max()</code></p>
+  <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2003-2004 <a href=
+  "../../people/jens_maurer.htm">Jens Maurer</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Deleted: boost/trunk/libs/random/test/Jamfile
===================================================================
--- boost/trunk/libs/random/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/random/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,25 +0,0 @@
-# Boost Random Library test Jamfile
-
-subproject libs/random/test ;
-
-# bring in rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-    # look in BOOST_ROOT for sources first, just in this Jamfile
-    local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-    
-   test-suite "random"
-        :
-        [ run libs/random/random_test.cpp ]
-        [ run libs/random/random_demo.cpp ]
-#       [ run libs/random/nondet_random_speed.cpp ]
-#       [ run libs/random/random_device.cpp ]
-#       [ run libs/random/random_speed.cpp ]
-#       [ run libs/random/statistic_tests.cpp ]
-       ;
-}
-

Modified: boost/trunk/libs/random/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/random/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/random/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright 2003 Jens Maurer
+# Distributed under the Boost Software License, Version 1.0. (See accompany-
+# ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 # Boost Random Library test Jamfile
 
 # bring in rules for testing

Modified: boost/trunk/libs/random/wg21-proposal.html
===================================================================
--- boost/trunk/libs/random/wg21-proposal.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/random/wg21-proposal.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,1993 +1,2270 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-  <title>A Proposal to Add an Extensible Random Number Facility to the Standard Library</title>
-  <meta Author="Jens Maurer" content="proposal">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>A Proposal to Add an Extensible Random Number Facility to the
+  Standard Library</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <font size="-1">Jens Maurer &lt;Jens.Maurer at gmx.net&gt;<br>
+  2002-11-10<br>
+  Document N1398=02-0056</font>
 
-<font size=-1>
-Jens Maurer &lt;Jens.Maurer at gmx.net&gt;
-<br>
-2002-11-10
-<br>
-Document N1398=02-0056
-<p>
-<code>$Id: proposal.html,v 1.44 2002/11/10 20:42:15 jmaurer Exp $</code>
-</font>
+  <p><font size="-1"><code>$Id: proposal.html,v 1.44 2002/11/10 20:42:15
+  jmaurer Exp $</code></font></p>
 
-<h1>A Proposal to Add an Extensible Random Number Facility to the
-Standard Library (N1398)</h1>
+  <h1>A Proposal to Add an Extensible Random Number Facility to the Standard
+  Library (N1398)</h1>
 
-<blockquote>
-Any one who considers arithmetical methods of producing random digits
-is, of course, in a state of sin.
-</blockquote>
-<p align="right">
-John von Neumann, 1951
-</p>
+  <blockquote>
+    Any one who considers arithmetical methods of producing random digits is,
+    of course, in a state of sin.
+  </blockquote>
 
-<h2>Revision history</h2>
+  <p align="right">John von Neumann, 1951</p>
 
-<ul>
-<li>2002-11-10: Publication in the Post-Santa Cruz mailing.
-<li>The <code>seed(first, last)</code> interface now needs "unsigned
-long" values.
-<li>Introduce "variate_generator", adjust distribution interface
-accordingly.
-<li>Add "add-on packages" discussion.
-<li>All distribution parameters must be defaulted.
-<li>Add "target audience" subsection to "motivation" section.
-<li>Add discussion of manager class.
-<li>Engines are independent of distributions, thus consider respective
-lifetimes.
-<li>Add "sharing of engines" as a major requirement.
-<li>Add some open issues.
-<li>2002-10-11: First publication on the C++ committee's library reflector.
-</ul>
+  <h2>Revision history</h2>
 
+  <ul>
+    <li>2002-11-10: Publication in the Post-Santa Cruz mailing.</li>
 
-<h2>I. Motivation</h2>
+    <li>The <code>seed(first, last)</code> interface now needs "unsigned
+    long" values.</li>
 
-<blockquote><i>Why is this important? What kinds of problems does it
-address, and what kinds of programmers, is it intended to support?  Is
-it based on existing practice?</i></blockquote>
+    <li>Introduce "variate_generator", adjust distribution interface
+    accordingly.</li>
 
-Computers are deterministic machines by design: equal input data
-results in equal output, given the same internal state.  Sometimes,
-applications require seemingly non-deterministic behaviour, usually
-provided by generating random numbers.  Such applications include:
-<ul>
-<li>numerics (simulation, Monte-Carlo integration)
-<li>games (shuffling card decks, non-deterministic enemy behavior)
-<li>testing (generation of test input data for good coverage)
-<li>security (generation of cryptographic keys)
-</ul>
-<p>
+    <li>Add "add-on packages" discussion.</li>
 
-Programmers in all of the above areas have to find ways to generate
-random numbers.  However, the difficulty to find generators that are
-both efficient and have good quality is often underestimated, and so
-ad-hoc implementations often fail to meet either or both of these
-goals.
-<p>
+    <li>All distribution parameters must be defaulted.</li>
 
-The C++ standard library includes <code>std::rand</code>, inherited
-from the C standard library, as the only facility to generate
-pseudo-random numbers.  It is underspecified, because the generation
-function is not defined, and indeed early C standard library
-implementations provided surprisingly bad generators.  Furthermore,
-the interface relies on global state, making it difficult or
-inefficient to provide for correct operation for simultaneous
-invocations in multi-threaded applications.
-<p>
+    <li>Add "target audience" subsection to "motivation" section.</li>
 
-There is a lot of existing practice in this area.  A multitude of
-libraries, usually implemented in C or Fortran, is available from the
-scientific community.  Some implement just one random number
-engine, others seek to provide a full framework.  I know of no
-comprehensive C++ framework for generating random numbers that adheres
-to the design principles put forth in section III.
-<p>
+    <li>Add discussion of manager class.</li>
 
-Random number generators are appropriate for this TR because they fall
-into one of the domains (numerics) identified in N1314 as a target for
-the TR.
+    <li>Engines are independent of distributions, thus consider respective
+    lifetimes.</li>
 
+    <li>Add "sharing of engines" as a major requirement.</li>
 
-<h3>Target Audience</h3>
+    <li>Add some open issues.</li>
 
-There are several different kinds of programmers that are assumed to use
-the facilities provided in this proposal.
+    <li>2002-10-11: First publication on the C++ committee's library
+    reflector.</li>
+  </ul>
 
-<ul>
-<li>programmers that provide additional engines
-<li>programmers that provide additional distributions
-<li>programmers that provide generic add-on packages
-<li>programmers that need random numbers
-</ul>
+  <h2>I. Motivation</h2>
 
-This proposal specifies an infrastructure so that the needs of all
-four groups are met.  The first two groups benefit from a modular
-design so that they can plug in their contributions.  Providing add-on
-packages benefits from a design that suits to generic programming
-needs.  Finally, users in need of random numbers benefit from an
-interface to the package that is easy to use.
+  <blockquote>
+    <i>Why is this important? What kinds of problems does it address, and
+    what kinds of programmers, is it intended to support? Is it based on
+    existing practice?</i>
+  </blockquote>Computers are deterministic machines by design: equal input
+  data results in equal output, given the same internal state. Sometimes,
+  applications require seemingly non-deterministic behaviour, usually
+  provided by generating random numbers. Such applications include:
 
+  <ul>
+    <li>numerics (simulation, Monte-Carlo integration)</li>
 
-<h2>II. Impact On the Standard</h2>
+    <li>games (shuffling card decks, non-deterministic enemy behavior)</li>
 
-<blockquote><i>What does it depend on, and what depends on it?  Is it
-a pure extension, or does it require changes to standard components?
-Does it require core language changes?</i></blockquote>
+    <li>testing (generation of test input data for good coverage)</li>
 
-This proposal is a pure library extension.  It does not require
-changes to any standard classes or functions.  It does not require
-changes to any of the standard requirement tables.  It does not
-require any changes in the core language, and it has been implemented
-in standard C++ as per ISO 14882:1998.
-<p>
+    <li>security (generation of cryptographic keys)</li>
+  </ul>
 
-The ISO C99 extension that specify integral types having a given
-minimum or exact bitwidth (e.g. <code>int32_t</code>) aids in
-implementing this proposal, however these types (or the equivalent
-thereof under another name) can be defined with template
-metaprogramming in standard C++, so these are not strictly necessary.
-<p>
+  <p>Programmers in all of the above areas have to find ways to generate
+  random numbers. However, the difficulty to find generators that are both
+  efficient and have good quality is often underestimated, and so ad-hoc
+  implementations often fail to meet either or both of these goals.</p>
 
-In case the ISO C99 extensions become part of the TR, section IV should
-be reviewed whether some requirements could be reformulated with the
-ISO C99 extensions.
-<p>
+  <p>The C++ standard library includes <code>std::rand</code>, inherited from
+  the C standard library, as the only facility to generate pseudo-random
+  numbers. It is underspecified, because the generation function is not
+  defined, and indeed early C standard library implementations provided
+  surprisingly bad generators. Furthermore, the interface relies on global
+  state, making it difficult or inefficient to provide for correct operation
+  for simultaneous invocations in multi-threaded applications.</p>
 
-In case a standard reference-counted smart pointer becomes part of
-the TR, section IV should be reviewed and instances of the smart
-pointer be added to the acceptable template parameters for a
-<code>variate_generator</code>.
+  <p>There is a lot of existing practice in this area. A multitude of
+  libraries, usually implemented in C or Fortran, is available from the
+  scientific community. Some implement just one random number engine, others
+  seek to provide a full framework. I know of no comprehensive C++ framework
+  for generating random numbers that adheres to the design principles put
+  forth in section III.</p>
 
+  <p>Random number generators are appropriate for this TR because they fall
+  into one of the domains (numerics) identified in N1314 as a target for the
+  TR.</p>
 
-<h2>III. Design Decisions</h2>
+  <h3>Target Audience</h3>There are several different kinds of programmers
+  that are assumed to use the facilities provided in this proposal.
 
-<blockquote><i>Why did you choose the specific design that you did?
-What alternatives did you consider, and what are the tradeoffs?  What
-are the consequences of your choice, for users and implementors?  What
-decisions are left up to implementors?  If there are any similar
-libraries in use, how do their design decisions compare to yours?
-</i></blockquote>
+  <ul>
+    <li>programmers that provide additional engines</li>
 
+    <li>programmers that provide additional distributions</li>
 
-The design decisions are compared to those in the following libraries:
-<ul>
-<li>CLHEP (original at
-http://wwwinfo.cern.ch/asd/lhc++/clhep/index.html, modifications from
-FermiLab at (anonymous CVS)
-:pserver:anonymous at zoomcvs.fnal.gov:/usr/people/cvsuser/repository)
-</li>
+    <li>programmers that provide generic add-on packages</li>
 
-<li>crng 1.1: Random-number generators (RNGs) implemented as Python
-extension types coded in C (at http://www.sbc.su.se/~per/crng/)
-</li>
+    <li>programmers that need random numbers</li>
+  </ul>This proposal specifies an infrastructure so that the needs of all
+  four groups are met. The first two groups benefit from a modular design so
+  that they can plug in their contributions. Providing add-on packages
+  benefits from a design that suits to generic programming needs. Finally,
+  users in need of random numbers benefit from an interface to the package
+  that is easy to use.
 
-<li>Swarm 2.1.1 (multi-agent simulation of complex systems), random
-number package, using a Smalltalk-like programming language (at
-http://www.santafe.edu/projects/swarm/swarmdocs/set/swarm.random.sgml.reference.html)
-</li>
+  <h2>II. Impact On the Standard</h2>
 
-<li>GNU Scientific Library: general scientific computing library
-implemented in C, comprehensive coverage of random number engines and
-distributions (at http://sources.redhat.com/gsl)
+  <blockquote>
+    <i>What does it depend on, and what depends on it? Is it a pure
+    extension, or does it require changes to standard components? Does it
+    require core language changes?</i>
+  </blockquote>This proposal is a pure library extension. It does not require
+  changes to any standard classes or functions. It does not require changes
+  to any of the standard requirement tables. It does not require any changes
+  in the core language, and it has been implemented in standard C++ as per
+  ISO 14882:1998.
 
-</ul>
+  <p>The ISO C99 extension that specify integral types having a given minimum
+  or exact bitwidth (e.g. <code>int32_t</code>) aids in implementing this
+  proposal, however these types (or the equivalent thereof under another
+  name) can be defined with template metaprogramming in standard C++, so
+  these are not strictly necessary.</p>
 
+  <p>In case the ISO C99 extensions become part of the TR, section IV should
+  be reviewed whether some requirements could be reformulated with the ISO
+  C99 extensions.</p>
 
-The choice of engines and distributions is also contrasted against the
-following literature:
+  <p>In case a standard reference-counted smart pointer becomes part of the
+  TR, section IV should be reviewed and instances of the smart pointer be
+  added to the acceptable template parameters for a
+  <code>variate_generator</code>.</p>
 
-<ul>
-<li>Donald E. Knuth, "The Art of Computer Programming Vol. 2"
-</li>
+  <h2>III. Design Decisions</h2>
 
-<li>William H. Press et al., "Numerical Recipes in C"
-</li>
+  <blockquote>
+    <i>Why did you choose the specific design that you did? What alternatives
+    did you consider, and what are the tradeoffs? What are the consequences
+    of your choice, for users and implementors? What decisions are left up to
+    implementors? If there are any similar libraries in use, how do their
+    design decisions compare to yours?</i>
+  </blockquote>The design decisions are compared to those in the following
+  libraries:
 
-</ul>
+  <ul>
+    <li>CLHEP (original at http://wwwinfo.cern.ch/asd/lhc++/clhep/index.html,
+    modifications from FermiLab at (anonymous CVS)
+    :pserver:anonymous at zoomcvs.fnal.gov:/usr/people/cvsuser/repository)</li>
 
+    <li>crng 1.1: Random-number generators (RNGs) implemented as Python
+    extension types coded in C (at http://www.sbc.su.se/~per/crng/)</li>
 
-<h3>A. Overview on Requirements</h3>
+    <li>Swarm 2.1.1 (multi-agent simulation of complex systems), random
+    number package, using a Smalltalk-like programming language (at
+    http://www.santafe.edu/projects/swarm/swarmdocs/set/swarm.random.sgml.reference.html)</li>
 
-Here is a short overview on the requirements for the random number
-framework.
+    <li>GNU Scientific Library: general scientific computing library
+    implemented in C, comprehensive coverage of random number engines and
+    distributions (at http://sources.redhat.com/gsl)</li>
+  </ul>The choice of engines and distributions is also contrasted against the
+  following literature:
 
-<ul>
-<li>allows users to choose in speed / size / quality trade-offs
-<li>has a tight enough specification to get reliable cross-platform
-results
-<li>allows storage of state on non-volatile media (e.g., in a disk
-file) to resume computation later
-<li>does not impede sequence "jump-ahead" for parallel computation
-<li>provides a variety of base engines, not just one
-<li>allows the user to write its own base engines and use it with the
-library-provided distributions
-<li>provides the most popular distributions
-<li>allows the user to write its own distributions and use it with the
-library-provided engines
-<li>allows sharing of engines by several distributions
-<li>does not prevent implementations with utmost efficiency 
-<li>provides both pseudo-random number engines (for simulations etc.)
-and "true" non-deterministic random numbers (for cryptography)
-</ul>
+  <ul>
+    <li>Donald E. Knuth, "The Art of Computer Programming Vol. 2"</li>
 
-All of the requirements are revisited in detail in the following
-sections.
+    <li>William H. Press et al., "Numerical Recipes in C"</li>
+  </ul>
 
+  <h3>A. Overview on Requirements</h3>Here is a short overview on the
+  requirements for the random number framework.
 
-<h3>B. Pseudo-Random vs. Non-Deterministic Random Numbers</h3>
+  <ul>
+    <li>allows users to choose in speed / size / quality trade-offs</li>
 
-This section tries to avoid philosophical discussions about randomness
-as much as possible, a certain amount of intuition is assumed.
-<p>
+    <li>has a tight enough specification to get reliable cross-platform
+    results</li>
 
-In this proposal, a <em>pseudo-random number engine</em> is defined as
-an initial internal state x(0), a function f that
-moves from one internal state to the next x(i+1) := f(x(i)), and an
-output function o that produces the output o(x(i)) of the generator.
-This is an entirely deterministic process, it is determined by the
-initial state x(0) and functions f and o only.
-The initial state x(0) is determined from a seed.  Apparent randomness
-is achieved only because the user has limited perception.
-<p>
+    <li>allows storage of state on non-volatile media (e.g., in a disk file)
+    to resume computation later</li>
 
-A <em>non-deterministic random-number engine</em> provides a
-sequence of random numbers x(i) that cannot be foreseen.  Examples are
-certain quantum-level physics experiments, measuring the time
-difference between radioactive decay of individual atoms or noise of a
-Zehner diode.  Relatively unforeseeable random sources are also (the
-low bits of) timing between key touches, mouse movements, Ethernet
-packet arrivals, etc.  An estimate for the amount of
-unforeseeability is the entropy, a concept from information theory.
-Completely foreseeable sequences (e.g., from pseudo-random number
-engines) have entropy 0, if all bits are unforeseeable, the entropy is
-equal to the number of bits in each number.
-<p>
+    <li>does not impede sequence "jump-ahead" for parallel computation</li>
 
-Pseudo-random number engines are usually much faster than
-non-deterministic random-number engines, because the latter require
-I/O to query some randomness device outside of the computer.  However,
-there is a common interface feature subset of both pseudo-random and
-non-deterministic random-number engines.  For example, a
-non-deterministic random-number engine could be employed to produce
-random numbers with normal distribution; I believe this to be an
-unlikely scenario in practice.
-<p>
+    <li>provides a variety of base engines, not just one</li>
 
-Other libraries, including those mentioned above, only provide
-either pseudo-random numbers, suitable for simulations and games, or
-non-deterministic random numbers, suitable for cryptographic
-applications.
+    <li>allows the user to write its own base engines and use it with the
+    library-provided distributions</li>
 
+    <li>provides the most popular distributions</li>
 
+    <li>allows the user to write its own distributions and use it with the
+    library-provided engines</li>
 
-<h3>C. Separation of Engines and Distributions</h3>
+    <li>allows sharing of engines by several distributions</li>
 
-Random-number generation is usually conceptually separated into
-<em>random-number engines</em> that produce uniformly distributed
-random numbers between a given minimum and maximum and
-<em>random-number distributions</em> that retrieve uniformly
-distributed random numbers from some engine and produce numbers
-according to some distribution (e.g., Gaussian normal or Bernoulli
-distribution).
-Returning to the formalism from section A, the former can be identified
-with the function f and the latter with the output function o.
-<p>
+    <li>does not prevent implementations with utmost efficiency</li>
 
-This proposal honours this conceptual separation, and provides a class
-template to merge an arbitrary engine with an arbitrary distribution
-on top.  To this end, this proposal sets up requirements for
-engines so that each of them can be used to provide uniformly
-distributed random numbers for any of the distributions.  The
-resulting freedom of combination allows for the utmost re-use.
-<p>
+    <li>provides both pseudo-random number engines (for simulations etc.) and
+    "true" non-deterministic random numbers (for cryptography)</li>
+  </ul>All of the requirements are revisited in detail in the following
+  sections.
 
-Engines have usually been analyzed with all mathematical and empirical
-tools currently available.  Nonetheless, those tools show the absence
-of a particular weakness only, and are not exhaustive.  Albeit
-unlikely, a new kind of test (for example, a use of random numbers in
-a new kind of simulation or game) could show serious weaknesses in
-some engines that were not known before.
-<p>
+  <h3>B. Pseudo-Random vs. Non-Deterministic Random Numbers</h3>This section
+  tries to avoid philosophical discussions about randomness as much as
+  possible, a certain amount of intuition is assumed.
 
-This proposal attempts to specify the engines precisely; two different
-implementations, with the same seed, should return the same output
-sequence.  This forces implementations to use the well-researched
-engines specified hereinafter, and users can have confidence in their
-quality and the limits thereof.
-<p>
+  <p>In this proposal, a <em>pseudo-random number engine</em> is defined as
+  an initial internal state x(0), a function f that moves from one internal
+  state to the next x(i+1) := f(x(i)), and an output function o that produces
+  the output o(x(i)) of the generator. This is an entirely deterministic
+  process, it is determined by the initial state x(0) and functions f and o
+  only. The initial state x(0) is determined from a seed. Apparent randomness
+  is achieved only because the user has limited perception.</p>
 
-On the other hand, the specifications for the distributions only
-define the statistical result, not the precise algorithm to use.  This
-is different from engines, because for distribution algorithms,
-rigorous proofs of their correctness are available, usually under the
-precondition that the input random numbers are (truely) uniformly
-distributed.  For example, there are at least a handful of algorithms
-known to produce normally distributed random numbers from uniformly
-distributed ones.  Which one of these is most efficient depends on at
-least the relative execution speeds for various transcendental
-functions, cache and branch prediction behaviour of the CPU, and
-desired memory use.  This proposal therefore leaves the choice of the
-algorithm to the implementation.  It follows that output sequences for
-the distributions will not be identical across implementations.  It is
-expected that implementations will carefully choose the algorithms for
-distributions up front, since it is certainly surprising to customers
-if some distribution produces different numbers from one
-implementation version to the next.
-<p>
+  <p>A <em>non-deterministic random-number engine</em> provides a sequence of
+  random numbers x(i) that cannot be foreseen. Examples are certain
+  quantum-level physics experiments, measuring the time difference between
+  radioactive decay of individual atoms or noise of a Zehner diode.
+  Relatively unforeseeable random sources are also (the low bits of) timing
+  between key touches, mouse movements, Ethernet packet arrivals, etc. An
+  estimate for the amount of unforeseeability is the entropy, a concept from
+  information theory. Completely foreseeable sequences (e.g., from
+  pseudo-random number engines) have entropy 0, if all bits are
+  unforeseeable, the entropy is equal to the number of bits in each
+  number.</p>
 
-Other libraries usually provide the same differentiation between
-engines and distributions.  Libraries rarely have a wrapper around
-both engine and distribution, but it turns out that this can hide some
-complexities from the authors of distributions, since some facitilies
-need to be provided only once.  A previous version of this proposal
-had distributions directly exposed to the user, and the distribution
-type dependent on the engine type.  In various discussions, this was
-considered as too much coupling.
-<p>
+  <p>Pseudo-random number engines are usually much faster than
+  non-deterministic random-number engines, because the latter require I/O to
+  query some randomness device outside of the computer. However, there is a
+  common interface feature subset of both pseudo-random and non-deterministic
+  random-number engines. For example, a non-deterministic random-number
+  engine could be employed to produce random numbers with normal
+  distribution; I believe this to be an unlikely scenario in practice.</p>
 
-Since other libraries do not aim to provide a portable specification
-framework, engines are sometimes only described qualitatively without
-giving the exact parameterization.  Also, distributions are given as
-specific functions or classes, so the quality-of-implementation
-question which distribution algorithm to employ does not need to be
-addressed.
+  <p>Other libraries, including those mentioned above, only provide either
+  pseudo-random numbers, suitable for simulations and games, or
+  non-deterministic random numbers, suitable for cryptographic
+  applications.</p>
 
+  <h3>C. Separation of Engines and Distributions</h3>Random-number generation
+  is usually conceptually separated into <em>random-number engines</em> that
+  produce uniformly distributed random numbers between a given minimum and
+  maximum and <em>random-number distributions</em> that retrieve uniformly
+  distributed random numbers from some engine and produce numbers according
+  to some distribution (e.g., Gaussian normal or Bernoulli distribution).
+  Returning to the formalism from section A, the former can be identified
+  with the function f and the latter with the output function o.
 
-<h3>D. Templates vs. Virtual Functions</h3>
+  <p>This proposal honours this conceptual separation, and provides a class
+  template to merge an arbitrary engine with an arbitrary distribution on
+  top. To this end, this proposal sets up requirements for engines so that
+  each of them can be used to provide uniformly distributed random numbers
+  for any of the distributions. The resulting freedom of combination allows
+  for the utmost re-use.</p>
 
-The layering sketched in the previous subsection can be implemented by
-either a template mechanism or by using virtual functions in a class
-hierarchy.  This proposal uses templates.  Template parameters are
-usually some base type and values denoting fixed parameters for the
-functions f and o, e.g. a word size or modulus.
-<p>
+  <p>Engines have usually been analyzed with all mathematical and empirical
+  tools currently available. Nonetheless, those tools show the absence of a
+  particular weakness only, and are not exhaustive. Albeit unlikely, a new
+  kind of test (for example, a use of random numbers in a new kind of
+  simulation or game) could show serious weaknesses in some engines that were
+  not known before.</p>
 
-For virtual functions in a class hierarchy, the core language requires
-a (nearly) exact type match for a function in a derived classes
-overriding a function in a base class.  This seems to be unnecessarily
-restrictive, because engines can sometimes benefit from using
-different integral base types.  Also, with
-current compiler technology, virtual functions prevent inlining when a
-pointer to the base class is used to call a virtual function that is
-overridden in some derived class.  In particular with applications
-such as simulations that sometimes use millions of pseudo-random
-numbers per second, losing significant amounts of performance due to
-missed inlining opportunities appears to not be acceptable.
-<p>
+  <p>This proposal attempts to specify the engines precisely; two different
+  implementations, with the same seed, should return the same output
+  sequence. This forces implementations to use the well-researched engines
+  specified hereinafter, and users can have confidence in their quality and
+  the limits thereof.</p>
 
-The CLHEP library bases all its engines on the abstract base class
-<code>HepRandomEngine</code>.  Specific engines derive from this class
-and override its pure virtual functions.   Similarly, all
-distributions are based on the base class <code>HepRandom</code>.
-Specific distributions derive from this class, override operator(),
-and provide a number of specific non-virtual functions.
-<p>
+  <p>On the other hand, the specifications for the distributions only define
+  the statistical result, not the precise algorithm to use. This is different
+  from engines, because for distribution algorithms, rigorous proofs of their
+  correctness are available, usually under the precondition that the input
+  random numbers are (truely) uniformly distributed. For example, there are
+  at least a handful of algorithms known to produce normally distributed
+  random numbers from uniformly distributed ones. Which one of these is most
+  efficient depends on at least the relative execution speeds for various
+  transcendental functions, cache and branch prediction behaviour of the CPU,
+  and desired memory use. This proposal therefore leaves the choice of the
+  algorithm to the implementation. It follows that output sequences for the
+  distributions will not be identical across implementations. It is expected
+  that implementations will carefully choose the algorithms for distributions
+  up front, since it is certainly surprising to customers if some
+  distribution produces different numbers from one implementation version to
+  the next.</p>
 
-The GNU Scientific Library, while coded in C, adheres to the
-principles of object-structuring; all engines can be used with any of
-the distributions.  The technical implementation is by mechanisms
-similar to virtual functions.
+  <p>Other libraries usually provide the same differentiation between engines
+  and distributions. Libraries rarely have a wrapper around both engine and
+  distribution, but it turns out that this can hide some complexities from
+  the authors of distributions, since some facitilies need to be provided
+  only once. A previous version of this proposal had distributions directly
+  exposed to the user, and the distribution type dependent on the engine
+  type. In various discussions, this was considered as too much coupling.</p>
 
+  <p>Since other libraries do not aim to provide a portable specification
+  framework, engines are sometimes only described qualitatively without
+  giving the exact parameterization. Also, distributions are given as
+  specific functions or classes, so the quality-of-implementation question
+  which distribution algorithm to employ does not need to be addressed.</p>
 
-<h3>E. Parameterization and Initialization for Engines</h3>
+  <h3>D. Templates vs. Virtual Functions</h3>The layering sketched in the
+  previous subsection can be implemented by either a template mechanism or by
+  using virtual functions in a class hierarchy. This proposal uses templates.
+  Template parameters are usually some base type and values denoting fixed
+  parameters for the functions f and o, e.g. a word size or modulus.
 
-Engines usually have a "base" type which is used to store its internal
-state.  Also, they usually have a choice of parameters.  For example,
-a linear congruential engine is defined by x(i+1) = (a*x(i)+c) mod m,
-so f(x) = (a*x+c) mod m; the base type is "int" and parameters are a,
-c, and m.  Finding parameters for a given function f that make for
-good randomness in the resulting engine's generated numbers x(i)
-requires extensive and specialized mathematical training and
-experience.  In order to make good random numbers available to a large
-number of library users, this proposal not only defines generic
-random-number engines, but also provides a number of predefined
-well-known good parameterizations for those.  Usually, there are only
-a few (less than five) well-known good parameterizations for each
-engine, so it appears feasible to provide these.
-<p>
+  <p>For virtual functions in a class hierarchy, the core language requires a
+  (nearly) exact type match for a function in a derived classes overriding a
+  function in a base class. This seems to be unnecessarily restrictive,
+  because engines can sometimes benefit from using different integral base
+  types. Also, with current compiler technology, virtual functions prevent
+  inlining when a pointer to the base class is used to call a virtual
+  function that is overridden in some derived class. In particular with
+  applications such as simulations that sometimes use millions of
+  pseudo-random numbers per second, losing significant amounts of performance
+  due to missed inlining opportunities appears to not be acceptable.</p>
 
-Since random-number engines are mathematically designed with computer
-implementation in mind, parameters are usually integers representable
-in a machine word, which usually coincides nicely with a C++ built-in
-type.  The parameters could either be given as (compile-time) template
-arguments or as (run-time) constructor arguments.
-<p>
+  <p>The CLHEP library bases all its engines on the abstract base class
+  <code>HepRandomEngine</code>. Specific engines derive from this class and
+  override its pure virtual functions. Similarly, all distributions are based
+  on the base class <code>HepRandom</code>. Specific distributions derive
+  from this class, override operator(), and provide a number of specific
+  non-virtual functions.</p>
 
-Providing parameters as template arguments allows for providing
-predefined parameterizations as simple "typedef"s.  Furthermore, the
-parameters appear as integral constants, so the compiler can
-value-check the given constants against the engine's base type.  Also,
-the library implementor can choose different implementations depending
-on the values of the parameters, without incurring any runtime
-overhead.  For example, there is an efficient method to compute (a*x)
-mod m, provided that a certain magnitude of m relative to the
-underlying type is not exceeded.  Additionally, the compiler's
-optimizer can benefit from the constants and potentially produce
-better code, for example by unrolling loops with fixed loop count.
-<p>
+  <p>The GNU Scientific Library, while coded in C, adheres to the principles
+  of object-structuring; all engines can be used with any of the
+  distributions. The technical implementation is by mechanisms similar to
+  virtual functions.</p>
 
-As an alternative, providing parameters as constructor arguments
-allows for more flexibility for the library user, for example when
-experimenting with several parameterizations.  Predefined
-parameterizations can be provided by defining wrapper types which
-default the constructor parameters.
-<p>
+  <h3>E. Parameterization and Initialization for Engines</h3>Engines usually
+  have a "base" type which is used to store its internal state. Also, they
+  usually have a choice of parameters. For example, a linear congruential
+  engine is defined by x(i+1) = (a*x(i)+c) mod m, so f(x) = (a*x+c) mod m;
+  the base type is "int" and parameters are a, c, and m. Finding parameters
+  for a given function f that make for good randomness in the resulting
+  engine's generated numbers x(i) requires extensive and specialized
+  mathematical training and experience. In order to make good random numbers
+  available to a large number of library users, this proposal not only
+  defines generic random-number engines, but also provides a number of
+  predefined well-known good parameterizations for those. Usually, there are
+  only a few (less than five) well-known good parameterizations for each
+  engine, so it appears feasible to provide these.
 
-Other libraries have hard-coded the parameters of their engines and do
-not allow the user any configuration of them at all.  If the user
-wishes to change the parameters, he has to re-implement the engine's
-algorithm.  In my opinion, this approach unnecessarily restricts
-re-use.
-<p>
+  <p>Since random-number engines are mathematically designed with computer
+  implementation in mind, parameters are usually integers representable in a
+  machine word, which usually coincides nicely with a C++ built-in type. The
+  parameters could either be given as (compile-time) template arguments or as
+  (run-time) constructor arguments.</p>
 
-Regarding initialization, this proposal chooses to provide
-"deterministic seeding" with the default constructor and the
-<code>seed</code> function without parameters: Two engines constructed
-using the default constructor will output the same sequence.  In
-contrast, the CLHEP library's default constructed engines will take a
-fresh seed from a seed table for each instance.  While this approach
-may be convenient for a certain group of users, it relies on global
-state and can easily be emulated by appropriately wrapping engines
-with deterministic seeding.
-<p>
+  <p>Providing parameters as template arguments allows for providing
+  predefined parameterizations as simple "typedef"s. Furthermore, the
+  parameters appear as integral constants, so the compiler can value-check
+  the given constants against the engine's base type. Also, the library
+  implementor can choose different implementations depending on the values of
+  the parameters, without incurring any runtime overhead. For example, there
+  is an efficient method to compute (a*x) mod m, provided that a certain
+  magnitude of m relative to the underlying type is not exceeded.
+  Additionally, the compiler's optimizer can benefit from the constants and
+  potentially produce better code, for example by unrolling loops with fixed
+  loop count.</p>
 
-In addition to the default constructor, all engines provide a
-constructor and <code>seed</code> function taking an iterator range
-[it1,it2) pointing to unsigned integral values.  An engine initializes its state by successively consuming
-values from the iterator range, then returning the advanced iterator it1.
-This approach has the advantage that the user can completely exploit
-the large state of some engines for initialization.  Also, it allows
-to initialize compound engines in a uniform manner.  For example, a
-compound engine consisting of two simpler engines would initialize the
-first engine with its [it1,it2).  The first engine returns a smaller
-iterator range that it has not consumed yet.  This can be used to
-initialize the second engine.
-<p>
+  <p>As an alternative, providing parameters as constructor arguments allows
+  for more flexibility for the library user, for example when experimenting
+  with several parameterizations. Predefined parameterizations can be
+  provided by defining wrapper types which default the constructor
+  parameters.</p>
 
-The iterator range [it1,it2) is specified to point to unsigned
-long values.  There is no way to determine from a generic user
-program how the initialization values will be treated and what range
-of bits must be provided, except by enumerating all engines, e.g. in
-template specializations.  The problem is that a given generator might
-have differing requirements on the values of the seed range even
-within one <code>seed</code> call.
-<p>
+  <p>Other libraries have hard-coded the parameters of their engines and do
+  not allow the user any configuration of them at all. If the user wishes to
+  change the parameters, he has to re-implement the engine's algorithm. In my
+  opinion, this approach unnecessarily restricts re-use.</p>
 
-For example, imagine a
+  <p>Regarding initialization, this proposal chooses to provide
+  "deterministic seeding" with the default constructor and the
+  <code>seed</code> function without parameters: Two engines constructed
+  using the default constructor will output the same sequence. In contrast,
+  the CLHEP library's default constructed engines will take a fresh seed from
+  a seed table for each instance. While this approach may be convenient for a
+  certain group of users, it relies on global state and can easily be
+  emulated by appropriately wrapping engines with deterministic seeding.</p>
 
-<pre>   xor_combine&lt;lagged_fibonacci&lt;...>, mersenne_twister&lt;...> ></pre>
+  <p>In addition to the default constructor, all engines provide a
+  constructor and <code>seed</code> function taking an iterator range
+  [it1,it2) pointing to unsigned integral values. An engine initializes its
+  state by successively consuming values from the iterator range, then
+  returning the advanced iterator it1. This approach has the advantage that
+  the user can completely exploit the large state of some engines for
+  initialization. Also, it allows to initialize compound engines in a uniform
+  manner. For example, a compound engine consisting of two simpler engines
+  would initialize the first engine with its [it1,it2). The first engine
+  returns a smaller iterator range that it has not consumed yet. This can be
+  used to initialize the second engine.</p>
 
-generator.  For this, <code>seed(first, last)</code> will consume
-values as follows: First, seed the state of the
-<code>lagged_fibonacci</code> generator by consuming one item from
-[first, last) for each word of state.  The values are reduced to
-(e.g.) 24 bits to fit the <code>lagged_fibonacci</code> state
-requirements.  Then, seed the state of the
-<code>mersenne_twister</code> by consuming some number of items from
-the remaining [first, last). The values are reduced to 32 bits to fit
-the <code>mersenne_twister</code> state requirements.
-<p>
+  <p>The iterator range [it1,it2) is specified to point to unsigned long
+  values. There is no way to determine from a generic user program how the
+  initialization values will be treated and what range of bits must be
+  provided, except by enumerating all engines, e.g. in template
+  specializations. The problem is that a given generator might have differing
+  requirements on the values of the seed range even within one
+  <code>seed</code> call.</p>
 
-How does a concise programming interface for those increasingly
-complex and varying requirements on [first, last) look like?  I don't
-know, and I don't want to complicate the specification by inventing
-something complicated here.
-<p>
+  <p>For example, imagine a</p>
+  <pre>
+   xor_combine&lt;lagged_fibonacci&lt;...&gt;, mersenne_twister&lt;...&gt; &gt;
+</pre>generator. For this, <code>seed(first, last)</code> will consume values
+as follows: First, seed the state of the <code>lagged_fibonacci</code>
+generator by consuming one item from [first, last) for each word of state.
+The values are reduced to (e.g.) 24 bits to fit the
+<code>lagged_fibonacci</code> state requirements. Then, seed the state of the
+<code>mersenne_twister</code> by consuming some number of items from the
+remaining [first, last). The values are reduced to 32 bits to fit the <code>
+  mersenne_twister</code> state requirements.
 
-Thus, the specification says for each generator how it uses the seed
-values, and how many are consumed.  Additional features are left to
-the user.
-<p>
+  <p>How does a concise programming interface for those increasingly complex
+  and varying requirements on [first, last) look like? I don't know, and I
+  don't want to complicate the specification by inventing something
+  complicated here.</p>
 
-In a way, this is similar to STL containers: It is intended that the user
-can exchange iterators to various containers in generic algorithms,
-but the container itself is not meant to be exchanged, i.e. having a
-Container template parameter is often not adequate.  That is analogous
-to the random number case: The user can pass an engine around and use its
-<code>operator()</code> and <code>min</code> and <code>max</code>
-functions generically.  However, the user can't generically query the
-engine attributes and parameters, simply because most are entirely
-different in semantics for each engine.
-<p>
+  <p>Thus, the specification says for each generator how it uses the seed
+  values, and how many are consumed. Additional features are left to the
+  user.</p>
 
-The <code>seed(first, last)</code> interface can serve two purposes:
+  <p>In a way, this is similar to STL containers: It is intended that the
+  user can exchange iterators to various containers in generic algorithms,
+  but the container itself is not meant to be exchanged, i.e. having a
+  Container template parameter is often not adequate. That is analogous to
+  the random number case: The user can pass an engine around and use its
+  <code>operator()</code> and <code>min</code> and <code>max</code> functions
+  generically. However, the user can't generically query the engine
+  attributes and parameters, simply because most are entirely different in
+  semantics for each engine.</p>
 
-<ol>
-<li>In a generic context, the user can pass several integer values >= 1
-for seeding.  It is unlikely that the user explores the full state space
-with the seeds she provides, but she can be reasonably sure that her
-seeds aren't entirely incorrect.  (There is no formal guarantee for that, except that
-the ability to provide bad seeds usually means the parameterization of
-the engine is bad, e.g. a non-prime modulus for a linear congruential
-engine.)  For example, if the user wants a <code>seed(uint32_t)</code>
-on top of <code>seed(first, last)</code>, one option is to use a
-<code>linear_congruential</code> generator that produces the values
-required for <code>seed(first, last)</code>.  When the user defines the
-iterator type for <code>first</code> and <code>last</code> so that it
-encapsulates the <code>linear_congruential</code> engine in
-<code>operator++</code>, the user doesn't even need to know beforehand how
-many values <code>seed(first, last)</code> will need.</li>
+  <p>The <code>seed(first, last)</code> interface can serve two purposes:</p>
 
-<li>If the user is in a non-generic context, he knows the specific
-template type of the engine (probably not the template value-based
-parameterization, though).  The precise specification for <code>seed(first,
-last)</code> allows to know what values need to be passed in so
-that a specific initial state is attained, for example to compare one
-implementation of the engine with another one that uses different
-seeding.</li>
+  <ol>
+    <li>In a generic context, the user can pass several integer values &gt;=
+    1 for seeding. It is unlikely that the user explores the full state space
+    with the seeds she provides, but she can be reasonably sure that her
+    seeds aren't entirely incorrect. (There is no formal guarantee for that,
+    except that the ability to provide bad seeds usually means the
+    parameterization of the engine is bad, e.g. a non-prime modulus for a
+    linear congruential engine.) For example, if the user wants a
+    <code>seed(uint32_t)</code> on top of <code>seed(first, last)</code>, one
+    option is to use a <code>linear_congruential</code> generator that
+    produces the values required for <code>seed(first, last)</code>. When the
+    user defines the iterator type for <code>first</code> and
+    <code>last</code> so that it encapsulates the
+    <code>linear_congruential</code> engine in <code>operator++</code>, the
+    user doesn't even need to know beforehand how many values
+    <code>seed(first, last)</code> will need.</li>
 
-<li>If the user requires both, he needs to inject knowledge into (1)
-so that he is in the position of (2).  One way to inject the knowledge
-is to use (partial) template specialization to add the knowledge.  The
-specific parameterization of some engine can then be obtained by
-querying the data members of the engines.</li>
-</ol>
-<p>
+    <li>If the user is in a non-generic context, he knows the specific
+    template type of the engine (probably not the template value-based
+    parameterization, though). The precise specification for
+    <code>seed(first, last)</code> allows to know what values need to be
+    passed in so that a specific initial state is attained, for example to
+    compare one implementation of the engine with another one that uses
+    different seeding.</li>
 
-I haven't seen the iterator-based approach to engine initialization in
-other libraries; most initialization approaches rely on a either a
-single value or on per-engine specific approaches to initialization.
-<p>
+    <li>If the user requires both, he needs to inject knowledge into (1) so
+    that he is in the position of (2). One way to inject the knowledge is to
+    use (partial) template specialization to add the knowledge. The specific
+    parameterization of some engine can then be obtained by querying the data
+    members of the engines.</li>
+  </ol>
 
-An alternative approach is to pass a zero-argument function object
-("generator") for seeding.  It is trivial to implement a generator
-from a given iterator range, but it is more complicated to implement
-an iterator range from a generator.  Also, the exception object that
-is specified to be thrown when the iterator range is exhausted could
-be configured in a user-provided iterator to generator mapping.
-With this approach, some engines would have three one-argument constructors:
-One taking a single integer for seeding, one taking a (reference?) to
-a (templated) generator, and the copy constructor.  It appears that the
-opportunities for ambiguities or choosing the wrong overload are too
-confusing to the unsuspecting user.
+  <p>I haven't seen the iterator-based approach to engine initialization in
+  other libraries; most initialization approaches rely on a either a single
+  value or on per-engine specific approaches to initialization.</p>
 
+  <p>An alternative approach is to pass a zero-argument function object
+  ("generator") for seeding. It is trivial to implement a generator from a
+  given iterator range, but it is more complicated to implement an iterator
+  range from a generator. Also, the exception object that is specified to be
+  thrown when the iterator range is exhausted could be configured in a
+  user-provided iterator to generator mapping. With this approach, some
+  engines would have three one-argument constructors: One taking a single
+  integer for seeding, one taking a (reference?) to a (templated) generator,
+  and the copy constructor. It appears that the opportunities for ambiguities
+  or choosing the wrong overload are too confusing to the unsuspecting
+  user.</p>
 
-<h3>F. Parameterization and Initialization for Distributions</h3>
+  <h3>F. Parameterization and Initialization for Distributions</h3>The
+  distributions specified in this proposal have template parameters that
+  indicate the output data type (e.g. <code>float</code>,
+  <code>double</code>, <code>long double</code>) that the user desires.
 
-The distributions specified in this proposal have template parameters
-that indicate the output data type (e.g. <code>float</code>,
-<code>double</code>, <code>long double</code>) that the user desires.
-<p>
+  <p>The probability density functions of distributions usually have
+  parameters. These are mapped to constructor parameters, to be set at
+  runtime by the library user according to her requirements. The parameters
+  for a distribution object cannot change after its construction. When
+  constructing the distribution, this allows to pre-compute some data
+  according to the parameters given without risk of inadvertently
+  invalidating them later.</p>
 
-The probability density functions of distributions usually have
-parameters.  These are mapped to constructor parameters, to be set at
-runtime by the library user according to her requirements.  The
-parameters for a distribution object cannot change after its
-construction.  When constructing the distribution, this allows to
-pre-compute some data according to the parameters given without risk
-of inadvertently invalidating them later.
-<p>
+  <p>Distributions may implement <code>operator()(T x)</code>, for arbitrary
+  type <code>T</code>, to meet special needs, for example a "one-shot" mode
+  where each invocation uses different distribution parameters.</p>
 
-Distributions may implement <code>operator()(T x)</code>, for
-arbitrary type <code>T</code>, to meet special needs, for example a
-"one-shot" mode where each invocation uses different distribution
-parameters.
+  <h3>G. Properties as Traits vs. In-Class Constants</h3>Users might wish to
+  query compile-time properties of the engines and distributions, e.g. their
+  base types, constant parameters, etc. This is similar to querying the
+  properties of the built-in types such as <code>double</code> using
+  <code>std::numeric_limits&lt;&gt;</code>. However, engines and
+  distributions cannot be simple types, so it does not appear to be necessary
+  to separate the properties into separate traits classes. Instead,
+  compile-time properties are given as members types and static member
+  constants.
 
+  <h3>H. Which Engines to Include</h3>There is a multitude of pseudo-random
+  number engines available in both literature and code. Some engines, such as
+  Mersenne Twister, have an independent algorithm ("base engine"). Others
+  change the values or order of output of other engines to improve
+  randomness, for example Knuth's "Algorithm B" ("compound engine"). The
+  template mechanism allows easy combination of base and compound engines.
 
-<h3>G. Properties as Traits vs. In-Class Constants</h3>
+  <p>Engines may be categorized according to the following dimensions.</p>
 
-Users might wish to query compile-time properties of the engines and
-distributions, e.g. their base types, constant parameters, etc.  This
-is similar to querying the properties of the built-in types such as
-<code>double</code> using <code>std::numeric_limits&lt;&gt;</code>.  However,
-engines and distributions cannot be simple types, so it does not
-appear to be necessary to separate the properties into separate traits
-classes.  Instead, compile-time properties are given as members types
-and static member constants.
+  <ul>
+    <li>integers or floating-point numbers produced (Some engines produce
+    uniformly distributed integers in the range [min,max], however, most
+    distribution functions expect uniformly distributed floating-point
+    numbers in the range [0,1) as the input sequence. The obvious conversion
+    requires a relatively costly integer to floating-point conversion plus a
+    floating-point multiplication by (max-min+1)<sup>-1</sup> for each random
+    number used. To save the multiplication, some engines can directly
+    produce floating-point numbers in the range [0,1) by maintaining the
+    state x(i) in an appropriately normalized form, given a sufficiently good
+    implementation of basic floating-point operations (e.g. IEEE 754).</li>
 
+    <li>quality of random numbers produced (What is the cycle length? Does
+    the engine pass all relevant statistical tests? Up to what dimension are
+    numbers equidistributed?)</li>
 
-<h3>H. Which Engines to Include</h3>
+    <li>speed of generation (How many and what kind of operations have to be
+    performed to produce one random number, on average?)</li>
 
-There is a multitude of pseudo-random number engines available in both
-literature and code.  Some engines, such as Mersenne Twister, have an
-independent algorithm ("base engine").  Others change the values or
-order of output of other engines to improve randomness, for example
-Knuth's "Algorithm B" ("compound engine").  The template mechanism
-allows easy combination of base and compound engines.
-<p>
+    <li>size of state (How may machine words of storage are required to hold
+    the state x(i) of the random engine?)</li>
 
-Engines may be categorized according to the following dimensions.
+    <li>option for independent subsequences (Is it possible to move from x(i)
+    to x(i+k) with at most O(log(k)) steps? This allows to efficiently use
+    subsequences x(0)...x(k-1), x(k)...x(2k-1), ..., x(jk)...x((j+1)k-1),
+    ..., for example for parallel computation, where each of the m processors
+    gets assigned the (independent) subsequence starting at x(jk) (0 &lt;= k
+    &lt; m).)</li>
+  </ul>According to the criteria above, the engines given below were chosen.
+  The quality and size indications were completed according to best known
+  parameterizations. Other parameterizations usually yield poorer quality
+  and/or less size.
 
-<ul>
-<li>integers or floating-point numbers produced (Some engines produce
-uniformly distributed integers in the range [min,max], however, most
-distribution functions expect uniformly distributed floating-point
-numbers in the range [0,1) as the input sequence.  The obvious
-conversion requires a relatively costly integer to floating-point
-conversion plus a floating-point multiplication by
-(max-min+1)<sup>-1</sup> for each random number used.  To save the
-multiplication, some engines can directly produce floating-point
-numbers in the range [0,1) by maintaining the state x(i) in an
-appropriately normalized form, given a sufficiently good
-implementation of basic floating-point operations (e.g. IEEE
-754).</li>
+  <table border="1" summary="">
+    <tr>
+      <th>engine</th>
 
-<li>quality of random numbers produced (What is the cycle length?
-Does the engine pass all relevant statistical tests?  Up to what
-dimension are numbers equidistributed?)</li>
+      <th>int / float</th>
 
-<li>speed of generation (How many and what kind of operations have to
-be performed to produce one random number, on average?)</li>
+      <th>quality</th>
 
-<li>size of state (How may machine words of storage are required to
-hold the state x(i) of the random engine?)</li>
+      <th>speed</th>
 
-<li>option for independent subsequences (Is it possible to move from
-x(i) to x(i+k) with at most O(log(k)) steps? This allows to
-efficiently use subsequences x(0)...x(k-1), x(k)...x(2k-1), ...,
-x(jk)...x((j+1)k-1), ..., for example for parallel computation, where
-each of the m processors gets assigned the (independent) subsequence
-starting at x(jk) (0 &lt;= k &lt m).)</li>
-</ul>
+      <th>size of state</th>
 
-According to the criteria above, the engines given below were chosen.
-The quality and size indications were completed according to best
-known parameterizations.  Other parameterizations usually yield poorer
-quality and/or less size.
-<p>
+      <th>subsequences</th>
 
-<table border="1">
-<tr>
-<th>engine</th>
-<th>int / float</th>
-<th>quality</th>
-<th>speed</th>
-<th>size of state</th>
-<th>subsequences</th>
-<th>comments</th>
-</tr>
+      <th>comments</th>
+    </tr>
 
-<tr>
-<td>linear_congruential</td>
-<td>int</td>
-<td>medium</td>
-<td>medium</td>
-<td>1 word</td>
-<td>yes</td>
-<td>cycle length is limited to the maximum value representable in one
-machine word, passes most statisticial tests with chosen
-parameters.</td>
-</tr>
+    <tr>
+      <td>linear_congruential</td>
 
-<tr>
-<td>mersenne_twister</td>
-<td>int</td>
-<td>good</td>
-<td>fast</td>
-<td>624 words</td>
-<td>no</td>
-<td>long cycles, passes all statistical tests, good
-equidistribution in high dimensions</td>
-</tr>
+      <td>int</td>
 
-<tr>
-<td>subtract_with_carry</td>
-<td>both</td>
-<td>medium</td>
-<td>fast</td>
-<td>25 words</td>
-<td>no</td>
-<td>very long cycles possible, fails some statistical tests.  Can be
-improved with the discard_block compound engine.</td>
-</tr>
+      <td>medium</td>
 
-<tr>
-<td>discard_block</td>
-<td>both</td>
-<td>good</td>
-<td>slow</td>
-<td>base engine + 1 word</td>
-<td>no</td>
-<td>compound engine that removes correlation provably by throwing away
-significant chunks of the base engine's sequence, the resulting speed
-is reduced to 10% to 3% of the base engine's.</td>
-</tr>
+      <td>medium</td>
 
-<tr>
-<td>xor_combine</td>
-<td>int</td>
-<td>good</td>
-<td>fast</td>
-<td>base engines</td>
-<td>yes, if one of the base engines</td>
-<td>compound engine that XOR-combines the sequences of
-two base engines</td>
-</tr>
+      <td>1 word</td>
 
-</table>
-<p>
+      <td>yes</td>
 
-Some engines were considered for inclusion, but left out for the
-following reasons:
-<p>
+      <td>cycle length is limited to the maximum value representable in one
+      machine word, passes most statisticial tests with chosen
+      parameters.</td>
+    </tr>
 
-<table border="1">
-<tr>
-<th>engine</th>
-<th>int / float</th>
-<th>quality</th>
-<th>speed</th>
-<th>size of state</th>
-<th>subsequences</th>
-<th>comments</th>
-</tr>
+    <tr>
+      <td>mersenne_twister</td>
 
-<tr>
-<td>shuffle_output</td>
-<td>int</td>
-<td>good</td>
-<td>fast</td>
-<td>base engine + 100 words</td>
-<td>no</td>
-<td>compound engine that reorders the base engine's output, little
-overhead for generation (one multiplication)</td>
-</tr>
+      <td>int</td>
 
-<tr>
-<td>lagged_fibonacci</td>
-<td>both</td>
-<td>medium</td>
-<td>fast</td>
-<td>up to 80,000 words</td>
-<td>no</td>
-<td>very long cycles possible, fails birthday spacings test.  Same
-principle of generation as <code>subtract_with_carry</code>, i.e. x(i)
-= x(i-s) (*) x(i-r), where (*) is either of +, -, xor with or without
-carry.</td>
-</tr>
+      <td>good</td>
 
-<tr>
-<td>inversive_congruential (Hellekalek 1995)</td>
-<td>int</td>
-<td>good</td>
-<td>slow</td>
-<td>1 word</td>
-<td>no</td>
-<td>x(i+1) = a x(i)<sup>-1</sup> + c.  Good equidistribution in
-several dimensions.  Provides no apparent advantage compared to
-ranlux; the latter can produce floating-point numbers directly.</td>
-</tr>
+      <td>fast</td>
 
-<tr>
-<td>additive_combine (L'Ecuyer 1988)</td>
-<td>int</td>
-<td>good</td>
-<td>medium</td>
-<td>2 words</td>
-<td>yes</td>
-<td>Combines two linear congruential generators.  Same principle
-of combination as <code>xor_combine</code>, i.e. z(i) = x(i) (*) y(i),
-where (*) is one of +, -, xor.</td>
-</tr>
+      <td>624 words</td>
 
-<tr>
-<td>R250 (Kirkpatrick and Stoll)</td>
-<td>int</td>
-<td>bad</td>
-<td>fast</td>
-<td>~ 20 words</td>
-<td>no</td>
-<td>General Feedback Shift Register with two taps: Easily exploitable
-correlation.</td>
-</tr>
+      <td>no</td>
 
-<tr>
-<td>linear_feedback_shift</td>
-<td>int</td>
-<td>medium</td>
-<td>fast</td>
-<td>1 word</td>
-<td>no</td>
-<td>cycle length is limited to the maximum value representable in one
-machine word, fails some statistical tests, can be improved with the
-xor_combine compound engine.</td>
-</tr>
+      <td>long cycles, passes all statistical tests, good equidistribution in
+      high dimensions</td>
+    </tr>
 
-</table>
-<p>
+    <tr>
+      <td>subtract_with_carry</td>
 
-The GNU Scientific Library and Swarm have additional engine that are
-not mentioned in the table below.
-<p>
+      <td>both</td>
 
-<table border="1">
-<tr>
-<th>Engine</th>
-<th>this proposal</th>
-<th>CLHEP</th>
-<th>crng</th>
-<th>GNU Scientific Library</th>
-<th>Swarm</th>
-<th>Numerical Recipes</th>
-<th>Knuth</th>
-</tr>
+      <td>medium</td>
 
-<tr>
-<td>LCG(2<sup>31</sup>-1, 16807)</td>
-<td>minstd_rand0</td>
-<td>-</td>
-<td>ParkMiller</td>
-<td>ran0, minstd</td>
-<td>-</td>
-<td>ran0</td>
-<td>p106, table 1, line 19</td>
-</tr>
+      <td>fast</td>
 
-<tr>
-<td>LCG(2<sup>32</sup>, a=1664525, c=1013904223)</td>
-<td>linear_congruential&lt; ..., 1664525, 1013904223, (1 &lt&lt 32) &gt;</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>LCG1gen</td>
-<td>-</td>
-<td>p106, table 1, line 16</td>
-</tr>
+      <td>25 words</td>
 
-<tr>
-<td>LCG1 + LCG2 + LCG3</td>
-<td>-</td>
-<td>-</td>
-<td>WichmannHill</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>no</td>
 
-<tr>
-<td>(LCG1 - LCG2 + LCG3 - LCG4) mod m0</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>C4LCGXgen</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>very long cycles possible, fails some statistical tests. Can be
+      improved with the discard_block compound engine.</td>
+    </tr>
 
-<tr>
-<td>LCG(2<sup>31</sup>-1, 16807) with Bays/Durham shuffle</td>
-<td>shuffle_output&lt;minstd_rand0, 32&gt; (shuffle_output not in this
-proposal)</td>
-<td>-</td>
-<td>-</td>
-<td>ran1</td>
-<td>PMMLCG1gen</td>
-<td>ran1</td>
-<td>Algorithm "B"</td>
-</tr>
+    <tr>
+      <td>discard_block</td>
 
-<tr>
-<td>(LCG(2<sup>31</sup>-85, 40014) + LCG(2<sup>31</sup>-249, 40692))
-mod 2<sup>31</sup>-85</td>
-<td>ecuyer1988 (additive_combine not in this proposal)</td>
-<td>Ranecu</td>
-<td>LEcuyer</td>
-<td>-</td>
-<td>C2LCGXgen</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>both</td>
 
-<tr>
-<td>(LCG(2<sup>31</sup>-85, 40014) with Bays/Durham shuffle +
-LCG(2<sup>31</sup>-249, 40692)) mod 2<sup>31</sup>-85</td>
-<td>additive_combine&lt;
-    shuffle_output&lt;<br>
-    linear_congruential&lt;int, 40014, 0, 2147483563>, 32&gt;,<br>
-    linear_congruential&lt;int, 40692, 0, 2147483399> >
-(additive_combine and shuffle_output not in this proposal)</td>
-<td>-</td>
-<td>-</td>
-<td>ran2</td>
-<td>-</td>
-<td>ran2</td>
-<td>-</td>
-</tr>
+      <td>good</td>
 
-<tr>
-<td>X(i) = (X(i-55) - X(i-33)) mod 10<sup>9</sup></td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>ran3</td>
-<td>~SCGgen</td>
-<td>ran3</td>
-<td>-</td>
-</tr>
+      <td>slow</td>
 
-<tr>
-<td>X(i) = (X(i-100) - X(i-37)) mod 2<sup>30</sup></td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>ran_array</td>
-</tr>
+      <td>base engine + 1 word</td>
 
-<tr>
-<td>X(i) = (X(i-55) + X(i-24)) mod 2<sup>32</sup></td>
-<td>lagged_fibonacci&lt; ..., 32, 55, 24, ...&gt;
-(lagged_fibonacci not in this proposal)
-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>ACGgen</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>no</td>
 
-<tr>
-<td>DEShash(i,j)</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>ran4</td>
-<td>-</td>
-</tr>
+      <td>compound engine that removes correlation provably by throwing away
+      significant chunks of the base engine's sequence, the resulting speed
+      is reduced to 10% to 3% of the base engine's.</td>
+    </tr>
 
-<tr>
-<td>MT</td>
-<td>mt19937</td>
-<td>MTwistEngine</td>
-<td>MT19937</td>
-<td>mt19937</td>
-<td>MT19937gen</td>
-<td>-</td>
-<td>-</td>
-</tr>
+    <tr>
+      <td>xor_combine</td>
 
-<tr>
-<td>X(i) = (X(i-37) - X(i-24) - carry) mod 2<sup>32</sup></td>
-<td>subtract_with_carry&lt; ..., (1&lt;&lt;32), 37, 24, ...&gt;</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>SWB1gen</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>int</td>
 
-<tr>
-<td>X(i) = (X(i-43) - X(i-22) - carry) mod 2<sup>32</sup>-5</td>
-<td>subtract_with_carry&lt; ..., (1&lt;&lt;32)-5, 43, 22, ...&gt;</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>PSWBgen</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>good</td>
 
-<tr>
-<td>RCARRY with block discard by Lüscher</td>
-<td>discard_block&lt; subtract_with_carry&lt...&gt;, ...&gt;</td>
-<td>RanluxEngine, Ranlux64Engine</td>
-<td>Ranlux</td>
-<td>ranlx*</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>fast</td>
 
-<tr>
-<td>Hurd</td>
-<td>-</td>
-<td>Hurd160, Hurd288</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>base engines</td>
 
-<tr>
-<td>physical model by Ranshi</td>
-<td>-</td>
-<td>Ranshi</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>yes, if one of the base engines</td>
 
-<tr>
-<td>return predefined data</td>
-<td>-</td>
-<td>NonRandom</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>compound engine that XOR-combines the sequences of two base
+      engines</td>
+    </tr>
+  </table>
 
-<tr>
-<td>RANMAR: z(i) = (z(i-97) - z(i-33)) mod 2<sup>24</sup>; y(i+1) =
-(y(i)-c) mod 2<sup>24</sup>-3;  X(i) = (z(i) - y(i)) mod
-2<sup>24</sup></td>
-<td>additive_combine&lt; lagged_fibonacci&lt; (1&lt;&lt;24), 97, 33,
-... &gt;, linear_congruential&lt; (1&lt;&lt;24)-3, 1, c, ...&gt;
-(additive_combine and lagged_fibonacci not in this proposal)
-</td>
-<td>JamesRandom</td>
-<td>-</td>
-<td>ranmar</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-</tr>
+  <p>Some engines were considered for inclusion, but left out for the
+  following reasons:</p>
 
-<tr>
-<td>Taus88</td>
-<td>taus88 = xor_combine ...</td>
-<td>-</td>
-<td>Taus88</td>
-<td>taus, taus2</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-</tr>
+  <table border="1" summary="">
+    <tr>
+      <th>engine</th>
 
-<tr>
-<td>Taus60</td>
-<td>xor_combine&lt; linear_feedback_shift&lt; 31, 13, 12 &gt, 0,
-linear_feedback_shift&lt; 29, 2, 4 &gt, 2, 0&gt;
-(linear_feedback_shift not in this proposal)
-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>C2TAUSgen</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <th>int / float</th>
 
-<tr>
-<td>GFSR, 4-tap</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>gfsr4</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <th>quality</th>
 
-<tr>
-<td>MRG32k3a</td>
-<td>-</td>
-<td>-</td>
-<td>MRG32k3a</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <th>speed</th>
 
-</table>
+      <th>size of state</th>
 
+      <th>subsequences</th>
 
-<h3>I. Which Distributions to Include</h3>
+      <th>comments</th>
+    </tr>
 
-The following distributions were chosen due to their relatively
-widespread use:
+    <tr>
+      <td>shuffle_output</td>
 
-<ul>
-<li>Integer uniform
-<li>Floating-point uniform
-<li>Exponential
-<li>Normal
-<li>Gamma
-<li>Poisson
-<li>Binomial
-<li>Geometric
-<li>Bernoulli
-</ul>
+      <td>int</td>
 
-The GNU Scientific Library has a multitude of additional distributions
-that are not mentioned in the table below. 
-<p>
+      <td>good</td>
 
-<table border="1">
-<tr>
-<th>Distribution</th>
-<th>this proposal</th>
-<th>CLHEP</th>
-<th>crng</th>
-<th>GNU Scientific Library</th>
-<th>Swarm</th>
-<th>Numerical Recipes</th>
-<th>Knuth</th>
-</tr>
+      <td>fast</td>
 
-<tr>
-<td>uniform (int)</td>
-<td>uniform_int</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>UniformIntegerDist</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>base engine + 100 words</td>
 
-<tr>
-<td>uniform (float)</td>
-<td>uniform_real</td>
-<td>RandFlat</td>
-<td>UniformDeviate</td>
-<td>flat</td>
-<td>UniformDoubleDist</td>
-<td>-</td>
-<td>uniform</td>
-</tr>
+      <td>no</td>
 
-<tr>
-<td>exponential</td>
-<td>exponential_distribution</td>
-<td>RandExponential</td>
-<td>ExponentialDeviate</td>
-<td>exponential</td>
-<td>ExponentialDist</td>
-<td>exponential</td>
-<td>exponential</td>
-</tr>
+      <td>compound engine that reorders the base engine's output, little
+      overhead for generation (one multiplication)</td>
+    </tr>
 
-<tr>
-<td>normal</td>
-<td>normal_distribution</td>
-<td>RandGauss*</td>
-<td>NormalDeviate</td>
-<td>gaussian</td>
-<td>NormalDist</td>
-<td>normal (gaussian)</td>
-<td>normal</td>
-</tr>
+    <tr>
+      <td>lagged_fibonacci</td>
 
-<tr>
-<td>lognormal</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>lognormal</td>
-<td>LogNormalDist</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>both</td>
 
-<tr>
-<td>gamma</td>
-<td>gamma_distribution</td>
-<td>RandGamma</td>
-<td>GammaDeviate</td>
-<td>gamma</td>
-<td>GammaDist</td>
-<td>gamma</td>
-<td>gamma</td>
-</tr>
+      <td>medium</td>
 
-<tr>
-<td>beta</td>
-<td>-</td>
-<td>-</td>
-<td>BetaDeviate</td>
-<td>beta</td>
-<td>-</td>
-<td>-</td>
-<td>beta</td>
-</tr>
+      <td>fast</td>
 
-<tr>
-<td>poisson</td>
-<td>poisson_distribution</td>
-<td>Poisson</td>
-<td>PoissonDeviate</td>
-<td>poisson</td>
-<td>PoissonDist</td>
-<td>poisson</td>
-<td>poisson</td>
-</tr>
+      <td>up to 80,000 words</td>
 
-<tr>
-<td>binomial</td>
-<td>binomial_distribution</td>
-<td>RandBinomial</td>
-<td>BinomialDeviate</td>
-<td>binomial</td>
-<td>-</td>
-<td>binomial</td>
-<td>binomial</td>
-</tr>
+      <td>no</td>
 
-<tr>
-<td>geometric</td>
-<td>geometric_distribution</td>
-<td>-</td>
-<td>GeometricDeviate</td>
-<td>geometric</td>
-<td>-</td>
-<td>-</td>
-<td>geometric</td>
-</tr>
+      <td>very long cycles possible, fails birthday spacings test. Same
+      principle of generation as <code>subtract_with_carry</code>, i.e. x(i)
+      = x(i-s) (*) x(i-r), where (*) is either of +, -, xor with or without
+      carry.</td>
+    </tr>
 
-<tr>
-<td>bernoulli</td>
-<td>bernoulli_distribution</td>
-<td>-</td>
-<td>BernoulliDeviate</td>
-<td>bernoulli</td>
-<td>BernoulliDist</td>
-<td>-</td>
-<td>-</td>
-</tr>
+    <tr>
+      <td>inversive_congruential (Hellekalek 1995)</td>
 
-<tr>
-<td>random bit</td>
-<td>-</td>
-<td>RandBit</td>
-<td>-</td>
-<td>-</td>
-<td>RandomBitDist</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>int</td>
 
-<tr>
-<td>breit-wigner</td>
-<td>-</td>
-<td>RandBreitWigner</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>good</td>
 
-<tr>
-<td>chi-square</td>
-<td>-</td>
-<td>RandChiSquare</td>
-<td>-</td>
-<td>chisq</td>
-<td>-</td>
-<td>-</td>
-<td>chi-square</td>
-</tr>
+      <td>slow</td>
 
-<tr>
-<td>landau</td>
-<td>-</td>
-<td>Landau</td>
-<td>-</td>
-<td>landau</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-</tr>
+      <td>1 word</td>
 
-<tr>
-<td>F</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>F</td>
-<td>-</td>
-<td>-</td>
-<td>F (variance-ratio)</td>
-</tr>
+      <td>no</td>
 
-<tr>
-<td>t</td>
-<td>-</td>
-<td>-</td>
-<td>-</td>
-<td>t</td>
-<td>-</td>
-<td>-</td>
-<td>t</td>
-</tr>
+      <td>x(i+1) = a x(i)<sup>-1</sup> + c. Good equidistribution in several
+      dimensions. Provides no apparent advantage compared to ranlux; the
+      latter can produce floating-point numbers directly.</td>
+    </tr>
 
-</table>
+    <tr>
+      <td>additive_combine (L'Ecuyer 1988)</td>
 
+      <td>int</td>
 
-<h3>J. Taxonomy of Concepts</h3>
+      <td>good</td>
 
-All of the engines support the number generator requirements,
-i.e. they are zero-argument function objects which return numbers.
-All of the distributions are one-argument function objects, taking a
-reference to an engine and returning numbers.  All of the engines and
-some of the distributions return uniformly distributed random numbers.
-This is reflected in the concept of the uniform random number
-generator, which refines number generator.  Engines for pseudo-random
-numbers model the requirements for pseudo-random number engine, which
-refines uniform random number generator.
+      <td>medium</td>
 
-<pre>
+      <td>2 words</td>
+
+      <td>yes</td>
+
+      <td>Combines two linear congruential generators. Same principle of
+      combination as <code>xor_combine</code>, i.e. z(i) = x(i) (*) y(i),
+      where (*) is one of +, -, xor.</td>
+    </tr>
+
+    <tr>
+      <td>R250 (Kirkpatrick and Stoll)</td>
+
+      <td>int</td>
+
+      <td>bad</td>
+
+      <td>fast</td>
+
+      <td>~ 20 words</td>
+
+      <td>no</td>
+
+      <td>General Feedback Shift Register with two taps: Easily exploitable
+      correlation.</td>
+    </tr>
+
+    <tr>
+      <td>linear_feedback_shift</td>
+
+      <td>int</td>
+
+      <td>medium</td>
+
+      <td>fast</td>
+
+      <td>1 word</td>
+
+      <td>no</td>
+
+      <td>cycle length is limited to the maximum value representable in one
+      machine word, fails some statistical tests, can be improved with the
+      xor_combine compound engine.</td>
+    </tr>
+  </table>
+
+  <p>The GNU Scientific Library and Swarm have additional engine that are not
+  mentioned in the table below.</p>
+
+  <table border="1" summary="">
+    <tr>
+      <th>Engine</th>
+
+      <th>this proposal</th>
+
+      <th>CLHEP</th>
+
+      <th>crng</th>
+
+      <th>GNU Scientific Library</th>
+
+      <th>Swarm</th>
+
+      <th>Numerical Recipes</th>
+
+      <th>Knuth</th>
+    </tr>
+
+    <tr>
+      <td>LCG(2<sup>31</sup>-1, 16807)</td>
+
+      <td>minstd_rand0</td>
+
+      <td>-</td>
+
+      <td>ParkMiller</td>
+
+      <td>ran0, minstd</td>
+
+      <td>-</td>
+
+      <td>ran0</td>
+
+      <td>p106, table 1, line 19</td>
+    </tr>
+
+    <tr>
+      <td>LCG(2<sup>32</sup>, a=1664525, c=1013904223)</td>
+
+      <td>linear_congruential&lt; ..., 1664525, 1013904223, (1 &lt;&lt; 32)
+      &gt;</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>LCG1gen</td>
+
+      <td>-</td>
+
+      <td>p106, table 1, line 16</td>
+    </tr>
+
+    <tr>
+      <td>LCG1 + LCG2 + LCG3</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>WichmannHill</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>(LCG1 - LCG2 + LCG3 - LCG4) mod m0</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>C4LCGXgen</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>LCG(2<sup>31</sup>-1, 16807) with Bays/Durham shuffle</td>
+
+      <td>shuffle_output&lt;minstd_rand0, 32&gt; (shuffle_output not in this
+      proposal)</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>ran1</td>
+
+      <td>PMMLCG1gen</td>
+
+      <td>ran1</td>
+
+      <td>Algorithm "B"</td>
+    </tr>
+
+    <tr>
+      <td>(LCG(2<sup>31</sup>-85, 40014) + LCG(2<sup>31</sup>-249, 40692))
+      mod 2<sup>31</sup>-85</td>
+
+      <td>ecuyer1988 (additive_combine not in this proposal)</td>
+
+      <td>Ranecu</td>
+
+      <td>LEcuyer</td>
+
+      <td>-</td>
+
+      <td>C2LCGXgen</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>(LCG(2<sup>31</sup>-85, 40014) with Bays/Durham shuffle +
+      LCG(2<sup>31</sup>-249, 40692)) mod 2<sup>31</sup>-85</td>
+
+      <td>additive_combine&lt; shuffle_output&lt;<br>
+      linear_congruential&lt;int, 40014, 0, 2147483563&gt;, 32&gt;,<br>
+      linear_congruential&lt;int, 40692, 0, 2147483399&gt; &gt;
+      (additive_combine and shuffle_output not in this proposal)</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>ran2</td>
+
+      <td>-</td>
+
+      <td>ran2</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>X(i) = (X(i-55) - X(i-33)) mod 10<sup>9</sup></td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>ran3</td>
+
+      <td>~SCGgen</td>
+
+      <td>ran3</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>X(i) = (X(i-100) - X(i-37)) mod 2<sup>30</sup></td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>ran_array</td>
+    </tr>
+
+    <tr>
+      <td>X(i) = (X(i-55) + X(i-24)) mod 2<sup>32</sup></td>
+
+      <td>lagged_fibonacci&lt; ..., 32, 55, 24, ...&gt; (lagged_fibonacci not
+      in this proposal)</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>ACGgen</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>DEShash(i,j)</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>ran4</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>MT</td>
+
+      <td>mt19937</td>
+
+      <td>MTwistEngine</td>
+
+      <td>MT19937</td>
+
+      <td>mt19937</td>
+
+      <td>MT19937gen</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>X(i) = (X(i-37) - X(i-24) - carry) mod 2<sup>32</sup></td>
+
+      <td>subtract_with_carry&lt; ..., (1&lt;&lt;32), 37, 24, ...&gt;</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>SWB1gen</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>X(i) = (X(i-43) - X(i-22) - carry) mod 2<sup>32</sup>-5</td>
+
+      <td>subtract_with_carry&lt; ..., (1&lt;&lt;32)-5, 43, 22, ...&gt;</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>PSWBgen</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>RCARRY with block discard by L&uuml;scher</td>
+
+      <td>discard_block&lt; subtract_with_carry&lt;...&gt;, ...&gt;</td>
+
+      <td>RanluxEngine, Ranlux64Engine</td>
+
+      <td>Ranlux</td>
+
+      <td>ranlx*</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>Hurd</td>
+
+      <td>-</td>
+
+      <td>Hurd160, Hurd288</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>physical model by Ranshi</td>
+
+      <td>-</td>
+
+      <td>Ranshi</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>return predefined data</td>
+
+      <td>-</td>
+
+      <td>NonRandom</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>RANMAR: z(i) = (z(i-97) - z(i-33)) mod 2<sup>24</sup>; y(i+1) =
+      (y(i)-c) mod 2<sup>24</sup>-3; X(i) = (z(i) - y(i)) mod
+      2<sup>24</sup></td>
+
+      <td>additive_combine&lt; lagged_fibonacci&lt; (1&lt;&lt;24), 97, 33,
+      ... &gt;, linear_congruential&lt; (1&lt;&lt;24)-3, 1, c, ...&gt;
+      (additive_combine and lagged_fibonacci not in this proposal)</td>
+
+      <td>JamesRandom</td>
+
+      <td>-</td>
+
+      <td>ranmar</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>Taus88</td>
+
+      <td>taus88 = xor_combine ...</td>
+
+      <td>-</td>
+
+      <td>Taus88</td>
+
+      <td>taus, taus2</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>Taus60</td>
+
+      <td>xor_combine&lt; linear_feedback_shift&lt; 31, 13, 12 &gt;, 0,
+      linear_feedback_shift&lt; 29, 2, 4 &gt;, 2, 0&gt;
+      (linear_feedback_shift not in this proposal)</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>C2TAUSgen</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>GFSR, 4-tap</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>gfsr4</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>MRG32k3a</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>MRG32k3a</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+  </table>
+
+  <h3>I. Which Distributions to Include</h3>The following distributions were
+  chosen due to their relatively widespread use:
+
+  <ul>
+    <li>Integer uniform</li>
+
+    <li>Floating-point uniform</li>
+
+    <li>Exponential</li>
+
+    <li>Normal</li>
+
+    <li>Gamma</li>
+
+    <li>Poisson</li>
+
+    <li>Binomial</li>
+
+    <li>Geometric</li>
+
+    <li>Bernoulli</li>
+  </ul>The GNU Scientific Library has a multitude of additional distributions
+  that are not mentioned in the table below.
+
+  <table border="1" summary="">
+    <tr>
+      <th>Distribution</th>
+
+      <th>this proposal</th>
+
+      <th>CLHEP</th>
+
+      <th>crng</th>
+
+      <th>GNU Scientific Library</th>
+
+      <th>Swarm</th>
+
+      <th>Numerical Recipes</th>
+
+      <th>Knuth</th>
+    </tr>
+
+    <tr>
+      <td>uniform (int)</td>
+
+      <td>uniform_int</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>UniformIntegerDist</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>uniform (float)</td>
+
+      <td>uniform_real</td>
+
+      <td>RandFlat</td>
+
+      <td>UniformDeviate</td>
+
+      <td>flat</td>
+
+      <td>UniformDoubleDist</td>
+
+      <td>-</td>
+
+      <td>uniform</td>
+    </tr>
+
+    <tr>
+      <td>exponential</td>
+
+      <td>exponential_distribution</td>
+
+      <td>RandExponential</td>
+
+      <td>ExponentialDeviate</td>
+
+      <td>exponential</td>
+
+      <td>ExponentialDist</td>
+
+      <td>exponential</td>
+
+      <td>exponential</td>
+    </tr>
+
+    <tr>
+      <td>normal</td>
+
+      <td>normal_distribution</td>
+
+      <td>RandGauss*</td>
+
+      <td>NormalDeviate</td>
+
+      <td>gaussian</td>
+
+      <td>NormalDist</td>
+
+      <td>normal (gaussian)</td>
+
+      <td>normal</td>
+    </tr>
+
+    <tr>
+      <td>lognormal</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>lognormal</td>
+
+      <td>LogNormalDist</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>gamma</td>
+
+      <td>gamma_distribution</td>
+
+      <td>RandGamma</td>
+
+      <td>GammaDeviate</td>
+
+      <td>gamma</td>
+
+      <td>GammaDist</td>
+
+      <td>gamma</td>
+
+      <td>gamma</td>
+    </tr>
+
+    <tr>
+      <td>beta</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>BetaDeviate</td>
+
+      <td>beta</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>beta</td>
+    </tr>
+
+    <tr>
+      <td>poisson</td>
+
+      <td>poisson_distribution</td>
+
+      <td>Poisson</td>
+
+      <td>PoissonDeviate</td>
+
+      <td>poisson</td>
+
+      <td>PoissonDist</td>
+
+      <td>poisson</td>
+
+      <td>poisson</td>
+    </tr>
+
+    <tr>
+      <td>binomial</td>
+
+      <td>binomial_distribution</td>
+
+      <td>RandBinomial</td>
+
+      <td>BinomialDeviate</td>
+
+      <td>binomial</td>
+
+      <td>-</td>
+
+      <td>binomial</td>
+
+      <td>binomial</td>
+    </tr>
+
+    <tr>
+      <td>geometric</td>
+
+      <td>geometric_distribution</td>
+
+      <td>-</td>
+
+      <td>GeometricDeviate</td>
+
+      <td>geometric</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>geometric</td>
+    </tr>
+
+    <tr>
+      <td>bernoulli</td>
+
+      <td>bernoulli_distribution</td>
+
+      <td>-</td>
+
+      <td>BernoulliDeviate</td>
+
+      <td>bernoulli</td>
+
+      <td>BernoulliDist</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>random bit</td>
+
+      <td>-</td>
+
+      <td>RandBit</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>RandomBitDist</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>breit-wigner</td>
+
+      <td>-</td>
+
+      <td>RandBreitWigner</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>chi-square</td>
+
+      <td>-</td>
+
+      <td>RandChiSquare</td>
+
+      <td>-</td>
+
+      <td>chisq</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>chi-square</td>
+    </tr>
+
+    <tr>
+      <td>landau</td>
+
+      <td>-</td>
+
+      <td>Landau</td>
+
+      <td>-</td>
+
+      <td>landau</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+    </tr>
+
+    <tr>
+      <td>F</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>F</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>F (variance-ratio)</td>
+    </tr>
+
+    <tr>
+      <td>t</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>t</td>
+
+      <td>-</td>
+
+      <td>-</td>
+
+      <td>t</td>
+    </tr>
+  </table>
+
+  <h3>J. Taxonomy of Concepts</h3>All of the engines support the number
+  generator requirements, i.e. they are zero-argument function objects which
+  return numbers. All of the distributions are one-argument function objects,
+  taking a reference to an engine and returning numbers. All of the engines
+  and some of the distributions return uniformly distributed random numbers.
+  This is reflected in the concept of the uniform random number generator,
+  which refines number generator. Engines for pseudo-random numbers model the
+  requirements for pseudo-random number engine, which refines uniform random
+  number generator.
+  <pre>
 NumberGenerator ---- UniformRandomNumberGenerator ---- PseudoRandomNumberGenerator
                 \--- RandomDistribution
 </pre>
 
+  <h3>K. Validation</h3>How can a user have confidence that the
+  implementation of a random-number engine is exactly as specified, correctly
+  taking into account any platform pecularities (e.g., odd-sized ints)? After
+  all, minor typos in the implementation might not be apparent; the numbers
+  produced may look "random". This proposal therefore specifies for each
+  engine the 10000th number in the random number sequence that a
+  default-constructed engine object produces.
 
-<h3>K. Validation</h3>
+  <p>This is considered an important feature for library implementors and
+  serious users to check whether the provided library on the given platform
+  returns the correct numbers. It could be argued that a library implementor
+  should provide a correct implementation of some standard feature in any
+  case.</p>
 
-How can a user have confidence that the implementation of a
-random-number engine is exactly as specified, correctly taking into
-account any platform pecularities (e.g., odd-sized ints)?  After all,
-minor typos in the implementation might not be apparent; the numbers
-produced may look "random".  This proposal therefore specifies for
-each engine the 10000th number in the random number sequence that a
-default-constructed engine object produces.
-<p>
+  <p>No other library I have encountered provides explicit validation values
+  in either their specification or their implementation, although some of
+  them claim to be widely portable.</p>
 
-This is considered an important feature for library implementors and
-serious users to check whether the provided library on the given
-platform returns the correct numbers.  It could be argued that a
-library implementor should provide a correct implementation of some
-standard feature in any case.
-<p>
+  <p>Another design option for validation that was part of early drafts of
+  this proposal is moving the reference number (10000th value in the
+  sequence) from specification space to implementation space, thus providing
+  a <code>validation(x)</code> static member function for each engine that
+  compares the hard-coded 10000th value of the sequence with some
+  user-provided value <code>x</code> presumeably obtained by actually
+  invoking the random-number engine object 10000 times. Due to the
+  template-based design, this amounted to a "val" template value parameter
+  for each engine, and the <code>validation(x)</code> function reduced to the
+  trivial comparison "val == x". Handling validation for floating-point
+  engines required more machinery, because template value parameters cannot
+  be of floating-point type. Also, from a conceptual perspective, it seemed
+  odd to demand a validation decision from the very entitiy which one wanted
+  to validate.</p>
 
-No other library I have encountered provides explicit validation
-values in either their specification or their implementation, although
-some of them claim to be widely portable.
-<p>
+  <h3>L. Non-Volatile Storage of Engine and Distribution
+  State</h3>Pseudo-random number engines and distributions may store their
+  state on a <code>std::ostream</code> in textual form and recover it from an
+  appropriate <code>std::istream</code>. Each engine specifies how its
+  internal state is represented. The specific algorithm of a distribution is
+  left implementation-defined, thus no specifics about the representation of
+  its internal state are given. A store operation must not affect the number
+  sequence produced. It is expected that such external storage happens rarely
+  as opposed to producing random numbers, thus no particular attention to
+  performance is paid.
 
-Another design option for validation that was part of early drafts of
-this proposal is moving the reference number (10000th value in the
-sequence) from specification space to implementation space, thus
-providing a <code>validation(x)</code> static member function for each
-engine that compares the hard-coded 10000th value of the sequence with
-some user-provided value <code>x</code> presumeably obtained by
-actually invoking the random-number engine object 10000 times.  Due to
-the template-based design, this amounted to a "val" template value
-parameter for each engine, and the <code>validation(x)</code> function
-reduced to the trivial comparison "val == x".  Handling validation for
-floating-point engines required more machinery, because template value
-parameters cannot be of floating-point type.  Also, from a conceptual
-perspective, it seemed odd to demand a validation decision from the
-very entitiy which one wanted to validate.
+  <p>Engines and distributions use the usual idioms of
+  <code>operator&lt;&lt;</code> and <code>operator&gt;&gt;</code>. If the
+  user needs additional processing before or after storage on non-volatile
+  media, there is always the option to use a temporary
+  <code>std::stringstream</code>.</p>
 
+  <p>Distributions sometimes store values from their associated source of
+  random numbers across calls to their <code>operator()</code>. For example,
+  a common method for generating normally distributed random numbers is to
+  retrieve two uniformly distributed random numbers and compute two normally
+  distributed random numbers out of them. In order to reset the
+  distribution's random number cache to a defined state, each distribution
+  has a <code>reset</code> member function. It should be called on a
+  distribution whenever its associated engine is exchanged or restored.</p>
 
-<h3>L. Non-Volatile Storage of Engine and Distribution State</h3>
+  <h3>M. Values vs. References</h3>Compounded engines such as
+  <code>shuffle_output</code> and <code>discard_block</code> contain a base
+  engine by value, because compounding is not intended to be used by
+  reference to an existing (re-used) engine object.
 
-Pseudo-random number engines and distributions may store their state on a
-<code>std::ostream</code> in textual form and recover it from an
-appropriate <code>std::istream</code>.  Each engine specifies how its
-internal state is represented.  The specific algorithm of a
-distribution is left implementation-defined, thus no specifics about
-the representation of its internal state are given.  A store operation
-must not affect the number sequence produced.  It is expected
-that such external storage happens rarely as opposed to producing
-random numbers, thus no particular attention to performance is paid.
-<p>
+  <p>The wrapper <code>variate_generator</code> can store engines either by
+  value or by reference, explicitly chosen by the template parameters. This
+  allows to use references to a single engine in several
+  <code>variate_generator</code>, but makes it explicit to the user that he
+  is responsible for the management of the lifetime of the engine.</p>
 
-Engines and distributions use the usual idioms of <code>operator&lt;&lt;</code> and
-<code>operator&gt;&gt;</code>.  If the user needs additional
-processing before or after storage on non-volatile media, there is
-always the option to use a temporary <code>std::stringstream</code>.
-<p>
+  <h3>N. Providing the Probability Density Function in Distributions</h3>Some
+  libraries provide the probability density function of a given distribution
+  as part of that distribution's interface. While this may be useful
+  occasionally, this proposal does not provide for such a feature. One reason
+  is separation of concerns: The distribution class templates might benefit
+  from precomputing large tables of values depending on the distribution
+  parameters, while the computation of the probability density function does
+  not. Also, the function representation is often straightforward, so the
+  user can easily code it himself.
 
-Distributions sometimes store values from their associated source of
-random numbers across calls to their <code>operator()</code>.  For example, a
-common method for generating normally distributed random numbers is to
-retrieve two uniformly distributed random numbers and compute two
-normally distributed random numbers out of them.
-In order to reset the distribution's random number cache to a defined
-state, each distribution has a <code>reset</code> member function.  It
-should be called on a distribution whenever its associated engine is
-exchanged or restored.
+  <h3>O. Implementation-defined behaviour</h3>This proposal specifies
+  implementation-defined behaviour in a number of places. I believe this is
+  unavoidable; this section provides detailed reasoning, including why the
+  implementation is required to document the choice.
 
+  <p>The precise state-holding base data types for the various engines are
+  left implementation-defined, because engines are usually optimized for
+  binary integers with 32 bits of word size. The specification in this
+  proposal cannot foresee whether a 32 bit quantity on the machine is
+  available in C++ as short, int, long, or not at all. It is up to the
+  implementation to decide which data type fits best. The implementation is
+  required to document the choice of data type, so that users can
+  (non-portably) rely on the precise type, for example for further
+  computation. Should the ISO C99 extensions become part of ISO C++, the
+  implementation-defined types could be replaced by e.g.
+  <code>int_least32_t</code>.</p>
 
-<h3>M. Values vs. References</h3>
+  <p>The method how to produce non-deterministic random numbers is considered
+  implementation-defined, because it inherently depends on the implementation
+  and possibly even on the runtime environment: Imagine a platform that has
+  operating system support for randomness collection, e.g. from user
+  keystrokes and Ethernet inter-packet arrival timing (Linux
+  <code>/dev/random</code> does this). If, in some installation, access to
+  the operating system functions providing these services has been
+  restricted, the C++ non-deterministic random number engine has been
+  deprived of its randomness. An implementation is required to document how
+  it obtains the non-deterministic random numbers, because only then can
+  users' confidence in them grow. Confidence is of particular concern in the
+  area of cryptography.</p>
 
-Compounded engines such as <code>shuffle_output</code> and
-<code>discard_block</code> contain a base engine by value, because
-compounding is not intended to be used by reference to an existing
-(re-used) engine object.
-<p>
+  <p>The algorithms how to produce the various distributions are specified as
+  implementation-defined, because there is a vast variety of algorithms known
+  for each distribution. Each has a different trade-off in terms of speed,
+  adaptation to recent computer architectures, and memory use. The
+  implementation is required to document its choice so that the user can
+  judge whether it is acceptable quality-wise.</p>
 
-The wrapper <code>variate_generator</code> can store engines either by
-value or by reference, explicitly chosen by the template parameters.
-This allows to use references to a single engine in several
-<code>variate_generator</code>, but makes it explicit to the user that
-he is responsible for the management of the lifetime of the engine.
+  <h3>P. Lower and upper bounds on UniformRandomNumberGenerator</h3>The
+  member functions <code>min()</code> and <code>max()</code> return the lower
+  and upper bounds of a UniformRandomNumberGenerator. This could be a
+  random-number engine or one of the <code>uniform_int</code> and
+  <code>uniform_real</code> distributions.
 
+  <p>Those bounds are not specified to be tight, because for some engines,
+  the bounds depend on the seeds. The seed can be changed during the lifetime
+  of the engine object, while the values returned by <code>min()</code> and
+  <code>max()</code> are invariant. Therefore, <code>min()</code> and
+  <code>max()</code> must return conservative bounds that are independent of
+  the seed.</p>
 
-<h3>N. Providing the Probability Density Function in Distributions</h3>
+  <h3>Q. With or without manager class</h3>This proposal presents a design
+  with a manager class template, <code>variate_generator</code>, after
+  extensive discussion with some members of the computing division of Fermi
+  National Accelerator Laboratory. User-written and library-provided engines
+  and distributions plug in to the manager class. The approach is remotely
+  similar to the locale design in the standard library, where (user-written)
+  facets plug in to the (library-provided) locale class.
 
-Some libraries provide the probability density function of a given
-distribution as part of that distribution's interface.  While this may
-be useful occasionally, this proposal does not provide for such a
-feature.  One reason is separation of concerns: The distribution class
-templates might benefit from precomputing large tables of values
-depending on the distribution parameters, while the computation of the
-probability density function does not.  Also, the function
-representation is often straightforward, so the user can easily code
-it himself.
+  <p>Earlier versions of this propsoal made (potentially user-written)
+  distributions directly visible to (some other) user that wants to get
+  random numbers distributed accordingly ("client"), there was no additional
+  management layer between the distribution and the client.</p>
 
+  <p>The following additional features could be provided by the management
+  layer:</p>
 
-<h3>O. Implementation-defined behaviour</h3>
+  <ul>
+    <li>The management layer contains an adaptor (to convert the engine's
+    output into the distribution's input) in addition to the engine and the
+    distribution.</li>
 
-This proposal specifies implementation-defined behaviour in a number
-of places.  I believe this is unavoidable; this section provides
-detailed reasoning, including why the implementation is required to
-document the choice.
-<p>
+    <li>Adaptors and distributions do not store state, but instead, in each
+    invocation, consume an arbitrary number of input values and produce a
+    fixed number of output values. The management layer is responsible for
+    connecting the engine - adaptor - distribution chain, invoking each part
+    when more numbers are needed from the next part of the chain.</li>
 
-The precise state-holding base data types for the various engines are
-left implementation-defined, because engines are usually optimized for
-binary integers with 32 bits of word size.  The specification in this
-proposal cannot foresee whether a 32 bit quantity on the machine is
-available in C++ as short, int, long, or not at all.  It is up to the
-implementation to decide which data type fits best.  The
-implementation is required to document the choice of data type, so
-that users can (non-portably) rely on the precise type, for example
-for further computation.  Should the ISO C99 extensions become part of
-ISO C++, the implementation-defined types could be replaced by
-e.g. <code>int_least32_t</code>.
-<p>
+    <li>On request, the management layer is responsible for saving and
+    restoring the buffers that exist between engine, adaptor, and
+    distribution.</li>
 
-The method how to produce non-deterministic random numbers is
-considered implementation-defined, because it inherently depends on
-the implementation and possibly even on the runtime environment:
-Imagine a platform that has operating system support for randomness
-collection, e.g. from user keystrokes and Ethernet inter-packet
-arrival timing (Linux <code>/dev/random</code> does this).  If, in some
-installation, access to the operating system functions providing these
-services has been restricted, the C++ non-deterministic random number
-engine has been deprived of its randomness.  An implementation is
-required to document how it obtains the non-deterministic random
-numbers, because only then can users' confidence in them grow.
-Confidence is of particular concern in the area of cryptography.
-<p>
+    <li>On request, the management layer shares engines with another instance
+    of the management layer.</li>
+  </ul>It is envisioned that user-written distributions will often be based
+  on some arbitrary algorithmic distribution, instead of trying to implement
+  a given mathematical probability density function. Here is an example:
 
-The algorithms how to produce the various distributions are specified
-as implementation-defined, because there is a vast variety of
-algorithms known for each distribution.  Each has a different
-trade-off in terms of speed, adaptation to recent computer
-architectures, and memory use.  The implementation is required to
-document its choice so that the user can judge whether it is
-acceptable quality-wise.
+  <ul>
+    <li>Retrieve a uniform integer with value either 1 or 2.</li>
 
+    <li>If 1, return a number with normal distribution.</li>
 
-<h3>P. Lower and upper bounds on UniformRandomNumberGenerator</h3>
+    <li>If 2, return a number with gamma distribution.</li>
+  </ul>Both in this case and when implementing complex distributions based on
+  a probability density function (e.g. the gamma distribution), it is
+  important to be able to arbitrarily nest distributions. Either design
+  allows for this with utmost ease: Compounding distributions are contained
+  in the compound by value, and each one produces a single value on
+  invocation. With the alternative design of giving distributions the freedom
+  to produce more than one output number in each invocation, compound
+  distributions such as the one shown above need to handle the situation that
+  each of the compounding members could provide several output values, the
+  number of which is unknown at the time the distribution is written.
+  (Remember that it is unfeasible to prescribe a precise algorithm for each
+  library-provided distribution in the standard, see subsection O.) That
+  approach shifts implementation effort from the place where it came up, i.e.
+  the distribution that chose to use an algorithm that produces several
+  values in one invocation, to the places where that distribution is used.
+  This, considered by itself, does not seem to be a good approach. Also, only
+  very few distributions lead to a natural implementation that produces
+  several values in one invocation; so far, the normal distribution is the
+  only one known to me. However, it is expected that there will be plenty of
+  distributions that use a normal distribution as its base, so far those
+  known to me are lognormal and uniform_on_sphere (both not part of this
+  proposal). As a conclusion, independent of whether the design provides for
+  a management layer or not, distributions should always return a single
+  value on each invocation, and management of buffers for additional values
+  that might be produced should be internal to the distribution. Should it
+  become necessary for the user to employ buffer management more often, a
+  user-written base class for the distributions could be of help.
 
-The member functions <code>min()</code> and <code>max()</code> return
-the lower and upper bounds of a UniformRandomNumberGenerator.  This
-could be a random-number engine or one of the <code>uniform_int</code>
-and <code>uniform_real</code> distributions.
-<p>
+  <p>The ability to share engines is important. This proposal makes lifetime
+  management issues explicit by requiring pointer or reference types in the
+  template instantiation of <code>variate_generator</code> if reference
+  semantics are desired. Without a management class, providing this features
+  is much more cumbersome and imposes additional burden on the programmers
+  that produce distributions. Alternatively, reference semantics could always
+  be used, but this is an error-prone approach due to the lack of a standard
+  reference-counted smart pointer. I believe it is impossible to add a
+  reference-counted sharing mechanism in a manager-class-free design without
+  giving its precise type. And that would certainly conflict in semantic
+  scope with a smart pointer that will get into the standard eventually.</p>
 
-Those bounds are not specified to be tight, because for some engines,
-the bounds depend on the seeds.  The seed can be changed during the
-lifetime of the engine object, while the values returned by
-<code>min()</code> and <code>max()</code> are invariant.  Therefore,
-<code>min()</code> and <code>max()</code> must return conservative
-bounds that are independent of the seed.
+  <p>The management layer allows for a few common features to be factored
+  out, in particular access to the engine and some member typedefs.</p>
 
+  <p>Comparison of other differing features between manager and non-manager
+  designs:</p>
 
-<h3>Q. With or without manager class</h3>
+  <ul>
+    <li>When passing a <code>variate_generator</code> as a an argument to a
+    function, the design in this proposal allows selecting only those
+    function signatures during overload resolution that are intended to be
+    called with a <code>variate_generator</code>. In contrast, misbehaviour
+    is possible without a manager class, similar to iterators in function
+    signatures: <code>template&lt;class BiIter&gt; void f(BiIter it)</code>
+    matches <code>f(5)</code>, without regard to the bidirectional iterator
+    requirements. An error then happens when instantiating f. The situation
+    worsens when several competing function templates are available and the
+    wrong one is chosen accidentally.</li>
 
-This proposal presents a design with a manager class template,
-<code>variate_generator</code>, after extensive discussion with some
-members of the computing division of Fermi National Accelerator
-Laboratory.  User-written and library-provided engines and
-distributions plug in to the manager class.  The approach is remotely
-similar to the locale design in the standard library, where
-(user-written) facets plug in to the (library-provided) locale class.
-<p>
+    <li>With the engine passed into the distribution's constructor, the full
+    type hierarchy of engine (and possibly adaptor) are available to the
+    distribution, allowing to cache information derived from the engine (e.g.
+    its value range) . Also, (partial) specialization of distributions could
+    be written that optimize the interaction with a specific engine and/or
+    adaptor. In this proposal's design, this information is available in the
+    <code>variate_generator</code> template only. However, optimizations by
+    specialization for the engine/adaptor combination are perceived to
+    possibly have high benefit, while those for the (engine+adaptor) /
+    distribution combination are presumed to be much less beneficial.</li>
 
-Earlier versions of this propsoal made (potentially user-written)
-distributions directly visible to (some other) user that wants to get
-random numbers distributed accordingly ("client"), there was no
-additional management layer between the distribution and the client.
-<p>
+    <li>Having distribution classes directly exposed to the client easily
+    allows that the user writes a distribution with an additional arbitrary
+    member function declaration, intended to produce random numbers while
+    taking additional parameters into account. In this proposal's design,
+    this is possible by using the generic <code>operator()(T x)</code>
+    forwarding function.</li>
+  </ul>
 
-The following additional features could be provided by the management
-layer:
+  <h3>R. Add-on packages</h3>This proposal specifies a framework for random
+  number generation. Users might have additional requirements not met by this
+  framework. The following extensions have been identified, and they are
+  expressly not addressed in this proposal. It is perceived that these items
+  can be seamlessly implemented in an add-on package which sits on top of an
+  implementation according to this proposal.
 
-<ul>
-<li>The management layer contains an adaptor (to convert the engine's
-output into the distribution's input) in addition to the engine and
-the distribution.</li>
+  <ul>
+    <li>unique seeding: Make it easy for the user to provide a unique seed
+    for each instance of a pseudo-random number engine. Design idea:
+      <pre>
+  class unique_seed;
 
-<li>Adaptors and distributions do not store state, but instead, in
-each invocation, consume an arbitrary number of input values and
-produce a fixed number of output values.  The management layer is
-responsible for connecting the engine - adaptor - distribution chain,
-invoking each part when more numbers are needed from the next part of
-the chain.
+  template&lt;class Engine&gt;
+  Engine seed(unique_seed&amp;);
+</pre>The "seed" function retrieves some unique seed from the unique_seed
+class and then uses the <code>seed(first, last)</code> interface of an engine
+to implant that unique seed. Specific seeding requirements for some engine
+can be met by (partial) template specialization.
+    </li>
 
-<li>On request, the management layer is responsible for saving and
-restoring the buffers that exist between engine, adaptor, and
-distribution.</li>
+    <li>runtime-replaceable distributions and associated save/restore
+    functionality: Provide a class hierarchy that invokes distributions by
+    means of a virtual function, thereby allowing for runtime replacement of
+    the actual distribution. Provide a factory function to reconstruct the
+    distribution instance after saving it to some non-volatile media.</li>
+  </ul>
 
-<li>On request, the management layer shares engines with another
-instance of the management layer.</li>
+  <h3>S. Adaptors</h3>Sometimes, users may want to have better control how
+  the bits from the engine are used to fill the mantissa of the
+  floating-point value that serves as input to some distribution. This is
+  possible by writing an engine wrapper and passing that in to the
+  <code>variate_generator</code> as the engine. The
+  <code>variate_generator</code> will only apply automatic adaptations if the
+  output type of the engine is integers and the input type for the
+  distribution is floating-point or vice versa.
 
-</ul>
+  <h3>Z. Open issues</h3>
 
-It is envisioned that user-written distributions will often be based
-on some arbitrary algorithmic distribution, instead of trying to
-implement a given mathematical probability density function.  Here is
-an example:
-<ul>
-<li>Retrieve a uniform integer with value either 1 or 2.
-<li>If 1, return a number with normal distribution.
-<li>If 2, return a number with gamma distribution.
-</ul>
+  <ul>
+    <li>Some engines require non-negative template arguments, usually bit
+    counts. Should these be given as "int" or "unsigned int"? Using "unsigned
+    int" sometimes adds significant clutter to the presentation. Or "size_t",
+    but this is probably too large a type?</li>
+  </ul>
 
-Both in this case and when implementing complex distributions based on
-a probability density function (e.g. the gamma distribution), it is
-important to be able to arbitrarily nest distributions.  Either design
-allows for this with utmost ease: Compounding
-distributions are contained in the compound by value, and each one
-produces a single value on invocation.  With the alternative design of
-giving distributions the freedom to produce
-more than one output number in each invocation, compound distributions
-such as the one shown above need to handle the situation that each of
-the compounding members could provide several output values, the
-number of which is unknown at the time the distribution is written.
-(Remember that it is unfeasible to prescribe a precise algorithm for
-each library-provided distribution in the standard, see subsection O.)
-That approach shifts implementation effort from the place where it
-came up, i.e. the distribution that chose to use an algorithm that
-produces several values in one invocation, to the places where that
-distribution is used.  This, considered by itself, does not seem to be
-a good approach.  Also, only very few distributions lead to a natural
-implementation that produces several values in one invocation; so far,
-the normal distribution is the only one known to me.  However, it is
-expected that there will be plenty of distributions that use a normal
-distribution as its base, so far those known to me are lognormal and
-uniform_on_sphere (both not part of this proposal).  As a conclusion,
-independent of whether the design provides for a management layer or
-not, distributions should always return a single value on each
-invocation, and management of buffers for additional values that might
-be produced should be internal to the distribution.  Should it become
-necessary for the user to employ buffer management more often, a
-user-written base class for the distributions could be of help.
-<p>
+  <h2>IV. Proposed Text</h2>(Insert the following as a new section in clause
+  26 "Numerics". Adjust the overview at the beginning of clause 26
+  accordingly.)
 
-The ability to share engines is important.  This proposal makes
-lifetime management issues explicit by requiring pointer or reference
-types in the template instantiation of <code>variate_generator</code> 
-if reference semantics are
-desired.   Without a management class, providing this features is
-much more cumbersome and imposes additional burden on the programmers
-that produce distributions.  Alternatively, reference semantics could
-always be used, but this is an
-error-prone approach due to the lack of a standard reference-counted
-smart pointer.  I believe it is impossible to add a reference-counted
-sharing mechanism in a manager-class-free design without giving its precise
-type.  And that would certainly conflict in semantic scope with a
-smart pointer that will get into the standard eventually.  
-<p>
+  <p>This subclause defines a facility for generating random numbers.</p>
 
-The management layer allows for a few common features to be factored
-out, in particular access to the engine and some member typedefs.
-<p>
+  <h3>Random number requirements</h3>A number generator is a function object
+  (std:20.3 [lib.function.objects]).
 
-Comparison of other differing features between manager and non-manager
-designs:
+  <p>In the following table, <code>X</code> denotes a number generator class
+  returning objects of type <code>T</code>, and <code>u</code> is a (possibly
+  <code>const</code>) value of <code>X</code>.</p>
 
-<ul>
-<li>When passing a <code>variate_generator</code> as a an argument to
-a function, the design in this proposal allows selecting only those
-function signatures during overload resolution that are intended to be
-called with a <code>variate_generator</code>.  In contrast,
-misbehaviour is possible without a manager class, similar to
-iterators in function signatures: <code>template&lt;class BiIter&gt;
-void f(BiIter it)</code> matches <code>f(5)</code>, without regard to
-the bidirectional iterator requirements.  An error then happens when
-instantiating f.  The situation worsens when several competing
-function templates are available and the wrong one is chosen
-accidentally.
+  <table border="1" summary="">
+    <tr>
+      <th colspan="4" align="center">Number generator requirements (in
+      addition to function object)</th>
+    </tr>
 
-<li>With the engine passed into the distribution's constructor, the
-full type hierarchy of engine (and possibly adaptor) are available to
-the distribution, allowing to cache information derived from the
-engine (e.g. its value range) .  Also, (partial) specialization
-of distributions could be written that optimize the interaction with a
-specific engine and/or adaptor.  In this proposal's design,
-this information is available in the <code>variate_generator</code> template
-only.  However, optimizations by specialization for the
-engine/adaptor combination are perceived to possibly have high
-benefit, while those for the (engine+adaptor) / distribution
-combination are presumed to be much less beneficial.
+    <tr>
+      <td>expression</td>
 
-<li>Having distribution classes directly exposed to the client easily
-allows that the user writes a distribution with an additional
-arbitrary member function declaration, intended to produce random
-numbers while taking additional parameters into account.  In this
-proposal's design, this is possible by using the
-generic <code>operator()(T x)</code> forwarding function.
+      <td>return&nbsp;type</td>
 
-</ul>
+      <td>pre/post-condition</td>
 
+      <td>complexity</td>
+    </tr>
 
-<h3>R. Add-on packages</h3>
+    <tr>
+      <td><code>X::result_type</code></td>
 
-This proposal specifies a framework for random number generation.
-Users might have additional requirements not met by this framework.
-The following extensions have been identified, and they are expressly not
-addressed in this proposal.  It is perceived that these items can be
-seamlessly implemented in an add-on package which sits on top of an
-implementation according to this proposal.
+      <td>T</td>
 
-<ul>
-<li>unique seeding: Make it easy for the user to provide a unique seed
-for each instance of a pseudo-random number engine.  Design idea:
-<pre>
-  class unique_seed;
+      <td><code>std::numeric_limits&lt;T&gt;::is_specialized</code> is
+      <code>true</code></td>
 
-  template&lt;class Engine&gt;
-  Engine seed(unique_seed&);
-</pre>
-The "seed" function retrieves some unique seed from the unique_seed
-class and then uses the <code>seed(first, last)</code> interface of an
-engine to implant that unique seed.  Specific seeding requirements for
-some engine can be met by (partial) template specialization.</li>
-<p>
+      <td>compile-time</td>
+    </tr>
+  </table>
 
-<li>runtime-replaceable distributions and associated save/restore
-functionality: Provide a class hierarchy that invokes distributions by
-means of a virtual function, thereby allowing for runtime replacement
-of the actual distribution.  Provide a factory function to reconstruct
-the distribution instance after saving it to some non-volatile media.
+  <p>In the following table, <code>X</code> denotes a uniform random number
+  generator class returning objects of type <code>T</code>, <code>u</code> is
+  a value of <code>X</code> and <code>v</code> is a (possibly
+  <code>const</code>) value of <code>X</code>.</p>
 
-</ul>
+  <table border="1" summary="">
+    <tr>
+      <th colspan="4" align="center">Uniform random number generator
+      requirements (in addition to number generator)</th>
+    </tr>
 
+    <tr>
+      <td>expression</td>
 
-<h3>S. Adaptors</h3>
+      <td>return&nbsp;type</td>
 
-Sometimes, users may want to have better control how the bits from the
-engine are used to fill the mantissa of the floating-point value that
-serves as input to some distribution.  This is possible by writing an
-engine wrapper and passing that in to the <code>variate_generator</code> as the
-engine.  The <code>variate_generator</code> will only apply automatic adaptations
-if the output type of the engine is integers and the input type for
-the distribution is floating-point or vice versa.
+      <td>pre/post-condition</td>
 
+      <td>complexity</td>
+    </tr>
 
-<h3>Z. Open issues</h3>
+    <tr>
+      <td><code>u()</code></td>
 
-<ul>
-<li>Some engines require non-negative template arguments, usually bit
-counts.  Should these be given as "int" or "unsigned int"?  Using
-"unsigned int" sometimes adds significant clutter to the
-presentation.  Or "size_t", but this is probably too large a type?</li>
+      <td>T</td>
 
-</ul>
+      <td>-</td>
 
+      <td>amortized constant</td>
+    </tr>
 
+    <tr>
+      <td><code>v.min()</code></td>
 
-<h2>IV. Proposed Text</h2>
+      <td><code>T</code></td>
 
-(Insert the following as a new section in clause 26 "Numerics".
-Adjust the overview at the beginning of clause 26 accordingly.)
-<p>
+      <td>Returns some l where l is less than or equal to all values
+      potentially returned by <code>operator()</code>. The return value of
+      this function shall not change during the lifetime of
+      <code>v</code>.</td>
 
-This subclause defines a facility for generating random numbers.
+      <td>constant</td>
+    </tr>
 
+    <tr>
+      <td><code>v.max()</code></td>
 
-<h3>Random number requirements</h3>
+      <td><code>T</code></td>
 
-A number generator is a function object (std:20.3
-[lib.function.objects]).
-<p>
+      <td>If <code>std::numeric_limits&lt;T&gt;::is_integer</code>, returns l
+      where l is less than or equal to all values potentially returned by
+      <code>operator()</code>, otherwise, returns l where l is strictly less
+      than all values potentially returned by <code>operator()</code>. In any
+      case, the return value of this function shall not change during the
+      lifetime of <code>v</code>.</td>
 
-In the following table, <code>X</code> denotes a number generator
-class returning objects of type <code>T</code>, and <code>u</code> is
-a (possibly <code>const</code>) value of <code>X</code>.
-<p>
+      <td>constant</td>
+    </tr>
+  </table>
 
-<table border=1>
-<tr>
-<th colspan=4 align=center>Number generator requirements (in addition
-to function object)</th>
-</tr>
+  <p>In the following table, <code>X</code> denotes a pseudo-random number
+  engine class returning objects of type <code>T</code>, <code>t</code> is a
+  value of <code>T</code>, <code>u</code> is a value of <code>X</code>,
+  <code>v</code> is an lvalue of <code>X</code>, <code>it1</code> is an
+  lvalue and <code>it2</code> is a (possibly <code>const</code>) value of an
+  input iterator type <code>It</code> having an unsigned integral value type,
+  <code>x</code>, <code>y</code> are (possibly <code>const</code>) values of
+  <code>X</code>, <code>os</code> is convertible to an lvalue of type
+  <code>std::ostream</code>, and <code>is</code> is convertible to an lvalue
+  of type <code>std::istream</code>.</p>
 
-<tr>
-<td>expression</td>
-<td>return&nbsp;type</td>
-<td>pre/post-condition</td>
-<td>complexity</td>
-</tr>
+  <p>A pseudo-random number engine x has a state x(i) at any given time. The
+  specification of each pseudo-random number engines defines the size of its
+  state in multiples of the size of its <code>result_type</code>, given as an
+  integral constant expression.</p>
 
-<tr>
-<td><code>X::result_type</code></td>
-<td>T</td>
-<td><code>std::numeric_limits&lt;T&gt;::is_specialized</code> is
-<code>true</code></td>
-<td>compile-time</td>
-</tr>
+  <table border="1" summary="">
+    <tr>
+      <th colspan="4" align="center">Pseudo-random number engine requirements
+      (in addition to uniform random number generator,
+      <code>CopyConstructible</code>, and <code>Assignable</code>)</th>
+    </tr>
 
-</table>
-<p>
+    <tr>
+      <td>expression</td>
 
-In the following table, <code>X</code> denotes a uniform random number
-generator class returning objects of type <code>T</code>,
-<code>u</code> is a value of <code>X</code> and <code>v</code> is a
-(possibly <code>const</code>) value of <code>X</code>.
-<p>
+      <td>return&nbsp;type</td>
 
-<table border=1>
-<tr>
-<th colspan=4 align=center>Uniform random number generator
-requirements (in addition to number generator)</th>
-</tr>
+      <td>pre/post-condition</td>
 
-<tr>
-<td>expression</td>
-<td>return&nbsp;type</td>
-<td>pre/post-condition</td>
-<td>complexity</td>
-</tr>
+      <td>complexity</td>
+    </tr>
 
-<tr>
-<td><code>u()</code></td>
-<td>T</td>
-<td>-</td>
-<td>amortized constant</td>
-</tr>
+    <tr>
+      <td><code>X()</code></td>
 
-<tr>
-<td><code>v.min()</code></td>
-<td><code>T</code></td>
-<td>Returns some l where l is less than or equal to all values
-potentially returned by <code>operator()</code>.
-The return value of this function shall not change during the lifetime
-of <code>v</code>.</td>
-<td>constant</td>
-</tr>
+      <td>-</td>
 
-<tr>
-<td><code>v.max()</code></td>
-<td><code>T</code></td>
-<td>If <code>std::numeric_limits&lt;T&gt;::is_integer</code>, returns
-l where l is less than or equal to all values potentially returned by
-<code>operator()</code>, otherwise, returns l where l is strictly less than all
-values potentially returned by <code>operator()</code>.  In any case,
-the return value of this function shall not change during the lifetime
-of <code>v</code>.</td>
-<td>constant</td>
-</tr>
+      <td>creates an engine with the same initial state as all other
+      default-constructed engines of type <code>X</code> in the program.</td>
 
-</table>
+      <td>O(size of state)</td>
+    </tr>
 
-<p>
-In the following table, <code>X</code> denotes a pseudo-random number
-engine class returning objects of type <code>T</code>, <code>t</code>
-is a value of <code>T</code>, <code>u</code> is a value of
-<code>X</code>, <code>v</code> is an lvalue of <code>X</code>,
-<code>it1</code> is an lvalue and <code>it2</code> is a (possibly
-<code>const</code>) value of an input iterator type <code>It</code>
-having an unsigned integral value type, <code>x</code>, <code>y</code>
-are (possibly <code>const</code>) values of
-<code>X</code>, <code>os</code> is convertible to an lvalue of type
-<code>std::ostream</code>, and <code>is</code> is convertible to an
-lvalue of type <code>std::istream</code>.
-<p>
-A pseudo-random number engine x has a state x(i) at any given time.
-The specification of each pseudo-random number engines defines the size of its
-state in multiples of the size of its <code>result_type</code>, given
-as an integral constant expression.
-<p>
+    <tr>
+      <td><code>X(it1, it2)</code></td>
 
-<table border=1>
-<tr>
-<th colspan=4 align=center>Pseudo-random number engine requirements
-(in addition to uniform random number generator,
-<code>CopyConstructible</code>, and <code>Assignable</code>)</th>
-<tr><td>expression</td><td>return&nbsp;type</td>
-<td>pre/post-condition</td>
-<td>complexity</td>
-</tr>
+      <td>-</td>
 
-<tr>
-<td><code>X()</code></td>
-<td>-</td>
-<td>creates an engine with the same initial state as all other
-default-constructed engines of type <code>X</code> in the
-program.</td>
-<td>O(size of state)</td>
-</tr>
+      <td>creates an engine with the initial state given by the range
+      <code>[it1,it2)</code>. <code>it1</code> is advanced by the size of
+      state. If the size of the range [it1,it2) is insufficient, leaves
+      <code>it1 == it2</code> and throws <code>invalid_argument</code>.</td>
 
-<tr>
-<td><code>X(it1, it2)</code></td>
-<td>-</td>
-<td>creates an engine with the initial state given by the range
-<code>[it1,it2)</code>.  <code>it1</code> is advanced by the size of
-state.  If the size of the range [it1,it2) is insufficient, leaves 
-<code>it1 == it2</code> and throws <code>invalid_argument</code>.</td>
-<td>O(size of state)</td>
-</tr>
+      <td>O(size of state)</td>
+    </tr>
 
-<tr>
-<td><code>u.seed()</code></td>
-<td>void</td>
-<td>post: <code>u == X()</code></td>
-<td>O(size of state)</td>
-</tr>
+    <tr>
+      <td><code>u.seed()</code></td>
 
-<tr>
-<td><code>u.seed(it1, it2)</code></td>
-<td>void</td>
-<td>post: If there are sufficiently many values in [it1, it2) to
-initialize the state of <code>u</code>, then <code>u ==
-X(it1,it2)</code>.  Otherwise, <code>it1 == it2</code>, throws
-<code>invalid_argument</code>, and further use of <code>u</code>
-(except destruction) is undefined until a <code>seed</code> member
-function has been executed without throwing an exception.</td>
-<td>O(size of state)</td>
-</tr>
+      <td>void</td>
 
-<tr>
-<td><code>u()</code></td>
-<td><code>T</code>
-<td>given the state u(i) of the engine, computes u(i+1), sets the
-state to u(i+1), and returns some output dependent on u(i+1)</td>
-<td>amortized constant</td>
-</tr>
+      <td>post: <code>u == X()</code></td>
 
-<tr>
-<td><code>x == y</code></td>
-<td><code>bool</code></td>
-<td><code>==</code> is an equivalence relation. The current state x(i)
-of x is equal to the current state y(j) of y.</td>
-<td>O(size of state)</td>
-</tr>
+      <td>O(size of state)</td>
+    </tr>
 
-<tr>
-<td><code>x != y</code></td>
-<td><code>bool</code></td>
-<td><code>!(x == y)</code></td>
-<td>O(size of state)</td>
-</tr>
+    <tr>
+      <td><code>u.seed(it1, it2)</code></td>
 
-<tr>
-<td><code>os &lt;&lt; x</code></td>
-<td><code>std::ostream&</code></td>
-<td>writes the textual representation of the state x(i) of
-<code>x</code> to <code>os</code>, with
-<code>os.<em>fmtflags</em></code> set to
-<code>ios_base::dec|ios_base::fixed|ios_base::left</code> and the fill
-character set to the space character.  In the output, adjacent numbers
-are separated by one or more space characters.
-<br>
-post: The <code>os.<em>fmtflags</em></code> and fill character are
-unchanged. </td>
-<td>O(size of state)</td>
-</tr>
+      <td>void</td>
 
-<tr>
-<td><code>is &gt;&gt; v</code></td>
-<td><code>std::istream&</code></td>
-<td>sets the state v(i) of <code>v</code> as determined by reading its
-textual representation from <code>is</code>.
-<br>
-post: The <code>is.<em>fmtflags</em></code> are unchanged.</td>
-<td>O(size of state)</td>
-</tr>
+      <td>post: If there are sufficiently many values in [it1, it2) to
+      initialize the state of <code>u</code>, then <code>u ==
+      X(it1,it2)</code>. Otherwise, <code>it1 == it2</code>, throws
+      <code>invalid_argument</code>, and further use of <code>u</code>
+      (except destruction) is undefined until a <code>seed</code> member
+      function has been executed without throwing an exception.</td>
 
-</table>
-<p>
+      <td>O(size of state)</td>
+    </tr>
 
-In the following table, <code>X</code> denotes a random distribution
-class returning objects of type <code>T</code>, <code>u</code> is a
-value of <code>X</code>, <code>x</code> is a (possibly const)
-value of <code>X</code>, and <code>e</code> is an lvalue of an
-arbitrary type that meets the requirements of a uniform random number
-generator, returning values of type <code>U</code>.
-<p>
+    <tr>
+      <td><code>u()</code></td>
 
-<table border=1>
-<tr>
-<th colspan=4 align=center>Random distribution requirements
-(in addition to number generator,
-<code>CopyConstructible</code>, and <code>Assignable</code>)</th>
-<tr><td>expression</td><td>return&nbsp;type</td>
-<td>pre/post-condition</td>
-<td>complexity</td>
-</tr>
+      <td><code>T</code></td>
 
-<tr>
-<td><code>X::input_type</code></td>
-<td>U</td>
-<td>-</td>
-<td>compile-time</td>
-</tr>
+      <td>given the state u(i) of the engine, computes u(i+1), sets the state
+      to u(i+1), and returns some output dependent on u(i+1)</td>
 
-<tr>
-<td><code>u.reset()</code></td>
-<td><code>void</code></td>
-<td>subsequent uses of <code>u</code> do not depend on values
-produced by <code>e</code> prior to invoking <code>reset</code>.</td>
-<td>constant</td>
-</tr>
+      <td>amortized constant</td>
+    </tr>
 
-<tr>
-<td><code>u(e)</code></td>
-<td><code>T</code></td>
-<td>the sequence of numbers returned by successive invocations with
-the same object <code>e</code> is randomly distributed with some
-probability density function p(x)</td>
-<td>amortized constant number of invocations of <code>e</code></td>
-</tr>
+    <tr>
+      <td><code>x == y</code></td>
 
-<tr>
-<td><code>os &lt;&lt; x</code></td>
-<td><code>std::ostream&</code></td>
-<td>writes a textual representation for the parameters and additional
-internal data of the distribution <code>x</code> to <code>os</code>.
-<br>
-post: The <code>os.<em>fmtflags</em></code> and fill character are
-unchanged.</td>
-<td>O(size of state)</td>
-</tr>
+      <td><code>bool</code></td>
 
-<tr>
-<td><code>is &gt;&gt; u</code></td>
-<td><code>std::istream&</code></td>
-<td>restores the parameters and additional internal data of the
-distribution <code>u</code>.
-<br>
-pre: <code>is</code> provides a textual representation that was
-previously written by <code>operator&lt;&lt;</code>
-<br>
-post: The <code>is.<em>fmtflags</em></code> are unchanged.</td>
-<td>O(size of state)</td>
-</tr>
+      <td><code>==</code> is an equivalence relation. The current state x(i)
+      of x is equal to the current state y(j) of y.</td>
 
-</table>
-<p>
+      <td>O(size of state)</td>
+    </tr>
 
-Additional requirements:   The sequence of numbers produced by
-repeated invocations of <code>x(e)</code> does not change whether or
-not <code>os &lt;&lt; x</code> is invoked between any of the
-invocations <code>x(e)</code>.   If a textual representation
-is written using <code>os &lt;&lt; x</code> and that representation
-is restored into the same or a different object <code>y</code> of the
-same type using <code>is &gt;&gt; y</code>, repeated invocations of
-<code>y(e)</code> produce the same sequence of random numbers as would
-repeated invocations of <code>x(e)</code>.
-<p>
+    <tr>
+      <td><code>x != y</code></td>
 
-In the following subclauses, a template parameter named
-<code>UniformRandomNumberGenerator</code> shall denote a class that
-satisfies all the requirements of a uniform random number generator.
-Moreover, a template parameter named <code>Distribution</code> shall
-denote a type that satisfies all the requirements of a random
-distribution.
-Furthermore, a template parameter named <code>RealType</code> shall
-denote a type that holds an approximation to a real number.  This type
-shall meet the requirements for a numeric type (26.1
-[lib.numeric.requirements]), the binary operators +, -, *, / shall be
-applicable to it, a conversion from <code>double</code> shall exist,
-and function signatures corresponding to those
-for type <code>double</code> in subclause 26.5 [lib.c.math] shall be
-available by argument-dependent lookup (3.4.2 [basic.lookup.koenig]).
-<em>[Note: The built-in floating-point types <code>float</code>
-and <code>double</code> meet these requirements.]</em>
+      <td><code>bool</code></td>
 
+      <td><code>!(x == y)</code></td>
 
-<h3>Header <code>&lt;random&gt;</code> synopsis</h3>
+      <td>O(size of state)</td>
+    </tr>
 
-<pre>
+    <tr>
+      <td><code>os &lt;&lt; x</code></td>
+
+      <td><code>std::ostream&amp;</code></td>
+
+      <td>writes the textual representation of the state x(i) of
+      <code>x</code> to <code>os</code>, with
+      <code>os.<em>fmtflags</em></code> set to
+      <code>ios_base::dec|ios_base::fixed|ios_base::left</code> and the fill
+      character set to the space character. In the output, adjacent numbers
+      are separated by one or more space characters.<br>
+      post: The <code>os.<em>fmtflags</em></code> and fill character are
+      unchanged.</td>
+
+      <td>O(size of state)</td>
+    </tr>
+
+    <tr>
+      <td><code>is &gt;&gt; v</code></td>
+
+      <td><code>std::istream&amp;</code></td>
+
+      <td>sets the state v(i) of <code>v</code> as determined by reading its
+      textual representation from <code>is</code>.<br>
+      post: The <code>is.<em>fmtflags</em></code> are unchanged.</td>
+
+      <td>O(size of state)</td>
+    </tr>
+  </table>
+
+  <p>In the following table, <code>X</code> denotes a random distribution
+  class returning objects of type <code>T</code>, <code>u</code> is a value
+  of <code>X</code>, <code>x</code> is a (possibly const) value of
+  <code>X</code>, and <code>e</code> is an lvalue of an arbitrary type that
+  meets the requirements of a uniform random number generator, returning
+  values of type <code>U</code>.</p>
+
+  <table border="1" summary="">
+    <tr>
+      <th colspan="4" align="center">Random distribution requirements (in
+      addition to number generator, <code>CopyConstructible</code>, and
+      <code>Assignable</code>)</th>
+    </tr>
+
+    <tr>
+      <td>expression</td>
+
+      <td>return&nbsp;type</td>
+
+      <td>pre/post-condition</td>
+
+      <td>complexity</td>
+    </tr>
+
+    <tr>
+      <td><code>X::input_type</code></td>
+
+      <td>U</td>
+
+      <td>-</td>
+
+      <td>compile-time</td>
+    </tr>
+
+    <tr>
+      <td><code>u.reset()</code></td>
+
+      <td><code>void</code></td>
+
+      <td>subsequent uses of <code>u</code> do not depend on values produced
+      by <code>e</code> prior to invoking <code>reset</code>.</td>
+
+      <td>constant</td>
+    </tr>
+
+    <tr>
+      <td><code>u(e)</code></td>
+
+      <td><code>T</code></td>
+
+      <td>the sequence of numbers returned by successive invocations with the
+      same object <code>e</code> is randomly distributed with some
+      probability density function p(x)</td>
+
+      <td>amortized constant number of invocations of <code>e</code></td>
+    </tr>
+
+    <tr>
+      <td><code>os &lt;&lt; x</code></td>
+
+      <td><code>std::ostream&amp;</code></td>
+
+      <td>writes a textual representation for the parameters and additional
+      internal data of the distribution <code>x</code> to
+      <code>os</code>.<br>
+      post: The <code>os.<em>fmtflags</em></code> and fill character are
+      unchanged.</td>
+
+      <td>O(size of state)</td>
+    </tr>
+
+    <tr>
+      <td><code>is &gt;&gt; u</code></td>
+
+      <td><code>std::istream&amp;</code></td>
+
+      <td>restores the parameters and additional internal data of the
+      distribution <code>u</code>.<br>
+      pre: <code>is</code> provides a textual representation that was
+      previously written by <code>operator&lt;&lt;</code><br>
+      post: The <code>is.<em>fmtflags</em></code> are unchanged.</td>
+
+      <td>O(size of state)</td>
+    </tr>
+  </table>
+
+  <p>Additional requirements: The sequence of numbers produced by repeated
+  invocations of <code>x(e)</code> does not change whether or not <code>os
+  &lt;&lt; x</code> is invoked between any of the invocations
+  <code>x(e)</code>. If a textual representation is written using <code>os
+  &lt;&lt; x</code> and that representation is restored into the same or a
+  different object <code>y</code> of the same type using <code>is &gt;&gt;
+  y</code>, repeated invocations of <code>y(e)</code> produce the same
+  sequence of random numbers as would repeated invocations of
+  <code>x(e)</code>.</p>
+
+  <p>In the following subclauses, a template parameter named
+  <code>UniformRandomNumberGenerator</code> shall denote a class that
+  satisfies all the requirements of a uniform random number generator.
+  Moreover, a template parameter named <code>Distribution</code> shall denote
+  a type that satisfies all the requirements of a random distribution.
+  Furthermore, a template parameter named <code>RealType</code> shall denote
+  a type that holds an approximation to a real number. This type shall meet
+  the requirements for a numeric type (26.1 [lib.numeric.requirements]), the
+  binary operators +, -, *, / shall be applicable to it, a conversion from
+  <code>double</code> shall exist, and function signatures corresponding to
+  those for type <code>double</code> in subclause 26.5 [lib.c.math] shall be
+  available by argument-dependent lookup (3.4.2 [basic.lookup.koenig]).
+  <em>[Note: The built-in floating-point types <code>float</code> and
+  <code>double</code> meet these requirements.]</em></p>
+
+  <h3>Header <code>&lt;random&gt;</code> synopsis</h3>
+  <pre>
 namespace std {
   template&lt;class UniformRandomNumberGenerator, class Distribution&gt;
   class variate_generator;
@@ -2014,25 +2291,25 @@
 
   class random_device;
 
-  template&lt;class IntType = int>
+  template&lt;class IntType = int&gt;
   class uniform_int;
 
-  template&lt;class RealType = double>
+  template&lt;class RealType = double&gt;
   class bernoulli_distribution;
 
-  template&lt;class IntType = int, class RealType = double>
+  template&lt;class IntType = int, class RealType = double&gt;
   class geometric_distribution;
 
-  template&lt;class IntType = int, class RealType = double>
+  template&lt;class IntType = int, class RealType = double&gt;
   class poisson_distribution;
 
-  template&lt;class IntType = int, class RealType = double>
+  template&lt;class IntType = int, class RealType = double&gt;
   class binomial_distribution;
 
-  template&lt;class RealType = double>
+  template&lt;class RealType = double&gt;
   class uniform_real;
 
-  template&lt;class RealType = double>
+  template&lt;class RealType = double&gt;
   class exponential_distribution;
 
   template&lt;class RealType = double&gt;
@@ -2044,14 +2321,11 @@
 } // namespace std
 </pre>
 
-
-<h3>Class template <code>variate_generator</code></h3>
-
-A <code>variate_generator</code> produces random numbers, drawing
-randomness from an underlying uniform random number generator and
-shaping the distribution of the numbers corresponding to a
-distribution function.
-<pre>
+  <h3>Class template <code>variate_generator</code></h3>A
+  <code>variate_generator</code> produces random numbers, drawing randomness
+  from an underlying uniform random number generator and shaping the
+  distribution of the numbers corresponding to a distribution function.
+  <pre>
 template&lt;class Engine, class Distribution&gt;
 class variate_generator
 {
@@ -2064,134 +2338,114 @@
   variate_generator(engine_type eng, distribution_type d);
 
   result_type operator()();
-  template&lt;class T>  result_type operator()(T value);
+  template&lt;class T&gt;  result_type operator()(T value);
 
-  engine_value_type& engine();
-  const engine_value_type& engine() const;
+  engine_value_type&amp; engine();
+  const engine_value_type&amp; engine() const;
 
-  distribution_type& distribution();
-  const distribution_type& distribution() const;
+  distribution_type&amp; distribution();
+  const distribution_type&amp; distribution() const;
 
   result_type min() const;
   result_type max() const;
 };
-</pre>
+</pre>The template argument for the parameter <code>Engine</code> shall be of
+the form <code><em>U</em></code>, <code><em>U</em>&amp;</code>, or <code><em>
+  U</em>*</code>, where <code><em>U</em></code> denotes a class that
+  satisfies all the requirements of a uniform random number generator. The
+  member <code>engine_value_type</code> shall name <code><em>U</em></code>.
 
-The template argument for the parameter <code>Engine</code> shall be
-of the form <code><em>U</em></code>, <code><em>U</em>&</code>, or
-<code><em>U</em>*</code>, where <code><em>U</em></code> denotes a
-class that satisfies all the requirements of a uniform random number
-generator.  The member <code>engine_value_type</code> shall name
-<code><em>U</em></code>.
-<p>
+  <p>Specializations of <code>variate_generator</code> satisfy the
+  requirements of CopyConstructible. They also satisfy the requirements of
+  Assignable unless the template parameter <code>Engine</code> is of the form
+  <code><em>U</em>&amp;</code>.</p>
 
-Specializations of <code>variate_generator</code> satisfy the
-requirements of CopyConstructible.  They also satisfy the requirements
-of Assignable unless the template parameter <code>Engine</code> is of
-the form <code><em>U</em>&</code>.
-<p>
-
-The complexity of all functions specified in this section is constant.
-No function described in this section except the constructor throws an
-exception.
-<p>
-
-<pre>    variate_generator(engine_type eng, distribution_type d)</pre>
-<strong>Effects:</strong> Constructs a <code>variate_generator</code>
-object with the associated uniform random number generator
-<code>eng</code> and the associated random distribution
-<code>d</code>.
-<br>
-<strong>Throws:</strong> If and what the copy constructor of Engine or
-Distribution throws.
-
-<pre>    result_type operator()()</pre>
-<strong>Returns:</strong> <code>distribution()(e)</code>
-<br>
-<strong>Notes:</strong> The sequence of numbers produced by the
-uniform random number generator <code>e</code>, s<sub>e</sub>, is
-obtained from the sequence of numbers produced by the associated
-uniform random number generator <code>eng</code>, s<sub>eng</sub>, as
-follows: Consider the values of
-<code>numeric_limits&lt;<em>T</em>&gt;::is_integer</code> for
-<code><em>T</em></code> both <code>Distribution::input_type</code> and
-<code>engine_value_type::result_type</code>.  If the values for both
-types are <code>true</code>, then s<sub>e</sub> is identical to
-s<sub>eng</sub>.  Otherwise, if the values for both types are
-<code>false</code>, then the numbers in s<sub>eng</sub> are divided by
-<code>engine().max()-engine().min()</code> to obtain the
-numbers in s<sub>e</sub>.  Otherwise, if the value for
-<code>engine_value_type::result_type</code> is <code>true</code> and
-the value for <code>Distribution::input_type</code> is
-<code>false</code>, then the numbers in s<sub>eng</sub> are divided by
-<code>engine().max()-engine().min()+1</code> to obtain the
-numbers in s<sub>e</sub>.  Otherwise, the mapping from s<sub>eng</sub>
-to s<sub>e</sub> is implementation-defined.  In all cases, an implicit
-conversion from <code>engine_value_type::result_type</code> to
-<code>Distribution::input_type</code> is performed.  If such a
-conversion does not exist, the program is ill-formed.
-
-<pre>    template&lt;class T> result_type operator()(T value)</pre>
-<strong>Returns:</strong> <code>distribution()(e, value)</code>.  For
+  <p>The complexity of all functions specified in this section is constant.
+  No function described in this section except the constructor throws an
+  exception.</p>
+  <pre>
+    variate_generator(engine_type eng, distribution_type d)
+</pre><strong>Effects:</strong> Constructs a <code>variate_generator</code>
+object with the associated uniform random number generator <code>eng</code>
+and the associated random distribution <code>d</code>.<br>
+  <strong>Throws:</strong> If and what the copy constructor of Engine or
+  Distribution throws.
+  <pre>
+    result_type operator()()
+</pre><strong>Returns:</strong> <code>distribution()(e)</code><br>
+  <strong>Notes:</strong> The sequence of numbers produced by the uniform
+  random number generator <code>e</code>, s<sub>e</sub>, is obtained from the
+  sequence of numbers produced by the associated uniform random number
+  generator <code>eng</code>, s<sub>eng</sub>, as follows: Consider the
+  values of <code>numeric_limits&lt;<em>T</em>&gt;::is_integer</code> for
+  <code><em>T</em></code> both <code>Distribution::input_type</code> and
+  <code>engine_value_type::result_type</code>. If the values for both types
+  are <code>true</code>, then s<sub>e</sub> is identical to s<sub>eng</sub>.
+  Otherwise, if the values for both types are <code>false</code>, then the
+  numbers in s<sub>eng</sub> are divided by
+  <code>engine().max()-engine().min()</code> to obtain the numbers in
+  s<sub>e</sub>. Otherwise, if the value for
+  <code>engine_value_type::result_type</code> is <code>true</code> and the
+  value for <code>Distribution::input_type</code> is <code>false</code>, then
+  the numbers in s<sub>eng</sub> are divided by
+  <code>engine().max()-engine().min()+1</code> to obtain the numbers in
+  s<sub>e</sub>. Otherwise, the mapping from s<sub>eng</sub> to s<sub>e</sub>
+  is implementation-defined. In all cases, an implicit conversion from
+  <code>engine_value_type::result_type</code> to
+  <code>Distribution::input_type</code> is performed. If such a conversion
+  does not exist, the program is ill-formed.
+  <pre>
+    template&lt;class T&gt; result_type operator()(T value)
+</pre><strong>Returns:</strong> <code>distribution()(e, value)</code>. For
 the semantics of <code>e</code>, see the description of
 <code>operator()()</code>.
-
-<pre>    engine_value_type& engine()</pre>
-<strong>Returns:</strong> A reference to the associated uniform random
+  <pre>
+    engine_value_type&amp; engine()
+</pre><strong>Returns:</strong> A reference to the associated uniform random
 number generator.
-
-<pre>    const engine_value_type& engine() const</pre>
-<strong>Returns:</strong> A reference to the associated uniform random
+  <pre>
+    const engine_value_type&amp; engine() const
+</pre><strong>Returns:</strong> A reference to the associated uniform random
 number generator.
-
-<pre>    distribution_type& distribution()</pre>
-<strong>Returns:</strong> A reference to the associated random
+  <pre>
+    distribution_type&amp; distribution()
+</pre><strong>Returns:</strong> A reference to the associated random
 distribution.
-
-<pre>    const distribution_type& distribution() const</pre>
-<strong>Returns:</strong> A reference to the associated random
+  <pre>
+    const distribution_type&amp; distribution() const
+</pre><strong>Returns:</strong> A reference to the associated random
 distribution.
+  <pre>
+    result_type min() const
+</pre><strong>Precondition:</strong> <code>distribution().min()</code> is
+well-formed<br>
+  <strong>Returns:</strong> <code>distribution().min()</code>
+  <pre>
+    result_type max() const
+</pre><strong>Precondition:</strong> <code>distribution().max()</code> is
+well-formed<br>
+  <strong>Returns:</strong> <code>distribution().max()</code>
 
-<pre>    result_type min() const</pre>
-<strong>Precondition:</strong> <code>distribution().min()</code> is
-well-formed
-<br>
-<strong>Returns:</strong> <code>distribution().min()</code>
+  <h3>Random number engine class templates</h3>Except where specified
+  otherwise, the complexity of all functions specified in the following
+  sections is constant. No function described in this section except the
+  constructor and seed functions taking an iterator range [it1,it2) throws an
+  exception.
 
-<pre>    result_type max() const</pre>
-<strong>Precondition:</strong> <code>distribution().max()</code> is
-well-formed
-<br>
-<strong>Returns:</strong> <code>distribution().max()</code>
+  <p>The class templates specified in this section satisfy all the
+  requirements of a pseudo-random number engine (given in tables in section
+  x.x), except where specified otherwise. Descriptions are provided here only
+  for operations on the engines that are not described in one of these tables
+  or for operations where there is additional semantic information.</p>
 
+  <p>All members declared <code>static const</code> in any of the following
+  class templates shall be defined in such a way that they are usable as
+  integral constant expressions.</p>
 
-<h3>Random number engine class templates</h3>
-
-Except where specified otherwise, the complexity of all functions specified in
-the following sections is constant.  No function described in this
-section except the constructor and seed functions taking an iterator
-range [it1,it2) throws an exception.
-<p>
-
-The class templates specified in this section satisfy all the
-requirements of a pseudo-random number engine (given in tables in
-section x.x), except where specified otherwise.  Descriptions are
-provided here only for operations on the engines that are not
-described in one of these tables or for operations where there is
-additional semantic information.
-<p>
-
-All members declared <code>static const</code> in any of the following
-class templates shall be defined in such a way that they are usable as
-integral constant expressions.
-
-
-<h4>Class template <code>linear_congruential</code></h4>
-
-A <code>linear_congruential</code> engine produces random numbers
-using a linear function x(i+1) := (a * x(i) + c) mod m.
-
-<pre>
+  <h4>Class template <code>linear_congruential</code></h4>A
+  <code>linear_congruential</code> engine produces random numbers using a
+  linear function x(i+1) := (a * x(i) + c) mod m.
+  <pre>
 namespace std {
   template&lt;class IntType, IntType a, IntType c, IntType m&gt;
   class linear_congruential
@@ -2207,98 +2461,91 @@
 
     // <em> constructors and member function</em>
     explicit linear_congruential(IntType x0 = 1);
-    template&lt;class In&gt; linear_congruential(In& first, In last);
+    template&lt;class In&gt; linear_congruential(In&amp; first, In last);
     void seed(IntType x0 = 1);
-    template&lt;class In&gt; void seed(In& first, In last);
+    template&lt;class In&gt; void seed(In&amp; first, In last);
     result_type min() const;
     result_type max() const;
     result_type operator()();
   };
 
   template&lt;class IntType, IntType a, IntType c, IntType m&gt;
-  bool operator==(const linear_congruential&lt;IntType, a, c, m&gt;& x,
-                  const linear_congruential&lt;IntType, a, c, m&gt;& y);
+  bool operator==(const linear_congruential&lt;IntType, a, c, m&gt;&amp; x,
+                  const linear_congruential&lt;IntType, a, c, m&gt;&amp; y);
   template&lt;class IntType, IntType a, IntType c, IntType m&gt;
-  bool operator!=(const linear_congruential&lt;IntType, a, c, m&gt;& x,
-                  const linear_congruential&lt;IntType, a, c, m&gt;& y);
+  bool operator!=(const linear_congruential&lt;IntType, a, c, m&gt;&amp; x,
+                  const linear_congruential&lt;IntType, a, c, m&gt;&amp; y);
 
   template&lt;class CharT, class traits,
            class IntType, IntType a, IntType c, IntType m&gt;
-  basic_ostream&lt;CharT, traits&gt;& operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;& os,
-                                           const linear_congruential&lt;IntType, a, c, m&gt;& x);  
+  basic_ostream&lt;CharT, traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;&amp; os,
+                                           const linear_congruential&lt;IntType, a, c, m&gt;&amp; x);  
   template&lt;class CharT, class traits,
            class IntType, IntType a, IntType c, IntType m&gt;
-  basic_istream&lt;CharT, traits&gt;& operator&gt;&gt;(basic_istream&lt;CharT, traits&gt;& is, 
-                                           linear_congruential&lt;IntType, a, c, m&gt;& x);
+  basic_istream&lt;CharT, traits&gt;&amp; operator&gt;&gt;(basic_istream&lt;CharT, traits&gt;&amp; is, 
+                                           linear_congruential&lt;IntType, a, c, m&gt;&amp; x);
 }
-</pre>
+</pre>The template parameter <code>IntType</code> shall denote an integral
+type large enough to store values up to (m-1). If the template parameter
+<code>m</code> is 0, the behaviour is implementation-defined. Otherwise, the
+template parameters <code>a</code> and <code>c</code> shall be less than m.
 
-The template parameter <code>IntType</code> shall denote an integral
-type large enough to store values up to (m-1).  If the template
-parameter <code>m</code> is 0, the behaviour is
-implementation-defined.  Otherwise, the template parameters
-<code>a</code> and <code>c</code> shall be less than m.
-<p>
+  <p>The size of the state x(i) is 1.</p>
+  <pre>
+    explicit linear_congruential(IntType x0 = 1)
+</pre><strong>Requires:</strong> <code>c &gt; 0 || (x0 % m) &gt; 0</code><br>
 
-The size of the state x(i) is 1.
+  <strong>Effects:</strong> Constructs a <code>linear_congruential</code>
+  engine with state x(0) := <code>x0</code> mod m.
+  <pre>
+    void seed(IntType x0 = 1)
+</pre><strong>Requires:</strong> <code>c &gt; 0 || (x0 % m) &gt; 0</code><br>
 
+  <strong>Effects:</strong> Sets the state x(i) of the engine to
+  <code>x0</code> mod m.
+  <pre>
+    template&lt;class In&gt; linear_congruential(In&amp; first, In last)
+</pre><strong>Requires:</strong> <code>c &gt; 0 || *first &gt; 0</code><br>
+  <strong>Effects:</strong> Sets the state x(i) of the engine to
+  <code>*first</code> mod m.<br>
+  <strong>Complexity:</strong> Exactly one dereference of
+  <code>*first</code>.
+  <pre>
+  template&lt;class CharT, class traits,
+           class IntType, IntType a, IntType c, IntType m&gt;
+  basic_ostream&lt;CharT, traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;&amp; os,
+                                           const linear_congruential&lt;IntType, a, c, m&gt;&amp; x);  
+</pre><strong>Effects:</strong> Writes x(i) to <code>os</code>.
 
-<pre>    explicit linear_congruential(IntType x0 = 1)</pre>
-<strong>Requires:</strong> <code>c &gt; 0 || (x0 % m) &gt; 0</code>
-<br>
-<strong>Effects:</strong> Constructs a
-<code>linear_congruential</code> engine with state x(0) :=
-<code>x0</code> mod m.
+  <h4>Class template <code>mersenne_twister</code></h4>A
+  <code>mersenne_twister</code> engine produces random numbers o(x(i)) using
+  the following computation, performed modulo 2<sup>w</sup>. <code>um</code>
+  is a value with only the upper <code>w-r</code> bits set in its binary
+  representation. <code>lm</code> is a value with only its lower
+  <code>r</code> bits set in its binary representation. <em>rshift</em> is a
+  bitwise right shift with zero-valued bits appearing in the high bits of the
+  result. <em>lshift</em> is a bitwise left shift with zero-valued bits
+  appearing in the low bits of the result.
 
-<pre>    void seed(IntType x0 = 1)</pre>
-<strong>Requires:</strong> <code>c &gt; 0 || (x0 % m) &gt; 0</code>
-<br>
-<strong>Effects:</strong> Sets the state x(i) of the engine to
-<code>x0</code> mod m.
+  <ul>
+    <li>y(i) = (x(i-n) <em>bitand</em> um) | (x(i-(n-1)) <em>bitand</em>
+    lm)</li>
 
-<pre>    template&lt;class In&gt; linear_congruential(In& first, In last)</pre>
-<strong>Requires:</strong> <code>c &gt; 0 || *first &gt; 0</code>
-<br>
-<strong>Effects:</strong> Sets the state x(i) of the engine to
-<code>*first</code> mod m.
-<br>
-<strong>Complexity:</strong> Exactly one dereference of
-<code>*first</code>.
+    <li>If the lowest bit of the binary representation of y(i) is set, x(i) =
+    x(i-(n-m)) <em>xor</em> (y(i) <em>rshift</em> 1) <em>xor</em> a;
+    otherwise x(i) = x(i-(n-m)) <em>xor</em> (y(i) <em>rshift</em> 1).</li>
 
+    <li>z1(i) = x(i) <em>xor</em> ( x(i) <em>rshift</em> u )</li>
 
-<pre>
-  template&lt;class CharT, class traits,
-           class IntType, IntType a, IntType c, IntType m&gt;
-  basic_ostream&lt;CharT, traits&gt;& operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;& os,
-                                           const linear_congruential&lt;IntType, a, c, m&gt;& x);  
-</pre>
-<strong>Effects:</strong> Writes x(i) to <code>os</code>.
+    <li>z2(i) = z1(i) <em>xor</em> ( (z1(i) <em>lshift</em> s)
+    <em>bitand</em> b )</li>
 
+    <li>z3(i) = z2(i) <em>xor</em> ( (z2(i) <em>lshift</em> t)
+    <em>bitand</em> c )</li>
 
-<h4>Class template <code>mersenne_twister</code></h4>
-
-A <code>mersenne_twister</code> engine produces random numbers
-o(x(i)) using the following computation, performed modulo
-2<sup>w</sup>.  <code>um</code> is a value with only the upper
-<code>w-r</code> bits set in its binary representation.
-<code>lm</code> is a value with only its lower <code>r</code> bits set
-in its binary representation.  <em>rshift</em> is a bitwise right
-shift with zero-valued bits appearing in the high bits of the result.
-<em>lshift</em> is a bitwise left shift with zero-valued bits
-appearing in the low bits of the result.
-
-<ul>
-<li>y(i) = (x(i-n) <em>bitand</em> um) | (x(i-(n-1)) <em>bitand</em> lm)
-<li>If the lowest bit of the binary representation of y(i) is set,
-x(i) = x(i-(n-m)) <em>xor</em> (y(i) <em>rshift</em> 1) <em>xor</em> a;
-otherwise x(i) = x(i-(n-m)) <em>xor</em> (y(i) <em>rshift</em> 1).
-<li>z1(i) = x(i) <em>xor</em> ( x(i) <em>rshift</em> u )
-<li>z2(i) = z1(i) <em>xor</em> ( (z1(i) <em>lshift</em> s) <em>bitand</em> b )
-<li>z3(i) = z2(i) <em>xor</em> ( (z2(i) <em>lshift</em> t) <em>bitand</em> c )
-<li>o(x(i)) = z3(i) <em>xor</em> ( z3(i) <em>rshift</em> l )
-</ul>
-
-<pre>
+    <li>o(x(i)) = z3(i) <em>xor</em> ( z3(i) <em>rshift</em> l )</li>
+  </ul>
+  <pre>
 namespace std {
   template&lt;class UIntType, int w, int n, int m, int r, UIntType a, int u,
   int s, UIntType b, int t, UIntType c, int l&gt;
@@ -2324,10 +2571,10 @@
     // <em> constructors and member function</em>
     mersenne_twister();
     explicit mersenne_twister(UIntType value);
-    template&lt;class In&gt; mersenne_twister(In& first, In last);
+    template&lt;class In&gt; mersenne_twister(In&amp; first, In last);
     void seed();
     void seed(UIntType value);
-    template&lt;class In&gt; void seed(In& first, In last);
+    template&lt;class In&gt; void seed(In&amp; first, In last);
     result_type min() const;
     result_type max() const;
     result_type operator()();
@@ -2335,105 +2582,86 @@
 
   template&lt;class UIntType, int w, int n, int m, int r, UIntType a, int u,
            int s, UIntType b, int t, UIntType c, int l&gt;
-  bool operator==(const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l>& y,
-                  const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l>& x);
+  bool operator==(const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l&gt;&amp; y,
+                  const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l&gt;&amp; x);
   template&lt;class UIntType, int w, int n, int m, int r, UIntType a, int u,
            int s, UIntType b, int t, UIntType c, int l&gt;
-  bool operator!=(const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l>& y,
-                  const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l>& x);
+  bool operator!=(const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l&gt;&amp; y,
+                  const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l&gt;&amp; x);
 
   template&lt;class CharT, class traits,
            class UIntType, int w, int n, int m, int r, UIntType a, int u,
            int s, UIntType b, int t, UIntType c, int l&gt;
-  basic_ostream&lt;CharT, traits&gt;& operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;& os,
-                                           const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l>& x);
+  basic_ostream&lt;CharT, traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;&amp; os,
+                                           const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l&gt;&amp; x);
   template&lt;class CharT, class traits,
            class UIntType, int w, int n, int m, int r, UIntType a, int u,
            int s, UIntType b, int t, UIntType c, int l&gt;
-  basic_istream&lt;CharT, traits&gt;& operator&gt;&gt;(basic_istream&lt;CharT, traits&gt;& is, 
-                                           mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l>& x);
+  basic_istream&lt;CharT, traits&gt;&amp; operator&gt;&gt;(basic_istream&lt;CharT, traits&gt;&amp; is, 
+                                           mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l&gt;&amp; x);
 }
-</pre>
+</pre>The template parameter <code>UIntType</code> shall denote an unsigned
+integral type large enough to store values up to 2<sup>w</sup>-1. Also, the
+following relations shall hold: 1&lt;=m&lt;=n. 0&lt;=r,u,s,t,l&lt;=w.
+0&lt;=a,b,c&lt;=2<sup>w</sup>-1.
 
-The template parameter <code>UIntType</code> shall denote an unsigned
-integral type large enough to store values up to
-2<sup>w</sup>-1.  Also, the following relations shall hold:
-1&lt=m&lt=n.  0&lt=r,u,s,t,l&lt=w.  0&lt=a,b,c&lt=2<sup>w</sup>-1.
-<p>
-
-The size of the state x(i) is <code>n</code>.
-
-
-<pre>    mersenne_twister()</pre>
-<strong>Effects:</strong> Constructs a <code>mersenne_twister</code>
+  <p>The size of the state x(i) is <code>n</code>.</p>
+  <pre>
+    mersenne_twister()
+</pre><strong>Effects:</strong> Constructs a <code>mersenne_twister</code>
 engine and invokes <code>seed()</code>.
-
-<pre>    explicit mersenne_twister(result_type value)</pre>
-<strong>Effects:</strong> Constructs a <code>mersenne_twister</code>
+  <pre>
+    explicit mersenne_twister(result_type value)
+</pre><strong>Effects:</strong> Constructs a <code>mersenne_twister</code>
 engine and invokes <code>seed(value)</code>.
-
-<pre>    template&lt;class In&gt; mersenne_twister(In& first, In last)</pre>
-<strong>Effects:</strong> Constructs a <code>mersenne_twister</code>
+  <pre>
+    template&lt;class In&gt; mersenne_twister(In&amp; first, In last)
+</pre><strong>Effects:</strong> Constructs a <code>mersenne_twister</code>
 engine and invokes <code>seed(first, last)</code>.
-
-<pre>    void seed()</pre>
-<strong>Effects:</strong> Invokes
-<code>seed(4357)</code>.
-
-<pre>    void seed(result_type value)</pre>
-<strong>Requires:</strong> <code>value &gt; 0</code>
-<br>
-<strong>Effects:</strong> With a linear congruential generator l(i)
-having parameters m<sub>l</sub> = 2<sup>32</sup>, a<sub>l</sub> = 69069,
-c<sub>l</sub> = 0, and l(0) = <code>value</code>, sets x(-n) ... x(-1)
-to l(1) ... l(n), respectively.
-<br>
-<strong>Complexity:</strong> O(n)
-
-<pre>    template&lt;class In&gt; void seed(In& first, In last)</pre>
-<strong>Effects:</strong> Given the values z<sub>0</sub>
-... z<sub>n-1</sub> obtained by dereferencing [first, first+n), sets
-x(-n) ... x(-1) to z<sub>0</sub> mod 2<sup>w</sup>
-... z<sub>n-1</sub> mod 2<sup>w</sup>.
-<br>
-<strong>Complexity:</strong> Exactly <code>n</code> dereferences of
-<code>first</code>.
-
-<pre>
+  <pre>
+    void seed()
+</pre><strong>Effects:</strong> Invokes <code>seed(4357)</code>.
+  <pre>
+    void seed(result_type value)
+</pre><strong>Requires:</strong> <code>value &gt; 0</code><br>
+  <strong>Effects:</strong> With a linear congruential generator l(i) having
+  parameters m<sub>l</sub> = 2<sup>32</sup>, a<sub>l</sub> = 69069,
+  c<sub>l</sub> = 0, and l(0) = <code>value</code>, sets x(-n) ... x(-1) to
+  l(1) ... l(n), respectively.<br>
+  <strong>Complexity:</strong> O(n)
+  <pre>
+    template&lt;class In&gt; void seed(In&amp; first, In last)
+</pre><strong>Effects:</strong> Given the values z<sub>0</sub> ...
+z<sub>n-1</sub> obtained by dereferencing [first, first+n), sets x(-n) ...
+x(-1) to z<sub>0</sub> mod 2<sup>w</sup> ... z<sub>n-1</sub> mod
+2<sup>w</sup>.<br>
+  <strong>Complexity:</strong> Exactly <code>n</code> dereferences of
+  <code>first</code>.
+  <pre>
     template&lt;class UIntType, int w, int n, int m, int r, UIntType a, int u,
              int s, UIntType b, int t, UIntType c, int l&gt;
-    bool operator==(const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l>& y,
-                    const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l>& x)
-</pre>
-<strong>Returns:</strong> x(i-n) == y(j-n) and ... and x(i-1) ==
-y(j-1)
-<br>
-<strong>Notes:</strong> Assumes the next output of <code>x</code> is
-o(x(i)) and the next output of <code>y</code> is o(y(j)).
-<br>
-<strong>Complexity:</strong> O(n)
-
-<pre>
+    bool operator==(const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l&gt;&amp; y,
+                    const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l&gt;&amp; x)
+</pre><strong>Returns:</strong> x(i-n) == y(j-n) and ... and x(i-1) ==
+y(j-1)<br>
+  <strong>Notes:</strong> Assumes the next output of <code>x</code> is
+  o(x(i)) and the next output of <code>y</code> is o(y(j)).<br>
+  <strong>Complexity:</strong> O(n)
+  <pre>
     template&lt;class CharT, class traits,
              class UIntType, int w, int n, int m, int r, UIntType a, int u,
              int s, UIntType b, int t, UIntType c, int l&gt;
-    basic_ostream&lt;CharT, traits&gt;& operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;& os,
-                                             const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l>& x)
-</pre>
-<strong>Effects:</strong> Writes x(i-n), ... x(i-1) to
-<code>os</code>, in that order.
-<br>
-<strong>Complexity:</strong> O(n)
+    basic_ostream&lt;CharT, traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;&amp; os,
+                                             const mersenne_twister&lt;UIntType, w, n, m, r, a, u, s, b, t, c, l&gt;&amp; x)
+</pre><strong>Effects:</strong> Writes x(i-n), ... x(i-1) to <code>os</code>,
+in that order.<br>
+  <strong>Complexity:</strong> O(n)
 
-
-<h4>Class template <code>subtract_with_carry</code></h4>
-
-A <code>subtract_with_carry</code> engine produces integer random numbers
-using x(i) = (x(i-s) - x(i-r) - carry(i-1)) mod m; carry(i) = 1 if
-x(i-s) - x(i-r) - carry(i-1) &lt; 0, else carry(i) = 0.
-<p>
-
-<pre>
+  <h4>Class template <code>subtract_with_carry</code></h4>A
+  <code>subtract_with_carry</code> engine produces integer random numbers
+  using x(i) = (x(i-s) - x(i-r) - carry(i-1)) mod m; carry(i) = 1 if x(i-s) -
+  x(i-r) - carry(i-1) &lt; 0, else carry(i) = 0.
+  <pre>
 namespace std {
   template&lt;class IntType, IntType m, int s, int r&gt;
   class subtract_with_carry
@@ -2450,110 +2678,91 @@
     // <em> constructors and member function</em>
     subtract_with_carry();
     explicit subtract_with_carry(IntType value);
-    template&lt;class In&gt; subtract_with_carry(In& first, In last);
+    template&lt;class In&gt; subtract_with_carry(In&amp; first, In last);
     void seed(IntType value = 19780503);
-    template&lt;class In&gt; void seed(In& first, In last);
+    template&lt;class In&gt; void seed(In&amp; first, In last);
     result_type min() const;
     result_type max() const;
     result_type operator()();
   };
   template&lt;class IntType, IntType m, int s, int r&gt;
-  bool operator==(const subtract_with_carry&lt;IntType, m, s, r&gt; & x,
-                  const subtract_with_carry&lt;IntType, m, s, r&gt; & y);
+  bool operator==(const subtract_with_carry&lt;IntType, m, s, r&gt; &amp; x,
+                  const subtract_with_carry&lt;IntType, m, s, r&gt; &amp; y);
 
   template&lt;class IntType, IntType m, int s, int r&gt;
-  bool operator!=(const subtract_with_carry&lt;IntType, m, s, r&gt; & x,
-                  const subtract_with_carry&lt;IntType, m, s, r&gt; & y);
+  bool operator!=(const subtract_with_carry&lt;IntType, m, s, r&gt; &amp; x,
+                  const subtract_with_carry&lt;IntType, m, s, r&gt; &amp; y);
 
   template&lt;class CharT, class Traits,
            class IntType, IntType m, int s, int r&gt;
-  std::basic_ostream&lt;CharT,Traits>& operator&lt;&lt;(std::basic_ostream&lt;CharT,Traits>& os,
-                                               const subtract_with_carry&lt;IntType, m, s, r&gt& f);
+  std::basic_ostream&lt;CharT,Traits&gt;&amp; operator&lt;&lt;(std::basic_ostream&lt;CharT,Traits&gt;&amp; os,
+                                               const subtract_with_carry&lt;IntType, m, s, r&gt;&amp; f);
 
   template&lt;class CharT, class Traits,
           class IntType, IntType m, int s, int r&gt;
-  std::basic_istream&lt;CharT,Traits>& operator&gt;&gt;(std::basic_istream&lt;CharT,Traits>& is, 
-                                               subtract_with_carry&lt;IntType, m, s, r&gt& f);
+  std::basic_istream&lt;CharT,Traits&gt;&amp; operator&gt;&gt;(std::basic_istream&lt;CharT,Traits&gt;&amp; is, 
+                                               subtract_with_carry&lt;IntType, m, s, r&gt;&amp; f);
 }
-</pre>
+</pre>The template parameter <code>IntType</code> shall denote a signed
+integral type large enough to store values up to m-1. The following relation
+shall hold: 0&lt;s&lt;r. Let w the number of bits in the binary
+representation of m.
 
-The template parameter <code>IntType</code> shall denote a signed
-integral type large enough to store values up to m-1.  The following
-relation shall hold: 0&lt;s&lt;r.  Let w the number of bits in the
-binary representation of m.
-<p>
-
-The size of the state is <code>r</code>.
-
-<pre>    subtract_with_carry()</pre>
-<strong>Effects:</strong> Constructs a <code>subtract_with_carry</code>
+  <p>The size of the state is <code>r</code>.</p>
+  <pre>
+    subtract_with_carry()
+</pre><strong>Effects:</strong> Constructs a <code>subtract_with_carry</code>
 engine and invokes <code>seed()</code>.
-
-<pre>    explicit subtract_with_carry(IntType value)</pre>
-<strong>Effects:</strong> Constructs a <code>subtract_with_carry</code>
+  <pre>
+    explicit subtract_with_carry(IntType value)
+</pre><strong>Effects:</strong> Constructs a <code>subtract_with_carry</code>
 engine and invokes <code>seed(value)</code>.
-
-<pre>    template&lt;class In&gt; subtract_with_carry(In& first, In last)</pre>
-<strong>Effects:</strong> Constructs a <code>subtract_with_carry</code>
+  <pre>
+    template&lt;class In&gt; subtract_with_carry(In&amp; first, In last)
+</pre><strong>Effects:</strong> Constructs a <code>subtract_with_carry</code>
 engine and invokes <code>seed(first, last)</code>.
-
-<pre>    void seed(IntType value = 19780503)</pre>
-<strong>Requires:</strong> <code>value &gt; 0</code>
-<br>
-<strong>Effects:</strong> With a linear congruential generator l(i)
-having parameters m<sub>l</sub> = 2147483563, a<sub>l</sub> = 40014,
-c<sub>l</sub> = 0, and l(0) = <code>value</code>, sets x(-r) ... x(-1)
-to l(1) mod m ... l(r) mod m, respectively.  If x(-1) == 0, sets
-carry(-1) = 1, else sets carry(-1) = 0.
-<br>
-<strong>Complexity:</strong> O(r)
-
-<pre>    template&lt;class In&gt; void seed(In& first, In last)</pre>
-<strong>Effects:</strong> With n=w/32+1 (rounded downward) and given
-the values z<sub>0</sub> ... z<sub>n*r-1</sub> obtained by
-dereferencing [first, first+n*r), sets x(-r) ... x(-1) to
-(z<sub>0</sub> * 2<sup>32</sup> + ... + z<sub>n-1</sub> *
-2<sup>32*(n-1)</sup>) mod m ... (z<sub>(r-1)*n</sub> * 2<sup>32</sup>
-+ ... + z<sub>r-1</sub> * 2<sup>32*(n-1)</sup>) mod m.  If x(-1) == 0,
-sets carry(-1) = 1, else sets carry(-1) = 0.
-<br>
-<strong>Complexity:</strong> Exactly <code>r*n</code> dereferences of
-<code>first</code>.
-
-<pre>
+  <pre>
+    void seed(IntType value = 19780503)
+</pre><strong>Requires:</strong> <code>value &gt; 0</code><br>
+  <strong>Effects:</strong> With a linear congruential generator l(i) having
+  parameters m<sub>l</sub> = 2147483563, a<sub>l</sub> = 40014, c<sub>l</sub>
+  = 0, and l(0) = <code>value</code>, sets x(-r) ... x(-1) to l(1) mod m ...
+  l(r) mod m, respectively. If x(-1) == 0, sets carry(-1) = 1, else sets
+  carry(-1) = 0.<br>
+  <strong>Complexity:</strong> O(r)
+  <pre>
+    template&lt;class In&gt; void seed(In&amp; first, In last)
+</pre><strong>Effects:</strong> With n=w/32+1 (rounded downward) and given
+the values z<sub>0</sub> ... z<sub>n*r-1</sub> obtained by dereferencing
+[first, first+n*r), sets x(-r) ... x(-1) to (z<sub>0</sub> * 2<sup>32</sup> +
+... + z<sub>n-1</sub> * 2<sup>32*(n-1)</sup>) mod m ... (z<sub>(r-1)*n</sub>
+* 2<sup>32</sup> + ... + z<sub>r-1</sub> * 2<sup>32*(n-1)</sup>) mod m. If
+x(-1) == 0, sets carry(-1) = 1, else sets carry(-1) = 0.<br>
+  <strong>Complexity:</strong> Exactly <code>r*n</code> dereferences of
+  <code>first</code>.
+  <pre>
     template&lt;class IntType, IntType m, int s, int r&gt;
-    bool operator==(const subtract_with_carry&lt;IntType, m, s, r&gt; & x,
-                    const subtract_with_carry&lt;IntType, m, s, r&gt; & y)
-</pre>
-<strong>Returns:</strong> x(i-r) == y(j-r) and ... and x(i-1) ==
-y(j-1).
-<br>
-<strong>Notes:</strong> Assumes the next output of <code>x</code> is
-x(i) and the next output of <code>y</code> is y(j).
-<br>
-<strong>Complexity:</strong> O(r)
-
-<pre>
+    bool operator==(const subtract_with_carry&lt;IntType, m, s, r&gt; &amp; x,
+                    const subtract_with_carry&lt;IntType, m, s, r&gt; &amp; y)
+</pre><strong>Returns:</strong> x(i-r) == y(j-r) and ... and x(i-1) ==
+y(j-1).<br>
+  <strong>Notes:</strong> Assumes the next output of <code>x</code> is x(i)
+  and the next output of <code>y</code> is y(j).<br>
+  <strong>Complexity:</strong> O(r)
+  <pre>
     template&lt;class CharT, class Traits,
           class IntType, IntType m, int s, int r&gt;
-    std::basic_ostream&lt;CharT,Traits>& operator&lt;&lt;(std::basic_ostream&lt;CharT,Traits>& os,
-                                                 const subtract_with_carry&lt;IntType, m, s, r&gt;& f)
-</pre>
-<strong>Effects:</strong> Writes x(i-r) ... x(i-1), carry(i-1) to
-<code>os</code>, in that order.
-<br>
-<strong>Complexity:</strong> O(r)
+    std::basic_ostream&lt;CharT,Traits&gt;&amp; operator&lt;&lt;(std::basic_ostream&lt;CharT,Traits&gt;&amp; os,
+                                                 const subtract_with_carry&lt;IntType, m, s, r&gt;&amp; f)
+</pre><strong>Effects:</strong> Writes x(i-r) ... x(i-1), carry(i-1) to
+<code>os</code>, in that order.<br>
+  <strong>Complexity:</strong> O(r)
 
-
-<h4>Class template <code>subtract_with_carry_01</code></h4>
-
-A <code>subtract_with_carry_01</code> engine produces floating-point
-random numbers using x(i) = (x(i-s) - x(i-r) - carry(i-1)) mod 1;
-carry(i) = 2<sup>-w</sup> if x(i-s) - x(i-r) - carry(i-1) &lt; 0, else
-carry(i) = 0.
-<p>
-
-<pre>
+  <h4>Class template <code>subtract_with_carry_01</code></h4>A
+  <code>subtract_with_carry_01</code> engine produces floating-point random
+  numbers using x(i) = (x(i-s) - x(i-r) - carry(i-1)) mod 1; carry(i) =
+  2<sup>-w</sup> if x(i-s) - x(i-r) - carry(i-1) &lt; 0, else carry(i) = 0.
+  <pre>
 namespace std {
   template&lt;class RealType, int w, int s, int r&gt;
   class subtract_with_carry_01
@@ -2570,9 +2779,9 @@
     // <em> constructors and member function</em>
     subtract_with_carry_01();
     explicit subtract_with_carry_01(unsigned int value);
-    template&lt;class In&gt; subtract_with_carry_01(In& first, In last);
+    template&lt;class In&gt; subtract_with_carry_01(In&amp; first, In last);
     void seed(unsigned int value = 19780503);
-    template&lt;class In&gt; void seed(In& first, In last);
+    template&lt;class In&gt; void seed(In&amp; first, In last);
     result_type min() const;
     result_type max() const;
     result_type operator()();
@@ -2587,84 +2796,70 @@
 
   template&lt;class CharT, class Traits,
            class RealType, int w, int s, int r&gt;
-  std::basic_ostream&lt;CharT,Traits>& operator&lt;&lt;(std::basic_ostream&lt;CharT,Traits>& os,
-                                               const subtract_with_carry_01&lt;RealType, w, s, r&gt& f);
+  std::basic_ostream&lt;CharT,Traits&gt;&amp; operator&lt;&lt;(std::basic_ostream&lt;CharT,Traits&gt;&amp; os,
+                                               const subtract_with_carry_01&lt;RealType, w, s, r&gt;&amp; f);
 
   template&lt;class CharT, class Traits,
            class RealType, int w, int s, int r&gt;
-  std::basic_istream&lt;CharT,Traits>& operator&gt;&gt;(std::basic_istream&lt;CharT,Traits>& is, 
-                                               subtract_with_carry_01&lt;RealType, w, s, r&gt& f);
+  std::basic_istream&lt;CharT,Traits&gt;&amp; operator&gt;&gt;(std::basic_istream&lt;CharT,Traits&gt;&amp; is, 
+                                               subtract_with_carry_01&lt;RealType, w, s, r&gt;&amp; f);
 }
-</pre>
+</pre>The following relation shall hold: 0&lt;s&lt;r.
 
-The following relation shall hold: 0&lt;s&lt;r.
-<p>
-
-The size of the state is <code>r</code>.
-
-<pre>    subtract_with_carry_01()</pre>
-<strong>Effects:</strong> Constructs a <code>subtract_with_carry_01</code>
-engine and invokes <code>seed()</code>.
-
-<pre>    explicit subtract_with_carry_01(unsigned int value)</pre>
-<strong>Effects:</strong> Constructs a <code>subtract_with_carry_01</code>
-engine and invokes <code>seed(value)</code>.
-
-<pre>    template&lt;class In&gt; subtract_with_carry_01(In& first, In last)</pre>
-<strong>Effects:</strong> Constructs a <code>subtract_with_carry_01</code>
-engine and invokes <code>seed(first, last)</code>.
-
-<pre>    void seed(unsigned int value = 19780503)</pre>
-<strong>Effects:</strong> With a linear congruential generator l(i)
+  <p>The size of the state is <code>r</code>.</p>
+  <pre>
+    subtract_with_carry_01()
+</pre><strong>Effects:</strong> Constructs a
+<code>subtract_with_carry_01</code> engine and invokes <code>seed()</code>.
+  <pre>
+    explicit subtract_with_carry_01(unsigned int value)
+</pre><strong>Effects:</strong> Constructs a
+<code>subtract_with_carry_01</code> engine and invokes
+<code>seed(value)</code>.
+  <pre>
+    template&lt;class In&gt; subtract_with_carry_01(In&amp; first, In last)
+</pre><strong>Effects:</strong> Constructs a
+<code>subtract_with_carry_01</code> engine and invokes <code>seed(first,
+last)</code>.
+  <pre>
+    void seed(unsigned int value = 19780503)
+</pre><strong>Effects:</strong> With a linear congruential generator l(i)
 having parameters m = 2147483563, a = 40014, c = 0, and l(0) =
-<code>value</code>, sets x(-r) ... x(-1) to (l(1)*2<sup>-w</sup>) mod 1
-... (l(r)*2<sup>-w</sup>) mod 1, respectively.  If x(-1) == 0, sets
-carry(-1) = 2<sup>-w</sup>, else sets carry(-1) = 0.
-<br>
-<strong>Complexity:</strong> O(r)
-
-<pre>    template&lt;class In&gt; void seed(In& first, In last)</pre>
-<strong>Effects:</strong> With n=w/32+1 (rounded downward) and given
-the values z<sub>0</sub> ... z<sub>n*r-1</sub> obtained by
-dereferencing [first, first+n*r), sets x(-r) ... x(-1) to
-(z<sub>0</sub> * 2<sup>32</sup> + ... + z<sub>n-1</sub> *
-2<sup>32*(n-1)</sup>) * 2<sup>-w</sup> mod 1 ... (z<sub>(r-1)*n</sub>
-* 2<sup>32</sup> + ... + z<sub>r-1</sub> * 2<sup>32*(n-1)</sup>) *
-2<sup>-w</sup> mod 1.  If x(-1) == 0, sets carry(-1) = 2<sup>-w</sup>,
-else sets carry(-1) = 0.
-<br>
-<strong>Complexity:</strong> O(r*n)
-
-<pre>
+<code>value</code>, sets x(-r) ... x(-1) to (l(1)*2<sup>-w</sup>) mod 1 ...
+(l(r)*2<sup>-w</sup>) mod 1, respectively. If x(-1) == 0, sets carry(-1) =
+2<sup>-w</sup>, else sets carry(-1) = 0.<br>
+  <strong>Complexity:</strong> O(r)
+  <pre>
+    template&lt;class In&gt; void seed(In&amp; first, In last)
+</pre><strong>Effects:</strong> With n=w/32+1 (rounded downward) and given
+the values z<sub>0</sub> ... z<sub>n*r-1</sub> obtained by dereferencing
+[first, first+n*r), sets x(-r) ... x(-1) to (z<sub>0</sub> * 2<sup>32</sup> +
+... + z<sub>n-1</sub> * 2<sup>32*(n-1)</sup>) * 2<sup>-w</sup> mod 1 ...
+(z<sub>(r-1)*n</sub> * 2<sup>32</sup> + ... + z<sub>r-1</sub> *
+2<sup>32*(n-1)</sup>) * 2<sup>-w</sup> mod 1. If x(-1) == 0, sets carry(-1) =
+2<sup>-w</sup>, else sets carry(-1) = 0.<br>
+  <strong>Complexity:</strong> O(r*n)
+  <pre>
     template&lt;class RealType, int w, int s, int r&gt;
     bool operator==(const subtract_with_carry&lt;RealType, w, s, r&gt; x,
                     const subtract_with_carry&lt;RealType, w, s, r&gt; y);
-</pre>
-<strong>Returns:</strong> true, if and only if x(i-r) == y(j-r) and
-... and x(i-1) == y(j-1).
-<br>
-<strong>Complexity:</strong> O(r)
-
-<pre>
+</pre><strong>Returns:</strong> true, if and only if x(i-r) == y(j-r) and ...
+and x(i-1) == y(j-1).<br>
+  <strong>Complexity:</strong> O(r)
+  <pre>
     template&lt;class CharT, class Traits,
              class RealType, int w, int s, int r&gt;
-    std::basic_ostream&lt;CharT,Traits>& operator&lt;&lt;(std::basic_ostream&lt;CharT,Traits>& os,
-                                                 const subtract_with_carry&lt;RealType, w, s, r&gt& f);
-</pre>
-<strong>Effects:</strong> Write x(i-r)*2<sup>w</sup>
-... x(i-1)*2<sup>w</sup>, carry(i-1)*2<sup>w</sup> to <code>os</code>,
-in that order.
-<br>
-<strong>Complexity:</strong> O(r)
+    std::basic_ostream&lt;CharT,Traits&gt;&amp; operator&lt;&lt;(std::basic_ostream&lt;CharT,Traits&gt;&amp; os,
+                                                 const subtract_with_carry&lt;RealType, w, s, r&gt;&amp; f);
+</pre><strong>Effects:</strong> Write x(i-r)*2<sup>w</sup> ...
+x(i-1)*2<sup>w</sup>, carry(i-1)*2<sup>w</sup> to <code>os</code>, in that
+order.<br>
+  <strong>Complexity:</strong> O(r)
 
-
-<h4>Class template <code>discard_block</code></h4>
-
-A <code>discard_block</code> engine produces random numbers from some
-base engine by discarding blocks of data.
-<p>
-
-<pre>
+  <h4>Class template <code>discard_block</code></h4>A
+  <code>discard_block</code> engine produces random numbers from some base
+  engine by discarding blocks of data.
+  <pre>
 namespace std {
   template&lt;class UniformRandomNumberGenerator, int p, int r&gt;
   class discard_block
@@ -2680,11 +2875,11 @@
   
     // <em> constructors and member function</em>
     discard_block();
-    explicit discard_block(const base_type & rng);
-    template&lt;class In&gt; discard_block(In& first, In last);
+    explicit discard_block(const base_type &amp; rng);
+    template&lt;class In&gt; discard_block(In&amp; first, In last);
     void seed();
-    template&lt;class In&gt; void seed(In& first, In last);
-    const base_type& base() const;
+    template&lt;class In&gt; void seed(In&amp; first, In last);
+    const base_type&amp; base() const;
     result_type min() const;
     result_type max() const;
     result_type operator()();  
@@ -2693,80 +2888,71 @@
     // int n;                       <em>exposition only</em>
   };
   template&lt;class UniformRandomNumberGenerator, int p, int r&gt;
-  bool operator==(const discard_block&lt;UniformRandomNumberGenerator,p,r&gt; & x,
-                 (const discard_block&lt;UniformRandomNumberGenerator,p,r&gt; & y);
+  bool operator==(const discard_block&lt;UniformRandomNumberGenerator,p,r&gt; &amp; x,
+                 (const discard_block&lt;UniformRandomNumberGenerator,p,r&gt; &amp; y);
   template&lt;class UniformRandomNumberGenerator, int p, int r,
     typename UniformRandomNumberGenerator::result_type val&gt;
-  bool operator!=(const discard_block&lt;UniformRandomNumberGenerator,p,r&gt; & x,
-                 (const discard_block&lt;UniformRandomNumberGenerator,p,r&gt; & y);
+  bool operator!=(const discard_block&lt;UniformRandomNumberGenerator,p,r&gt; &amp; x,
+                 (const discard_block&lt;UniformRandomNumberGenerator,p,r&gt; &amp; y);
 
   template&lt;class CharT, class traits,
-           class UniformRandomNumberGenerator, int p, int r>
-  basic_ostream&lt;CharT, traits&gt;& operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;& os,
-                                           const discard_block&lt;UniformRandomNumberGenerator,p,r&gt; & x);
+           class UniformRandomNumberGenerator, int p, int r&gt;
+  basic_ostream&lt;CharT, traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;&amp; os,
+                                           const discard_block&lt;UniformRandomNumberGenerator,p,r&gt; &amp; x);
   template&lt;class CharT, class traits,
            class UniformRandomNumberGenerator, int p, int r&gt;
-  basic_istream&lt;CharT, traits&gt;& operator&gt;&gt;(basic_istream&lt;CharT, traits&gt;& is, 
-                                           discard_block&lt;UniformRandomNumberGenerator,p,r&gt; & x);
+  basic_istream&lt;CharT, traits&gt;&amp; operator&gt;&gt;(basic_istream&lt;CharT, traits&gt;&amp; is, 
+                                           discard_block&lt;UniformRandomNumberGenerator,p,r&gt; &amp; x);
 
 }
-</pre>
-
-The template parameter <code>UniformRandomNumberGenerator</code> shall
-denote a class that satisfies all the requirements of a uniform random
-number generator, given in tables in section x.x. r &lt;= p.  The size
-of the state is the size of <code><em>b</em></code> plus 1.
-
-<pre>    discard_block()</pre>
-<strong>Effects:</strong> Constructs a <code>discard_block</code>
-engine.  To construct the subobject <em>b</em>, invokes its default
-constructor.  Sets <code>n = 0</code>.
-
-<pre>    explicit discard_block(const base_type & rng)</pre>
-<strong>Effects:</strong> Constructs a <code>discard_block</code>
-engine.  Initializes <em>b</em> with a copy of <code>rng</code>.
-Sets <code>n = 0</code>.
-
-<pre>    template&lt;class In&gt; discard_block(In& first, In last)</pre>
-<strong>Effects:</strong> Constructs a <code>discard_block</code>
-engine.  To construct the subobject <em>b</em>, invokes the
-<code>b(first, last)</code> constructor.  Sets <code>n = 0</code>.
-
-<pre>    void seed()</pre>
-<strong>Effects:</strong> Invokes <code><em>b</em>.seed()</code>
-and sets <code>n = 0</code>.
-
-<pre>    template&lt;class In&gt; void seed(In& first, In last)</pre>
-<strong>Effects:</strong> Invokes <code><em>b</em>.seed(first,
+</pre>The template parameter <code>UniformRandomNumberGenerator</code> shall
+denote a class that satisfies all the requirements of a uniform random number
+generator, given in tables in section x.x. r &lt;= p. The size of the state
+is the size of <code><em>b</em></code> plus 1.
+  <pre>
+    discard_block()
+</pre><strong>Effects:</strong> Constructs a <code>discard_block</code>
+engine. To construct the subobject <em>b</em>, invokes its default
+constructor. Sets <code>n = 0</code>.
+  <pre>
+    explicit discard_block(const base_type &amp; rng)
+</pre><strong>Effects:</strong> Constructs a <code>discard_block</code>
+engine. Initializes <em>b</em> with a copy of <code>rng</code>. Sets <code>n
+= 0</code>.
+  <pre>
+    template&lt;class In&gt; discard_block(In&amp; first, In last)
+</pre><strong>Effects:</strong> Constructs a <code>discard_block</code>
+engine. To construct the subobject <em>b</em>, invokes the <code>b(first,
+last)</code> constructor. Sets <code>n = 0</code>.
+  <pre>
+    void seed()
+</pre><strong>Effects:</strong> Invokes <code><em>b</em>.seed()</code> and
+sets <code>n = 0</code>.
+  <pre>
+    template&lt;class In&gt; void seed(In&amp; first, In last)
+</pre><strong>Effects:</strong> Invokes <code><em>b</em>.seed(first,
 last)</code> and sets <code>n = 0</code>.
-
-<pre>    const base_type& base() const</pre>
-<strong>Returns:</strong> <em>b</em>
-
-<pre>    result_type operator()()</pre>
-<strong>Effects:</strong> If <em>n</em> &gt;= r, invokes
-<code><em>b</em></code> (p-r) times, discards the values returned,
-and sets <code>n = 0</code>.  In any case, then increments
-<code>n</code> and returns <code><em>b()</em></code>.
-
-<pre>
+  <pre>
+    const base_type&amp; base() const
+</pre><strong>Returns:</strong> <em>b</em>
+  <pre>
+    result_type operator()()
+</pre><strong>Effects:</strong> If <em>n</em> &gt;= r, invokes
+<code><em>b</em></code> (p-r) times, discards the values returned, and sets
+<code>n = 0</code>. In any case, then increments <code>n</code> and returns
+<code><em>b()</em></code>.
+  <pre>
   template&lt;class CharT, class traits,
            class UniformRandomNumberGenerator, int p, int r&gt;
-  basic_ostream&lt;CharT, traits&gt;& operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;& os,
-                                           const discard_block&lt;UniformRandomNumberGenerator,p,r&gt; & x);
-</pre>
-<strong>Effects:</strong> Writes <code><em>b</em></code>, then
+  basic_ostream&lt;CharT, traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;&amp; os,
+                                           const discard_block&lt;UniformRandomNumberGenerator,p,r&gt; &amp; x);
+</pre><strong>Effects:</strong> Writes <code><em>b</em></code>, then
 <code><em>n</em></code> to <code>os</code>.
 
-
-<h4>Class template <code>xor_combine</code></h4>
-
-A <code>xor_combine</code> engine produces random numbers from two
-integer base engines by merging their random values with bitwise
-exclusive-or.
-<p>
-
-<pre>
+  <h4>Class template <code>xor_combine</code></h4>A <code>xor_combine</code>
+  engine produces random numbers from two integer base engines by merging
+  their random values with bitwise exclusive-or.
+  <pre>
 namespace std {
   template&lt;class UniformRandomNumberGenerator1, int s1,
            class UniformRandomNumberGenerator2, int s2&gt;
@@ -2784,12 +2970,12 @@
   
     // <em> constructors and member function</em>
     xor_combine();
-    xor_combine(const base1_type & rng1, const base2_type & rng2);
-    template&lt;class In&gt; xor_combine(In& first, In last);
+    xor_combine(const base1_type &amp; rng1, const base2_type &amp; rng2);
+    template&lt;class In&gt; xor_combine(In&amp; first, In last);
     void seed();
-    template&lt;class In&gt; void seed(In& first, In last);
-    const base1_type& base1() const;
-    const base2_type& base2() const;
+    template&lt;class In&gt; void seed(In&amp; first, In last);
+    const base1_type&amp; base1() const;
+    const base2_type&amp; base2() const;
     result_type min() const;
     result_type max() const;
     result_type operator()();  
@@ -2800,140 +2986,120 @@
   template&lt;class UniformRandomNumberGenerator1, int s1,
            class UniformRandomNumberGenerator2, int s2&gt;
   bool operator==(const xor_combine&lt;UniformRandomNumberGenerator1, s1, 
-                                    UniformRandomNumberGenerator2, s2&gt; & x,
+                                    UniformRandomNumberGenerator2, s2&gt; &amp; x,
                  (const xor_combine&lt;UniformRandomNumberGenerator1, s1,
-                                    UniformRandomNumberGenerator2, s2&gt; & y);
+                                    UniformRandomNumberGenerator2, s2&gt; &amp; y);
   template&lt;class UniformRandomNumberGenerator1, int s1,
            class UniformRandomNumberGenerator2, int s2&gt;
   bool operator!=(const xor_combine&lt;UniformRandomNumberGenerator1, s1,
-                                    UniformRandomNumberGenerator2, s2&gt; & x,
+                                    UniformRandomNumberGenerator2, s2&gt; &amp; x,
                  (const xor_combine&lt;UniformRandomNumberGenerator1, s1,
-                                    UniformRandomNumberGenerator2, s2&gt; & y);
+                                    UniformRandomNumberGenerator2, s2&gt; &amp; y);
 
   template&lt;class CharT, class traits,
            class UniformRandomNumberGenerator1, int s1,
            class UniformRandomNumberGenerator2, int s2&gt;
-  basic_ostream&lt;CharT, traits&gt;& operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;& os,
+  basic_ostream&lt;CharT, traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;&amp; os,
                                            const xor_combine&lt;UniformRandomNumberGenerator1, s1,
-                                                             UniformRandomNumberGenerator2, s2&gt; & x);
+                                                             UniformRandomNumberGenerator2, s2&gt; &amp; x);
   template&lt;class CharT, class traits,
            class UniformRandomNumberGenerator1, int s1,
            class UniformRandomNumberGenerator2, int s2&gt;
-  basic_istream&lt;CharT, traits&gt;& operator&gt;&gt;(basic_istream&lt;CharT, traits&gt;& is, 
+  basic_istream&lt;CharT, traits&gt;&amp; operator&gt;&gt;(basic_istream&lt;CharT, traits&gt;&amp; is, 
                                            xor_combine&lt;UniformRandomNumberGenerator1, s1,
-                                                       UniformRandomNumberGenerator2, s2&gt; & x);
+                                                       UniformRandomNumberGenerator2, s2&gt; &amp; x);
 
 }
-</pre>
-
-The template parameters <code>UniformRandomNumberGenerator1</code> and
-<code>UniformRandomNumberGenerator1</code> shall denote classes that
-satisfy all the requirements of a uniform random number generator,
-given in tables in section x.x .  The size of the state is
-the size of <code><em>b1</em></code> plus the size of
-<code><em>b2</em></code>.
-
-<pre>    xor_combine()</pre>
-<strong>Effects:</strong> Constructs a <code>xor_combine</code>
-engine.  To construct each of the subobjects <em>b1</em> and
-<em>b2</em>, invokes their respective default constructors.
-
-<pre>    xor_combine(const base1_type & rng1, const base2_type & rng2)</pre>
-<strong>Effects:</strong> Constructs a <code>xor_combine</code>
-engine.  Initializes <em>b1</em> with a copy of <code>rng1</code> and
-<em>b2</em> with a copy of <code>rng2</code>.
-
-<pre>    template&lt;class In&gt; xor_combine(In& first, In last)</pre>
-<strong>Effects:</strong> Constructs a <code>xor_combine</code>
-engine.  To construct the subobject <em>b1</em>, invokes the
-<code>b1(first, last)</code> constructor.  Then, to construct the
-subobject <em>b2</em>, invokes the <code>b2(first, last)</code>
-constructor.
-
-<pre>    void seed()</pre>
-<strong>Effects:</strong> Invokes <code><em>b1</em>.seed()</code>
-and <code><em>b2</em>.seed()</code>.
-
-<pre>    template&lt;class In&gt; void seed(In& first, In last)</pre>
-<strong>Effects:</strong> Invokes <code><em>b1</em>.seed(first,
+</pre>The template parameters <code>UniformRandomNumberGenerator1</code> and
+<code>UniformRandomNumberGenerator1</code> shall denote classes that satisfy
+all the requirements of a uniform random number generator, given in tables in
+section x.x . The size of the state is the size of <code><em>b1</em></code>
+plus the size of <code><em>b2</em></code>.
+  <pre>
+    xor_combine()
+</pre><strong>Effects:</strong> Constructs a <code>xor_combine</code> engine.
+To construct each of the subobjects <em>b1</em> and <em>b2</em>, invokes
+their respective default constructors.
+  <pre>
+    xor_combine(const base1_type &amp; rng1, const base2_type &amp; rng2)
+</pre><strong>Effects:</strong> Constructs a <code>xor_combine</code> engine.
+Initializes <em>b1</em> with a copy of <code>rng1</code> and <em>b2</em> with
+a copy of <code>rng2</code>.
+  <pre>
+    template&lt;class In&gt; xor_combine(In&amp; first, In last)
+</pre><strong>Effects:</strong> Constructs a <code>xor_combine</code> engine.
+To construct the subobject <em>b1</em>, invokes the <code>b1(first,
+last)</code> constructor. Then, to construct the subobject <em>b2</em>,
+invokes the <code>b2(first, last)</code> constructor.
+  <pre>
+    void seed()
+</pre><strong>Effects:</strong> Invokes <code><em>b1</em>.seed()</code> and
+<code><em>b2</em>.seed()</code>.
+  <pre>
+    template&lt;class In&gt; void seed(In&amp; first, In last)
+</pre><strong>Effects:</strong> Invokes <code><em>b1</em>.seed(first,
 last)</code>, then invokes <code><em>b2</em>.seed(first, last)</code>.
-
-<pre>    const base1_type& base1() const</pre>
-<strong>Returns:</strong> <em>b1</em>
-
-<pre>    const base2_type& base2() const</pre>
-<strong>Returns:</strong> <em>b2</em>
-
-<pre>    result_type operator()()</pre>
-<strong>Returns:</strong> (<code><em>b1</em>() &lt;&lt; s1) ^
+  <pre>
+    const base1_type&amp; base1() const
+</pre><strong>Returns:</strong> <em>b1</em>
+  <pre>
+    const base2_type&amp; base2() const
+</pre><strong>Returns:</strong> <em>b2</em>
+  <pre>
+    result_type operator()()
+</pre><strong>Returns:</strong> (<code><em>b1</em>() &lt;&lt; s1) ^
 (<em>b2</em>() &lt;&lt; s2)</code>.
-
-<pre>
+  <pre>
   template&lt;class CharT, class traits,
            class UniformRandomNumberGenerator1, int s1,
            class UniformRandomNumberGenerator2, int s2&gt;
-  basic_ostream&lt;CharT, traits&gt;& operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;& os,
+  basic_ostream&lt;CharT, traits&gt;&amp; operator&lt;&lt;(basic_ostream&lt;CharT, traits&gt;&amp; os,
                                            const xor_combine&lt;UniformRandomNumberGenerator1, s1,
-                                                             UniformRandomNumberGenerator2, s2&gt; & x);
-</pre>
-<strong>Effects:</strong> Writes <code><em>b1</em></code>, then
-<code><em>b2</em></code> to <code>os</code>.
+                                                             UniformRandomNumberGenerator2, s2&gt; &amp; x);
+</pre><strong>Effects:</strong> Writes <code><em>b1</em></code>, then <code>
+  <em>b2</em></code> to <code>os</code>.
 
-
-<h3>Engines with predefined parameters</h3>
-
-<pre>
+  <h3>Engines with predefined parameters</h3>
+  <pre>
 namespace std {
   typedef linear_congruential&lt;/* <em>implementation defined</em> */, 16807, 0, 2147483647&gt; minstd_rand0;
   typedef linear_congruential&lt;/* <em>implementation defined</em> */, 48271, 0, 2147483647&gt; minstd_rand;
 
   typedef mersenne_twister&lt;/* <em>implementation defined</em> */,32,624,397,31,0x9908b0df,11,7,0x9d2c5680,15,0xefc60000,18&gt; mt19937;
 
-  typedef subtract_with_carry_01<float, 24, 10, 24> ranlux_base_01;
-  typedef subtract_with_carry_01<double, 48, 10, 24> ranlux64_base_01;
+  typedef subtract_with_carry_01&lt;float, 24, 10, 24&gt; ranlux_base_01;
+  typedef subtract_with_carry_01&lt;double, 48, 10, 24&gt; ranlux64_base_01;
 
-  typedef discard_block&lt;subtract_with_carry&lt;/* <em>implementation defined</em> */, (1&lt;&lt;24), 10, 24>, 223, 24> ranlux3;
-  typedef discard_block&lt;subtract_with_carry&lt;/* <em>implementation defined</em> */, (1&lt;&lt;24), 10, 24>, 389, 24> ranlux4;
+  typedef discard_block&lt;subtract_with_carry&lt;/* <em>implementation defined</em> */, (1&lt;&lt;24), 10, 24&gt;, 223, 24&gt; ranlux3;
+  typedef discard_block&lt;subtract_with_carry&lt;/* <em>implementation defined</em> */, (1&lt;&lt;24), 10, 24&gt;, 389, 24&gt; ranlux4;
 
-  typedef discard_block&lt;subtract_with_carry_01&lt;float, 24, 10, 24>, 223, 24> ranlux3_01;
-  typedef discard_block&lt;subtract_with_carry_01&lt;float, 24, 10, 24>, 389, 24> ranlux4_01;
+  typedef discard_block&lt;subtract_with_carry_01&lt;float, 24, 10, 24&gt;, 223, 24&gt; ranlux3_01;
+  typedef discard_block&lt;subtract_with_carry_01&lt;float, 24, 10, 24&gt;, 389, 24&gt; ranlux4_01;
 }
-</pre>
+</pre>For a default-constructed <code>minstd_rand0</code> object, x(10000) =
+1043618065. For a default-constructed <code>minstd_rand</code> object,
+x(10000) = 399268537.
 
-For a default-constructed <code>minstd_rand0</code> object, x(10000) =
-1043618065.  For a default-constructed <code>minstd_rand</code>
-object, x(10000) = 399268537.
-<p>
+  <p>For a default-constructed <code>mt19937</code> object, x(10000) =
+  3346425566.</p>
 
-For a default-constructed <code>mt19937</code> object, x(10000) =
-3346425566.
-<p>
+  <p>For a default-constructed <code>ranlux3</code> object, x(10000) =
+  5957620. For a default-constructed <code>ranlux4</code> object, x(10000) =
+  8587295. For a default-constructed <code>ranlux3_01</code> object, x(10000)
+  = 5957620 * 2<sup>-24</sup>. For a default-constructed
+  <code>ranlux4_01</code> object, x(10000) = 8587295 * 2<sup>-24</sup>.</p>
 
-For a default-constructed <code>ranlux3</code> object, x(10000) =
-5957620.  For a default-constructed <code>ranlux4</code> object,
-x(10000) = 8587295.  For a default-constructed <code>ranlux3_01</code>
-object, x(10000) = 5957620 * 2<sup>-24</sup>.  For a
-default-constructed <code>ranlux4_01</code> object, x(10000) = 8587295
-* 2<sup>-24</sup>.
+  <h3>Class <code>random_device</code></h3>A <code>random_device</code>
+  produces non-deterministic random numbers. It satisfies all the
+  requirements of a uniform random number generator (given in tables in
+  section x.x). Descriptions are provided here only for operations on the
+  engines that are not described in one of these tables or for operations
+  where there is additional semantic information.
 
-
-
-
-<h3>Class <code>random_device</code></h3>
-
-A <code>random_device</code> produces non-deterministic random
-numbers.  It satisfies all the requirements of a uniform random number
-generator (given in tables in section x.x).  Descriptions are provided
-here only for operations on the engines that are not described in one
-of these tables or for operations where there is additional semantic
-information.
-<p>
-
-If implementation limitations prevent generating non-deterministic
-random numbers, the implementation can employ a pseudo-random number
-engine.
-
-<pre>
+  <p>If implementation limitations prevent generating non-deterministic
+  random numbers, the implementation can employ a pseudo-random number
+  engine.</p>
+  <pre>
 namespace std {
   class random_device
   {
@@ -2942,104 +3108,88 @@
     typedef unsigned int result_type;
 
     // <em>constructors, destructors and member functions</em>
-    explicit random_device(const std::string& token = /* <em>implementation-defined</em> */);
+    explicit random_device(const std::string&amp; token = /* <em>implementation-defined</em> */);
     result_type min() const;
     result_type max() const;
     double entropy() const;
     result_type operator()();
   
   private:
-    random_device(const random_device& );
-    void operator=(const random_device& );
+    random_device(const random_device&amp; );
+    void operator=(const random_device&amp; );
   };
 }
 </pre>
-
-<pre>    explicit random_device(const std::string& token = /* <em>implementation-defined</em> */)</pre>
-<strong>Effects:</strong> Constructs a <code>random_device</code>
-non-deterministic random number engine.  The semantics and default
-value of the <code>token</code> parameter are implementation-defined.
-[Footnote: The parameter is intended to allow an implementation to
-differentiate between different sources of randomness.]
-<br>
-<strong>Throws:</strong> A value of some type derived from
-<code>exception</code> if the <code>random_device</code> could not be
-initialized.
-
-<pre>    result_type min() const</pre>
-<strong>Returns:</strong>
+  <pre>
+    explicit random_device(const std::string&amp; token = /* <em>implementation-defined</em> */)
+</pre><strong>Effects:</strong> Constructs a <code>random_device</code>
+non-deterministic random number engine. The semantics and default value of
+the <code>token</code> parameter are implementation-defined. [Footnote: The
+parameter is intended to allow an implementation to differentiate between
+different sources of randomness.]<br>
+  <strong>Throws:</strong> A value of some type derived from
+  <code>exception</code> if the <code>random_device</code> could not be
+  initialized.
+  <pre>
+    result_type min() const
+</pre><strong>Returns:</strong>
 <code>numeric_limits&lt;result_type&gt;::min()</code>
-
-<pre>    result_type max() const</pre>
-<strong>Returns:</strong>
+  <pre>
+    result_type max() const
+</pre><strong>Returns:</strong>
 <code>numeric_limits&lt;result_type&gt;::max()</code>
+  <pre>
+    double entropy() const
+</pre><strong>Returns:</strong> An entropy estimate for the random numbers
+returned by operator(), in the range <code>min()</code> to log<sub>2</sub>(
+<code>max()</code>+1). A deterministic random number generator (e.g. a
+pseudo-random number engine) has entropy 0.<br>
+  <strong>Throws:</strong> Nothing.
+  <pre>
+    result_type operator()()
+</pre><strong>Returns:</strong> A non-deterministic random value, uniformly
+distributed between <code>min()</code> and <code>max()</code>, inclusive. It
+is implementation-defined how these values are generated.<br>
+  <strong>Throws:</strong> A value of some type derived from
+  <code>exception</code> if a random number could not be obtained.
 
-<pre>    double entropy() const</pre>
-<strong>Returns:</strong> An entropy estimate for the random numbers
-returned by operator(), in the range <code>min()</code> to
-log<sub>2</sub>( <code>max()</code>+1).  A deterministic random
-number generator (e.g. a pseudo-random number engine) has entropy 0.
-<br>
-<strong>Throws:</strong> Nothing.
+  <h3>Random distribution class templates</h3>The class templates specified
+  in this section satisfy all the requirements of a random distribution
+  (given in tables in section x.x). Descriptions are provided here only for
+  operations on the distributions that are not described in one of these
+  tables or for operations where there is additional semantic information.
 
-<pre>    result_type operator()()</pre>
-<strong>Returns:</strong> A non-deterministic random value, uniformly
-distributed between <code>min()</code> and <code>max()</code>,
-inclusive.  It is implementation-defined how these values are
-generated.
-<br>
-<strong>Throws:</strong> A value of some type derived from
-<code>exception</code> if a random number could not be obtained.
+  <p>A template parameter named <code>IntType</code> shall denote a type that
+  represents an integer number. This type shall meet the requirements for a
+  numeric type (26.1 [lib.numeric.requirements]), the binary operators +, -,
+  *, /, % shall be applicable to it, and a conversion from <code>int</code>
+  shall exist. <em>[Footnote: The built-in types <code>int</code> and
+  <code>long</code> meet these requirements.]</em></p>
 
+  <p>Given an object whose type is specified in this subclause, if the
+  lifetime of the uniform random number generator referred to in the
+  constructor invocation for that object has ended, any use of that object is
+  undefined.</p>
 
-<h3>Random distribution class templates</h3>
+  <p>No function described in this section throws an exception, unless an
+  operation on values of <code>IntType</code> or <code>RealType</code> throws
+  an exception. <em>[Note: Then, the effects are undefined, see
+  [lib.numeric.requirements]. ]</em></p>
 
-The class templates specified in this section satisfy all the
-requirements of a random distribution (given in tables in section
-x.x).  Descriptions are provided here only for operations on the
-distributions that are not described in one of these tables or for
-operations where there is additional semantic information.  
-<p>
+  <p>The algorithms for producing each of the specified distributions are
+  implementation-defined.</p>
 
-A template parameter named <code>IntType</code> shall denote a type
-that represents an integer number.  This type shall meet the
-requirements for a numeric type (26.1 [lib.numeric.requirements]), the
-binary operators +, -, *, /, % shall be applicable to it, and a
-conversion from <code>int</code> shall exist.  <em>[Footnote: The
-built-in types <code>int</code> and <code>long</code> meet these
-requirements.]</em>
-<p>
+  <h4>Class template <code>uniform_int</code></h4>A <code>uniform_int</code>
+  random distribution produces integer random numbers x in the range min
+  &lt;= x &lt;= max, with equal probability. min and max are the parameters
+  of the distribution.
 
-Given an object whose type is specified in this subclause, if the
-lifetime of the uniform random number generator referred to in the
-constructor invocation for that object has ended, any use of that
-object is undefined.
-<p>
-
-No function described in this section throws an exception, unless an
-operation on values of <code>IntType</code> or <code>RealType</code>
-throws an exception.  <em>[Note:  Then, the effects are undefined,
-see [lib.numeric.requirements]. ]</em>
-<p>
-
-The algorithms for producing each of the specified distributions are
-implementation-defined.
-
-
-<h4>Class template <code>uniform_int</code></h4>
-
-A <code>uniform_int</code> random distribution produces integer random
-numbers x in the range min &lt;= x &lt;= max, with equal probability.
-min and max are the parameters of the distribution.
-<p>
-
-A <code>uniform_int</code> random distribution satisfies all the
-requirements of a uniform random number generator (given in tables in
-section x.x).
-
-<pre>
+  <p>A <code>uniform_int</code> random distribution satisfies all the
+  requirements of a uniform random number generator (given in tables in
+  section x.x).</p>
+  <pre>
 namespace std {
-  template&lt;class IntType = int>
+  template&lt;class IntType = int&gt;
   class uniform_int
   {
   public:
@@ -3053,43 +3203,38 @@
     result_type max() const;
     void reset();
     template&lt;class UniformRandomNumberGenerator&gt;
-    result_type operator()(UniformRandomNumberGenerator& urng);
+    result_type operator()(UniformRandomNumberGenerator&amp; urng);
     template&lt;class UniformRandomNumberGenerator&gt;
-    result_type operator()(UniformRandomNumberGenerator& urng, result_type n);
+    result_type operator()(UniformRandomNumberGenerator&amp; urng, result_type n);
   };
 }
 </pre>
+  <pre>
+    uniform_int(IntType min = 0, IntType max = 9)
+</pre><strong>Requires:</strong> min &lt;= max<br>
+  <strong>Effects:</strong> Constructs a <code>uniform_int</code> object.
+  <code>min</code> and <code>max</code> are the parameters of the
+  distribution.
+  <pre>
+    result_type min() const
+</pre><strong>Returns:</strong> The "min" parameter of the distribution.
+  <pre>
+    result_type max() const
+</pre><strong>Returns:</strong> The "max" parameter of the distribution.
+  <pre>
+    result_type operator()(UniformRandomNumberGenerator&amp; urng, result_type n)
+</pre><strong>Returns:</strong> A uniform random number x in the range 0
+&lt;= x &lt; n. <em>[Note: This allows a <code>variate_generator</code>
+object with a <code>uniform_int</code> distribution to be used with
+std::random_shuffe, see [lib.alg.random.shuffle]. ]</em>
 
-<pre>    uniform_int(IntType min = 0, IntType max = 9)</pre>
-<strong>Requires:</strong> min &lt;= max
-<br>
-<strong>Effects:</strong> Constructs a <code>uniform_int</code>
-object.  <code>min</code> and <code>max</code> are the parameters of
-the distribution.
-
-<pre>    result_type min() const</pre>
-<strong>Returns:</strong> The "min" parameter of the distribution.
-
-<pre>    result_type max() const</pre>
-<strong>Returns:</strong> The "max" parameter of the distribution.
-
-<pre>    result_type operator()(UniformRandomNumberGenerator& urng, result_type n)</pre>
-<strong>Returns:</strong> A uniform random number x in the range 0
-&lt;= x &lt; n.  <em>[Note: This allows a
-<code>variate_generator</code> object with a <code>uniform_int</code>
-distribution to be used with std::random_shuffe, see
-[lib.alg.random.shuffle]. ]</em>
-
-
-<h4>Class template <code>bernoulli_distribution</code></h4>
-
-A <code>bernoulli_distribution</code> random distribution produces
-<code>bool</code> values distributed with probabilities p(true) = p
-and p(false) = 1-p.  p is the parameter of the distribution.
-
-<pre>
+  <h4>Class template <code>bernoulli_distribution</code></h4>A
+  <code>bernoulli_distribution</code> random distribution produces
+  <code>bool</code> values distributed with probabilities p(true) = p and
+  p(false) = 1-p. p is the parameter of the distribution.
+  <pre>
 namespace std {
-  template&lt;class RealType = double>
+  template&lt;class RealType = double&gt;
   class bernoulli_distribution
   {
   public:
@@ -3098,36 +3243,30 @@
     typedef bool result_type;
 
     // <em> constructors and member function</em>
-    explicit bernoulli_distribution(const RealType& p = RealType(0.5));
+    explicit bernoulli_distribution(const RealType&amp; p = RealType(0.5));
     RealType p() const;
     void reset();
     template&lt;class UniformRandomNumberGenerator&gt;
-    result_type operator()(UniformRandomNumberGenerator& urng);
+    result_type operator()(UniformRandomNumberGenerator&amp; urng);
   };
 }
 </pre>
+  <pre>
+    bernoulli_distribution(const RealType&amp; p = RealType(0.5))
+</pre><strong>Requires:</strong> 0 &lt;= p &lt;= 1<br>
+  <strong>Effects:</strong> Constructs a <code>bernoulli_distribution</code>
+  object. <code>p</code> is the parameter of the distribution.
+  <pre>
+    RealType p() const
+</pre><strong>Returns:</strong> The "p" parameter of the distribution.
 
-<pre>    bernoulli_distribution(const RealType& p = RealType(0.5))</pre>
-
-<strong>Requires:</strong> 0 &lt;= p &lt;= 1
-<br>
-<strong>Effects:</strong> Constructs a
-<code>bernoulli_distribution</code> object.  <code>p</code> is the
-parameter of the distribution.
-
-<pre>    RealType p() const</pre>
-<strong>Returns:</strong> The "p" parameter of the distribution.
-
-
-<h4>Class template <code>geometric_distribution</code></h4>
-
-A <code>geometric_distribution</code> random distribution produces
-integer values <em>i</em> &gt;= 1 with p(i) = (1-p) *
-p<sup>i-1</sup>.  p is the parameter of the distribution.
-
-<pre>
+  <h4>Class template <code>geometric_distribution</code></h4>A
+  <code>geometric_distribution</code> random distribution produces integer
+  values <em>i</em> &gt;= 1 with p(i) = (1-p) * p<sup>i-1</sup>. p is the
+  parameter of the distribution.
+  <pre>
 namespace std {
-  template&lt;class IntType = int, class RealType = double>
+  template&lt;class IntType = int, class RealType = double&gt;
   class geometric_distribution
   {
   public:
@@ -3136,36 +3275,30 @@
     typedef IntType result_type;
 
     // <em> constructors and member function</em>
-    explicit geometric_distribution(const RealType& p = RealType(0.5));
+    explicit geometric_distribution(const RealType&amp; p = RealType(0.5));
     RealType p() const;
     void reset();
     template&lt;class UniformRandomNumberGenerator&gt;
-    result_type operator()(UniformRandomNumberGenerator& urng);
+    result_type operator()(UniformRandomNumberGenerator&amp; urng);
   };
 }
 </pre>
+  <pre>
+    geometric_distribution(const RealType&amp; p = RealType(0.5))
+</pre><strong>Requires:</strong> 0 &lt; p &lt; 1<br>
+  <strong>Effects:</strong> Constructs a <code>geometric_distribution</code>
+  object; <code>p</code> is the parameter of the distribution.
+  <pre>
+   RealType p() const
+</pre><strong>Returns:</strong> The "p" parameter of the distribution.
 
-<pre>    geometric_distribution(const RealType& p = RealType(0.5))</pre>
-
-<strong>Requires:</strong> 0 &lt; p &lt; 1
-<br>
-<strong>Effects:</strong> Constructs a
-<code>geometric_distribution</code> object; <code>p</code> is the
-parameter of the distribution.
-
-<pre>   RealType p() const</pre>
-<strong>Returns:</strong> The "p" parameter of the distribution.
-
-
-<h4>Class template <code>poisson_distribution</code></h4>
-
-A <code>poisson_distribution</code> random distribution produces
-integer values <em>i</em> &gt;= 0 with p(i) = exp(-mean) *
-mean<sup>i</sup> / i!.  mean is the parameter of the distribution.
-
-<pre>
+  <h4>Class template <code>poisson_distribution</code></h4>A
+  <code>poisson_distribution</code> random distribution produces integer
+  values <em>i</em> &gt;= 0 with p(i) = exp(-mean) * mean<sup>i</sup> / i!.
+  mean is the parameter of the distribution.
+  <pre>
 namespace std {
-  template&lt;class IntType = int, class RealType = double>
+  template&lt;class IntType = int, class RealType = double&gt;
   class poisson_distribution
   {
   public:
@@ -3174,37 +3307,30 @@
     typedef IntType result_type;
 
     // <em> constructors and member function</em>
-    explicit poisson_distribution(const RealType& mean = RealType(1));
+    explicit poisson_distribution(const RealType&amp; mean = RealType(1));
     RealType mean() const;
     void reset();
     template&lt;class UniformRandomNumberGenerator&gt;
-    result_type operator()(UniformRandomNumberGenerator& urng);
+    result_type operator()(UniformRandomNumberGenerator&amp; urng);
   };
 }
 </pre>
+  <pre>
+    poisson_distribution(const RealType&amp; mean = RealType(1))
+</pre><strong>Requires:</strong> mean &gt; 0<br>
+  <strong>Effects:</strong> Constructs a <code>poisson_distribution</code>
+  object; <code>mean</code> is the parameter of the distribution.
+  <pre>
+   RealType mean() const
+</pre><strong>Returns:</strong> The "mean" parameter of the distribution.
 
-<pre>    poisson_distribution(const RealType& mean = RealType(1))</pre>
-
-<strong>Requires:</strong> mean &gt; 0
-<br>
-<strong>Effects:</strong> Constructs a
-<code>poisson_distribution</code> object; <code>mean</code> is the
-parameter of the distribution.
-
-<pre>   RealType mean() const</pre>
-<strong>Returns:</strong> The "mean" parameter of the distribution.
-
-
-<h4>Class template <code>binomial_distribution</code></h4>
-
-A <code>binomial_distribution</code> random distribution produces
-integer values <em>i</em> &gt;= 0 with p(i) = (n over i) *
-p<sup>i</sup> * (1-p)<sup>t-i</sup>.  t and p are the parameters of
-the distribution.
-
-<pre>
+  <h4>Class template <code>binomial_distribution</code></h4>A
+  <code>binomial_distribution</code> random distribution produces integer
+  values <em>i</em> &gt;= 0 with p(i) = (n over i) * p<sup>i</sup> *
+  (1-p)<sup>t-i</sup>. t and p are the parameters of the distribution.
+  <pre>
 namespace std {
-  template&lt;class IntType = int, class RealType = double>
+  template&lt;class IntType = int, class RealType = double&gt;
   class binomial_distribution
   {
   public:
@@ -3213,47 +3339,39 @@
     typedef IntType result_type;
 
     // <em> constructors and member function</em>
-    explicit binomial_distribution(IntType t = 1, const RealType& p = RealType(0.5));
+    explicit binomial_distribution(IntType t = 1, const RealType&amp; p = RealType(0.5));
     IntType t() const;
     RealType p() const;
     void reset();
     template&lt;class UniformRandomNumberGenerator&gt;
-    result_type operator()(UniformRandomNumberGenerator& urng);
+    result_type operator()(UniformRandomNumberGenerator&amp; urng);
   };
 }
 </pre>
+  <pre>
+    binomial_distribution(IntType t = 1, const RealType&amp; p = RealType(0.5))
+</pre><strong>Requires:</strong> 0 &lt;= p &lt;= 1 and t &gt;= 0<br>
+  <strong>Effects:</strong> Constructs a <code>binomial_distribution</code>
+  object; <code>t</code> and <code>p</code> are the parameters of the
+  distribution.
+  <pre>
+   IntType t() const
+</pre><strong>Returns:</strong> The "t" parameter of the distribution.
+  <pre>
+   RealType p() const
+</pre><strong>Returns:</strong> The "p" parameter of the distribution.
 
-<pre>    binomial_distribution(IntType t = 1, const RealType& p = RealType(0.5))</pre>
+  <h4>Class template <code>uniform_real</code></h4>A
+  <code>uniform_real</code> random distribution produces floating-point
+  random numbers x in the range min &lt;= x &lt;= max, with equal
+  probability. min and max are the parameters of the distribution.
 
-<strong>Requires:</strong> 0 &lt;= p &lt;= 1 and t &gt;= 0
-<br>
-<strong>Effects:</strong> Constructs a
-<code>binomial_distribution</code> object; <code>t</code> and
-<code>p</code> are the parameters of the distribution.
-
-<pre>   IntType t() const</pre>
-<strong>Returns:</strong> The "t" parameter of the distribution.
-
-<pre>   RealType p() const</pre>
-<strong>Returns:</strong> The "p" parameter of the distribution.
-
-
-
-<h4>Class template <code>uniform_real</code></h4>
-
-A <code>uniform_real</code> random distribution produces
-floating-point random numbers x in the range min &lt;= x &lt;= max,
-with equal probability.  min and max are the parameters of the
-distribution.
-<p>
-
-A <code>uniform_real</code> random distribution satisfies all the
-requirements of a uniform random number generator (given in tables in
-section x.x).
-
-<pre>
+  <p>A <code>uniform_real</code> random distribution satisfies all the
+  requirements of a uniform random number generator (given in tables in
+  section x.x).</p>
+  <pre>
 namespace std {
-  template&lt;class RealType = double>
+  template&lt;class RealType = double&gt;
   class uniform_real
   {
   public:
@@ -3267,35 +3385,31 @@
     result_type max() const;
     void reset();
     template&lt;class UniformRandomNumberGenerator&gt;
-    result_type operator()(UniformRandomNumberGenerator& urng);
+    result_type operator()(UniformRandomNumberGenerator&amp; urng);
   };
 }
 </pre>
+  <pre>
+    uniform_real(RealType min = RealType(0), RealType max = RealType(1))
+</pre><strong>Requires:</strong> min &lt;= max<br>
+  <strong>Effects:</strong> Constructs a <code>uniform_real</code> object;
+  <code>min</code> and <code>max</code> are the parameters of the
+  distribution.
+  <pre>
+    result_type min() const
+</pre><strong>Returns:</strong> The "min" parameter of the distribution.
+  <pre>
+    result_type max() const
+</pre><strong>Returns:</strong> The "max" parameter of the distribution.
 
-<pre>    uniform_real(RealType min = RealType(0), RealType max = RealType(1))</pre>
-<strong>Requires:</strong> min &lt;= max
-<br>
-<strong>Effects:</strong> Constructs a
-<code>uniform_real</code> object; <code>min</code> and
-<code>max</code> are the parameters of the distribution.
-
-<pre>    result_type min() const</pre>
-<strong>Returns:</strong> The "min" parameter of the distribution.
-
-<pre>    result_type max() const</pre>
-<strong>Returns:</strong> The "max" parameter of the distribution.
-
-
-<h4>Class template <code>exponential_distribution</code></h4>
-
-An <code>exponential_distribution</code> random distribution produces
-random numbers x &gt; 0 distributed with probability density function
-p(x) = lambda * exp(-lambda * x), where lambda is the parameter of the
-distribution.
-
-<pre>
+  <h4>Class template <code>exponential_distribution</code></h4>An
+  <code>exponential_distribution</code> random distribution produces random
+  numbers x &gt; 0 distributed with probability density function p(x) =
+  lambda * exp(-lambda * x), where lambda is the parameter of the
+  distribution.
+  <pre>
 namespace std {
-  template&lt;class RealType = double>
+  template&lt;class RealType = double&gt;
   class exponential_distribution
   {
   public:
@@ -3304,36 +3418,31 @@
     typedef RealType result_type;
 
     // <em> constructors and member function</em>
-    explicit exponential_distribution(const result_type& lambda = result_type(1));
+    explicit exponential_distribution(const result_type&amp; lambda = result_type(1));
     RealType lambda() const;
     void reset();
     template&lt;class UniformRandomNumberGenerator&gt;
-    result_type operator()(UniformRandomNumberGenerator& urng);
+    result_type operator()(UniformRandomNumberGenerator&amp; urng);
   };
 }
 </pre>
+  <pre>
+    exponential_distribution(const result_type&amp; lambda = result_type(1))
+</pre><strong>Requires:</strong> lambda &gt; 0<br>
+  <strong>Effects:</strong> Constructs an
+  <code>exponential_distribution</code> object with <code>rng</code> as the
+  reference to the underlying source of random numbers. <code>lambda</code>
+  is the parameter for the distribution.
+  <pre>
+    RealType lambda() const
+</pre><strong>Returns:</strong> The "lambda" parameter of the distribution.
 
-<pre>    exponential_distribution(const result_type& lambda = result_type(1))</pre>
-<strong>Requires:</strong> lambda &gt; 0
-<br>
-<strong>Effects:</strong> Constructs an
-<code>exponential_distribution</code> object with <code>rng</code> as
-the reference to the underlying source of random
-numbers. <code>lambda</code> is the parameter for the distribution.
-
-<pre>    RealType lambda() const</pre>
-<strong>Returns:</strong> The "lambda" parameter of the distribution.
-
-
-<h4>Class template <code>normal_distribution</code></h4>
-
-A <code>normal_distribution</code> random distribution produces
-random numbers x distributed with probability density function
-p(x) = 1/sqrt(2*pi*sigma) * exp(- (x-mean)<sup>2</sup> /
-(2*sigma<sup>2</sup>) ), where mean and sigma are the parameters of
-the distribution.
-
-<pre>
+  <h4>Class template <code>normal_distribution</code></h4>A
+  <code>normal_distribution</code> random distribution produces random
+  numbers x distributed with probability density function p(x) =
+  1/sqrt(2*pi*sigma) * exp(- (x-mean)<sup>2</sup> / (2*sigma<sup>2</sup>) ),
+  where mean and sigma are the parameters of the distribution.
+  <pre>
 namespace std {
   template&lt;class RealType = double&gt;
   class normal_distribution
@@ -3344,44 +3453,36 @@
     typedef RealType result_type;
 
     // <em> constructors and member function</em>
-    explicit normal_distribution(base_type & rng, const result_type& mean = 0,
-                                 const result_type& sigma = 1);
+    explicit normal_distribution(base_type &amp; rng, const result_type&amp; mean = 0,
+                                 const result_type&amp; sigma = 1);
     RealType mean() const;
     RealType sigma() const;
     void reset();
     template&lt;class UniformRandomNumberGenerator&gt;
-    result_type operator()(UniformRandomNumberGenerator& urng);
+    result_type operator()(UniformRandomNumberGenerator&amp; urng);
   };
 }
 </pre>
+  <pre>
+    explicit normal_distribution( const result_type&amp; mean = 0,
+                                 const result_type&amp; sigma = 1);
+</pre><strong>Requires:</strong> sigma &gt; 0<br>
+  <strong>Effects:</strong> Constructs a <code>normal_distribution</code>
+  object; <code>mean</code> and <code>sigma</code> are the parameters for the
+  distribution.
+  <pre>
+    RealType mean() const
+</pre><strong>Returns:</strong> The "mean" parameter of the distribution.
+  <pre>
+    RealType sigma() const
+</pre><strong>Returns:</strong> The "sigma" parameter of the distribution.
 
-
-<pre>
-    explicit normal_distribution( const result_type& mean = 0,
-                                 const result_type& sigma = 1);
-</pre>
-
-<strong>Requires:</strong> sigma &gt; 0
-<br>
-<strong>Effects:</strong> Constructs a
-<code>normal_distribution</code> object; <code>mean</code> and
-<code>sigma</code> are the parameters for the distribution.
-
-<pre>    RealType mean() const</pre>
-<strong>Returns:</strong> The "mean" parameter of the distribution.
-
-<pre>    RealType sigma() const</pre>
-<strong>Returns:</strong> The "sigma" parameter of the distribution.
-
-
-<h4>Class template <code>gamma_distribution</code></h4>
-
-A <code>gamma_distribution</code> random distribution produces
-random numbers x distributed with probability density function
-p(x) = 1/Gamma(alpha) * x<sup>alpha-1</sup> * exp(-x), where alpha is the
-parameter of the distribution.
-
-<pre>
+  <h4>Class template <code>gamma_distribution</code></h4>A
+  <code>gamma_distribution</code> random distribution produces random numbers
+  x distributed with probability density function p(x) = 1/Gamma(alpha) *
+  x<sup>alpha-1</sup> * exp(-x), where alpha is the parameter of the
+  distribution.
+  <pre>
 namespace std {
   template&lt;class RealType = double&gt;
   class gamma_distribution
@@ -3392,127 +3493,116 @@
     typedef RealType result_type;
 
     // <em> constructors and member function</em>
-    explicit gamma_distribution(const result_type& alpha = result_type(1));
+    explicit gamma_distribution(const result_type&amp; alpha = result_type(1));
     RealType alpha() const;
     void reset();
     template&lt;class UniformRandomNumberGenerator&gt;
-    result_type operator()(UniformRandomNumberGenerator& urng);
+    result_type operator()(UniformRandomNumberGenerator&amp; urng);
   };
 }
 </pre>
+  <pre>
+    explicit gamma_distribution(const result_type&amp; alpha = result_type(1));
+</pre><strong>Requires:</strong> alpha &gt; 0<br>
+  <strong>Effects:</strong> Constructs a <code>gamma_distribution</code>
+  object; <code>alpha</code> is the parameter for the distribution.
+  <pre>
+    RealType alpha() const
+</pre><strong>Returns:</strong> The "alpha" parameter of the distribution.
 
+  <h2>V. Acknowledgements</h2>
 
-<pre>
-    explicit gamma_distribution(const result_type& alpha = result_type(1));
-</pre>
+  <ul>
+    <li>Thanks to Walter Brown, Mark Fischler and Marc Paterno from Fermilab
+    for input about the requirements of high-energy physics.</li>
 
-<strong>Requires:</strong> alpha &gt; 0
-<br>
-<strong>Effects:</strong> Constructs a
-<code>gamma_distribution</code> object; <code>alpha</code> is the
-parameter for the distribution.
+    <li>Thanks to David Abrahams for additional comments on the design.</li>
 
-<pre>    RealType alpha() const</pre>
-<strong>Returns:</strong> The "alpha" parameter of the distribution.
+    <li>Thanks to the Boost community for a platform for
+    experimentation.</li>
+  </ul>
 
+  <h2>VI. References</h2>
 
+  <ul>
+    <li>William H. Press, Saul A. Teukolsky, William A. Vetterling, Brian P.
+    Flannery, "Numerical Recipes in C: The art of scientific computing", 2nd
+    ed., 1992, pp. 274-328</li>
 
-<h2>V. Acknowledgements</h2>
+    <li>Bruce Schneier, "Applied Cryptography", 2nd ed., 1996, ch. 16-17. [I
+    haven't read this myself. Yet.]</li>
 
-<ul>
-<li>Thanks to Walter Brown, Mark Fischler and Marc Paterno from Fermilab
-for input about the requirements of high-energy physics.
-</li>
+    <li>D. H. Lehmer, "Mathematical methods in large-scale computing units",
+    Proc. 2nd Symposium on Large-Scale Digital Calculating Machines, Harvard
+    University Press, 1951, pp. 141-146</li>
 
-<li>Thanks to David Abrahams for additional comments on the
-design.</li>
+    <li>P.A. Lewis, A.S. Goodman, J.M. Miller, "A pseudo-random number
+    generator for the System/360", IBM Systems Journal, Vol. 8, No. 2, 1969,
+    pp. 136-146</li>
 
-<li>Thanks to the Boost community for a platform for experimentation.
-</li>
+    <li>Stephen K. Park and Keith W. Miller, "Random Number Generators: Good
+    ones are hard to find", Communications of the ACM, Vol. 31, No. 10,
+    October 1988, pp. 1192-1201</li>
 
-</ul>
+    <li>Makoto Matsumoto and Takuji Nishimura, "Mersenne Twister: A
+    623-dimensionally equidistributed uniform pseudo-random number
+    generator", ACM Transactions on Modeling and Computer Simulation: Special
+    Issue on Uniform Random Number Generation, Vol. 8, No. 1, January 1998,
+    pp. 3-30. http://www.math.keio.ac.jp/matumoto/emt.html.</li>
 
+    <li>Donald E. Knuth, "The Art of Computer Programming, Vol. 2", 3rd ed.,
+    1997, pp. 1-193.</li>
 
+    <li>Carter Bays and S.D. Durham, "Improving a poor random number
+    generator", ACM Transactions on Mathematical Software, Vol. 2, 1979, pp.
+    59-64.</li>
 
-<h2>VI. References</h2>
+    <li>Martin L&uuml;scher, "A portable high-quality random number generator
+    for lattice field theory simulations.", Computer Physics Communications,
+    Vol. 79, 1994, pp. 100-110.</li>
 
-<ul>
-<li>William H. Press, Saul A. Teukolsky, William A. Vetterling, Brian
-P.  Flannery, "Numerical Recipes in C: The art of scientific
-computing", 2nd ed., 1992, pp. 274-328
-</li>
+    <li>William J. Hurd, "Efficient Generation of Statistically Good
+    Pseudonoise by Linearly Interconnected Shift Registers", Technical Report
+    32-1526, Volume XI, The Deep Space Network Progress Report for July and
+    August 1972, NASA Jet Propulsion Laboratory, 1972 and IEEE Transactions
+    on Computers Vol. 23, 1974.</li>
 
-<li>Bruce Schneier, "Applied Cryptography", 2nd ed., 1996, ch. 16-17.
-[I haven't read this myself. Yet.]
-</li>
+    <li>Pierre L'Ecuyer, "Efficient and Portable Combined Random Number
+    Generators", Communications of the ACM, Vol. 31, pp. 742-749+774,
+    1988.</li>
 
-<li>D. H. Lehmer, "Mathematical methods in large-scale computing
-units", Proc. 2nd Symposium on Large-Scale Digital Calculating
-Machines, Harvard University Press, 1951, pp. 141-146
-</li>
+    <li>Pierre L'Ecuyer, "Maximally equidistributed combined Tausworthe
+    generators", Mathematics of Computation Vol. 65, pp. 203-213, 1996.</li>
 
-<li>P.A. Lewis, A.S. Goodman, J.M. Miller, "A pseudo-random number
-generator for the System/360", IBM Systems Journal, Vol. 8, No. 2,
-1969, pp. 136-146
-</li>
+    <li>Pierre L'Ecuyer, "Good parameters and implementations for combined
+    multple recursive random number generators", Operations Research Vol. 47,
+    pp. 159-164, 1999.</li>
 
-<li>Stephen K. Park and Keith W. Miller, "Random Number Generators:
-Good ones are hard to find", Communications of the ACM, Vol. 31,
-No. 10, October 1988, pp. 1192-1201
-</li>
+    <li>S. Kirkpatrick and E. Stoll, "A very fast shift-register sequence
+    random number generator", Journal of Computational Physics, Vol. 40, pp.
+    517-526, 1981.</li>
 
-<li>Makoto Matsumoto and Takuji Nishimura, "Mersenne Twister: A
-623-dimensionally equidistributed uniform pseudo-random number
-generator", ACM Transactions on Modeling and Computer Simulation:
-Special Issue on Uniform Random Number Generation, Vol. 8, No. 1,
-January 1998, pp. 3-30.
-http://www.math.keio.ac.jp/matumoto/emt.html.
-</li>
+    <li>R. C. Tausworthe, "Random numbers generated by iinear recurrence
+    modulo two", Mathematics of Computation, Vol. 19, pp. 201-209, 1965.</li>
 
-<li>Donald E. Knuth, "The Art of Computer Programming, Vol. 2",
-3rd ed., 1997, pp. 1-193.
-</li>
+    <li>George Marsaglia and Arif Zaman, "A New Class of Random Number
+    Generators", Annals of Applied Probability, Vol. 1, No. 3, 1991.</li>
+  </ul>
+  <hr>
 
-<li>Carter Bays and S.D. Durham, "Improving a poor random number
-generator", ACM Transactions on Mathematical Software, Vol. 2, 1979,
-pp. 59-64.
-</li>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<li>Martin Lüscher, "A portable high-quality random number generator
-for lattice field theory simulations.", Computer Physics
-Communications, Vol. 79, 1994, pp. 100-110.
-</li>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
 
-<li>William J. Hurd, "Efficient Generation of Statistically Good
-Pseudonoise by Linearly Interconnected Shift Registers", Technical
-Report 32-1526, Volume XI, The Deep Space Network Progress Report for
-July and August 1972, NASA Jet Propulsion Laboratory, 1972 and IEEE
-Transactions on Computers Vol. 23, 1974.
-</li>
+  <p><i>Copyright &copy; 2002 <a href=
+  "../../people/jens_maurer.htm">Jens Maurer</a></i></p>
 
-<li>Pierre L'Ecuyer, "Efficient and Portable Combined Random Number
-Generators", Communications of the ACM, Vol. 31, pp. 742-749+774,
-1988.
-</li>
-
-<li>Pierre L'Ecuyer, "Maximally equidistributed combined Tausworthe
-generators", Mathematics of Computation Vol. 65, pp. 203-213, 1996.
-</li>
-
-<li>Pierre L'Ecuyer, "Good parameters and implementations for combined
-multple recursive random number generators", Operations Research
-Vol. 47, pp. 159-164, 1999.
-</li>
-
-<li>S. Kirkpatrick and E. Stoll, "A very fast shift-register sequence
-random number generator", Journal of Computational Physics, Vol. 40,
-pp. 517-526, 1981.</li>
-
-<li>R. C. Tausworthe, "Random numbers generated by iinear recurrence
-modulo two", Mathematics of Computation, Vol. 19, pp. 201-209,
-1965.</li>
-
-<li>George Marsaglia and Arif Zaman, "A New Class of Random Number
-Generators", Annals of Applied Probability, Vol. 1, No. 3, 1991.</li>
-
-</ul>
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/range/doc/boost_range.html
===================================================================
--- boost/trunk/libs/range/doc/boost_range.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/doc/boost_range.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -727,7 +727,7 @@
 		
 		<hr>
 		<p>
-			(C) Copyright Thorsten Ottosen 2003-2004
+			(C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
 		</p>
 		<br>
 		<br>

Modified: boost/trunk/libs/range/doc/example.cpp
===================================================================
--- boost/trunk/libs/range/doc/example.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/doc/example.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,10 @@
+/*
+//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+//  distribution is subject to the Boost Software License, Version
+//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt)
+*/
+
 #include <boost/range.hpp>
 #include <iterator>         // for std::iterator_traits, std::distance()
 

Modified: boost/trunk/libs/range/doc/examples.html
===================================================================
--- boost/trunk/libs/range/doc/examples.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/doc/examples.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -47,7 +47,7 @@
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </p>
 
     <br>

Modified: boost/trunk/libs/range/doc/faq.html
===================================================================
--- boost/trunk/libs/range/doc/faq.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/doc/faq.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -116,7 +116,7 @@
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </p>
 
     <br>

Modified: boost/trunk/libs/range/doc/headers.html
===================================================================
--- boost/trunk/libs/range/doc/headers.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/doc/headers.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -154,7 +154,7 @@
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </p>
 
     <br>

Modified: boost/trunk/libs/range/doc/history_ack.html
===================================================================
--- boost/trunk/libs/range/doc/history_ack.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/doc/history_ack.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -61,7 +61,7 @@
     
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2006
+    (C) Copyright Thorsten Ottosen 2003-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </p>
 
     <br>

Modified: boost/trunk/libs/range/doc/intro.html
===================================================================
--- boost/trunk/libs/range/doc/intro.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/doc/intro.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -146,7 +146,7 @@
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </p>
 
     <br>

Modified: boost/trunk/libs/range/doc/portability.html
===================================================================
--- boost/trunk/libs/range/doc/portability.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/doc/portability.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -75,7 +75,7 @@
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </p>
 
     <br>

Modified: boost/trunk/libs/range/doc/range.html
===================================================================
--- boost/trunk/libs/range/doc/range.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/doc/range.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -530,7 +530,7 @@
         </TR>
         <tr >
             <TD nowrap>Copyright &copy 2004</TD>
-            <TD>Thorsten Ottosen.
+            <TD>Thorsten Ottosen. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </TABLE>
 
     <br>

Modified: boost/trunk/libs/range/doc/style.css
===================================================================
--- boost/trunk/libs/range/doc/style.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/doc/style.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,10 @@
+/*
+#//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+#//  distribution is subject to the Boost Software License, Version
+#//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#//  http://www.boost.org/LICENSE_1_0.txt)
+*/
+
 pre{
   BORDER-RIGHT: gray 1pt solid;
   PADDING-RIGHT: 2pt;

Modified: boost/trunk/libs/range/doc/style.html
===================================================================
--- boost/trunk/libs/range/doc/style.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/doc/style.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -104,7 +104,7 @@
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </p>
 
     <br>

Modified: boost/trunk/libs/range/doc/utility_class.html
===================================================================
--- boost/trunk/libs/range/doc/utility_class.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/doc/utility_class.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -352,7 +352,7 @@
 
 <hr>
   <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
   </p>
 
   <br>

Deleted: boost/trunk/libs/range/test/Jamfile
===================================================================
--- boost/trunk/libs/range/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,45 +0,0 @@
-# Boost.Range library
-#
-#  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-#  distribution is subject to the Boost Software License, Version
-#  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-#  http://www.boost.org/LICENSE_1_0.txt)
-#
-# For more information, see http://www.boost.org/libs/range/
-#
-
-subproject libs/range/test ;
-
-import testing ;
-
-rule range-test ( name : includes * )
-{
-    return [
-        run $(name).cpp
-        <lib>../../test/build/boost_unit_test_framework
-        <lib>../../regex/build/boost_regex
-        : 
-        : 
-        : <include>$(BOOST_ROOT)
-          $(includes)
-        ] ;
-}
-
-test-suite range :
-    [ range-test array ]
-    [ range-test iterator_pair ]
-    [ range-test std_container ]
-    [ range-test string ]
-    [ range-test iterator_range ]
-    [ range-test sub_range ]
-    [ range-test partial_workaround ]
-    [ range-test algorithm_example ]
-    [ range-test reversible_range ]
-    [ range-test const_ranges ]
-    [ range-test extension_mechanism ]
-#    [ range-test test ]
-#    [ range-test algorithm ]
-#    [ range-test adaptors ]
-#    [ range-test mfc : <include>$(VC71_ROOT)/atlmfc/include ] 
-    ;
-

Modified: boost/trunk/libs/range/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/range/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,7 +11,7 @@
 rule range-test ( name : includes * )
 {
     return [
-        run $(name).cpp /boost/test//boost_unit_test_framework
+        run $(name).cpp /boost/test//boost_unit_test_framework/<link>static
         : 
         : 
         : $(includes)

Deleted: boost/trunk/libs/range/test/TODO
===================================================================
--- boost/trunk/libs/range/test/TODO	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/test/TODO	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +0,0 @@
-

Modified: boost/trunk/libs/range/test/algorithm_example.cpp
===================================================================
--- boost/trunk/libs/range/test/algorithm_example.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/test/algorithm_example.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,7 +17,6 @@
 
 #include <boost/range/functions.hpp>
 #include <boost/range/metafunctions.hpp>
-#include <boost/range/as_literal.hpp>
 #include <boost/test/test_tools.hpp>
 #include <iostream>
 #include <algorithm>
@@ -71,8 +70,12 @@
     typedef std::vector<int>::iterator iterator;
     std::pair<iterator,iterator>       my_view( boost::begin( my_vector ), 
                                                 boost::begin( my_vector ) + N );
+    char  str_val[] = "a string";
+    char* str       = str_val;
+    
     BOOST_CHECK_EQUAL( my_generic_replace( my_vector, 4, 2 ), 3u );
     BOOST_CHECK_EQUAL( my_generic_replace( my_view, 4, 2 ), N );
+    BOOST_CHECK_EQUAL( my_generic_replace( str, 'a', 'b' ), 0u );
 
 }
 

Modified: boost/trunk/libs/range/test/array.cpp
===================================================================
--- boost/trunk/libs/range/test/array.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/test/array.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -42,16 +42,16 @@
     BOOST_STATIC_ASSERT(( is_same< range_const_iterator<array_t>::type, const int* >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_difference<array_t>::type, std::ptrdiff_t >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<array_t>::type, std::size_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<array_t>::type, int* >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<const array_t>::type, const int* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<array_t>::type, int* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const array_t>::type, const int* >::value ));
     
     BOOST_STATIC_ASSERT(( is_same< range_value<const array_t>::type, const int >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_iterator<const array_t>::type, const int* >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_const_iterator<const array_t>::type, const int* >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_difference<const array_t>::type, std::ptrdiff_t >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<const array_t>::type, std::size_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<const array_t>::type, const int* >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<const array_t>::type, const int* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const array_t>::type, const int* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const array_t>::type, const int* >::value ));
 #endif
     
     BOOST_CHECK_EQUAL( begin( my_array ), my_array );

Deleted: boost/trunk/libs/range/test/compat1.cpp
===================================================================

Modified: boost/trunk/libs/range/test/extension_mechanism.cpp
===================================================================
--- boost/trunk/libs/range/test/extension_mechanism.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/test/extension_mechanism.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -25,7 +25,7 @@
 // Generic range algorithm
 //
 template< class Rng >
-typename boost::range_iterator<Rng>::type foo_algo( Rng& r )
+typename boost::range_result_iterator<Rng>::type foo_algo( Rng& r )
 {
         //
         // This will only compile for Rng = UDT if the qualified calls
@@ -57,28 +57,32 @@
         // to be defined because X defines the proper set of
         // nested types.
         //
-        inline X::iterator range_begin( X& x )
+        inline X::iterator boost_range_begin( X& x )
         {
                 return x.vec.begin();
         }
 
 
-        inline X::const_iterator range_begin( const X& x )
+        inline X::const_iterator boost_range_begin( const X& x )
         {
                 return x.vec.begin();
         }
 
 
-        inline X::iterator range_end( X& x )
+        inline X::iterator boost_range_end( X& x )
         {
                 return x.vec.end();
         }
 
-        inline X::const_iterator range_end( const X& x )
+        inline X::const_iterator boost_range_end( const X& x )
         {
                 return x.vec.end();
         }
 
+        inline X::size_type boost_range_size( const X& x )
+        {
+                return x.vec.size();
+        }
 }
 
 void check_extension()

Modified: boost/trunk/libs/range/test/iterator_pair.cpp
===================================================================
--- boost/trunk/libs/range/test/iterator_pair.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/test/iterator_pair.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -46,20 +46,18 @@
     BOOST_STATIC_ASSERT(( is_same< range_difference<pair_t>::type,                           
                           detail::iterator_traits<pair_t::first_type>::difference_type >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<pair_t>::type, std::size_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<pair_t>::type, pair_t::first_type >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<const_pair_t>::type, const_pair_t::first_type >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<pair_t>::type, pair_t::first_type >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const_pair_t>::type, const_pair_t::first_type >::value ));
     
     BOOST_STATIC_ASSERT(( is_same< range_value<const_pair_tt>::type, 
                           detail::iterator_traits<const_pair_t::first_type>::value_type>::value ));
     BOOST_STATIC_ASSERT(( is_same< range_iterator<const_pair_tt>::type, const_pair_tt::first_type >::value ));
-    //
-    // This behavior is not supported with v2.
-    //BOOST_STATIC_ASSERT(( is_same< range_const_iterator<const_pair_tt>::type, const_pair_tt::first_type >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_const_iterator<const_pair_tt>::type, const_pair_tt::first_type >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_difference<const_pair_tt>::type,                           
                           detail::iterator_traits<const_pair_tt::first_type>::difference_type >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<const_pair_tt>::type, std::size_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<const_pair_tt>::type, const_pair_tt::first_type >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<const_pair_tt>::type, const_pair_tt::first_type >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const_pair_tt>::type, const_pair_tt::first_type >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const_pair_tt>::type, const_pair_tt::first_type >::value ));
 
     BOOST_CHECK( begin( pair ) == pair.first );
     BOOST_CHECK( end( pair )   == pair.second );

Modified: boost/trunk/libs/range/test/iterator_range.cpp
===================================================================
--- boost/trunk/libs/range/test/iterator_range.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/test/iterator_range.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,7 +8,6 @@
 // For more information, see http://www.boost.org/libs/range/
 //
 
-//#include <boost/range/as_array.hpp>
 
 #include <boost/detail/workaround.hpp>
 
@@ -17,6 +16,7 @@
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
+
 #include <boost/range/iterator_range.hpp>
 #include <boost/range/functions.hpp>
 #include <boost/test/test_tools.hpp>
@@ -26,7 +26,7 @@
 
 using namespace boost;
 using namespace std;
-    
+
 void check_reference_type();
 
 void check_iterator_range()
@@ -65,12 +65,6 @@
     BOOST_CHECK_EQUAL( distance( r.begin(), r.end() ), 
                        distance( begin( r2 ), end( r2 ) ) );
     cout << r << r2;
-
-        
-#ifndef BOOST_NO_STD_WSTRING
-    wcout << make_iterator_range( wstring( L"a wide string" ) ) 
-          << make_iterator_range( L"another wide string" );
-#endif    
     
     string res  = copy_range<string>( r );
     BOOST_CHECK( equal( res.begin(), res.end(), r.begin() ) );
@@ -127,7 +121,7 @@
 template< class Container >
 int test_iter_range( Container& a_cont )
 {
-    typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type citer_type;
+    typedef BOOST_DEDUCED_TYPENAME range_result_iterator<Container>::type citer_type;
     typedef iterator_range<citer_type> riter_type;
     riter_type a_riter( make_iterator_range( a_cont ) );
     a_riter.front();

Modified: boost/trunk/libs/range/test/partial_workaround.cpp
===================================================================
--- boost/trunk/libs/range/test/partial_workaround.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/test/partial_workaround.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,15 +17,18 @@
 #endif
 
 #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-//#define BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION 1
 
 #include <boost/range/iterator.hpp>
 #include <boost/range/const_iterator.hpp>
 #include <boost/range/size_type.hpp>
 #include <boost/range/value_type.hpp>
 #include <boost/range/difference_type.hpp>
+#include <boost/range/result_iterator.hpp>
 
-#include <boost/range/functions.hpp>
+#include <boost/range/begin.hpp>
+#include <boost/range/end.hpp>
+#include <boost/range/size.hpp>
+#include <boost/range/empty.hpp>
 #include <boost/range/detail/sfinae.hpp>
 
 #include <boost/static_assert.hpp>

Modified: boost/trunk/libs/range/test/reversible_range.cpp
===================================================================
--- boost/trunk/libs/range/test/reversible_range.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/test/reversible_range.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,7 +23,6 @@
 #include <boost/static_assert.hpp>
 #include <boost/type_traits.hpp>
 #include <boost/test/test_tools.hpp>
-#include <boost/test/unit_test.hpp>
 #include <vector>
 #include <algorithm>
 
@@ -32,7 +31,7 @@
 
 void check_iterator()
 {
-    typedef vector<int>                           vec_t;
+    typedef vector<char>                          vec_t;
     typedef vec_t::iterator                       iterator;
     typedef pair<iterator,iterator>               pair_t;
     typedef range_reverse_iterator<pair_t>::type  rev_iterator;
@@ -41,8 +40,15 @@
     vec_t                            vec;
     pair_t                           p    = make_pair( vec.begin(), vec.end() );
     rev_pair_t                       rp   = make_pair( rbegin( p ), rend( p ) );
-    int                             a[]  = {1,2,3,4,5,6,7,8,9,10};
-    const int                       ca[] = {1,2,3,4,5,6,7,8,9,10,11,12};                        
+    char*                            str  = "mutable";
+    const char*                      cstr = "not mutable";
+    char                             a[]  = "mutable";
+    const char                       ca[] = "not mutable";                        
+    wchar_t*                         wstr = L"mutable";
+    const wchar_t*                   cwstr= L"not mutable";
+    wchar_t                          wa[] = L"mutable";
+    const wchar_t                    cwa[]= L"not mutable";
+         
     BOOST_CHECK( rbegin( vec ) == range_reverse_iterator<vec_t>::type( vec.end() ) );
     BOOST_CHECK( rend( vec ) == range_reverse_iterator<vec_t>::type( vec.begin() ) );
     BOOST_CHECK( std::distance( rbegin( vec ), rend( vec ) ) == std::distance( begin( vec ), end( vec ) ) );
@@ -52,16 +58,33 @@
     BOOST_CHECK( std::distance( rbegin( p ), rend( p ) ) == std::distance( begin( rp ), end( rp ) ) );
     BOOST_CHECK( std::distance( begin( p ), end( p ) ) == std::distance( rbegin( rp ), rend( rp ) ) );
 
+    BOOST_CHECK_EQUAL( &*begin( str ), &*( rend( str ) - 1 ) );
+    BOOST_CHECK_EQUAL( &*( end( str ) - 1 ), &*rbegin( str ) );
+    BOOST_CHECK_EQUAL( &*begin( cstr ), &*( rend( cstr ) - 1 ) );
+    BOOST_CHECK_EQUAL( &*( end( cstr ) - 1 ), &*rbegin( cstr ) );
 
     BOOST_CHECK_EQUAL( &*begin( a ), &*( rend( a ) - 1 ) );
     BOOST_CHECK_EQUAL( &*( end( a ) - 1 ), &*rbegin( a ) );
     BOOST_CHECK_EQUAL( &*begin( ca ), &*( rend( ca ) - 1 ) );
     BOOST_CHECK_EQUAL( &*( end( ca ) - 1 ), &*rbegin( ca ) );
+
+    BOOST_CHECK_EQUAL( &*begin( wstr ), &*( rend( wstr ) - 1 ) );
+    BOOST_CHECK_EQUAL( &*( end( wstr ) - 1 ), &*rbegin( wstr ) );
+    BOOST_CHECK_EQUAL( &*begin( cwstr ), &*( rend( cwstr ) - 1 ) );
+    BOOST_CHECK_EQUAL( &*( end( cwstr ) - 1 ), &*rbegin( cwstr ) );
+    
+    BOOST_CHECK_EQUAL( &*begin( wa ), &*( rend( wa ) - 1 ) );
+    BOOST_CHECK_EQUAL( &*( end( wa ) - 1 ), &*rbegin( wa ) );
+    BOOST_CHECK_EQUAL( &*begin( cwa ), &*( rend( cwa ) - 1 ) );
+    BOOST_CHECK_EQUAL( &*( end( cwa ) - 1 ), &*rbegin( cwa ) );
+
 }
 
 
+#include <boost/test/unit_test.hpp>
 using boost::unit_test::test_suite;
 
+
 test_suite* init_unit_test_suite( int argc, char* argv[] )
 {
     test_suite* test = BOOST_TEST_SUITE( "Range Test Suite" );

Modified: boost/trunk/libs/range/test/std_container.cpp
===================================================================
--- boost/trunk/libs/range/test/std_container.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/test/std_container.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -35,13 +35,15 @@
 
     BOOST_STATIC_ASSERT(( is_same< range_value<vec_t>::type, vec_t::value_type >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_iterator<vec_t>::type, vec_t::iterator >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<const vec_t>::type, vec_t::const_iterator >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_const_iterator<vec_t>::type, vec_t::const_iterator >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_difference<vec_t>::type, vec_t::difference_type >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<vec_t>::type, vec_t::size_type >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<vec_t>::type, vec_t::iterator >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<const vec_t>::type, vec_t::const_iterator >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<vec_t>::type, vec_t::iterator >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const vec_t>::type, vec_t::const_iterator >::value ));
     
     BOOST_STATIC_ASSERT(( is_same< range_value<const vec_t>::type, vec_t::value_type >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<const vec_t>::type, vec_t::iterator >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_const_iterator<const vec_t>::type, vec_t::const_iterator >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_difference<const vec_t>::type, vec_t::difference_type >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<const vec_t>::type, vec_t::size_type >::value ));
 

Modified: boost/trunk/libs/range/test/string.cpp
===================================================================
--- boost/trunk/libs/range/test/string.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/test/string.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,10 +17,7 @@
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
-#include <boost/range/as_array.hpp>
-#include <boost/range/as_literal.hpp>
-#include <boost/range/functions.hpp>
-#include <boost/range/metafunctions.hpp>
+#include <boost/range.hpp>
 #include <boost/static_assert.hpp>
 #include <boost/type_traits.hpp>
 #include <boost/test/test_tools.hpp>
@@ -29,66 +26,36 @@
 #include <fstream>
 #include <algorithm>
 
-template< class T >
-inline BOOST_DEDUCED_TYPENAME boost::range_iterator<T>::type
-str_begin( T& r )
-{
-    return boost::begin( as_literal(r) ); 
-}
-
-template< class T >
-inline BOOST_DEDUCED_TYPENAME boost::range_iterator<T>::type
-str_end( T& r )
-{
-    return boost::end( as_literal(r) ); 
-}
-
-template< class T >
-inline BOOST_DEDUCED_TYPENAME boost::range_size<T>::type
-str_size( const T& r )
-{
-    return boost::size( as_literal(r) ); 
-}
-
-template< class T >
-inline bool
-str_empty( T& r )
-{
-    return boost::empty( as_literal(r) ); 
-}
-
 template< typename Container, typename T >
 BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
 find( Container& c,  T value )
 {
-    return std::find( str_begin(c), str_end(c), 
-                      value );
+    return std::find( boost::begin( c ), boost::end( c ), value );
 }
 
 template< typename Container, typename T >
-BOOST_DEDUCED_TYPENAME boost::range_iterator<const Container>::type
+BOOST_DEDUCED_TYPENAME boost::range_const_iterator<Container>::type
 find( const Container& c, T value )
 {
-    return std::find( str_begin(c), str_end(c), 
-                      value );
+    return std::find( boost::begin( c ), boost::end( c ), value );
 }
 
 template< typename Container, typename T >
 BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
 find_mutable( Container& c,  T value )
-{ 
-    str_size( c );
-    return std::find( str_begin(c), str_end(c), 
-                      value );
+{
+    boost::size( c );
+    boost::end( c );
+    return std::find( boost::begin( c ), boost::end( c ), value );
 }
 
 template< typename Container, typename T >
-BOOST_DEDUCED_TYPENAME boost::range_iterator<const Container>::type
+BOOST_DEDUCED_TYPENAME boost::range_const_iterator<Container>::type
 find_const( const Container& c, T value )
 {
-    str_size( c );
-    return std::find( str_begin(c), str_end(c), 
-                      value );
+    boost::size( c );
+    boost::end( c );
+    return std::find( boost::begin( c ), boost::end( c ), value );
 }
 
 
@@ -105,66 +72,62 @@
 {
     typedef char*                  char_iterator_t;
     typedef char                   char_array_t[10];
-    const char*      char_s            = "a string";
-    char             my_string[]       = "another string";
-    const char       my_const_string[] = "another string";
-    const unsigned   my_string_length  = 14;
-    char*            char_s2           = "a string";
+    const char*      char_s           = "a string";
+    char             my_string[]      = "another string";
+    const unsigned   my_string_length = 14;
+    char*            char_s2          = "a string";
     
     BOOST_STATIC_ASSERT(( is_same<  range_value<char_iterator_t>::type, 
                                     detail::iterator_traits<char_iterator_t>::value_type>::value ));
     BOOST_STATIC_ASSERT(( is_same<  range_iterator<char_iterator_t>::type, char_iterator_t >::value ));
-
+    BOOST_STATIC_ASSERT(( is_same<  range_const_iterator<char_iterator_t>::type, const char* >::value ));
     BOOST_STATIC_ASSERT(( is_same<  range_difference<char_iterator_t>::type,                           
                                     ::std::ptrdiff_t >::value ));
     BOOST_STATIC_ASSERT(( is_same<  range_size<char_iterator_t>::type, std::size_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same<  range_iterator<char_iterator_t>::type, char_iterator_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same<  range_iterator<const char*>::type, const char* >::value ));
+    BOOST_STATIC_ASSERT(( is_same<  range_result_iterator<char_iterator_t>::type, char_iterator_t >::value ));
+    BOOST_STATIC_ASSERT(( is_same<  range_result_iterator<const char*>::type, const char* >::value ));
     
     BOOST_STATIC_ASSERT(( is_same< range_value<char_array_t>::type, 
                                     char>::value ));
     BOOST_STATIC_ASSERT(( is_same< range_iterator<char_array_t>::type, char* >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<const char_array_t>::type, const char* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_const_iterator<char_array_t>::type, const char* >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_difference<char_array_t>::type,                           
                                     ::std::ptrdiff_t >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<char_array_t>::type, std::size_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<char_array_t>::type, char* >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<const char_array_t>::type, const char* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<char_array_t>::type, char* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const char_array_t>::type, const char* >::value ));
 
-    BOOST_CHECK_EQUAL( str_begin( char_s ), char_s );
-    std::size_t sz = str_size(char_s);
-    const char* str_end1 = str_begin( char_s ) + sz; 
-    BOOST_CHECK_EQUAL( str_end( char_s ), str_end1 );
-    BOOST_CHECK_EQUAL( str_empty( char_s ), (char_s == 0 || char_s[0] == char()) );
+    BOOST_CHECK_EQUAL( begin( char_s ), char_s );
+    std::size_t sz = size( char_s );
+    const char* end1 = begin( char_s ) + sz; 
+    BOOST_CHECK_EQUAL( end( char_s ), end1 );
+    BOOST_CHECK_EQUAL( empty( char_s ), (char_s == 0 || char_s[0] == char()) );
     BOOST_CHECK_EQUAL( sz, std::char_traits<char>::length( char_s ) );
 /*    
-    BOOST_CHECK_EQUAL( str_begin( char_s2 ), char_s2 );
+    BOOST_CHECK_EQUAL( begin( char_s2 ), char_s2 );
     std::size_t sz2 = size( char_s2 );
-    const char* str_end12 = str_begin( char_s2 ) + sz;
-    BOOST_CHECK_EQUAL( str_end( char_s2 ), str_end12 );
+    const char* end12 = begin( char_s2 ) + sz;
+    BOOST_CHECK_EQUAL( end( char_s2 ), end12 );
     BOOST_CHECK_EQUAL( empty( char_s2 ), (char_s2 == 0 || char_s2[0] == char()) );
     BOOST_CHECK_EQUAL( sz2, std::char_traits<char>::length( char_s2 ) );
 */
-    BOOST_CHECK_EQUAL( str_begin( my_string ), my_string );
-    range_iterator<char_array_t>::type str_end2 = str_begin( my_string ) + str_size(my_string);
-    range_iterator<char_array_t>::type str_end3 = str_end(my_string);
-    BOOST_CHECK_EQUAL( str_end3, str_end2 );
-    BOOST_CHECK_EQUAL( str_empty( my_string ), (my_string == 0 || my_string[0] == char()) );
-    BOOST_CHECK_EQUAL( str_size( my_string ), my_string_length );
-    BOOST_CHECK_EQUAL( str_size( my_string ), std::char_traits<char>::length( my_string ) );
+    BOOST_CHECK_EQUAL( begin( my_string ), my_string );
+    range_iterator<char_array_t>::type end2 = begin( my_string ) + size( my_string );
+    range_iterator<char_array_t>::type end3 = end( my_string );
+    BOOST_CHECK_EQUAL( end3, end2 );
+    BOOST_CHECK_EQUAL( empty( my_string ), (my_string == 0 || my_string[0] == char()) );
+    BOOST_CHECK_EQUAL( size( my_string ), my_string_length );
+    BOOST_CHECK_EQUAL( size( my_string ), std::char_traits<char>::length( my_string ) );
 
     char to_search = 'n';
-    BOOST_CHECK( find_mutable( char_s, to_search ) != str_end( char_s ) );
-    BOOST_CHECK( find_const( char_s, to_search ) != str_end(char_s) );
+    BOOST_CHECK( find_mutable( char_s, to_search ) != end( char_s ) );
+    BOOST_CHECK( find_const( char_s, to_search ) != end( char_s ) );
 
-    BOOST_CHECK( find_mutable( my_string, to_search ) != str_end(my_string) );
-    BOOST_CHECK( find_const( my_string, to_search ) != str_end(my_string) );
+    BOOST_CHECK( find_mutable( my_string, to_search ) != end( my_string ) );
+    BOOST_CHECK( find_const( my_string, to_search ) != end( my_string ) );
 
-    BOOST_CHECK( find_mutable( char_s2, to_search ) != str_end(char_s) );   
-    BOOST_CHECK( find_const( char_s2, to_search ) != str_end(char_s2) );
-
-    BOOST_CHECK( find_const( as_array( my_string ), to_search ) != str_end(my_string) );
-    BOOST_CHECK( find_const( as_array( my_const_string ), to_search ) != str_end(my_string) );
+    BOOST_CHECK( find_mutable( char_s2, to_search ) != end( char_s2 ) );   
+    BOOST_CHECK( find_const( char_s2, to_search ) != end( char_s2 ) );   
 }
 
 
@@ -185,31 +148,31 @@
     BOOST_STATIC_ASSERT(( is_same< range_value<wchar_iterator_t>::type, 
                                    detail::iterator_traits<wchar_iterator_t>::value_type>::value ));
     BOOST_STATIC_ASSERT(( is_same< range_iterator<wchar_iterator_t>::type, wchar_iterator_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<const wchar_t*>::type, const wchar_t* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_const_iterator<wchar_iterator_t>::type, const wchar_t* >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_difference<wchar_iterator_t>::type,                           
                                    detail::iterator_traits<wchar_iterator_t>::difference_type >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<wchar_iterator_t>::type, std::size_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<wchar_iterator_t>::type, wchar_iterator_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<const wchar_t*>::type, const wchar_t* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<wchar_iterator_t>::type, wchar_iterator_t >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const wchar_t*>::type, const wchar_t* >::value ));
     
-    std::size_t sz = str_size( char_ws );
-    BOOST_CHECK_EQUAL( str_begin( char_ws ), char_ws );
-    BOOST_CHECK_EQUAL( str_end(char_ws), (str_begin( char_ws ) + sz) );
-    BOOST_CHECK_EQUAL( str_empty( char_ws ), (char_ws == 0 || char_ws[0] == wchar_t()) );
+    std::size_t sz = size( char_ws );
+    BOOST_CHECK_EQUAL( begin( char_ws ), char_ws );
+    BOOST_CHECK_EQUAL( end( char_ws ), (begin( char_ws ) + sz) );
+    BOOST_CHECK_EQUAL( empty( char_ws ), (char_ws == 0 || char_ws[0] == wchar_t()) );
     BOOST_CHECK_EQUAL( sz, std::char_traits<wchar_t>::length( char_ws ) );
  /*       
     std::size_t sz2 = size( char_ws2 );
-    BOOST_CHECK_EQUAL( str_begin( char_ws2 ), char_ws2 );
-    BOOST_CHECK_EQUAL( str_end( char_ws2 ), (begin( char_ws2 ) + sz2) );
+    BOOST_CHECK_EQUAL( begin( char_ws2 ), char_ws2 );
+    BOOST_CHECK_EQUAL( end( char_ws2 ), (begin( char_ws2 ) + sz2) );
     BOOST_CHECK_EQUAL( empty( char_ws2 ), (char_ws2 == 0 || char_ws2[0] == wchar_t()) );
     BOOST_CHECK_EQUAL( sz2, std::char_traits<wchar_t>::length( char_ws2 ) );
    */ 
     wchar_t to_search = L'n';
-    BOOST_CHECK( find( char_ws, to_search ) != str_end(char_ws) );    
+    BOOST_CHECK( find( char_ws, to_search ) != end( char_ws ) );    
 
 #if BOOST_WORKAROUND(_MSC_VER, BOOST_TESTED_AT(1300))
 
-    BOOST_CHECK( find( my_wstring, to_search ) != str_end(my_wstring) );
+    BOOST_CHECK( find( my_wstring, to_search ) != end( my_wstring ) );
 
 #endif  
 #endif
@@ -218,6 +181,7 @@
 
 }
 
+
 #include <boost/test/unit_test.hpp>
 using boost::unit_test::test_suite;
 

Modified: boost/trunk/libs/range/test/sub_range.cpp
===================================================================
--- boost/trunk/libs/range/test/sub_range.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/range/test/sub_range.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -90,21 +90,17 @@
     s.empty();
     r.size();
     s.size();
+    
+    irange singular_irange;
+    BOOST_CHECK( singular_irange.empty() );
+    BOOST_CHECK( singular_irange.size() == 0 );
+    
+    srange singular_srange;
+    BOOST_CHECK( singular_srange.empty() );
+    BOOST_CHECK( singular_srange.size() == 0 );
 
-    //
-    // As of range v2 not legal anymore.
-    //
-    //irange singular_irange;
-    //BOOST_CHECK( singular_irange.empty() );
-    //BOOST_CHECK( singular_irange.size() == 0 );
-    //
-    //srange singular_srange;
-    //BOOST_CHECK( singular_srange.empty() );
-    //BOOST_CHECK( singular_srange.size() == 0 );
-    //
-    //BOOST_CHECK( empty( singular_irange ) );
-    //BOOST_CHECK( empty( singular_srange ) );
-    //
+    BOOST_CHECK( empty( singular_irange ) );
+    BOOST_CHECK( empty( singular_srange ) );
 
     srange rr = make_iterator_range( str );
     BOOST_CHECK( rr.equal( r ) );

Modified: boost/trunk/libs/rational/rational_test.cpp
===================================================================
--- boost/trunk/libs/rational/rational_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/rational/rational_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,6 +14,7 @@
  */
 
 // Revision History
+// 18 Oct 06  Various fixes for old compilers (Joaquín M López Muñoz)
 // 27 Dec 05  Add testing for Boolean conversion operator (Daryle Walker)
 // 24 Dec 05  Change code to use Boost.Test (Daryle Walker)
 // 04 Mar 01  Patches for Intel C++ and GCC (David Abrahams)
@@ -127,7 +128,16 @@
             rational_type  r1, r2( 0 ), r3( 1 ), r4( -3 ), r5( 7, 2 ),
                            r6( 5, 15 ), r7( 14, -21 ), r8( -4, 6 ),
                            r9( -14, -70 );
-            parts const    result = { {r1, r2, r3, r4, r5, r6, r7, r8, r9} };
+            parts result;
+            result.parts_[0] = r1;
+            result.parts_[1] = r2;
+            result.parts_[2] = r3;
+            result.parts_[3] = r4;
+            result.parts_[4] = r5;
+            result.parts_[5] = r6;
+            result.parts_[6] = r7;
+            result.parts_[7] = r8;
+            result.parts_[8] = r9;
 
             return result;
         }
@@ -149,6 +159,13 @@
 typedef ::boost::mpl::list<short, int, long>     builtin_signed_test_types;
 typedef ::boost::mpl::list<short, int, long, MyInt>  all_signed_test_types;
 
+// Without these explicit instantiations, MSVC++ 6.5/7.0 does not find
+// some friend operators in certain contexts.
+::boost::rational<short> dummy1;
+::boost::rational<int>   dummy2;
+::boost::rational<long>  dummy3;
+::boost::rational<MyInt> dummy4;
+
 // Should there be tests with unsigned integer types?
 
 } // namespace
@@ -164,41 +181,37 @@
 // GCD tests
 BOOST_AUTO_TEST_CASE_TEMPLATE( gcd_test, T, all_signed_test_types )
 {
-    using boost::gcd;
-
-    BOOST_CHECK_EQUAL( gcd<T>(  1,  -1), static_cast<T>( 1) );
-    BOOST_CHECK_EQUAL( gcd<T>( -1,   1), static_cast<T>( 1) );
-    BOOST_CHECK_EQUAL( gcd<T>(  1,   1), static_cast<T>( 1) );
-    BOOST_CHECK_EQUAL( gcd<T>( -1,  -1), static_cast<T>( 1) );
-    BOOST_CHECK_EQUAL( gcd<T>(  0,   0), static_cast<T>( 0) );
-    BOOST_CHECK_EQUAL( gcd<T>(  7,   0), static_cast<T>( 7) );
-    BOOST_CHECK_EQUAL( gcd<T>(  0,   9), static_cast<T>( 9) );
-    BOOST_CHECK_EQUAL( gcd<T>( -7,   0), static_cast<T>( 7) );
-    BOOST_CHECK_EQUAL( gcd<T>(  0,  -9), static_cast<T>( 9) );
-    BOOST_CHECK_EQUAL( gcd<T>( 42,  30), static_cast<T>( 6) );
-    BOOST_CHECK_EQUAL( gcd<T>(  6,  -9), static_cast<T>( 3) );
-    BOOST_CHECK_EQUAL( gcd<T>(-10, -10), static_cast<T>(10) );
-    BOOST_CHECK_EQUAL( gcd<T>(-25, -10), static_cast<T>( 5) );
+    BOOST_CHECK_EQUAL( boost::gcd<T>(  1,  -1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( boost::gcd<T>( -1,   1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( boost::gcd<T>(  1,   1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( boost::gcd<T>( -1,  -1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( boost::gcd<T>(  0,   0), static_cast<T>( 0) );
+    BOOST_CHECK_EQUAL( boost::gcd<T>(  7,   0), static_cast<T>( 7) );
+    BOOST_CHECK_EQUAL( boost::gcd<T>(  0,   9), static_cast<T>( 9) );
+    BOOST_CHECK_EQUAL( boost::gcd<T>( -7,   0), static_cast<T>( 7) );
+    BOOST_CHECK_EQUAL( boost::gcd<T>(  0,  -9), static_cast<T>( 9) );
+    BOOST_CHECK_EQUAL( boost::gcd<T>( 42,  30), static_cast<T>( 6) );
+    BOOST_CHECK_EQUAL( boost::gcd<T>(  6,  -9), static_cast<T>( 3) );
+    BOOST_CHECK_EQUAL( boost::gcd<T>(-10, -10), static_cast<T>(10) );
+    BOOST_CHECK_EQUAL( boost::gcd<T>(-25, -10), static_cast<T>( 5) );
 }
 
 // LCM tests
 BOOST_AUTO_TEST_CASE_TEMPLATE( lcm_test, T, all_signed_test_types )
 {
-    using boost::lcm;
-
-    BOOST_CHECK_EQUAL( lcm<T>(  1,  -1), static_cast<T>( 1) );
-    BOOST_CHECK_EQUAL( lcm<T>( -1,   1), static_cast<T>( 1) );
-    BOOST_CHECK_EQUAL( lcm<T>(  1,   1), static_cast<T>( 1) );
-    BOOST_CHECK_EQUAL( lcm<T>( -1,  -1), static_cast<T>( 1) );
-    BOOST_CHECK_EQUAL( lcm<T>(  0,   0), static_cast<T>( 0) );
-    BOOST_CHECK_EQUAL( lcm<T>(  6,   0), static_cast<T>( 0) );
-    BOOST_CHECK_EQUAL( lcm<T>(  0,   7), static_cast<T>( 0) );
-    BOOST_CHECK_EQUAL( lcm<T>( -5,   0), static_cast<T>( 0) );
-    BOOST_CHECK_EQUAL( lcm<T>(  0,  -4), static_cast<T>( 0) );
-    BOOST_CHECK_EQUAL( lcm<T>( 18,  30), static_cast<T>(90) );
-    BOOST_CHECK_EQUAL( lcm<T>( -6,   9), static_cast<T>(18) );
-    BOOST_CHECK_EQUAL( lcm<T>(-10, -10), static_cast<T>(10) );
-    BOOST_CHECK_EQUAL( lcm<T>( 25, -10), static_cast<T>(50) );
+    BOOST_CHECK_EQUAL( boost::lcm<T>(  1,  -1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( boost::lcm<T>( -1,   1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( boost::lcm<T>(  1,   1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( boost::lcm<T>( -1,  -1), static_cast<T>( 1) );
+    BOOST_CHECK_EQUAL( boost::lcm<T>(  0,   0), static_cast<T>( 0) );
+    BOOST_CHECK_EQUAL( boost::lcm<T>(  6,   0), static_cast<T>( 0) );
+    BOOST_CHECK_EQUAL( boost::lcm<T>(  0,   7), static_cast<T>( 0) );
+    BOOST_CHECK_EQUAL( boost::lcm<T>( -5,   0), static_cast<T>( 0) );
+    BOOST_CHECK_EQUAL( boost::lcm<T>(  0,  -4), static_cast<T>( 0) );
+    BOOST_CHECK_EQUAL( boost::lcm<T>( 18,  30), static_cast<T>(90) );
+    BOOST_CHECK_EQUAL( boost::lcm<T>( -6,   9), static_cast<T>(18) );
+    BOOST_CHECK_EQUAL( boost::lcm<T>(-10, -10), static_cast<T>(10) );
+    BOOST_CHECK_EQUAL( boost::lcm<T>( 25, -10), static_cast<T>(50) );
 }
 
 BOOST_AUTO_TEST_SUITE_END()
@@ -569,17 +582,15 @@
 // Conversion test
 BOOST_AUTO_TEST_CASE( rational_cast_test )
 {
-    using boost::rational_cast;
-
     // Note that these are not generic.  The problem is that rational_cast<T>
     // requires a conversion from IntType to T.  However, for a user-defined
     // IntType, it is not possible to define such a conversion except as an
     // "operator T()".  This causes problems with overloading resolution.
     boost::rational<int> const  half( 1, 2 );
 
-    BOOST_CHECK_CLOSE( rational_cast<double>(half), 0.5, 0.01 );
-    BOOST_CHECK_EQUAL( rational_cast<int>(half), 0 );
-    BOOST_CHECK_EQUAL( rational_cast<MyInt>(half), MyInt() );
+    BOOST_CHECK_CLOSE( boost::rational_cast<double>(half), 0.5, 0.01 );
+    BOOST_CHECK_EQUAL( boost::rational_cast<int>(half), 0 );
+    BOOST_CHECK_EQUAL( boost::rational_cast<MyInt>(half), MyInt() );
 }
 
 // Dice tests (a non-main test)

Deleted: boost/trunk/libs/regex/build/Jamfile
===================================================================
--- boost/trunk/libs/regex/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,267 +0,0 @@
-# copyright John Maddock 2003
-
-subproject libs/regex/build ;
-# bring in the rules for testing
-import testing ;
-
-#
-# ICU configuration:
-#
-rule check-icu-config ( )
-{
-   if ! $(gICU_CONFIG_CHECKED)
-   {
-      if $(ICU_PATH)
-      {
-         dir += $(ICU_PATH) ;
-      }
-      
-      if [ GLOB $(dir)$(SLASH)include$(SLASH)unicode : utypes.h ]
-      {
-         ECHO Building Boost.Regex with Unicode/ICU support enabled ;
-         ECHO Using ICU in $(ICU_PATH:J=" ")$(SLASH)include ;
-         gHAS_ICU = true ;
-         
-         # try and find ICU libraries, look for NT versions first:
-         if $(ICU_LINK)
-         {
-            gICU_LIBS += <linkflags>$(ICU_LINK) ;
-         }
-         else if [ GLOB $(dir)$(SLASH)lib : icuuc.* ]
-         {
-            gICU_LIBS += <find-library>icuuc ;
-            if ($(ICU_PATH) != /usr) && ($(ICU_PATH) != /usr/local)
-            {
-               gICU_LIBS += <library-path>$(ICU_PATH)/lib ;
-            }
-         }
-         else if [ GLOB $(dir)$(SLASH)lib : libicuuc.* ]
-         {
-            gICU_LIBS += <find-library>icuuc ;
-            if ($(ICU_PATH) != /usr) && ($(ICU_PATH) != /usr/local)
-            {
-               gICU_LIBS += <library-path>$(ICU_PATH)/lib ;
-            }
-         }
-         else if [ GLOB $(ICU_PATH)/lib : cygicuuc.dll ]
-         {
-            gICU_LIBS += <library-file>$(ICU_PATH)/lib/cygicuuc.dll ;
-         }
-         else if [ GLOB $(ICU_PATH)/lib : cygicuuc32.dll ]
-         {
-            gICU_LIBS += <library-file>$(ICU_PATH)/lib/cygicuuc32.dll ;
-         }
-         else if [ GLOB /usr/local/lib : cygicuuc.dll ]
-         {
-            gICU_LIBS += <library-file>/usr/local/lib/cygicuuc.dll ;
-         }
-         else
-         {
-            ECHO WARNING: ICU shared common library not found in path. ;
-            ECHO HINT:    If the regex library fails to link then try again ;
-            ECHO          with the environment variable ICU_LINK set to contain ;
-            ECHO          the linker options required to link to ICU. ;
-            ECHO          Defaulting to look for libicuuc ... ;
-            gICU_LIBS += <find-library>icuuc ;
-         }
-         
-         if $(ICU_LINK)
-         {
-            # gICU_LIBS += <linkflags>$(ICU_LINK) ;
-         }
-         else if [ GLOB $(dir)$(SLASH)lib : icuin.* ]
-         {
-            gICU_LIBS += <find-library>icuin ;
-            if ($(ICU_PATH) != /usr) && ($(ICU_PATH) != /usr/local)
-            {
-               gICU_LIBS += <library-path>$(ICU_PATH)/lib ;
-            }
-         }
-         else if [ GLOB $(dir)$(SLASH)lib : libicui18n.* ]
-         {
-            gICU_LIBS += <find-library>icui18n ;
-            if ($(ICU_PATH) != /usr) && ($(ICU_PATH) != /usr/local)
-            {
-               gICU_LIBS += <library-path>$(ICU_PATH)/lib ;
-            }
-         }
-         else if [ GLOB $(ICU_PATH)/lib : cygicuin.dll ]
-         {
-            gICU_LIBS += <library-file>$(ICU_PATH)/lib/cygicuin.dll ;
-         }
-         else if [ GLOB $(ICU_PATH)/lib : cygicuin32.dll ]
-         {
-            gICU_LIBS += <library-file>$(ICU_PATH)/lib/cygicuin32.dll ;
-         }
-         else if [ GLOB /usr/local/lib : cygicuin.dll ]
-         {
-            gICU_LIBS += <library-file>/usr/local/lib/cygicuin.dll ;
-         }
-         else
-         {
-            ECHO ICU shared i18n library not found. ;
-            ECHO HINT: Set the environment variable ICU_LINK to contain ;
-            ECHO       the linker options required to link to ICU. ;
-            
-            ECHO WARNING: ICU shared i18n library not found in path. ;
-            ECHO HINT:    If the regex library fails to link then try again ;
-            ECHO          with the environment variable ICU_LINK set to contain ;
-            ECHO          the linker options required to link to ICU. ;
-            ECHO          Defaulting to look for libicui18n ... ;
-            gICU_LIBS += <find-library>icui18n ;
-         }
-      }
-      else
-      {
-         if $(HAVE_ICU)
-         {
-            gHAS_ICU = true ;
-            gICU_CONFIG_CHECKED = true ;
-            if $(ICU_LINK)
-            {
-               gICU_LIBS += <linkflags>$(ICU_LINK) ;
-            }
-            else
-            {
-               gICU_LIBS += <find-library>icui18n ;
-               gICU_LIBS += <find-library>icuuc ;
-            }
-            ECHO Building Boost.Regex with Unicode/ICU support enabled ;
-            ECHO ICU must be installed in your compilers search paths for this ;
-            ECHO "option to work: define ICU_PATH to point to ICU's true location" ;
-            ECHO "if it's installed elsewhere" ;
-         }
-         else
-         {
-            ECHO Building Boost.Regex with the optional Unicode/ICU support disabled. ;
-            ECHO Please refer to the Boost.Regex documentation for more information ;
-            ECHO (and if you don't know what ICU is then you probably don't need it). ;
-            if $(ICU_PATH)
-            {
-               ECHO Couldn't find utypes.h in $(ICU_PATH:J=" ")$(SLASH)include$(SLASH)unicode ;
-            }
-         }
-      }
-      gICU_CONFIG_CHECKED = true ;
-   }
-    if $(gHAS_ICU)
-    {
-        return true ;
-    }
-}
-
-if [ check-icu-config ]
-{
-   BOOST_REGEX_ICU_OPTS = "<define>BOOST_HAS_ICU=1" ;
-   if $(gICU_LIBS)
-   {
-      BOOST_REGEX_ICU_OPTS += $(gICU_LIBS) ;
-      # this one is required for VC++ :
-      BOOST_REGEX_ICU_TEST_OPTS = "<native-wchar_t>off" ;
-   }
-   if $(ICU_PATH)
-   {
-      if ($(ICU_PATH) != /usr) && ($(ICU_PATH) != /usr/local)
-      {
-         BOOST_REGEX_ICU_OPTS += "<sysinclude>$(ICU_PATH)/include" ;
-      }
-      #BOOST_REGEX_ICU_OPTS += "<library-path>$(ICU_PATH)/lib" ;
-   }
-   # ECHO "BOOST_REGEX_ICU_OPTS =" $(BOOST_REGEX_ICU_OPTS) ;
-}
-
-#
-# this template defines the options common to
-# all regex builds and tests:
-#
-template regex-options
-   : # sources
-   : # requirements
-     <debug><define>BOOST_REGEX_CONFIG_INFO=1
-     <sysinclude>$(BOOST_ROOT)
-     # <native-wchar_t>on
-     # como requires this:
-     <como-4_3_3-vc7_1><*><define>BOOST_REGEX_NO_W32=1
-     <como-4_3_3-vc7_1><*><define>BOOST_SP_DISABLE_THREADS=1
-     $(BOOST_REGEX_ICU_OPTS)
-   ;
-template regex-test-options
-   : # sources
-   : # requirements
-     $(BOOST_REGEX_ICU_TEST_OPTS)
-   ;
-
-#
-# this template defines the options common to
-# all regex dll builds and tests:
-#
-template regex-dll-options
-   : <template>regex-options # sources
-   : # requirements
-     <define>BOOST_REGEX_DYN_LINK=1      
-     <runtime-link>dynamic
-   ;
-
-#
-# this template defines extra settings required to work 
-# around STLPort defects when used with msvc 6:
-#
-template msvc-stlport-tricky
-   : # sources
-   : <msvc-stlport><*><runtime-build>release
-     <define>BOOST_ALL_NO_LIB=1
-   ;
-
-SOURCES = 
-   c_regex_traits.cpp
-   cpp_regex_traits.cpp
-   cregex.cpp
-   fileiter.cpp
-   icu.cpp
-   instances.cpp
-   posix_api.cpp
-   regex.cpp
-   regex_debug.cpp
-   regex_raw_buffer.cpp
-   regex_traits_defaults.cpp
-   static_mutex.cpp
-   w32_regex_traits.cpp
-   wc_regex_traits.cpp
-   wide_posix_api.cpp
-   winstances.cpp 
-   usinstances.cpp ;
-   
-       
-lib boost_regex : ../src/$(SOURCES) <template>regex-options
-    : 
-        common-variant-tag
-    : 
-        debug release
-    ;
-
-
-dll boost_regex : ../src/$(SOURCES) <template>regex-dll-options
-    : 
-        common-variant-tag
-    : 
-        debug release
-    ;
-    
-stage stage/lib : <lib>boost_regex <dll>boost_regex
-    :
-        <locate>$(BOOST_ROOT)
-        common-variant-tag
-        <target>stage
-        <target>all
-    :
-        debug release
-    ;
-
-install regex lib
-    : <dll>boost_regex <lib>boost_regex
-    ;
-
-
-
-
-

Modified: boost/trunk/libs/regex/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/regex/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 project boost/regex
     : source-location ../src
@@ -10,65 +14,110 @@
 rule check-icu-config ( )
 {
    local ICU_PATH = [ modules.peek : ICU_PATH ] ;
+   local HAVE_ICU = [ modules.peek : HAVE_ICU ] ;
+   local ICU_LINK = [ modules.peek : ICU_LINK ] ;
+
    if ! $(gICU_CONFIG_CHECKED)
    {
-      if $(ICU_PATH)
+      if $(HAVE_ICU)
       {
+         gHAS_ICU = true ;
+         gICU_CORE_LIB = icuuc ;
+         gICU_IN_LIB = icui18n ;
+         gICU_CONFIG_CHECKED = true ;
+      }
+      else if $(ICU_PATH)
+      {
          dir = $(ICU_PATH) ;
-      }
       
-      if [ GLOB $(dir)/include/unicode : utypes.h ]
-      {
-         ECHO Building Boost.Regex with Unicode/ICU support enabled ;
-         ECHO Using ICU in $(ICU_PATH:J=" ")/include ;
-         gHAS_ICU = true ;
-         
-         # try and find ICU libraries, look for NT versions first:
-         if [ GLOB $(dir)/lib : icuuc.* ]
+         if [ GLOB $(dir)/include/unicode : utypes.h ]
          {
-            gICU_CORE_LIB = icuuc ;
+            ECHO Building Boost.Regex with Unicode/ICU support enabled ;
+            ECHO Using ICU in $(ICU_PATH:J=" ")/include ;
+            gHAS_ICU = true ;
+            
+            # try and find ICU libraries, look for NT versions first:
+            if $(ICU_LINK)
+            {
+               gICU_LIBS += <linkflags>$(ICU_LINK) ;
+            }
+            else if [ GLOB $(dir)/lib64 : icuuc.* ]
+            {
+               gICU_CORE_LIB = icuuc ;
+            }
+            else if [ GLOB $(dir)/lib : libicuuc.* ]
+            {
+               gICU_CORE_LIB = icuuc ;
+            }
+            else if [ GLOB $(dir)/lib : libicuuc.* ]
+            {
+               gICU_CORE_LIB = icuuc ;
+            }
+            else if [ GLOB $(ICU_PATH)/lib : cygicuuc.dll ]
+            {
+               gICU_CORE_LIB = cygicuuc.dll ;
+            }
+            else if [ GLOB $(ICU_PATH)/lib : cygicuuc32.dll ]
+            {
+               gICU_CORE_LIB = cygicuuc32.dll ;
+            }
+            else
+            {
+               ECHO WARNING: ICU shared common library not found in path. ;
+               ECHO HINT:    If the regex library fails to link then try again ;
+               ECHO          with the environment variable ICU_LINK set to contain ;
+               ECHO          the linker options required to link to ICU. ;
+               ECHO          Defaulting to look for libicuuc ... ;
+               gICU_CORE_LIB = icuuc ;
+            }
+            
+            if $(ICU_LINK)
+            {
+               # nothing to do, it's already been done!
+               # gICU_LIBS += <linkflags>$(ICU_LINK) ;
+            }
+            else if [ GLOB $(dir)/lib : icuin.* ]
+            {
+               gICU_IN_LIB = icuin ;
+            }
+            else if [ GLOB $(dir)/lib64 : libicui18n.* ]
+            {
+               gICU_IN_LIB = icui18n ;
+            }
+            else if [ GLOB $(dir)/lib : libicui18n.* ]
+            {
+               gICU_IN_LIB = icui18n ;
+            }
+            else if [ GLOB $(ICU_PATH)/lib : cygicuin.dll ]
+            {
+               gICU_IN_LIB = cygicuin.dll ;
+            }
+            else if [ GLOB $(ICU_PATH)/lib : cygicuin32.dll ]
+            {
+               gICU_IN_LIB = cygicuin32.dll ;
+            }
+            else
+            {
+               ECHO WARNING: ICU shared i18n library not found in path. ;
+               ECHO HINT:    If the regex library fails to link then try again ;
+               ECHO          with the environment variable ICU_LINK set to contain ;
+               ECHO          the linker options required to link to ICU. ;
+               ECHO          Defaulting to look for libicui18n ... ;
+               gICU_IN_LIB = icui18n ;
+            }
          }
-         else if [ GLOB $(dir)/lib : libicuuc.* ]
-         {
-            gICU_CORE_LIB = icuuc ;
-         }
-         else if [ GLOB $(ICU_PATH)/lib : cygicuuc.dll ]
-         {
-            gICU_CORE_LIB = cygicuuc.dll ;
-         }
          else
          {
-            ECHO ICU shared common library not found. ;
+            ECHO Building Boost.Regex with the optional Unicode/ICU support disabled. ;
+            ECHO Please refer to the Boost.Regex documentation for more information ;
+            ECHO (don't panic: this is a strictly optional feature). ;
+            if $(ICU_PATH)
+            {
+               ECHO Couldn't find utypes.h in $(ICU_PATH:J=" ")/include/unicode ;
+            }
          }
-         
-         if [ GLOB $(dir)/lib : icuin.* ]
-         {
-            gICU_IN_LIB = icuin ;
-         }
-         else if [ GLOB $(dir)/lib : libicui18n.* ]
-         {
-            gICU_IN_LIB = icui18n ;
-         }
-         else if [ GLOB $(ICU_PATH)/lib : cygicuin.dll ]
-         {
-            gICU_IN_LIB = cygicuin.dll ;
-         }
-         else
-         {
-            ECHO ICU shared i18n library not found. ;
-         }
+         gICU_CONFIG_CHECKED = true ;
       }
-      else
-      {
-         ECHO Building Boost.Regex with the optional Unicode/ICU support disabled. ;
-         ECHO Please refer to the Boost.Regex documentation for more information ;
-         ECHO (and if you don't know what ICU is then you probably don't need it). ;
-         if $(ICU_PATH)
-         {
-            ECHO Couldn't find utypes.h in $(ICU_PATH:J=" ")$(SLASH)include$(SLASH)unicode ;
-         }
-      }
-      gICU_CONFIG_CHECKED = true ;
    }
     if $(gHAS_ICU)
     {
@@ -79,9 +128,15 @@
 if [ check-icu-config ]
 {
    BOOST_REGEX_ICU_OPTS = "<define>BOOST_HAS_ICU=1" ;
-   if ($(ICU_PATH) != /usr) && ($(ICU_PATH) != /usr/local)
+
+   if $(ICU_PATH)
    {
-      ICU_SEARCH_OPTS = <search>/$(ICU_PATH)/lib ;
+      if $(ICU_PATH) != "/usr" && $(ICU_PATH) != "/usr/local"
+      {
+         ECHO "BAH!" ;
+         BOOST_REGEX_ICU_OPTS += "<include>$(ICU_PATH)/include" ;
+         ICU_SEARCH_OPTS = <search>/$(ICU_PATH)/lib ;
+      }
    }
    
    if $(gICU_CORE_LIB)
@@ -94,13 +149,6 @@
       lib icuin : : <name>$(gICU_IN_LIB) $(ICU_SEARCH_OPTS) ;
       ICU_EXTRA_SOURCE += icuin ;
    }
-   if $(ICU_PATH)
-   {
-      if ($(ICU_PATH) != /usr) && ($(ICU_PATH) != /usr/local)
-      {
-         BOOST_REGEX_ICU_OPTS += "<include>$(ICU_PATH)/include" ;
-      }
-   }
 }
 
 SOURCES = 
@@ -128,5 +176,11 @@
         #<link>static:<define>BOOST_REGEX_NO_LIB=1
         #<link>static:<define>BOOST_REGEX_STATIC_LINK=1
 	     <link>shared:<define>BOOST_REGEX_DYN_LINK=1
+	     <toolset>gcc-mw:<link>static
+	     <toolset>gcc-mingw:<link>static
 	     $(BOOST_REGEX_ICU_OPTS)
     ;
+
+
+
+

Modified: boost/trunk/libs/regex/build/bc_gen.sh
===================================================================
--- boost/trunk/libs/regex/build/bc_gen.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/bc_gen.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #! /bin/bash
 
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
+
 libname=""
 src=""
 header=""
@@ -192,6 +197,10 @@
 	bcb_gen_lib
 	
 	cat > $out << EOF
+# copyright John Maddock 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.
 #
 # auto generated makefile for C++ Builder
 #
@@ -259,3 +268,4 @@
 
 
 
+

Modified: boost/trunk/libs/regex/build/bcb6.mak
===================================================================
--- boost/trunk/libs/regex/build/bcb6.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/bcb6.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 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.
 #
 # auto generated makefile for C++ Builder
 #

Modified: boost/trunk/libs/regex/build/common.sh
===================================================================
--- boost/trunk/libs/regex/build/common.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/common.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 #
 # locate all the header dependencies:
 for file in ../../../boost/regex/*.hpp ; do
@@ -53,3 +57,4 @@
 boost_version=$(grep 'define.*BOOST_LIB_VERSION' ../../../boost/version.hpp | sed 's/.*"\([^"]*\)".*/\1/')
 echo Boost version tag = $boost_version
 
+

Modified: boost/trunk/libs/regex/build/gcc.mak
===================================================================
--- boost/trunk/libs/regex/build/gcc.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/gcc.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 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.
 #
 # auto generated makefile for gcc compiler
 #

Modified: boost/trunk/libs/regex/build/gcc_gen.sh
===================================================================
--- boost/trunk/libs/regex/build/gcc_gen.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/gcc_gen.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #! /bin/bash
 
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
+
 libname=""
 src=""
 header=""
@@ -103,6 +108,10 @@
 	
 	
 	cat > $out << EOF
+# copyright John Maddock 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.
 #
 # auto generated makefile for gcc compiler
 #
@@ -260,3 +269,5 @@
 
 
 
+
+

Modified: boost/trunk/libs/regex/build/generic.mak
===================================================================
--- boost/trunk/libs/regex/build/generic.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/generic.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 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.
 #
 # auto generated makefile for generic compiler
 #

Modified: boost/trunk/libs/regex/build/generic_gen.sh
===================================================================
--- boost/trunk/libs/regex/build/generic_gen.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/generic_gen.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #! /bin/bash
 
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
+
 libname=""
 src=""
 header=""
@@ -87,6 +92,10 @@
 	gen_gen_lib
 	
 	cat > $out << EOF
+# copyright John Maddock 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.
 #
 # auto generated makefile for generic compiler
 #
@@ -142,3 +151,4 @@
 rm -f $tout $iout
 
 
+

Modified: boost/trunk/libs/regex/build/sun_gen.sh
===================================================================
--- boost/trunk/libs/regex/build/sun_gen.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/sun_gen.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #! /bin/bash
 
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
+
 libname=""
 src=""
 header=""
@@ -145,6 +150,10 @@
 	
 	
 	cat > $out << EOF
+# copyright John Maddock 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.
 #
 # auto generated makefile for Sun Forte 6.1
 #
@@ -212,3 +221,5 @@
 rm -f $tout $iout
 
 
+
+

Modified: boost/trunk/libs/regex/build/sunpro.mak
===================================================================
--- boost/trunk/libs/regex/build/sunpro.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/sunpro.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 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.
 #
 # auto generated makefile for Sun Forte 6.1
 #

Modified: boost/trunk/libs/regex/build/vc6-stlport.mak
===================================================================
--- boost/trunk/libs/regex/build/vc6-stlport.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/vc6-stlport.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 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.
 #
 # auto generated makefile for VC6+STLPort
 #

Modified: boost/trunk/libs/regex/build/vc6.mak
===================================================================
--- boost/trunk/libs/regex/build/vc6.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/vc6.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 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.
 #
 # auto generated makefile for VC6 compiler
 #

Modified: boost/trunk/libs/regex/build/vc7-stlport.mak
===================================================================
--- boost/trunk/libs/regex/build/vc7-stlport.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/vc7-stlport.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 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.
 #
 # auto generated makefile for VC6+STLPort
 #

Modified: boost/trunk/libs/regex/build/vc7.mak
===================================================================
--- boost/trunk/libs/regex/build/vc7.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/vc7.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 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.
 #
 # auto generated makefile for VC6 compiler
 #

Modified: boost/trunk/libs/regex/build/vc71-stlport.mak
===================================================================
--- boost/trunk/libs/regex/build/vc71-stlport.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/vc71-stlport.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 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.
 #
 # auto generated makefile for VC6+STLPort
 #

Modified: boost/trunk/libs/regex/build/vc71.mak
===================================================================
--- boost/trunk/libs/regex/build/vc71.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/vc71.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 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.
 #
 # auto generated makefile for VC6 compiler
 #

Modified: boost/trunk/libs/regex/build/vc8.mak
===================================================================
--- boost/trunk/libs/regex/build/vc8.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/vc8.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 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.
 #
 # auto generated makefile for VC6 compiler
 #

Modified: boost/trunk/libs/regex/build/vc_gen.sh
===================================================================
--- boost/trunk/libs/regex/build/vc_gen.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/build/vc_gen.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #! /bin/bash
 
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
+
 libname=""
 src=""
 header=""
@@ -187,6 +192,10 @@
     fi
    	
 	cat > $out << EOF
+# copyright John Maddock 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.
 #
 # auto generated makefile for VC6 compiler
 #
@@ -315,6 +324,10 @@
 	vc6_gen_lib
 	
 	cat > $out << EOF
+# copyright John Maddock 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.
 #
 # auto generated makefile for VC6+STLPort
 #
@@ -474,3 +487,5 @@
 
 
 
+
+

Modified: boost/trunk/libs/regex/doc/error_type.html
===================================================================
--- boost/trunk/libs/regex/doc/error_type.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/doc/error_type.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -129,12 +129,11 @@
          24 June 2004&nbsp; 
          <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
       </p>
-      <P><I>© Copyright <a href="mailto:jm at regex.fsnet.co.uk">John Maddock</a>&nbsp;1998-<!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%Y" startspan --> 2004<!--webbot bot="Timestamp" endspan i-checksum="39359" --></I></P>
-      <P align="left"><I>Permission to use, copy, modify, distribute and sell this software 
-            and its documentation for any purpose is hereby granted without fee, provided 
-            that the above copyright notice appear in all copies and that both that 
-            copyright notice and this permission notice appear in supporting documentation. 
-            John Maddock makes no representations about the suitability of this software 
-            for any purpose. It is provided "as is" without express or implied warranty.</I></P>
+      <p><i>© Copyright John Maddock&nbsp;1998- 
+            <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%Y" startspan -->  2004<!--webbot bot="Timestamp" endspan i-checksum="39359" --></i></p>
+      <P><I>Use, modification and distribution are subject to the Boost Software License, 
+            Version 1.0. (See accompanying file <A href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</A>
+            or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>)</I></P>
    </body>
 </html>
+

Modified: boost/trunk/libs/regex/doc/gcc-performance.html
===================================================================
--- boost/trunk/libs/regex/doc/gcc-performance.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/doc/gcc-performance.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -534,6 +534,10 @@
       <br>
       <br>
       <hr>
-      <p>Copyright John Maddock April 2003, all rights reserved.</p>
+      <p><i>© Copyright John Maddock&nbsp;2003</i></p>
+      <P><I>Use, modification and distribution are subject to the Boost Software License, 
+            Version 1.0. (See accompanying file <A href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</A>
+            or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>)</I></P>
    </body>
 </html>
+

Modified: boost/trunk/libs/regex/doc/history.html
===================================================================
--- boost/trunk/libs/regex/doc/history.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/doc/history.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -26,9 +26,15 @@
       <p></p>
       <P>Boost 1.34</P>
       <UL>
-      	<LI>
-      	Fix for non-greedy repeats and partial matches not working correctly in some cases.
-      	</LI>
+         <LI>
+         Fix for non-greedy repeats and partial matches not working correctly in some 
+         cases.
+         <LI>
+         Fix for non-greedy repeats on VC++ not working in some cases (bug report 
+         1515830).
+         <LI>
+            Changed match_results::position() to return a valid result when *this 
+            represents a partial match.</LI>
       </UL>
       <P>Boost 1.33.1</P>
       <UL>
@@ -159,7 +165,7 @@
          <HR>
       <P></P>
       <p>Revised&nbsp; 
-         <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
+         <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan --> 
          28 June 2004&nbsp; 
          <!--webbot bot="Timestamp" endspan i-checksum="39359" --></p>
       <p><i>© Copyright John Maddock&nbsp;1998- 
@@ -169,4 +175,3 @@
             or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>)</I></P>
    </body>
 </html>
-

Modified: boost/trunk/libs/regex/doc/index.html
===================================================================
--- boost/trunk/libs/regex/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,8 +7,8 @@
       <link rel="stylesheet" type="text/css" href="../../../boost.css">
    </head>
    <body>
-      <p></p>
-      <table id="Table1" cellspacing="1" cellpadding="1" width="100%" border="0">
+      <table summary="contains the boost libraries logo and a page header"
+			 id="Table1" cellspacing="1" cellpadding="1" width="100%" border="0">
          <tr>
             <td valign="top" width="300">
                <h3><a href="../../../index.htm"><img height="86" width="277" alt="C++ Boost" src="../../../boost.png" border="0"></a></h3>
@@ -31,7 +31,7 @@
                   and setup</a> <dt><a href="install.html">Installation</a>
                   <dd>
                      <dl class="index">
-                        <dt><a href="install.html#bjam">Building with bjam (prefered)</a> 
+                        <dt><a href="install.html#bjam">Building with bjam (preferred)</a> 
                         <dt><a href="install.html#unicode">Building with Unicode/ICU support</a>
                         <dt><a href="install.html#make">Building via Makefiles</a> 
                         <dd><dl class="index">
@@ -42,7 +42,8 @@
                            <dt><a href="install.html#sun">
                                           Sun Forte Compiler</a> 
                            <dt><a href="install.html#other">Other compilers</a>
-                        </dl></dd></dt>
+													 </dt>
+                        </dl></dd>
                      </dl>
                      <dt>Backgrounders
                         <dd>
@@ -55,7 +56,6 @@
                                        <dt><a href="syntax_basic.html">POSIX-Basic Regular Expressions</a></dt>
                                     </dl>
                                  </dd>
-                              </dt>
                               <dt><a href="format_syntax.html">Format String Syntax</a>
                                  <dd>
                                     <dl class="index">
@@ -64,7 +64,6 @@
                                        <dt><a href="format_boost_syntax.html">Boost-Extended Format Syntax</a></dt>
                                     </dl>
                                  </dd>
-                              </dt>
                               <dt><a href="partial_matches.html">Partial matches: matches against incomplete or infinitely long texts</a> 
                               <dt><a href="captures.html">Understanding Captures</a></dt>
                               <dt><a href="unicode.html">Unicode Support (requires ICU)</a></dt>
@@ -76,7 +75,7 @@
                                     </dl>
                                  </dd>
                            </dl>
-                        </dd></dt>
+                        </dd>
                      <dt>Reference
                         <dd>
                            <dl class="index">

Modified: boost/trunk/libs/regex/doc/install.html
===================================================================
--- boost/trunk/libs/regex/doc/install.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/doc/install.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,16 +49,20 @@
             support</A> via ICU.&nbsp; There is no need to enable this support if you 
          don't need it, but if you use ICU for your Unicode support already, and want to 
          work with Unicode-aware regular expressions then read on.</P>
+      <P>Most of the information you will need is in the <A href="../../../more/getting_started.html">
+            getting started guide</A>, the only additional step you need to take is to 
+         tell bjam that you want Boost.Regex to use ICU and optionally to tell bjam 
+         where ICU is located.</P>
       <P>If you're building on a Unix-like platform, and ICU is already installed in 
          you're compilers search path (with an install&nbsp;prefix of /usr or /usr/local 
          for example), then set the environment variable HAVE_ICU to enable ICU 
          support.&nbsp; For example you might build with the command line:</P>
-      <PRE>bjam -sHAVE_ICU=1 -sTOOLS=<A href="../../../more/getting_started.html#Tools">my-compiler</A></PRE>
+      <PRE>bjam -sHAVE_ICU=1 --toolset=<A href="../../../more/getting_started/windows.html#toolset-name">toolset-name</A> install</PRE>
       <P>If ICU is not already in your compilers path then you need to set the 
          environment variable ICU_PATH to point to the route directory of your ICU 
          installation, for example if ICU was installed to /usr/local/icu/3.3 you might 
          use:</P>
-      <PRE>bjam -sICU_PATH=/usr/local/icu/3.3 -sTOOLS=<A href="../../../more/getting_started.html#Tools" >my-compiler</A></PRE>
+      <PRE>bjam -sICU_PATH=/usr/local/icu/3.3 --toolset=<A href="../../../more/getting_started/windows.html#toolset-name">toolset-name</A> install</PRE>
       <P>Note that ICU is a C++ library just like Boost is, as such your copy of ICU 
          must have been built with the same C++ compiler (and compiler version) that you 
          are using to build Boost.&nbsp; <STRONG>Boost.Regex will not work correctly unless 
@@ -244,7 +248,7 @@
          <HR>
       <P></P>
       <p>Revised&nbsp; 
-         <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan --> 
+         <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
          09 Jan 2005&nbsp; 
          <!--webbot bot="Timestamp" endspan i-checksum="39359" --></p>
       <p><i>© Copyright John Maddock&nbsp;1998- 

Modified: boost/trunk/libs/regex/doc/introduction.html
===================================================================
--- boost/trunk/libs/regex/doc/introduction.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/doc/introduction.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -70,7 +70,7 @@
          that you need to reuse.</P>
       <P>Now let's take that expression and place it in some C++ code to validate the 
          format of a credit card number:</P>
-      <PRE><B>bool</B> validate_card_format(<B>const</B> std::string s)
+      <PRE><B>bool</B> validate_card_format(<B>const</B> std::string& s)
 {
    <B>static</B> <B>const</B> <A href="basic_regex.html">boost::regex</A> e("(\\d{4}[- ]){3}\\d{4}");
    <B>return</B> <A href="regex_match.html">regex_match</A>(s, e);
@@ -178,3 +178,4 @@
             or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>)</I></P>
    </body>
 </html>
+

Modified: boost/trunk/libs/regex/doc/match_results.html
===================================================================
--- boost/trunk/libs/regex/doc/match_results.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/doc/match_results.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -300,7 +300,9 @@
 </pre>
       <b></b>
       <p><b>Effects:</b> Returns the starting location of sub-expression <EM>sub</EM>, 
-         or -1 if <EM>sub</EM> was not matched <code>.</code></p>
+         or -1 if <EM>sub</EM> was not matched.&nbsp; Note that if this represents a <A href="partial_matches.html">
+            partial match</A> , then <code>position()</code> will return the location of 
+         the partial match even though <code>(*this)[0].matched</code> is <EM>false</EM>.</p>
       <pre><A name=m6></A>
 string_type str(int sub = 0)const;
 </pre>

Modified: boost/trunk/libs/regex/doc/regex_replace.html
===================================================================
--- boost/trunk/libs/regex/doc/regex_replace.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/doc/regex_replace.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -244,7 +244,7 @@
       </PRE>
       <HR>
       <p>Revised&nbsp; 
-         <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan --> 
+         <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
          26 June 2004&nbsp; 
          <!--webbot bot="Timestamp" endspan i-checksum="39359" --></p>
       <p><i>© Copyright John Maddock&nbsp;1998- 

Modified: boost/trunk/libs/regex/doc/syntax_leftmost_longest.html
===================================================================
--- boost/trunk/libs/regex/doc/syntax_leftmost_longest.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/doc/syntax_leftmost_longest.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,7 +24,7 @@
       </P>
       <HR>
       <p></p>
-      <P>Often there is more that one way of matching a regular expression at a 
+      <P>Often there is more than one way of matching a regular expression at a 
          particular location, for POSIX basic and extended regular expressions, the 
          "best" match is determined as follows:</P>
       <OL>

Modified: boost/trunk/libs/regex/doc/vc71-performance.html
===================================================================
--- boost/trunk/libs/regex/doc/vc71-performance.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/doc/vc71-performance.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -694,6 +694,10 @@
          </table>
       </P>
       <hr>
-      <p>Copyright John Maddock April 2003, all rights reserved.</p>
+      <p><i>© Copyright John Maddock&nbsp;2003</i></p>
+      <P><I>Use, modification and distribution are subject to the Boost Software License, 
+            Version 1.0. (See accompanying file <A href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</A>
+            or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>)</I></P>
    </body>
 </html>
+

Deleted: boost/trunk/libs/regex/example/Jamfile
===================================================================
--- boost/trunk/libs/regex/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,117 +0,0 @@
-# copyright John Maddock 2003
-
-subproject libs/regex/example ;
-
-# bring in the rules for testing
-import testing  ;
-
-#
-# test for MFC by looking inside VC++ include directories:
-#
-if ! $(gMFC_CHECK)
-{
-   gMFC_CHECK = true ;
-   if $(VS71COMNTOOLS)
-   {
-      VS71COMNTOOLS = $(VS71COMNTOOLS:J=" ") ;
-      if [ GLOB $(VS71COMNTOOLS)..\\..\\VC7\\atlmfc\\include : cstringt.h ]
-      {
-         ECHO MFC/ATL regex wrappers will be tested when building with VC7.1 ;
-         REGEX_MFC_OPTS += "<vc-7_1><*><define>TEST_MFC=1" ;
-      }
-   }
-   if $(VSCOMNTOOLS)
-   {
-      VSCOMNTOOLS = $(VSCOMNTOOLS:J=" ") ;
-      if [ GLOB $(VSCOMNTOOLS)\\..\\..\\VC7\\atlmfc\\include : cstringt.h ]
-      {
-         ECHO MFC/ATL regex wrappers will be tested when building with VC7 ;
-         REGEX_MFC_OPTS += "<vc7><*><define>TEST_MFC=1" ;
-         REGEX_MFC_OPTS += "<vc7-stlport><*><define>TEST_MFC=1" ;
-         REGEX_MFC_OPTS += "<vc-7_0><*><define>TEST_MFC=1" ;
-         REGEX_MFC_OPTS += "<vc-7_0-stlport><*><define>TEST_MFC=1" ;
-      }
-   }
-   if $(VS80COMNTOOLS)
-   {
-      VS80COMNTOOLS = $(VS80COMNTOOLS:J=" ") ;
-      if [ GLOB $(VS80COMNTOOLS)..\\..\\VC8\\atlmfc\\include : cstringt.h ]
-      {
-         ECHO MFC/ATL regex wrappers will be tested when building with VC8 ;
-         REGEX_MFC_OPTS += "<vc-8_0><*><define>TEST_MFC=1" ;
-      }
-   }
-}
-
-rule regex-test-run ( sources + : input * : requirements * )
-{
-        return [ 
-           run
-             # sources
-             $(sources)
-             <template>../build/regex-test-options
-
-             # dependencies
-             <lib>../build/boost_regex
-         :  # additional args
-            $(input)
-         :  # test-files
-         :  # requirements
-         <threading>multi
-         $(REGEX_MFC_OPTS)
-         $(requirements)
-         :  # test name
-        ] ;
-}
-
-test-suite regex-examples :
-
-[ regex-test-run timer/regex_timer.cpp <template>../build/msvc-stlport-tricky : $(BOOST_ROOT)/libs/regex/example/timer/input_script.txt ]
-[ regex-test-run grep/grep.cpp <lib>../../program_options/build/boost_program_options : -n -b $(BOOST_ROOT)/boost/regex.hpp $(BOOST_ROOT)/boost/type_traits.hpp : std::locale-support ]
-[ regex-test-run snippets/credit_card_example.cpp ]
-[ regex-test-run snippets/mfc_example.cpp ]
-[ regex-test-run snippets/icu_example.cpp ]
-[ regex-test-run snippets/partial_regex_grep.cpp : $(BOOST_ROOT)/libs/regex/index.htm ]
-[ regex-test-run snippets/partial_regex_match.cpp : 1234-5678-8765-4 ]
-[ regex-test-run snippets/regex_grep_example_1.cpp : $(BOOST_ROOT)/boost/rational.hpp ]
-[ regex-test-run snippets/regex_grep_example_2.cpp : $(BOOST_ROOT)/boost/rational.hpp ]
-[ regex-test-run snippets/regex_grep_example_3.cpp : $(BOOST_ROOT)/boost/rational.hpp ]
-[ regex-test-run snippets/regex_grep_example_4.cpp : $(BOOST_ROOT)/boost/rational.hpp ]
-[ regex-test-run snippets/regex_match_example.cpp : -auto ]
-[ regex-test-run snippets/regex_merge_example.cpp : $(BOOST_ROOT)/boost/rational.hpp ]
-[ regex-test-run snippets/regex_replace_example.cpp : $(BOOST_ROOT)/boost/rational.hpp ]
-[ regex-test-run snippets/regex_search_example.cpp : $(BOOST_ROOT)/boost/rational.hpp ]
-[ regex-test-run snippets/regex_split_example_1.cpp : -auto ]
-[ regex-test-run snippets/regex_split_example_2.cpp : $(BOOST_ROOT)/libs/regex/doc/index.html ]
-[ regex-test-run snippets/regex_token_iterator_eg_1.cpp : -auto ]
-[ regex-test-run snippets/regex_token_iterator_eg_2.cpp : $(BOOST_ROOT)/libs/regex/doc/index.html ]
-[ regex-test-run snippets/regex_iterator_example.cpp : $(BOOST_ROOT)/boost/rational.hpp ]
-
-[ run
-    # sources
-    snippets/captures_example.cpp
-    <template>../build/regex-options
-    # dependencies
-    <lib>../test/captures/boost_regex_extra
- :  # additional args
- :  # test-files
- :  # requirements
-    <threading>multi
-    <define>BOOST_REGEX_MATCH_EXTRA=1
-    <define>BOOST_REGEX_NO_LIB=1
- :  # test name
-    captures_example
- ]
-
-
-;
-
-
-
-
-
-
-
-
-
-

Modified: boost/trunk/libs/regex/example/Jamfile.v2
===================================================================
--- boost/trunk/libs/regex/example/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/example/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,14 @@
 # copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 project
     : requirements <threading>multi <link>shared:<define>BOOST_REGEX_DYN_LINK=1
     ;
 
 
-rule regex-test-run ( sources + : input * )
+rule regex-test-run ( sources + : input * : name * )
 {
         return [ 
            run
@@ -18,13 +21,14 @@
          :  # test-files
          :  # requirements
          :  # test name
+            $(name)
         ] ;
 }
 
 test-suite regex-examples :
 
 [ regex-test-run timer/regex_timer.cpp : $(BOOST_ROOT)/libs/regex/example/timer/input_script.txt ]
-[ regex-test-run grep/grep.cpp ../../program_options/build//boost_program_options/<link>static : -n -b $(BOOST_ROOT)/boost/regex.hpp $(BOOST_ROOT)/boost/type_traits.hpp ]
+[ regex-test-run grep/grep.cpp ../../program_options/build//boost_program_options/<link>static : -n -b $(BOOST_ROOT)/boost/regex.hpp $(BOOST_ROOT)/boost/type_traits.hpp : test_grep ]
 [ regex-test-run snippets/credit_card_example.cpp ]
 [ regex-test-run snippets/mfc_example.cpp ]
 [ regex-test-run snippets/icu_example.cpp ]
@@ -54,3 +58,5 @@
 
 
 
+
+

Modified: boost/trunk/libs/regex/example/timer/bc55.mak
===================================================================
--- boost/trunk/libs/regex/example/timer/bc55.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/example/timer/bc55.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 # very basic makefile for timer.exe
 #
@@ -44,3 +48,4 @@
 
 
 
+

Modified: boost/trunk/libs/regex/example/timer/bcb4.mak
===================================================================
--- boost/trunk/libs/regex/example/timer/bcb4.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/example/timer/bcb4.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 # very basic makefile for timer.exe
 #
@@ -44,3 +48,4 @@
 
 
 
+

Modified: boost/trunk/libs/regex/example/timer/bcb5.mak
===================================================================
--- boost/trunk/libs/regex/example/timer/bcb5.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/example/timer/bcb5.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 # very basic makefile for timer.exe
 #
@@ -44,3 +48,4 @@
 
 
 
+

Modified: boost/trunk/libs/regex/example/timer/gcc.mak
===================================================================
--- boost/trunk/libs/regex/example/timer/gcc.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/example/timer/gcc.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 # very basic makefile for timer.exe
 #
@@ -31,3 +35,4 @@
 
 
 
+

Modified: boost/trunk/libs/regex/example/timer/vc6-stlport.mak
===================================================================
--- boost/trunk/libs/regex/example/timer/vc6-stlport.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/example/timer/vc6-stlport.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 #
 # very basic VC6 makefile for timer
 #
@@ -32,3 +36,4 @@
 
 
 
+

Modified: boost/trunk/libs/regex/example/timer/vc6.mak
===================================================================
--- boost/trunk/libs/regex/example/timer/vc6.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/example/timer/vc6.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 #
 # very basic VC6 makefile for timer
 #
@@ -32,3 +36,4 @@
 
 
 
+

Modified: boost/trunk/libs/regex/index.html
===================================================================
--- boost/trunk/libs/regex/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,10 @@
    </head>
    <body>
       Automatic redirection failed, please go to <A href="doc/index.html">doc/index.html</A>.
+      <P>Copyright&nbsp;John Maddock 2003</P>
+      <P>Distributed under the Boost Software License, Version 1.0. (See accompanying file <A href="../../LICENSE_1_0.txt">
+            LICENSE_1_0.txt</A> or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</A>).</P>
    </body>
 </html>
 
+

Deleted: boost/trunk/libs/regex/performance/Jamfile
===================================================================
--- boost/trunk/libs/regex/performance/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/performance/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,45 +0,0 @@
-# copyright John Maddock 2003
-
-subproject libs/regex/performance ;
-
-SOURCES = command_line main time_boost time_greta time_localised_boost time_pcre time_dynamic_xpressive time_posix time_safe_greta ;
-
-if $(HS_REGEX_PATH)
-{
-   HS_SOURCES = $(HS_REGEX_PATH)/regcomp.c $(HS_REGEX_PATH)/regerror.c $(HS_REGEX_PATH)/regexec.c $(HS_REGEX_PATH)/regfree.c ;
-   POSIX_OPTS = <define>BOOST_HAS_POSIX=1 <include>$(HS_REGEX_PATH) ;
-}
-else if $(USE_POSIX)
-{
-   POSIX_OPTS = <define>BOOST_HAS_POSIX=1 ;
-}
-
-if $(PCRE_PATH)
-{
-   PCRE_SOURCES = $(PCRE_PATH)/chartables.c $(PCRE_PATH)/get.c $(PCRE_PATH)/pcre.c $(PCRE_PATH)/study.c ;
-   PCRE_OPTS = <define>BOOST_HAS_PCRE=1 <include>$(PCRE_PATH) ;
-}
-else if $(USE_PCRE)
-{
-   PCRE_OPTS = <define>BOOST_HAS_PCRE=1 <find-library>pcre ;
-}
-
-
-exe regex_comparison : 
-    $(SOURCES).cpp
-    $(HS_SOURCES)
-    $(PCRE_SOURCES)
-    <lib>../build/boost_regex
-    <lib>../../test/build/boost_prg_exec_monitor
-    : 
-    <include>$(BOOST_ROOT)
-    <define>BOOST_REGEX_NO_LIB=1
-    <define>BOOST_REGEX_STATIC_LINK=1
-    $(POSIX_OPTS)
-    $(PCRE_OPTS)
-    ;
-
-
-
-
-

Copied: boost/trunk/libs/regex/performance/Jamfile.v2 (from rev 14034, boost/branches/upstream/current/libs/regex/performance/Jamfile.v2)

Modified: boost/trunk/libs/regex/performance/main.cpp
===================================================================
--- boost/trunk/libs/regex/performance/main.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/performance/main.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -261,5 +261,4 @@
    return 0;
 }
 
-#include <boost/test/included/prg_exec_monitor.hpp>
 

Modified: boost/trunk/libs/regex/src/usinstances.cpp
===================================================================
--- boost/trunk/libs/regex/src/usinstances.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/src/usinstances.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -46,7 +46,7 @@
 template _CRTIMP2 bool __cdecl operator>(
    const basic_string<unsigned short, char_traits<unsigned short>, allocator<unsigned short> >&,
    const basic_string<unsigned short, char_traits<unsigned short>, allocator<unsigned short> >&);
-#if BOOST_WORKAROUND(BOOST_MSVC, > 1300) && BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1400)
+#if BOOST_WORKAROUND(BOOST_MSVC, > 1300) && BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1400))
 template<> _CRTIMP2 std::size_t __cdecl char_traits<unsigned short>::length(unsigned short const*);
 #endif
 }
@@ -57,3 +57,4 @@
 
 #endif
 
+

Deleted: boost/trunk/libs/regex/test/Jamfile
===================================================================
--- boost/trunk/libs/regex/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,234 +0,0 @@
-# copyright John Maddock 2003
-
-subproject libs/regex/test ;
-
-# bring in the rules for testing
-import testing ;
-subinclude libs/regex/test/captures ;
-
-R_SOURCE = 
-basic_tests.cpp
-main.cpp
-test_alt.cpp
-test_anchors.cpp
-test_asserts.cpp
-test_backrefs.cpp
-test_deprecated.cpp
-test_emacs.cpp
-test_escapes.cpp
-test_grep.cpp
-test_locale.cpp
-test_mfc.cpp
-test_non_greedy_repeats.cpp
-test_perl_ex.cpp
-test_replace.cpp
-test_sets.cpp
-test_simple_repeats.cpp
-test_tricky_cases.cpp
-test_icu.cpp
-test_unicode.cpp
-test_overloads.cpp
-test_operators.cpp
-;
-
-#
-# test for MFC by looking inside VC++ include directories:
-#
-if ! $(gMFC_CHECK)
-{
-   gMFC_CHECK = true ;
-   if $(VS71COMNTOOLS)
-   {
-      VS71COMNTOOLS = $(VS71COMNTOOLS:J=" ") ;
-      if [ GLOB $(VS71COMNTOOLS)..\\..\\VC7\\atlmfc\\include : cstringt.h ]
-      {
-         ECHO MFC/ATL regex wrappers will be tested when building with VC7.1 ;
-         REGEX_MFC_OPTS += "<vc-7_1><*><define>TEST_MFC=1" ;
-      }
-   }
-   if $(VSCOMNTOOLS)
-   {
-      VSCOMNTOOLS = $(VSCOMNTOOLS:J=" ") ;
-      if [ GLOB $(VSCOMNTOOLS)\\..\\..\\VC7\\atlmfc\\include : cstringt.h ]
-      {
-         ECHO MFC/ATL regex wrappers will be tested when building with VC7 ;
-         REGEX_MFC_OPTS += "<vc7><*><define>TEST_MFC=1" ;
-         REGEX_MFC_OPTS += "<vc7-stlport><*><define>TEST_MFC=1" ;
-         REGEX_MFC_OPTS += "<vc-7_0><*><define>TEST_MFC=1" ;
-         REGEX_MFC_OPTS += "<vc-7_0-stlport><*><define>TEST_MFC=1" ;
-      }
-   }
-   if $(VS80COMNTOOLS)
-   {
-      VS80COMNTOOLS = $(VS80COMNTOOLS:J=" ") ;
-      if [ GLOB $(VS80COMNTOOLS)..\\..\\VC8\\atlmfc\\include : cstringt.h ]
-      {
-         ECHO MFC/ATL regex wrappers will be tested when building with VC8 ;
-         REGEX_MFC_OPTS += "<vc-8_0><*><define>TEST_MFC=1" ;
-      }
-   }
-}
-
-#
-# this template defines the options common to
-# all regex tests:
-#
-template test 
-   : <template>../build/regex-options 
-     <template>../build/regex-test-options
-     <lib>../build/boost_regex            # sources
-   : <threading>multi
-     $(REGEX_MFC_OPTS)
-   ;
- 
-#
-# this template defines the options common to
-# all builds of the test/regression program:
-#
-template regression
-    : <template>test                    # sources
-      regress/$(R_SOURCE)
-    ;
-
-#
-# rule for simple regex test programs:
-#
-rule regex-test ( name : sources + : requirements * : input-files * )
-{
-    return [ run $(sources)
-               :
-               : $(input-files)
-               : $(requirements)
-               : $(name) ] ;
-}
-
-#
-# this template defines the options common to
-# all regex dll tests:
-#
-template test-dll 
-   : <template>../build/regex-dll-options 
-     <template>../build/regex-test-options
-     <dll>../build/boost_regex            # sources
-   : <threading>multi
-   ;
- 
-#
-# this template defines the options common to
-# all builds of the test/regression program:
-#
-template regression-dll
-    : <template>test-dll                    # sources
-      regress/$(R_SOURCE)
-    ;
-
-test-suite regex
-      : 
-      [ regex-test regex_regress
-          : <template>regression     # sources
-          :                          # requirements
-          :                          # input files
-      ]
-
-      [ regex-test posix_api_check
-          : <template>test                      # sources
-            c_compiler_checks/posix_api_check.c
-      ]
-
-      [ compile <template>test c_compiler_checks/wide_posix_api_check.c 
-          : : wide_posix_api_check_c ]
-
-      [ regex-test posix_api_check_cpp
-          : <template>test                      # sources
-            c_compiler_checks/posix_api_check.cpp
-      ]
-
-      [ regex-test wide_posix_api_check_cpp
-          : <template>test                      # sources
-            c_compiler_checks/wide_posix_api_check.cpp
-      ]
-
-      [ regex-test bad_expression_test
-          : <template>test                      # sources
-            pathology/bad_expression_test.cpp
-            
-      ]
-
-      [ regex-test recursion_test
-          : <template>test                      # sources
-            pathology/recursion_test.cpp
-            
-      ]
-      
-      [ run unicode/unicode_iterator_test.cpp ]
-      
-      [ regex-test static_mutex_test
-          : <template>test-dll                  # sources
-            static_mutex/static_mutex_test.cpp
-            <dll>../../thread/build/boost_thread
-          : <define>BOOST_THREAD_USE_DLL=1
-      ]
-      [ regex-test object_cache_test
-          : <template>test                      # sources
-            object_cache/object_cache_test.cpp
-      ]
-      
-      [ run config_info/regex_config_info.cpp <template>test 
-      : : : <test-info>always_show_run_output ]
-
-      [ run config_info/regex_config_info.cpp <template>test-dll 
-      : : : <test-info>always_show_run_output
-      : regex_dll_config_info ]
-
-      [ run collate_info/collate_info.cpp <template>test
-      : : : <test-info>always_show_run_output ]
-      
-      [ regex-test regex_regress_dll
-          : <template>regression-dll     # sources
-          :                              # requirements
-          :                              # input files
-      ]
-
-      [ compile concepts/concept_check.cpp
-      ]
-      [ compile concepts/icu_concept_check.cpp
-      ]
-      
-     [ run
-    # sources
-    captures/captures_test.cpp
-    <template>../build/regex-options
-    # dependencies
-    <lib>captures/boost_regex_extra
-    
- :  # additional args
- :  # test-files
- :  # requirements
-    <threading>multi
-    <define>BOOST_REGEX_MATCH_EXTRA=1
-    <define>BOOST_REGEX_NO_LIB=1
- :  # test name
-    captures_test
- ]
-
-;
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

Modified: boost/trunk/libs/regex/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/regex/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,7 @@
 # copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 project
     : requirements <threading>multi <link>shared:<define>BOOST_REGEX_DYN_LINK=1
@@ -58,6 +61,14 @@
         : # requirements
         : regex_regress_dll ]
 
+      [ run regress/$(R_SOURCE) ../build//boost_regex
+                                ../../thread/build//boost_thread
+        : # command line
+        : # input files
+        : # requirements
+        <define>TEST_THREADS
+        : regex_regress_threaded ]
+
       [ regex-test posix_api_check : c_compiler_checks/posix_api_check.c ]
 
       [ compile c_compiler_checks/wide_posix_api_check.c 
@@ -97,7 +108,7 @@
       ]    
 
       [ run collate_info/collate_info.cpp ../build//boost_regex
-      : : : <test-info>always_show_run_output ]
+      : : : <test-info>always_show_run_output : test_collate_info ]
 
 
       [ compile concepts/concept_check.cpp ../build//boost_regex
@@ -119,4 +130,7 @@
     captures_test
  ]
 ;
-      
\ No newline at end of file
+      
+
+
+

Deleted: boost/trunk/libs/regex/test/captures/Jamfile
===================================================================
--- boost/trunk/libs/regex/test/captures/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/captures/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,30 +0,0 @@
-# copyright John Maddock 2003
-
-subproject libs/regex/test/captures ;
-
-EX_SOURCES = 
-   c_regex_traits.cpp
-   cpp_regex_traits.cpp
-   cregex.cpp
-   fileiter.cpp
-   instances.cpp
-   posix_api.cpp
-   regex.cpp
-   regex_debug.cpp
-   regex_raw_buffer.cpp
-   regex_traits_defaults.cpp
-   static_mutex.cpp
-   w32_regex_traits.cpp
-   wc_regex_traits.cpp
-   wide_posix_api.cpp
-   winstances.cpp
-   usinstances.cpp ;
-       
-lib boost_regex_extra : ../../src/$(EX_SOURCES) <template>../../build/regex-options
-    : 
-        <define>BOOST_REGEX_MATCH_EXTRA=1
-    : 
-    ;
-
-
-

Modified: boost/trunk/libs/regex/test/captures/Jamfile.v2
===================================================================
--- boost/trunk/libs/regex/test/captures/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/captures/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,7 @@
 # copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 project
     : source-location ../../src
@@ -32,3 +35,4 @@
 
 
 
+

Modified: boost/trunk/libs/regex/test/object_cache/object_cache_test.cpp
===================================================================
--- boost/trunk/libs/regex/test/object_cache/object_cache_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/object_cache/object_cache_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -48,7 +48,7 @@
    int i;
    for(i = 0; i < 20; ++i)
    {
-      boost::shared_ptr<test_object> p = boost::object_cache<int, test_object>::get(i, max_cache_size);
+      boost::shared_ptr<const test_object> p = boost::object_cache<int, test_object>::get(i, max_cache_size);
       BOOST_CHECK(p->value() == i);
       p = boost::object_cache<int, test_object>::get(i, max_cache_size);
       BOOST_CHECK(p->value() == i);
@@ -63,7 +63,7 @@
    {
       for(i = 20 - max_cache_size; i < 20; ++i)
       {
-         boost::shared_ptr<test_object> p = boost::object_cache<int, test_object>::get(i, max_cache_size);
+         boost::shared_ptr<const test_object> p = boost::object_cache<int, test_object>::get(i, max_cache_size);
          BOOST_CHECK(p->value() == i);
          p = boost::object_cache<int, test_object>::get(i, max_cache_size);
          BOOST_CHECK(p->value() == i);
@@ -75,3 +75,4 @@
 
 #include <boost/test/included/test_exec_monitor.hpp>
 
+

Modified: boost/trunk/libs/regex/test/pathology/bad_expression_test.cpp
===================================================================
--- boost/trunk/libs/regex/test/pathology/bad_expression_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/pathology/bad_expression_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -44,6 +44,12 @@
    BOOST_CHECK_THROW(boost::regex_search(bad_text, what, e2), std::runtime_error);
    BOOST_CHECK(boost::regex_search(good_text, what, e2));
 
+   bad_text.assign((std::string::size_type)500000, 'a');
+   e2.assign("aaa*@");
+   BOOST_CHECK_THROW(0 == boost::regex_search(bad_text, what, e2), std::runtime_error);
+   good_text.assign((std::string::size_type)5000, 'a');
+   BOOST_CHECK(0 == boost::regex_search(good_text, what, e2));
+
    return 0;
 }
 

Modified: boost/trunk/libs/regex/test/profile/Makefile
===================================================================
--- boost/trunk/libs/regex/test/profile/Makefile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/profile/Makefile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2005
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 
 regress :
@@ -9,3 +13,4 @@
 
 
 
+

Modified: boost/trunk/libs/regex/test/regress/bcb6.mak
===================================================================
--- boost/trunk/libs/regex/test/regress/bcb6.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/bcb6.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 # very basic makefile for regress
 #
@@ -208,3 +212,4 @@
 
 
 
+

Modified: boost/trunk/libs/regex/test/regress/gcc.mak
===================================================================
--- boost/trunk/libs/regex/test/regress/gcc.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/gcc.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 # very basic makefile for regression tests
 #
@@ -67,3 +71,4 @@
 
 
 
+

Modified: boost/trunk/libs/regex/test/regress/info.hpp
===================================================================
--- boost/trunk/libs/regex/test/regress/info.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/info.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,6 +21,11 @@
 #include <iostream>
 #include <string>
 #include <boost/regex.hpp>
+
+#ifdef TEST_THREADS
+#include <boost/thread/once.hpp>
+#include <boost/thread.hpp>
+#endif
 //
 // class test info, 
 // store information about the test we are about to conduct:
@@ -45,10 +50,29 @@
       bool need_to_print;
       std::string expression_type_name;
    };
+#ifdef TEST_THREADS
+   static data_type& do_get_data()
+   {
+      static boost::thread_specific_ptr<data_type> pd;
+      if(pd.get() == 0)
+         pd.reset(new data_type());
+      return *(pd.get());
+   }
+   static void init_data()
+   {
+      do_get_data();
+   }
+#endif
    static data_type& data()
    {
+#ifdef TEST_THREADS
+      static boost::once_flag f = BOOST_ONCE_INIT;
+      boost::call_once(&init_data, f);
+      return do_get_data();
+#else
       static data_type d;
       return d;
+#endif
    }
 public:
    test_info_base(){};

Modified: boost/trunk/libs/regex/test/regress/main.cpp
===================================================================
--- boost/trunk/libs/regex/test/regress/main.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/main.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,9 +20,20 @@
 #include "test_locale.hpp"
 #include <stdarg.h>
 
+#ifdef TEST_THREADS
+#include <list>
+#include <boost/thread.hpp>
+#include <boost/thread/tss.hpp>
+#include <boost/shared_ptr.hpp>
+#include <boost/array.hpp>
+
+int* get_array_data();
+
+#endif
+
 int error_count = 0;
 
-int cpp_main(int /*argc*/, char * /*argv*/[])
+void run_tests()
 {
    basic_tests();
    test_simple_repeats();
@@ -47,14 +58,51 @@
    test_conditionals();
    test_options();
    test_options2();
+#ifndef TEST_THREADS
    test_en_locale();
+#endif
    test_emacs();
    test_operators();
    test_overloads();
    test_unicode();
+}
+
+int cpp_main(int /*argc*/, char * /*argv*/[])
+{
+#ifdef TEST_THREADS
+   get_array_data();  // initialises data.
+
+   std::list<boost::shared_ptr<boost::thread> > threads;
+   for(int i = 0; i < 10; ++i)
+   {
+      threads.push_back(boost::shared_ptr<boost::thread>(new boost::thread(&run_tests)));
+   }
+   std::list<boost::shared_ptr<boost::thread> >::const_iterator a(threads.begin()), b(threads.end());
+   while(a != b)
+   {
+      (*a)->join();
+      ++a;
+   }
+#else
+   run_tests();
+#endif
    return error_count;
 }
 
+#ifdef TEST_THREADS
+
+int* get_array_data()
+{
+   static boost::thread_specific_ptr<boost::array<int, 200> > tp;
+
+   if(tp.get() == 0)
+      tp.reset(new boost::array<int, 200>);
+
+   return tp.get()->data();
+}
+
+#endif
+
 const int* make_array(int first, ...)
 {
    //
@@ -63,7 +111,11 @@
    // our testing macros (ideally we would use an array literal
    // but these can't apparently be used as macro arguments).
    //
+#ifdef TEST_THREADS
+   int* data = get_array_data();
+#else
    static int data[200];
+#endif
    va_list ap;
    va_start(ap, first);
    //

Modified: boost/trunk/libs/regex/test/regress/sunpro.mak
===================================================================
--- boost/trunk/libs/regex/test/regress/sunpro.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/sunpro.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 # very basic makefile for regression tests
 # tests every library combination, static/dynamic/multimthread/singlethread/narrow/wide
@@ -138,3 +142,4 @@
 
 
 
+

Modified: boost/trunk/libs/regex/test/regress/test.hpp
===================================================================
--- boost/trunk/libs/regex/test/regress/test.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/test.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -58,7 +58,12 @@
 void do_test(const charT& c, const tagT& tag)
 {
 #ifndef BOOST_NO_STD_LOCALE
+#if BOOST_WORKAROUND(BOOST_MSVC, <= 1200) && defined(TEST_THREADS)
+   // typeid appears to fail in multithreaded environments:
+   test_info<charT>::set_typename("");
+#else
    test_info<charT>::set_typename(typeid(boost::basic_regex<charT, boost::cpp_regex_traits<charT> >).name());
+#endif
    boost::basic_regex<charT, boost::cpp_regex_traits<charT> > e1;
    static bool done_empty_test = false;
    if(done_empty_test == false)
@@ -72,13 +77,23 @@
       test(e1, tag);
 #endif
 #if !BOOST_WORKAROUND(__BORLANDC__, < 0x560)
+#if BOOST_WORKAROUND(BOOST_MSVC, <= 1200) && defined(TEST_THREADS)
+   // typeid appears to fail in multithreaded environments:
+   test_info<charT>::set_typename("");
+#else
    test_info<charT>::set_typename(typeid(boost::basic_regex<charT, boost::c_regex_traits<charT> >).name());
+#endif
    boost::basic_regex<charT, boost::c_regex_traits<charT> > e2;
    if(test_locale::c_locale_state() != test_locale::no_test)
       test(e2, tag);
 #endif
 #if defined(_WIN32) && !defined(BOOST_REGEX_NO_W32)
+#if BOOST_WORKAROUND(BOOST_MSVC, <= 1200) && defined(TEST_THREADS)
+   // typeid appears to fail in multithreaded environments:
+   test_info<charT>::set_typename("");
+#else
    test_info<charT>::set_typename(typeid(boost::basic_regex<charT, boost::w32_regex_traits<charT> >).name());
+#endif
    boost::basic_regex<charT, boost::w32_regex_traits<charT> > e3;
    if(test_locale::win_locale_state() == test_locale::test_with_locale)
       e3.imbue(test_locale::win_locale());
@@ -246,3 +261,4 @@
 
 
 #endif
+

Modified: boost/trunk/libs/regex/test/regress/test_alt.cpp
===================================================================
--- boost/trunk/libs/regex/test/regress/test_alt.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/test_alt.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -42,5 +42,9 @@
    TEST_REGEX_SEARCH("a|", basic|bk_vbar, "a|", match_default, make_array(0, 2, -2, -2));
    TEST_REGEX_SEARCH("a\\|b", basic|bk_vbar, "a", match_default, make_array(0, 1, -2, -2));
    TEST_REGEX_SEARCH("a\\|b", basic|bk_vbar, "b", match_default, make_array(0, 1, -2, -2));
+   TEST_REGEX_SEARCH("a\nb", grep, "b", match_default, make_array(0, 1, -2, -2));
+   TEST_REGEX_SEARCH("a\nb", grep, "a", match_default, make_array(0, 1, -2, -2));
+   TEST_REGEX_SEARCH("a\nb", egrep, "b", match_default, make_array(0, 1, -2, -2));
+   TEST_REGEX_SEARCH("a\nb", egrep, "a", match_default, make_array(0, 1, -2, -2));
 }
 

Modified: boost/trunk/libs/regex/test/regress/test_non_greedy_repeats.cpp
===================================================================
--- boost/trunk/libs/regex/test/regress/test_non_greedy_repeats.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/test_non_greedy_repeats.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -35,6 +35,10 @@
    TEST_REGEX_SEARCH("abc|\\w+?", perl, "abcd", match_default, make_array(0, 3, -2, 3, 4, -2, -2));
    TEST_REGEX_SEARCH("<\\s*tag[^>]*>(.*?)<\\s*/tag\\s*>", perl, " <tag>here is some text</tag> <tag></tag>", match_default, make_array(1, 29, 6, 23, -2, 30, 41, 35, 35, -2, -2));
    TEST_REGEX_SEARCH("<\\s*tag[^>]*>(.*?)<\\s*/tag\\s*>", perl, " < tag attr=\"something\">here is some text< /tag > <tag></tag>", match_default, make_array(1, 49, 24, 41, -2, 50, 61, 55, 55, -2, -2));
+   TEST_REGEX_SEARCH("xx-{0,2}?(?:[+-][0-9])??\\z", perl, "xx--", match_default, make_array(0, 4, -2, -2));
+   TEST_REGEX_SEARCH("xx.{0,2}?(?:[+-][0-9])??\\z", perl, "xx--", match_default, make_array(0, 4, -2, -2));
+   TEST_REGEX_SEARCH("xx.{0,2}?(?:[+-][0-9])??\\z", perl, "xx--", match_default|match_not_dot_newline, make_array(0, 4, -2, -2));
+   TEST_REGEX_SEARCH("xx[/-]{0,2}?(?:[+-][0-9])??\\z", perl, "xx--", match_default, make_array(0, 4, -2, -2));
    TEST_INVALID_REGEX("a{1,3}{1}", perl);
    TEST_INVALID_REGEX("a**", perl);
    TEST_INVALID_REGEX("a++", perl);

Modified: boost/trunk/libs/regex/test/regress/test_regex_search.hpp
===================================================================
--- boost/trunk/libs/regex/test/regress/test_regex_search.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/test_regex_search.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -272,6 +272,77 @@
       // we should have had a match but didn't:
       BOOST_REGEX_TEST_ERROR("Expected match was not found.", charT);
    }
+#if !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
+   //
+   // and now both field splitting and $0:
+   //
+   std::vector<int> subs;
+   subs.push_back(-1);
+   subs.push_back(0);
+   start2 = test_iterator(search_text.begin(), search_text.end(), r, subs, opts);
+   copy2 = start2;
+   last_end2 = 0;
+   answer_table = test_info<charT>::answer_table();
+   while(start2 != end2)
+   {
+      if(start2 != copy2)
+      {
+         BOOST_REGEX_TEST_ERROR("Failed iterator != comparison.", charT);
+      }
+      if(!(start2 == copy2))
+      {
+         BOOST_REGEX_TEST_ERROR("Failed iterator == comparison.", charT);
+      }
+#ifdef BOOST_MSVC
+#pragma warning(push)
+#pragma warning(disable:4244)
+#endif
+      if(boost::re_detail::distance(search_text.begin(), start2->first) != last_end2)
+      {
+         BOOST_REGEX_TEST_ERROR(
+            "Error in location of start of field split, found: " 
+            << boost::re_detail::distance(search_text.begin(), start2->first)
+            << ", expected: "
+            << last_end2
+            << ".", charT);
+      }
+      int expected_end = static_cast<int>(answer_table[0] < 0 ? search_text.size() : answer_table[0]);
+      if(boost::re_detail::distance(search_text.begin(), start2->second) != expected_end)
+      {
+         BOOST_REGEX_TEST_ERROR(
+            "Error in location of end2 of field split, found: "
+            << boost::re_detail::distance(search_text.begin(), start2->second)
+            << ", expected: "
+            << expected_end
+            << ".", charT);
+      }
+#ifdef BOOST_MSVC
+#pragma warning(pop)
+#endif
+      last_end2 = answer_table[1];
+      ++start2;
+      ++copy2;
+      if((start2 == end2) && (answer_table[0] >= 0))
+      {
+         BOOST_REGEX_TEST_ERROR(
+            "Expected $0 match not found", charT);
+      }
+      if(start2 != end2)
+      {
+         test_sub_match(*start2, search_text.begin(), answer_table, 0);
+         ++start2;
+         ++copy2;
+      }
+      // move on the answer table to next set of answers;
+      if(*answer_table != -2)
+         while(*answer_table++ != -2){}
+   }
+   if(answer_table[0] >= 0)
+   {
+      // we should have had a match but didn't:
+      BOOST_REGEX_TEST_ERROR("Expected match was not found.", charT);
+   }
+#endif
 }
 
 template <class charT, class traits>

Modified: boost/trunk/libs/regex/test/regress/test_tricky_cases.cpp
===================================================================
--- boost/trunk/libs/regex/test/regress/test_tricky_cases.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/test_tricky_cases.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -373,6 +373,10 @@
    TEST_REGEX_SEARCH("\\l+", perl|icase, "abcXYZ", match_default, make_array(0, 6, -2, -2));
    TEST_REGEX_SEARCH("\\u+", perl|icase, "abcXYZ", match_default, make_array(0, 6, -2, -2));
    TEST_REGEX_SEARCH("(a)(?:b)", perl|nosubs, "ab", match_default, make_array(0, 2, -2, -2));
+   // bug reported 2006-09-20:
+   TEST_REGEX_SEARCH("(?:\\d{9}.*){2}", perl, "123456789dfsdfsdfsfsdfds123456789b", match_default, make_array(0, 34, -2, -2));
+   TEST_REGEX_SEARCH("(?:\\d{9}.*){2}", perl, "123456789dfsdfsdfsfsdfds12345678", match_default, make_array(-2, -2));
+   TEST_REGEX_SEARCH("(?:\\d{9}.*){2}", perl, "123456789dfsdfsdfsfsdfds", match_default, make_array(-2, -2));
 
 
    //

Deleted: boost/trunk/libs/regex/test/regress/tests.txt
===================================================================
--- boost/trunk/libs/regex/test/regress/tests.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/tests.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,1273 +0,0 @@
-; 
-; 
-; this file contains a script of tests to run through regress.exe
-;
-; comments start with a semicolon and proceed to the end of the line
-;
-; changes to regular expression compile flags start with a "-" as the first
-; non-whitespace character and consist of a list of the printable names
-; of the flags, for example "match_default"
-;
-; Other lines contain a test to perform using the current flag status
-; the first token contains the expression to compile, the second the string
-; to match it against. If the second string is "!" then the expression should
-; not compile, that is the first string is an invalid regular expression.
-; This is then followed by a list of integers that specify what should match,
-; each pair represents the starting and ending positions of a subexpression
-; starting with the zeroth subexpression (the whole match).
-; A value of -1 indicates that the subexpression should not take part in the
-; match at all, if the first value is -1 then no part of the expression should
-; match the string.
-;
-
-- match_default normal REG_EXTENDED
-
-;
-; try some really simple literals:
-a a 0 1
-Z Z 0 1
-Z aaa -1 -1
-Z xxxxZZxxx 4 5
-
-; and some simple brackets:
-(a) zzzaazz 3 4 3 4
-() zzz 0 0 0 0
-() "" 0 0 0 0
-( !
-) !
-(aa !
-aa) !
-a b -1 -1
-\(\) () 0 2
-\(a\) (a) 0 3
-\() !
-(\) !
-p(a)rameter ABCparameterXYZ 3 12 4 5
-[pq](a)rameter ABCparameterXYZ 3 12 4 5
-
-; now try escaped brackets:
-- match_default bk_parens REG_BASIC
-\(a\) zzzaazz 3 4 3 4
-\(\) zzz 0 0 0 0
-\(\) "" 0 0 0 0
-\( !
-\) !
-\(aa !
-aa\) !
-() () 0 2
-(a) (a) 0 3
-(\) !
-\() !
-
-; now move on to "." wildcards
-- match_default normal REG_EXTENDED REG_STARTEND
-. a 0 1
-. \n 0 1
-. \r 0 1
-. \0 0 1
-- match_default normal match_not_dot_newline REG_EXTENDED REG_STARTEND REG_NEWLINE
-. a 0 1
-. \n -1 -1
-. \r -1 -1
-. \0 0 1
-- match_default normal match_not_dot_null match_not_dot_newline REG_EXTENDED REG_STARTEND REG_NEWLINE
-. \n -1 -1
-. \r -1 -1
-; this *WILL* produce an error from the POSIX API functions:
-- match_default normal match_not_dot_null match_not_dot_newline REG_EXTENDED REG_STARTEND REG_NEWLINE REG_NO_POSIX_TEST
-. \0 -1 -1
-
-
-;
-; now move on to the repetion ops,
-; starting with operator *
-- match_default normal REG_EXTENDED
-a* b 0 0
-ab* a 0 1
-ab* ab 0 2
-ab* sssabbbbbbsss 3 10
-ab*c* a 0 1
-ab*c* abbb 0 4
-ab*c* accc 0 4
-ab*c* abbcc 0 5
-*a !
-\<* !
-\>* !
-\n* \n\n 0 2
-\** ** 0 2
-\* * 0 1
-
-; now try operator +
-ab+ a -1 -1
-ab+ ab 0 2
-ab+ sssabbbbbbsss 3 10
-ab+c+ a -1 -1
-ab+c+ abbb -1 -1
-ab+c+ accc -1 -1
-ab+c+ abbcc 0 5
-+a !
-\<+ !
-\>+ !
-\n+ \n\n 0 2
-\+ + 0 1
-\+ ++ 0 1
-\++ ++ 0 2
-- match_default normal bk_plus_qm REG_EXTENDED REG_NO_POSIX_TEST
-+ + 0 1
-\+ !
-a\+ aa 0 2
-
-; now try operator ?
-- match_default normal REG_EXTENDED
-a? b 0 0
-ab? a 0 1
-ab? ab 0 2
-ab? sssabbbbbbsss 3 5
-ab?c? a 0 1
-ab?c? abbb 0 2
-ab?c? accc 0 2
-ab?c? abcc 0 3
-?a !
-\<? !
-\>? !
-\n? \n\n 0 1
-\? ? 0 1
-\? ?? 0 1
-\?? ?? 0 1
-- match_default normal bk_plus_qm REG_EXTENDED REG_NO_POSIX_TEST
-? ? 0 1
-\? !
-a\? aa 0 1
-a\? b 0 0
-
-- match_default normal limited_ops
-a? a? 0 2
-a+ a+ 0 2
-a\? a? 0 2
-a\+ a+ 0 2
-
-; now try operator {}
-- match_default normal REG_EXTENDED
-a{2} a -1 -1
-a{2} aa 0 2
-a{2} aaa 0 2
-a{2,} a -1 -1
-a{2,} aa 0 2
-a{2,} aaaaa 0 5
-a{2,4} a -1 -1
-a{2,4} aa 0 2
-a{2,4} aaa 0 3
-a{2,4} aaaa 0 4
-a{2,4} aaaaa 0 4
-; spaces are now allowed inside {}
-"a{ 2 , 4 }" aaaaa 0 4
-a{} !
-"a{ }" !
-a{2 !
-a} !
-\{\} {} 0 2
-
-- match_default normal bk_braces
-a\{2\} a -1 -1
-a\{2\} aa 0 2
-a\{2\} aaa 0 2
-a\{2,\} a -1 -1
-a\{2,\} aa 0 2
-a\{2,\} aaaaa 0 5
-a\{2,4\} a -1 -1
-a\{2,4\} aa 0 2
-a\{2,4\} aaa 0 3
-a\{2,4\} aaaa 0 4
-a\{2,4\} aaaaa 0 4
-"a\{ 2 , 4 \}" aaaaa 0 4
-{} {} 0 2
-
-; now test the alternation operator |
-- match_default normal REG_EXTENDED
-a|b a 0 1
-a|b b 0 1
-a(b|c) ab 0 2 1 2
-a(b|c) ac 0 2 1 2
-a(b|c) ad -1 -1 -1 -1
-|c !
-c| !
-(|) !
-(a|) !
-(|a) !
-a\| a| 0 2
-- match_default normal limited_ops
-a| a| 0 2
-a\| a| 0 2
-| | 0 1
-- match_default normal bk_vbar REG_NO_POSIX_TEST
-a| a| 0 2
-a\|b a 0 1
-a\|b b 0 1
-
-; now test the set operator []
-- match_default normal REG_EXTENDED
-; try some literals first
-[abc] a 0 1
-[abc] b 0 1
-[abc] c 0 1
-[abc] d -1 -1
-[^bcd] a 0 1
-[^bcd] b -1 -1
-[^bcd] d -1 -1
-[^bcd] e 0 1
-a[b]c abc 0 3
-a[ab]c abc 0 3
-a[^ab]c adc 0 3
-a[]b]c a]c 0 3
-a[[b]c a[c 0 3
-a[-b]c a-c 0 3
-a[^]b]c adc 0 3
-a[^-b]c adc 0 3
-a[b-]c a-c 0 3
-a[b !
-a[] !
-
-; then some ranges
-[b-e] a -1 -1
-[b-e] b 0 1
-[b-e] e 0 1
-[b-e] f -1 -1
-[^b-e] a 0 1
-[^b-e] b -1 -1
-[^b-e] e -1 -1
-[^b-e] f 0 1
-a[1-3]c a2c 0 3
-a[3-1]c !
-a[1-3-5]c !
-a[1- !
-
-; and some classes
-a[[:alpha:]]c abc 0 3
-a[[:unknown:]]c !
-a[[: !
-a[[:alpha !
-a[[:alpha:] !
-a[[:alpha,:] !
-a[[:]:]]b !
-a[[:-:]]b !
-a[[:alph:]] !
-a[[:alphabet:]] !
-[[:alnum:]]+ -%@a0X_- 3 6
-[[:alpha:]]+ -%@aX_0- 3 5
-[[:blank:]]+ "a  \tb" 1 4
-[[:cntrl:]]+ a\n\tb 1 3
-[[:digit:]]+ a019b 1 4
-[[:graph:]]+ " a%b " 1 4
-[[:lower:]]+ AabC 1 3
-; This test fails with STLPort, disable for now as this is a corner case anyway...
-;[[:print:]]+ "\na b\n" 1 4
-[[:punct:]]+ " %-&\t" 1 4
-[[:space:]]+ "a \n\t\rb" 1 5
-[[:upper:]]+ aBCd 1 3
-[[:xdigit:]]+ p0f3Cx 1 5
-
-; now test flag settings:
-- escape_in_lists REG_NO_POSIX_TEST
-[\n] \n 0 1
-- REG_NO_POSIX_TEST
-[\n] \n -1 -1
-[\n] \\ 0 1
-[[:class:] : 0 1
-[[:class:] [ 0 1
-[[:class:] c 0 1
-
-; line anchors
-- match_default normal REG_EXTENDED
-^ab ab 0 2
-^ab xxabxx -1 -1
-^ab xx\nabzz 3 5
-ab$ ab 0 2
-ab$ abxx -1 -1
-ab$ ab\nzz 0 2
-- match_default match_not_bol match_not_eol normal REG_EXTENDED REG_NOTBOL REG_NOTEOL
-^ab ab -1 -1
-^ab xxabxx -1 -1
-^ab xx\nabzz 3 5
-ab$ ab -1 -1
-ab$ abxx -1 -1
-ab$ ab\nzz 0 2
-
-; line anchors, single line mode
-- match_default normal match_single_line REG_NO_POSIX_TEST
-^ab ab 0 2
-^ab xxabxx -1 -1
-^ab xx\nabzz -1 -1
-ab$ ab 0 2
-ab$ abxx -1 -1
-ab$ ab\nzz -1 -1
-- match_default match_not_bol match_not_eol normal REG_NO_POSIX_TEST match_single_line
-^ab ab -1 -1
-^ab xxabxx -1 -1
-^ab xx\nabzz -1 -1
-ab$ ab -1 -1
-ab$ abxx -1 -1
-ab$ ab\nzz -1 -1
-
-; back references
-- match_default normal REG_PERL
-a(b)\2c	!
-a(b\1)c	!
-a(b*)c\1d abbcbbd 0 7 1 3
-a(b*)c\1d abbcbd -1 -1
-a(b*)c\1d abbcbbbd -1 -1
-^(.)\1 abc -1 -1
-a([bc])\1d abcdabbd	4 8 5 6
-; strictly speaking this is at best ambiguous, at worst wrong, this is what most
-; re implimentations will match though.
-a(([bc])\2)*d abbccd 0 6 3 5 3 4
-
-a(([bc])\2)*d abbcbd -1 -1
-a((b)*\2)*d abbbd 0 5 1 4 2 3
-; perl only:
-(ab*)[ab]*\1 ababaaa 0 4 0 2
-(a)\1bcd aabcd 0 5 0 1
-(a)\1bc*d aabcd 0 5 0 1
-(a)\1bc*d aabd 0 4 0 1
-(a)\1bc*d aabcccd 0 7 0 1
-(a)\1bc*[ce]d aabcccd 0 7 0 1
-^(a)\1b(c)*cd$ aabcccd 0 7 0 1 4 5
-
-; posix only: 
-- match_default extended REG_EXTENDED
-(ab*)[ab]*\1 ababaaa 0 7 0 1
-
-;
-; characters by code:
-- match_default normal REG_PERL REG_STARTEND
-\0101 A 0 1
-\00 \0 0 1
-\0 \0 0 1
-\0172 z 0 1
-
-;
-; word operators:
-\w a 0 1
-\w z 0 1
-\w A 0 1
-\w Z 0 1
-\w _ 0 1
-\w } -1 -1
-\w ` -1 -1
-\w [ -1 -1
-\w @ -1 -1
-; non-word:
-\W a -1 -1
-\W z -1 -1
-\W A -1 -1
-\W Z -1 -1
-\W _ -1 -1
-\W } 0 1
-\W ` 0 1
-\W [ 0 1
-\W @ 0 1
-; word start:
-\<abcd "  abcd" 2 6
-\<ab cab -1 -1
-\<ab "\nab" 1 3
-\<tag ::tag 2 5
-;word end:
-abc\> abc 0 3
-abc\> abcd -1 -1
-abc\> abc\n 0 3
-abc\> abc:: 0 3
-; word boundary:
-\babcd "  abcd" 2 6
-\bab cab -1 -1
-\bab "\nab" 1 3
-\btag ::tag 2 5
-abc\b abc 0 3
-abc\b abcd -1 -1
-abc\b abc\n 0 3
-abc\b abc:: 0 3
-; within word:
-\B ab 1 1
-a\Bb ab 0 2
-a\B ab 0 1
-a\B a -1 -1
-a\B "a " -1 -1
-
-;
-; buffer operators:
-\`abc abc 0 3
-\`abc \nabc -1 -1
-\`abc " abc" -1 -1
-abc\' abc 0 3
-abc\' abc\n -1 -1
-abc\' "abc " -1 -1
-
-;
-; extra escape sequences:
-\a \a 0 1
-\f \f 0 1
-\n \n 0 1
-\r \r 0 1
-\t \t 0 1
-\v \v 0 1
-
-
-;
-; now follows various complex expressions designed to try and bust the matcher:
-a(((b)))c abc 0 3 1 2 1 2 1 2
-a(b|(c))d abd 0 3 1 2 -1 -1
-a(b|(c))d acd 0 3 1 2 1 2
-a(b*|c)d abbd 0 4 1 3
-; just gotta have one DFA-buster, of course
-a[ab]{20} aaaaabaaaabaaaabaaaab 0 21
-; and an inline expansion in case somebody gets tricky
-a[ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab] aaaaabaaaabaaaabaaaab 0 21
-; and in case somebody just slips in an NFA...
-a[ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab](wee|week)(knights|night) aaaaabaaaabaaaabaaaabweeknights 0 31 21 24 24 31
-; one really big one
-1234567890123456789012345678901234567890123456789012345678901234567890 a1234567890123456789012345678901234567890123456789012345678901234567890b 1 71
-; fish for problems as brackets go past 8
-[ab][cd][ef][gh][ij][kl][mn] xacegikmoq 1 8
-[ab][cd][ef][gh][ij][kl][mn][op] xacegikmoq 1 9
-[ab][cd][ef][gh][ij][kl][mn][op][qr] xacegikmoqy 1 10
-[ab][cd][ef][gh][ij][kl][mn][op][q] xacegikmoqy 1 10
-; and as parenthesis go past 9:
-(a)(b)(c)(d)(e)(f)(g)(h) zabcdefghi 1 9 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9
-(a)(b)(c)(d)(e)(f)(g)(h)(i) zabcdefghij 1 10 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10
-(a)(b)(c)(d)(e)(f)(g)(h)(i)(j) zabcdefghijk 1 11 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11
-(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)(k) zabcdefghijkl 1 12 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12
-(a)d|(b)c abc 1 3 -1 -1 1 2
-"_+((www)|(ftp)|(mailto)):_*" "_wwwnocolon _mailto:" 12 20 13 19 -1 -1 -1 -1 13 19
-
-; subtleties of matching
-a(b)?c\1d acd 0 3 -1 -1
-a(b?c)+d accd 0 4 2 3
-(wee|week)(knights|night) weeknights 0 10 0 3 3 10
-.* abc 0 3
-a(b|(c))d abd 0 3 1 2 -1 -1
-a(b|(c))d acd 0 3 1 2 1 2
-a(b*|c|e)d abbd 0 4 1 3
-a(b*|c|e)d acd 0 3 1 2
-a(b*|c|e)d ad 0 2 1 1
-a(b?)c abc 0 3 1 2
-a(b?)c ac 0 2 1 1
-a(b+)c abc 0 3 1 2
-a(b+)c abbbc 0 5 1 4 
-a(b*)c ac 0 2 1 1 
-(a|ab)(bc([de]+)f|cde) abcdef 0 6 0 1 1 6 3 5
-a([bc]?)c abc 0 3 1 2
-a([bc]?)c ac 0 2 1 1 
-a([bc]+)c abc 0 3 1 2
-a([bc]+)c abcc 0 4 1 3
-a([bc]+)bc abcbc 0 5 1 3
-a(bb+|b)b abb 0 3 1 2
-a(bbb+|bb+|b)b abb 0 3 1 2
-a(bbb+|bb+|b)b abbb 0 4 1 3
-a(bbb+|bb+|b)bb abbb 0 4 1 2
-(.*).* abcdef 0 6 0 6
-(a*)* bc 0 0 0 0
-xyx*xz xyxxxxyxxxz 5 11
-
-; do we get the right subexpression when it is used more than once?
-a(b|c)*d ad 0 2 -1 -1
-a(b|c)*d abcd 0 4 2 3
-a(b|c)+d abd 0 3 1 2
-a(b|c)+d abcd 0 4 2 3
-a(b|c?)+d ad 0 2 1 1
-a(b|c){0,0}d ad 0 2 -1 -1
-a(b|c){0,1}d ad 0 2 -1 -1
-a(b|c){0,1}d abd 0 3 1 2
-a(b|c){0,2}d ad 0 2 -1 -1
-a(b|c){0,2}d abcd 0 4 2 3
-a(b|c){0,}d ad 0 2 -1 -1
-a(b|c){0,}d abcd 0 4 2 3
-a(b|c){1,1}d abd 0 3 1 2
-a(b|c){1,2}d abd 0 3 1 2
-a(b|c){1,2}d abcd 0 4 2 3
-a(b|c){1,}d abd 0 3 1 2
-a(b|c){1,}d abcd 0 4 2 3
-a(b|c){2,2}d acbd 0 4 2 3
-a(b|c){2,2}d abcd 0 4 2 3
-a(b|c){2,4}d abcd 0 4 2 3
-a(b|c){2,4}d abcbd 0 5 3 4
-a(b|c){2,4}d abcbcd 0 6 4 5
-a(b|c){2,}d abcd 0 4 2 3
-a(b|c){2,}d abcbd 0 5 3 4
-; perl only:
-a(b|c?)+d abcd 0 4 3 3
-a(b+|((c)*))+d abd 0 3 2 2 2 2 -1 -1
-a(b+|((c)*))+d abcd 0 4 3 3 3 3 2 3
-
-; posix only:
-- match_default extended REG_EXTENDED REG_STARTEND
-a(b|c?)+d abcd 0 4 2 3
-a(b|((c)*))+d abcd 0 4 2 3 2 3 2 3
-a(b+|((c)*))+d abd 0 3 1 2 -1 -1 -1 -1
-a(b+|((c)*))+d abcd 0 4 2 3 2 3 2 3
-
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_NOSPEC literal
-\**?/{} \\**?/{} 0 7
-
-- match_default normal REG_PERL
-; try to match C++ syntax elements:
-; line comment:
-//[^\n]* "++i //here is a line comment\n" 4 28
-; block comment:
-/\*([^*]|\*+[^*/])*\*+/ "/* here is a block comment */" 0 29 26 27
-/\*([^*]|\*+[^*/])*\*+/ "/**/" 0 4 -1 -1
-/\*([^*]|\*+[^*/])*\*+/ "/***/" 0 5 -1 -1
-/\*([^*]|\*+[^*/])*\*+/ "/****/" 0 6 -1 -1
-/\*([^*]|\*+[^*/])*\*+/ "/*****/" 0 7 -1 -1
-/\*([^*]|\*+[^*/])*\*+/ "/*****/*/" 0 7 -1 -1
-; preprossor directives:
-^[[:blank:]]*#([^\n]*\\[[:space:]]+)*[^\n]* "#define some_symbol" 0 19 -1 -1
-^[[:blank:]]*#([^\n]*\\[[:space:]]+)*[^\n]* "#define some_symbol(x) #x" 0 25 -1 -1
-; perl only:
-^[[:blank:]]*#([^\n]*\\[[:space:]]+)*[^\n]* "#define some_symbol(x) \\  \r\n  foo();\\\r\n   printf(#x);" 0 53 30 42
-; literals:
-((0x[[:xdigit:]]+)|([[:digit:]]+))u?((int(8|16|32|64))|L)? 0xFF         						0 4		0 4		0 4 	-1 -1 	-1 -1 	-1 -1 	-1 -1
-((0x[[:xdigit:]]+)|([[:digit:]]+))u?((int(8|16|32|64))|L)? 35 									0 2 	0 2		-1 -1 	0 2 	-1 -1 	-1 -1 	-1 -1
-((0x[[:xdigit:]]+)|([[:digit:]]+))u?((int(8|16|32|64))|L)? 0xFFu 								0 5		0 4		0 4 	-1 -1 	-1 -1 	-1 -1 	-1 -1
-((0x[[:xdigit:]]+)|([[:digit:]]+))u?((int(8|16|32|64))|L)? 0xFFL 								0 5		0 4		0 4 	-1 -1 	4 5 	-1 -1 	-1 -1
-((0x[[:xdigit:]]+)|([[:digit:]]+))u?((int(8|16|32|64))|L)? 0xFFFFFFFFFFFFFFFFuint64 			0 24	0 18	0 18 	-1 -1 	19 24 	19 24 	22 24
-; strings:
-'([^\\']|\\.)*' '\\x3A' 0 6 4 5
-'([^\\']|\\.)*' '\\'' 0 4 1 3
-'([^\\']|\\.)*' '\\n' 0 4 1 3
-
-; posix only:
-- match_default extended escape_in_lists REG_EXTENDED REG_NO_POSIX_TEST ; we disable POSIX testing because it can't handle escapes in sets
-^[[:blank:]]*#([^\n]*\\[[:space:]]+)*[^\n]* "#define some_symbol(x) \\  \r\n  foo();\\\r\n   printf(#x);" 0 53 28 42
-
-
-; now try and test some unicode specific characters:
-- match_default normal REG_PERL REG_UNICODE_ONLY
-[[:unicode:]]+  a\0300\0400z 1 3
-[\x10-\xff] \39135\12409 -1 -1
-[\01-\05]{5} \36865\36865\36865\36865\36865 -1 -1
-
-; finally try some case insensitive matches:
-- match_default normal REG_EXTENDED REG_ICASE
-; upper and lower have no meaning here so they fail, however these
-; may compile with other libraries...
-;[[:lower:]] !
-;[[:upper:]] !
-0123456789 at abcdefghijklmnopqrstuvwxyz\[\\\]\^_`ABCDEFGHIJKLMNOPQRSTUVWXYZ\{\|\} 0123456789 at ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]\^_`abcdefghijklmnopqrstuvwxyz\{\|\} 0 72
-
-; known and suspected bugs:
-- match_default normal REG_EXTENDED
-\( ( 0 1
-\) ) 0 1
-\$ $ 0 1
-\^ ^ 0 1
-\. . 0 1
-\* * 0 1
-\+ + 0 1
-\? ? 0 1
-\[ [ 0 1
-\] ] 0 1
-\| | 0 1
-\\ \\ 0 1
-# # 0 1
-\# # 0 1
-a- a- 0 2
-\- - 0 1
-\{ { 0 1
-\} } 0 1
-0 0 0 1
-1 1 0 1
-9 9 0 1
-b b 0 1
-B B 0 1
-< < 0 1
-> > 0 1
-w w 0 1
-W W 0 1
-` ` 0 1
-' ' 0 1
-\n \n 0 1
-, , 0 1
-a a 0 1
-f f 0 1
-n n 0 1
-r r 0 1
-t t 0 1
-v v 0 1
-c c 0 1
-x x 0 1
-: : 0 1
-(\.[[:alnum:]]+){2} "w.a.b " 1 5 3 5
-
-- match_default normal REG_EXTENDED REG_ICASE
-a A 0 1
-A a 0 1
-[abc]+ abcABC 0 6
-[ABC]+ abcABC 0 6
-[a-z]+ abcABC 0 6
-[A-Z]+ abzANZ 0 6
-[a-Z]+ abzABZ 0 6
-[A-z]+ abzABZ 0 6
-[[:lower:]]+ abyzABYZ 0 8
-[[:upper:]]+ abzABZ 0 6
-[[:word:]]+ abcZZZ 0 6
-[[:alpha:]]+ abyzABYZ 0 8
-[[:alnum:]]+ 09abyzABYZ 0 10
-
-; updated tests for version 2:
-- match_default normal REG_EXTENDED
-\x41 A 0 1
-\xff \255 0 1
-\xFF \255 0 1
-- match_default normal REG_EXTENDED REG_NO_POSIX_TEST
-\c@ \0 0 1
-- match_default normal REG_EXTENDED
-\cA \1 0 1
-\cz \58 0 1
-\c= !
-\c? !
-=: =: 0 2
-
-; word start:
-[[:<:]]abcd "  abcd" 2 6
-[[:<:]]ab cab -1 -1
-[[:<:]]ab "\nab" 1 3
-[[:<:]]tag ::tag 2 5
-;word end:
-abc[[:>:]] abc 0 3
-abc[[:>:]] abcd -1 -1
-abc[[:>:]] abc\n 0 3
-abc[[:>:]] abc:: 0 3
-
-; collating elements and rewritten set code:
-- match_default normal REG_EXTENDED REG_STARTEND
-[[.zero.]] 0 0 1
-[[.one.]] 1 0 1
-[[.two.]] 2 0 1
-[[.three.]] 3 0 1
-[[.a.]] baa 1 2
-[[.right-curly-bracket.]] } 0 1
-[[.NUL.]] \0 0 1
-[[:<:]z] !
-[a[:>:]] !
-[[=a=]] a 0 1
-[[=right-curly-bracket=]] } 0 1
-- match_default normal REG_EXTENDED REG_STARTEND REG_ICASE
-[[.A.]] A 0 1
-[[.A.]] a 0 1
-[[.A.]-b]+ AaBb 0 4
-[A-[.b.]]+ AaBb 0 4
-[[.a.]-B]+ AaBb 0 4
-[a-[.B.]]+ AaBb 0 4
-- match_default normal REG_EXTENDED REG_NO_POSIX_TEST
-[\x61] a 0 1
-[\x61-c]+ abcd 0 3
-[a-\x63]+ abcd 0 3
-- match_default normal REG_EXTENDED REG_STARTEND
-[[.a.]-c]+ abcd 0 3
-[a-[.c.]]+ abcd 0 3
-[[:alpha:]-a] !
-[a-[:alpha:]] !
-
-; try mutli-character ligatures:
-[[.ae.]] ae 0 2
-[[.ae.]] aE -1 -1
-[[.AE.]] AE 0 2
-[[.Ae.]] Ae 0 2
-[[.ae.]-b] a -1 -1
-[[.ae.]-b] b 0 1
-[[.ae.]-b] ae 0 2
-[a-[.ae.]] a 0 1
-[a-[.ae.]] b -1 -1
-[a-[.ae.]] ae 0 2
-- match_default normal REG_EXTENDED REG_STARTEND REG_ICASE
-[[.ae.]] AE 0 2
-[[.ae.]] Ae 0 2
-[[.AE.]] Ae 0 2
-[[.Ae.]] aE 0 2
-[[.AE.]-B] a -1 -1
-[[.Ae.]-b] b 0 1
-[[.Ae.]-b] B 0 1
-[[.ae.]-b] AE 0 2
-
-- match_default normal REG_EXTENDED REG_STARTEND
-;extended perl style escape sequences:
-\e \27 0 1
-\x1b \27 0 1
-\x{1b} \27 0 1
-\x{} !
-\x{ !
-\x} !
-\x !
-\x{yy !
-\x{1b !
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_NO_POSIX_TEST
-\l+ ABabcAB 2 5
-[\l]+ ABabcAB 2 5
-[a-\l] !
-[\l-a] !
-[\L] !
-\L+ abABCab 2 5
-\u+ abABCab 2 5
-[\u]+ abABCab 2 5
-[\U] !
-\U+ ABabcAB 2 5
-\d+ ab012ab 2 5
-[\d]+ ab012ab 2 5
-[\D] !
-\D+ 01abc01 2 5
-\s+ "ab   ab" 2 5
-[\s]+ "ab   ab" 2 5
-[\S] !
-\S+ "  abc  " 2 5
-- match_default normal REG_EXTENDED REG_STARTEND
-\Qabc !
-\Qabc\E abcd 0 3
-\Qabc\Ed abcde 0 4
-\Q+*?\\E +*?\\ 0 4
-
-\C+ abcde 0 5
-\X+ abcde 0 5
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_UNICODE_ONLY
-\X+ a\768\769 0 3
-\X+ \2309\2307 0 2   ;DEVANAGARI script
-\X+ \2489\2494 0 2   ;BENGALI script
-
-- match_default normal REG_EXTENDED REG_STARTEND
-\Aabc abc 0 3
-\Aabc aabc -1 -1
-abc\z abc 0 3
-abc\z abcd -1 -1
-abc\Z abc\n\n 0 3
-abc\Z abc 0 3
-
-
-\Gabc abc 0 3
-\Gabc dabcd -1 -1
-a\Gbc abc -1 -1
-a\Aab abc -1 -1
-
-;
-; now test grep,
-; basically check all our restart types - line, word, etc
-; checking each one for null and non-null matches.
-;
-- match_default normal REG_EXTENDED REG_STARTEND REG_GREP
-a " a a a aa" 1 2 3 4 5 6 7 8 8 9
-a+b+ "aabaabbb ab" 0 3 3 8 9 11
-a(b*|c|e)d adabbdacd 0 2 2 6 6 9
-a "\na\na\na\naa" 1 2 3 4 5 6 7 8 8 9
-
-^ "   \n\n  \n\n\n" 0 0 4 4 5 5 8 8 9 9 10 10
-^ab  "ab  \nab  ab\n" 0 2 5 7
-^[^\n]*\n "   \n  \n\n  \n" 0 4 4 7 7 8 8 11
-\<abc "abcabc abc\n\nabc" 0 3 7 10 12 15
-\< "  ab a aaa  "  2 2 5 5 7 7
-\<\w+\W+ " aa  aa  a " 1 5 5 9 9 11
-
-\Aabc "abc   abc"  0 3
-\G\w+\W+ "abc  abc a cbbb   " 0 5 5 9 9 11 11 18
-\Ga+b+ "aaababb  abb" 0 4 4 7
-
-abc abc 0 3
-abc " abc abcabc " 1 4 5 8 8 11
-\n\n " \n\n\n       \n      \n\n\n\n  " 1 3 18 20 20 22
-
-$ "   \n\n  \n\n\n" 3 3 4 4 7 7 8 8 9 9 10 10
-\b "  abb a abbb " 2 2 5 5 6 6 7 7 8 8 12 12
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_GREP REG_ICASE
-A " a a a aa" 1 2 3 4 5 6 7 8 8 9
-A+B+ "aabaabbb ab" 0 3 3 8 9 11
-A(B*|c|e)D adabbdacd 0 2 2 6 6 9
-A "\na\na\na\naa" 1 2 3 4 5 6 7 8 8 9
-
-^aB  "Ab  \nab  Ab\n" 0 2 5 7
-\<abc "Abcabc aBc\n\nabc" 0 3 7 10 12 15
-
-ABC abc 0 3
-abc " ABC ABCABC " 1 4 5 8 8 11
-
-
-;
-; now test merge,
-;
-- match_default normal REG_EXTENDED REG_STARTEND REG_MERGE format_no_copy
-; start by testing subs:
-a+ "...aaa,,," $` "..." 
-a+ "...aaa,,," $' ",,," 
-a+ "...aaa,,," $& "aaa" 
-a+ "...aaa,,," $0 aaa
-a+ "...aaa,,," $1 ""
-a+ "...aaa,,," $15 ""
-(a+)b+ "...aaabbb,,," $1 aaa
-[[:digit:]]* 123ab <$0> <123><><><>
-[[:digit:]]* 123ab1 <$0> <123><><><1>
-
-; and now escapes:
-a+ "...aaa,,," $x "$x" 
-a+ "...aaa,,," \a "\a" 
-a+ "...aaa,,," \f "\f" 
-a+ "...aaa,,," \n "\n" 
-a+ "...aaa,,," \r "\r" 
-a+ "...aaa,,," \t "\t" 
-a+ "...aaa,,," \v "\v" 
-
-a+ "...aaa,,," \x21 "!" 
-a+ "...aaa,,," \x{21} "!" 
-a+ "...aaa,,," \c@ \0
-a+ "...aaa,,," \e \27
-a+ "...aaa,,," \0101 A
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_MERGE format_sed format_no_copy
-(a+)(b+) ...aabb,, \0 aabb
-(a+)(b+) ...aabb,, \1 aa
-(a+)(b+) ...aabb,, \2 bb
-(a+)(b+) ...aabb,, & aabb
-(a+)(b+) ...aabb,, $ $
-(a+)(b+) ...aabb,, $1 $1
-(a+)(b+) ...aabb,, ()?: ()?:
-(a+)(b+) ...aabb,, \\ \\
-(a+)(b+) ...aabb,, \& &
-
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_MERGE format_perl format_no_copy
-(a+)(b+) ...aabb,, $0 aabb
-(a+)(b+) ...aabb,, $1 aa
-(a+)(b+) ...aabb,, $2 bb
-(a+)(b+) ...aabb,, $& aabb
-(a+)(b+) ...aabb,, & &
-(a+)(b+) ...aabb,, \0 \0
-(a+)(b+) ...aabb,, ()?: ()?:
-a+ "...aaa,,," \0101 A
-
-- match_default format_all normal REG_EXTENDED REG_STARTEND REG_MERGE
-; move to copying unmatched data:
-a+ "...aaa,,," bbb "...bbb,,," 
-a+(b+) "...aaabb,,," $1 "...bb,,," 
-a+(b+) "...aaabb,,,ab*abbb?" $1 "...bb,,,b*bbb?" 
-
-(a+)|(b+) "...aaabb,,,ab*abbb?" (?1A)(?2B) "...AB,,,AB*AB?" 
-(a+)|(b+) "...aaabb,,,ab*abbb?" ?1A:B "...AB,,,AB*AB?" 
-(a+)|(b+) "...aaabb,,,ab*abbb?" (?1A:B)C "...ACBC,,,ACBC*ACBC?" 
-(a+)|(b+) "...aaabb,,,ab*abbb?" ?1:B "...B,,,B*B?" 
-
-- match_default format_all normal REG_EXTENDED REG_STARTEND REG_MERGE format_first_only
-; move to copying unmatched data, but replace first occurance only:
-a+ "...aaa,,," bbb "...bbb,,," 
-a+(b+) "...aaabb,,," $1 "...bb,,," 
-a+(b+) "...aaabb,,,ab*abbb?" $1 "...bb,,,ab*abbb?" 
-(a+)|(b+) "...aaabb,,,ab*abbb?" (?1A)(?2B) "...Abb,,,ab*abbb?" 
-
-;
-; changes to newline handling with 2.11:
-;
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_GREP
-
-^. "  \n  \r\n  " 0 1 3 4 7 8
-.$ "  \n  \r\n  " 1 2 4 5 8 9
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_GREP REG_UNICODE_ONLY
-^. "  \8232 \8233  " 0 1 3 4 5 6
-.$ "  \8232 \8233  " 1 2 3 4 6 7
-
-;
-; non-greedy repeats added 21/04/00
-- match_default normal REG_EXTENDED REG_PERL
-a** !
-a*? aa 0 0
-^a*?$ aa 0 2
-^.*?$ aa 0 2
-^(?:a)*?$ aa 0 2
-^[ab]*?$ aa 0 2
-a?? aa 0 0
-a++ !
-a+? aa 0 1
-a{1,3}{1} !
-a{1,3}? aaa 0 1
-\w+?w ...ccccccwcccccw 3 10
-\W+\w+?w ...ccccccwcccccw 0 10
-abc|\w+? abd 0 1
-abc|\w+? abcd 0 3
-<\s*tag[^>]*>(.*?)<\s*/tag\s*> " <tag>here is some text</tag> <tag></tag>" 1 29 6 23
-<\s*tag[^>]*>(.*?)<\s*/tag\s*> " < tag attr=\"something\">here is some text< /tag > <tag></tag>" 1 49 24 41
-
-;
-; non-marking parenthesis added 25/04/00
-- match_default normal REG_EXTENDED REG_PERL
-(?:abc)+ xxabcabcxx 2 8
-(?:a+)(b+) xaaabbbx 1 7 4 7
-(a+)(?:b+) xaaabbba 1 7 1 4
-(?:(a+)b+) xaaabbba 1 7 1 4
-(?:a+(b+)) xaaabbba 1 7 4 7
-a+(?#b+)b+ xaaabbba 1 7
-(a)(?:b|$) ab 0 2 0 1
-(a)(?:b|$) a 0 1 0 1
-
-
-;
-; try some partial matches:
-- match_partial match_default normal REG_EXTENDED REG_NO_POSIX_TEST REG_PARTIAL_MATCH REG_PERL
-(xyz)(.*)abc xyzaaab 0 7
-(xyz)(.*)abc xyz 0 3
-(xyz)(.*)abc xy 0 2
-(xyz)(.*)abc x 0 1
-(xyz)(.*)abc "" -1 -1
-(xyz)(.*)abc aaaa -1 -1
-.abc aaab 1 4
-a[_] xxa 2 3
-
-;
-; forward lookahead asserts added 21/01/02
-- match_default normal REG_EXTENDED REG_NO_POSIX_TEST REG_PERL
-((?:(?!a|b)\w)+)(\w+) "  xxxabaxxx  " 2 11 2 5 5 11
-
-/\*(?:(?!\*/).)*\*/ "  /**/  " 2 6
-/\*(?:(?!\*/).)*\*/ "  /***/  " 2 7
-/\*(?:(?!\*/).)*\*/ "  /********/  " 2 12
-/\*(?:(?!\*/).)*\*/ "  /* comment */  " 2 15
-
-<\s*a[^>]*>((?:(?!<\s*/\s*a\s*>).)*)<\s*/\s*a\s*> " <a href=\"here\">here</a> " 1 24 16 20
-<\s*a[^>]*>((?:(?!<\s*/\s*a\s*>).)*)<\s*/\s*a\s*> " <a href=\"here\">here< /  a > " 1 28 16 20
-
-<\s*a[^>]*>((?:(?!<\s*/\s*a\s*>).)*)(?=<\s*/\s*a\s*>) " <a href=\"here\">here</a> " 1 20 16 20
-<\s*a[^>]*>((?:(?!<\s*/\s*a\s*>).)*)(?=<\s*/\s*a\s*>) " <a href=\"here\">here< /  a > " 1 20 16 20
-
-; filename matching:
-^(?!^(?:PRN|AUX|CLOCK\$|NUL|CON|COM\d|LPT\d|\..*)(?:\..+)?$)[^\x00-\x1f\\?*:\"|/]+$ command.com 0 11
-^(?!^(?:PRN|AUX|CLOCK\$|NUL|CON|COM\d|LPT\d|\..*)(?:\..+)?$)[^\x00-\x1f\\?*:\"|/]+$ PRN -1 -1
-^(?!^(?:PRN|AUX|CLOCK\$|NUL|CON|COM\d|LPT\d|\..*)(?:\..+)?$)[^\x00-\x1f\\?*:\"|/]+$ COM2 -1 -1
-
-; password checking:
-^(?=.*\d).{4,8}$ abc3 0 4
-^(?=.*\d).{4,8}$ abc3def4 0 8
-^(?=.*\d).{4,8}$ ab2 -1 -1
-^(?=.*\d).{4,8}$ abcdefg -1 -1
-^(?=.*\d)(?=.*[a-z])(?=.*[A-Z]).{4,8}$ abc3 -1 -1
-^(?=.*\d)(?=.*[a-z])(?=.*[A-Z]).{4,8}$ abC3 0 4
-^(?=.*\d)(?=.*[a-z])(?=.*[A-Z]).{4,8}$ ABCD3 -1 -1
-
-; extended repeat checking to exercise new algorithms:
-ab.*xy abxy_ 0 4
-ab.*xy ab_xy_ 0 5
-ab.*xy abxy 0 4
-ab.*xy ab_xy 0 5
-ab.* ab 0 2
-ab.* ab__ 0 4
-
-ab.{2,5}xy ab__xy_ 0 6
-ab.{2,5}xy ab____xy_ 0 8
-ab.{2,5}xy ab_____xy_ 0 9
-ab.{2,5}xy ab__xy 0 6
-ab.{2,5}xy ab_____xy 0 9
-ab.{2,5} ab__ 0 4
-ab.{2,5} ab_______ 0 7
-ab.{2,5}xy ab______xy -1 -1
-ab.{2,5}xy ab_xy -1 -1
-
-ab.*?xy abxy_ 0 4
-ab.*?xy ab_xy_ 0 5
-ab.*?xy abxy 0 4
-ab.*?xy ab_xy 0 5
-ab.*? ab 0 2
-ab.*? ab__ 0 2
-
-ab.{2,5}?xy ab__xy_ 0 6
-ab.{2,5}?xy ab____xy_ 0 8
-ab.{2,5}?xy ab_____xy_ 0 9
-ab.{2,5}?xy ab__xy 0 6
-ab.{2,5}?xy ab_____xy 0 9
-ab.{2,5}? ab__ 0 4
-ab.{2,5}? ab_______ 0 4
-ab.{2,5}?xy ab______xy -1 -1
-ab.{2,5}xy ab_xy -1 -1
-
-; again but with slower algorithm variant:
-- match_default normal REG_PERL REG_NO_POSIX_TEST match_not_dot_newline match_not_dot_null
-ab.*xy abxy_ 0 4
-ab.*xy ab_xy_ 0 5
-ab.*xy abxy 0 4
-ab.*xy ab_xy 0 5
-ab.* ab 0 2
-ab.* ab__ 0 4
-
-ab.{2,5}xy ab__xy_ 0 6
-ab.{2,5}xy ab____xy_ 0 8
-ab.{2,5}xy ab_____xy_ 0 9
-ab.{2,5}xy ab__xy 0 6
-ab.{2,5}xy ab_____xy 0 9
-ab.{2,5} ab__ 0 4
-ab.{2,5} ab_______ 0 7
-ab.{2,5}xy ab______xy -1 -1
-ab.{2,5}xy ab_xy -1 -1
-
-ab.*?xy abxy_ 0 4
-ab.*?xy ab_xy_ 0 5
-ab.*?xy abxy 0 4
-ab.*?xy ab_xy 0 5
-ab.*? ab 0 2
-ab.*? ab__ 0 2
-
-ab.{2,5}?xy ab__xy_ 0 6
-ab.{2,5}?xy ab____xy_ 0 8
-ab.{2,5}?xy ab_____xy_ 0 9
-ab.{2,5}?xy ab__xy 0 6
-ab.{2,5}?xy ab_____xy 0 9
-ab.{2,5}? ab__ 0 4
-ab.{2,5}? ab_______ 0 4
-ab.{2,5}?xy ab______xy -1 -1
-ab.{2,5}xy ab_xy -1 -1
-(.*?).somesite \n\n555.somesite 2 14 2 5
-
-; now again for single character repeats:
-
-ab_*xy abxy_ 0 4
-ab_*xy ab_xy_ 0 5
-ab_*xy abxy 0 4
-ab_*xy ab_xy 0 5
-ab_* ab 0 2
-ab_* ab__ 0 4
-
-ab_{2,5}xy ab__xy_ 0 6
-ab_{2,5}xy ab____xy_ 0 8
-ab_{2,5}xy ab_____xy_ 0 9
-ab_{2,5}xy ab__xy 0 6
-ab_{2,5}xy ab_____xy 0 9
-ab_{2,5} ab__ 0 4
-ab_{2,5} ab_______ 0 7
-ab_{2,5}xy ab______xy -1 -1
-ab_{2,5}xy ab_xy -1 -1
-
-ab_*?xy abxy_ 0 4
-ab_*?xy ab_xy_ 0 5
-ab_*?xy abxy 0 4
-ab_*?xy ab_xy 0 5
-ab_*? ab 0 2
-ab_*? ab__ 0 2
-
-ab_{2,5}?xy ab__xy_ 0 6
-ab_{2,5}?xy ab____xy_ 0 8
-ab_{2,5}?xy ab_____xy_ 0 9
-ab_{2,5}?xy ab__xy 0 6
-ab_{2,5}?xy ab_____xy 0 9
-ab_{2,5}? ab__ 0 4
-ab_{2,5}? ab_______ 0 4
-ab_{2,5}?xy ab______xy -1 -1
-ab_{2,5}xy ab_xy -1 -1
-(5*?).somesite //555.somesite 2 14 2 5
-
-; and again for sets:
-ab[_,;]*xy abxy_ 0 4
-ab[_,;]*xy ab_xy_ 0 5
-ab[_,;]*xy abxy 0 4
-ab[_,;]*xy ab_xy 0 5
-ab[_,;]* ab 0 2
-ab[_,;]* ab__ 0 4
-
-ab[_,;]{2,5}xy ab__xy_ 0 6
-ab[_,;]{2,5}xy ab____xy_ 0 8
-ab[_,;]{2,5}xy ab_____xy_ 0 9
-ab[_,;]{2,5}xy ab__xy 0 6
-ab[_,;]{2,5}xy ab_____xy 0 9
-ab[_,;]{2,5} ab__ 0 4
-ab[_,;]{2,5} ab_______ 0 7
-ab[_,;]{2,5}xy ab______xy -1 -1
-ab[_,;]{2,5}xy ab_xy -1 -1
-
-ab[_,;]*?xy abxy_ 0 4
-ab[_,;]*?xy ab_xy_ 0 5
-ab[_,;]*?xy abxy 0 4
-ab[_,;]*?xy ab_xy 0 5
-ab[_,;]*? ab 0 2
-ab[_,;]*? ab__ 0 2
-
-ab[_,;]{2,5}?xy ab__xy_ 0 6
-ab[_,;]{2,5}?xy ab____xy_ 0 8
-ab[_,;]{2,5}?xy ab_____xy_ 0 9
-ab[_,;]{2,5}?xy ab__xy 0 6
-ab[_,;]{2,5}?xy ab_____xy 0 9
-ab[_,;]{2,5}? ab__ 0 4
-ab[_,;]{2,5}? ab_______ 0 4
-ab[_,;]{2,5}?xy ab______xy -1 -1
-ab[_,;]{2,5}xy ab_xy -1 -1
-(\d*?).somesite //555.somesite 2 14 2 5
-
-; and again for tricky sets with digraphs:
-ab[_[.ae.]]*xy abxy_ 0 4
-ab[_[.ae.]]*xy ab_xy_ 0 5
-ab[_[.ae.]]*xy abxy 0 4
-ab[_[.ae.]]*xy ab_xy 0 5
-ab[_[.ae.]]* ab 0 2
-ab[_[.ae.]]* ab__ 0 4
-
-ab[_[.ae.]]{2,5}xy ab__xy_ 0 6
-ab[_[.ae.]]{2,5}xy ab____xy_ 0 8
-ab[_[.ae.]]{2,5}xy ab_____xy_ 0 9
-ab[_[.ae.]]{2,5}xy ab__xy 0 6
-ab[_[.ae.]]{2,5}xy ab_____xy 0 9
-ab[_[.ae.]]{2,5} ab__ 0 4
-ab[_[.ae.]]{2,5} ab_______ 0 7
-ab[_[.ae.]]{2,5}xy ab______xy -1 -1
-ab[_[.ae.]]{2,5}xy ab_xy -1 -1
-
-ab[_[.ae.]]*?xy abxy_ 0 4
-ab[_[.ae.]]*?xy ab_xy_ 0 5
-ab[_[.ae.]]*?xy abxy 0 4
-ab[_[.ae.]]*?xy ab_xy 0 5
-ab[_[.ae.]]*? ab 0 2
-ab[_[.ae.]]*? ab__ 0 2
-
-ab[_[.ae.]]{2,5}?xy ab__xy_ 0 6
-ab[_[.ae.]]{2,5}?xy ab____xy_ 0 8
-ab[_[.ae.]]{2,5}?xy ab_____xy_ 0 9
-ab[_[.ae.]]{2,5}?xy ab__xy 0 6
-ab[_[.ae.]]{2,5}?xy ab_____xy 0 9
-ab[_[.ae.]]{2,5}? ab__ 0 4
-ab[_[.ae.]]{2,5}? ab_______ 0 4
-ab[_[.ae.]]{2,5}?xy ab______xy -1 -1
-ab[_[.ae.]]{2,5}xy ab_xy -1 -1
-([5[.ae.]]*?).somesite //555.somesite 2 14 2 5
-
-; new bugs detected in spring 2003:
-- normal match_continuous REG_NO_POSIX_TEST
-b abc -1 -1
-
-- normal REG_PERL
-(?!foo)bar foobar 3 6
-(?!foo)bar "??bar" 2 5
-(?!foo)bar "barfoo" 0 3
-(?!foo)bar "bar??" 0 3
-(?!foo)bar bar 0 3
-
-a\Z a\nb -1 -1
-() abc 0 0 0 0
-^() abc 0 0 0 0
-^()+ abc 0 0 0 0
-^(){1} abc 0 0 0 0
-^(){2} abc 0 0 0 0
-^((){2}) abc 0 0 0 0 0 0
-() "" 0 0 0 0
-()\1 "" 0 0 0 0
-()\1 a 0 0 0 0
-a()\1b ab 0 2 1 1
-a()b\1 ab 0 2 1 1
-
-- normal match_not_dot_newline REG_NO_POSIX_TEST
-
-"(.*\r\n){3}.* abcdefghijklmnopqrstuvwxyz.*\r\n" "00001 01 \r\n00002 02 1         2         3         4         5         6         7         8         9         0\r\n00003 03 0123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890\r\n00004 04 \r\n00005 05 \r\n00006 06                                                             Seite: 0001\r\n00007 07                                                             StartSeitEEnde: 0001\r\n00008 08                                                             StartSeiTe Ende: 0001\r\n00009 09                                                             Start seiteEnde: 0001\r\n00010 10                                                             28.2.03\r\n00011 11                                                             Page: 0001\r\n00012 12                                                             Juhu die Erste: 0001\r\n00013 13                                                             Es war einmal! 0001\r\n00014 14                               ABCDEFGHIJKLMNOPQRSTUVWXYZ0001\r\n00015 15                               abcdefghijklmnopqrstuvwxyz0001\r\n00016 16                               lars.schmeiser at gft.com\r\n00017 17 \r\n00018 18 \r\n00019 19 \r\n00020 20 \r\n00021 21 1         2         3         4         5         6         7         8         9         0\r\n00022 22 0123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890\r\n00023 01 \r\n00024 02 1         2         3         4         5         6         7         8         9         0\r\n00025 03 0123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890\r\n00026 04 \r\n00027 05 \r\n00028 06                                                             Seite: 0002\r\n00029 07                                                             StartSeitEEnde: 0002\r\n00030 08                                                             StartSeiTe Ende: 0002\r\n00031 09                                                             Start seiteEnde: 0002\r\n00032 10                                                             28.02.2003\r\n00033 11                                                             Page: 0002\r\n00034 12                                                             Juhu die Erste: 0002\r\n00035 13                                                             Es war einmal! 0002\r\n00036 14                               ABCDEFGHIJKLMNOPQRSTUVWXYZ0002\r\n00037 15                               abcdefghijklmnopqrstuvwxyz0002\r\n00038 16                               lars.schmeiser at 194.1.12.111\r\n00039 17 \r\n00040 18 \r\n00041 19 \r\n00042 20 \r\n00043 21 1         2         3         4         5         6         7         8         9         0\r\n" 753 1076 934 1005
-
-- normal REG_PERL
-
-; new (?: construct )
-(?>^abc) abc 0 3
-(?>^abc) def\nabc 4 7
-(?>^abc) defabc -1 -1
-(?>.*/)foo /this/is/a/very/long/line/in/deed/with/very/many/slashes/in/it/you/see/ -1 -1
-(?>.*/)foo /this/is/a/very/long/line/in/deed/with/very/many/slashes/in/and/foo 0 67
-(?>(\.\d\d[1-9]?))\d+ 1.230003938 1 11 1 4
-(?>(\.\d\d[1-9]?))\d+ 1.875000282 1 11 1 5
-(?>(\.\d\d[1-9]?))\d+ 1.235 -1 -1
-^((?>\w+)|(?>\s+))*$ "now is the time for all good men to come to the aid of the party" 0 64 59 64
-^((?>\w+)|(?>\s+))*$ "this is not a line with only words and spaces!" -1 -1
-((?>\d+))(\w) 12345a 0 6 0 5 5 6
-((?>\d+))(\w) 12345+ -1 -1
-((?>\d+))(\d) 12345 -1 -1
-(?>a+)b aaab 0 4
-((?>a+)b) aaab 0 4 0 4
-(?>(a+))b aaab 0 4 0 3
-(?>b)+ aaabbbccc 3 6
-(?>a+|b+|c+)*c aaabbbbccccd 0 8
-((?>[^()]+)|\([^()]*\))+ ((abc(ade)ufh()()x 2 18 17 18
-\(((?>[^()]+)|\([^()]+\))+\) (abc) 0 5 1 4
-\(((?>[^()]+)|\([^()]+\))+\) (abc(def)xyz) 0 13 9 12
-\(((?>[^()]+)|\([^()]+\))+\) ((()aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa -1 -1
-(?>a*)* a 0 1
-(?>a*)* aa 0 2
-(?>a*)* aaaa 0 4
-(?>a*)* a 0 1
-(?>a*)* aaabcde 0 3
-((?>a*))* aaaaa 0 5 5 5
-((?>a*))* aabbaa 0 2 2 2
-((?>a*?))* aaaaa 0 0 0 0
-((?>a*?))*    aabbaa 0 0 0 0
-"word (?>(?:(?!otherword)[a-zA-Z0-9]+ ){0,30})otherword" "word cat dog elephant mussel cow horse canary baboon snake shark otherword" 0 74
-"word (?>(?:(?!otherword)[a-zA-Z0-9]+ ){0,30})otherword" "word cat dog elephant mussel cow horse canary baboon snake shark" -1 -1
-"word (?>[a-zA-Z0-9]+ ){0,30}otherword" "word cat dog elephant mussel cow horse canary baboon snake shark the quick brown fox and the lazy dog and several other words getting close to thirty by now I hope" -1 -1
-"word (?>[a-zA-Z0-9]+ ){0,30}otherword" "word cat dog elephant mussel cow horse canary baboon snake shark the quick brown fox and the lazy dog and several other words getting close to thirty by now I really really hope otherword" -1 -1
-((?>Z)+|A)* ZABCDEFG 0 2 1 2
-((?>)+|A)* !
-
-; subtleties of matching with no sub-expressions marked
-- normal match_nosubs REG_NO_POSIX_TEST
-a(b?c)+d accd 0 4 
-(wee|week)(knights|night) weeknights 0 10 
-.* abc 0 3
-a(b|(c))d abd 0 3 
-a(b|(c))d acd 0 3
-a(b*|c|e)d abbd 0 4
-a(b*|c|e)d acd 0 3 
-a(b*|c|e)d ad 0 2
-a(b?)c abc 0 3
-a(b?)c ac 0 2
-a(b+)c abc 0 3
-a(b+)c abbbc 0 5
-a(b*)c ac 0 2
-(a|ab)(bc([de]+)f|cde) abcdef 0 6
-a([bc]?)c abc 0 3
-a([bc]?)c ac 0 2
-a([bc]+)c abc 0 3
-a([bc]+)c abcc 0 4
-a([bc]+)bc abcbc 0 5
-a(bb+|b)b abb 0 3
-a(bbb+|bb+|b)b abb 0 3
-a(bbb+|bb+|b)b abbb 0 4
-a(bbb+|bb+|b)bb abbb 0 4
-(.*).* abcdef 0 6
-(a*)* bc 0 0
-
-- normal nosubs REG_NO_POSIX_TEST
-a(b?c)+d accd 0 4 
-(wee|week)(knights|night) weeknights 0 10 
-.* abc 0 3
-a(b|(c))d abd 0 3 
-a(b|(c))d acd 0 3
-a(b*|c|e)d abbd 0 4
-a(b*|c|e)d acd 0 3 
-a(b*|c|e)d ad 0 2
-a(b?)c abc 0 3
-a(b?)c ac 0 2
-a(b+)c abc 0 3
-a(b+)c abbbc 0 5
-a(b*)c ac 0 2
-(a|ab)(bc([de]+)f|cde) abcdef 0 6
-a([bc]?)c abc 0 3
-a([bc]?)c ac 0 2
-a([bc]+)c abc 0 3
-a([bc]+)c abcc 0 4
-a([bc]+)bc abcbc 0 5
-a(bb+|b)b abb 0 3
-a(bbb+|bb+|b)b abb 0 3
-a(bbb+|bb+|b)b abbb 0 4
-a(bbb+|bb+|b)bb abbb 0 4
-(.*).* abcdef 0 6
-(a*)* bc 0 0
-
-; new merge tests for case convertions:
-- match_default normal REG_PERL REG_STARTEND REG_MERGE
-abc "xyzabcCD" "\u$&" "xyzAbcCD"
-abc "xyzabcCD" "\U$&\E" "xyzABCCD"
-ABC "xyzABCCD" "\l$&" "xyzaBCCD"
-ABC "xyzABCCD" "\L$&\E" "xyzabcCD"
-
-- match_default normal REG_EXTENDED REG_STARTEND REG_MERGE format_sed
-abc "xyzabcCD" "\u\0" "xyzuabcCD"
-abc "xyzabcCD" "\U\0\E" "xyzUabcECD"
-ABC "xyzABCCD" "\l\0" "xyzlABCCD"
-ABC "xyzABCCD" "\L\0\E" "xyzLABCECD"
-
-; and a couple of new bugs:
-- match_default normal REG_ICASE REG_NO_POSIX_TEST
-\u+ abcABC 0 6
-\l+ abcABC 0 6
-

Modified: boost/trunk/libs/regex/test/regress/vc6-stlport.mak
===================================================================
--- boost/trunk/libs/regex/test/regress/vc6-stlport.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/vc6-stlport.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 # very basic makefile for regression tests
 #
@@ -70,3 +74,4 @@
 	cl /MDd $(CFLAGS) /DBOOST_ALL_DYN_LINK -o r8-vc6-stlport.exe $(SOURCES) $(LFLAGS)
 
 
+

Modified: boost/trunk/libs/regex/test/regress/vc6.mak
===================================================================
--- boost/trunk/libs/regex/test/regress/vc6.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/vc6.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 # very basic makefile for regression tests
 #
@@ -61,3 +65,4 @@
 	cl /MDd $(CFLAGS) /DBOOST_ALL_DYN_LINK -o r8-vc6.exe $(SOURCES) $(LFLAGS)
 
 
+

Modified: boost/trunk/libs/regex/test/regress/vc7.mak
===================================================================
--- boost/trunk/libs/regex/test/regress/vc7.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/vc7.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 # very basic makefile for regression tests
 #
@@ -61,3 +65,4 @@
 	cl /MDd $(CFLAGS) /DBOOST_ALL_DYN_LINK -o r8-vc7.exe $(SOURCES) $(LFLAGS)
 
 
+

Modified: boost/trunk/libs/regex/test/regress/vc71.mak
===================================================================
--- boost/trunk/libs/regex/test/regress/vc71.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/vc71.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 # very basic makefile for regression tests
 #
@@ -61,3 +65,4 @@
 	cl /MDd $(CFLAGS) /DBOOST_ALL_DYN_LINK -o r8-vc71.exe $(SOURCES) $(LFLAGS)
 
 
+

Modified: boost/trunk/libs/regex/test/regress/vc8.mak
===================================================================
--- boost/trunk/libs/regex/test/regress/vc8.mak	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/regex/test/regress/vc8.mak	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2003
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or copy at 
+# http://www.boost.org/LICENSE_1_0.txt.
 
 # very basic makefile for regression tests
 #
@@ -61,3 +65,4 @@
 	cl /MDd $(CFLAGS) /DBOOST_ALL_DYN_LINK -o r8-vc8.exe $(SOURCES) $(LFLAGS)
 
 
+

Deleted: boost/trunk/libs/serialization/build/Jamfile
===================================================================
--- boost/trunk/libs/serialization/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,154 +0,0 @@
-# Boost serialization Library Build Jamfile
-#  (C) Copyright Robert Ramey 2002-2004.
-#  Use, modification, and distribution are subject to the 
-#  Boost Software License, Version 1.0. (See accompanying file 
-#  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-#
-#  See http://www.boost.org/libs/serialization for the library home page.
-
-subproject libs/serialization/build ;
-
-import ./serialization ;
-
-{
-
-SOURCES = 
-    array_binary_iarchive
-    array_binary_oarchive
-    basic_archive
-    basic_archive_impl
-    basic_iarchive
-    basic_oarchive
-    basic_iserializer
-    basic_oserializer
-    basic_pointer_iserializer
-    basic_pointer_oserializer
-    basic_serializer_map
-    basic_text_iprimitive
-    basic_text_oprimitive
-    basic_xml_archive
-    binary_iarchive
-    binary_oarchive
-    extended_type_info
-    extended_type_info_no_rtti
-    extended_type_info_typeid
-    polymorphic_iarchive
-    polymorphic_oarchive
-    stl_port
-    text_iarchive
-    text_oarchive
-    void_cast
-    xml_grammar
-    xml_iarchive
-    xml_oarchive
-;
-    
-WSOURCES = 
-    codecvt_null
-    utf8_codecvt_facet
-    basic_text_wiprimitive
-    basic_text_woprimitive
-    binary_wiarchive
-    binary_woarchive
-    text_wiarchive
-    text_woarchive
-    xml_wgrammar
-    xml_wiarchive
-    xml_woarchive
-;
-
-template boost_serialization_base
-    : ## sources ##
-    : ## requirements ##
-        std::locale-support
-        toolset::require-boost-spirit-support
-        toolset::suppress-warnings
-        toolset::optimizations
-        # the common names rule ensures that the library will
-        # be named according to the rules used by the install
-        # and auto-link features:
-        common-variant-tag
-        <sysinclude>$(BOOST_ROOT)
-        <stlport-iostream>on 
-        <msvc><*><cxxflags>-Gy
-        <vc*><*><cxxflags>-Gy
-        <define>BOOST_LIB_DIAGNOSTIC=1
-    : ## default build 
-        debug release
-;
-
-lib boost_serialization
-    : ## sources ##
-        <template>boost_serialization_base
-        ../src/$(SOURCES).cpp
-;
-
-lib boost_wserialization
-    : ## sources ##
-        <template>boost_serialization_base
-        ../src/$(WSOURCES).cpp
-        <lib>boost_serialization
-    : ## requirements ##
-        toolset::require-wide-char-io-support
-;
-
-dll boost_serialization
-    : ## sources ##
-        <template>boost_serialization_base
-        ../src/$(SOURCES).cpp
-    : ## requirements ##
-        toolset::require-shared-libraries-support
-        # this suppress the --a switch in the como toolset
-        # without this one gets compile errors ! with "dllexport"
-        # however, it doesn't link anyway so comment it out
-        # <como-4_3_3-vc7_1><*><no-warn>$(SOURCES).cpp
-        <define>BOOST_SERIALIZATION_DYN_LINK=1
-        <runtime-link>dynamic
-;
-
-dll boost_wserialization
-    : ## sources ##
-        <template>boost_serialization_base
-        ../src/$(WSOURCES).cpp
-        <dll>boost_serialization
-    : ## requirements ##
-        toolset::require-wide-char-io-support
-        toolset::require-shared-libraries-support
-        # this suppress the --a switch in the como toolset
-        # without this one gets compile errors ! with "dllexport"
-        # however, it doesn't link anyway so comment it out
-        # <como-4_3_3-vc7_1><*><no-warn>$(WSOURCES).cpp
-        <define>BOOST_WSERIALIZATION_DYN_LINK=1
-        <define>BOOST_SERIALIZATION_DYN_LINK=1
-        <runtime-link>dynamic
-;
-
-install serialization lib 
-    :
-        <lib>boost_serialization
-        <lib>boost_wserialization
-        <dll>boost_serialization
-        <dll>boost_wserialization
-;
-
-stage stage/lib 
-    :
-        <lib>boost_serialization
-        <lib>boost_wserialization
-        <dll>boost_serialization
-        <dll>boost_wserialization
-    :
-        # copy to a path rooted at BOOST_ROOT:
-        <locate>$(BOOST_ROOT)
-        # the common names rule ensures that the library will
-        # be named according to the rules used by the install
-        # and auto-link features:
-        common-variant-tag
-        # add this target to the "stage" and "all" psuedo-targets:
-        <target>stage
-        <target>all
-    :
-        debug release
-;
-
-}

Modified: boost/trunk/libs/serialization/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/serialization/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,8 +11,6 @@
     ;
 
 SOURCES = 
-    array_binary_iarchive
-    array_binary_oarchive
     basic_archive
     basic_archive_impl
     basic_iarchive

Modified: boost/trunk/libs/serialization/doc/acknowledgments.html
===================================================================
--- boost/trunk/libs/serialization/doc/acknowledgments.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/acknowledgments.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Acknowledgments</title>

Modified: boost/trunk/libs/serialization/doc/archive_reference.html
===================================================================
--- boost/trunk/libs/serialization/doc/archive_reference.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/archive_reference.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - More on Archives</title>
@@ -43,7 +43,8 @@
 Our archives have been factored in to a tree of classes in order to minimize
 repetition of code.  This is shown in the accompanying 
 <a target="class_diagram" href="class_diagram.html">class diagram</a>.
-All input archives should be derived from the following template:
+In order to diminish code repetition, input archives included with this library 
+have all been derived from the following template:
 <pre><code>
 template&lt;class Archive&gt;
 detail::common_iarchive;

Modified: boost/trunk/libs/serialization/doc/archives.html
===================================================================
--- boost/trunk/libs/serialization/doc/archives.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/archives.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 <!doctype HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Archives</title>

Modified: boost/trunk/libs/serialization/doc/bibliography.html
===================================================================
--- boost/trunk/libs/serialization/doc/bibliography.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/bibliography.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Bibliography</title>

Modified: boost/trunk/libs/serialization/doc/class_diagram.html
===================================================================
--- boost/trunk/libs/serialization/doc/class_diagram.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/class_diagram.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 -->
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Archive Class Diagram</title>

Modified: boost/trunk/libs/serialization/doc/codecvt.html
===================================================================
--- boost/trunk/libs/serialization/doc/codecvt.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/codecvt.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,7 +11,7 @@
   == representations about the suitability of this software for any
   == purpose.  It is provided "as is" without express or implied warranty.
   -->
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <head>

Modified: boost/trunk/libs/serialization/doc/configuration.html
===================================================================
--- boost/trunk/libs/serialization/doc/configuration.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/configuration.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Configuration</title>

Modified: boost/trunk/libs/serialization/doc/contents.html
===================================================================
--- boost/trunk/libs/serialization/doc/contents.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/contents.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <title>Serialization</title>
 

Modified: boost/trunk/libs/serialization/doc/dataflow.html
===================================================================
--- boost/trunk/libs/serialization/doc/dataflow.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/dataflow.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Dataflow Iterators</title>

Modified: boost/trunk/libs/serialization/doc/definitions.html
===================================================================
--- boost/trunk/libs/serialization/doc/definitions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/definitions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Definitions</title>

Modified: boost/trunk/libs/serialization/doc/derivation.html
===================================================================
--- boost/trunk/libs/serialization/doc/derivation.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/derivation.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Derivation from an Existing Archive</title>

Modified: boost/trunk/libs/serialization/doc/exception_safety.html
===================================================================
--- boost/trunk/libs/serialization/doc/exception_safety.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/exception_safety.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Reference</title>

Modified: boost/trunk/libs/serialization/doc/exceptions.html
===================================================================
--- boost/trunk/libs/serialization/doc/exceptions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/exceptions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Archive Exceptions</title>

Modified: boost/trunk/libs/serialization/doc/extended_type_info.html
===================================================================
--- boost/trunk/libs/serialization/doc/extended_type_info.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/extended_type_info.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - extended_type_info</title>

Modified: boost/trunk/libs/serialization/doc/faq.html
===================================================================
--- boost/trunk/libs/serialization/doc/faq.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/faq.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - FAQ</title>

Modified: boost/trunk/libs/serialization/doc/headers.html
===================================================================
--- boost/trunk/libs/serialization/doc/headers.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/headers.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Code Structure</title>

Modified: boost/trunk/libs/serialization/doc/history.html
===================================================================
--- boost/trunk/libs/serialization/doc/history.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/history.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - History</title>

Modified: boost/trunk/libs/serialization/doc/implementation.html
===================================================================
--- boost/trunk/libs/serialization/doc/implementation.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/implementation.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Implementation Notes</title>

Modified: boost/trunk/libs/serialization/doc/index.html
===================================================================
--- boost/trunk/libs/serialization/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 Distributed under the Boost Software License, Version 1.0. (See
 accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 -->
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <title>Serialization</title>
 </head>

Modified: boost/trunk/libs/serialization/doc/overview.html
===================================================================
--- boost/trunk/libs/serialization/doc/overview.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/overview.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Overview</title>

Modified: boost/trunk/libs/serialization/doc/pimpl.html
===================================================================
--- boost/trunk/libs/serialization/doc/pimpl.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/pimpl.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - PIMPL</title>

Modified: boost/trunk/libs/serialization/doc/rationale.html
===================================================================
--- boost/trunk/libs/serialization/doc/rationale.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/rationale.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Seriealization - Rationale</title>

Modified: boost/trunk/libs/serialization/doc/reference.html
===================================================================
--- boost/trunk/libs/serialization/doc/reference.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/reference.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Serialization of Classes</title>

Modified: boost/trunk/libs/serialization/doc/release.html
===================================================================
--- boost/trunk/libs/serialization/doc/release.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/release.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Release Notes</title>

Modified: boost/trunk/libs/serialization/doc/serialization.html
===================================================================
--- boost/trunk/libs/serialization/doc/serialization.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/serialization.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Serialization of Classes</title>

Modified: boost/trunk/libs/serialization/doc/shared_ptr.html
===================================================================
--- boost/trunk/libs/serialization/doc/shared_ptr.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/shared_ptr.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Template serialization - shared_ptr</title>

Modified: boost/trunk/libs/serialization/doc/shared_ptr2.html
===================================================================
--- boost/trunk/libs/serialization/doc/shared_ptr2.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/shared_ptr2.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Template serialization - shared_ptr</title>

Modified: boost/trunk/libs/serialization/doc/smart_cast.html
===================================================================
--- boost/trunk/libs/serialization/doc/smart_cast.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/smart_cast.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - BOOST_STATIC_WARNING</title>

Modified: boost/trunk/libs/serialization/doc/special.html
===================================================================
--- boost/trunk/libs/serialization/doc/special.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/special.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Special Considerations</title>
@@ -179,6 +179,9 @@
   <li>The header <a href="../../../boost/serialization/export.hpp" target="export_hpp">export.hpp</a>
   builds a list of archive classes whose header modules have been previously included.  
   It does this by checking to see which inclusion guard constants have been defined.
+  The header <a href="../../../boost/archive/detail/known_archive_types.hpp" target="known_archive_types_hpp">known_archive_types.hpp</a>
+  lists the archive header files which whose include guards will be checked.  If you create your own
+  archive class, you probably want to edit this file.
   <li><code style="white-space: normal">BOOST_CLASS_EXPORT(my_class)</code> explicitly instantiates
   serialization code for <code style="white-space: normal">my_class</code> for each archive in the list.
 </ul>

Modified: boost/trunk/libs/serialization/doc/state_saver.html
===================================================================
--- boost/trunk/libs/serialization/doc/state_saver.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/state_saver.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - <code style="white-space: normal">state_saver</code></title>

Modified: boost/trunk/libs/serialization/doc/static_warning.html
===================================================================
--- boost/trunk/libs/serialization/doc/static_warning.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/static_warning.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - BOOST_STATIC_WARNING</title>

Modified: boost/trunk/libs/serialization/doc/strong_typedef.html
===================================================================
--- boost/trunk/libs/serialization/doc/strong_typedef.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/strong_typedef.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - BOOST_STATIC_WARNING</title>

Modified: boost/trunk/libs/serialization/doc/traits.html
===================================================================
--- boost/trunk/libs/serialization/doc/traits.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/traits.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Class Serialization Traits</title>

Modified: boost/trunk/libs/serialization/doc/tutorial.html
===================================================================
--- boost/trunk/libs/serialization/doc/tutorial.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/tutorial.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Tutorial</title>

Modified: boost/trunk/libs/serialization/doc/void_cast.html
===================================================================
--- boost/trunk/libs/serialization/doc/void_cast.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/void_cast.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - BOOST_STATIC_WARNING</title>
@@ -57,8 +57,8 @@
   pre-runtime and is available anywhere else in the program.
   <li>only adjacent base/derived pairs need be registered.  That is,
   <pre><code>
-  void_cast_register<A, B>();
-  void_cast_register<B, C>();
+  void_cast_register&lt;A, B&gt;();
+  void_cast_register&lt;B, C&gt;();
   </code></pre>
   automatically derives the fact that A can be upcast to C and vice-versa.
 </ul>

Modified: boost/trunk/libs/serialization/doc/wrappers.html
===================================================================
--- boost/trunk/libs/serialization/doc/wrappers.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/doc/wrappers.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 http://www.boost.org/LICENSE_1_0.txt)
 -->
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <link rel="stylesheet" type="text/css" href="../../../boost.css">
 <link rel="stylesheet" type="text/css" href="style.css">
 <title>Serialization - Serialization Wrappers</title>

Deleted: boost/trunk/libs/serialization/example/Jamfile
===================================================================
--- boost/trunk/libs/serialization/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,41 +0,0 @@
-# Boost serialization Library Build Jamfile
-#  (C) Copyright Robert Ramey 2002-2004.
-#  Use, modification, and distribution are subject to the
-#  Boost Software License, Version 1.0. (See accompanying file
-#  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-#
-#  See http://www.boost.org/libs/serialization for the library home page.
-
-subproject libs/serialization/example ;
-
-rule demo-bsl-build ( demo-name )
-{
-    exe $(demo-name)
-        : # sources
-            $(demo-name).cpp
-            <lib>../build/boost_serialization
-        : # requirements
-            # copy to a path rooted at BOOST_ROOT:
-            <locate>$(BOOST_ROOT)
-            <include>$(BOOST_ROOT)  
-            <sysinclude>$(BOOST_ROOT)
-            <borland><*><cxxflags>-w-8080
-            <msvc><release><cxxflags>-Gy
-            <vc7><release><cxxflags>-Gy
-            <vc-7_0><release><cxxflags>-Gy
-            <vc-7_1><release><cxxflags>-Gy
-        : # default build
-            debug
-    ;
-}
-
-demo-bsl-build demo ;
-demo-bsl-build demo_auto_ptr ;
-demo-bsl-build demo_exception ;
-demo-bsl-build demo_fast_archive ;
-demo-bsl-build demo_pimpl ;
-demo-bsl-build demo_portable_archive ;
-demo-bsl-build demo_shared_ptr ;
-demo-bsl-build demo_xml ;
-demo-bsl-build demo_xml_save ;
-demo-bsl-build demo_xml_load ;

Deleted: boost/trunk/libs/serialization/src/array_binary_iarchive.cpp
===================================================================
--- boost/trunk/libs/serialization/src/array_binary_iarchive.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/src/array_binary_iarchive.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,39 +0,0 @@
-/////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
-// binary_iarchive.cpp:
-
-// (C) Copyright 2002 Robert Ramey - http://www.rrsd.com . 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-//  See http://www.boost.org for updates, documentation, and revision history.
-
-#include <istream>
-
-#define BOOST_ARCHIVE_SOURCE
-#include <boost/archive/array/binary_iarchive.hpp>
-
-#include <boost/archive/impl/basic_binary_iprimitive.ipp>
-#include <boost/archive/impl/basic_binary_iarchive.ipp>
-#include <boost/archive/impl/archive_pointer_iserializer.ipp>
-
-namespace boost {
-namespace archive {
-
-// explicitly instantiate for this type of stream
-// explicitly instantiate for this type of stream
-template class basic_binary_iprimitive<
-    array::binary_iarchive,
-    char, 
-    std::char_traits<char> 
->;
-template class basic_binary_iarchive<array::binary_iarchive> ;
-template class binary_iarchive_impl<
-    array::binary_iarchive, 
-    char, 
-    std::char_traits<char> 
->;
-template class detail::archive_pointer_iserializer<array::binary_iarchive> ;
-
-} // namespace archive
-} // namespace boost

Deleted: boost/trunk/libs/serialization/src/array_binary_oarchive.cpp
===================================================================
--- boost/trunk/libs/serialization/src/array_binary_oarchive.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/src/array_binary_oarchive.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,38 +0,0 @@
-/////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
-// binary_oarchive.cpp:
-
-// (C) Copyright 2002 Robert Ramey - http://www.rrsd.com . 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-//  See http://www.boost.org for updates, documentation, and revision history.
-
-#include <ostream>
-
-#define BOOST_ARCHIVE_SOURCE
-#include <boost/archive/array/binary_oarchive.hpp>
-
-#include <boost/archive/impl/basic_binary_oprimitive.ipp>
-#include <boost/archive/impl/basic_binary_oarchive.ipp>
-#include <boost/archive/impl/archive_pointer_oserializer.ipp>
-
-namespace boost {
-namespace archive {
-
-// explicitly instantiate for this type of binary stream
-template class basic_binary_oprimitive<
-    array::binary_oarchive, 
-    char, 
-    std::char_traits<char> 
->;
-template class basic_binary_oarchive<array::binary_oarchive> ;
-template class binary_oarchive_impl<
-    array::binary_oarchive, 
-    char, 
-    std::char_traits<char> 
->;
-template class detail::archive_pointer_oserializer<array::binary_oarchive> ;
-
-} // namespace archive
-} // namespace boost

Deleted: boost/trunk/libs/serialization/test/Jamfile
===================================================================
--- boost/trunk/libs/serialization/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,320 +0,0 @@
-# Boost serialization Library test Jamfile
-
-#  (C) Copyright Robert Ramey 2002-2004.
-#  Use, modification, and distribution are subject to the 
-#  Boost Software License, Version 1.0. (See accompanying file 
-#  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-#
-
-subproject libs/serialization/test ;
-
-# bring in rules for testing
-import testing ;
-
-import ../build/serialization ;
-
-{
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-# these are used to shorten testing while in development.  It permits
-# testing to be applied to just a particular type of archive
-if ! $(BOOST_ARCHIVE_LIST) {
-    BOOST_ARCHIVE_LIST = 
-        "text_archive.hpp" 
-        "text_warchive.hpp" 
-        "binary_archive.hpp" 
-        "array_binary_archive.hpp" 
-        "xml_archive.hpp" 
-        "xml_warchive.hpp" 
-    ;
-    # enable the tests which don't depend on a particular archive
-    BOOST_SERIALIZATION_TEST = true ;
-}
-
-# look in BOOST_ROOT for sources first, just in this Jamfile
-local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-
-rule run-template ( test-name : sources * : requirements * ) {
-    return [
-        run
-            <lib>../../test/build/boost_test_exec_monitor
-            $(sources)
-        : # command
-        : # input files
-        : # requirements
-            std::locale-support
-            toolset::require-boost-spirit-support
-            toolset::suppress-warnings
-            toolset::optimizations
-            $(requirements)
-        : # test name
-            $(test-name)
-        : # default-build
-            debug
-    ] ;
-}
-
-# each of the following tests is run with each type of archive
-rule run-invoke ( test-name : sources * : defns * )
-{    
-    if [ in-invocation-subdir ] { Echo $(test-name) ; }
-    local tests ;
-    tests += [ 
-        run-template $(test-name)
-        : # sources
-            $(sources)
-            <lib>../build/boost_serialization
-        : # requirements
-            # msvc stlport 4.5.3 only works with static lib
-            <msvc-stlport><*><runtime-link>static
-            <vc-6_5-stlport><*><runtime-link>static
-            <vc-7_0-stlport><*><runtime-link>static
-            <define>$(defns)
-            <define>BOOST_LIB_DIAGNOSTIC=1
-    ] ;
-    if [ in-invocation-subdir ] { Echo $(test-name)_dll ; }
-    tests += [ 
-        run-template $(test-name)_dll
-        : # sources
-            $(sources)
-            <dll>../build/boost_serialization
-        : # requiremens
-            toolset::require-shared-libraries-support
-            <define>$(defns)
-            <define>BOOST_LIB_DIAGNOSTIC=1
-            <define>BOOST_ALL_DYN_LINK=1
-            <runtime-link>dynamic
-    ] ;
-    return $(tests) ;
-}
-
-# each of the following tests is run with each type of archive
-rule run-winvoke ( test-name : sources * : defns * )
-{
-    if [ in-invocation-subdir ] { Echo $(test-name) ; }
-    local tests ;
-    tests += [ 
-        run-template $(test-name)
-        : # sources
-            $(sources)
-            <lib>../build/boost_serialization
-            <lib>../build/boost_wserialization
-        : # requirements
-            toolset::require-wide-char-io-support
-            <define>$(defns)
-            <define>BOOST_LIB_DIAGNOSTIC=1
-            # msvc stlport 4.5.3 only works with static lib
-            <msvc-stlport><*><runtime-link>static
-            <vc-6_5-stlport><*><runtime-link>static
-            <vc-7_0-stlport><*><runtime-link>static
-            # both stlport and msvc6 define iswspace
-            <msvc-stlport><*><linkflags>"-force:multiple"
-            <vc-6_5-stlport><*><linkflags>"-force:multiple"
-            <vc-7_0-stlport><*><linkflags>"-force:multiple"
-    ] ;
-    if [ in-invocation-subdir ] { Echo $(test-name)_dll ; }
-    tests += [ 
-        run-template $(test-name)_dll
-        : # sources
-            $(sources)
-            <dll>../build/boost_serialization
-            <dll>../build/boost_wserialization
-        : # requirements
-            toolset::require-wide-char-io-support
-            toolset::require-shared-libraries-support
-            <define>$(defns)
-            <define>BOOST_LIB_DIAGNOSTIC=1
-            <define>BOOST_ALL_DYN_LINK=1
-            <runtime-link>dynamic
-    ] ;
-    return $(tests) ;
-}
-
-# for tests which don't use library code - usually just headers
-rule test-bsl-run-no-lib  ( test-name : sources * )
-{
-    if [ in-invocation-subdir ] { Echo $(test-name) ; }
-    local tests ;
-    tests += [ 
-        run-template $(test-name)
-        : # sources
-            $(test-name).cpp $(sources).cpp
-        : # requirements
-            <msvc-stlport><*><runtime-link>static
-            <vc-6_5-stlport><*><runtime-link>static
-            <vc-7_0-stlport><*><runtime-link>static
-    ] ;
-}
-
-rule test-bsl-run ( test-name : sources * )
-{
-    local tests ;
-    tests +=  [ 
-        run-invoke $(test-name) 
-        : 
-            $(test-name).cpp $(sources).cpp
-    ] ;
-    return $(tests) ;
-}
-
-rule test-bsl-run_archive ( test-name : archive-name : sources * ) {
-    local tests ;
-    switch $(archive-name) {
-    case "*_warchive" :
-        tests +=  [
-            run-winvoke $(test-name)_$(archive-name)
-            : 
-                $(sources).cpp
-            :
-                BOOST_ARCHIVE_TEST=$(archive-name).hpp
-        ] ;
-    case "*" :
-        tests +=  [
-            run-invoke $(test-name)_$(archive-name)
-            : 
-                $(sources).cpp
-            : 
-                BOOST_ARCHIVE_TEST=$(archive-name).hpp
-        ] ;
-    }
-    return $(tests) ;
-}
-
-rule test-bsl-run_files ( test-name : sources * ) {
-    local tests ;
-    for local defn in $(BOOST_ARCHIVE_LIST) {
-        tests += [ 
-            test-bsl-run_archive $(test-name) 
-            : $(defn:LB) 
-            : $(test-name) $(sources)
-        ] ;
-    }
-    return $(tests) ;
-}
-    
-rule test-bsl-run_polymorphic_archive ( test-name : sources * ) {
-    local tests ;
-    for local defn in $(BOOST_ARCHIVE_LIST) {
-        tests += [ 
-            test-bsl-run_archive test
-            : polymorphic_$(defn:LB)  
-            : test_polymorphic $(sources)
-        ] ;
-    }
-    return $(tests) ;
-}
-
-test-suite "serialization" :
-     [ test-bsl-run_files test_array ]
-     [ test-bsl-run_files test_binary ]
-     [ test-bsl-run_files test_contained_class ]
-     [ test-bsl-run_files test_cyclic_ptrs ]
-     [ test-bsl-run_files test_delete_pointer ]
-     [ test-bsl-run_files test_deque ]
-     [ test-bsl-run_files test_derived ]
-     [ test-bsl-run_files test_derived_class ]
-     [ test-bsl-run_files test_derived_class_ptr ]
-     [ test-bsl-run_files test_diamond ]
-     [ test-bsl-run_files test_exported ]
-     [ test-bsl-run_files test_class_info_load ]
-     [ test-bsl-run_files test_class_info_save ]
-     [ test-bsl-run_files test_object ]
-     [ test-bsl-run_files test_primitive ]
-     [ test-bsl-run_files test_list ]
-     [ test-bsl-run_files test_list_ptrs ]
-     [ test-bsl-run_files test_map ]
-     [ test-bsl-run_files test_mi ]
-     [ test-bsl-run_files test_multiple_ptrs ]
-     [ test-bsl-run_files test_no_rtti ]
-     [ test-bsl-run_files test_non_intrusive ]
-     [ test-bsl-run_files test_non_default_ctor ]
-     [ test-bsl-run_files test_non_default_ctor2 ]
-     [ test-bsl-run_files test_null_ptr ]
-     [ test-bsl-run_files test_nvp ]
-     [ test-bsl-run_files test_recursion ]
-     [ test-bsl-run_files test_registered ]
-     [ test-bsl-run_files test_set ]
-     [ test-bsl-run_files test_simple_class ]
-     [ test-bsl-run_files test_simple_class_ptr ]
-     [ test-bsl-run_files test_split ]
-     [ test-bsl-run_files test_tracking ]
-     [ test-bsl-run_files test_unregistered ]
-     [ test-bsl-run_files test_valarray ]
-     [ test-bsl-run_files test_variant ]
-     [ test-bsl-run_files test_vector ]
-     [ test-bsl-run_files test_optional ]
-     [ test-bsl-run_files test_shared_ptr ]
-     [ test-bsl-run_files test_shared_ptr_132 ]
-     [ test-bsl-run_polymorphic_archive test_polymorphic : test_polymorphic_A ]
-;
-
-if $(BOOST_SERIALIZATION_TEST) {
-    test-suite "serialization" : 
-        [ test-bsl-run-no-lib test_iterators ]
-        [ test-bsl-run-no-lib test_iterators_base64 ]
-        [ test-bsl-run-no-lib test_inclusion ]
-        [ test-bsl-run test_private_ctor ]
-        [ test-bsl-run test_reset_object_address ]
-        [ test-bsl-run-no-lib test_smart_cast ]
-        [ test-bsl-run-no-lib test_static_warning ]
-        [ test-bsl-run-no-lib test_utf8_codecvt : ../src/utf8_codecvt_facet ]
-        [ test-bsl-run test_void_cast ]
-        [ test-bsl-run test_mult_archive_types ]
-        [ test-bsl-run-no-lib test_codecvt_null : ../src/codecvt_null ]
-
-        # demos
-        [ test-bsl-run test_demo ]
-        [ test-bsl-run test_demo_auto_ptr ]
-        [ test-bsl-run test_demo_exception ]
-        [ test-bsl-run test_demo_fast_archive ]
-        [ test-bsl-run test_demo_pimpl : ../example/demo_pimpl_A ]
-        [ test-bsl-run test_demo_polymorphic : ../example/demo_polymorphic_A ]
-        [ test-bsl-run test_demo_portable_archive ]
-        [ test-bsl-run test_demo_shared_ptr ]
-        [ test-bsl-run test_demo_xml ]
-        [ test-bsl-run test_demo_xml_load ]
-        [ test-bsl-run test_demo_xml_save ]
-
-        # should fail compilation
-        [ compile-fail test_not_serializable.cpp : std::locale-support ]
-        [ compile-fail test_traits_fail.cpp : std::locale-support ]
-        [ compile-fail test_const_save_fail1.cpp : std::locale-support ]
-        [ compile-fail test_const_save_fail2.cpp : std::locale-support ]
-        [ compile-fail test_const_save_fail3.cpp : std::locale-support ]
-        # note - library unable to detect there errors for now
-        #[ compile-fail test_const_save_fail1_nvp.cpp ]
-        #[ compile-fail test_const_save_fail2_nvp.cpp ]
-        #[ compile-fail test_const_save_fail3_nvp.cpp ]
-        [ compile-fail test_const_load_fail1.cpp : std::locale-support ]
-        [ compile-fail test_const_load_fail2.cpp : std::locale-support ]
-        [ compile-fail test_const_load_fail3.cpp : std::locale-support ]
-        [ compile-fail test_const_load_fail1_nvp.cpp : std::locale-support ]
-        [ compile-fail test_const_load_fail2_nvp.cpp : std::locale-support ]
-        [ compile-fail test_const_load_fail3_nvp.cpp : std::locale-support ]
-
-        # should compile
-        [ compile test_traits_pass.cpp : std::locale-support ]
-        [ compile test_const_pass.cpp : std::locale-support ]
-    ;
-    
-}
-
-saving-tests = [ test-bsl-run_files test_class_info_save ]
-               [ test-bsl-run test_demo_xml_save ] ;
-loading-tests = [ test-bsl-run_files test_class_info_load ]
-                [ test-bsl-run test_demo_xml_load ] ;
-
-## This makes each individual load test depend on the run of the
-## corresponding save test. It is important to do this one at a
-## time because $(saving-tests) and $(loading-tests) can contain
-## the targets for multiple toolsets.
-for local save-test-i in $(saving-tests)
-{
-    DEPENDS $(loading-tests[1]:S=.run) : $(save-test-i:S=.run) ;
-    loading-tests = $(loading-tests[2-]) ;
-}
-
-}
-

Modified: boost/trunk/libs/serialization/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/serialization/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,7 +15,6 @@
         "text_archive.hpp" 
         "text_warchive.hpp" 
         "binary_archive.hpp" 
-        "array_binary_archive.hpp" 
         "xml_archive.hpp" 
         "xml_warchive.hpp" 
     ;
@@ -27,7 +26,7 @@
 rule run-template ( test-name : sources * : requirements * ) {
     return [
         run
-            ../../test/build//boost_test_exec_monitor
+            ../../test/build//boost_test_exec_monitor/<link>static
             $(sources)
         : # command
         : # input files
@@ -258,7 +257,6 @@
      [ test-bsl-run_files test_split ]
      [ test-bsl-run_files test_tracking ]
      [ test-bsl-run_files test_unregistered ]
-     [ test-bsl-run_files test_valarray ]
      [ test-bsl-run_files test_variant ]
      [ test-bsl-run_files test_vector ]
      [ test-bsl-run_files test_optional ]

Deleted: boost/trunk/libs/serialization/test/array_binary_archive.hpp
===================================================================
--- boost/trunk/libs/serialization/test/array_binary_archive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/test/array_binary_archive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,22 +0,0 @@
-// (C) Copyright 2002-4 Robert Ramey - http://www.rrsd.com . 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-//  See http://www.boost.org for updates, documentation, and revision history.
-// (C) Copyright 2002-4 Robert Ramey - http://www.rrsd.com . 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-//  See http://www.boost.org for updates, documentation, and revision history.
-
-// binary_archive
-#include <boost/archive/array/binary_oarchive.hpp>
-typedef boost::archive::array::binary_oarchive test_oarchive;
-typedef std::ofstream test_ostream;
-#include <boost/archive/array/binary_iarchive.hpp>
-typedef boost::archive::array::binary_iarchive test_iarchive;
-typedef std::ifstream test_istream;
-#define TEST_STREAM_FLAGS std::ios::binary
-

Deleted: boost/trunk/libs/serialization/test/polymorphic_array_binary_archive.hpp
===================================================================
--- boost/trunk/libs/serialization/test/polymorphic_array_binary_archive.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/test/polymorphic_array_binary_archive.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +0,0 @@
-// (C) Copyright 2002-4 Robert Ramey - http://www.rrsd.com . 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-//  See http://www.boost.org for updates, documentation, and revision history.
-#include <boost/archive/polymorphic_binary_oarchive.hpp>
-typedef boost::archive::polymorphic_binary_oarchive test_oarchive;
-typedef std::ofstream test_ostream;
-#include <boost/archive/polymorphic_binary_iarchive.hpp>
-typedef boost::archive::polymorphic_binary_iarchive test_iarchive;
-typedef std::ifstream test_istream;
-#define TEST_STREAM_FLAGS std::ios::binary

Modified: boost/trunk/libs/serialization/test/test_exported.cpp
===================================================================
--- boost/trunk/libs/serialization/test/test_exported.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/test/test_exported.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,14 +18,14 @@
 }
 #endif
 
-#include <boost/serialization/base_object.hpp>
-#include <boost/serialization/export.hpp>
-
 #include <boost/archive/archive_exception.hpp>
 #include "test_tools.hpp"
 #include <boost/preprocessor/stringize.hpp>
 #include BOOST_PP_STRINGIZE(BOOST_ARCHIVE_TEST)
 
+#include <boost/serialization/base_object.hpp>
+#include <boost/serialization/export.hpp>
+
 class polymorphic_base
 {
     friend class boost::serialization::access;
@@ -51,9 +51,6 @@
 
 BOOST_CLASS_EXPORT(polymorphic_derived1)
 
-// MWerks users can do this to make their code work
-BOOST_SERIALIZATION_MWERKS_BASE_AND_DERIVED(polymorphic_base, polymorphic_derived1)
-
 class polymorphic_derived2 : public polymorphic_base
 {
     friend class boost::serialization::access;
@@ -67,9 +64,6 @@
 
 BOOST_CLASS_EXPORT(polymorphic_derived2)
 
-// MWerks users can do this to make their code work
-BOOST_SERIALIZATION_MWERKS_BASE_AND_DERIVED(polymorphic_base, polymorphic_derived2)
-
 // save exported polymorphic class
 void save_exported(const char *testfile)
 {

Modified: boost/trunk/libs/serialization/test/test_tools.hpp
===================================================================
--- boost/trunk/libs/serialization/test/test_tools.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/test/test_tools.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -73,14 +73,32 @@
 } // archive
 } // boost
 
-#else
+#else // defined(_WIN32) || defined(__WIN32__) || defined(WIN32)
+#if defined(__hpux)
+// (C) Copyright 2006 Boris Gubenko.
+// HP-UX has a restriction that for multi-thread applications, (i.e.
+// the ones compiled -mt) if argument to tmpnam is a NULL pointer, then,
+// citing the tmpnam(3S) manpage, "the operation is not performed and a
+// NULL pointer is returned". tempnam does not have this restriction, so,
+// let's use tempnam instead.
+ 
+#define tmpnam(X) tempnam(NULL,X)
+ 
+namespace boost {
+namespace archive {
+    using ::tempnam;
+} // archive
+} // boost
 
+#else // defined(__hpux)
+
 namespace boost {
 namespace archive {
     using std::tmpnam;
 } // archive
 } // boost
 
+#endif // defined(__hpux)
 #endif // defined(_WIN32) || defined(__WIN32__) || defined(WIN32)
 
 /////////////////////////////////////////////

Deleted: boost/trunk/libs/serialization/test/test_valarray.cpp
===================================================================
--- boost/trunk/libs/serialization/test/test_valarray.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/test/test_valarray.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,57 +0,0 @@
-/////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
-// test_valarrray.cpp
-
-// (C) Copyright 2005 Matthias Troyer . 
-// Use, modification and distribution is subject to the Boost Software
-// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-// should pass compilation and execution
-
-#include <fstream>
-
-#include <cstdio> // remove
-#include <boost/config.hpp>
-#if defined(BOOST_NO_STDC_NAMESPACE)
-namespace std{ 
-    using ::remove;
-}
-#endif
-
-#include "test_tools.hpp"
-#include <boost/preprocessor/stringize.hpp>
-#include BOOST_PP_STRINGIZE(BOOST_ARCHIVE_TEST)
-
-#include <boost/serialization/valarray.hpp>
-
-int test_main( int /* argc */, char* /* argv */[] )
-{
-    const char * testfile = boost::archive::tmpnam(NULL);
-    BOOST_REQUIRE(NULL != testfile);
-
-    // test array of objects
-    std::valarray<int> avalarray(2);
-    avalarray[0] = 42;
-    avalarray[1] = -42;
-    {   
-        test_ostream os(testfile, TEST_STREAM_FLAGS);
-        test_oarchive oa(os);
-        oa << boost::serialization::make_nvp("avalarray", avalarray);
-    }
-    std::valarray<int> avalarray1;
-    {
-        test_istream is(testfile, TEST_STREAM_FLAGS);
-        test_iarchive ia(is);
-        ia >> boost::serialization::make_nvp("avalarray", avalarray1);
-    }
-    bool equal = (    avalarray.size() == avalarray1.size() 
-                   && avalarray[0] == avalarray1[0]
-                   && avalarray[1] == avalarray1[1]
-                 );
-                  
-    BOOST_CHECK(equal);
-    std::remove(testfile);
-    return EXIT_SUCCESS;
-}
-
-// EOF

Modified: boost/trunk/libs/serialization/vc7ide/BoostSerializationLibrary.sln
===================================================================
--- boost/trunk/libs/serialization/vc7ide/BoostSerializationLibrary.sln	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/vc7ide/BoostSerializationLibrary.sln	2007-02-16 16:48:35 UTC (rev 14035)
@@ -243,10 +243,6 @@
 	ProjectSection(ProjectDependencies) = postProject
 	EndProjectSection
 EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "test_reset_object_address", "test_reset_object_address.vcproj", "{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}"
-	ProjectSection(ProjectDependencies) = postProject
-	EndProjectSection
-EndProject
 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "test_variant", "test_variant.vcproj", "{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}"
 	ProjectSection(ProjectDependencies) = postProject
 	EndProjectSection
@@ -267,18 +263,22 @@
 	ProjectSection(ProjectDependencies) = postProject
 	EndProjectSection
 EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "test_zexp", "test_zexp.vcproj", "{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}"
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "test_shared_ptr_132", "test_shared_ptr_132.vcproj", "{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}"
 	ProjectSection(ProjectDependencies) = postProject
 	EndProjectSection
 EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "test_shared_ptr_132", "test_shared_ptr_132.vcproj", "{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}"
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "test_inclusion", "test_inclusion.vcproj", "{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}"
 	ProjectSection(ProjectDependencies) = postProject
 	EndProjectSection
 EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "test_inclusion", "test_inclusion.vcproj", "{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}"
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "test_reset_object_address", "test_reset_object_addr.vcproj", "{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}"
 	ProjectSection(ProjectDependencies) = postProject
 	EndProjectSection
 EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "test_zmisc", "test_zmisc.vcproj", "{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}"
+	ProjectSection(ProjectDependencies) = postProject
+	EndProjectSection
+EndProject
 Global
 	GlobalSection(SolutionConfiguration) = preSolution
 		Debug runtime-dynamic = Debug runtime-dynamic
@@ -404,7 +404,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -548,7 +548,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -620,7 +620,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -692,7 +692,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -764,7 +764,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -836,7 +836,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -908,7 +908,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -980,7 +980,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -1052,7 +1052,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -1111,8 +1111,8 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Release runtime-static xml_archive.Build.0 = Release runtime-static threading-multi text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Release runtime-static xml_warchive.ActiveCfg = Release runtime-static threading-multi text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Release runtime-static xml_warchive.Build.0 = Release runtime-static threading-multi text_archive|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic.ActiveCfg = Debug runtime-dynamic|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic.Build.0 = Debug runtime-dynamic|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic.ActiveCfg = Debug runtime-dynamic text_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic binary_archive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic binary_archive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic text_archive.ActiveCfg = Debug runtime-dynamic|Win32
@@ -1124,7 +1124,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -1196,7 +1196,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -1268,7 +1268,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -1340,7 +1340,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -1412,7 +1412,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -1484,7 +1484,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -1556,7 +1556,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -1628,7 +1628,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -1700,7 +1700,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -1772,7 +1772,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -1844,7 +1844,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -1916,7 +1916,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -1988,7 +1988,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -2060,7 +2060,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -2132,7 +2132,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -2204,7 +2204,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -2276,7 +2276,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -2348,7 +2348,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -2420,7 +2420,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -2492,7 +2492,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -2564,7 +2564,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -2636,7 +2636,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -2708,7 +2708,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -2780,7 +2780,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -2852,7 +2852,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -2924,7 +2924,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -2996,7 +2996,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -3059,8 +3059,8 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic.Build.0 = Debug runtime-dynamic|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic binary_archive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic binary_archive.Build.0 = Debug runtime-dynamic text_archive|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic text_archive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic text_archive.Build.0 = Debug runtime-dynamic text_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic text_archive.ActiveCfg = Debug runtime-dynamic|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic text_archive.Build.0 = Debug runtime-dynamic|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic text_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic text_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_archive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
@@ -3068,7 +3068,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -3140,7 +3140,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -3212,7 +3212,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -3284,7 +3284,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -3356,7 +3356,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -3428,7 +3428,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -3500,7 +3500,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -3572,7 +3572,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -3644,7 +3644,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -3716,7 +3716,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -3788,7 +3788,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -3860,7 +3860,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -3932,7 +3932,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -4004,7 +4004,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -4076,7 +4076,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -4148,7 +4148,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -4220,7 +4220,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -4292,7 +4292,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -4364,7 +4364,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -4436,7 +4436,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -4508,7 +4508,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -4580,7 +4580,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -4652,7 +4652,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -4724,7 +4724,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -4796,7 +4796,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -4868,7 +4868,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -4940,7 +4940,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -5012,7 +5012,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -5084,7 +5084,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -5147,8 +5147,8 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic.Build.0 = Debug runtime-dynamic|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic binary_archive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic binary_archive.Build.0 = Debug runtime-dynamic text_archive|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic text_archive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic text_archive.Build.0 = Debug runtime-dynamic text_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic text_archive.ActiveCfg = Debug runtime-dynamic|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic text_archive.Build.0 = Debug runtime-dynamic|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic text_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic text_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_archive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
@@ -5156,7 +5156,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -5228,7 +5228,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32
@@ -5300,7 +5300,7 @@
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.ActiveCfg = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-dynamic xml_warchive.Build.0 = Debug runtime-dynamic text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.ActiveCfg = Debug runtime-static|Win32
-		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static threading-multi binary_archive|Win32
+		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static.Build.0 = Debug runtime-static|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.ActiveCfg = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static binary_archive.Build.0 = Debug runtime-static text_archive|Win32
 		{A7D4CC95-F2AC-11D6-9E47-525400E2CF85}.Debug runtime-static text_archive.ActiveCfg = Debug runtime-static text_archive|Win32

Modified: boost/trunk/libs/serialization/vc7ide/Library.vcproj
===================================================================
--- boost/trunk/libs/serialization/vc7ide/Library.vcproj	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/vc7ide/Library.vcproj	2007-02-16 16:48:35 UTC (rev 14035)
@@ -390,6 +390,12 @@
 				RelativePath="..\..\..\boost\serialization\deque.hpp">
 			</File>
 			<File
+				RelativePath="..\..\..\boost\serialization\hash_collections_load_imp.hpp">
+			</File>
+			<File
+				RelativePath="..\..\..\boost\serialization\hash_collections_save_imp.hpp">
+			</File>
+			<File
 				RelativePath="..\..\..\boost\serialization\hash_map.hpp">
 			</File>
 			<File
@@ -833,9 +839,15 @@
 				RelativePath="..\..\..\boost\archive\binary_iarchive.hpp">
 			</File>
 			<File
+				RelativePath="..\..\..\boost\archive\binary_iarchive_impl.hpp">
+			</File>
+			<File
 				RelativePath="..\..\..\boost\archive\binary_oarchive.hpp">
 			</File>
 			<File
+				RelativePath="..\..\..\boost\archive\binary_oarchive_impl.hpp">
+			</File>
+			<File
 				RelativePath="..\..\..\boost\archive\polymorphic_binary_iarchive.hpp">
 			</File>
 			<File

Modified: boost/trunk/libs/serialization/vc7ide/test_inclusion.vcproj
===================================================================
--- boost/trunk/libs/serialization/vc7ide/test_inclusion.vcproj	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/vc7ide/test_inclusion.vcproj	2007-02-16 16:48:35 UTC (rev 14035)
@@ -31,10 +31,9 @@
 			<Tool
 				Name="VCLinkerTool"
 				IgnoreImportLibrary="TRUE"
-				AdditionalDependencies="libboost_serialization.lib libboost_wserialization.lib libboost_test_exec_monitor.lib"
 				LinkIncremental="1"
 				SuppressStartupBanner="TRUE"
-				AdditionalLibraryDirectories="&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/libboost_serialization.lib/vc-7_1/release/runtime-link-static/&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/libboost_wserialization.lib/vc-7_1/release/runtime-link-static/&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/test/build/libboost_test_exec_monitor.lib/vc-7_1/release/runtime-link-static/&quot;"/>
+				AdditionalLibraryDirectories=""/>
 			<Tool
 				Name="VCMIDLTool"/>
 			<Tool
@@ -95,10 +94,9 @@
 			<Tool
 				Name="VCLinkerTool"
 				IgnoreImportLibrary="TRUE"
-				AdditionalDependencies="libboost_serialization.lib libboost_wserialization.lib libboost_test_exec_monitor.lib"
 				LinkIncremental="2"
 				SuppressStartupBanner="TRUE"
-				AdditionalLibraryDirectories="&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/libboost_serialization.lib/vc-7_1/debug/threading-multi/&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/libboost_wserialization.lib/vc-7_1/debug/threading-multi/&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/test/build/libboost_test_exec_monitor.lib/vc-7_1/debug/threading-multi/&quot;"
+				AdditionalLibraryDirectories=""
 				GenerateDebugInformation="TRUE"
 				SubSystem="1"
 				TargetMachine="1"/>
@@ -161,10 +159,9 @@
 			<Tool
 				Name="VCLinkerTool"
 				IgnoreImportLibrary="TRUE"
-				AdditionalDependencies="libboost_serialization.lib libboost_wserialization.lib libboost_test_exec_monitor.lib"
 				LinkIncremental="1"
 				SuppressStartupBanner="TRUE"
-				AdditionalLibraryDirectories="&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/libboost_serialization.lib/vc-7_1/release/runtime-link-static/threading-multi/&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/libboost_wserialization.lib/vc-7_1/release/runtime-link-static/threading-multi/&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/test/build/libboost_test_exec_monitor.lib/vc-7_1/release/runtime-link-static/threading-multi/&quot;"
+				AdditionalLibraryDirectories=""
 				SubSystem="1"
 				TargetMachine="1"/>
 			<Tool
@@ -226,10 +223,9 @@
 			<Tool
 				Name="VCLinkerTool"
 				IgnoreImportLibrary="TRUE"
-				AdditionalDependencies="libboost_serialization.lib libboost_wserialization.lib libboost_test_exec_monitor.lib"
 				LinkIncremental="1"
 				SuppressStartupBanner="TRUE"
-				AdditionalLibraryDirectories="&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/libboost_serialization.lib/vc-7_1/release/threading-multi/&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/libboost_wserialization.lib/vc-7_1/release/threading-multi/&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/test/build/libboost_test_exec_monitor.lib/vc-7_1/release/threading-multi/&quot;"
+				AdditionalLibraryDirectories=""
 				SubSystem="1"
 				TargetMachine="1"/>
 			<Tool
@@ -292,10 +288,9 @@
 			<Tool
 				Name="VCLinkerTool"
 				IgnoreImportLibrary="TRUE"
-				AdditionalDependencies="libboost_serialization.lib libboost_wserialization.lib libboost_test_exec_monitor.lib"
 				LinkIncremental="2"
 				SuppressStartupBanner="TRUE"
-				AdditionalLibraryDirectories="&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/libboost_serialization.lib/vc-7_1/debug/runtime-link-static/&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/libboost_wserialization.lib/vc-7_1/debug/runtime-link-static/&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/test/build/libboost_test_exec_monitor.lib/vc-7_1/debug/runtime-link-static/&quot;"
+				AdditionalLibraryDirectories=""
 				GenerateDebugInformation="TRUE"
 				SubSystem="1"
 				TargetMachine="1"/>
@@ -359,10 +354,9 @@
 			<Tool
 				Name="VCLinkerTool"
 				IgnoreImportLibrary="TRUE"
-				AdditionalDependencies="libboost_serialization.lib libboost_wserialization.lib libboost_test_exec_monitor.lib"
 				LinkIncremental="2"
 				SuppressStartupBanner="TRUE"
-				AdditionalLibraryDirectories="&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/libboost_serialization.lib/vc-7_1/debug/runtime-link-static/threading-multi&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/libboost_wserialization.lib/vc-7_1/debug/runtime-link-static/threading-multi&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/test/build/libboost_test_exec_monitor.lib/vc-7_1/debug/runtime-link-static/threading-multi&quot;"
+				AdditionalLibraryDirectories=""
 				GenerateDebugInformation="TRUE"
 				SubSystem="1"
 				TargetMachine="1"/>

Modified: boost/trunk/libs/serialization/vc7ide/test_set.vcproj
===================================================================
--- boost/trunk/libs/serialization/vc7ide/test_set.vcproj	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/serialization/vc7ide/test_set.vcproj	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,7 +36,6 @@
 			<Tool
 				Name="VCLinkerTool"
 				IgnoreImportLibrary="TRUE"
-				AdditionalDependencies="libboost_test_exec_monitor.lib"
 				LinkIncremental="2"
 				SuppressStartupBanner="TRUE"
 				AdditionalLibraryDirectories="&quot;$(ProjectDir)../../../bin/boost/libs/test/build/libboost_test_exec_monitor.lib/vc-7_1/debug/threading-multi&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/libboost_wserialization.lib/vc-7_1/debug/threading-multi&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/libboost_serialization.lib/vc-7_1/debug/threading-multi&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/boost_wserialization.dll/vc-7_1/debug/threading-multi&quot;;&quot;$(ProjectDir)../../../bin/boost/libs/serialization/build/boost_serialization.dll/vc-7_1/debug/threading-multi&quot;"
@@ -1695,12 +1694,12 @@
 	<References>
 	</References>
 	<Files>
-              <File
-                     RelativePath="..\test\test_set.cpp">
-              </File>
-              <File
-                     RelativePath="..\test\A.hpp">
-              </File>
+		<File
+			RelativePath="..\test\A.hpp">
+		</File>
+		<File
+			RelativePath="..\test\test_set.cpp">
+		</File>
 	</Files>
 	<Globals>
 	</Globals>

Deleted: boost/trunk/libs/signals/build/Jamfile
===================================================================
--- boost/trunk/libs/signals/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,64 +0,0 @@
-# Boost.Signals Library 
-
-# Copyright Douglas Gregor 2001-2003. Use, modification and
-# distribution is subject to the Boost Software License, Version
-# 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-
-# For more information, see http://www.boost.org
-
-# declare the location of this subproject relative to the root
-subproject libs/signals/build ;
-
-#
-# this template defines the options common to
-# all signals builds and tests:
-#
-template signals-options
-   : # sources
-   : # requirements
-     <define>BOOST_SIGNALS_NO_LIB=1        
-     <sysinclude>$(BOOST_ROOT)
-   ;
-
-#
-# this template defines the options common to
-# all signals dll builds and tests:
-#
-template signals-dll-options
-   : <template>signals-options # sources
-   : # requirements
-     <define>BOOST_SIGNALS_DYN_LINK=1      
-     <runtime-link>dynamic
-   ;
-
-SOURCES = trackable connection named_slot_map signal_base slot ;
-       
-lib boost_signals : ../src/$(SOURCES).cpp <template>signals-options
-    :
-        [ common-names ]
-    : 
-        debug release
-    ;
-
-
-dll boost_signals : ../src/$(SOURCES).cpp <template>signals-dll-options
-    : 
-       [ common-names ]
-    : 
-        debug release
-    ;
-    
-stage stage/lib : <lib>boost_signals <dll>boost_signals
-    :
-        <locate>$(BOOST_ROOT)
-        [ common-names ]
-        <target>stage
-        <target>all
-    :
-        debug release
-    ;
-
-install signals lib
-    : <dll>boost_signals <lib>boost_signals
-    ;

Modified: boost/trunk/libs/signals/doc/Jamfile.v2
===================================================================
--- boost/trunk/libs/signals/doc/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+#   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+#   Distributed under the Boost Software License, Version 1.0.
+#   (See accompanying file LICENSE_1_0.txt or copy at
+#   http://www.boost.org/LICENSE_1_0.txt)
 project boost/doc ;
 import boostbook : boostbook ;
 

Modified: boost/trunk/libs/signals/doc/design.xml
===================================================================
--- boost/trunk/libs/signals/doc/design.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/design.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE section PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section last-revision="$Date: 2003/03/12 23:27:22 $">
+<section last-revision="$Date: 2006/11/03 19:45:40 $">
   <title>Design Overview</title>
 
   <using-namespace name="boost"/>

Modified: boost/trunk/libs/signals/doc/faq.xml
===================================================================
--- boost/trunk/libs/signals/doc/faq.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/faq.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE section PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section last-revision="$Date: 2006/02/27 13:29:58 $">
+<section last-revision="$Date: 2006/11/03 19:45:40 $">
   <title>Frequently Asked Questions</title>
   
   <qandaset>
@@ -25,8 +32,10 @@
       <answer>
         <para>No. Using Boost.Signals in a multithreaded concept is
         very dangerous, and it is very likely that the results will be
-        less than satisfying. Boost.Signals will support thread safety
-        in the future.</para>
+        less than satisfying. Even trying to invoke the same signal from
+        two different threads is dangerous. Although we would like to
+        make Signals thread-safe, it is unlikely to happen without
+        help from other developers.</para>
       </answer>
     </qandaentry>
     <qandaentry>

Modified: boost/trunk/libs/signals/doc/index.html
===================================================================
--- boost/trunk/libs/signals/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,20 @@
 <html>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <head>
 <meta http-equiv="refresh" content="0; URL=../../../doc/html/signals.html">
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="../../../doc/html/signals.html">../../../doc/html/signals.html</a>
+<a href="../../../doc/html/signals.html">../../../doc/html/signals.html</a> &nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
-</html>
+</html>
\ No newline at end of file

Modified: boost/trunk/libs/signals/doc/introduction.xml
===================================================================
--- boost/trunk/libs/signals/doc/introduction.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/introduction.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE section PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section last-revision="$Date: 2003/03/12 23:27:23 $">
+<section last-revision="$Date: 2006/11/03 19:45:40 $">
   <title>Introduction</title>
 
 <para>The Boost.Signals library is an implementation of a managed

Modified: boost/trunk/libs/signals/doc/rationale.xml
===================================================================
--- boost/trunk/libs/signals/doc/rationale.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/rationale.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE section PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section last-revision="$Date: 2004/07/20 17:03:55 $">
+<section last-revision="$Date: 2006/11/03 19:45:40 $">
   <title>Design Rationale</title>
 
   <using-namespace name="boost"/>

Modified: boost/trunk/libs/signals/doc/reference/connection.xml
===================================================================
--- boost/trunk/libs/signals/doc/reference/connection.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/reference/connection.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE header PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<header name="boost/signals/connection.hpp" last-revision="$Date: 2005/02/19 23:44:26 $">
+<header name="boost/signals/connection.hpp" last-revision="$Date: 2006/11/03 19:45:41 $">
   <namespace name="boost">
     <namespace name="signals">
       <class name="connection">

Modified: boost/trunk/libs/signals/doc/reference/last_value.xml
===================================================================
--- boost/trunk/libs/signals/doc/reference/last_value.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/reference/last_value.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE header PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<header name="boost/last_value.hpp" last-revision="$Date: 2004/09/13 15:41:01 $">
+<header name="boost/last_value.hpp" last-revision="$Date: 2006/11/03 19:45:41 $">
   <namespace name="boost">
     <class name="last_value">
       <template>

Modified: boost/trunk/libs/signals/doc/reference/reference.xml
===================================================================
--- boost/trunk/libs/signals/doc/reference/reference.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/reference/reference.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE library-reference PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
 <library-reference xmlns:xi="http://www.w3.org/2001/XInclude" 
-                   last-revision="$Date: 2003/03/12 23:27:25 $">
+                   last-revision="$Date: 2006/11/03 19:45:41 $">
   <xi:include href="signal_header.xml"/>
   <xi:include href="slot.xml"/>
   <xi:include href="trackable.xml"/>

Modified: boost/trunk/libs/signals/doc/reference/signal_header.xml
===================================================================
--- boost/trunk/libs/signals/doc/reference/signal_header.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/reference/signal_header.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE header PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<header name="boost/signal.hpp" last-revision="$Date: 2004/05/04 18:17:22 $">
+<header name="boost/signal.hpp" last-revision="$Date: 2006/11/03 19:45:41 $">
   <namespace name="boost">
     <namespace name="signals">
       <enum name="connect_position">

Modified: boost/trunk/libs/signals/doc/reference/slot.xml
===================================================================
--- boost/trunk/libs/signals/doc/reference/slot.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/reference/slot.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE header PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<header name="boost/signals/slot.hpp" last-revision="$Date: 2003/03/12 23:27:25 $">
+<header name="boost/signals/slot.hpp" last-revision="$Date: 2006/11/03 19:45:41 $">
   <namespace name="boost">
     <class name="slot">
       <template>

Modified: boost/trunk/libs/signals/doc/reference/trackable.xml
===================================================================
--- boost/trunk/libs/signals/doc/reference/trackable.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/reference/trackable.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE header PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
 <header name="boost/signals/trackable.hpp">

Modified: boost/trunk/libs/signals/doc/reference/visit_each.xml
===================================================================
--- boost/trunk/libs/signals/doc/reference/visit_each.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/reference/visit_each.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE header PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<header name="boost/visit_each.hpp" last-revision="$Date: 2003/03/16 02:00:34 $">
+<header name="boost/visit_each.hpp" last-revision="$Date: 2006/11/03 19:45:41 $">
   <namespace name="boost">
     <function name="visit_each">
       <template>

Modified: boost/trunk/libs/signals/doc/tests.xml
===================================================================
--- boost/trunk/libs/signals/doc/tests.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/tests.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE testsuite PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<testsuite last-revision="$Date: 2003/11/17 21:07:23 $">
+<testsuite last-revision="$Date: 2006/11/03 19:45:40 $">
   <run-test filename="dead_slot_test.cpp">
     <lib>../../../libs/test/build/boost_test_exec_monitor</lib>
     <lib>../build/boost_signals</lib>

Modified: boost/trunk/libs/signals/doc/tutorial.xml
===================================================================
--- boost/trunk/libs/signals/doc/tutorial.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/doc/tutorial.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE section PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<section last-revision="$Date: 2005/05/18 16:09:34 $" id="signals.tutorial">
+<section last-revision="$Date: 2007/01/29 20:04:57 $" id="signals.tutorial">
   <title>Tutorial</title>
 
   <using-namespace name="boost"/>
@@ -374,8 +374,8 @@
 <para>This program will print out the following:</para>
 <programlisting>
 The sum is 8
-The difference is 2
 The product is 15
+The difference is 2
 The quotient is 1.66667
 </programlisting>
 <para>So any values that are given to <code>sig</code> when it is
@@ -1115,23 +1115,11 @@
   <title>Linking against the Signals library</title>
 
   <para>Part of the Boost.Signals library is compiled into a binary
-  library that must be linked into your application to use Signals. To
-  build this library, execute the command <command>bjam</command> in
-  either the top-level Boost directory or in
-  <code>libs/signals/build</code>. On Unix, the directory
-  <code>libs/signals/build/bin-stage</code> will then contain
-  libraries named, e.g., <code>libboost_signals.a</code> that can be
-  linked in your program with <code>-lboost_signals</code>.</para>
-
-  <para>On Windows, with Microsoft Visual C++ or Borland C++, the
-  linking process is nearly automatic. As with the
-  <libraryname>Regex</libraryname> library, the libraries in
-  <code>libs\signals\build\bin-stage</code> will have mangled names
-  and will be automatically be including in the link process. To link
-  against the Signals library binary dynamically (e.g., using the
-  Signals DLL), define <code>BOOST_SIGNALS_DYN_LINK</code> when
-  building your application; to link statically, define
-  <code>BOOST_SIGNALS_STATIC_LINK</code>. </para>
+  library that must be linked into your application to use
+  Signals. Please refer to
+    the <ulink url="../../more/getting_started.html">Getting Started</ulink>
+  guide. You will need to link against the <code>boost_signals</code>
+  library.</para>
 </section>
 
 </section>

Deleted: boost/trunk/libs/signals/example/Jamfile
===================================================================
--- boost/trunk/libs/signals/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,54 +0,0 @@
-# Boost.Signals Library 
-
-# Copyright Douglas Gregor 2001-2003. Use, modification and
-# distribution is subject to the Boost Software License, Version
-# 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-
-# For more information, see http://www.boost.org
-
-subproject libs/signals/example ;
-
-exe button_click : <lib>../build/boost_signals
-                    button_click.cpp
-                  : <include>$(BOOST_ROOT)
-                  ;
-
-exe difference_connection : <lib>../build/boost_signals
-                    difference_connection.cpp
-                  : <include>$(BOOST_ROOT)
-                  ;
-
-exe disconnect_all : <lib>../build/boost_signals
-                    disconnect_all.cpp
-                  : <include>$(BOOST_ROOT)
-                  ;
-
-exe first_positive : <lib>../build/boost_signals
-                    first_positive.cpp
-                  : <include>$(BOOST_ROOT)
-                  ;
-
-exe maximum : <lib>../build/boost_signals
-                    maximum.cpp
-                  : <include>$(BOOST_ROOT)
-                  ;
-exe print_sum_product : <lib>../build/boost_signals
-                    print_sum_product.cpp
-                  : <include>$(BOOST_ROOT)
-                  ;
-
-exe quotient_controlling : <lib>../build/boost_signals
-                    quotient_controlling.cpp
-                  : <include>$(BOOST_ROOT)
-                  ;
-
-exe quotient_named : <lib>../build/boost_signals
-                    quotient_named.cpp
-                  : <include>$(BOOST_ROOT)
-                  ;
-
-exe no_function : <lib>../build/boost_signals
-                  no_function.cpp
-                : <include>$(BOOST_ROOT)
-                ;

Modified: boost/trunk/libs/signals/index.html
===================================================================
--- boost/trunk/libs/signals/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,20 @@
 <html>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <head>
 <meta http-equiv="refresh" content="0; URL=../../doc/html/signals.html">
 </head>
 <body>
 Automatic redirection failed, please go to
-<a href="../../doc/html/signals.html">../../doc/html/signals.html</a>
+<a href="../../doc/html/signals.html">../../doc/html/signals.html</a> &nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
-</html>
+</html>
\ No newline at end of file

Modified: boost/trunk/libs/signals/src/named_slot_map.cpp
===================================================================
--- boost/trunk/libs/signals/src/named_slot_map.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/src/named_slot_map.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,47 +23,7 @@
 typedef slot_container_type::iterator group_iterator;
 typedef slot_container_type::const_iterator const_group_iterator;
 
-named_slot_map_iterator::named_slot_map_iterator() : slot_assigned(false) {}
 
-named_slot_map_iterator::
-named_slot_map_iterator(const named_slot_map_iterator& other)
-  : group(other.group), last_group(other.last_group),
-    slot_assigned(other.slot_assigned)
-{
-  if (slot_assigned) slot_ = other.slot_;
-}
-
-named_slot_map_iterator&
-named_slot_map_iterator::operator=(const named_slot_map_iterator& other)
-{
-  slot_assigned = other.slot_assigned;
-  group = other.group;
-  last_group = other.last_group;
-  if (slot_assigned) slot_ = other.slot_;
-  return *this;
-}
-
-
-connection_slot_pair& named_slot_map_iterator::dereference() const
-{ return *slot_; }
-
-void named_slot_map_iterator::increment()
-{
-  ++slot_;
-  if (slot_ == group->second.end()) {
-    ++group;
-    init_next_group();
-  }
-}
-
-bool
-named_slot_map_iterator::equal(const named_slot_map_iterator& other) const
-{
-  return (group == other.group
-          && (group == last_group
-              || slot_ == other.slot_));
-}
-
 #if BOOST_WORKAROUND(_MSC_VER, <= 1400)
 void named_slot_map_iterator::decrement() { assert(false); }
 void named_slot_map_iterator::advance(difference_type) { assert(false); }

Deleted: boost/trunk/libs/signals/test/Jamfile
===================================================================
--- boost/trunk/libs/signals/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,41 +0,0 @@
-# Signals library
-
-# Copyright (C) 2001-2003 Douglas Gregor
-
-# Use, modification and distribution is subject to the Boost Software License, 
-# Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at 
-# http://www.boost.org/LICENSE_1_0.txt) 
-
-# For more information, see http://www.boost.org/
-
-
-# Testing Jamfile autogenerated from XML source
-subproject libs/signals/test ;
-
-# bring in rules for testing
-SEARCH on testing.jam = $(BOOST_BUILD_PATH) ;
-include testing.jam ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-  # look in BOOST_ROOT for sources first, just in this Jamfile
-  local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-
-  test-suite signals
-    : 
-  [ run libs/signals/test/dead_slot_test.cpp <lib>../build/boost_signals :  :  : <define>BOOST_ALL_NO_LIB=1 :  ]
-
-  [ run libs/signals/test/deletion_test.cpp <lib>../build/boost_signals :  :  : <define>BOOST_ALL_NO_LIB=1 :  ]
-
-  [ run libs/signals/test/ordering_test.cpp <lib>../build/boost_signals :  :  : <define>BOOST_ALL_NO_LIB=1 :  ]
-
-  [ run libs/signals/test/signal_n_test.cpp <lib>../build/boost_signals :  :  : <define>BOOST_ALL_NO_LIB=1 :  ]
-
-  [ run libs/signals/test/signal_test.cpp <lib>../build/boost_signals :  :  : <define>BOOST_ALL_NO_LIB=1 :  ]
-
-  [ run libs/signals/test/trackable_test.cpp <lib>../build/boost_signals :  :  : <define>BOOST_ALL_NO_LIB=1 :  ]
- ;
-}
-      

Modified: boost/trunk/libs/signals/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/signals/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,6 +17,7 @@
         <library>../../test/build//boost_test_exec_monitor
         <library>../build//boost_signals
         <define>BOOST_SIGNALS_STATIC_LINK
+        <link>static
     ;
 {
   test-suite signals

Modified: boost/trunk/libs/signals/test/deletion_test.cpp
===================================================================
--- boost/trunk/libs/signals/test/deletion_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/signals/test/deletion_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -240,7 +240,7 @@
   s0(); std::cout << std::endl;
   BOOST_CHECK(test_output == "0123");
 
-#if BOOST_WORKAROUND(BOOST_MSVC, <= 0x1700)
+#if BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
   connections[2].disconnect();
 #else
   s0.disconnect(remove_connection(2));

Modified: boost/trunk/libs/smart_ptr/enable_shared_from_this.html
===================================================================
--- boost/trunk/libs/smart_ptr/enable_shared_from_this.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/smart_ptr/enable_shared_from_this.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -84,9 +84,8 @@
 		</blockquote>
 		<p>
 			<br>
-			<small>Copyright © 2002, 2003 by Peter Dimov. Permission to copy, use, modify, sell 
-				and distribute this document is granted provided this copyright notice appears 
-				in all copies. This document is provided "as is" without express or implied 
-				warranty, and with no claim as to its suitability for any purpose.</small></p>
+			<small>Copyright © 2002, 2003 by Peter Dimov. Distributed under the Boost Software License, Version 
+				1.0. See accompanying file <A href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</A> or 
+				copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>.</small></p>
 	</body>
 </html>

Modified: boost/trunk/libs/smart_ptr/index.html
===================================================================
--- boost/trunk/libs/smart_ptr/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/smart_ptr/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,3 +7,9 @@
 <a href="smart_ptr.htm">smart_ptr.htm</a>.
 </body>
 </html>
+<!--
+	© Copyright Beman Dawes, 2001
+	Distributed under the Boost Software License, Version 1.0.
+	See accompanying file LICENSE_1_0.txt or copy at
+	http://www.boost.org/LICENSE_1_0.txt
+-->

Modified: boost/trunk/libs/smart_ptr/intrusive_ptr.html
===================================================================
--- boost/trunk/libs/smart_ptr/intrusive_ptr.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/smart_ptr/intrusive_ptr.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -276,11 +276,10 @@
 		</BLOCKQUOTE>
 		<hr>
 		<p>
-			$Date: 2006/03/06 23:06:10 $</p>
+			$Date: 2006/11/09 20:22:24 $</p>
 		<p>
-			<small>Copyright © 2003-2005 Peter Dimov. Permission to copy, use, modify, sell and 
-				distribute this document is granted provided this copyright notice appears in 
-				all copies. This document is provided "as is" without express or implied 
-				warranty, and with no claim as to its suitability for any purpose.</small></p>
+			<small>Copyright © 2003-2005 Peter Dimov. Distributed under the Boost Software License, Version 
+				1.0. See accompanying file <A href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</A> or 
+				copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>.</small></p>
 	</body>
 </html>

Modified: boost/trunk/libs/smart_ptr/sp_techniques.html
===================================================================
--- boost/trunk/libs/smart_ptr/sp_techniques.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/smart_ptr/sp_techniques.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -757,10 +757,9 @@
 		<p>When the object's lifetime ends, <code>X::this_</code> will be destroyed, and 
 			all weak pointers will automatically expire.</p>
 		<hr>
-		<p>$Date: 2005/11/05 14:33:42 $</p>
-		<p><small>Copyright © 2003 Peter Dimov. Permission to copy, use, modify, sell and 
-				distribute this document is granted provided this copyright notice appears in 
-				all copies. This document is provided "as is" without express or implied 
-				warranty, and with no claim as to its suitability for any purpose.</small></p>
+		<p>$Date: 2006/11/09 20:22:24 $</p>
+		<p><small>Copyright © 2003 Peter Dimov. Distributed under the Boost Software License, Version 
+				1.0. See accompanying file <A href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</A> or 
+				copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>.</small></p>
 	</body>
 </html>

Deleted: boost/trunk/libs/smart_ptr/test/Jamfile
===================================================================
--- boost/trunk/libs/smart_ptr/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/smart_ptr/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,48 +0,0 @@
-#  Boost.SmartPtr Library test Jamfile
-#
-#  Copyright (c) 2003-2005 Peter Dimov
-#  Copyright (c) 2003 Dave Abrahams
-#
-#  Permission to copy, use, modify, sell and distribute this software
-#  is granted provided this copyright notice appears in all copies.
-#  This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
-
-subproject libs/smart_ptr/test ;
-
-# bring in rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : smart_ptr ;
-
-{
-    test-suite "smart_ptr"
-        : [ run smart_ptr_test.cpp ]
-          [ run shared_ptr_basic_test.cpp : : : <gcc><*><cxxflags>-Wno-non-virtual-dtor ]
-          [ run shared_ptr_test.cpp : : : <gcc><*><cxxflags>-Wno-non-virtual-dtor ]
-          [ run weak_ptr_test.cpp ]
-          [ run shared_from_this_test.cpp : : : <gcc><*><cxxflags>-Wno-non-virtual-dtor ]
-          [ run get_deleter_test.cpp ]
-          [ run intrusive_ptr_test.cpp ]
-          [ run intrusive_ptr_test.cpp ]
-          [ run atomic_count_test.cpp ]
-          [ run lw_mutex_test.cpp ]
-          [ compile-fail shared_ptr_assign_fail.cpp ]
-          [ compile-fail shared_ptr_delete_fail.cpp ]
-          [ run shared_ptr_alloc2_test.cpp ]
-          [ run pointer_cast_test.cpp ]
-          [ compile pointer_to_other_test.cpp ]
-          [ run auto_ptr_rv_test.cpp ]
-        ;
-    
-    # this one is too slow to run unless explicitly requested, and ALL
-    # tests are run by default when this file is subincluded from
-    # boost/status, so it's guarded from that case.  It will only be
-    # built from this directory when the targets "test" (all tests) or
-    # "shared_ptr_alloc_test" are requested.
-    if [ in-invocation-subdir ]
-    {
-        run shared_ptr_alloc_test.cpp ;
-    }
-}

Modified: boost/trunk/libs/smart_ptr/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/smart_ptr/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/smart_ptr/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,10 +3,9 @@
 #  Copyright (c) 2003-2005 Peter Dimov
 #  Copyright (c) 2003 Dave Abrahams
 #
-#  Permission to copy, use, modify, sell and distribute this software
-#  is granted provided this copyright notice appears in all copies.
-#  This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+#  Distributed under the Boost Software License, Version 1.0. (See
+#  accompanying file LICENSE_1_0.txt or copy at
+#  http://www.boost.org/LICENSE_1_0.txt)
 
 # bring in rules for testing
 import testing ;

Modified: boost/trunk/libs/spirit/change_log.html
===================================================================
--- boost/trunk/libs/spirit/change_log.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/change_log.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,6 +16,7 @@
   <li>Fixed bug in tree match policies that prevented using gen_pt/ast_node_d,
     <a href="http://article.gmane.org/gmane.comp.parsers.spirit.general/9013">reported
     by Jascha Wetzel</a>.</li>
+  <li>Made position_iterator usable with wchar_t based strings. </li>
 </ul>
 <h2>1.8.3</h2>
 <ul>

Deleted: boost/trunk/libs/spirit/example/Jamfile
===================================================================
--- boost/trunk/libs/spirit/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,347 +0,0 @@
-#==============================================================================
-#   Copyright (c) 2002 Joel de Guzman
-#   http://spirit.sourceforge.net/
-#
-#   Use, modification and distribution is subject to the Boost Software
-#   License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-#   http://www.boost.org/LICENSE_1_0.txt)
-#==============================================================================
-#
-#  Spirit examples boost-jam file
-#  Joel de Guzman [Sep 27, 2002]    : created
-#  Joel de Guzman [Oct 30, 2003]    : separated the applications
-#  Martin Wille   [Jan 15, 2004]    : changes for new directory structure
-#  Martin Wille   [Jan 20, 2004]    : more changes for new directory structure
-#  Joel de Guzman [Jul 29, 2004]    : added calc_debug.cpp
-#
-
-subproject libs/spirit/example ;
-
-exe ast_calc
-    : fundamental/ast_calc.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe "bind"
-    : fundamental/bind.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe boiler_plate
-    : fundamental/boiler_plate.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe calc_plain
-    : fundamental/calc_plain.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe calc_debug
-    : fundamental/calc_debug.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe comments
-    : fundamental/comments.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe complex_number
-    : fundamental/complex_number.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe error_handling
-    : fundamental/error_handling.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe error_reporting
-    : fundamental/error_reporting.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe file_parser
-    : fundamental/file_parser.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe full_calc
-    : fundamental/full_calc.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe functor_parser
-    : fundamental/functor_parser.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe list_parser
-    : fundamental/list_parser.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe matching_tags
-    : fundamental/matching_tags.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe no_actions
-    : fundamental/no_actions.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe number_list
-    : fundamental/number_list.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe parse_tree_calc1
-    : fundamental/parse_tree_calc1.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe parser_context
-    : fundamental/parser_context.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe phoenix_calc
-    : fundamental/phoenix_calc.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe position_iterator
-    : fundamental/position_iterator/position_iterator.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe refactoring
-    : fundamental/refactoring.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe regular_expression
-    : fundamental/regular_expression.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe roman_numerals
-    : fundamental/roman_numerals.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe stuff_vector
-    : fundamental/stuff_vector.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe stuff_vector2
-    : fundamental/stuff_vector2.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe subrule_calc
-    : fundamental/subrule_calc.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe sum
-    : fundamental/sum.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe thousand_separated
-    : fundamental/thousand_separated.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe ast_calc2
-    : fundamental/more_calculators/ast_calc2.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe calc_with_variables
-    : fundamental/more_calculators/calc_with_variables.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe phoenix_subrule_calc
-    : fundamental/more_calculators/phoenix_subrule_calc.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe primitive_calc
-    : fundamental/more_calculators/primitive_calc.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe rpn_calc
-    : fundamental/more_calculators/rpn_calc.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe vmachine_calc
-    : fundamental/more_calculators/vmachine_calc.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe distinct_parser
-    : fundamental/distinct/distinct_parser.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe distinct_parser_dynamic
-    : fundamental/distinct/distinct_parser_dynamic.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-################################################################################
-
-exe ipv4
-    : intermediate/ipv4.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe ipv4_opt
-    : intermediate/ipv4_opt.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe lazy_parser
-    : intermediate/lazy_parser.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe parameters
-    : intermediate/parameters.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe regex_convert
-    : intermediate/regex_convert.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-################################################################################
-
-exe dynamic_rule
-    : techniques/dynamic_rule.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe epsilon
-    : techniques/epsilon.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe multiple_scanners
-    : techniques/multiple_scanners.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe nabialek
-    : techniques/nabialek.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe no_rule1
-    : techniques/no_rules/no_rule1.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe no_rule2
-    : techniques/no_rules/no_rule2.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe no_rule3
-    : techniques/no_rules/no_rule3.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe typeof
-    : techniques/typeof.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe rule_parser_1_1
-    : techniques/no_rules_with_typeof/rule_parser_1_1.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe rule_parser_1_2
-    : techniques/no_rules_with_typeof/rule_parser_1_2.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe rule_parser_2_1
-    : techniques/no_rules_with_typeof/rule_parser_2_1.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe rule_parser_2_2
-    : techniques/no_rules_with_typeof/rule_parser_2_2.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-exe opaque_rule_parser
-    : techniques/no_rules_with_typeof/opaque_rule_parser.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-

Modified: boost/trunk/libs/spirit/example/intermediate/simple_xml/actions.hpp
===================================================================
--- boost/trunk/libs/spirit/example/intermediate/simple_xml/actions.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/example/intermediate/simple_xml/actions.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+//  Copyright (c) 2005 Carl Barron. Distributed under the Boost
+//  Software License, Version 1.0. (See accompanying file
+//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 #ifndef ACTIONS_H
 #define ACTIONS_H
 #include <boost/spirit/phoenix.hpp>

Modified: boost/trunk/libs/spirit/example/intermediate/simple_xml/driver.cpp
===================================================================
--- boost/trunk/libs/spirit/example/intermediate/simple_xml/driver.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/example/intermediate/simple_xml/driver.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+//  Copyright (c) 2005 Carl Barron. Distributed under the Boost
+//  Software License, Version 1.0. (See accompanying file
+//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 #include "xml_g.hpp"
 #include <boost/spirit/utility.hpp>
 #include <iostream>

Modified: boost/trunk/libs/spirit/example/intermediate/simple_xml/tag.cpp
===================================================================
--- boost/trunk/libs/spirit/example/intermediate/simple_xml/tag.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/example/intermediate/simple_xml/tag.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+//  Copyright (c) 2005 Carl Barron. Distributed under the Boost
+//  Software License, Version 1.0. (See accompanying file
+//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 #include "tag.hpp"
 #include <iostream>
 #include <algorithm>

Modified: boost/trunk/libs/spirit/example/intermediate/simple_xml/xml_g.hpp
===================================================================
--- boost/trunk/libs/spirit/example/intermediate/simple_xml/xml_g.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/example/intermediate/simple_xml/xml_g.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+//  Copyright (c) 2005 Carl Barron. Distributed under the Boost
+//  Software License, Version 1.0. (See accompanying file
+//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 #ifndef XML_G_H
 #define XML_G_H
 #define BOOST_SPIRIT_DEBUG

Modified: boost/trunk/libs/spirit/example/techniques/no_rules_with_typeof/rule_parser_2_1.cpp
===================================================================
--- boost/trunk/libs/spirit/example/techniques/no_rules_with_typeof/rule_parser_2_1.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/example/techniques/no_rules_with_typeof/rule_parser_2_1.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,6 +15,8 @@
 #include <string>
 #include <iostream>
 
+// The type of our parser expression is complex...
+#define BOOST_TYPEOF_LIMIT_SIZE 100
 #include <boost/typeof/typeof.hpp>
 
 #include <boost/spirit/core.hpp>

Modified: boost/trunk/libs/spirit/example/techniques/no_rules_with_typeof/rule_parser_2_2.cpp
===================================================================
--- boost/trunk/libs/spirit/example/techniques/no_rules_with_typeof/rule_parser_2_2.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/example/techniques/no_rules_with_typeof/rule_parser_2_2.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -26,6 +26,14 @@
 #   pragma warning(disable:4355) 
 #endif
 
+
+// Note that typeof is applied on a per-rule basis, so the number of rules has
+// no effect on the complexity of the types used with typeof.
+// This is why we can set this macro to a comparatively low value (see the 
+// documentation of Boost.Typeof for details).
+// The previous example (rule_parser_2_1.cpp) requires more than twice of the 
+// complexity...
+#define BOOST_TYPEOF_LIMIT_SIZE 40
 #include <boost/typeof/typeof.hpp>
 
 #include <boost/spirit/core.hpp>
@@ -87,7 +95,7 @@
   -,
   (1,( ((parser_reference<factor_t>),factor,(*this)) )),
 
-    (   int_p[& do_int]           
+    (   int_p[&do_int]
     |   ('(' >> expression >> ')')
     |   ('-' >> factor)[&do_neg]
     |   ('+' >> factor)

Deleted: boost/trunk/libs/spirit/fusion/test/Jamfile
===================================================================
--- boost/trunk/libs/spirit/fusion/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/fusion/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,218 +0,0 @@
-#==============================================================================
-#    Copyright (c) 2003 Joel de Guzman
-#
-#   Use, modification and distribution is subject to the Boost Software
-#   License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-#   http://www.boost.org/LICENSE_1_0.txt)
-#==============================================================================
-
-subproject libs/spirit/fusion/test ;
-
-unit-test fixed_tuple_tests
-    : fixed_tuple_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test tuple_construction_tests
-    : tuple_construction_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test tuple_element_access_tests
-    : tuple_element_access_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test tuple_copy_tests
-    : tuple_copy_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test tuple_comparison_tests
-    : tuple_comparison_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test vc6_bug_001
-    : vc6_bug_001.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test tuple_mutate_tests
-    : tuple_mutate_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test misc_tuple_tests
-    : misc_tuple_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test make_tuple_tests
-    : make_tuple_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test tie_tests
-    : tie_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test tuple_iterator_tests
-    : tuple_iterator_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test io_tests
-    : io_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test single_view_tests
-    : single_view_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test type_sequence_tests
-    : type_sequence_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test joint_view_tests
-    : joint_view_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test push_back_tests
-    : push_back_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test push_front_tests
-    : push_front_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test find_tests
-    : find_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test find_if_tests
-    : find_if_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test filter_view_tests
-    : filter_view_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test filter_tests
-    : filter_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test range_tests
-    : range_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test erase_tests
-    : erase_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test for_each_tests
-    : for_each_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test fold_tests
-    : fold_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test insert_tests
-    : insert_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test remove_tests
-    : remove_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test remove_if_tests
-    : remove_if_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test replace_tests
-    : replace_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test transform_view_tests
-    : transform_view_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test transform_tests
-    : transform_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test cons_tests
-    : cons_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test any_tests
-    : any_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test pair_tests
-    : pair_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-
-
-
-

Modified: boost/trunk/libs/spirit/fusion/test/pair_tests.cpp
===================================================================
--- boost/trunk/libs/spirit/fusion/test/pair_tests.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/fusion/test/pair_tests.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,10 @@
+/*=============================================================================
+    Copyright (c) 2003 Joel de Guzman
+
+    Use, modification and distribution is subject to the Boost Software
+    License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+    http://www.boost.org/LICENSE_1_0.txt)
+==============================================================================*/
 #include <boost/spirit/fusion/sequence/tuple.hpp>
 #include <boost/spirit/fusion/sequence/tuple_size.hpp>
 #include <boost/spirit/fusion/sequence/tuple_element.hpp>

Deleted: boost/trunk/libs/spirit/phoenix/example/Jamfile
===================================================================
--- boost/trunk/libs/spirit/phoenix/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/phoenix/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,90 +0,0 @@
-#==============================================================================
-#   Copyright (c) 2002 Joel de Guzman
-#   http://spirit.sourceforge.net/
-#
-#   Use, modification and distribution is subject to the Boost Software
-#   License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-#   http://www.boost.org/LICENSE_1_0.txt)
-#==============================================================================
-#
-#  Phoenix examples boost-jam file
-#  Joel de Guzman [Sept 27, 2002]
-#
-
-subproject libs/spirit/phoenix/example ;
-
-SPIRIT_HEADER_INCLUDE ?= ../../../.. ;
-
-spirit-header-include = <sysinclude>$(SPIRIT_HEADER_INCLUDE) ;
-
-if $(SPIRIT_BOOST_HEADER_INCLUDE)
-{
-    spirit-header-include += <sysinclude>$(SPIRIT_BOOST_HEADER_INCLUDE) ;
-}
-
-#unit-test sample1
-#    : fundamental/sample1.cpp
-#    : $(spirit-header-include)
-#    :
-#    ;
-
-unit-test sample2
-    : fundamental/sample2.cpp
-    : $(spirit-header-include)
-    :
-    ;
-
-unit-test sample3
-    : fundamental/sample3.cpp
-    : $(spirit-header-include)
-    :
-    ;
-
-unit-test sample4
-    : fundamental/sample4.cpp
-    : $(spirit-header-include)
-    :
-    ;
-
-unit-test sample5
-    : fundamental/sample5.cpp
-    : $(spirit-header-include)
-    :
-    ;
-
-unit-test sample6
-    : fundamental/sample6.cpp
-    : $(spirit-header-include)
-    :
-    ;
-
-unit-test sample7
-    : fundamental/sample7.cpp
-    : $(spirit-header-include)
-    :
-    ;
-
-unit-test sample8
-    : fundamental/sample8.cpp
-    : $(spirit-header-include)
-    :
-    ;
-
-unit-test sample9
-    : fundamental/sample9.cpp
-    : $(spirit-header-include)
-    :
-    ;
-
-unit-test sample10
-    : fundamental/sample10.cpp
-    : $(spirit-header-include)
-    :
-    ;
-
-unit-test closures
-    : fundamental/closures.cpp
-    : $(spirit-header-include)
-    :
-    ;
-

Deleted: boost/trunk/libs/spirit/phoenix/test/Jamfile
===================================================================
--- boost/trunk/libs/spirit/phoenix/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/phoenix/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,95 +0,0 @@
-#==============================================================================
-#   Copyright (c) 2002 Joel de Guzman
-#   http://spirit.sourceforge.net/
-#
-#   Use, modification and distribution is subject to the Boost Software
-#   License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-#   http://www.boost.org/LICENSE_1_0.txt)
-#==============================================================================
-#
-#  Phoenix examples boost-jam file
-#  Joel de Guzman [Sept 27, 2002]
-#
-
-subproject libs/spirit/phoenix/test ;
-
-unit-test binary_tests
-    : binary_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test binders_tests
-    : binders_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test functors_tests
-    : functors_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-unit-test iostream_tests
-    : iostream_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-
-unit-test mixed_binary_tests
-    : mixed_binary_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-
-unit-test more_expressions_tests
-    : more_expressions_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-
-unit-test primitives_tests
-    : primitives_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-
-unit-test statements_tests
-    : statements_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-
-unit-test stl_tests
-    : stl_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-
-unit-test tuples_tests
-    : tuples_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-
-unit-test unary_tests
-    : unary_tests.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-
-
-unit-test new_tests
-    : new_test.cpp
-    : <sysinclude>$(BOOST_ROOT)
-    :
-    ;
-

Deleted: boost/trunk/libs/spirit/test/Jamfile
===================================================================
--- boost/trunk/libs/spirit/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,238 +0,0 @@
-#==============================================================================
-#   Copyright (c) 2002 Joel de Guzman
-#   Copyright (c) 2003-2004 Martin Wille
-#   http://spirit.sourceforge.net/
-#
-#   Use, modification and distribution is subject to the Boost Software
-#   License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-#   http://www.boost.org/LICENSE_1_0.txt)
-#==============================================================================
-#
-#  Spirit regression test boost-jam file
-#  Joel de Guzman [Sept 27, 2002]
-#
-
-subproject libs/spirit/test ;
-
-SPIRIT_HEADER_INCLUDE ?= ../../.. ;
-
-spirit-header-include = <include>$(SPIRIT_HEADER_INCLUDE) ;
-
-spirit-src = ./ ;
-if $(SPIRIT_SRC_INCLUDE)
-{
-    spirit-src = $(SPIRIT_SRC_INCLUDE)/ ;
-}
-
-############################################################
-# include testing.jam
-# extend testing.jam's functionality
-#
-SEARCH on testing.jam = $(BOOST_BUILD_PATH) ;
-include testing.jam ;
-
-rule spirit-run-debug ( sources + : args * : input-files * : requirements * : name ? : default-build * )
-{
-    local gRUN_TEST_ARGS = $(args) ;
-    local gRUN_TEST_INPUT_FILES = $(input-files) ;
-    SEARCH on $(input-files) = $(SEARCH_SOURCE) ;
-    name ?= $(sources[1]:D=:S=) ;
-    name = $(name)_debug ;
-    return [ boost-test $(sources) : RUN : $(requirements) <define>BOOST_SPIRIT_DEBUG=1 : $(name) : $(default-build) ] ;
-}
-
-rule spirit-run ( sources + : args * : input-files * : requirements * : name ? : default-build * )
-{
-    run $(sources) : $(args) : $(input-files) : $(requirements) : $(name) : $(default-build) ;
-    spirit-run-debug $(sources) : $(args) : $(input-files) : $(requirements) : $(name) : $(default-build) ;
-}
-
-############################################################
-
-# A bug in the Win32 intel compilers causes compilation of one of our
-# tests to take forever when debug symbols are enabled. This rule
-# turns them off when added to the requirements section
-local rule turn-off-intel-debug-symbols ( toolset variant : properties * )
-{
-    if $(NT) && [ MATCH (.*intel.*) : $(toolset) ]
-    {
-        properties = [ difference $(properties) : <debug-symbols>on ] <debug-symbols>off ;
-    }
-    return $(properties) ;
-}
-
-{
-    template opt : :
-        <optimization>speed
-        <inlining>on
-        $(spirit-header-include)
-        ;
-
-    template opt-metrowerks : :
-        <cw><*><optimization>speed
-        $(spirit-header-include)
-        ;
-
-if ($(COMO_BASE)) # MT is not available on both Unix and Windows on Comeau
-{   # no MT support available
-    template multi-threading : :
-        $(spirit-header-include)
-    ;
-}
-else
-{
-    #template multi-threading : <dll>../../thread/build/boost_thread : :
-    template multi-threading : <dll>@boost/libs/thread/build/boost_thread :
-        <threading>multi
-        <define>BOOST_ALL_NO_LIB=1
-        $(spirit-header-include)
-    ;
-}
-
-    template normal : :
-        $(spirit-header-include)
-    ;
-
-    test-suite "spirit.core.kernel"
-        : [ spirit-run $(spirit-src)match_tests.cpp <template>normal ]
-        ;
-
-    test-suite "spirit.core.scanner"
-        : [ spirit-run $(spirit-src)scanner_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)scanner_value_type_tests.cpp <template>normal ]
-        ;
-
-    test-suite "spirit.core.primitive"
-        : [ spirit-run $(spirit-src)primitives_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)char_strings_test.cpp <template>normal ]
-          [ compile-fail $(spirit-src)char_strings_test_fail.cpp <template>normal ]
-          [ spirit-run $(spirit-src)numerics_tests.cpp <template>opt ]
-        ;
-
-    test-suite "spirit.core.composite"
-        : [ spirit-run $(spirit-src)epsilon_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)negated_eps_p_test.cpp <template>normal ]
-          [ spirit-run $(spirit-src)operators_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)directives_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)shortest_alternative_tests.cpp <template>normal ]
-        ;
-
-    test-suite "spirit.core.non_terminal"
-        : [ spirit-run $(spirit-src)rule_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)owi_st_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)grammar_tests.cpp <template>opt-metrowerks ]
-          [ spirit-run $(spirit-src)grammar_multi_instance_tst.cpp <template>opt-metrowerks ]
-          [ spirit-run $(spirit-src)subrule_tests.cpp <template>normal ]
-          [        run $(spirit-src)owi_mt_tests.cpp <template>multi-threading ]
-          [        run $(spirit-src)grammar_mt_tests.cpp <template>multi-threading ]
-          [ spirit-run $(spirit-src)parser_context_test.cpp <template>normal ]
-        ;
-
-    # traverse_tests defines SPIRIT_DEBUG, don't run the tests twice
-    test-suite "spirit.meta"
-        : [ spirit-run $(spirit-src)fundamental_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)parser_traits_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)traverse_tests.cpp <template>normal : : : turn-off-intel-debug-symbols ]
-        ;
-
-    test-suite "spirit.attribute"
-        : [ spirit-run $(spirit-src)closure_tests.cpp <template>opt-metrowerks ]
-          [        run $(spirit-src)bug_000008.cpp <template>multi-threading ]
-          [ spirit-run $(spirit-src)parametric_tests.cpp <template>normal ]
-        ;
-
-    test-suite "spirit.error_handling"
-        : [ spirit-run $(spirit-src)exception_tests.cpp <template>normal ]
-        ;
-
-    test-suite "spirit.tree"
-        : [ spirit-run $(spirit-src)ast_calc_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)group_match_bug.cpp <template>normal ]
-          [ spirit-run $(spirit-src)repeat_ast_tests.cpp <template>normal ]
-          [ compile $(spirit-src)mix_and_match_trees.cpp <template>normal ]
-        ;
-
-# temporarily removed from the test suite. tree_tests are not finished, yet.
-#         [ spirit-run $(spirit-src)tree_tests.cpp <template>normal ]
-
-    test-suite "spirit.dynamic"
-        : [ compile $(spirit-src)if_p_as_parser_tests.cpp <template>normal ]
-          [ compile $(spirit-src)while_p_as_parser_tests.cpp <template>normal ]
-          [ compile $(spirit-src)for_p_as_parser_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)if_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)if_p_int_as_condition_test.cpp <template>normal ]
-          [ spirit-run $(spirit-src)for_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)while_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)lazy_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)switch_tests_eps_default.cpp <template>normal ]
-          [ spirit-run $(spirit-src)switch_tests_general_def.cpp <template>normal ]
-          [ spirit-run $(spirit-src)switch_tests_wo_default.cpp <template>normal ]
-          [ spirit-run $(spirit-src)switch_tests_single.cpp <template>normal ]
-          [ spirit-run $(spirit-src)switch_problem.cpp <template>normal ]
-          [ spirit-run $(spirit-src)select_p_with_rule.cpp <template>normal ]
-        ;
-
-    test-suite "spirit.utility.parsers"
-        : [ spirit-run $(spirit-src)chset_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)confix_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)loops_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)symbols_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)symbols_add_null.cpp <template>normal ]
-          [ spirit-run $(spirit-src)symbols_find_null.cpp <template>normal ]
-          [ spirit-run $(spirit-src)escape_char_parser_tests.cpp <template>opt ]
-          [ spirit-run $(spirit-src)distinct_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)grammar_def_test.cpp <template>normal ]
-        ;
-
-    test-suite "spirit.utility.support"
-        # This test doesn't actually use multiple threads
-        : [ spirit-run $(spirit-src)scoped_lock_tests.cpp <template>multi-threading ]
-        ;
-
-    test-suite "spirit.iterator"
-        : [ spirit-run $(spirit-src)fixed_size_queue_tests.cpp <template>normal ]
-          [ compile-fail $(spirit-src)fixed_size_queue_fail_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)file_iterator_tests.cpp <template>normal ]
-          [ spirit-run $(spirit-src)multi_pass_tests.cpp <template>opt-metrowerks ]
-          [ spirit-run $(spirit-src)sf_bug_720917.cpp <template>opt-metrowerks ]
-          [ spirit-run $(spirit-src)position_iterator_tests.cpp <template>opt-metrowerks ]
-          [ compile $(spirit-src)multi_pass_compile_tests.cpp <template>normal ]
-        ;
-
-    test-suite "spirit.small_bug_fixes"
-        : [ spirit-run $(spirit-src)bug_fixes.cpp <template>normal ]
-        ;
-
-    actor_test_sources =
-        action_tests
-        assign_test
-        assign_key_test
-        clear_test
-        decrement_test
-        erase_at_test
-        increment_test
-        insert_key_test
-        insert_at_test
-        push_back_test
-        push_front_test
-        swap_test
-        ;
-
-    test-suite "spirit.utility.actors"
-        : [ spirit-run $(spirit-src)actor/$(actor_test_sources).cpp <template>normal ]
-        ;
-
-    test-suite "spirit.typeof-support"
-        : [ compile $(spirit-src)typeof_support/typeof_actor.cpp ]
-          [ compile $(spirit-src)typeof_support/typeof_attribute.cpp ]
-          [ compile $(spirit-src)typeof_support/typeof_core.cpp ]
-          [ compile $(spirit-src)typeof_support/typeof_debug.cpp ]
-          [ compile $(spirit-src)typeof_support/typeof_dynamic.cpp ]
-          [ compile $(spirit-src)typeof_support/typeof_error_handling.cpp ]
-          [ compile $(spirit-src)typeof_support/typeof_iterator.cpp ]
-          [ compile $(spirit-src)typeof_support/typeof_symbols.cpp ]
-          [ compile $(spirit-src)typeof_support/typeof_tree.cpp ]
-          [ compile $(spirit-src)typeof_support/typeof_utility.cpp ]
-        ; 
-}
-

Modified: boost/trunk/libs/spirit/test/actor/assign_key_test.cpp
===================================================================
--- boost/trunk/libs/spirit/test/actor/assign_key_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/actor/assign_key_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -27,7 +27,7 @@
 
     const char* cp = "(one,0),(two,1),(three,2)";
     const char* cp_first = cp;
-    const char* cp_last = cp + string_length(cp);
+    const char* cp_last = cp + test_impl::string_length(cp);
     const char* cp_i[] = {"one","two","three"};
     int i;
     typedef std::map<int,std::string> map_string_type;
@@ -69,7 +69,7 @@
 
     const char* cp = "(0,one),(1,two),(2,three)";
     const char* cp_first = cp;
-    const char* cp_last = cp + string_length(cp);
+    const char* cp_last = cp + test_impl::string_length(cp);
     const char* cp_i[] = {"one","two","three"};
     int i;
     typedef std::map<std::string, int> map_string_type;

Modified: boost/trunk/libs/spirit/test/actor/assign_test.cpp
===================================================================
--- boost/trunk/libs/spirit/test/actor/assign_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/actor/assign_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,7 +21,7 @@
 
     const char* cp = "63";
     const char* cp_first = cp;
-    const char* cp_last = cp + string_length(cp);
+    const char* cp_last = cp + test_impl::string_length(cp);
     int h=127;
     int hm=h;
 
@@ -43,7 +43,7 @@
 
     const char* cp = "63";
     const char* cp_first = cp;
-    const char* cp_last = cp + string_length(cp);
+    const char* cp_last = cp + test_impl::string_length(cp);
     int h=127;
     int hm=63;
 

Modified: boost/trunk/libs/spirit/test/actor/clear_test.cpp
===================================================================
--- boost/trunk/libs/spirit/test/actor/clear_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/actor/clear_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,7 +24,7 @@
 
     const char* cp = "63";
     const char* cp_first = cp;
-    const char* cp_last = cp + string_length(cp);
+    const char* cp_last = cp + test_impl::string_length(cp);
     std::vector<int> c;
     c.push_back(1);
 

Modified: boost/trunk/libs/spirit/test/actor/decrement_test.cpp
===================================================================
--- boost/trunk/libs/spirit/test/actor/decrement_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/actor/decrement_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,7 +23,7 @@
 
     const char* cp = "63";
     const char* cp_first = cp;
-    const char* cp_last = cp + string_length(cp);
+    const char* cp_last = cp + test_impl::string_length(cp);
     int h=127;
     int hm=h;
 

Modified: boost/trunk/libs/spirit/test/actor/erase_at_test.cpp
===================================================================
--- boost/trunk/libs/spirit/test/actor/erase_at_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/actor/erase_at_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,7 +22,7 @@
 
     const char* cp = "one,two,three";
     const char* cp_first = cp;
-    const char* cp_last = cp + string_length(cp);
+    const char* cp_last = cp + test_impl::string_length(cp);
     const char* cp_i[] = {"one","two","three"};
     typedef std::map<std::string, int> map_string_type;
     map_string_type c;

Modified: boost/trunk/libs/spirit/test/actor/increment_test.cpp
===================================================================
--- boost/trunk/libs/spirit/test/actor/increment_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/actor/increment_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,7 +23,7 @@
 
     const char* cp = "63";
     const char* cp_first = cp;
-    const char* cp_last = cp + string_length(cp);
+    const char* cp_last = cp + test_impl::string_length(cp);
     int h=127;
     int hm=h;
 

Modified: boost/trunk/libs/spirit/test/actor/insert_key_test.cpp
===================================================================
--- boost/trunk/libs/spirit/test/actor/insert_key_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/actor/insert_key_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -27,7 +27,7 @@
 
     const char* cp = "(one,0),(two,1),(three,2)";
     const char* cp_first = cp;
-    const char* cp_last = cp + string_length(cp);
+    const char* cp_last = cp + test_impl::string_length(cp);
     const char* cp_i[] = {"one","two","three"};
     int i;
     typedef std::map<int,std::string> map_string_type;
@@ -69,7 +69,7 @@
 
     const char* cp = "(0,one),(1,two),(2,three)";
     const char* cp_first = cp;
-    const char* cp_last = cp + string_length(cp);
+    const char* cp_last = cp + test_impl::string_length(cp);
     const char* cp_i[] = {"one","two","three"};
     int i;
     typedef std::map<std::string, int> map_string_type;

Modified: boost/trunk/libs/spirit/test/actor/push_back_test.cpp
===================================================================
--- boost/trunk/libs/spirit/test/actor/push_back_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/actor/push_back_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -30,7 +30,7 @@
 
     const char* cp = "one,two,three";
     const char* cp_first = cp;
-    const char* cp_last = cp + string_length(cp);
+    const char* cp_last = cp + test_impl::string_length(cp);
     const char* cp_i[] = {"one","two","three"};
     int i;
     ContainerT c;

Modified: boost/trunk/libs/spirit/test/actor/push_front_test.cpp
===================================================================
--- boost/trunk/libs/spirit/test/actor/push_front_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/actor/push_front_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -28,7 +28,7 @@
 
     const char* cp = "one,two,three";
     const char* cp_first = cp;
-    const char* cp_last = cp + string_length(cp);
+    const char* cp_last = cp + test_impl::string_length(cp);
     const char* cp_i[] = {"one","two","three"};;
     int i;
     ContainerT c;

Modified: boost/trunk/libs/spirit/test/actor/swap_test.cpp
===================================================================
--- boost/trunk/libs/spirit/test/actor/swap_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/actor/swap_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,7 +21,7 @@
 
     const char* cp = "63";
     const char* cp_first = cp;
-    const char* cp_last = cp + string_length(cp);
+    const char* cp_last = cp + test_impl::string_length(cp);
     std::vector<int> v1,v2;
 
     v1.push_back(0);

Modified: boost/trunk/libs/spirit/test/directives_tests.cpp
===================================================================
--- boost/trunk/libs/spirit/test/directives_tests.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/directives_tests.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -27,7 +27,7 @@
 {
     char const* cpx = "H e l l o";
     char const* cpx_first = cpx;
-    char const* cpx_last = cpx + string_length(cpx);
+    char const* cpx_last = cpx + test_impl::string_length(cpx);
 
     match<> hit;
     typedef skipper_iteration_policy<iteration_policy> iter_policy;
@@ -44,7 +44,7 @@
 
     char const* cp = "Hello \n\tWorld";
     char const* cp_first = cp;
-    char const* cp_last = cp + string_length(cp);
+    char const* cp_last = cp + test_impl::string_length(cp);
 
     scanner<char const*, scanner_policies<iter_policy> >
         scan(cp_first, cp_last);
@@ -81,7 +81,7 @@
 
     char const* cpy = "123.456";
     char const* cpy_first = cpy;
-    char const* cpy_last = cpy + string_length(cpy);
+    char const* cpy_last = cpy + test_impl::string_length(cpy);
 
     scanner<> scany(cpy_first, cpy_last);
     hit = longest_d[(+digit_p >> '.' >> +digit_p) | (+digit_p)].parse(scany);
@@ -96,7 +96,7 @@
 
     char const* cpz = "razamanaz";
     char const* cpz_first = cpz;
-    char const* cpz_last = cpz + string_length(cpz);
+    char const* cpz_last = cpz + test_impl::string_length(cpz);
 
     scanner<> scanz(cpz_first, cpz_last);
     hit = longest_d[str_p("raza") | "razaman" | "razamanaz"].parse(scanz);

Modified: boost/trunk/libs/spirit/test/epsilon_tests.cpp
===================================================================
--- boost/trunk/libs/spirit/test/epsilon_tests.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/epsilon_tests.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -33,7 +33,7 @@
 parse(char const *s, ParserT const &p, bool match)
 {
     
-    pi = boost::spirit::parse(s, s+string_length(s), p);
+    pi = boost::spirit::parse(s, s + test_impl::string_length(s), p);
     if (match)
     {
         BOOST_TEST(matches);

Modified: boost/trunk/libs/spirit/test/for_tests.cpp
===================================================================
--- boost/trunk/libs/spirit/test/for_tests.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/for_tests.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -99,11 +99,11 @@
 
     iterations_performed = 0;
 
-    ::boost::spirit::parse_info<> m = ::boost::spirit::parse(s, s+string_length(s), r);
+    ::boost::spirit::parse_info<> m = ::boost::spirit::parse(s, s + test_impl::string_length(s), r);
 
     bool result = (succeed==m.full)?good:bad;
 
-    if (m.full && (m.length != string_length(s)))
+    if (m.full && (m.length != test_impl::string_length(s)))
         result = bad;
 
     result &= iterations_expected == iterations_performed;

Modified: boost/trunk/libs/spirit/test/if_tests.cpp
===================================================================
--- boost/trunk/libs/spirit/test/if_tests.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/if_tests.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -71,11 +71,11 @@
     ++test_count;
 
     number_result = wanted-1;
-    ::boost::spirit::parse_info<> m = ::boost::spirit::parse(s, s+string_length(s), r);
+    ::boost::spirit::parse_info<> m = ::boost::spirit::parse(s, s + test_impl::string_length(s), r);
 
     bool result = wanted == kError?(m.full?bad:good): (number_result==wanted);
 
-    if (m.full && (m.length != string_length(s)))
+    if (m.full && (m.length != test_impl::string_length(s)))
         result = bad;
 
 

Modified: boost/trunk/libs/spirit/test/impl/string_length.hpp
===================================================================
--- boost/trunk/libs/spirit/test/impl/string_length.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/impl/string_length.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,14 +6,14 @@
     License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
     http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
-#if !defined(SPIRIT_TEST_IMPL_STRING_len_HPP)
-#define SPIRIT_TEST_IMPL_STRING_len_HPP
+#if !defined(SPIRIT_TEST_IMPL_STRING_LEN_HPP)
+#define SPIRIT_TEST_IMPL_STRING_LEN_HPP
 
 // We use our own string_len function instead of std::strlen
 // to avoid the namespace confusion on different compilers. Some
-// have itin namespace std. Some have it in global namespace. 
+// have it in namespace std. Some have it in global namespace. 
 // Some have it in both.
-namespace
+namespace test_impl
 {
     template <typename Char>
     inline unsigned int

Modified: boost/trunk/libs/spirit/test/mix_and_match_trees.cpp
===================================================================
--- boost/trunk/libs/spirit/test/mix_and_match_trees.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/mix_and_match_trees.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -54,7 +54,7 @@
 
         typedef rule<ast_scanner> ast_rule;
         typedef rule<pt_scanner> pt_rule;
-        typedef rule<Scanner> rule;
+        typedef rule<Scanner> rule_;
 
         definition(my_grammar const & /* self */)
         {
@@ -62,12 +62,12 @@
             start_ = gen_pt_node_d[ pt_rule_ ];
         }
 
-        rule const & start() const
+        rule_ const & start() const
         {
             return start_;
         }
 
-        rule start_;
+        rule_ start_;
         ast_rule ast_rule_;
         pt_rule pt_rule_;
     };

Modified: boost/trunk/libs/spirit/test/primitives_tests.cpp
===================================================================
--- boost/trunk/libs/spirit/test/primitives_tests.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/primitives_tests.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -25,7 +25,7 @@
 {
     char const* cp = "xyz.Jambalaya";
     char const* cp_first = cp;
-    char const* cp_last = cp + string_length(cp);
+    char const* cp_last = cp + test_impl::string_length(cp);
 
     chlit<> cpx('x');
     parse_info<char const*> pi = parse(cp_first, cp_last, cpx);

Modified: boost/trunk/libs/spirit/test/scanner_tests.cpp
===================================================================
--- boost/trunk/libs/spirit/test/scanner_tests.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/scanner_tests.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -54,7 +54,7 @@
 {
     char const* cp = "The Big Brown Fox Jumped \n\tOver The Lazy Dog's Back";
     char const* cp_first = cp;
-    char const* cp_last = cp + string_length(cp);
+    char const* cp_last = cp + test_impl::string_length(cp);
 
     scanner<char const*>
         pp1(cp_first, cp_last);

Modified: boost/trunk/libs/spirit/test/scanner_value_type_tests.cpp
===================================================================
--- boost/trunk/libs/spirit/test/scanner_value_type_tests.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/scanner_value_type_tests.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -30,16 +30,7 @@
             {
                 foo
                     = sp::alpha_p
-                      | sp::alnum_p
-                      | sp::cntrl_p
-                      | sp::print_p
-                      | sp::blank_p
-                      | sp::digit_p
-                      | sp::graph_p
-                      | sp::lower_p
-                      | sp::upper_p
-                      | sp::xdigit_p
-                      | sp::punct_p
+                    | sp::punct_p
                     ;
             }
 

Modified: boost/trunk/libs/spirit/test/tree_tests.cpp
===================================================================
--- boost/trunk/libs/spirit/test/tree_tests.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/tree_tests.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -37,7 +37,7 @@
     template <
         typename ScannerT, 
         unsigned long ID = 0,
-        typename ContextT = parser_context>
+        typename ContextT = parser_context<> >
     class rule_id 
         : public rule<ScannerT, ContextT, parser_tag<ID> >
     {
@@ -330,7 +330,7 @@
         typedef tree_node<node_t> tree_t;
 
         iterator_t text_begin = gram.pattern();
-        iterator_t text_end = text_begin + string_length(text_begin);
+        iterator_t text_end = text_begin + test_impl::string_length(text_begin);
 
         tree_parse_info<iterator_t, factory_t> info =
             ast_parse(text_begin, text_end, gram);

Modified: boost/trunk/libs/spirit/test/while_tests.cpp
===================================================================
--- boost/trunk/libs/spirit/test/while_tests.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/spirit/test/while_tests.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -96,13 +96,13 @@
     number_result = 0;
     iterations_performed = 0;
 
-    boost::spirit::parse_info<> m = boost::spirit::parse(s, s+string_length(s), r);
+    boost::spirit::parse_info<> m = boost::spirit::parse(s, s+ test_impl::string_length(s), r);
 
     bool result = wanted == kError?(m.full?bad:good): (number_result==wanted);
 
     result &= iterations_performed == iterations_wanted;
 
-    if (m.full && (m.length != string_length(s)))
+    if (m.full && (m.length != test_impl::string_length(s)))
         result = bad;
 
     if (result==good)

Modified: boost/trunk/libs/statechart/Jamfile.v2
===================================================================
--- boost/trunk/libs/statechart/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 ##############################################################################
-# (c) Copyright Andreas Huber Doenni 2005-2006
+# Copyright 2005-2006 Andreas Huber Doenni
 # Distributed under the Boost Software License, Version 1.0. (See accompany-
 # ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 ##############################################################################

Modified: boost/trunk/libs/statechart/Statechart.sln
===================================================================
--- boost/trunk/libs/statechart/Statechart.sln	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/Statechart.sln	2007-02-16 16:48:35 UTC (rev 14035)
@@ -39,14 +39,6 @@
 	ProjectSection(ProjectDependencies) = postProject
 	EndProjectSection
 EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "InvalidTransitionTest3", "test\InvalidTransitionTest3.vcproj", "{D9103E3E-640D-4AB7-910C-ACA96709ED0A}"
-	ProjectSection(ProjectDependencies) = postProject
-	EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "InvalidTransitionTest4", "test\InvalidTransitionTest4.vcproj", "{D9103E3E-640D-4AB7-910C-ACA96709ED0A}"
-	ProjectSection(ProjectDependencies) = postProject
-	EndProjectSection
-EndProject
 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "HistoryTest", "test\HistoryTest.vcproj", "{D9103E3E-640D-4AB7-910C-ACA96709ED0A}"
 	ProjectSection(ProjectDependencies) = postProject
 	EndProjectSection
@@ -95,7 +87,7 @@
 	ProjectSection(ProjectDependencies) = postProject
 	EndProjectSection
 EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "UnsupportedDeepHistoryTest", "test\UnsupportedDeepHistoryTest.vcproj", "{D9103E3E-640D-4AB7-910C-ACA96709ED0A}"
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "UnsuppDeepHistoryTest", "test\UnsuppDeepHistoryTest.vcproj", "{D9103E3E-640D-4AB7-910C-ACA96709ED0A}"
 	ProjectSection(ProjectDependencies) = postProject
 	EndProjectSection
 EndProject
@@ -297,14 +289,6 @@
 		{D9103E3E-640D-4AB7-910C-ACA96709ED0A}.Debug.Build.0 = Debug|Win32
 		{D9103E3E-640D-4AB7-910C-ACA96709ED0A}.Release.ActiveCfg = Release|Win32
 		{D9103E3E-640D-4AB7-910C-ACA96709ED0A}.Release.Build.0 = Release|Win32
-		{D9103E3E-640D-4AB7-910C-ACA96709ED0A}.Debug.ActiveCfg = Debug|Win32
-		{D9103E3E-640D-4AB7-910C-ACA96709ED0A}.Debug.Build.0 = Debug|Win32
-		{D9103E3E-640D-4AB7-910C-ACA96709ED0A}.Release.ActiveCfg = Release|Win32
-		{D9103E3E-640D-4AB7-910C-ACA96709ED0A}.Release.Build.0 = Release|Win32
-		{D9103E3E-640D-4AB7-910C-ACA96709ED0A}.Debug.ActiveCfg = Debug|Win32
-		{D9103E3E-640D-4AB7-910C-ACA96709ED0A}.Debug.Build.0 = Debug|Win32
-		{D9103E3E-640D-4AB7-910C-ACA96709ED0A}.Release.ActiveCfg = Release|Win32
-		{D9103E3E-640D-4AB7-910C-ACA96709ED0A}.Release.Build.0 = Release|Win32
 		{CF66596F-7DEA-4BB6-A728-F7FEF2889855}.Debug.ActiveCfg = Debug|Win32
 		{CF66596F-7DEA-4BB6-A728-F7FEF2889855}.Debug.Build.0 = Debug|Win32
 		{CF66596F-7DEA-4BB6-A728-F7FEF2889855}.Release.ActiveCfg = Release|Win32

Copied: boost/trunk/libs/statechart/doc/ExceptionsAndOrthStates.gif (from rev 14034, boost/branches/upstream/current/libs/statechart/doc/ExceptionsAndOrthStates.gif)

Deleted: boost/trunk/libs/statechart/doc/ExceptionsAndOrthogonalStates.gif
===================================================================
(Binary files differ)

Copied: boost/trunk/libs/statechart/doc/TransAcrossOrthRegions.gif (from rev 14034, boost/branches/upstream/current/libs/statechart/doc/TransAcrossOrthRegions.gif)

Deleted: boost/trunk/libs/statechart/doc/TransitionsAcrossOrthogonalRegions.gif
===================================================================
(Binary files differ)

Modified: boost/trunk/libs/statechart/doc/acknowledgments.html
===================================================================
--- boost/trunk/libs/statechart/doc/acknowledgments.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/doc/acknowledgments.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -92,15 +92,15 @@
   Marcin Tustin, Vincent N. Virgilio, Gang Wang and Scott Woods.</p>
   <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
   <p>Revised 
-  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->12 March, 2006<!--webbot bot="Timestamp" endspan i-checksum="28929" --></p>
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->03 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38512" --></p>
 
-  <p><i>&copy; Copyright <a href=
-  "mailto:ahd6974-spamgroupstrap at yahoo.com">Andreas Huber D&ouml;nni</a>
-  2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->.
-  <font color="#FF0000"><b>The link refers to a <a href=
-  "http://en.wikipedia.org/wiki/Honeypot">spam honeypot</a>. Please remove
-  the words spam and trap to obtain my real address.</b></font></i></p>
+  <p><i>Copyright &copy; 2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->
+  <a href="contact.html">Andreas Huber D&ouml;nni</a></i></p>
 
   <p><i>Distributed under the Boost Software License, Version 1.0. (See
   accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or

Modified: boost/trunk/libs/statechart/doc/configuration.html
===================================================================
--- boost/trunk/libs/statechart/doc/configuration.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/doc/configuration.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,9 +3,9 @@
 <html>
 <head>
   <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
   <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
   <meta name="ProgId" content="FrontPage.Editor.Document">
-  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
   <link rel="stylesheet" type="text/css" href="../../../boost.css">
 
   <title>The Boost Statechart Library - Configuration</title>
@@ -172,15 +172,15 @@
   for more information.</p>
   <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
   <p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->12 March, 2006<!--webbot bot="Timestamp" endspan i-checksum="28929" --></p>
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->03 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38512" --></p>
 
-  <p><i>&copy; Copyright <a href=
-  "mailto:ahd6974-spamgroupstrap at yahoo.com">Andreas Huber D&ouml;nni</a>
-  2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->.
-  <font color="#FF0000"><b>The link refers to a <a href=
-  "http://en.wikipedia.org/wiki/Honeypot">spam honeypot</a>. Please remove
-  the words spam and trap to obtain my real address.</b></font></i></p>
+  <p><i>Copyright &copy; 2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->
+  <a href="contact.html">Andreas Huber D&ouml;nni</a></i></p>
 
   <p><i>Distributed under the Boost Software License, Version 1.0. (See
   accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or

Copied: boost/trunk/libs/statechart/doc/contact.html (from rev 14034, boost/branches/upstream/current/libs/statechart/doc/contact.html)

Modified: boost/trunk/libs/statechart/doc/definitions.html
===================================================================
--- boost/trunk/libs/statechart/doc/definitions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/doc/definitions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -122,8 +122,8 @@
   events</a></h3>
 
   <p>An FSM library supports polymorphic events if events can inherit from
-  each other without restrictions <b>and</b> allows the definition of
-  reactions for leafs <b>and</b> nodes of the resulting event inheritance
+  each other without restrictions <b>and</b> if it allows the definition of
+  reactions for leafs and nodes of the resulting event inheritance
   tree.</p>
 
   <p>Example (using a hypothetical FSM library, as Boost.Statechart does not
@@ -210,15 +210,15 @@
   for details).</p>
   <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
   <p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->12 March, 2006<!--webbot bot="Timestamp" endspan i-checksum="28929" --></p>
+  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->29 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38526" --></p>
 
-  <p><i>&copy; Copyright <a href=
-  "mailto:ahd6974-spamgroupstrap at yahoo.com">Andreas Huber D&ouml;nni</a>
-  2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->.
-  <font color="#FF0000"><b>The link refers to a <a href=
-  "http://en.wikipedia.org/wiki/Honeypot">spam honeypot</a>. Please remove
-  the words spam and trap to obtain my real address.</b></font></i></p>
+  <p><i>Copyright &copy; 2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->
+  <a href="contact.html">Andreas Huber D&ouml;nni</a></i></p>
 
   <p><i>Distributed under the Boost Software License, Version 1.0. (See
   accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or

Modified: boost/trunk/libs/statechart/doc/faq.html
===================================================================
--- boost/trunk/libs/statechart/doc/faq.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/doc/faq.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -292,28 +292,24 @@
 
   <h2><a name="Uml2" id="Uml2">What about UML 2.0 features?</a></h2>
 
-  <p>The library was designed before 2.0 came along. Therefore, if not 
-  explicitly noted otherwise, the library implements the 
-  behavior mandated by the UML1.5 standard. Here's an incomplete list of 
-  differences between the 2.0 semantics &amp; Boost.Statechart semantics:</p>
-<ul>
- <li>All transitions are always external. Local transitions are not supported 
- at all. Unfortunately, the UML2.0 specifications are not entirely clear how 
- local transitions are supposed to work, see
- <a href="http://thread.gmane.org/gmane.comp.lib.boost.user/18641">here</a> 
- for more information</li>
-<li>The origin of a transition to history must not be a direct or indirect 
-inner state of the state containing the history pseudo state. UML2.0 
-explicitly allows this, the semantics of the library will be changed 
-accordingly for the 1.35 release, see
-<a href="http://thread.gmane.org/gmane.comp.lib.boost.user/18641">here</a> for 
-more information</li>
- <li>There is no direct support for the UML2.0 elements entry point and exit 
- point. However, both can easily be simulated, the former with a typedef and 
- the latter with a state that is a template (with the transition destination 
- as a template parameter)</li>
-</ul>
+  <p>The library was designed before 2.0 came along. Therefore, if not
+  explicitly noted otherwise, the library implements the behavior mandated by
+  the UML1.5 standard. Here's an incomplete list of differences between the
+  2.0 semantics &amp; Boost.Statechart semantics:</p>
 
+  <ul>
+    <li>All transitions are always external. Local transitions are not
+    supported at all. Unfortunately, the UML2.0 specifications are not
+    entirely clear how local transitions are supposed to work, see <a href=
+    "http://thread.gmane.org/gmane.comp.lib.boost.user/18641">here</a> for
+    more information</li>
+
+    <li>There is no direct support for the UML2.0 elements entry point and
+    exit point. However, both can easily be simulated, the former with a
+    typedef and the latter with a state that is a template (with the
+    transition destination as a template parameter)</li>
+  </ul>
+
   <h2><a name="EmbeddedApplications" id="EmbeddedApplications">Is
   Boost.Statechart suitable for embedded applications?</a></h2>
 
@@ -428,8 +424,8 @@
 
   <ol>
     <li>Your compiler is too buggy to compile the library, see <a href=
-    "index.html#Supported_platforms">here</a> for information on the status
-    of your compiler. If you absolutely must use such a compiler for your
+    "index.html#SupportedPlatforms">here</a> for information on the status of
+    your compiler. If you absolutely must use such a compiler for your
     project, I'm afraid Boost.Statechart is not for you.</li>
 
     <li>The error is reported on a line similar to the following:
@@ -502,11 +498,11 @@
     </li>
 
     <li>The error is reported on a line nowhere near a BOOST_STATIC_ASSERT.
-    Probably this is still an error in your code. Use the technique described
-    under point 2 to see what line of your code causes the problem. If your
-    code is correct then you've found a bug in either the compiler or
-    Boost.Statechart. Please post a small but complete program showing the
-    problem to the Boost.User or Boost.Developer lists. Thank you!</li>
+    Use the technique described under point 2 to see what line of your code
+    causes the problem. If your code is correct then you've found a bug in
+    either the compiler or Boost.Statechart. Please <a href=
+    "contact.html">send me</a> a small but complete program showing the
+    problem. Thank you!</li>
   </ol>
 
   <h2><a name="Dll" id="Dll">How can I compile a state machine into a dynamic
@@ -712,15 +708,15 @@
   alter the order of destruction.</p>
   <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
   <p>Revised 
-  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->20 May, 2006<!--webbot bot="Timestamp" endspan i-checksum="13996" --></p>
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->03 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38512" --></p>
 
-  <p><i>&copy; Copyright <a href=
-  "mailto:ahd6974-spamgroupstrap at yahoo.com">Andreas Huber D&ouml;nni</a>
-  2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->.
-  <font color="#FF0000"><b>The link refers to a <a href=
-  "http://en.wikipedia.org/wiki/Honeypot">spam honeypot</a>. Please remove
-  the words spam and trap to obtain my real address.</b></font></i></p>
+  <p><i>Copyright &copy; 2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->
+  <a href="contact.html">Andreas Huber D&ouml;nni</a></i></p>
 
   <p><i>Distributed under the Boost Software License, Version 1.0. (See
   accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or

Modified: boost/trunk/libs/statechart/doc/future_and_history.html
===================================================================
--- boost/trunk/libs/statechart/doc/future_and_history.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/doc/future_and_history.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -45,9 +45,7 @@
   review):</p>
 
   <ol>
-    <li>Make transitions to history UML2.0 compliant, see
-    <a href="faq.html#Uml2">here</a> for more information</li>
-    <li>Optimize state-entry and state-exit</li>
+    <li>Optimize state-entry and state-exit for speed and code-size</li>
 
     <li>Implement <code>simple_state::triggering_event()</code>, which
     returns a pointer to the event that triggered the action currently being
@@ -156,15 +154,28 @@
 
     <li>Documented <code>state_machine::post_event</code> and added a
     <code>const event_base &amp;</code> overload</li>
-    <li>Tidied all html files</li>
-    <li>Fixed a few links in index.html</li>
-    <li>example/Jamfile.v2 now also stages the dlls necessary to launch the 
+
+    <li>example/Jamfile.v2 now also stages the dlls necessary to launch the
     multithreaded PingPong examples</li>
+
     <li>Added a FAQ item regarding UML2.0 conformance</li>
-    <li>Made the documentation of <code>unconsumed_event</code> more visible</li>
-    <li>Declared <code>state_base::~state_base virtual</code> for GCC. This 
-    makes state exit slightly slower but does away with loads of &quot;has 
-    virtual functions but non-virtual destructor&quot; warnings</li>
+
+    <li>Made the documentation of <code>unconsumed_event</code> more
+    visible</li>
+
+    <li>Declared <code>state_base::~state_base virtual</code> for GCC. This
+    makes state exit slightly slower but does away with loads of "has virtual
+    functions but non-virtual destructor" warnings</li>
+
+    <li>Made transitions to history UML2.0 compliant, see <a href=
+    "faq.html#Uml2">here</a> for more information</li>
+
+    <li>Tidied all html files &amp; validated them with <a href=
+    "http://validator.w3.org/">http://validator.w3.org/</a></li>
+
+    <li>Fixed broken links</li>
+    <li>Fixed a few conformance problems that led to errors on HP compilers</li>
+    <li>Corrected documentation regarding allocation of states and events</li>
   </ul>
 
   <p>17 December, 2005</p>
@@ -421,7 +432,7 @@
     <code>null_exception_translator</code> is now used, which does not catch
     or translate any exceptions. Updated docs accordingly</li>
 
-    <li>Implemented <a href="tutorial.html#Two_stage_exit">two stage exit</a>
+    <li>Implemented <a href="tutorial.html#TwoStageExit">two stage exit</a>
     and updated docs accordingly</li>
 
     <li>Implemented an experimental feature that allows a transition action
@@ -645,15 +656,15 @@
   </ul>
   <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
   <p>Revised 
-  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->20 May, 2006<!--webbot bot="Timestamp" endspan i-checksum="13996" --></p>
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->29 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38526" --></p>
 
-  <p><i>&copy; Copyright <a href=
-  "mailto:ahd6974-spamgroupstrap at yahoo.com">Andreas Huber D&ouml;nni</a>
-  2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->.
-  <font color="#FF0000"><b>The link refers to a <a href=
-  "http://en.wikipedia.org/wiki/Honeypot">spam honeypot</a>. Please remove
-  the words spam and trap to obtain my real address.</b></font></i></p>
+  <p><i>Copyright &copy; 2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->
+  <a href="contact.html">Andreas Huber D&ouml;nni</a></i></p>
 
   <p><i>Distributed under the Boost Software License, Version 1.0. (See
   accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or

Modified: boost/trunk/libs/statechart/doc/index.html
===================================================================
--- boost/trunk/libs/statechart/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -26,7 +26,6 @@
         <p align="center">(formerly known as boost::fsm)</p>
 
         <h2 align="center">Overview</h2>
-
       </td>
     </tr>
   </table>
@@ -123,48 +122,50 @@
 
   <p>Whether and how Boost.Statechart will work on your platform is best
   determined on the <a href=
-  "http://engineering.meta-comm.com/boost-regression/CVS-HEAD/developer/statechart.html">
-  status page</a>. 
-  If the cells in your compilers column are all green, the library
-  should work as advertised. Cells of different color indicate possible
-  problems; follow the links for details. Before employing the library I
-  would also advise to run the tests (see <a href="#GettingStarted">Getting
-  started</a>) on your particular platform in all the modes (debug, release,
-  etc.) that are later used during development (the status page shows debug
-  mode results only). The closer the test compiler switches mirror the ones
-  that are later used during development, the less likely are future
-  surprises. An example of such a surprise is Intel 9.0 with MSVC 7.1 base
-  toolset, where DllTestNormal and DllTestNative pass in debug mode but fail
-  in release mode.</p>
+  "http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/statechart.html">
+  status page</a>. If the cells in your compilers column are all green, the
+  library should work as advertised. Cells of different color indicate
+  possible problems; follow the links for details. Before employing the
+  library I would also advise to run the tests (see <a href=
+  "#GettingStarted">Getting started</a>) on your particular platform in all
+  the modes (debug, release, etc.) that are later used during development
+  (the status page shows debug mode results only). The closer the test
+  compiler switches mirror the ones that are later used during development,
+  the less likely are future surprises. An example of such a surprise is
+  Intel 9.0 with MSVC 7.1 base toolset, where DllTestNormal and DllTestNative
+  pass in debug mode but fail in release mode.</p>
 
   <h3><a name="GettingStarted" id="GettingStarted">Getting started</a></h3>
 
   <ol>
-    <li>Follow the steps 1-3 described on the <a href=
+    <li>Follow the steps 1-4 described on the <a href=
     "../../../more/getting_started.html">Boost Getting Started Page</a>.
-    After doing so, somewhere on your hard drive you should have a directory
-    containing the boost distribution (e.g. under
-    <code>D:\Data\boost_1_34_0</code>), the bjam executable installed in
-    your <code>PATH</code> and your toolset configured in
-    <a href="../../../tools/build/v2/user-config.jam">user-config.jam</a>.
-    </li>
+    Since Boost.Statechart is a header-only library, you should now know
+    enough to compile the examples in the tutorial in your favorite
+    environment (except PingPong which requires Boost.Thread binaries)</li>
 
-    <li>Open a command prompt and change the current directory to
-    <code>D:\Data\boost_1_34_0\libs\statechart\examples</code></li>
+    <li>Optional: If you want to compile the PingPong example or use <a href=
+    "reference.html#ClassTemplatefifo_scheduler">fifo_scheduler&lt;&gt;</a>
+    in your project, you need to get hold of the Boost.Thread binaries and
+    link against them, see steps 5-6 on the Boost Getting Started Page</li>
 
-    <li>To compile the examples in debug mode, type <code>bjam</code> and hit 
-    CR. Please refer to the bjam command line documentation for other options.
-    After the build has finished you will find all executables in
-    <code>D:\Data\boost_1_34_0\libs\statechart\examples\run</code>. In
-    addition to the examples discussed in the tutorial, this script also
-    builds the Performance executable in different variants, which show the
-    effects of various choices on runtime performance, executable size, etc.
-    Moreover, the Handcrafted executable is also built, which serves to
-    compare performance of a simple Boost.Statechart machine with its 
-    handcrafted equivalent</li>
+    <li>Optional: If you want to run the tests, you need to get the bjam
+    executable, as described under step 5.2 on the Boost Getting Started
+    Page. After doing so, bjam should be installed in your <code>PATH</code>.
+    Open a command prompt and change the current directory to
+    <code>boost_1_34_0/libs/statechart/test</code>. Type
+      <pre>
+bjam --toolset=<i>your-toolset</i>
+</pre>
 
-    <li>Optional: To run the tests, invoke bjam in the directory
-    <code>D:\Data\boost_1_33_0\libs\statechart\test</code></li>
+      <p>(where <code><i>your-toolset</i></code> is one of the names
+      documented under step 5.2.2 on the Boost Getting Started Page) and hit
+      CR. After the test run, failures (if any) are indicated at the end of
+      the output, in the form of&nbsp; a "<code>...failed updating X
+      targets...</code>" message. For some platforms certain failures are
+      expected, see <a href="#SupportedPlatforms">Supported
+      platforms</a>.</p>
+    </li>
   </ol>
 
   <h3><a name="Audience" id="Audience">Audience</a></h3>
@@ -176,13 +177,11 @@
 
   <ul>
     <li><a href=
-    "http://www.objectmentor.com/resources/articles/umlfsm.pdf">
-    http://www.objectmentor.com/resources/articles/umlfsm.pdf</a>
+    "http://www.objectmentor.com/resources/articles/umlfsm.pdf">http://www.objectmentor.com/resources/articles/umlfsm.pdf</a>
     introduces state machines and UML statecharts</li>
 
     <li><a href=
-    "http://www.sts.tu-harburg.de/teaching/ws-99.00/OOA+D/StateDiagrams.pdf">
-    http://www.sts.tu-harburg.de/teaching/ws-99.00/OOA+D/StateDiagrams.pdf</a>
+    "http://www.sts.tu-harburg.de/teaching/ws-99.00/OOA+D/StateDiagrams.pdf">http://www.sts.tu-harburg.de/teaching/ws-99.00/OOA+D/StateDiagrams.pdf</a>
     explains most of the UML statechart elements and terminology</li>
 
     <li>The inventor of statecharts, David Harel, presents a thorough but
@@ -191,8 +190,7 @@
     http://www.wisdom.weizmann.ac.il/~dharel/SCANNED.PAPERS/Statecharts.pdf</a></li>
 
     <li>The UML specifications (formal) can be found here: <a href=
-    "http://www.omg.org/cgi-bin/doc?formal/03-03-01">
-    http://www.omg.org/cgi-bin/doc?formal/03-03-01</a>
+    "http://www.omg.org/cgi-bin/doc?formal/03-03-01">http://www.omg.org/cgi-bin/doc?formal/03-03-01</a>
     (see chapters 2.12 and 3.74)</li>
   </ul>
 
@@ -201,15 +199,18 @@
   information.</p>
   <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
   <p>Revised 
-  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->20 May, 2006<!--webbot bot="Timestamp" endspan i-checksum="13996" --></p>
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->29
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38526" --></p>
 
-  <p><i>&copy; Copyright <a href=
-  "mailto:ahd6974-spamgroupstrap at yahoo.com">Andreas Huber D&ouml;nni</a>
-  2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->.
-  <font color="#FF0000"><b>The link refers to a <a href=
-  "http://en.wikipedia.org/wiki/Honeypot">spam honeypot</a>. Please remove
-  the words spam and trap to obtain my real address.</b></font></i></p>
+  <p><i>Copyright &copy; 2003-
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006
+  <!--webbot bot="Timestamp" endspan i-checksum="770" -->
+   <a href="contact.html">Andreas Huber D&ouml;nni</a></i></p>
 
   <p><i>Distributed under the Boost Software License, Version 1.0. (See
   accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or

Modified: boost/trunk/libs/statechart/doc/performance.html
===================================================================
--- boost/trunk/libs/statechart/doc/performance.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/doc/performance.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -36,7 +36,7 @@
     <dt><a href="#MemoryManagementCustomization">Memory management
     customization</a></dt>
 
-    <dt><a href="#RTTICustomization">RTTI customization</a></dt>
+    <dt><a href="#RttiCustomization">RTTI customization</a></dt>
 
     <dt><a href="#ResourceUsage">Resource usage</a></dt>
   </dl>
@@ -249,7 +249,7 @@
   height="284"><img alt="PerformanceCustom4" src="PerformanceCustom4.gif"
   border="0" width="371" height="284"></p>
 
-  <h3>Double dispatch</h3>
+  <h3><a name="DoubleDispatch" id="DoubleDispatch">Double dispatch</a></h3>
 
   <p>At the heart of every state machine lies an implementation of double
   dispatch. This is due to the fact that the incoming event <b>and</b> the
@@ -272,8 +272,7 @@
     is now (MSVC7.1 on Intel Pentium M). The dispatch speed might be better
     on other platforms but the other negative effects will remain</li>
 
-    <li><a href=
-    "http://www.isbiel.ch/~due/courses/c355/slides/patterns/visitor.pdf">GOF
+    <li><a href="http://en.wikipedia.org/wiki/Visitor_pattern">GOF
     Visitor</a>: The GOF Visitor pattern inevitably makes the whole machine
     depend upon all events. That is, whenever a new event is added there is
     no way around recompiling the whole state machine. This is contrary to
@@ -437,15 +436,15 @@
   </ol>
   <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
   <p>Revised 
-  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->12 March, 2006<!--webbot bot="Timestamp" endspan i-checksum="28929" --></p>
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->03 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38512" --></p>
 
-  <p><i>&copy; Copyright <a href=
-  "mailto:ahd6974-spamgroupstrap at yahoo.com">Andreas Huber D&ouml;nni</a>
-  2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->.
-  <font color="#FF0000"><b>The link refers to a <a href=
-  "http://en.wikipedia.org/wiki/Honeypot">spam honeypot</a>. Please remove
-  the words spam and trap to obtain my real address.</b></font></i></p>
+  <p><i>Copyright &copy; 2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->
+  <a href="contact.html">Andreas Huber D&ouml;nni</a></i></p>
 
   <p><i>Distributed under the Boost Software License, Version 1.0. (See
   accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or

Modified: boost/trunk/libs/statechart/doc/rationale.html
===================================================================
--- boost/trunk/libs/statechart/doc/rationale.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/doc/rationale.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -124,7 +124,7 @@
     <li>The framework accompanying "Rhapsody in C++" by ILogix (a code
     generator solution)<br>
     <a href=
-    "http://www.ilogix.com/products/rhapsody/rhap_incplus.cfm">http://www.ilogix.com/products/rhapsody/rhap_incplus.cfm<br>
+    "http://www.ilogix.com/sublevel.aspx?id=53">http://www.ilogix.com/sublevel.aspx?id=53<br>
     </a> This might look like comparing apples with oranges. However, there
     is no inherent reason why a code generator couldn't produce code that can
     easily be understood and modified by humans. Fails to satisfy at least
@@ -134,7 +134,7 @@
     <li>The framework accompanying the article "State Machine Design in
     C++"<br>
     <a href=
-    "http://www.cuj.com/articles/2000/0005/0005f/0005f.htm?topic=articles">http://www.cuj.com/articles/2000/0005/0005f/0005f.htm?topic=articles<br>
+    "http://www.ddj.com/184401236?pgno=1">http://www.ddj.com/184401236?pgno=1<br>
     </a> Fails to satisfy at least the requirements 1, 3, 4, 5 (there is no
     direct threading support), 6, 8.</li>
   </ul>
@@ -162,8 +162,7 @@
   state machine class therefore often becomes a change hotspot what leads to
   frequent recompilations of the whole state machine.</p>
 
-  <p>The FAQ item "<a href=
-  "faq.html#WhatsSoCoolAboutStateLocalStorage">What's so cool about
+  <p>The FAQ item "<a href="faq.html#StateLocalStorage">What's so cool about
   state-local storage?</a>" further explains this by comparing the tutorial
   StopWatch to a behaviorally equivalent version that does not use
   state-local storage.</p>
@@ -216,8 +215,8 @@
     there are no transitions between orthogonal states).</li>
 
     <li>Double dispatch must inevitably be implemented with some kind of a
-    table. As argued under <a href="#DoubleDispatch">Double dispatch</a>,
-    this scales badly.</li>
+    table. As argued under <a href="performance.html#DoubleDispatch">Double
+    dispatch</a>, this scales badly.</li>
 
     <li>To warrant fast table lookup, states and events must be represented
     with an integer. To keep the table as small as possible, the numbering
@@ -589,9 +588,8 @@
 
   <h4>Transitions across orthogonal regions</h4>
 
-  <p><img alt="TransitionsAcrossOrthogonalRegions" src=
-  "TransitionsAcrossOrthogonalRegions.gif" border="0" width="226" height=
-  "271"></p>
+  <p><img alt="TransAcrossOrthRegions" src="TransAcrossOrthRegions.gif"
+  border="0" width="226" height="271"></p>
 
   <p>Transitions across orthogonal regions are currently flagged with an
   error at compile time (the UML specifications explicitly allow them while
@@ -601,15 +599,15 @@
   need to make such transitions, please do let me know!</p>
   <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
   <p>Revised 
-  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->12 March, 2006<!--webbot bot="Timestamp" endspan i-checksum="28929" --></p>
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->03 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38512" --></p>
 
-  <p><i>&copy; Copyright <a href=
-  "mailto:ahd6974-spamgroupstrap at yahoo.com">Andreas Huber D&ouml;nni</a>
-  2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->.
-  <font color="#FF0000"><b>The link refers to a <a href=
-  "http://en.wikipedia.org/wiki/Honeypot">spam honeypot</a>. Please remove
-  the words spam and trap to obtain my real address.</b></font></i></p>
+  <p><i>Copyright &copy; 2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->
+  <a href="contact.html">Andreas Huber D&ouml;nni</a></i></p>
 
   <p><i>Distributed under the Boost Software License, Version 1.0. (See
   accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or

Copied: boost/trunk/libs/statechart/doc/rationale.pdf (from rev 14034, boost/branches/upstream/current/libs/statechart/doc/rationale.pdf)

Modified: boost/trunk/libs/statechart/doc/reference.html
===================================================================
--- boost/trunk/libs/statechart/doc/reference.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/doc/reference.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -434,7 +434,9 @@
       of <code>cs</code>. <code>S::id_type</code> values are comparable with
       <code>operator==()</code> and <code>operator!=()</code>. An unspecified
       collating order can be established with <code>std::less&lt; S::id_type
-      &gt;</code></td>
+      &gt;</code>. In contrast to <code>typeid( cs )</code>, this function is
+      available even on platforms that do not support C++ RTTI (or have been
+      configured to not support it)</td>
     </tr>
 
     <tr>
@@ -450,19 +452,6 @@
       "configuration.html#ApplicationDefinedMacros">BOOST_STATECHART_USE_NATIVE_RTTI</a>
       is not defined</td>
     </tr>
-
-    <tr>
-      <td width="25%"><code>typeid( cs )</code></td>
-
-      <td width="12%"><code>const std::<br>
-      type_info &amp;</code></td>
-
-      <td width="60%">A value unambiguously identifying the most-derived type
-      of <code>cs</code>, <b>if</b> <a href=
-      "configuration.html#ApplicationDefinedMacros">BOOST_STATECHART_USE_NATIVE_RTTI</a>
-      is defined. Otherwise, a value identifying the StateBase type is
-      returned</td>
-    </tr>
   </table>
 
   <h2><a name="SimpleState" id="SimpleState">SimpleState</a> concept</h2>
@@ -699,7 +688,9 @@
 
       <td width="51%">A model of the standard Allocator concept</td>
 
-      <td width="18%">&nbsp;</td>
+      <td width="18%"><code>Allocator::rebind&lt;&gt;::other</code> is used
+      to allocate and deallocate all <code>simple_state</code> subtype
+      objects and internal objects of dynamic storage duration</td>
 
       <td width="19%"><code>std::allocator&lt; void &gt;</code></td>
     </tr>
@@ -877,10 +868,8 @@
   parameters:</p>
 
   <ul>
-    <li><code>operator new()</code> (used to allocate states)</li>
+    <li><code>Allocator::rebind&lt;&gt;::other::allocate()</code></li>
 
-    <li><code>Allocator::allocate()</code></li>
-
     <li>state constructors</li>
 
     <li><code>react</code> member functions</li>
@@ -961,10 +950,8 @@
   parameters:</p>
 
   <ul>
-    <li><code>operator new()</code> (used to allocate states)</li>
+    <li><code>Allocator::rebind&lt;&gt;::other::allocate()</code></li>
 
-    <li><code>Allocator::allocate()</code></li>
-
     <li>state constructors</li>
 
     <li><code>react</code> member functions</li>
@@ -1102,10 +1089,8 @@
   parameters:</p>
 
   <ul>
-    <li><code>operator new()</code> (used to allocate states)</li>
+    <li><code>Allocator::rebind&lt;&gt;::other::allocate()</code></li>
 
-    <li><code>Allocator::allocate()</code></li>
-
     <li>state constructors</li>
 
     <li><code>react</code> member functions</li>
@@ -1134,18 +1119,17 @@
   );</code><br>
   <b>Throws</b>: Any exceptions propagated from
   <code>Allocator::allocate()</code></p>
-
   <pre>
-void <a name="unconsumed_event" id="unconsumed_event">unconsumed_event</a>( const <a href=
+void <a name="unconsumed_event" id=
+"unconsumed_event">unconsumed_event</a>( const <a href=
 "#Classevent_base">event_base</a> &amp; evt );
 </pre>
 
   <p><b>Effects</b>: None<br>
-  <b>Note</b>: This function (or, if present, the equally named derived class 
-  member function) is called by 
-  <a href="#process_event">process_event</a>() whenever a dispatched event did
-  not trigger a reaction, see  
-  <a href="#process_event">process_event</a>() effects, point 10 for more
+  <b>Note</b>: This function (or, if present, the equally named derived class
+  member function) is called by <a href="#process_event">process_event</a>()
+  whenever a dispatched event did not trigger a reaction, see <a href=
+  "#process_event">process_event</a>() effects, point 10 for more
   information.</p>
 
   <h3>Class template <code>state_machine</code> observer functions</h3>
@@ -2156,12 +2140,7 @@
 <a name="simple_state" id="simple_state">simple_state</a>();
 </pre>
 
-  <p><b>Requires</b>: The constructors of all direct and indirect subtypes
-  must be exception-neutral<b><br>
-  Effects</b>: Constructs a state object<br>
-  <b>Throws</b>: Any exceptions propagated from
-  <code>Allocator::allocate()</code> (the template parameter passed to the
-  base class of <code>outermost_context_type</code>)</p>
+  <p><b>Effects</b>: Constructs a state object</p>
   <pre>
 <a name="simple_statedtor" id="simple_statedtor">~simple_state</a>();
 </pre>
@@ -2250,8 +2229,9 @@
   The user-supplied <code>react</code> member function must return this
   object to its caller<br>
   <b>Throws</b>: Any exceptions propagated from
-  <code>Allocator::allocate()</code> (the template parameter passed to the
-  base class of <code>outermost_context_type</code>)</p>
+  <code>Allocator::rebind&lt;&gt;::other::allocate()</code> (the template
+  parameter passed to the base class of
+  <code>outermost_context_type</code>)</p>
   <pre>
 template&lt; class DestinationState &gt;
 <a href="#Classresult">result</a> <a name="transit1" id=
@@ -2320,11 +2300,10 @@
   <b>Throws</b>: Any exceptions propagated from:</p>
 
   <ul>
-    <li><code>operator new()</code> (used to allocate states)</li>
+    <li><code>Allocator::rebind&lt;&gt;::other::allocate()</code> (the
+    template parameter passed to the base class of
+    <code>outermost_context_type</code>)</li>
 
-    <li><code>Allocator::allocate()</code> (the template parameter passed to
-    the base class of <code>outermost_context_type</code>)</li>
-
     <li>state constructors</li>
 
     <li><code>exit</code> member functions</li>
@@ -2410,11 +2389,10 @@
   <b>Throws</b>: Any exceptions propagated from:</p>
 
   <ul>
-    <li><code>operator new()</code> (used to allocate states)</li>
+    <li><code>Allocator::rebind&lt;&gt;::other::allocate()</code> (the
+    template parameter passed to the base class of
+    <code>outermost_context_type</code>)</li>
 
-    <li><code>Allocator::allocate()</code> (the template parameter passed to
-    the base class of <code>outermost_context_type</code>)</li>
-
     <li>state constructors</li>
 
     <li><code>exit</code> member functions</li>
@@ -2474,9 +2452,10 @@
   <b>Throws</b>: Any exceptions propagated from:</p>
 
   <ul>
-    <li><code>Allocator::allocate()</code> (the template parameter passed to
-    the base class of <code>outermost_context_type</code>, used to allocate
-    space to save history)</li>
+    <li><code>Allocator::rebind&lt;&gt;::other::allocate()</code> (the
+    template parameter passed to the base class of
+    <code>outermost_context_type</code>, used to allocate space to save
+    history)</li>
 
     <li><code>exit</code> member functions</li>
   </ul>
@@ -2509,8 +2488,9 @@
   specified by <code>orthogonalPosition</code> of the state specified by
   <code>HistoryContext</code><br>
   <b>Throws</b>: Any exceptions propagated from
-  <code>Allocator::allocate()</code> (the template parameter passed to the
-  base class of <code>outermost_context_type</code>)</p>
+  <code>Allocator::rebind&lt;&gt;::other::allocate()</code> (the template
+  parameter passed to the base class of
+  <code>outermost_context_type</code>)</p>
   <pre>
 template&lt;
   class HistoryContext,
@@ -2532,8 +2512,9 @@
   by <code>orthogonalPosition</code> of the state specified by
   <code>HistoryContext</code><br>
   <b>Throws</b>: Any exceptions propagated from
-  <code>Allocator::allocate()</code> (the template parameter passed to the
-  base class of <code>outermost_context_type</code>)</p>
+  <code>Allocator::rebind&lt;&gt;::other::allocate()</code> (the template
+  parameter passed to the base class of
+  <code>outermost_context_type</code>)</p>
 
   <h3>Class template <code>simple_state</code> observer functions</h3>
   <pre>
@@ -2934,7 +2915,9 @@
   <b>Note</b>: <code>id_type</code> values are comparable with
   <code>operator==()</code> and <code>operator!=()</code>. An unspecified
   collating order can be established with <code>std::less&lt; id_type
-  &gt;</code></p>
+  &gt;</code>. In contrast to <code>typeid( cs )</code>, this function is
+  available even on platforms that do not support C++ RTTI (or have been
+  configured to not support it)</p>
   <pre>
 template&lt; typename CustomId &gt;
 const CustomId * <a name="event_base::custom_dynamic_type_ptr" id=
@@ -2957,16 +2940,58 @@
 
   <p>This is the base class template of all events.</p>
 
+  <h3>Class template <code>event</code> parameters</h3>
+
+  <table border="3" cellpadding="2" width="100%" summary="event parameters">
+    <tr>
+      <td width="15%"><b>Template parameter</b></td>
+
+      <td width="51%"><b>Requirements</b></td>
+
+      <td width="18%"><b>Semantics</b></td>
+
+      <td width="19%"><b>Default</b></td>
+    </tr>
+
+    <tr>
+      <td width="15%"><code>MostDerived</code></td>
+
+      <td width="51%">The most-derived subtype of this class template</td>
+
+      <td width="18%">&nbsp;</td>
+
+      <td width="19%">&nbsp;</td>
+    </tr>
+
+    <tr>
+      <td width="15%"><code>Allocator</code></td>
+
+      <td width="51%">A model of the standard Allocator concept</td>
+
+      <td width="18%"><code>Allocator::rebind&lt; MostDerived
+      &gt;::other</code> is used to allocate and deallocate all event subtype
+      objects of dynamic storage duration, see <code><a href=
+      "#event::operatornew">operator new</a></code></td>
+
+      <td width="19%"><code>std::allocator&lt; void &gt;</code></td>
+    </tr>
+  </table>
+
   <h3>Class template <code>event</code> synopsis</h3>
   <pre>
 namespace boost
 {
 namespace statechart
 {
-  template&lt; class MostDerived &gt;
+  template&lt; class MostDerived, class Allocator = std::allocator&lt; void &gt; &gt;
   class event : <i>implementation-defined</i>
   {
     public:
+      static void * <a href=
+"#event::operatornew">operator new</a>( std::size_t size );
+      static void <a href=
+"#event::operatordelete">operator delete</a>( void * pEvent );
+
       static id_type <a href="#event::static_type">static_type</a>();
 
       template&lt; class CustomId &gt;
@@ -2999,6 +3024,24 @@
 
   <h3>Class template <code>event</code> static functions</h3>
   <pre>
+static void * <a name="event::operatornew" id=
+"event::operatornew">operator new</a>( std::size_t size );
+</pre>
+
+  <p><b>Effects</b>: <code>Allocator::rebind&lt; MostDerived
+  &gt;::other().allocate( 1, static_cast&lt; MostDerived * &gt;( 0 )
+  );</code><br>
+  <b>Returns</b>: The return value of the above call<br>
+  <b>Throws</b>: Whatever the above call throws</p>
+  <pre>
+static void <a name="event::operatordelete" id=
+"event::operatordelete">operator delete</a>( void * pEvent );
+</pre>
+
+  <p><b>Effects</b>: <code>Allocator::rebind&lt; MostDerived
+  &gt;::other().deallocate( static_cast&lt; MostDerived * &gt;( pEvent ), 1
+  );</code></p>
+  <pre>
 static id_type <a name="event::static_type" id=
 "event::static_type">static_type</a>();
 </pre>
@@ -3478,15 +3521,18 @@
   <b>Effects</b>: Destructs the result object</p>
   <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
   <p>Revised 
-  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->18 May, 2006<!--webbot bot="Timestamp" endspan i-checksum="14011" --></p>
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->29
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38526" --></p>
 
-  <p><i>&copy; Copyright <a href=
-  "mailto:ahd6974-spamgroupstrap at yahoo.com">Andreas Huber D&ouml;nni</a>
-  2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->.
-  <font color="#FF0000"><b>The link refers to a <a href=
-  "http://en.wikipedia.org/wiki/Honeypot">spam honeypot</a>. Please remove
-  the words spam and trap to obtain my real address.</b></font></i></p>
+  <p><i>Copyright &copy; 2003- 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006
+  <!--webbot bot="Timestamp" endspan i-checksum="770" -->
+   <a href="contact.html">Andreas Huber D&ouml;nni</a></i></p>
 
   <p><i>Distributed under the Boost Software License, Version 1.0. (See
   accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or

Copied: boost/trunk/libs/statechart/doc/reference.pdf (from rev 14034, boost/branches/upstream/current/libs/statechart/doc/reference.pdf)

Modified: boost/trunk/libs/statechart/doc/tutorial.html
===================================================================
--- boost/trunk/libs/statechart/doc/tutorial.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/doc/tutorial.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -41,7 +41,7 @@
 
     <dd><a href="#HowToReadThisTutorial">How to read this tutorial</a></dd>
 
-    <dt><a href="#HelloWorld!">Hello World!</a></dt>
+    <dt><a href="#HelloWorld">Hello World!</a></dt>
 
     <dt><a href="#BasicTopicsAStopWatch">Basic topics: A stop watch</a></dt>
 
@@ -87,7 +87,7 @@
 
     <dd><a href="#ExceptionHandling">Exception handling</a></dd>
 
-    <dd><a href="#SubmachinesAndParametrizedStates">Submachines &amp;
+    <dd><a href="#SubmachinesAndParameterizedStates">Submachines &amp;
     Parametrized States</a></dd>
 
     <dd><a href="#AsynchronousStateMachines">Asynchronous state
@@ -416,10 +416,9 @@
 
   <p>At this point, the advantages of state-local storage (which is still a
   relatively little-known feature) may not yet have become apparent. The FAQ
-  item "<a href="faq.html#WhatsSoCoolAboutStateLocalStorage">What's so cool
-  about state-local storage?</a>" tries to explain them in more detail by
-  comparing this StopWatch with one that does not make use of state-local
-  storage.</p>
+  item "<a href="faq.html#StateLocalStorage">What's so cool about state-local
+  storage?</a>" tries to explain them in more detail by comparing this
+  StopWatch with one that does not make use of state-local storage.</p>
 
   <h3><a name="GettingStateInformationOutOfTheMachine" id=
   "GettingStateInformationOutOfTheMachine">Getting state information out of
@@ -1507,9 +1506,8 @@
   an outermost state</b>, so the following machine will <b>not</b> transit to
   Defective after receiving an EvNumLockPressed event:</p>
 
-  <p><img alt="ExceptionsAndOrthogonalStates" src=
-  "ExceptionsAndOrthogonalStates.gif" border="0" width="571" height=
-  "331"></p>
+  <p><img alt="ExceptionsAndOrthStates" src="ExceptionsAndOrthStates.gif"
+  border="0" width="571" height="331"></p>
 
   <p>Instead, the machine is terminated and the original exception
   rethrown.</p>
@@ -1822,15 +1820,15 @@
   terminating.</p>
   <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
   <p>Revised 
-  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->13 March, 2006<!--webbot bot="Timestamp" endspan i-checksum="28931" --></p>
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->03 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38512" --></p>
 
-  <p><i>&copy; Copyright <a href=
-  "mailto:ahd6974-spamgroupstrap at yahoo.com">Andreas Huber D&ouml;nni</a>
-  2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->.
-  <font color="#FF0000"><b>The link refers to a <a href=
-  "http://en.wikipedia.org/wiki/Honeypot">spam honeypot</a>. Please remove
-  the words spam and trap to obtain my real address.</b></font></i></p>
+  <p><i>Copyright &copy; 2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->
+  <a href="contact.html">Andreas Huber D&ouml;nni</a></i></p>
 
   <p><i>Distributed under the Boost Software License, Version 1.0. (See
   accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or

Copied: boost/trunk/libs/statechart/doc/tutorial.pdf (from rev 14034, boost/branches/upstream/current/libs/statechart/doc/tutorial.pdf)

Modified: boost/trunk/libs/statechart/doc/uml_mapping.html
===================================================================
--- boost/trunk/libs/statechart/doc/uml_mapping.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/doc/uml_mapping.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -231,7 +231,7 @@
 
   <ul>
     <li>All events passed to either <code><a href=
-    "reference.html#post_event">simple_state&lt;&gt;::post_event()</a></code>
+    "reference.html#post_event0">simple_state&lt;&gt;::post_event()</a></code>
     or <code><a href=
     "reference.html#queue_event">fifo_scheduler&lt;&gt;::queue_event()</a></code>
     are implicitly signal events</li>
@@ -346,16 +346,15 @@
   </ul>
   <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
   <p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->12
-  March, 2006<!--webbot bot="Timestamp" endspan i-checksum="28929" --></p>
+  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->03 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38512" --></p>
 
-  <p><i>&copy; Copyright <a href=
-  "mailto:ahd6974-spamgroupstrap at yahoo.com">Andreas Huber D&ouml;nni</a>
-  2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->.
-  <font color="#FF0000"><b>The link refers to a <a href=
-  "http://en.wikipedia.org/wiki/Honeypot">spam honeypot</a>. Please remove
-  the words spam and trap to obtain my real address.</b></font></i></p>
+  <p><i>Copyright &copy; 2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" -->
+  <a href="contact.html">Andreas Huber D&ouml;nni</a></i></p>
 
   <p><i>Distributed under the Boost Software License, Version 1.0. (See
   accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or

Modified: boost/trunk/libs/statechart/example/BitMachine/BitMachine.cpp
===================================================================
--- boost/trunk/libs/statechart/example/BitMachine/BitMachine.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/BitMachine/BitMachine.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////
@@ -7,7 +7,7 @@
 
 
 //////////////////////////////////////////////////////////////////////////////
-#define NO_OF_BITS 5
+#define NO_OF_BITS 3
 //////////////////////////////////////////////////////////////////////////////
 // This program demonstrates the fact that measures must be taken to hide some
 // of the complexity (e.g. in separate .cpp file) of a Boost.Statechart state
@@ -115,16 +115,31 @@
     BOOST_MPL_AUX_LAMBDA_SUPPORT( 2, FlipTransition, (BitNo, StateNo) );
 };
 
+//////////////////////////////////////////////////////////////////////////////
+void DisplayBits( unsigned int number )
+{
+  char buffer[ NO_OF_BITS + 1 ];
+  buffer[ NO_OF_BITS ] = 0;
+
+  for ( unsigned int bit = 0; bit < NO_OF_BITS; ++bit )
+  {
+    buffer[ bit ] = number & ( 1 << ( NO_OF_BITS - bit - 1 ) ) ? '1' : '0';
+  }
+
+  std::cout << "Current state: " << std::setw( 4 ) <<
+    number << " (" << buffer << ")" << std::endl;
+}
+
 template< class StateNo >
 struct BitState : sc::simple_state< BitState< StateNo >, BitMachine >,
   UniqueObject< BitState< StateNo > >, IDisplay
 {
-  void * operator new( size_t size )
+  void * operator new( std::size_t size )
   {
     return UniqueObject< BitState< StateNo > >::operator new( size );
   }
 
-  void operator delete( void * p, size_t size )
+  void operator delete( void * p, std::size_t size )
   {
     UniqueObject< BitState< StateNo > >::operator delete( p, size );
   }
@@ -143,21 +158,6 @@
 };
 
 
-//////////////////////////////////////////////////////////////////////////////
-void DisplayBits( unsigned int number )
-{
-  char buffer[ NO_OF_BITS + 1 ];
-  buffer[ NO_OF_BITS ] = 0;
-
-  for ( unsigned int bit = 0; bit < NO_OF_BITS; ++bit )
-  {
-    buffer[ bit ] = number & ( 1 << ( NO_OF_BITS - bit - 1 ) ) ? '1' : '0';
-  }
-
-  std::cout << "Current state: " << std::setw( 4 ) <<
-    number << " (" << buffer << ")" << std::endl;
-}
-
 void DisplayMachineState( const BitMachine & bitMachine )
 {
   bitMachine.state_cast< const IDisplay & >().Display();

Modified: boost/trunk/libs/statechart/example/BitMachine/UniqueObject.hpp
===================================================================
--- boost/trunk/libs/statechart/example/BitMachine/UniqueObject.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/BitMachine/UniqueObject.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_EXAMPLE_UNIQUE_OBJECT_HPP_INCLUDED
 #define BOOST_STATECHART_EXAMPLE_UNIQUE_OBJECT_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////
@@ -20,12 +20,12 @@
 {
   public:
     //////////////////////////////////////////////////////////////////////////
-    void * operator new( size_t size )
+    void * operator new( std::size_t size )
     {
       return UniqueObjectAllocator< Derived >::allocate( size );
     }
 
-    void operator delete( void * p, size_t size )
+    void operator delete( void * p, std::size_t size )
     {
       UniqueObjectAllocator< Derived >::deallocate( p, size );
     }

Modified: boost/trunk/libs/statechart/example/BitMachine/UniqueObjectAllocator.hpp
===================================================================
--- boost/trunk/libs/statechart/example/BitMachine/UniqueObjectAllocator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/BitMachine/UniqueObjectAllocator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_EXAMPLE_UNIQUE_OBJECT_ALLOCATOR_HPP_INCLUDED
 #define BOOST_STATECHART_EXAMPLE_UNIQUE_OBJECT_ALLOCATOR_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////
@@ -37,7 +37,7 @@
 {
   public:
     //////////////////////////////////////////////////////////////////////////
-    static void * allocate( size_t size )
+    static void * allocate( std::size_t size )
     {
       boost::statechart::detail::avoid_unused_warning( size );
       BOOST_ASSERT( !constructed_ && ( size == sizeof( T ) ) );
@@ -45,7 +45,7 @@
       return &storage_.data_[ 0 ];
     }
 
-    static void deallocate( void * p, size_t size )
+    static void deallocate( void * p, std::size_t size )
     {
       boost::statechart::detail::avoid_unused_warning( p );
       boost::statechart::detail::avoid_unused_warning( size );

Deleted: boost/trunk/libs/statechart/example/BuildExamples.bat
===================================================================
--- boost/trunk/libs/statechart/example/BuildExamples.bat	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/BuildExamples.bat	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +0,0 @@
-bjam "-sTOOLS=mingw vc-7_1" "-sMINGW_ROOT_DIRECTORY=C:\ProgramFiles\MinGW3.2.0" "-sINTEL_PATH=C:\Program Files\Intel\Compiler\C++\9.0\IA32" "-sINTEL_BASE_MSVC_TOOLSET=vc-7_1" %1 %2 %3 %4 >log.txt 2>&1
\ No newline at end of file

Modified: boost/trunk/libs/statechart/example/Camera/Camera.cpp
===================================================================
--- boost/trunk/libs/statechart/example/Camera/Camera.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/Camera/Camera.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/example/Camera/Camera.hpp
===================================================================
--- boost/trunk/libs/statechart/example/Camera/Camera.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/Camera/Camera.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_EXAMPLE_CAMERA_HPP_INCLUDED
 #define BOOST_STATECHART_EXAMPLE_CAMERA_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/example/Camera/Configuring.cpp
===================================================================
--- boost/trunk/libs/statechart/example/Camera/Configuring.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/Camera/Configuring.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/example/Camera/Configuring.hpp
===================================================================
--- boost/trunk/libs/statechart/example/Camera/Configuring.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/Camera/Configuring.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_EXAMPLE_CONFIGURING_HPP_INCLUDED
 #define BOOST_STATECHART_EXAMPLE_CONFIGURING_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/example/Camera/Main.cpp
===================================================================
--- boost/trunk/libs/statechart/example/Camera/Main.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/Camera/Main.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////
@@ -106,5 +106,5 @@
     key = GetKey();
   }
 
- 	return 0;
+  return 0;
 }

Modified: boost/trunk/libs/statechart/example/Camera/Precompiled.cpp
===================================================================
--- boost/trunk/libs/statechart/example/Camera/Precompiled.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/Camera/Precompiled.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/example/Camera/Precompiled.hpp
===================================================================
--- boost/trunk/libs/statechart/example/Camera/Precompiled.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/Camera/Precompiled.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_EXAMPLE_PRECOMPILED_HPP_INCLUDED
 #define BOOST_STATECHART_EXAMPLE_PRECOMPILED_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/example/Camera/Shooting.cpp
===================================================================
--- boost/trunk/libs/statechart/example/Camera/Shooting.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/Camera/Shooting.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/example/Camera/Shooting.hpp
===================================================================
--- boost/trunk/libs/statechart/example/Camera/Shooting.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/Camera/Shooting.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_EXAMPLE_SHOOTING_HPP_INCLUDED
 #define BOOST_STATECHART_EXAMPLE_SHOOTING_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/example/Handcrafted/Handcrafted.cpp
===================================================================
--- boost/trunk/libs/statechart/example/Handcrafted/Handcrafted.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/Handcrafted/Handcrafted.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////
@@ -192,5 +192,5 @@
     key = GetKey();
   }
 
- 	return 0;
+  return 0;
 }

Deleted: boost/trunk/libs/statechart/example/Jamfile
===================================================================
--- boost/trunk/libs/statechart/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,63 +0,0 @@
-##############################################################################
-# (c) Copyright Andreas Huber Doenni 2004-2006
-# Distributed under the Boost Software License, Version 1.0. (See accompany-
-# ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-##############################################################################
-
-subproject libs/statechart/example ;
-
-# Some platforms have either problems with the automatic detection of the
-# threading mode (e.g. vc-7_1 & gcc >= 3.4.0) or don't support single-
-# threaded mode (e.g. vc-8_0). We therefore manually turn MT off here
-local st-requirements = <threading>single <define>BOOST_DISABLE_THREADS ;
-local custom = <define>CUSTOMIZE_MEMORY_MANAGEMENT ;
-local native = <define>BOOST_STATECHART_USE_NATIVE_RTTI ;
-
-template statechart-common-options : : <include>$(BOOST_ROOT) ;
-
-rule statechart-st-example-build (
-  name : directory : cpp-sources + : requirements * )
-{
-  exe $(name)
-    : $(directory)/$(cpp-sources).cpp <template>statechart-common-options
-    : $(st-requirements) $(requirements) ;
-
-  return <exe>$(name) ;
-}
-
-rule statechart-mt-example-build (
-  name : directory : cpp-sources + : requirements * )
-{
-  exe $(name)
-    : $(directory)/$(cpp-sources).cpp <lib>../../thread/build/boost_thread
-      <template>statechart-common-options
-    : <threading>multi $(requirements) ;
-
-  return <exe>$(name) ;
-}
-
-stage run
-  : [ statechart-st-example-build BitMachine : BitMachine : BitMachine ]
-    [ statechart-st-example-build Camera
-        : Camera : Camera Configuring Main Shooting ]
-    [ statechart-st-example-build Handcrafted : Handcrafted : Handcrafted ]
-    [ statechart-st-example-build KeyboardNormal : Keyboard : Keyboard ]
-    [ statechart-st-example-build KeyboardNative
-        : Keyboard : Keyboard : $(native) ]
-    [ statechart-st-example-build PingPongSingle
-        : PingPong : PingPong : $(custom) ]
-    [ statechart-mt-example-build PingPongMulti1
-        : PingPong : PingPong : $(custom) ]
-    [ statechart-mt-example-build PingPongMulti2
-        : PingPong : PingPong : $(custom) <define>USE_TWO_THREADS ]
-    [ statechart-st-example-build StopWatch : StopWatch : StopWatch ]
-    [ statechart-st-example-build StopWatch2 : StopWatch : StopWatch2 ]
-    [ statechart-st-example-build PerformanceNormal
-        : Performance : Performance ]
-    [ statechart-st-example-build PerformanceCustom
-        : Performance : Performance : $(custom) ]
-    [ statechart-st-example-build PerformanceNative
-        : Performance : Performance : $(native) ]
-  : common-variant-tag
-    <target>stage
-    <target>all ;
\ No newline at end of file

Modified: boost/trunk/libs/statechart/example/Jamfile.v2
===================================================================
--- boost/trunk/libs/statechart/example/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 ##############################################################################
-# (c) Copyright Andreas Huber Doenni 2005-2006
+# Copyright 2005-2006 Andreas Huber Doenni
 # Distributed under the Boost Software License, Version 1.0. (See accompany-
 # ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 ##############################################################################
@@ -17,12 +17,7 @@
   for local cpp-source in $(cpp-sources)
   {
     obj $(name)$(cpp-source)
-      : $(directory)/$(cpp-source).cpp
-        # Some platforms have either problems with the automatic detection of
-        # the threading mode (e.g. vc-7_1 & gcc >= 3.4.0) or don't support
-        # single-threaded mode (e.g. vc-8_0). We therefore manually turn MT
-        # off here
-      : <threading>single:<define>BOOST_DISABLE_THREADS $(requirements) ;
+      : $(directory)/$(cpp-source).cpp : $(requirements) ;
     objs += $(name)$(cpp-source) ;
   }
 
@@ -34,7 +29,12 @@
 {
   exe $(name) : [ independent-obj-build $(name)
                     : $(directory) : $(cpp-sources)
-                    : <threading>single $(requirements) ] ;
+                    # Some platforms have either problems with the automatic
+                    # detection of the threading mode (e.g. vc-7_1 &
+                    # gcc >= 3.4.0) or don't support single-threaded mode
+                    # (e.g. vc-8_0). We therefore manually turn MT
+                    # off here
+                    : <threading>single <define>BOOST_DISABLE_THREADS $(requirements) ] ;
 
   return $(name) ;
 }

Modified: boost/trunk/libs/statechart/example/Keyboard/Keyboard.cpp
===================================================================
--- boost/trunk/libs/statechart/example/Keyboard/Keyboard.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/Keyboard/Keyboard.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/example/Performance/Performance.cpp
===================================================================
--- boost/trunk/libs/statechart/example/Performance/Performance.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/Performance/Performance.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/example/PingPong/PingPong.cpp
===================================================================
--- boost/trunk/libs/statechart/example/PingPong/PingPong.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/PingPong/PingPong.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/example/StopWatch/StopWatch.cpp
===================================================================
--- boost/trunk/libs/statechart/example/StopWatch/StopWatch.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/StopWatch/StopWatch.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/example/StopWatch/StopWatch2.cpp
===================================================================
--- boost/trunk/libs/statechart/example/StopWatch/StopWatch2.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/example/StopWatch/StopWatch2.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2002-2005
+// Copyright 2002-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/index.html
===================================================================
--- boost/trunk/libs/statechart/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,14 +1,32 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 3.2//EN">
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
 <html>
 <head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
   <meta http-equiv="refresh" content="0; URL=doc/index.html">
 
   <title></title>
 </head>
 
 <body>
-  Automatic redirection failed, please go to <a href=
-  "doc/index.html">doc/index.html</a>.
+  <p>Automatic redirection failed, please go to <a href=
+  "doc/index.html">doc/index.html</a>.</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0"
+  src="http://www.w3.org/Icons/valid-html401"
+  alt="Valid HTML 4.01 Transitional" height="31" width="88"></a></p>
+  
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->18 July, 2006<!--webbot bot="Timestamp" endspan i-checksum="21157" --></p>
+
+  <p><i>Copyright &copy; 2003-<!--webbot bot="Timestamp" s-type="EDITED" s-format="%Y" startspan -->2006<!--webbot bot="Timestamp" endspan i-checksum="770" --> <a href="doc/contact.html">Andreas Huber D&ouml;nni</a>
+  </i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See 
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or 
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/statechart/test/CustomReactionTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/CustomReactionTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/CustomReactionTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/DeferralTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/DeferralTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/DeferralTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2004-2006
+// Copyright 2004-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/FifoSchedulerTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/FifoSchedulerTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/FifoSchedulerTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/HistoryTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/HistoryTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/HistoryTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005-2006
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////
@@ -18,7 +18,9 @@
 
 #include <boost/test/test_tools.hpp>
 
+#include <stdexcept>
 
+
 namespace sc = boost::statechart;
 namespace mpl = boost::mpl;
 
@@ -29,6 +31,8 @@
 struct EvToD : sc::event< EvToD > {};
 struct EvToDShallow : sc::event< EvToDShallow > {};
 struct EvToDDeep : sc::event< EvToDDeep > {};
+struct EvToDShallowLocal : sc::event< EvToDShallowLocal > {};
+struct EvToDDeepLocal : sc::event< EvToDDeepLocal > {};
 
 struct EvToF : sc::event< EvToF > {};
 struct EvToFShallow : sc::event< EvToFShallow > {};
@@ -40,9 +44,16 @@
 struct EvToM : sc::event< EvToM > {};
 struct EvToQ : sc::event< EvToQ > {};
 
+struct EvWhatever : sc::event< EvWhatever > {};
 
 struct A;
-struct HistoryTest : sc::state_machine< HistoryTest, A > {};
+struct HistoryTest : sc::state_machine< HistoryTest, A >
+{
+  void unconsumed_event( const sc::event_base & )
+  {
+    throw std::runtime_error( "Event was not consumed!" );
+  }
+};
 
 struct B;
 struct D;
@@ -94,7 +105,13 @@
     struct E : sc::simple_state< E, C, F, sc::has_full_history > {};
 
       struct F : sc::simple_state< F, E > {};
-      struct G : sc::simple_state< G, E, H > {};
+      struct G : sc::simple_state< G, E, H >
+      {
+        typedef mpl::list<
+          sc::transition< EvToDShallowLocal, sc::shallow_history< D > >,
+          sc::transition< EvToDDeepLocal, sc::deep_history< D > >
+        > reactions;
+      };
 
         struct H : sc::simple_state< H, G > {};
         struct I : sc::simple_state< I, G > {};
@@ -283,6 +300,18 @@
   pM->process_event( EvToFDeep() );
   BOOST_REQUIRE_NO_THROW( pM->state_downcast< const F & >() );
 
+  // Test local history (new with UML 2.0)
+  pM->initiate();
+  // unconsumed_event sanity check
+  BOOST_REQUIRE_THROW( pM->process_event( EvWhatever() ), std::runtime_error );
+  pM->process_event( EvToI() );
+  BOOST_REQUIRE_NO_THROW( pM->state_downcast< const I & >() );
+  pM->process_event( EvToDShallowLocal() );
+  BOOST_REQUIRE_NO_THROW( pM->state_downcast< const F & >() );
+  pM->process_event( EvToI() );
+  pM->process_event( EvToDDeepLocal() );
+  BOOST_REQUIRE_NO_THROW( pM->state_downcast< const I & >() );
+
   // Given that history transitions and history initial states are implemented
   // with the same code we just make a few sanity checks and trust that the
   // rest will work just like we tested above.

Modified: boost/trunk/libs/statechart/test/InStateReactionTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InStateReactionTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InStateReactionTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InconsistentHistoryTest1.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InconsistentHistoryTest1.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InconsistentHistoryTest1.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InconsistentHistoryTest2.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InconsistentHistoryTest2.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InconsistentHistoryTest2.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InconsistentHistoryTest3.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InconsistentHistoryTest3.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InconsistentHistoryTest3.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InconsistentHistoryTest4.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InconsistentHistoryTest4.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InconsistentHistoryTest4.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InconsistentHistoryTest5.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InconsistentHistoryTest5.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InconsistentHistoryTest5.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InconsistentHistoryTest6.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InconsistentHistoryTest6.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InconsistentHistoryTest6.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InconsistentHistoryTest7.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InconsistentHistoryTest7.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InconsistentHistoryTest7.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InconsistentHistoryTest8.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InconsistentHistoryTest8.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InconsistentHistoryTest8.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InnermostDefault.hpp
===================================================================
--- boost/trunk/libs/statechart/test/InnermostDefault.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InnermostDefault.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_TEST_INNERMOST_DEFAULT_HPP_INCLUDED
 #define BOOST_STATECHART_TEST_INNERMOST_DEFAULT_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2004-2005
+// Copyright 2004-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InvalidChartTest1.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InvalidChartTest1.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InvalidChartTest1.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InvalidChartTest2.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InvalidChartTest2.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InvalidChartTest2.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InvalidChartTest3.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InvalidChartTest3.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InvalidChartTest3.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InvalidResultAssignTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InvalidResultAssignTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InvalidResultAssignTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InvalidResultCopyTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InvalidResultCopyTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InvalidResultCopyTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005-2006
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InvalidResultDefCtorTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InvalidResultDefCtorTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InvalidResultDefCtorTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InvalidTransitionTest1.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InvalidTransitionTest1.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InvalidTransitionTest1.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2004-2005
+// Copyright 2004-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/InvalidTransitionTest2.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InvalidTransitionTest2.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InvalidTransitionTest2.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2004-2005
+// Copyright 2004-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Deleted: boost/trunk/libs/statechart/test/InvalidTransitionTest3.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InvalidTransitionTest3.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InvalidTransitionTest3.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,44 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2004-2005
-// Distributed under the Boost Software License, Version 1.0. (See accompany-
-// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-//////////////////////////////////////////////////////////////////////////////
-
-
-
-#include <boost/statechart/state_machine.hpp>
-#include <boost/statechart/simple_state.hpp>
-#include <boost/statechart/event.hpp>
-#include <boost/statechart/transition.hpp>
-#include <boost/statechart/shallow_history.hpp>
-
-
-
-namespace sc = boost::statechart;
-
-
-
-struct EvX : sc::event< EvX > {};
-
-struct Active;
-struct InvalidTransitionTest : sc::state_machine<
-  InvalidTransitionTest, Active > {};
-
-struct Idle;
-struct Active : sc::simple_state<
-  Active, InvalidTransitionTest, Idle, sc::has_shallow_history > {};
-
-  // Invalid transition to shallow history from a state residing on the same
-  // level as the history connector.
-  struct Idle : sc::simple_state< Idle, Active >
-  {
-    typedef sc::transition< EvX, sc::shallow_history< Idle > > reactions;
-  };
-
-
-int main()
-{
-  InvalidTransitionTest machine;
-  machine.initiate();
-  return 0;
-}

Deleted: boost/trunk/libs/statechart/test/InvalidTransitionTest3.vcproj
===================================================================
--- boost/trunk/libs/statechart/test/InvalidTransitionTest3.vcproj	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InvalidTransitionTest3.vcproj	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,134 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
-	ProjectType="Visual C++"
-	Version="7.10"
-	Name="InvalidTransitionTest3"
-	ProjectGUID="{D9103E3E-640D-4AB7-910C-ACA96709ED0A}"
-	Keyword="Win32Proj">
-	<Platforms>
-		<Platform
-			Name="Win32"/>
-	</Platforms>
-	<Configurations>
-		<Configuration
-			Name="Debug|Win32"
-			OutputDirectory="Debug"
-			IntermediateDirectory="Debug"
-			ConfigurationType="1"
-			CharacterSet="2">
-			<Tool
-				Name="VCCLCompilerTool"
-				Optimization="0"
-				AdditionalIncludeDirectories="..\..\..\"
-				PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
-				MinimalRebuild="TRUE"
-				BasicRuntimeChecks="3"
-				RuntimeLibrary="3"
-				DisableLanguageExtensions="TRUE"
-				TreatWChar_tAsBuiltInType="TRUE"
-				ForceConformanceInForLoopScope="TRUE"
-				RuntimeTypeInfo="TRUE"
-				UsePrecompiledHeader="0"
-				WarningLevel="4"
-				Detect64BitPortabilityProblems="TRUE"
-				DebugInformationFormat="4"/>
-			<Tool
-				Name="VCCustomBuildTool"/>
-			<Tool
-				Name="VCLinkerTool"
-				OutputFile="$(OutDir)/InvalidTransitionTest3.exe"
-				LinkIncremental="2"
-				AdditionalLibraryDirectories="..\..\..\bin\boost\libs\test\build\libboost_test_exec_monitor.lib\vc-7_1\debug\threading-multi"
-				GenerateDebugInformation="TRUE"
-				ProgramDatabaseFile="$(OutDir)/InvalidTransitionTest3.pdb"
-				SubSystem="1"
-				TargetMachine="1"/>
-			<Tool
-				Name="VCMIDLTool"/>
-			<Tool
-				Name="VCPostBuildEventTool"/>
-			<Tool
-				Name="VCPreBuildEventTool"/>
-			<Tool
-				Name="VCPreLinkEventTool"/>
-			<Tool
-				Name="VCResourceCompilerTool"/>
-			<Tool
-				Name="VCWebServiceProxyGeneratorTool"/>
-			<Tool
-				Name="VCXMLDataGeneratorTool"/>
-			<Tool
-				Name="VCWebDeploymentTool"/>
-			<Tool
-				Name="VCManagedWrapperGeneratorTool"/>
-			<Tool
-				Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
-		</Configuration>
-		<Configuration
-			Name="Release|Win32"
-			OutputDirectory="Release"
-			IntermediateDirectory="Release"
-			ConfigurationType="1"
-			CharacterSet="2">
-			<Tool
-				Name="VCCLCompilerTool"
-				AdditionalIncludeDirectories="..\..\..\"
-				PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
-				RuntimeLibrary="2"
-				DisableLanguageExtensions="TRUE"
-				TreatWChar_tAsBuiltInType="TRUE"
-				ForceConformanceInForLoopScope="TRUE"
-				RuntimeTypeInfo="TRUE"
-				UsePrecompiledHeader="0"
-				WarningLevel="4"
-				Detect64BitPortabilityProblems="TRUE"
-				DebugInformationFormat="3"/>
-			<Tool
-				Name="VCCustomBuildTool"/>
-			<Tool
-				Name="VCLinkerTool"
-				OutputFile="$(OutDir)/InvalidTransitionTest3.exe"
-				LinkIncremental="1"
-				AdditionalLibraryDirectories="..\..\..\bin\boost\libs\test\build\libboost_test_exec_monitor.lib\vc-7_1\release\threading-multi"
-				GenerateDebugInformation="TRUE"
-				SubSystem="1"
-				OptimizeReferences="2"
-				EnableCOMDATFolding="2"
-				TargetMachine="1"/>
-			<Tool
-				Name="VCMIDLTool"/>
-			<Tool
-				Name="VCPostBuildEventTool"/>
-			<Tool
-				Name="VCPreBuildEventTool"/>
-			<Tool
-				Name="VCPreLinkEventTool"/>
-			<Tool
-				Name="VCResourceCompilerTool"/>
-			<Tool
-				Name="VCWebServiceProxyGeneratorTool"/>
-			<Tool
-				Name="VCXMLDataGeneratorTool"/>
-			<Tool
-				Name="VCWebDeploymentTool"/>
-			<Tool
-				Name="VCManagedWrapperGeneratorTool"/>
-			<Tool
-				Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
-		</Configuration>
-	</Configurations>
-	<References>
-	</References>
-	<Files>
-		<Filter
-			Name="Source Files"
-			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
-			UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}">
-			<File
-				RelativePath=".\InvalidTransitionTest3.cpp">
-			</File>
-		</Filter>
-	</Files>
-	<Globals>
-	</Globals>
-</VisualStudioProject>

Deleted: boost/trunk/libs/statechart/test/InvalidTransitionTest4.cpp
===================================================================
--- boost/trunk/libs/statechart/test/InvalidTransitionTest4.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InvalidTransitionTest4.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,46 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2004-2005
-// Distributed under the Boost Software License, Version 1.0. (See accompany-
-// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-//////////////////////////////////////////////////////////////////////////////
-
-
-
-#include <boost/statechart/state_machine.hpp>
-#include <boost/statechart/simple_state.hpp>
-#include <boost/statechart/event.hpp>
-#include <boost/statechart/transition.hpp>
-#include <boost/statechart/deep_history.hpp>
-
-
-
-namespace sc = boost::statechart;
-
-
-
-struct EvX : sc::event< EvX > {};
-
-struct Active;
-struct InvalidTransitionTest : sc::state_machine<
-  InvalidTransitionTest, Active > {};
-
-struct Idle0;
-struct Active : sc::simple_state<
-  Active, InvalidTransitionTest, Idle0, sc::has_deep_history > {};
-
-  struct Running0 : sc::simple_state< Running0, Active > {};
-
-  // Invalid transition to deep history from a state residing on the same
-  // level as the history connector.
-  struct Idle0 : sc::simple_state< Idle0, Active >
-  {
-    typedef sc::transition< EvX, sc::deep_history< Running0 > > reactions;
-  };
-
-
-int main()
-{
-  InvalidTransitionTest machine;
-  machine.initiate();
-  return 0;
-}

Deleted: boost/trunk/libs/statechart/test/InvalidTransitionTest4.vcproj
===================================================================
--- boost/trunk/libs/statechart/test/InvalidTransitionTest4.vcproj	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/InvalidTransitionTest4.vcproj	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,134 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
-	ProjectType="Visual C++"
-	Version="7.10"
-	Name="InvalidTransitionTest4"
-	ProjectGUID="{D9103E3E-640D-4AB7-910C-ACA96709ED0A}"
-	Keyword="Win32Proj">
-	<Platforms>
-		<Platform
-			Name="Win32"/>
-	</Platforms>
-	<Configurations>
-		<Configuration
-			Name="Debug|Win32"
-			OutputDirectory="Debug"
-			IntermediateDirectory="Debug"
-			ConfigurationType="1"
-			CharacterSet="2">
-			<Tool
-				Name="VCCLCompilerTool"
-				Optimization="0"
-				AdditionalIncludeDirectories="..\..\..\"
-				PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
-				MinimalRebuild="TRUE"
-				BasicRuntimeChecks="3"
-				RuntimeLibrary="3"
-				DisableLanguageExtensions="TRUE"
-				TreatWChar_tAsBuiltInType="TRUE"
-				ForceConformanceInForLoopScope="TRUE"
-				RuntimeTypeInfo="TRUE"
-				UsePrecompiledHeader="0"
-				WarningLevel="4"
-				Detect64BitPortabilityProblems="TRUE"
-				DebugInformationFormat="4"/>
-			<Tool
-				Name="VCCustomBuildTool"/>
-			<Tool
-				Name="VCLinkerTool"
-				OutputFile="$(OutDir)/InvalidTransitionTest4.exe"
-				LinkIncremental="2"
-				AdditionalLibraryDirectories="..\..\..\bin\boost\libs\test\build\libboost_test_exec_monitor.lib\vc-7_1\debug\threading-multi"
-				GenerateDebugInformation="TRUE"
-				ProgramDatabaseFile="$(OutDir)/InvalidTransitionTest4.pdb"
-				SubSystem="1"
-				TargetMachine="1"/>
-			<Tool
-				Name="VCMIDLTool"/>
-			<Tool
-				Name="VCPostBuildEventTool"/>
-			<Tool
-				Name="VCPreBuildEventTool"/>
-			<Tool
-				Name="VCPreLinkEventTool"/>
-			<Tool
-				Name="VCResourceCompilerTool"/>
-			<Tool
-				Name="VCWebServiceProxyGeneratorTool"/>
-			<Tool
-				Name="VCXMLDataGeneratorTool"/>
-			<Tool
-				Name="VCWebDeploymentTool"/>
-			<Tool
-				Name="VCManagedWrapperGeneratorTool"/>
-			<Tool
-				Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
-		</Configuration>
-		<Configuration
-			Name="Release|Win32"
-			OutputDirectory="Release"
-			IntermediateDirectory="Release"
-			ConfigurationType="1"
-			CharacterSet="2">
-			<Tool
-				Name="VCCLCompilerTool"
-				AdditionalIncludeDirectories="..\..\..\"
-				PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
-				RuntimeLibrary="2"
-				DisableLanguageExtensions="TRUE"
-				TreatWChar_tAsBuiltInType="TRUE"
-				ForceConformanceInForLoopScope="TRUE"
-				RuntimeTypeInfo="TRUE"
-				UsePrecompiledHeader="0"
-				WarningLevel="4"
-				Detect64BitPortabilityProblems="TRUE"
-				DebugInformationFormat="3"/>
-			<Tool
-				Name="VCCustomBuildTool"/>
-			<Tool
-				Name="VCLinkerTool"
-				OutputFile="$(OutDir)/InvalidTransitionTest4.exe"
-				LinkIncremental="1"
-				AdditionalLibraryDirectories="..\..\..\bin\boost\libs\test\build\libboost_test_exec_monitor.lib\vc-7_1\release\threading-multi"
-				GenerateDebugInformation="TRUE"
-				SubSystem="1"
-				OptimizeReferences="2"
-				EnableCOMDATFolding="2"
-				TargetMachine="1"/>
-			<Tool
-				Name="VCMIDLTool"/>
-			<Tool
-				Name="VCPostBuildEventTool"/>
-			<Tool
-				Name="VCPreBuildEventTool"/>
-			<Tool
-				Name="VCPreLinkEventTool"/>
-			<Tool
-				Name="VCResourceCompilerTool"/>
-			<Tool
-				Name="VCWebServiceProxyGeneratorTool"/>
-			<Tool
-				Name="VCXMLDataGeneratorTool"/>
-			<Tool
-				Name="VCWebDeploymentTool"/>
-			<Tool
-				Name="VCManagedWrapperGeneratorTool"/>
-			<Tool
-				Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
-		</Configuration>
-	</Configurations>
-	<References>
-	</References>
-	<Files>
-		<Filter
-			Name="Source Files"
-			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
-			UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}">
-			<File
-				RelativePath=".\InvalidTransitionTest4.cpp">
-			</File>
-		</Filter>
-	</Files>
-	<Globals>
-	</Globals>
-</VisualStudioProject>

Deleted: boost/trunk/libs/statechart/test/Jamfile
===================================================================
--- boost/trunk/libs/statechart/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,167 +0,0 @@
-##############################################################################
-# (c) Copyright Andreas Huber Doenni 2004-2006
-# Distributed under the Boost Software License, Version 1.0. (See accompany-
-# ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-##############################################################################
-
-subproject libs/statechart/test ;
-
-import testing ; # bring in rules for testing
-
-DEPENDS all : test ; # Make tests run by default.
-
-template statechart-common-options : : <include>$(BOOST_ROOT) ;
-
-local test_monitor = <lib>../../../libs/test/build/boost_test_exec_monitor ;
-# Some platforms have either problems with the automatic detection of the
-# threading mode (e.g. vc-7_1 & gcc >= 3.4.0) or don't support single-
-# threaded mode (e.g. vc-8_0). We therefore manually turn MT off here
-local st-requirements = <threading>single <define>BOOST_DISABLE_THREADS ;
-local dll = <define>BOOST_STATECHART_TEST_DYNAMIC_LINK ;
-local dll-export = $(dll) <define>BOOST_STATECHART_TEST_DLL_EXPORT ;
-
-local normal = ;
-local native = <define>BOOST_STATECHART_USE_NATIVE_RTTI ;
-local relaxed = <define>BOOST_STATECHART_RELAX_TRANSITION_CONTEXT ;
-local both = $(native) $(relaxed) ;
-
-rule statechart-st-lib ( name : cpp-sources + : requirements * )
-{
-  lib $(name)
-    : $(cpp-sources).cpp <template>statechart-common-options
-    : $(st-requirements) $(requirements) ;
-  
-  return <lib>$(name) ;
-}
-
-rule statechart-st-dll ( name : cpp-sources + : requirements * )
-{
-  dll $(name)
-    : $(cpp-sources).cpp <template>statechart-common-options
-    : $(st-requirements) $(dll-export) $(requirements) ;
-  
-  return <dll>$(name) ;
-}
-
-rule statechart-run ( name : sources + : requirements * )
-{
-  return [ run $(sources) $(test_monitor) <template>statechart-common-options
-             : : : $(requirements) : $(name) ] ;
-}
-
-rule statechart-st-run ( name : sources + : requirements * )
-{
-  return [ statechart-run $(name)
-             : $(sources) : $(st-requirements) $(requirements) ] ;
-}
-
-rule statechart-st-run-variants ( cpp-source )
-{
-  local result ;
-
-  result += [ statechart-st-run $(cpp-source)Normal
-                : $(cpp-source).cpp : $(normal) ] ;
-  result += [ statechart-st-run $(cpp-source)Native
-                : $(cpp-source).cpp : $(native) ] ;
-  result += [ statechart-st-run $(cpp-source)Relaxed
-                : $(cpp-source).cpp : $(relaxed) ] ;
-  result += [ statechart-st-run $(cpp-source)Both
-                : $(cpp-source).cpp : $(both) ] ;
-
-  return $(result) ;
-}
-
-rule statechart-compile-fail ( name : cpp-sources + : requirements * )
-{
-  return
-    [ compile-fail $(cpp-sources).cpp <template>statechart-common-options
-        : $(requirements) : $(name) ] ;
-}
-
-rule statechart-compile-fail-variants ( cpp-source )
-{
-  local result ;
-
-  result += [ statechart-compile-fail $(cpp-source)Normal
-                : $(cpp-source) : $(normal) ] ;
-  result += [ statechart-compile-fail $(cpp-source)Native
-                : $(cpp-source) : $(native) ] ;
-  result += [ statechart-compile-fail $(cpp-source)Relaxed
-                : $(cpp-source) : $(relaxed) ] ;
-  result += [ statechart-compile-fail $(cpp-source)Both
-                : $(cpp-source) : $(both) ] ;
-
-  return $(result) ;
-}
-
-rule statechart-st-lib-run (
-  name : exe-cpp-sources + : lib-cpp-sources + : requirements * )
-{
-  return [ statechart-st-run $(name)
-             : $(exe-cpp-sources).cpp
-               [ statechart-st-lib $(name)Lib
-                   : $(lib-cpp-sources) : $(requirements) ]
-             : $(requirements) ] ;
-}
-
-rule statechart-st-dll-run (
-  name : exe-cpp-sources + : dll-cpp-sources + : requirements * )
-{
-  return [ statechart-st-run $(name)
-             : $(exe-cpp-sources).cpp
-               [ statechart-st-dll $(name)Dll
-                   : $(dll-cpp-sources) : $(requirements) ]
-             : $(dll) $(requirements) ] ;
-}
-
-rule statechart-st-compile-example ( name : directory : cpp-sources + )
-{
-  return [ link ../example/$(directory)/$(cpp-sources).cpp
-               <template>statechart-common-options
-             : $(st-requirements) : $(name)Example ] ;
-}
-
-test-suite statechart
-  : [ statechart-compile-fail-variants InvalidChartTest1 ]
-    [ statechart-compile-fail-variants InvalidChartTest2 ]
-    [ statechart-compile-fail-variants InvalidChartTest3 ]
-    [ statechart-st-run-variants TransitionTest ]
-    [ statechart-compile-fail-variants InvalidTransitionTest1 ]
-    [ statechart-compile-fail-variants InvalidTransitionTest2 ]
-    [ statechart-compile-fail-variants InvalidTransitionTest3 ]
-    [ statechart-compile-fail-variants InvalidTransitionTest4 ]
-    [ statechart-st-run-variants InStateReactionTest ]
-    [ statechart-st-run-variants TerminationTest ]
-    [ statechart-st-run-variants DeferralTest ]
-    [ statechart-st-run-variants CustomReactionTest ]
-    [ statechart-compile-fail-variants InvalidResultAssignTest ]
-    [ statechart-compile-fail-variants InvalidResultDefCtorTest ]
-    [ statechart-st-run-variants InvalidResultCopyTest ]
-    [ statechart-st-run-variants UnconsumedResultTest ]
-    [ statechart-st-run-variants HistoryTest ]
-    [ statechart-compile-fail-variants InconsistentHistoryTest1 ]
-    [ statechart-compile-fail-variants InconsistentHistoryTest2 ]
-    [ statechart-compile-fail-variants InconsistentHistoryTest3 ]
-    [ statechart-compile-fail-variants InconsistentHistoryTest4 ]
-    [ statechart-compile-fail-variants InconsistentHistoryTest5 ]
-    [ statechart-compile-fail-variants InconsistentHistoryTest6 ]
-    [ statechart-compile-fail-variants InconsistentHistoryTest7 ]
-    [ statechart-compile-fail-variants InconsistentHistoryTest8 ]
-    [ statechart-compile-fail-variants UnsupportedDeepHistoryTest ]
-    [ statechart-st-run-variants StateCastTest ]
-    [ statechart-st-run-variants TypeInfoTest ]
-    [ statechart-st-run-variants StateIterationTest ]
-    [ statechart-st-run-variants FifoSchedulerTest ] 
-    [ statechart-st-lib-run LibTestNormal : TuTestMain : TuTest : $(normal) ]
-    [ statechart-st-lib-run LibTestNative : TuTestMain : TuTest : $(native) ]
-    [ statechart-st-dll-run DllTestNormal : TuTestMain : TuTest : $(normal) ]
-    [ statechart-st-dll-run DllTestNative : TuTestMain : TuTest : $(native) ]
-    [ statechart-st-compile-example BitMachine : BitMachine : BitMachine ]
-    [ statechart-st-compile-example Camera
-        : Camera : Camera Configuring Main Shooting ]
-    [ statechart-st-compile-example Handcrafted : Handcrafted : Handcrafted ]
-    [ statechart-st-compile-example Keyboard : Keyboard : Keyboard : ]
-    [ statechart-st-compile-example Performance : Performance : Performance ]
-    [ statechart-st-compile-example PingPong : PingPong : PingPong ]
-    [ statechart-st-compile-example StopWatch : StopWatch : StopWatch ]
-    [ statechart-st-compile-example StopWatch2 : StopWatch : StopWatch2 ] ;

Modified: boost/trunk/libs/statechart/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/statechart/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,12 +1,13 @@
 ##############################################################################
-# (c) Copyright Andreas Huber Doenni 2005-2006
+# Copyright 2005-2006 Andreas Huber Doenni
 # Distributed under the Boost Software License, Version 1.0. (See accompany-
 # ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 ##############################################################################
 
 project libs/statechart/test ;
 
-local test_monitor = ../../../libs/test/build//boost_test_exec_monitor ;
+local test_monitor =
+  ../../../libs/test/build//boost_test_exec_monitor/<link>static ;
 # Some platforms have either problems with the automatic detection of the
 # threading mode (e.g. vc-7_1 & gcc >= 3.4.0) or don't support single-
 # threaded mode (e.g. vc-8_0). We therefore manually turn MT off here
@@ -25,9 +26,7 @@
 
   for local cpp-source in $(cpp-sources)
   {
-    obj $(name)$(cpp-source)
-      : $(cpp-source).cpp
-      : <threading>single:$(st-requirements) $(requirements) ;
+    obj $(name)$(cpp-source) : $(cpp-source).cpp : $(requirements) ;
     objs += $(name)$(cpp-source) ;
   }
 
@@ -39,22 +38,21 @@
   lib $(name)
     : [ independent-obj-build $(name)
           : $(cpp-sources)
-          : <threading>single <link>shared:$(dll-export) $(requirements) ] ;
+          : <threading>single $(st-requirements)
+            <link>shared:$(dll-export) $(requirements) ] ;
   
   return $(name) ;
 }
 
 rule statechart-run ( name : sources + : requirements * )
 {
-  return [ run $(sources) $(test_monitor) : :
-             : <threading>single:$(st-requirements) $(requirements)
-             : $(name) ] ;
+  return [ run $(sources) $(test_monitor) : : : $(requirements) : $(name) ] ;
 }
 
 rule statechart-st-run ( name : sources + : requirements * )
 {
-  return [ statechart-run $(name)
-             : $(sources) : <threading>single $(requirements) ] ;
+  return [ statechart-run $(name) : $(sources)
+             : <threading>single $(st-requirements) $(requirements) ] ;
 }
 
 rule statechart-st-run-variants ( cpp-source )
@@ -117,8 +115,6 @@
     [ statechart-st-run-variants TransitionTest ]
     [ statechart-compile-fail-variants InvalidTransitionTest1 ]
     [ statechart-compile-fail-variants InvalidTransitionTest2 ]
-    [ statechart-compile-fail-variants InvalidTransitionTest3 ]
-    [ statechart-compile-fail-variants InvalidTransitionTest4 ]
     [ statechart-st-run-variants InStateReactionTest ]
     [ statechart-st-run-variants TerminationTest ]
     [ statechart-st-run-variants DeferralTest ]
@@ -136,7 +132,7 @@
     [ statechart-compile-fail-variants InconsistentHistoryTest6 ]
     [ statechart-compile-fail-variants InconsistentHistoryTest7 ]
     [ statechart-compile-fail-variants InconsistentHistoryTest8 ]
-    [ statechart-compile-fail-variants UnsupportedDeepHistoryTest ]
+    [ statechart-compile-fail-variants UnsuppDeepHistoryTest ]
     [ statechart-st-run-variants StateCastTest ]
     [ statechart-st-run-variants TypeInfoTest ]
     [ statechart-st-run-variants StateIterationTest ]

Modified: boost/trunk/libs/statechart/test/OuterOrthogonal.hpp
===================================================================
--- boost/trunk/libs/statechart/test/OuterOrthogonal.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/OuterOrthogonal.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_TEST_OUTER_ORTHOGONAL_HPP_INCLUDED
 #define BOOST_STATECHART_TEST_OUTER_ORTHOGONAL_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2004-2005
+// Copyright 2004-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Deleted: boost/trunk/libs/statechart/test/RunTests.bat
===================================================================
--- boost/trunk/libs/statechart/test/RunTests.bat	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/RunTests.bat	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +0,0 @@
-bjam "-sTOOLS=mingw vc-7_1" "-sMINGW_ROOT_DIRECTORY=C:\ProgramFiles\MinGW3.2.0" "-sINTEL_PATH=C:\Program Files\Intel\Compiler\C++\9.0\IA32" "-sINTEL_BASE_MSVC_TOOLSET=vc-7_1" %1 %2 %3 %4 >log.txt 2>&1
\ No newline at end of file

Modified: boost/trunk/libs/statechart/test/StateCastTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/StateCastTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/StateCastTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005-2006
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/StateIterationTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/StateIterationTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/StateIterationTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/TerminationTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/TerminationTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/TerminationTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/ThrowingBoostAssert.hpp
===================================================================
--- boost/trunk/libs/statechart/test/ThrowingBoostAssert.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/ThrowingBoostAssert.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_TEST_THROWING_BOOST_ASSERT_HPP_INCLUDED
 #define BOOST_STATECHART_TEST_THROWING_BOOST_ASSERT_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/TransitionTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/TransitionTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/TransitionTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2004-2006
+// Copyright 2004-2007 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////
@@ -75,29 +75,28 @@
 std::string ThrowDescription()
 {
   static const std::string throwing = "Throwing exception in ";
-  static ActionDescriptionSequence dummy;
-  dummy.clear();
-  pAction( dummy );
-  return throwing + dummy.front()();
+  ActionDescriptionSequence sequence;
+  pAction( sequence );
+  return throwing + sequence.front()();
 }
 
 
 template< class State >
 void Entry( ActionDescriptionSequence & sequence )
 {
-  sequence.push_back( EntryDescription< State > );
+  sequence.push_back( &::EntryDescription< State > );
 }
 
 template< class State >
 void ExitFn( ActionDescriptionSequence & sequence )
 {
-  sequence.push_back( ExitFnDescription< State > );
+  sequence.push_back( &::ExitFnDescription< State > );
 }
 
 template< class State >
 void Dtor( ActionDescriptionSequence & sequence )
 {
-  sequence.push_back( DtorDescription< State > );
+  sequence.push_back( &::DtorDescription< State > );
 }
 
 template< class State >
@@ -110,13 +109,13 @@
 template< class Context, class Event >
 void Trans( ActionDescriptionSequence & sequence )
 {
-  sequence.push_back( TransDescription< Context, Event > );
+  sequence.push_back( &::TransDescription< Context, Event > );
 }
 
 template< ActionPtr pAction >
 void Throw( ActionDescriptionSequence & sequence )
 {
-  sequence.push_back( ThrowDescription< pAction > );
+  sequence.push_back( &::ThrowDescription< pAction > );
 }
 
 const int arrayLength = 30;

Modified: boost/trunk/libs/statechart/test/TuTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/TuTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/TuTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/TuTest.hpp
===================================================================
--- boost/trunk/libs/statechart/test/TuTest.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/TuTest.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 #ifndef BOOST_STATECHART_TEST_TU_TEST_HPP_INCLUDED
 #define BOOST_STATECHART_TEST_TU_TEST_HPP_INCLUDED
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/TuTestMain.cpp
===================================================================
--- boost/trunk/libs/statechart/test/TuTestMain.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/TuTestMain.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005-2006
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/TypeInfoTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/TypeInfoTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/TypeInfoTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/statechart/test/UnconsumedResultTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/UnconsumedResultTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/UnconsumedResultTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 //////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005-2006
+// Copyright 2005-2006 Andreas Huber Doenni
 // Distributed under the Boost Software License, Version 1.0. (See accompany-
 // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //////////////////////////////////////////////////////////////////////////////

Copied: boost/trunk/libs/statechart/test/UnsuppDeepHistoryTest.cpp (from rev 14034, boost/branches/upstream/current/libs/statechart/test/UnsuppDeepHistoryTest.cpp)

Copied: boost/trunk/libs/statechart/test/UnsuppDeepHistoryTest.vcproj (from rev 14034, boost/branches/upstream/current/libs/statechart/test/UnsuppDeepHistoryTest.vcproj)

Deleted: boost/trunk/libs/statechart/test/UnsupportedDeepHistoryTest.cpp
===================================================================
--- boost/trunk/libs/statechart/test/UnsupportedDeepHistoryTest.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/UnsupportedDeepHistoryTest.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,43 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-// (c) Copyright Andreas Huber Doenni 2005
-// Distributed under the Boost Software License, Version 1.0. (See accompany-
-// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-//////////////////////////////////////////////////////////////////////////////
-
-
-
-#include <boost/statechart/state_machine.hpp>
-#include <boost/statechart/simple_state.hpp>
-#include <boost/statechart/deep_history.hpp>
-
-#include <boost/mpl/list.hpp>
-
-
-
-namespace sc = boost::statechart;
-namespace mpl = boost::mpl;
-
-
-
-struct A;
-struct UnsupportedDeepHistoryTest : sc::state_machine<
-  UnsupportedDeepHistoryTest, A > {};
-
-struct B;
-struct A : sc::simple_state<
-  A, UnsupportedDeepHistoryTest, B, sc::has_deep_history > {};
-
-  struct C;
-  struct D;
-  struct B : sc::simple_state< B, A, mpl::list< C, D > > {};
-
-    struct C : sc::simple_state< C, B::orthogonal< 0 > > {};
-    struct D : sc::simple_state< D, B::orthogonal< 1 > > {};
-
-
-int main()
-{
-  UnsupportedDeepHistoryTest machine;
-  machine.initiate();
-  return 0;
-}

Deleted: boost/trunk/libs/statechart/test/UnsupportedDeepHistoryTest.vcproj
===================================================================
--- boost/trunk/libs/statechart/test/UnsupportedDeepHistoryTest.vcproj	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/statechart/test/UnsupportedDeepHistoryTest.vcproj	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,134 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
-	ProjectType="Visual C++"
-	Version="7.10"
-	Name="UnsupportedDeepHistoryTest"
-	ProjectGUID="{D9103E3E-640D-4AB7-910C-ACA96709ED0A}"
-	Keyword="Win32Proj">
-	<Platforms>
-		<Platform
-			Name="Win32"/>
-	</Platforms>
-	<Configurations>
-		<Configuration
-			Name="Debug|Win32"
-			OutputDirectory="Debug"
-			IntermediateDirectory="Debug"
-			ConfigurationType="1"
-			CharacterSet="2">
-			<Tool
-				Name="VCCLCompilerTool"
-				Optimization="0"
-				AdditionalIncludeDirectories="..\..\..\"
-				PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
-				MinimalRebuild="TRUE"
-				BasicRuntimeChecks="3"
-				RuntimeLibrary="3"
-				DisableLanguageExtensions="TRUE"
-				TreatWChar_tAsBuiltInType="TRUE"
-				ForceConformanceInForLoopScope="TRUE"
-				RuntimeTypeInfo="TRUE"
-				UsePrecompiledHeader="0"
-				WarningLevel="4"
-				Detect64BitPortabilityProblems="TRUE"
-				DebugInformationFormat="4"/>
-			<Tool
-				Name="VCCustomBuildTool"/>
-			<Tool
-				Name="VCLinkerTool"
-				OutputFile="$(OutDir)/UnsupportedDeepHistoryTest.exe"
-				LinkIncremental="2"
-				AdditionalLibraryDirectories="..\..\..\bin\boost\libs\test\build\libboost_test_exec_monitor.lib\vc-7_1\debug\threading-multi"
-				GenerateDebugInformation="TRUE"
-				ProgramDatabaseFile="$(OutDir)/UnsupportedDeepHistoryTest.pdb"
-				SubSystem="1"
-				TargetMachine="1"/>
-			<Tool
-				Name="VCMIDLTool"/>
-			<Tool
-				Name="VCPostBuildEventTool"/>
-			<Tool
-				Name="VCPreBuildEventTool"/>
-			<Tool
-				Name="VCPreLinkEventTool"/>
-			<Tool
-				Name="VCResourceCompilerTool"/>
-			<Tool
-				Name="VCWebServiceProxyGeneratorTool"/>
-			<Tool
-				Name="VCXMLDataGeneratorTool"/>
-			<Tool
-				Name="VCWebDeploymentTool"/>
-			<Tool
-				Name="VCManagedWrapperGeneratorTool"/>
-			<Tool
-				Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
-		</Configuration>
-		<Configuration
-			Name="Release|Win32"
-			OutputDirectory="Release"
-			IntermediateDirectory="Release"
-			ConfigurationType="1"
-			CharacterSet="2">
-			<Tool
-				Name="VCCLCompilerTool"
-				AdditionalIncludeDirectories="..\..\..\"
-				PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
-				RuntimeLibrary="2"
-				DisableLanguageExtensions="TRUE"
-				TreatWChar_tAsBuiltInType="TRUE"
-				ForceConformanceInForLoopScope="TRUE"
-				RuntimeTypeInfo="TRUE"
-				UsePrecompiledHeader="0"
-				WarningLevel="4"
-				Detect64BitPortabilityProblems="TRUE"
-				DebugInformationFormat="3"/>
-			<Tool
-				Name="VCCustomBuildTool"/>
-			<Tool
-				Name="VCLinkerTool"
-				OutputFile="$(OutDir)/UnsupportedDeepHistoryTest.exe"
-				LinkIncremental="1"
-				AdditionalLibraryDirectories="..\..\..\bin\boost\libs\test\build\libboost_test_exec_monitor.lib\vc-7_1\release\threading-multi"
-				GenerateDebugInformation="TRUE"
-				SubSystem="1"
-				OptimizeReferences="2"
-				EnableCOMDATFolding="2"
-				TargetMachine="1"/>
-			<Tool
-				Name="VCMIDLTool"/>
-			<Tool
-				Name="VCPostBuildEventTool"/>
-			<Tool
-				Name="VCPreBuildEventTool"/>
-			<Tool
-				Name="VCPreLinkEventTool"/>
-			<Tool
-				Name="VCResourceCompilerTool"/>
-			<Tool
-				Name="VCWebServiceProxyGeneratorTool"/>
-			<Tool
-				Name="VCXMLDataGeneratorTool"/>
-			<Tool
-				Name="VCWebDeploymentTool"/>
-			<Tool
-				Name="VCManagedWrapperGeneratorTool"/>
-			<Tool
-				Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
-		</Configuration>
-	</Configurations>
-	<References>
-	</References>
-	<Files>
-		<Filter
-			Name="Source Files"
-			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
-			UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}">
-			<File
-				RelativePath=".\UnsupportedDeepHistoryTest.cpp">
-			</File>
-		</Filter>
-	</Files>
-	<Globals>
-	</Globals>
-</VisualStudioProject>

Deleted: boost/trunk/libs/static_assert/Jamfile
===================================================================
--- boost/trunk/libs/static_assert/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/static_assert/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,29 +0,0 @@
-# copyright John Maddock 2003
-
-subproject libs/static_assert ;
-# bring in the rules for testing
-import testing ;
-
-test-suite static_assert :
-   [ run static_assert_test.cpp ]
-#  [ run static_assert_example_1.cpp ]
-   [ run static_assert_example_2.cpp ]
-   [ run static_assert_example_3.cpp ]
-   [ compile-fail static_assert_test_fail_1.cpp ]
-   [ compile-fail static_assert_test_fail_2.cpp ]
-   [ compile-fail static_assert_test_fail_3.cpp ]
-   [ compile-fail static_assert_test_fail_4.cpp ]
-   [ compile-fail static_assert_test_fail_5.cpp ]
-   [ compile-fail static_assert_test_fail_6.cpp ]
-   [ compile-fail static_assert_test_fail_7.cpp ]
-   [ compile-fail static_assert_test_fail_8.cpp ]
-   [ compile-fail static_assert_test_fail_9.cpp ]
-   [ compile-fail static_assert_test_fail_10.cpp ]
-;
-
-
-
-
-
-
-

Modified: boost/trunk/libs/static_assert/Jamfile.v2
===================================================================
--- boost/trunk/libs/static_assert/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/static_assert/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,7 @@
 # copyright John Maddock 2003
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 # bring in the rules for testing
 import testing ;
@@ -25,3 +28,4 @@
 
 
 
+

Modified: boost/trunk/libs/static_assert/doc/static_assert.qbk
===================================================================
--- boost/trunk/libs/static_assert/doc/static_assert.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/static_assert/doc/static_assert.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -12,7 +12,7 @@
     [category template]
     [category testing]
     [category generic]
-    [last-revision $Date: 2005/04/17 10:45:13 $]
+    [last-revision $Date: 2006/08/11 18:14:12 $]
 ]
 
 [section:intro Overview and Tutorial]
@@ -49,11 +49,12 @@
 
    #include <climits>
    #include <cwchar>
+   #include <limits>
    #include <boost/static_assert.hpp>
 
    namespace my_conditions {
 
-      BOOST_STATIC_ASSERT(sizeof(int) * CHAR_BIT >= 32);
+      BOOST_STATIC_ASSERT(std::numeric_limits<int>::digits >= 32);
       BOOST_STATIC_ASSERT(WCHAR_MIN >= 0);
 
    } // namespace my_conditions
@@ -61,7 +62,7 @@
 The use of the namespace my_conditions here requires some comment. 
 The macro `BOOST_STATIC_ASSERT` works by generating an typedef declaration, 
 and since the typedef must have a name, the macro generates one automatically by 
-mangling a stub name with the value of __LINE__. When `BOOST_STATIC_ASSERT` is 
+mangling a stub name with the value of `__LINE__`. When `BOOST_STATIC_ASSERT` is 
 used at either class or function scope then each use of `BOOST_STATIC_ASSERT` 
 is guaranteed to produce a name unique to that scope (provided you only use 
 the macro once on each line). However when used in a header at namespace 
@@ -128,8 +129,8 @@
    class myclass
    {
    private:
-      BOOST_STATIC_ASSERT(sizeof(UnsignedInt) * CHAR_BIT >= 16);
-      BOOST_STATIC_ASSERT(std::numeric_limits<UnsignedInt>::is_specialized
+      BOOST_STATIC_ASSERT((std::numeric_limits<UnsignedInt>::digits >= 16)
+                           && std::numeric_limits<UnsignedInt>::is_specialized
                            && std::numeric_limits<UnsignedInt>::is_integer
                            && !std::numeric_limits<UnsignedInt>::is_signed);
    public:
@@ -216,3 +217,5 @@
 ]
 
 [endsect]
+
+

Modified: boost/trunk/libs/static_assert/index.html
===================================================================
--- boost/trunk/libs/static_assert/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/static_assert/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,6 +9,10 @@
     or view the online version at 
     <a href="http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_staticassert.html">
     http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_staticassert.html</a>
+      <P>Copyright&nbsp;John Maddock 2006</P>
+      <P>Distributed under the Boost Software License, Version 1.0. (See accompanying file <A href="../../LICENSE_1_0.txt">
+            LICENSE_1_0.txt</A> or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</A>).</P>
   </body>
 </html>
 
+

Modified: boost/trunk/libs/static_assert/static_assert.htm
===================================================================
--- boost/trunk/libs/static_assert/static_assert.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/static_assert/static_assert.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,6 +9,10 @@
     or view the online version at 
     <a href="http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_staticassert.html">
     http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_staticassert.html</a>
+      <P>Copyright&nbsp;John Maddock 2006</P>
+      <P>Distributed under the Boost Software License, Version 1.0. (See accompanying file <A href="../../LICENSE_1_0.txt">
+            LICENSE_1_0.txt</A> or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</A>).</P>
   </body>
 </html>
 
+

Modified: boost/trunk/libs/static_assert/static_assert_example_1.cpp
===================================================================
--- boost/trunk/libs/static_assert/static_assert_example_1.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/static_assert/static_assert_example_1.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,6 +7,7 @@
 
 #include <climits>
 #include <cwchar>
+#include <limits>
 #include <boost/static_assert.hpp>
 
 #if !defined(WCHAR_MIN)
@@ -16,7 +17,7 @@
 namespace boost{
 
 namespace my_conditions {
-BOOST_STATIC_ASSERT(sizeof(int) * CHAR_BIT >= 32);
+BOOST_STATIC_ASSERT(std::numeric_limits<int>::digits >= 32);
 BOOST_STATIC_ASSERT(WCHAR_MIN >= 0);
 
 } // namespace my_conditions
@@ -30,3 +31,4 @@
 
 
 
+

Modified: boost/trunk/libs/static_assert/static_assert_example_3.cpp
===================================================================
--- boost/trunk/libs/static_assert/static_assert_example_3.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/static_assert/static_assert_example_3.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,8 +13,8 @@
 class myclass
 {
 private:
-   BOOST_STATIC_ASSERT(sizeof(UnsignedInt) * CHAR_BIT >= 16);
-   BOOST_STATIC_ASSERT(std::numeric_limits<UnsignedInt>::is_specialized
+   BOOST_STATIC_ASSERT((std::numeric_limits<UnsignedInt>::digits >= 16)
+                        && std::numeric_limits<UnsignedInt>::is_specialized
                         && std::numeric_limits<UnsignedInt>::is_integer
                         && !std::numeric_limits<UnsignedInt>::is_signed);
 public:
@@ -30,3 +30,4 @@
    return 0;
 }
 
+

Deleted: boost/trunk/libs/test/build/.cvsignore
===================================================================
--- boost/trunk/libs/test/build/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/build/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +0,0 @@
-bin

Deleted: boost/trunk/libs/test/build/Jamfile
===================================================================
--- boost/trunk/libs/test/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,123 +0,0 @@
-#  (C) Copyright Gennadiy Rozental 2001-2004.
-#  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)
-#
-#  See http://www.boost.org/libs/test for the library home page.
-
-subproject libs/test/build ;
-
-PRG_EXEC_MON_SOURCES =
-  execution_monitor
-  cpp_main
-  ;
-
-TEST_EXEC_MON_SOURCES =
-  compiler_log_formatter
-  execution_monitor
-  framework
-  plain_report_formatter
-  progress_monitor
-  results_collector
-  results_reporter
-  test_main
-  test_tools
-  unit_test_log
-  unit_test_main
-  unit_test_monitor
-  unit_test_parameters
-  unit_test_suite
-  xml_log_formatter
-  xml_report_formatter
-  ;
-
-UTF_SOURCES =
-  compiler_log_formatter
-  exception_safety
-  execution_monitor
-  framework
-  interaction_based
-  logged_expectations
-  plain_report_formatter
-  progress_monitor
-  results_collector
-  results_reporter
-  test_tools
-  unit_test_log
-  unit_test_main
-  unit_test_monitor
-  unit_test_parameters
-  unit_test_suite
-  xml_log_formatter
-  xml_report_formatter
-  ;
-
-    
-
-template boost_test_dll
-     ## sources ##
-     : 
-     ## requirements ##
-     : <borland><*><cxxflags>-w-8080
-      # the "common-variant-tag" rule ensures that the library will
-      # be named according to the rules used by the install
-      # and auto-link features:
-      common-variant-tag 
-      # tell our source that we're building (and maybe using) dll's:
-      <define>BOOST_TEST_DYN_LINK=1
-      # set include path for Boost headers:
-      <sysinclude>$(BOOST_ROOT)
-     ## default build ##
-     : debug release
-     ;
-
-template boost_test_lib 
-     ## sources ##
-     : 
-     ## requirements ##
-     : <sysinclude>$(BOOST_ROOT) <borland><*><cxxflags>-w-8080 
-       common-variant-tag       
-     ## default build ##
-     : debug release <runtime-link>static/dynamic
-     ;
-
-lib boost_prg_exec_monitor    : <template>boost_test_lib
-                                ../src/$(PRG_EXEC_MON_SOURCES).cpp ;
-
-lib boost_test_exec_monitor   : <template>boost_test_lib
-                                ../src/$(TEST_EXEC_MON_SOURCES).cpp ; 
-
-lib boost_unit_test_framework : <template>boost_test_lib
-                                ../src/$(UTF_SOURCES).cpp ; 
-
-dll boost_unit_test_framework : <template>boost_test_dll
-                                ../src/$(UTF_SOURCES).cpp ;
-
-dll boost_prg_exec_monitor    : <template>boost_test_dll
-                                ../src/$(PRG_EXEC_MON_SOURCES).cpp ;
-
-install test lib
-    :
-        <dll>boost_prg_exec_monitor
-        <dll>boost_unit_test_framework
-        <lib>boost_prg_exec_monitor
-        <lib>boost_test_exec_monitor
-        <lib>boost_unit_test_framework
-    ;
-
-stage stage/lib 
-    : 
-        <dll>boost_prg_exec_monitor
-        <dll>boost_unit_test_framework
-        <lib>boost_prg_exec_monitor
-        <lib>boost_test_exec_monitor
-        <lib>boost_unit_test_framework
-
-    :
-        <locate>$(BOOST_ROOT)
-        common-stage-tag
-        <tag><postfix>-$(version-tag)
-        <target>stage
-        <target>all
-    :
-        debug release
-    ;

Modified: boost/trunk/libs/test/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/test/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,10 +6,17 @@
 
 project boost/test 
     : source-location ../src
-    : requirements <define>BOOST_TEST_NO_AUTO_LINK=1
-                   <os>NT:<link>static
+    : requirements <link>shared:<define>BOOST_TEST_DYN_LINK=1
                    <toolset>msvc:<asynch-exceptions>on
                    <toolset>borland:<cxxflags>-w-8080
+		   # Disable Warning about boost::noncopyable not being exported
+		   <link>shared,<toolset>msvc:<cxxflags>-wd4275
+    : usage-requirements 
+                   <define>BOOST_TEST_NO_AUTO_LINK=1
+                   <link>shared:<define>BOOST_TEST_DYN_LINK=1
+    
+                   # Disable Warning about boost::noncopyable not being exported
+                   <link>shared,<toolset>msvc:<cxxflags>-wd4275
     ;
 
 PRG_EXEC_MON_SOURCES =
@@ -59,9 +66,9 @@
 
 lib boost_prg_exec_monitor : $(PRG_EXEC_MON_SOURCES).cpp ;
 
-lib boost_test_exec_monitor : $(TEST_EXEC_MON_SOURCES).cpp ;
+lib boost_test_exec_monitor : $(TEST_EXEC_MON_SOURCES).cpp : <link>static ;
 
-lib boost_unit_test_framework : $(UTF_SOURCES).cpp ;
+lib boost_unit_test_framework : $(UTF_SOURCES).cpp : <toolset>msvc-6.5:<link>static ;
      
 
 alias minimal : : : :

Deleted: boost/trunk/libs/test/build/msvc71_proj/.cvsignore
===================================================================
--- boost/trunk/libs/test/build/msvc71_proj/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/build/msvc71_proj/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +0,0 @@
-*.ncb
-*.suo
-debug
-release
-pattern.*
-*.rsp

Deleted: boost/trunk/libs/test/example/.cvsignore
===================================================================
--- boost/trunk/libs/test/example/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/example/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +0,0 @@
-bin

Deleted: boost/trunk/libs/test/example/Jamfile
===================================================================
--- boost/trunk/libs/test/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,60 +0,0 @@
-#  (C) Copyright Gennadiy Rozental 2001-2006.
-#  Use, modification, and distribution are subject to the 
-#  Boost Software License, Version 1.0. (See accompanying file 
-#  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-#
-#  See http://www.boost.org/libs/test for the library home page.
-
-subproject libs/test/example ;
-
-# bring in the rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-rule boost-test-example ( example-name : test-rule : lib-name ? : source_files * : use-dll ? )
-{
-   source_files ?= $(example-name).cpp ;
-   local library = [ cond $(use-dll) : <dll>../build/$(lib-name) : <lib>../build/$(lib-name) ] ;
-
-   return [ $(test-rule) $(source_files) [ cond $(lib-name) : $(library) ]
-            : #args
-            : #input-files
-            : #requirements
-              <stlport-iostream>on
-              <borland><*><cxxflags>-w-8080
-              [ cond $(use-dll) : <define>BOOST_TEST_DYN_LINK=1 ]
-            : $(example-name)
-          ] ;
-}
-
-test-suite "boost_test_examples"
-: [ boost-test-example exec_mon_example     : run       : boost_prg_exec_monitor    ]
-  [ boost-test-example prg_exec_example     : run       : boost_prg_exec_monitor    ]
-
-  [ boost-test-example test_case_template_example : run : boost_unit_test_framework ]
-
-  [ boost-test-example unit_test_example_01 : run-fail ]
-  [ boost-test-example unit_test_example_02 : run       : boost_unit_test_framework ]
-  [ boost-test-example unit_test_example_03 : run       : boost_unit_test_framework ]
-  [ boost-test-example unit_test_example_04 : run-fail  : boost_unit_test_framework ]
-  [ boost-test-example unit_test_example_05 : run-fail  : boost_unit_test_framework ]
-  [ boost-test-example unit_test_example_06 : run-fail  : boost_unit_test_framework ]
-  [ boost-test-example unit_test_example_07 : run       : boost_unit_test_framework ]
-  [ boost-test-example unit_test_example_08 : run       : boost_unit_test_framework ]
-  [ boost-test-example unit_test_example_09 : run       : boost_unit_test_framework : unit_test_example_09_1.cpp unit_test_example_09_2.cpp ]
-  [ boost-test-example unit_test_example_10 : run-fail  : boost_unit_test_framework ]
-  [ boost-test-example unit_test_example_11 : run-fail  : boost_unit_test_framework ]
-#   [ boost-test-example unit_test_example_12 : run       : boost_unit_test_framework ]
-
-  [ boost-test-example est_example1         : run       : boost_unit_test_framework ]
-  [ boost-test-example est_example2         : run       : boost_unit_test_framework ]
-  [ boost-test-example est_example2_dll     : run       : boost_unit_test_framework : est_example2.cpp : 1 ]
-  [ boost-test-example logged_exp_example   : run       : boost_unit_test_framework ]
-
-  [ boost-test-example named_param_example  : run ]
-
-  [ boost-test-example unit_test_example_04_dll : run-fail : boost_unit_test_framework : unit_test_example_04.cpp : 1 ]
-
-;

Deleted: boost/trunk/libs/test/example/cla/Jamfile
===================================================================
--- boost/trunk/libs/test/example/cla/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/example/cla/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,53 +0,0 @@
-#  (C) Copyright Gennadiy Rozental 2001-2006.
-#  Use, modification, and distribution are subject to the 
-#  Boost Software License, Version 1.0. (See accompanying file 
-#  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-#
-#  See http://www.boost.org/libs/test for the library home page.
-
-subproject libs/test/example/cla ;
-
-# bring in the rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-rule boost-runtime-param-example ( example-name  )
-{
-   return [ compile $(example-name).cpp
-            : <stlport-iostream>on <borland><*><cxxflags>-w-8080 
-            : $(example-name)
-          ] ;
-}
-
-test-suite "cla_examples"
-    [ boost-runtime-param-example assign_to ]
-    [ boost-runtime-param-example basic_float ]
-    [ boost-runtime-param-example basic_int ]
-    [ boost-runtime-param-example basic_list ]
-    [ boost-runtime-param-example basic_string ]
-    [ boost-runtime-param-example basic_udt ]
-    [ boost-runtime-param-example char_parameter ]
-    [ boost-runtime-param-example custom_handler ]
-    [ boost-runtime-param-example custom_interpreter ]
-    [ boost-runtime-param-example custom_parameter ]
-    [ boost-runtime-param-example default_value ]
-    [ boost-runtime-param-example dual_name ]
-    [ boost-runtime-param-example global ]
-    [ boost-runtime-param-example guess_name ]
-    [ boost-runtime-param-example help ]
-    [ boost-runtime-param-example ignore_mismatch ]
-    [ boost-runtime-param-example input_separator ]
-    [ boost-runtime-param-example multiplicable ]
-    [ boost-runtime-param-example name ]
-    [ boost-runtime-param-example optional ]
-    [ boost-runtime-param-example optional_value ]
-    [ boost-runtime-param-example positional ]
-    [ boost-runtime-param-example prefix ]
-    [ boost-runtime-param-example reference ]
-    [ boost-runtime-param-example remainder ]
-    [ boost-runtime-param-example separator ]
-    [ boost-runtime-param-example usage ]
-    [ boost-runtime-param-example wide_string ]
-;

Deleted: boost/trunk/libs/test/example/cla/validation/Jamfile
===================================================================
--- boost/trunk/libs/test/example/cla/validation/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/example/cla/validation/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,31 +0,0 @@
-#  (C) Copyright Gennadiy Rozental 2001-2006.
-#  Use, modification, and distribution are subject to the 
-#  Boost Software License, Version 1.0. (See accompanying file 
-#  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-#
-#  See http://www.boost.org/libs/test for the library home page.
-
-subproject libs/test/example/cla/validation ;
-
-DEPENDS test : all ;
-
-rule boost-runtime-param-example ( example-name )
-{
-    exe $(example-name) : $(example-name).cpp
-                        : <sysinclude>$(BOOST_ROOT) 
-                          <stlport-iostream>on 
-                          <borland><*><cxxflags>-w-8080 ;
-}
-
-boost-runtime-param-example access_unknown ;
-boost-runtime-param-example ambiguous_access ;
-boost-runtime-param-example ambiguous_input ;
-boost-runtime-param-example definition_conflict ;
-boost-runtime-param-example invalid_short_name ;
-boost-runtime-param-example multiple_generators ;
-boost-runtime-param-example multiple_value_handlers ;
-boost-runtime-param-example opt_with_default_value ;
-boost-runtime-param-example optional_plus_multiplicable ;
-boost-runtime-param-example required_missing ;
-boost-runtime-param-example unexpected_input ;
-boost-runtime-param-example unexpected_repetition ;

Deleted: boost/trunk/libs/test/example/env/Jamfile
===================================================================
--- boost/trunk/libs/test/example/env/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/example/env/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,31 +0,0 @@
-#  (C) Copyright Gennadiy Rozental 2001-2006.
-#  Use, modification, and distribution are subject to the 
-#  Boost Software License, Version 1.0. (See accompanying file 
-#  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-#
-#  See http://www.boost.org/libs/test for the library home page.
-
-subproject libs/test/example/env ;
-
-# bring in the rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-rule boost-runtime-param-example ( example-name  )
-{
-   return [ compile $(example-name).cpp
-            : <stlport-iostream>on <borland><*><cxxflags>-w-8080 
-            : $(example-name)
-          ] ;
-}
-
-test-suite "cla_examples"
-    [ boost-runtime-param-example custom_interpreter_env ]  
-    [ boost-runtime-param-example env_var_default_value ] 
-    [ boost-runtime-param-example environment_ex ] 
-    [ boost-runtime-param-example global_id ] 
-    [ boost-runtime-param-example modifier_combination ] 
-    [ boost-runtime-param-example variable_ex ] 
-;

Deleted: boost/trunk/libs/test/example/env/validation/Jamfile
===================================================================
--- boost/trunk/libs/test/example/env/validation/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/example/env/validation/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,20 +0,0 @@
-#  (C) Copyright Gennadiy Rozental 2001-2006.
-#  Use, modification, and distribution are subject to the 
-#  Boost Software License, Version 1.0. (See accompanying file 
-#  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-#
-#  See http://www.boost.org/libs/test for the library home page.
-
-subproject libs/test/example/env/validation ;
-
-DEPENDS test : all ;
-
-rule boost-runtime-param-example ( example-name )
-{
-    exe $(example-name) : $(example-name).cpp
-                        : <sysinclude>$(BOOST_ROOT) 
-                          <stlport-iostream>on 
-                          <borland><*><cxxflags>-w-8080 ;
-}
-
-boost-runtime-param-example need_typed_access ; 

Deleted: boost/trunk/libs/test/test/.cvsignore
===================================================================
--- boost/trunk/libs/test/test/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/test/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +0,0 @@
-bin
-res
-run_res
-run_test.bat
-run_tests.bat
-pattern.*
\ No newline at end of file

Deleted: boost/trunk/libs/test/test/Jamfile
===================================================================
--- boost/trunk/libs/test/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,71 +0,0 @@
-#  (C) Copyright Gennadiy Rozental 2001-2006.
-#  Use, modification, and distribution are subject to the 
-#  Boost Software License, Version 1.0. (See accompanying file 
-#  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-#
-#  See http://www.boost.org/libs/test for the library home page.
-
-subproject libs/test/test ;
-
-# bring in the rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-local test-dir = "$(BOOST_ROOT)$(SLASH)libs$(SLASH)test$(SLASH)test$(SLASH)" ;
-
-rule test-btl-lib ( test-rule : test-name : lib-name ? : pattern_file * : source_files * )
-{
-   source_files ?= $(test-name).cpp ;
-
-   return [ $(test-rule) $(source_files) <lib>../build/$(lib-name)
-            : #args
-            : #input files
-              $(pattern_file)
-            : # requirements
-              <stlport-iostream>on <borland><*><cxxflags>-w-8080 
-            : $(test-name)
-          ] ;
-}
-
-test-suite "basics_test"
-        : [ test-btl-lib run : class_properties_test : boost_unit_test_framework ]
-          [ test-btl-lib run : basic_cstring_test    : boost_unit_test_framework ]
-        ;
-
-test-suite "prg_exec_monitor_test"
-        : [ test-btl-lib run-fail : prg_exec_fail1 ]
-          [ test-btl-lib run-fail : prg_exec_fail2 : boost_prg_exec_monitor ]
-          [ test-btl-lib run-fail : prg_exec_fail3 : boost_prg_exec_monitor ]
-          [ test-btl-lib run-fail : prg_exec_fail4 : boost_prg_exec_monitor ]
-        ;
-
-test-suite "unit_test_framework_test"
-        : [ test-btl-lib run : errors_handling_test     : boost_unit_test_framework : $(test-dir)/test_files/errors_handling_test.pattern ]
-          [ test-btl-lib run : online_test ]
-          [ test-btl-lib run-fail : minimal_test ]
-          [ test-btl-lib run : foreach_test ]
-          [ test-btl-lib run : output_test_stream_test  : boost_unit_test_framework ]
-          [ test-btl-lib run : result_report_test       : boost_unit_test_framework : $(test-dir)test_files/result_report_test.pattern ]
-          [ test-btl-lib run : parameterized_test_test  : boost_unit_test_framework ]
-          [ test-btl-lib run : test_fp_comparisons      : boost_unit_test_framework : $(test-dir)test_files/test_fp_comparisons.pattern ]
-          [ test-btl-lib run : test_tools_test          : boost_unit_test_framework : $(test-dir)test_files/test_tools_test.pattern ]
-          [ test-btl-lib run : test_case_template_test  : boost_unit_test_framework ]
-          [ test-btl-lib run : custom_exception_test    : boost_unit_test_framework ]
-          [ test-btl-lib run : fixed_mapping_test       : boost_unit_test_framework ]
-          [ test-btl-lib run : ifstream_line_iterator_test : boost_unit_test_framework : $(test-dir)test_files$(SLASH)ifstream_line_iterator.tst1 $(test-dir)test_files$(SLASH)ifstream_line_iterator.tst2 ]
-          [ test-btl-lib run : algorithms_test          : boost_unit_test_framework ]
-          [ test-btl-lib run : token_iterator_test      : boost_unit_test_framework ]
-          [ test-btl-lib run : boost_check_equal_str    : boost_unit_test_framework ]
-
-#          [ compile config_file_iterator_test.cpp  ]
-#          [ compile config_file_test.cpp ]
-
-        ;
-
-# test-suite "runtime_param_test"
-#         : [ test-btl-lib run : config_file_iterator_test : boost_unit_test_framework ]
-#           [ test-btl-lib run : config_file_test         : boost_unit_test_framework ]
-#
-#        ;

Modified: boost/trunk/libs/test/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/test/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,15 +22,15 @@
 
 test-suite "basics_test"
         :
-          [ test-btl-lib run : class_properties_test    : boost_unit_test_framework ]
-          [ test-btl-lib run : basic_cstring_test    : boost_unit_test_framework ]
+          [ test-btl-lib run : class_properties_test    : boost_unit_test_framework/<link>static ]
+          [ test-btl-lib run : basic_cstring_test    : boost_unit_test_framework/<link>static ]
         ;
 
 test-suite "prg_exec_monitor_test"
-        : [ test-btl-lib run-fail : prg_exec_fail1 : boost_prg_exec_monitor ]
-          [ test-btl-lib run-fail : prg_exec_fail2 : boost_prg_exec_monitor ]
-          [ test-btl-lib run-fail : prg_exec_fail3 : boost_prg_exec_monitor ]
-          [ test-btl-lib run-fail : prg_exec_fail4 : boost_prg_exec_monitor ]
+        : [ test-btl-lib run-fail : prg_exec_fail1 : boost_prg_exec_monitor/<link>static ]
+          [ test-btl-lib run-fail : prg_exec_fail2 : boost_prg_exec_monitor/<link>static ]
+          [ test-btl-lib run-fail : prg_exec_fail3 : boost_prg_exec_monitor/<link>static ]
+          [ test-btl-lib run-fail : prg_exec_fail4 : boost_prg_exec_monitor/<link>static ]
         ;
 
 test-suite "unit_test_framework_test"
@@ -48,10 +48,10 @@
           [ test-btl-lib run : test_fp_comparisons      : boost_unit_test_framework ]
           [ test-btl-lib run : test_tools_test          : boost_unit_test_framework : test_files/test_tools_test.pattern ]
           [ test-btl-lib run : test_case_template_test  : boost_unit_test_framework ]
-          [ test-btl-lib run : custom_exception_test    : boost_unit_test_framework ]
+          [ test-btl-lib run : custom_exception_test    : boost_unit_test_framework/<link>static ]
           [ test-btl-lib run : fixed_mapping_test       : boost_unit_test_framework ]
           [ test-btl-lib run : ifstream_line_iterator_test : boost_unit_test_framework : test_files/ifstream_line_iterator.tst1 test_files/ifstream_line_iterator.tst2 ]
-          [ test-btl-lib run : algorithms_test : boost_unit_test_framework ]
+          [ test-btl-lib run : algorithms_test : boost_unit_test_framework/<link>static ]
           [ test-btl-lib run : token_iterator_test : boost_unit_test_framework ]
           [ test-btl-lib run : boost_check_equal_str    : boost_unit_test_framework ]
             ;

Deleted: boost/trunk/libs/test/test/auto-link-test/.cvsignore
===================================================================
--- boost/trunk/libs/test/test/auto-link-test/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/test/auto-link-test/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +0,0 @@
-res
\ No newline at end of file

Deleted: boost/trunk/libs/test/test/auto-link-test/Jamfile
===================================================================
--- boost/trunk/libs/test/test/auto-link-test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/test/test/auto-link-test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,46 +0,0 @@
-#  (C) Copyright Gennadiy Rozental 2001-2006.
-#  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)
-#
-#  See http://www.boost.org/libs/test for the library home page.
-
-subproject libs/test/test/auto-link-test ;
-
-# bring in the rules for testing
-import testing ;
-
-run 
-     ../auto_non_auto_mix_test.cpp
-   :    # args
-   :    # input files
-   :    # requirements
-      <library-path>../../../../stage/lib
-      <define>BOOST_LIB_DIAGNOSTIC=1
-   :    # program name
-      auto_non_auto_mix_test
-   ;
-
-
-run 
-     ../boost_check_equal_str.cpp
-   :    # args
-   :    # input files
-   :    # requirements
-      <library-path>../../../../stage/lib
-      <define>BOOST_LIB_DIAGNOSTIC=1
-   :    # program name
-      boost_check_equal_str
-   ;
-
-
-run-fail
-     ../prg_exec_fail1.cpp
-   :    # args
-   :    # input files
-   :    # requirements
-      <library-path>../../../../stage/lib
-      <define>BOOST_LIB_DIAGNOSTIC=1
-   :    # program name
-      prg_exec_fail1
-   ;
-

Deleted: boost/trunk/libs/thread/build/.cvsignore
===================================================================
--- boost/trunk/libs/thread/build/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/build/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +0,0 @@
-bin*
-*.pdb

Deleted: boost/trunk/libs/thread/build/Jamfile
===================================================================
--- boost/trunk/libs/thread/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,127 +0,0 @@
-# Copyright (C) 2001-2003
-# William E. Kempf
-#
-# Permission to use, copy, modify, distribute and sell this software
-# and its documentation for any purpose is hereby granted without fee,
-# provided that the above copyright notice appear in all copies and
-# that both that copyright notice and this permission notice appear
-# in supporting documentation.  William E. Kempf makes no representations
-# about the suitability of this software for any purpose.
-# It is provided "as is" without express or implied warranty.
-#
-# Boost.Threads build Jamfile
-#
-# Additional configuration variables used:
-#   See threads.jam.
-
-# Declare the location of this subproject relative to the root.
-subproject libs/thread/build ;
-
-# Include threads.jam for Boost.Threads global build information.
-# This greatly simplifies the Jam code needed to configure the build
-# for the various Win32 build types.
-import ./threads ;
-
-{
-    CPP_SOURCES =
-        barrier
-        condition
-        exceptions
-        mutex
-        once
-        recursive_mutex
-        read_write_mutex
-        thread
-        tss_hooks
-        tss_dll
-        tss_pe
-        tss
-        xtime
-        ;
-
-    template boost_thread_lib_base
-        : ## sources ##
-          <template>thread_base
-          ../src/$(CPP_SOURCES).cpp
-        : ## requirements ##
-          <sysinclude>$(BOOST_ROOT) #:should be unnecessary (because already included in thread_base)
-          <define>BOOST_THREAD_BUILD_LIB=1
-          # the common names rule ensures that the library will
-          # be named according to the rules used by the install
-          # and auto-link features:
-          common-variant-tag
-        : ## default build ##
-    ;
-
-    template boost_thread_dll_base
-        : ## sources ##
-          <template>thread_base
-          ../src/$(CPP_SOURCES).cpp
-        : ## requirements ##
-          <sysinclude>$(BOOST_ROOT) #:should be unnecessary (because already included in thread_base)
-          <define>BOOST_THREAD_BUILD_DLL=1
-          <runtime-link>dynamic
-          # the common names rule ensures that the library will
-          # be named according to the rules used by the install
-          # and auto-link features:
-          common-variant-tag
-        : ## default build ##
-    ;
-
-    lib $(boost_thread_lib_name)
-        : ## sources ##
-          <template>boost_thread_lib_base
-        : ## requirements ##
-          <define>BOOST_THREAD_LIB_NAME=$(boost_thread_lib_name)
-        : ## default build ##
-    ;
-
-    dll $(boost_thread_lib_name)
-        : ## sources ##
-          <template>boost_thread_dll_base
-        : ## requirements ##
-          <define>BOOST_THREAD_LIB_NAME=$(boost_thread_lib_name)
-        : ## default build ##
-    ;
-
-    stage bin-stage
-        : <dll>$(boost_thread_lib_name)
-          <lib>$(boost_thread_lib_name)
-    ;
-
-    install thread lib
-        : <dll>$(boost_thread_lib_name)
-          <lib>$(boost_thread_lib_name)
-    ;
-
-    if $(boost_thread_lib_settings_ptw32)
-    {
-        lib $(boost_thread_lib_name_ptw32)
-            : ## sources ##
-              <template>boost_thread_lib_base
-            : ## requirements ##
-              <define>BOOST_THREAD_LIB_NAME=$(boost_thread_lib_name_ptw32)
-              $(boost_thread_lib_settings_ptw32)
-            : ## default build ##
-        ;
-
-        dll $(boost_thread_lib_name_ptw32)
-            : ## sources ##
-              <template>boost_thread_dll_base
-            : ## requirements ##
-              <define>BOOST_THREAD_LIB_NAME=$(boost_thread_lib_name_ptw32)
-              $(boost_thread_lib_settings_ptw32)
-            : ## default build ##
-        ;
-
-        stage bin-stage
-            : <dll>$(boost_thread_lib_name_ptw32)
-              <lib>$(boost_thread_lib_name_ptw32)
-        ;
-
-        install thread lib
-            : <dll>$(boost_thread_lib_name_ptw32)
-              <lib>$(boost_thread_lib_name_ptw32)
-        ;
-    }
-}

Modified: boost/trunk/libs/thread/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/thread/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+# (C) Copyright Vladimir Prus, David Abrahams, Michael Stevens, Hartmut Kaiser, 
+# William E Kempf 2002-2006
+# Use, modification and distribution are subject to the
+# Boost Software License, Version 1.0. (See accompanying file
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 import os ;
 
 
@@ -14,7 +20,7 @@
         mutex
         once
         recursive_mutex
-        read_write_mutex
+#        read_write_mutex
         thread
         tss_hooks
         tss_dll

Deleted: boost/trunk/libs/thread/build/threads.jam
===================================================================
--- boost/trunk/libs/thread/build/threads.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/build/threads.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,70 +0,0 @@
-# Copyright (C) 2001-2003
-# William E. Kempf
-#
-# Permission to use, copy, modify, distribute and sell this software
-# and its documentation for any purpose is hereby granted without fee,
-# provided that the above copyright notice appear in all copies and
-# that both that copyright notice and this permission notice appear
-# in supporting documentation.  William E. Kempf makes no representations
-# about the suitability of this software for any purpose.
-# It is provided "as is" without express or implied warranty.
-
-# Additional configuration variables used:
-#   1. PTW32_DIR and PTW32_LIB may be used on Win32 platforms to specify that
-#      a version of Boost.Threads should be built that uses the
-#      the pthreads-win32 library instead of the Win32 native threading APIs.
-#      This feature is mostly used for testing and it's generally recommended
-#      that you use the Win32 native threading libraries instead. 
-#
-#      PTW32_Dir should be set to the installation path of the
-#      pthreads-win32 library and PTW32_LIB should be set to the name of the 
-#      library variant to link against (see the pthreads-win32 documentation).
-#      Example: jam -sPTW32_DIR="c:\pthreads-win32" -sPTW32_LIB="pthreadVCE.lib"
-#      Alternately, environment variables having the names PTW32_DIR and PTW32_LIB
-#      can be set instead of passing these values on the command line.
-#
-#      In either case, libraries having the names boost_thread_ptw32<tags>.dll
-#      and libboost_thread_ptw32<tags>.lib will be built
-#      in addition to the usual boost_thread<tags>.dll and 
-#      libboost_thread<tags>.lib. Link with one of the ptw32 versions
-#      of the Boost.Threads libraries to use the version of Boost.Threads
-#      that is implemented using pthreads-win32 (you will need to #define
-#      BOOST_THREAD_NO_LIB or BOOST_ALL_NO_LIB to disable auto-linking
-#      if your platform supports auto-linking in order to prevent
-#      your build from attempting to link to two different versions of 
-#      the Boost.Threads library).
-
-# Do some OS-specific setup
-{
-    #thread library name
-    boost_thread_lib_name = boost_thread ; 
-    
-    #thread library name with "pthreads-win32" library
-    boost_thread_lib_name_ptw32 = boost_thread_ptw32 ;
-    
-    if $(NT)
-    {
-        if $(PTW32_DIR)
-        {
-            if $(PTW32_LIB)
-            {
-                boost_thread_lib_settings_ptw32 =
-                    <define>BOOST_HAS_PTHREADS
-                    <define>PtW32NoCatchWarn
-                    <include>$(PTW32_DIR)/pre-built/include
-                    <library-file>$(PTW32_DIR)/pre-built/lib/$(PTW32_LIB)
-                ;
-            }
-        }
-    }
-
-    template thread_base
-        : ## sources ##
-        : ## requirements ##
-          <sysinclude>$(BOOST_ROOT)
-          <threading>multi
-          <borland><*><cxxflags>-w-8004
-          <borland><*><cxxflags>-w-8057
-        : ## default build ##
-    ;
-}

Deleted: boost/trunk/libs/thread/build/threads.mcp
===================================================================
--- boost/trunk/libs/thread/build/threads.mcp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/build/threads.mcp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +0,0 @@
-cool     ( \ ]6       a         CodeWarrior Project                                                                                                                                                                                                                                             Carbon Std C++ Console:Remote Debug Carbon Std C++ Console:Auto-target Carbon Std C++ Console:Packager Panel Carbon Std C++ Console:Source Trees Carbon Std C++ Console:Access Paths Carbon Std C++ Console:Debugger Runtime Carbon Std C++ Console:Target Settings Carbon Std C++ Console:File Mappings Carbon Std C++ Console:Build Extras Carbon Std C++ Console:Debugger Target Carbon Std C++ Console:Custom Keywords Carbon Std C++ Console:68K CodeGen Carbon Std C++ Console:68K Disassembler Carbon Std C++ Console:68K Global Optimizer Carbon Std C++ Console:68K Linker Carbon Std C++ Console:68K Project Carbon Std C++ Console:C/C++ Compiler Carbon Std C++ Console:C/C++ Warnings Carbon Std C++ Console:CFM68K Carbon Std C++ Console:FTP Panel Carbon Std C++ Console:Java Command Line Carbon Std C++ Console:Java Language Carbon Std C++ Console:Java MRJAppBuilder Carbon Std C++ Console:Java Output Carbon Std C++ Console:Java Project Carbon Std C++ Console:JavaDoc Project Carbon Std C++ Console:MacOS Merge Panel Carbon Std C++ Console:Output Flags Carbon Std C++ Console:PPC CodeGen Carbon Std C++ Console:PPC Disassembler Carbon Std C++ Console:PPC Global Optimizer Carbon Std C++ Console:PPC Linker Carbon Std C++ Console:PPC PEF Carbon Std C++ Console:PPC Project Carbon Std C++ Console:PPCAsm Panel Carbon Std C++ Console:Rez Compiler Project File List Carbon Std C++ Console:PPC CodeGen Mach-O Carbon Std C++ Console:PPC Mach-O Linker Carbon Std C++ Console:PPC Mach-O Target Carbon Std C++ Console:WinRC Compiler Carbon Std C++ Console:x86 CodeGen Carbon Std C++ Console:x86 Disassembler Carbon Std C++ Console:x86 Exceptions Panel Carbon Std C++ Console:x86 Global Optimizer Carbon Std C++ Console:x86 Linker Carbon Std C++ Console:x86 Project Carbon Std C++ Console:PJavaDebugging Boost.Thread:Source Trees Boost.Thread:Access Paths Boost.Thread:Debugger Runtime Boost.Thread:Target Settings Boost.Thread:File Mappings Boost.Thread:Build Extras Boost.Thread:Debugger Target Boost.Thread:Remote Debug Boost.Thread:Auto-target Boost.Thread:Custom Keywords Boost.Thread:C/C++ Compiler Boost.Thread:C/C++ Warnings Boost.Thread:MacOS Merge Panel Boost.Thread:Output Flags Boost.Thread:Packager Panel Boost.Thread:PPC CodeGen Boost.Thread:PPC CodeGen Mach-O Boost.Thread:PPC Disassembler Boost.Thread:PPC Global Optimizer Boost.Thread:PPC Linker Boost.Thread:PPC Mach-O Linker Boost.Thread:PPC Mach-O Target Boost.Thread:PPC PEF Boost.Thread:PPC Project Boost.Thread:PPCAsm Panel Boost.Thread:Rez Compiler Boost.Threads:Source Trees Boost.Threads:Access Paths Boost.Threads:Debugger Runtime Boost.Threads:Target Settings Boost.Threads:File Mappings Boost.Threads:Build Extras Boost.Threads:Debugger Target Boost.Threads:Remote Debug Boost.Threads:Auto-target Boost.Threads:Custom Keywords Boost.Threads:C/C++ Compiler Boost.Threads:C/C++ Warnings Boost.Threads:MacOS Merge Panel Boost.Threads:Output Flags Boost.Threads:Packager Panel Boost.Threads:PPC CodeGen Boost.Threads:PPC CodeGen Mach-O Boost.Threads:PPC Disassembler Boost.Threads:PPC Global Optimizer Boost.Threads:PPC Linker Boost.Threads:PPC Mach-O Linker Boost.Threads:PPC Mach-O Target Boost.Threads:PPC PEF Boost.Threads:PPC Project Boost.Threads:PPCAsm Panel Boost.Threads:Rez Compiler Boost.Threads Debug:Source Trees Boost.Threads Debug:Access Paths Boost.Threads Debug:Debugger Runtime Boost.Threads Debug:Target Settings Boost.Threads Debug:File Mappings Boost.Threads Debug:Build Extras Boost.Threads Debug:Debugger Target Boost.Threads Debug:Remote Debug Boost.Threads Debug:Auto-target Boost.Threads Debug:Custom Keywords Boost.Threads Debug:C/C++ Compiler Boost.Threads Debug:C/C++ Warnings Boost.Threads Debug:MacOS Merge Panel Boost.Threads Debug:Output Flags Boost.Threads Debug:Packager Panel Boost.Threads Debug:PPC CodeGen Boost.Threads Debug:PPC CodeGen Mach-O Boost.Threads Debug:PPC Disassembler Boost.Threads Debug:PPC Global Optimizer Boost.Threads Debug:PPC Linker Boost.Threads Debug:PPC Mach-O Linker Boost.Threads Debug:PPC Mach-O Target Boost.Threads Debug:PPC PEF Boost.Threads Debug:PPC Project Boost.Threads Debug:PPCAsm Panel Boost.Threads Debug:Rez Compiler                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        $          G          m          ‘          µ          Ý                  )             M   
-      t         ›         ¾   
      æ                  4         W         }         £         Á         â                  0         Z         }         ¡   
\ No newline at end of file

Modified: boost/trunk/libs/thread/doc/Jamfile.v2
===================================================================
--- boost/trunk/libs/thread/doc/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright (C) 2001-2003
+# William E. Kempf
+#
+# Distributed under the Boost Software License, Version 1.0. (See accompanying 
+# file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 import toolset ;
 toolset.using doxygen ;

Modified: boost/trunk/libs/thread/doc/acknowledgements.xml
===================================================================
--- boost/trunk/libs/thread/doc/acknowledgements.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/acknowledgements.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,14 +1,18 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
 <section id="thread.acknowledgements"
-last-revision="$Date: 2004/07/17 04:33:59 $">
+last-revision="$Date: 2007/01/12 16:48:02 $">
   <title>Acknowledgements</title>
   <para>William E. Kempf was the architect, designer, and implementor of 
-  &Boost.Threads;.</para>
+  &Boost.Thread;.</para>
   <para>Mac OS Carbon implementation written by Mac Murrett.</para>
   <para>Dave Moore provided initial submissions and further comments on the 
   <code>barrier</code>
@@ -28,7 +32,7 @@
   on the design), Paul Mclachlan, Thomas Matelich and Iain Hanson (for help
   in trying to get the build to work on other platforms), and Kevin S. Van
   Horn (for several updates/corrections to the documentation).</para>
-  <para>Mike Glassford finished changes to &Boost.Threads; that were begun
+  <para>Mike Glassford finished changes to &Boost.Thread; that were begun
   by William Kempf and moved them into the main CVS branch.
   He also addressed a number of issues that were brought up on the Boost
   developer's mailing list and provided some additions and changes to the 
@@ -38,7 +42,7 @@
   Mike Glassford finished William Kempf's conversion of the documentation to 
   BoostBook format and added a number of new sections.</para>
   <para>Discussions on the boost.org mailing list were essential in the
-  development of &Boost.Threads;
+  development of &Boost.Thread;
   . As of August 1, 2001, participants included Alan Griffiths, Albrecht
   Fritzsche, Aleksey Gurtovoy, Alexander Terekhov, Andrew Green, Andy Sawyer,
   Asger Alstrup Nielsen, Beman Dawes, Bill Klein, Bill Rutiser, Bill Wade,
@@ -59,6 +63,11 @@
   Steve Cleary, Steven Kirk, Thomas Holenstein, Thomas Matelich, Trevor
   Perrin, Valentin Bonnard, Vesa Karvonen, Wayne Miller, and William
   Kempf.</para>
+  <para>
+  As of February 2006 Anthony Williams and Roland Schwarz took over maintainance 
+  and further development of the library after it has been in an orphaned state
+  for a rather long period of time. 
+  </para>
   <para>Apologies for anyone inadvertently missed.</para>
 </section>
 

Modified: boost/trunk/libs/thread/doc/barrier-ref.xml
===================================================================
--- boost/trunk/libs/thread/doc/barrier-ref.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/barrier-ref.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
 <header name="boost/thread/barrier.hpp"
-  last-revision="$Date: 2004/07/17 04:33:59 $">
+  last-revision="$Date: 2006/10/15 14:52:52 $">
   <namespace name="boost">
     <class name="barrier">
       <inherit access="private">
@@ -32,9 +36,9 @@
 		and reset the barrier. This functionality allows the same set of N threads to re-use 
 		a barrier object to  synchronize their execution at multiple points during their 
 		execution.</para>
-		<para>See <xref linkend="threads.glossary"/> for definitions of thread 
-		states <link linkend="threads.glossary.thread-state">blocked</link>
-		and <link linkend="threads.glossary.thread-state">ready</link>.
+		<para>See <xref linkend="thread.glossary"/> for definitions of thread 
+		states <link linkend="thread.glossary.thread-state">blocked</link>
+		and <link linkend="thread.glossary.thread-state">ready</link>.
 		Note that "waiting" is a synonym for blocked.</para>
       </description>
       

Modified: boost/trunk/libs/thread/doc/bibliography.xml
===================================================================
--- boost/trunk/libs/thread/doc/bibliography.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/bibliography.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,14 +1,18 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
-<bibliography id="threads.bibliography"
-last-revision="$Date: 2005/01/24 01:51:16 $">
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+<bibliography id="thread.bibliography"
+last-revision="$Date: 2006/10/15 14:52:52 $">
   <title>Bibliography</title>
-  <biblioentry id="threads.bib.AndrewsSchneider83">
-    <abbrev id="threads.bib.AndrewsSchneider83.abbrev">AndrewsSchnieder83</abbrev>
+  <biblioentry id="thread.bib.AndrewsSchneider83">
+    <abbrev id="thread.bib.AndrewsSchneider83.abbrev">AndrewsSchnieder83</abbrev>
     <biblioset relation="journal">
       <title>ACM Computing Surveys</title>
       <volumenum>Vol. 15</volumenum>
@@ -38,18 +42,18 @@
     Expressions, Message Passing, and Remote Procedure Call in addition to the
     basics</para>
   </biblioentry>
-  <biblioentry id="threads.bib.Boost">
-    <abbrev id="threads.bib.Boost.abbrev">Boost</abbrev>
+  <biblioentry id="thread.bib.Boost">
+    <abbrev id="thread.bib.Boost.abbrev">Boost</abbrev>
     <bibliomisc>The <emphasis>Boost</emphasis> world wide web site.
 	<ulink url="http:/www.boost.org">http://www.boost.org</ulink></bibliomisc>
-	<para>&Boost.Threads; is one of many Boost libraries. The Boost web
+	<para>&Boost.Thread; is one of many Boost libraries. The Boost web
     site includes a great deal of documentation and general information which
     applies to all Boost libraries. Current copies of the libraries including
     documentation and test programs may be downloaded from the web
     site.</para>
   </biblioentry>
-  <biblioentry id="threads.bib.Hansen73">
-    <abbrev id="threads.bib.Hansen73.abbrev">Hansen73</abbrev>
+  <biblioentry id="thread.bib.Hansen73">
+    <abbrev id="thread.bib.Hansen73.abbrev">Hansen73</abbrev>
     <biblioset relation="journal">
       <title>ACM Computing Surveys</title>
       <volumenum>Vol. 5</volumenum>
@@ -74,8 +78,8 @@
     Brinch Hansen was years ahead of others in recognizing pattern concepts
     applied to software, too.</para>
   </biblioentry>
-  <biblioentry id="threads.bib.Butenhof97">
-    <abbrev id="threads.bib.Butenhof97.abbrev">Butenhof97</abbrev>
+  <biblioentry id="thread.bib.Butenhof97">
+    <abbrev id="thread.bib.Butenhof97.abbrev">Butenhof97</abbrev>
 	<title>
 	  <ulink url="http://cseng.aw.com/book/0,3828,0201633922,00.html"
 	  >Programming with POSIX Threads </ulink>
@@ -92,8 +96,8 @@
 	them. Many of the insights given apply to all multithreaded programming, not
 	just POSIX Threads</para>
   </biblioentry>
-  <biblioentry id="threads.bib.Hoare74">
-    <abbrev id="threads.bib.Hoare74.abbrev">Hoare74</abbrev>
+  <biblioentry id="thread.bib.Hoare74">
+    <abbrev id="thread.bib.Hoare74.abbrev">Hoare74</abbrev>
 	<biblioset relation="journal">
 	  <title>Communications of the ACM</title>
 	  <volumenum>Vol. 17</volumenum>
@@ -115,8 +119,8 @@
 	multithreading patterns. This is one of the most often referenced papers in
 	all of computer science, and with good reason.</para>
   </biblioentry>
-  <biblioentry id="threads.bib.ISO98">
-    <abbrev id="threads.bib.ISO98.abbrev">ISO98</abbrev>
+  <biblioentry id="thread.bib.ISO98">
+    <abbrev id="thread.bib.ISO98.abbrev">ISO98</abbrev>
 	<title>
 	  <ulink url="http://www.ansi.org">Programming Language C++</ulink>
 	</title>
@@ -125,8 +129,8 @@
 	<para>This is the official C++ Standards document. Available from the ANSI
 	(American National Standards Institute) Electronic Standards Store.</para>
   </biblioentry>
-  <biblioentry id="threads.bib.McDowellHelmbold89">
-    <abbrev id="threads.bib.McDowellHelmbold89.abbrev">McDowellHelmbold89</abbrev>
+  <biblioentry id="thread.bib.McDowellHelmbold89">
+    <abbrev id="thread.bib.McDowellHelmbold89.abbrev">McDowellHelmbold89</abbrev>
 	<biblioset relation="journal">
 	  <title>Communications of the ACM</title>
 	  <volumenum>Vol. 21</volumenum>
@@ -153,8 +157,8 @@
 	<para>Identifies many of the unique failure modes and debugging difficulties
 	associated with concurrent programs.</para>
   </biblioentry>
-  <biblioentry id="threads.bib.SchmidtPyarali">
-    <abbrev id="threads.bib.SchmidtPyarali.abbrev">SchmidtPyarali</abbrev>
+  <biblioentry id="thread.bib.SchmidtPyarali">
+    <abbrev id="thread.bib.SchmidtPyarali.abbrev">SchmidtPyarali</abbrev>
 	<title>
 	  <ulink url="http://www.cs.wustl.edu/~schmidt/win32-cv-1.html8"
 	  >Strategies for Implementing POSIX Condition Variables on Win32</ulink>
@@ -172,14 +176,14 @@
 	</authorgroup>
 	<orgname>Department of Computer Science, Washington University, St. Louis,
 	Missouri</orgname>
-	<para>Rationale for understanding &Boost.Threads; condition
+	<para>Rationale for understanding &Boost.Thread; condition
 	variables. Note that Alexander Terekhov found some bugs in the
-	implementation given in this article, so pthreads-win32 and &Boost.Threads;
+	implementation given in this article, so pthreads-win32 and &Boost.Thread;
 	are even more complicated yet.</para>
   </biblioentry>
-  <biblioentry id="threads.bib.SchmidtStalRohnertBuschmann">
+  <biblioentry id="thread.bib.SchmidtStalRohnertBuschmann">
     <abbrev
-	id="threads.bib.SchmidtStalRohnertBuschmann.abbrev">SchmidtStalRohnertBuschmann</abbrev>
+	id="thread.bib.SchmidtStalRohnertBuschmann.abbrev">SchmidtStalRohnertBuschmann</abbrev>
 	<title>
 	  <ulink
 	  url="http://www.wiley.com/Corporate/Website/Objects/Products/0,9049,104671,00.html"
@@ -210,11 +214,11 @@
 	<copyright><year>2000</year></copyright>
 	<para>This is a very good explanation of how to apply several patterns
 	useful for concurrent programming. Among the patterns documented is the
-	Monitor Pattern mentioned frequently in the &Boost.Threads;
+	Monitor Pattern mentioned frequently in the &Boost.Thread;
 	documentation.</para>
   </biblioentry>
-  <biblioentry id="threads.bib.Stroustrup">
-    <abbrev id="threads.bib.Stroustrup.abbrev">Stroustrup</abbrev>
+  <biblioentry id="thread.bib.Stroustrup">
+    <abbrev id="thread.bib.Stroustrup.abbrev">Stroustrup</abbrev>
 	<title>
 	  <ulink url="http://cseng.aw.com/book/0,3828,0201700735,00.html"
 	  >The C++ Programming Language</ulink>

Modified: boost/trunk/libs/thread/doc/build.xml
===================================================================
--- boost/trunk/libs/thread/doc/build.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/build.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,58 +1,137 @@
 <?xml version="1.0" encoding="utf-8" ?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
-<section id="thread.build" last-revision="$Date: 2004/07/17 04:33:59 $">
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Copyright (c) 2007 Roland Schwarz
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+<section id="thread.build" last-revision="$Date: 2007/01/18 17:33:50 $">
 	<title>Build</title>
 	<para>
-	How you build the &Boost.Threads; libraries, and how you build your own applications
+	How you build the &Boost.Thread; libraries, and how you build your own applications
 	that use those libraries, are some of the most frequently asked questions. Build
 	processes are difficult to deal with in a portable manner. That's one reason
-	why &Boost.Threads; makes use of &Boost.Build;.
+	why &Boost.Thread; makes use of &Boost.Build;.
 	In general you should refer to the documentation for &Boost.Build;.
 	This document will only supply you with some simple usage examples for how to
-	use <emphasis>bjam</emphasis> to build and test &Boost.Threads;. In addition, this document
+	use <emphasis>bjam</emphasis> to build and test &Boost.Thread;. In addition, this document
 	will try to explain the build requirements so that users may create their own
 	build processes (for instance, create an IDE specific project), both for building
-	and testing &Boost.Threads;, as well as for building their own projects using
-	&Boost.Threads;.
+	and testing &Boost.Thread;, as well as for building their own projects using
+	&Boost.Thread;.
 	</para>
 	<section id="thread.build.building">
-		<title>Building the &Boost.Threads; Libraries</title>
-		<para>
-	To build the &Boost.Threads; libraries using &Boost.Build;, simply change to the
-	directory <emphasis>boost_root</emphasis>/libs/thread/build and execute the command:
-		<programlisting>bjam -sTOOLS=<emphasis>toolset</emphasis></programlisting>
-	This will create the debug and the release builds of the &Boost.Threads; library.
-	<note>Invoking the above command in <emphasis>boost_root</emphasis> will build all of 
-	the Boost distribution, including &Boost.Threads;.</note>
-		</para>
-		<para>
-	The Jamfile supplied with &Boost.Threads; produces a dynamic link library named
-	<emphasis>boost_thread{build-specific-tags}.{extension}</emphasis>, where the build-specific
-	tags indicate the toolset used to build the library, whether it's a debug or release
-	build, what version of Boost was used, etc.; and the extension is the appropriate extension
-	for a dynamic link library for the platform for which &Boost.Threads; is being built.
-	For instance, a debug library built for Win32 with VC++ 7.1 using Boost 1.31 would
-	be named <emphasis>boost_thread-vc71-mt-gd-1_31.dll</emphasis>.
-		</para>
-		<para>
-	The source files that are used to create the &Boost.Threads; library
-	are all of the *.cpp files found in <emphasis>boost_root</emphasis>/libs/thread/src.
-	These need to be built with the compiler's and linker's multi-threading support enabled.
-	If you want to create your own build solution you'll have to follow these same
-	guidelines. One of the most frequently reported problems when trying to do this
-	occurs from not enabling the compiler's and linker's support for multi-threading.
-		</para>
+		<title>Building the &Boost.Thread; Libraries</title>
+        <para>
+            Building the &Boost.Thread; Library depends on how you intend to use it. You have several options:
+            <itemizedlist>
+                <listitem>
+                    Using as a <link linkend="thread.build.precompiled">precompiled</link> library, possibly
+                    with auto-linking, or for use from within an IDE.
+                </listitem>
+                <listitem>
+                    Use from a <link linkend="thread.build.bjam">&Boost.Build;</link> project.
+                </listitem>
+                <listitem>
+                    Using in <link linkend="thread.build.source">source</link> form.
+                </listitem>
+            </itemizedlist>
+        </para>
+        <section id="thread.build.precompiled">
+            <title>Precompiled</title>
+            <para>
+                Using the &Boost.Thread; library in precompiled form is the way to go if you want to
+                install the library to a standard place, from where your linker is able to resolve code
+                in binary form. You also will want this option if compile time is a concern. Multiple 
+                variants are available, for different toolsets and build variants (debug/release).
+                The library files are named <emphasis>{lead}boost_thread{build-specific-tags}.{extension}</emphasis>,
+                where the build-specific-tags indicate the toolset used to build the library, whether it's
+                a debug or release build, what version of &Boost; was used, etc.; and the lead and extension
+                are the appropriate extensions for a dynamic link library or static library for the platform
+                for which &Boost.Thread; is being built.
+            	For instance, a debug build of the dynamic library built for Win32 with VC++ 7.1 using Boost 1.34 would
+            	be named <emphasis>boost_thread-vc71-mt-gd-1_34.dll</emphasis>.
+                More information on this should be available from the &Boost.Build; documentation.
+            </para>
+            <para>
+                Building should be possible with the default configuration. If you are running into problems,
+                it might be wise to adjust your local settings of &Boost.Build; though. Typically you will
+                need to get your user-config.jam file to reflect your environment, i.e. used toolsets. Please
+                refer to the &Boost.Build; documentation to learn how to do this.
+            </para>
+            <para>
+                To create the libraries you need to open a command shell and change to the 
+                <emphasis>boost_root</emphasis> directory. From there you give the command 
+                <programlisting>bjam --toolset=<emphasis>mytoolset</emphasis> stage --with-thread</programlisting>
+                Replace <emphasis>mytoolset</emphasis> with the name of your toolset, e.g. msvc-7.1 .
+                This will compile and put the libraries into the <emphasis>stage</emphasis> directory which is just below the
+                <emphasis>boost_root</emphasis> directory. &Boost.Build; by default will generate static and 
+                dynamic variants for debug and release.
+            </para>
+            <note>
+                Invoking the above command without the --with-thread switch &Boost.Build; will build all of 
+	            the Boost distribution, including &Boost.Thread;.
+            </note>
+            <para>
+                The next step is to copy your libraries to a place where your linker is able to pick them up.
+                It is also quite possible to leave them in the stage directory and instruct your IDE to take them
+                from there.
+            </para>
+            <para>
+                In your IDE you then need to add <emphasis>boost_root</emphasis>/boost to the paths where the compiler
+                expects to find files to be included. For toolsets that support <emphasis>auto-linking</emphasis>
+                it is not necessary to explicitly specify the name of the library to link against, it is sufficient
+                to specify the path of the stage directory. Typically this is true on Windows. For gcc you need 
+                to specify the exact library name (including all the tags). Please don't forget that threading
+                support must be turned on to be able to use the library. You should be able now to build your
+                project from the IDE.
+            </para>
+	    </section>
+        <section id="thread.build.bjam">
+            <title>&Boost.Build; Project</title>
+            <para>
+                If you have decided to use &Boost.Build; as a build environment for your application, you simply
+                need to add a single line to your <emphasis>Jamroot</emphasis> file:
+                <programlisting>use-project /boost : {path-to-boost-root} ;</programlisting>
+                where <emphasis>{path-to-boost-root}</emphasis> needs to be replaced with the location of
+                your copy of the boost tree.
+                Later when you specify a component that needs to link against &Boost.Thread; you specify this
+                as e.g.:
+                <programlisting>exe myapp : {myappsources} /boost//thread ;</programlisting>
+                and you are done.
+            </para>
+        </section>
+        <section id="thread.build.source">
+            <title>Source Form</title>
+            <para>
+                Of course it is also possible to use the &Boost.Thread; library in source form.
+                First you need to specify the <emphasis>boost_root</emphasis>/boost directory as
+                a path where your compiler expects to find files to include. It is not easy
+                to isolate the &Boost.Thread; include files from the rest of the boost 
+                library though. You would also need to isolate every include file that the thread
+                library depends on. Next you need to copy the files from 
+                <emphasis>boost_root</emphasis>/libs/thread/src to your project and instruct your
+                build system to compile them together with your project. Please look into the
+                <emphasis>Jamfile</emphasis> in <emphasis>boost_root</emphasis>/libs/thread/build
+                to find out which compiler options and defines you will need to get a clean compile.
+                Using the boost library in this way is the least recommended, and should only be
+                considered if avoiding dependency on &Boost.Build; is a requirement. Even if so
+                it might be a better option to use the library in it's precompiled form. 
+                Precompiled downloads are available from the boost consulting web site, or as
+                part of most linux distributions.
+            </para>
+        </section>
 	</section>
 	<section id="thread.build.testing">
-		<title>Testing the &Boost.Threads; Libraries</title>
+		<title>Testing the &Boost.Thread; Libraries</title>
 		<para>
-	To test the &Boost.Threads; libraries using &Boost.Build;, simply change to the
-	directory <emphasis>boost_root</emphasis>/libs/thread/test and execute the command:
-			<programlisting>bjam -sTOOLS=<emphasis>toolset</emphasis> test</programlisting>
+	        To test the &Boost.Thread; libraries using &Boost.Build;, simply change to the
+	        directory <emphasis>boost_root</emphasis>/libs/thread/test and execute the command:
+			<programlisting>bjam --toolset=<emphasis>mytoolset</emphasis> test</programlisting>
 		</para>
 	</section>
 </section>

Modified: boost/trunk/libs/thread/doc/concepts.xml
===================================================================
--- boost/trunk/libs/thread/doc/concepts.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/concepts.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,22 +1,36 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
-<section id="threads.concepts" last-revision="$Date: 2004/11/28 04:29:36 $">
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+<section id="thread.concepts" last-revision="$Date: 2007/01/02 21:44:39 $">
 	<title>Concepts</title>
 
-	<para>&Boost.Threads; currently supports two types of mutex concepts:
-	ordinary <link linkend="threads.concepts.mutexes">Mutexes</link>,
+	<para>&Boost.Thread; currently supports two types of mutex concepts:
+	ordinary <link linkend="thread.concepts.mutexes">Mutexes</link>,
 	which allow only one thread at a time to access a resource, and
-	<link linkend="threads.concepts.read-write-mutexes">Read/Write Mutexes</link>,
+	<link linkend="thread.concepts.read-write-mutexes">Read/Write Mutexes</link>,
 	which allow only one thread at a time to access a resource when it is
 	being modified (the "Write" part of Read/Write), but allows multiple threads
 	to access a resource when it is only being referenced (the "Read" part of
-	Read/Write).</para>
+    Read/Write).</para> 
+    <note> Unfortunately it turned out that the current implementation of Read/Write Mutex has     
+            some serious problems. So it was decided not to put this implementation into
+            release grade code. Also discussions on the mailing list led to the
+            conclusion that the current concepts need to be rethought. In particular
+            the schedulings <link linkend="thread.concepts.read-write-scheduling-policies.inter-class">
+                Inter-Class Scheduling Policies</link> are deemed unnecessary.
+            There seems to be common belief that a fair scheme suffices.
+            The following documentation has been retained however, to give
+            readers of this document the opportunity to study the original design.
+    </note>
 
-	<section id="threads.concepts.mutexes">
+	<section id="thread.concepts.mutexes">
 		<title>Mutexes</title>
 
 		<note>Certain changes to the mutexes and lock concepts are
@@ -27,17 +41,17 @@
 		
 		<para>A mutex (short for mutual-exclusion) object is used to serialize
 		access to a resource shared between multiple threads. The
-		<link linkend="threads.concepts.Mutex">Mutex</link> concept, with
-		<link linkend="threads.concepts.TryMutex">TryMutex</link> and
-		<link linkend="threads.concepts.TimedMutex">TimedMutex</link> refinements,
+		<link linkend="thread.concepts.Mutex">Mutex</link> concept, with
+		<link linkend="thread.concepts.TryMutex">TryMutex</link> and
+		<link linkend="thread.concepts.TimedMutex">TimedMutex</link> refinements,
 		formalize the requirements. A model that implements Mutex and its
 		refinements has two states: <emphasis role="bold">locked</emphasis> and
 		<emphasis role="bold">unlocked</emphasis>. Before using a shared resource, a
-		thread locks a &Boost.Threads; mutex object
+		thread locks a &Boost.Thread; mutex object
 		(an object whose type is a model of
-		<link linkend="threads.concepts.Mutex">Mutex</link> or one of it's
+		<link linkend="thread.concepts.Mutex">Mutex</link> or one of it's
 		refinements), ensuring
-		<link linkend="threads.glossary.thread-safe">thread-safe</link> access to
+		<link linkend="thread.glossary.thread-safe">thread-safe</link> access to
 		the shared resource. When use of the shared resource is complete, the thread
 		unlocks the mutex object, allowing another thread to acquire the lock and
 		use the shared resource.</para>
@@ -48,27 +62,27 @@
 		unlock a mutex object becomes even greater. When exceptions are thrown,
 		it becomes nearly impossible to ensure that the mutex object is unlocked
 		properly when using these traditional API's. The result is
-		<link linkend="threads.glossary.deadlock">deadlock</link>.</para>
+		<link linkend="thread.glossary.deadlock">deadlock</link>.</para>
 		<para>Many C++ threading libraries use a pattern known as <emphasis>Scoped
 		Locking</emphasis> &cite.SchmidtStalRohnertBuschmann; to free the programmer from
 		the need to explicitly lock and unlock mutex objects. With this pattern, a
-		<link linkend="threads.concepts.lock-concepts">Lock</link> concept is employed where
+		<link linkend="thread.concepts.lock-concepts">Lock</link> concept is employed where
 		the lock object's constructor locks the associated mutex object and the
 		destructor automatically does the unlocking. The
-		&Boost.Threads; library takes this pattern to
+		&Boost.Thread; library takes this pattern to
 		the extreme in that Lock concepts are the only way to lock and unlock a
 		mutex object: lock and unlock functions are not exposed by any
-		&Boost.Threads; mutex objects. This helps to
+		&Boost.Thread; mutex objects. This helps to
 		ensure safe usage patterns, especially when code throws exceptions.</para>
 
-		<section id="threads.concepts.locking-strategies">
+		<section id="thread.concepts.locking-strategies">
 			<title>Locking Strategies</title>
 			
 			<para>Every mutex object follows one of several locking strategies. These
 			strategies define the semantics for the locking operation when the calling
 			thread already owns a lock on the mutex object.</para>
 			
-			<section id="threads.concepts.recursive-locking-strategy">
+			<section id="thread.concepts.recursive-locking-strategy">
 				<title>Recursive Locking Strategy</title>
 			
 				<para>With a recursive locking strategy, when a thread attempts to acquire
@@ -81,7 +95,7 @@
 				<para>Internally a lock count is maintained and the owning thread must
 				unlock the mutex object the same number of times that it locked it before
 				the mutex object's state returns to unlocked. Since mutex objects in
-				&Boost.Threads; expose locking
+				&Boost.Thread; expose locking
 				functionality only through lock concepts, a thread will always unlock a
 				mutex object the same number of times that it locked it. This helps to
 				eliminate a whole set of errors typically found in traditional C style
@@ -93,7 +107,7 @@
 				strategy.</para>
 			</section>
 			
-			<section id="threads.concepts.checked-locking-strategy">
+			<section id="thread.concepts.checked-locking-strategy">
 				<title>Checked Locking Strategy</title>
 				
 				<para>With a checked locking strategy, when a thread attempts to acquire a
@@ -101,35 +115,35 @@
 				operation will fail with some sort of error indication. Further, attempts
 				by a thread to unlock a mutex object that was not locked by the thread
 				will also return some sort of error indication. In
-				&Boost.Threads;, an exception of type
+				&Boost.Thread;, an exception of type
 				<classname>boost::lock_error</classname> 
 				would be thrown in these cases.</para>
 				
-				<para>&Boost.Threads; does not currently
+				<para>&Boost.Thread; does not currently
 				provide any mutex objects that use this strategy.</para>
 			</section>
 			
-			<section id="threads.concepts.unchecked-locking-strategy">
+			<section id="thread.concepts.unchecked-locking-strategy">
 				<title>Unchecked Locking Strategy</title>
 				
 				<para>With an unchecked locking strategy, when a thread attempts to acquire
 				a lock on a mutex object for which the thread already owns a lock the
 				operation will
-				<link linkend="threads.glossary.deadlock">deadlock</link>. In general
+				<link linkend="thread.glossary.deadlock">deadlock</link>. In general
 				this locking strategy is less safe than a checked or recursive strategy,
 				but it's also a faster strategy and so is employed by many libraries.</para>
 				
-				<para>&Boost.Threads; does not currently
+				<para>&Boost.Thread; does not currently
 				provide any mutex objects that use this strategy.</para>
 			</section>
 			
-			<section id="threads.concepts.unspecified-locking-strategy">
+			<section id="thread.concepts.unspecified-locking-strategy">
 				<title>Unspecified Locking Strategy</title>
 				
 				<para>With an unspecified locking strategy, when a thread attempts to
 				acquire a lock on a mutex object for which the thread already owns a lock
 				the operation results in 
-				<link linkend="threads.glossary.undefined-behavior">undefined behavior</link>.
+				<link linkend="thread.glossary.undefined-behavior">undefined behavior</link>.
 				</para>
 				
 				<para>In general a mutex object with an unspecified locking strategy is
@@ -145,7 +159,7 @@
 			</section>
 		</section>
 		
-		<section id="threads.concepts.sheduling-policies">
+		<section id="thread.concepts.sheduling-policies">
 			<title>Scheduling Policies</title>
 			
 			<para>Every mutex object follows one of several scheduling policies. These
@@ -153,7 +167,7 @@
 			more than one thread waiting to acquire a lock. In other words, the policy
 			defines which waiting thread shall acquire the lock.</para>
 			
-			<section id="threads.concepts.FIFO-scheduling-policy">
+			<section id="thread.concepts.FIFO-scheduling-policy">
 				<title>FIFO Scheduling Policy</title>
 				
 				<para>With a FIFO ("First In First Out") scheduling policy, threads waiting 
@@ -162,7 +176,7 @@
 				threads that are also waiting on the mutex object's lock.</para>
 			</section>
 			
-			<section id="threads.concepts.priority-driven-scheduling-policy">
+			<section id="thread.concepts.priority-driven-scheduling-policy">
 				<title>Priority Driven Policy</title>
 				
 				<para>With a Priority Driven scheduling policy, the thread with the
@@ -174,19 +188,19 @@
 				will determine which thread shall acquire the lock.</para>
 			</section>
 			
-			<section id="threads.concepts.unspecified-scheduling-policy">
+			<section id="thread.concepts.unspecified-scheduling-policy">
 				<title>Unspecified Policy</title>
 				
 				<para>The mutex object does not specify a scheduling policy. In order to
-				ensure portability, all &Boost.Threads;
+				ensure portability, all &Boost.Thread;
 				mutex objects use an unspecified scheduling policy.</para>
 			</section>
 		</section>
 		
-		<section id="threads.concepts.mutex-concepts">
+		<section id="thread.concepts.mutex-concepts">
 			<title>Mutex Concepts</title>
 			
-			<section id="threads.concepts.Mutex">
+			<section id="thread.concepts.Mutex">
 				<title>Mutex Concept</title>
 				
 				<para>A Mutex object has two states: locked and unlocked. Mutex object
@@ -227,7 +241,7 @@
 							<row>
 								<entry>M::scoped_lock</entry>
 								<entry>A model of
-								<link linkend="threads.concepts.ScopedLock">ScopedLock</link>
+								<link linkend="thread.concepts.ScopedLock">ScopedLock</link>
 								</entry>
 							</row>
 						</tbody>
@@ -235,11 +249,11 @@
 				</table>
 			</section>
 		
-			<section id="threads.concepts.TryMutex">
+			<section id="thread.concepts.TryMutex">
 				<title>TryMutex Concept</title>
 				
 				<para>A TryMutex is a refinement of
-				<link linkend="threads.concepts.Mutex">Mutex</link>. 
+				<link linkend="thread.concepts.Mutex">Mutex</link>. 
 				For a TryMutex type <code>M</code>
 				and an object <code>m</code> of that type, 
 				the following expressions must be well-formed 
@@ -260,7 +274,7 @@
 							<row>
 								<entry>M::scoped_try_lock</entry>
 								<entry>A model of
-								<link linkend="threads.concepts.ScopedTryLock">ScopedTryLock</link>
+								<link linkend="thread.concepts.ScopedTryLock">ScopedTryLock</link>
 								</entry>
 							</row>
 						</tbody>
@@ -268,11 +282,11 @@
 				</table>
 			</section>
 		
-			<section id="threads.concepts.TimedMutex">
+			<section id="thread.concepts.TimedMutex">
 				<title>TimedMutex Concept</title>
 				
 				<para>A TimedMutex is a refinement of
-				<link linkend="threads.concepts.TryMutex">TryMutex</link>. 
+				<link linkend="thread.concepts.TryMutex">TryMutex</link>. 
 				For a TimedMutex type <code>M</code>
 				and an object <code>m</code> of that type, 
 				the following expressions must be well-formed
@@ -294,7 +308,7 @@
 								<entry>M::scoped_timed_lock</entry>
 								<entry>A model of
 								<link
-								linkend="threads.concepts.ScopedTimedLock">ScopedTimedLock</link>
+								linkend="thread.concepts.ScopedTimedLock">ScopedTimedLock</link>
 								</entry>
 							</row>
 						</tbody>
@@ -303,11 +317,11 @@
 			</section>
 		</section>
 		
-		<section id="threads.concepts.mutex-models">
+		<section id="thread.concepts.mutex-models">
 			<title>Mutex Models</title>
 			
-			<para>&Boost.Threads; currently supplies six models of
-			<link linkend="threads.concepts.Mutex">Mutex</link>
+			<para>&Boost.Thread; currently supplies six models of
+			<link linkend="thread.concepts.Mutex">Mutex</link>
 			and its refinements.</para>
 			
 			<table>
@@ -324,7 +338,7 @@
 					
 					<tbody>
 						<row>
-							<entry><link linkend="threads.concepts.Mutex">Mutex</link></entry>
+							<entry><link linkend="thread.concepts.Mutex">Mutex</link></entry>
 							<entry></entry>
 							<entry>
 							<para><classname>boost::mutex</classname></para>
@@ -332,16 +346,16 @@
 							</entry>
 						</row>
 						<row>
-							<entry><link linkend="threads.concepts.TryMutex">TryMutex</link></entry>
-							<entry><link linkend="threads.concepts.Mutex">Mutex</link></entry>
+							<entry><link linkend="thread.concepts.TryMutex">TryMutex</link></entry>
+							<entry><link linkend="thread.concepts.Mutex">Mutex</link></entry>
 							<entry>
 								<para><classname>boost::try_mutex</classname></para>
 								<para><classname>boost::recursive_try_mutex</classname></para>
 							</entry>
 						</row>
 						<row>
-							<entry><link linkend="threads.concepts.TimedMutex">TimedMutex</link></entry>
-							<entry><link linkend="threads.concepts.TryMutex">TryMutex</link></entry>
+							<entry><link linkend="thread.concepts.TimedMutex">TimedMutex</link></entry>
+							<entry><link linkend="thread.concepts.TryMutex">TryMutex</link></entry>
 							<entry>
 								<para><classname>boost::timed_mutex</classname></para>
 								<para><classname>boost::recursive_timed_mutex</classname></para>
@@ -352,17 +366,17 @@
 			</table>
 		</section>
 		
-		<section id="threads.concepts.lock-concepts">
+		<section id="thread.concepts.lock-concepts">
 			<title>Lock Concepts</title>
 
 			<para>A lock object provides a safe means for locking and unlocking a mutex
 			object (an object whose type is a model of <link
-			linkend="threads.concepts.Mutex">Mutex</link> or one of its refinements). In
+			linkend="thread.concepts.Mutex">Mutex</link> or one of its refinements). In
 			other words they are an implementation of the <emphasis>Scoped
 			Locking</emphasis> &cite.SchmidtStalRohnertBuschmann; pattern. The <link
-			linkend="threads.concepts.ScopedLock">ScopedLock</link>,
-			<link linkend="threads.concepts.ScopedTryLock">ScopedTryLock</link>, and 
-			<link linkend="threads.concepts.ScopedTimedLock">ScopedTimedLock</link>
+			linkend="thread.concepts.ScopedLock">ScopedLock</link>,
+			<link linkend="thread.concepts.ScopedTryLock">ScopedTryLock</link>, and 
+			<link linkend="thread.concepts.ScopedTimedLock">ScopedTimedLock</link>
 			concepts formalize the requirements.</para>
 			<para>Lock objects are constructed with a reference to a mutex object and
 			typically acquire ownership of the mutex object by setting its state to
@@ -371,12 +385,12 @@
 			and unlock the mutex object.</para>
 			<para>Lock objects are meant to be short lived, expected to be used at block
 			scope only. The lock objects are not <link
-			linkend="threads.glossary.thread-safe">thread-safe</link>. Lock objects must
+			linkend="thread.glossary.thread-safe">thread-safe</link>. Lock objects must
 			maintain state to indicate whether or not they've been locked and this state
 			is not protected by any synchronization concepts. For this reason a lock
 			object should never be shared between multiple threads.</para>
 
-			<section id="threads.concepts.Lock">
+			<section id="thread.concepts.Lock">
 				<title>Lock Concept</title>
 				
 				<para>For a Lock type <code>L</code> 
@@ -419,15 +433,15 @@
 									
 									<para>If the associated mutex object is
 									already locked by some other thread, places the current thread in the 
-									<link linkend="threads.glossary.thread-state">Blocked</link> state until
+									<link linkend="thread.glossary.thread-state">Blocked</link> state until
 									the associated mutex is unlocked, after which the current thread
 									is placed in the <link
-									linkend="threads.glossary.thread-state">Ready</link> state,
+									linkend="thread.glossary.thread-state">Ready</link> state,
 									eventually to be returned to the <link
-									linkend="threads.glossary.thread-state">Running</link> state. If
+									linkend="thread.glossary.thread-state">Running</link> state. If
 									the associated mutex object is already locked by the same thread
 									the behavior is dependent on the <link
-									linkend="threads.concepts.locking-strategies">locking
+									linkend="thread.concepts.locking-strategies">locking
 									strategy</link> of the associated mutex object.</para>
 									
 									<para>Postcondition: <code>locked() == true</code></para>
@@ -448,15 +462,15 @@
 				</table>
 			</section>
 		
-			<section id="threads.concepts.ScopedLock">
+			<section id="thread.concepts.ScopedLock">
 				<title>ScopedLock Concept</title>
 				
 				<para>A ScopedLock is a refinement of <link
-				linkend="threads.concepts.Lock">Lock</link>. 
+				linkend="thread.concepts.Lock">Lock</link>. 
 				For a ScopedLock type <code>L</code> 
 				and an object <code>lk</code> of that type, 
 				and an object <code>m</code> of a type meeting the 
-				<link linkend="threads.concepts.Mutex">Mutex</link> requirements, 
+				<link linkend="thread.concepts.Mutex">Mutex</link> requirements, 
 				and an object <code>b</code> of type <code>bool</code>, 
 				the following expressions must be well-formed 
 				and have the indicated effects.</para>
@@ -490,11 +504,11 @@
 				</table>
 			</section>
 		
-			<section id="threads.concepts.TryLock">
+			<section id="thread.concepts.TryLock">
 				<title>TryLock Concept</title>
 				
 				<para>A TryLock is a refinement of <link
-				linkend="threads.concepts.Lock">Lock</link>. 
+				linkend="thread.concepts.Lock">Lock</link>. 
 				For a TryLock type <code>L</code> 
 				and an object <code>lk</code> of that type, 
 				the following expressions must be well-formed 
@@ -523,7 +537,7 @@
 									returning <code>true</code> if the lock attempt is successful,
 									otherwise <code>false</code>. If the associated mutex object is
 									already locked by the same thread the behavior is dependent on the
-									<link linkend="threads.concepts.locking-strategies">locking
+									<link linkend="thread.concepts.locking-strategies">locking
 									strategy</link> of the associated mutex object.</para>
 								</entry>
 							</row>
@@ -532,15 +546,15 @@
 				</table>
 			</section>
 		
-			<section id="threads.concepts.ScopedTryLock">
+			<section id="thread.concepts.ScopedTryLock">
 				<title>ScopedTryLock Concept</title>
 				
 				<para>A ScopedTryLock is a refinement of <link
-				linkend="threads.concepts.TryLock">TryLock</link>. 
+				linkend="thread.concepts.TryLock">TryLock</link>. 
 				For a ScopedTryLock type <code>L</code> 
 				and an object <code>lk</code> of that type, 
 				and an object <code>m</code> of a type meeting the 
-				<link linkend="threads.concepts.TryMutex">TryMutex</link> requirements, 
+				<link linkend="thread.concepts.TryMutex">TryMutex</link> requirements, 
 				and an object <code>b</code> of type <code>bool</code>, 
 				the following expressions must be well-formed 
 				and have the indicated effects.</para>
@@ -574,11 +588,11 @@
 				</table>
 			</section>
 		
-			<section id="threads.concepts.TimedLock">
+			<section id="thread.concepts.TimedLock">
 				<title>TimedLock Concept</title>
 				
 				<para>A TimedLock is a refinement of <link
-				linkend="threads.concepts.TryLock">TryLock</link>. 
+				linkend="thread.concepts.TryLock">TryLock</link>. 
 				For a TimedLock type <code>L</code> 
 				and an object <code>lk</code> of that type, 
 				and an object <code>t</code> of type <classname>boost::xtime</classname>, 
@@ -607,7 +621,7 @@
 									if successful within the specified time <code>t</code>, otherwise
 									<code>false</code>. If the associated mutex object is already
 									locked by the same thread the behavior is dependent on the <link
-									linkend="threads.concepts.locking-strategies">locking
+									linkend="thread.concepts.locking-strategies">locking
 									strategy</link> of the associated mutex object.</para>
 								</entry>
 							</row>
@@ -616,15 +630,15 @@
 				</table>
 			</section>
 		
-			<section id="threads.concepts.ScopedTimedLock">
+			<section id="thread.concepts.ScopedTimedLock">
 				<title>ScopedTimedLock Concept</title>
 				
 				<para>A ScopedTimedLock is a refinement of <link
-				linkend="threads.concepts.TimedLock">TimedLock</link>. 
+				linkend="thread.concepts.TimedLock">TimedLock</link>. 
 				For a ScopedTimedLock type <code>L</code> 
 				and an object <code>lk</code> of that type, 
 				and an object <code>m</code> of a type meeting the 
-				<link linkend="threads.concepts.TimedMutex">TimedMutex</link> requirements, 
+				<link linkend="thread.concepts.TimedMutex">TimedMutex</link> requirements, 
 				and an object <code>b</code> of type <code>bool</code>, 
 				and an object <code>t</code> of type <classname>boost::xtime</classname>, 
 				the following expressions must be well-formed 
@@ -659,11 +673,11 @@
 			</section>
 		</section>
 
-		<section id="threads.concepts.lock-models">
+		<section id="thread.concepts.lock-models">
 			<title>Lock Models</title>
 			
-			<para>&Boost.Threads; currently supplies twelve models of
-			<link linkend="threads.concepts.Lock">Lock</link>
+			<para>&Boost.Thread; currently supplies twelve models of
+			<link linkend="thread.concepts.Lock">Lock</link>
 			and its refinements.</para>
 			
 			<table>
@@ -680,13 +694,13 @@
 					
 					<tbody>
 						<row>
-							<entry><link linkend="threads.concepts.Lock">Lock</link></entry>
+							<entry><link linkend="thread.concepts.Lock">Lock</link></entry>
 							<entry></entry>
 							<entry></entry>
 						</row>
 						<row>
-							<entry><link linkend="threads.concepts.ScopedLock">ScopedLock</link></entry>
-							<entry><link linkend="threads.concepts.Lock">Lock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedLock">ScopedLock</link></entry>
+							<entry><link linkend="thread.concepts.Lock">Lock</link></entry>
 							<entry>
 								<para><classname>boost::mutex::scoped_lock</classname></para>
 								<para><classname>boost::recursive_mutex::scoped_lock</classname></para>
@@ -699,13 +713,13 @@
 							</entry>
 						</row>
 						<row>
-							<entry><link linkend="threads.concepts.TryLock">TryLock</link></entry>
-							<entry><link linkend="threads.concepts.Lock">Lock</link></entry>
+							<entry><link linkend="thread.concepts.TryLock">TryLock</link></entry>
+							<entry><link linkend="thread.concepts.Lock">Lock</link></entry>
 							<entry></entry>
 						</row>
 						<row>
-							<entry><link linkend="threads.concepts.ScopedTryLock">ScopedTryLock</link></entry>
-							<entry><link linkend="threads.concepts.TryLock">TryLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTryLock">ScopedTryLock</link></entry>
+							<entry><link linkend="thread.concepts.TryLock">TryLock</link></entry>
 							<entry>
 								<para><classname>boost::try_mutex::scoped_try_lock</classname></para>
 								<para><classname>boost::recursive_try_mutex::scoped_try_lock</classname></para>
@@ -715,13 +729,13 @@
 							</entry>
 						</row>
 						<row>
-							<entry><link linkend="threads.concepts.TimedLock">TimedLock</link></entry>
-							<entry><link linkend="threads.concepts.TryLock">TryLock</link></entry>
+							<entry><link linkend="thread.concepts.TimedLock">TimedLock</link></entry>
+							<entry><link linkend="thread.concepts.TryLock">TryLock</link></entry>
 							<entry></entry>
 						</row>
 						<row>
-							<entry><link linkend="threads.concepts.ScopedTimedLock">ScopedTimedLock</link></entry>
-							<entry><link linkend="threads.concepts.TimedLock">TimedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTimedLock">ScopedTimedLock</link></entry>
+							<entry><link linkend="thread.concepts.TimedLock">TimedLock</link></entry>
 							<entry>
 								<para><classname>boost::timed_mutex::scoped_timed_lock</classname></para>
 								<para><classname>boost::recursive_timed_mutex::scoped_timed_lock</classname></para>
@@ -733,21 +747,26 @@
 		</section>
 	</section>
 
-	<section id="threads.concepts.read-write-mutexes">
+	<section id="thread.concepts.read-write-mutexes">
 	<title>Read/Write Mutexes</title>
-		<note>Since the read/write mutex and related classes are new,
-		both interface and implementation are liable to change
-		in future releases of &Boost.Threads;.
-		The lock concepts and lock promotion and demotion in particular 
-		are still under discussion and very likely to change.</note>
+        <note> Unfortunately it turned out that the current implementation has
+            some serious problems. So it was decided not to put this implementation into
+            release grade code. Also discussions on the mailing list led to the
+            conclusion that the current concepts need to be rethought. In particular
+            the schedulings <link linkend="thread.concepts.read-write-scheduling-policies.inter-class">
+                Inter-Class Scheduling Policies</link> are deemed unnecessary.
+            There seems to be common belief that a fair scheme suffices.
+            The following documentation has been retained however, to give
+            readers of this document the opportunity to study the original design.
+        </note>
 
-		<para>A read/write mutex (short for reader/writer mutual-exclusion) object
+        <para>A read/write mutex (short for reader/writer mutual-exclusion) object
 		is used to serialize access to a resource shared between multiple 
 		threads, where multiple "readers" can share simultaneous access, but 
 		"writers" require exclusive access. The
-		<link linkend="threads.concepts.ReadWriteMutex">ReadWriteMutex</link> concept, with 
-		<link linkend="threads.concepts.TryReadWriteMutex">TryReadWriteMutex</link> and 
-		<link linkend="threads.concepts.TimedReadWriteMutex"> TimedReadWriteMutex</link>
+		<link linkend="thread.concepts.ReadWriteMutex">ReadWriteMutex</link> concept, with 
+		<link linkend="thread.concepts.TryReadWriteMutex">TryReadWriteMutex</link> and 
+		<link linkend="thread.concepts.TimedReadWriteMutex"> TimedReadWriteMutex</link>
 		refinements formalize the requirements. A model that implements 
 		ReadWriteMutex and its refinements has three states: 
 		<emphasis role="bold">read-locked</emphasis>,
@@ -755,19 +774,19 @@
 		<emphasis role="bold">unlocked</emphasis>.
 		Before reading from a shared resource, a thread 
 		<emphasis role="bold">read-locks</emphasis> 
-		a &Boost.Threads; read/write mutex object
+		a &Boost.Thread; read/write mutex object
 		(an object whose type is a model of
-		<link linkend="threads.concepts.ReadWriteMutex">ReadWriteMutex</link>
+		<link linkend="thread.concepts.ReadWriteMutex">ReadWriteMutex</link>
 		or one of it's refinements), ensuring 
-		<link linkend="threads.glossary.thread-safe">thread-safe</link>
+		<link linkend="thread.glossary.thread-safe">thread-safe</link>
 		access for reading from the shared resource. Before writing 
 		to a shared resource, a thread 
-		<emphasis role="bold">write-locks</emphasis> a &Boost.Threads; 
+		<emphasis role="bold">write-locks</emphasis> a &Boost.Thread; 
 		read/write mutex object
 		(an object whose type is a model of
-		<link linkend="threads.concepts.ReadWriteMutex">ReadWriteMutex</link>
+		<link linkend="thread.concepts.ReadWriteMutex">ReadWriteMutex</link>
 		or one of it's refinements), ensuring 
-		<link linkend="threads.glossary.thread-safe">thread-safe</link>
+		<link linkend="thread.glossary.thread-safe">thread-safe</link>
 		access for altering the shared resource. When use of the shared 
 		resource is complete, the thread unlocks the mutex object, 
 		allowing another thread to acquire the lock and use the shared 
@@ -781,25 +800,25 @@
 		becomes even greater. When exceptions are thrown, it becomes nearly
 		impossible to ensure that the mutex object is unlocked
 		properly when using these traditional API's. The result is
-		<link linkend="threads.glossary.deadlock">deadlock</link>.</para>
+		<link linkend="thread.glossary.deadlock">deadlock</link>.</para>
 		
 		<para>Many C++ threading libraries use a pattern known as <emphasis>Scoped
 		Locking</emphasis> &cite.SchmidtStalRohnertBuschmann; to free the
 		programmer from the need to explicitly lock and unlock
 		read/write mutex objects. With this  pattern, a 
-		<link linkend="threads.concepts.read-write-lock-concepts">Read/Write Lock</link>
+		<link linkend="thread.concepts.read-write-lock-concepts">Read/Write Lock</link>
 		concept is employed where the lock object's constructor locks
 		the associated read/write mutex object
 		and the destructor automatically does the unlocking. The
-		&Boost.Threads; library takes this pattern to
+		&Boost.Thread; library takes this pattern to
 		the extreme in that 
-		<link linkend="threads.concepts.read-write-lock-concepts">Read/Write Lock</link>
+		<link linkend="thread.concepts.read-write-lock-concepts">Read/Write Lock</link>
 		concepts are the only way to lock and unlock a read/write mutex
 		object: lock and unlock functions are not exposed by any
-		&Boost.Threads; read/write mutex objects. This helps to
+		&Boost.Thread; read/write mutex objects. This helps to
 		ensure safe usage patterns, especially when code throws exceptions.</para>
 		
-		<section id="threads.concepts.read-write-locking-strategies">
+		<section id="thread.concepts.read-write-locking-strategies">
 			<title>Locking Strategies</title>
 			
 			<para>Every read/write mutex object follows one of several locking
@@ -807,7 +826,7 @@
 			operation when the calling thread already owns a lock on the 
 			read/write mutex object.</para>
 			
-			<section id="threads.concepts.read-write-locking-strategies.recursive">
+			<section id="thread.concepts.read-write-locking-strategies.recursive">
 				<title>Recursive Locking Strategy</title>
 
 				<para>With a recursive locking strategy, when a thread attempts
@@ -862,21 +881,21 @@
 				<para>Internally a lock count is maintained and the owning
 				thread must unlock the mutex object the same number of times
 				that it locked it before the mutex object's state returns
-				to unlocked. Since mutex objects in &Boost.Threads; expose
+				to unlocked. Since mutex objects in &Boost.Thread; expose
 				locking functionality only through lock concepts, a thread
 				will always unlock a mutex object the same number of times
 				that it locked it. This helps to eliminate a whole set of
 				errors typically found in traditional C style thread APIs.
 				</para>
 				
-				<para>&Boost.Threads; does not currently provide any read/write mutex objects 
+				<para>&Boost.Thread; does not currently provide any read/write mutex objects 
 				that use this strategy.  A successful implementation of this locking strategy
 				may require
-				<link linkend="threads.concepts.read-write-locking-strategies.thread-identification">thread identification</link>.
+				<link linkend="thread.concepts.read-write-locking-strategies.thread-identification">thread identification</link>.
 				</para>
 			</section>
 			
-			<section id="threads.concepts.read-write-locking-strategies.checked">
+			<section id="thread.concepts.read-write-locking-strategies.checked">
 				<title>Checked Locking Strategy</title>
 
 				<para>With a checked locking strategy, when a thread attempts
@@ -886,7 +905,7 @@
 				acquisition which is a normal operation for ANY ReadWriteMutex.
 				Further, attempts by a thread to unlock a mutex that was not
 				locked by the thread will also return some sort of error
-				indication. In &Boost.Threads;, an exception of type 
+				indication. In &Boost.Thread;, an exception of type 
 				<classname>boost::lock_error</classname> would be thrown in
 				these cases.</para>
 
@@ -925,20 +944,20 @@
 					</tgroup>
 				</informaltable>
 				
-				<para>&Boost.Threads; does not currently provide any read/write mutex objects 
+				<para>&Boost.Thread; does not currently provide any read/write mutex objects 
 				that use this strategy.  A successful implementation of this locking strategy
 				may require
-				<link linkend="threads.concepts.read-write-locking-strategies.thread-identification">thread identification</link>.
+				<link linkend="thread.concepts.read-write-locking-strategies.thread-identification">thread identification</link>.
 				</para>
 			</section>
 			
-			<section id="threads.concepts.read-write-locking-strategies.unchecked">
+			<section id="thread.concepts.read-write-locking-strategies.unchecked">
 				<title>Unchecked Locking Strategy</title>
 
 				<para>With an unchecked locking strategy, when a thread
 				attempts to acquire a lock on the read/write mutex object
 				for which the thread already owns a lock, the operation 
-				will <link linkend="threads.glossary.deadlock">deadlock</link>.
+				will <link linkend="thread.glossary.deadlock">deadlock</link>.
 				In general this locking strategy is less safe than a checked
 				or recursive strategy, but it can be a faster strategy and so
 				is employed by many libraries.</para>
@@ -962,38 +981,38 @@
 							<row> 
 								<entry>read-lock</entry>
 								<entry>write-lock</entry>
-								<entry><link linkend="threads.glossary.deadlock">Deadlock</link></entry>
+								<entry><link linkend="thread.glossary.deadlock">Deadlock</link></entry>
 							</row>
 							<row> 
 								<entry>write-locked</entry>
 								<entry>read-lock</entry>
-								<entry><link linkend="threads.glossary.deadlock">Deadlock</link></entry>
+								<entry><link linkend="thread.glossary.deadlock">Deadlock</link></entry>
 							</row>
 							<row> 
 								<entry>write-locked</entry>
 								<entry>write-lock</entry>
-								<entry><link linkend="threads.glossary.deadlock">Deadlock</link></entry>
+								<entry><link linkend="thread.glossary.deadlock">Deadlock</link></entry>
 							</row>
 						</tbody>
 					</tgroup>
 				</informaltable>
 				
-				<para>&Boost.Threads; does not currently provide any mutex
+				<para>&Boost.Thread; does not currently provide any mutex
 				objects that use this strategy.  For ReadWriteMutexes on
 				platforms that contain natively recursive synchronization
 				primitives, implementing a guaranteed-deadlock can actually
 				involve extra work, and would likely require 
-				<link linkend="threads.concepts.read-write-locking-strategies.thread-identification">thread identification</link>.
+				<link linkend="thread.concepts.read-write-locking-strategies.thread-identification">thread identification</link>.
 				</para>
   			</section>
 			
-			<section id="threads.concepts.read-write-locking-strategies.unspecified">
+			<section id="thread.concepts.read-write-locking-strategies.unspecified">
 				<title>Unspecified Locking Strategy</title>
 
 				<para>With an unspecified locking strategy, when a thread
 				attempts to acquire a lock on a read/write mutex object for
 				which the thread already owns a lock, the operation results 
-				in <link linkend="threads.glossary.undefined-behavior">undefined behavior</link>.
+				in <link linkend="thread.glossary.undefined-behavior">undefined behavior</link>.
 				When a read/write mutex object has an unspecified locking 
 				strategy the programmer must assume that the read/write mutex
 				object instead uses an unchecked strategy as the worse case,
@@ -1020,18 +1039,18 @@
 								<entry>read-lock</entry>
 								<entry>write-lock</entry>
 								<entry> 
-								<link linkend="threads.glossary.undefined-behavior">Undefined</link>, but generally <link linkend="threads.glossary.deadlock">deadlock</link>
+								<link linkend="thread.glossary.undefined-behavior">Undefined</link>, but generally <link linkend="thread.glossary.deadlock">deadlock</link>
 							</entry>
 							</row>
 							<row> 
 								<entry>write-locked</entry>
 								<entry>read-lock</entry>
-								<entry><link linkend="threads.glossary.undefined-behavior">Undefined</link>, but generally <link linkend="threads.glossary.deadlock">deadlock</link></entry>
+								<entry><link linkend="thread.glossary.undefined-behavior">Undefined</link>, but generally <link linkend="thread.glossary.deadlock">deadlock</link></entry>
 							</row>
 							<row> 
 								<entry>write-locked</entry>
 								<entry>write-lock</entry>
-								<entry><link linkend="threads.glossary.undefined-behavior">Undefined</link>, but generally <link linkend="threads.glossary.deadlock">deadlock</link></entry>
+								<entry><link linkend="thread.glossary.undefined-behavior">Undefined</link>, but generally <link linkend="thread.glossary.deadlock">deadlock</link></entry>
 							</row>
 						</tbody>
 					</tgroup>
@@ -1050,7 +1069,7 @@
 				use this locking strategy despite the lack of safety.</para>
 			</section>
 			
-			<section id="threads.concepts.read-write-locking-strategies.thread-identification">
+			<section id="thread.concepts.read-write-locking-strategies.thread-identification">
 				<title>Thread Identification</title>
 
 				<para>ReadWriteMutexes can support specific Locking Strategies 
@@ -1073,17 +1092,17 @@
 				a recursive or checked ReadWriteMutex while still providing
 				flexibility in terms of Scheduling Policies. </para>
 				
-				<para>Please refer to the &Boost.Threads;
-				<link linkend="threads.concepts.read-write-mutex-concepts">read/write mutex concept</link> 
+				<para>Please refer to the &Boost.Thread;
+				<link linkend="thread.concepts.read-write-mutex-concepts">read/write mutex concept</link> 
 				documentation for a discussion of locking strategies.
 				The read/write mutex supports only the
-				<link linkend="threads.concepts.read-write-locking-strategies.unspecified">unspecified</link>
+				<link linkend="thread.concepts.read-write-locking-strategies.unspecified">unspecified</link>
 				locking strategy. ReadWriteMutexes are parameterized on a
 				Mutex type which they use to control write-locking 
 				and access to internal state.</para>
 			</section>
 			
-			<section id="threads.concepts.read-write-locking-strategies.promotion">
+			<section id="thread.concepts.read-write-locking-strategies.promotion">
 				<title>Lock Promotion</title>
 
 				<para>ReadWriteMutexes can support lock promotion, where a
@@ -1097,12 +1116,12 @@
 				both threads will be waiting for the other to release their read-lock.
 				</para>
 				
-				<para>Currently, &Boost.Threads; supports lock promotion
+				<para>Currently, &Boost.Thread; supports lock promotion
 				through <code>promote()</code>, <code>try_promote()</code>,
 				and <code>timed_promote()</code> operations.</para>
 			</section>
 			
-			<section id="threads.concepts.read-write-locking-strategies.demotion">
+			<section id="thread.concepts.read-write-locking-strategies.demotion">
 				<title>Lock Demotion</title>
 
 				<para>ReadWriteMutexes can support lock demotion, where a
@@ -1113,13 +1132,13 @@
 				during lock promotion is not a problem for lock
 				demotion.</para>
 				
-				<para>Currently, &Boost.Threads; supports lock demotion
+				<para>Currently, &Boost.Thread; supports lock demotion
 				through <code>demote()</code>, <code>try_demote()</code>,
 				and <code>timed_demote()</code> operations.</para>
 			</section>
 		</section>
 		
-		<section id="threads.concepts.read-write-scheduling-policies">
+		<section id="thread.concepts.read-write-scheduling-policies">
 			<title>Scheduling Policies</title>
 			
 			<para>Every read/write mutex object follows one of several scheduling
@@ -1139,10 +1158,10 @@
 			waiting for the same type of lock) will acquire the thread.
 			</para>
 			
-			<section id="threads.concepts.read-write-scheduling-policies.inter-class">
+			<section id="thread.concepts.read-write-scheduling-policies.inter-class">
 				<title>Inter-Class Scheduling Policies</title>
 				
-				<section id="threads.concepts.read-write-scheduling-policies.reader-priority">	
+				<section id="thread.concepts.read-write-scheduling-policies.reader-priority">	
 					<title>ReaderPriority</title>
 					
 					<para>With ReaderPriority scheduling, any pending request for
@@ -1230,7 +1249,7 @@
 					</informaltable>
 				</section>
 
-				<section id="threads.concepts.read-write-scheduling-policies.writer-priority">
+				<section id="thread.concepts.read-write-scheduling-policies.writer-priority">
 					<title>WriterPriority</title>
 					
 					<para>With WriterPriority scheduling, any pending request
@@ -1319,7 +1338,7 @@
 					</informaltable>
 				</section>
 				
-				<section id="threads.concepts.read-write-scheduling-policies.alternating-many-reads">
+				<section id="thread.concepts.read-write-scheduling-policies.alternating-many-reads">
 					<title>AlternatingPriority/ManyReads</title>
 					
 					<para>With AlternatingPriority/ManyReads scheduling, reader
@@ -1417,7 +1436,7 @@
 					</informaltable>
 				</section>
 				
-				<section id="threads.concepts.read-write-scheduling-policies.alternating-single-read">
+				<section id="thread.concepts.read-write-scheduling-policies.alternating-single-read">
 					<title>AlternatingPriority/SingleRead</title>
 					
 					<para>With AlternatingPriority/SingleRead scheduling, reader
@@ -1517,34 +1536,34 @@
 				</section>
 			</section>
 			
-			<section id="threads.concepts.read-write-scheduling-policies.intra-class">
+			<section id="thread.concepts.read-write-scheduling-policies.intra-class">
 				<title>Intra-Class Scheduling Policies</title>
 				
 				<para>Please refer to 
-				<xref linkend="threads.concepts.sheduling-policies" />
+				<xref linkend="thread.concepts.sheduling-policies" />
 				for a discussion of mutex scheduling policies, which are identical to 
 				read/write mutex intra-class scheduling policies.</para>
 				
 				<para>For threads waiting to obtain write-locks, the read/write mutex
 				supports only the 
-				<link linkend="threads.concepts.unspecified-scheduling-policy">Unspecified</link>
+				<link linkend="thread.concepts.unspecified-scheduling-policy">Unspecified</link>
 				intra-class scheduling policy. That is, given a set of threads
 				waiting for write-locks, the order, relative to one another, in
 				which they receive the write-lock is unspecified.</para>
 				
 				<para>For threads waiting to obtain read-locks, the read/write mutex
 				supports only the 
-				<link linkend="threads.concepts.unspecified-scheduling-policy">Unspecified</link>
+				<link linkend="thread.concepts.unspecified-scheduling-policy">Unspecified</link>
 				intra-class scheduling policy. That is, given a set of threads
 				waiting for read-locks, the order, relative to one another, in
 				which they receive the read-lock is unspecified.</para>
 			</section>
 		</section>
 
-		<section id="threads.concepts.read-write-mutex-concepts">
+		<section id="thread.concepts.read-write-mutex-concepts">
 			<title>Mutex Concepts</title>
 			
-			<section id="threads.concepts.ReadWriteMutex">
+			<section id="thread.concepts.ReadWriteMutex">
 				<title>ReadWriteMutex Concept</title>
 				
 				<para>A ReadWriteMutex object has three states: read-locked,
@@ -1587,19 +1606,19 @@
 							<row> 
 								<entry><code>M::scoped_read_write_lock</code></entry>
 								<entry>A type meeting the 
-								<link linkend="threads.concepts.ScopedReadWriteLock">ScopedReadWriteLock</link>
+								<link linkend="thread.concepts.ScopedReadWriteLock">ScopedReadWriteLock</link>
 								requirements. </entry>
 							</row>
 							<row> 
 								<entry><code>M::scoped_read_lock</code></entry>
 								<entry>A type meeting the 
-								<link linkend="threads.concepts.ScopedLock">ScopedLock</link>
+								<link linkend="thread.concepts.ScopedLock">ScopedLock</link>
 								requirements. </entry>
 							</row>
 							<row> 
 								<entry><code>M::scoped_write_lock</code></entry>
 								<entry>A type meeting the 
-								<link linkend="threads.concepts.ScopedLock">ScopedLock</link>
+								<link linkend="thread.concepts.ScopedLock">ScopedLock</link>
 								requirements. </entry>
 							</row>
 						</tbody>
@@ -1607,11 +1626,11 @@
 				</table>
 			</section>
 			
-			<section id="threads.concepts.TryReadWriteMutex">
+			<section id="thread.concepts.TryReadWriteMutex">
 				<title>TryReadWriteMutex Concept</title>
 				
 				<para>A TryReadWriteMutex is a refinement of
-				<link linkend="threads.concepts.ReadWriteMutex">ReadWriteMutex</link>.
+				<link linkend="thread.concepts.ReadWriteMutex">ReadWriteMutex</link>.
 				For a TryReadWriteMutex type <code>M</code> 
 				and an object <code>m</code> of that type,
 				the following expressions must be well-formed 
@@ -1632,19 +1651,19 @@
 							<row> 
 								<entry><code>M::scoped_try_read_write_lock</code></entry>
 								<entry>A type meeting the 
-								<link linkend="threads.concepts.ScopedTryReadWriteLock">ScopedTryReadWriteLock</link>
+								<link linkend="thread.concepts.ScopedTryReadWriteLock">ScopedTryReadWriteLock</link>
 								requirements.</entry>
 							</row>
 							<row> 
 								<entry><code>M::scoped_try_read_lock</code></entry>
 								<entry>A type meeting the 
-								<link linkend="threads.concepts.ScopedTryLock">ScopedTryLock</link>
+								<link linkend="thread.concepts.ScopedTryLock">ScopedTryLock</link>
 								requirements.</entry>
 							</row>
 							<row> 
 								<entry><code>M::scoped_try_write_lock</code></entry>
 								<entry>A type meeting the 
-								<link linkend="threads.concepts.ScopedTryLock">ScopedTryLock</link>
+								<link linkend="thread.concepts.ScopedTryLock">ScopedTryLock</link>
 								requirements.</entry>
 							</row>
 						</tbody>
@@ -1652,11 +1671,11 @@
 				</table>
 			</section>
 			
-			<section id="threads.concepts.TimedReadWriteMutex">
+			<section id="thread.concepts.TimedReadWriteMutex">
 				<title>TimedReadWriteMutex Concept</title>
 				
 				<para>A TimedReadWriteMutex is a refinement of
-				<link linkend="threads.concepts.TryReadWriteMutex">TryReadWriteMutex</link>.
+				<link linkend="thread.concepts.TryReadWriteMutex">TryReadWriteMutex</link>.
 				For a TimedReadWriteMutex type <code>M</code> 
 				and an object <code>m</code> of that type
 				the following expressions must be well-formed 
@@ -1677,19 +1696,19 @@
 							<row> 
 								<entry><code>M::scoped_timed_read_write_lock</code></entry>
 								<entry>A type meeting the 
-								<link linkend="threads.concepts.ScopedTimedReadWriteLock">ScopedTimedReadWriteLock</link> 
+								<link linkend="thread.concepts.ScopedTimedReadWriteLock">ScopedTimedReadWriteLock</link> 
 								requirements.</entry>
 							</row>
 							<row> 
 								<entry><code>M::scoped_timed_read_lock</code></entry>
 								<entry>A type meeting the 
-								<link linkend="threads.concepts.ScopedTimedLock">ScopedTimedLock</link> 
+								<link linkend="thread.concepts.ScopedTimedLock">ScopedTimedLock</link> 
 								requirements.</entry>
 							</row>
 							<row> 
 								<entry><code>M::scoped_timed_write_lock</code></entry>
 								<entry>A type meeting the 
-								<link linkend="threads.concepts.ScopedTimedLock">ScopedTimedLock</link> 
+								<link linkend="thread.concepts.ScopedTimedLock">ScopedTimedLock</link> 
 								requirements.</entry>
 							</row>
 						</tbody>
@@ -1698,11 +1717,11 @@
 			</section>
 		</section>
 		
-		<section id="threads.concepts.read-write-mutex-models">
+		<section id="thread.concepts.read-write-mutex-models">
 			<title>Mutex Models</title>
 			
-			<para>&Boost.Threads; currently supplies three models of
-			<link linkend="threads.concepts.ReadWriteMutex">ReadWriteMutex</link>
+			<para>&Boost.Thread; currently supplies three models of
+			<link linkend="thread.concepts.ReadWriteMutex">ReadWriteMutex</link>
 			and its refinements.</para>
 			
 			<table>
@@ -1719,18 +1738,18 @@
 
 					<tbody>
 						<row> 
-							<entry><link linkend="threads.concepts.ReadWriteMutex">ReadWriteMutex</link></entry>
+							<entry><link linkend="thread.concepts.ReadWriteMutex">ReadWriteMutex</link></entry>
 							<entry></entry>
 							<entry><classname>boost::read_write_mutex</classname></entry>
 						</row>
 						<row> 
-							<entry><link linkend="threads.concepts.TryReadWriteMutex">TryReadWriteMutex</link></entry>
-							<entry><link linkend="threads.concepts.ReadWriteMutex">ReadWriteMutex</link></entry>
+							<entry><link linkend="thread.concepts.TryReadWriteMutex">TryReadWriteMutex</link></entry>
+							<entry><link linkend="thread.concepts.ReadWriteMutex">ReadWriteMutex</link></entry>
 							<entry><classname>boost::try_read_write_mutex</classname></entry>
 						</row>
 						<row> 
-							<entry><link linkend="threads.concepts.TimedReadWriteMutex">TimedReadWriteMutex</link></entry>
-							<entry><link linkend="threads.concepts.TryReadWriteMutex">TryReadWriteMutex</link></entry>
+							<entry><link linkend="thread.concepts.TimedReadWriteMutex">TimedReadWriteMutex</link></entry>
+							<entry><link linkend="thread.concepts.TryReadWriteMutex">TryReadWriteMutex</link></entry>
 							<entry><classname>boost::timed_read_write_mutex</classname></entry>
 						</row>
 					</tbody>
@@ -1738,19 +1757,19 @@
 			</table>
 		</section>
 				
-		<section id="threads.concepts.read-write-lock-concepts">
+		<section id="thread.concepts.read-write-lock-concepts">
 			<title>Lock Concepts</title>
 
 			<para>A read/write lock object provides a safe means for locking
 			and unlocking a read/write mutex object (an object whose type is
 			a model of 
-			<link linkend="threads.concepts.ReadWriteMutex">ReadWriteMutex</link> 
+			<link linkend="thread.concepts.ReadWriteMutex">ReadWriteMutex</link> 
 			or one of its refinements). In other words they are an
 			implementation of the <emphasis>Scoped Locking</emphasis>
 			&cite.SchmidtStalRohnertBuschmann; pattern. The 
-			<link linkend="threads.concepts.ScopedReadWriteLock">ScopedReadWriteLock</link>, 
-			<link linkend="threads.concepts.ScopedTryReadWriteLock">ScopedTryReadWriteLock</link>, and 
-			<link linkend="threads.concepts.ScopedTimedReadWriteLock">ScopedTimedReadWriteLock</link>
+			<link linkend="thread.concepts.ScopedReadWriteLock">ScopedReadWriteLock</link>, 
+			<link linkend="thread.concepts.ScopedTryReadWriteLock">ScopedTryReadWriteLock</link>, and 
+			<link linkend="thread.concepts.ScopedTimedReadWriteLock">ScopedTimedReadWriteLock</link>
 			concepts formalize the requirements.</para>
 			
 			<para>Read/write lock objects are constructed with a reference to a
@@ -1762,13 +1781,13 @@
 			
 			<para>Read/write lock objects are meant to be short lived, expected
 			to be used at block scope only. The read/write lock objects are not 
-			<link linkend="threads.glossary.thread-safe">thread-safe</link>.
+			<link linkend="thread.glossary.thread-safe">thread-safe</link>.
 			Read/write lock objects must maintain state to indicate whether or
 			not they've been locked and this state is not protected by any
 			synchronization concepts. For this reason a read/write lock object
 			should never be shared between multiple threads.</para>
 			
-			<section id="threads.concepts.ReadWriteLock">
+			<section id="thread.concepts.ReadWriteLock">
 				<title>ReadWriteLock Concept</title>
 				
 				<para>For a read/write lock type <code>L</code>
@@ -1829,36 +1848,36 @@
 									<para>If the associated read/write mutex
 									object is already read-locked by some other
 									thread, the effect depends on the
-									<link linkend="threads.concepts.read-write-scheduling-policies.inter-class">inter-class scheduling policy</link>
+									<link linkend="thread.concepts.read-write-scheduling-policies.inter-class">inter-class scheduling policy</link>
 									of the associated read/write mutex:
 									either immediately obtains an additional
 									read-lock on the associated read/write
 									mutex, or places the current thread in the
-									<link linkend="threads.glossary.thread-state">Blocked</link>
+									<link linkend="thread.glossary.thread-state">Blocked</link>
 									state until the associated read/write mutex
 									is unlocked, after which the current thread
 									is placed in the 
-									<link linkend="threads.glossary.thread-state">Ready</link>
+									<link linkend="thread.glossary.thread-state">Ready</link>
 									state, eventually to be returned to the 
-									<link linkend="threads.glossary.thread-state">Running</link>
+									<link linkend="thread.glossary.thread-state">Running</link>
 									state.</para>
 									
 									<para>If the associated read/write mutex
 									object is already write-locked by some other
 									thread, places the current thread in the
-									<link linkend="threads.glossary.thread-state">Blocked</link>
+									<link linkend="thread.glossary.thread-state">Blocked</link>
 									state until the associated read/write mutex
 									is unlocked, after which the current thread
 									is placed in the 
-									<link linkend="threads.glossary.thread-state">Ready</link>
+									<link linkend="thread.glossary.thread-state">Ready</link>
 									state, eventually to be returned to the
-									<link linkend="threads.glossary.thread-state">Running</link>
+									<link linkend="thread.glossary.thread-state">Running</link>
 									state.</para>
 
 									<para>If the associated read/write mutex
 									object is already locked by the same thread
 									the behavior is dependent on the
-									<link linkend="threads.concepts.read-write-locking-strategies">locking strategy</link>
+									<link linkend="thread.concepts.read-write-locking-strategies">locking strategy</link>
 									of the associated read/write mutex object.
 									</para>
 									
@@ -1875,19 +1894,19 @@
 									<para>If the associated read/write mutex
 									object is already locked by some other
 									thread, places the current thread in the
-									<link linkend="threads.glossary.thread-state">Blocked</link>
+									<link linkend="thread.glossary.thread-state">Blocked</link>
 									state until the associated read/write mutex
 									is unlocked, after which the current thread
 									is placed in the 
-									<link linkend="threads.glossary.thread-state">Ready</link>
+									<link linkend="thread.glossary.thread-state">Ready</link>
 									state, eventually to be returned to the
-									<link linkend="threads.glossary.thread-state">Running</link>
+									<link linkend="thread.glossary.thread-state">Running</link>
 									state.</para>
 
 									<para>If the associated read/write mutex
 									object is already locked by the same thread
 									the behavior is dependent on the
-									<link linkend="threads.concepts.read-write-locking-strategies">locking strategy</link>
+									<link linkend="thread.concepts.read-write-locking-strategies">locking strategy</link>
 									of the associated read/write mutex object.
 									</para>
 									
@@ -1936,15 +1955,15 @@
 				</table>
 			</section>
 			
-			<section id="threads.concepts.ScopedReadWriteLock">
+			<section id="thread.concepts.ScopedReadWriteLock">
 				<title>ScopedReadWriteLock Concept</title>
 				
 				<para>A ScopedReadWriteLock is a refinement of 
-				<link linkend="threads.concepts.ReadWriteLock">ReadWriteLock</link>. 
+				<link linkend="thread.concepts.ReadWriteLock">ReadWriteLock</link>. 
 				For a ScopedReadWriteLock type <code>L</code> 
 				and an object <code>lk</code> of that type,
 				and an object <code>m</code> of a type meeting the 
-				<link linkend="threads.concepts.ReadWriteMutex">ReadWriteMutex</link> requirements,
+				<link linkend="thread.concepts.ReadWriteMutex">ReadWriteMutex</link> requirements,
 				and an object <code>s</code> of type <code>read_write_lock_state</code>,
 				the following expressions must be well-formed 
 				and have the indicated effects.</para>
@@ -1973,11 +1992,11 @@
 				</table>
 			</section>
 			
-			<section id="threads.concepts.TryReadWriteLock">
+			<section id="thread.concepts.TryReadWriteLock">
 				<title>TryReadWriteLock Expressions</title>
 				
 				<para>A TryReadWriteLock is a refinement of 
-				<link linkend="threads.concepts.ReadWriteLock">ReadWriteLock</link>.
+				<link linkend="thread.concepts.ReadWriteLock">ReadWriteLock</link>.
 				For a TryReadWriteLock type <code>L</code>
 				and an object <code>lk</code> of that type,
 				the following expressions must be well-formed
@@ -2005,7 +2024,7 @@
 									mutex object, returning <code>true</code> if the attempt is successful,
 									otherwise <code>false</code>. If the associated read/write mutex object is
 									already locked by the same thread the behavior is dependent on the
-									<link linkend="threads.concepts.locking-strategies">locking
+									<link linkend="thread.concepts.locking-strategies">locking
 									strategy</link> of the associated read/write mutex object.</para>
 								</entry>
 							</row>
@@ -2019,7 +2038,7 @@
 									mutex object, returning <code>true</code> if the attempt is successful,
 									otherwise <code>false</code>. If the associated read/write mutex object is
 									already locked by the same thread the behavior is dependent on the
-									<link linkend="threads.concepts.locking-strategies">locking
+									<link linkend="thread.concepts.locking-strategies">locking
 									strategy</link> of the associated read/write mutex object.</para>
 								</entry>
 							</row>
@@ -2052,15 +2071,15 @@
 				</table>
 			</section>
 			
-			<section id="threads.concepts.ScopedTryReadWriteLock">
+			<section id="thread.concepts.ScopedTryReadWriteLock">
 				<title>ScopedTryReadWriteLock Expressions</title>
 				
 				<para>A ScopedTryReadWriteLock is a refinement of 
-				<link linkend="threads.concepts.TryReadWriteLock">TryReadWriteLock</link>.
+				<link linkend="thread.concepts.TryReadWriteLock">TryReadWriteLock</link>.
 				For a ScopedTryReadWriteLock type <code>L</code>
 				and an object <code>lk</code> of that type,
 				and an object <code>m</code> of a type meeting the
-				<link linkend="threads.concepts.TryMutex">TryReadWriteMutex</link> requirements,
+				<link linkend="thread.concepts.TryMutex">TryReadWriteMutex</link> requirements,
 				and an object <code>s</code> of type <code>read_write_lock_state</code>,
 				and an object <code>b</code> of type <code>blocking_mode</code>, 
 				the following expressions must be well-formed
@@ -2091,11 +2110,11 @@
 				</table>
 			</section>
 			
-			<section id="threads.concepts.TimedReadWriteLock">
+			<section id="thread.concepts.TimedReadWriteLock">
 				<title>TimedReadWriteLock Concept</title>
 				
 				<para>A TimedReadWriteLock is a refinement of 
-				<link linkend="threads.concepts.TryReadWriteLock">TryReadWriteLock</link>. 
+				<link linkend="thread.concepts.TryReadWriteLock">TryReadWriteLock</link>. 
 				For a TimedReadWriteLock type <code>L</code>
 				and an object <code>lk</code> of that type,
 				and an object <code>t</code> of type <classname>boost::xtime</classname>, 
@@ -2124,7 +2143,7 @@
 									and returns <code>true</code> if successful within the specified time <code>t</code>,
 									otherwise <code>false</code>. If the associated read/write mutex object is already
 									locked by the same thread the behavior is dependent on the <link
-									linkend="threads.concepts.locking-strategies">locking
+									linkend="thread.concepts.locking-strategies">locking
 									strategy</link> of the associated read/write mutex object.</para>
 								</entry>
 							</row>
@@ -2138,7 +2157,7 @@
 									and returns <code>true</code> if successful within the specified time <code>t</code>,
 									otherwise <code>false</code>. If the associated read/write mutex object is already
 									locked by the same thread the behavior is dependent on the <link
-									linkend="threads.concepts.locking-strategies">locking
+									linkend="thread.concepts.locking-strategies">locking
 									strategy</link> of the associated read/write mutex object.</para>
 								</entry>
 							</row>
@@ -2171,15 +2190,15 @@
 				</table>
 			</section>
 			
-			<section id="threads.concepts.ScopedTimedReadWriteLock">
+			<section id="thread.concepts.ScopedTimedReadWriteLock">
 				<title>ScopedTimedReadWriteLock Concept</title>
 				
 				<para>A ScopedTimedReadWriteLock is a refinement of 
-				<link linkend="threads.concepts.TimedReadWriteLock">TimedReadWriteLock</link>. 
+				<link linkend="thread.concepts.TimedReadWriteLock">TimedReadWriteLock</link>. 
 				For a ScopedTimedReadWriteLock type <code>L</code>
 				and an object <code>lk</code> of that type,
 				and an object <code>m</code> of a type meeting the 
-				<link linkend="threads.concepts.TimedReadWriteMutex">TimedReadWriteMutex</link> requirements,
+				<link linkend="thread.concepts.TimedReadWriteMutex">TimedReadWriteMutex</link> requirements,
 				and an object <code>s</code> of type <code>read_write_lock_state</code>,
 				and an object <code>t</code> of type <classname>boost::xtime</classname>, 
 				and an object <code>b</code> of type <code>blocking_mode</code>, 
@@ -2219,11 +2238,11 @@
 			</section>
 		</section>
 
-		<section id="threads.concepts.read-write-lock-models">
+		<section id="thread.concepts.read-write-lock-models">
 			<title>Lock Models</title>
 			
-			<para>&Boost.Threads; currently supplies six models of
-			<link linkend="threads.concepts.ReadWriteLock">ReadWriteLock</link>
+			<para>&Boost.Thread; currently supplies six models of
+			<link linkend="thread.concepts.ReadWriteLock">ReadWriteLock</link>
 			and its refinements.</para>
 			
 			<table>
@@ -2240,13 +2259,13 @@
 					
 					<tbody>
 						<row>
-							<entry><link linkend="threads.concepts.ReadWriteLock">ReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.ReadWriteLock">ReadWriteLock</link></entry>
 							<entry></entry>
 							<entry></entry>
 						</row>
 						<row>
-							<entry><link linkend="threads.concepts.ScopedReadWriteLock">ScopedReadWriteLock</link></entry>
-							<entry><link linkend="threads.concepts.ReadWriteLock">ReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedReadWriteLock">ScopedReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.ReadWriteLock">ReadWriteLock</link></entry>
 							<entry>
 								<para><classname>boost::read_write_mutex::scoped_read_write_lock</classname></para>
 								<para><classname>boost::try_read_write_mutex::scoped_read_write_lock</classname></para>
@@ -2254,26 +2273,26 @@
 							</entry>
 						</row>
 						<row>
-							<entry><link linkend="threads.concepts.TryReadWriteLock">TryReadWriteLock</link></entry>
-							<entry><link linkend="threads.concepts.ReadWriteLock">ReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.TryReadWriteLock">TryReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.ReadWriteLock">ReadWriteLock</link></entry>
 							<entry></entry>
 						</row>
 						<row>
-							<entry><link linkend="threads.concepts.ScopedTryReadWriteLock">ScopedTryReadWriteLock</link></entry>
-							<entry><link linkend="threads.concepts.TryReadWriteLock">TryReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTryReadWriteLock">ScopedTryReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.TryReadWriteLock">TryReadWriteLock</link></entry>
 							<entry>
 								<para><classname>boost::try_read_write_mutex::scoped_try_read_write_lock</classname></para>
 								<para><classname>boost::timed_read_write_mutex::scoped_try_read_write_lock</classname></para>
 							</entry>
 						</row>
 						<row>
-							<entry><link linkend="threads.concepts.TimedReadWriteLock">TimedReadWriteLock</link></entry>
-							<entry><link linkend="threads.concepts.TryReadWriteLock">TryReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.TimedReadWriteLock">TimedReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.TryReadWriteLock">TryReadWriteLock</link></entry>
 							<entry></entry>
 						</row>
 						<row>
-							<entry><link linkend="threads.concepts.ScopedTimedReadWriteLock">ScopedTimedReadWriteLock</link></entry>
-							<entry><link linkend="threads.concepts.TimedReadWriteLock">TimedReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTimedReadWriteLock">ScopedTimedReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.TimedReadWriteLock">TimedReadWriteLock</link></entry>
 							<entry>
 								<para><classname>boost::timed_read_write_mutex::scoped_timed_read_write_lock</classname></para>
 							</entry>

Modified: boost/trunk/libs/thread/doc/condition-ref.xml
===================================================================
--- boost/trunk/libs/thread/doc/condition-ref.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/condition-ref.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
 <header name="boost/thread/condition.hpp"
-  last-revision="$Date: 2006/01/05 00:45:43 $">
+  last-revision="$Date: 2006/10/15 14:52:53 $">
   <namespace name="boost">
     <class name="condition">
       <inherit access="private">
@@ -21,12 +25,12 @@
 
       <description>
         <para>A <classname>condition</classname> object is always used in
-          conjunction with a <link linkend="threads.concepts.mutexes">mutex</link>
+          conjunction with a <link linkend="thread.concepts.mutexes">mutex</link>
           object (an object whose type is a model of a <link
-            linkend="threads.concepts.Mutex">Mutex</link> or one of its
+            linkend="thread.concepts.Mutex">Mutex</link> or one of its
           refinements). The mutex object must be locked prior to waiting on the
           condition, which is verified by passing a lock object (an object whose
-          type is a model of <link linkend="threads.concepts.Lock">Lock</link> or
+          type is a model of <link linkend="thread.concepts.Lock">Lock</link> or
           one of its refinements) to the <classname>condition</classname> object's
           wait functions. Upon blocking on the <classname>condition</classname>
           object, the thread unlocks the mutex object. When the thread returns
@@ -39,8 +43,8 @@
           &cite.SchmidtStalRohnertBuschmann; and &cite.Hoare74;). Monitors are one
           of the most important patterns for creating reliable multithreaded
           programs.</para>
-        <para>See <xref linkend="threads.glossary"/> for definitions of <link
-            linkend="threads.glossary.thread-state">thread states</link>
+        <para>See <xref linkend="thread.glossary"/> for definitions of <link
+            linkend="thread.glossary.thread-state">thread states</link>
           blocked and ready. Note that "waiting" is a synonym for blocked.</para>
       </description>
 
@@ -87,10 +91,10 @@
           </parameter>
 
           <requires><simpara><code>ScopedLock</code> meets the <link
-                linkend="threads.concepts.ScopedLock">ScopedLock</link>
+                linkend="thread.concepts.ScopedLock">ScopedLock</link>
               requirements.</simpara></requires>
           <effects><simpara>Releases the lock on the <link
-                linkend="threads.concepts.mutexes">mutex object</link>
+                linkend="thread.concepts.mutexes">mutex object</link>
               associated with <code>lock</code>, blocks the current thread of execution
               until readied by a call to <code>this->notify_one()</code>
               or<code> this->notify_all()</code>, and then reacquires the
@@ -116,7 +120,7 @@
           </parameter>
 
           <requires><simpara><code>ScopedLock</code> meets the <link
-                linkend="threads.concepts.ScopedLock">ScopedLock</link>
+                linkend="thread.concepts.ScopedLock">ScopedLock</link>
               requirements and the return from <code>pred()</code> is
               convertible to <code>bool</code>.</simpara></requires>
           <effects><simpara>As if: <code>while (!pred())
@@ -141,10 +145,10 @@
           </parameter>
 
           <requires><simpara><code>ScopedLock</code> meets the <link
-                linkend="threads.concepts.ScopedLock">ScopedLock</link>
+                linkend="thread.concepts.ScopedLock">ScopedLock</link>
               requirements.</simpara></requires>
           <effects><simpara>Releases the lock on the <link
-                linkend="threads.concepts.mutexes">mutex object</link>
+                linkend="thread.concepts.mutexes">mutex object</link>
               associated with <code>lock</code>, blocks the current thread of execution
               until readied by a call to <code>this->notify_one()</code>
               or<code> this->notify_all()</code>, or until time <code>xt</code> 
@@ -176,7 +180,7 @@
           </parameter>
 
           <requires><simpara><code>ScopedLock</code> meets the <link
-                linkend="threads.concepts.ScopedLock">ScopedLock</link>
+                linkend="thread.concepts.ScopedLock">ScopedLock</link>
               requirements and the return from <code>pred()</code> is
               convertible to <code>bool</code>.</simpara></requires>
           <effects><simpara>As if: <code>while (!pred()) { if (!timed_wait(lock,

Modified: boost/trunk/libs/thread/doc/configuration.xml
===================================================================
--- boost/trunk/libs/thread/doc/configuration.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/configuration.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,19 +1,23 @@
 <?xml version="1.0" encoding="utf-8" ?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
-<section id="thread.configuration" last-revision="$Date: 2004/07/17 04:33:59 $">
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+<section id="thread.configuration" last-revision="$Date: 2006/10/15 14:52:53 $">
 	<title>Configuration</title>
-	<para>&Boost.Threads; uses several configuration macros in &lt;boost/config.hpp&gt;,
+	<para>&Boost.Thread; uses several configuration macros in &lt;boost/config.hpp&gt;,
 	as well as configuration macros meant to be supplied by the application. These
 	macros are documented here.
 	</para>
 	<section id="thread.configuration.public">
 		<title>Library Defined Public Macros</title>
 		<para>
-	These macros are defined by &Boost.Threads; but are expected to be used
+	These macros are defined by &Boost.Thread; but are expected to be used
 	by application code.
 		</para>
 		<informaltable>
@@ -29,9 +33,9 @@
 						<entry>BOOST_HAS_THREADS</entry>
 						<entry>
 	Indicates that threading support is available. This means both that there
-	is a platform specific implementation for &Boost.Threads; and that
+	is a platform specific implementation for &Boost.Thread; and that
 	threading support has been enabled in a platform specific manner. For instance,
-	on the Win32 platform there&#39;s an implementation for &Boost.Threads;
+	on the Win32 platform there&#39;s an implementation for &Boost.Thread;
 	but unless the program is compiled against one of the multithreading runtimes
 	(often determined by the compiler predefining the macro _MT) the BOOST_HAS_THREADS
 	macro remains undefined.
@@ -44,7 +48,7 @@
 	<section id="thread.configuration.implementation">
 		<title>Library Defined Implementation Macros</title>
 		<para>
-	These macros are defined by &Boost.Threads; and are implementation details
+	These macros are defined by &Boost.Thread; and are implementation details
 	of interest only to implementors.
 		</para>
 		<informaltable>
@@ -60,14 +64,14 @@
 						<entry>BOOST_HAS_WINTHREADS</entry>
 						<entry>
 	Indicates that the platform has the Microsoft Win32 threading libraries,
-	and that they should be used to implement &Boost.Threads;.
+	and that they should be used to implement &Boost.Thread;.
 			            </entry>
 					</row>
 					<row>
 						<entry>BOOST_HAS_PTHREADS</entry>
 						<entry>
 	Indicates that the platform has the POSIX pthreads libraries, and that
-	they should be used to implement &Boost.Threads;.
+	they should be used to implement &Boost.Thread;.
 						</entry>
 					</row>
 					<row>

Modified: boost/trunk/libs/thread/doc/design.xml
===================================================================
--- boost/trunk/libs/thread/doc/design.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/design.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
-<section id="threads.design" last-revision="$Date: 2004/07/17 04:33:59 $">
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+<section id="thread.design" last-revision="$Date: 2006/10/15 14:52:53 $">
   <title>Design</title>
   <para>With client/server and three-tier architectures becoming common place
   in today's world, it's becoming increasingly important for programs to be
@@ -15,18 +19,18 @@
   Further, these APIs are almost universally C APIs and fail to take
   advantage of C++'s strengths, or to address concepts unique to C++, such as
   exceptions.</para>
-  <para>The &Boost.Threads; library is an attempt to define a portable interface
+  <para>The &Boost.Thread; library is an attempt to define a portable interface
   for writing parallel processes in C++.</para>
-  <section id="threads.design.goals">
+  <section id="thread.design.goals">
     <title>Goals</title>
-    <para>The &Boost.Threads; library has several goals that should help to set
+    <para>The &Boost.Thread; library has several goals that should help to set
 	it apart from other solutions. These goals are listed in order of precedence
 	with full descriptions below.
     <variablelist>
 	  <varlistentry>
 	    <term>Portability</term>
 		<listitem>
-          <para>&Boost.Threads; was designed to be highly portable. The goal is
+          <para>&Boost.Thread; was designed to be highly portable. The goal is
 		  for the interface to be easily implemented on any platform that
 		  supports threads, and possibly even on platforms without native thread
 		  support.</para>
@@ -35,8 +39,8 @@
 	  <varlistentry>
         <term>Safety</term>
         <listitem>
-          <para>&Boost.Threads; was designed to be as safe as possible. Writing
-		  <link linkend="threads.glossary.thread-safe">thread-safe</link>
+          <para>&Boost.Thread; was designed to be as safe as possible. Writing
+		  <link linkend="thread.glossary.thread-safe">thread-safe</link>
 		  code is very difficult and successful libraries must strive to
 		  insulate the programmer from dangerous constructs as much as
 		  possible. This is accomplished in several ways:
@@ -45,14 +49,14 @@
               <para>C++ language features are used to make correct usage easy
 			  (if possible) and error-prone usage impossible or at least more
 			  difficult. For example, see the <link
-			  linkend="threads.concepts.Mutex">Mutex</link> and <link
-			  linkend="threads.concepts.Lock">Lock</link> designs, and note
+			  linkend="thread.concepts.Mutex">Mutex</link> and <link
+			  linkend="thread.concepts.Lock">Lock</link> designs, and note
 			  how they interact.</para>
             </listitem>
             <listitem>
               <para>Certain traditional concurrent programming features are
 			  considered so error-prone that they are not provided at all. For
-			  example, see <xref linkend="threads.rationale.events" />.</para>
+			  example, see <xref linkend="thread.rationale.events" />.</para>
             </listitem>
             <listitem>
               <para>Dangerous features, or features which may be misused, are
@@ -65,9 +69,9 @@
       <varlistentry>
 	    <term>Flexibility</term>
 		<listitem>
-		  <para>&Boost.Threads; was designed to be flexible. This goal is often
+		  <para>&Boost.Thread; was designed to be flexible. This goal is often
 		  at odds with <emphasis>safety</emphasis>. When functionality might be
-		  compromised by the desire to keep the interface safe, &Boost.Threads;
+		  compromised by the desire to keep the interface safe, &Boost.Thread;
 		  has been designed to provide the functionality, but to make it's use
 		  prohibitive for general use. In other words, the interfaces have been
 		  designed such that it's usually obvious when something is unsafe, and
@@ -77,11 +81,11 @@
       <varlistentry>
         <term>Efficiency</term>
 		<listitem>
-          <para>&Boost.Threads; was designed to be as efficient as
+          <para>&Boost.Thread; was designed to be as efficient as
 		  possible. When building a library on top of another library there is
 		  always a danger that the result will be so much slower than the
 		  "native" API that programmers are inclined to ignore the higher level
-		  API. &Boost.Threads; was designed to minimize the chances of this
+		  API. &Boost.Thread; was designed to minimize the chances of this
 		  occurring. The interfaces have been crafted to allow an implementation
 		  the greatest chance of being as efficient as possible. This goal is
 		  often at odds with the goal for <emphasis>safety</emphasis>. Every
@@ -94,18 +98,18 @@
   </section>
   <section>
     <title>Iterative Phases</title>
-    <para>Another goal of &Boost.Threads; was to take a dynamic, iterative
+    <para>Another goal of &Boost.Thread; was to take a dynamic, iterative
 	approach in its development. The computing industry is still exploring the
 	concepts of parallel programming. Most thread libraries supply only simple
 	primitive concepts for thread synchronization. These concepts are very
 	simple, but it is very difficult to use them safely or to provide formal
 	proofs for constructs built on top of them. There has been a lot of research
 	into other concepts, such as in "Communicating Sequential Processes."
-	&Boost.Threads; was designed in iterative steps, with each step providing 
+	&Boost.Thread; was designed in iterative steps, with each step providing 
 	the building blocks necessary for the next step and giving the researcher 
 	the tools necessary to explore new concepts in a portable manner.</para>
     <para>Given the goal of following a dynamic, iterative approach
-	&Boost.Threads; shall go through several growth cycles. Each phase in its
+	&Boost.Thread; shall go through several growth cycles. Each phase in its
 	development shall be roughly documented here.</para>
   </section>
   <section>
@@ -119,10 +123,10 @@
 	much help to a programmer who wants to use the library in his multithreaded
 	application. So there's a very great need for portable primitives that will
 	allow the library developer to create <link
-	linkend="threads.glossary.thread-safe">thread-safe</link>
+	linkend="thread.glossary.thread-safe">thread-safe</link>
 	implementations. This need far out weighs the need for portable methods to
 	create and manage threads.</para>
-    <para>Because of this need, the first phase of &Boost.Threads; focuses
+    <para>Because of this need, the first phase of &Boost.Thread; focuses
 	solely on providing portable primitive concepts for thread
 	synchronization. Types provided in this phase include the
 	<classname>boost::mutex</classname>, 
@@ -135,16 +139,16 @@
 	synchronization primitives, though there are others that will be added in
 	later phases.</para>
   </section>
-  <section id="threads.design.phase2">
+  <section id="thread.design.phase2">
     <title>Phase 2, Thread Management and Thread Specific Storage</title>
     <para>This phase addresses the creation and management of threads and
     provides a mechanism for thread specific storage (data associated with a
     thread instance). Thread management is a tricky issue in C++, so this
     phase addresses only the basic needs of multithreaded program. Later
     phases are likely to add additional functionality in this area. This
-    phase of &Boost.Threads; adds the <classname>boost::thread</classname> and
+    phase of &Boost.Thread; adds the <classname>boost::thread</classname> and
 	<classname>boost::thread_specific_ptr</classname> types. With these
-	additions the &Boost.Threads; library can be considered minimal but
+	additions the &Boost.Thread; library can be considered minimal but
 	complete.</para>
   </section>
   <section>

Modified: boost/trunk/libs/thread/doc/entities.xml
===================================================================
--- boost/trunk/libs/thread/doc/entities.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/entities.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,26 +1,31 @@
-<!ENTITY Boost.Threads "<emphasis role='bold'>Boost.Threads</emphasis>">
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+<!ENTITY Boost "<emphasis role='bold'>Boost</emphasis>">
+<!ENTITY Boost.Thread "<emphasis role='bold'>Boost.Thread</emphasis>">
 <!ENTITY Boost.Build "<emphasis role='bold'>Boost.Build</emphasis>">
 <!ENTITY cite.AndrewsSchneider83  "<citation><xref
-linkend='threads.bib.AndrewsSchneider83'
-endterm='threads.bib.AndrewsSchneider83.abbrev'/></citation>">
-<!ENTITY cite.Boost "<citation><xref linkend='threads.bib.Boost'
-endterm='threads.bib.Boost.abbrev'/></citation>">
-<!ENTITY cite.Hansen73 "<citation><xref linkend='threads.bib.Hansen73'
-endterm='threads.bib.Hansen73.abbrev'/></citation>">
-<!ENTITY cite.Butenhof97 "<citation><xref linkend='threads.bib.Butenhof97'
-endterm='threads.bib.Butenhof97.abbrev'/></citation>">
-<!ENTITY cite.Hoare74 "<citation><xref linkend='threads.bib.Hoare74'
-endterm='threads.bib.Hoare74.abbrev'/></citation>">
-<!ENTITY cite.ISO98 "<citation><xref linkend='threads.bib.ISO98'
-endterm='threads.bib.ISO98.abbrev'/></citation>">
+linkend='thread.bib.AndrewsSchneider83'
+endterm='thread.bib.AndrewsSchneider83.abbrev'/></citation>">
+<!ENTITY cite.Boost "<citation><xref linkend='thread.bib.Boost'
+endterm='thread.bib.Boost.abbrev'/></citation>">
+<!ENTITY cite.Hansen73 "<citation><xref linkend='thread.bib.Hansen73'
+endterm='thread.bib.Hansen73.abbrev'/></citation>">
+<!ENTITY cite.Butenhof97 "<citation><xref linkend='thread.bib.Butenhof97'
+endterm='thread.bib.Butenhof97.abbrev'/></citation>">
+<!ENTITY cite.Hoare74 "<citation><xref linkend='thread.bib.Hoare74'
+endterm='thread.bib.Hoare74.abbrev'/></citation>">
+<!ENTITY cite.ISO98 "<citation><xref linkend='thread.bib.ISO98'
+endterm='thread.bib.ISO98.abbrev'/></citation>">
 <!ENTITY cite.McDowellHelmbold89 "<citation><xref
-linkend='threads.bib.McDowellHelmbold89'
-endterm='threads.bib.McDowellHelmbold89.abbrev'/></citation>">
+linkend='thread.bib.McDowellHelmbold89'
+endterm='thread.bib.McDowellHelmbold89.abbrev'/></citation>">
 <!ENTITY cite.SchmidtPyarali "<citation><xref
-linkend='threads.bib.SchmidtPyarali'
-endterm='threads.bib.SchmidtPyarali.abbrev'/></citation>">
+linkend='thread.bib.SchmidtPyarali'
+endterm='thread.bib.SchmidtPyarali.abbrev'/></citation>">
 <!ENTITY cite.SchmidtStalRohnertBuschmann "<citation><xref
-linkend='threads.bib.SchmidtStalRohnertBuschmann'
-endterm='threads.bib.SchmidtStalRohnertBuschmann.abbrev'/></citation>">
-<!ENTITY cite.Stroustrup "<citation><xref linkend='threads.bib.Stroustrup'
-endterm='threads.bib.Stroustrup.abbrev'/></citation>">
+linkend='thread.bib.SchmidtStalRohnertBuschmann'
+endterm='thread.bib.SchmidtStalRohnertBuschmann.abbrev'/></citation>">
+<!ENTITY cite.Stroustrup "<citation><xref linkend='thread.bib.Stroustrup'
+endterm='thread.bib.Stroustrup.abbrev'/></citation>">

Modified: boost/trunk/libs/thread/doc/exceptions-ref.xml
===================================================================
--- boost/trunk/libs/thread/doc/exceptions-ref.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/exceptions-ref.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
 <header name="boost/thread/exceptions.hpp"
-  last-revision="$Date: 2004/07/17 04:33:59 $">
+  last-revision="$Date: 2006/10/15 14:52:53 $">
   <namespace name="boost">
     <class name="lock_error">
 		<purpose>
@@ -34,7 +38,7 @@
 		<purpose>
 			<simpara>The <classname>thread_resource_error</classname> class
 			defines an exception type that is thrown by constructors in the
-			&Boost.Threads; library when thread-related resources can not be 
+			&Boost.Thread; library when thread-related resources can not be 
 			acquired.</simpara>
 		</purpose>
 

Modified: boost/trunk/libs/thread/doc/faq.xml
===================================================================
--- boost/trunk/libs/thread/doc/faq.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/faq.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,45 +1,49 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
-<section id="threads.faq" last-revision="$Date: 2004/07/17 04:33:59 $">
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+<section id="thread.faq" last-revision="$Date: 2007/02/11 13:55:21 $">
   <title>Frequently Asked Questions</title>
   <qandaset>
     <qandaentry>
 	  <question>
 	    <para>Are lock objects <link
-		linkend="threads.glossary.thread-safe">thread safe</link>?</para>
+		linkend="thread.glossary.thread-safe">thread safe</link>?</para>
 	  </question>
 	  <answer>
 	    <para><emphasis role="bold">No!</emphasis> Lock objects are not meant to
 		be shared between threads. They are meant to be short-lived objects
 		created on automatic storage within a code block. Any other usage is
 		just likely to lead to errors and won't really be of actual benefit anyway.
-		Share <link linkend="threads.concepts.mutexes">Mutexes</link>, not
+		Share <link linkend="thread.concepts.mutexes">Mutexes</link>, not
 		Locks. For more information see the <link
-		linkend="threads.rationale.locks">rationale</link> behind the
+		linkend="thread.rationale.locks">rationale</link> behind the
 		design for lock objects.</para>
 	  </answer>
 	</qandaentry>
     <qandaentry>
       <question>
-	    <para>Why was &Boost.Threads; modeled after (specific library
+	    <para>Why was &Boost.Thread; modeled after (specific library
 		name)?</para>
 	  </question>
 	  <answer>
-	    <para>It wasn't. &Boost.Threads; was designed from scratch. Extensive
+	    <para>It wasn't. &Boost.Thread; was designed from scratch. Extensive
 		design discussions involved numerous people representing a wide range of
 		experience across many platforms. To ensure portability, the initial
 		implements were done in parallel using POSIX Threads and the Win32
-		threading API. But the &Boost.Threads; design is very much in the spirit
+		threading API. But the &Boost.Thread; design is very much in the spirit
 		of C++, and thus doesn't model such C based APIs.</para>
 	  </answer>
 	</qandaentry>
 	<qandaentry>
 	  <question>
-	    <para>Why wasn't &Boost.Threads; modeled after (specific library
+	    <para>Why wasn't &Boost.Thread; modeled after (specific library
 	    name)?</para>
 	  </question>
 	  <answer>
@@ -54,12 +58,12 @@
 	</qandaentry>
 	<qandaentry>
 	  <question>
-	    <para>Why do <link linkend="threads.concepts.mutexes">Mutexes</link>
+	    <para>Why do <link linkend="thread.concepts.mutexes">Mutexes</link>
 		have noncopyable semantics?</para>
 	  </question>
 	  <answer>
         <para>To ensure that <link
-		linkend="threads.glossary.deadlock">deadlocks</link> don't occur. The
+		linkend="thread.glossary.deadlock">deadlocks</link> don't occur. The
 		only logical form of copy would be to use some sort of shallow copy
 		semantics in which multiple mutex objects could refer to the same mutex
 		state. This means that if ObjA has a mutex object as part of its state
@@ -73,20 +77,20 @@
 	<qandaentry>
 	  <question>
 	    <para>How can you prevent <link
-		linkend="threads.glossary.deadlock">deadlock</link> from occurring when
+		linkend="thread.glossary.deadlock">deadlock</link> from occurring when
 		a thread must lock multiple mutexes?</para>
 	  </question>
 	  <answer>
 	    <para>Always lock them in the same order. One easy way of doing this is
 		to use each mutex's address to determine the order in which they are
-		locked. A future &Boost.Threads; concept may wrap this pattern up in a
+		locked. A future &Boost.Thread; concept may wrap this pattern up in a
 		reusable class.</para>
 	  </answer>
 	</qandaentry>
 	<qandaentry>
 	  <question>
 	    <para>Don't noncopyable <link
-		linkend="threads.concepts.mutexes">Mutex</link> semantics mean that a
+		linkend="thread.concepts.mutexes">Mutex</link> semantics mean that a
 		class with a mutex member will be noncopyable as well?</para>
 	  </question>
 	  <answer>
@@ -94,7 +98,7 @@
 		copy constructor and assignment operator, so they will have to be coded
 		explicitly. This is a <emphasis role="bold">good thing</emphasis>,
 		however, since the compiler generated operations would not be <link
-		linkend="threads.glossary.thread-safe">thread-safe</link>. The following
+		linkend="thread.glossary.thread-safe">thread-safe</link>. The following
 		is a simple example of a class with copyable semantics and internal
         synchronization through a mutex member.</para>
 <programlisting>
@@ -144,7 +148,7 @@
 	<qandaentry>
 	  <question>
 	    <para>How can you lock a <link
-		linkend="threads.concepts.mutexes">Mutex</link> member in a const member
+		linkend="thread.concepts.mutexes">Mutex</link> member in a const member
 		function, in order to implement the Monitor Pattern?</para>
 	  </question>
 	  <answer>
@@ -165,8 +169,8 @@
 	  </question>
 	  <answer>
 	    <para>Condition variables result in user code much less prone to <link
-		linkend="threads.glossary.race-condition">race conditions</link> than
-		event variables. See <xref linkend="threads.rationale.events" /> 
+		linkend="thread.glossary.race-condition">race conditions</link> than
+		event variables. See <xref linkend="thread.rationale.events" /> 
 		for analysis. Also see &cite.Hoare74; and &cite.SchmidtStalRohnertBuschmann;.
 		</para>
 	  </answer>
@@ -177,7 +181,7 @@
 	  </question>
 	  <answer>
 	    <para>There's a valid need for thread termination, so at some point
-		&Boost.Threads; probably will include it, but only after we can find a
+		&Boost.Thread; probably will include it, but only after we can find a
 		truly safe (and portable) mechanism for this concept.</para>
 	  </answer>
 	</qandaentry>
@@ -206,5 +210,26 @@
 		condition variable.</para>
 	  </answer>
 	</qandaentry>
+	<qandaentry>
+	  <question>
+	    <para>Why doesn't the thread's ctor take at least a void* to pass any
+	    information along with the function? All other threading libs support
+	    that and it makes Boost.Threads inferiour. </para>
+	  </question>
+	  <answer>
+	    <para>There is no need, because Boost.Threads are superiour! First
+	    thing is that its ctor doesn't take a function but a functor. That
+	    means that you can pass an object with an overloaded operator() and
+	    include additional data as members in that object. Beware though that
+	    this object is copied, use boost::ref to prevent that. Secondly, even
+	    a boost::function<void (void)> can carry parameters, you only have to
+	    use boost::bind() to create it from any function and bind its 
+	    parameters.</para>
+	    <para>That is also why Boost.Threads are superiour, because they
+	    don't require you to pass a type-unsafe void pointer. Rather, you can
+	    use the flexible Boost.Functions to create a thread entry out of
+	    anything that can be called.</para>
+	  </answer>
+	</qandaentry>
   </qandaset>
 </section>

Modified: boost/trunk/libs/thread/doc/glossary.xml
===================================================================
--- boost/trunk/libs/thread/doc/glossary.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/glossary.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,14 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
-<glossary id="threads.glossary" last-revision="$Date: 2004/07/17 04:33:59 $">
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+<glossary id="thread.glossary" last-revision="$Date: 2006/10/15 14:52:53 $">
   <title>Glossary</title>
   <para>Definitions are given in terms of the C++ Standard
   &cite.ISO98;. References to the standard are in the form [1.2.3/4], which
@@ -12,9 +16,9 @@
   "/".</para>
   <para>Because the definitions are written in something akin to "standardese",
   they can be difficult to understand. The intent isn't to confuse, but rather
-  to clarify the additional requirements &Boost.Threads; places on a C++
+  to clarify the additional requirements &Boost.Thread; places on a C++
   implementation as defined by the C++ Standard.</para>
-  <glossentry id="threads.glossary.thread">
+  <glossentry id="thread.glossary.thread">
     <glossterm>Thread</glossterm>
     <glossdef>
 	  <para>Thread is short for "thread of execution". A thread of execution is
@@ -50,13 +54,13 @@
       </itemizedlist>
     </glossdef>
   </glossentry>
-  <glossentry id="threads.glossary.thread-safe">
+  <glossentry id="thread.glossary.thread-safe">
     <glossterm>Thread-safe</glossterm>
 	<glossdef>
       <para>A program is thread-safe if it has no <link
-	  linkend="threads.glossary.race-condition">race conditions</link>, does
-	  not <link linkend="threads.glossary.deadlock">deadlock</link>, and has
-	  no <link linkend="threads.glossary.priority-failure">priority
+	  linkend="thread.glossary.race-condition">race conditions</link>, does
+	  not <link linkend="thread.glossary.deadlock">deadlock</link>, and has
+	  no <link linkend="thread.glossary.priority-failure">priority
 	  failures</link>.</para>
 	  <para>Note that thread-safety does not necessarily imply efficiency, and
 	  than while some thread-safety violations can be determined statically at
@@ -64,7 +68,7 @@
 	  runtime.</para>
 	</glossdef>
   </glossentry>
-  <glossentry id="threads.glossary.thread-state">
+  <glossentry id="thread.glossary.thread-state">
     <glossterm>Thread State</glossterm>
 	<glossdef>
       <para>During the lifetime of a thread, it shall be in one of the following
@@ -166,7 +170,7 @@
 	  above table.]</para>
     </glossdef>
   </glossentry>
-  <glossentry id="threads.glossary.race-condition">
+  <glossentry id="thread.glossary.race-condition">
     <glossterm>Race Condition</glossterm>
 	<glossdef>
       <para>A race condition is what occurs when multiple threads read from and write
@@ -175,10 +179,10 @@
 	  pattern which isn't even a valid value for the data type. A race condition
 	  results in undefined behavior [1.3.12].</para>
       <para>Race conditions can be prevented by serializing memory access using
-	  the tools provided by &Boost.Threads;.</para>
+	  the tools provided by &Boost.Thread;.</para>
     </glossdef>
   </glossentry>
-  <glossentry id="threads.glossary.deadlock">
+  <glossentry id="thread.glossary.deadlock">
     <glossterm>Deadlock</glossterm>
 	<glossdef>
       <para>Deadlock is an execution state where for some set of threads, each
@@ -187,14 +191,14 @@
 	  become ready again.</para>
 	</glossdef>
   </glossentry>
-  <glossentry id="threads.glossary.starvation">
+  <glossentry id="thread.glossary.starvation">
     <glossterm>Starvation</glossterm>
 	<glossdef>
 	  <para>The condition in which a thread is not making sufficient progress in
 	  its work during a given time interval.</para>
 	</glossdef>
   </glossentry>
-  <glossentry id="threads.glossary.priority-failure">
+  <glossentry id="thread.glossary.priority-failure">
     <glossterm>Priority Failure</glossterm>
 	<glossdef>
 	  <para>A priority failure (such as priority inversion or infinite overtaking)
@@ -202,10 +206,10 @@
 	  performed in time to be useful.</para>
 	</glossdef>
   </glossentry>
-  <glossentry id="threads.glossary.undefined-behavior">
+  <glossentry id="thread.glossary.undefined-behavior">
     <glossterm>Undefined Behavior</glossterm>
 	<glossdef>
-	  <para>The result of certain operations in &Boost.Threads; is undefined;
+	  <para>The result of certain operations in &Boost.Thread; is undefined;
 	  this means that those operations can invoke almost any behavior when
 	  they are executed.</para>
 	  
@@ -220,7 +224,7 @@
 	  programming error.</para>
 	</glossdef>
   </glossentry>
-  <glossentry id="threads.glossary.memory-visibility">
+  <glossentry id="thread.glossary.memory-visibility">
     <glossterm>Memory Visibility</glossterm>
 	<glossdef>
 	  <para>An address [1.7] shall always point to the same memory byte,

Modified: boost/trunk/libs/thread/doc/implementation_notes.xml
===================================================================
--- boost/trunk/libs/thread/doc/implementation_notes.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/implementation_notes.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,12 +1,16 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
-<section id="threads.implementation_notes" last-revision="$Date: 2004/07/17 04:33:59 $">
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+<section id="thread.implementation_notes" last-revision="$Date: 2006/10/15 14:52:53 $">
 	<title>Implementation Notes</title>
-	<section id="threads.implementation_notes.win32">
+	<section id="thread.implementation_notes.win32">
 		<title>Win32</title>
 		<para>
 			In the current Win32 implementation, creating a boost::thread object

Modified: boost/trunk/libs/thread/doc/index.html
===================================================================
--- boost/trunk/libs/thread/doc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,12 @@
+<!-- Copyright (c) 2002-2003 Beman Dawes, William E. Kempf.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
 <html>
 <head>
-<meta http-equiv="refresh" content="0; URL=../../../doc/html/threads.html">
+<meta http-equiv="refresh" content="0; URL=../../../doc/html/thread.html">
 </head>
 <body>
-Automatic redirection failed, please go to <a href="../../../doc/html/threads.html">../../../doc/html/threads.html</a>
+Automatic redirection failed, please go to <a href="../../../doc/html/thread.html">../../../doc/html/thread.html</a>
 </body>
 </html>

Modified: boost/trunk/libs/thread/doc/mutex-ref.xml
===================================================================
--- boost/trunk/libs/thread/doc/mutex-ref.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/mutex-ref.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,35 +1,39 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
 <header name="boost/thread/mutex.hpp"
-  last-revision="$Date: 2004/07/17 04:33:59 $">
+  last-revision="$Date: 2006/10/15 14:52:53 $">
   <namespace name="boost">
     <class name="mutex">
 		<purpose>
 			<para>The <classname>mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.Mutex">Mutex</link> concept.</para>
+			<link linkend="thread.concepts.Mutex">Mutex</link> concept.</para>
 		</purpose>
 		
 		<description>
 			<para>The <classname>mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.Mutex">Mutex</link> concept. 
+			<link linkend="thread.concepts.Mutex">Mutex</link> concept. 
 			It should be used to synchronize access to shared resources using
-			<link linkend="threads.concepts.unspecified-locking-strategy">Unspecified</link>
+			<link linkend="thread.concepts.unspecified-locking-strategy">Unspecified</link>
 			locking mechanics.</para>
 
 			<para>For classes that model related mutex concepts, see 
 			<classname>try_mutex</classname> and <classname>timed_mutex</classname>.</para>
 
-			<para>For <link linkend="threads.concepts.recursive-locking-strategy">Recursive</link>
+			<para>For <link linkend="thread.concepts.recursive-locking-strategy">Recursive</link>
 			locking mechanics, see <classname>recursive_mutex</classname>,
 			<classname>recursive_try_mutex</classname>, and <classname>recursive_timed_mutex</classname>.
 			</para>
 			
 			<para>The <classname>mutex</classname> class supplies the following typedef,
-			which <link linkend="threads.concepts.lock-models">models</link>
+			which <link linkend="thread.concepts.lock-models">models</link>
 			the specified locking strategy:
 
 			<informaltable>
@@ -43,7 +47,7 @@
 					<tbody>
 						<row>
 							<entry>scoped_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedLock">ScopedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedLock">ScopedLock</link></entry>
 						</row>
 					</tbody>
 				</tgroup>
@@ -51,7 +55,7 @@
 			</para>
 
 			<para>The <classname>mutex</classname> class uses an 
-			<link linkend="threads.concepts.unspecified-locking-strategy">Unspecified</link>
+			<link linkend="thread.concepts.unspecified-locking-strategy">Unspecified</link>
 			locking strategy, so attempts to recursively lock a <classname>mutex</classname>
 			object or attempts to unlock one by threads that don't own a lock on it result in
 			<emphasis role="bold">undefined behavior</emphasis>.
@@ -61,10 +65,10 @@
 			<code>NDEBUG</code> is not defined.</para>
 			
 			<para>Like all
-			<link linkend="threads.concepts.mutex-models">mutex models</link>
-			in &Boost.Threads;, <classname>mutex</classname> leaves the 
-			<link linkend="threads.concepts.sheduling-policies">scheduling policy</link>
-			as <link linkend="threads.concepts.unspecified-scheduling-policy">Unspecified</link>. 
+			<link linkend="thread.concepts.mutex-models">mutex models</link>
+			in &Boost.Thread;, <classname>mutex</classname> leaves the 
+			<link linkend="thread.concepts.sheduling-policies">scheduling policy</link>
+			as <link linkend="thread.concepts.unspecified-scheduling-policy">Unspecified</link>. 
 			Programmers should make no assumptions about the order in which
 			waiting threads acquire a lock.</para>
 		</description>
@@ -100,26 +104,26 @@
 	<class name="try_mutex">
 		<purpose>
 			<para>The <classname>try_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.TryMutex">TryMutex</link> concept.</para>
+			<link linkend="thread.concepts.TryMutex">TryMutex</link> concept.</para>
 		</purpose>
 		
 		<description>
 			<para>The <classname>try_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.TryMutex">TryMutex</link> concept. 
+			<link linkend="thread.concepts.TryMutex">TryMutex</link> concept. 
 			It should be used to synchronize access to shared resources using
-			<link linkend="threads.concepts.unspecified-locking-strategy">Unspecified</link>
+			<link linkend="thread.concepts.unspecified-locking-strategy">Unspecified</link>
 			locking mechanics.</para>
 
 			<para>For classes that model related mutex concepts, see 
 			<classname>mutex</classname> and <classname>timed_mutex</classname>.</para>
 
-			<para>For <link linkend="threads.concepts.recursive-locking-strategy">Recursive</link>
+			<para>For <link linkend="thread.concepts.recursive-locking-strategy">Recursive</link>
 			locking mechanics, see <classname>recursive_mutex</classname>,
 			<classname>recursive_try_mutex</classname>, and <classname>recursive_timed_mutex</classname>.
 			</para>
 			
 			<para>The <classname>try_mutex</classname> class supplies the following typedefs,
-			which <link linkend="threads.concepts.lock-models">model</link>
+			which <link linkend="thread.concepts.lock-models">model</link>
 			the specified locking strategies:
 
 			<informaltable>
@@ -133,11 +137,11 @@
 					<tbody>
 						<row>
 							<entry>scoped_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedLock">ScopedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedLock">ScopedLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_try_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTryLock">ScopedTryLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTryLock">ScopedTryLock</link></entry>
 						</row>
 					</tbody>
 				</tgroup>
@@ -145,7 +149,7 @@
 			</para>
 
 			<para>The <classname>try_mutex</classname> class uses an 
-			<link linkend="threads.concepts.unspecified-locking-strategy">Unspecified</link>
+			<link linkend="thread.concepts.unspecified-locking-strategy">Unspecified</link>
 			locking strategy, so attempts to recursively lock a <classname>try_mutex</classname>
 			object or attempts to unlock one by threads that don't own a lock on it result in
 			<emphasis role="bold">undefined behavior</emphasis>.
@@ -155,10 +159,10 @@
 			<code>NDEBUG</code> is not defined.</para>
 			
 			<para>Like all
-			<link linkend="threads.concepts.mutex-models">mutex models</link>
-			in &Boost.Threads;, <classname>try_mutex</classname> leaves the 
-			<link linkend="threads.concepts.sheduling-policies">scheduling policy</link>
-			as <link linkend="threads.concepts.unspecified-scheduling-policy">Unspecified</link>. 
+			<link linkend="thread.concepts.mutex-models">mutex models</link>
+			in &Boost.Thread;, <classname>try_mutex</classname> leaves the 
+			<link linkend="thread.concepts.sheduling-policies">scheduling policy</link>
+			as <link linkend="thread.concepts.unspecified-scheduling-policy">Unspecified</link>. 
 			Programmers should make no assumptions about the order in which
 			waiting threads acquire a lock.</para>
 		</description>
@@ -199,26 +203,26 @@
 	<class name="timed_mutex">
 		<purpose>
 			<para>The <classname>timed_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.TimedMutex">TimedMutex</link> concept.</para>
+			<link linkend="thread.concepts.TimedMutex">TimedMutex</link> concept.</para>
 		</purpose>
 		
 		<description>
 			<para>The <classname>timed_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.TimedMutex">TimedMutex</link> concept. 
+			<link linkend="thread.concepts.TimedMutex">TimedMutex</link> concept. 
 			It should be used to synchronize access to shared resources using
-			<link linkend="threads.concepts.unspecified-locking-strategy">Unspecified</link>
+			<link linkend="thread.concepts.unspecified-locking-strategy">Unspecified</link>
 			locking mechanics.</para>
 
 			<para>For classes that model related mutex concepts, see 
 			<classname>mutex</classname> and <classname>try_mutex</classname>.</para>
 
-			<para>For <link linkend="threads.concepts.recursive-locking-strategy">Recursive</link>
+			<para>For <link linkend="thread.concepts.recursive-locking-strategy">Recursive</link>
 			locking mechanics, see <classname>recursive_mutex</classname>,
 			<classname>recursive_try_mutex</classname>, and <classname>recursive_timed_mutex</classname>.
 			</para>
 			
 			<para>The <classname>timed_mutex</classname> class supplies the following typedefs,
-			which <link linkend="threads.concepts.lock-models">model</link>
+			which <link linkend="thread.concepts.lock-models">model</link>
 			the specified locking strategies:
 
 			<informaltable>
@@ -232,15 +236,15 @@
 					<tbody>
 						<row>
 							<entry>scoped_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedLock">ScopedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedLock">ScopedLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_try_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTryLock">ScopedTryLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTryLock">ScopedTryLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_timed_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTimedLock">ScopedTimedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTimedLock">ScopedTimedLock</link></entry>
 						</row>
 					</tbody>
 				</tgroup>
@@ -248,7 +252,7 @@
 			</para>
 
 			<para>The <classname>timed_mutex</classname> class uses an 
-			<link linkend="threads.concepts.unspecified-locking-strategy">Unspecified</link>
+			<link linkend="thread.concepts.unspecified-locking-strategy">Unspecified</link>
 			locking strategy, so attempts to recursively lock a <classname>timed_mutex</classname>
 			object or attempts to unlock one by threads that don't own a lock on it result in
 			<emphasis role="bold">undefined behavior</emphasis>.
@@ -258,10 +262,10 @@
 			<code>NDEBUG</code> is not defined.</para>
 			
 			<para>Like all 
-			<link linkend="threads.concepts.mutex-models">mutex models</link>
-			in  &Boost.Threads;, <classname>timed_mutex</classname> leaves the 
-			<link linkend="threads.concepts.sheduling-policies">scheduling policy</link>
-			as <link linkend="threads.concepts.unspecified-scheduling-policy">Unspecified</link>. 
+			<link linkend="thread.concepts.mutex-models">mutex models</link>
+			in  &Boost.Thread;, <classname>timed_mutex</classname> leaves the 
+			<link linkend="thread.concepts.sheduling-policies">scheduling policy</link>
+			as <link linkend="thread.concepts.unspecified-scheduling-policy">Unspecified</link>. 
 			Programmers should make no assumptions about the order in which
 			waiting threads acquire a lock.</para>
 		</description>

Modified: boost/trunk/libs/thread/doc/once-ref.xml
===================================================================
--- boost/trunk/libs/thread/doc/once-ref.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/once-ref.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,17 +1,21 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
 <header name="boost/thread/once.hpp"
-	last-revision="$Date: 2004/07/17 04:33:59 $">
+	last-revision="$Date: 2006/10/15 14:52:53 $">
 	<macro name="BOOST_ONCE_INIT">
 		<purpose>The <functionname>call_once</functionname> function and
 		<code>once_flag</code> type (statically initialized to 
 		<macroname>BOOST_ONCE_INIT</macroname>) can be used to run a
 		routine exactly once. This can be used to initialize data in a
-		<link linkend="threads.glossary.thread-safe">thread-safe</link>
+		<link linkend="thread.glossary.thread-safe">thread-safe</link>
 		manner.</purpose>
 		
 		<description>The implementation-defined macro 
@@ -27,7 +31,7 @@
 			<code>once_flag</code> type (statically initialized to 
 			<macroname>BOOST_ONCE_INIT</macroname>) can be used to run a
 			routine exactly once. This can be used to initialize data in a
-			<link linkend="threads.glossary.thread-safe">thread-safe</link>
+			<link linkend="thread.glossary.thread-safe">thread-safe</link>
 			manner.</purpose>
 			
 			<description>The implementation-defined type <code>once_flag</code>
@@ -45,7 +49,7 @@
 			<code>once_flag</code> type (statically initialized to 
 			<macroname>BOOST_ONCE_INIT</macroname>) can be used to run a
 			routine exactly once. This can be used to initialize data in a
-			<link linkend="threads.glossary.thread-safe">thread-safe</link>
+			<link linkend="thread.glossary.thread-safe">thread-safe</link>
 			manner.</purpose>
 			
 			<description>

Modified: boost/trunk/libs/thread/doc/overview.xml
===================================================================
--- boost/trunk/libs/thread/doc/overview.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/overview.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,19 +1,23 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
-<section id="threads.overview" last-revision="$Date: 2004/07/17 04:33:59 $">
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+<section id="thread.overview" last-revision="$Date: 2006/10/15 14:52:53 $">
   <title>Overview</title>
-  <section id="threads.introduction">
+  <section id="thread.introduction">
     <title>Introduction</title>
-    <para>&Boost.Threads; allows C++ programs to execute as multiple,
+    <para>&Boost.Thread; allows C++ programs to execute as multiple,
     asynchronous, independent threads-of-execution. Each thread has its own
     machine state including program instruction counter and registers. Programs
     which execute as multiple threads are called multithreaded programs to
     distinguish them from traditional single-threaded programs. The <link
-	linkend="threads.glossary">glossary</link> gives a more complete description
+	linkend="thread.glossary">glossary</link> gives a more complete description
 	of the multithreading execution environment.</para>
     <para>Multithreading provides several advantages:
     <itemizedlist>
@@ -44,15 +48,15 @@
     multithreaded programs are subject to additional errors:
     <itemizedlist>
       <listitem>
-        <para><link linkend="threads.glossary.race-condition">Race
+        <para><link linkend="thread.glossary.race-condition">Race
 	    conditions</link></para>
       </listitem>
       <listitem>
-        <para><link linkend="threads.glossary.deadlock">Deadlock</link>
+        <para><link linkend="thread.glossary.deadlock">Deadlock</link>
         (sometimes called "deadly embrace")</para>
       </listitem>
       <listitem>
-        <para><link linkend="threads.glossary.priority-failure">Priority
+        <para><link linkend="thread.glossary.priority-failure">Priority
         failures</link> (priority inversion, infinite overtaking, starvation,
 		etc.)</para>
       </listitem>
@@ -61,10 +65,10 @@
 	errors. These aren't rare or exotic failures - they are virtually guaranteed
 	to occur unless multithreaded code is designed to avoid them. Priority
 	failures are somewhat less common, but are nonetheless serious.</para>
-    <para>The <link linkend="threads.design">&Boost.Threads; design</link>
+    <para>The <link linkend="thread.design">&Boost.Thread; design</link>
     attempts to minimize these errors, but they will still occur unless the
     programmer proactively designs to avoid them.</para>
-	<note>Please also see <xref linkend="threads.implementation_notes"/>
+	<note>Please also see <xref linkend="thread.implementation_notes"/>
 	for additional, implementation-specific considerations.</note>
 	</section>
     <section>
@@ -119,11 +123,11 @@
       <title>Runtime libraries</title>
       <para>
       <emphasis role="bold">Warning:</emphasis> Multithreaded programs such as
-	  those using &Boost.Threads; must link to <link
-	  linkend="threads.glossary.thread-safe">thread-safe</link> versions of
+	  those using &Boost.Thread; must link to <link
+	  linkend="thread.glossary.thread-safe">thread-safe</link> versions of
 	  all runtime libraries used by the program, including the runtime library
 	  for the C++ Standard Library. Failure to do so will cause <link
-	  linkend="threads.glossary.race-condition">race conditions</link> to occur
+	  linkend="thread.glossary.race-condition">race conditions</link> to occur
 	  when multiple threads simultaneously execute runtime library functions for
 	  <code>new</code>, <code>delete</code>, or other language features which
 	  imply shared state.</para>
@@ -169,15 +173,15 @@
     </section>
   </section>
   <section>
-    <title>Common guarantees for all &Boost.Threads; components</title>
+    <title>Common guarantees for all &Boost.Thread; components</title>
     <section>
       <title>Exceptions</title>
-      <para>&Boost.Threads; destructors never
+      <para>&Boost.Thread; destructors never
 	  throw exceptions. Unless otherwise specified, other
-	  &Boost.Threads; functions that do not have
+	  &Boost.Thread; functions that do not have
 	  an exception-specification may throw implementation-defined
 	  exceptions.</para>
-      <para>In particular, &Boost.Threads;
+      <para>In particular, &Boost.Thread;
 	  reports failure to allocate storage by throwing an exception of type
 	  <code>std::bad_alloc</code> or a class derived from
 	  <code>std::bad_alloc</code>, failure to obtain thread resources other than
@@ -191,7 +195,7 @@
     </section>
     <section>
       <title>NonCopyable requirement</title>
-      <para>&Boost.Threads; classes documented as
+      <para>&Boost.Thread; classes documented as
 	  meeting the NonCopyable requirement disallow copy construction and copy
 	  assignment. For the sake of exposition, the synopsis of such classes show
 	  private derivation from <classname>boost::noncopyable</classname>. Users

Modified: boost/trunk/libs/thread/doc/rationale.xml
===================================================================
--- boost/trunk/libs/thread/doc/rationale.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/rationale.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,19 +1,23 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
-<section id="threads.rationale" last-revision="$Date: 2004/07/17 04:33:59 $">
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+<section id="thread.rationale" last-revision="$Date: 2006/10/15 14:52:53 $">
   <title>Rationale</title>
   <para>This page explains the rationale behind various design decisions in the
-  &Boost.Threads; library. Having the rationale documented here should explain
+  &Boost.Thread; library. Having the rationale documented here should explain
   how we arrived at the current design as well as prevent future rehashing of
   discussions and thought processes that have already occurred. It can also give
   users a lot of insight into the design process required for this
   library.</para>
-  <section id="threads.rationale.Boost.Threads">
-    <title>Rationale for the Creation of &Boost.Threads;</title>
+  <section id="thread.rationale.Boost.Thread">
+    <title>Rationale for the Creation of &Boost.Thread;</title>
     <para>Processes often have a degree of "potential parallelism" and it can
 	often be more intuitive to design systems with this in mind. Further, these
 	parallel processes can result in more responsive programs. The benefits for
@@ -33,24 +37,24 @@
     <para>What's truly needed is C++ language support for threads. However, the
 	C++ standards committee needs existing practice or a good proposal as a
 	starting point for adding this to the standard.</para>
-    <para>The &Boost.Threads; library was developed to provide a C++ developer
+    <para>The &Boost.Thread; library was developed to provide a C++ developer
 	with a portable interface for writing multithreaded programs on numerous
 	platforms. There's a hope that the library can be the basis for a more
 	detailed proposal for the C++ standards committee to consider for inclusion
 	in the next C++ standard.</para>
   </section>
-  <section id="threads.rationale.primitives">
-    <title>Rationale for the Low Level Primitives Supported in &Boost.Threads;</title>
-    <para>The &Boost.Threads; library supplies a set of low level primitives for
+  <section id="thread.rationale.primitives">
+    <title>Rationale for the Low Level Primitives Supported in &Boost.Thread;</title>
+    <para>The &Boost.Thread; library supplies a set of low level primitives for
 	writing multithreaded programs, such as mutexes and condition variables. In
-	fact, the first release of &Boost.Threads; supports only these low level
+	fact, the first release of &Boost.Thread; supports only these low level
 	primitives. However, computer science research has shown that use of these
 	primitives is difficult since it's difficult to mathematically prove that a
 	usage pattern is correct, meaning it doesn't result in race conditions or
 	deadlocks. There are several algebras (such as CSP, CCS and Join calculus)
 	that have been developed to help write provably correct parallel
 	processes. In order to prove the correctness these processes must be coded
-	using higher level abstractions. So why does &Boost.Threads; support the
+	using higher level abstractions. So why does &Boost.Thread; support the
 	lower level concepts?</para>
     <para>The reason is simple: the higher level concepts need to be implemented
 	using at least some of the lower level concepts. So having portable lower
@@ -64,11 +68,11 @@
 	level concepts, supporting the lower level concepts provides
 	greater accessibility.</para>
   </section>
-  <section id="threads.rationale.locks">
+  <section id="thread.rationale.locks">
     <title>Rationale for the Lock Design</title>
     <para>Programmers who are used to multithreaded programming issues will
-	quickly note that the &Boost.Threads; design for mutex lock concepts is not
-	<link linkend="threads.glossary.thread-safe">thread-safe</link> (this is
+	quickly note that the &Boost.Thread; design for mutex lock concepts is not
+	<link linkend="thread.glossary.thread-safe">thread-safe</link> (this is
 	clearly documented as well). At first this may seem like a serious design
 	flaw. Why have a multithreading primitive that's not thread-safe
 	itself?</para>
@@ -91,17 +95,17 @@
 	since checking the state can occur only by a call after construction, we'd
 	have a race condition if the lock object were shared between threads.</para>
     <para>So, to avoid the overhead of synchronizing access to the state
-	information and to avoid the race condition, the &Boost.Threads; library
+	information and to avoid the race condition, the &Boost.Thread; library
 	simply does nothing to make lock objects thread-safe. Instead, sharing a
 	lock object between threads results in undefined behavior. Since the only
 	proper usage of lock objects is within block scope this isn't a problem, and
 	so long as the lock object is properly used there's no danger of any
 	multithreading issues.</para>
   </section>
-  <section id="threads.rationale.non-copyable">
+  <section id="thread.rationale.non-copyable">
     <title>Rationale for NonCopyable Thread Type</title>
     <para>Programmers who are used to C libraries for multithreaded programming
-	are likely to wonder why &Boost.Threads; uses a noncopyable design for
+	are likely to wonder why &Boost.Thread; uses a noncopyable design for
 	<classname>boost::thread</classname>. After all, the C thread types are
 	copyable, and you often have a need for copying them within user
 	code. However, careful comparison of C designs to C++ designs shows a flaw
@@ -137,7 +141,7 @@
 	appear to bear them out. To illustrate the analysis we'll first provide
 	pseudo-code illustrating the six typical usage patterns of a thread
 	object.</para>
-	<section id="threads.rationale.non-copyable.simple">
+	<section id="thread.rationale.non-copyable.simple">
 	  <title>1. Use case: Simple creation of a thread.</title>
       <programlisting>
       void foo()
@@ -146,7 +150,7 @@
       }
       </programlisting>
 	</section>
-	<section id="threads.rationale.non-copyable.joined">
+	<section id="thread.rationale.non-copyable.joined">
 	  <title>2. Use case: Creation of a thread that's later joined.</title>
       <programlisting>
       void foo()
@@ -156,7 +160,7 @@
       }
       </programlisting>
 	</section>
-	<section id="threads.rationale.non-copyable.loop">
+	<section id="thread.rationale.non-copyable.loop">
 	  <title>3. Use case: Simple creation of several threads in a loop.</title>
       <programlisting>
       void foo()
@@ -166,7 +170,7 @@
       }
       </programlisting>
 	</section>
-	<section id="threads.rationale.non-copyable.loop-join">
+	<section id="thread.rationale.non-copyable.loop-join">
 	  <title>4. Use case: Creation of several threads in a loop which are later joined.</title>
       <programlisting>
       void foo()
@@ -178,7 +182,7 @@
       }
       </programlisting>
 	</section>
-	<section id="threads.rationale.non-copyable.pass">
+	<section id="thread.rationale.non-copyable.pass">
 	  <title>5. Use case: Creation of a thread whose ownership is passed to another object/method.</title>
       <programlisting>
       void foo()
@@ -188,7 +192,7 @@
       }
       </programlisting>
 	</section>
-	<section id="threads.rationale.non-copyable.shared">
+	<section id="thread.rationale.non-copyable.shared">
 	  <title>6. Use case: Creation of a thread whose ownership is shared between multiple
 	  objects.</title>
 	  <programlisting>
@@ -221,7 +225,7 @@
 	use a concept for any of the usage patterns there would be a good argument
 	for choosing the other design. So we'll code all six usage patterns using
 	both designs.</para>
-	<section id="threads.rationale_comparison.non-copyable.simple">
+	<section id="thread.rationale_comparison.non-copyable.simple">
 	  <title>1. Comparison: simple creation of a thread.</title>
 	  <programlisting>
       void foo()
@@ -234,7 +238,7 @@
       }
       </programlisting>
 	</section>
-	<section id="threads.rationale_comparison.non-copyable.joined">
+	<section id="thread.rationale_comparison.non-copyable.joined">
 	  <title>2. Comparison: creation of a thread that's later joined.</title>
 	  <programlisting>
       void foo()
@@ -249,7 +253,7 @@
       }
       </programlisting>
 	</section>
-	<section id="threads.rationale_comparison.non-copyable.loop">
+	<section id="thread.rationale_comparison.non-copyable.loop">
 	  <title>3. Comparison: simple creation of several threads in a loop.</title>
       <programlisting>
       void foo()
@@ -264,7 +268,7 @@
       }
       </programlisting>
 	</section>
-	<section id="threads.rationale_comparison.non-copyable.loop-join">
+	<section id="thread.rationale_comparison.non-copyable.loop-join">
 	  <title>4. Comparison: creation of several threads in a loop which are later joined.</title>
       <programlisting>
       void foo()
@@ -285,7 +289,7 @@
       }
       </programlisting>
 	</section>
-	<section id="threads.rationale_comparison.non-copyable.pass">
+	<section id="thread.rationale_comparison.non-copyable.pass">
 	  <title>5. Comparison: creation of a thread whose ownership is passed to another object/method.</title>
       <programlisting>
       void foo()
@@ -300,7 +304,7 @@
       }
       </programlisting>
 	</section>
-	<section id="threads.rationale_comparison.non-copyable.shared">
+	<section id="thread.rationale_comparison.non-copyable.shared">
 	  <title>6. Comparison: creation of a thread whose ownership is shared 
 	  between multiple objects.</title>
       <programlisting>
@@ -321,18 +325,18 @@
     <para>This shows the usage patterns being nearly identical in complexity for
 	both designs. The only actual added complexity occurs because of the use of
 	operator new in 
-	<link linkend="threads.rationale_comparison.non-copyable.loop-join">(4)</link>,
-	<link linkend="threads.rationale_comparison.non-copyable.pass">(5)</link>, and
-	<link linkend="threads.rationale_comparison.non-copyable.shared">(6)</link>;
+	<link linkend="thread.rationale_comparison.non-copyable.loop-join">(4)</link>,
+	<link linkend="thread.rationale_comparison.non-copyable.pass">(5)</link>, and
+	<link linkend="thread.rationale_comparison.non-copyable.shared">(6)</link>;
 	and the use of std::auto_ptr and boost::shared_ptr in 
-	<link linkend="threads.rationale_comparison.non-copyable.loop-join">(4)</link> and 
-	<link linkend="threads.rationale_comparison.non-copyable.shared">(6)</link>
+	<link linkend="thread.rationale_comparison.non-copyable.loop-join">(4)</link> and 
+	<link linkend="thread.rationale_comparison.non-copyable.shared">(6)</link>
 	respectively. However, that's not really
 	much added complexity, and C++ programmers are used to using these idioms
 	anyway. Some may dislike the presence of operator new in user code, but
 	this can be eliminated by proper design of higher level concepts, such as
 	the boost::thread_group class that simplifies example 
-	<link linkend="threads.rationale_comparison.non-copyable.loop-join">(4)</link>
+	<link linkend="thread.rationale_comparison.non-copyable.loop-join">(4)</link>
 	down to:</para>
     <programlisting>
     void foo()
@@ -347,49 +351,49 @@
 	design.</para>
     <para>So what about performance? Looking at the above code examples, 
     we can analyze the theoretical impact to performance that both designs
-	have. For <link linkend="threads.rationale_comparison.non-copyable.simple">(1)</link>
+	have. For <link linkend="thread.rationale_comparison.non-copyable.simple">(1)</link>
 	we can see that platforms that don't have a ref-counted native
 	thread type (POSIX, for instance) will be impacted by a thread_ref
 	design. Even if the native thread type is ref-counted there may be an impact
 	if more state information has to be maintained for concepts foreign to the
 	native API, such as clean up stacks for Win32 implementations. 
-	For <link linkend="threads.rationale_comparison.non-copyable.joined">(2)</link>
-	and <link linkend="threads.rationale_comparison.non-copyable.loop">(3)</link>
+	For <link linkend="thread.rationale_comparison.non-copyable.joined">(2)</link>
+	and <link linkend="thread.rationale_comparison.non-copyable.loop">(3)</link>
 	the performance impact will be identical to
-	<link linkend="threads.rationale_comparison.non-copyable.simple">(1)</link>.
-	For <link linkend="threads.rationale_comparison.non-copyable.loop-join">(4)</link>
+	<link linkend="thread.rationale_comparison.non-copyable.simple">(1)</link>.
+	For <link linkend="thread.rationale_comparison.non-copyable.loop-join">(4)</link>
 	things get a little more interesting and we find that theoretically at least
 	the thread_ref may perform faster since the thread design requires dynamic
 	memory allocation/deallocation. However, in practice there may be dynamic
 	allocation for the thread_ref design as well, it will just be hidden from
 	the user. As long as the implementation has to do dynamic allocations the
 	thread_ref loses again because of the reference management. For 
-	<link linkend="threads.rationale_comparison.non-copyable.pass">(5)</link> we see
+	<link linkend="thread.rationale_comparison.non-copyable.pass">(5)</link> we see
 	the same impact as we do for 
-	<link linkend="threads.rationale_comparison.non-copyable.loop-join">(4)</link>.
-	For <link linkend="threads.rationale_comparison.non-copyable.shared">(6)</link>
+	<link linkend="thread.rationale_comparison.non-copyable.loop-join">(4)</link>.
+	For <link linkend="thread.rationale_comparison.non-copyable.shared">(6)</link>
 	we still have a possible impact to
 	the thread design because of dynamic allocation but thread_ref no longer
 	suffers because of its reference management, and in fact, theoretically at
 	least, the thread_ref may do a better job of managing the references. All of
 	this indicates that thread wins for 
-	<link linkend="threads.rationale_comparison.non-copyable.simple">(1)</link>, 
-	<link linkend="threads.rationale_comparison.non-copyable.joined">(2)</link> and 
-	<link linkend="threads.rationale_comparison.non-copyable.loop">(3)</link>; with 
-	<link linkend="threads.rationale_comparison.non-copyable.loop-join">(4)</link>
-	and <link linkend="threads.rationale_comparison.non-copyable.pass">(5)</link> the
+	<link linkend="thread.rationale_comparison.non-copyable.simple">(1)</link>, 
+	<link linkend="thread.rationale_comparison.non-copyable.joined">(2)</link> and 
+	<link linkend="thread.rationale_comparison.non-copyable.loop">(3)</link>; with 
+	<link linkend="thread.rationale_comparison.non-copyable.loop-join">(4)</link>
+	and <link linkend="thread.rationale_comparison.non-copyable.pass">(5)</link> the
 	winner depending on the implementation and the platform but with the thread design
 	probably having a better chance; and with 
-	<link linkend="threads.rationale_comparison.non-copyable.shared">(6)</link> 
+	<link linkend="thread.rationale_comparison.non-copyable.shared">(6)</link> 
 	it will again depend on the
 	implementation and platform but this time we favor thread_ref
 	slightly. Given all of this it's a narrow margin, but the thread design
 	prevails.</para>
 	<para>Given this analysis, and the fact that noncopyable objects for system
 	resources are the normal designs that C++ programmers are used to dealing
-	with, the &Boost.Threads; library has gone with a noncopyable design.</para>
+	with, the &Boost.Thread; library has gone with a noncopyable design.</para>
   </section>
-  <section id="threads.rationale.events">
+  <section id="thread.rationale.events">
     <title>Rationale for not providing <emphasis>Event Variables</emphasis></title>
     <para><emphasis>Event variables</emphasis> are simply far too
 	error-prone. <classname>boost::condition</classname> variables are a much safer
@@ -416,13 +420,13 @@
 	experiences caused them to be very careful in their use of event
 	variables. Overt problems can be avoided, for example, by teaming the event
 	variable with a mutex, but that may just convert a <link
-	linkend="threads.glossary.race-condition">race condition</link> into another
+	linkend="thread.glossary.race-condition">race condition</link> into another
 	problem, such as excessive resource use. One of the most distressing aspects
 	of the experience reports is the claim that many defects are latent. That
 	is, the programs appear to work correctly, but contain hidden timing
 	dependencies which will cause them to fail when environmental factors or
 	usage patterns change, altering relative thread timings.</para>
-    <para>The decision to exclude event variables from &Boost.Threads; has been
+    <para>The decision to exclude event variables from &Boost.Thread; has been
 	surprising to some Windows programmers. They have written programs which
 	work using event variables, and wonder what the problem is. It seems similar
 	to the "goto considered harmful" controversy of 30 years ago. It isn't that

Modified: boost/trunk/libs/thread/doc/read_write_mutex-ref.xml
===================================================================
--- boost/trunk/libs/thread/doc/read_write_mutex-ref.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/read_write_mutex-ref.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
 <header name="boost/thread/read_write_mutex.hpp"
-  last-revision="$Date: 2004/07/17 04:33:59 $">
+  last-revision="$Date: 2007/01/01 14:10:28 $">
   <namespace name="boost">
 	<namespace name="read_write_scheduling_policy">
 		<enum name="read_write_scheduling_policy">
@@ -16,13 +20,13 @@
 
 			<purpose>
 				<para>Specifies the 
-				<link linkend="threads.concepts.read-write-scheduling-policies.inter-class">inter-class sheduling policy</link>
+				<link linkend="thread.concepts.read-write-scheduling-policies.inter-class">inter-class sheduling policy</link>
 				to use when a set of threads try to obtain different types of
 				locks simultaneously.</para>
 			</purpose>
 
 			<description>
-				<para>The only clock type supported by &Boost.Threads; is 
+				<para>The only clock type supported by &Boost.Thread; is 
 				<code>TIME_UTC</code>. The epoch for <code>TIME_UTC</code>
 				is 1970-01-01 00:00:00.</para>
 			</description>
@@ -32,21 +36,21 @@
     <class name="read_write_mutex">
 		<purpose>
 			<para>The <classname>read_write_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.ReadWriteMutex">ReadWriteMutex</link> concept.</para>
+			<link linkend="thread.concepts.ReadWriteMutex">ReadWriteMutex</link> concept.</para>
 		</purpose>
 		
 		<description>
 			<para>The <classname>read_write_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.ReadWriteMutex">ReadWriteMutex</link> concept. 
+			<link linkend="thread.concepts.ReadWriteMutex">ReadWriteMutex</link> concept. 
 			It should be used to synchronize access to shared resources using
-			<link linkend="threads.concepts.read-write-locking-strategies.unspecified">Unspecified</link>
+			<link linkend="thread.concepts.read-write-locking-strategies.unspecified">Unspecified</link>
 			locking mechanics.</para>
 
 			<para>For classes that model related mutex concepts, see 
 			<classname>try_read_write_mutex</classname> and <classname>timed_read_write_mutex</classname>.</para>
 			
 			<para>The <classname>read_write_mutex</classname> class supplies the following typedefs,
-			which <link linkend="threads.concepts.read-write-lock-models">model</link>
+			which <link linkend="thread.concepts.read-write-lock-models">model</link>
 			the specified locking strategies:
 
 			<informaltable>
@@ -60,15 +64,15 @@
 					<tbody>
 						<row>
 							<entry>scoped_read_write_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedReadWriteLock">ScopedReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedReadWriteLock">ScopedReadWriteLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_read_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedLock">ScopedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedLock">ScopedLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_write_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedLock">ScopedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedLock">ScopedLock</link></entry>
 						</row>
 					</tbody>
 				</tgroup>
@@ -76,7 +80,7 @@
 			</para>
 
 			<para>The <classname>read_write_mutex</classname> class uses an 
-			<link linkend="threads.concepts.read-write-locking-strategies.unspecified">Unspecified</link>
+			<link linkend="thread.concepts.read-write-locking-strategies.unspecified">Unspecified</link>
 			locking strategy, so attempts to recursively lock a <classname>read_write_mutex</classname>
 			object or attempts to unlock one by threads that don't own a lock on it result in
 			<emphasis role="bold">undefined behavior</emphasis>.
@@ -86,20 +90,20 @@
 			<code>NDEBUG</code> is not defined.</para>
 			
 			<para>Like all
-			<link linkend="threads.concepts.read-write-mutex-models">read/write mutex models</link>
-			in &Boost.Threads;, <classname>read_write_mutex</classname> has two types of
-			<link linkend="threads.concepts.read-write-scheduling-policies">scheduling policies</link>, an 
-			<link linkend="threads.concepts.read-write-scheduling-policies.inter-class">inter-class sheduling policy</link>
+			<link linkend="thread.concepts.read-write-mutex-models">read/write mutex models</link>
+			in &Boost.Thread;, <classname>read_write_mutex</classname> has two types of
+			<link linkend="thread.concepts.read-write-scheduling-policies">scheduling policies</link>, an 
+			<link linkend="thread.concepts.read-write-scheduling-policies.inter-class">inter-class sheduling policy</link>
 			between threads trying to obtain different types of locks and an
-			<link linkend="threads.concepts.read-write-scheduling-policies.intra-class">intra-class sheduling policy</link>
+			<link linkend="thread.concepts.read-write-scheduling-policies.intra-class">intra-class sheduling policy</link>
 			between threads trying to obtain the same type of lock.
 			The <classname>read_write_mutex</classname> class allows the
 			programmer to choose what
-			<link linkend="threads.concepts.read-write-scheduling-policies.inter-class">inter-class sheduling policy</link>
+			<link linkend="thread.concepts.read-write-scheduling-policies.inter-class">inter-class sheduling policy</link>
 			will be used; however, like all read/write mutex models, 
 			<classname>read_write_mutex</classname> leaves the 
-			<link linkend="threads.concepts.read-write-scheduling-policies.intra-class">intra-class sheduling policy</link> as 
-			<link linkend="threads.concepts.read-write-locking-strategies.unspecified">Unspecified</link>.			
+			<link linkend="thread.concepts.read-write-scheduling-policies.intra-class">intra-class sheduling policy</link> as 
+			<link linkend="thread.concepts.read-write-locking-strategies.unspecified">Unspecified</link>.			
 			</para>
 			
 			<note>Self-deadlock is virtually guaranteed if a thread tries to
@@ -155,21 +159,21 @@
     <class name="try_read_write_mutex">
 		<purpose>
 			<para>The <classname>try_read_write_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.TryReadWriteMutex">TryReadWriteMutex</link> concept.</para>
+			<link linkend="thread.concepts.TryReadWriteMutex">TryReadWriteMutex</link> concept.</para>
 		</purpose>
 		
 		<description>
 			<para>The <classname>try_read_write_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.TryReadWriteMutex">TryReadWriteMutex</link> concept. 
+			<link linkend="thread.concepts.TryReadWriteMutex">TryReadWriteMutex</link> concept. 
 			It should be used to synchronize access to shared resources using
-			<link linkend="threads.concepts.read-write-locking-strategies.unspecified">Unspecified</link>
+			<link linkend="thread.concepts.read-write-locking-strategies.unspecified">Unspecified</link>
 			locking mechanics.</para>
 
 			<para>For classes that model related mutex concepts, see 
 			<classname>read_write_mutex</classname> and <classname>timed_read_write_mutex</classname>.</para>
 			
 			<para>The <classname>try_read_write_mutex</classname> class supplies the following typedefs,
-			which <link linkend="threads.concepts.read-write-lock-models">model</link>
+			which <link linkend="thread.concepts.read-write-lock-models">model</link>
 			the specified locking strategies:
 
 			<informaltable>
@@ -183,27 +187,27 @@
 					<tbody>
 						<row>
 							<entry>scoped_read_write_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedReadWriteLock">ScopedReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedReadWriteLock">ScopedReadWriteLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_try_read_write_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTryReadWriteLock">ScopedTryReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTryReadWriteLock">ScopedTryReadWriteLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_read_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedLock">ScopedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedLock">ScopedLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_try_read_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTryLock">ScopedTryLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTryLock">ScopedTryLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_write_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedLock">ScopedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedLock">ScopedLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_try_write_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTryLock">ScopedTryLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTryLock">ScopedTryLock</link></entry>
 						</row>
 					</tbody>
 				</tgroup>
@@ -211,7 +215,7 @@
 			</para>
 
 			<para>The <classname>try_read_write_mutex</classname> class uses an 
-			<link linkend="threads.concepts.read-write-locking-strategies.unspecified">Unspecified</link>
+			<link linkend="thread.concepts.read-write-locking-strategies.unspecified">Unspecified</link>
 			locking strategy, so attempts to recursively lock a <classname>try_read_write_mutex</classname>
 			object or attempts to unlock one by threads that don't own a lock on it result in
 			<emphasis role="bold">undefined behavior</emphasis>.
@@ -221,20 +225,20 @@
 			<code>NDEBUG</code> is not defined.</para>
 			
 			<para>Like all
-			<link linkend="threads.concepts.read-write-mutex-models">read/write mutex models</link>
-			in &Boost.Threads;, <classname>try_read_write_mutex</classname> has two types of
-			<link linkend="threads.concepts.read-write-scheduling-policies">scheduling policies</link>, an 
-			<link linkend="threads.concepts.read-write-scheduling-policies.inter-class">inter-class sheduling policy</link>
+			<link linkend="thread.concepts.read-write-mutex-models">read/write mutex models</link>
+			in &Boost.Thread;, <classname>try_read_write_mutex</classname> has two types of
+			<link linkend="thread.concepts.read-write-scheduling-policies">scheduling policies</link>, an 
+			<link linkend="thread.concepts.read-write-scheduling-policies.inter-class">inter-class sheduling policy</link>
 			between threads trying to obtain different types of locks and an
-			<link linkend="threads.concepts.read-write-scheduling-policies.intra-class">intra-class sheduling policy</link>
+			<link linkend="thread.concepts.read-write-scheduling-policies.intra-class">intra-class sheduling policy</link>
 			between threads trying to obtain the same type of lock.
 			The <classname>try_read_write_mutex</classname> class allows the
 			programmer to choose what
-			<link linkend="threads.concepts.read-write-scheduling-policies.inter-class">inter-class sheduling policy</link>
+			<link linkend="thread.concepts.read-write-scheduling-policies.inter-class">inter-class sheduling policy</link>
 			will be used; however, like all read/write mutex models, 
 			<classname>try_read_write_mutex</classname> leaves the 
-			<link linkend="threads.concepts.read-write-scheduling-policies.intra-class">intra-class sheduling policy</link> as 
-			<link linkend="threads.concepts.unspecified-scheduling-policy">Unspecified</link>.			
+			<link linkend="thread.concepts.read-write-scheduling-policies.intra-class">intra-class sheduling policy</link> as 
+			<link linkend="thread.concepts.unspecified-scheduling-policy">Unspecified</link>.			
 			</para>
 			
 			<note>Self-deadlock is virtually guaranteed if a thread tries to
@@ -297,21 +301,21 @@
     <class name="timed_read_write_mutex">
 		<purpose>
 			<para>The <classname>timed_read_write_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.TimedReadWriteMutex">TimedReadWriteMutex</link> concept.</para>
+			<link linkend="thread.concepts.TimedReadWriteMutex">TimedReadWriteMutex</link> concept.</para>
 		</purpose>
 		
 		<description>
 			<para>The <classname>timed_read_write_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.TimedReadWriteMutex">TimedReadWriteMutex</link> concept. 
+			<link linkend="thread.concepts.TimedReadWriteMutex">TimedReadWriteMutex</link> concept. 
 			It should be used to synchronize access to shared resources using
-			<link linkend="threads.concepts.read-write-locking-strategies.unspecified">Unspecified</link>
+			<link linkend="thread.concepts.read-write-locking-strategies.unspecified">Unspecified</link>
 			locking mechanics.</para>
 
 			<para>For classes that model related mutex concepts, see 
 			<classname>read_write_mutex</classname> and <classname>try_read_write_mutex</classname>.</para>
 			
 			<para>The <classname>timed_read_write_mutex</classname> class supplies the following typedefs,
-			which <link linkend="threads.concepts.read-write-lock-models">model</link>
+			which <link linkend="thread.concepts.read-write-lock-models">model</link>
 			the specified locking strategies:
 
 			<informaltable>
@@ -325,39 +329,39 @@
 					<tbody>
 						<row>
 							<entry>scoped_read_write_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedReadWriteLock">ScopedReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedReadWriteLock">ScopedReadWriteLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_try_read_write_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTryReadWriteLock">ScopedTryReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTryReadWriteLock">ScopedTryReadWriteLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_timed_read_write_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTimedReadWriteLock">ScopedTimedReadWriteLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTimedReadWriteLock">ScopedTimedReadWriteLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_read_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedLock">ScopedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedLock">ScopedLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_try_read_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTryLock">ScopedTryLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTryLock">ScopedTryLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_timed_read_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTimedLock">ScopedTimedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTimedLock">ScopedTimedLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_write_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedLock">ScopedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedLock">ScopedLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_try_write_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTryLock">ScopedTryLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTryLock">ScopedTryLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_timed_write_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTimedLock">ScopedTimedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTimedLock">ScopedTimedLock</link></entry>
 						</row>
 					</tbody>
 				</tgroup>
@@ -365,7 +369,7 @@
 			</para>
 
 			<para>The <classname>timed_read_write_mutex</classname> class uses an 
-			<link linkend="threads.concepts.read-write-locking-strategies.unspecified">Unspecified</link>
+			<link linkend="thread.concepts.read-write-locking-strategies.unspecified">Unspecified</link>
 			locking strategy, so attempts to recursively lock a <classname>timed_read_write_mutex</classname>
 			object or attempts to unlock one by threads that don't own a lock on it result in
 			<emphasis role="bold">undefined behavior</emphasis>.
@@ -375,20 +379,20 @@
 			<code>NDEBUG</code> is not defined.</para>
 			
 			<para>Like all
-			<link linkend="threads.concepts.read-write-mutex-models">read/write mutex models</link>
-			in &Boost.Threads;, <classname>timed_read_write_mutex</classname> has two types of
-			<link linkend="threads.concepts.read-write-scheduling-policies">scheduling policies</link>, an 
-			<link linkend="threads.concepts.read-write-scheduling-policies.inter-class">inter-class sheduling policy</link>
+			<link linkend="thread.concepts.read-write-mutex-models">read/write mutex models</link>
+			in &Boost.Thread;, <classname>timed_read_write_mutex</classname> has two types of
+			<link linkend="thread.concepts.read-write-scheduling-policies">scheduling policies</link>, an 
+			<link linkend="thread.concepts.read-write-scheduling-policies.inter-class">inter-class sheduling policy</link>
 			between threads trying to obtain different types of locks and an
-			<link linkend="threads.concepts.read-write-scheduling-policies.intra-class">intra-class sheduling policy</link>
+			<link linkend="thread.concepts.read-write-scheduling-policies.intra-class">intra-class sheduling policy</link>
 			between threads trying to obtain the same type of lock.
 			The <classname>timed_read_write_mutex</classname> class allows the
 			programmer to choose what
-			<link linkend="threads.concepts.read-write-scheduling-policies.inter-class">inter-class sheduling policy</link>
+			<link linkend="thread.concepts.read-write-scheduling-policies.inter-class">inter-class sheduling policy</link>
 			will be used; however, like all read/write mutex models, 
 			<classname>timed_read_write_mutex</classname> leaves the 
-			<link linkend="threads.concepts.read-write-scheduling-policies.intra-class">intra-class sheduling policy</link> as 
-			<link linkend="threads.concepts.unspecified-scheduling-policy">Unspecified</link>.			
+			<link linkend="thread.concepts.read-write-scheduling-policies.intra-class">intra-class sheduling policy</link> as 
+			<link linkend="thread.concepts.unspecified-scheduling-policy">Unspecified</link>.			
 			</para>
 			
 			<note>Self-deadlock is virtually guaranteed if a thread tries to

Modified: boost/trunk/libs/thread/doc/recursive_mutex-ref.xml
===================================================================
--- boost/trunk/libs/thread/doc/recursive_mutex-ref.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/recursive_mutex-ref.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,29 +1,33 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
 <header name="boost/thread/recursive_mutex.hpp"
-  last-revision="$Date: 2004/07/17 04:33:59 $">
+  last-revision="$Date: 2006/10/15 14:52:54 $">
   <namespace name="boost">
     <class name="recursive_mutex">
 		<purpose>
 			<para>The <classname>recursive_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.Mutex">Mutex</link> concept.</para>
+			<link linkend="thread.concepts.Mutex">Mutex</link> concept.</para>
 		</purpose>
 		
 		<description>
 			<para>The <classname>recursive_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.Mutex">Mutex</link> concept. 
+			<link linkend="thread.concepts.Mutex">Mutex</link> concept. 
 			It should be used to synchronize access to shared resources using
-			<link linkend="threads.concepts.recursive-locking-strategy">Recursive</link>
+			<link linkend="thread.concepts.recursive-locking-strategy">Recursive</link>
 			locking mechanics.</para>
 
 			<para>For classes that model related mutex concepts, see 
 			<classname>recursive_try_mutex</classname> and <classname>recursive_timed_mutex</classname>.</para>
 
-			<para>For <link linkend="threads.concepts.unspecified-locking-strategy">Unspecified</link>
+			<para>For <link linkend="thread.concepts.unspecified-locking-strategy">Unspecified</link>
 			locking mechanics, see <classname>mutex</classname>,
 			<classname>try_mutex</classname>, and <classname>timed_mutex</classname>.
 			</para>
@@ -43,7 +47,7 @@
 					<tbody>
 						<row>
 							<entry>scoped_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedLock">ScopedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedLock">ScopedLock</link></entry>
 						</row>
 					</tbody>
 				</tgroup>
@@ -51,7 +55,7 @@
 			</para>
 
 			<para>The <classname>recursive_mutex</classname> class uses a
-			<link linkend="threads.concepts.recursive-locking-strategy">Recursive</link>
+			<link linkend="thread.concepts.recursive-locking-strategy">Recursive</link>
 			locking strategy, so attempts to recursively lock a 
 			<classname>recursive_mutex</classname> object
 			succeed and an internal "lock count" is maintained. 
@@ -60,10 +64,10 @@
 			<emphasis role="bold">undefined behavior</emphasis>.</para>
 			
 			<para>Like all
-			<link linkend="threads.concepts.mutex-models">mutex models</link>
-			in &Boost.Threads;, <classname>recursive_mutex</classname> leaves the 
-			<link linkend="threads.concepts.sheduling-policies">scheduling policy</link>
-			as <link linkend="threads.concepts.unspecified-scheduling-policy">Unspecified</link>. 
+			<link linkend="thread.concepts.mutex-models">mutex models</link>
+			in &Boost.Thread;, <classname>recursive_mutex</classname> leaves the 
+			<link linkend="thread.concepts.sheduling-policies">scheduling policy</link>
+			as <link linkend="thread.concepts.unspecified-scheduling-policy">Unspecified</link>. 
 			Programmers should make no assumptions about the order in which
 			waiting threads acquire a lock.</para>
 		</description>
@@ -99,20 +103,20 @@
 	<class name="recursive_try_mutex">
 		<purpose>
 			<para>The <classname>recursive_try_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.TryMutex">TryMutex</link> concept.</para>
+			<link linkend="thread.concepts.TryMutex">TryMutex</link> concept.</para>
 		</purpose>
 		
 		<description>
 			<para>The <classname>recursive_try_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.TryMutex">TryMutex</link> concept. 
+			<link linkend="thread.concepts.TryMutex">TryMutex</link> concept. 
 			It should be used to synchronize access to shared resources using
-			<link linkend="threads.concepts.recursive-locking-strategy">Recursive</link>
+			<link linkend="thread.concepts.recursive-locking-strategy">Recursive</link>
 			locking mechanics.</para>
 
 			<para>For classes that model related mutex concepts, see 
 			<classname>recursive_mutex</classname> and <classname>recursive_timed_mutex</classname>.</para>
 
-			<para>For <link linkend="threads.concepts.unspecified-locking-strategy">Unspecified</link>
+			<para>For <link linkend="thread.concepts.unspecified-locking-strategy">Unspecified</link>
 			locking mechanics, see <classname>mutex</classname>,
 			<classname>try_mutex</classname>, and <classname>timed_mutex</classname>.
 			</para>
@@ -132,11 +136,11 @@
 					<tbody>
 						<row>
 							<entry>scoped_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedLock">ScopedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedLock">ScopedLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_try_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTryLock">ScopedTryLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTryLock">ScopedTryLock</link></entry>
 						</row>
 					</tbody>
 				</tgroup>
@@ -144,7 +148,7 @@
 			</para>
 
 			<para>The <classname>recursive_try_mutex</classname> class uses a
-			<link linkend="threads.concepts.recursive-locking-strategy">Recursive</link>
+			<link linkend="thread.concepts.recursive-locking-strategy">Recursive</link>
 			locking strategy, so attempts to recursively lock a 
 			<classname>recursive_try_mutex</classname> object
 			succeed and an internal "lock count" is maintained. 
@@ -153,10 +157,10 @@
 			<emphasis role="bold">undefined behavior</emphasis>.</para>
 			
 			<para>Like all
-			<link linkend="threads.concepts.mutex-models">mutex models</link>
-			in &Boost.Threads;, <classname>recursive_try_mutex</classname> leaves the 
-			<link linkend="threads.concepts.sheduling-policies">scheduling policy</link>
-			as <link linkend="threads.concepts.unspecified-scheduling-policy">Unspecified</link>. 
+			<link linkend="thread.concepts.mutex-models">mutex models</link>
+			in &Boost.Thread;, <classname>recursive_try_mutex</classname> leaves the 
+			<link linkend="thread.concepts.sheduling-policies">scheduling policy</link>
+			as <link linkend="thread.concepts.unspecified-scheduling-policy">Unspecified</link>. 
 			Programmers should make no assumptions about the order in which
 			waiting threads acquire a lock.</para>
 		</description>
@@ -197,20 +201,20 @@
 	<class name="recursive_timed_mutex">
 		<purpose>
 			<para>The <classname>recursive_timed_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.TimedMutex">TimedMutex</link> concept.</para>
+			<link linkend="thread.concepts.TimedMutex">TimedMutex</link> concept.</para>
 		</purpose>
 		
 		<description>
 			<para>The <classname>recursive_timed_mutex</classname> class is a model of the 
-			<link linkend="threads.concepts.TimedMutex">TimedMutex</link> concept. 
+			<link linkend="thread.concepts.TimedMutex">TimedMutex</link> concept. 
 			It should be used to synchronize access to shared resources using
-			<link linkend="threads.concepts.recursive-locking-strategy">Recursive</link>
+			<link linkend="thread.concepts.recursive-locking-strategy">Recursive</link>
 			locking mechanics.</para>
 
 			<para>For classes that model related mutex concepts, see 
 			<classname>recursive_mutex</classname> and <classname>recursive_try_mutex</classname>.</para>
 
-			<para>For <link linkend="threads.concepts.unspecified-locking-strategy">Unspecified</link>
+			<para>For <link linkend="thread.concepts.unspecified-locking-strategy">Unspecified</link>
 			locking mechanics, see <classname>mutex</classname>,
 			<classname>try_mutex</classname>, and <classname>timed_mutex</classname>.
 			</para>
@@ -230,15 +234,15 @@
 					<tbody>
 						<row>
 							<entry>scoped_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedLock">ScopedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedLock">ScopedLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_try_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTryLock">ScopedTryLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTryLock">ScopedTryLock</link></entry>
 						</row>
 						<row>
 							<entry>scoped_timed_lock</entry>
-							<entry><link linkend="threads.concepts.ScopedTimedLock">ScopedTimedLock</link></entry>
+							<entry><link linkend="thread.concepts.ScopedTimedLock">ScopedTimedLock</link></entry>
 						</row>
 					</tbody>
 				</tgroup>
@@ -246,7 +250,7 @@
 			</para>
 
 			<para>The <classname>recursive_timed_mutex</classname> class uses a
-			<link linkend="threads.concepts.recursive-locking-strategy">Recursive</link>
+			<link linkend="thread.concepts.recursive-locking-strategy">Recursive</link>
 			locking strategy, so attempts to recursively lock a 
 			<classname>recursive_timed_mutex</classname> object
 			succeed and an internal "lock count" is maintained. 
@@ -255,10 +259,10 @@
 			<emphasis role="bold">undefined behavior</emphasis>.</para>
 			
 			<para>Like all 
-			<link linkend="threads.concepts.mutex-models">mutex models</link>
-			in  &Boost.Threads;, <classname>recursive_timed_mutex</classname> leaves the 
-			<link linkend="threads.concepts.sheduling-policies">scheduling policy</link>
-			as <link linkend="threads.concepts.unspecified-scheduling-policy">Unspecified</link>. 
+			<link linkend="thread.concepts.mutex-models">mutex models</link>
+			in  &Boost.Thread;, <classname>recursive_timed_mutex</classname> leaves the 
+			<link linkend="thread.concepts.sheduling-policies">scheduling policy</link>
+			as <link linkend="thread.concepts.unspecified-scheduling-policy">Unspecified</link>. 
 			Programmers should make no assumptions about the order in which
 			waiting threads acquire a lock.</para>
 		</description>

Modified: boost/trunk/libs/thread/doc/reference.xml
===================================================================
--- boost/trunk/libs/thread/doc/reference.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/reference.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
-<library-reference id="threads.reference"
-  last-revision="$Date: 2004/07/17 04:33:59 $"
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+<library-reference id="thread.reference"
+  last-revision="$Date: 2007/01/01 16:45:52 $"
   xmlns:xi="http://www.w3.org/2001/XInclude">
   <xi:include href="barrier-ref.xml"/>
   <xi:include href="condition-ref.xml"/>
@@ -13,6 +17,12 @@
   <xi:include href="mutex-ref.xml"/>
   <xi:include href="once-ref.xml"/>
   <xi:include href="recursive_mutex-ref.xml"/>
+<!--
+  The read_write_mutex is held back from release, since the
+  implementation suffers from a serious, yet unresolved bug.
+  The implementation is likely to appear in a reworked
+  form in the next release.
+-->
   <xi:include href="read_write_mutex-ref.xml"/>
   <xi:include href="thread-ref.xml"/>
   <xi:include href="tss-ref.xml"/>

Modified: boost/trunk/libs/thread/doc/release_notes.xml
===================================================================
--- boost/trunk/libs/thread/doc/release_notes.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/release_notes.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,15 +1,75 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
-<section id="threads.release_notes" last-revision="$Date: 2004/08/05 18:07:20 $">
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+<section id="thread.release_notes" last-revision="$Date: 2006/11/03 04:05:55 $">
 	<title>Release Notes</title>
-	<section id="threads.release_notes.boost_1_32_0">
+    <section id="thread.release_notes.boost_1_34_0">
+        <title>Boost 1.34.0</title>
+
+        <section id="thread.release_notes.boost_1_34_0.change_log.maintainance">
+            <title>New team of maintainers</title>
+
+            <para>
+                Since the original author William E. Kempf no longer is available to
+                maintain the &Boost.Thread; library, a new team has been formed
+                in an attempt to continue the work on &Boost.Thread;.
+                Fortunately William E. Kempf has given
+                <ulink url="http://lists.boost.org/Archives/boost/2006/09/110143.php">
+                    permission </ulink> 
+                to use his work under the boost license.
+            </para>
+            <para>
+                The team currently consists of
+                <itemizedlist>
+                    <listitem>
+                        Anthony Williams, for the Win32 platform,
+                    </listitem>
+                    <listitem>
+                        Roland Schwarz, for the linux platform, and various "housekeeping" tasks.
+                    </listitem>
+                </itemizedlist>
+                Volunteers for other platforms are welcome!
+            </para>
+            <para>
+                As the &Boost.Thread; was kind of orphaned over the last release, this release
+                attempts to fix the known bugs. Upcoming releases will bring in new things.
+            </para>
+        </section>
+
+        <section id="thread.release_notes.boost_1_34_0.change_log.read_write_mutex">
+            <title>read_write_mutex still broken</title>
+
+            <para>
+                <note>
+                    It has been decided not to release the Read/Write Mutex, since the current
+                    implementation suffers from a serious bug. The documentation of the concepts
+                    has been included though, giving the interested reader an opportunity to study the
+                    original concepts. Please refer to the following links if you are interested
+                    which problems led to the decision to held back this mutex type.The issue
+                    has been discovered before 1.33 was released and the code has
+                    been omitted from that release. A reworked mutex is expected to appear in 1.35.
+                    Also see:  
+                    <ulink url="http://lists.boost.org/Archives/boost/2005/08/92307.php">
+                        read_write_mutex bug</ulink> 
+                    and 
+                    <ulink url="http://lists.boost.org/Archives/boost/2005/09/93180.php">
+                        read_write_mutex fundamentally broken in 1.33</ulink>
+                </note>
+            </para>
+        </section>
+
+    </section>
+    <section id="thread.release_notes.boost_1_32_0">
 		<title>Boost 1.32.0</title>
 
-		<section id="threads.release_notes.boost_1_32_0.change_log.documentation">
+		<section id="thread.release_notes.boost_1_32_0.change_log.documentation">
 			<title>Documentation converted to BoostBook</title>
 
 			<para>The documentation was converted to BoostBook format,
@@ -20,24 +80,24 @@
 			please report them!</para>
 		</section>
 
-		<section id="threads.release_notes.boost_1_32_0.change_log.static_link">
+		<section id="thread.release_notes.boost_1_32_0.change_log.static_link">
 			<title>Statically-link build option added</title>
 
-			<para>The option to link &Boost.Threads; as a static
+			<para>The option to link &Boost.Thread; as a static
 			library has been added (with some limitations on Win32 platforms).
 			This feature was originally removed from an earlier version
 			of Boost because <classname>boost::thread_specific_ptr</classname>
-			required that &Boost.Threads; be dynamically linked in order
+			required that &Boost.Thread; be dynamically linked in order
 			for its cleanup functionality to work on Win32 platforms.
 			Because this limitation never applied to non-Win32 platforms,
 			because significant progress has been made in removing
 			the limitation on Win32 platforms (many thanks to
 			Aaron LaFramboise and Roland Scwarz!), and because the lack
 			of static linking is one of the most common complaints of
-			&Boost.Threads; users, this decision was reversed.</para>
+			&Boost.Thread; users, this decision was reversed.</para>
 			
 			<para>On non-Win32 platforms: 
-			To choose the dynamically linked version of &Boost.Threads; 
+			To choose the dynamically linked version of &Boost.Thread; 
 			using Boost's auto-linking feature, #define BOOST_THREAD_USE_DLL;
 			to choose the statically linked version, 
 			#define BOOST_THREAD_USE_LIB. 
@@ -63,9 +123,9 @@
 			because it has not yet been possible to implement automatic
 			tss cleanup in the statically linked version for compilers
 			other than VC++, although it is hoped that this will be
-			possible in a future version of &Boost.Threads;.
+			possible in a future version of &Boost.Thread;.
 			
-			Note for advanced users: &Boost.Threads; provides several "hook"
+			Note for advanced users: &Boost.Thread; provides several "hook"
 			functions to allow users to experiment with the statically
 			linked version on Win32 with compilers other than VC++.
 			These functions are on_process_enter(), on_process_exit(),
@@ -74,13 +134,13 @@
 			information.</para>
 		</section>
 		
-		<section id="threads.release_notes.boost_1_32_0.change_log.barrier">
+		<section id="thread.release_notes.boost_1_32_0.change_log.barrier">
 			<title>Barrier functionality added</title>
 
 			<para>A new class, <classname>boost::barrier</classname>, was added.</para>
 		</section>
 		
-		<section id="threads.release_notes.boost_1_32_0.change_log.read_write_mutex">
+		<section id="thread.release_notes.boost_1_32_0.change_log.read_write_mutex">
 			<title>Read/write mutex functionality added</title>
 
 			<para>New classes, 
@@ -91,13 +151,13 @@
 			
 			<note>Since the read/write mutex and related classes are new,
 			both interface and implementation are liable to change
-			in future releases of &Boost.Threads;.
+			in future releases of &Boost.Thread;.
 			The lock concepts and lock promotion in particular are
 			still under discussion and very likely to change.</note>
 			</para>
 		</section>
 		
-		<section id="threads.release_notes.boost_1_32_0.change_log.thread_specific_ptr">
+		<section id="thread.release_notes.boost_1_32_0.change_log.thread_specific_ptr">
 			<title>Thread-specific pointer functionality changed</title>
 
 			<para>The <classname>boost::thread_specific_ptr</classname> 
@@ -124,7 +184,7 @@
 			is called.</para>
 		</section>
 
-		<section id="threads.release_notes.boost_1_32_0.change_log.mutex">
+		<section id="thread.release_notes.boost_1_32_0.change_log.mutex">
 			<title>Mutex implementation changed for Win32</title>
 
 			<para>On Win32, <classname>boost::mutex</classname>, 
@@ -135,10 +195,10 @@
 			<classname>boost::recursive_timed_mutex</classname> use a Win32 mutex.</para>
 		</section>
 
-		<section id="threads.release_notes.boost_1_32_0.change_log.wince">
+		<section id="thread.release_notes.boost_1_32_0.change_log.wince">
 			<title>Windows CE support improved</title>
 
-			<para>Minor changes were made to make Boost.Threads work on Windows CE.</para>
+			<para>Minor changes were made to make Boost.Thread work on Windows CE.</para>
 		</section>
 	</section>
 </section>

Modified: boost/trunk/libs/thread/doc/thread-ref.xml
===================================================================
--- boost/trunk/libs/thread/doc/thread-ref.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/thread-ref.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,25 +1,29 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
 <header name="boost/thread/thread.hpp"
-  last-revision="$Date: 2005/12/08 04:18:26 $">
+  last-revision="$Date: 2006/10/15 14:52:54 $">
   <namespace name="boost">
     <class name="thread">
 		<purpose>
 			<para>The <classname>thread</classname> class represents threads of
 			execution, and provides the functionality to create and manage 
-			threads within the &Boost.Threads; library. See 
-			<xref linkend="threads.glossary"/> for a precise description of 
-			<link linkend="threads.glossary.thread">thread of execution</link>,
+			threads within the &Boost.Thread; library. See 
+			<xref linkend="thread.glossary"/> for a precise description of 
+			<link linkend="thread.glossary.thread">thread of execution</link>,
 			and for definitions of threading-related terms and of thread states such as 
-			<link linkend="threads.glossary.thread-state">blocked</link>.</para>
+			<link linkend="thread.glossary.thread-state">blocked</link>.</para>
 		</purpose>
 
 		<description>
-			<para>A <link linkend="threads.glossary.thread">thread of execution</link>
+			<para>A <link linkend="thread.glossary.thread">thread of execution</link>
 			has an initial function. For the program's initial thread, the initial 
 			function is <code>main()</code>. For other threads, the initial 
 			function is <code>operator()</code> of the function object passed to
@@ -36,7 +40,7 @@
 			&quot;joinable&quot; or &quot;non-joinable&quot;.</para>
 
 			<para>Except as described below, the policy used by an implementation
-			of &Boost.Threads; to schedule transitions between thread states is 
+			of &Boost.Thread; to schedule transitions between thread states is 
 			unspecified.</para>
 
 			<para><note>Just as the lifetime of a file may be different from the
@@ -149,7 +153,7 @@
 				<notes>If <code>*this == thread()</code> the result is 
 				implementation-defined. If the implementation doesn't
 				detect this the result will be 
-				<link linkend="threads.glossary.deadlock">deadlock</link>.
+				<link linkend="thread.glossary.deadlock">deadlock</link>.
 				</notes>
 			</method>
 		</method-group>
@@ -170,7 +174,7 @@
 				<type>void</type>
 
 				<effects>The current thread of execution is placed in the
-				<link linkend="threads.glossary.thread-state">ready</link> 
+				<link linkend="thread.glossary.thread-state">ready</link> 
 				state.</effects>
 				
 				<notes>

Modified: boost/trunk/libs/thread/doc/thread.xml
===================================================================
--- boost/trunk/libs/thread/doc/thread.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/thread.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
-<library name="Threads" dirname="thread" id="threads"
-last-revision="$Date: 2005/07/07 18:06:26 $"
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+<library name="Thread" dirname="thread" id="thread"
+last-revision="$Date: 2006/10/15 14:52:54 $"
 xmlns:xi="http://www.w3.org/2001/XInclude">
   <libraryinfo>
     <author>
@@ -20,19 +24,14 @@
       <holder>William E. Kempf</holder>
     </copyright>
     <legalnotice>
-      <para>Permission to use, copy, modify, distribute and sell this
-      software and its documentation for any purpose is hereby granted
-      without fee, provided that the above copyright notice appear in all
-      copies and that both that copyright notice and this permission notice
-      appear in supporting documentation. William E. Kempf makes no
-      representations about the suitability of this software for any purpose.
-      It is provided "as is" without express or implied warranty.</para>
+      <para>Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)</para>
     </legalnotice>
     <librarypurpose>Portable C++ multi-threading</librarypurpose>
     <librarycategory name="category:concurrent" />
-    <title>Boost.Threads</title>
+    <title>Boost.Thread</title>
   </libraryinfo>
-  <title>Boost.Threads</title>
+  <title>Boost.Thread</title>
   <xi:include href="overview.xml"/>
   <xi:include href="design.xml"/>
   <xi:include href="concepts.xml"/>

Modified: boost/trunk/libs/thread/doc/tss-ref.xml
===================================================================
--- boost/trunk/libs/thread/doc/tss-ref.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/tss-ref.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
 <header name="boost/thread/tss.hpp"
-	last-revision="$Date: 2004/07/17 04:33:59 $">
+	last-revision="$Date: 2006/10/15 14:52:54 $">
 	<namespace name="boost">
 		<class name="thread_specific_ptr">
 			<purpose>
@@ -17,7 +21,7 @@
 				<para>Thread specific storage is data associated with 
 				individual threads and is often used to make operations
 				that rely on global data 
-				<link linkend="threads.glossary.thread-safe">thread-safe</link>.
+				<link linkend="thread.glossary.thread-safe">thread-safe</link>.
 				</para>
 				
 				<para>Template <classname>thread_specific_ptr</classname> 

Modified: boost/trunk/libs/thread/doc/xtime-ref.xml
===================================================================
--- boost/trunk/libs/thread/doc/xtime-ref.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/doc/xtime-ref.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd" [
-  <!ENTITY % threads.entities SYSTEM "entities.xml">
-  %threads.entities;
+  <!ENTITY % thread.entities SYSTEM "entities.xml">
+  %thread.entities;
 ]>
+<!-- Copyright (c) 2002-2003 William E. Kempf, Michael Glassford
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
 <header name="boost/thread/xtime.hpp"
-  last-revision="$Date: 2004/07/17 04:33:59 $">
+  last-revision="$Date: 2006/10/15 14:52:54 $">
   <namespace name="boost">
     <enum name="xtime_clock_types">
 		<enumvalue name="TIME_UTC" />
@@ -16,7 +20,7 @@
 		</purpose>
 
 		<description>
-			<para>The only clock type supported by &Boost.Threads; is 
+			<para>The only clock type supported by &Boost.Thread; is 
 			<code>TIME_UTC</code>. The epoch for <code>TIME_UTC</code>
 			is 1970-01-01 00:00:00.</para>
 		</description>
@@ -33,9 +37,9 @@
 		<description>
 			<simpara>The <classname>xtime</classname> type is used to represent a point on 
 			some time scale or a duration in time. This type may be proposed for the C standard by 
-			Markus Kuhn. &Boost.Threads; provides only a very minimal implementation of this
+			Markus Kuhn. &Boost.Thread; provides only a very minimal implementation of this
 			proposal; it is expected that a full implementation (or some other time
-			library) will be provided in Boost as a separate library, at which time &Boost.Threads;
+			library) will be provided in Boost as a separate library, at which time &Boost.Thread;
 			will deprecate its own implementation.</simpara>
 			
 			<simpara><emphasis role="bold">Note</emphasis> that the resolution is 

Deleted: boost/trunk/libs/thread/example/.cvsignore
===================================================================
--- boost/trunk/libs/thread/example/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/example/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +0,0 @@
-bin
-*.pdb

Deleted: boost/trunk/libs/thread/example/Jamfile
===================================================================
--- boost/trunk/libs/thread/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,54 +0,0 @@
-# Copyright (C) 2001-2003
-# William E. Kempf
-#
-# Permission to use, copy, modify, distribute and sell this software
-# and its documentation for any purpose is hereby granted without fee,
-# provided that the above copyright notice appear in all copies and
-# that both that copyright notice and this permission notice appear
-# in supporting documentation.  William E. Kempf makes no representations
-# about the suitability of this software for any purpose.
-# It is provided "as is" without express or implied warranty.
-#
-# Boost.Threads example Jamfile
-#
-# Additional configuration variables used:
-#   1. PTW32 may be used on Win32 platforms to specify that the pthreads-win32
-#      library should be used instead of "native" threads. This feature is
-#      mostly used for testing and it's generally recommended you use the
-#      native threading libraries instead. PTW32 should be set to be a list
-#      of two strings, the first specifying the installation path of the
-#      pthreads-win32 library and the second specifying which library
-#      variant to link against (see the pthreads-win32 documentation).
-#      Example: jam -sPTW32="c:\pthreads-win32 pthreadVCE.lib"
-
-# Declare the location of this subproject relative to the root.
-subproject libs/thread/example ;
-
-# Include threads.jam for Boost.Threads global build information.
-# This greatly simplifies the Jam code needed to configure the build
-# for the various Win32 build types.
-import ../build/threads ;
-
-{
-    template example
-        ## sources ##
-        : <template>thread_base
-          <dll>../build/boost_thread
-        ## requirements ##
-        :
-        ## default build ##
-        :
-    ;
-
-    exe monitor : <template>example monitor.cpp ;
-    exe starvephil : <template>example starvephil.cpp ;
-    exe tennis : <template>example tennis.cpp ;
-    exe condition : <template>example condition.cpp ;
-    exe mutex : <template>example mutex.cpp ;
-    exe once : <template>example once.cpp ;
-    exe recursive_mutex : <template>example recursive_mutex.cpp ;
-    exe thread : <template>example thread.cpp ;
-    exe thread_group : <template>example thread_group.cpp ;
-    exe tss : <template>example tss.cpp ;
-    exe xtime : <template>example xtime.cpp ;
-}

Modified: boost/trunk/libs/thread/example/Jamfile.v2
===================================================================
--- boost/trunk/libs/thread/example/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/example/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright (C) 2001-2003
+# William E. Kempf
+#
+#  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+#  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 project boost/thread/example 
     : requirements <library>../build//boost_thread <threading>multi

Modified: boost/trunk/libs/thread/example/condition.cpp
===================================================================
--- boost/trunk/libs/thread/example/condition.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/example/condition.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <iostream>
 #include <vector>

Modified: boost/trunk/libs/thread/example/monitor.cpp
===================================================================
--- boost/trunk/libs/thread/example/monitor.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/example/monitor.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <vector>
 #include <iostream>

Modified: boost/trunk/libs/thread/example/mutex.cpp
===================================================================
--- boost/trunk/libs/thread/example/mutex.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/example/mutex.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/mutex.hpp>
 #include <boost/thread/thread.hpp>

Modified: boost/trunk/libs/thread/example/once.cpp
===================================================================
--- boost/trunk/libs/thread/example/once.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/example/once.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/thread.hpp>
 #include <boost/thread/once.hpp>

Modified: boost/trunk/libs/thread/example/recursive_mutex.cpp
===================================================================
--- boost/trunk/libs/thread/example/recursive_mutex.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/example/recursive_mutex.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/recursive_mutex.hpp>
 #include <boost/thread/thread.hpp>

Modified: boost/trunk/libs/thread/example/starvephil.cpp
===================================================================
--- boost/trunk/libs/thread/example/starvephil.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/example/starvephil.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/mutex.hpp>
 #include <boost/thread/condition.hpp>

Modified: boost/trunk/libs/thread/example/tennis.cpp
===================================================================
--- boost/trunk/libs/thread/example/tennis.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/example/tennis.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/mutex.hpp>
 #include <boost/thread/condition.hpp>

Modified: boost/trunk/libs/thread/example/thread.cpp
===================================================================
--- boost/trunk/libs/thread/example/thread.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/example/thread.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/thread.hpp>
 #include <boost/thread/xtime.hpp>

Modified: boost/trunk/libs/thread/example/thread_group.cpp
===================================================================
--- boost/trunk/libs/thread/example/thread_group.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/example/thread_group.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/thread.hpp>
 #include <iostream>

Modified: boost/trunk/libs/thread/example/tss.cpp
===================================================================
--- boost/trunk/libs/thread/example/tss.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/example/tss.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/thread.hpp>
 #include <boost/thread/tss.hpp>

Modified: boost/trunk/libs/thread/example/xtime.cpp
===================================================================
--- boost/trunk/libs/thread/example/xtime.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/example/xtime.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/thread.hpp>
 #include <boost/thread/xtime.hpp>

Modified: boost/trunk/libs/thread/index.html
===================================================================
--- boost/trunk/libs/thread/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+<!-- Copyright (c) 2002-2003 William E. Kempf.
+     Subject to the Boost Software License, Version 1.0. 
+     (See accompanying file LICENSE-1.0 or  http://www.boost.org/LICENSE-1.0)
+-->
+
 <html>
 <head>
 <meta http-equiv="refresh" content="0; URL=doc/index.html">

Modified: boost/trunk/libs/thread/src/barrier.cpp
===================================================================
--- boost/trunk/libs/thread/src/barrier.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/barrier.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2002-2003
 // David Moore, William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 #include <boost/thread/barrier.hpp>

Modified: boost/trunk/libs/thread/src/condition.cpp
===================================================================
--- boost/trunk/libs/thread/src/condition.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/condition.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 
@@ -32,6 +27,12 @@
 #   include "mac/safe.hpp"
 #endif
 
+// The following include can be removed after the bug on QNX
+// has been tracked down. I need this only for debugging
+//#if !defined(NDEBUG) && defined(BOOST_HAS_PTHREADS)
+#include <iostream>
+//#endif
+
 namespace boost {
 
 namespace detail {
@@ -378,6 +379,20 @@
 
     int res = 0;
     res = pthread_cond_timedwait(&m_condition, pmutex, &ts);
+// Test code for QNX debugging, to get information during regressions
+#ifndef NDEBUG
+    if (res == EINVAL) {
+        boost::xtime now;
+        boost::xtime_get(&now, boost::TIME_UTC);
+        std::cerr << "now: " << now.sec << " " << now.nsec << std::endl;
+        std::cerr << "time: " << time(0) << std::endl;
+        std::cerr << "xtime: " << xt.sec << " " << xt.nsec << std::endl;
+        std::cerr << "ts: " << ts.tv_sec << " " << ts.tv_nsec << std::endl;
+        std::cerr << "pmutex: " << pmutex << std::endl;
+        std::cerr << "condition: " << &m_condition << std::endl;
+        assert(res != EINVAL);
+    }
+#endif    
     assert(res == 0 || res == ETIMEDOUT);
 
     return res != ETIMEDOUT;

Modified: boost/trunk/libs/thread/src/exceptions.cpp
===================================================================
--- boost/trunk/libs/thread/src/exceptions.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/exceptions.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 
@@ -15,57 +10,6 @@
 #include <cstring>
 #include <string>
 
-# ifdef BOOST_NO_STDC_NAMESPACE
-namespace std { using ::strerror; }
-# endif
-
-// BOOST_POSIX or BOOST_WINDOWS specify which API to use.
-# if !defined( BOOST_WINDOWS ) && !defined( BOOST_POSIX )
-#   if defined(_WIN32) || defined(__WIN32__) || defined(WIN32) || defined(__CYGWIN__)
-#     define BOOST_WINDOWS
-#   else
-#     define BOOST_POSIX
-#   endif
-# endif
-
-# if defined( BOOST_WINDOWS )
-#   include "windows.h"
-# else
-#   include <errno.h> // for POSIX error codes
-# endif
-
-namespace
-{
-
-std::string system_message(int sys_err_code)
-{
-    std::string str;
-# ifdef BOOST_WINDOWS
-    LPVOID lpMsgBuf;
-    ::FormatMessageA(FORMAT_MESSAGE_ALLOCATE_BUFFER |
-        FORMAT_MESSAGE_FROM_SYSTEM |
-        FORMAT_MESSAGE_IGNORE_INSERTS,
-        NULL,
-        sys_err_code,
-        MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), // Default language
-        (LPSTR)&lpMsgBuf,
-        0,
-        NULL);
-    str += static_cast<LPCSTR>(lpMsgBuf);
-    ::LocalFree(lpMsgBuf); // free the buffer
-    while (str.size() && (str[str.size()-1] == '\n' ||
-               str[str.size()-1] == '\r'))
-    {
-        str.erase(str.size()-1);
-    }
-# else
-    str += std::strerror(errno);
-# endif
-    return str;
-}
-
-} // unnamed namespace
-
 namespace boost {
 
 thread_exception::thread_exception()
@@ -87,13 +31,6 @@
     return m_sys_err; 
 }
 
-const char* thread_exception::message() const
-{
-    if (m_sys_err != 0)
-        return system_message(m_sys_err).c_str();
-    return what();
-}
-
 lock_error::lock_error()
 {
 }

Modified: boost/trunk/libs/thread/src/mutex.cpp
===================================================================
--- boost/trunk/libs/thread/src/mutex.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/mutex.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 

Modified: boost/trunk/libs/thread/src/mutex.inl
===================================================================
--- boost/trunk/libs/thread/src/mutex.inl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/mutex.inl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,9 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+// boostinspect:nounnamed
 
 namespace {
 
@@ -28,7 +24,7 @@
         version_info.dwMajorVersion >= 4)
     {
         if (HMODULE kernel_module = GetModuleHandle(TEXT("KERNEL32.DLL")))
-            g_TryEnterCriticalSection = reinterpret_cast<TryEnterCriticalSection_type>(GetProcAddress(kernel_module, "TryEnterCriticalSection"));
+            g_TryEnterCriticalSection = reinterpret_cast<TryEnterCriticalSection_type>(GetProcAddress(kernel_module, TEXT("TryEnterCriticalSection")));
     }
 }
 

Modified: boost/trunk/libs/thread/src/once.cpp
===================================================================
--- boost/trunk/libs/thread/src/once.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/once.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 
@@ -118,7 +113,14 @@
 // according to the above function type wrappers.
 inline LONG compare_exchange(volatile LPLONG dest, LONG exch, LONG cmp)
 {
+#ifdef _WIN64
+    // Original patch from Anthony Williams.
+    // I (Roland Schwarz) am trying this for RC_1_34_0, since x64 regressions are
+    // currently not run on x64 platforms for HEAD
+    return InterlockedCompareExchange(dest, exch,cmp);
+#else    
     return ice_wrapper(&InterlockedCompareExchange, dest, exch, cmp);
+#endif
 }
 }
 #endif

Modified: boost/trunk/libs/thread/src/read_write_mutex.cpp
===================================================================
--- boost/trunk/libs/thread/src/read_write_mutex.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/read_write_mutex.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,17 +1,15 @@
 // Copyright (C) 2002-2003
 // David Moore, William E. Kempf, Michael Glassford
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 /*
 PROBLEMS:
 
+The read write mutex currently is broken. Do not use it.
+The file is supplied just for reference.
+
 The algorithms are not exception safe. For instance, if conditon::wait()
 or another call throws an exception, the lock state and other state data
 are not appropriately adjusted.
@@ -379,7 +377,10 @@
     , m_readers_next(true) 
 {}
 
-#if !BOOST_WORKAROUND(__BORLANDC__, <= 0x564)
+// Borland requires base class destructors to be explicitly exported from DLL's
+// even if they're not explicitly called. As this only contains postconditions,
+// it's reasonably safe to comment it out - Nicola Musatti 5/5/2006
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(582))
 template<typename Mutex>
 read_write_mutex_impl<Mutex>::~read_write_mutex_impl()
 {

Modified: boost/trunk/libs/thread/src/recursive_mutex.cpp
===================================================================
--- boost/trunk/libs/thread/src/recursive_mutex.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/recursive_mutex.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 
@@ -296,7 +291,8 @@
 
     res = pthread_mutex_init(&m_mutex, &attr);
     {
-        int res = pthread_mutexattr_destroy(&attr);
+        int res = 0;
+        res = pthread_mutexattr_destroy(&attr);
         assert(res == 0);
     }
     if (res != 0)
@@ -452,7 +448,8 @@
 
     res = pthread_mutex_init(&m_mutex, &attr);
     {
-        int res = pthread_mutexattr_destroy(&attr);
+        int res = 0;
+        res = pthread_mutexattr_destroy(&attr);
         assert(res == 0);
     }
     if (res != 0)

Modified: boost/trunk/libs/thread/src/thread.cpp
===================================================================
--- boost/trunk/libs/thread/src/thread.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/thread.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 
@@ -105,8 +100,8 @@
         static OSStatus thread_proxy(void* param)
 #endif
     {
-        try
-        {
+        //try
+        //{
             thread_param* p = static_cast<thread_param*>(param);
             boost::function0<void> threadfunc = p->m_threadfunc;
             p->started();
@@ -114,13 +109,13 @@
 #if defined(BOOST_HAS_WINTHREADS)
             on_thread_exit();
 #endif
-        }
-        catch (...)
-        {
+        //}
+        //catch (...)
+        //{
 #if defined(BOOST_HAS_WINTHREADS)
-            on_thread_exit();
+        //    on_thread_exit();
 #endif
-        }
+        //}
 #if defined(BOOST_HAS_MPTASKS)
         ::boost::detail::thread_cleanup();
 #endif

Modified: boost/trunk/libs/thread/src/timeconv.inl
===================================================================
--- boost/trunk/libs/thread/src/timeconv.inl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/timeconv.inl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,14 +1,11 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
+// boostinspect:nounnamed
+
 namespace {
 const int MILLISECONDS_PER_SECOND = 1000;
 const int NANOSECONDS_PER_SECOND = 1000000000;

Modified: boost/trunk/libs/thread/src/tss.cpp
===================================================================
--- boost/trunk/libs/thread/src/tss.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/tss.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
-// Copyright (C) 2001-2003
-// William E. Kempf
+// Copyright (C) 2001-2003 William E. Kempf
+// Copyright (C) 2006 Roland Schwarz
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 
@@ -30,63 +25,98 @@
 namespace {
 
 typedef std::vector<void*> tss_slots;
+typedef std::vector<boost::function1<void, void*>*> tss_data_cleanup_handlers_type;
 
-struct tss_data_t
+boost::once_flag tss_data_once = BOOST_ONCE_INIT;
+boost::mutex* tss_data_mutex = 0;
+tss_data_cleanup_handlers_type* tss_data_cleanup_handlers = 0;
+#if defined(BOOST_HAS_WINTHREADS)
+    DWORD tss_data_native_key;
+#elif defined(BOOST_HAS_PTHREADS)
+    pthread_key_t tss_data_native_key;
+#elif defined(BOOST_HAS_MPTASKS)
+    TaskStorageIndex tss_data_native_key;
+#endif
+int tss_data_use = 0;
+
+void tss_data_inc_use(boost::mutex::scoped_lock& lk)
 {
-    boost::mutex mutex;
-    std::vector<boost::function1<void, void*>*> cleanup_handlers;
+    ++tss_data_use;
+}
+
+void tss_data_dec_use(boost::mutex::scoped_lock& lk)
+{
+    if (0 == --tss_data_use)
+    {
+        tss_data_cleanup_handlers_type::size_type i;
+        for (i = 0; i < tss_data_cleanup_handlers->size(); ++i)
+        {
+            delete (*tss_data_cleanup_handlers)[i];
+        }
+        delete tss_data_cleanup_handlers;
+        tss_data_cleanup_handlers = 0;
+        lk.unlock();
+        delete tss_data_mutex;
+        tss_data_mutex = 0;
 #if defined(BOOST_HAS_WINTHREADS)
-    DWORD native_key;
+        TlsFree(tss_data_native_key);
 #elif defined(BOOST_HAS_PTHREADS)
-    pthread_key_t native_key;
+        pthread_key_delete(tss_data_native_key);
 #elif defined(BOOST_HAS_MPTASKS)
-    TaskStorageIndex native_key;
+        // Don't know what to put here.
+        // But MPTASKS isn't currently maintained anyways...
 #endif
-};
+    }
+}
 
-tss_data_t* tss_data = 0;
-boost::once_flag tss_data_once = BOOST_ONCE_INIT;
-
 extern "C" void cleanup_slots(void* p)
 {
     tss_slots* slots = static_cast<tss_slots*>(p);
+    boost::mutex::scoped_lock lock(*tss_data_mutex);
     for (tss_slots::size_type i = 0; i < slots->size(); ++i)
     {
-        boost::mutex::scoped_lock lock(tss_data->mutex);
-        (*tss_data->cleanup_handlers[i])((*slots)[i]);
+        (*(*tss_data_cleanup_handlers)[i])((*slots)[i]);
         (*slots)[i] = 0;
     }
+    tss_data_dec_use(lock);
     delete slots;
 }
 
 void init_tss_data()
 {
-    std::auto_ptr<tss_data_t> temp(new tss_data_t);
+    std::auto_ptr<tss_data_cleanup_handlers_type> 
+        temp(new tss_data_cleanup_handlers_type);
 
+    std::auto_ptr<boost::mutex> temp_mutex(new boost::mutex);
+    if (temp_mutex.get() == 0)
+        throw boost::thread_resource_error();
+
 #if defined(BOOST_HAS_WINTHREADS)
     //Force the cleanup implementation library to be linked in
     tss_cleanup_implemented();
 
     //Allocate tls slot
-    temp->native_key = TlsAlloc();
-    if (temp->native_key == 0xFFFFFFFF)
+    tss_data_native_key = TlsAlloc();
+    if (tss_data_native_key == 0xFFFFFFFF)
         return;
 #elif defined(BOOST_HAS_PTHREADS)
-    int res = pthread_key_create(&temp->native_key, &cleanup_slots);
+    int res = pthread_key_create(&tss_data_native_key, &cleanup_slots);
     if (res != 0)
         return;
 #elif defined(BOOST_HAS_MPTASKS)
-    OSStatus status = MPAllocateTaskStorageIndex(&temp->native_key);
+    OSStatus status = MPAllocateTaskStorageIndex(&tss_data_native_key);
     if (status != noErr)
         return;
 #endif
 
-    // Intentional memory "leak"
-    // This is the only way to ensure the mutex in the global data
-    // structure is available when cleanup handlers are run, since the
-    // execution order of cleanup handlers is unspecified on any platform
-    // with regards to C++ destructor ordering rules.
-    tss_data = temp.release();
+    // The life time of cleanup handlers and mutex is beeing
+    // managed by a reference counting technique.
+    // This avoids a memory leak by releasing the global data
+    // after last use only, since the execution order of cleanup
+    // handlers is unspecified on any platform with regards to
+    // C++ destructor ordering rules.
+    tss_data_cleanup_handlers = temp.release();
+    tss_data_mutex = temp_mutex.release();
 }
 
 #if defined(BOOST_HAS_WINTHREADS)
@@ -106,13 +136,13 @@
 
 #if defined(BOOST_HAS_WINTHREADS)
     slots = static_cast<tss_slots*>(
-        TlsGetValue(tss_data->native_key));
+        TlsGetValue(tss_data_native_key));
 #elif defined(BOOST_HAS_PTHREADS)
     slots = static_cast<tss_slots*>(
-        pthread_getspecific(tss_data->native_key));
+        pthread_getspecific(tss_data_native_key));
 #elif defined(BOOST_HAS_MPTASKS)
     slots = static_cast<tss_slots*>(
-        MPGetTaskStorageValue(tss_data->native_key));
+        MPGetTaskStorageValue(tss_data_native_key));
 #endif
 
     if (slots == 0 && alloc)
@@ -122,16 +152,19 @@
 #if defined(BOOST_HAS_WINTHREADS)
         if (at_thread_exit(&tss_thread_exit) == -1)
             return 0;
-        if (!TlsSetValue(tss_data->native_key, temp.get()))
+        if (!TlsSetValue(tss_data_native_key, temp.get()))
             return 0;
 #elif defined(BOOST_HAS_PTHREADS)
-        if (pthread_setspecific(tss_data->native_key, temp.get()) != 0)
+        if (pthread_setspecific(tss_data_native_key, temp.get()) != 0)
             return 0;
 #elif defined(BOOST_HAS_MPTASKS)
-        if (MPSetTaskStorageValue(tss_data->native_key, temp.get()) != noErr)
+        if (MPSetTaskStorageValue(tss_data_native_key, temp.get()) != noErr)
             return 0;
 #endif
-
+        {
+            boost::mutex::scoped_lock lock(*tss_data_mutex);
+            tss_data_inc_use(lock);
+        }
         slots = temp.release();
     }
 
@@ -146,13 +179,14 @@
 void tss::init(boost::function1<void, void*>* pcleanup)
 {
     boost::call_once(&init_tss_data, tss_data_once);
-    if (tss_data == 0)
+    if (tss_data_cleanup_handlers == 0)
         throw thread_resource_error();
-    boost::mutex::scoped_lock lock(tss_data->mutex);
+    boost::mutex::scoped_lock lock(*tss_data_mutex);
     try
     {
-        tss_data->cleanup_handlers.push_back(pcleanup);
-        m_slot = tss_data->cleanup_handlers.size() - 1;
+        tss_data_cleanup_handlers->push_back(pcleanup);
+        m_slot = tss_data_cleanup_handlers->size() - 1;
+        tss_data_inc_use(lock);
     }
     catch (...)
     {
@@ -160,6 +194,12 @@
     }
 }
 
+tss::~tss()
+{
+    boost::mutex::scoped_lock lock(*tss_data_mutex);
+    tss_data_dec_use(lock);
+}
+
 void* tss::get() const
 {
     tss_slots* slots = get_slots(false);
@@ -197,8 +237,8 @@
 
 void tss::cleanup(void* value)
 {
-    boost::mutex::scoped_lock lock(tss_data->mutex);
-    (*tss_data->cleanup_handlers[m_slot])(value);
+    boost::mutex::scoped_lock lock(*tss_data_mutex);
+    (*(*tss_data_cleanup_handlers)[m_slot])(value);
 }
 
 } // namespace detail

Modified: boost/trunk/libs/thread/src/tss_dll.cpp
===================================================================
--- boost/trunk/libs/thread/src/tss_dll.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/tss_dll.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,6 +14,8 @@
 
     #if defined(__BORLANDC__)
         extern "C" BOOL WINAPI DllEntryPoint(HINSTANCE /*hInstance*/, DWORD dwReason, LPVOID /*lpReserved*/)
+    #elif defined(_WIN32_WCE)
+        extern "C" BOOL WINAPI DllMain(HANDLE /*hInstance*/, DWORD dwReason, LPVOID /*lpReserved*/)
     #else
         extern "C" BOOL WINAPI DllMain(HINSTANCE /*hInstance*/, DWORD dwReason, LPVOID /*lpReserved*/)
     #endif

Modified: boost/trunk/libs/thread/src/tss_hooks.cpp
===================================================================
--- boost/trunk/libs/thread/src/tss_hooks.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/tss_hooks.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,5 @@
-// (C) Copyright Michael Glassford 2004.
+// Copyright (C) 2004 Michael Glassford
+// Copyright (C) 2006 Roland Schwarz
 // Use, modification and distribution are subject to the
 // Boost Software License, Version 1.0. (See accompanying file
 // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -10,7 +11,7 @@
     #include <boost/thread/detail/tss_hooks.hpp>
 
     #include <boost/assert.hpp>
-    #include <boost/thread/mutex.hpp>
+//    #include <boost/thread/mutex.hpp>
     #include <boost/thread/once.hpp>
 
     #include <list>
@@ -20,15 +21,37 @@
 
     namespace
     {
+        class CScopedCSLock
+        {
+        public:
+            CScopedCSLock(LPCRITICAL_SECTION cs) : cs(cs), lk(true) {
+                ::EnterCriticalSection(cs);
+            }
+            ~CScopedCSLock() {
+                if (lk) ::LeaveCriticalSection(cs);
+            }
+            void Unlock() {
+                lk = false;
+                ::LeaveCriticalSection(cs);
+            }
+        private:
+            bool lk;
+            LPCRITICAL_SECTION cs;
+        };
+
         typedef std::list<thread_exit_handler> thread_exit_handlers;
 
         boost::once_flag once_init_threadmon_mutex = BOOST_ONCE_INIT;
-        boost::mutex* threadmon_mutex;
+        //boost::mutex* threadmon_mutex;
+        // We don't use boost::mutex here, to avoid a memory leak report,
+        // because we cannot delete it again easily.
+        CRITICAL_SECTION threadmon_mutex;
         void init_threadmon_mutex(void)
         {
-            threadmon_mutex = new boost::mutex;
-            if (!threadmon_mutex)
-                throw boost::thread_resource_error();
+            //threadmon_mutex = new boost::mutex;
+            //if (!threadmon_mutex)
+            //    throw boost::thread_resource_error();
+            ::InitializeCriticalSection(&threadmon_mutex);
         }
 
         const DWORD invalid_tls_key = TLS_OUT_OF_INDEXES;
@@ -52,7 +75,8 @@
         )
     {
         boost::call_once(init_threadmon_mutex, once_init_threadmon_mutex);
-        boost::mutex::scoped_lock lock(*threadmon_mutex);
+        //boost::mutex::scoped_lock lock(*threadmon_mutex);
+        CScopedCSLock lock(&threadmon_mutex);
 
         //Allocate a tls slot if necessary.
 
@@ -118,7 +142,8 @@
     extern "C" BOOST_THREAD_DECL void on_process_enter(void)
     {
         boost::call_once(init_threadmon_mutex, once_init_threadmon_mutex);
-        boost::mutex::scoped_lock lock(*threadmon_mutex);
+//        boost::mutex::scoped_lock lock(*threadmon_mutex);
+        CScopedCSLock lock(&threadmon_mutex);
 
         BOOST_ASSERT(attached_thread_count == 0);
     }
@@ -126,7 +151,8 @@
     extern "C" BOOST_THREAD_DECL void on_process_exit(void)
     {
         boost::call_once(init_threadmon_mutex, once_init_threadmon_mutex);
-        boost::mutex::scoped_lock lock(*threadmon_mutex);
+//        boost::mutex::scoped_lock lock(*threadmon_mutex);
+        CScopedCSLock lock(&threadmon_mutex);
 
         BOOST_ASSERT(attached_thread_count == 0);
 
@@ -148,7 +174,8 @@
     extern "C" BOOST_THREAD_DECL void on_thread_exit(void)
     {
         boost::call_once(init_threadmon_mutex, once_init_threadmon_mutex);
-        boost::mutex::scoped_lock lock(*threadmon_mutex);
+//        boost::mutex::scoped_lock lock(*threadmon_mutex);
+        CScopedCSLock lock(&threadmon_mutex);
 
         //Get the exit handlers list for the current thread from tls.
 
@@ -165,7 +192,8 @@
             BOOST_ASSERT(attached_thread_count > 0);
             --attached_thread_count;
 
-            lock.unlock();
+            //lock.unlock();
+            lock.Unlock();
 
             //Call each handler and remove it from the list
 

Modified: boost/trunk/libs/thread/src/tss_pe.cpp
===================================================================
--- boost/trunk/libs/thread/src/tss_pe.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/tss_pe.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,7 @@
 
     //Definitions required by implementation
 
-    #if (_MSC_VER < 1310) // 1310 == VC++ 7.1
+    #if (_MSC_VER < 1300) // 1300 == VC++ 7.0
         typedef void (__cdecl *_PVFV)(void);
         #define INIRETSUCCESS
         #define PVAPI void
@@ -48,7 +48,7 @@
         //The .CRT$Xxx information is taken from Codeguru:
         //http://www.codeguru.com/Cpp/misc/misc/threadsprocesses/article.php/c6945__2/
 
-        #if (_MSC_VER >= 1310) // 1310 == VC++ 7.1
+        #if (_MSC_VER >= 1300) // 1300 == VC++ 7.0
         #   pragma data_seg(push, old_seg)
         #endif
             //Callback to run tls glue code first.
@@ -78,7 +78,7 @@
             #pragma data_seg(".CRT$XTU")
             static _PVFV p_process_term = on_process_term;
             #pragma data_seg()
-        #if (_MSC_VER >= 1310) // 1310 == VC++ 7.1
+        #if (_MSC_VER >= 1300) // 1300 == VC++ 7.0
         #   pragma data_seg(pop, old_seg)
         #endif
 
@@ -94,7 +94,7 @@
 
             DWORD volatile dw = _tls_used;
 
-            #if (_MSC_VER < 1310) // 1310 == VC++ 7.1
+            #if (_MSC_VER < 1300) // 1300 == VC++ 7.0
                 _TLSCB* pfbegin = __xl_a;
                 _TLSCB* pfend = __xl_z;
                 _TLSCB* pfdst = pfbegin;

Modified: boost/trunk/libs/thread/src/xtime.cpp
===================================================================
--- boost/trunk/libs/thread/src/xtime.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/src/xtime.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 
@@ -27,6 +22,8 @@
 #   include <boost/thread/detail/force_cast.hpp>
 #endif
 
+#include <cassert>
+
 namespace boost {
 
 #ifdef BOOST_HAS_MPTASKS
@@ -111,13 +108,23 @@
         return clock_type;
 #elif defined(BOOST_HAS_GETTIMEOFDAY)
         struct timeval tv;
+#       ifndef NDEBUG
+        int res =
+#endif            
         gettimeofday(&tv, 0);
+        assert(0 == res);
+        assert(tv.tv_sec >= 0);
+        assert(tv.tv_usec >= 0);
         xtp->sec = tv.tv_sec;
         xtp->nsec = tv.tv_usec * 1000;
         return clock_type;
 #elif defined(BOOST_HAS_CLOCK_GETTIME)
         timespec ts;
+#       ifndef NDEBUG
+        int res =
+#       endif            
         clock_gettime(CLOCK_REALTIME, &ts);
+        assert(0 == res);
         xtp->sec = ts.tv_sec;
         xtp->nsec = ts.tv_nsec;
         return clock_type;

Deleted: boost/trunk/libs/thread/test/.cvsignore
===================================================================
--- boost/trunk/libs/thread/test/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/test/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +0,0 @@
-bin
-*.pdb

Deleted: boost/trunk/libs/thread/test/Jamfile
===================================================================
--- boost/trunk/libs/thread/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,83 +0,0 @@
-# Copyright (C) 2001-2003
-# William E. Kempf
-#
-# Permission to use, copy, modify, distribute and sell this software
-# and its documentation for any purpose is hereby granted without fee,
-# provided that the above copyright notice appear in all copies and
-# that both that copyright notice and this permission notice appear
-# in supporting documentation.  William E. Kempf makes no representations
-# about the suitability of this software for any purpose.
-# It is provided "as is" without express or implied warranty.
-#
-# Boost.Threads test Jamfile
-#
-# Additional configuration variables used:
-#   See threads.jam.
-
-# Declare the location of this subproject relative to the root.
-subproject libs/thread/test ;
-
-# Include threads.jam for Boost.Threads global build information.
-# This greatly simplifies the Jam code needed to configure the build
-# for the various Win32 build types.
-import ../build/threads ;
-
-# bring in rules for testing
-import testing ;
-
-{
-     template boost_thread_test_lib
-         : ## sources ##
-             <template>thread_base
-             ../src/tss_null.cpp
-             <lib>../build/boost_thread
-             <lib>../../test/build/boost_unit_test_framework
-             #<lib>../../test/build/boost_test_exec_monitor
-         : ## requirements ##
-             <sysinclude>$(BOOST_ROOT) #:should be unnecessary (because already included in thread_base)
-             <define>BOOST_ALL_NO_LIB=1
-             <define>BOOST_THREAD_USE_LIB=1
-             <define>BOOST_THREAD_TEST=1
-             #<runtime-link>static
-             <threading>multi
-         : ## default build ##
-     ;
-    
-     template boost_thread_test_dll
-         : ## sources ##
-             <template>thread_base
-             ../src/tss_null.cpp
-             <dll>../build/boost_thread
-             <lib>../../test/build/boost_unit_test_framework
-             #<lib>../../test/build/boost_test_exec_monitor
-         : ## requirements ##
-             <sysinclude>$(BOOST_ROOT) #:should be unnecessary (because already included in thread_base)
-             <define>BOOST_ALL_NO_LIB=1
-             <define>BOOST_THREAD_USE_DLL=1
-             <define>BOOST_THREAD_TEST=1
-             <runtime-link>dynamic
-             <threading>multi
-         : ## default build ##
-     ;
-
-     test-suite "threads"
-         : 
-           [ run test_thread.cpp <template>boost_thread_test_dll ]
-           [ run test_mutex.cpp <template>boost_thread_test_dll ]
-           [ run test_condition.cpp <template>boost_thread_test_dll ]
-           [ run test_tss.cpp <template>boost_thread_test_dll ]
-           [ run test_once.cpp <template>boost_thread_test_dll ]
-           [ run test_xtime.cpp <template>boost_thread_test_dll ]
-           [ run test_barrier.cpp <template>boost_thread_test_dll ]
-           [ run test_read_write_mutex.cpp <template>boost_thread_test_dll ]
-           
-           [ run test_thread.cpp <template>boost_thread_test_lib           : : : : test_thread_lib ]
-           [ run test_mutex.cpp <template>boost_thread_test_lib            : : : : test_mutex_lib  ]
-           [ run test_condition.cpp <template>boost_thread_test_lib        : : : : test_condition_lib  ]
-           [ run test_tss.cpp <template>boost_thread_test_lib              : : : : test_tss_lib  ]
-           [ run test_once.cpp <template>boost_thread_test_lib             : : : : test_once_lib  ]
-           [ run test_xtime.cpp <template>boost_thread_test_lib            : : : : test_xtime_lib  ]
-           [ run test_barrier.cpp <template>boost_thread_test_lib          : : : : test_barrier_lib  ]
-           [ run test_read_write_mutex.cpp <template>boost_thread_test_lib : : : : test_read_write_mutex_lib  ]
-     ;
-}

Modified: boost/trunk/libs/thread/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/thread/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,6 @@
-#  (C) Copyright William E. Kempf 2001. Permission to copy, use, modify, sell
-#  and distribute this software is granted provided this copyright notice
-#  appears in all copies. This software is provided "as is" without express or
-#  implied warranty, and with no claim as to its suitability for any purpose.
+#  (C) Copyright William E. Kempf 2001. 
+#  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+#  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 #
 # Boost.Threads test Jamfile
 #
@@ -19,7 +18,7 @@
 import testing ;
 
 project
-    : requirements <library>../../test/build//boost_unit_test_framework
+    : requirements <library>/boost/test//boost_unit_test_framework/<link>static
                    <threading>multi
     ;
     
@@ -27,7 +26,7 @@
 {
     return 
 	[ run $(sources) ../build//boost_thread ]
-	[ run $(sources) ../build//boost_thread/<link>static 
+	[ run $(sources) ../src/tss_null.cpp ../build//boost_thread/<link>static 
 	    : : : : $(sources[1]:B)_lib ]
 	;
 }    
@@ -41,6 +40,6 @@
           [ thread-run test_once.cpp ]
           [ thread-run test_xtime.cpp ]
           [ thread-run test_barrier.cpp ]		   
-          [ thread-run test_read_write_mutex.cpp ]
+#          [ thread-run test_read_write_mutex.cpp ]
     ;
 }

Modified: boost/trunk/libs/thread/test/test_barrier.cpp
===================================================================
--- boost/trunk/libs/thread/test/test_barrier.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/test/test_barrier.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 

Modified: boost/trunk/libs/thread/test/test_condition.cpp
===================================================================
--- boost/trunk/libs/thread/test/test_condition.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/test/test_condition.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 

Modified: boost/trunk/libs/thread/test/test_mutex.cpp
===================================================================
--- boost/trunk/libs/thread/test/test_mutex.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/test/test_mutex.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 

Modified: boost/trunk/libs/thread/test/test_once.cpp
===================================================================
--- boost/trunk/libs/thread/test/test_once.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/test/test_once.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 

Modified: boost/trunk/libs/thread/test/test_read_write_mutex.cpp
===================================================================
--- boost/trunk/libs/thread/test/test_read_write_mutex.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/test/test_read_write_mutex.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 

Modified: boost/trunk/libs/thread/test/test_thread.cpp
===================================================================
--- boost/trunk/libs/thread/test/test_thread.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/test/test_thread.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 

Modified: boost/trunk/libs/thread/test/test_tss.cpp
===================================================================
--- boost/trunk/libs/thread/test/test_tss.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/test/test_tss.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 
@@ -149,7 +144,11 @@
             << "\n";
         std::cout.flush();
 
-        BOOST_CHECK_EQUAL(tss_instances, 0);
+        // The following is not really an error. TSS cleanup support still is available for boost threads.
+        // Also this usually will be triggered only when bound to the static version of thread lib.
+        // 2006-10-02 Roland Schwarz
+        //BOOST_CHECK_EQUAL(tss_instances, 0);
+        BOOST_CHECK_MESSAGE(tss_instances == 0, "Support of automatic tss cleanup for native threading API not available");
         BOOST_CHECK_EQUAL(tss_total, 5);
     #endif
 }

Modified: boost/trunk/libs/thread/test/test_xtime.cpp
===================================================================
--- boost/trunk/libs/thread/test/test_xtime.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/test/test_xtime.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/detail/config.hpp>
 

Modified: boost/trunk/libs/thread/test/util.inl
===================================================================
--- boost/trunk/libs/thread/test/util.inl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/test/util.inl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #if !defined(UTIL_INL_WEK01242003)
 #define UTIL_INL_WEK01242003
@@ -21,6 +16,8 @@
 #   define DEFAULT_EXECUTION_MONITOR_TYPE execution_monitor::use_condition
 #endif
 
+// boostinspect:nounnamed
+
 namespace
 {
 inline boost::xtime delay(int secs, int msecs=0, int nsecs=0)

Deleted: boost/trunk/libs/thread/tutorial/Jamfile
===================================================================
--- boost/trunk/libs/thread/tutorial/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/tutorial/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,54 +0,0 @@
-# Copyright (C) 2001-2003
-# William E. Kempf
-#
-# Permission to use, copy, modify, distribute and sell this software
-# and its documentation for any purpose is hereby granted without fee,
-# provided that the above copyright notice appear in all copies and
-# that both that copyright notice and this permission notice appear
-# in supporting documentation.  William E. Kempf makes no representations
-# about the suitability of this software for any purpose.
-# It is provided "as is" without express or implied warranty.
-#
-# Boost.Threads tutorial Jamfile
-#
-# Additional configuration variables used:
-#   1. PTW32 may be used on Win32 platforms to specify that the pthreads-win32
-#      library should be used instead of "native" threads. This feature is
-#      mostly used for testing and it's generally recommended you use the
-#      native threading libraries instead. PTW32 should be set to be a list
-#      of two strings, the first specifying the installation path of the
-#      pthreads-win32 library and the second specifying which library
-#      variant to link against (see the pthreads-win32 documentation).
-#      Example: jam -sPTW32="c:\pthreads-win32 pthreadVCE.lib"
-
-# Declare the location of this subproject relative to the root.
-
-subproject libs/thread/tutorial ;
-
-# Include threads.jam for Boost.Threads global build information.
-# This greatly simplifies the Jam code needed to configure the build
-# for the various Win32 build types.
-import ../build/threads ;
-
-{
-    template tutorial
-        ## sources ##
-        : <template>thread_base
-          <dll>../build/boost_thread
-        ## requirements ##
-        :
-        ## default build ##
-        :
-    ;
-
-    exe helloworld : <template>tutorial helloworld.cpp ;
-    exe helloworld2 : <template>tutorial helloworld2.cpp ;
-    exe helloworld3 : <template>tutorial helloworld3.cpp ;
-    exe helloworld4 : <template>tutorial helloworld4.cpp ;
-    exe factorial : <template>tutorial factorial.cpp ;
-    exe factorial2 : <template>tutorial factorial2.cpp ;
-    exe factorial3 : <template>tutorial factorial3.cpp ;
-    exe counter : <template>tutorial counter.cpp ;
-    exe bounded_buffer : <template>tutorial bounded_buffer.cpp ;
-    exe once : <template>tutorial once.cpp ;
-}

Modified: boost/trunk/libs/thread/tutorial/bounded_buffer.cpp
===================================================================
--- boost/trunk/libs/thread/tutorial/bounded_buffer.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/tutorial/bounded_buffer.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/condition.hpp>
 #include <boost/thread/mutex.hpp>

Modified: boost/trunk/libs/thread/tutorial/counter.cpp
===================================================================
--- boost/trunk/libs/thread/tutorial/counter.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/tutorial/counter.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/mutex.hpp>
 #include <boost/thread/thread.hpp>

Modified: boost/trunk/libs/thread/tutorial/factorial.cpp
===================================================================
--- boost/trunk/libs/thread/tutorial/factorial.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/tutorial/factorial.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/thread.hpp>
 #include <iostream>

Modified: boost/trunk/libs/thread/tutorial/factorial2.cpp
===================================================================
--- boost/trunk/libs/thread/tutorial/factorial2.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/tutorial/factorial2.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/thread.hpp>
 #include <boost/ref.hpp>

Modified: boost/trunk/libs/thread/tutorial/factorial3.cpp
===================================================================
--- boost/trunk/libs/thread/tutorial/factorial3.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/tutorial/factorial3.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/thread.hpp>
 #include <iostream>

Modified: boost/trunk/libs/thread/tutorial/helloworld.cpp
===================================================================
--- boost/trunk/libs/thread/tutorial/helloworld.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/tutorial/helloworld.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/thread.hpp>
 #include <iostream>

Modified: boost/trunk/libs/thread/tutorial/helloworld2.cpp
===================================================================
--- boost/trunk/libs/thread/tutorial/helloworld2.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/tutorial/helloworld2.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/thread.hpp>
 #include <iostream>

Modified: boost/trunk/libs/thread/tutorial/helloworld3.cpp
===================================================================
--- boost/trunk/libs/thread/tutorial/helloworld3.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/tutorial/helloworld3.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/thread.hpp>
 #include <boost/bind.hpp>

Modified: boost/trunk/libs/thread/tutorial/helloworld4.cpp
===================================================================
--- boost/trunk/libs/thread/tutorial/helloworld4.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/tutorial/helloworld4.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/thread.hpp>
 #include <boost/bind.hpp>

Modified: boost/trunk/libs/thread/tutorial/once.cpp
===================================================================
--- boost/trunk/libs/thread/tutorial/once.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/tutorial/once.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/thread.hpp>
 #include <boost/thread/once.hpp>

Modified: boost/trunk/libs/thread/tutorial/tss.cpp
===================================================================
--- boost/trunk/libs/thread/tutorial/tss.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/thread/tutorial/tss.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,8 @@
 // Copyright (C) 2001-2003
 // William E. Kempf
 //
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
+//  Distributed under the Boost Software License, Version 1.0. (See accompanying 
+//  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/thread/thread.hpp>
 #include <boost/thread/tss.hpp>

Modified: boost/trunk/libs/timer/index.html
===================================================================
--- boost/trunk/libs/timer/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/timer/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
 
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-<meta name="GENERATOR" content="Microsoft FrontPage 4.0">
+<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
 <meta name="ProgId" content="FrontPage.Editor.Document">
 <title>Boost Timer Library</title>
 </head>
@@ -33,9 +33,16 @@
   <li>Submitted by <a href="../../people/beman_dawes.html">Beman Dawes</a>.</li>
 </ul>
 
-<p><!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->12 January, 2001<!--webbot bot="Timestamp" endspan i-checksum="38313" -->
+<p>&nbsp;</p>
+<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
+
+<p><!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->07 November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39368" -->
 </p>
 
 </body>
 
-</html>
+</html>
\ No newline at end of file

Modified: boost/trunk/libs/tokenizer/char_delimiters_separator.htm
===================================================================
--- boost/trunk/libs/tokenizer/char_delimiters_separator.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tokenizer/char_delimiters_separator.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,50 +1,35 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
 
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
-<title>Boost Char Delimiters Separator</title>
-<!--
-  -- Copyright © John Bandela 2001
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
+  <title>Boost Char Delimiters Separator</title>
 </head>
 
-<body bgcolor="#FFFFFF" text="#000000" link="#0000EE"
-vlink="#551A8B" alink="#FF0000">
+<body bgcolor="#FFFFFF" text="#000000" link="#0000EE" vlink="#551A8B" alink=
+"#FF0000">
+  <p><img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br></p><font color="red">Note: This class is deprecated. Please use
+  <a href="char_separator.htm"><tt>char_separator</tt></a> instead.</font>
 
-<p><img src="../../boost.png" alt="C++ Boost" width="277"
-height="86"> <br>
-</p>
-
-<font color="red">
-Note: This class is deprecated. Please use <a
-href="char_separator.htm"><tt>char_separator</tt></a> instead.
-</font>
-
-<h1 align="center">Char Delimiters Separator</h1>
-
-<pre>template &lt;class Char, class Traits = std::char_traits&lt;Char&gt; &gt;
+  <h1 align="center">Char Delimiters Separator</h1>
+  <pre>
+template &lt;class Char, class Traits = std::char_traits&lt;Char&gt; &gt;
 class char_delimiters_separator{
 </pre>
 
-<p>The char_delimiters_separator class is an implementation of
-the <a href="tokenizerfunction.htm">TokenizerFunction</a> concept
-that can be used to break text up into tokens. It is the default
-TokenizerFunction for tokenizer and token_iterator_generator. An
-example is below.</p>
+  <p>The char_delimiters_separator class is an implementation of the <a href=
+  "tokenizerfunction.htm">TokenizerFunction</a> concept that can be used to
+  break text up into tokens. It is the default TokenizerFunction for
+  tokenizer and token_iterator_generator. An example is below.</p>
 
-<h2>Example</h2>
-
-<pre>// simple_example_4.cpp
+  <h2>Example</h2>
+  <pre>
+// simple_example_4.cpp
 #include&lt;iostream&gt;
 #include&lt;boost/tokenizer.hpp&gt;
 #include&lt;string&gt;
@@ -52,102 +37,120 @@
 int main(){
    using namespace std;
    using namespace boost;
-   string s = &quot;This is,  a test&quot;;
+   string s = "This is,  a test";
    tokenizer&lt;char_delimiters_separator&lt;char&gt; &gt; tok(s);
    for(tokenizer&lt;char_delimiters_separator&lt;char&gt; &gt;::iterator beg=tok.begin(); beg!=tok.end();++beg){
-       cout &lt;&lt; *beg &lt;&lt; &quot;\n&quot;;
+       cout &lt;&lt; *beg &lt;&lt; "\n";
    }
 }
 </pre>
 
-<h2>Construction and Usage</h2>
+  <h2>Construction and Usage</h2>
 
-<p>There is one constructor of interest. It is as follows</p>
-
-<pre>explicit char_delimiters_separator(bool return_delims = false, 
-const Char* returnable = &quot;&quot;,const Char* nonreturnable = &quot;&quot; )
+  <p>There is one constructor of interest. It is as follows</p>
+  <pre>
+explicit char_delimiters_separator(bool return_delims = false, 
+const Char* returnable = "",const Char* nonreturnable = "" )
 </pre>
 
-<table border="1">
+  <table border="1" summary="">
     <tr>
-        <td><p align="center"><strong>Parameter</strong></p>
-        </td>
-        <td><p align="center"><strong>Description</strong></p>
-        </td>
+      <td>
+        <p align="center"><strong>Parameter</strong></p>
+      </td>
+
+      <td>
+        <p align="center"><strong>Description</strong></p>
+      </td>
     </tr>
+
     <tr>
-        <td>return_delims</td>
-        <td>Whether or not to return the delimiters that have
-        been found. Note that not all delimiters can be returned.
-        See the other two parameters for explanation.</td>
+      <td>return_delims</td>
+
+      <td>Whether or not to return the delimiters that have been found. Note
+      that not all delimiters can be returned. See the other two parameters
+      for explanation.</td>
     </tr>
+
     <tr>
-        <td>returnable</td>
-        <td>This specifies the returnable delimiters. These are
-        the delimiters that can be returned as tokens when
-        return_delims is true. Since these are typically
-        punctuation, if a 0 is provided as the argument, then the
-        returnable delmiters will be all characters Cfor which
-        std::ispunct(C) yields a true value. If an argument of
-        &quot;&quot; is provided, then this is taken to mean that
-        there are noreturnable delimiters.</td>
+      <td>returnable</td>
+
+      <td>This specifies the returnable delimiters. These are the delimiters
+      that can be returned as tokens when return_delims is true. Since these
+      are typically punctuation, if a 0 is provided as the argument, then the
+      returnable delmiters will be all characters Cfor which std::ispunct(C)
+      yields a true value. If an argument of "" is provided, then this is
+      taken to mean that there are noreturnable delimiters.</td>
     </tr>
+
     <tr>
-        <td>nonreturnable</td>
-        <td>This specifies the nonreturnable delimiters. These
-        are delimiters that cannot be returned as tokens. Since
-        these are typically whitespace, if 0 is specified as an
-        argument, then the nonreturnable delimiters will be all
-        characters C for which std::isspace(C) yields a true
-        value. If an argument of &quot;&quot; is provided, then
-        this is taken to mean that there are no non-returnable
-        delimiters.</td>
+      <td>nonreturnable</td>
+
+      <td>This specifies the nonreturnable delimiters. These are delimiters
+      that cannot be returned as tokens. Since these are typically
+      whitespace, if 0 is specified as an argument, then the nonreturnable
+      delimiters will be all characters C for which std::isspace(C) yields a
+      true value. If an argument of "" is provided, then this is taken to
+      mean that there are no non-returnable delimiters.</td>
     </tr>
-</table>
+  </table>
 
-<p>The reason there is a distinction between nonreturnable and
-returnable delimiters is that some delimiters are just used to
-split up tokens and are nothing more. Take for example the
-following string &quot;b c +&quot;. Assume you are writing a
-simple calculator to parse expression in post fix notation. While
-both the space and the + separate tokens, you only only
-interested in the + and not in the space. Indeed having the space
-returned as a token would only complicate your code. In this case
-you would specify + as a returnable, and space as a nonreturnable
-delimiter.</p>
+  <p>The reason there is a distinction between nonreturnable and returnable
+  delimiters is that some delimiters are just used to split up tokens and are
+  nothing more. Take for example the following string "b c +". Assume you are
+  writing a simple calculator to parse expression in post fix notation. While
+  both the space and the + separate tokens, you only only interested in the +
+  and not in the space. Indeed having the space returned as a token would
+  only complicate your code. In this case you would specify + as a
+  returnable, and space as a nonreturnable delimiter.</p>
 
-<p>To use this class, pass an object of it anywhere a
-TokenizerFunction object is required.</p>
+  <p>To use this class, pass an object of it anywhere a TokenizerFunction
+  object is required.</p>
 
-<h3>Template Parameters</h3>
+  <h3>Template Parameters</h3>
 
-<table border="1">
+  <table border="1" summary="">
     <tr>
-        <th>Parameter</th>
-        <th>Description</th>
+      <th>Parameter</th>
+
+      <th>Description</th>
     </tr>
+
     <tr>
-        <td><tt>Char</tt></td>
-        <td>The type of the elements within a token, typically <tt>char</tt>.</td>
+      <td><tt>Char</tt></td>
+
+      <td>The type of the elements within a token, typically
+      <tt>char</tt>.</td>
     </tr>
+
     <tr>
-        <td>Traits</td>
-        <td>The traits class for Char, typically std::char_traits&lt;Char&gt;</td>
+      <td>Traits</td>
+
+      <td>The traits class for Char, typically
+      std::char_traits&lt;Char&gt;</td>
     </tr>
-</table>
+  </table>
 
-<h2>Model of</h2>
+  <h2>Model of</h2>
 
-<p><a href="tokenizerfunction.htm">TokenizerFunction</a> </p>
+  <p><a href="tokenizerfunction.htm">TokenizerFunction</a></p>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
+  <hr>
 
-<hr>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<p>© Copyright John R. Bandela 2001. Permission to copy, use,
-modify, sell and distribute this document is granted provided
-this copyright notice appears in all copies. This document is
-provided &quot;as is&quot; without express or implied warranty,
-and with no claim as to its suitability for any purpose.</p>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->25
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38518" --></p>
+
+  <p><i>Copyright &copy; 2001 John R. Bandela</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/tokenizer/char_separator.htm
===================================================================
--- boost/trunk/libs/tokenizer/char_separator.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tokenizer/char_separator.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,150 +1,124 @@
-<html>
+<!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="GENERATOR" content="Microsoft FrontPage Express 2.0">
-<title>Boost Char Separator</title>
-<!--
-  -- Copyright © Jeremy Siek and John Bandela 2001-2002
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Boost Char Separator</title>
 </head>
 
-<body bgcolor="#FFFFFF" text="#000000" link="#0000EE"
-vlink="#551A8B" alink="#FF0000">
+<body bgcolor="#FFFFFF" text="#000000" link="#0000EE" vlink="#551A8B" alink=
+"#FF0000">
+  <p><img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br></p>
 
-<p><img src="../../boost.png" alt="C++ Boost" width="277"
-height="86"> <br>
-</p>
+  <h1>char_separator&lt;Char, Traits&gt;</h1>
 
-<h1>
-char_separator&lt;Char, Traits&gt;
-</h1>
+  <p>The <tt>char_separator</tt> class breaks a sequence of characters into
+  tokens based on character delimiters much in the same way that
+  <tt>strtok()</tt> does (but without all the evils of non-reentrancy and
+  destruction of the input sequence).</p>
 
-<p>
-The <tt>char_separator</tt> class breaks a sequence of characters into
-tokens based on character delimiters much in the same way that
-<tt>strtok()</tt> does (but without all the evils of non-reentrancy
-and destruction of the input sequence).
-</p>
+  <p>The <tt>char_separator</tt> class is used in conjunction with the
+  <a href="token_iterator.htm"><tt>token_iterator</tt></a> or <a href=
+  "tokenizer.htm"><tt>tokenizer</tt></a> to perform tokenizing.</p>
 
-<p>
-The <tt>char_separator</tt> class is used in conjunction with the <a
-href="token_iterator.htm"><tt>token_iterator</tt></a> or <a
-href="tokenizer.htm"><tt>tokenizer</tt></a> to perform tokenizing.
-</p>
+  <h2>Definitions</h2>
 
-<h2>Definitions</h2>
+  <p>The <tt>strtok()</tt> function does not include matches with the
+  character delimiters in the output sequence of tokens. However, sometimes
+  it is useful to have the delimiters show up in the output sequence,
+  therefore <tt>char_separator</tt> provides this as an option. We refer to
+  delimiters that show up as output tokens as <b><i>kept delimiters</i></b>
+  and delimiters that do now show up as output tokens as <b><i>dropped
+  delimiters</i></b>.</p>
 
-<p>
-The <tt>strtok()</tt> function does not include matches with the
-character delimiters in the output sequence of tokens. However,
-sometimes it is useful to have the delimiters show up in the output
-sequence, therefore <tt>char_separator</tt> provides this as an
-option.  We refer to delimiters that show up as output tokens as
-<b><i>kept delimiters</i></b> and delimiters that do now show up as
-output tokens as <b><i>dropped delimiters</i></b>.
-</p>
+  <p>When two delimiters appear next to each other in the input sequence,
+  there is the question of whether to output an <b><i>empty token</i></b> or
+  to skip ahead. The behaviour of <tt>strtok()</tt> is to skip ahead. The
+  <tt>char_separator</tt> class provides both options.</p>
 
-<p>
-When two delimiters appear next to each other in the input sequence,
-there is the question of whether to output an <b><i>empty
-token</i></b> or to skip ahead. The behaviour of <tt>strtok()</tt> is
-to skip ahead. The <tt>char_separator</tt> class provides both
-options.
-</p>
+  <h2>Examples</h2>
 
+  <p>This first examples shows how to use <tt>char_separator</tt> as a
+  replacement for the <tt>strtok()</tt> function. We've specified three
+  character delimiters, and they will not show up as output tokens. We have
+  not specified any kept delimiters, and by default any empty tokens will be
+  ignored.</p>
 
-<h2>Examples</h2>
-
-<p>
-This first examples shows how to use <tt>char_separator</tt> as a
-replacement for the <tt>strtok()</tt> function. We've specified three
-character delimiters, and they will not show up as output tokens.  We
-have not specified any kept delimiters, and by default any empty
-tokens will be ignored.
-</p>
-
-<blockquote>
-<pre>// char_sep_example_1.cpp
+  <blockquote>
+    <pre>
+// char_sep_example_1.cpp
 #include &lt;iostream&gt;
 #include &lt;boost/tokenizer.hpp&gt;
 #include &lt;string&gt;
 
 int main()
 {
-  std::string str = &quot;;;Hello|world||-foo--bar;yow;baz|&quot;;
+  std::string str = ";;Hello|world||-foo--bar;yow;baz|";
   typedef boost::tokenizer&lt;boost::char_separator&lt;char&gt; &gt; 
     tokenizer;
-  boost::char_separator&lt;char&gt; sep(&quot;-;|&quot;);
+  boost::char_separator&lt;char&gt; sep("-;|");
   tokenizer tokens(str, sep);
   for (tokenizer::iterator tok_iter = tokens.begin();
        tok_iter != tokens.end(); ++tok_iter)
-    std::cout &lt;&lt; &quot;&lt;&quot; &lt;&lt; *tok_iter &lt;&lt; &quot;&gt; &quot;;
-  std::cout &lt;&lt; &quot;\n&quot;;
+    std::cout &lt;&lt; "&lt;" &lt;&lt; *tok_iter &lt;&lt; "&gt; ";
+  std::cout &lt;&lt; "\n";
   return EXIT_SUCCESS;
 }
 </pre>
-</blockquote>
-The output is:
-<blockquote>
-<pre>
+  </blockquote>The output is:
+
+  <blockquote>
+    <pre>
 &lt;Hello&gt; &lt;world&gt; &lt;foo&gt; &lt;bar&gt; &lt;yow&gt; &lt;baz&gt; 
 </pre>
-</blockquote>
+  </blockquote>
 
+  <p>The next example shows tokenizing with two dropped delimiters '-' and
+  ';' and a single kept delimiter '|'. We also specify that empty tokens
+  should show up in the output when two delimiters are next to each
+  other.</p>
 
-<p>
-The next example shows tokenizing with two dropped delimiters '-' and
-';' and a single kept delimiter '|'. We also specify that empty tokens
-should show up in the output when two delimiters are next to each
-other.
-</p>
-
-<blockquote>
-<pre>// char_sep_example_2.cpp
+  <blockquote>
+    <pre>
+// char_sep_example_2.cpp
 #include &lt;iostream&gt;
 #include &lt;boost/tokenizer.hpp&gt;
 #include &lt;string&gt;
 
 int main()
 {
-    std::string str = &quot;;;Hello|world||-foo--bar;yow;baz|&quot;;
+    std::string str = ";;Hello|world||-foo--bar;yow;baz|";
     typedef boost::tokenizer&lt;boost::char_separator&lt;char&gt; &gt; 
         tokenizer;
-    boost::char_separator&lt;char&gt; sep(&quot;-;&quot;, &quot;|&quot;, boost::keep_empty_tokens);
+    boost::char_separator&lt;char&gt; sep("-;", "|", boost::keep_empty_tokens);
     tokenizer tokens(str, sep);
     for (tokenizer::iterator tok_iter = tokens.begin();
          tok_iter != tokens.end(); ++tok_iter)
-      std::cout &lt;&lt; &quot;&lt;&quot; &lt;&lt; *tok_iter &lt;&lt; &quot;&gt; &quot;;
-    std::cout &lt;&lt; &quot;\n&quot;;
+      std::cout &lt;&lt; "&lt;" &lt;&lt; *tok_iter &lt;&lt; "&gt; ";
+    std::cout &lt;&lt; "\n";
     return EXIT_SUCCESS;
 }
 </pre>
-</blockquote>
-The output is:
-<blockquote>
-<pre>
+  </blockquote>The output is:
+
+  <blockquote>
+    <pre>
 &lt;&gt; &lt;&gt; &lt;Hello&gt; &lt;|&gt; &lt;world&gt; &lt;|&gt; &lt;&gt; &lt;|&gt; &lt;&gt; &lt;foo&gt; &lt;&gt; &lt;bar&gt; &lt;yow&gt; &lt;baz&gt; &lt;|&gt; &lt;&gt;
 </pre>
-</blockquote>
+  </blockquote>
 
-<p>
-The final example shows tokenizing on punctuation and whitespace
-characters using the default constructor of the
-<tt>char_separator</tt>.
-</p>
+  <p>The final example shows tokenizing on punctuation and whitespace
+  characters using the default constructor of the
+  <tt>char_separator</tt>.</p>
 
-<blockquote>
-<pre>// char_sep_example_3.cpp
+  <blockquote>
+    <pre>
+// char_sep_example_3.cpp
 #include &lt;iostream&gt;
 #include &lt;boost/tokenizer.hpp&gt;
 #include &lt;string&gt;
@@ -161,96 +135,96 @@
    return EXIT_SUCCESS;
 }
 </pre>
-</blockquote>
-The output is:
-<blockquote>
-<pre>
+  </blockquote>The output is:
+
+  <blockquote>
+    <pre>
 &lt;This&gt; &lt;is&gt; &lt;,&gt; &lt;a&gt; &lt;test&gt; 
 </pre>
-</blockquote>
+  </blockquote>
 
-<h2>Template parameters</h2>
+  <h2>Template parameters</h2>
 
-<P>
-<table border>
-<TR>
-<th>Parameter</th><th>Description</th><th>Default</th>
-</tr>
+  <table border summary="">
+    <tr>
+      <th>Parameter</th>
 
-<TR><TD><TT>Char</TT></TD>
-<TD>The type of elements within a token, typically <tt>char</tt>.</TD>
-<TD>&nbsp;</TD>
-</TR>
+      <th>Description</th>
 
-<TR><TD><TT>Traits</TT></TD>
-<TD>The <tt>char_traits</tt> for the character type.</TD>
-<TD><tt>char_traits&lt;char&gt;</tt></TD>
-</TR>
+      <th>Default</th>
+    </tr>
 
-</table>
+    <tr>
+      <td><tt>Char</tt></td>
 
-<h2>Model of</h2>
+      <td>The type of elements within a token, typically <tt>char</tt>.</td>
 
-<a href="tokenizerfunction.htm">Tokenizer Function</a>
+      <td>&nbsp;</td>
+    </tr>
 
+    <tr>
+      <td><tt>Traits</tt></td>
 
-<h2>Members</h2>
+      <td>The <tt>char_traits</tt> for the character type.</td>
 
-<hr>
-<pre>
+      <td><tt>char_traits&lt;char&gt;</tt></td>
+    </tr>
+  </table>
+
+  <h2>Model of</h2><a href="tokenizerfunction.htm">Tokenizer Function</a>
+
+  <h2>Members</h2>
+  <hr>
+  <pre>
 explicit char_separator(const Char* dropped_delims,
-                        const Char* kept_delims = &quot;&quot;,
+                        const Char* kept_delims = "",
                         empty_token_policy empty_tokens = drop_empty_tokens)
 </pre>
 
-<p>
-This creates a <tt>char_separator</tt> object, which can then be used
-to create a <a href="token_iterator.htm"><tt>token_iterator</tt></a>
-or <a href="tokenizer.htm"><tt>tokenizer</tt></a> to perform
-tokenizing. The <tt>dropped_delims</tt> and <tt>kept_delims</tt> are
-strings of characters where each character is used as delimiter during
-tokenizing. Whenever a delimiter is seen in the input sequence, the
-current token is finished, and a new token begins.
-
-The delimiters in <tt>dropped_delims</tt> do not show up as tokens in
-the output whereas the delimiters in <tt>kept_delims</tt> do show up
-as tokens.  If <tt>empty_tokens</tt> is <tt>drop_empty_tokens</tt>,
-then empty tokens will not show up in the output. If
-<tt>empty_tokens</tt> is <tt>keep_empty_tokens</tt> then empty tokens
-will show up in the output.
-</p>
-
-<hr>
-
-<pre>
+  <p>This creates a <tt>char_separator</tt> object, which can then be used to
+  create a <a href="token_iterator.htm"><tt>token_iterator</tt></a> or
+  <a href="tokenizer.htm"><tt>tokenizer</tt></a> to perform tokenizing. The
+  <tt>dropped_delims</tt> and <tt>kept_delims</tt> are strings of characters
+  where each character is used as delimiter during tokenizing. Whenever a
+  delimiter is seen in the input sequence, the current token is finished, and
+  a new token begins. The delimiters in <tt>dropped_delims</tt> do not show
+  up as tokens in the output whereas the delimiters in <tt>kept_delims</tt>
+  do show up as tokens. If <tt>empty_tokens</tt> is
+  <tt>drop_empty_tokens</tt>, then empty tokens will not show up in the
+  output. If <tt>empty_tokens</tt> is <tt>keep_empty_tokens</tt> then empty
+  tokens will show up in the output.</p>
+  <hr>
+  <pre>
 explicit char_separator()
 </pre>
-<p>
-The function <tt>std::isspace()</tt> is used to identify dropped
-delimiters and <tt>std::ispunct()</tt> is used to identify kept
-delimiters. In addition, empty tokens are dropped.
-</p>
 
-<hr>
-
-<pre>
+  <p>The function <tt>std::isspace()</tt> is used to identify dropped
+  delimiters and <tt>std::ispunct()</tt> is used to identify kept delimiters.
+  In addition, empty tokens are dropped.</p>
+  <hr>
+  <pre>
 template &lt;typename InputIterator, typename Token&gt;
 bool operator()(InputIterator&amp; next, InputIterator end, Token&amp; tok)
 </pre>
 
-<p>
-This function is called by the <a
-href="token_iterator.htm"><tt>token_iterator</tt></a> to perform
-tokenizing. The user typically does not call this function directly.
-</p>
+  <p>This function is called by the <a href=
+  "token_iterator.htm"><tt>token_iterator</tt></a> to perform tokenizing. The
+  user typically does not call this function directly.</p>
+  <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<hr>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->25
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38518" --></p>
 
-<p>© Copyright Jeremy Siek and John R. Bandela 2001-2002. Permission
-to copy, use, modify, sell and distribute this document is granted
-provided this copyright notice appears in all copies. This document is
-provided &quot;as is&quot; without express or implied warranty, and
-with no claim as to its suitability for any purpose.</p>
+  <p><i>Copyright &copy; 2001-2002 Jeremy Siek and John R. Bandela</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/tokenizer/escaped_list_separator.htm
===================================================================
--- boost/trunk/libs/tokenizer/escaped_list_separator.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tokenizer/escaped_list_separator.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,82 +1,80 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
 
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
-<title>Boost Escaped List Separator</title>
-<!--
-  -- Copyright © John Bandela 2001
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
+  <title>Boost Escaped List Separator</title>
 </head>
 
-<body bgcolor="#FFFFFF" text="#000000" link="#0000EE"
-vlink="#551A8B" alink="#FF0000">
+<body bgcolor="#FFFFFF" text="#000000" link="#0000EE" vlink="#551A8B" alink=
+"#FF0000">
+  <h1 align="left"><img src="../../boost.png" alt="C++ Boost" width="277"
+  height="86"></h1>
 
-<h1 align="left"><img src="../../boost.png" alt="C++ Boost"
-width="277" height="86"> </h1>
+  <h1 align="center">Escaped List Separator</h1>
 
-<h1 align="center">Escaped List Separator</h1>
-<div align="left">
-
-<pre>
+  <div align="left">
+    <pre>
 escaped_list_separator&lt;Char, Traits = std::char_traits&lt;Char&gt; &gt;
 </pre>
-</div>
+  </div>
 
-<p>The <tt>escaped_list_separator</tt> class is an implementation
-of the <a href="tokenizerfunction.htm">TokenizerFunction</a>. The
-escaped_list_separator parses a superset of the csv (comma
-separated value) format. The examples of this formate are below.
-It is assumed that the default characters for separator, quote,
-and escape are used.</p>
+  <p>The <tt>escaped_list_separator</tt> class is an implementation of the
+  <a href="tokenizerfunction.htm">TokenizerFunction</a>. The
+  escaped_list_separator parses a superset of the csv (comma separated value)
+  format. The examples of this formate are below. It is assumed that the
+  default characters for separator, quote, and escape are used.</p>
 
-<p>Field 1,Field 2,Field 3<br>
-Field 1,&quot;Field 2, with comma&quot;,Field 3<br>
-Field 1,Field 2 with \&quot;embedded quote\&quot;,Field 3<br>
-Field 1, Field 2 with \n new line,Field 3<br>
-Field 1, Field 2 with embedded \\ ,Field 3</p>
+  <p>Field 1,Field 2,Field 3<br>
+  Field 1,"Field 2, with comma",Field 3<br>
+  Field 1,Field 2 with \"embedded quote\",Field 3<br>
+  Field 1, Field 2 with \n new line,Field 3<br>
+  Field 1, Field 2 with embedded \\ ,Field 3</p>
 
-<p>Fields are normally separated by commas. If you want to put a
-comma in a field, you need to put quotes around it. Also 3 escape
-sequences are supported</p>
+  <p>Fields are normally separated by commas. If you want to put a comma in a
+  field, you need to put quotes around it. Also 3 escape sequences are
+  supported</p>
 
-<table border="1">
+  <table border="1" summary="">
     <tr>
-        <td><p align="center"><strong>Escape Sequence</strong></p>
-        </td>
-        <td><p align="center"><strong>Result</strong></p>
-        </td>
+      <td>
+        <p align="center"><strong>Escape Sequence</strong></p>
+      </td>
+
+      <td>
+        <p align="center"><strong>Result</strong></p>
+      </td>
     </tr>
+
     <tr>
-        <td>&lt;escape&gt;&lt;quote&gt;</td>
-        <td>&lt;quote&gt;</td>
+      <td>&lt;escape&gt;&lt;quote&gt;</td>
+
+      <td>&lt;quote&gt;</td>
     </tr>
+
     <tr>
-        <td>&lt;escape&gt;n</td>
-        <td>newline</td>
+      <td>&lt;escape&gt;n</td>
+
+      <td>newline</td>
     </tr>
+
     <tr>
-        <td>&lt;escape&gt;&lt;escape&gt;</td>
-        <td>&lt;escape&gt;</td>
+      <td>&lt;escape&gt;&lt;escape&gt;</td>
+
+      <td>&lt;escape&gt;</td>
     </tr>
-</table>
+  </table>
 
-<p>Where &lt;quote&gt; is any character specified to be a quote
-and&lt;escape&gt; is any character specified to be an escape
-character.</p>
+  <p>Where &lt;quote&gt; is any character specified to be a quote
+  and&lt;escape&gt; is any character specified to be an escape character.</p>
 
-<h2>Example</h2>
-
-<pre>// simple_example_2.cpp
+  <h2>Example</h2>
+  <pre>
+// simple_example_2.cpp
 #include&lt;iostream&gt;
 #include&lt;boost/tokenizer.hpp&gt;
 #include&lt;string&gt;
@@ -84,118 +82,150 @@
 int main(){
    using namespace std;
    using namespace boost;
-   string s = &quot;Field 1,\&quot;putting quotes around fields, allows commas\&quot;,Field 3&quot;;
+   string s = "Field 1,\"putting quotes around fields, allows commas\",Field 3";
    tokenizer&lt;escaped_list_separator&lt;char&gt; &gt; tok(s);
    for(tokenizer&lt;escaped_list_separator&lt;char&gt; &gt;::iterator beg=tok.begin(); beg!=tok.end();++beg){
-       cout &lt;&lt; *beg &lt;&lt; &quot;\n&quot;;
+       cout &lt;&lt; *beg &lt;&lt; "\n";
    }
-}</pre>
+}
+</pre>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
 
-<h2>Construction and Usage</h2>
+  <h2>Construction and Usage</h2>
 
-<p>escaped_list_separator has 2 constructors. They are as follows</p>
+  <p>escaped_list_separator has 2 constructors. They are as follows</p>
+  <pre>
+explicit escaped_list_separator(Char e = '\\', Char c = ',',Char q = '\"')
+</pre>
 
-<pre>explicit escaped_list_separator(Char e = '\\', Char c = ',',Char q = '\&quot;')</pre>
+  <table border="1" summary="">
+    <tr>
+      <td>
+        <p align="center"><strong>Parameter</strong></p>
+      </td>
 
-<table border="1">
-    <tr>
-        <td><p align="center"><strong>Parameter</strong></p>
-        </td>
-        <td><p align="center"><strong>Description</strong></p>
-        </td>
+      <td>
+        <p align="center"><strong>Description</strong></p>
+      </td>
     </tr>
+
     <tr>
-        <td>e</td>
-        <td>Specifies the character to use for escape sequences.
-        It defaults to the C style \ (backslash). However you can
-        override by passing in a different character. An example
-        of when you might want to do this is when you have many
-        fields which are Windows style filenames. Instead of
-        escaping out each \ in the path, you can change the
-        escape to something else.</td>
+      <td>e</td>
+
+      <td>Specifies the character to use for escape sequences. It defaults to
+      the C style \ (backslash). However you can override by passing in a
+      different character. An example of when you might want to do this is
+      when you have many fields which are Windows style filenames. Instead of
+      escaping out each \ in the path, you can change the escape to something
+      else.</td>
     </tr>
+
     <tr>
-        <td>c</td>
-        <td>Specifies the character to use to separate the fields</td>
+      <td>c</td>
+
+      <td>Specifies the character to use to separate the fields</td>
     </tr>
+
     <tr>
-        <td>q</td>
-        <td>Specifies the character to use for the quote.</td>
+      <td>q</td>
+
+      <td>Specifies the character to use for the quote.</td>
     </tr>
-</table>
+  </table>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
+  <pre>
+escaped_list_separator(string_type e, string_type c, string_type q):
+</pre>
 
-<pre>escaped_list_separator(string_type e, string_type c, string_type q):</pre>
+  <table border="1" summary="">
+    <tr>
+      <td>
+        <p align="center"><strong>Parameter</strong></p>
+      </td>
 
-<table border="1">
-    <tr>
-        <td><p align="center"><strong>Parameter</strong></p>
-        </td>
-        <td><p align="center"><strong>Description</strong></p>
-        </td>
+      <td>
+        <p align="center"><strong>Description</strong></p>
+      </td>
     </tr>
+
     <tr>
-        <td>e</td>
-        <td>Any character in the string e, is considered to be an
-        escape character. If an empty string is given, then there
-        are no escape characters.</td>
+      <td>e</td>
+
+      <td>Any character in the string e, is considered to be an escape
+      character. If an empty string is given, then there are no escape
+      characters.</td>
     </tr>
+
     <tr>
-        <td>c</td>
-        <td>Any character in the string c, is considered to be a
-        separator. If an empty string is given, then there are no
-        separator characters.</td>
+      <td>c</td>
+
+      <td>Any character in the string c, is considered to be a separator. If
+      an empty string is given, then there are no separator characters.</td>
     </tr>
+
     <tr>
-        <td>q</td>
-        <td>Any character in the string q, is considered to be a
-        quote. If an empty string is given, then there are no
-        quote characters.</td>
+      <td>q</td>
+
+      <td>Any character in the string q, is considered to be a quote. If an
+      empty string is given, then there are no quote characters.</td>
     </tr>
-</table>
+  </table>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
 
-<p>To use this class, pass an object of it anywhere in the
-Tokenizer package where a TokenizerFunction is required.</p>
+  <p>To use this class, pass an object of it anywhere in the Tokenizer
+  package where a TokenizerFunction is required.</p>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
 
-<h2>Template Parameters</h2>
+  <h2>Template Parameters</h2>
 
-<table border="1">
+  <table border="1" summary="">
     <tr>
-        <th><strong>Parameter</strong></th>
-        <th><strong>Description</strong></th>
+      <th><strong>Parameter</strong></th>
+
+      <th><strong>Description</strong></th>
     </tr>
+
     <tr>
-        <td><tt>Char</tt></td>
-        <td>The type of the elements within a token, typically <tt>char</tt>.</td>
+      <td><tt>Char</tt></td>
+
+      <td>The type of the elements within a token, typically
+      <tt>char</tt>.</td>
     </tr>
+
     <tr>
-        <td>Traits</td>
-        <td>The traits class for the Char type. This is used for
-        comparing Char's. It defaults to std::char_traits&lt;Char&gt;</td>
+      <td>Traits</td>
+
+      <td>The traits class for the Char type. This is used for comparing
+      Char's. It defaults to std::char_traits&lt;Char&gt;</td>
     </tr>
-</table>
+  </table>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
 
-<h2>Model of</h2>
+  <h2>Model of</h2>
 
-<p><a href="tokenizerfunction.htm">TokenizerFunction</a> </p>
+  <p><a href="tokenizerfunction.htm">TokenizerFunction</a></p>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
+  <hr>
 
-<hr>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<p>© Copyright John R. Bandela 2001. Permission to copy, use,
-modify, sell and distribute this document is granted provided
-this copyright notice appears in all copies. This document is
-provided &quot;as is&quot; without express or implied warranty,
-and with no claim as to its suitability for any purpose.</p>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->25
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38518" --></p>
+
+  <p><i>Copyright &copy; 2001 John R. Bandela</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/tokenizer/index.html
===================================================================
--- boost/trunk/libs/tokenizer/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tokenizer/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,89 +1,96 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
 
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-<title>Boost Tokenizer Overview</title>
-<!--
-  -- Copyright (c) Jeremy Siek 2000
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
+  <title>Boost Tokenizer Overview</title>
 </head>
 
-<body bgcolor="#FFFFFF" text="#000000" link="#0000EE"
-vlink="#551A8B" alink="#FF0000">
+<body bgcolor="#FFFFFF" text="#000000" link="#0000EE" vlink="#551A8B" alink=
+"#FF0000">
+  <p><img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br></p>
 
-<p><img src="../../boost.png" alt="C++ Boost" width="277"
-height="86"> <br>
-</p>
+  <h1 align="center">Table Of Contents</h1>
 
-<h1 align="center">Table Of Contents</h1>
+  <p align="left">&nbsp;</p>
 
-<p align="left">&nbsp;</p>
+  <h2 align="left"><a href="introduc.htm">Introduction</a></h2>
 
-<h2 align="left"><a href="introduc.htm">Introduction</a></h2>
+  <h2 align="left">Containers and Iterators</h2>
 
-<h2 align="left">Containers and Iterators</h2>
+  <ul>
+    <li>
+      <h3 align="left"><a href="tokenizer.htm">tokenizer</a></h3>
+    </li>
 
-<ul>
-    <li><h3 align="left"><a href="tokenizer.htm">tokenizer</a></h3>
+    <li>
+      <h3 align="left"><a href="token_iterator.htm">token iterator</a></h3>
     </li>
-    <li><h3 align="left"><a href="token_iterator.htm">token
-        iterator</a></h3>
-    </li>
-</ul>
+  </ul>
 
-<h2><a href="tokenizerfunction.htm">TokenizerFunction Concept</a></h2>
+  <h2><a href="tokenizerfunction.htm">TokenizerFunction Concept</a></h2>
 
-<h2>TokenizerFunction Models</h2>
+  <h2>TokenizerFunction Models</h2>
 
-<ul>
-    <li><h3><a href="char_separator.htm">char_separator</a></h3>
+  <ul>
+    <li>
+      <h3><a href="char_separator.htm">char_separator</a></h3>
     </li>
-    <li><h3><a href="escaped_list_separator.htm">escaped_list_separator</a></h3>
+
+    <li>
+      <h3><a href=
+      "escaped_list_separator.htm">escaped_list_separator</a></h3>
     </li>
-    <li><h3><a href="offset_separator.htm">offset_separator</a></h3>
+
+    <li>
+      <h3><a href="offset_separator.htm">offset_separator</a></h3>
     </li>
-    <li><font color="red">Deprecated:</font> <a href="char_delimiters_separator.htm">char_delimiters_separator</a></a>
-    </li>
-</ul>
 
-<h2>&nbsp;</h2>
-<h2>Acknowledgements</h2>
-<p>I wish to thank the members of the boost mailing list, whose comments,
-compliments, and criticisms during both the development and formal review helped
-make the Tokenizer library what it is. I especially wish to thank Aleksey
-Gurtovoy for the idea of using a pair of iterators to specify the input, instead
-of a string. I also wish to thank Jeremy Siek for his idea of providing a
-container interface for the token iterators and for simplifying the template
-parameters for the TokenizerFunctions. He and Daryle Walker also emphasized the
-need to separate interface and implementation. Gary Powell sparked the idea of
-using the isspace and ispunct as the defaults for char_delimiters_separator.
-Jeff Garland provided ideas on how to change to order of the template parameters
-in order to make tokenizer easier to declare. Thanks to Douglas Gregor who
-served as review manager and provided many insights both on the boost list and
-in e-mail on how to polish up the implementation and presentation of Tokenizer.
-Finally, thanks to Beman Dawes who integrated the final version into the boost
-distribution.</p>
+    <li><font color="red">Deprecated:</font> <a href=
+    "char_delimiters_separator.htm">char_delimiters_separator</a></li>
+  </ul>
 
-<hr>
+  <h2>&nbsp;</h2>
 
-<p>© Copyright John R. Bandela 2001. Permission to copy, use,
-modify, sell and distribute this document is granted provided
-this copyright notice appears in all copies. This document is
-provided &quot;as is&quot; without express or implied warranty,
-and with no claim as to its suitability for any purpose.</p>
+  <h2>Acknowledgements</h2>
 
-<p>&nbsp;</p>
+  <p>I wish to thank the members of the boost mailing list, whose comments,
+  compliments, and criticisms during both the development and formal review
+  helped make the Tokenizer library what it is. I especially wish to thank
+  Aleksey Gurtovoy for the idea of using a pair of iterators to specify the
+  input, instead of a string. I also wish to thank Jeremy Siek for his idea
+  of providing a container interface for the token iterators and for
+  simplifying the template parameters for the TokenizerFunctions. He and
+  Daryle Walker also emphasized the need to separate interface and
+  implementation. Gary Powell sparked the idea of using the isspace and
+  ispunct as the defaults for char_delimiters_separator. Jeff Garland
+  provided ideas on how to change to order of the template parameters in
+  order to make tokenizer easier to declare. Thanks to Douglas Gregor who
+  served as review manager and provided many insights both on the boost list
+  and in e-mail on how to polish up the implementation and presentation of
+  Tokenizer. Finally, thanks to Beman Dawes who integrated the final version
+  into the boost distribution.</p>
+  <hr>
 
-<p>&nbsp;</p>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->25
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38518" --></p>
+
+  <p><i>Copyright &copy; 2000 Jeremy Siek<br>
+  Copyright &copy; 2001 John R. Bandela</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/tokenizer/introduc.htm
===================================================================
--- boost/trunk/libs/tokenizer/introduc.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tokenizer/introduc.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,27 +1,29 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
 
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
-<title>Introduction</title>
+  <title>Introduction</title>
 </head>
 
 <body bgcolor="#FFFFFF">
+  <p><img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br></p>
 
-<p><img src="../../boost.png" alt="C++ Boost" width="277"
-height="86"> <br>
-</p>
+  <h1 align="center">Introduction</h1>
 
-<h1 align="center">Introduction</h1>
+  <p align="left">The boost Tokenizer package provides a flexible and easy to
+  use way to break of a string or other character sequence into a series of
+  tokens. Below is a simple example that will break up a phrase into
+  words.</p>
 
-<p align="left">The boost Tokenizer package provides a flexible
-and easy to use way to break of a string or other character
-sequence into a series of tokens. Below is a simple example that
-will break up a phrase into words.</p>
-<div align="left">
-
-<pre>// simple_example_1.cpp
+  <div align="left">
+    <pre>
+// simple_example_1.cpp
 #include&lt;iostream&gt;
 #include&lt;boost/tokenizer.hpp&gt;
 #include&lt;string&gt;
@@ -29,31 +31,32 @@
 int main(){
    using namespace std;
    using namespace boost;
-   string s = &quot;This is,  a test&quot;;
+   string s = "This is,  a test";
    tokenizer&lt;&gt; tok(s);
    for(tokenizer&lt;&gt;::iterator beg=tok.begin(); beg!=tok.end();++beg){
-       cout &lt;&lt; *beg &lt;&lt; &quot;\n&quot;;
+       cout &lt;&lt; *beg &lt;&lt; "\n";
    }
-}</pre>
-</div>
+}
+</pre>
+  </div>
 
-<p align="left">You can choose how the string gets broken up. You
-do this by specifying the TokenizerFunction. If you do not
-specify anything, the default TokenizerFunction is
-char_delimiters_separator&lt;char&gt; which defaults to breaking
-up a string based on space and punctuation. Here is an example of
-using another TokenizerFunction called escaped_list_separator.
-This TokenizerFunction parses a superset of comma separated value
-(csv) lines. The format looks like this</p>
+  <p align="left">You can choose how the string gets broken up. You do this
+  by specifying the TokenizerFunction. If you do not specify anything, the
+  default TokenizerFunction is char_delimiters_separator&lt;char&gt; which
+  defaults to breaking up a string based on space and punctuation. Here is an
+  example of using another TokenizerFunction called escaped_list_separator.
+  This TokenizerFunction parses a superset of comma separated value (csv)
+  lines. The format looks like this</p>
 
-<p align="left">Field 1,&quot;putting quotes around fields,
-allows commas&quot;,Field 3</p>
+  <p align="left">Field 1,"putting quotes around fields, allows commas",Field
+  3</p>
 
-<p align="left">Below is an example that will break the previous
-line into its 3 fields</p>
-<div align="left">
+  <p align="left">Below is an example that will break the previous line into
+  its 3 fields</p>
 
-<pre>// simple_example_2.cpp
+  <div align="left">
+    <pre>
+// simple_example_2.cpp
 #include&lt;iostream&gt;
 #include&lt;boost/tokenizer.hpp&gt;
 #include&lt;string&gt;
@@ -61,24 +64,26 @@
 int main(){
    using namespace std;
    using namespace boost;
-   string s = &quot;Field 1,\&quot;putting quotes around fields, allows commas\&quot;,Field 3&quot;;
+   string s = "Field 1,\"putting quotes around fields, allows commas\",Field 3";
    tokenizer&lt;escaped_list_separator&lt;char&gt; &gt; tok(s);
    for(tokenizer&lt;escaped_list_separator&lt;char&gt; &gt;::iterator beg=tok.begin(); beg!=tok.end();++beg){
-       cout &lt;&lt; *beg &lt;&lt; &quot;\n&quot;;
+       cout &lt;&lt; *beg &lt;&lt; "\n";
    }
-}</pre>
-</div>
+}
+</pre>
+  </div>
 
-<p align="left">Finally, for some TokenizerFunctions you have to
-pass in something into the constructor in order to do anything
-interesting. An example is offset_separator. This class breaks a
-string into tokens based on offsets for example</p>
+  <p align="left">Finally, for some TokenizerFunctions you have to pass in
+  something into the constructor in order to do anything interesting. An
+  example is offset_separator. This class breaks a string into tokens based
+  on offsets for example</p>
 
-<p align="left">12252001 when parsed using offsets of 2,2,4
-becomes 12 25 2001. Below is an example to parse this.</p>
-<div align="left">
+  <p align="left">12252001 when parsed using offsets of 2,2,4 becomes 12 25
+  2001. Below is an example to parse this.</p>
 
-<pre>// simple_example_3.cpp
+  <div align="left">
+    <pre>
+// simple_example_3.cpp
 #include&lt;iostream&gt;
 #include&lt;boost/tokenizer.hpp&gt;
 #include&lt;string&gt;
@@ -86,26 +91,32 @@
 int main(){
    using namespace std;
    using namespace boost;
-   string s = &quot;12252001&quot;;
+   string s = "12252001";
    int offsets[] = {2,2,4};
    offset_separator f(offsets, offsets+3);
    tokenizer&lt;offset_separator&gt; tok(s,f);
    for(tokenizer&lt;offset_separator&gt;::iterator beg=tok.begin(); beg!=tok.end();++beg){
-       cout &lt;&lt; *beg &lt;&lt; &quot;\n&quot;;
+       cout &lt;&lt; *beg &lt;&lt; "\n";
    }
-}</pre>
-</div>
+}
+</pre>
+  </div>
 
-<p align="left">&nbsp;</p>
+  <p align="left">&nbsp;</p>
+  <hr>
 
-<hr>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<p>© Copyright John R. Bandela 2001. Permission to copy, use,
-modify, sell and distribute this document is granted provided
-this copyright notice appears in all copies. This document is
-provided &quot;as is&quot; without express or implied warranty,
-and with no claim as to its suitability for any purpose.</p>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->25 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38518" --></p>
 
-<p align="left">&nbsp;</p>
+  <p><i>Copyright &copy; 2001 John R. Bandela</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/tokenizer/offset_separator.htm
===================================================================
--- boost/trunk/libs/tokenizer/offset_separator.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tokenizer/offset_separator.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,48 +1,36 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
 
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
-<title>Boost Offset Separator</title>
-<!--
-  -- Copyright © John Bandela 2001
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
+  <title>Boost Offset Separator</title>
 </head>
 
-<body bgcolor="#FFFFFF" text="#000000" link="#0000EE"
-vlink="#551A8B" alink="#FF0000">
+<body bgcolor="#FFFFFF" text="#000000" link="#0000EE" vlink="#551A8B" alink=
+"#FF0000">
+  <p><img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br></p>
 
-<p><img src="../../boost.png" alt="C++ Boost" width="277"
-height="86"> <br>
-</p>
-
-<h1 align="center">Offset Separator</h1>
-
-<pre>
+  <h1 align="center">Offset Separator</h1>
+  <pre>
 class offset_separator
 </pre>
 
-<p>The <tt>offset_separator</tt> class is an implementation of
-the <a href="tokenizerfunction.htm">TokenizerFunction</a> concept
-that can be used with the <a href="tokenizer.htm">tokenizer</a>
-class to break text up into tokens. The <tt>offset_separator</tt>
-breaks a sequence of <tt>Char</tt>'s into strings based on a
-sequence of offsets. For example, if you had the string &quot;12252001&quot;
-and offsets (2,2,4) it would break the string into 12 25 2001.
-Here is an example.</p>
+  <p>The <tt>offset_separator</tt> class is an implementation of the <a href=
+  "tokenizerfunction.htm">TokenizerFunction</a> concept that can be used with
+  the <a href="tokenizer.htm">tokenizer</a> class to break text up into
+  tokens. The <tt>offset_separator</tt> breaks a sequence of <tt>Char</tt>'s
+  into strings based on a sequence of offsets. For example, if you had the
+  string "12252001" and offsets (2,2,4) it would break the string into 12 25
+  2001. Here is an example.</p>
 
-<h2>Example</h2>
-
-<pre>// simple_example_3.cpp
+  <h2>Example</h2>
+  <pre>
+// simple_example_3.cpp
 #include&lt;iostream&gt;
 #include&lt;boost/tokenizer.hpp&gt;
 #include&lt;string&gt;
@@ -50,80 +38,94 @@
 int main(){
    using namespace std;
    using namespace boost;
-   string s = &quot;12252001&quot;;
+   string s = "12252001";
    int offsets[] = {2,2,4};
    offset_separator f(offsets, offsets+3);
    tokenizer&lt;offset_separator&gt; tok(s,f);
    for(tokenizer&lt;offset_separator&gt;::iterator beg=tok.begin(); beg!=tok.end();++beg){
-     cout &lt;&lt; *beg &lt;&lt; &quot;\n&quot;;
+     cout &lt;&lt; *beg &lt;&lt; "\n";
    }
-}</pre>
+}
+</pre>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
 
-<h2>Construction and Usage</h2>
+  <h2>Construction and Usage</h2>
 
-<p>The offset_separator has 1 constructor of interest. (The
-default constructor is just there to make some compilers happy).
-The declaration is below</p>
-
-<pre>template&lt;typename Iter&gt;
+  <p>The offset_separator has 1 constructor of interest. (The default
+  constructor is just there to make some compilers happy). The declaration is
+  below</p>
+  <pre>
+template&lt;typename Iter&gt;
 offset_separator(Iter begin,Iter end,bool bwrapoffsets = true, bool breturnpartiallast = true)
 </pre>
 
-<table border="1">
+  <table border="1" summary="">
     <tr>
-        <td><p align="center"><strong>Parameter</strong></p>
-        </td>
-        <td><p align="center"><strong>Description</strong></p>
-        </td>
+      <td>
+        <p align="center"><strong>Parameter</strong></p>
+      </td>
+
+      <td>
+        <p align="center"><strong>Description</strong></p>
+      </td>
     </tr>
+
     <tr>
-        <td>begin, end</td>
-        <td>Specify the sequence of integer offsets.</td>
+      <td>begin, end</td>
+
+      <td>Specify the sequence of integer offsets.</td>
     </tr>
+
     <tr>
-        <td>bwrapoffsets</td>
-        <td>Tells whether to wrap around to the beginning of the
-        offsets when the all the offsets have been used. For
-        example the string &quot;1225200101012002&quot; with
-        offsets (2,2,4) with bwrapoffsets to true, would parse to
-        12 25 2001 01 01 2002. With bwrapoffsets to false, it
-        would parse to 12 25 2001 and then stop because all the
-        offsets have been used.</td>
+      <td>bwrapoffsets</td>
+
+      <td>Tells whether to wrap around to the beginning of the offsets when
+      the all the offsets have been used. For example the string
+      "1225200101012002" with offsets (2,2,4) with bwrapoffsets to true,
+      would parse to 12 25 2001 01 01 2002. With bwrapoffsets to false, it
+      would parse to 12 25 2001 and then stop because all the offsets have
+      been used.</td>
     </tr>
+
     <tr>
-        <td>breturnpartiallast</td>
-        <td>Tells whether, when the parsed sequence terminates
-        before yielding the number of characters in the current
-        offset, to create a token with what was parsed, or to
-        ignore it. For example the string &quot;122501&quot; with
-        offsets (2,2,4) with breturnpartiallast set to true will
-        parse to 12 25 01. With it set to false, it will parse to
-        12 25 and then will stop because there are only 2
-        characters left in the sequence instead of the 4 that
-        should have been there.</td>
+      <td>breturnpartiallast</td>
+
+      <td>Tells whether, when the parsed sequence terminates before yielding
+      the number of characters in the current offset, to create a token with
+      what was parsed, or to ignore it. For example the string "122501" with
+      offsets (2,2,4) with breturnpartiallast set to true will parse to 12 25
+      01. With it set to false, it will parse to 12 25 and then will stop
+      because there are only 2 characters left in the sequence instead of the
+      4 that should have been there.</td>
     </tr>
-</table>
+  </table>
 
-<p>To use this class, pass an object of it anywhere a
-TokenizerFunction is required. If you default constructruct the
-object, it will just return every character in the parsed
-sequence as a token. (ie it defaults to an offset of 1, and
-bwrapoffsets is true).</p>
+  <p>To use this class, pass an object of it anywhere a TokenizerFunction is
+  required. If you default constructruct the object, it will just return
+  every character in the parsed sequence as a token. (ie it defaults to an
+  offset of 1, and bwrapoffsets is true).</p>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
 
-<h2>Model of</h2>
+  <h2>Model of</h2>
 
-<p><a href="tokenizerfunction.htm">TokenizerFunction</a> </p>
+  <p><a href="tokenizerfunction.htm">TokenizerFunction</a></p>
+  <hr>
 
-<hr>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<p>© Copyright John R. Bandela 2001. Permission to copy, use,
-modify, sell and distribute this document is granted provided
-this copyright notice appears in all copies. This document is
-provided &quot;as is&quot; without express or implied warranty,
-and with no claim as to its suitability for any purpose.</p>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->25
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38518" --></p>
+
+  <p><i>Copyright &copy; 2001 John R. Bandela</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/tokenizer/token_iterator.htm
===================================================================
--- boost/trunk/libs/tokenizer/token_iterator.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tokenizer/token_iterator.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,52 +1,41 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
 
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
-<title>Boost Token Iterator</title>
-<!--
-  -- Copyright © John Bandela 2001
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
+  <title>Boost Token Iterator</title>
 </head>
 
-<body bgcolor="#FFFFFF" text="#000000" link="#0000EE"
-vlink="#551A8B" alink="#FF0000">
+<body bgcolor="#FFFFFF" text="#000000" link="#0000EE" vlink="#551A8B" alink=
+"#FF0000">
+  <p><img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br></p>
 
-<p><img src="../../boost.png" alt="C++ Boost" width="277"
-height="86"> <br>
-</p>
-
-<h1 align="center">Token Iterator</h1>
-
-<pre>
+  <h1 align="center">Token Iterator</h1>
+  <pre>
 template &lt;
-	class TokenizerFunc = char_delimiters_separator&lt;char&gt;, 
-	class Iterator = std::string::const_iterator,
-	class Type = std::string
+        class TokenizerFunc = char_delimiters_separator&lt;char&gt;, 
+        class Iterator = std::string::const_iterator,
+        class Type = std::string
 &gt;
-class token_iterator_generator </pre>
-
-<pre>template&lt;class Type, class Iterator, class TokenizerFunc&gt;
+class token_iterator_generator 
+</pre>
+  <pre>
+template&lt;class Type, class Iterator, class TokenizerFunc&gt;
 typename token_iterator_generator&lt;TokenizerFunc,Iterator,Type&gt;::type 
 make_token_iterator(Iterator begin, Iterator end,const TokenizerFunc&amp; fun)
 
 </pre>
 
-<p>The token iterator serves to provide an iterator view of the
-tokens in a parsed sequence.</p>
+  <p>The token iterator serves to provide an iterator view of the tokens in a
+  parsed sequence.</p>
 
-<h2>Example</h2>
-
-<pre>
+  <h2>Example</h2>
+  <pre>
 /// simple_example_5.cpp
 #include&lt;iostream&gt;
 #include&lt;boost/token_iterator.hpp&gt;
@@ -55,7 +44,7 @@
 int main(){
    using namespace std;
    using namespace boost;
-   string s = &quot;12252001&quot;;
+   string s = "12252001";
    int offsets[] = {2,2,4};
    offset_separator f(offsets, offsets+3);
    typedef token_iterator_generator&lt;offset_separator&gt;::type Iter;
@@ -64,92 +53,119 @@
    // The above statement could also have been what is below
    // Iter end;
    for(;beg!=end;++beg){
-     cout &lt;&lt; *beg &lt;&lt; &quot;\n&quot;;
+     cout &lt;&lt; *beg &lt;&lt; "\n";
    }
 }
 </pre>
 
-<pre>
-</pre>
+  <p>&nbsp;</p>
 
-<p>&nbsp;</p>
+  <h3>Template Parameters</h3>
 
-<h3>Template Parameters</h3>
+  <table border="1" summary="">
+    <tr>
+      <th>Parameter</th>
 
-<table border="1">
-    <tr>
-        <th>Parameter</th>
-        <th>Description</th>
+      <th>Description</th>
     </tr>
+
     <tr>
-        <td><tt>TokenizerFunc</tt></td>
-        <td>The TokenizerFunction used to parse the sequence.</td>
+      <td><tt>TokenizerFunc</tt></td>
+
+      <td>The TokenizerFunction used to parse the sequence.</td>
     </tr>
+
     <tr>
-        <td><tt>Iterator</tt></td>
-        <td>The type of the iterator the specifies the sequence.</td>
+      <td><tt>Iterator</tt></td>
+
+      <td>The type of the iterator the specifies the sequence.</td>
     </tr>
+
     <tr>
-        <td><tt>Type</tt></td>
-        <td>The type of the token, typically string.</td>
+      <td><tt>Type</tt></td>
+
+      <td>The type of the token, typically string.</td>
     </tr>
-</table>
+  </table>
 
-<h2>Model of</h2>
+  <h2>Model of</h2>
 
-<p>The category of Iterator, up to and including Forward Iterator.
-Anything higher will get scaled down to Forward Iterator.</p>
+  <p>The category of Iterator, up to and including Forward Iterator. Anything
+  higher will get scaled down to Forward Iterator.</p>
 
-<h2>Related Types</h2>
+  <h2>Related Types</h2>
 
-<table border="1">
+  <table border="1" summary="">
     <tr>
-        <td><p align="center"><strong>Type</strong></p>
-        </td>
-        <td><p align="center"><strong>Remarks</strong></p>
-        </td>
+      <td>
+        <p align="center"><strong>Type</strong></p>
+      </td>
+
+      <td>
+        <p align="center"><strong>Remarks</strong></p>
+      </td>
     </tr>
+
     <tr>
-        <td>token_iterator_generator::type</td>
-        <td>The type of the token iterator.</td>
+      <td>token_iterator_generator::type</td>
+
+      <td>The type of the token iterator.</td>
     </tr>
-</table>
+  </table>
 
-<h2>Creation</h2>
-
-<pre>template&lt;class Type, class Iterator, class TokenizerFunc&gt;
+  <h2>Creation</h2>
+  <pre>
+template&lt;class Type, class Iterator, class TokenizerFunc&gt;
 typename token_iterator_generator&lt;TokenizerFunc,Iterator,Type&gt;::type 
-make_token_iterator(Iterator begin, Iterator end,const TokenizerFunc&amp; fun)</pre>
+make_token_iterator(Iterator begin, Iterator end,const TokenizerFunc&amp; fun)
+</pre>
 
-<table border="1">
+  <table border="1" summary="">
     <tr>
-        <td><p align="center"><strong>Parameter</strong></p>
-        </td>
-        <td><p align="center"><strong>Description</strong></p>
-        </td>
+      <td>
+        <p align="center"><strong>Parameter</strong></p>
+      </td>
+
+      <td>
+        <p align="center"><strong>Description</strong></p>
+      </td>
     </tr>
+
     <tr>
-        <td>begin</td>
-        <td>The beginning of the sequence to be parsed.</td>
+      <td>begin</td>
+
+      <td>The beginning of the sequence to be parsed.</td>
     </tr>
+
     <tr>
-        <td>end</td>
-        <td>Past the end of the sequence to be parsed.</td>
+      <td>end</td>
+
+      <td>Past the end of the sequence to be parsed.</td>
     </tr>
+
     <tr>
-        <td>fun</td>
-        <td>A functor that is a model of TokenizerFunction</td>
+      <td>fun</td>
+
+      <td>A functor that is a model of TokenizerFunction</td>
     </tr>
-</table>
+  </table>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
+  <hr>
 
-<hr>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<p>© Copyright John R. Bandela 2001. Permission to copy, use,
-modify, sell and distribute this document is granted provided
-this copyright notice appears in all copies. This document is
-provided &quot;as is&quot; without express or implied warranty,
-and with no claim as to its suitability for any purpose.</p>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->25
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38518" --></p>
+
+  <p><i>Copyright &copy; 2001 John R. Bandela</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/tokenizer/tokenizer.htm
===================================================================
--- boost/trunk/libs/tokenizer/tokenizer.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tokenizer/tokenizer.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,51 +1,40 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
 
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
-<title>Boost Tokenizer Class</title>
-<!--
-  -- Copyright © John Bandela 2001
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Jeremy Siek makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
+  <title>Boost Tokenizer Class</title>
 </head>
 
-<body bgcolor="#FFFFFF" text="#000000" link="#0000EE"
-vlink="#551A8B" alink="#FF0000">
+<body bgcolor="#FFFFFF" text="#000000" link="#0000EE" vlink="#551A8B" alink=
+"#FF0000">
+  <p><img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br></p>
 
-<p><img src="../../boost.png" alt="C++ Boost" width="277"
-height="86"> <br>
-</p>
-
-<h1 align="center">Tokenizer Class</h1>
-
-<pre>  template &lt;
-	class TokenizerFunc = char_delimiters_separator&lt;char&gt;, 
-	class Iterator = std::string::const_iterator,
-	class Type = std::string
+  <h1 align="center">Tokenizer Class</h1>
+  <pre>
+  template &lt;
+        class TokenizerFunc = char_delimiters_separator&lt;char&gt;, 
+        class Iterator = std::string::const_iterator,
+        class Type = std::string
   &gt;
   class tokenizer
 </pre>
 
-<p>The tokenizer class provides a container view of a series of
-tokens contained in a sequence. You set the sequence to parse and
-the TokenizerFunction to use to parse the sequence either upon
-construction or using the assign member function. Note: No
-parsing is actually done upon construction. Parsing is done on
-demand as the tokens are accessed via the iterator provided by
-begin.</p>
+  <p>The tokenizer class provides a container view of a series of tokens
+  contained in a sequence. You set the sequence to parse and the
+  TokenizerFunction to use to parse the sequence either upon construction or
+  using the assign member function. Note: No parsing is actually done upon
+  construction. Parsing is done on demand as the tokens are accessed via the
+  iterator provided by begin.</p>
 
-<h2>Example</h2>
-
-<pre>// simple_example_1.cpp
+  <h2>Example</h2>
+  <pre>
+// simple_example_1.cpp
 #include&lt;iostream&gt;
 #include&lt;boost/tokenizer.hpp&gt;
 #include&lt;string&gt;
@@ -53,96 +42,123 @@
 int main(){
    using namespace std;
    using namespace boost;
-   string s = &quot;This is,  a test&quot;;
+   string s = "This is,  a test";
    tokenizer&lt;&gt; tok(s);
    for(tokenizer&lt;&gt;::iterator beg=tok.begin(); beg!=tok.end();++beg){
-       cout &lt;&lt; *beg &lt;&lt; &quot;\n&quot;;
+       cout &lt;&lt; *beg &lt;&lt; "\n";
    }
 }
 </pre>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
 
-<h3>Template Parameters</h3>
+  <h3>Template Parameters</h3>
 
-<table border="1">
+  <table border="1" summary="">
     <tr>
-        <th>Parameter</th>
-        <th>Description</th>
+      <th>Parameter</th>
+
+      <th>Description</th>
     </tr>
+
     <tr>
-        <td><tt>TokenizerFunc</tt></td>
-        <td>The TokenizerFunction used to parse the sequence.</td>
+      <td><tt>TokenizerFunc</tt></td>
+
+      <td>The TokenizerFunction used to parse the sequence.</td>
     </tr>
+
     <tr>
-        <td><tt>Iterator</tt></td>
-        <td>The type of the iterator the specifies the sequence.</td>
+      <td><tt>Iterator</tt></td>
+
+      <td>The type of the iterator the specifies the sequence.</td>
     </tr>
+
     <tr>
-        <td><tt>Type</tt></td>
-        <td>The type of the token, typically string.</td>
+      <td><tt>Type</tt></td>
+
+      <td>The type of the token, typically string.</td>
     </tr>
-</table>
+  </table>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
 
-<h2>Related Types</h2>
+  <h2>Related Types</h2>
 
-<table border="1">
+  <table border="1" summary="">
     <tr>
-        <td><p align="center"><strong>Type</strong></p>
-        </td>
-        <td><p align="center"><strong>Remarks</strong></p>
-        </td>
+      <td>
+        <p align="center"><strong>Type</strong></p>
+      </td>
+
+      <td>
+        <p align="center"><strong>Remarks</strong></p>
+      </td>
     </tr>
+
     <tr>
-        <td>iterator</td>
-        <td>The type returned by begin and end. Note: the
-        category of iterator will be at most ForwardIterator. It
-        will be InputIterator if the Iterator template parameter
-        is an InputIterator. For any other category, it will be
-        ForwardIterator.</td>
+      <td>iterator</td>
+
+      <td>The type returned by begin and end. Note: the category of iterator
+      will be at most ForwardIterator. It will be InputIterator if the
+      Iterator template parameter is an InputIterator. For any other
+      category, it will be ForwardIterator.</td>
     </tr>
+
     <tr>
-        <td>const_iterator</td>
-        <td>Same type as iterator.</td>
+      <td>const_iterator</td>
+
+      <td>Same type as iterator.</td>
     </tr>
+
     <tr>
-        <td>value_type</td>
-        <td>Same type as the template parameter Type</td>
+      <td>value_type</td>
+
+      <td>Same type as the template parameter Type</td>
     </tr>
+
     <tr>
-        <td>reference</td>
-        <td>Same type as value_type&amp;</td>
+      <td>reference</td>
+
+      <td>Same type as value_type&amp;</td>
     </tr>
+
     <tr>
-        <td>const_reference</td>
-        <td>Same type as const reference</td>
+      <td>const_reference</td>
+
+      <td>Same type as const reference</td>
     </tr>
+
     <tr>
-        <td>pointer</td>
-        <td>Same type as value_type*</td>
+      <td>pointer</td>
+
+      <td>Same type as value_type*</td>
     </tr>
+
     <tr>
-        <td>const_pointer</td>
-        <td>Same type as const pointer</td>
+      <td>const_pointer</td>
+
+      <td>Same type as const pointer</td>
     </tr>
+
     <tr>
-        <td>size_type</td>
-        <td>void</td>
+      <td>size_type</td>
+
+      <td>void</td>
     </tr>
+
     <tr>
-        <td>difference_type</td>
-        <td>void</td>
+      <td>difference_type</td>
+
+      <td>void</td>
     </tr>
-</table>
+  </table>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
 
-<h2>Construction and Member Functions</h2>
+  <h2>Construction and Member Functions</h2>
+  <pre>
+tokenizer(Iterator first, Iterator last,const TokenizerFunc&amp; f = TokenizerFunc()) 
 
-<pre>tokenizer(Iterator first, Iterator last,const TokenizerFunc&amp; f = TokenizerFunc()) 
-
 template&lt;class Container&gt;
 tokenizer(const Container&amp; c,const TokenizerFunc&amp; f = TokenizerFunc())
 
@@ -161,44 +177,62 @@
 iterator end() const
 </pre>
 
-<table border="1">
+  <table border="1" summary="">
     <tr>
-        <td><p align="center"><strong>Parameter</strong></p>
-        </td>
-        <td><p align="center"><strong>Description</strong></p>
-        </td>
+      <td>
+        <p align="center"><strong>Parameter</strong></p>
+      </td>
+
+      <td>
+        <p align="center"><strong>Description</strong></p>
+      </td>
     </tr>
+
     <tr>
-        <td>c</td>
-        <td>A container that contains the sequence to parse. Note:
-        c.begin() and c.end() must be convertible to the template
-        parameter Iterator.</td>
+      <td>c</td>
+
+      <td>A container that contains the sequence to parse. Note: c.begin()
+      and c.end() must be convertible to the template parameter
+      Iterator.</td>
     </tr>
+
     <tr>
-        <td>f</td>
-        <td>A functor that is a model of TokenizerFunction that
-        will be used to parse the sequence.</td>
+      <td>f</td>
+
+      <td>A functor that is a model of TokenizerFunction that will be used to
+      parse the sequence.</td>
     </tr>
+
     <tr>
-        <td>first</td>
-        <td>The iterator that represents the beginning position
-        in the sequence to be parsed.</td>
+      <td>first</td>
+
+      <td>The iterator that represents the beginning position in the sequence
+      to be parsed.</td>
     </tr>
+
     <tr>
-        <td>last</td>
-        <td>The iterator that represents the past the end
-        position in the sequence to be parsed.</td>
+      <td>last</td>
+
+      <td>The iterator that represents the past the end position in the
+      sequence to be parsed.</td>
     </tr>
-</table>
+  </table>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
+  <hr>
 
-<hr>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<p>© Copyright John R. Bandela 2001. Permission to copy, use,
-modify, sell and distribute this document is granted provided
-this copyright notice appears in all copies. This document is
-provided &quot;as is&quot; without express or implied warranty,
-and with no claim as to its suitability for any purpose.</p>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->25 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38518" --></p>
+
+  <p><i>Copyright &copy; 2001 John R. Bandela</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/tokenizer/tokenizerfunction.htm
===================================================================
--- boost/trunk/libs/tokenizer/tokenizerfunction.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tokenizer/tokenizerfunction.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,145 +1,182 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
 
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
-<title>TokenizerFunction Concept</title>
+  <title>TokenizerFunction Concept</title>
 </head>
 
-<body bgcolor="#FFFFFF" text="#000000" link="#0000EE"
-vlink="#551A8B" alink="#FF0000">
+<body bgcolor="#FFFFFF" text="#000000" link="#0000EE" vlink="#551A8B" alink=
+"#FF0000">
+  <p><img src="../../boost.png" alt="C++ Boost" width="277" height="86"></p>
 
-<p><img src="../../boost.png" alt="C++ Boost" width="277"
-height="86"> </p>
+  <h1 align="center">TokenizerFunction Concept</h1>
 
-<h1 align="center">TokenizerFunction Concept</h1>
+  <p>A TokenizerFunction is a functor whose purpose is to parse a given
+  sequence until exactly 1 token has been found or the end is reached. It
+  then updates the token, and informs the caller of the location in the
+  sequence of the next element immediately after the last element of the
+  sequence that was parsed for the current token.</p>
 
-<p>A TokenizerFunction is a functor whose purpose is to parse a
-given sequence until exactly 1 token has been found or the end is
-reached. It then updates the token, and informs the caller of the
-location in the sequence of the next element immediately after
-the last element of the sequence that was parsed for the current
-token. </p>
+  <h2>Refinement of</h2>
 
-<h2>Refinement of</h2>
+  <p>Assignable, CopyConstructable</p>
 
-<p>Assignable, CopyConstructable</p>
+  <h2>Notation</h2>
 
-<h2>Notation</h2>
+  <table border="1" summary="">
+    <tr>
+      <td valign="top"><tt>X</tt></td>
 
-<table border="1">
-    <tr>
-        <td valign="top"><tt>X</tt> </td>
-        <td valign="top">A type that is a model of
-        TokenizerFunction</td>
+      <td valign="top">A type that is a model of TokenizerFunction</td>
     </tr>
+
     <tr>
-        <td valign="top"><tt>func</tt> </td>
-        <td valign="top">Object of type <tt>X</tt> </td>
+      <td valign="top"><tt>func</tt></td>
+
+      <td valign="top">Object of type <tt>X</tt></td>
     </tr>
+
     <tr>
-        <td valign="top"><tt>tok</tt></td>
-        <td valign="top">Object of Token</td>
+      <td valign="top"><tt>tok</tt></td>
+
+      <td valign="top">Object of Token</td>
     </tr>
+
     <tr>
-        <td>next</td>
-        <td>iterator that points to the first unparsed element of
-        the sequence being parsed</td>
+      <td>next</td>
+
+      <td>iterator that points to the first unparsed element of the sequence
+      being parsed</td>
     </tr>
+
     <tr>
-        <td>end</td>
-        <td>iterator that points to the past the end of the
-        sequence being parsed</td>
+      <td>end</td>
+
+      <td>iterator that points to the past the end of the sequence being
+      parsed</td>
     </tr>
-</table>
+  </table>
 
-<h2>Definitions</h2>
+  <h2>Definitions</h2>
 
-<p>A token is the result of parsing a sequence.</p>
+  <p>A token is the result of parsing a sequence.</p>
 
-<h2>Valid expressions</h2>
+  <h2>Valid expressions</h2>
 
-<p>In addition to the expression in Assignable and
-CopyConstructable the following expressions are valid</p>
+  <p>In addition to the expression in Assignable and CopyConstructable the
+  following expressions are valid</p>
 
-<table border="1">
+  <table border="1" summary="">
     <tr>
-        <th>Name </th>
-        <th>Expression </th>
-        <th>Return type </th>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Return type</th>
     </tr>
+
     <tr>
-        <td valign="top">Functor</td>
-        <td valign="top"><tt>func(next, end, tok)</tt></td>
-        <td valign="top"><tt>bool</tt></td>
+      <td valign="top">Functor</td>
+
+      <td valign="top"><tt>func(next, end, tok)</tt></td>
+
+      <td valign="top"><tt>bool</tt></td>
     </tr>
+
     <tr>
-        <td valign="top">reset</td>
-        <td valign="top"><tt>reset()</tt></td>
-        <td valign="top"><tt>void</tt></td>
+      <td valign="top">reset</td>
+
+      <td valign="top"><tt>reset()</tt></td>
+
+      <td valign="top"><tt>void</tt></td>
     </tr>
-</table>
+  </table>
 
-<h2>Expression semantics</h2>
+  <h2>Expression semantics</h2>
 
-<p>In addition to the expression semantics in Assignable and
-CopyConstructable, TokenizerFunction has the following expression
-semantcs</p>
+  <p>In addition to the expression semantics in Assignable and
+  CopyConstructable, TokenizerFunction has the following expression
+  semantcs</p>
 
-<table border="1">
+  <table border="1" summary="">
     <tr>
-        <th>Name </th>
-        <th>Expression </th>
-        <th>Precondition </th>
-        <th>Semantics </th>
-        <th>Postcondition </th>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Precondition</th>
+
+      <th>Semantics</th>
+
+      <th>Postcondition</th>
     </tr>
+
     <tr>
-        <td>operator()</td>
-        <td><tt>func(next, end, tok)</tt></td>
-        <td><tt>next</tt> and <tt>end</tt> are valid iterators to
-        the same sequence. next is a reference the function is
-        free to modify. tok is constructed. </td>
-        <td>The return value indicates whether a new token was
-        found in the sequence (next,end]</td>
-        <td>If the return value is true, the new token is
-        assigned to tok. next is always updated to the position
-        where parsing should start on the subsequent call.</td>
+      <td>operator()</td>
+
+      <td><tt>func(next, end, tok)</tt></td>
+
+      <td><tt>next</tt> and <tt>end</tt> are valid iterators to the same
+      sequence. next is a reference the function is free to modify. tok is
+      constructed.</td>
+
+      <td>The return value indicates whether a new token was found in the
+      sequence (next,end]</td>
+
+      <td>If the return value is true, the new token is assigned to tok. next
+      is always updated to the position where parsing should start on the
+      subsequent call.</td>
     </tr>
+
     <tr>
-        <td>reset</td>
-        <td><tt>reset()</tt></td>
-        <td><tt>None</tt></td>
-        <td>Clears out all state variables that are used by the
-        object in parsing the current sequence.</td>
-        <td>A new sequence to parse can be given.</td>
+      <td>reset</td>
+
+      <td><tt>reset()</tt></td>
+
+      <td><tt>None</tt></td>
+
+      <td>Clears out all state variables that are used by the object in
+      parsing the current sequence.</td>
+
+      <td>A new sequence to parse can be given.</td>
     </tr>
-</table>
+  </table>
 
-<h2>Complexity guarantees</h2>
+  <h2>Complexity guarantees</h2>
 
-<p>No guarantees. Models of TokenizerFunction are free to define
-their own complexity</p>
+  <p>No guarantees. Models of TokenizerFunction are free to define their own
+  complexity</p>
 
-<h2>Models</h2>
+  <h2>Models</h2>
 
-<p><a href="escaped_list_separator.htm">escaped_list_separator</a></p>
+  <p><a href="escaped_list_separator.htm">escaped_list_separator</a></p>
 
-<p><a href="offset_separator.htm">offset_separator</a></p>
+  <p><a href="offset_separator.htm">offset_separator</a></p>
 
-<p><a href="char_delimiters_separator.htm">char_delimiters_separator</a></p>
+  <p><a href=
+  "char_delimiters_separator.htm">char_delimiters_separator</a></p>
 
-<p>&nbsp;</p>
+  <p>&nbsp;</p>
+  <hr>
 
-<p>&nbsp;</p>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<hr>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->25
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38518" --></p>
 
-<p>© Copyright John R. Bandela 2001. Permission to copy, use,
-modify, sell and distribute this document is granted provided
-this copyright notice appears in all copies. This document is
-provided &quot;as is&quot; without express or implied warranty,
-and with no claim as to its suitability for any purpose.</p>
+  <p><i>Copyright &copy; 2001 John R. Bandela</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/tr1/doc/tr1.qbk
===================================================================
--- boost/trunk/libs/tr1/doc/tr1.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/doc/tr1.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,7 +8,7 @@
            http://www.boost.org/LICENSE_1_0.txt</ulink>)]
     [authors [Maddock, John]]
     [category misc]
-    [last-revision $Date: 2006/03/28 13:03:41 $]
+    [last-revision $Date: 2006/11/06 12:22:48 $]
 ]
 
 [section:intro Introduction]
@@ -77,6 +77,16 @@
 4) Any other standard library replacements (STLport for example).\n
 5) Your regular standard library.]
 
+[blurb [*Important Note #3: Sun C++ Users]\n\n
+Sun's compiler has a particularly interesting form of `#include`, that
+will actually look for a file named `array.SUNWCCh` if you `#include <array>`.
+In order to make this library work with Sun's compiler you will need to
+set up the include paths as follows:\n\n
+1) boost-root/boost/tr1/tr1/sun\n
+2) boost-root/boost/tr1/tr1\n
+3) boost-root\n
+4) Any other standard library replacements (STLport for example).\n
+5) Your regular standard library.]
 
 [endsect]
 
@@ -394,7 +404,7 @@
 arbitrary code may be called. However a polymorphic function wrapper can call
 any callable object with a compatible call signature, this could be a function 
 pointer, or it could be a function object produced by std::tr1::bind, or some
-other mechanism.  For more information see the [@../../doc/html/function.html"
+other mechanism.  For more information see the [@../../doc/html/function.html
 Boost.Function documentation].
 
    
@@ -889,8 +899,7 @@
 standard library implements this part of TR1.
 
 [*Standard Conformity:]
-The Boost implementation does not support zero-sized arrarys.
-There is no non-constant data() member function in the Boost implementation.
+No known issues as of Boost-1.34 onwards.
 
 [endsect]
 
@@ -1530,85 +1539,85 @@
 
 [section:array_header <array>]
 
-See: [link boost_tr1.array]
+See: [link boost_tr1.array Fixed Size Array]
 
 [endsect]
 
 [section:cmath_header <cmath>]
 
-See: [link boost_tr1.special]
+See: [link boost_tr1.special Special Functions]
 
 [endsect]
 
 [section:complex_header <complex>]
 
-See: [link boost_tr1.complex]
+See: [link boost_tr1.complex Additional Overloads for Complex Number Algorithms]
 
-See: [link boost_tr1.complex_trig]
+See: [link boost_tr1.complex_trig Additional Complex Number Algorithms]
 
 [endsect]
 
 [section:functional <functional>]
 
-See: [link boost_tr1.ref].
+See: [link boost_tr1.ref Reference Wrapper].
 
-See: [link boost_tr1.result_of].
+See: [link boost_tr1.result_of Result_of].
 
-See: [link boost_tr1.mem_fn].
+See: [link boost_tr1.mem_fn Member Function Wrappers].
 
-See: [link boost_tr1.bind].
+See: [link boost_tr1.bind Function Binders].
 
-See: [link boost_tr1.function].
+See: [link boost_tr1.function Polymorphic Function Wrappers].
 
-See: [link boost_tr1.hash].
+See: [link boost_tr1.hash Hash Functions].
 
 [endsect]
 
 [section:memory <memory>]
 
-See: [link boost_tr1.ptrs].
+See: [link boost_tr1.ptrs Smart Pointers].
 
 [endsect]
 
 [section:random_header <random>]
 
-See: [link boost_tr1.random].
+See: [link boost_tr1.random Random Numbers].
 
 [endsect]
 
 [section:regex_header <regex>]
 
-See: [link boost_tr1.regex].
+See: [link boost_tr1.regex Regular Expressions].
 
 [endsect]
 
 [section:tuple_header <tuple>]
 
-See: [link boost_tr1.tuple].
+See: [link boost_tr1.tuple Tuple Types].
 
 [endsect]
 
 [section:type_traits_header <type_traits>]
 
-See: [link boost_tr1.type_traits].
+See: [link boost_tr1.type_traits Type Traits].
 
 [endsect]
 
 [section:unordered_map_header <unordered_map>]
 
-See: [link boost_tr1.unordered_map]
+See: [link boost_tr1.unordered_map Unordered Associative Map]
 
 [endsect]
 
 [section:unordered_set_header <unordered_set>]
 
-See: [link boost_tr1.unordered_set].
+See: [link boost_tr1.unordered_set Unordered Associative Set].
 
 [endsect]
 
 [section:utility_header <utility>]
 
-See: [link boost_tr1.utility].
+See: [link boost_tr1.utility  Tuple Interface to std::pair].
 
 [endsect]
 
@@ -1684,3 +1693,4 @@
 
 
 
+

Modified: boost/trunk/libs/tr1/index.html
===================================================================
--- boost/trunk/libs/tr1/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,9 +5,13 @@
    <body>
       Automatic redirection failed, please go to the <A href="../../doc/html/boost_tr1.html">Boost.TR1 
          documentation</A>.
+      <P>Copyright&nbsp;John Maddock 2006</P>
+      <P>Distributed under the Boost Software License, Version 1.0. (See accompanying file <A href="../../LICENSE_1_0.txt">
+            LICENSE_1_0.txt</A> or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</A>).</P>
    </body>
 </html>
 
 
 
 
+

Deleted: boost/trunk/libs/tr1/test/Jamfile
===================================================================
--- boost/trunk/libs/tr1/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,103 +0,0 @@
-# Copyright John Maddock 2005
-
-subproject libs/tr1/test ;
-
-# bring in the rules for testing
-import testing ;
-
-#
-# define the sources which need testing, mostly this is just
-# all the files *_test.cpp, but any badly named examples can 
-# be added to this list :-)
-#
-
-# this rule enumerates through all the sources and invokes
-# the run rule for each source, the result is a list of all
-# the run rules, which we can pass on to the test_suite rule:
-rule test_all
-{
-   #ECHO executing test_all rule ;
-   local all_rules = ;
-   for local file in [ GLOB $(BOOST_ROOT)/libs/tr1/test : test*.cpp ]
-   {
-      all_rules += [ compile $(file)
-         : <include>$(BOOST_ROOT) ] ;
-      all_rules += [ compile $(file) 
-         : #<sysinclude>$(BOOST_ROOT)/boost/tr1/tr1 
-           <include>$(BOOST_ROOT)/boost/tr1/tr1 
-           # Borland's broken include mechanism needs these extra headers:
-           <borland-5_6_4><*><include>$(BOOST_ROOT)/boost/tr1/tr1/bcc32 
-           <borland-5_5_1><*><include>$(BOOST_ROOT)/boost/tr1/tr1/bcc32 
-           <borland><*><include>$(BOOST_ROOT)/boost/tr1/tr1/bcc32 
-           <include>$(BOOST_ROOT) 
-           <define>TEST_STD_HEADERS=1 : std_$(file:B) ] ;
-   }
-   for local fileb in [ GLOB $(BOOST_ROOT)/libs/tr1/test : run*.cpp ]
-   {
-      all_rules += [ run $(fileb) : : : <include>$(BOOST_ROOT) ] ;
-      all_rules += [ run $(fileb) 
-      :  # additional args
-      :  # test-files
-      :  # requirements
-		#<sysinclude>$(BOOST_ROOT)/boost/tr1/tr1 
-		<include>$(BOOST_ROOT)/boost/tr1/tr1 
-      # Borland's broken include mechanism needs these extra headers:
-      <borland-5_6_4><*><include>$(BOOST_ROOT)/boost/tr1/tr1/bcc32 
-      <borland-5_5_1><*><include>$(BOOST_ROOT)/boost/tr1/tr1/bcc32 
-      <borland><*><include>$(BOOST_ROOT)/boost/tr1/tr1/bcc32 
-      <include>$(BOOST_ROOT) 
-		<define>TEST_STD_HEADERS=1 : std_$(fileb:B)  ] ;
-   }
-   for local file2 in [ GLOB $(BOOST_ROOT)/libs/tr1/test/config : tr1_has_tr1*fail.cpp ]
-   {
-      local test = [ compile-fail $(file2) : <include>$(BOOST_ROOT) ] ;
-      all_rules += $(test) ;
-   }
-   for local filec in [ GLOB $(BOOST_ROOT)/libs/tr1/test/config : tr1_has_tr1*pass.cpp ]
-   {
-      local test = [ compile $(filec) : <include>$(BOOST_ROOT) ] ;
-      all_rules += $(test) ;
-   }
-   
-   for local file3 in [ GLOB $(BOOST_ROOT)/libs/tr1/test/type_traits : *.cpp ]
-   {
-      all_rules += [ run $(file3) 
-      :  # additional args
-      :  # test-files
-      :  # requirements
-      <include>$(BOOST_ROOT)/libs/type_traits/test 
-      <include>$(BOOST_ROOT)/boost/tr1/tr1  
-      # Borland's broken include mechanism needs these extra headers:
-      <borland-5_6_4><*><include>$(BOOST_ROOT)/boost/tr1/tr1/bcc32 
-      <borland-5_5_1><*><include>$(BOOST_ROOT)/boost/tr1/tr1/bcc32 
-      <borland><*><include>$(BOOST_ROOT)/boost/tr1/tr1/bcc32 
-      <include>$(BOOST_ROOT) 
-      <define>TEST_STD=1 ] ;
-   }
-   for local file5 in [ GLOB $(BOOST_ROOT)/libs/tr1/test/std_headers : *.cpp ]
-   {
-      all_rules += [ compile $(file5) 
-      :   
-         <include>$(BOOST_ROOT)/boost/tr1/tr1 
-         # Borland's broken include mechanism needs these extra headers:
-         <borland-5_6_4><*><include>$(BOOST_ROOT)/boost/tr1/tr1/bcc32 
-         <borland-5_5_1><*><include>$(BOOST_ROOT)/boost/tr1/tr1/bcc32 
-         <borland><*><include>$(BOOST_ROOT)/boost/tr1/tr1/bcc32 
-         <include>$(BOOST_ROOT) 
-         <define>TEST_STD=1 : $(file5:B)_std_header   ] ;
-   }
-   #ECHO $(all_rules) ;
-   return $(all_rules) ;
-}
-
-test-suite tr1 : [ test_all r ] ; 
-
-
-
-
-
-
-
-
-
-

Modified: boost/trunk/libs/tr1/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/tr1/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,7 @@
-# Copyright John Maddock 2005
+# Copyright John Maddock 2005.
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 project :
     : requirements
@@ -8,6 +11,8 @@
     <include>$(BOOST_ROOT)/boost/tr1/tr1 
     # Borland's broken include mechanism needs these extra headers:
     <toolset>borland:<include>$(BOOST_ROOT)/boost/tr1/tr1/bcc32 
+    # Sunpro's broken include mechanism needs these extra headers:
+    <include>$(BOOST_ROOT)/boost/tr1/tr1/sun 
     ;
 
 
@@ -81,3 +86,5 @@
 
 
 
+
+

Deleted: boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_over_fail.cpp
===================================================================
--- boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_over_fail.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_over_fail.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/config/test/has_tr1_complex_over_fail.cpp"
-

Deleted: boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_over_pass.cpp
===================================================================
--- boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_over_pass.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_over_pass.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/config/test/has_tr1_complex_over_pass.cpp"
-

Deleted: boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_trig_fail.cpp
===================================================================
--- boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_trig_fail.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_trig_fail.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/config/test/has_tr1_complex_trig_fail.cpp"
-

Deleted: boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_trig_pass.cpp
===================================================================
--- boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_trig_pass.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/config/tr1_has_tr1_complex_trig_pass.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/config/test/has_tr1_complex_trig_pass.cpp"
-

Copied: boost/trunk/libs/tr1/test/config/tr1_has_tr1_cx_over_fail.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/config/tr1_has_tr1_cx_over_fail.cpp)

Copied: boost/trunk/libs/tr1/test/config/tr1_has_tr1_cx_over_pass.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/config/tr1_has_tr1_cx_over_pass.cpp)

Copied: boost/trunk/libs/tr1/test/config/tr1_has_tr1_cx_trig_fail.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/config/tr1_has_tr1_cx_trig_fail.cpp)

Copied: boost/trunk/libs/tr1/test/config/tr1_has_tr1_cx_trig_pass.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/config/tr1_has_tr1_cx_trig_pass.cpp)

Copied: boost/trunk/libs/tr1/test/config/tr1_has_tr1_tt_fail.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/config/tr1_has_tr1_tt_fail.cpp)

Copied: boost/trunk/libs/tr1/test/config/tr1_has_tr1_tt_pass.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/config/tr1_has_tr1_tt_pass.cpp)

Deleted: boost/trunk/libs/tr1/test/config/tr1_has_tr1_type_traits_fail.cpp
===================================================================
--- boost/trunk/libs/tr1/test/config/tr1_has_tr1_type_traits_fail.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/config/tr1_has_tr1_type_traits_fail.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/config/test/has_tr1_type_traits_fail.cpp"
-

Deleted: boost/trunk/libs/tr1/test/config/tr1_has_tr1_type_traits_pass.cpp
===================================================================
--- boost/trunk/libs/tr1/test/config/tr1_has_tr1_type_traits_pass.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/config/tr1_has_tr1_type_traits_pass.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/config/test/has_tr1_type_traits_pass.cpp"
-

Copied: boost/trunk/libs/tr1/test/config/tr1_has_tr1_un_map_fail.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/config/tr1_has_tr1_un_map_fail.cpp)

Copied: boost/trunk/libs/tr1/test/config/tr1_has_tr1_un_map_pass.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/config/tr1_has_tr1_un_map_pass.cpp)

Copied: boost/trunk/libs/tr1/test/config/tr1_has_tr1_un_set_fail.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/config/tr1_has_tr1_un_set_fail.cpp)

Copied: boost/trunk/libs/tr1/test/config/tr1_has_tr1_un_set_pass.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/config/tr1_has_tr1_un_set_pass.cpp)

Deleted: boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_map_fail.cpp
===================================================================
--- boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_map_fail.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_map_fail.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/config/test/has_tr1_unordered_map_fail.cpp"
-

Deleted: boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_map_pass.cpp
===================================================================
--- boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_map_pass.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_map_pass.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/config/test/has_tr1_unordered_map_pass.cpp"
-

Deleted: boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_set_fail.cpp
===================================================================
--- boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_set_fail.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_set_fail.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/config/test/has_tr1_unordered_set_fail.cpp"
-

Deleted: boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_set_pass.cpp
===================================================================
--- boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_set_pass.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/config/tr1_has_tr1_unordered_set_pass.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/config/test/has_tr1_unordered_set_pass.cpp"
-

Modified: boost/trunk/libs/tr1/test/test_array_tricky.cpp
===================================================================
--- boost/trunk/libs/tr1/test/test_array_tricky.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/test_array_tricky.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,7 +15,25 @@
 
 #include "verify_return.hpp"
 
+template <class T, class U>
+void check_tuple_access(T& a, const U&)
+{
+   typedef typename T::value_type value_type;
+   
+   const T& ca = a;
+
+   BOOST_STATIC_ASSERT((::boost::is_same< typename std::tr1::tuple_element<0,T>::type, value_type>::value));
+   verify_return_type(&std::tr1::get<0>(a), static_cast<value_type*>(0));
+   verify_return_type(&std::tr1::get<0>(ca), static_cast<const value_type*>(0));
+}
+
 template <class T>
+void check_tuple_access(T& a, const boost::mpl::true_&)
+{
+   // nothing to check the array is empty
+}
+
+template <class T>
 void check_array(T& a)
 {
    typedef typename T::reference reference;
@@ -70,9 +88,8 @@
    verify_return_type(ca <= ca2, false);
    verify_return_type(ca >= ca2, false);
 
-   BOOST_STATIC_ASSERT((::boost::is_same< typename std::tr1::tuple_element<0,T>::type, value_type>::value));
-   verify_return_type(&std::tr1::get<0>(a), static_cast<value_type*>(0));
-   verify_return_type(&std::tr1::get<0>(ca), static_cast<const value_type*>(0));
+   typedef boost::mpl::bool_<std::tr1::tuple_size<T>::value == 0> emtyness;
+   check_tuple_access(a, emtyness());
 }
 
 int main()

Copied: boost/trunk/libs/tr1/test/test_bind_header.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_bind_header.cpp)

Deleted: boost/trunk/libs/tr1/test/test_boost.cpp
===================================================================
--- boost/trunk/libs/tr1/test/test_boost.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/test_boost.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,28 +0,0 @@
-//  (C) Copyright John Maddock 2005.
-//  Use, modification and distribution are subject to the
-//  Boost Software License, Version 1.0. (See accompanying file
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-// These are the headers included by the Boost.TR1 implementation,
-// by including these directly we probe for problems with cyclic
-// dependencies when the TR1 headers are in the include search path.
-
-#include <boost/type_traits/integral_constant.hpp>
-#include <boost/type_traits/add_const.hpp>
-#include <boost/type_traits/add_reference.hpp>
-#include <boost/mpl/if.hpp>
-
-#include <boost/ref.hpp>
-#include <boost/utility/result_of.hpp>
-#include <boost/mem_fn.hpp>
-#include <boost/bind.hpp>
-#include <boost/function.hpp>
-#include <boost/math/complex.hpp>
-
-// All of these are broken by cyclic dependencies:
-#include <boost/weak_ptr.hpp>
-#include <boost/shared_ptr.hpp>
-#include <boost/enable_shared_from_this.hpp>
-#include <boost/functional/hash.hpp>
-
-

Copied: boost/trunk/libs/tr1/test/test_complex_header.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_complex_header.cpp)

Copied: boost/trunk/libs/tr1/test/test_function_header.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_function_header.cpp)

Copied: boost/trunk/libs/tr1/test/test_hash_header.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_hash_header.cpp)

Copied: boost/trunk/libs/tr1/test/test_integral_const_header.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_integral_const_header.cpp)

Copied: boost/trunk/libs/tr1/test/test_mem_fn_header.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_mem_fn_header.cpp)

Copied: boost/trunk/libs/tr1/test/test_mpl_header.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_mpl_header.cpp)

Modified: boost/trunk/libs/tr1/test/test_random.cpp
===================================================================
--- boost/trunk/libs/tr1/test/test_random.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/test_random.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -22,8 +22,8 @@
 
    T t;
    result_type r = 0;
-   verify_return_type(t.min(), r);
-   verify_return_type(t.max(), r);
+   verify_return_type((t.min)(), r);
+   verify_return_type((t.max)(), r);
    verify_return_type(t(), r);
 }
 
@@ -44,9 +44,9 @@
    typedef unsigned long result_type;
    result_type operator()()
    { return 0; }
-   result_type min()const
+   result_type min BOOST_PREVENT_MACRO_SUBSTITUTION()const
    { return 0; }
-   result_type max()const
+   result_type max BOOST_PREVENT_MACRO_SUBSTITUTION()const
    { return 0; }
 
    static uniform_random_generator_architype& get()
@@ -71,9 +71,9 @@
    typedef unsigned long result_type;
    result_type operator()()
    { return 0; }
-   result_type min()const
+   result_type min BOOST_PREVENT_MACRO_SUBSTITUTION()const
    { return 0; }
-   result_type max()const
+   result_type max BOOST_PREVENT_MACRO_SUBSTITUTION()const
    { return 0; }
 
    pseudo_random_generator_architype(unsigned long){}
@@ -214,8 +214,8 @@
    typedef typename VG::result_type result_type;
    //verify_return_type((*g)(input_type(0)), result_type(0));
    const VG* cg = g;
-   verify_return_type(cg->min(), result_type(0));
-   verify_return_type(cg->max(), result_type(0));
+   verify_return_type((cg->min)(), result_type(0));
+   verify_return_type((cg->max)(), result_type(0));
 }
 
 int main()
@@ -251,9 +251,13 @@
    verify_return_type(xorc.base1(), pseudo_random_generator_architype());
    verify_return_type(xorc.base2(), pseudo_random_generator_architype());
 
+#ifndef __SUNPRO_CC
+   // we don't normally allow workarounds in here, but this
+   // class is unsupported on this platform.
    std::tr1::random_device d;
    check_uniform(&d);
    verify_return_type(d.entropy(), double(0));
+#endif
 
    uniform_random_generator_architype& gen = uniform_random_generator_architype::get();
    std::tr1::uniform_int<unsigned long> ui;
@@ -306,8 +310,8 @@
    BOOST_STATIC_ASSERT((::boost::is_same<std::tr1::uniform_real<>::result_type, double>::value));
    BOOST_STATIC_ASSERT((::boost::is_same<std::tr1::uniform_real<>::input_type, double>::value));
    std::tr1::uniform_real<long double> urd2(0.5L, 1.5L);
-   verify_return_type(urd2.min(), (long double)(0));
-   verify_return_type(urd2.max(), (long double)(0));
+   verify_return_type((urd2.min)(), (long double)(0));
+   verify_return_type((urd2.max)(), (long double)(0));
    check_random_distribution(&urd2);
    BOOST_STATIC_ASSERT((::boost::is_same<std::tr1::uniform_real<long double>::result_type, long double>::value));
    BOOST_STATIC_ASSERT((::boost::is_same<std::tr1::uniform_real<long double>::input_type, long double>::value));
@@ -355,3 +359,5 @@
    return 0;
 }
 
+
+

Copied: boost/trunk/libs/tr1/test/test_ref_header.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_ref_header.cpp)

Copied: boost/trunk/libs/tr1/test/test_ref_wrapper_tricky.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_ref_wrapper_tricky.cpp)

Deleted: boost/trunk/libs/tr1/test/test_reference_wrapper_tricky.cpp
===================================================================
--- boost/trunk/libs/tr1/test/test_reference_wrapper_tricky.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/test_reference_wrapper_tricky.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,81 +0,0 @@
-//  (C) Copyright John Maddock 2005.
-//  Use, modification and distribution are subject to the
-//  Boost Software License, Version 1.0. (See accompanying file
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#ifdef TEST_STD_HEADERS
-#include <functional>
-#else
-#include <boost/tr1/functional.hpp>
-#endif
-
-#include <boost/static_assert.hpp>
-#include <boost/type_traits/is_convertible.hpp>
-#include <boost/type_traits/is_same.hpp>
-#include <boost/type_traits/is_base_and_derived.hpp>
-#include "verify_return.hpp"
-
-struct test_type
-{
-   int member();
-   int cmember()const;
-   int member2(char);
-   int cmember2(char)const;
-};
-
-struct functor1 : public std::unary_function<int, double>
-{
-   double operator()(int)const;
-};
-
-struct functor2 : public std::binary_function<int, char, double>
-{
-   double operator()(int, char)const;
-};
-
-int main()
-{
-   BOOST_STATIC_ASSERT((::boost::is_base_and_derived<std::unary_function<int, double>, std::tr1::reference_wrapper<double (int)> >::value));
-   BOOST_STATIC_ASSERT((::boost::is_base_and_derived<std::unary_function<int, double>, std::tr1::reference_wrapper<double (*)(int)> >::value));
-   BOOST_STATIC_ASSERT((::boost::is_base_and_derived<std::unary_function<test_type*, int>, std::tr1::reference_wrapper<int (test_type::*)()> >::value));
-   BOOST_STATIC_ASSERT((::boost::is_base_and_derived<std::unary_function<const test_type*, int>, std::tr1::reference_wrapper<int (test_type::*)()const> >::value));
-   BOOST_STATIC_ASSERT((::boost::is_base_and_derived<std::unary_function<int, double>, std::tr1::reference_wrapper<functor1> >::value));
-   
-   BOOST_STATIC_ASSERT((::boost::is_base_and_derived<std::binary_function<int, char, double>, std::tr1::reference_wrapper<double (int, char)> >::value));
-   BOOST_STATIC_ASSERT((::boost::is_base_and_derived<std::binary_function<int, char, double>, std::tr1::reference_wrapper<double (*)(int, char)> >::value));
-   BOOST_STATIC_ASSERT((::boost::is_base_and_derived<std::binary_function<test_type*, char, int>, std::tr1::reference_wrapper<int (test_type::*)(char)> >::value));
-   BOOST_STATIC_ASSERT((::boost::is_base_and_derived<std::binary_function<const test_type*, char, int>, std::tr1::reference_wrapper<int (test_type::*)(char)const> >::value));
-   BOOST_STATIC_ASSERT((::boost::is_base_and_derived<std::binary_function<int, char, double>, std::tr1::reference_wrapper<functor2> >::value));
-
-   test_type* ptt = 0;
-   test_type const* cptt = 0;
-   int zero = 0;
-
-   // now check operator():
-   std::tr1::reference_wrapper<double (int)>* pr1;
-   verify_return_type((*pr1)(0), double());
-   std::tr1::reference_wrapper<double (*)(int)>* pr2;
-   verify_return_type((*pr2)(0), double());
-   std::tr1::reference_wrapper<int (test_type::*)()>* pr3;
-   verify_return_type((*pr3)(ptt), int());
-   std::tr1::reference_wrapper<int (test_type::*)()const>* pr4;
-   verify_return_type((*pr4)(cptt), int());
-   std::tr1::reference_wrapper<functor1>* pr5;
-   verify_return_type((*pr5)(zero), double());
-
-   std::tr1::reference_wrapper<double (int, char)>* pr1b;
-   verify_return_type((*pr1b)(0,0), double());
-   std::tr1::reference_wrapper<double (*)(int, char)>* pr2b;
-   verify_return_type((*pr2b)(0,0), double());
-   std::tr1::reference_wrapper<int (test_type::*)(char)>* pr3b;
-   verify_return_type((*pr3b)(ptt,zero), int());
-   std::tr1::reference_wrapper<int (test_type::*)(char)const>* pr4b;
-   verify_return_type((*pr4b)(cptt,zero), int());
-   std::tr1::reference_wrapper<functor2>* pr5b;
-   verify_return_type((*pr5b)(zero, zero), double());
-
-   // check implicit convertion:
-   int i = 0;
-   int& ri = std::tr1::ref(i);
-   const int& cri = std::tr1::cref(i);
-}

Copied: boost/trunk/libs/tr1/test/test_result_of_header.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_result_of_header.cpp)

Copied: boost/trunk/libs/tr1/test/test_shared_array_header.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_shared_array_header.cpp)

Copied: boost/trunk/libs/tr1/test/test_shared_ptr_header.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_shared_ptr_header.cpp)

Copied: boost/trunk/libs/tr1/test/test_shd_this_header.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_shd_this_header.cpp)

Copied: boost/trunk/libs/tr1/test/test_type_traits_header.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_type_traits_header.cpp)

Copied: boost/trunk/libs/tr1/test/test_weak_ptr_header.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/test_weak_ptr_header.cpp)

Copied: boost/trunk/libs/tr1/test/type_traits/tr1_has_trivial_destr_test.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/type_traits/tr1_has_trivial_destr_test.cpp)

Deleted: boost/trunk/libs/tr1/test/type_traits/tr1_has_trivial_destructor_test.cpp
===================================================================
--- boost/trunk/libs/tr1/test/type_traits/tr1_has_trivial_destructor_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/type_traits/tr1_has_trivial_destructor_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/type_traits/test/has_trivial_destructor_test.cpp"
-

Copied: boost/trunk/libs/tr1/test/type_traits/tr1_has_virtual_destr_test.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/type_traits/tr1_has_virtual_destr_test.cpp)

Deleted: boost/trunk/libs/tr1/test/type_traits/tr1_has_virtual_destructor_test.cpp
===================================================================
--- boost/trunk/libs/tr1/test/type_traits/tr1_has_virtual_destructor_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/type_traits/tr1_has_virtual_destructor_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/type_traits/test/has_virtual_destructor_test.cpp"
-

Copied: boost/trunk/libs/tr1/test/type_traits/tr1_tky_abstract_type_test.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/type_traits/tr1_tky_abstract_type_test.cpp)

Copied: boost/trunk/libs/tr1/test/type_traits/tr1_tky_function_type_test.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/type_traits/tr1_tky_function_type_test.cpp)

Copied: boost/trunk/libs/tr1/test/type_traits/tr1_tky_incomp_type_test.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/type_traits/tr1_tky_incomp_type_test.cpp)

Copied: boost/trunk/libs/tr1/test/type_traits/tr1_tky_partial_spec_test.cpp (from rev 14034, boost/branches/upstream/current/libs/tr1/test/type_traits/tr1_tky_partial_spec_test.cpp)

Deleted: boost/trunk/libs/tr1/test/type_traits/tr1_tricky_abstract_type_test.cpp
===================================================================
--- boost/trunk/libs/tr1/test/type_traits/tr1_tricky_abstract_type_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/type_traits/tr1_tricky_abstract_type_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/type_traits/test/tricky_abstract_type_test.cpp"
-

Deleted: boost/trunk/libs/tr1/test/type_traits/tr1_tricky_function_type_test.cpp
===================================================================
--- boost/trunk/libs/tr1/test/type_traits/tr1_tricky_function_type_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/type_traits/tr1_tricky_function_type_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/type_traits/test/tricky_function_type_test.cpp"
-

Deleted: boost/trunk/libs/tr1/test/type_traits/tr1_tricky_incomplete_type_test.cpp
===================================================================
--- boost/trunk/libs/tr1/test/type_traits/tr1_tricky_incomplete_type_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/type_traits/tr1_tricky_incomplete_type_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/type_traits/test/tricky_incomplete_type_test.cpp"
-

Deleted: boost/trunk/libs/tr1/test/type_traits/tr1_tricky_partial_spec_test.cpp
===================================================================
--- boost/trunk/libs/tr1/test/type_traits/tr1_tricky_partial_spec_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/type_traits/tr1_tricky_partial_spec_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +0,0 @@
-//  Copyright John Maddock 2005
-//  Use, modification and distribution are subject to the 
-//  Boost Software License, Version 1.0. (See accompanying file 
-//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include "libs/type_traits/test/tricky_partial_spec_test.cpp"
-

Modified: boost/trunk/libs/tr1/test/verify_return.hpp
===================================================================
--- boost/trunk/libs/tr1/test/verify_return.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tr1/test/verify_return.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,12 +7,17 @@
 #define BOOST_TR1_TEST_RESULT_HPP
 
 #include <boost/type_traits/is_same.hpp>
+#include <boost/type_traits/remove_cv.hpp>
 #include <boost/static_assert.hpp>
 
 template <class T1, class T2>
 void verify_return_type(T1, T2)
 {
-   BOOST_STATIC_ASSERT( (::boost::is_same<T1, T2>::value));
+   // This is a workaround for the broken type
+   // deduction in Borland C++:
+   typedef typename boost::remove_cv<T1>::type T1CV;
+   typedef typename boost::remove_cv<T2>::type T2CV;
+   BOOST_STATIC_ASSERT( (::boost::is_same<T1CV, T2CV>::value));
 }
 
 

Modified: boost/trunk/libs/tuple/doc/tuple_advanced_interface.html
===================================================================
--- boost/trunk/libs/tuple/doc/tuple_advanced_interface.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tuple/doc/tuple_advanced_interface.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -101,7 +101,7 @@
 <p>
 The template <code>access_traits</code> defines three type functions. Let <code>T</code> be a type of an element in a tuple:
 <ol>
-<li><code>access_traits&lt;T&gt;::type</code> maps <code>T</code> to the return type of the non-const access functions (nonmeber and member <code>get</code> functions, and the <code>get_head</code> function).</li>
+<li><code>access_traits&lt;T&gt;::non_const_type</code> maps <code>T</code> to the return type of the non-const access functions (nonmeber and member <code>get</code> functions, and the <code>get_head</code> function).</li>
 <li><code>access_traits&lt;T&gt;::const_type</code> maps <code>T</code> to the return type of the const access functions.</li>
 <li><code>access_traits&lt;T&gt;::parameter_type</code> maps <code>T</code> to the parameter type of the tuple constructor.</li>
 </ol>

Modified: boost/trunk/libs/tuple/index.html
===================================================================
--- boost/trunk/libs/tuple/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tuple/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,6 +3,11 @@
 <meta http-equiv="refresh" content="0; URL=doc/tuple_users_guide.html">
 </head>
 <body>
-Automatic redirection failed, please go to <a href="doc/tuple_users_guide.html">doc/tuple_users_guide.html</a>
+Automatic redirection failed, please go to <a href="doc/tuple_users_guide.html">doc/tuple_users_guide.html</a> 
+&nbsp;<hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+at <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
+</html>

Deleted: boost/trunk/libs/tuple/test/Jamfile
===================================================================
--- boost/trunk/libs/tuple/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/tuple/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,20 +0,0 @@
-subproject libs/tuple/test ;
-
-unit-test tuple_test_bench
-    : tuple_test_bench.cpp
-      <lib>../../test/build/boost_test_exec_monitor
-    : <sysinclude>$(BOOST_ROOT)
-    ;
-
-unit-test io_test
-    : io_test.cpp
-      <lib>../../test/build/boost_test_exec_monitor
-    : <sysinclude>$(BOOST_ROOT)
-    ;
-
-unit-test another_tuple_test_bench
-    : another_tuple_test_bench.cpp
-      <lib>../../test/build/boost_test_exec_monitor
-    : <sysinclude>$(BOOST_ROOT)
-    ;
-

Modified: boost/trunk/libs/type_traits/cxx_type_traits.htm
===================================================================
--- boost/trunk/libs/type_traits/cxx_type_traits.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/type_traits/cxx_type_traits.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,8 +8,12 @@
     <a href="../../doc/html/boost_typetraits/background.html">../../doc/html/boost_typetraits/background.html</a>
     or view the online version at
     <a href="http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_typetraits/background.html">http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_typetraits/background.html</a>
+      <P>Copyright&nbsp;John Maddock 2006</P>
+      <P>Distributed under the Boost Software License, Version 1.0. (See accompanying file <A href="../../LICENSE_1_0.txt">
+            LICENSE_1_0.txt</A> or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</A>).</P>
   </body>
 </html>
 
 
 
+

Modified: boost/trunk/libs/type_traits/doc/type_traits.qbk
===================================================================
--- boost/trunk/libs/type_traits/doc/type_traits.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/type_traits/doc/type_traits.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,7 +13,7 @@
     [authors [authors, various]]
     [category template]
     [category generic]
-    [last-revision $Date: 2006/04/21 09:43:55 $]
+    [last-revision $Date: 2006/12/22 10:09:37 $]
 ]
 
 [def __boost_root ../../../../]
@@ -669,7 +669,7 @@
    
 and the second part provides the library's users with a mechanism to make the 
 above code work not only for `char`, `int` or other built-in type, 
-but for they own types as well:
+but for their own types as well:
 
    namespace myspace{
       struct MyClass {};
@@ -1707,7 +1707,7 @@
 expression that evaluates to /true/.]
 
 [:`is_base_of<Base, Base>::value` is an integral constant 
-expression that evaluates to /false/: a class is not it's own base.]
+expression that evaluates to /true/: a class is regarded as it's own base.]
 
 [:`is_base_of<Derived, Base>::value` is an integral constant 
 expression that evaluates to /false/: the arguments are the wrong way round.]
@@ -1979,6 +1979,7 @@
 [endsect]
 
 [section:is_function is_function]
+
    template <class T>
    struct is_function : public __tof {};
   
@@ -2018,6 +2019,18 @@
 
 [:`is_function<T>::value_type` is the type `bool`.]
 
+[tip Don't confuse function-types with pointers to functions:\n\n
+`typedef int f(double);`\n\n
+defines a function type,\n\n
+`f foo;`\n\n
+declares a prototype for a function of type `f`,\n\n
+`f* pf = foo;`\n
+`f& fr = foo;`\n\n
+declares a pointer and a reference to the function `foo`.\n\n
+If you want to detect whether some type is a pointer-to-function then use:\n\n
+`__is_function<__remove_pointer<T>::type>::value && __is_pointer<T>::value`\n\n
+or for pointers to member functions you can just use __is_member_function_pointer directly.]
+
 [endsect]
 
 [section:is_fundamental is_fundamental]
@@ -2238,6 +2251,7 @@
 [endsect]
 
 [section:is_pointer is_pointer]
+
    template <class T>
    struct is_pointer : public __tof {};
   
@@ -2266,6 +2280,13 @@
 
 [:`is_pointer<T>::value_type` is the type `bool`.]
 
+[important `is_pointer` detects "real" pointer types only, and /not/ smart pointers.
+Users should not specialise `is_pointer` for smart pointer types, as doing so may cause
+Boost (and other third party) code to fail to function correctly.
+Users wanting a trait to detect smart pointers should create their own. 
+However, note that there is no way in general to auto-magically detect smart pointer types, 
+so such a trait would have to be partially specialised for each supported smart pointer type.]
+
 [endsect]
 
 [section:is_polymorphic is_polymorphic]
@@ -2854,3 +2875,4 @@
 [endsect]
 
 
+

Modified: boost/trunk/libs/type_traits/index.html
===================================================================
--- boost/trunk/libs/type_traits/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/type_traits/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,8 +8,12 @@
     <a href="../../doc/html/boost_typetraits.html">../../doc/html/boost_typetraits.html</a>
     or view the online version at
     <a href="http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_typetraits.html">http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_typetraits.html</a>
+      <P>Copyright&nbsp;John Maddock 2001</P>
+      <P>Distributed under the Boost Software License, Version 1.0. (See accompanying file <A href="../../LICENSE_1_0.txt">
+            LICENSE_1_0.txt</A> or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</A>).</P>
   </body>
 </html>
 
 
 
+

Deleted: boost/trunk/libs/type_traits/test/Jamfile
===================================================================
--- boost/trunk/libs/type_traits/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/type_traits/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,72 +0,0 @@
-# Copyright John Maddock 2004
-#
-# There are two ways to invoke this Jamfile:
-#
-# If we pass the argument --type-traits-unit-test
-# to bjam, then the tests are built as one big test
-# program: this may be slightly quicker in some cases,
-# but causes problems if any of the test sources don't compile.
-#
-# Alternatively, the default behaviour is to build each source
-# file as a separate test program, these no longer depend upon Boost.Test
-# (which causes cyclic dependencies).  We also get a separate status report
-# for each trait, which makes it easier to track down issues with non-conforming
-# compilers.
-#            
-
-subproject libs/type_traits/test ;
-
-# bring in the rules for testing
-import testing ;
-
-#
-# define the sources which need testing, mostly this is just
-# all the files *_test.cpp, but any badly named examples can 
-# be added to this list :-)
-#
-TEST_SOURCES = [ GLOB $(BOOST_ROOT)/libs/type_traits/test : *_test.cpp ]
-            udt_specialisations.cpp ;  
-            
-if --type-traits-unit-test in $(ARGV)
-{
-   test-suite type_traits :
-   [ run # sources:
-         $(TEST_SOURCES)
-         init.cpp
-         # dependencies
-         <lib>../../test/build/boost_unit_test_framework 
-      :  # additional args
-         --report_level=detailed --build_info=yes --log_level=messages
-      :  # test-files
-      :  # requirements
-         <sysinclude>$(BOOST_ROOT)
-         <define>USE_UNIT_TEST=1
-      :  # test name
-         type_traits_test
-   ] ;
-
-}
-else
-{
-   # this rule enumerates through all the sources and invokes
-   # the run rule for each source, the result is a list of all
-   # the run rules, which we can pass on to the test_suite rule:
-   rule test_all
-   {
-      #ECHO executing test_all rule ;
-      local all_rules = ;
-      for local file in $(TEST_SOURCES)
-      {
-         all_rules += [ run $(file) ] ;
-      }
-      #ECHO $(all_rules) ;
-      return $(all_rules) ;
-   }
-
-   test-suite type_traits :
-      [ test_all r ]
-   ; # type traits suite
-
-}
-
-

Modified: boost/trunk/libs/type_traits/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/type_traits/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/type_traits/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# copyright John Maddock 2004
+# Use, modification and distribution are subject to the 
+# Boost Software License, Version 1.0. (See accompanying file 
+# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 # bring in the rules for testing
 import testing ;
@@ -18,3 +22,4 @@
 test-suite type_traits : [ all-tests ] ;
 
 
+

Deleted: boost/trunk/libs/type_traits/test/promote_basic_test.cpp
===================================================================
--- boost/trunk/libs/type_traits/test/promote_basic_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/type_traits/test/promote_basic_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,124 +0,0 @@
-// Copyright 2005 Alexander Nasonov.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#include <climits>
-
-#if !defined(BOOST_NO_CWCHAR)
-#include <cwchar>
-#endif
-
-#include "promote_util.hpp"
-
-struct Struct {};
-
-int main()
-{
-    // char types
-
-#if CHAR_MAX <= INT_MAX
-    test_cv< char, int >();
-#else
-    // TODO: dead branch?
-    test_cv< char, unsigned int >();
-#endif
-
-    test_cv< signed char, int >();
-
-#if UCHAR_MAX <= INT_MAX
-    test_cv< unsigned char, int >();
-#else
-    test_cv< unsigned char, unsigned int >();
-#endif
-
-
-    // short types
-
-    test_cv< short int, int >();
-
-#if USHRT_MAX <= INT_MAX
-    test_cv< unsigned short, int >();
-#else
-    test_cv< unsigned short, unsigned int >();
-#endif
-
-
-    // int and long
-
-    test_cv< int,           int           >();
-    test_cv< unsigned int,  unsigned int  >();
-    test_cv< long,          long          >();
-    test_cv< unsigned long, unsigned long >();
-
-    // wchar_t
-
-#if !defined(BOOST_NO_CWCHAR) && defined(WCHAR_MAX) && defined(WCHAR_MIN)
-
-// Version prior to VC8 didn't allow WCHAR_MAX in #if expressions
-#if defined(BOOST_MSVC) && BOOST_MSVC < 1400
-#define BOOST_TT_AUX_WCHAR_MAX 0 // force test_cv< wchar_t, int >
-#else
-#define BOOST_TT_AUX_WCHAR_MAX WCHAR_MAX
-#endif
-
-#if BOOST_TT_AUX_WCHAR_MAX <= INT_MAX
-    test_cv< wchar_t, int >();
-#elif WCHAR_MIN == 0 && BOOST_TT_AUX_WCHAR_MAX <= UINT_MAX
-    test_cv< wchar_t, unsigned int >();
-#elif BOOST_TT_AUX_WCHAR_MAX <= LONG_MAX
-    test_cv< wchar_t, long >();
-#else
-    test_cv< wchar_t, unsigned long >();
-#endif
-
-#undef BOOST_TT_AUX_WCHAR_MAX
-
-#endif
-
-
-    // floating point promotion
-
-    test_cv< float , double >();
-    test_cv< double, double >();
-
-
-    // Other types
-
-    test_cv< Struct, Struct >();
-    test_cv< void  , void   >();
-    test_cv< void* , void*  >();
-
-    // Array types
-
-    typedef int arr[3];
-    typedef int (&arr_ref)[3];
-    typedef int (*arr_ptr)[3];
-
-    test_cv< arr    , arr     >();
-    test_cv< arr_ptr, arr_ptr >();
-
-    test_no_cv<arr_ref,arr_ref>();
-
-
-    // Function types
-
-    typedef int (fun)();
-    typedef int (&fun_ref)();
-    typedef int (*fun_ptr)();
-
-    test_no_cv< fun    , fun     >();
-    test_no_cv< fun_ref, fun_ref >();
-    test_no_cv< fun_ptr, fun_ptr >();
-
-    // Member pointer types
-
-    typedef int (Struct::*mem_fun_ptr)();
-    typedef int Struct::*mem_ptr;
-
-    test_no_cv< mem_ptr,     mem_ptr     >();
-    test_no_cv< mem_fun_ptr, mem_fun_ptr >();
-
-    return 0;
-}
-

Deleted: boost/trunk/libs/type_traits/test/promote_enum_test.cpp
===================================================================
--- boost/trunk/libs/type_traits/test/promote_enum_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/type_traits/test/promote_enum_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,151 +0,0 @@
-// Copyright 2005-2006 Alexander Nasonov.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-// Status of some compilers:
-//
-// Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 13.10.3077 for 80x86
-// /Za (disable extentions) is totally broken.
-// /Ze (enable extentions) promotes UIntEnum incorrectly to int.
-// See http://lab.msdn.microsoft.com/ProductFeedback/viewfeedback.aspx?feedbackid=22b0a6b7-120f-4ca0-9136-fa1b25b26efe
-//
-// Intel 9.0.028 for Windows has a similar problem:
-// https://premier.intel.com/IssueDetail.aspx?IssueID=365073
-//
-// gcc 3.4.4 with -fshort-enums option on x86
-// Dummy value is required, otherwise gcc promotes Enum1
-// to unsigned int although USHRT_MAX <= INT_MAX.
-// http://gcc.gnu.org/bugzilla/show_bug.cgi?id=24063
-// 
-// CC: Sun WorkShop 6 update 2 C++ 5.3 Patch 111685-20 2004/03/19
-// on SPARC V9 64-bit processor (-xarch=v9 flag)
-// Dummy values are required for LongEnum3 and LongEnum4.
-//
-// CC: Sun C++ 5.7 Patch 117830-03 2005/07/21
-// ICE in boost/type_traits/is_enum.hpp at line 67.
-
-
-#include <climits>
-
-#include "promote_util.hpp"
-
-enum IntEnum1 { IntEnum1_min = -5      , IntEnum1_max = 5        };
-enum IntEnum2 { IntEnum2_min = SHRT_MIN, IntEnum2_max = SHRT_MAX };
-enum IntEnum3 { IntEnum3_min = INT_MIN , IntEnum3_max = INT_MAX  };
-enum IntEnum4 { IntEnum4_value = INT_MAX };
-enum IntEnum5 { IntEnum5_value = INT_MIN };
-
-void test_promote_to_int()
-{
-    test_cv<IntEnum1,int>();
-    test_cv<IntEnum2,int>();
-    test_cv<IntEnum3,int>();
-    test_cv<IntEnum4,int>();
-    test_cv<IntEnum5,int>();
-}
-
-
-#if !(defined(__GNUC__) && __GNUC__ == 3 && __GNUC_MINOR__ == 4 && USHRT_MAX <= INT_MAX)
-
-enum Enum1 { Enum1_value = USHRT_MAX };
-
-#else
-
-// workaround for bug #24063 in gcc 3.4
-// http://gcc.gnu.org/bugzilla/show_bug.cgi?id=24063
-namespace gcc_short_enums_workaround {
-
-enum short_enum { value = 1 };
-
-template<bool ShortEnumsIsOn>
-struct select
-{
-    // Adding negative dummy value doesn't change
-    // promoted type because USHRT_MAX <= INT_MAX.
-    enum type { dummy = -1, value = USHRT_MAX };
-};
-
-template<>
-struct select<false>
-{
-    // No dummy value
-    enum type { value = USHRT_MAX };
-};
-
-} // namespace gcc_short_enums_workaround
-
-typedef gcc_short_enums_workaround::select<
-    sizeof(gcc_short_enums_workaround::short_enum) != sizeof(int)
-  >::type Enum1;
-
-#endif
-
-void test_promote_to_int_or_uint()
-{
-#if USHRT_MAX <= INT_MAX
-    test_cv<Enum1, int>();
-#else
-    test_cv<Enum1, unsigned int>();
-#endif
-}
-
-#if (defined(BOOST_MSVC) && BOOST_MSVC <= 1400 ) || \
-    (defined(BOOST_INTEL_WIN) && BOOST_INTEL_WIN <= 900)
-// Don't test UIntEnum on VC++ 8.0 and Intel for Windows 9.0,
-// they are broken. More info is on top of this file.
-#else
-
-enum UIntEnum { UIntEnum_max = UINT_MAX };
-
-void test_promote_to_uint()
-{
-    test_cv< UIntEnum, unsigned int >();
-}
-
-#endif
-
-// Enums can't be promoted to [unsigned] long if sizeof(int) == sizeof(long).
-#if INT_MAX < LONG_MAX
-
-enum LongEnum1 { LongEnum1_min = -1      , LongEnum1_max  = UINT_MAX };
-enum LongEnum2 { LongEnum2_min = LONG_MIN, LongEnum2_max  = LONG_MAX };
-
-enum LongEnum3
-{
-   LongEnum3_value = LONG_MAX
-#if defined(__SUNPRO_CC) && __SUNPRO_CC <= 0x530
- , LongEnum3_dummy = -1
-#endif
-};
-
-enum LongEnum4
-{
-    LongEnum4_value = LONG_MIN
-#if defined(__SUNPRO_CC) && __SUNPRO_CC <= 0x530
-  , LongEnum4_dummy = 1
-#endif
-};  
-
-void test_promote_to_long()
-{
-    test_cv< LongEnum1, long >();
-    test_cv< LongEnum2, long >();
-    test_cv< LongEnum3, long >();
-    test_cv< LongEnum4, long >();
-}
-
-enum ULongEnum { ULongEnum_value = ULONG_MAX };
-
-void test_promote_to_ulong()
-{
-    test_cv< ULongEnum, unsigned long >();
-}
-
-#endif // #if INT_MAX < LONG_MAX
-
-int main()
-{
-    return 0;
-}
-

Deleted: boost/trunk/libs/type_traits/test/promote_mpl_test.cpp
===================================================================
--- boost/trunk/libs/type_traits/test/promote_mpl_test.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/type_traits/test/promote_mpl_test.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,47 +0,0 @@
-// Copyright 2005 Alexander Nasonov.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#include <boost/mpl/at.hpp>
-#include <boost/mpl/lambda.hpp>
-#include <boost/mpl/placeholders.hpp>
-#include <boost/mpl/transform.hpp>
-#include <boost/mpl/vector.hpp>
-#include <boost/static_assert.hpp>
-#include <boost/type_traits/is_same.hpp>
-#include <boost/type_traits/promote.hpp>
-
-namespace mpl = boost::mpl;
-
-int main()
-{
-    using namespace mpl::placeholders;
-
-    typedef mpl::vector< char
-                       , signed char          // 1
-                       , unsigned char
-                       , short int const      // 3
-                       , unsigned short int
-                       , int volatile         // 5
-                       , unsigned int         // 6
-                       , long                 // 7
-                       , unsigned long        // 8
-                       , float const          // 9
-                       > types;
-
-    typedef mpl::transform< types
-                          , mpl::lambda< boost::promote<_> >::type
-                          >::type promoted;
-
-    BOOST_STATIC_ASSERT(( ::boost::is_same< mpl::at_c<promoted,1>::type, int           >::value ));
-    BOOST_STATIC_ASSERT(( ::boost::is_same< mpl::at_c<promoted,3>::type, int const     >::value ));
-    BOOST_STATIC_ASSERT(( ::boost::is_same< mpl::at_c<promoted,5>::type, int volatile  >::value ));
-    BOOST_STATIC_ASSERT(( ::boost::is_same< mpl::at_c<promoted,6>::type, unsigned int  >::value ));
-    BOOST_STATIC_ASSERT(( ::boost::is_same< mpl::at_c<promoted,7>::type, long          >::value ));
-    BOOST_STATIC_ASSERT(( ::boost::is_same< mpl::at_c<promoted,8>::type, unsigned long >::value ));
-    BOOST_STATIC_ASSERT(( ::boost::is_same< mpl::at_c<promoted,9>::type, double const  >::value ));
-
-    return 0;
-}
-

Deleted: boost/trunk/libs/type_traits/test/promote_util.hpp
===================================================================
--- boost/trunk/libs/type_traits/test/promote_util.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/type_traits/test/promote_util.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,37 +0,0 @@
-// Copyright 2005 Alexander Nasonov.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef FILE_boost_libs_type_traits_test_promote_util_hpp_INCLUDED
-#define FILE_boost_libs_type_traits_test_promote_util_hpp_INCLUDED
-
-#include <boost/type_traits/promote.hpp>
-
-#include <boost/config.hpp>
-#include <boost/static_assert.hpp>
-#include <boost/type_traits/is_same.hpp>
-
-template<class T, class Promoted>
-inline void test_no_cv()
-{
-    typedef BOOST_DEDUCED_TYPENAME boost::promote<T>::type promoted;
-    BOOST_STATIC_ASSERT((  boost::is_same<promoted,Promoted>::value ));
-}
-
-template<class T, class Promoted>
-inline void test_cv()
-{
-    typedef BOOST_DEDUCED_TYPENAME ::boost::promote<T               >::type promoted;
-    typedef BOOST_DEDUCED_TYPENAME ::boost::promote<T const         >::type promoted_c;
-    typedef BOOST_DEDUCED_TYPENAME ::boost::promote<T       volatile>::type promoted_v;
-    typedef BOOST_DEDUCED_TYPENAME ::boost::promote<T const volatile>::type promoted_cv;
-
-    BOOST_STATIC_ASSERT(( ::boost::is_same< promoted   , Promoted                >::value ));
-    BOOST_STATIC_ASSERT(( ::boost::is_same< promoted_c , Promoted const          >::value ));
-    BOOST_STATIC_ASSERT(( ::boost::is_same< promoted_v , Promoted       volatile >::value ));
-    BOOST_STATIC_ASSERT(( ::boost::is_same< promoted_cv, Promoted const volatile >::value ));
-}
-
-#endif // #ifndef FILE_boost_libs_type_traits_test_promote_util_hpp_INCLUDED
-

Modified: boost/trunk/libs/typeof/doc/typeof.qbk
===================================================================
--- boost/trunk/libs/typeof/doc/typeof.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/doc/typeof.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,7 +9,7 @@
         </ulink>)
     ]
     [id typeof]
-    [last-revision $Date: 2006/04/23 12:09:13 $]
+    [last-revision $Date: 2007/02/06 01:50:40 $]
 ]
 
 [section:moti Motivation]
@@ -101,6 +101,10 @@
 
 [section:tuto Tutorial]
 
+To start using typeof include the typeof header:
+
+    #include <boost/typeof/typeof.hpp>
+
 To deduce the type of an expression at compile time
 use the `BOOST_TYPEOF` macro:
 
@@ -586,6 +590,8 @@
 If you want to use `typeof_nested_typedef` in a template-context, use `BOOST_TYPEOF_NESTED_TYPEDEF_TPL(name,expr)`, 
 which takes care of `typename` inside the `typeof` expression.
 
+'typeof_nested_typedef' can not be used at function/block scope.
+
 [h4 Sample Code]
 
     template<typename A, typename B>

Modified: boost/trunk/libs/typeof/index.html
===================================================================
--- boost/trunk/libs/typeof/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+<!--
+Copyright (C) 2006 Arkadiy Vertleyb
+Use, modification and distribution is subject to the Boost Software
+License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+-->
+
 <html>
 <head>
 <meta http-equiv="refresh" content="0; URL=../../doc/html/typeof.html">

Deleted: boost/trunk/libs/typeof/test/Jamfile
===================================================================
--- boost/trunk/libs/typeof/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,79 +0,0 @@
-# Boost Typeof Library test Jamfile
-
-subproject libs/typeof/test ;
-
-# bring in rules for testing
-import testing ;
-
-local rule special-requirements ( toolset variant : properties * )
-{
-    # Tru64/CXX6.5 hangs on most tests, so just turn it off completely.
-
-    if $(UNIX) && $(OS) = OSF
-    {
-        switch $(toolset)
-        {
-            case tru64cxx65* : properties =
-                [ replace-properties $(properties) : <build>no ] ;
-        }
-    }
-    
-    return $(properties) ;
-}
-
-test-suite "typeof" 
-	:  
-	[ compile type.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : type_native ]
-	[ compile type.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : type_emulation ]
-
-	[ compile template_type.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_type_native ]
-	[ compile template_type.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : template_type_emulation ]
-
-	[ compile template_int.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_int_native ]
-	[ compile template_int.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : template_int_emulation ]
-
-	[ compile template_tpl.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_tpl_native ]
-	[ compile template_tpl.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : template_tpl_emulation ]
-
-	[ compile template_enum.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_enum_native ]
-	[ compile template_enum.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : template_enum_emulation ]
-
-	[ compile template_dependent.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_dependent_native ]
-	[ compile template_dependent.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : template_dependent_emulation ]
-
-	[ compile template_multiword.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_multiword_native ]
-	[ compile template_multiword.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : template_multiword_emulation ]
-
-	[ compile modifiers.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : modifiers_native ]
-	[ compile modifiers.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : modifiers_emulation ]
-
-	[ compile function.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : function_native ]
-	[ compile function.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : function_emulation ]
-
-	[ compile function_ptr.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : function_ptr_native ]
-	[ compile function_ptr.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : function_ptr_emulation ]
-
-	[ compile function_ref.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : function_ref_native ]
-	[ compile function_ref.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : function_ref_emulation ]
-
-	[ compile member_function.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : member_function_native ]
-	[ compile member_function.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : member_function_emulation ]
-
-	[ compile data_member.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : data_member_native ]
-	[ compile data_member.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : data_member_emulation ]
-
-	[ compile noncopyable.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : noncopyable_native ]
-	[ compile noncopyable.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : noncopyable_emulation ]
-
-	[ compile std.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : std_native ]
-	[ compile std.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : std_emulation ]
-
-	[ run odr1.cpp odr2.cpp : : : <define>BOOST_TYPEOF_NATIVE special-requirements : odr_native ]
-	[ run odr1.cpp odr2.cpp : : : <define>BOOST_TYPEOF_COMPLIANT special-requirements : odr_emulation ]
-
-	[ compile function_ptr_from_tpl.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : function_ptr_from_tpl_native ]
-	[ compile function_ptr_from_tpl.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : function_ptr_from_tpl_emulation ]
-
-	[ compile nested_typedef.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : nested_typedef_native ]
-	[ compile nested_typedef.cpp : <define>BOOST_TYPEOF_COMPLIANT special-requirements : nested_typedef_emulation ]
-	;

Modified: boost/trunk/libs/typeof/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/typeof/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright (C) 2006 Vladimir Prus
+# Copyright (C) 2006 Arkadiy Vertleyb
+# Use, modification and distribution is subject to the Boost Software
+# License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 # Boost Typeof Library test Jamfile
 
 import set ;
@@ -24,7 +29,7 @@
 {
    return [ compile $(source) : <define>BOOST_TYPEOF_NATIVE :
                 $(source:B)_native ]
-          [ compile $(source) : <define>BOOST_TYPEOF_COMPLIANT :
+          [ compile $(source) : <define>BOOST_TYPEOF_EMULATION :
                 $(source:B)_emulation ] 
           ;        
 }
@@ -32,14 +37,17 @@
 rule all-tests ( )
 {
     local all ;
-    for local t in [ set.difference [ glob *.cpp ] : odr1.cpp odr2.cpp ]
+#    for local t in [ set.difference [ glob *.cpp ] : odr1.cpp odr2.cpp ]
+    for local t in [ set.difference [ glob *.cpp ] : [ glob odr*.cpp ] ]
     {
         all += [ typeof-test $(t) ] ;
     }
     all += [ run odr1.cpp odr2.cpp : : : <define>BOOST_TYPEOF_NATIVE :
                 odr_native ] ;
-    all += [ run odr1.cpp odr2.cpp : : : <define>BOOST_TYPEOF_COMPLIANT :
+    all += [ run odr1.cpp odr2.cpp : : : <define>BOOST_TYPEOF_EMULATION :
                 odr_emulation ] ;		
+    all += [ run odr_no_uns1.cpp odr_no_uns2.cpp : : : <define>BOOST_TYPEOF_EMULATION : 
+                odr_no_uns ] ;		
     return $(all) ;    
 }
 

Modified: boost/trunk/libs/typeof/test/data_member.cpp
===================================================================
--- boost/trunk/libs/typeof/test/data_member.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/data_member.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 #include BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP()
 

Modified: boost/trunk/libs/typeof/test/function.cpp
===================================================================
--- boost/trunk/libs/typeof/test/function.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/function.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 
 BOOST_STATIC_ASSERT(boost::type_of::test<void()>::value);

Copied: boost/trunk/libs/typeof/test/function_binding.cpp (from rev 14034, boost/branches/upstream/current/libs/typeof/test/function_binding.cpp)

Modified: boost/trunk/libs/typeof/test/function_ptr.cpp
===================================================================
--- boost/trunk/libs/typeof/test/function_ptr.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/function_ptr.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 
 BOOST_STATIC_ASSERT(boost::type_of::test<double(*)()>::value);
@@ -4,3 +8,12 @@
 BOOST_STATIC_ASSERT(boost::type_of::test<double(*)(int, double, short, char*, bool, char, float, long, unsigned short)>::value);
 BOOST_STATIC_ASSERT(boost::type_of::test<void(*)()>::value);
 BOOST_STATIC_ASSERT(boost::type_of::test<void(*)(int, double, short, char*, bool, char, float, long, unsigned short)>::value);
+
+// check that const gets stripped from function pointer
+
+int foo(double);
+typedef int(*PTR)(double);
+typedef const PTR CPTR;
+CPTR cptr = foo;
+
+BOOST_STATIC_ASSERT((boost::is_same<BOOST_TYPEOF(cptr), PTR>::value));

Modified: boost/trunk/libs/typeof/test/function_ptr_from_tpl.cpp
===================================================================
--- boost/trunk/libs/typeof/test/function_ptr_from_tpl.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/function_ptr_from_tpl.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include <boost/typeof/typeof.hpp>
 #include <boost/type_traits/is_same.hpp>
 #include <boost/static_assert.hpp>

Modified: boost/trunk/libs/typeof/test/function_ref.cpp
===================================================================
--- boost/trunk/libs/typeof/test/function_ref.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/function_ref.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 
 BOOST_STATIC_ASSERT(boost::type_of::test<void(&)()>::value);

Modified: boost/trunk/libs/typeof/test/member_function.cpp
===================================================================
--- boost/trunk/libs/typeof/test/member_function.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/member_function.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 
 BOOST_STATIC_ASSERT(boost::type_of::test<double(*)()>::value);

Modified: boost/trunk/libs/typeof/test/modifiers.cpp
===================================================================
--- boost/trunk/libs/typeof/test/modifiers.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/modifiers.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 #include BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP()
 

Modified: boost/trunk/libs/typeof/test/nested_typedef.cpp
===================================================================
--- boost/trunk/libs/typeof/test/nested_typedef.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/nested_typedef.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Peder Holt
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include <boost/typeof/typeof.hpp>
 #include <boost/type_traits/is_same.hpp>
 #include <boost/static_assert.hpp>
@@ -8,7 +12,7 @@
 
 struct {
     template<typename T>
-    T operator[](const T&) {}
+    T operator[](const T& n) {return n;}
 } int_p;
 
 

Modified: boost/trunk/libs/typeof/test/noncopyable.cpp
===================================================================
--- boost/trunk/libs/typeof/test/noncopyable.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/noncopyable.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 #include <boost/noncopyable.hpp>
 #include BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP()

Modified: boost/trunk/libs/typeof/test/odr.hpp
===================================================================
--- boost/trunk/libs/typeof/test/odr.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/odr.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
+// boostinspect:nounnamed
+
 #include <boost/typeof/typeof.hpp>
 
 struct foo

Modified: boost/trunk/libs/typeof/test/odr1.cpp
===================================================================
--- boost/trunk/libs/typeof/test/odr1.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/odr1.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "odr.hpp"
 #include <iostream>
 

Modified: boost/trunk/libs/typeof/test/odr2.cpp
===================================================================
--- boost/trunk/libs/typeof/test/odr2.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/odr2.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,5 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "odr.hpp"

Copied: boost/trunk/libs/typeof/test/odr_no_uns1.cpp (from rev 14034, boost/branches/upstream/current/libs/typeof/test/odr_no_uns1.cpp)

Copied: boost/trunk/libs/typeof/test/odr_no_uns1.hpp (from rev 14034, boost/branches/upstream/current/libs/typeof/test/odr_no_uns1.hpp)

Copied: boost/trunk/libs/typeof/test/odr_no_uns2.cpp (from rev 14034, boost/branches/upstream/current/libs/typeof/test/odr_no_uns2.cpp)

Copied: boost/trunk/libs/typeof/test/odr_no_uns2.hpp (from rev 14034, boost/branches/upstream/current/libs/typeof/test/odr_no_uns2.hpp)

Modified: boost/trunk/libs/typeof/test/std.cpp
===================================================================
--- boost/trunk/libs/typeof/test/std.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/std.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 
 #include <boost/typeof/std/string.hpp>

Modified: boost/trunk/libs/typeof/test/template_dependent.cpp
===================================================================
--- boost/trunk/libs/typeof/test/template_dependent.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/template_dependent.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 #include BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP()
 

Modified: boost/trunk/libs/typeof/test/template_enum.cpp
===================================================================
--- boost/trunk/libs/typeof/test/template_enum.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/template_enum.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 #include BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP()
 

Modified: boost/trunk/libs/typeof/test/template_int.cpp
===================================================================
--- boost/trunk/libs/typeof/test/template_int.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/template_int.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 #include <climits>
 

Modified: boost/trunk/libs/typeof/test/template_multiword.cpp
===================================================================
--- boost/trunk/libs/typeof/test/template_multiword.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/template_multiword.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 #include BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP()
 

Modified: boost/trunk/libs/typeof/test/template_tpl.cpp
===================================================================
--- boost/trunk/libs/typeof/test/template_tpl.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/template_tpl.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 #include BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP()
 

Modified: boost/trunk/libs/typeof/test/template_type.cpp
===================================================================
--- boost/trunk/libs/typeof/test/template_type.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/template_type.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 #include BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP()
 

Modified: boost/trunk/libs/typeof/test/type.cpp
===================================================================
--- boost/trunk/libs/typeof/test/type.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/typeof/test/type.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+// Copyright (C) 2006 Arkadiy Vertleyb
+// Use, modification and distribution is subject to the Boost Software
+// License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt)
+
 #include "test.hpp"
 #include BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP()
 

Modified: boost/trunk/libs/utility/Assignable.html
===================================================================
--- boost/trunk/libs/utility/Assignable.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/Assignable.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,116 +1,109 @@
-<HTML>
-<!--
-  -- Copyright (c) Jeremy Siek 2000
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
-<Head>
-<Title>Assignable</Title>
-</HEAD>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
-        ALINK="#ff0000"> 
-<IMG SRC="../../boost.png" 
-     ALT="C++ Boost" width="277" height="86"> 
-<!--end header-->
-<BR Clear>
-<H1>Assignable</H1>
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
-<h3>Description</h3>
-A type is Assignable if it is possible to assign one object of the type
-to another object of that type.
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
+  <title>Assignable</title>
+</head>
 
-<h3>Notation</h3>
-<Table>
-<TR>
-<TD VAlign=top>
-<tt>T</tt>
-</TD>
-<TD VAlign=top>
-is type that is a model of Assignable
-</TD>
-</TR>
+<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
+"#FF0000">
+  <img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br clear="none">
 
-<TR>
-<TD VAlign=top>
-<tt>t</tt>
-</TD>
-<TD VAlign=top>
-is an object of type <tt>T</tt>
-</TD>
-</tr>
+  <h1>Assignable</h1>
 
-<TR>
-<TD VAlign=top>
-<tt>u</tt>
-</TD>
-<TD VAlign=top>
-is an object of type <tt>T</tt> or possibly <tt>const T</tt>
-</TD>
-</tr>
+  <h3>Description</h3>
 
-</table>
-<h3>Definitions</h3>
-<h3>Valid expressions</h3>
-<Table border>
-<TR>
-<TH>
-Name
-</TH>
-<TH>
-Expression
-</TH>
-<TH>
-Return type
-</TH>
-<TH>
-Semantics
-</TH>
-</TR>
-<TR>
-<TD VAlign=top>
-Assignment
-</TD>
-<TD VAlign=top>
-<tt>t = u</tt>
-</TD>
-<TD VAlign=top>
-<tt>T&amp;</tt>
-</TD>
-<TD VAlign=top>
-<tt>t</tt> is equivalent to <tt>u</tt>
-</TD>
-</TR>
+  <p>A type is Assignable if it is possible to assign one object of the type
+  to another object of that type.</p>
 
-</table>
+  <h3>Notation</h3>
 
+  <table summary="">
+    <tr>
+      <td valign="top"><tt>T</tt></td>
 
-</table>
-<h3>Models</h3>
+      <td valign="top">is type that is a model of Assignable</td>
+    </tr>
 
-<UL>
-<LI><tt>int</tt>
-<LI><tt>std::pair</tt>
-</UL>
+    <tr>
+      <td valign="top"><tt>t</tt></td>
 
-<h3>See also</h3>
-<a href="http://www.sgi.com/tech/stl/DefaultConstructible.html">DefaultConstructible</A>
-and 
-<A href="./CopyConstructible.html">CopyConstructible</A>
+      <td valign="top">is an object of type <tt>T</tt></td>
+    </tr>
 
-<br>
-<HR>
-<TABLE>
-<TR valign=top>
-<TD nowrap>Copyright &copy 2000</TD><TD>
-<A HREF=http://www.lsc.nd.edu/~jsiek>Jeremy Siek</A>, Univ.of Notre Dame (<A HREF="mailto:jsiek at lsc.nd.edu">jsiek at lsc.nd.edu</A>)
-</TD></TR></TABLE>
+    <tr>
+      <td valign="top"><tt>u</tt></td>
 
-</BODY>
-</HTML> 
+      <td valign="top">is an object of type <tt>T</tt> or possibly <tt>const
+      T</tt></td>
+    </tr>
+  </table>
+
+  <h3>Definitions</h3>
+
+  <h3>Valid expressions</h3>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Return type</th>
+
+      <th>Semantics</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Assignment</td>
+
+      <td valign="top"><tt>t = u</tt></td>
+
+      <td valign="top"><tt>T&amp;</tt></td>
+
+      <td valign="top"><tt>t</tt> is equivalent to <tt>u</tt></td>
+    </tr>
+  </table>
+
+  <h3>Models</h3>
+
+  <ul>
+    <li><tt>int</tt></li>
+
+    <li><tt>std::pair</tt></li>
+  </ul>
+
+  <h3>See also</h3>
+
+  <p><a href=
+  "http://www.sgi.com/tech/stl/DefaultConstructible.html">DefaultConstructible</a>
+  and <a href="./CopyConstructible.html">CopyConstructible</a><br></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <table summary="">
+    <tr valign="top">
+      <td nowrap><i>Copyright &copy; 2000</i></td>
+
+      <td><i><a href="http://www.lsc.nd.edu/~jsiek">Jeremy Siek</a>, Univ.of
+      Notre Dame (<a href=
+      "mailto:jsiek at lsc.nd.edu">jsiek at lsc.nd.edu</a>)</i></td>
+    </tr>
+  </table>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/utility/Collection.html
===================================================================
--- boost/trunk/libs/utility/Collection.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/Collection.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,246 +1,192 @@
-<HTML>
-<!--
-  -- Copyright (c) Jeremy Siek 2000
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
-<Head>
-<Title>Collection</Title>
-</HEAD>
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
-	ALINK="#ff0000"> 
-<h1>
-   <img src="../../boost.png" alt="boost logo"
-    width="277" align="middle" height="86">
-   <br>Collection
-</h1>
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<h3>Description</h3>
+  <title>Collection</title>
+</head>
 
-A Collection is a <i>concept</i> similar to the STL <a
-href="http://www.sgi.com/tech/stl/Container.html">Container</a>
-concept.  A Collection provides iterators for accessing a range of
-elements and provides information about the number of elements in the
-Collection.  However, a Collection has fewer requirements than a
-Container. The motivation for the Collection 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. To summarize the reduction
-in requirements:
+<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
+"#FF0000">
+  <h1><img src="../../boost.png" alt="boost logo" width="277" align="middle"
+  height="86"><br>
+  Collection</h1>
 
-<UL>
-<LI>It is not required to &quot;own&quot; its elements: the lifetime
-of an element in a Collection does not have to match the lifetime of
-the Collection object, though the lifetime of the element should cover
-the lifetime of the Collection object.
-<LI>The semantics of copying a Collection object is not defined (it
-could be a deep or shallow copy or not even support copying). 
-<LI>The associated reference type of a Collection does
-not have to be a real C++ reference.
-</UL>
+  <h3>Description</h3>
 
+  <p>A Collection is a <i>concept</i> similar to the STL <a href=
+  "http://www.sgi.com/tech/stl/Container.html">Container</a> concept. A
+  Collection provides iterators for accessing a range of elements and
+  provides information about the number of elements in the Collection.
+  However, a Collection has fewer requirements than a Container. The
+  motivation for the Collection 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. To summarize the reduction in requirements:</p>
 
-Because of the reduced requirements, some care must be taken when
-writing code that is meant to be generic for all Collection types.
-In particular, a Collection object should be passed by-reference
-since assumptions can not be made about the behaviour of the
-copy constructor.
+  <ul>
+    <li>It is not required to "own" its elements: the lifetime of an element
+    in a Collection does not have to match the lifetime of the Collection
+    object, though the lifetime of the element should cover the lifetime of
+    the Collection object.</li>
 
-<p>
+    <li>The semantics of copying a Collection object is not defined (it could
+    be a deep or shallow copy or not even support copying).</li>
 
-<h3>Associated types</h3>
+    <li>The associated reference type of a Collection does not have to be a
+    real C++ reference.</li>
+  </ul>Because of the reduced requirements, some care must be taken when
+  writing code that is meant to be generic for all Collection types. In
+  particular, a Collection object should be passed by-reference since
+  assumptions can not be made about the behaviour of the copy constructor.
 
-<Table border>
-<TR>
-<TD VAlign=top>
-Value type
-</TD>
-<TD VAlign=top>
-<tt>X::value_type</tt>
-</TD>
-<TD VAlign=top>
-The type of the object stored in a Collection.  
-If the Collection is <i>mutable</i> then
-the value type must be <A
-href="http://www.sgi.com/tech/stl/Assignable.html">Assignable</A>.
-Otherwise the value type must be <a href="./CopyConstructible.html">CopyConstructible</a>.
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Iterator type
-</TD>
-<TD VAlign=top>
-<tt>X::iterator</tt>
-</TD>
-<TD VAlign=top>
-The type of iterator used to iterate through a Collection's
-   elements.  The iterator's value type is expected to be the
-   Collection's value type.  A conversion
-   from the iterator type to the const iterator type must exist.
-   The iterator type must be an <A href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</A>.
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Const iterator type
-</TD>
-<TD VAlign=top>
-<tt>X::const_iterator</tt>
-</TD>
-<TD VAlign=top>
-A type of iterator that may be used to examine, but not to modify,
-   a Collection's elements.
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Reference type
-</TD>
-<TD VAlign=top>
-<tt>X::reference</tt>
-</TD>
-<TD VAlign=top>
-A type that behaves like a reference to the Collection's value type.
-<a href="#1">[1]</a>
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Const reference type
-</TD>
-<TD VAlign=top>
-<tt>X::const_reference</tt>
-</TD>
-<TD VAlign=top>
-A type that behaves like a const reference to the Collection's value type.
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Pointer type
-</TD>
-<TD VAlign=top>
-<tt>X::pointer</tt>
-</TD>
-<TD VAlign=top>
-A type that behaves as a pointer to the Collection's value type.
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Distance type
-</TD>
-<TD VAlign=top>
-<tt>X::difference_type</tt>
-</TD>
-<TD VAlign=top>
-A signed integral type used to represent the distance between two
-   of the Collection's iterators.  This type must be the same as 
-   the iterator's distance type.
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Size type
-</TD>
-<TD VAlign=top>
-<tt>X::size_type</tt>
-</TD>
-<TD VAlign=top>
-An unsigned integral type that can represent any nonnegative value
-   of the Collection's distance type.
-</TD>
-</tr>
-</table>
-<h3>Notation</h3>
-<Table>
-<TR>
-<TD VAlign=top>
-<tt>X</tt>
-</TD>
-<TD VAlign=top>
-A type that is a model of Collection.
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-<tt>a</tt>, <tt>b</tt>
-</TD>
-<TD VAlign=top>
-Object of type <tt>X</tt>.
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-<tt>T</tt>
-</TD>
-<TD VAlign=top>
-The value type of <tt>X</tt>.
-</TD>
-</tr>
-</table>
+  <h3>Associated types</h3>
 
-<h3>Valid expressions</h3>
+  <table border summary="">
+    <tr>
+      <td valign="top">Value type</td>
 
-The following expressions must be valid.
-<p>
+      <td valign="top"><tt>X::value_type</tt></td>
 
-<Table border>
+      <td valign="top">The type of the object stored in a Collection. If the
+      Collection is <i>mutable</i> then the value type must be <a href=
+      "http://www.sgi.com/tech/stl/Assignable.html">Assignable</a>. Otherwise
+      the value type must be <a href=
+      "./CopyConstructible.html">CopyConstructible</a>.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Iterator type</td>
+
+      <td valign="top"><tt>X::iterator</tt></td>
+
+      <td valign="top">The type of iterator used to iterate through a
+      Collection's elements. The iterator's value type is expected to be the
+      Collection's value type. A conversion from the iterator type to the
+      const iterator type must exist. The iterator type must be an <a href=
+      "http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</a>.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Const iterator type</td>
+
+      <td valign="top"><tt>X::const_iterator</tt></td>
+
+      <td valign="top">A type of iterator that may be used to examine, but
+      not to modify, a Collection's elements.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Reference type</td>
+
+      <td valign="top"><tt>X::reference</tt></td>
+
+      <td valign="top">A type that behaves like a reference to the
+      Collection's value type. <a href="#n1">[1]</a></td>
+    </tr>
+
+    <tr>
+      <td valign="top">Const reference type</td>
+
+      <td valign="top"><tt>X::const_reference</tt></td>
+
+      <td valign="top">A type that behaves like a const reference to the
+      Collection's value type.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Pointer type</td>
+
+      <td valign="top"><tt>X::pointer</tt></td>
+
+      <td valign="top">A type that behaves as a pointer to the Collection's
+      value type.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Distance type</td>
+
+      <td valign="top"><tt>X::difference_type</tt></td>
+
+      <td valign="top">A signed integral type used to represent the distance
+      between two of the Collection's iterators. This type must be the same
+      as the iterator's distance type.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Size type</td>
+
+      <td valign="top"><tt>X::size_type</tt></td>
+
+      <td valign="top">An unsigned integral type that can represent any
+      nonnegative value of the Collection's distance type.</td>
+    </tr>
+  </table>
+
+  <h3>Notation</h3>
+
+  <table summary="">
+    <tr>
+      <td valign="top"><tt>X</tt></td>
+
+      <td valign="top">A type that is a model of Collection.</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>a</tt>, <tt>b</tt></td>
+
+      <td valign="top">Object of type <tt>X</tt>.</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>T</tt></td>
+
+      <td valign="top">The value type of <tt>X</tt>.</td>
+    </tr>
+  </table>
+
+  <h3>Valid expressions</h3>
+
+  <p>The following expressions must be valid.</p>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Return type</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Beginning of range</td>
+
+      <td valign="top"><tt>a.begin()</tt></td>
+
+      <td valign="top"><tt>iterator</tt> if <tt>a</tt> is mutable,
+      <tt>const_iterator</tt> otherwise</td>
+    </tr>
+
+    <tr>
+      <td valign="top">End of range</td>
+
+      <td valign="top"><tt>a.end()</tt></td>
+
+      <td valign="top"><tt>iterator</tt> if <tt>a</tt> is mutable,
+      <tt>const_iterator</tt> otherwise</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Size</td>
+
+      <td valign="top"><tt>a.size()</tt></td>
+
+      <td valign="top"><tt>size_type</tt></td>
+    </tr><!--
 <TR>
-<TH>
-Name
-</TH>
-<TH>
-Expression
-</TH>
-<TH>
-Return type
-</TH>
-</TR>
-<TR>
 <TD VAlign=top>
-Beginning of range
-</TD>
-<TD VAlign=top>
-<tt>a.begin()</tt>
-</TD>
-<TD VAlign=top>
-<tt>iterator</tt> if <tt>a</tt> is mutable, <tt>const_iterator</tt> otherwise
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-End of range
-</TD>
-<TD VAlign=top>
-<tt>a.end()</tt>
-</TD>
-<TD VAlign=top>
-<tt>iterator</tt> if <tt>a</tt> is mutable, <tt>const_iterator</tt> otherwise
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Size
-</TD>
-<TD VAlign=top>
-<tt>a.size()</tt>
-</TD>
-<TD VAlign=top>
-<tt>size_type</tt>
-</TD>
-</TR>
-<!--
-<TR>
-<TD VAlign=top>
 Maximum size
 </TD>
 <TD VAlign=top>
@@ -250,95 +196,74 @@
 <tt>size_type</tt>
 </TD>
 </TR>
-<TR>
 -->
-<TD VAlign=top>
-Empty Collection
-</TD>
-<TD VAlign=top>
-<tt>a.empty()</tt>
-</TD>
-<TD VAlign=top>
-Convertible to <tt>bool</tt>
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Swap
-</TD>
-<TD VAlign=top>
-<tt>a.swap(b)</tt>
-</TD>
-<TD VAlign=top>
-<tt>void</tt>
-</TD>
-</tr>
-</table>
-<h3>Expression semantics</h3>
 
-<Table border>
+    <tr>
+      <td valign="top">Empty Collection</td>
+
+      <td valign="top"><tt>a.empty()</tt></td>
+
+      <td valign="top">Convertible to <tt>bool</tt></td>
+    </tr>
+
+    <tr>
+      <td valign="top">Swap</td>
+
+      <td valign="top"><tt>a.swap(b)</tt></td>
+
+      <td valign="top"><tt>void</tt></td>
+    </tr>
+  </table>
+
+  <h3>Expression semantics</h3>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Semantics</th>
+
+      <th>Postcondition</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Beginning of range</td>
+
+      <td valign="top"><tt>a.begin()</tt></td>
+
+      <td valign="top">Returns an iterator pointing to the first element in
+      the Collection.</td>
+
+      <td valign="top"><tt>a.begin()</tt> is either dereferenceable or
+      past-the-end. It is past-the-end if and only if <tt>a.size() ==
+      0</tt>.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">End of range</td>
+
+      <td valign="top"><tt>a.end()</tt></td>
+
+      <td valign="top">Returns an iterator pointing one past the last element
+      in the Collection.</td>
+
+      <td valign="top"><tt>a.end()</tt> is past-the-end.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Size</td>
+
+      <td valign="top"><tt>a.size()</tt></td>
+
+      <td valign="top">Returns the size of the Collection, that is, its
+      number of elements.</td>
+
+      <td valign="top"><tt>a.size() &gt;= 0</tt></td>
+    </tr><!--
 <TR>
-<TH>
-Name
-</TH>
-<TH>
-Expression
-</TH>
-<TH>
-Semantics
-</TH>
-<TH>
-Postcondition
-</TH>
-</TR>
 <TD VAlign=top>
-<TR>
-<TD VAlign=top>
-Beginning of range
-</TD>
-<TD VAlign=top>
-<tt>a.begin()</tt>
-</TD>
-<TD VAlign=top>
-Returns an iterator pointing to the first element in the Collection.
-</TD>
-<TD VAlign=top>
-<tt>a.begin()</tt> is either dereferenceable or past-the-end.  It is
-   past-the-end if and only if <tt>a.size() == 0</tt>.
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-End of range
-</TD>
-<TD VAlign=top>
-<tt>a.end()</tt>
-</TD>
-<TD VAlign=top>
-Returns an iterator pointing one past the last element in the
-   Collection.
-</TD>
-<TD VAlign=top>
-<tt>a.end()</tt> is past-the-end.
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Size
-</TD>
-<TD VAlign=top>
-<tt>a.size()</tt>
-</TD>
-<TD VAlign=top>
-Returns the size of the Collection, that is, its number of elements.
-</TD>
-<TD VAlign=top>
-<tt>a.size() &gt;= 0 
-</TD>
-</TR>
-<!--
-<TR>
-<TD VAlign=top>
 Maximum size
 </TD>
 <TD VAlign=top>
@@ -355,294 +280,255 @@
 </TD>
 </TR>
  -->
-<TR>
-<TD VAlign=top>
-Empty Collection
-</TD>
-<TD VAlign=top>
-<tt>a.empty()</tt>
-</TD>
-<TD VAlign=top>
-Equivalent to <tt>a.size() == 0</tt>.  (But possibly faster.)
-</TD>
-<TD VAlign=top>
-&nbsp;
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Swap
-</TD>
-<TD VAlign=top>
-<tt>a.swap(b)</tt>
-</TD>
-<TD VAlign=top>
-Equivalent to <tt>swap(a,b)</tt>
-</TD>
-<TD VAlign=top>
-&nbsp;
-</TD>
-</tr>
-</table>
-<h3>Complexity guarantees</h3>
 
-<tt>begin()</tt> and <tt>end()</tt> are amortized constant time.
-<P>
-<tt>size()</tt> is at most linear in the Collection's
-size. <tt>empty()</tt> is amortized constant time.
-<P>
-<tt>swap()</tt> is at most linear in the size of the two collections.
-<h3>Invariants</h3>
-<Table border>
-<TR>
-<TD VAlign=top>
-Valid range
-</TD>
-<TD VAlign=top>
-For any Collection <tt>a</tt>, <tt>[a.begin(), a.end())</tt> is a valid
-   range.
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Range size
-</TD>
-<TD VAlign=top>
-<tt>a.size()</tt> is equal to the distance from <tt>a.begin()</tt> to <tt>a.end()</tt>.
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Completeness
-</TD>
-<TD VAlign=top>
-An algorithm that iterates through the range <tt>[a.begin(), a.end())</tt>
-   will pass through every element of <tt>a</tt>.
-</TD>
-</tr>
-</table>
+    <tr>
+      <td valign="top">Empty Collection</td>
 
+      <td valign="top"><tt>a.empty()</tt></td>
 
-<h3>Models</h3>
-<UL>
-<LI> <tt>array</tt>
-<LI> <tt>array_ptr</tt>
-<LI> <tt>vector&lt;bool&gt;</tt>
-</UL>
+      <td valign="top">Equivalent to <tt>a.size() == 0</tt>. (But possibly
+      faster.)</td>
 
+      <td valign="top">&nbsp;</td>
+    </tr>
 
-<h3>Collection Refinements</h3>
+    <tr>
+      <td valign="top">Swap</td>
 
-There are quite a few concepts that refine the Collection concept,
-similar to the concepts that refine the Container concept. Here
-is a brief overview of the refining concepts.
+      <td valign="top"><tt>a.swap(b)</tt></td>
 
-<h4>ForwardCollection</h4>
-The elements are arranged in some order that
-does not change spontaneously from one iteration to the next. As
-a result, a ForwardCollection is 
-<A
-href="http://www.sgi.com/tech/stl/EqualityComparable.html">EqualityComparable</A>
-and 
-<A
-href="http://www.sgi.com/tech/stl/LessThanComparable.html">LessThanComparable</A>.
-In addition, the iterator type of a ForwardCollection is a
-MultiPassInputIterator which is just an InputIterator with the added
-requirements that the iterator can be used to make multiple passes
-through a range, and that if <tt>it1 == it2</tt> and <tt>it1</tt> is
-dereferenceable then <tt>++it1 == ++it2</tt>. The ForwardCollection
-also has a <tt>front()</tt> method.
+      <td valign="top">Equivalent to <tt>swap(a,b)</tt></td>
 
-<p>
-<Table border>
-<TR>
-<TH>
-Name
-</TH>
-<TH>
-Expression
-</TH>
-<TH>
-Return type
-</TH>
-<TH>
-Semantics
-</TH>
-</TR>
+      <td valign="top">&nbsp;</td>
+    </tr>
+  </table>
 
-<TR>
-<TD VAlign=top>
-Front
-</TD>
-<TD VAlign=top>
-<tt>a.front()</tt>
-</TD>
-<TD VAlign=top>
-<tt>reference</tt> if <tt>a</tt> is mutable, <br> <tt>const_reference</tt>
-otherwise.
-</TD>
-<TD VAlign=top>
-Equivalent to <tt>*(a.begin())</tt>.
-</TD>
-</TR>
+  <h3>Complexity guarantees</h3>
 
-</table>
+  <p><tt>begin()</tt> and <tt>end()</tt> are amortized constant time.</p>
 
+  <p><tt>size()</tt> is at most linear in the Collection's size.
+  <tt>empty()</tt> is amortized constant time.</p>
 
-<h4>ReversibleCollection</h4>
+  <p><tt>swap()</tt> is at most linear in the size of the two
+  collections.</p>
 
-The container provides access to iterators that traverse in both
-directions (forward and reverse). The iterator type must meet all of
-the requirements of
-<a href="http://www.sgi.com/tech/stl/BidirectionalIterator.html">BidirectionalIterator</a>
-except that the reference type does not have to be a real C++
-reference. The ReversibleCollection adds the following requirements
-to those of ForwardCollection.
-<p>
+  <h3>Invariants</h3>
 
-<Table border>
-<TR>
-<TH>
-Name
-</TH>
-<TH>
-Expression
-</TH>
-<TH>
-Return type
-</TH>
-<TH>
-Semantics
-</TH>
-</TR>
-<TR>
-<TD VAlign=top>
-Beginning of range
-</TD>
-<TD VAlign=top>
-<tt>a.rbegin()</tt>
-</TD>
-<TD VAlign=top>
-<tt>reverse_iterator</tt> if <tt>a</tt> is mutable,
-<tt>const_reverse_iterator</tt> otherwise.
-</TD>
-<TD VAlign=top>
-Equivalent to <tt>X::reverse_iterator(a.end())</tt>.
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-End of range
-</TD>
-<TD VAlign=top>
-<tt>a.rend()</tt>
-</TD>
-<TD VAlign=top>
-<tt>reverse_iterator</tt> if <tt>a</tt> is mutable,
-<tt>const_reverse_iterator</tt> otherwise.
-</TD>
-<TD VAlign=top>
-Equivalent to <tt>X::reverse_iterator(a.begin())</tt>.
-</TD>
-</tr>
+  <table border summary="">
+    <tr>
+      <td valign="top">Valid range</td>
 
-<TR>
-<TD VAlign=top>
-Back
-</TD>
-<TD VAlign=top>
-<tt>a.back()</tt>
-</TD>
-<TD VAlign=top>
-<tt>reference</tt> if <tt>a</tt> is mutable, <br> <tt>const_reference</tt>
-otherwise.
-</TD>
-<TD VAlign=top>
-Equivalent to <tt>*(--a.end())</tt>.
-</TD>
-</TR>
+      <td valign="top">For any Collection <tt>a</tt>, <tt>[a.begin(),
+      a.end())</tt> is a valid range.</td>
+    </tr>
 
-</table>
+    <tr>
+      <td valign="top">Range size</td>
 
-<h4>SequentialCollection</h4>
+      <td valign="top"><tt>a.size()</tt> is equal to the distance from
+      <tt>a.begin()</tt> to <tt>a.end()</tt>.</td>
+    </tr>
 
-The elements are arranged in a strict linear order. No extra methods
-are required.
+    <tr>
+      <td valign="top">Completeness</td>
 
-<h4>RandomAccessCollection</h4>
+      <td valign="top">An algorithm that iterates through the range
+      <tt>[a.begin(), a.end())</tt> will pass through every element of
+      <tt>a</tt>.</td>
+    </tr>
+  </table>
 
-The iterators of a RandomAccessCollection satisfy all of the
-requirements of <a
-href="http://www.sgi.com/tech/stl/RandomAccessIterator.html">RandomAccessIterator</a>
-except that the reference type does not have to be a real C++
-reference. In addition, a RandomAccessCollection provides 
-an element access operator.
+  <h3>Models</h3>
 
-<p>
+  <ul>
+    <li><tt>array</tt></li>
 
-<Table border>
-<TR>
-<TH>
-Name
-</TH>
-<TH>
-Expression
-</TH>
-<TH>
-Return type
-</TH>
-<TH>
-Semantics
-</TH>
-</TR>
-<TR>
-<TD VAlign=top>
-Element Access
-</TD>
-<TD VAlign=top>
-<tt>a[n]</tt>
-</TD>
-<TD VAlign=top>
-<tt>reference</tt> if <tt>a</tt> is mutable,
-<tt>const_reference</tt> otherwise.
-</TD>
-<TD VAlign=top>
-Returns the nth element of the Collection.
-<tt>n</tt> must be convertible to <tt>size_type</tt>.
-Precondition: <tt>0 &lt;= n &lt; a.size()</tt>.
-</TD>
-</TR>
+    <li><tt>array_ptr</tt></li>
 
-</table>
+    <li><tt>vector&lt;bool&gt;</tt></li>
+  </ul>
 
-<h3>Notes</h3>
+  <h3>Collection Refinements</h3>
 
-<P><A name="1">[1]</A> 
+  <p>There are quite a few concepts that refine the Collection concept,
+  similar to the concepts that refine the Container concept. Here is a brief
+  overview of the refining concepts.</p>
 
-The reference type does not have to be a real C++ reference. The
-requirements of the reference type depend on the context within which
-the Collection is being used. Specifically it depends on the
-requirements the context places on the value type of the Collection.
-The reference type of the Collection must meet the same requirements
-as the value type. In addition, the reference objects must be
-equivalent to the value type objects in the collection (which is
-trivially true if they are the same object).  Also, in a mutable
-Collection, an assignment to the reference object must result in an
-assignment to the object in the Collection (again, which is trivially
-true if they are the same object, but non-trivial if the reference
-type is a proxy class).
+  <h4>ForwardCollection</h4>
 
-<h3>See also</h3>
-<A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
+  <p>The elements are arranged in some order that does not change
+  spontaneously from one iteration to the next. As a result, a
+  ForwardCollection is <a href=
+  "http://www.sgi.com/tech/stl/EqualityComparable.html">EqualityComparable</a>
+  and <a href=
+  "http://www.sgi.com/tech/stl/LessThanComparable.html">LessThanComparable</a>.
+  In addition, the iterator type of a ForwardCollection is a
+  MultiPassInputIterator which is just an InputIterator with the added
+  requirements that the iterator can be used to make multiple passes through
+  a range, and that if <tt>it1 == it2</tt> and <tt>it1</tt> is
+  dereferenceable then <tt>++it1 == ++it2</tt>. The ForwardCollection also
+  has a <tt>front()</tt> method.</p>
 
+  <table border summary="">
+    <tr>
+      <th>Name</th>
 
-<br>
-<HR>
-<TABLE>
-<TR valign=top>
-<TD nowrap>Copyright &copy 2000</TD><TD>
-<A HREF=http://www.boost.org/people/jeremy_siek.htm>Jeremy Siek</A>, Univ.of Notre Dame and C++ Library & Compiler Group/SGI (<A HREF="mailto:jsiek at engr.sgi.com">jsiek at engr.sgi.com</A>)
-</TD></TR></TABLE>
+      <th>Expression</th>
 
-</BODY>
-</HTML> 
+      <th>Return type</th>
+
+      <th>Semantics</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Front</td>
+
+      <td valign="top"><tt>a.front()</tt></td>
+
+      <td valign="top"><tt>reference</tt> if <tt>a</tt> is mutable,<br>
+      <tt>const_reference</tt> otherwise.</td>
+
+      <td valign="top">Equivalent to <tt>*(a.begin())</tt>.</td>
+    </tr>
+  </table>
+
+  <h4>ReversibleCollection</h4>
+
+  <p>The container provides access to iterators that traverse in both
+  directions (forward and reverse). The iterator type must meet all of the
+  requirements of <a href=
+  "http://www.sgi.com/tech/stl/BidirectionalIterator.html">BidirectionalIterator</a>
+  except that the reference type does not have to be a real C++ reference.
+  The ReversibleCollection adds the following requirements to those of
+  ForwardCollection.</p>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Return type</th>
+
+      <th>Semantics</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Beginning of range</td>
+
+      <td valign="top"><tt>a.rbegin()</tt></td>
+
+      <td valign="top"><tt>reverse_iterator</tt> if <tt>a</tt> is mutable,
+      <tt>const_reverse_iterator</tt> otherwise.</td>
+
+      <td valign="top">Equivalent to
+      <tt>X::reverse_iterator(a.end())</tt>.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">End of range</td>
+
+      <td valign="top"><tt>a.rend()</tt></td>
+
+      <td valign="top"><tt>reverse_iterator</tt> if <tt>a</tt> is mutable,
+      <tt>const_reverse_iterator</tt> otherwise.</td>
+
+      <td valign="top">Equivalent to
+      <tt>X::reverse_iterator(a.begin())</tt>.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Back</td>
+
+      <td valign="top"><tt>a.back()</tt></td>
+
+      <td valign="top"><tt>reference</tt> if <tt>a</tt> is mutable,<br>
+      <tt>const_reference</tt> otherwise.</td>
+
+      <td valign="top">Equivalent to <tt>*(--a.end())</tt>.</td>
+    </tr>
+  </table>
+
+  <h4>SequentialCollection</h4>
+
+  <p>The elements are arranged in a strict linear order. No extra methods are
+  required.</p>
+
+  <h4>RandomAccessCollection</h4>
+
+  <p>The iterators of a RandomAccessCollection satisfy all of the
+  requirements of <a href=
+  "http://www.sgi.com/tech/stl/RandomAccessIterator.html">RandomAccessIterator</a>
+  except that the reference type does not have to be a real C++ reference. In
+  addition, a RandomAccessCollection provides an element access operator.</p>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Return type</th>
+
+      <th>Semantics</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Element Access</td>
+
+      <td valign="top"><tt>a[n]</tt></td>
+
+      <td valign="top"><tt>reference</tt> if <tt>a</tt> is mutable,
+      <tt>const_reference</tt> otherwise.</td>
+
+      <td valign="top">Returns the nth element of the Collection. <tt>n</tt>
+      must be convertible to <tt>size_type</tt>. Precondition: <tt>0 &lt;= n
+      &lt; a.size()</tt>.</td>
+    </tr>
+  </table>
+
+  <h3>Notes</h3>
+
+  <p><a name="n1" id="n1">[1]</a> The reference type does not have to be a
+  real C++ reference. The requirements of the reference type depend on the
+  context within which the Collection is being used. Specifically it depends
+  on the requirements the context places on the value type of the Collection.
+  The reference type of the Collection must meet the same requirements as the
+  value type. In addition, the reference objects must be equivalent to the
+  value type objects in the collection (which is trivially true if they are
+  the same object). Also, in a mutable Collection, an assignment to the
+  reference object must result in an assignment to the object in the
+  Collection (again, which is trivially true if they are the same object, but
+  non-trivial if the reference type is a proxy class).</p>
+
+  <h3>See also</h3>
+
+  <p><a href=
+  "http://www.sgi.com/tech/stl/Container.html">Container</a><br></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <table summary="">
+    <tr valign="top">
+      <td nowrap><i>Copyright &copy; 2000</i></td>
+
+      <td><i><a href="http://www.boost.org/people/jeremy_siek.htm">Jeremy
+      Siek</a>, Univ.of Notre Dame and C++ Library &amp; Compiler Group/SGI
+      (<a href="mailto:jsiek at engr.sgi.com">jsiek at engr.sgi.com</a>)</i></td>
+    </tr>
+  </table>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/utility/CopyConstructible.html
===================================================================
--- boost/trunk/libs/utility/CopyConstructible.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/CopyConstructible.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,178 +1,139 @@
-<HTML>
-<!--
-  -- Copyright (c) Jeremy Siek 2000
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
-<Head>
-<Title>Copy Constructible</Title>
-</HEAD>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
-        ALINK="#ff0000"> 
-<IMG SRC="../../boost.png" 
-     ALT="C++ Boost" width="277" height="86"> 
-<!--end header-->
-<BR Clear>
-<H1>Copy Constructible</H1>
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
-<h3>Description</h3>
-A type is Copy Constructible if it is possible to copy objects of that
-type.
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<h3>Notation</h3>
-<Table>
-<TR>
-<TD VAlign=top>
-<tt>T</tt>
-</TD>
-<TD VAlign=top>
-is type that is a model of Copy Constructible
-</TD>
-</TR>
+  <title>Copy Constructible</title>
+</head>
 
-<TR>
-<TD VAlign=top>
-<tt>t</tt>
-</TD>
-<TD VAlign=top>
-is an object of type <tt>T</tt>
-</TD>
-</tr>
+<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
+"#FF0000">
+  <img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br clear="none">
 
-<TR>
-<TD VAlign=top>
-<tt>u</tt>
-</TD>
-<TD VAlign=top>
-is an object of type <tt>const T</tt>
-</TD>
-</tr>
+  <h1>Copy Constructible</h1>
 
-</table>
-<h3>Definitions</h3>
-<h3>Valid expressions</h3>
-<Table border>
-<TR>
-<TH>
-Name
-</TH>
-<TH>
-Expression
-</TH>
-<TH>
-Return type
-</TH>
-<TH>
-Semantics
-</TH>
-</TR>
-<TR>
-<TD VAlign=top>
-Copy constructor
-</TD>
-<TD VAlign=top>
-<tt>T(t)</tt>
-</TD>
-<TD VAlign=top>
-<tt>T</tt>
-</TD>
-<TD VAlign=top>
-<tt>t</tt> is equivalent to <tt>T(t)</tt>
-</TD>
-</TR>
+  <h3>Description</h3>
 
+  <p>A type is Copy Constructible if it is possible to copy objects of that
+  type.</p>
 
-<TR>
-<TD VAlign=top>
-Copy constructor
-</TD>
-<TD VAlign=top>
-<pre>
+  <h3>Notation</h3>
+
+  <table summary="">
+    <tr>
+      <td valign="top"><tt>T</tt></td>
+
+      <td valign="top">is type that is a model of Copy Constructible</td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>t</tt></td>
+
+      <td valign="top">is an object of type <tt>T</tt></td>
+    </tr>
+
+    <tr>
+      <td valign="top"><tt>u</tt></td>
+
+      <td valign="top">is an object of type <tt>const T</tt></td>
+    </tr>
+  </table>
+
+  <h3>Definitions</h3>
+
+  <h3>Valid expressions</h3>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Return type</th>
+
+      <th>Semantics</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Copy constructor</td>
+
+      <td valign="top"><tt>T(t)</tt></td>
+
+      <td valign="top"><tt>T</tt></td>
+
+      <td valign="top"><tt>t</tt> is equivalent to <tt>T(t)</tt></td>
+    </tr>
+
+    <tr>
+      <td valign="top">Copy constructor</td>
+
+      <td valign="top">
+        <pre>
 T(u)
 </pre>
-</TD>
-<TD VAlign=top>
-<tt>T</tt>
-</TD>
-<TD VAlign=top>
-<tt>u</tt> is equivalent to <tt>T(u)</tt>
-</TD>
-</TR>
+      </td>
 
+      <td valign="top"><tt>T</tt></td>
 
-<TR>
-<TD VAlign=top>
-Destructor
-</TD>
-<TD VAlign=top>
-<pre>
+      <td valign="top"><tt>u</tt> is equivalent to <tt>T(u)</tt></td>
+    </tr>
+
+    <tr>
+      <td valign="top">Destructor</td>
+
+      <td valign="top">
+        <pre>
 t.~T()
 </pre>
-</TD>
-<TD VAlign=top>
-<tt>T</tt>
-</TD>
-<TD VAlign=top>
-&nbsp;
-</TD>
-</TR>
+      </td>
 
-<TR>
-<TD VAlign=top>
-Address Operator
-</TD>
-<TD VAlign=top>
-<pre>
+      <td valign="top"><tt>T</tt></td>
+
+      <td valign="top">&nbsp;</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Address Operator</td>
+
+      <td valign="top">
+        <pre>
 &amp;t
 </pre>
-</TD>
-<TD VAlign=top>
-<tt>T*</tt>
-</TD>
-<TD VAlign=top>
-denotes the address of <tt>t</tt>
-</TD>
-</TR>
+      </td>
 
-<TR>
-<TD VAlign=top>
-Address Operator
-</TD>
-<TD VAlign=top>
-<pre>
-&amp;u
-</pre>
-</TD>
-<TD VAlign=top>
-<tt>T*</tt>
-</TD>
-<TD VAlign=top>
-denotes the address of <tt>u</tt>
-</TD>
-</TR>
+      <td valign="top"><tt>T*</tt></td>
 
+      <td valign="top">denotes the address of <tt>t</tt></td>
+    </tr>
 
+    <tr>
+      <td valign="top">Address Operator</td>
 
-</table>
+      <td valign="top">
+        <pre>
+&amp;u
+</pre>
+      </td>
 
+      <td valign="top"><tt>T*</tt></td>
 
-</table>
-<h3>Models</h3>
+      <td valign="top">denotes the address of <tt>u</tt></td>
+    </tr>
+  </table>
 
-<UL>
-<LI><tt>int</tt>
-<LI><tt>std::pair</tt>
-</UL>
+  <h3>Models</h3>
 
-<h3>Concept Checking Class</h3>
+  <ul>
+    <li><tt>int</tt></li>
 
-<pre>
+    <li><tt>std::pair</tt></li>
+  </ul>
+
+  <h3>Concept Checking Class</h3>
+  <pre>
   template &lt;class T&gt;
   struct CopyConstructibleConcept
   {
@@ -192,19 +153,33 @@
   };
 </pre>
 
-<h3>See also</h3>
-<A
-href="http://www.sgi.com/tech/stl/DefaultConstructible.html">Default Constructible</A>
-and 
-<A hrefa="./Assignable.html">Assignable</A>
+  <h3>See also</h3>
 
-<br>
-<HR>
-<TABLE>
-<TR valign=top>
-<TD nowrap>Copyright &copy 2000</TD><TD>
-<A HREF=http://www.lsc.nd.edu/~jsiek>Jeremy Siek</A>, Univ.of Notre Dame (<A HREF="mailto:jsiek at lsc.nd.edu">jsiek at lsc.nd.edu</A>)
-</TD></TR></TABLE>
+  <p><a href="http://www.sgi.com/tech/stl/DefaultConstructible.html">Default
+  Constructible</a> and <a href="./Assignable.html">Assignable</a><br></p>
+  <hr>
 
-</BODY>
-</HTML> 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <table summary="">
+    <tr valign="top">
+      <td nowrap><i>Copyright &copy; 2000</i></td>
+
+      <td><i><a href="http://www.lsc.nd.edu/~jsiek">Jeremy Siek</a>, Univ.of
+      Notre Dame (<a href=
+      "mailto:jsiek at lsc.nd.edu">jsiek at lsc.nd.edu</a>)</i></td>
+    </tr>
+  </table>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/utility/LessThanComparable.html
===================================================================
--- boost/trunk/libs/utility/LessThanComparable.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/LessThanComparable.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,212 +1,210 @@
-<HTML>
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
+<html>
 <!--
-  -- Copyright (c) Jeremy Siek 2000
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
+  == Copyright (c) 1996-1999
+  == Silicon Graphics Computer Systems, Inc.
+  ==
+  == Permission to use, copy, modify, distribute and sell this software
+  == and its documentation for any purpose is hereby granted without fee,
+  == provided that the above copyright notice appears in all copies and
+  == that both that copyright notice and this permission notice appear
+  == in supporting documentation.  Silicon Graphics makes no
+  == representations about the suitability of this software for any
+  == purpose.  It is provided "as is" without express or implied warranty.
+  ==
+  == Copyright (c) 1994
+  == Hewlett-Packard Company
+  ==
+  == Permission to use, copy, modify, distribute and sell this software
+  == and its documentation for any purpose is hereby granted without fee,
+  == provided that the above copyright notice appears in all copies and
+  == that both that copyright notice and this permission notice appear
+  == in supporting documentation.  Hewlett-Packard Company makes no
+  == representations about the suitability of this software for any
+  == purpose.  It is provided "as is" without express or implied warranty.
+  ==
   -->
-<!--
-  -- Copyright (c) 1996-1999
-  -- Silicon Graphics Computer Systems, Inc.
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  --
-  -- Copyright (c) 1994
-  -- Hewlett-Packard Company
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Hewlett-Packard Company makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  --
-  -->
-<Head>
-<Title>LessThanComparable</Title>
-</Head>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
-        ALINK="#ff0000"> 
-<IMG SRC="../../boost.png" 
-     ALT="C++ Boost" width="277" height="86"> 
-<!--end header-->
-<BR Clear>
-<H1>LessThanComparable</H1>
 
-<h3>Description</h3>
-A type is LessThanComparable if it is ordered: it must
-be possible to compare two objects of that type using <tt>operator&lt;</tt>, and
-<tt>operator&lt;</tt> must be a strict weak ordering relation.
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
+  <title>LessThanComparable</title>
+</head>
 
-<h3>Refinement of</h3>
-<h3>Associated types</h3>
-<h3>Notation</h3>
-<Table>
-<TR>
-<TD VAlign=top>
-<tt>X</tt>
-</TD>
-<TD VAlign=top>
-A type that is a model of LessThanComparable
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-<tt>x</tt>, <tt>y</tt>, <tt>z</tt>
-</TD>
-<TD VAlign=top>
-Object of type <tt>X</tt>
-</TD>
-</tr>
-</table>
-<h3>Definitions</h3>
-Consider the relation <tt>!(x &lt; y) &amp;&amp; !(y &lt; x)</tt>.  If this relation is
-transitive (that is, if <tt>!(x &lt; y) &amp;&amp; !(y &lt; x) &amp;&amp; !(y &lt; z) &amp;&amp; !(z &lt; y)</tt>
-implies <tt>!(x &lt; z) &amp;&amp; !(z &lt; x)</tt>), then it satisfies the mathematical
-definition of an equivalence relation.  In this case, <tt>operator&lt;</tt>
-is a <i>strict weak ordering</i>.
-<P>
-If <tt>operator&lt;</tt> is a strict weak ordering, and if each equivalence class
-has only a single element, then <tt>operator&lt;</tt> is a <i>total ordering</i>.
-<h3>Valid expressions</h3>
-<Table border>
-<TR>
-<TH>
-Name
-</TH>
-<TH>
-Expression
-</TH>
-<TH>
-Type requirements
-</TH>
-<TH>
-Return type
-</TH>
-</TR>
-<TR>
-<TD VAlign=top>
-Less
-</TD>
-<TD VAlign=top>
-<tt>x &lt; y</tt>
-</TD>
-<TD VAlign=top>
-&nbsp;
-</TD>
-<TD VAlign=top>
-Convertible to <tt>bool</tt>
-</TD>
-</TR>
-</table>
+<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
+"#FF0000">
+  <img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br clear="none">
 
+  <h1>LessThanComparable</h1>
 
+  <h3>Description</h3>
 
-<h3>Expression semantics</h3>
-<Table border>
-<TR>
-<TH>
-Name
-</TH>
-<TH>
-Expression
-</TH>
-<TH>
-Precondition
-</TH>
-<TH>
-Semantics
-</TH>
-<TH>
-Postcondition
-</TH>
-</TR>
-<TR>
-<TD VAlign=top>
-Less
-</TD>
-<TD VAlign=top>
-<tt>x &lt; y</tt>
-</TD>
-<TD VAlign=top>
-<tt>x</tt> and <tt>y</tt> are in the domain of <tt>&lt;</tt>
-</TD>
-<TD VAlign=top>
-&nbsp;
-</TD>
-</table>
+  <p>A type is LessThanComparable if it is ordered: it must be possible to
+  compare two objects of that type using <tt>operator&lt;</tt>, and
+  <tt>operator&lt;</tt> must be a strict weak ordering relation.</p>
 
+  <h3>Refinement of</h3>
 
-<h3>Complexity guarantees</h3>
-<h3>Invariants</h3>
-<Table border>
-<TR>
-<TD VAlign=top>
-Irreflexivity
-</TD>
-<TD VAlign=top>
-<tt>x &lt; x</tt> must be false.
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Antisymmetry
-</TD>
-<TD VAlign=top>
-<tt>x &lt; y</tt> implies !(y &lt; x) <A href="#2">[2]</A>
-</TD>
-</TR>
-<TR>
-<TD VAlign=top>
-Transitivity
-</TD>
-<TD VAlign=top>
-<tt>x &lt; y</tt> and <tt>y &lt; z</tt> implies <tt>x &lt; z</tt> <A href="#3">[3]</A>
-</TD>
-</tr>
-</table>
-<h3>Models</h3>
-<UL>
-<LI>
-int
-</UL>
-<h3>Notes</h3>
-<P><A name="1">[1]</A>
-Only <tt>operator&lt;</tt> is fundamental; the other inequality operators
-are essentially syntactic sugar.
-<P><A name="2">[2]</A>
-Antisymmetry is a theorem, not an axiom: it follows from
-irreflexivity and transitivity.
-<P><A name="3">[3]</A>
-Because of irreflexivity and transitivity, <tt>operator&lt;</tt> always
-satisfies the definition of a <i>partial ordering</i>.  The definition of
-a <i>strict weak ordering</i> is stricter, and the definition of a
-<i>total ordering</i> is stricter still.
-<h3>See also</h3>
-<A href="http://www.sgi.com/tech/stl/EqualityComparable.html">EqualityComparable</A>, <A href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">StrictWeakOrdering</A>
+  <h3>Associated types</h3>
 
+  <h3>Notation</h3>
 
+  <table summary="">
+    <tr>
+      <td valign="top"><tt>X</tt></td>
 
-<br>
-<HR>
-<TABLE>
-<TR valign=top>
-<TD nowrap>Copyright &copy 2000</TD><TD>
-<A HREF=http://www.lsc.nd.edu/~jsiek>Jeremy Siek</A>, Univ.of Notre Dame (<A HREF="mailto:jsiek at lsc.nd.edu">jsiek at lsc.nd.edu</A>)
-</TD></TR></TABLE>
+      <td valign="top">A type that is a model of LessThanComparable</td>
+    </tr>
 
-</BODY>
-</HTML> 
+    <tr>
+      <td valign="top"><tt>x</tt>, <tt>y</tt>, <tt>z</tt></td>
+
+      <td valign="top">Object of type <tt>X</tt></td>
+    </tr>
+  </table>
+
+  <h3>Definitions</h3>
+
+  <p>Consider the relation <tt>!(x &lt; y) &amp;&amp; !(y &lt; x)</tt>. If
+  this relation is transitive (that is, if <tt>!(x &lt; y) &amp;&amp; !(y
+  &lt; x) &amp;&amp; !(y &lt; z) &amp;&amp; !(z &lt; y)</tt> implies <tt>!(x
+  &lt; z) &amp;&amp; !(z &lt; x)</tt>), then it satisfies the mathematical
+  definition of an equivalence relation. In this case, <tt>operator&lt;</tt>
+  is a <i>strict weak ordering</i>.</p>
+
+  <p>If <tt>operator&lt;</tt> is a strict weak ordering, and if each
+  equivalence class has only a single element, then <tt>operator&lt;</tt> is
+  a <i>total ordering</i>.</p>
+
+  <h3>Valid expressions</h3>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Type requirements</th>
+
+      <th>Return type</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Less</td>
+
+      <td valign="top"><tt>x &lt; y</tt></td>
+
+      <td valign="top">&nbsp;</td>
+
+      <td valign="top">Convertible to <tt>bool</tt></td>
+    </tr>
+  </table>
+
+  <h3>Expression semantics</h3>
+
+  <table border summary="">
+    <tr>
+      <th>Name</th>
+
+      <th>Expression</th>
+
+      <th>Precondition</th>
+
+      <th>Semantics</th>
+
+      <th>Postcondition</th>
+    </tr>
+
+    <tr>
+      <td valign="top">Less</td>
+
+      <td valign="top"><tt>x &lt; y</tt></td>
+
+      <td valign="top"><tt>x</tt> and <tt>y</tt> are in the domain of
+      <tt>&lt;</tt></td>
+
+      <td valign="top">&nbsp;</td>
+    </tr>
+  </table>
+
+  <h3>Complexity guarantees</h3>
+
+  <h3>Invariants</h3>
+
+  <table border summary="">
+    <tr>
+      <td valign="top">Irreflexivity</td>
+
+      <td valign="top"><tt>x &lt; x</tt> must be false.</td>
+    </tr>
+
+    <tr>
+      <td valign="top">Antisymmetry</td>
+
+      <td valign="top"><tt>x &lt; y</tt> implies !(y &lt; x) <a href=
+      "#n2">[2]</a></td>
+    </tr>
+
+    <tr>
+      <td valign="top">Transitivity</td>
+
+      <td valign="top"><tt>x &lt; y</tt> and <tt>y &lt; z</tt> implies <tt>x
+      &lt; z</tt> <a href="#n3">[3]</a></td>
+    </tr>
+  </table>
+
+  <h3>Models</h3>
+
+  <ul>
+    <li>int</li>
+  </ul>
+
+  <h3>Notes</h3>
+
+  <p><a name="n1" id="n1">[1]</a> Only <tt>operator&lt;</tt> is fundamental;
+  the other inequality operators are essentially syntactic sugar.</p>
+
+  <p><a name="n2" id="n2">[2]</a> Antisymmetry is a theorem, not an axiom: it
+  follows from irreflexivity and transitivity.</p>
+
+  <p><a name="n3" id="n3">[3]</a> Because of irreflexivity and transitivity,
+  <tt>operator&lt;</tt> always satisfies the definition of a <i>partial
+  ordering</i>. The definition of a <i>strict weak ordering</i> is stricter,
+  and the definition of a <i>total ordering</i> is stricter still.</p>
+
+  <h3>See also</h3>
+
+  <p><a href=
+  "http://www.sgi.com/tech/stl/EqualityComparable.html">EqualityComparable</a>,
+  <a href=
+  "http://www.sgi.com/tech/stl/StrictWeakOrdering.html">StrictWeakOrdering</a><br>
+  </p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <table summary="">
+    <tr valign="top">
+      <td nowrap><i>Copyright &copy; 2000</i></td>
+
+      <td><i><a href="http://www.lsc.nd.edu/~jsiek">Jeremy Siek</a>, Univ.of
+      Notre Dame (<a href=
+      "mailto:jsiek at lsc.nd.edu">jsiek at lsc.nd.edu</a>)</i></td>
+    </tr>
+  </table>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/utility/MultiPassInputIterator.html
===================================================================
--- boost/trunk/libs/utility/MultiPassInputIterator.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/MultiPassInputIterator.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,92 +1,95 @@
-<HTML>
-<!--
-  -- Copyright (c) Jeremy Siek 2000
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
-<Head>
-<Title>MultiPassInputIterator</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
-	ALINK="#ff0000"> 
-<IMG SRC="../../boost.png" 
-     ALT="C++ Boost" width="277" height="86"> 
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
-<BR Clear>
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-<H2>
-<A NAME="concept:MultiPassInputIterator"></A>
-Multi-Pass Input Iterator
-</H2>
+  <title>MultiPassInputIterator</title>
+</head>
 
-This concept is a refinement of <a
-href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
-adding the requirements that the iterator can be used to make multiple
-passes through a range, and that if <TT>it1 == it2</TT> and
-<TT>it1</TT> is dereferenceable then <TT>++it1 == ++it2</TT>. The
-Multi-Pass Input Iterator is very similar to the <a
-href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>. The
-only difference is that a <a
-href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>
-requires the <TT>reference</TT> type to be <TT>value_type&amp;</TT>, whereas
-MultiPassInputIterator is like <a
-href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>
-in that the <TT>reference</TT> type merely has to be convertible to
-<TT>value_type</TT>.
+<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
+"#FF0000">
+  <img src="../../boost.png" alt="C++ Boost" width="277" height=
+  "86"><br clear="none">
 
+  <h2><a name="concept:MultiPassInputIterator" id=
+  "concept:MultiPassInputIterator"></a> Multi-Pass Input Iterator</h2>
 
-<h3>Design Notes</h3>
+  <p>This concept is a refinement of <a href=
+  "http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>, adding
+  the requirements that the iterator can be used to make multiple passes
+  through a range, and that if <tt>it1 == it2</tt> and <tt>it1</tt> is
+  dereferenceable then <tt>++it1 == ++it2</tt>. The Multi-Pass Input Iterator
+  is very similar to the <a href=
+  "http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>.
+  The only difference is that a <a href=
+  "http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>
+  requires the <tt>reference</tt> type to be <tt>value_type&amp;</tt>,
+  whereas MultiPassInputIterator is like <a href=
+  "http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a> in that
+  the <tt>reference</tt> type merely has to be convertible to
+  <tt>value_type</tt>.</p>
 
-comments by Valentin Bonnard:
+  <h3>Design Notes</h3>
 
-<p> I think that introducing Multi-Pass Input Iterator isn't the right
-solution. Do you also want to define Multi-Pass Bidirectionnal Iterator
-and Multi-Pass Random Access Iterator ? I don't, definitly. It only
-confuses the issue. The problem lies into the existing hierarchy of
-iterators, which mixes movabillity, modifiabillity and lvalue-ness,
-and these are clearly independant.
+  <p>comments by Valentin Bonnard:</p>
 
-<p> The terms Forward, Bidirectionnal and Random Access are about
-movabillity and shouldn't be used to mean anything else.  In a
-completly orthogonal way, iterators can be immutable, mutable, or
-neither.  Lvalueness of iterators is also orthogonal with
-immutabillity.  With these clean concepts, your Multi-Pass Input Iterator
-is just called a Forward Iterator.
+  <p>I think that introducing Multi-Pass Input Iterator isn't the right
+  solution. Do you also want to define Multi-Pass Bidirectionnal Iterator and
+  Multi-Pass Random Access Iterator ? I don't, definitly. It only confuses
+  the issue. The problem lies into the existing hierarchy of iterators, which
+  mixes movabillity, modifiabillity and lvalue-ness, and these are clearly
+  independant.</p>
 
-<p>                
-Other translations are:<br>
-std::Forward Iterator -> ForwardIterator & Lvalue Iterator<br>
-std::Bidirectionnal Iterator -> Bidirectionnal Iterator & Lvalue Iterator<br>
-std::Random Access Iterator -> Random Access Iterator & Lvalue Iterator<br>
+  <p>The terms Forward, Bidirectionnal and Random Access are about
+  movabillity and shouldn't be used to mean anything else. In a completly
+  orthogonal way, iterators can be immutable, mutable, or neither. Lvalueness
+  of iterators is also orthogonal with immutabillity. With these clean
+  concepts, your Multi-Pass Input Iterator is just called a Forward
+  Iterator.</p>
 
-<p>
-Note that in practice the only operation not allowed on my 
-Forward Iterator which is allowed on std::Forward Iterator is 
-<tt>&*it</tt>. I think that <tt>&*</tt> is rarely needed in generic code.
+  <p>Other translations are:<br>
+  std::Forward Iterator -&gt; ForwardIterator &amp; Lvalue Iterator<br>
+  std::Bidirectionnal Iterator -&gt; Bidirectionnal Iterator &amp; Lvalue
+  Iterator<br>
+  std::Random Access Iterator -&gt; Random Access Iterator &amp; Lvalue
+  Iterator<br></p>
 
-<p>
-reply by Jeremy Siek:
+  <p>Note that in practice the only operation not allowed on my Forward
+  Iterator which is allowed on std::Forward Iterator is <tt>&amp;*it</tt>. I
+  think that <tt>&amp;*</tt> is rarely needed in generic code.</p>
 
-<p>
-The above analysis by Valentin is right on. Of course, there is
-the problem with backward compatibility. The current STL implementations
-are based on the old definition of Forward Iterator. The right course
-of action is to get Forward Iterator, etc. changed in the C++ standard.
-Once that is done we can drop Multi-Pass Input Iterator.
+  <p>reply by Jeremy Siek:</p>
 
+  <p>The above analysis by Valentin is right on. Of course, there is the
+  problem with backward compatibility. The current STL implementations are
+  based on the old definition of Forward Iterator. The right course of action
+  is to get Forward Iterator, etc. changed in the C++ standard. Once that is
+  done we can drop Multi-Pass Input Iterator.<br></p>
+  <hr>
 
-<br>
-<HR>
-<TABLE>
-<TR valign=top>
-<TD nowrap>Copyright &copy 2000</TD><TD>
-<a HREF="../../people/jeremy_siek.htm">Jeremy Siek</a>, Univ.of Notre Dame (<A HREF="mailto:jsiek at lsc.nd.edu">jsiek at lsc.nd.edu</A>)
-</TD></TR></TABLE>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-</BODY>
-</HTML> 
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <table summary="">
+    <tr valign="top">
+      <td nowrap><i>Copyright &copy; 2000</i></td>
+
+      <td><i><a href="http://www.lsc.nd.edu/~jsiek">Jeremy Siek</a>, Univ.of
+      Notre Dame (<a href=
+      "mailto:jsiek at lsc.nd.edu">jsiek at lsc.nd.edu</a>)</i></td>
+    </tr>
+  </table>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/libs/utility/assert.html
===================================================================
--- boost/trunk/libs/utility/assert.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/assert.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -48,9 +48,8 @@
 			can be included multiple times in a single translation unit. <STRONG>BOOST_ASSERT</STRONG>
 			will be redefined each time as specified above.</P>
 		<p><br>
-			<small>Copyright © 2002 by Peter Dimov. Permission to copy, use, modify, sell and 
-				distribute this document is granted provided this copyright notice appears in 
-				all copies. This document is provided "as is" without express or implied 
-				warranty, and with no claim as to its suitability for any purpose.</small></p>
+			<small>Copyright © 2002 by Peter Dimov. Distributed under the Boost Software License, Version 
+				1.0. See accompanying file <A href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</A> or 
+				copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>.</small></p>
 	</body>
 </html>

Modified: boost/trunk/libs/utility/call_traits.htm
===================================================================
--- boost/trunk/libs/utility/call_traits.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/call_traits.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -606,7 +606,7 @@
 struct filler
 {
    template &lt;typename I, typename T&gt;
-   static void do_fill(I first, I last, typename boost::call_traits&lt;T&gt;::param_type val);
+   static void do_fill(I first, I last, typename boost::call_traits&lt;T&gt;::param_type val)
    {
       while(first != last)
       {
@@ -762,3 +762,4 @@
 <p>&nbsp;</p>
 </body>
 </html>
+

Modified: boost/trunk/libs/utility/checked_delete.html
===================================================================
--- boost/trunk/libs/utility/checked_delete.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/checked_delete.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -115,9 +115,8 @@
 		</p>
 		<p>
 			<br>
-			<small>Copyright © 2002 by Peter Dimov. Permission to copy, use, modify, sell and 
-				distribute this document is granted provided this copyright notice appears in 
-				all copies. This document is provided "as is" without express or implied 
-				warranty, and with no claim as to its suitability for any purpose.</small></p>
+			<small>Copyright © 2002 by Peter Dimov. Distributed under the Boost Software License, Version 
+				1.0. See accompanying file <A href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</A> or 
+				copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>.</small></p>
 	</body>
 </html>

Modified: boost/trunk/libs/utility/current_function.html
===================================================================
--- boost/trunk/libs/utility/current_function.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/current_function.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -29,9 +29,8 @@
 			function. On such compilers, the string literal has an unspecified value.</p>
 		<p>
 			<br>
-			<small>Copyright © 2002 by Peter Dimov. Permission to copy, use, modify, sell and 
-				distribute this document is granted provided this copyright notice appears in 
-				all copies. This document is provided "as is" without express or implied 
-				warranty, and with no claim as to its suitability for any purpose.</small></p>
+			<small>Copyright © 2002 by Peter Dimov. Distributed under the Boost Software License, Version 
+				1.0. See accompanying file <A href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</A> or 
+				copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>.</small></p>
 	</body>
 </html>

Deleted: boost/trunk/libs/utility/enable_if/test/Jamfile
===================================================================
--- boost/trunk/libs/utility/enable_if/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/enable_if/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,33 +0,0 @@
-# Copyright David Abrahams 2003.
-# Distributed under the Boost Software License, Version 1.0. 
-# (See accompanying file LICENSE_1_0.txt or copy at 
-# http://www.boost.org/LICENSE_1_0.txt)
-
-# For more information, see http://www.boost.org/
-
-subproject libs/utility/enable_if/test ;
-
-# bring in rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-    local test_monitor = <lib>@boost/libs/test/build/boost_test_exec_monitor ;
-
-    # look in BOOST_ROOT for sources first, just in this Jamfile
-    local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-
-    test-suite utility/enable_if
-        :
-        [ run libs/utility/enable_if/test/constructors.cpp $(test_monitor) ]
-        [ run libs/utility/enable_if/test/dummy_arg_disambiguation.cpp $(test_monitor) ]
-        [ run libs/utility/enable_if/test/lazy.cpp $(test_monitor) ]
-        [ run libs/utility/enable_if/test/lazy_test.cpp $(test_monitor) ]
-        [ run libs/utility/enable_if/test/member_templates.cpp $(test_monitor) ]
-        [ run libs/utility/enable_if/test/namespace_disambiguation.cpp $(test_monitor) ]
-        [ run libs/utility/enable_if/test/no_disambiguation.cpp $(test_monitor) ]
-        [ run libs/utility/enable_if/test/partial_specializations.cpp $(test_monitor) ]
-    ;
-}

Modified: boost/trunk/libs/utility/generator_iterator.htm
===================================================================
--- boost/trunk/libs/utility/generator_iterator.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/generator_iterator.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,33 +1,37 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 3.2//EN">
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
 <html>
 <head>
-<title>Generator Iterator Adaptor Documentation</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Generator Iterator Adaptor Documentation</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
-        
-<img src="../../boost.png" alt="boost.png (6897 bytes)" align="center" width="277" height="86"> 
+  <img src="../../boost.png" alt="boost.png (6897 bytes)" align="middle"
+  width="277" height="86">
 
-<h1>Generator Iterator Adaptor</h1>
-Defined in header <a href="../../boost/generator_iterator.hpp">boost/generator_iterator.hpp</a> 
-<p>
-The generator iterator adaptor makes it easier to create custom input
-iterators from 0-ary functions and function objects.  The adaptor
-takes a
-<a href="http://www.sgi.com/tech/stl/Generator.html">Generator</a>
-and creates a model of
-<a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
-Each increment retrieves an item from the generator and makes it
-available to be retrieved by dereferencing.  The motivation for this
-iterator is that some concepts can be more naturally expressed as a
-generator, while most STL algorithms expect an iterator.  An example
-is the <a href="../random/index.html">Random Number</a> library.
+  <h1>Generator Iterator Adaptor</h1>
 
-<h2>Synopsis</h2>
+  <p>Defined in header <a href=
+  "../../boost/generator_iterator.hpp">boost/generator_iterator.hpp</a></p>
 
-<blockquote>
-<pre>
+  <p>The generator iterator adaptor makes it easier to create custom input
+  iterators from 0-ary functions and function objects. The adaptor takes a
+  <a href="http://www.sgi.com/tech/stl/Generator.html">Generator</a> and
+  creates a model of <a href=
+  "http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>. Each
+  increment retrieves an item from the generator and makes it available to be
+  retrieved by dereferencing. The motivation for this iterator is that some
+  concepts can be more naturally expressed as a generator, while most STL
+  algorithms expect an iterator. An example is the <a href=
+  "../random/index.html">Random Number</a> library.</p>
+
+  <h2>Synopsis</h2>
+
+  <blockquote>
+    <pre>
 namespace boost {
   template &lt;class Generator&gt;
   class generator_iterator_policies;
@@ -40,21 +44,19 @@
   make_generator_iterator(Generator &amp; gen);
 }
 </pre>
-</blockquote>
+  </blockquote>
+  <hr>
 
-<hr>
+  <h2>The Generator Iterator Generator Class</h2>
 
-<h2>The Generator Iterator Generator Class</h2>
-
-The class generator_iterator_generator is a helper class whose purpose
-is to construct a generator iterator type. The template parameter for
-this class is the Generator function object type that is being
-wrapped.  The generator iterator adaptor only holds a reference (or
-pointer) to the function object, therefore the function object must
-outlive the generator iterator adaptor constructed from it.
-
-<pre>
-template &lt;class Generator>
+  <p>The class generator_iterator_generator is a helper class whose purpose
+  is to construct a generator iterator type. The template parameter for this
+  class is the Generator function object type that is being wrapped. The
+  generator iterator adaptor only holds a reference (or pointer) to the
+  function object, therefore the function object must outlive the generator
+  iterator adaptor constructed from it.</p>
+  <pre>
+template &lt;class Generator&gt;
 class generator_iterator_generator
 {
 public:
@@ -62,66 +64,66 @@
 }
 </pre>
 
+  <h3>Template Parameters</h3>
 
-<h3>Template Parameters</h3>
+  <table border summary="">
+    <tr>
+      <th>Parameter</th>
 
-<table border>
-<tr>
-<th>Parameter</th>
-<th>Description</th>
-</tr>
+      <th>Description</th>
+    </tr>
 
-<tr>
-<td><tt><a href="http://www.sgi.com/tech/stl/Generator.html">Generator</a></tt> 
-<td>The generator (0-ary function object) type being
-wrapped.  The return type of the function must be defined as
-<tt>Generator::result_type</tt>.  The function object must be a model
-of
-<a href="http://www.sgi.com/tech/stl/Generator.html">Generator</a>.
-</td>
-</table>
+    <tr>
+      <td><tt><a href=
+      "http://www.sgi.com/tech/stl/Generator.html">Generator</a></tt></td>
 
-<h3>Concept Model</h3>
-The generator iterator class is a model of
-<a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
+      <td>The generator (0-ary function object) type being wrapped. The
+      return type of the function must be defined as
+      <tt>Generator::result_type</tt>. The function object must be a model of
+      <a href=
+      "http://www.sgi.com/tech/stl/Generator.html">Generator</a>.</td>
+    </tr>
+  </table>
 
-<h3>Members</h3>
-The generator iterator implements the member functions
-and operators required of the
-<a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>
-concept.
+  <h3>Concept Model</h3>
 
-<br>
+  <p>The generator iterator class is a model of <a href=
+  "http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.</p>
 
-<hr>
-<h2><a name="make_generator_iterator">The Generator Iterator Object Generator</a></h2>
+  <h3>Members</h3>
 
-The <tt>make_generator_iterator()</tt> function provides a
-convenient way to create generator iterator objects. The function
-saves the user the trouble of explicitly writing out the iterator
-types.
+  <p>The generator iterator implements the member functions and operators
+  required of the <a href=
+  "http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>
+  concept.<br></p>
+  <hr>
 
-<blockquote>
-<pre>
+  <h2><a name="make_generator_iterator" id="make_generator_iterator">The
+  Generator Iterator Object Generator</a></h2>
+
+  <p>The <tt>make_generator_iterator()</tt> function provides a convenient
+  way to create generator iterator objects. The function saves the user the
+  trouble of explicitly writing out the iterator types.</p>
+
+  <blockquote>
+    <pre>
 template &lt;class Generator&gt;
 typename generator_iterator_generator&lt;Generator&gt;::type
 make_generator_iterator(Generator &amp; gen);
 </pre>
-</blockquote>
+  </blockquote>
+  <hr>
 
-<hr>
+  <h3>Example</h3>
 
+  <p>The following program shows how <code>generator_iterator</code>
+  transforms a generator into an input iterator.</p>
 
-<h3>Example</h3>
+  <blockquote>
+    <pre>
+#include &lt;iostream&gt;
+#include &lt;boost/generator_iterator.hpp&gt;
 
-The following program shows how <code>generator_iterator</code>
-transforms a generator into an input iterator.
-
-<blockquote>
-<pre>
-#include &lt;iostream>
-#include &lt;boost/generator_iterator.hpp>
-
 class my_generator
 {
 public:
@@ -140,11 +142,22 @@
     std::cout &lt;&lt; *it &lt;&lt; std::endl;
 }
 </pre>
-</blockquote>
+  </blockquote>
+  <hr>
 
-<hr>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-Written by Jens Maurer.
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->05 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
 
+  <p><i>Copyright &copy; 2001 <a href=
+  "../../people/jens_maurer.htm">Jens Maurer</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/libs/utility/index.html
===================================================================
--- boost/trunk/libs/utility/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,6 +19,7 @@
 				<a href="call_traits.htm">call_traits</a><br>
 				<a href="checked_delete.html">checked_delete</a><br>
 				<a href="compressed_pair.htm">compressed_pair</a><br>
+				<a href="current_function.html">current_function</a><br>
 				<a href="enable_if.html">enable_if</a><br>
                 <a href="iterator_adaptors.htm">iterator_adaptors</a><br>
 				<a href="operators.htm">operators</a><br>
@@ -27,8 +28,13 @@
                 <a href="value_init.htm">value_init</a></p>
 		</blockquote>
 		<hr>
+		<p>© Copyright Beman Dawes, 2001</p>
+        <p>Distributed under the Boost Software License, Version 1.0. (See 
+        accompanying file <a href="../../LICENSE_1_0.txt">
+        LICENSE_1_0.txt</a> or copy at
+        <a href="http://www.boost.org/LICENSE_1_0.txt">
+        www.boost.org/LICENSE_1_0.txt</a>)</p>
 		<p>Revised 
-			<!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->01 September, 2003<!--webbot bot="Timestamp" endspan i-checksum="38582" --></p>
-		<p>&nbsp;</p>
-	</body>
+			<!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->07 November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39368" --></p>
+		</body>
 </html>

Deleted: boost/trunk/libs/utility/test/Jamfile
===================================================================
--- boost/trunk/libs/utility/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,43 +0,0 @@
-# Copyright David Abrahams 2003. Permission to copy, use,
-# modify, sell and distribute this software is granted provided this
-# copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as
-# to its suitability for any purpose.
-
-# For more information, see http://www.boost.org/
-
-subproject libs/utility/test ;
-
-# bring in rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-local test_monitor = <lib>@boost/libs/test/build/boost_test_exec_monitor ;
-
-# Please keep the tests ordered by filename
-test-suite utility
-    :
-        [ run ../addressof_test.cpp ]
-        [ run ../assert_test.cpp ]
-        [ run ../base_from_member_test.cpp ]
-        [ run ../binary_search_test.cpp ]
-        [ run ../call_traits_test.cpp : -u ]
-        [ compile-fail ../checked_delete_test.cpp ]
-        [ run ../compressed_pair_test.cpp $(test_monitor) : -u ]
-        [ run ../current_function_test.cpp : : : <test-info>always_show_run_output ]
-        [ run ../iterators_test.cpp $(test_monitor) ]
-        [ run next_prior_test.cpp $(test_monitor) ]
-        [ compile-fail ../noncopyable_test.cpp ]
-        [ run ../numeric_traits_test.cpp ]
-        [ run ../operators_test.cpp $(test_monitor) ]
-        [ compile ../ref_ct_test.cpp  ]
-        [ run ../ref_test.cpp $(test_monitor) ]
-        [ compile result_of_test.cpp ]
-        [ run ../shared_iterator_test.cpp ]
-        [ run ../value_init_test.cpp ]
-        [ compile-fail ../value_init_test_fail1.cpp ]
-        [ compile-fail ../value_init_test_fail2.cpp ]
-        [ compile-fail ../value_init_test_fail3.cpp ]
-    ;

Modified: boost/trunk/libs/utility/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/utility/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,15 +18,15 @@
         [ run ../binary_search_test.cpp ]
         [ run ../call_traits_test.cpp : -u ]
         [ compile-fail ../checked_delete_test.cpp ]
-        [ run ../compressed_pair_test.cpp ../../test/build//boost_test_exec_monitor : -u ]
+        [ run ../compressed_pair_test.cpp ../../test/build//boost_test_exec_monitor/<link>static : -u ]
         [ run ../current_function_test.cpp : : : <test-info>always_show_run_output ]
-        [ run ../iterators_test.cpp ../../test/build//boost_test_exec_monitor ]
-        [ run next_prior_test.cpp ../../test/build//boost_test_exec_monitor ]
+        [ run ../iterators_test.cpp ../../test/build//boost_test_exec_monitor/<link>static ]
+        [ run next_prior_test.cpp ../../test/build//boost_test_exec_monitor/<link>static ]
         [ compile-fail ../noncopyable_test.cpp ]
         [ run ../numeric_traits_test.cpp ]
-        [ run ../operators_test.cpp ../../test/build//boost_test_exec_monitor ]
+        [ run ../operators_test.cpp ../../test/build//boost_test_exec_monitor/<link>static ]
         [ compile ../ref_ct_test.cpp  ]
-        [ run ../ref_test.cpp ../../test/build//boost_test_exec_monitor ]
+        [ run ../ref_test.cpp ../../test/build//boost_test_exec_monitor/<link>static ]
         [ compile result_of_test.cpp ]
         [ run ../shared_iterator_test.cpp ]
         [ run ../value_init_test.cpp ]

Modified: boost/trunk/libs/utility/throw_exception.html
===================================================================
--- boost/trunk/libs/utility/throw_exception.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/throw_exception.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -51,9 +51,8 @@
 }
 </pre>
 		<p><br>
-			<small>Copyright © 2002 by Peter Dimov. Permission to copy, use, modify, sell and 
-				distribute this document is granted provided this copyright notice appears in 
-				all copies. This document is provided "as is" without express or implied 
-				warranty, and with no claim as to its suitability for any purpose.</small></p>
+			<small>Copyright © 2002 by Peter Dimov. Distributed under the Boost Software License, Version 
+				1.0. See accompanying file <A href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</A> or 
+				copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>.</small></p>
 	</body>
 </html>

Modified: boost/trunk/libs/utility/utility.htm
===================================================================
--- boost/trunk/libs/utility/utility.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/utility/utility.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,6 +23,7 @@
 			<li>
 				Function template <a href="#addressof">addressof()</a></li>
                         <li>Class template <a href="#result_of">result_of</a></li>
+                        <li><a href="index.html">Other utilities not part of <code>utility.hpp</code></a></li>
 		</ul>
 		<h2>
 			Function templates <a name="checked_delete">checked_delete</a>() and 

Modified: boost/trunk/libs/variant/doc/reference/get.xml
===================================================================
--- boost/trunk/libs/variant/doc/reference/get.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/variant/doc/reference/get.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -136,7 +136,7 @@
       <rationale>
         <simpara>While visitation via
         <code><functionname>apply_visitor</functionname></code>
-        is generally prefered due to its greater safety, <code>get</code> may
+        is generally preferred due to its greater safety, <code>get</code> may
         may be more convenient in some cases due to its straightforward
         usage.</simpara>
       </rationale>

Deleted: boost/trunk/libs/variant/test/Jamfile
===================================================================
--- boost/trunk/libs/variant/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/variant/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,50 +0,0 @@
-#  Boost.Variant Library test Jamfile
-#
-#  Copyright (C) 2003, Eric Friedman, Itay Maman.
-#
-#  This material is provided "as is", with absolutely no warranty expressed
-#  or implied. Any use is at your own risk.
-#
-#  Permission to use or copy this software for any purpose is hereby granted
-#  without fee, provided the above notices are retained on all copies.
-#  Permission to modify the code and to distribute modified code is granted,
-#  provided the above notices are retained, and a notice that the code was
-#  modified is included with the above copyright notice.
-#
-
-subproject libs/variant/test ;
-
-# bring in rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-   # look in BOOST_ROOT for sources first, just in this Jamfile
-   local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-
-   test-suite variant
-     : 
-    [ run libs/variant/test/test1.cpp libs/variant/test/class_a.cpp
-       : : : : variant_test1 ]
-    [ run libs/variant/test/test2.cpp
-       : : : : variant_test2 ]
-    [ run libs/variant/test/test3.cpp
-       : : : : variant_test3 ]
-    [ run libs/variant/test/test4.cpp libs/variant/test/class_a.cpp
-       : : : : variant_test4 ]
-    [ run libs/variant/test/test5.cpp
-       : : : : variant_test5 ]
-    [ run libs/variant/test/test6.cpp
-       : : : : variant_test6 ]
-    [ run libs/variant/test/test7.cpp
-       : : : : variant_test7 ]
-    [ run libs/variant/test/test8.cpp
-       : : : : variant_test8 ]
-    [ run libs/variant/test/recursive_variant_test.cpp ]
-    [ run libs/variant/test/variant_reference_test.cpp ]
-    [ run libs/variant/test/variant_comparison_test.cpp ]
-    [ run libs/variant/test/variant_visit_test.cpp ]
-   ; 
-}

Modified: boost/trunk/libs/wave/ChangeLog
===================================================================
--- boost/trunk/libs/wave/ChangeLog	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/ChangeLog	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 Boost.Wave: A Standard compliant C++ preprocessor library
 http://www.boost.org/
 
-Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
 Software License, Version 1.0. (See accompanying file
 LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 -------------------------------------------------------------------------------
@@ -22,20 +22,9 @@
 
 CHANGELOG
 
-- Wave Version 1.2.5
-- Changed the return value of the 'evaluated_conditional_expression()' pp hook
-  to 'bool' allowing to force Wave to re-evaluate the current conditional
-  expression. This was suggested by Felipe Magno de Almeida.
-- Added a wave::context object as first parameter to all pp hook functions. 
-  This is an interface compatibility breaking change. The new pp-hooks can be 
-  disabled by defining the BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS 
-  compile time constant to something not equal to zero. By default this 
-  constant will be defined to zero for Boost V1.35.0 and newer, switching to
-  the new interface by default.
-
 Boost V1.34.0
 - Wave Version 1.2.4
-- Added the possibility to explicitely enable/disable the generation of #line 
+- Added the possibility to explicitly enable/disable the generation of #line 
   directives. Added a corresponding commandline argument to the Wave driver 
   tool (--line/-L) which takes either 0 or 1 as its parameter.
 - Added support for #pragma wave option(command: value) directives, which 
@@ -140,7 +129,58 @@
   usage of the boolean keywords as identifiers during the preprocessing. Added
   a corresponding test case (t_9_017.cpp). Thanks to Andreas Sæbjørnsen for
   reporting.
-
+- Corrected the Jamfile[.v2] of the waveidl sample to refer to correct file 
+  names (thanks to Juergen Hunold for submitting a patch).
+- Fixed a bug which prevented the main iterator from returning a T_EOF token 
+  at the overall end of the input. 
+- Fixed a problem, where non-evaluated #elif directives never got passed to the 
+  skippen_token() pp hook (thanks to Andreas Sæbjørnsen for reporting).
+- Fixed a problem in the get_tokenname() function.
+- Added a missing #define BOOST_WAVE_SOURCE 1 to the wave_config_constant.cpp
+  file.
+- Fixed exception specifications to catch all exceptions by const&.
+- Fixed predefined macros to appear to be defined at a position referring to 
+  a file named "<built-in>". Thanks to Andreas Sæbjørnsen for reporting.
+- Fixed the Re2C lexer not to segfault on empty files anymore.
+- Stripped leading and trailing whitespace for all lines in a config file (Wave
+  driver tool).
+- Fixed RTTI build issue for VC7.1/bjam --v2 (thanks to Rene Rivera for 
+  submitting a patch for the Wave Jamfile.v2).
+- Fixed certain problems reported by the Boost inspection tool.
+- Fixed a couple of SunPro5.8 warnings.
+- Fixed a bug resulting in a crash if a macro was redefined with a shorter
+  expansion list as it was defined initially. Added a corresponding test case.
+- Fixed a bug causing an infinite loop when there was a missing endif in the 
+  main preprocessed file.
+- Improved error recovery for illegal preprocessing directive errors.
+- Improved error handling and error recovery for conditional expressions 
+  (#if/#elif expressions).
+- Wave now passes 160 out of 161 tests from the MCPP V2.6.1 validation 
+  testsuite!
+- Added new warning for invalid #line number and filename arguments
+- Improved error diagnostics for invalid #line directives containing arbitrary
+  tokens after at the end of the line.
+- Improved error handling wrt the misuse of the __VA_ARG__ token in macro 
+  definitions.
+- The warning, that a file is not terminated by a newline is now issued for all
+  files, not only for the main file (as previous).
+- Added a couple of new test cases to verify various diagnostics.
+- Fixed wave applet not to report missing #endif's when in interactive mode.
+- Cleaned up the Re2C lexer code.
+- Fixed a bug, where a empty line followed by an arbitrary token and followed 
+  by a preprocessing directive interpreted the preprcessing directive as if it
+  were the first non-whitespace token on the line. This error occured only
+  if the #line directive generation was suppressed. Thanks to Joan Grant for
+  reporting this problem.
+- Fixed a problem in the Wave applet which prevented the correct recognition of 
+  Windows file paths in a configuration file, if this path was enclosed in 
+  quotes.
+- Extended the copyright notice to include the year 2007.
+- Fixed a problem in preserve=1 mode, when a C style comment triggered the 
+  generation of a #line directive.
+- Worked around a linker issue for the True64/CXX compiler, complaining about
+  multiple defined symbols when using the flex_string class.
+  
 Sat Feb 18 2005
 - Version 1.2.3
 - Added a missing throw() specification to the function 
@@ -240,7 +280,7 @@
 - Added the get_severity() function to the exceptions thrown by the Wave
   library.
 - Extended the copyright notice to include the year 2006.
-
+  
 Mon Dec  5 22:05:22 CST 2005
 Boost V1.33.1
 - Version 1.2.1
@@ -370,7 +410,7 @@
   for this compiler.
 - Renamed files to comply with the Boost rules.
 - Added the first part of the MCPP validation suite to the Wave unit tests.
-- Added even more missing "using namespace std;" staements for functions from
+- Added even more missing "using namespace std;" statements for functions from
   the C runtime library. The Wave test suite now contains more than 100 unit
   tests.
 - Added the $P/$P(basename) replacement string to the testwave application 

Deleted: boost/trunk/libs/wave/build/Jamfile
===================================================================
--- boost/trunk/libs/wave/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,70 +0,0 @@
-# Boost.Wave: A Standard compliant C++ preprocessor library
-#
-# Boost Wave Library Build Jamfile
-#
-# http://www.boost.org/
-#
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
-# Software License, Version 1.0. (See accompanying file 
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-subproject libs/wave/build ;
-
-SOURCES = instantiate_cpp_exprgrammar 
-          instantiate_cpp_grammar 
-          instantiate_cpp_literalgrs 
-          instantiate_defined_grammar
-          instantiate_predef_macros 
-          instantiate_re2c_lexer
-          instantiate_re2c_lexer_str
-          token_ids
-          wave_config_constant
-          cpplexer/re2clex/aq 
-          cpplexer/re2clex/cpp_re
-    ;
-
-lib boost_wave
-    : ../src/$(SOURCES).cpp
-    :                         # build requirements
-      common-variant-tag      # magic for install and auto-link features
-      <include>$(BOOST_ROOT) 
-      <sysinclude>$(BOOST_ROOT)
-      <vc-7_1><*><rtti>off    # workaround for compiler bug
-      <vc-7_1-stlport><*><rtti>off
-      <no-warn>cpp_re.cpp
-    : debug release           # build variants
-    ;
-
-dll boost_wave
-    : ../src/$(SOURCES).cpp
-    :                         # build requirements
-      common-variant-tag      # magic for install and auto-link features
-      <define>BOOST_ALL_DYN_LINK=1  # tell source we're building dll's
-      <runtime-link>dynamic   # build only for dynamic runtimes
-      <include>$(BOOST_ROOT) 
-      <sysinclude>$(BOOST_ROOT)
-      <vc-7_1><*><rtti>off    # workaround for compiler bug
-      <vc-7_1-stlport><*><rtti>off
-      <no-warn>cpp_re.cpp
-    : debug release           # build variants
-    ;
-
-install wave lib
-    : <lib>boost_wave 
-      <dll>boost_wave
-    ;
-
-stage stage/lib : <lib>boost_wave <dll>boost_wave
-    :     
-     # copy to a path rooted at BOOST_ROOT:
-       <locate>$(BOOST_ROOT)
-     # make sure the names of the libraries are correctly named:
-       common-variant-tag
-     # add this target to the "stage" and "all" pseudo-targets:
-       <target>stage
-       <target>all
-    :
-       debug release
-    ;
-
-# end

Modified: boost/trunk/libs/wave/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/wave/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
 #
 # http://www.boost.org/
 #
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+# Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
 # Software License, Version 1.0. (See accompanying file 
 # LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -30,14 +30,21 @@
 
 lib boost_wave
     :
-    $(SOURCES).cpp
+    $(SOURCES)
     /boost/filesystem//boost_filesystem
-    :
-    <toolset-msvc:version>7.1:<rtti>off   # workaround for compiler bug
-    # Not supported by V2
-    # <no-warn>cpp_re.cpp
     ;
 
+for local source in $(SOURCES)
+{
+    local requirements ;
+    requirements += <toolset-msvc:version>7.1:<rtti>off ; # workaround for compiler bug
+    if $(source) in cpplexer/re2clex/cpp_re
+    {
+        requirements += <warnings>off ;
+    }
+    obj $(source) : $(source).cpp : $(requirements) ;
+}
+
 install dist-lib
     :
     boost_wave

Modified: boost/trunk/libs/wave/doc/acknowledgements.html
===================================================================
--- boost/trunk/libs/wave/doc/acknowledgements.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/acknowledgements.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -38,12 +38,15 @@
     from which are taken some ideas.</p>
   <p> <strong>Andrei Alexandrescu</strong> for allowing to use his flex_string class, 
 a policy based std::basic_string&lt;&gt; compatible string implementation.</p>
-  <p><strong>Reece Dunn</strong>, <strong>Vesa Karvonen</strong>, <strong>Faisal Vali</strong>, <strong>Porter Schermerhorn</strong> and <strong>Daniel Fontijne</strong> for 
+  <p><strong>Reece Dunn</strong>, <strong>Vesa Karvonen</strong>, <strong>Faisal Vali</strong>, <strong>Porter Schermerhorn, Juergen Hunold, Jozsef Mihalicza</strong> and <strong>Daniel Fontijne</strong> for 
   reporting several problems and bugs.</p>
   <p><strong>Tarmo Pikaro</strong> for reporting several bug while compiling specific
   headers from the Microsoft Windows SDK.</p>
   <p><strong>Rob Stewart</strong> helped a lot with proof reading the documentation. </p>
   <p><strong>Stefan Seefeld</strong> for integrating Wave into his Synopsis library and finding a couple of bugs along the way. </p>
+  <p><strong>Andreas S&aelig;bj&oslash;rnsen</strong> and <strong>Felipe Magno de Almeida</strong> for suggesting some extensions and corrections to the <tt>Wave</tt> preprocessing hook interface and related testing. </p>
+  <p><strong>Tobias Schwinger</strong> for suggesting the '<span class="preprocessor">pragma wave option(output:...)</span>' and '<span class="preprocessor">#pragma message(&quot;...&quot;)</span>' functionalities and reporting a couple of bugs. </p>
+  <p><strong>Richard Guenther</strong> for fixing a nasty buffer overrun problem in the Re2C lexer. </p>
 </blockquote>
 <p>and last but not least </p>
 <blockquote>
@@ -54,7 +57,7 @@
 <p> Special thanks also to people who gave feedback and valuable comments, particularly members of Boost and Spirit mailing lists. This includes all those who participated in the Boost review: 
 <blockquote>
   <p><strong>Tom Brinkman</strong> (who volunteered to be the review manager), <strong>David Abrahams</strong>, <strong>Beman Dewes</strong>, <strong>Reece Dunn</strong>, <strong>Larry Evans</strong>, <strong>Doug Gregor</strong>, <strong>Joel de Guzman</strong>, <strong>Baptiste Lepilleur</strong>, <strong>Andy Little</strong>, <strong>Paul Mensonides</strong>, <strong>Dan Nuffer</strong>, <strong>Andreas Pokorny</strong>, <strong>Vladimir Prus</strong>, <strong>Gennadiy Rozental</strong>, <strong>Michiel Salters</strong>, <strong>Jonathan Turkanis</strong>, <strong>Chris Uzdavinis</strong>, <strong>Pavel Vozenilek</strong>, <strong>Michael Walter</strong></p>
-    </blockquote>
+</blockquote>
 <p>The <tt>Wave</tt> library uses the following <tt>Boost</tt> <a href="references.html#boost">[8]</a> 
   libraries:</p>
 <blockquote> 
@@ -79,13 +82,13 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
   <font size="2">Distributed under the Boost Software 
   License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) 
   </font> </p>
 <span class="updated">Last updated: 
-  <!-- #BeginDate format:fcAm1m -->Saturday, December 10, 2005  18:02<!-- #EndDate -->
+  <!-- #BeginDate format:fcAm1m -->Wednesday, June 21, 2006  22:22<!-- #EndDate -->
 </span>
 </body>
 </html>

Modified: boost/trunk/libs/wave/doc/class_reference_context.html
===================================================================
--- boost/trunk/libs/wave/doc/class_reference_context.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/class_reference_context.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -466,7 +466,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
   <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>

Modified: boost/trunk/libs/wave/doc/class_reference_ctxpolicy.html
===================================================================
--- boost/trunk/libs/wave/doc/class_reference_ctxpolicy.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/class_reference_ctxpolicy.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,7 +11,7 @@
   <tr> 
     <td width="21"> <h1></h1></td>
     <td width="885"> <font face="Verdana, Arial, Helvetica, sans-serif"><b><font size="6">The 
-      Context Policy (new, upcoming interface) </font></b></font></td>
+      Context Policy</font></b></font></td>
     <td width="96"><a href="http://www.boost.org"><img src="theme/wave.gif" width="93" height="68" align="right" border="0"></a></td>
   </tr>
 </table>
@@ -31,7 +31,6 @@
     <a href="class_reference_ctxpolicy.html#member_functions">Member functions</a></p>
 </blockquote>
 <h2><b><a name="introduction"></a>Introduction</b></h2>
-<p>Please note that the following description relates to the new preprocessing hooks interface used by default starting with the Boost V1.35.0 release. If you are interested in the older interface please look <a href="class_ref_ctxpolicy_depr.html">here</a>. </p>
 <p>The context policy is used to provide callback hooks, which are called from inside the library into the user code, whenever</p>
 <ul>
   <li>a preprocessor directive has been recognized, </li>
@@ -55,55 +54,41 @@
     <span class="keyword">struct</span> default_preprocessing_hooks {
 
         <span class="comment">// general hook functions</span>
-        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> TokenT&gt;
-        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#found_directive">found_directive</a>(ContextT <span class="keyword">const</span> &amp;ctx, 
-            TokenT <span class="keyword">const </span>&amp;directive);<br>
+        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> TokenT&gt;
+        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#found_directive">found_directive</a>(TokenT <span class="keyword">const </span>&amp;directive);<br>
         <span class="comment">// test, whether a given token may be skipped</span><br>        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT&gt;
         <span class="keyword">bool</span> <a href="class_reference_ctxpolicy.html#may_skip_whitespace">may_skip_whitespace</a> (ContextT <span class="keyword">const</span>&amp; ctx,
             TokenT &amp;token, <span class="keyword">bool</span> &amp;skipped_newline);<br>
         </span><span class="comment">// Conditional compilation</span><span class="keyword">
-        template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> ContainerT&gt;<br>        <span class="keyword">bool</span> <a href="class_reference_ctxpolicy.html#evaluated_conditional_expression">evaluated_conditional_expression</a>(
-            ContextT <span class="keyword">const</span> &amp;ctx, ContainerT <span class="keyword">const</span>&amp; expression, <br>            <span class="keyword">bool</span> expression_value);<br>
-        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> TokenT&gt;
-        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#skipped_token">skipped_token</a>(ContextT <span class="keyword">const</span> &amp;ctx, 
-            TokenT <span class="keyword">const</span></span>&amp; token);<br>
+        template</span> &lt;<span class="keyword">typename</span> ContainerT&gt;<br>        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#evaluated_conditional_expression">evaluated_conditional_expression</a>(ContainerT <span class="keyword">const</span>&amp; expression, <br>            <span class="keyword">bool</span> expression_value);<br>
+        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> TokenT&gt;
+        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#skipped_token">skipped_token</a>(TokenT <span class="keyword">const</span></span>&amp; token);<br>
         <span class="comment">// macro expansion tracing</span><span class="keyword">
-        template</span> &lt;<span class="keyword">
-            typename</span> ContextT, <span class="keyword">typename</span> TokenT, <span class="keyword">typename</span> ContainerT,
-            <span class="keyword">typename</span> IteratorT
-        &gt;
-        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#expanding_function_like_macro">expanding_function_like_macro</a>(
-            ContextT <span class="keyword">const</span> &amp;ctx, TokenT <span class="keyword">const</span> &amp;macrodef, 
+        template</span> &lt;<span class="keyword">typename</span> TokenT, <span class="keyword">typename</span> ContainerT&gt;
+        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#expanding_function_like_macro">expanding_function_like_macro</a>(TokenT <span class="keyword">const</span> &amp;macrodef, 
             <span class="keyword">std::vector</span>&lt;TokenT&gt; <span class="keyword">const</span> &amp;formal_args, 
             ContainerT <span class="keyword">const</span> &amp;definition, TokenT <span class="keyword">const</span> &amp;macrocall, 
-            <span class="keyword">std::vector</span>&lt;ContainerT&gt; <span class="keyword">const</span> &amp;arguments,
-            IteratorT <span class="keyword">const</span> &amp;seqstart, Iterator <span class="keyword">const</span> &amp;seqend);
+            <span class="keyword">std::vector</span>&lt;ContainerT&gt; <span class="keyword">const</span> &amp;arguments);
  
-        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> TokenT, <span class="keyword">typename</span> ContainerT&gt;
-        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#expanding_object_like_macro">expanding_object_like_macro</a>(
-            ContextT <span class="keyword">const</span> &amp;ctx, TokenT <span class="keyword">const</span> &amp;macro, 
+        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> TokenT, <span class="keyword">typename</span> ContainerT&gt;
+        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#expanding_object_like_macro">expanding_object_like_macro</a>(TokenT <span class="keyword">const</span> &amp;macro, 
             ContainerT <span class="keyword">const</span> &amp;definition, TokenT <span class="keyword">const</span> &amp;macrocall);
  
-        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> ContainerT&gt;
-        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#expanded_macro">expanded_macro</a>(ContextT <span class="keyword">const</span> &amp;ctx, 
-            ContainerT <span class="keyword">const</span> &amp;result);
+        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContainerT&gt;
+        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#expanded_macro">expanded_macro</a>(ContainerT <span class="keyword">const</span> &amp;result);
  
-        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> ContainerT&gt;
-        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#expanded_macro">rescanned_macro</a>(ContextT <span class="keyword">const</span> &amp;ctx, 
-            ContainerT <span class="keyword">const</span> &amp;result);
+        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContainerT&gt;
+        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#expanded_macro">rescanned_macro</a>(ContainerT <span class="keyword">const</span> &amp;result);
 
         <span class="comment">// include file tracing functions</span>
-        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT&gt;
-        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#opened_include_file">found_include_directive</a>(ContextT <span class="keyword">const</span> &amp;ctx, 
-            std::string <span class="keyword">const</span> &amp;filename, <span class="keyword">bool</span> include_next);
+        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#opened_include_file">found_include_directive</a>(std::string <span class="keyword">const</span> &amp;filename,
+            <span class="keyword">bool</span> include_next);
 
-        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT&gt;
-        <span class="keyword">void </span><a href="class_reference_ctxpolicy.html#opened_include_file">opened_include_file</a>(ContextT <span class="keyword">const</span> &amp;ctx, 
-            std::string <span class="keyword">const</span> &amp;relname, std::string const&amp; absname,
+        <span class="keyword">void </span><a href="class_reference_ctxpolicy.html#opened_include_file">opened_include_file</a>(std::string <span class="keyword">const</span> &amp;relname, 
+            std::string const&amp; absname,
             std::size_t include_depth, <span class="keyword">bool</span> is_system_include); 
 
-        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT&gt;
-        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#returning_from_include_file">returning_from_include_file</a>(ContextT <span class="keyword">const</span> &amp;ctx);
+        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#returning_from_include_file">returning_from_include_file</a>();
 
         <span class="comment">// interpretation of #pragma's of the form </span>
         <span class="comment">// 'wave option[(value)]'</span>
@@ -115,81 +100,69 @@
 
         <span class="comment">// macro definition hooks</span>
         <span class="keyword">template</span> &lt;
-            <span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> TokenT, <span class="keyword">
-            typename</span> ParametersT, <span class="keyword">typename</span> DefinitionT
+            <span class="keyword">typename</span> TokenT, <span class="keyword">typename</span> ParametersT, <span class="keyword">typename</span> DefinitionT
         &gt;
-        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#defined_macro">defined_macro</a>(ContextT <span class="keyword">const</span> &amp;ctx, TokenT <span class="keyword">const</span> &amp;name, <span class="keyword">
-            bool</span> is_functionlike, ParametersT <span class="keyword">const</span> &amp;parameters, 
-            DefinitionT <span class="keyword">const</span> &amp;definition, <span class="keyword">bool</span> is_predefined);
+        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#defined_macro">defined_macro</a>(TokenT <span class="keyword">const</span> &amp;name, <span class="keyword">bool</span> is_functionlike,
+            ParametersT <span class="keyword">const</span> &amp;parameters, DefinitionT <span class="keyword">const</span> &amp;definition,
+            <span class="keyword">bool</span> is_predefined);
 
-        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> TokenT&gt;
-        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#undefined_macro">undefined_macro</a>(ContextT <span class="keyword">const</span> &amp;ctx, 
-            TokenT<span class="keyword"> const</span> &amp;name);
+        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> TokenT&gt;
+        <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#undefined_macro">undefined_macro</a>(TokenT<span class="keyword">const</span> &amp;name);
     };
 
 }}}   <span class="comment">// namespace boost::wave::context_policies</span></pre>
 <h2><a name="member_functions"></a>Member functions</h2>
 <h3>General hook functions </h3>
 <p><a name="found_directive"></a><strong>found_directive</strong></p>
-<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> TokenT&gt;
-    <span class="keyword">void</span> found_directive(ContextT <span class="keyword">const</span>&amp; ctx, TokenT <span class="keyword">const </span>&amp;directive);
+<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> TokenT&gt;
+    <span class="keyword">void</span> found_directive(TokenT <span class="keyword">const </span>&amp;directive);
 </pre>
 <blockquote>
   <p>The function <tt>found_directive</tt> is called, whenever the preprocessor has detected one of the preprocessing directives (<span class="preprocessor">#define</span>, <span class="preprocessor">#undef</span>, <span class="preprocessor">#if</span>, <span class="preprocessor">#idef</span>, <span class="preprocessor">#ifndef</span>, <span class="preprocessor">#elif</span>, <span class="preprocessor">#endif</span>, <span class="preprocessor">#error</span>, <span class="preprocessor">#include</span>, <span class="preprocessor">#pragma</span> or <span class="preprocessor">#warning</span>) .</p>
-  <p>The <tt>ctx</tt> parameter provides a reference to the <tt>context_type</tt> used during instantiation of the preprocessing iterators by the user. Note, this parameter was added for the Boost V1.35.0 release. </p>
   <p>The parameter <tt>directive</tt> refers to the token containing the detected preprocessing directive. </p>
 </blockquote>
 <p><a name="may_skip_whitespace" id="may_skip"></a><strong>may_skipwhitespace</strong></p>
-<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> TokenT&gt;
-    <span class="keyword">bool</span> may_skip_whitespace(ContextT <span class="keyword">const</span>&amp; ctx, TokenT &amp;token, 
-        <span class="keyword">bool</span>&amp; skipped_newline);
+<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT&gt;
+    <span class="keyword">bool</span> may_skip_whitespace(ContextT <span class="keyword">const</span>&amp; ctx, TokenT &amp;token, <span class="keyword">bool</span>&amp; skipped_newline);
 </pre>
 <blockquote>
   <p>The function <tt>may_skipwhitespace</tt> will be called by the library, whenever a token is about to be returned to the calling application. </p>
-  <p>The <tt>ctx</tt> parameter provides a reference to the <tt>context_type</tt> used during instantiation of the preprocessing iterators by the user. Note, this parameter was added for the Wave V1.2.4 release. </p>
+  <p>The <tt>ctx</tt> parameter provides a reference to the <tt>context_type</tt> used during instantiation of the preprocessing iterators by the user. Note, this parameter was added after the Boost V1.34.0 release. </p>
   <p>The <tt>token</tt> parameter holds a reference to the current token. The policy is free to change this token if needed.</p>
   <p>The <tt>skipped_newline</tt> parameter holds a reference to a boolean value which should be set to true by the policy function whenever a newline is going to be skipped. </p>
   <p>If the return value is <tt>true</tt>, the given token is skipped and the preprocessing continues to the next token. If the return value is <tt>false</tt>, the given token is returned to the calling application. Caution has to be used, because by returning <span class="keyword">true</span> the policy function is able to force skipping even significant tokens not only whitespace. </p>
 </blockquote>
 <h3>Conditional compilation hook functions </h3>
 <p><a name="evaluated_conditional_expression"></a><strong>evaluated_conditional_expression</strong></p>
-<pre><span class="keyword">    template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> ContainerT&gt;<br><span class="keyword">    bool</span> evaluated_conditional_expression(ContextT <span class="keyword">const</span>&amp; ctx, 
-        ContainerT <span class="keyword">const</span>&amp; expression, <span class="keyword">bool</span> expression_value);
+<pre><span class="keyword">    template</span> &lt;<span class="keyword">typename</span> ContainerT&gt;<br><span class="keyword">    void</span> evaluated_conditional_expression(ContainerT <span class="keyword">const</span>&amp; expression, <br><span class="keyword">        bool</span> expression_value);
 </pre>
 <blockquote>
   <p>The function <tt>evaluated_conditional_expression</tt> is called, whenever the preprocessor has encountered a <span class="preprocessor">#if</span>, <span class="preprocessor">#elif</span>, <span class="preprocessor">#ifdef</span> or <span class="preprocessor">#ifndef</span> directive. This hook gets passed the non-expanded conditional expression (as it was given in the analysed source file) and the result of the evaluation of this expression in the current preprocessing context.</p>
-  <p>The <tt>ctx</tt> parameter provides a reference to the <tt>context_type</tt> used during instantiation of the preprocessing iterators by the user. Note, this parameter was added for the Boost V1.35.0 release. </p>
   <p>The parameter <tt>expression</tt> holds the non-expanded token sequence 
-    comprising the evaluated expression.</p>
+  comprising the evaluated expression.</p>
   <p>The parameter <tt>expression_value</tt> contains the result of the evaluation of 
     the expression in the current preprocessing context. </p>
-  <p>The return value defines, whether the given expression has to be evaluated again, allowing to decide which of the conditional branches should be expanded. You need to return '<span class="keyword">true</span>' from this hook function to force the expression to be re-evaluated. Note, this was changed from a '<span class="keyword">void</span>' for the Boost V1.35.0 release. <br>
-  </p>
 </blockquote>
 <p><a name="skipped_token"></a><strong>skipped_token</strong></p>
-<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> TokenT&gt;
-    <span class="keyword">void</span> skipped_token(ContextT <span class="keyword">const</span>&amp; ctx, TokenT <span class="keyword">const</span>&amp; token);
+<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> TokenT&gt;
+    <span class="keyword">void</span> skipped_token(TokenT <span class="keyword">const</span>&amp; token);
 </pre>
 <blockquote>
   <p>The function <tt>skipped_token</tt> is called, whenever a token is about to be skipped due to a false preprocessor condition (code fragments to be
   skipped inside the not evaluated conditional <span class="preprocessor">#if</span>/<span class="preprocessor">#else</span>/<span class="preprocessor">#endif</span> branches).</p>
-  <p>The <tt>ctx</tt> parameter provides a reference to the <tt>context_type</tt> used during instantiation of the preprocessing iterators by the user. Note, this parameter was added for the Boost V1.35.0 release. </p>
   <p>The parameter <tt>token</tt> refers to the token to be skipped.</p>
 </blockquote>
 <h3>Macro expansion tracking functions</h3>
 <p><a name="expanding_function_like_macro"></a><b>expanding_function_like_macro</b></p>
-<pre><span class="keyword">    template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> TokenT, <span class="keyword">typename</span> ContainerT&gt;
-    <span class="keyword">void</span> expanding_function_like_macro(
-        ContextT <span class="keyword">const</span>&amp; ctx, TokenT <span class="keyword">const</span> &amp;macrodef, 
+<pre><span class="keyword">    template</span> &lt;<span class="keyword">typename</span> TokenT, <span class="keyword">typename</span> ContainerT&gt;
+    <span class="keyword">void</span> expanding_function_like_macro(TokenT <span class="keyword">const</span> &amp;macrodef, 
         <span class="keyword">std::vector</span>&lt;TokenT&gt; <span class="keyword">const</span> &amp;formal_args, 
         ContainerT <span class="keyword">const</span> &amp;definition, TokenT <span class="keyword">const</span> &amp;macrocall, 
-        <span class="keyword">std::vector</span>&lt;ContainerT&gt; <span class="keyword">const</span> &amp;arguments,
-        IteratorT <span class="keyword">const</span> &amp;seqstart, Iterator <span class="keyword">const</span> &amp;seqend);</pre>
+        <span class="keyword">std::vector</span>&lt;ContainerT&gt; <span class="keyword">const</span> &amp;arguments);</pre>
 <blockquote> 
   <p>The function <tt>expanding_function_like_macro</tt> is called, whenever a 
     function-like macro is to be expanded, i.e. <i>before</i> the actual expansion 
     starts.</p>
-  <p>The <tt>ctx</tt> parameter provides a reference to the <tt>context_type</tt> used during instantiation of the preprocessing iterators by the user. Note, this parameter was added for the Boost V1.35.0 release. </p>
   <p>The <tt>macroname</tt> parameter marks the position where the macro to expand 
     is defined. It contains the token which identifies the macro name used inside 
     the corresponding macro definition.</p>
@@ -205,22 +178,15 @@
     invocation of the macro. This is a vector of standard STL containers which 
     contain the token sequences identified at the position of the macro call as 
     the arguments to be used during the macro expansion. </p>
-  <p>The parameters <tt>seqstart</tt> and <tt>seqend</tt> point into the input token 
-    stream allowing to access the whole token sequence comprising the macro
-    invocation (starting with the opening parenthesis and ending after the 
-    closing one).<br>
-  </p>
 </blockquote>
 <p><a name="expanding_object_like_macro"></a><b>expanding_object_like_macro</b></p>
-<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> TokenT, <span class="keyword">typename</span> ContainerT&gt;
-    <span class="keyword">void</span> expanding_object_like_macro(
-        ContextT <span class="keyword">const</span>&amp; ctx, TokenT <span class="keyword">const</span> &amp;macro, 
+<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> TokenT, <span class="keyword">typename</span> ContainerT&gt;
+    <span class="keyword">void</span> expanding_object_like_macro(TokenT <span class="keyword">const</span> &amp;macro, 
         ContainerT <span class="keyword">const</span> &amp;definition, TokenT <span class="keyword">const</span> &amp;macrocall);
 </pre>
 <blockquote> 
   <p>The function <tt>expanding_object_like_macro</tt> is called, whenever a object-like 
     macro is to be expanded, i.e. <i>before</i> the actual expansion starts.</p>
-  <p>The <tt>ctx</tt> parameter provides a reference to the <tt>context_type</tt> used during instantiation of the preprocessing iterators by the user. Note, this parameter was added for the Boost V1.35.0 release. </p>
   <p>The <tt>macroname</tt> parameter marks the position where the macro to expand 
     is defined. It contains the token which identifies the macro name used inside 
     the corresponding macro definition.</p>
@@ -232,58 +198,53 @@
     input stream. </p>
 </blockquote>
 <p><a name="expanded_macro"></a><b>expanded_macro</b></p>
-<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> ContainerT&gt;
-    <span class="keyword">void</span> expanded_macro(ContextT <span class="keyword">const</span>&amp; ctx, ContainerT <span class="keyword">const</span> &amp;result);
+<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContainerT&gt;
+    <span class="keyword">void</span> expanded_macro(ContainerT <span class="keyword">const</span> &amp;result);
 </pre>
 <blockquote> 
   <p>The function <tt>expanded_macro</tt> is called whenever the expansion of 
     a macro is finished, the replacement list is completely scanned and the identified 
     macros herein are replaced by its corresponding expansion results, but <i>before</i> 
     the rescanning process starts.</p>
-  <p>The <tt>ctx</tt> parameter provides a reference to the <tt>context_type</tt> used during instantiation of the preprocessing iterators by the user. Note, this parameter was added for the Boost V1.35.0 release. </p>
   <p>The parameter <tt>result</tt> contains the the result of the macro expansion 
     so far. This is a standard STL container containing the generated token sequence.</p>
 </blockquote>
 <p><a name="rescanned_macro"></a><b>rescanned_macro</b></p>
-<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> ContainerT&gt;
-    <span class="keyword">void</span> rescanned_macro(ContextT <span class="keyword">const</span>&amp; ctx, ContainerT <span class="keyword">const</span> &amp;result);
+<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContainerT&gt;
+    <span class="keyword">void</span> rescanned_macro(ContainerT <span class="keyword">const</span> &amp;result);
 </pre>
 <blockquote> 
   <p>The function <tt>rescanned_macro</tt> is called whenever the rescanning 
     of a macro is finished, i.e. the macro expansion is complete.</p>
-  <p>The <tt>ctx</tt> parameter provides a reference to the <tt>context_type</tt> used during instantiation of the preprocessing iterators by the user. Note, this parameter was added for the Boost V1.35.0 release. </p>
   <p>The parameter <tt>result</tt> contains the the result of the whole macro 
     expansion. This is a standard STL container containing the generated token 
     sequence.</p>
 </blockquote>
 <h3>Include file tracing functions</h3>
 <p><a name="opened_include_file" id="found_include_directive"></a><strong>found_include_directive</strong></p>
-<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT&gt;
-    <span class="keyword">void</span> found_include_directive(ContextT <span class="keyword">const</span>&amp; ctx, 
-        std::string <span class="keyword">const</span> &amp;filename, <span class="keyword">bool</span> include_next);
+<pre>    <span class="keyword">void</span> found_include_directive(std::string <span class="keyword">const</span> &amp;filename,
+        <span class="keyword">bool</span> include_next);
 </pre>
 <blockquote>
   <p>The function <tt>found_include_directive</tt> is called whenever whenever a #include directive was located..</p>
-  <p>The <tt>ctx</tt> parameter provides a reference to the <tt>context_type</tt> used during instantiation of the preprocessing iterators by the user. Note, this parameter was added for the Boost V1.35.0 release. </p>
   <p>The parameter <tt>filename</tt> contains the (expanded) file name found after 
-    the <span class="preprocessor">#include</span> directive. This has the format <tt>&lt;file&gt;</tt>, <tt>&quot;file&quot;</tt> or <tt>file</tt>. 
+    the <span class="preprocessor">#include</span> directive. This has the format <tt>&lt;file&gt;</tt>, <tt>&quot;file&quot;</tt> or 
+    <tt>file</tt>. 
     The formats <tt>&lt;file&gt;</tt> or <tt>&quot;file&quot;</tt> are used for <span class="preprocessor">#include</span> directives found 
     in the preprocessed token stream, the format <tt>file</tt> is used for files
-    specified through the --force_include command line argument.</p>
+  specified through the --force_include command line argument.</p>
   <p>The parameter <tt>include_next</tt> is set to true if the found directive was
     a <span class="preprocessor">#include_next</span> directive and the <tt>BOOST_WAVE_SUPPORT_INCLUDE_NEXT</tt>    preprocessing constant was defined to something != 0.<br>
   </p>
 </blockquote>
 <p><a name="opened_include_file" id="opened_include_file"></a><strong>opened_include_file</strong></p>
-<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT&gt;
-    <span class="keyword">void</span> opened_include_file(ContextT <span class="keyword">const</span>&amp; ctx, 
-        std::string <span class="keyword">const</span> &amp;rel_filename, std::string <span class="keyword">const</span> &amp;abs_filename, 
+<pre>    <span class="keyword">void</span> opened_include_file(std::string <span class="keyword">const</span> &amp;rel_filename, 
+        std::string <span class="keyword">const</span> &amp;abs_filename, 
         std::size_t include_depth, <span class="keyword">bool</span> is_system_include);
 </pre>
 <blockquote> 
   <p>The function <tt>opened_include_file</tt> is called whenever a file referred 
     by an <span class="preprocessor">#include</span> directive was successfully located and opened.</p>
-  <p>The <tt>ctx</tt> parameter provides a reference to the <tt>context_type</tt> used during instantiation of the preprocessing iterators by the user. Note, this parameter was added for the Boost V1.35.0 release. </p>
   <p>The parameter <tt>rel_filename</tt> contains the (normalised) probably relative file system path of the opened file. The concrete format of this file name depends on the format of the include search path given to the library beforehand.</p>
   <p>The parameter <tt>abs_filename</tt> contains the (normalised) full file system path of the 
       opened file.</p>
@@ -293,17 +254,15 @@
     as a result of a <tt>#include&nbsp;&lt;...&gt;</tt> directive.</p>
 </blockquote>
 <p><a name="returning_from_include_file" id="returning_from_include_file"></a><strong>returning_from_include_file</strong></p>
-<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT&gt;
-    <span class="keyword">void</span> returning_from_include_file(ContextT <span class="keyword">const</span>&amp; ctx);
+<pre>    <span class="keyword">void</span> returning_from_include_file();
 </pre>
 <blockquote> 
   <p>The function <tt>returning_from_include_file</tt> is called whenever an 
     included file is about to be closed after it's processing is complete.</p>
-  <p>The <tt>ctx</tt> parameter provides a reference to the <tt>context_type</tt> used during instantiation of the preprocessing iterators by the user. Note, this parameter was added for the Boost V1.35.0 release. </p>
 </blockquote>
 <h3>Interpretation of #pragma's</h3>
 <p><strong><a name="interpret_pragma"></a>interpret_pragma</strong></p>
-<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> ContainerT&gt;
+<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> ContainerT&gt;
     bool <a href="class_reference_ctxpolicy.html#interpret_pragma">interpret_pragma</a>(ContextT <span class="keyword">const</span> &amp;ctx, ContainerT &amp;pending, 
         <span class="keyword">typename</span> ContextT::token_type <span class="keyword">const</span> &amp;option, 
         ContainerT <span class="keyword">const</span> &amp;values, 
@@ -331,16 +290,13 @@
 <h3>Macro definition </h3>
 <p><strong><a name="defined_macro" id="defined_macro"></a>defined_macro</strong></p>
 <pre>    <span class="keyword">template</span> &lt;
-        <span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> TokenT, <span class="keyword">typename</span> ParametersT, <span class="keyword">
-        typename</span> DefinitionT
+        <span class="keyword">typename</span> TokenT, <span class="keyword">typename</span> ParametersT, <span class="keyword">typename</span> DefinitionT
     &gt;
-    <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#defined_macro">defined_macro</a>(ContextT <span class="keyword">const</span>&amp; ctx, 
-        TokenT <span class="keyword">const</span> &amp;name, <span class="keyword">bool</span> is_functionlike,
+    <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#defined_macro">defined_macro</a>(TokenT <span class="keyword">const</span> &amp;name, <span class="keyword">bool</span> is_functionlike,
         ParametersT <span class="keyword">const</span> &amp;parameters, DefinitionT <span class="keyword">const</span> &amp;definition,
         <span class="keyword">bool</span> is_predefined);
 </pre>
 <blockquote>  <p>The function <tt>defined_macro</tt> is called whenever a macro was defined successfully.</p>
-  <p>The <tt>ctx</tt> parameter provides a reference to the <tt>context_type</tt> used during instantiation of the preprocessing iterators by the user. Note, this parameter was added for the Boost V1.35.0 release. </p>
   <p>The parameter <tt>name</tt> is a reference to the token holding the macro name.</p>
   <p>The parameter <tt>is_functionlike</tt> is set to true whenever the newly 
     defined macro is defined as a function like macro.</p>
@@ -354,13 +310,12 @@
   </p>
 </blockquote>
 <p><strong><a name="undefined_macro" id="undefined_macro"></a>undefined_macro</strong></p>
-<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ContextT, <span class="keyword">typename</span> TokenT&gt;
-    <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#undefined_macro">undefined_macro</a>(ContextT <span class="keyword">const</span>&amp; ctx, TokenT <span class="keyword">const</span> &amp;name);
+<pre>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> TokenT&gt;
+    <span class="keyword">void</span> <a href="class_reference_ctxpolicy.html#undefined_macro">undefined_macro</a>(TokenT<span class="keyword">const</span> &amp;name);
 </pre>
 <blockquote>
   <p>The function <tt>undefined_macro</tt> is called whenever a macro definition
     was removed successfully.</p>
-  <p>The <tt>ctx</tt> parameter provides a reference to the <tt>context_type</tt> used during instantiation of the preprocessing iterators by the user. Note, this parameter was added for the Boost V1.35.0 release. </p>
   <p>The parameter <tt>name</tt> holds the token of the macro which definition was removed.<br>
   </p>
 </blockquote>
@@ -373,11 +328,11 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
 <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <p class="copyright"><span class="updated">Last updated: 
-  <!-- #BeginDate format:fcAm1m -->Tuesday, May 23, 2006  12:50<!-- #EndDate -->
+  <!-- #BeginDate format:fcAm1m -->Sunday, February 26, 2006  14:19<!-- #EndDate -->
 </span></p>
 </body>
 </html>

Modified: boost/trunk/libs/wave/doc/class_reference_filepos.html
===================================================================
--- boost/trunk/libs/wave/doc/class_reference_filepos.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/class_reference_filepos.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -109,7 +109,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
 <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <p class="copyright"><span class="updated">Last updated: 

Modified: boost/trunk/libs/wave/doc/class_reference_inptpolcy.html
===================================================================
--- boost/trunk/libs/wave/doc/class_reference_inptpolcy.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/class_reference_inptpolcy.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -121,7 +121,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
   <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>

Modified: boost/trunk/libs/wave/doc/class_reference_lexer.html
===================================================================
--- boost/trunk/libs/wave/doc/class_reference_lexer.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/class_reference_lexer.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -93,7 +93,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
 <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <p class="copyright"><span class="updated">Last updated: 

Modified: boost/trunk/libs/wave/doc/class_reference_tokentype.html
===================================================================
--- boost/trunk/libs/wave/doc/class_reference_tokentype.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/class_reference_tokentype.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -165,7 +165,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
   <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>

Modified: boost/trunk/libs/wave/doc/compiletime_config.html
===================================================================
--- boost/trunk/libs/wave/doc/compiletime_config.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/compiletime_config.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -113,10 +113,6 @@
     <td class="table_cells"><p>If this is defined to a string literal it will be used as the pragma keyword recogniyed by the library as specific Wave pragma's. This constant defaults to <span class="literal">&quot;wave&quot;</span>, i.e. the library recognizes all      <span class="preprocessor">#pragma wave option [(argument)]</span>  directives and dispatches the handling to the interpret_pragma() preprocessing hook function (see: <a href="class_reference_ctxpolicy.html">Preprocessing Hooks</a>). The arguments part of the  pragma is optional.<br>
       </p>    </td>
   </tr>
-  <tr>
-    <td class="table_cells"><code>BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS</code></td>
-    <td class="table_cells"><p>If defined to something not equal to zero (<span class="literal">'0'</span>) Wave will be compiled to use the depreciated preprocessing hooks. The interface of the preprocessing hooks has been changed after the Boost V1.34.x releases. This constant allows to compile applications using the older interface. </p></td>
-  </tr>
 </table>
 <P dir="ltr"><b><a name="using_custom_lexer"></a>Using a different token type or lexer type in conjunction with Wave </b></P>
 <P dir="ltr">It is possible to use the <tt>Wave</tt> library while using your own token and/or lexer types. This may be achieved by providing your lexer type as the second template parameter while instantiating the <tt>boost::wave::context&lt;&gt;</tt> object. The token type used by the library is derived from the <tt>token_type</tt> typedef to be provided by the lexer type. If you want to provide your own token type only, you may use the <tt>boost::wave::lex_iterator&lt;&gt;</tt> type contained with the library. This type needs to be parametrized with the token type to use. </P>
@@ -210,12 +206,12 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
 <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>
 <p class="copyright"><span class="updated">Last updated: 
-  <!-- #BeginDate format:fcAm1m -->Tuesday, May 23, 2006  11:46<!-- #EndDate -->
+  <!-- #BeginDate format:fcAm1m -->Tuesday, May 2, 2006  17:10<!-- #EndDate -->
 </span></p>
 </body>
 </html>

Modified: boost/trunk/libs/wave/doc/introduction.html
===================================================================
--- boost/trunk/libs/wave/doc/introduction.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/introduction.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -82,7 +82,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
 <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>

Modified: boost/trunk/libs/wave/doc/macro_expansion_process.html
===================================================================
--- boost/trunk/libs/wave/doc/macro_expansion_process.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/macro_expansion_process.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -88,7 +88,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
 <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>

Modified: boost/trunk/libs/wave/doc/predefined_macros.html
===================================================================
--- boost/trunk/libs/wave/doc/predefined_macros.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/predefined_macros.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -167,7 +167,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
   <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>

Modified: boost/trunk/libs/wave/doc/preface.html
===================================================================
--- boost/trunk/libs/wave/doc/preface.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/preface.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -99,7 +99,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
 <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>

Modified: boost/trunk/libs/wave/doc/quickstart.html
===================================================================
--- boost/trunk/libs/wave/doc/quickstart.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/quickstart.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -29,12 +29,12 @@
 options you can define:</p>
 <BLOCKQUOTE dir="ltr" style="MARGIN-RIGHT: 0px"> 
   <P><STRONG><IMG id="IMG1" height="13" src="theme/bullet.gif" width="13"></STRONG>&nbsp;include 
-    search paths, which define, where to search for files to be included with 
+    search paths defining where to search for files to be included with 
     <tt>#include&nbsp;&lt;...&gt;</tt> and <tt>#include&nbsp;"..."</tt> directives<br>
     <STRONG><img src="theme/bullet.gif" width="13" height="13">&nbsp;</STRONG>which 
     macros to predefine and which of the predefined macros to undefine<br>
     <STRONG><img src="theme/bullet.gif" width="13" height="13">&nbsp;</STRONG>whether to enable any of several extensions to the C++
-Standard (such as for variadics and placemarkers)<br>
+Standard (such as for variadics and placemarkers)
   </P>
 </BLOCKQUOTE>
 <p>You can access all these processing parameters through the <tt>boost::wave::context</tt> 
@@ -44,7 +44,7 @@
   the <tt>boost::wave::context</tt> object you have to supply at least two template parameters: 
   the iterator type of the underlying input stream to use and the type of the lexer iterator to be used as the token source for the preprocessing engine.</p>
 <P dir="ltr">Do not instantiate the main preprocessing iterators yourself.
-Get them from the wave::context object instead.<br>
+Get them from the wave::context object instead.
 The following code snippet is taken from the <tt>quick_start</tt> sample, which shows a minimal usage scenario for <tt>Wave</tt>. </P>
 <pre><span class="comment">    // The following preprocesses a given input file.
     // Open the file and read it into a string variable</span>
@@ -91,14 +91,14 @@
 <P dir="ltr">The constructor of the <tt>boost::wave::context</tt> object can 
   take a pair of arbitrary iterator types (at least <tt>input_iterator</tt> type 
   iterators) to the input stream, which must supply the data to be processed. 
-  The third parameter supplies a filename, filename, which is reported in the preprocessor output to
+  The third parameter supplies a filename, which is reported in the preprocessor output to
 indicate the current context. 
 Note though, that this filename is used 
   only as long as no <tt>#include</tt> or <tt>#line</tt> directives are encountered, 
-  which in turn will alter the current filename reported.</P>
-<P dir="ltr">The iteration over the preprocessed tokens is relativley straightforward. Just get the starting and the ending iterators from the context object 
+  which in turn will alter the current reported filename.</P>
+<P dir="ltr">The iteration over the preprocessed tokens is relatively straightforward. Just get the starting and the ending iterators from the context object 
   (maybe after initializing some include search paths) and you are done! Dereferencing 
-  the iterator will return the preprocessed tokens, which are generated on 
+  the iterator will return the preprocessed tokens generated on 
   the fly from the input stream. (To get further information about the token type, 
   you may want to look <a href="class_reference_tokentype.html">here</a>.)</P>
 <table border="0">
@@ -110,12 +110,12 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
 <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>
 <p class="copyright"><span class="updated">Last updated: 
-  <!-- #BeginDate format:fcAm1m -->Sunday, May 15, 2005  12:23<!-- #EndDate -->
+  <!-- #BeginDate format:fcAm1m -->Wednesday, July 26, 2006  19:28<!-- #EndDate -->
 </span></p>
 </body>
 </html>

Modified: boost/trunk/libs/wave/doc/references.html
===================================================================
--- boost/trunk/libs/wave/doc/references.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/references.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -89,7 +89,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
   <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>

Modified: boost/trunk/libs/wave/doc/samples.html
===================================================================
--- boost/trunk/libs/wave/doc/samples.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/samples.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -99,7 +99,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
     <br>
 <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>

Modified: boost/trunk/libs/wave/doc/supported_pragmas.html
===================================================================
--- boost/trunk/libs/wave/doc/supported_pragmas.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/supported_pragmas.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -128,7 +128,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
 <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>

Modified: boost/trunk/libs/wave/doc/token_ids.html
===================================================================
--- boost/trunk/libs/wave/doc/token_ids.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/token_ids.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -970,7 +970,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
   <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>

Modified: boost/trunk/libs/wave/doc/tracing_facility.html
===================================================================
--- boost/trunk/libs/wave/doc/tracing_facility.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/tracing_facility.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -149,7 +149,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
 <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <p class="copyright"><span class="updated">Last updated: 

Modified: boost/trunk/libs/wave/doc/wave_driver.html
===================================================================
--- boost/trunk/libs/wave/doc/wave_driver.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/doc/wave_driver.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -261,7 +261,7 @@
   </tr>
 </table>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
 <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>

Modified: boost/trunk/libs/wave/index.html
===================================================================
--- boost/trunk/libs/wave/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -42,12 +42,8 @@
   </tr>
   <tr> 
     <td class="toc_cells_L1"><a href="doc/class_reference_ctxpolicy.html">The Context 
-      Policy (new, upcoming interface) </a></td>
+      Policy </a></td>
   </tr>
-  <tr>
-    <td class="toc_cells_L1"><a href="doc/class_ref_ctxpolicy_depr.html">The Context 
-      Policy (current, but depreciated interface) </a></td>
-  </tr>
   <tr> 
     <td class="toc_cells_L1"><a href="doc/class_reference_lexer.html">The Lexer Iterator Interface 
       </a></td>
@@ -99,12 +95,12 @@
 </table>
 <br>
 <hr size="1">
-<p class="copyright">Copyright &copy; 2003-2006 Hartmut Kaiser<br>
+<p class="copyright">Copyright &copy; 2003-2007 Hartmut Kaiser<br>
   <br>
 <font size="2">Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) </font> </p>
 <span class="updated"></span>
 <p class="copyright"><span class="updated">Last updated: 
-  <!-- #BeginDate format:fcAm1m -->Tuesday, May 23, 2006  12:37<!-- #EndDate -->
+  <!-- #BeginDate format:fcAm1m -->Saturday, February 25, 2006  15:43<!-- #EndDate -->
 </span></p>
 </body>
 </html>

Modified: boost/trunk/libs/wave/samples/advanced_hooks/advanced_hooks.cpp
===================================================================
--- boost/trunk/libs/wave/samples/advanced_hooks/advanced_hooks.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/advanced_hooks/advanced_hooks.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -23,7 +23,7 @@
 #include <boost/wave/cpplexer/cpp_lex_token.hpp>    // token class
 #include <boost/wave/cpplexer/cpp_lex_iterator.hpp> // lexer class
 
-#include "advanced_preprocessing_hooks.hpp"
+#include "advanced_hooks.hpp"
 
 ///////////////////////////////////////////////////////////////////////////////
 //  Main entry point
@@ -82,6 +82,10 @@
     // scenes during iteration over the context_type::iterator_type stream.
     context_type ctx (instring.begin(), instring.end(), argv[1]);
 
+    ctx.set_language(boost::wave::enable_long_long(ctx.get_language()));
+    ctx.set_language(boost::wave::enable_preserve_comments(ctx.get_language()));
+    ctx.set_language(boost::wave::enable_prefer_pp_numbers(ctx.get_language()));
+
     // analyze the input file, print out the preprocessed tokens
     context_type::iterator_type first = ctx.begin();
     context_type::iterator_type last = ctx.end();
@@ -92,14 +96,14 @@
             ++first;
         }
     }
-    catch (boost::wave::cpp_exception &e) {
+    catch (boost::wave::cpp_exception const& e) {
     // some preprocessing error
         std::cerr 
             << e.file_name() << "(" << e.line_no() << "): "
             << e.description() << std::endl;
         return 2;
     }
-    catch (std::exception &e) {
+    catch (std::exception const& e) {
     // use last recognized token to retrieve the error position
         std::cerr 
             << current_position.get_file() 

Copied: boost/trunk/libs/wave/samples/advanced_hooks/advanced_hooks.hpp (from rev 14034, boost/branches/upstream/current/libs/wave/samples/advanced_hooks/advanced_hooks.hpp)

Deleted: boost/trunk/libs/wave/samples/advanced_hooks/advanced_preprocessing_hooks.hpp
===================================================================
--- boost/trunk/libs/wave/samples/advanced_hooks/advanced_preprocessing_hooks.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/advanced_hooks/advanced_preprocessing_hooks.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,136 +0,0 @@
-/*=============================================================================
-    Boost.Wave: A Standard compliant C++ preprocessor library
-    http://www.boost.org/
-
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
-    Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-=============================================================================*/
-
-#if !defined(BOOST_WAVE_ADVANCED_PREPROCESSING_HOOKS_INCLUDED)
-#define BOOST_WAVE_ADVANCED_PREPROCESSING_HOOKS_INCLUDED
-
-#include <cstdio>
-#include <ostream>
-#include <string>
-
-#include <boost/assert.hpp>
-#include <boost/config.hpp>
-
-#include <boost/wave/token_ids.hpp>
-#include <boost/wave/util/macro_helpers.hpp>
-#include <boost/wave/preprocessing_hooks.hpp>
-
-///////////////////////////////////////////////////////////////////////////////
-//  
-//  The advanced_preprocessing_hooks policy class is used to register some
-//  of the more advanced (and probably more rarely used hooks with the Wave
-//  library.
-//
-//  This policy type is used as a template parameter to the boost::wave::context<>
-//  object.
-//
-///////////////////////////////////////////////////////////////////////////////
-class advanced_preprocessing_hooks
-:   public boost::wave::context_policies::default_preprocessing_hooks
-{
-public:
-    advanced_preprocessing_hooks() : need_comment(true) {}
-    
-    ///////////////////////////////////////////////////////////////////////////
-    //
-    //  The function 'found_directive' is called, whenever a preprocessor 
-    //  directive was encountered, but before the corresponding action is 
-    //  executed.
-    //
-    //  The parameter 'directive' is a reference to the token holding the 
-    //  preprocessing directive.
-    //
-    ///////////////////////////////////////////////////////////////////////////
-    template <typename TokenT>
-    void
-    found_directive(TokenT const& directive)
-    {
-        // print the commented conditional directives
-        using namespace boost::wave;
-        token_id id = token_id(directive);
-        switch (id) {
-        case T_PP_IFDEF:
-        case T_PP_IFNDEF:
-        case T_PP_IF:
-        case T_PP_ELIF:
-            std::cout << "// " << directive.get_value() << " ";
-            break;
-            
-        case T_PP_ELSE:
-        case T_PP_ENDIF:
-            std::cout << "// " << directive.get_value() << std::endl;
-            need_comment = true;
-            break;
-
-        default:
-            break;
-        }
-    }
-
-    ///////////////////////////////////////////////////////////////////////////
-    //
-    //  The function 'evaluated_conditional_expression' is called, whenever a 
-    //  conditional preprocessing expression was evaluated (the expression
-    //  given to a #if, #elif, #ifdef or #ifndef directive)
-    //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
-    //  The parameter 'expression' holds the non-expanded token sequence
-    //  comprising the evaluated expression.
-    //
-    //  The parameter 'expression_value' contains the result of the evaluation 
-    //  of the expression in the current preprocessing context.
-    //
-    //  The return value defines, whether the given expression has to be 
-    //  evaluated again, allowing to decide which of the conditional branches
-    //  should be expanded. You need to return 'true' from this hook function 
-    //  to force the expression to be re-evaluated.
-    //
-    ///////////////////////////////////////////////////////////////////////////
-    template <typename ContextT, typename ContainerT>
-    bool
-    evaluated_conditional_expression(ContextT const &ctx, 
-        ContainerT const& expression, bool expression_value)
-    {
-        // print the conditional expressions
-        std::cout << boost::wave::util::impl::as_string(expression) << std::endl;
-        need_comment = true;
-        return false;          // ok to continue, do not re-evaluate expression
-    }
-    
-    ///////////////////////////////////////////////////////////////////////////
-    //
-    //  The function 'skipped_token' is called, whenever a token is about to be
-    //  skipped due to a false preprocessor condition (code fragments to be
-    //  skipped inside the not evaluated conditional #if/#else/#endif branches).
-    //
-    //  The parameter 'token' refers to the token to be skipped.
-    //  
-    ///////////////////////////////////////////////////////////////////////////
-    template <typename TokenT>
-    void
-    skipped_token(TokenT const& token)
-    {
-        // prepend a comment at the beginning of all skipped lines
-        using namespace boost::wave;
-        if (need_comment) {
-            std::cout << "// ";
-            need_comment = false;
-        }
-        std::cout << token.get_value();
-        if (token_id(token) == T_NEWLINE || token_id(token) == T_CPPCOMMENT) 
-            need_comment = true;
-    }
-
-private:
-    bool need_comment;
-};
-
-#endif // !defined(BOOST_WAVE_ADVANCED_PREPROCESSING_HOOKS_INCLUDED)

Deleted: boost/trunk/libs/wave/samples/advanced_hooks/build/Jamfile
===================================================================
--- boost/trunk/libs/wave/samples/advanced_hooks/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/advanced_hooks/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,25 +0,0 @@
-# Boost.Wave: A Standard compliant C++ preprocessor library
-#
-# Boost Wave Library Sample Build Jamfile (advanced_hooks)
-#
-# http://www.boost.org/
-#
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
-# Software License, Version 1.0. (See accompanying file 
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-subproject libs/wave/samples/advanced_hooks/build ;
-
-exe advanced_hooks
-    : ../advanced_hooks.cpp 
-      <lib>../../../build/boost_wave
-      <lib>../../../../../libs/filesystem/build/boost_filesystem
-    :
-      <sysinclude>$(BOOST_ROOT)
-      <vc-7_1><*><rtti>off        # workaround for compiler bug
-      <vc-7_1-stlport><*><rtti>off
-    :
-      <runtime-link>static
-      <threading>single
-    ;
-

Modified: boost/trunk/libs/wave/samples/advanced_hooks/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/wave/samples/advanced_hooks/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/advanced_hooks/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,14 +4,12 @@
 #
 # http://www.boost.org/
 #
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+# Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
 # Software License, Version 1.0. (See accompanying file 
 # LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 exe advanced_hooks
     :   ../advanced_hooks.cpp 
         /boost/wave//boost_wave
-    :
-        <toolset-msvc:version>7.1:<rtti>off   # workaround for compiler bug
     ;  
 

Deleted: boost/trunk/libs/wave/samples/cpp_tokens/build/Jamfile
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,31 +0,0 @@
-# Boost.Wave: A Standard compliant C++ preprocessor library
-#
-# Boost Wave Library Sample Build Jamfile (cpp_tokens)
-#
-# http://www.boost.org/
-#
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
-# Software License, Version 1.0. (See accompanying file 
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-subproject libs/wave/samples/cpp_tokens/build ;
-
-exe cpp_tokens
-    : ../cpp_tokens.cpp 
-      ../instantiate_cpp_exprgrammar.cpp 
-      ../instantiate_cpp_grammar.cpp 
-      ../instantiate_cpp_literalgrs.cpp 
-      ../instantiate_defined_grammar.cpp 
-      ../instantiate_slex_lexer.cpp 
-      <lib>../../../build/boost_wave
-      <lib>../../../../../libs/program_options/build/boost_program_options
-      <lib>../../../../../libs/filesystem/build/boost_filesystem
-    :
-      <sysinclude>$(BOOST_ROOT)
-      <vc-7_1><*><rtti>off        # workaround for compiler bug
-      <vc-7_1-stlport><*><rtti>off
-    :
-      <runtime-link>static
-      <threading>single
-    ;
-

Modified: boost/trunk/libs/wave/samples/cpp_tokens/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,20 +4,30 @@
 #
 # http://www.boost.org/
 #
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+# Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
 # Software License, Version 1.0. (See accompanying file 
 # LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
+SOURCES =
+		../cpp_tokens 
+        ../instantiate_cpp_exprgrammar 
+        ../instantiate_cpp_grammar 
+        ../instantiate_cpp_literalgrs
+        ../instantiate_defined_grammar
+        ../instantiate_slex_lexer 
+    ;
+
 exe cpp_tokens
-    :   ../cpp_tokens.cpp 
-        ../instantiate_cpp_exprgrammar.cpp 
-        ../instantiate_cpp_grammar.cpp 
-        ../instantiate_cpp_literalgrs.cpp 
-        ../instantiate_defined_grammar.cpp 
-        ../instantiate_slex_lexer.cpp 
+    :
+        $(SOURCES)
         /boost/wave//boost_wave
         /boost/program_options//boost_program_options
-    :
-        <toolset-msvc:version>7.1:<rtti>off   # workaround for compiler bug
+        /boost/filesystem//boost_filesystem     
     ;
 
+for local source in $(SOURCES)
+{
+    local requirements ;
+    requirements += <toolset-msvc:version>7.1:<rtti>off ; # workaround for compiler bug
+    obj $(source) : $(source).cpp : $(requirements) ;
+}

Modified: boost/trunk/libs/wave/samples/cpp_tokens/cpp_tokens.cpp
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/cpp_tokens.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/cpp_tokens.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,7 +8,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -107,14 +107,14 @@
             ++first;
         }
     }
-    catch (boost::wave::cpp_exception &e) {
+    catch (boost::wave::cpp_exception const& e) {
     // some preprocessing error
         cerr 
             << e.file_name() << "(" << e.line_no() << "): "
             << e.description() << endl;
         return 2;
     }
-    catch (std::exception &e) {
+    catch (std::exception const& e) {
     // use last recognized token to retrieve the error position
         cerr 
             << current_token.get_position().get_file() 

Modified: boost/trunk/libs/wave/samples/cpp_tokens/cpp_tokens.hpp
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/cpp_tokens.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/cpp_tokens.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -8,7 +8,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/cpp_tokens/cpp_tokens_config.hpp
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/cpp_tokens_config.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/cpp_tokens_config.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
         
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/cpp_tokens/instantiate_cpp_exprgrammar.cpp
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/instantiate_cpp_exprgrammar.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/instantiate_cpp_exprgrammar.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/cpp_tokens/instantiate_cpp_grammar.cpp
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/instantiate_cpp_grammar.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/instantiate_cpp_grammar.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -16,6 +16,7 @@
 #if BOOST_WAVE_SEPARATE_GRAMMAR_INSTANTIATION != 0
 
 #include <string>
+#include <list>
 
 #include <boost/wave/token_ids.hpp>
 
@@ -33,10 +34,12 @@
 //
 ///////////////////////////////////////////////////////////////////////////////
 
-typedef boost::wave::cpplexer::slex::slex_iterator<
-        boost::wave::cpplexer::slex_token<> >
-    lexer_type;
-template struct boost::wave::grammars::cpp_grammar_gen<lexer_type>;
+typedef boost::wave::cpplexer::slex_token<> token_type;
+typedef boost::wave::cpplexer::slex::slex_iterator<token_type> lexer_type;
+typedef std::list<token_type, boost::fast_pool_allocator<token_type> > 
+    token_sequence_type;
+    
+template struct boost::wave::grammars::cpp_grammar_gen<lexer_type, token_sequence_type>;
 
 #endif // #if BOOST_WAVE_SEPARATE_GRAMMAR_INSTANTIATION != 0
 

Modified: boost/trunk/libs/wave/samples/cpp_tokens/instantiate_cpp_literalgrs.cpp
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/instantiate_cpp_literalgrs.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/instantiate_cpp_literalgrs.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/cpp_tokens/instantiate_defined_grammar.cpp
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/instantiate_defined_grammar.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/instantiate_defined_grammar.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/cpp_tokens/instantiate_slex_lexer.cpp
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/instantiate_slex_lexer.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/instantiate_slex_lexer.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/cpp_tokens/slex/cpp_slex_lexer.hpp
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/slex/cpp_slex_lexer.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/slex/cpp_slex_lexer.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -566,11 +566,11 @@
     typedef typename lexer::lexer<IteratorT, PositionT>::token_type token_type;
 
     slex_functor(IteratorT const &first_, IteratorT const &last_, 
-            PositionT const &pos_, boost::wave::language_support language)
-    :   first(first_, last_, pos_), language(language), at_eof(false)
+            PositionT const &pos_, boost::wave::language_support language_)
+    :   first(first_, last_, pos_), language(language_), at_eof(false)
     {
         // initialize lexer dfa tables
-        init_lexer(lexer, language);  
+        init_lexer(lexer, language_);  
     }
     virtual ~slex_functor() {}
 

Modified: boost/trunk/libs/wave/samples/cpp_tokens/slex/lexer.hpp
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/slex/lexer.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/slex/lexer.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
     http://www.boost.org/
 
     Copyright (c) 2001, Daniel C. Nuffer.
-    Copyright (c) 2001-2006 Hartmut Kaiser. 
+    Copyright (c) 2001-2007 Hartmut Kaiser. 
     Distributed under the Boost Software License, Version 1.0. (See accompanying 
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 

Modified: boost/trunk/libs/wave/samples/cpp_tokens/slex_interface.hpp
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/slex_interface.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/slex_interface.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/cpp_tokens/slex_iterator.hpp
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/slex_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/slex_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/cpp_tokens/slex_token.hpp
===================================================================
--- boost/trunk/libs/wave/samples/cpp_tokens/slex_token.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/cpp_tokens/slex_token.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Deleted: boost/trunk/libs/wave/samples/lexed_tokens/build/Jamfile
===================================================================
--- boost/trunk/libs/wave/samples/lexed_tokens/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/lexed_tokens/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,25 +0,0 @@
-# Boost.Wave: A Standard compliant C++ preprocessor library
-#
-# Boost Wave Library Sample Build Jamfile (lexed_tokens)
-#
-# http://www.boost.org/
-#
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
-# Software License, Version 1.0. (See accompanying file 
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-subproject libs/wave/samples/lexed_tokens/build ;
-
-exe lexed_tokens
-    : ../lexed_tokens.cpp 
-      <lib>../../../build/boost_wave
-      <lib>../../../../../libs/filesystem/build/boost_filesystem
-    :
-      <sysinclude>$(BOOST_ROOT)
-      <vc-7_1><*><rtti>off        # workaround for compiler bug
-      <vc-7_1-stlport><*><rtti>off
-    :
-      <runtime-link>static
-      <threading>single
-    ;
-

Modified: boost/trunk/libs/wave/samples/lexed_tokens/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/wave/samples/lexed_tokens/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/lexed_tokens/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,14 +4,13 @@
 #
 # http://www.boost.org/
 #
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+# Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
 # Software License, Version 1.0. (See accompanying file 
 # LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 exe lexed_tokens
     :   ../lexed_tokens.cpp 
         /boost/wave//boost_wave
-    :
-        <toolset-msvc:version>7.1:<rtti>off   # workaround for compiler bug
+        /boost/filesystem//boost_filesystem
     ;  
 

Modified: boost/trunk/libs/wave/samples/lexed_tokens/lexed_tokens.cpp
===================================================================
--- boost/trunk/libs/wave/samples/lexed_tokens/lexed_tokens.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/lexed_tokens/lexed_tokens.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -123,14 +123,14 @@
             ++it;
         }
     }
-    catch (boost::wave::cpplexer::lexing_exception &e) {
+    catch (boost::wave::cpplexer::lexing_exception const& e) {
     // some lexing error
         std::cerr 
             << e.file_name() << "(" << e.line_no() << "): "
             << e.description() << std::endl;
         return 2;
     }
-    catch (std::exception &e) {
+    catch (std::exception const& e) {
     // use last recognized token to retrieve the error position
         std::cerr 
             << current_position.get_file() 

Deleted: boost/trunk/libs/wave/samples/list_includes/build/Jamfile
===================================================================
--- boost/trunk/libs/wave/samples/list_includes/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/list_includes/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,26 +0,0 @@
-# Boost.Wave: A Standard compliant C++ preprocessor library
-#
-# Boost Wave Library Sample Build Jamfile (list_includes)
-#
-# http://www.boost.org/
-#
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
-# Software License, Version 1.0. (See accompanying file 
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-subproject libs/wave/samples/list_includes/build ;
-
-exe list_includes
-    : ../list_includes.cpp 
-      <lib>../../../build/boost_wave
-      <lib>../../../../../libs/program_options/build/boost_program_options
-      <lib>../../../../../libs/filesystem/build/boost_filesystem
-    :
-      <sysinclude>$(BOOST_ROOT)
-      <vc-7_1><*><rtti>off        # workaround for compiler bug
-      <vc-7_1-stlport><*><rtti>off
-    :
-      <runtime-link>static
-      <threading>single
-    ;
-

Modified: boost/trunk/libs/wave/samples/list_includes/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/wave/samples/list_includes/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/list_includes/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
 #
 # http://www.boost.org/
 #
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+# Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
 # Software License, Version 1.0. (See accompanying file 
 # LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -13,7 +13,5 @@
         /boost/wave//boost_wave
         /boost/program_options//boost_program_options     
         /boost/filesystem//boost_filesystem     
-    :
-        <toolset-msvc:version>7.1:<rtti>off   # workaround for compiler bug
     ;
 

Modified: boost/trunk/libs/wave/samples/list_includes/list_includes.cpp
===================================================================
--- boost/trunk/libs/wave/samples/list_includes/list_includes.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/list_includes/list_includes.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,7 +11,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/list_includes/list_includes.hpp
===================================================================
--- boost/trunk/libs/wave/samples/list_includes/list_includes.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/list_includes/list_includes.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
         
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/list_includes/list_includes_config.hpp
===================================================================
--- boost/trunk/libs/wave/samples/list_includes/list_includes_config.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/list_includes/list_includes_config.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/list_includes/list_includes_version.hpp
===================================================================
--- boost/trunk/libs/wave/samples/list_includes/list_includes_version.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/list_includes/list_includes_version.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
             
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Deleted: boost/trunk/libs/wave/samples/quick_start/build/Jamfile
===================================================================
--- boost/trunk/libs/wave/samples/quick_start/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/quick_start/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,25 +0,0 @@
-# Boost.Wave: A Standard compliant C++ preprocessor library
-#
-# Boost Wave Library Sample Build Jamfile (quick_start)
-#
-# http://www.boost.org/
-#
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
-# Software License, Version 1.0. (See accompanying file 
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-subproject libs/wave/samples/quick_start/build ;
-
-exe quick_start
-    : ../quick_start.cpp 
-      <lib>../../../build/boost_wave
-      <lib>../../../../../libs/filesystem/build/boost_filesystem
-    :
-      <sysinclude>$(BOOST_ROOT)
-      <vc-7_1><*><rtti>off        # workaround for compiler bug
-      <vc-7_1-stlport><*><rtti>off
-    :
-      <runtime-link>static
-      <threading>single
-    ;
-

Modified: boost/trunk/libs/wave/samples/quick_start/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/wave/samples/quick_start/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/quick_start/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,14 +4,12 @@
 #
 # http://www.boost.org/
 #
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+# Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
 # Software License, Version 1.0. (See accompanying file 
 # LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 exe quick_start
     :   ../quick_start.cpp 
         /boost/wave//boost_wave
-    :
-        <toolset-msvc:version>7.1:<rtti>off   # workaround for compiler bug
     ;  
 

Modified: boost/trunk/libs/wave/samples/quick_start/quick_start.cpp
===================================================================
--- boost/trunk/libs/wave/samples/quick_start/quick_start.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/quick_start/quick_start.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -80,14 +80,14 @@
             ++first;
         }
     }
-    catch (boost::wave::cpp_exception &e) {
+    catch (boost::wave::cpp_exception const& e) {
     // some preprocessing error
         std::cerr 
             << e.file_name() << "(" << e.line_no() << "): "
             << e.description() << std::endl;
         return 2;
     }
-    catch (std::exception &e) {
+    catch (std::exception const& e) {
     // use last recognized token to retrieve the error position
         std::cerr 
             << current_position.get_file() 

Deleted: boost/trunk/libs/wave/samples/waveidl/build/Jamfile
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,32 +0,0 @@
-# Boost.Wave: A Standard compliant C++ preprocessor library
-#
-# Boost Wave Library Sample Build Jamfile (waveidl)
-#
-# http://www.boost.org/
-#
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
-# Software License, Version 1.0. (See accompanying file 
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-subproject libs/wave/samples/waveidl/build ;
-
-exe waveidl
-    : ../idl.cpp 
-      ../instantiate_cpp_grammar.cpp
-      ../instantiate_defined_grammar.cpp
-      ../instantiate_predef_macros.cpp
-      ../instantiate_re2c_lexer.cpp
-      ../instantiate_re2c_lexer_string.cpp
-      ../idllexer/idl_re.cpp
-      <lib>../../../build/boost_wave
-      <lib>../../../../../libs/program_options/build/boost_program_options
-      <lib>../../../../../libs/filesystem/build/boost_filesystem
-    :
-      <sysinclude>$(BOOST_ROOT)
-      <vc-7_1><*><rtti>off        # workaround for compiler bug
-      <vc-7_1-stlport><*><rtti>off
-    :
-      <runtime-link>static
-      <threading>single
-    ;
-

Modified: boost/trunk/libs/wave/samples/waveidl/build/Jamfile.v2
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,21 +4,31 @@
 #
 # http://www.boost.org/
 #
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+# Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
 # Software License, Version 1.0. (See accompanying file 
 # LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
+SOURCES = 
+        ../idl
+        ../instantiate_cpp_grammar
+        ../instantiate_defined_grammar
+        ../instantiate_predef_macros
+        ../instantiate_re2c_lexer
+        ../instantiate_re2c_lexer_str
+        ../idllexer/idl_re
+	;
+	
 exe waveidl
-    :   ../idl.cpp 
-        ../instantiate_cpp_grammar.cpp
-        ../instantiate_defined_grammar.cpp
-        ../instantiate_predef_macros.cpp
-        ../instantiate_re2c_lexer.cpp
-        ../instantiate_re2c_lexer_string.cpp
-        ../idllexer/idl_re.cpp
+    :
+		$(SOURCES)
         /boost/wave//boost_wave
         /boost/program_options//boost_program_options
-    :
-        <toolset-msvc:version>7.1:<rtti>off   # workaround for compiler bug
     ;
 
+for local source in $(SOURCES)
+{
+    local requirements ;
+    requirements += <toolset-msvc:version>7.1:<rtti>off ; # workaround for compiler bug
+    obj $(source) : $(source).cpp : $(requirements) ;
+}
+

Modified: boost/trunk/libs/wave/samples/waveidl/idl.cpp
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/idl.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/idl.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -381,21 +381,21 @@
             ++first;        // advance to the next token
         }
     }
-    catch (boost::wave::cpp_exception &e) {
+    catch (boost::wave::cpp_exception const& e) {
     // some preprocessing error
         cerr 
             << e.file_name() << "(" << e.line_no() << "): "
             << e.description() << endl;
         return 1;
     }
-    catch (boost::wave::cpplexer::lexing_exception &e) {
+    catch (boost::wave::cpplexer::lexing_exception const& e) {
     // some lexing error
         cerr 
             << e.file_name() << "(" << e.line_no() << "): "
             << e.description() << endl;
         return 2;
     }
-    catch (std::exception &e) {
+    catch (std::exception const& e) {
     // use last recognized token to retrieve the error position
         cerr 
             << current_position.get_file() 
@@ -525,7 +525,7 @@
     // preprocess the given input file
         return do_actual_work(arguments[0].value[0], vm);
     }
-    catch (std::exception &e) {
+    catch (std::exception const& e) {
         cout << "waveidl: exception caught: " << e.what() << endl;
         return 6;
     }

Modified: boost/trunk/libs/wave/samples/waveidl/idl.hpp
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/idl.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/idl.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/waveidl/idl_config.hpp
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/idl_config.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/idl_config.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/waveidl/idl_version.hpp
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/idl_version.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/idl_version.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/waveidl/idllexer/idl.re
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/idllexer/idl.re	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/idllexer/idl.re	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/waveidl/idllexer/idl_lex_interface.hpp
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/idllexer/idl_lex_interface.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/idllexer/idl_lex_interface.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/waveidl/idllexer/idl_lex_iterator.hpp
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/idllexer/idl_lex_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/idllexer/idl_lex_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/waveidl/idllexer/idl_re.cpp
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/idllexer/idl_re.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/idllexer/idl_re.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/waveidl/idllexer/idl_re.hpp
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/idllexer/idl_re.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/idllexer/idl_re.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost 
     Software License, Version 1.0. (See accompanying file 
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/waveidl/idllexer/idl_re2c_lexer.hpp
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/idllexer/idl_re2c_lexer.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/idllexer/idl_re2c_lexer.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/waveidl/instantiate_cpp_grammar.cpp
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/instantiate_cpp_grammar.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/instantiate_cpp_grammar.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
             
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -16,6 +16,7 @@
 #if BOOST_WAVE_SEPARATE_GRAMMAR_INSTANTIATION != 0
 
 #include <string>
+#include <list>
 
 #include <boost/wave/token_ids.hpp>
 #include <boost/wave/cpplexer/cpp_lex_token.hpp>
@@ -33,10 +34,12 @@
 //
 ///////////////////////////////////////////////////////////////////////////////
 
-typedef boost::wave::idllexer::lex_iterator<
-        boost::wave::cpplexer::lex_token<> >
-    lexer_type;
-template struct boost::wave::grammars::cpp_grammar_gen<lexer_type>;
+typedef boost::wave::cpplexer::lex_token<> token_type;
+typedef boost::wave::idllexer::lex_iterator<token_type> lexer_type;
+typedef std::list<token_type, boost::fast_pool_allocator<token_type> > 
+    token_sequence_type;
+    
+template struct boost::wave::grammars::cpp_grammar_gen<lexer_type, token_sequence_type>;
 
 #endif // #if BOOST_WAVE_SEPARATE_GRAMMAR_INSTANTIATION != 0
 

Modified: boost/trunk/libs/wave/samples/waveidl/instantiate_defined_grammar.cpp
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/instantiate_defined_grammar.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/instantiate_defined_grammar.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/waveidl/instantiate_predef_macros.cpp
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/instantiate_predef_macros.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/instantiate_predef_macros.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/waveidl/instantiate_re2c_lexer.cpp
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/instantiate_re2c_lexer.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/instantiate_re2c_lexer.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/samples/waveidl/instantiate_re2c_lexer_str.cpp
===================================================================
--- boost/trunk/libs/wave/samples/waveidl/instantiate_re2c_lexer_str.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/samples/waveidl/instantiate_re2c_lexer_str.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,7 +6,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/src/cpplexer/re2clex/aq.cpp
===================================================================
--- boost/trunk/libs/wave/src/cpplexer/re2clex/aq.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/cpplexer/re2clex/aq.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
     http://www.boost.org/
 
     Copyright (c) 2001 Daniel C. Nuffer.
-    Copyright (c) 2001-2006 Hartmut Kaiser. 
+    Copyright (c) 2001-2007 Hartmut Kaiser. 
     Distributed under the Boost Software License, Version 1.0. (See accompanying 
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/src/cpplexer/re2clex/cpp.re
===================================================================
--- boost/trunk/libs/wave/src/cpplexer/re2clex/cpp.re	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/cpplexer/re2clex/cpp.re	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
     Boost.Wave: A Standard compliant C++ preprocessor library
 
     Copyright (c) 2001 Daniel C. Nuffer
-    Copyright (c) 2001-2006 Hartmut Kaiser. 
+    Copyright (c) 2001-2007 Hartmut Kaiser. 
     Distributed under the Boost Software License, Version 1.0. (See accompanying 
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -16,7 +16,9 @@
 =============================================================================*/
 
 /*!re2c
+re2c:indent:string = "    "; 
 any                = [\t\v\f\r\n\040-\377];
+anyctrl            = [\001-\037];
 OctalDigit         = [0-7];
 Digit              = [0-9];
 HexDigit           = [a-fA-F0-9];
@@ -32,7 +34,7 @@
 HexQuad            = HexDigit HexDigit HexDigit HexDigit;
 UniversalChar      = Backslash ("u" HexQuad | "U" HexQuad HexQuad);
 Newline            = "\r\n" | "\n" | "\r";
-PPSpace            = ([ \t]|("/*"(any\[*]|Newline|("*"+(any\[*/]|Newline)))*"*"+"/"))*;
+PPSpace            = ([ \t\f\v]|("/*"(any\[*]|Newline|("*"+(any\[*/]|Newline)))*"*"+"/"))*;
 Pound              = "#" | "??=" | "%:";
 NonDigit           = [a-zA-Z_$] | UniversalChar;
 */
@@ -286,23 +288,20 @@
     {
         if(cursor != s->eof) 
         {
-            using namespace std;      // some systems have printf in std
-            if (0 != s->error_proc)
-                (*s->error_proc)(s, "'\\000' in input stream");
-            else
-                printf("Error: 0 in file\n");
+            BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+            (*s->error_proc)(s, "invalid character '\\000' in input stream");
         }
         BOOST_WAVE_RET(T_EOF);
     }
 
-    any
+    any        { BOOST_WAVE_RET(TOKEN_FROM_ID(*s->tok, UnknownTokenType)); }
+
+    anyctrl
     {
-        /* if (0 != s->error_proc)
-            (*s->error_proc)(s, "Unexpected character: '%c'", *s->tok);
-        else
-            printf("unexpected character: '%c'\n", *s->tok);
-        */
-        BOOST_WAVE_RET(TOKEN_FROM_ID(*s->tok, UnknownTokenType));
+        // flag the error
+        BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+        (*s->error_proc)(s, "invalid character '\\%03o' in input stream",
+            *--YYCURSOR);
     }
 */
 
@@ -323,27 +322,26 @@
 
     "\000"
     {
-        using namespace std;      // some systems have printf in std
         if(cursor == s->eof) 
         {
-            if (s->error_proc)
-                (*s->error_proc)(s, "Unterminated comment");
-            else
-                printf("Error: Unterminated comment\n");
+            BOOST_WAVE_UPDATE_CURSOR();   // adjust the input cursor
+            (*s->error_proc)(s, "Unterminated 'C' style comment");
         }
         else
         {
-            if (s->error_proc)
-                (*s->error_proc)(s, "'\\000' in input stream");
-            else
-                printf("Error: 0 in file");
+            --YYCURSOR;                   // next call returns T_EOF
+            BOOST_WAVE_UPDATE_CURSOR();   // adjust the input cursor
+            (*s->error_proc)(s, "invalid character: '\\000' in input stream");
         }
-        /* adjust cursor such next call returns T_EOF */
-        --YYCURSOR;
-        /* the comment is unterminated, but nevertheless its a comment */
-        BOOST_WAVE_RET(T_CCOMMENT);
     }
 
+    anyctrl
+    {
+        // flag the error
+        BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+        (*s->error_proc)(s, "invalid character '\\%03o' in input stream",
+            *--YYCURSOR);
+    }
 */
 
 cppcomment:
@@ -361,19 +359,29 @@
 
     "\000"
     {
-        using namespace std;      // some systems have printf in std
-        if(cursor != s->eof) 
+        if (cursor != s->eof) 
         {
-            if (s->error_proc)
-                (*s->error_proc)(s, "'\\000' in input stream");
-            else
-                printf("Error: 0 in file");
+            --YYCURSOR;                     // next call returns T_EOF
+            BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+            (*s->error_proc)(s, "invalid character '\\000' in input stream");
         }
-        /* adjust cursor such next call returns T_EOF */
-        --YYCURSOR;
-        /* the comment is unterminated, but nevertheless its a comment */
+        
+        --YYCURSOR;                         // next call returns T_EOF
+        if (!s->single_line_only)
+        {
+            BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+            (*s->error_proc)(s, "Unterminated 'C++' style comment");
+        }
         BOOST_WAVE_RET(T_CPPCOMMENT);
     }
+
+    anyctrl
+    {
+        // flag the error
+        BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+        (*s->error_proc)(s, "invalid character '\\%03o' in input stream",
+            *--YYCURSOR);
+    }
 */
 
 /* this subscanner is called whenever a pp_number has been started */

Modified: boost/trunk/libs/wave/src/cpplexer/re2clex/cpp_re.cpp
===================================================================
--- boost/trunk/libs/wave/src/cpplexer/re2clex/cpp_re.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/cpplexer/re2clex/cpp_re.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
     Boost.Wave: A Standard compliant C++ preprocessor library
 
     Copyright (c) 2001 Daniel C. Nuffer
-    Copyright (c) 2001-2006 Hartmut Kaiser. 
+    Copyright (c) 2001-2007 Hartmut Kaiser. 
     Distributed under the Boost Software License, Version 1.0. (See accompanying 
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -64,13 +64,23 @@
 
 #include <iostream>
 
-#define BOOST_WAVE_RET(i)                                                     \
+///////////////////////////////////////////////////////////////////////////////
+#define BOOST_WAVE_UPDATE_CURSOR()                                            \
     {                                                                         \
         s->line += count_backslash_newlines(s, cursor);                       \
         s->curr_column = cursor.column;                                       \
         s->cur = cursor;                                                      \
         s->lim = limit;                                                       \
         s->ptr = marker;                                                      \
+    }                                                                         \
+    /**/
+
+///////////////////////////////////////////////////////////////////////////////
+#define BOOST_WAVE_RET(i)                                                     \
+    {                                                                         \
+        BOOST_WAVE_UPDATE_CURSOR()                                            \
+        if (s->cur > s->lim)                                                  \
+            return T_EOF;     /* may happen for empty files */                \
         return (i);                                                           \
     }                                                                         \
     /**/
@@ -85,13 +95,7 @@
 
 int get_one_char(Scanner *s)
 {
-    if (s->fd != -1) {
-    uchar val;
-    
-        if (read(s->fd, &val, sizeof(val)))
-            return val;
-    }
-    else if (0 != s->act) {
+    if (0 != s->act) {
         RE2C_ASSERT(s->first != 0 && s->last != 0);
         RE2C_ASSERT(s->first <= s->act && s->act <= s->last);
         if (s->act < s->last) 
@@ -102,10 +106,7 @@
 
 std::ptrdiff_t rewind_stream (Scanner *s, int cnt)
 {
-    if (s->fd != -1) {
-        return lseek(s->fd, cnt, SEEK_CUR);
-    }
-    else if (0 != s->act) {
+    if (0 != s->act) {
         RE2C_ASSERT(s->first != 0 && s->last != 0);
         s->act += cnt;
         RE2C_ASSERT(s->first <= s->act && s->act <= s->last);
@@ -231,13 +232,7 @@
             s->bot = buf;
         }
 
-        if (s->fd != -1) {
-            if((cnt = read(s->fd, (char*) s->lim, BOOST_WAVE_BSIZE)) != BOOST_WAVE_BSIZE)
-            {
-                s->eof = &s->lim[cnt]; *(s->eof)++ = '\0';
-            }
-        }
-        else if (s->act != 0) {
+        if (s->act != 0) {
             cnt = s->last - s->act;
             if (cnt > BOOST_WAVE_BSIZE)
                 cnt = BOOST_WAVE_BSIZE;
@@ -403,6 +398,8 @@
 ///////////////////////////////////////////////////////////////////////////////
 boost::wave::token_id scan(Scanner *s)
 {
+    BOOST_ASSERT(0 != s->error_proc);     // error handler must be given
+    
     uchar_wrapper cursor (s->tok = s->cur, s->column = s->curr_column);
     uchar_wrapper marker (s->ptr);
     uchar_wrapper limit (s->lim);

Modified: boost/trunk/libs/wave/src/cpplexer/re2clex/cpp_re.inc
===================================================================
--- boost/trunk/libs/wave/src/cpplexer/re2clex/cpp_re.inc	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/cpplexer/re2clex/cpp_re.inc	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,10 @@
-/* Generated by re2c 0.10.3 on Sun May 21 12:03:39 2006 */
+/* Generated by re2c 0.10.6 on Tue Oct 03 17:06:20 2006 */
 #line 1 "cpp.re"
 /*=============================================================================
     Boost.Wave: A Standard compliant C++ preprocessor library
 
     Copyright (c) 2001 Daniel C. Nuffer
-    Copyright (c) 2001-2006 Hartmut Kaiser. 
+    Copyright (c) 2001-2007 Hartmut Kaiser. 
     Distributed under the Boost Software License, Version 1.0. (See accompanying 
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -17,77 +17,77 @@
         handle errors better.
 =============================================================================*/
 
-#line 38 "cpp.re"
+#line 40 "cpp.re"
 
 
 {
     static unsigned char yybm[] = {
         /* table 1 .. 8: 0 */
           0,   0,   0,   0,   0,   0,   0,   0, 
-          0,  61,  32,  57,  57,  64,   0,   0, 
+          0,  58,  32,  58,  58,  64,   0,   0, 
           0,   0,   0,   0,   0,   0,   0,   0, 
           0,   0,   0,   0,   0,   0,   0,   0, 
-         61,  57,  49,  57,  59,  57,  57,  56, 
-         57,  57, 153,  57,  57,  57,  57,  57, 
-         59,  59,  59,  59,  59,  59,  59,  59, 
-         59,  59,  57,  57,  57,  57,  41,  56, 
-         57,  59,  59,  59,  59,  59,  59,  59, 
-         59,  59,  59,  59,  59,  59,  59,  59, 
-         59,  59,  59,  59,  59,  59,  59,  59, 
-         59,  59,  59,  57,  56,  57,  57,  59, 
-         57,  59,  59,  59,  59,  59,  59,  59, 
-         59,  59,  59,  59,  59,  59,  59,  59, 
-         59,  59,  59,  59,  59,  59,  59,  59, 
-         59,  59,  59,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-        /* table 9 .. 13: 256 */
+         58,  58,  50,  58,  62,  58,  58,  56, 
+         58,  58, 154,  58,  58,  58,  58,  58, 
+         62,  62,  62,  62,  62,  62,  62,  62, 
+         62,  62,  58,  58,  58,  58,  42,  56, 
+         58,  62,  62,  62,  62,  62,  62,  62, 
+         62,  62,  62,  62,  62,  62,  62,  62, 
+         62,  62,  62,  62,  62,  62,  62,  62, 
+         62,  62,  62,  58,  57,  58,  58,  62, 
+         58,  62,  62,  62,  62,  62,  62,  62, 
+         62,  62,  62,  62,  62,  62,  62,  62, 
+         62,  62,  62,  62,  62,  62,  62,  62, 
+         62,  62,  62,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+        /* table 9 .. 12: 256 */
           0,   0,   0,   0,   0,   0,   0,   0, 
-          0,  24,   0,  24,  24,   0,   0,   0, 
+          0,  48,   0,  48,  48,   0,   0,   0, 
           0,   0,   0,   0,   0,   0,   0,   0, 
           0,   0,   0,   0,   0,   0,   0,   0, 
-         24,  16,   0,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         48,  48,  48,  48,  48,  48,  48,  48, 
-         48,  48,  16,  16,  16,  16,  16,  64, 
-         16,  48,  48,  48,  48,  48,  48,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16, 128,  16,  16,  16, 
-         16,  48,  48,  48,  48,  48,  48,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
+         48,  32,   0,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         96,  96,  96,  96,  96,  96,  96,  96, 
+         96,  96,  32,  32,  32,  32,  32, 128, 
+         32,  96,  96,  96,  96,  96,  96,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,   0,  32,  32,  32, 
+         32,  96,  96,  96,  96,  96,  96,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
     };
 
 #line 94 "cpp_re.inc"
@@ -97,8 +97,8 @@
 
         if((YYLIMIT - YYCURSOR) < 17) YYFILL(17);
         yych = *YYCURSOR;
-        switch(yych){
-        case 0x00:  goto yy88;
+        switch(yych) {
+        case 0x00:    goto yy88;
         case 0x01:
         case 0x02:
         case 0x03:
@@ -124,16 +124,16 @@
         case 0x1C:
         case 0x1D:
         case 0x1E:
-        case 0x1F:  goto yy2;
+        case 0x1F:    goto yy91;
         case 0x09:
         case 0x0B:
-        case 0x0C:
-        case ' ':   goto yy83;
-        case 0x0A:  goto yy85;
-        case 0x0D:  goto yy87;
-        case '!':   goto yy69;
-        case '"':   goto yy82;
-        case '#':   goto yy46;
+        case 0x0C:    goto yy82;
+        case 0x0A:    goto yy85;
+        case 0x0D:    goto yy87;
+        case ' ':    goto yy84;
+        case '!':    goto yy68;
+        case '"':    goto yy81;
+        case '#':    goto yy45;
         case '$':
         case 'A':
         case 'B':
@@ -165,18 +165,18 @@
         case 'k':
         case 'q':
         case 'y':
-        case 'z':   goto yy77;
-        case '%':   goto yy38;
-        case '&':   goto yy63;
-        case '\'':  goto yy81;
-        case '(':   goto yy48;
-        case ')':   goto yy50;
-        case '*':   goto yy58;
-        case '+':   goto yy54;
-        case ',':   goto yy75;
-        case '-':   goto yy56;
-        case '.':   goto yy5;
-        case '/':   goto yy3;
+        case 'z':    goto yy76;
+        case '%':    goto yy37;
+        case '&':    goto yy62;
+        case '\'':    goto yy80;
+        case '(':    goto yy47;
+        case ')':    goto yy49;
+        case '*':    goto yy57;
+        case '+':    goto yy53;
+        case ',':    goto yy74;
+        case '-':    goto yy55;
+        case '.':    goto yy4;
+        case '/':    goto yy2;
         case '0':
         case '1':
         case '2':
@@ -186,46 +186,586 @@
         case '6':
         case '7':
         case '8':
-        case '9':   goto yy7;
-        case ':':   goto yy44;
-        case ';':   goto yy52;
-        case '<':   goto yy34;
-        case '=':   goto yy71;
-        case '>':   goto yy73;
-        case '?':   goto yy32;
-        case 'L':   goto yy78;
-        case '[':   goto yy40;
-        case '\\':  goto yy79;
-        case ']':   goto yy42;
-        case '^':   goto yy60;
-        case '_':   goto yy29;
-        case 'a':   goto yy9;
-        case 'b':   goto yy11;
-        case 'c':   goto yy12;
-        case 'd':   goto yy13;
-        case 'e':   goto yy14;
-        case 'f':   goto yy15;
-        case 'g':   goto yy16;
-        case 'i':   goto yy17;
-        case 'l':   goto yy18;
-        case 'm':   goto yy19;
-        case 'n':   goto yy20;
-        case 'o':   goto yy21;
-        case 'p':   goto yy22;
-        case 'r':   goto yy23;
-        case 's':   goto yy24;
-        case 't':   goto yy25;
-        case 'u':   goto yy26;
-        case 'v':   goto yy27;
-        case 'w':   goto yy28;
-        case 'x':   goto yy62;
-        case '{':   goto yy30;
-        case '|':   goto yy65;
-        case '}':   goto yy36;
-        case '~':   goto yy67;
+        case '9':    goto yy6;
+        case ':':    goto yy43;
+        case ';':    goto yy51;
+        case '<':    goto yy33;
+        case '=':    goto yy70;
+        case '>':    goto yy72;
+        case '?':    goto yy31;
+        case 'L':    goto yy77;
+        case '[':    goto yy39;
+        case '\\':    goto yy78;
+        case ']':    goto yy41;
+        case '^':    goto yy59;
+        case '_':    goto yy28;
+        case 'a':    goto yy8;
+        case 'b':    goto yy10;
+        case 'c':    goto yy11;
+        case 'd':    goto yy12;
+        case 'e':    goto yy13;
+        case 'f':    goto yy14;
+        case 'g':    goto yy15;
+        case 'i':    goto yy16;
+        case 'l':    goto yy17;
+        case 'm':    goto yy18;
+        case 'n':    goto yy19;
+        case 'o':    goto yy20;
+        case 'p':    goto yy21;
+        case 'r':    goto yy22;
+        case 's':    goto yy23;
+        case 't':    goto yy24;
+        case 'u':    goto yy25;
+        case 'v':    goto yy26;
+        case 'w':    goto yy27;
+        case 'x':    goto yy61;
+        case '{':    goto yy29;
+        case '|':    goto yy64;
+        case '}':    goto yy35;
+        case '~':    goto yy66;
         default:    goto yy90;
         }
 yy2:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) <= '.') {
+            if(yych == '*') goto yy916;
+        } else {
+            if(yych <= '/') goto yy914;
+            if(yych == '=') goto yy912;
+        }
+#line 177 "cpp.re"
+        { BOOST_WAVE_RET(T_DIVIDE); }
+#line 239 "cpp_re.inc"
+yy4:
+        yyaccept = 0;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= '-') {
+            if(yych == '*') goto yy906;
+        } else {
+            if(yych <= '.') goto yy908;
+            if(yych <= '/') goto yy5;
+            if(yych <= '9') goto yy909;
+        }
+yy5:
+#line 163 "cpp.re"
+        { BOOST_WAVE_RET(T_DOT); }
+#line 253 "cpp_re.inc"
+yy6:
+        ++YYCURSOR;
+yy7:
+#line 45 "cpp.re"
+        { goto pp_number; }
+#line 259 "cpp_re.inc"
+yy8:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 'r') {
+            if(yych == 'n') goto yy892;
+            goto yy195;
+        } else {
+            if(yych <= 's') goto yy893;
+            if(yych == 'u') goto yy894;
+            goto yy195;
+        }
+yy9:
+#line 242 "cpp.re"
+        { BOOST_WAVE_RET(T_IDENTIFIER); }
+#line 274 "cpp_re.inc"
+yy10:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 'n') {
+            if(yych == 'i') goto yy874;
+            goto yy195;
+        } else {
+            if(yych <= 'o') goto yy875;
+            if(yych == 'r') goto yy876;
+            goto yy195;
+        }
+yy11:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        switch(yych) {
+        case 'a':    goto yy836;
+        case 'h':    goto yy837;
+        case 'l':    goto yy838;
+        case 'o':    goto yy839;
+        default:    goto yy195;
+        }
+yy12:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 'n') {
+            if(yych == 'e') goto yy805;
+            goto yy195;
+        } else {
+            if(yych <= 'o') goto yy806;
+            if(yych == 'y') goto yy808;
+            goto yy195;
+        }
+yy13:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 'm') {
+            if(yych == 'l') goto yy780;
+            goto yy195;
+        } else {
+            if(yych <= 'n') goto yy781;
+            if(yych == 'x') goto yy782;
+            goto yy195;
+        }
+yy14:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        switch(yych) {
+        case 'a':    goto yy761;
+        case 'l':    goto yy762;
+        case 'o':    goto yy763;
+        case 'r':    goto yy764;
+        default:    goto yy195;
+        }
+yy15:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'o') goto yy757;
+        goto yy195;
+yy16:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'f') goto yy747;
+        if(yych == 'n') goto yy749;
+        goto yy195;
+yy17:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'o') goto yy743;
+        goto yy195;
+yy18:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'u') goto yy736;
+        goto yy195;
+yy19:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 'd') {
+            if(yych == 'a') goto yy717;
+            goto yy195;
+        } else {
+            if(yych <= 'e') goto yy718;
+            if(yych == 'o') goto yy719;
+            goto yy195;
+        }
+yy20:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'p') goto yy703;
+        if(yych == 'r') goto yy704;
+        goto yy195;
+yy21:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'r') goto yy682;
+        if(yych == 'u') goto yy683;
+        goto yy195;
+yy22:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'e') goto yy654;
+        goto yy195;
+yy23:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 's') {
+            if(yych <= 'g') goto yy195;
+            if(yych <= 'h') goto yy615;
+            if(yych <= 'i') goto yy616;
+            goto yy195;
+        } else {
+            if(yych <= 't') goto yy617;
+            if(yych == 'w') goto yy618;
+            goto yy195;
+        }
+yy24:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 'h') {
+            if(yych == 'e') goto yy578;
+            if(yych <= 'g') goto yy195;
+            goto yy579;
+        } else {
+            if(yych <= 'r') {
+                if(yych <= 'q') goto yy195;
+                goto yy580;
+            } else {
+                if(yych == 'y') goto yy581;
+                goto yy195;
+            }
+        }
+yy25:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'n') goto yy561;
+        if(yych == 's') goto yy562;
+        goto yy195;
+yy26:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'i') goto yy543;
+        if(yych == 'o') goto yy544;
+        goto yy195;
+yy27:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'c') goto yy531;
+        if(yych == 'h') goto yy532;
+        goto yy195;
+yy28:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        switch(yych) {
+        case '_':    goto yy442;
+        case 'a':    goto yy443;
+        case 'b':    goto yy444;
+        case 'c':    goto yy445;
+        case 'd':    goto yy446;
+        case 'f':    goto yy447;
+        case 'i':    goto yy448;
+        case 's':    goto yy449;
+        default:    goto yy195;
+        }
+yy29:
+        ++YYCURSOR;
+#line 127 "cpp.re"
+        { BOOST_WAVE_RET(T_LEFTBRACE); }
+#line 442 "cpp_re.inc"
+yy31:
+        yyaccept = 2;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == '?') goto yy407;
+yy32:
+#line 152 "cpp.re"
+        { BOOST_WAVE_RET(T_QUESTION_MARK); }
+#line 450 "cpp_re.inc"
+yy33:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) <= ':') {
+            if(yych == '%') goto yy403;
+            if(yych >= ':') goto yy401;
+        } else {
+            if(yych <= ';') goto yy34;
+            if(yych <= '<') goto yy399;
+            if(yych <= '=') goto yy397;
+        }
+yy34:
+#line 193 "cpp.re"
+        { BOOST_WAVE_RET(T_LESS); }
+#line 464 "cpp_re.inc"
+yy35:
+        ++YYCURSOR;
+#line 130 "cpp.re"
+        { BOOST_WAVE_RET(T_RIGHTBRACE); }
+#line 469 "cpp_re.inc"
+yy37:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) <= '<') {
+            if(yych == ':') goto yy388;
+        } else {
+            if(yych <= '=') goto yy390;
+            if(yych <= '>') goto yy392;
+        }
+#line 178 "cpp.re"
+        { BOOST_WAVE_RET(T_PERCENT); }
+#line 480 "cpp_re.inc"
+yy39:
+        ++YYCURSOR;
+#line 133 "cpp.re"
+        { BOOST_WAVE_RET(T_LEFTBRACKET); }
+#line 485 "cpp_re.inc"
+yy41:
+        ++YYCURSOR;
+#line 136 "cpp.re"
+        { BOOST_WAVE_RET(T_RIGHTBRACKET); }
+#line 490 "cpp_re.inc"
+yy43:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == ':') goto yy384;
+        if(yych == '>') goto yy386;
+#line 150 "cpp.re"
+        { BOOST_WAVE_RET(T_COLON); }
+#line 497 "cpp_re.inc"
+yy45:
+        yyaccept = 3;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 'c') {
+            if(yych <= ' ') {
+                if(yych <= 0x0A) {
+                    if(yych == 0x09) goto yy261;
+                } else {
+                    if(yych <= 0x0C) goto yy261;
+                    if(yych >= ' ') goto yy261;
+                }
+            } else {
+                if(yych <= '.') {
+                    if(yych == '#') goto yy272;
+                } else {
+                    if(yych <= '/') goto yy261;
+                    if(yych == '?') goto yy271;
+                }
+            }
+        } else {
+            if(yych <= 'p') {
+                if(yych <= 'i') {
+                    if(yych <= 'e') goto yy261;
+                    if(yych >= 'i') goto yy261;
+                } else {
+                    if(yych == 'l') goto yy261;
+                    if(yych >= 'p') goto yy261;
+                }
+            } else {
+                if(yych <= 't') {
+                    if(yych == 'r') goto yy261;
+                } else {
+                    if(yych == 'v') goto yy46;
+                    if(yych <= 'w') goto yy261;
+                }
+            }
+        }
+yy46:
+#line 139 "cpp.re"
+        { BOOST_WAVE_RET(T_POUND); }
+#line 538 "cpp_re.inc"
+yy47:
+        ++YYCURSOR;
+#line 147 "cpp.re"
+        { BOOST_WAVE_RET(T_LEFTPAREN); }
+#line 543 "cpp_re.inc"
+yy49:
+        ++YYCURSOR;
+#line 148 "cpp.re"
+        { BOOST_WAVE_RET(T_RIGHTPAREN); }
+#line 548 "cpp_re.inc"
+yy51:
+        ++YYCURSOR;
+#line 149 "cpp.re"
+        { BOOST_WAVE_RET(T_SEMICOLON); }
+#line 553 "cpp_re.inc"
+yy53:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == '+') goto yy256;
+        if(yych == '=') goto yy258;
+#line 174 "cpp.re"
+        { BOOST_WAVE_RET(T_PLUS); }
+#line 560 "cpp_re.inc"
+yy55:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) <= '<') {
+            if(yych == '-') goto yy250;
+        } else {
+            if(yych <= '=') goto yy252;
+            if(yych <= '>') goto yy248;
+        }
+#line 175 "cpp.re"
+        { BOOST_WAVE_RET(T_MINUS); }
+#line 571 "cpp_re.inc"
+yy57:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == '=') goto yy246;
+#line 176 "cpp.re"
+        { BOOST_WAVE_RET(T_STAR); }
+#line 577 "cpp_re.inc"
+yy59:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == '=') goto yy244;
+#line 179 "cpp.re"
+        { BOOST_WAVE_RET(T_XOR); }
+#line 583 "cpp_re.inc"
+yy61:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'o') goto yy237;
+        goto yy195;
+yy62:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == '&') goto yy233;
+        if(yych == '=') goto yy235;
+#line 182 "cpp.re"
+        { BOOST_WAVE_RET(T_AND); }
+#line 595 "cpp_re.inc"
+yy64:
+        yyaccept = 4;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= '>') {
+            if(yych == '=') goto yy228;
+        } else {
+            if(yych <= '?') goto yy225;
+            if(yych == '|') goto yy226;
+        }
+yy65:
+#line 184 "cpp.re"
+        { BOOST_WAVE_RET(T_OR); }
+#line 608 "cpp_re.inc"
+yy66:
+        ++YYCURSOR;
+#line 187 "cpp.re"
+        { BOOST_WAVE_RET(T_COMPL); }
+#line 613 "cpp_re.inc"
+yy68:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == '=') goto yy223;
+#line 190 "cpp.re"
+        { BOOST_WAVE_RET(T_NOT); }
+#line 619 "cpp_re.inc"
+yy70:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == '=') goto yy221;
+#line 192 "cpp.re"
+        { BOOST_WAVE_RET(T_ASSIGN); }
+#line 625 "cpp_re.inc"
+yy72:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) <= '<') goto yy73;
+        if(yych <= '=') goto yy215;
+        if(yych <= '>') goto yy217;
+yy73:
+#line 194 "cpp.re"
+        { BOOST_WAVE_RET(T_GREATER); }
+#line 634 "cpp_re.inc"
+yy74:
+        ++YYCURSOR;
+#line 226 "cpp.re"
+        { BOOST_WAVE_RET(T_COMMA); }
+#line 639 "cpp_re.inc"
+yy76:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        goto yy195;
+yy77:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yybm[0+yych] & 4) {
+            goto yy194;
+        }
+        if(yych <= '\'') {
+            if(yych == '"') goto yy96;
+            if(yych <= '&') goto yy9;
+            goto yy214;
+        } else {
+            if(yych <= '?') {
+                if(yych <= '>') goto yy9;
+                goto yy197;
+            } else {
+                if(yych == '\\') goto yy196;
+                goto yy9;
+            }
+        }
+yy78:
+        yyaccept = 5;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'U') goto yy186;
+        if(yych == 'u') goto yy185;
+yy79:
+#line 297 "cpp.re"
+        { BOOST_WAVE_RET(TOKEN_FROM_ID(*s->tok, UnknownTokenType)); }
+#line 671 "cpp_re.inc"
+yy80:
+        yyaccept = 5;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 0x0C) {
+            if(yych == 0x09) goto yy142;
+            if(yych <= 0x0A) goto yy79;
+            goto yy142;
+        } else {
+            if(yych <= 0x1F) goto yy79;
+            if(yych == '\'') goto yy79;
+            goto yy142;
+        }
+yy81:
+        yyaccept = 5;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 0x0A) {
+            if(yych == 0x09) goto yy97;
+            goto yy79;
+        } else {
+            if(yych <= 0x0C) goto yy97;
+            if(yych <= 0x1F) goto yy79;
+            goto yy97;
+        }
+yy82:
+        ++YYCURSOR;
+        yych = *YYCURSOR;
+        goto yy95;
+yy83:
+#line 278 "cpp.re"
+        { BOOST_WAVE_RET(T_SPACE); }
+#line 702 "cpp_re.inc"
+yy84:
+        yych = *++YYCURSOR;
+        goto yy95;
+yy85:
+        ++YYCURSOR;
+yy86:
+#line 281 "cpp.re"
+        {
+        s->line++;
+        cursor.column = 1;
+        BOOST_WAVE_RET(T_NEWLINE);
+    }
+#line 715 "cpp_re.inc"
+yy87:
+        yych = *++YYCURSOR;
+        if(yych == 0x0A) goto yy93;
+        goto yy86;
+yy88:
+        ++YYCURSOR;
+#line 288 "cpp.re"
+        {
+        if(cursor != s->eof) 
+        {
+            BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+            (*s->error_proc)(s, "invalid character '\\000' in input stream");
+        }
+        BOOST_WAVE_RET(T_EOF);
+    }
+#line 731 "cpp_re.inc"
+yy90:
+        yych = *++YYCURSOR;
+        goto yy79;
+yy91:
+        ++YYCURSOR;
+#line 300 "cpp.re"
+        {
+        // flag the error
+        BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+        (*s->error_proc)(s, "invalid character '\\%03o' in input stream",
+            *--YYCURSOR);
+    }
+#line 744 "cpp_re.inc"
+yy93:
+        yych = *++YYCURSOR;
+        goto yy86;
+yy94:
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
+yy95:
+        if(yybm[256+yych] & 16) {
+            goto yy94;
+        }
+        goto yy83;
+yy96:
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
+yy97:
+        if(yybm[256+yych] & 32) {
+            goto yy96;
+        }
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych <= '[') goto yy99;
+        goto yy100;
+yy98:
         YYCURSOR = YYMARKER;
         if(yyaccept <= 51) {
             if(yyaccept <= 25) {
@@ -234,48 +774,48 @@
                         if(yyaccept <= 3) {
                             if(yyaccept <= 1) {
                                 if(yyaccept <= 0) {
-                                    goto yy6;
+                                    goto yy5;
                                 } else {
-                                    goto yy10;
+                                    goto yy9;
                                 }
                             } else {
                                 if(yyaccept <= 2) {
-                                    goto yy33;
+                                    goto yy32;
                                 } else {
-                                    goto yy47;
+                                    goto yy46;
                                 }
                             }
                         } else {
                             if(yyaccept <= 5) {
                                 if(yyaccept <= 4) {
-                                    goto yy66;
+                                    goto yy65;
                                 } else {
-                                    goto yy80;
+                                    goto yy79;
                                 }
                             } else {
-                                goto yy99;
+                                goto yy102;
                             }
                         }
                     } else {
                         if(yyaccept <= 9) {
                             if(yyaccept <= 8) {
                                 if(yyaccept <= 7) {
-                                    goto yy149;
+                                    goto yy152;
                                 } else {
-                                    goto yy236;
+                                    goto yy239;
                                 }
                             } else {
-                                goto yy240;
+                                goto yy243;
                             }
                         } else {
                             if(yyaccept <= 11) {
                                 if(yyaccept <= 10) {
-                                    goto yy276;
+                                    goto yy279;
                                 } else {
-                                    goto yy291;
+                                    goto yy294;
                                 }
                             } else {
-                                goto yy386;
+                                goto yy389;
                             }
                         }
                     }
@@ -284,48 +824,48 @@
                         if(yyaccept <= 16) {
                             if(yyaccept <= 14) {
                                 if(yyaccept <= 13) {
-                                    goto yy414;
+                                    goto yy417;
                                 } else {
-                                    goto yy418;
+                                    goto yy421;
                                 }
                             } else {
                                 if(yyaccept <= 15) {
-                                    goto yy422;
+                                    goto yy425;
                                 } else {
-                                    goto yy453;
+                                    goto yy456;
                                 }
                             }
                         } else {
                             if(yyaccept <= 18) {
                                 if(yyaccept <= 17) {
-                                    goto yy459;
+                                    goto yy462;
                                 } else {
-                                    goto yy467;
+                                    goto yy470;
                                 }
                             } else {
-                                goto yy475;
+                                goto yy478;
                             }
                         }
                     } else {
                         if(yyaccept <= 22) {
                             if(yyaccept <= 21) {
                                 if(yyaccept <= 20) {
-                                    goto yy480;
+                                    goto yy483;
                                 } else {
-                                    goto yy485;
+                                    goto yy488;
                                 }
                             } else {
-                                goto yy488;
+                                goto yy491;
                             }
                         } else {
                             if(yyaccept <= 24) {
                                 if(yyaccept <= 23) {
-                                    goto yy498;
+                                    goto yy501;
                                 } else {
-                                    goto yy504;
+                                    goto yy507;
                                 }
                             } else {
-                                goto yy507;
+                                goto yy510;
                             }
                         }
                     }
@@ -336,48 +876,48 @@
                         if(yyaccept <= 29) {
                             if(yyaccept <= 27) {
                                 if(yyaccept <= 26) {
-                                    goto yy514;
+                                    goto yy517;
                                 } else {
-                                    goto yy521;
+                                    goto yy524;
                                 }
                             } else {
                                 if(yyaccept <= 28) {
-                                    goto yy523;
+                                    goto yy526;
                                 } else {
-                                    goto yy525;
+                                    goto yy528;
                                 }
                             }
                         } else {
                             if(yyaccept <= 31) {
                                 if(yyaccept <= 30) {
-                                    goto yy527;
+                                    goto yy530;
                                 } else {
-                                    goto yy533;
+                                    goto yy536;
                                 }
                             } else {
-                                goto yy539;
+                                goto yy542;
                             }
                         }
                     } else {
                         if(yyaccept <= 35) {
                             if(yyaccept <= 34) {
                                 if(yyaccept <= 33) {
-                                    goto yy549;
+                                    goto yy552;
                                 } else {
-                                    goto yy551;
+                                    goto yy554;
                                 }
                             } else {
-                                goto yy557;
+                                goto yy560;
                             }
                         } else {
                             if(yyaccept <= 37) {
                                 if(yyaccept <= 36) {
-                                    goto yy563;
+                                    goto yy566;
                                 } else {
-                                    goto yy571;
+                                    goto yy574;
                                 }
                             } else {
-                                goto yy574;
+                                goto yy577;
                             }
                         }
                     }
@@ -386,48 +926,48 @@
                         if(yyaccept <= 42) {
                             if(yyaccept <= 40) {
                                 if(yyaccept <= 39) {
-                                    goto yy587;
+                                    goto yy590;
                                 } else {
-                                    goto yy589;
+                                    goto yy592;
                                 }
                             } else {
                                 if(yyaccept <= 41) {
-                                    goto yy592;
+                                    goto yy595;
                                 } else {
-                                    goto yy595;
+                                    goto yy598;
                                 }
                             }
                         } else {
                             if(yyaccept <= 44) {
                                 if(yyaccept <= 43) {
-                                    goto yy597;
+                                    goto yy600;
                                 } else {
-                                    goto yy602;
+                                    goto yy605;
                                 }
                             } else {
-                                goto yy604;
+                                goto yy607;
                             }
                         }
                     } else {
                         if(yyaccept <= 48) {
                             if(yyaccept <= 47) {
                                 if(yyaccept <= 46) {
-                                    goto yy611;
+                                    goto yy614;
                                 } else {
-                                    goto yy620;
+                                    goto yy623;
                                 }
                             } else {
-                                goto yy626;
+                                goto yy629;
                             }
                         } else {
                             if(yyaccept <= 50) {
                                 if(yyaccept <= 49) {
-                                    goto yy630;
+                                    goto yy633;
                                 } else {
-                                    goto yy636;
+                                    goto yy639;
                                 }
                             } else {
-                                goto yy642;
+                                goto yy645;
                             }
                         }
                     }
@@ -440,48 +980,48 @@
                         if(yyaccept <= 55) {
                             if(yyaccept <= 53) {
                                 if(yyaccept <= 52) {
-                                    goto yy646;
+                                    goto yy649;
                                 } else {
-                                    goto yy650;
+                                    goto yy653;
                                 }
                             } else {
                                 if(yyaccept <= 54) {
-                                    goto yy658;
+                                    goto yy661;
                                 } else {
-                                    goto yy672;
+                                    goto yy675;
                                 }
                             }
                         } else {
                             if(yyaccept <= 57) {
                                 if(yyaccept <= 56) {
-                                    goto yy678;
+                                    goto yy681;
                                 } else {
-                                    goto yy685;
+                                    goto yy688;
                                 }
                             } else {
-                                goto yy694;
+                                goto yy697;
                             }
                         }
                     } else {
                         if(yyaccept <= 61) {
                             if(yyaccept <= 60) {
                                 if(yyaccept <= 59) {
-                                    goto yy699;
+                                    goto yy702;
                                 } else {
-                                    goto yy702;
+                                    goto yy705;
                                 }
                             } else {
-                                goto yy706;
+                                goto yy709;
                             }
                         } else {
                             if(yyaccept <= 63) {
                                 if(yyaccept <= 62) {
-                                    goto yy713;
+                                    goto yy716;
                                 } else {
-                                    goto yy718;
+                                    goto yy721;
                                 }
                             } else {
-                                goto yy722;
+                                goto yy725;
                             }
                         }
                     }
@@ -490,48 +1030,48 @@
                         if(yyaccept <= 68) {
                             if(yyaccept <= 66) {
                                 if(yyaccept <= 65) {
-                                    goto yy724;
+                                    goto yy727;
                                 } else {
-                                    goto yy732;
+                                    goto yy735;
                                 }
                             } else {
                                 if(yyaccept <= 67) {
-                                    goto yy739;
+                                    goto yy742;
                                 } else {
-                                    goto yy743;
+                                    goto yy746;
                                 }
                             }
                         } else {
                             if(yyaccept <= 70) {
                                 if(yyaccept <= 69) {
-                                    goto yy745;
+                                    goto yy748;
                                 } else {
-                                    goto yy749;
+                                    goto yy752;
                                 }
                             } else {
-                                goto yy753;
+                                goto yy756;
                             }
                         }
                     } else {
                         if(yyaccept <= 74) {
                             if(yyaccept <= 73) {
                                 if(yyaccept <= 72) {
-                                    goto yy757;
+                                    goto yy760;
                                 } else {
-                                    goto yy766;
+                                    goto yy769;
                                 }
                             } else {
-                                goto yy768;
+                                goto yy771;
                             }
                         } else {
                             if(yyaccept <= 76) {
                                 if(yyaccept <= 75) {
-                                    goto yy772;
+                                    goto yy775;
                                 } else {
-                                    goto yy776;
+                                    goto yy779;
                                 }
                             } else {
-                                goto yy785;
+                                goto yy788;
                             }
                         }
                     }
@@ -542,48 +1082,48 @@
                         if(yyaccept <= 81) {
                             if(yyaccept <= 79) {
                                 if(yyaccept <= 78) {
-                                    goto yy790;
+                                    goto yy793;
                                 } else {
-                                    goto yy795;
+                                    goto yy798;
                                 }
                             } else {
                                 if(yyaccept <= 80) {
-                                    goto yy798;
+                                    goto yy801;
                                 } else {
-                                    goto yy801;
+                                    goto yy804;
                                 }
                             }
                         } else {
                             if(yyaccept <= 83) {
                                 if(yyaccept <= 82) {
-                                    goto yy804;
+                                    goto yy807;
                                 } else {
-                                    goto yy816;
+                                    goto yy819;
                                 }
                             } else {
-                                goto yy821;
+                                goto yy824;
                             }
                         }
                     } else {
                         if(yyaccept <= 87) {
                             if(yyaccept <= 86) {
                                 if(yyaccept <= 85) {
-                                    goto yy827;
+                                    goto yy830;
                                 } else {
-                                    goto yy832;
+                                    goto yy835;
                                 }
                             } else {
-                                goto yy841;
+                                goto yy844;
                             }
                         } else {
                             if(yyaccept <= 89) {
                                 if(yyaccept <= 88) {
-                                    goto yy848;
+                                    goto yy851;
                                 } else {
-                                    goto yy850;
+                                    goto yy853;
                                 }
                             } else {
-                                goto yy856;
+                                goto yy859;
                             }
                         }
                     }
@@ -592,823 +1132,288 @@
                         if(yyaccept <= 93) {
                             if(yyaccept <= 92) {
                                 if(yyaccept <= 91) {
-                                    goto yy860;
+                                    goto yy863;
                                 } else {
-                                    goto yy863;
+                                    goto yy866;
                                 }
                             } else {
-                                goto yy868;
+                                goto yy871;
                             }
                         } else {
                             if(yyaccept <= 95) {
                                 if(yyaccept <= 94) {
-                                    goto yy870;
+                                    goto yy873;
                                 } else {
-                                    goto yy877;
+                                    goto yy880;
                                 }
                             } else {
-                                goto yy880;
+                                goto yy883;
                             }
                         }
                     } else {
                         if(yyaccept <= 99) {
                             if(yyaccept <= 98) {
                                 if(yyaccept <= 97) {
-                                    goto yy885;
+                                    goto yy888;
                                 } else {
-                                    goto yy888;
+                                    goto yy891;
                                 }
                             } else {
-                                goto yy894;
+                                goto yy897;
                             }
                         } else {
                             if(yyaccept <= 101) {
                                 if(yyaccept <= 100) {
-                                    goto yy896;
+                                    goto yy899;
                                 } else {
-                                    goto yy898;
+                                    goto yy901;
                                 }
                             } else {
-                                goto yy902;
+                                goto yy905;
                             }
                         }
                     }
                 }
             }
         }
-yy3:
+yy99:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) <= '.') {
-            if(yych == '*') goto yy913;
-        } else {
-            if(yych <= '/') goto yy911;
-            if(yych == '=') goto yy909;
-        }
-#line 175 "cpp.re"
-        { BOOST_WAVE_RET(T_DIVIDE); }
-#line 650 "cpp_re.inc"
-yy5:
-        yyaccept = 0;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= '-') {
-            if(yych == '*') goto yy903;
-        } else {
-            if(yych <= '.') goto yy905;
-            if(yych <= '/') goto yy6;
-            if(yych <= '9') goto yy906;
-        }
-yy6:
-#line 161 "cpp.re"
-        { BOOST_WAVE_RET(T_DOT); }
-#line 664 "cpp_re.inc"
-yy7:
-        ++YYCURSOR;
-yy8:
-#line 43 "cpp.re"
-        { goto pp_number; }
-#line 670 "cpp_re.inc"
-yy9:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'r') {
-            if(yych == 'n') goto yy889;
-            goto yy192;
-        } else {
-            if(yych <= 's') goto yy890;
-            if(yych == 'u') goto yy891;
-            goto yy192;
-        }
-yy10:
-#line 240 "cpp.re"
-        { BOOST_WAVE_RET(T_IDENTIFIER); }
-#line 685 "cpp_re.inc"
-yy11:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'n') {
-            if(yych == 'i') goto yy871;
-            goto yy192;
-        } else {
-            if(yych <= 'o') goto yy872;
-            if(yych == 'r') goto yy873;
-            goto yy192;
-        }
-yy12:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        switch(yych){
-        case 'a':   goto yy833;
-        case 'h':   goto yy834;
-        case 'l':   goto yy835;
-        case 'o':   goto yy836;
-        default:    goto yy192;
-        }
-yy13:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'n') {
-            if(yych == 'e') goto yy802;
-            goto yy192;
-        } else {
-            if(yych <= 'o') goto yy803;
-            if(yych == 'y') goto yy805;
-            goto yy192;
-        }
-yy14:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'm') {
-            if(yych == 'l') goto yy777;
-            goto yy192;
-        } else {
-            if(yych <= 'n') goto yy778;
-            if(yych == 'x') goto yy779;
-            goto yy192;
-        }
-yy15:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        switch(yych){
-        case 'a':   goto yy758;
-        case 'l':   goto yy759;
-        case 'o':   goto yy760;
-        case 'r':   goto yy761;
-        default:    goto yy192;
-        }
-yy16:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'o') goto yy754;
-        goto yy192;
-yy17:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'f') goto yy744;
-        if(yych == 'n') goto yy746;
-        goto yy192;
-yy18:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'o') goto yy740;
-        goto yy192;
-yy19:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'u') goto yy733;
-        goto yy192;
-yy20:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'd') {
-            if(yych == 'a') goto yy714;
-            goto yy192;
-        } else {
-            if(yych <= 'e') goto yy715;
-            if(yych == 'o') goto yy716;
-            goto yy192;
-        }
-yy21:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'p') goto yy700;
-        if(yych == 'r') goto yy701;
-        goto yy192;
-yy22:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'r') goto yy679;
-        if(yych == 'u') goto yy680;
-        goto yy192;
-yy23:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'e') goto yy651;
-        goto yy192;
-yy24:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 's') {
-            if(yych <= 'g') goto yy192;
-            if(yych <= 'h') goto yy612;
-            if(yych <= 'i') goto yy613;
-            goto yy192;
-        } else {
-            if(yych <= 't') goto yy614;
-            if(yych == 'w') goto yy615;
-            goto yy192;
-        }
-yy25:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'h') {
-            if(yych == 'e') goto yy575;
-            if(yych <= 'g') goto yy192;
-            goto yy576;
-        } else {
-            if(yych <= 'r') {
-                if(yych <= 'q') goto yy192;
-                goto yy577;
-            } else {
-                if(yych == 'y') goto yy578;
-                goto yy192;
-            }
-        }
-yy26:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'n') goto yy558;
-        if(yych == 's') goto yy559;
-        goto yy192;
-yy27:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy540;
-        if(yych == 'o') goto yy541;
-        goto yy192;
-yy28:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'c') goto yy528;
-        if(yych == 'h') goto yy529;
-        goto yy192;
-yy29:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        switch(yych){
-        case '_':   goto yy439;
-        case 'a':   goto yy440;
-        case 'b':   goto yy441;
-        case 'c':   goto yy442;
-        case 'd':   goto yy443;
-        case 'f':   goto yy444;
-        case 'i':   goto yy445;
-        case 's':   goto yy446;
-        default:    goto yy192;
-        }
-yy30:
-        ++YYCURSOR;
-#line 125 "cpp.re"
-        { BOOST_WAVE_RET(T_LEFTBRACE); }
-#line 853 "cpp_re.inc"
-yy32:
-        yyaccept = 2;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == '?') goto yy404;
-yy33:
-#line 150 "cpp.re"
-        { BOOST_WAVE_RET(T_QUESTION_MARK); }
-#line 861 "cpp_re.inc"
-yy34:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) <= ':') {
-            if(yych == '%') goto yy400;
-            if(yych >= ':') goto yy398;
-        } else {
-            if(yych <= ';') goto yy35;
-            if(yych <= '<') goto yy396;
-            if(yych <= '=') goto yy394;
-        }
-yy35:
-#line 191 "cpp.re"
-        { BOOST_WAVE_RET(T_LESS); }
-#line 875 "cpp_re.inc"
-yy36:
-        ++YYCURSOR;
-#line 128 "cpp.re"
-        { BOOST_WAVE_RET(T_RIGHTBRACE); }
-#line 880 "cpp_re.inc"
-yy38:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) <= '<') {
-            if(yych == ':') goto yy385;
-        } else {
-            if(yych <= '=') goto yy387;
-            if(yych <= '>') goto yy389;
-        }
-#line 176 "cpp.re"
-        { BOOST_WAVE_RET(T_PERCENT); }
-#line 891 "cpp_re.inc"
-yy40:
-        ++YYCURSOR;
-#line 131 "cpp.re"
-        { BOOST_WAVE_RET(T_LEFTBRACKET); }
-#line 896 "cpp_re.inc"
-yy42:
-        ++YYCURSOR;
-#line 134 "cpp.re"
-        { BOOST_WAVE_RET(T_RIGHTBRACKET); }
-#line 901 "cpp_re.inc"
-yy44:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == ':') goto yy381;
-        if(yych == '>') goto yy383;
-#line 148 "cpp.re"
-        { BOOST_WAVE_RET(T_COLON); }
-#line 908 "cpp_re.inc"
-yy46:
-        yyaccept = 3;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'e') {
-            if(yych <= '#') {
-                if(yych <= 0x1F) {
-                    if(yych == 0x09) goto yy258;
-                } else {
-                    if(yych <= ' ') goto yy258;
-                    if(yych >= '#') goto yy269;
-                }
-            } else {
-                if(yych <= '>') {
-                    if(yych == '/') goto yy258;
-                } else {
-                    if(yych <= '?') goto yy268;
-                    if(yych >= 'd') goto yy258;
-                }
-            }
-        } else {
-            if(yych <= 'p') {
-                if(yych <= 'k') {
-                    if(yych == 'i') goto yy258;
-                } else {
-                    if(yych <= 'l') goto yy258;
-                    if(yych >= 'p') goto yy258;
-                }
-            } else {
-                if(yych <= 't') {
-                    if(yych == 'r') goto yy258;
-                } else {
-                    if(yych == 'v') goto yy47;
-                    if(yych <= 'w') goto yy258;
-                }
-            }
-        }
-yy47:
-#line 137 "cpp.re"
-        { BOOST_WAVE_RET(T_POUND); }
-#line 948 "cpp_re.inc"
-yy48:
-        ++YYCURSOR;
-#line 145 "cpp.re"
-        { BOOST_WAVE_RET(T_LEFTPAREN); }
-#line 953 "cpp_re.inc"
-yy50:
-        ++YYCURSOR;
-#line 146 "cpp.re"
-        { BOOST_WAVE_RET(T_RIGHTPAREN); }
-#line 958 "cpp_re.inc"
-yy52:
-        ++YYCURSOR;
-#line 147 "cpp.re"
-        { BOOST_WAVE_RET(T_SEMICOLON); }
-#line 963 "cpp_re.inc"
-yy54:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == '+') goto yy253;
-        if(yych == '=') goto yy255;
-#line 172 "cpp.re"
-        { BOOST_WAVE_RET(T_PLUS); }
-#line 970 "cpp_re.inc"
-yy56:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) <= '<') {
-            if(yych == '-') goto yy247;
-        } else {
-            if(yych <= '=') goto yy249;
-            if(yych <= '>') goto yy245;
-        }
-#line 173 "cpp.re"
-        { BOOST_WAVE_RET(T_MINUS); }
-#line 981 "cpp_re.inc"
-yy58:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == '=') goto yy243;
-#line 174 "cpp.re"
-        { BOOST_WAVE_RET(T_STAR); }
-#line 987 "cpp_re.inc"
-yy60:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == '=') goto yy241;
-#line 177 "cpp.re"
-        { BOOST_WAVE_RET(T_XOR); }
-#line 993 "cpp_re.inc"
-yy62:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'o') goto yy234;
-        goto yy192;
-yy63:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == '&') goto yy230;
-        if(yych == '=') goto yy232;
-#line 180 "cpp.re"
-        { BOOST_WAVE_RET(T_AND); }
-#line 1005 "cpp_re.inc"
-yy65:
-        yyaccept = 4;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= '>') {
-            if(yych == '=') goto yy225;
-        } else {
-            if(yych <= '?') goto yy222;
-            if(yych == '|') goto yy223;
-        }
-yy66:
-#line 182 "cpp.re"
-        { BOOST_WAVE_RET(T_OR); }
-#line 1018 "cpp_re.inc"
-yy67:
-        ++YYCURSOR;
-#line 185 "cpp.re"
-        { BOOST_WAVE_RET(T_COMPL); }
-#line 1023 "cpp_re.inc"
-yy69:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == '=') goto yy220;
-#line 188 "cpp.re"
-        { BOOST_WAVE_RET(T_NOT); }
-#line 1029 "cpp_re.inc"
-yy71:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == '=') goto yy218;
-#line 190 "cpp.re"
-        { BOOST_WAVE_RET(T_ASSIGN); }
-#line 1035 "cpp_re.inc"
-yy73:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) <= '<') goto yy74;
-        if(yych <= '=') goto yy212;
-        if(yych <= '>') goto yy214;
-yy74:
-#line 192 "cpp.re"
-        { BOOST_WAVE_RET(T_GREATER); }
-#line 1044 "cpp_re.inc"
-yy75:
-        ++YYCURSOR;
-#line 224 "cpp.re"
-        { BOOST_WAVE_RET(T_COMMA); }
-#line 1049 "cpp_re.inc"
-yy77:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        goto yy192;
-yy78:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
-        }
-        if(yych <= '\'') {
-            if(yych == '"') goto yy94;
-            if(yych <= '&') goto yy10;
-            goto yy211;
-        } else {
-            if(yych <= '?') {
-                if(yych <= '>') goto yy10;
-                goto yy194;
-            } else {
-                if(yych == '\\') goto yy193;
-                goto yy10;
-            }
-        }
-yy79:
-        yyaccept = 5;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'U') goto yy183;
-        if(yych == 'u') goto yy182;
-yy80:
-#line 299 "cpp.re"
-        {
-        /* if (0 != s->error_proc)
-            (*s->error_proc)(s, "Unexpected character: '%c'", *s->tok);
-        else
-            printf("unexpected character: '%c'\n", *s->tok);
-        */
-        BOOST_WAVE_RET(TOKEN_FROM_ID(*s->tok, UnknownTokenType));
-    }
-#line 1088 "cpp_re.inc"
-yy81:
-        yyaccept = 5;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 0x0C) {
-            if(yych == 0x09) goto yy139;
-            if(yych <= 0x0A) goto yy80;
-            goto yy139;
-        } else {
-            if(yych <= 0x1F) goto yy80;
-            if(yych == '\'') goto yy80;
-            goto yy139;
-        }
-yy82:
-        yyaccept = 5;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 0x0A) {
-            if(yych == 0x09) goto yy95;
-            goto yy80;
-        } else {
-            if(yych <= 0x0C) goto yy95;
-            if(yych <= 0x1F) goto yy80;
-            goto yy95;
-        }
-yy83:
-        ++YYCURSOR;
-        yych = *YYCURSOR;
-        goto yy93;
-yy84:
-#line 276 "cpp.re"
-        { BOOST_WAVE_RET(T_SPACE); }
-#line 1119 "cpp_re.inc"
-yy85:
-        ++YYCURSOR;
-yy86:
-#line 279 "cpp.re"
-        {
-        s->line++;
-        cursor.column = 1;
-        BOOST_WAVE_RET(T_NEWLINE);
-    }
-#line 1129 "cpp_re.inc"
-yy87:
-        yych = *++YYCURSOR;
-        if(yych == 0x0A) goto yy91;
-        goto yy86;
-yy88:
-        ++YYCURSOR;
-#line 286 "cpp.re"
-        {
-        if(cursor != s->eof) 
-        {
-            using namespace std;      // some systems have printf in std
-            if (0 != s->error_proc)
-                (*s->error_proc)(s, "'\\000' in input stream");
-            else
-                printf("Error: 0 in file\n");
-        }
-        BOOST_WAVE_RET(T_EOF);
-    }
-#line 1148 "cpp_re.inc"
-yy90:
-        yych = *++YYCURSOR;
-        goto yy80;
-yy91:
-        yych = *++YYCURSOR;
-        goto yy86;
-yy92:
-        ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-yy93:
-        if(yybm[256+yych] & 8) {
-            goto yy92;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        goto yy84;
-yy94:
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych <= '[') goto yy112;
+yy100:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-yy95:
-        if(yybm[256+yych] & 16) {
-            goto yy94;
-        }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych >= '\\') goto yy97;
-yy96:
-        ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
-        }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych <= '[') goto yy109;
-yy97:
-        ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
         if(yych <= '`') {
             if(yych <= '7') {
                 if(yych <= '&') {
-                    if(yych == '"') goto yy94;
-                    goto yy2;
+                    if(yych == '"') goto yy96;
+                    goto yy98;
                 } else {
-                    if(yych <= '\'') goto yy94;
-                    if(yych <= '/') goto yy2;
-                    goto yy104;
+                    if(yych <= '\'') goto yy96;
+                    if(yych <= '/') goto yy98;
+                    goto yy107;
                 }
             } else {
                 if(yych <= 'T') {
-                    if(yych == '?') goto yy102;
-                    goto yy2;
+                    if(yych == '?') goto yy105;
+                    goto yy98;
                 } else {
-                    if(yych <= 'U') goto yy101;
-                    if(yych == '\\') goto yy94;
-                    goto yy2;
+                    if(yych <= 'U') goto yy104;
+                    if(yych == '\\') goto yy96;
+                    goto yy98;
                 }
             }
         } else {
             if(yych <= 'r') {
                 if(yych <= 'f') {
-                    if(yych <= 'b') goto yy94;
-                    if(yych <= 'e') goto yy2;
-                    goto yy94;
+                    if(yych <= 'b') goto yy96;
+                    if(yych <= 'e') goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych == 'n') goto yy94;
-                    if(yych <= 'q') goto yy2;
-                    goto yy94;
+                    if(yych == 'n') goto yy96;
+                    if(yych <= 'q') goto yy98;
+                    goto yy96;
                 }
             } else {
                 if(yych <= 'u') {
-                    if(yych <= 's') goto yy2;
-                    if(yych <= 't') goto yy94;
-                    goto yy100;
+                    if(yych <= 's') goto yy98;
+                    if(yych <= 't') goto yy96;
+                    goto yy103;
                 } else {
-                    if(yych <= 'v') goto yy94;
-                    if(yych == 'x') goto yy103;
-                    goto yy2;
+                    if(yych <= 'v') goto yy96;
+                    if(yych == 'x') goto yy106;
+                    goto yy98;
                 }
             }
         }
-yy98:
+yy101:
         ++YYCURSOR;
-yy99:
-#line 246 "cpp.re"
+yy102:
+#line 248 "cpp.re"
         { BOOST_WAVE_RET(T_STRINGLIT); }
-#line 1237 "cpp_re.inc"
-yy100:
+#line 1242 "cpp_re.inc"
+yy103:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy135;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy138;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy135;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy135;
-            goto yy2;
+            if(yych <= 'F') goto yy138;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy138;
+            goto yy98;
         }
-yy101:
+yy104:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy128;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy131;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy128;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy128;
-            goto yy2;
+            if(yych <= 'F') goto yy131;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy131;
+            goto yy98;
         }
-yy102:
+yy105:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych <= '[') goto yy108;
-        goto yy97;
-yy103:
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych <= '[') goto yy111;
+        goto yy100;
+yy106:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 32) {
-            goto yy106;
+        if(yybm[256+yych] & 64) {
+            goto yy109;
         }
-        goto yy2;
-yy104:
+        goto yy98;
+yy107:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '"') {
             if(yych <= 0x0A) {
-                if(yych == 0x09) goto yy94;
-                goto yy2;
+                if(yych == 0x09) goto yy96;
+                goto yy98;
             } else {
-                if(yych <= 0x0C) goto yy94;
-                if(yych <= 0x1F) goto yy2;
-                if(yych <= '!') goto yy94;
-                goto yy98;
+                if(yych <= 0x0C) goto yy96;
+                if(yych <= 0x1F) goto yy98;
+                if(yych <= '!') goto yy96;
+                goto yy101;
             }
         } else {
             if(yych <= '>') {
-                if(yych <= '/') goto yy94;
-                if(yych >= '8') goto yy94;
+                if(yych <= '/') goto yy96;
+                if(yych >= '8') goto yy96;
             } else {
-                if(yych <= '?') goto yy96;
-                if(yych == '\\') goto yy97;
-                goto yy94;
+                if(yych <= '?') goto yy99;
+                if(yych == '\\') goto yy100;
+                goto yy96;
             }
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych <= '[') goto yy96;
-        goto yy97;
-yy106:
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych <= '[') goto yy99;
+        goto yy100;
+yy109:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 32) {
-            goto yy106;
+        if(yybm[256+yych] & 64) {
+            goto yy109;
         }
         if(yych <= '!') {
             if(yych <= 0x0A) {
-                if(yych == 0x09) goto yy94;
-                goto yy2;
+                if(yych == 0x09) goto yy96;
+                goto yy98;
             } else {
-                if(yych <= 0x0C) goto yy94;
-                if(yych <= 0x1F) goto yy2;
-                goto yy94;
+                if(yych <= 0x0C) goto yy96;
+                if(yych <= 0x1F) goto yy98;
+                goto yy96;
             }
         } else {
             if(yych <= '?') {
-                if(yych <= '"') goto yy98;
-                if(yych <= '>') goto yy94;
+                if(yych <= '"') goto yy101;
+                if(yych <= '>') goto yy96;
+                goto yy99;
+            } else {
+                if(yych == '\\') goto yy100;
                 goto yy96;
-            } else {
-                if(yych == '\\') goto yy97;
-                goto yy94;
             }
         }
-yy108:
+yy111:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych >= '\\') goto yy97;
-yy109:
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych >= '\\') goto yy100;
+yy112:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 64) {
-            goto yy109;
+        if(yybm[256+yych] & 128) {
+            goto yy112;
         }
         if(yych <= '!') {
             if(yych <= 0x0A) {
-                if(yych == 0x09) goto yy94;
-                goto yy2;
+                if(yych == 0x09) goto yy96;
+                goto yy98;
             } else {
-                if(yych <= 0x0C) goto yy94;
-                if(yych <= 0x1F) goto yy2;
-                goto yy94;
+                if(yych <= 0x0C) goto yy96;
+                if(yych <= 0x1F) goto yy98;
+                goto yy96;
             }
         } else {
             if(yych <= '/') {
-                if(yych <= '"') goto yy98;
-                if(yych <= '.') goto yy94;
+                if(yych <= '"') goto yy101;
+                if(yych <= '.') goto yy96;
             } else {
-                if(yych == '\\') goto yy97;
-                goto yy94;
+                if(yych == '\\') goto yy100;
+                goto yy96;
             }
         }
-yy111:
+yy114:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 128) {
-            goto yy111;
+        if(yybm[0+yych] & 1) {
+            goto yy114;
         }
         if(yych <= '7') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy115;
-                    if(yych <= '/') goto yy94;
-                    goto yy104;
+                    if(yych <= '"') goto yy118;
+                    if(yych <= '/') goto yy96;
+                    goto yy107;
                 }
             }
         } else {
             if(yych <= 'U') {
-                if(yych == '?') goto yy116;
-                if(yych <= 'T') goto yy94;
-                goto yy114;
+                if(yych == '?') goto yy119;
+                if(yych <= 'T') goto yy96;
+                goto yy117;
             } else {
                 if(yych <= 'u') {
-                    if(yych <= 't') goto yy94;
+                    if(yych <= 't') goto yy96;
                 } else {
-                    if(yych == 'x') goto yy106;
-                    goto yy94;
+                    if(yych == 'x') goto yy109;
+                    goto yy96;
                 }
             }
         }
@@ -1417,146 +1422,146 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
-                    goto yy125;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
+                    goto yy128;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
-                goto yy125;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
+                goto yy128;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych <= 'f') goto yy125;
-                    goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych <= 'f') goto yy128;
+                    goto yy96;
                 }
             }
         }
-yy114:
+yy117:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
-                    goto yy118;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
+                    goto yy121;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
-                goto yy118;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
+                goto yy121;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych <= 'f') goto yy118;
-                    goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych <= 'f') goto yy121;
+                    goto yy96;
                 }
             }
         }
-yy115:
+yy118:
         yyaccept = 6;
         YYMARKER = ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        if(yych <= '!') goto yy99;
-        if(yych <= '"') goto yy98;
-        if(yych <= '[') goto yy96;
-        goto yy97;
-yy116:
+        if(yych <= '!') goto yy102;
+        if(yych <= '"') goto yy101;
+        if(yych <= '[') goto yy99;
+        goto yy100;
+yy119:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych >= '\\') goto yy97;
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych >= '\\') goto yy100;
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 64) {
-            goto yy109;
+        if(yybm[256+yych] & 128) {
+            goto yy112;
         }
         if(yych <= '!') {
             if(yych <= 0x0A) {
-                if(yych == 0x09) goto yy94;
-                goto yy2;
+                if(yych == 0x09) goto yy96;
+                goto yy98;
             } else {
-                if(yych <= 0x0C) goto yy94;
-                if(yych <= 0x1F) goto yy2;
-                goto yy94;
+                if(yych <= 0x0C) goto yy96;
+                if(yych <= 0x1F) goto yy98;
+                goto yy96;
             }
         } else {
             if(yych <= '/') {
-                if(yych <= '"') goto yy98;
-                if(yych <= '.') goto yy94;
-                goto yy111;
+                if(yych <= '"') goto yy101;
+                if(yych <= '.') goto yy96;
+                goto yy114;
             } else {
-                if(yych == '\\') goto yy97;
-                goto yy94;
+                if(yych == '\\') goto yy100;
+                goto yy96;
             }
         }
-yy118:
+yy121:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
@@ -1565,29 +1570,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
@@ -1596,29 +1601,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
@@ -1627,29 +1632,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
@@ -1658,29 +1663,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
@@ -1689,71 +1694,71 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych <= '[') goto yy96;
-        goto yy97;
-yy125:
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych <= '[') goto yy99;
+        goto yy100;
+yy128:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
@@ -1762,230 +1767,230 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych <= '[') goto yy96;
-        goto yy97;
-yy128:
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych <= '[') goto yy99;
+        goto yy100;
+yy131:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy129;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy132;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy129:
+yy132:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy130;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy133;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy130:
+yy133:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy131;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy134;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy131:
+yy134:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy132;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy135;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy132:
+yy135:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy133;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy136;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy133:
+yy136:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy134;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy137;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy134:
+yy137:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy94;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy96;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy94;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy94;
-            goto yy2;
+            if(yych <= 'F') goto yy96;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy96;
+            goto yy98;
         }
-yy135:
+yy138:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy136;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy139;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy136:
+yy139:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy137;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy140;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy137:
+yy140:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy94;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy96;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy94;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy94;
-            goto yy2;
+            if(yych <= 'F') goto yy96;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy96;
+            goto yy98;
         }
-yy138:
+yy141:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-yy139:
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+yy142:
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych >= '\\') goto yy141;
-yy140:
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych >= '\\') goto yy144;
+yy143:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych <= '[') goto yy153;
-yy141:
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych <= '[') goto yy156;
+yy144:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '`') {
             if(yych <= '7') {
                 if(yych <= '&') {
-                    if(yych == '"') goto yy138;
-                    goto yy2;
+                    if(yych == '"') goto yy141;
+                    goto yy98;
                 } else {
-                    if(yych <= '\'') goto yy138;
-                    if(yych <= '/') goto yy2;
-                    goto yy146;
+                    if(yych <= '\'') goto yy141;
+                    if(yych <= '/') goto yy98;
+                    goto yy149;
                 }
             } else {
                 if(yych <= 'T') {
-                    if(yych == '?') goto yy144;
-                    goto yy2;
+                    if(yych == '?') goto yy147;
+                    goto yy98;
                 } else {
-                    if(yych <= 'U') goto yy143;
-                    if(yych == '\\') goto yy138;
-                    goto yy2;
+                    if(yych <= 'U') goto yy146;
+                    if(yych == '\\') goto yy141;
+                    goto yy98;
                 }
             }
         } else {
             if(yych <= 'r') {
                 if(yych <= 'f') {
-                    if(yych <= 'b') goto yy138;
-                    if(yych <= 'e') goto yy2;
-                    goto yy138;
+                    if(yych <= 'b') goto yy141;
+                    if(yych <= 'e') goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych == 'n') goto yy138;
-                    if(yych <= 'q') goto yy2;
-                    goto yy138;
+                    if(yych == 'n') goto yy141;
+                    if(yych <= 'q') goto yy98;
+                    goto yy141;
                 }
             } else {
                 if(yych <= 'u') {
-                    if(yych <= 's') goto yy2;
-                    if(yych <= 't') goto yy138;
+                    if(yych <= 's') goto yy98;
+                    if(yych <= 't') goto yy141;
                 } else {
-                    if(yych <= 'v') goto yy138;
-                    if(yych == 'x') goto yy145;
-                    goto yy2;
+                    if(yych <= 'v') goto yy141;
+                    if(yych == 'x') goto yy148;
+                    goto yy98;
                 }
             }
         }
@@ -1993,202 +1998,202 @@
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy179;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy182;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy179;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy179;
-            goto yy2;
+            if(yych <= 'F') goto yy182;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy182;
+            goto yy98;
         }
-yy143:
+yy146:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy172;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy175;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy172;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy172;
-            goto yy2;
+            if(yych <= 'F') goto yy175;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy175;
+            goto yy98;
         }
-yy144:
+yy147:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych <= '[') goto yy152;
-        goto yy141;
-yy145:
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych <= '[') goto yy155;
+        goto yy144;
+yy148:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy150;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy153;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy150;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy150;
-            goto yy2;
+            if(yych <= 'F') goto yy153;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy153;
+            goto yy98;
         }
-yy146:
+yy149:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '\'') {
             if(yych <= 0x0A) {
-                if(yych == 0x09) goto yy138;
-                goto yy2;
+                if(yych == 0x09) goto yy141;
+                goto yy98;
             } else {
-                if(yych <= 0x0C) goto yy138;
-                if(yych <= 0x1F) goto yy2;
-                if(yych <= '&') goto yy138;
-                goto yy148;
+                if(yych <= 0x0C) goto yy141;
+                if(yych <= 0x1F) goto yy98;
+                if(yych <= '&') goto yy141;
+                goto yy151;
             }
         } else {
             if(yych <= '>') {
-                if(yych <= '/') goto yy138;
-                if(yych >= '8') goto yy138;
+                if(yych <= '/') goto yy141;
+                if(yych >= '8') goto yy141;
             } else {
-                if(yych <= '?') goto yy140;
-                if(yych == '\\') goto yy141;
-                goto yy138;
+                if(yych <= '?') goto yy143;
+                if(yych == '\\') goto yy144;
+                goto yy141;
             }
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych <= '[') goto yy140;
-        goto yy141;
-yy148:
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych <= '[') goto yy143;
+        goto yy144;
+yy151:
         ++YYCURSOR;
-yy149:
-#line 243 "cpp.re"
+yy152:
+#line 245 "cpp.re"
         { BOOST_WAVE_RET(T_CHARLIT); }
-#line 2084 "cpp_re.inc"
-yy150:
+#line 2089 "cpp_re.inc"
+yy153:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
-                    goto yy150;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
+                    goto yy153;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
-                goto yy150;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
+                goto yy153;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
+                } else {
+                    if(yych <= '`') goto yy141;
+                    if(yych <= 'f') goto yy153;
                     goto yy141;
-                } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych <= 'f') goto yy150;
-                    goto yy138;
                 }
             }
         }
-yy152:
+yy155:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych >= '\\') goto yy141;
-yy153:
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych >= '\\') goto yy144;
+yy156:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '\'') {
             if(yych <= 0x0A) {
-                if(yych == 0x09) goto yy138;
-                goto yy2;
+                if(yych == 0x09) goto yy141;
+                goto yy98;
             } else {
-                if(yych <= 0x0C) goto yy138;
-                if(yych <= 0x1F) goto yy2;
-                if(yych <= '&') goto yy138;
-                goto yy148;
+                if(yych <= 0x0C) goto yy141;
+                if(yych <= 0x1F) goto yy98;
+                if(yych <= '&') goto yy141;
+                goto yy151;
             }
         } else {
             if(yych <= '>') {
-                if(yych != '/') goto yy138;
+                if(yych != '/') goto yy141;
             } else {
-                if(yych <= '?') goto yy153;
-                if(yych == '\\') goto yy141;
-                goto yy138;
+                if(yych <= '?') goto yy156;
+                if(yych == '\\') goto yy144;
+                goto yy141;
             }
         }
-yy155:
+yy158:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '>') {
             if(yych <= 0x1F) {
                 if(yych <= 0x09) {
-                    if(yych <= 0x08) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x08) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= 0x0A) goto yy2;
-                    if(yych <= 0x0C) goto yy138;
-                    goto yy2;
+                    if(yych <= 0x0A) goto yy98;
+                    if(yych <= 0x0C) goto yy141;
+                    goto yy98;
                 }
             } else {
                 if(yych <= '\'') {
-                    if(yych <= '&') goto yy138;
-                    goto yy159;
+                    if(yych <= '&') goto yy141;
+                    goto yy162;
                 } else {
-                    if(yych <= '/') goto yy138;
-                    if(yych <= '7') goto yy146;
-                    goto yy138;
+                    if(yych <= '/') goto yy141;
+                    if(yych <= '7') goto yy149;
+                    goto yy141;
                 }
             }
         } else {
             if(yych <= '\\') {
                 if(yych <= 'T') {
-                    if(yych <= '?') goto yy160;
-                    goto yy138;
+                    if(yych <= '?') goto yy163;
+                    goto yy141;
                 } else {
-                    if(yych <= 'U') goto yy158;
-                    if(yych <= '[') goto yy138;
-                    goto yy155;
+                    if(yych <= 'U') goto yy161;
+                    if(yych <= '[') goto yy141;
+                    goto yy158;
                 }
             } else {
                 if(yych <= 'u') {
-                    if(yych <= 't') goto yy138;
+                    if(yych <= 't') goto yy141;
                 } else {
-                    if(yych == 'x') goto yy150;
-                    goto yy138;
+                    if(yych == 'x') goto yy153;
+                    goto yy141;
                 }
             }
         }
@@ -2197,144 +2202,144 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
-                    goto yy169;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
+                    goto yy172;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
-                goto yy169;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
+                goto yy172;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
+                } else {
+                    if(yych <= '`') goto yy141;
+                    if(yych <= 'f') goto yy172;
                     goto yy141;
-                } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych <= 'f') goto yy169;
-                    goto yy138;
                 }
             }
         }
-yy158:
+yy161:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
-                    goto yy162;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
+                    goto yy165;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
-                goto yy162;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
+                goto yy165;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
+                } else {
+                    if(yych <= '`') goto yy141;
+                    if(yych <= 'f') goto yy165;
                     goto yy141;
-                } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych <= 'f') goto yy162;
-                    goto yy138;
                 }
             }
         }
-yy159:
+yy162:
         yyaccept = 7;
         YYMARKER = ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy149;
-        if(yych <= '\'') goto yy148;
-        if(yych <= '[') goto yy140;
-        goto yy141;
-yy160:
+        if(yych <= '&') goto yy152;
+        if(yych <= '\'') goto yy151;
+        if(yych <= '[') goto yy143;
+        goto yy144;
+yy163:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych >= '\\') goto yy141;
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych >= '\\') goto yy144;
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '\'') {
             if(yych <= 0x0A) {
-                if(yych == 0x09) goto yy138;
-                goto yy2;
+                if(yych == 0x09) goto yy141;
+                goto yy98;
             } else {
-                if(yych <= 0x0C) goto yy138;
-                if(yych <= 0x1F) goto yy2;
-                if(yych <= '&') goto yy138;
-                goto yy148;
+                if(yych <= 0x0C) goto yy141;
+                if(yych <= 0x1F) goto yy98;
+                if(yych <= '&') goto yy141;
+                goto yy151;
             }
         } else {
             if(yych <= '>') {
-                if(yych == '/') goto yy155;
-                goto yy138;
+                if(yych == '/') goto yy158;
+                goto yy141;
             } else {
-                if(yych <= '?') goto yy153;
-                if(yych == '\\') goto yy141;
-                goto yy138;
+                if(yych <= '?') goto yy156;
+                if(yych == '\\') goto yy144;
+                goto yy141;
             }
         }
-yy162:
+yy165:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
@@ -2343,29 +2348,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
@@ -2374,29 +2379,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
@@ -2405,29 +2410,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
@@ -2436,29 +2441,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
@@ -2467,71 +2472,71 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych <= '[') goto yy140;
-        goto yy141;
-yy169:
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych <= '[') goto yy143;
+        goto yy144;
+yy172:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
@@ -2540,603 +2545,603 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych <= '[') goto yy140;
-        goto yy141;
-yy172:
-        ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
-        if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
-        } else {
-            if(yych <= 'F') goto yy173;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
-        }
-yy173:
-        ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
-        if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
-        } else {
-            if(yych <= 'F') goto yy174;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
-        }
-yy174:
-        ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
-        if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
-        } else {
-            if(yych <= 'F') goto yy175;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
-        }
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych <= '[') goto yy143;
+        goto yy144;
 yy175:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy176;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy176:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy177;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy177:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy178;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy178:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy138;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy138;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy138;
-            goto yy2;
+            if(yych <= 'F') goto yy179;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy179:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy180;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy180:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy181;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy181:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy138;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy141;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy138;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy138;
-            goto yy2;
+            if(yych <= 'F') goto yy141;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy141;
+            goto yy98;
         }
 yy182:
-        yych = *++YYCURSOR;
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy208;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy208;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy208;
-            goto yy2;
+            if(yych <= 'F') goto yy183;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy183:
-        yych = *++YYCURSOR;
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy184;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy184:
-        yych = *++YYCURSOR;
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy141;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy185;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy141;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy141;
+            goto yy98;
         }
 yy185:
         yych = *++YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy211;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy186;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy211;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy211;
+            goto yy98;
         }
 yy186:
         yych = *++YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy187;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy187:
         yych = *++YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy188;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy188:
         yych = *++YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy189;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy189:
         yych = *++YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy190;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy190:
         yych = *++YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy191;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy191:
-        yyaccept = 1;
-        YYMARKER = ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
+        yych = *++YYCURSOR;
+        if(yych <= '@') {
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
+        } else {
+            if(yych <= 'F') goto yy192;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
+        }
 yy192:
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        yych = *++YYCURSOR;
+        if(yych <= '@') {
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
+        } else {
+            if(yych <= 'F') goto yy193;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-        if(yych == '?') goto yy194;
-        if(yych != '\\') goto yy10;
 yy193:
-        ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
-        if(yych == 'U') goto yy197;
-        if(yych == 'u') goto yy196;
-        goto yy2;
+        yych = *++YYCURSOR;
+        if(yych <= '@') {
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
+        } else {
+            if(yych <= 'F') goto yy194;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
+        }
 yy194:
-        ++YYCURSOR;
+        yyaccept = 1;
+        YYMARKER = ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych != '?') goto yy2;
-        ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
-        if(yych == '/') goto yy193;
-        goto yy2;
+yy195:
+        if(yybm[0+yych] & 4) {
+            goto yy194;
+        }
+        if(yych == '?') goto yy197;
+        if(yych != '\\') goto yy9;
 yy196:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy205;
-            goto yy2;
-        } else {
-            if(yych <= 'F') goto yy205;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy205;
-            goto yy2;
-        }
+        if(yych == 'U') goto yy200;
+        if(yych == 'u') goto yy199;
+        goto yy98;
 yy197:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
-        } else {
-            if(yych <= 'F') goto yy198;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
-        }
-yy198:
+        if(yych != '?') goto yy98;
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
-        } else {
-            if(yych <= 'F') goto yy199;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
-        }
+        if(yych == '/') goto yy196;
+        goto yy98;
 yy199:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy208;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy200;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy208;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy208;
+            goto yy98;
         }
 yy200:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy201;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy201:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy202;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy202:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy203;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy203:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy204;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy204:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy191;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy191;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy191;
-            goto yy2;
+            if(yych <= 'F') goto yy205;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy205:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy206;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy206:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy207;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy207:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy191;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy194;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy191;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy191;
-            goto yy2;
+            if(yych <= 'F') goto yy194;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy194;
+            goto yy98;
         }
 yy208:
-        yych = *++YYCURSOR;
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy209;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy209:
-        yych = *++YYCURSOR;
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy210;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy210:
-        yych = *++YYCURSOR;
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy191;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy194;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy191;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy191;
-            goto yy2;
+            if(yych <= 'F') goto yy194;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy194;
+            goto yy98;
         }
 yy211:
         yych = *++YYCURSOR;
-        if(yych == '\'') goto yy2;
-        goto yy139;
+        if(yych <= '@') {
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
+        } else {
+            if(yych <= 'F') goto yy212;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
+        }
 yy212:
+        yych = *++YYCURSOR;
+        if(yych <= '@') {
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
+        } else {
+            if(yych <= 'F') goto yy213;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
+        }
+yy213:
+        yych = *++YYCURSOR;
+        if(yych <= '@') {
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy194;
+            goto yy98;
+        } else {
+            if(yych <= 'F') goto yy194;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy194;
+            goto yy98;
+        }
+yy214:
+        yych = *++YYCURSOR;
+        if(yych == '\'') goto yy98;
+        goto yy142;
+yy215:
         ++YYCURSOR;
-#line 214 "cpp.re"
+#line 216 "cpp.re"
         { BOOST_WAVE_RET(T_GREATEREQUAL); }
-#line 3014 "cpp_re.inc"
-yy214:
+#line 3019 "cpp_re.inc"
+yy217:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) == '=') goto yy216;
-#line 207 "cpp.re"
+        if((yych = *YYCURSOR) == '=') goto yy219;
+#line 209 "cpp.re"
         { BOOST_WAVE_RET(T_SHIFTRIGHT); }
-#line 3020 "cpp_re.inc"
-yy216:
-        ++YYCURSOR;
-#line 208 "cpp.re"
-        { BOOST_WAVE_RET(T_SHIFTRIGHTASSIGN); }
 #line 3025 "cpp_re.inc"
-yy218:
+yy219:
         ++YYCURSOR;
 #line 210 "cpp.re"
-        { BOOST_WAVE_RET(T_EQUAL); }
+        { BOOST_WAVE_RET(T_SHIFTRIGHTASSIGN); }
 #line 3030 "cpp_re.inc"
-yy220:
+yy221:
         ++YYCURSOR;
-#line 211 "cpp.re"
-        { BOOST_WAVE_RET(T_NOTEQUAL); }
+#line 212 "cpp.re"
+        { BOOST_WAVE_RET(T_EQUAL); }
 #line 3035 "cpp_re.inc"
-yy222:
-        yych = *++YYCURSOR;
-        if(yych == '?') goto yy227;
-        goto yy2;
 yy223:
         ++YYCURSOR;
-#line 217 "cpp.re"
-        { BOOST_WAVE_RET(T_OROR); }
-#line 3044 "cpp_re.inc"
+#line 213 "cpp.re"
+        { BOOST_WAVE_RET(T_NOTEQUAL); }
+#line 3040 "cpp_re.inc"
 yy225:
+        yych = *++YYCURSOR;
+        if(yych == '?') goto yy230;
+        goto yy98;
+yy226:
         ++YYCURSOR;
-#line 203 "cpp.re"
+#line 219 "cpp.re"
+        { BOOST_WAVE_RET(T_OROR); }
+#line 3049 "cpp_re.inc"
+yy228:
+        ++YYCURSOR;
+#line 205 "cpp.re"
         { BOOST_WAVE_RET(T_ORASSIGN); }
-#line 3049 "cpp_re.inc"
-yy227:
+#line 3054 "cpp_re.inc"
+yy230:
         yych = *++YYCURSOR;
-        if(yych != '!') goto yy2;
+        if(yych != '!') goto yy98;
         ++YYCURSOR;
-#line 219 "cpp.re"
+#line 221 "cpp.re"
         { BOOST_WAVE_RET(T_OROR_TRIGRAPH); }
-#line 3056 "cpp_re.inc"
-yy230:
+#line 3061 "cpp_re.inc"
+yy233:
         ++YYCURSOR;
-#line 215 "cpp.re"
+#line 217 "cpp.re"
         { BOOST_WAVE_RET(T_ANDAND); }
-#line 3061 "cpp_re.inc"
-yy232:
+#line 3066 "cpp_re.inc"
+yy235:
         ++YYCURSOR;
-#line 201 "cpp.re"
+#line 203 "cpp.re"
         { BOOST_WAVE_RET(T_ANDASSIGN); }
-#line 3066 "cpp_re.inc"
-yy234:
+#line 3071 "cpp_re.inc"
+yy237:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 8;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= '@') {
             if(yych <= '/') {
-                if(yych == '$') goto yy191;
+                if(yych == '$') goto yy194;
             } else {
-                if(yych <= '9') goto yy191;
-                if(yych == '?') goto yy194;
+                if(yych <= '9') goto yy194;
+                if(yych == '?') goto yy197;
             }
         } else {
             if(yych <= '^') {
-                if(yych <= 'Z') goto yy191;
-                if(yych == '\\') goto yy193;
+                if(yych <= 'Z') goto yy194;
+                if(yych == '\\') goto yy196;
             } else {
-                if(yych <= '_') goto yy237;
-                if(yych <= '`') goto yy236;
-                if(yych <= 'z') goto yy191;
+                if(yych <= '_') goto yy240;
+                if(yych <= '`') goto yy239;
+                if(yych <= 'z') goto yy194;
             }
         }
-yy236:
-#line 179 "cpp.re"
+yy239:
+#line 181 "cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_XOR_ALT); }
-#line 3093 "cpp_re.inc"
-yy237:
+#line 3098 "cpp_re.inc"
+yy240:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'q') goto yy192;
+        if(yych != 'q') goto yy195;
         yyaccept = 9;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy240:
-#line 199 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy243:
+#line 201 "cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_XORASSIGN_ALT); }
-#line 3111 "cpp_re.inc"
-yy241:
+#line 3116 "cpp_re.inc"
+yy244:
         ++YYCURSOR;
-#line 198 "cpp.re"
+#line 200 "cpp.re"
         { BOOST_WAVE_RET(T_XORASSIGN); }
-#line 3116 "cpp_re.inc"
-yy243:
+#line 3121 "cpp_re.inc"
+yy246:
         ++YYCURSOR;
-#line 195 "cpp.re"
+#line 197 "cpp.re"
         { BOOST_WAVE_RET(T_STARASSIGN); }
-#line 3121 "cpp_re.inc"
-yy245:
+#line 3126 "cpp_re.inc"
+yy248:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) == '*') goto yy251;
-#line 235 "cpp.re"
+        if((yych = *YYCURSOR) == '*') goto yy254;
+#line 237 "cpp.re"
         { BOOST_WAVE_RET(T_ARROW); }
-#line 3127 "cpp_re.inc"
-yy247:
+#line 3132 "cpp_re.inc"
+yy250:
         ++YYCURSOR;
-#line 223 "cpp.re"
+#line 225 "cpp.re"
         { BOOST_WAVE_RET(T_MINUSMINUS); }
-#line 3132 "cpp_re.inc"
-yy249:
+#line 3137 "cpp_re.inc"
+yy252:
         ++YYCURSOR;
-#line 194 "cpp.re"
+#line 196 "cpp.re"
         { BOOST_WAVE_RET(T_MINUSASSIGN); }
-#line 3137 "cpp_re.inc"
-yy251:
+#line 3142 "cpp_re.inc"
+yy254:
         ++YYCURSOR;
-#line 226 "cpp.re"
+#line 228 "cpp.re"
         { 
             if (s->act_in_c99_mode) {
                 --YYCURSOR;
@@ -3146,480 +3151,489 @@
                 BOOST_WAVE_RET(T_ARROWSTAR); 
             }
         }
-#line 3150 "cpp_re.inc"
-yy253:
+#line 3155 "cpp_re.inc"
+yy256:
         ++YYCURSOR;
-#line 222 "cpp.re"
+#line 224 "cpp.re"
         { BOOST_WAVE_RET(T_PLUSPLUS); }
-#line 3155 "cpp_re.inc"
-yy255:
+#line 3160 "cpp_re.inc"
+yy258:
         ++YYCURSOR;
-#line 193 "cpp.re"
+#line 195 "cpp.re"
         { BOOST_WAVE_RET(T_PLUSASSIGN); }
-#line 3160 "cpp_re.inc"
-yy257:
+#line 3165 "cpp_re.inc"
+yy260:
         ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 12) YYFILL(12);
         yych = *YYCURSOR;
-yy258:
-        if(yybm[0+yych] & 4) {
-            goto yy257;
-        }
-        if(yych <= 'l') {
-            if(yych <= 'd') {
-                if(yych == '/') goto yy259;
-                if(yych <= 'c') goto yy2;
-                goto yy266;
+yy261:
+        if(yych <= 'h') {
+            if(yych <= ' ') {
+                if(yych <= 0x0A) {
+                    if(yych == 0x09) goto yy260;
+                    goto yy98;
+                } else {
+                    if(yych <= 0x0C) goto yy260;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy260;
+                }
             } else {
-                if(yych <= 'h') {
-                    if(yych <= 'e') goto yy260;
-                    goto yy2;
+                if(yych <= 'c') {
+                    if(yych != '/') goto yy98;
                 } else {
-                    if(yych <= 'i') goto yy267;
-                    if(yych <= 'k') goto yy2;
-                    goto yy264;
+                    if(yych <= 'd') goto yy269;
+                    if(yych <= 'e') goto yy263;
+                    goto yy98;
                 }
             }
         } else {
-            if(yych <= 'r') {
-                if(yych == 'p') goto yy263;
-                if(yych <= 'q') goto yy2;
-                goto yy261;
+            if(yych <= 'q') {
+                if(yych <= 'l') {
+                    if(yych <= 'i') goto yy270;
+                    if(yych <= 'k') goto yy98;
+                    goto yy267;
+                } else {
+                    if(yych == 'p') goto yy266;
+                    goto yy98;
+                }
             } else {
                 if(yych <= 'u') {
-                    if(yych <= 't') goto yy2;
-                    goto yy265;
+                    if(yych <= 'r') goto yy264;
+                    if(yych <= 't') goto yy98;
+                    goto yy268;
                 } else {
-                    if(yych == 'w') goto yy262;
-                    goto yy2;
+                    if(yych == 'w') goto yy265;
+                    goto yy98;
                 }
             }
         }
-yy259:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych == '*') goto yy374;
-        goto yy2;
-yy260:
+        if(yych == '*') goto yy377;
+        goto yy98;
+yy263:
         yych = *++YYCURSOR;
         if(yych <= 'm') {
-            if(yych == 'l') goto yy350;
-            goto yy2;
+            if(yych == 'l') goto yy353;
+            goto yy98;
         } else {
-            if(yych <= 'n') goto yy351;
-            if(yych == 'r') goto yy352;
-            goto yy2;
+            if(yych <= 'n') goto yy354;
+            if(yych == 'r') goto yy355;
+            goto yy98;
         }
-yy261:
-        yych = *++YYCURSOR;
-        if(yych == 'e') goto yy344;
-        goto yy2;
-yy262:
-        yych = *++YYCURSOR;
-        if(yych == 'a') goto yy337;
-        goto yy2;
-yy263:
-        yych = *++YYCURSOR;
-        if(yych == 'r') goto yy331;
-        goto yy2;
 yy264:
         yych = *++YYCURSOR;
-        if(yych == 'i') goto yy327;
-        goto yy2;
+        if(yych == 'e') goto yy347;
+        goto yy98;
 yy265:
         yych = *++YYCURSOR;
-        if(yych == 'n') goto yy322;
-        goto yy2;
+        if(yych == 'a') goto yy340;
+        goto yy98;
 yy266:
         yych = *++YYCURSOR;
-        if(yych == 'e') goto yy316;
-        goto yy2;
+        if(yych == 'r') goto yy334;
+        goto yy98;
 yy267:
         yych = *++YYCURSOR;
-        if(yych == 'f') goto yy275;
-        if(yych == 'n') goto yy274;
-        goto yy2;
+        if(yych == 'i') goto yy330;
+        goto yy98;
 yy268:
         yych = *++YYCURSOR;
-        if(yych == '?') goto yy271;
-        goto yy2;
+        if(yych == 'n') goto yy325;
+        goto yy98;
 yy269:
+        yych = *++YYCURSOR;
+        if(yych == 'e') goto yy319;
+        goto yy98;
+yy270:
+        yych = *++YYCURSOR;
+        if(yych == 'f') goto yy278;
+        if(yych == 'n') goto yy277;
+        goto yy98;
+yy271:
+        yych = *++YYCURSOR;
+        if(yych == '?') goto yy274;
+        goto yy98;
+yy272:
         ++YYCURSOR;
-#line 140 "cpp.re"
+#line 142 "cpp.re"
         { BOOST_WAVE_RET(T_POUND_POUND); }
-#line 3252 "cpp_re.inc"
-yy271:
+#line 3263 "cpp_re.inc"
+yy274:
         yych = *++YYCURSOR;
-        if(yych != '=') goto yy2;
+        if(yych != '=') goto yy98;
         ++YYCURSOR;
-#line 141 "cpp.re"
+#line 143 "cpp.re"
         { BOOST_WAVE_RET(T_POUND_POUND_TRIGRAPH); }
-#line 3259 "cpp_re.inc"
-yy274:
+#line 3270 "cpp_re.inc"
+yy277:
         yych = *++YYCURSOR;
-        if(yych == 'c') goto yy286;
-        goto yy2;
-yy275:
+        if(yych == 'c') goto yy289;
+        goto yy98;
+yy278:
         yyaccept = 10;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'd') goto yy278;
-        if(yych == 'n') goto yy277;
-yy276:
-#line 258 "cpp.re"
+        if(yych == 'd') goto yy281;
+        if(yych == 'n') goto yy280;
+yy279:
+#line 260 "cpp.re"
         { BOOST_WAVE_RET(T_PP_IF); }
-#line 3272 "cpp_re.inc"
-yy277:
+#line 3283 "cpp_re.inc"
+yy280:
         yych = *++YYCURSOR;
-        if(yych == 'd') goto yy282;
-        goto yy2;
-yy278:
+        if(yych == 'd') goto yy285;
+        goto yy98;
+yy281:
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'f') goto yy2;
+        if(yych != 'f') goto yy98;
         ++YYCURSOR;
-#line 259 "cpp.re"
+#line 261 "cpp.re"
         { BOOST_WAVE_RET(T_PP_IFDEF); }
-#line 3285 "cpp_re.inc"
-yy282:
+#line 3296 "cpp_re.inc"
+yy285:
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'f') goto yy2;
+        if(yych != 'f') goto yy98;
         ++YYCURSOR;
-#line 260 "cpp.re"
+#line 262 "cpp.re"
         { BOOST_WAVE_RET(T_PP_IFNDEF); }
-#line 3294 "cpp_re.inc"
-yy286:
+#line 3305 "cpp_re.inc"
+yy289:
         yych = *++YYCURSOR;
-        if(yych != 'l') goto yy2;
+        if(yych != 'l') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'u') goto yy2;
+        if(yych != 'u') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'd') goto yy2;
+        if(yych != 'd') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         yyaccept = 11;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == '_') goto yy292;
-        goto yy294;
-yy291:
-#line 256 "cpp.re"
+        if(yych == '_') goto yy295;
+        goto yy297;
+yy294:
+#line 258 "cpp.re"
         { BOOST_WAVE_RET(T_PP_INCLUDE); }
-#line 3311 "cpp_re.inc"
-yy292:
+#line 3322 "cpp_re.inc"
+yy295:
         yych = *++YYCURSOR;
-        if(yych == 'n') goto yy313;
-        goto yy2;
-yy293:
+        if(yych == 'n') goto yy316;
+        goto yy98;
+yy296:
         yyaccept = 11;
         YYMARKER = ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 2) YYFILL(2);
         yych = *YYCURSOR;
-yy294:
-        if(yych <= '!') {
-            if(yych <= 0x09) {
-                if(yych <= 0x08) goto yy291;
-                goto yy293;
+yy297:
+        if(yych <= ' ') {
+            if(yych <= 0x0A) {
+                if(yych == 0x09) goto yy296;
+                goto yy294;
             } else {
-                if(yych == ' ') goto yy293;
-                goto yy291;
+                if(yych <= 0x0C) goto yy296;
+                if(yych <= 0x1F) goto yy294;
+                goto yy296;
             }
         } else {
-            if(yych <= '/') {
-                if(yych <= '"') goto yy297;
-                if(yych <= '.') goto yy291;
+            if(yych <= '.') {
+                if(yych == '"') goto yy300;
+                goto yy294;
             } else {
-                if(yych == '<') goto yy296;
-                goto yy291;
+                if(yych <= '/') goto yy298;
+                if(yych == '<') goto yy299;
+                goto yy294;
             }
         }
+yy298:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych == '*') goto yy306;
-        goto yy2;
-yy296:
+        if(yych == '*') goto yy309;
+        goto yy98;
+yy299:
         yych = *++YYCURSOR;
-        if(yych == '>') goto yy2;
-        goto yy303;
-yy297:
+        if(yych == '>') goto yy98;
+        goto yy306;
+yy300:
         yych = *++YYCURSOR;
-        if(yych == '"') goto yy2;
-        goto yy299;
-yy298:
+        if(yych == '"') goto yy98;
+        goto yy302;
+yy301:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-yy299:
+yy302:
         if(yybm[0+yych] & 8) {
-            goto yy298;
+            goto yy301;
         }
-        if(yych <= '!') goto yy2;
+        if(yych <= '!') goto yy98;
         ++YYCURSOR;
-#line 253 "cpp.re"
+#line 255 "cpp.re"
         { BOOST_WAVE_RET(T_PP_QHEADER); }
-#line 3364 "cpp_re.inc"
-yy302:
+#line 3378 "cpp_re.inc"
+yy305:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-yy303:
+yy306:
         if(yybm[0+yych] & 16) {
-            goto yy302;
+            goto yy305;
         }
-        if(yych <= '=') goto yy2;
+        if(yych <= '=') goto yy98;
         ++YYCURSOR;
-#line 250 "cpp.re"
+#line 252 "cpp.re"
         { BOOST_WAVE_RET(T_PP_HHEADER); }
-#line 3377 "cpp_re.inc"
-yy306:
+#line 3391 "cpp_re.inc"
+yy309:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 32) {
-            goto yy306;
+            goto yy309;
         }
-        if(yych == 0x0D) goto yy308;
-        if(yych <= ')') goto yy2;
-        goto yy310;
-yy308:
+        if(yych == 0x0D) goto yy311;
+        if(yych <= ')') goto yy98;
+        goto yy313;
+yy311:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 32) {
-            goto yy306;
+            goto yy309;
         }
-        if(yych == 0x0D) goto yy308;
-        if(yych <= ')') goto yy2;
-yy310:
+        if(yych == 0x0D) goto yy311;
+        if(yych <= ')') goto yy98;
+yy313:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 128) {
-            goto yy310;
+            goto yy313;
         }
         if(yych <= 0x0D) {
-            if(yych <= 0x08) goto yy2;
-            if(yych <= 0x0C) goto yy306;
+            if(yych <= 0x08) goto yy98;
+            if(yych <= 0x0C) goto yy309;
         } else {
-            if(yych <= 0x1F) goto yy2;
-            if(yych == '/') goto yy293;
-            goto yy306;
+            if(yych <= 0x1F) goto yy98;
+            if(yych == '/') goto yy296;
+            goto yy309;
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 32) {
-            goto yy306;
+            goto yy309;
         }
-        if(yych == 0x0D) goto yy308;
-        if(yych <= ')') goto yy2;
-        goto yy310;
-yy313:
+        if(yych == 0x0D) goto yy311;
+        if(yych <= ')') goto yy98;
+        goto yy313;
+yy316:
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'x') goto yy2;
+        if(yych != 'x') goto yy98;
         yych = *++YYCURSOR;
-        if(yych == 't') goto yy293;
-        goto yy2;
-yy316:
+        if(yych == 't') goto yy296;
+        goto yy98;
+yy319:
         yych = *++YYCURSOR;
-        if(yych != 'f') goto yy2;
+        if(yych != 'f') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'i') goto yy2;
+        if(yych != 'i') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'n') goto yy2;
+        if(yych != 'n') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         ++YYCURSOR;
-#line 264 "cpp.re"
+#line 266 "cpp.re"
         { BOOST_WAVE_RET(T_PP_DEFINE); }
-#line 3441 "cpp_re.inc"
-yy322:
+#line 3455 "cpp_re.inc"
+yy325:
         yych = *++YYCURSOR;
-        if(yych != 'd') goto yy2;
+        if(yych != 'd') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'f') goto yy2;
+        if(yych != 'f') goto yy98;
         ++YYCURSOR;
-#line 265 "cpp.re"
+#line 267 "cpp.re"
         { BOOST_WAVE_RET(T_PP_UNDEF); }
-#line 3452 "cpp_re.inc"
-yy327:
+#line 3466 "cpp_re.inc"
+yy330:
         yych = *++YYCURSOR;
-        if(yych != 'n') goto yy2;
+        if(yych != 'n') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         ++YYCURSOR;
-#line 266 "cpp.re"
+#line 268 "cpp.re"
         { BOOST_WAVE_RET(T_PP_LINE); }
-#line 3461 "cpp_re.inc"
-yy331:
+#line 3475 "cpp_re.inc"
+yy334:
         yych = *++YYCURSOR;
-        if(yych != 'a') goto yy2;
+        if(yych != 'a') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'g') goto yy2;
+        if(yych != 'g') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'm') goto yy2;
+        if(yych != 'm') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'a') goto yy2;
+        if(yych != 'a') goto yy98;
         ++YYCURSOR;
-#line 268 "cpp.re"
+#line 270 "cpp.re"
         { BOOST_WAVE_RET(T_PP_PRAGMA); }
-#line 3474 "cpp_re.inc"
-yy337:
+#line 3488 "cpp_re.inc"
+yy340:
         yych = *++YYCURSOR;
-        if(yych != 'r') goto yy2;
+        if(yych != 'r') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'n') goto yy2;
+        if(yych != 'n') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'i') goto yy2;
+        if(yych != 'i') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'n') goto yy2;
+        if(yych != 'n') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'g') goto yy2;
+        if(yych != 'g') goto yy98;
         ++YYCURSOR;
-#line 270 "cpp.re"
+#line 272 "cpp.re"
         { BOOST_WAVE_RET(T_PP_WARNING); }
-#line 3489 "cpp_re.inc"
-yy344:
+#line 3503 "cpp_re.inc"
+yy347:
         yych = *++YYCURSOR;
-        if(yych != 'g') goto yy2;
+        if(yych != 'g') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'i') goto yy2;
+        if(yych != 'i') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'o') goto yy2;
+        if(yych != 'o') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'n') goto yy2;
+        if(yych != 'n') goto yy98;
         ++YYCURSOR;
-#line 272 "cpp.re"
+#line 274 "cpp.re"
         { BOOST_WAVE_RET(T_MSEXT_PP_REGION); }
-#line 3502 "cpp_re.inc"
-yy350:
+#line 3516 "cpp_re.inc"
+yy353:
         yych = *++YYCURSOR;
-        if(yych == 'i') goto yy368;
-        if(yych == 's') goto yy369;
-        goto yy2;
-yy351:
+        if(yych == 'i') goto yy371;
+        if(yych == 's') goto yy372;
+        goto yy98;
+yy354:
         yych = *++YYCURSOR;
-        if(yych == 'd') goto yy357;
-        goto yy2;
-yy352:
+        if(yych == 'd') goto yy360;
+        goto yy98;
+yy355:
         yych = *++YYCURSOR;
-        if(yych != 'r') goto yy2;
+        if(yych != 'r') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'o') goto yy2;
+        if(yych != 'o') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'r') goto yy2;
+        if(yych != 'r') goto yy98;
         ++YYCURSOR;
-#line 267 "cpp.re"
+#line 269 "cpp.re"
         { BOOST_WAVE_RET(T_PP_ERROR); }
-#line 3522 "cpp_re.inc"
-yy357:
+#line 3536 "cpp_re.inc"
+yy360:
         yych = *++YYCURSOR;
-        if(yych == 'i') goto yy358;
-        if(yych == 'r') goto yy359;
-        goto yy2;
-yy358:
+        if(yych == 'i') goto yy361;
+        if(yych == 'r') goto yy362;
+        goto yy98;
+yy361:
         yych = *++YYCURSOR;
-        if(yych == 'f') goto yy366;
-        goto yy2;
-yy359:
+        if(yych == 'f') goto yy369;
+        goto yy98;
+yy362:
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'g') goto yy2;
+        if(yych != 'g') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'i') goto yy2;
+        if(yych != 'i') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'o') goto yy2;
+        if(yych != 'o') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'n') goto yy2;
+        if(yych != 'n') goto yy98;
         ++YYCURSOR;
-#line 273 "cpp.re"
+#line 275 "cpp.re"
         { BOOST_WAVE_RET(T_MSEXT_PP_ENDREGION); }
-#line 3546 "cpp_re.inc"
-yy366:
+#line 3560 "cpp_re.inc"
+yy369:
         ++YYCURSOR;
-#line 263 "cpp.re"
+#line 265 "cpp.re"
         { BOOST_WAVE_RET(T_PP_ENDIF); }
-#line 3551 "cpp_re.inc"
-yy368:
+#line 3565 "cpp_re.inc"
+yy371:
         yych = *++YYCURSOR;
-        if(yych == 'f') goto yy372;
-        goto yy2;
-yy369:
+        if(yych == 'f') goto yy375;
+        goto yy98;
+yy372:
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         ++YYCURSOR;
-#line 261 "cpp.re"
+#line 263 "cpp.re"
         { BOOST_WAVE_RET(T_PP_ELSE); }
-#line 3562 "cpp_re.inc"
-yy372:
+#line 3576 "cpp_re.inc"
+yy375:
         ++YYCURSOR;
-#line 262 "cpp.re"
+#line 264 "cpp.re"
         { BOOST_WAVE_RET(T_PP_ELIF); }
-#line 3567 "cpp_re.inc"
-yy374:
+#line 3581 "cpp_re.inc"
+yy377:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= 0x0D) {
-            if(yych <= 0x08) goto yy2;
-            if(yych <= 0x0C) goto yy374;
+            if(yych <= 0x08) goto yy98;
+            if(yych <= 0x0C) goto yy377;
         } else {
-            if(yych <= 0x1F) goto yy2;
-            if(yych == '*') goto yy378;
-            goto yy374;
+            if(yych <= 0x1F) goto yy98;
+            if(yych == '*') goto yy381;
+            goto yy377;
         }
-yy376:
+yy379:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= 0x0D) {
-            if(yych <= 0x08) goto yy2;
-            if(yych <= 0x0C) goto yy374;
-            goto yy376;
+            if(yych <= 0x08) goto yy98;
+            if(yych <= 0x0C) goto yy377;
+            goto yy379;
         } else {
-            if(yych <= 0x1F) goto yy2;
-            if(yych != '*') goto yy374;
+            if(yych <= 0x1F) goto yy98;
+            if(yych != '*') goto yy377;
         }
-yy378:
+yy381:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= 0x1F) {
-            if(yych <= 0x08) goto yy2;
-            if(yych <= 0x0C) goto yy374;
-            if(yych >= 0x0E) goto yy2;
+            if(yych <= 0x08) goto yy98;
+            if(yych <= 0x0C) goto yy377;
+            if(yych >= 0x0E) goto yy98;
         } else {
             if(yych <= '*') {
-                if(yych <= ')') goto yy374;
-                goto yy378;
+                if(yych <= ')') goto yy377;
+                goto yy381;
             } else {
-                if(yych == '/') goto yy257;
-                goto yy374;
+                if(yych == '/') goto yy260;
+                goto yy377;
             }
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= 0x0D) {
-            if(yych <= 0x08) goto yy2;
-            if(yych <= 0x0C) goto yy374;
-            goto yy376;
+            if(yych <= 0x08) goto yy98;
+            if(yych <= 0x0C) goto yy377;
+            goto yy379;
         } else {
-            if(yych <= 0x1F) goto yy2;
-            if(yych == '*') goto yy378;
-            goto yy374;
+            if(yych <= 0x1F) goto yy98;
+            if(yych == '*') goto yy381;
+            goto yy377;
         }
-yy381:
+yy384:
         ++YYCURSOR;
-#line 152 "cpp.re"
+#line 154 "cpp.re"
         { 
             if (s->act_in_c99_mode) {
                 --YYCURSOR;
@@ -3629,2414 +3643,2415 @@
                 BOOST_WAVE_RET(T_COLON_COLON); 
             }
         }
-#line 3633 "cpp_re.inc"
-yy383:
+#line 3647 "cpp_re.inc"
+yy386:
         ++YYCURSOR;
-#line 136 "cpp.re"
+#line 138 "cpp.re"
         { BOOST_WAVE_RET(T_RIGHTBRACKET_ALT); }
-#line 3638 "cpp_re.inc"
-yy385:
+#line 3652 "cpp_re.inc"
+yy388:
         yyaccept = 12;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'h') {
-            if(yych <= '$') {
-                if(yych <= 0x09) {
-                    if(yych >= 0x09) goto yy258;
+        if(yych <= 'e') {
+            if(yych <= ' ') {
+                if(yych <= 0x0A) {
+                    if(yych == 0x09) goto yy261;
                 } else {
-                    if(yych == ' ') goto yy258;
+                    if(yych <= 0x0C) goto yy261;
+                    if(yych >= ' ') goto yy261;
                 }
             } else {
-                if(yych <= '/') {
-                    if(yych <= '%') goto yy391;
-                    if(yych >= '/') goto yy258;
+                if(yych <= '.') {
+                    if(yych == '%') goto yy394;
                 } else {
-                    if(yych <= 'c') goto yy386;
-                    if(yych <= 'e') goto yy258;
+                    if(yych <= '/') goto yy261;
+                    if(yych >= 'd') goto yy261;
                 }
             }
         } else {
-            if(yych <= 'q') {
-                if(yych <= 'l') {
-                    if(yych <= 'i') goto yy258;
-                    if(yych >= 'l') goto yy258;
+            if(yych <= 'p') {
+                if(yych <= 'k') {
+                    if(yych == 'i') goto yy261;
                 } else {
-                    if(yych == 'p') goto yy258;
+                    if(yych <= 'l') goto yy261;
+                    if(yych >= 'p') goto yy261;
                 }
             } else {
-                if(yych <= 'u') {
-                    if(yych <= 'r') goto yy258;
-                    if(yych >= 'u') goto yy258;
+                if(yych <= 't') {
+                    if(yych == 'r') goto yy261;
                 } else {
-                    if(yych == 'w') goto yy258;
+                    if(yych == 'v') goto yy389;
+                    if(yych <= 'w') goto yy261;
                 }
             }
         }
-yy386:
-#line 138 "cpp.re"
+yy389:
+#line 140 "cpp.re"
         { BOOST_WAVE_RET(T_POUND_ALT); }
-#line 3678 "cpp_re.inc"
-yy387:
+#line 3692 "cpp_re.inc"
+yy390:
         ++YYCURSOR;
-#line 197 "cpp.re"
+#line 199 "cpp.re"
         { BOOST_WAVE_RET(T_PERCENTASSIGN); }
-#line 3683 "cpp_re.inc"
-yy389:
+#line 3697 "cpp_re.inc"
+yy392:
         ++YYCURSOR;
-#line 130 "cpp.re"
+#line 132 "cpp.re"
         { BOOST_WAVE_RET(T_RIGHTBRACE_ALT); }
-#line 3688 "cpp_re.inc"
-yy391:
+#line 3702 "cpp_re.inc"
+yy394:
         yych = *++YYCURSOR;
-        if(yych != ':') goto yy2;
+        if(yych != ':') goto yy98;
         ++YYCURSOR;
-#line 144 "cpp.re"
+#line 146 "cpp.re"
         { BOOST_WAVE_RET(T_POUND_POUND_ALT); }
-#line 3695 "cpp_re.inc"
-yy394:
+#line 3709 "cpp_re.inc"
+yy397:
         ++YYCURSOR;
-#line 213 "cpp.re"
+#line 215 "cpp.re"
         { BOOST_WAVE_RET(T_LESSEQUAL); }
-#line 3700 "cpp_re.inc"
-yy396:
+#line 3714 "cpp_re.inc"
+yy399:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) == '=') goto yy402;
-#line 206 "cpp.re"
+        if((yych = *YYCURSOR) == '=') goto yy405;
+#line 208 "cpp.re"
         { BOOST_WAVE_RET(T_SHIFTLEFT); }
-#line 3706 "cpp_re.inc"
-yy398:
+#line 3720 "cpp_re.inc"
+yy401:
         ++YYCURSOR;
-#line 133 "cpp.re"
+#line 135 "cpp.re"
         { BOOST_WAVE_RET(T_LEFTBRACKET_ALT); }
-#line 3711 "cpp_re.inc"
-yy400:
+#line 3725 "cpp_re.inc"
+yy403:
         ++YYCURSOR;
-#line 127 "cpp.re"
+#line 129 "cpp.re"
         { BOOST_WAVE_RET(T_LEFTBRACE_ALT); }
-#line 3716 "cpp_re.inc"
-yy402:
+#line 3730 "cpp_re.inc"
+yy405:
         ++YYCURSOR;
-#line 209 "cpp.re"
+#line 211 "cpp.re"
         { BOOST_WAVE_RET(T_SHIFTLEFTASSIGN); }
-#line 3721 "cpp_re.inc"
-yy404:
+#line 3735 "cpp_re.inc"
+yy407:
         yych = *++YYCURSOR;
-        switch(yych){
-        case '!':   goto yy417;
-        case '\'':  goto yy415;
-        case '(':   goto yy409;
-        case ')':   goto yy411;
-        case '-':   goto yy419;
-        case '/':   goto yy421;
-        case '<':   goto yy405;
-        case '=':   goto yy413;
-        case '>':   goto yy407;
-        default:    goto yy2;
+        switch(yych) {
+        case '!':    goto yy420;
+        case '\'':    goto yy418;
+        case '(':    goto yy412;
+        case ')':    goto yy414;
+        case '-':    goto yy422;
+        case '/':    goto yy424;
+        case '<':    goto yy408;
+        case '=':    goto yy416;
+        case '>':    goto yy410;
+        default:    goto yy98;
         }
-yy405:
+yy408:
         ++YYCURSOR;
-#line 126 "cpp.re"
+#line 128 "cpp.re"
         { BOOST_WAVE_RET(T_LEFTBRACE_TRIGRAPH); }
-#line 3740 "cpp_re.inc"
-yy407:
+#line 3754 "cpp_re.inc"
+yy410:
         ++YYCURSOR;
-#line 129 "cpp.re"
+#line 131 "cpp.re"
         { BOOST_WAVE_RET(T_RIGHTBRACE_TRIGRAPH); }
-#line 3745 "cpp_re.inc"
-yy409:
+#line 3759 "cpp_re.inc"
+yy412:
         ++YYCURSOR;
-#line 132 "cpp.re"
+#line 134 "cpp.re"
         { BOOST_WAVE_RET(T_LEFTBRACKET_TRIGRAPH); }
-#line 3750 "cpp_re.inc"
-yy411:
+#line 3764 "cpp_re.inc"
+yy414:
         ++YYCURSOR;
-#line 135 "cpp.re"
+#line 137 "cpp.re"
         { BOOST_WAVE_RET(T_RIGHTBRACKET_TRIGRAPH); }
-#line 3755 "cpp_re.inc"
-yy413:
+#line 3769 "cpp_re.inc"
+yy416:
         yyaccept = 13;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'e') {
-            if(yych <= '#') {
-                if(yych <= 0x1F) {
-                    if(yych == 0x09) goto yy258;
+        if(yych <= 'c') {
+            if(yych <= ' ') {
+                if(yych <= 0x0A) {
+                    if(yych == 0x09) goto yy261;
                 } else {
-                    if(yych <= ' ') goto yy258;
-                    if(yych >= '#') goto yy434;
+                    if(yych <= 0x0C) goto yy261;
+                    if(yych >= ' ') goto yy261;
                 }
             } else {
-                if(yych <= '>') {
-                    if(yych == '/') goto yy258;
+                if(yych <= '.') {
+                    if(yych == '#') goto yy437;
                 } else {
-                    if(yych <= '?') goto yy433;
-                    if(yych >= 'd') goto yy258;
+                    if(yych <= '/') goto yy261;
+                    if(yych == '?') goto yy436;
                 }
             }
         } else {
             if(yych <= 'p') {
-                if(yych <= 'k') {
-                    if(yych == 'i') goto yy258;
+                if(yych <= 'i') {
+                    if(yych <= 'e') goto yy261;
+                    if(yych >= 'i') goto yy261;
                 } else {
-                    if(yych <= 'l') goto yy258;
-                    if(yych >= 'p') goto yy258;
+                    if(yych == 'l') goto yy261;
+                    if(yych >= 'p') goto yy261;
                 }
             } else {
                 if(yych <= 't') {
-                    if(yych == 'r') goto yy258;
+                    if(yych == 'r') goto yy261;
                 } else {
-                    if(yych == 'v') goto yy414;
-                    if(yych <= 'w') goto yy258;
+                    if(yych == 'v') goto yy417;
+                    if(yych <= 'w') goto yy261;
                 }
             }
         }
-yy414:
-#line 139 "cpp.re"
+yy417:
+#line 141 "cpp.re"
         { BOOST_WAVE_RET(T_POUND_TRIGRAPH); }
-#line 3795 "cpp_re.inc"
-yy415:
+#line 3810 "cpp_re.inc"
+yy418:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) == '=') goto yy431;
-#line 178 "cpp.re"
+        if((yych = *YYCURSOR) == '=') goto yy434;
+#line 180 "cpp.re"
         { BOOST_WAVE_RET(T_XOR_TRIGRAPH); }
-#line 3801 "cpp_re.inc"
-yy417:
+#line 3816 "cpp_re.inc"
+yy420:
         yyaccept = 14;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= '>') {
-            if(yych == '=') goto yy426;
+            if(yych == '=') goto yy429;
         } else {
-            if(yych <= '?') goto yy423;
-            if(yych == '|') goto yy424;
+            if(yych <= '?') goto yy426;
+            if(yych == '|') goto yy427;
         }
-yy418:
-#line 184 "cpp.re"
+yy421:
+#line 186 "cpp.re"
         { BOOST_WAVE_RET(T_OR_TRIGRAPH); }
-#line 3814 "cpp_re.inc"
-yy419:
+#line 3829 "cpp_re.inc"
+yy422:
         ++YYCURSOR;
-#line 186 "cpp.re"
+#line 188 "cpp.re"
         { BOOST_WAVE_RET(T_COMPL_TRIGRAPH); }
-#line 3819 "cpp_re.inc"
-yy421:
+#line 3834 "cpp_re.inc"
+yy424:
         yyaccept = 15;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'U') goto yy183;
-        if(yych == 'u') goto yy182;
-yy422:
-#line 236 "cpp.re"
+        if(yych == 'U') goto yy186;
+        if(yych == 'u') goto yy185;
+yy425:
+#line 238 "cpp.re"
         { BOOST_WAVE_RET(T_ANY_TRIGRAPH); }
-#line 3828 "cpp_re.inc"
-yy423:
+#line 3843 "cpp_re.inc"
+yy426:
         yych = *++YYCURSOR;
-        if(yych == '?') goto yy428;
-        goto yy2;
-yy424:
+        if(yych == '?') goto yy431;
+        goto yy98;
+yy427:
         ++YYCURSOR;
-#line 218 "cpp.re"
+#line 220 "cpp.re"
         { BOOST_WAVE_RET(T_OROR_TRIGRAPH); }
-#line 3837 "cpp_re.inc"
-yy426:
+#line 3852 "cpp_re.inc"
+yy429:
         ++YYCURSOR;
-#line 205 "cpp.re"
+#line 207 "cpp.re"
         { BOOST_WAVE_RET(T_ORASSIGN_TRIGRAPH); }
-#line 3842 "cpp_re.inc"
-yy428:
+#line 3857 "cpp_re.inc"
+yy431:
         yych = *++YYCURSOR;
-        if(yych != '!') goto yy2;
+        if(yych != '!') goto yy98;
         ++YYCURSOR;
-#line 221 "cpp.re"
+#line 223 "cpp.re"
         { BOOST_WAVE_RET(T_OROR_TRIGRAPH); }
-#line 3849 "cpp_re.inc"
-yy431:
+#line 3864 "cpp_re.inc"
+yy434:
         ++YYCURSOR;
-#line 200 "cpp.re"
+#line 202 "cpp.re"
         { BOOST_WAVE_RET(T_XORASSIGN_TRIGRAPH); }
-#line 3854 "cpp_re.inc"
-yy433:
+#line 3869 "cpp_re.inc"
+yy436:
         yych = *++YYCURSOR;
-        if(yych == '?') goto yy436;
-        goto yy2;
-yy434:
+        if(yych == '?') goto yy439;
+        goto yy98;
+yy437:
         ++YYCURSOR;
-#line 142 "cpp.re"
+#line 144 "cpp.re"
         { BOOST_WAVE_RET(T_POUND_POUND_TRIGRAPH); }
-#line 3863 "cpp_re.inc"
-yy436:
+#line 3878 "cpp_re.inc"
+yy439:
         yych = *++YYCURSOR;
-        if(yych != '=') goto yy2;
+        if(yych != '=') goto yy98;
         ++YYCURSOR;
-#line 143 "cpp.re"
+#line 145 "cpp.re"
         { BOOST_WAVE_RET(T_POUND_POUND_TRIGRAPH); }
-#line 3870 "cpp_re.inc"
-yy439:
+#line 3885 "cpp_re.inc"
+yy442:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        switch(yych){
-        case 'a':   goto yy440;
-        case 'b':   goto yy441;
-        case 'c':   goto yy442;
-        case 'd':   goto yy443;
-        case 'e':   goto yy492;
-        case 'f':   goto yy490;
-        case 'i':   goto yy489;
-        case 'l':   goto yy493;
-        case 's':   goto yy446;
-        case 't':   goto yy491;
-        default:    goto yy192;
+        switch(yych) {
+        case 'a':    goto yy443;
+        case 'b':    goto yy444;
+        case 'c':    goto yy445;
+        case 'd':    goto yy446;
+        case 'e':    goto yy495;
+        case 'f':    goto yy493;
+        case 'i':    goto yy492;
+        case 'l':    goto yy496;
+        case 's':    goto yy449;
+        case 't':    goto yy494;
+        default:    goto yy195;
         }
-yy440:
+yy443:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 's') goto yy486;
-        goto yy192;
-yy441:
+        if(yych == 's') goto yy489;
+        goto yy195;
+yy444:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy481;
-        goto yy192;
-yy442:
+        if(yych == 'a') goto yy484;
+        goto yy195;
+yy445:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'd') goto yy476;
-        goto yy192;
-yy443:
+        if(yych == 'd') goto yy479;
+        goto yy195;
+yy446:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'e') goto yy468;
-        goto yy192;
-yy444:
+        if(yych == 'e') goto yy471;
+        goto yy195;
+yy447:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy460;
-        goto yy192;
-yy445:
+        if(yych == 'a') goto yy463;
+        goto yy195;
+yy448:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'n') goto yy454;
-        goto yy192;
-yy446:
+        if(yych == 'n') goto yy457;
+        goto yy195;
+yy449:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'd') goto yy192;
+        if(yych != 'd') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 16;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy453:
-#line 117 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy456:
+#line 119 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_STDCALL : T_IDENTIFIER); }
-#line 3946 "cpp_re.inc"
-yy454:
+#line 3961 "cpp_re.inc"
+yy457:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
-yy455:
+        if(yych != 'l') goto yy195;
+yy458:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 17;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy459:
-#line 122 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy462:
+#line 124 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_INLINE : T_IDENTIFIER); }
-#line 3971 "cpp_re.inc"
-yy460:
+#line 3986 "cpp_re.inc"
+yy463:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 18;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy467:
-#line 116 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy470:
+#line 118 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_FASTCALL : T_IDENTIFIER); }
-#line 4001 "cpp_re.inc"
-yy468:
+#line 4016 "cpp_re.inc"
+yy471:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'p') goto yy192;
+        if(yych != 'p') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 19;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy475:
-#line 114 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy478:
+#line 116 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_DECLSPEC : T_IDENTIFIER); }
-#line 4031 "cpp_re.inc"
-yy476:
+#line 4046 "cpp_re.inc"
+yy479:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 20;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy480:
-#line 115 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy483:
+#line 117 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_CDECL : T_IDENTIFIER); }
-#line 4052 "cpp_re.inc"
-yy481:
+#line 4067 "cpp_re.inc"
+yy484:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'd') goto yy192;
+        if(yych != 'd') goto yy195;
         yyaccept = 21;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy485:
-#line 113 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy488:
+#line 115 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_BASED : T_IDENTIFIER); }
-#line 4073 "cpp_re.inc"
-yy486:
+#line 4088 "cpp_re.inc"
+yy489:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'm') goto yy192;
+        if(yych != 'm') goto yy195;
         yyaccept = 22;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy488:
-#line 123 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy491:
+#line 125 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_ASM : T_IDENTIFIER); }
-#line 4088 "cpp_re.inc"
-yy489:
+#line 4103 "cpp_re.inc"
+yy492:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'n') goto yy515;
-        goto yy192;
-yy490:
+        if(yych == 'n') goto yy518;
+        goto yy195;
+yy493:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy460;
-        if(yych == 'i') goto yy508;
-        goto yy192;
-yy491:
+        if(yych == 'a') goto yy463;
+        if(yych == 'i') goto yy511;
+        goto yy195;
+yy494:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'r') goto yy505;
-        goto yy192;
-yy492:
+        if(yych == 'r') goto yy508;
+        goto yy195;
+yy495:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'x') goto yy499;
-        goto yy192;
-yy493:
+        if(yych == 'x') goto yy502;
+        goto yy195;
+yy496:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'v') goto yy192;
+        if(yych != 'v') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 23;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy498:
-#line 121 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy501:
+#line 123 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_LEAVE : T_IDENTIFIER); }
-#line 4133 "cpp_re.inc"
-yy499:
+#line 4148 "cpp_re.inc"
+yy502:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'p') goto yy192;
+        if(yych != 'p') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 24;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy504:
-#line 119 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy507:
+#line 121 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_EXCEPT : T_IDENTIFIER); }
-#line 4157 "cpp_re.inc"
-yy505:
+#line 4172 "cpp_re.inc"
+yy508:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'y') goto yy192;
+        if(yych != 'y') goto yy195;
         yyaccept = 25;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy507:
-#line 118 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy510:
+#line 120 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_TRY : T_IDENTIFIER); }
-#line 4172 "cpp_re.inc"
-yy508:
+#line 4187 "cpp_re.inc"
+yy511:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'y') goto yy192;
+        if(yych != 'y') goto yy195;
         yyaccept = 26;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy514:
-#line 120 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy517:
+#line 122 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_FINALLY : T_IDENTIFIER); }
-#line 4199 "cpp_re.inc"
-yy515:
+#line 4214 "cpp_re.inc"
+yy518:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'l') goto yy455;
-        if(yych != 't') goto yy192;
+        if(yych == 'l') goto yy458;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        switch(yych){
-        case '1':   goto yy517;
-        case '3':   goto yy518;
-        case '6':   goto yy519;
-        case '8':   goto yy520;
-        default:    goto yy192;
+        switch(yych) {
+        case '1':    goto yy520;
+        case '3':    goto yy521;
+        case '6':    goto yy522;
+        case '8':    goto yy523;
+        default:    goto yy195;
         }
-yy517:
+yy520:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == '6') goto yy526;
-        goto yy192;
-yy518:
+        if(yych == '6') goto yy529;
+        goto yy195;
+yy521:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == '2') goto yy524;
-        goto yy192;
-yy519:
+        if(yych == '2') goto yy527;
+        goto yy195;
+yy522:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == '4') goto yy522;
-        goto yy192;
-yy520:
+        if(yych == '4') goto yy525;
+        goto yy195;
+yy523:
         yyaccept = 27;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy521:
-#line 109 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy524:
+#line 111 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_INT8 : T_IDENTIFIER); }
-#line 4240 "cpp_re.inc"
-yy522:
+#line 4255 "cpp_re.inc"
+yy525:
         yyaccept = 28;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy523:
-#line 112 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy526:
+#line 114 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_INT64 : T_IDENTIFIER); }
-#line 4252 "cpp_re.inc"
-yy524:
+#line 4267 "cpp_re.inc"
+yy527:
         yyaccept = 29;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy525:
-#line 111 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy528:
+#line 113 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_INT32 : T_IDENTIFIER); }
-#line 4264 "cpp_re.inc"
-yy526:
+#line 4279 "cpp_re.inc"
+yy529:
         yyaccept = 30;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy527:
-#line 110 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy530:
+#line 112 "cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_INT16 : T_IDENTIFIER); }
-#line 4276 "cpp_re.inc"
-yy528:
+#line 4291 "cpp_re.inc"
+yy531:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'h') goto yy534;
-        goto yy192;
-yy529:
+        if(yych == 'h') goto yy537;
+        goto yy195;
+yy532:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 31;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy533:
-#line 107 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy536:
+#line 109 "cpp.re"
         { BOOST_WAVE_RET(T_WHILE); }
-#line 4302 "cpp_re.inc"
-yy534:
+#line 4317 "cpp_re.inc"
+yy537:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != '_') goto yy192;
+        if(yych != '_') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 32;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy539:
-#line 106 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy542:
+#line 108 "cpp.re"
         { BOOST_WAVE_RET(T_WCHART); }
-#line 4326 "cpp_re.inc"
-yy540:
+#line 4341 "cpp_re.inc"
+yy543:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'r') goto yy552;
-        goto yy192;
-yy541:
+        if(yych == 'r') goto yy555;
+        goto yy195;
+yy544:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy542;
-        if(yych == 'l') goto yy543;
-        goto yy192;
-yy542:
+        if(yych == 'i') goto yy545;
+        if(yych == 'l') goto yy546;
+        goto yy195;
+yy545:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'd') goto yy550;
-        goto yy192;
-yy543:
+        if(yych == 'd') goto yy553;
+        goto yy195;
+yy546:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 33;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy549:
-#line 105 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy552:
+#line 107 "cpp.re"
         { BOOST_WAVE_RET(T_VOLATILE); }
-#line 4369 "cpp_re.inc"
-yy550:
+#line 4384 "cpp_re.inc"
+yy553:
         yyaccept = 34;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy551:
-#line 104 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy554:
+#line 106 "cpp.re"
         { BOOST_WAVE_RET(T_VOID); }
-#line 4381 "cpp_re.inc"
-yy552:
+#line 4396 "cpp_re.inc"
+yy555:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'u') goto yy192;
+        if(yych != 'u') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 35;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy557:
-#line 103 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy560:
+#line 105 "cpp.re"
         { BOOST_WAVE_RET(T_VIRTUAL); }
-#line 4405 "cpp_re.inc"
-yy558:
+#line 4420 "cpp_re.inc"
+yy561:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy564;
-        if(yych == 's') goto yy565;
-        goto yy192;
-yy559:
+        if(yych == 'i') goto yy567;
+        if(yych == 's') goto yy568;
+        goto yy195;
+yy562:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'g') goto yy192;
+        if(yych != 'g') goto yy195;
         yyaccept = 36;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy563:
-#line 102 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy566:
+#line 104 "cpp.re"
         { BOOST_WAVE_RET(T_USING); }
-#line 4432 "cpp_re.inc"
-yy564:
+#line 4447 "cpp_re.inc"
+yy567:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'o') goto yy572;
-        goto yy192;
-yy565:
+        if(yych == 'o') goto yy575;
+        goto yy195;
+yy568:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'g') goto yy192;
+        if(yych != 'g') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'd') goto yy192;
+        if(yych != 'd') goto yy195;
         yyaccept = 37;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy571:
-#line 101 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy574:
+#line 103 "cpp.re"
         { BOOST_WAVE_RET(T_UNSIGNED); }
-#line 4464 "cpp_re.inc"
-yy572:
+#line 4479 "cpp_re.inc"
+yy575:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 38;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy574:
-#line 100 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy577:
+#line 102 "cpp.re"
         { BOOST_WAVE_RET(T_UNION); }
-#line 4479 "cpp_re.inc"
-yy575:
+#line 4494 "cpp_re.inc"
+yy578:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'm') goto yy605;
-        goto yy192;
-yy576:
+        if(yych == 'm') goto yy608;
+        goto yy195;
+yy579:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy598;
-        if(yych == 'r') goto yy599;
-        goto yy192;
-yy577:
+        if(yych == 'i') goto yy601;
+        if(yych == 'r') goto yy602;
+        goto yy195;
+yy580:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'u') goto yy593;
-        if(yych == 'y') goto yy594;
-        goto yy192;
-yy578:
+        if(yych == 'u') goto yy596;
+        if(yych == 'y') goto yy597;
+        goto yy195;
+yy581:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'p') goto yy192;
+        if(yych != 'p') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= 'h') {
-            if(yych != 'd') goto yy192;
+            if(yych != 'd') goto yy195;
         } else {
-            if(yych <= 'i') goto yy582;
-            if(yych == 'n') goto yy583;
-            goto yy192;
+            if(yych <= 'i') goto yy585;
+            if(yych == 'n') goto yy586;
+            goto yy195;
         }
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'e') goto yy590;
-        goto yy192;
-yy582:
+        if(yych == 'e') goto yy593;
+        goto yy195;
+yy585:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'd') goto yy588;
-        goto yy192;
-yy583:
+        if(yych == 'd') goto yy591;
+        goto yy195;
+yy586:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'm') goto yy192;
+        if(yych != 'm') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 39;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy587:
-#line 99 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy590:
+#line 101 "cpp.re"
         { BOOST_WAVE_RET(T_TYPENAME); }
-#line 4542 "cpp_re.inc"
-yy588:
+#line 4557 "cpp_re.inc"
+yy591:
         yyaccept = 40;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy589:
-#line 98 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy592:
+#line 100 "cpp.re"
         { BOOST_WAVE_RET(T_TYPEID); }
-#line 4554 "cpp_re.inc"
-yy590:
+#line 4569 "cpp_re.inc"
+yy593:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'f') goto yy192;
+        if(yych != 'f') goto yy195;
         yyaccept = 41;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy592:
-#line 97 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy595:
+#line 99 "cpp.re"
         { BOOST_WAVE_RET(T_TYPEDEF); }
-#line 4569 "cpp_re.inc"
-yy593:
+#line 4584 "cpp_re.inc"
+yy596:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'e') goto yy596;
-        goto yy192;
-yy594:
+        if(yych == 'e') goto yy599;
+        goto yy195;
+yy597:
         yyaccept = 42;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy595:
-#line 96 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy598:
+#line 98 "cpp.re"
         { BOOST_WAVE_RET(T_TRY); }
-#line 4586 "cpp_re.inc"
-yy596:
+#line 4601 "cpp_re.inc"
+yy599:
         yyaccept = 43;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy597:
-#line 95 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy600:
+#line 97 "cpp.re"
         { BOOST_WAVE_RET(T_TRUE); }
-#line 4598 "cpp_re.inc"
-yy598:
+#line 4613 "cpp_re.inc"
+yy601:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 's') goto yy603;
-        goto yy192;
-yy599:
+        if(yych == 's') goto yy606;
+        goto yy195;
+yy602:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'o') goto yy192;
+        if(yych != 'o') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'w') goto yy192;
+        if(yych != 'w') goto yy195;
         yyaccept = 44;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy602:
-#line 94 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy605:
+#line 96 "cpp.re"
         { BOOST_WAVE_RET(T_THROW); }
-#line 4621 "cpp_re.inc"
-yy603:
+#line 4636 "cpp_re.inc"
+yy606:
         yyaccept = 45;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy604:
-#line 93 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy607:
+#line 95 "cpp.re"
         { BOOST_WAVE_RET(T_THIS); }
-#line 4633 "cpp_re.inc"
-yy605:
+#line 4648 "cpp_re.inc"
+yy608:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'p') goto yy192;
+        if(yych != 'p') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 46;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy611:
-#line 92 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy614:
+#line 94 "cpp.re"
         { BOOST_WAVE_RET(T_TEMPLATE); }
-#line 4660 "cpp_re.inc"
-yy612:
+#line 4675 "cpp_re.inc"
+yy615:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'o') goto yy647;
-        goto yy192;
-yy613:
+        if(yych == 'o') goto yy650;
+        goto yy195;
+yy616:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'g') goto yy637;
-        if(yych == 'z') goto yy638;
-        goto yy192;
-yy614:
+        if(yych == 'g') goto yy640;
+        if(yych == 'z') goto yy641;
+        goto yy195;
+yy617:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy621;
-        if(yych == 'r') goto yy622;
-        goto yy192;
-yy615:
+        if(yych == 'a') goto yy624;
+        if(yych == 'r') goto yy625;
+        goto yy195;
+yy618:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'h') goto yy192;
+        if(yych != 'h') goto yy195;
         yyaccept = 47;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy620:
-#line 91 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy623:
+#line 93 "cpp.re"
         { BOOST_WAVE_RET(T_SWITCH); }
-#line 4701 "cpp_re.inc"
-yy621:
+#line 4716 "cpp_re.inc"
+yy624:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 't') goto yy627;
-        goto yy192;
-yy622:
+        if(yych == 't') goto yy630;
+        goto yy195;
+yy625:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'u') goto yy192;
+        if(yych != 'u') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 48;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy626:
-#line 90 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy629:
+#line 92 "cpp.re"
         { BOOST_WAVE_RET(T_STRUCT); }
-#line 4727 "cpp_re.inc"
-yy627:
+#line 4742 "cpp_re.inc"
+yy630:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 49;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= '@') {
             if(yych <= '/') {
-                if(yych == '$') goto yy191;
+                if(yych == '$') goto yy194;
             } else {
-                if(yych <= '9') goto yy191;
-                if(yych == '?') goto yy194;
+                if(yych <= '9') goto yy194;
+                if(yych == '?') goto yy197;
             }
         } else {
             if(yych <= '^') {
-                if(yych <= 'Z') goto yy191;
-                if(yych == '\\') goto yy193;
+                if(yych <= 'Z') goto yy194;
+                if(yych == '\\') goto yy196;
             } else {
-                if(yych <= '_') goto yy631;
-                if(yych <= '`') goto yy630;
-                if(yych <= 'z') goto yy191;
+                if(yych <= '_') goto yy634;
+                if(yych <= '`') goto yy633;
+                if(yych <= 'z') goto yy194;
             }
         }
-yy630:
-#line 88 "cpp.re"
+yy633:
+#line 90 "cpp.re"
         { BOOST_WAVE_RET(T_STATIC); }
-#line 4757 "cpp_re.inc"
-yy631:
+#line 4772 "cpp_re.inc"
+yy634:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 50;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy636:
-#line 89 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy639:
+#line 91 "cpp.re"
         { BOOST_WAVE_RET(T_STATICCAST); }
-#line 4781 "cpp_re.inc"
-yy637:
+#line 4796 "cpp_re.inc"
+yy640:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'n') goto yy643;
-        goto yy192;
-yy638:
+        if(yych == 'n') goto yy646;
+        goto yy195;
+yy641:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'o') goto yy192;
+        if(yych != 'o') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'f') goto yy192;
+        if(yych != 'f') goto yy195;
         yyaccept = 51;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy642:
-#line 87 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy645:
+#line 89 "cpp.re"
         { BOOST_WAVE_RET(T_SIZEOF); }
-#line 4807 "cpp_re.inc"
-yy643:
+#line 4822 "cpp_re.inc"
+yy646:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'd') goto yy192;
+        if(yych != 'd') goto yy195;
         yyaccept = 52;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy646:
-#line 86 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy649:
+#line 88 "cpp.re"
         { BOOST_WAVE_RET(T_SIGNED); }
-#line 4825 "cpp_re.inc"
-yy647:
+#line 4840 "cpp_re.inc"
+yy650:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 53;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy650:
-#line 85 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy653:
+#line 87 "cpp.re"
         { BOOST_WAVE_RET(T_SHORT); }
-#line 4843 "cpp_re.inc"
-yy651:
+#line 4858 "cpp_re.inc"
+yy654:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= 'h') {
-            if(yych != 'g') goto yy192;
+            if(yych != 'g') goto yy195;
         } else {
-            if(yych <= 'i') goto yy653;
-            if(yych == 't') goto yy654;
-            goto yy192;
+            if(yych <= 'i') goto yy656;
+            if(yych == 't') goto yy657;
+            goto yy195;
         }
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy673;
-        goto yy192;
-yy653:
+        if(yych == 'i') goto yy676;
+        goto yy195;
+yy656:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'n') goto yy659;
-        goto yy192;
-yy654:
+        if(yych == 'n') goto yy662;
+        goto yy195;
+yy657:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'u') goto yy192;
+        if(yych != 'u') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 54;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy658:
-#line 84 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy661:
+#line 86 "cpp.re"
         { BOOST_WAVE_RET(T_RETURN); }
-#line 4883 "cpp_re.inc"
-yy659:
+#line 4898 "cpp_re.inc"
+yy662:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'p') goto yy192;
+        if(yych != 'p') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != '_') goto yy192;
+        if(yych != '_') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 55;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy672:
-#line 83 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy675:
+#line 85 "cpp.re"
         { BOOST_WAVE_RET(T_REINTERPRETCAST); }
-#line 4931 "cpp_re.inc"
-yy673:
+#line 4946 "cpp_re.inc"
+yy676:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 56;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy678:
-#line 82 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy681:
+#line 84 "cpp.re"
         { BOOST_WAVE_RET(T_REGISTER); }
-#line 4955 "cpp_re.inc"
-yy679:
+#line 4970 "cpp_re.inc"
+yy682:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy686;
-        if(yych == 'o') goto yy687;
-        goto yy192;
-yy680:
+        if(yych == 'i') goto yy689;
+        if(yych == 'o') goto yy690;
+        goto yy195;
+yy683:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'b') goto yy192;
+        if(yych != 'b') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 57;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy685:
-#line 81 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy688:
+#line 83 "cpp.re"
         { BOOST_WAVE_RET(T_PUBLIC); }
-#line 4985 "cpp_re.inc"
-yy686:
+#line 5000 "cpp_re.inc"
+yy689:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'v') goto yy695;
-        goto yy192;
-yy687:
+        if(yych == 'v') goto yy698;
+        goto yy195;
+yy690:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'd') goto yy192;
+        if(yych != 'd') goto yy195;
         yyaccept = 58;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy694:
-#line 80 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy697:
+#line 82 "cpp.re"
         { BOOST_WAVE_RET(T_PROTECTED); }
-#line 5020 "cpp_re.inc"
-yy695:
+#line 5035 "cpp_re.inc"
+yy698:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 59;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy699:
-#line 79 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy702:
+#line 81 "cpp.re"
         { BOOST_WAVE_RET(T_PRIVATE); }
-#line 5041 "cpp_re.inc"
-yy700:
+#line 5056 "cpp_re.inc"
+yy703:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'e') goto yy707;
-        goto yy192;
-yy701:
+        if(yych == 'e') goto yy710;
+        goto yy195;
+yy704:
         yyaccept = 60;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= '@') {
             if(yych <= '/') {
-                if(yych == '$') goto yy191;
+                if(yych == '$') goto yy194;
             } else {
-                if(yych <= '9') goto yy191;
-                if(yych == '?') goto yy194;
+                if(yych <= '9') goto yy194;
+                if(yych == '?') goto yy197;
             }
         } else {
             if(yych <= '^') {
-                if(yych <= 'Z') goto yy191;
-                if(yych == '\\') goto yy193;
+                if(yych <= 'Z') goto yy194;
+                if(yych == '\\') goto yy196;
             } else {
-                if(yych <= '_') goto yy703;
-                if(yych <= '`') goto yy702;
-                if(yych <= 'z') goto yy191;
+                if(yych <= '_') goto yy706;
+                if(yych <= '`') goto yy705;
+                if(yych <= 'z') goto yy194;
             }
         }
-yy702:
-#line 220 "cpp.re"
+yy705:
+#line 222 "cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_OROR_ALT); }
-#line 5070 "cpp_re.inc"
-yy703:
+#line 5085 "cpp_re.inc"
+yy706:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'q') goto yy192;
+        if(yych != 'q') goto yy195;
         yyaccept = 61;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy706:
-#line 204 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy709:
+#line 206 "cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_ORASSIGN_ALT); }
-#line 5088 "cpp_re.inc"
-yy707:
+#line 5103 "cpp_re.inc"
+yy710:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'o') goto yy192;
+        if(yych != 'o') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 62;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy713:
-#line 78 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy716:
+#line 80 "cpp.re"
         { BOOST_WAVE_RET(T_OPERATOR); }
-#line 5115 "cpp_re.inc"
-yy714:
+#line 5130 "cpp_re.inc"
+yy717:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'm') goto yy725;
-        goto yy192;
-yy715:
+        if(yych == 'm') goto yy728;
+        goto yy195;
+yy718:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'w') goto yy723;
-        goto yy192;
-yy716:
+        if(yych == 'w') goto yy726;
+        goto yy195;
+yy719:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 63;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= '@') {
             if(yych <= '/') {
-                if(yych == '$') goto yy191;
+                if(yych == '$') goto yy194;
             } else {
-                if(yych <= '9') goto yy191;
-                if(yych == '?') goto yy194;
+                if(yych <= '9') goto yy194;
+                if(yych == '?') goto yy197;
             }
         } else {
             if(yych <= '^') {
-                if(yych <= 'Z') goto yy191;
-                if(yych == '\\') goto yy193;
+                if(yych <= 'Z') goto yy194;
+                if(yych == '\\') goto yy196;
             } else {
-                if(yych <= '_') goto yy719;
-                if(yych <= '`') goto yy718;
-                if(yych <= 'z') goto yy191;
+                if(yych <= '_') goto yy722;
+                if(yych <= '`') goto yy721;
+                if(yych <= 'z') goto yy194;
             }
         }
-yy718:
-#line 189 "cpp.re"
+yy721:
+#line 191 "cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_NOT_ALT); }
-#line 5152 "cpp_re.inc"
-yy719:
+#line 5167 "cpp_re.inc"
+yy722:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'q') goto yy192;
+        if(yych != 'q') goto yy195;
         yyaccept = 64;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy722:
-#line 212 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy725:
+#line 214 "cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_NOTEQUAL_ALT); }
-#line 5170 "cpp_re.inc"
-yy723:
+#line 5185 "cpp_re.inc"
+yy726:
         yyaccept = 65;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy724:
-#line 77 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy727:
+#line 79 "cpp.re"
         { BOOST_WAVE_RET(T_NEW); }
-#line 5182 "cpp_re.inc"
-yy725:
+#line 5197 "cpp_re.inc"
+yy728:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'p') goto yy192;
+        if(yych != 'p') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 66;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy732:
-#line 76 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy735:
+#line 78 "cpp.re"
         { BOOST_WAVE_RET(T_NAMESPACE); }
-#line 5212 "cpp_re.inc"
-yy733:
+#line 5227 "cpp_re.inc"
+yy736:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'b') goto yy192;
+        if(yych != 'b') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 67;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy739:
-#line 75 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy742:
+#line 77 "cpp.re"
         { BOOST_WAVE_RET(T_MUTABLE); }
-#line 5239 "cpp_re.inc"
-yy740:
+#line 5254 "cpp_re.inc"
+yy743:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'g') goto yy192;
+        if(yych != 'g') goto yy195;
         yyaccept = 68;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy743:
-#line 74 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy746:
+#line 76 "cpp.re"
         { BOOST_WAVE_RET(T_LONG); }
-#line 5257 "cpp_re.inc"
-yy744:
+#line 5272 "cpp_re.inc"
+yy747:
         yyaccept = 69;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy745:
-#line 71 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy748:
+#line 73 "cpp.re"
         { BOOST_WAVE_RET(T_IF); }
-#line 5269 "cpp_re.inc"
-yy746:
+#line 5284 "cpp_re.inc"
+yy749:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'l') goto yy747;
-        if(yych == 't') goto yy748;
-        goto yy192;
-yy747:
+        if(yych == 'l') goto yy750;
+        if(yych == 't') goto yy751;
+        goto yy195;
+yy750:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy750;
-        goto yy192;
-yy748:
+        if(yych == 'i') goto yy753;
+        goto yy195;
+yy751:
         yyaccept = 70;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy749:
-#line 73 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy752:
+#line 75 "cpp.re"
         { BOOST_WAVE_RET(T_INT); }
-#line 5292 "cpp_re.inc"
-yy750:
+#line 5307 "cpp_re.inc"
+yy753:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 71;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy753:
-#line 72 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy756:
+#line 74 "cpp.re"
         { BOOST_WAVE_RET(T_INLINE); }
-#line 5310 "cpp_re.inc"
-yy754:
+#line 5325 "cpp_re.inc"
+yy757:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'o') goto yy192;
+        if(yych != 'o') goto yy195;
         yyaccept = 72;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy757:
-#line 70 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy760:
+#line 72 "cpp.re"
         { BOOST_WAVE_RET(T_GOTO); }
-#line 5328 "cpp_re.inc"
-yy758:
+#line 5343 "cpp_re.inc"
+yy761:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'l') goto yy773;
-        goto yy192;
-yy759:
+        if(yych == 'l') goto yy776;
+        goto yy195;
+yy762:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'o') goto yy769;
-        goto yy192;
-yy760:
+        if(yych == 'o') goto yy772;
+        goto yy195;
+yy763:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'r') goto yy767;
-        goto yy192;
-yy761:
+        if(yych == 'r') goto yy770;
+        goto yy195;
+yy764:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'd') goto yy192;
+        if(yych != 'd') goto yy195;
         yyaccept = 73;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy766:
-#line 69 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy769:
+#line 71 "cpp.re"
         { BOOST_WAVE_RET(T_FRIEND); }
-#line 5367 "cpp_re.inc"
-yy767:
+#line 5382 "cpp_re.inc"
+yy770:
         yyaccept = 74;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy768:
-#line 68 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy771:
+#line 70 "cpp.re"
         { BOOST_WAVE_RET(T_FOR); }
-#line 5379 "cpp_re.inc"
-yy769:
+#line 5394 "cpp_re.inc"
+yy772:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 75;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy772:
-#line 67 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy775:
+#line 69 "cpp.re"
         { BOOST_WAVE_RET(T_FLOAT); }
-#line 5397 "cpp_re.inc"
-yy773:
+#line 5412 "cpp_re.inc"
+yy776:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 76;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy776:
-#line 66 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy779:
+#line 68 "cpp.re"
         { BOOST_WAVE_RET(T_FALSE); }
-#line 5415 "cpp_re.inc"
-yy777:
+#line 5430 "cpp_re.inc"
+yy780:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 's') goto yy799;
-        goto yy192;
-yy778:
+        if(yych == 's') goto yy802;
+        goto yy195;
+yy781:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'u') goto yy796;
-        goto yy192;
-yy779:
+        if(yych == 'u') goto yy799;
+        goto yy195;
+yy782:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'p') goto yy780;
-        if(yych == 't') goto yy781;
-        goto yy192;
-yy780:
+        if(yych == 'p') goto yy783;
+        if(yych == 't') goto yy784;
+        goto yy195;
+yy783:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'l') goto yy786;
-        if(yych == 'o') goto yy787;
-        goto yy192;
-yy781:
+        if(yych == 'l') goto yy789;
+        if(yych == 'o') goto yy790;
+        goto yy195;
+yy784:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 77;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy785:
-#line 65 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy788:
+#line 67 "cpp.re"
         { BOOST_WAVE_RET(T_EXTERN); }
-#line 5458 "cpp_re.inc"
-yy786:
+#line 5473 "cpp_re.inc"
+yy789:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy791;
-        goto yy192;
-yy787:
+        if(yych == 'i') goto yy794;
+        goto yy195;
+yy790:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 78;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy790:
-#line 64 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy793:
+#line 66 "cpp.re"
         { BOOST_WAVE_RET(T_EXPORT); }
-#line 5481 "cpp_re.inc"
-yy791:
+#line 5496 "cpp_re.inc"
+yy794:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 79;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy795:
-#line 63 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy798:
+#line 65 "cpp.re"
         { BOOST_WAVE_RET(T_EXPLICIT); }
-#line 5502 "cpp_re.inc"
-yy796:
+#line 5517 "cpp_re.inc"
+yy799:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'm') goto yy192;
+        if(yych != 'm') goto yy195;
         yyaccept = 80;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy798:
-#line 62 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy801:
+#line 64 "cpp.re"
         { BOOST_WAVE_RET(T_ENUM); }
-#line 5517 "cpp_re.inc"
-yy799:
+#line 5532 "cpp_re.inc"
+yy802:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 81;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy801:
-#line 61 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy804:
+#line 63 "cpp.re"
         { BOOST_WAVE_RET(T_ELSE); }
-#line 5532 "cpp_re.inc"
-yy802:
+#line 5547 "cpp_re.inc"
+yy805:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'f') goto yy822;
-        if(yych == 'l') goto yy823;
-        goto yy192;
-yy803:
+        if(yych == 'f') goto yy825;
+        if(yych == 'l') goto yy826;
+        goto yy195;
+yy806:
         yyaccept = 82;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= 'Z') {
             if(yych <= '9') {
-                if(yych == '$') goto yy191;
-                if(yych >= '0') goto yy191;
+                if(yych == '$') goto yy194;
+                if(yych >= '0') goto yy194;
             } else {
-                if(yych == '?') goto yy194;
-                if(yych >= 'A') goto yy191;
+                if(yych == '?') goto yy197;
+                if(yych >= 'A') goto yy194;
             }
         } else {
             if(yych <= '_') {
-                if(yych == '\\') goto yy193;
-                if(yych >= '_') goto yy191;
+                if(yych == '\\') goto yy196;
+                if(yych >= '_') goto yy194;
             } else {
                 if(yych <= 't') {
-                    if(yych >= 'a') goto yy191;
+                    if(yych >= 'a') goto yy194;
                 } else {
-                    if(yych <= 'u') goto yy817;
-                    if(yych <= 'z') goto yy191;
+                    if(yych <= 'u') goto yy820;
+                    if(yych <= 'z') goto yy194;
                 }
             }
         }
-yy804:
-#line 58 "cpp.re"
+yy807:
+#line 60 "cpp.re"
         { BOOST_WAVE_RET(T_DO); }
-#line 5566 "cpp_re.inc"
-yy805:
+#line 5581 "cpp_re.inc"
+yy808:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'm') goto yy192;
+        if(yych != 'm') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != '_') goto yy192;
+        if(yych != '_') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 83;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy816:
-#line 60 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy819:
+#line 62 "cpp.re"
         { BOOST_WAVE_RET(T_DYNAMICCAST); }
-#line 5608 "cpp_re.inc"
-yy817:
+#line 5623 "cpp_re.inc"
+yy820:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'b') goto yy192;
+        if(yych != 'b') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 84;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy821:
-#line 59 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy824:
+#line 61 "cpp.re"
         { BOOST_WAVE_RET(T_DOUBLE); }
-#line 5629 "cpp_re.inc"
-yy822:
+#line 5644 "cpp_re.inc"
+yy825:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy828;
-        goto yy192;
-yy823:
+        if(yych == 'a') goto yy831;
+        goto yy195;
+yy826:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 85;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy827:
-#line 57 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy830:
+#line 59 "cpp.re"
         { BOOST_WAVE_RET(T_DELETE); }
-#line 5655 "cpp_re.inc"
-yy828:
+#line 5670 "cpp_re.inc"
+yy831:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'u') goto yy192;
+        if(yych != 'u') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 86;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy832:
-#line 56 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy835:
+#line 58 "cpp.re"
         { BOOST_WAVE_RET(T_DEFAULT); }
-#line 5676 "cpp_re.inc"
-yy833:
+#line 5691 "cpp_re.inc"
+yy836:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'r') goto yy192;
-        if(yych <= 's') goto yy864;
-        if(yych <= 't') goto yy865;
-        goto yy192;
-yy834:
+        if(yych <= 'r') goto yy195;
+        if(yych <= 's') goto yy867;
+        if(yych <= 't') goto yy868;
+        goto yy195;
+yy837:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy861;
-        goto yy192;
-yy835:
+        if(yych == 'a') goto yy864;
+        goto yy195;
+yy838:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy857;
-        goto yy192;
-yy836:
+        if(yych == 'a') goto yy860;
+        goto yy195;
+yy839:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'l') goto yy192;
-        if(yych <= 'm') goto yy838;
-        if(yych >= 'o') goto yy192;
+        if(yych <= 'l') goto yy195;
+        if(yych <= 'm') goto yy841;
+        if(yych >= 'o') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'r') goto yy192;
-        if(yych <= 's') goto yy842;
-        if(yych <= 't') goto yy843;
-        goto yy192;
-yy838:
+        if(yych <= 'r') goto yy195;
+        if(yych <= 's') goto yy845;
+        if(yych <= 't') goto yy846;
+        goto yy195;
+yy841:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'p') goto yy192;
+        if(yych != 'p') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 87;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy841:
-#line 187 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy844:
+#line 189 "cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_COMPL_ALT); }
-#line 5723 "cpp_re.inc"
-yy842:
+#line 5738 "cpp_re.inc"
+yy845:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 't') goto yy849;
-        goto yy192;
-yy843:
+        if(yych == 't') goto yy852;
+        goto yy195;
+yy846:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'u') goto yy192;
+        if(yych != 'u') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 88;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy848:
-#line 55 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy851:
+#line 57 "cpp.re"
         { BOOST_WAVE_RET(T_CONTINUE); }
-#line 5752 "cpp_re.inc"
-yy849:
+#line 5767 "cpp_re.inc"
+yy852:
         yyaccept = 89;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= '@') {
             if(yych <= '/') {
-                if(yych == '$') goto yy191;
+                if(yych == '$') goto yy194;
             } else {
-                if(yych <= '9') goto yy191;
-                if(yych == '?') goto yy194;
+                if(yych <= '9') goto yy194;
+                if(yych == '?') goto yy197;
             }
         } else {
             if(yych <= '^') {
-                if(yych <= 'Z') goto yy191;
-                if(yych == '\\') goto yy193;
+                if(yych <= 'Z') goto yy194;
+                if(yych == '\\') goto yy196;
             } else {
-                if(yych <= '_') goto yy851;
-                if(yych <= '`') goto yy850;
-                if(yych <= 'z') goto yy191;
+                if(yych <= '_') goto yy854;
+                if(yych <= '`') goto yy853;
+                if(yych <= 'z') goto yy194;
             }
         }
-yy850:
-#line 53 "cpp.re"
+yy853:
+#line 55 "cpp.re"
         { BOOST_WAVE_RET(T_CONST); }
-#line 5776 "cpp_re.inc"
-yy851:
+#line 5791 "cpp_re.inc"
+yy854:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 90;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy856:
-#line 54 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy859:
+#line 56 "cpp.re"
         { BOOST_WAVE_RET(T_CONSTCAST); }
-#line 5800 "cpp_re.inc"
-yy857:
+#line 5815 "cpp_re.inc"
+yy860:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 91;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy860:
-#line 52 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy863:
+#line 54 "cpp.re"
         { BOOST_WAVE_RET(T_CLASS); }
-#line 5818 "cpp_re.inc"
-yy861:
+#line 5833 "cpp_re.inc"
+yy864:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 92;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy863:
-#line 51 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy866:
+#line 53 "cpp.re"
         { BOOST_WAVE_RET(T_CHAR); }
-#line 5833 "cpp_re.inc"
-yy864:
+#line 5848 "cpp_re.inc"
+yy867:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'e') goto yy869;
-        goto yy192;
-yy865:
+        if(yych == 'e') goto yy872;
+        goto yy195;
+yy868:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'h') goto yy192;
+        if(yych != 'h') goto yy195;
         yyaccept = 93;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy868:
-#line 50 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy871:
+#line 52 "cpp.re"
         { BOOST_WAVE_RET(T_CATCH); }
-#line 5856 "cpp_re.inc"
-yy869:
+#line 5871 "cpp_re.inc"
+yy872:
         yyaccept = 94;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy870:
-#line 49 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy873:
+#line 51 "cpp.re"
         { BOOST_WAVE_RET(T_CASE); }
-#line 5868 "cpp_re.inc"
-yy871:
+#line 5883 "cpp_re.inc"
+yy874:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 't') goto yy881;
-        goto yy192;
-yy872:
+        if(yych == 't') goto yy884;
+        goto yy195;
+yy875:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'o') goto yy878;
-        goto yy192;
-yy873:
+        if(yych == 'o') goto yy881;
+        goto yy195;
+yy876:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'k') goto yy192;
+        if(yych != 'k') goto yy195;
         yyaccept = 95;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy877:
-#line 48 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy880:
+#line 50 "cpp.re"
         { BOOST_WAVE_RET(T_BREAK); }
-#line 5899 "cpp_re.inc"
-yy878:
+#line 5914 "cpp_re.inc"
+yy881:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 96;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy880:
-#line 47 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy883:
+#line 49 "cpp.re"
         { BOOST_WAVE_RET(T_BOOL); }
-#line 5914 "cpp_re.inc"
-yy881:
+#line 5929 "cpp_re.inc"
+yy884:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy882;
-        if(yych == 'o') goto yy883;
-        goto yy192;
-yy882:
+        if(yych == 'a') goto yy885;
+        if(yych == 'o') goto yy886;
+        goto yy195;
+yy885:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'n') goto yy886;
-        goto yy192;
-yy883:
+        if(yych == 'n') goto yy889;
+        goto yy195;
+yy886:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 97;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy885:
-#line 183 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy888:
+#line 185 "cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_OR_ALT); }
-#line 5940 "cpp_re.inc"
-yy886:
+#line 5955 "cpp_re.inc"
+yy889:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'd') goto yy192;
+        if(yych != 'd') goto yy195;
         yyaccept = 98;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy888:
-#line 181 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy891:
+#line 183 "cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_AND_ALT); }
-#line 5955 "cpp_re.inc"
-yy889:
+#line 5970 "cpp_re.inc"
+yy892:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'd') goto yy897;
-        goto yy192;
-yy890:
+        if(yych == 'd') goto yy900;
+        goto yy195;
+yy893:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'm') goto yy895;
-        goto yy192;
-yy891:
+        if(yych == 'm') goto yy898;
+        goto yy195;
+yy894:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'o') goto yy192;
+        if(yych != 'o') goto yy195;
         yyaccept = 99;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy894:
-#line 46 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy897:
+#line 48 "cpp.re"
         { BOOST_WAVE_RET(T_AUTO); }
-#line 5983 "cpp_re.inc"
-yy895:
+#line 5998 "cpp_re.inc"
+yy898:
         yyaccept = 100;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy896:
-#line 45 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy899:
+#line 47 "cpp.re"
         { BOOST_WAVE_RET(T_ASM); }
-#line 5995 "cpp_re.inc"
-yy897:
+#line 6010 "cpp_re.inc"
+yy900:
         yyaccept = 101;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= '@') {
             if(yych <= '/') {
-                if(yych == '$') goto yy191;
+                if(yych == '$') goto yy194;
             } else {
-                if(yych <= '9') goto yy191;
-                if(yych == '?') goto yy194;
+                if(yych <= '9') goto yy194;
+                if(yych == '?') goto yy197;
             }
         } else {
             if(yych <= '^') {
-                if(yych <= 'Z') goto yy191;
-                if(yych == '\\') goto yy193;
+                if(yych <= 'Z') goto yy194;
+                if(yych == '\\') goto yy196;
             } else {
-                if(yych <= '_') goto yy899;
-                if(yych <= '`') goto yy898;
-                if(yych <= 'z') goto yy191;
+                if(yych <= '_') goto yy902;
+                if(yych <= '`') goto yy901;
+                if(yych <= 'z') goto yy194;
             }
         }
-yy898:
-#line 216 "cpp.re"
+yy901:
+#line 218 "cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_ANDAND_ALT); }
-#line 6019 "cpp_re.inc"
-yy899:
+#line 6034 "cpp_re.inc"
+yy902:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'q') goto yy192;
+        if(yych != 'q') goto yy195;
         yyaccept = 102;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy902:
-#line 202 "cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy905:
+#line 204 "cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_ANDASSIGN_ALT); }
-#line 6037 "cpp_re.inc"
-yy903:
+#line 6052 "cpp_re.inc"
+yy906:
         ++YYCURSOR;
-#line 163 "cpp.re"
+#line 165 "cpp.re"
         { 
             if (s->act_in_c99_mode) {
                 --YYCURSOR;
@@ -6046,73 +6061,73 @@
                 BOOST_WAVE_RET(T_DOTSTAR); 
             }
         }
-#line 6050 "cpp_re.inc"
-yy905:
+#line 6065 "cpp_re.inc"
+yy908:
         yych = *++YYCURSOR;
-        if(yych == '.') goto yy907;
-        goto yy2;
-yy906:
+        if(yych == '.') goto yy910;
+        goto yy98;
+yy909:
         yych = *++YYCURSOR;
-        goto yy8;
-yy907:
+        goto yy7;
+yy910:
         ++YYCURSOR;
-#line 149 "cpp.re"
+#line 151 "cpp.re"
         { BOOST_WAVE_RET(T_ELLIPSIS); }
-#line 6062 "cpp_re.inc"
-yy909:
+#line 6077 "cpp_re.inc"
+yy912:
         ++YYCURSOR;
-#line 196 "cpp.re"
+#line 198 "cpp.re"
         { BOOST_WAVE_RET(T_DIVIDEASSIGN); }
-#line 6067 "cpp_re.inc"
-yy911:
+#line 6082 "cpp_re.inc"
+yy914:
         ++YYCURSOR;
-#line 42 "cpp.re"
+#line 44 "cpp.re"
         { goto cppcomment; }
-#line 6072 "cpp_re.inc"
-yy913:
+#line 6087 "cpp_re.inc"
+yy916:
         ++YYCURSOR;
-#line 41 "cpp.re"
+#line 43 "cpp.re"
         { goto ccomment; }
-#line 6077 "cpp_re.inc"
+#line 6092 "cpp_re.inc"
     }
 }
-#line 307 "cpp.re"
+#line 306 "cpp.re"
 
 
 ccomment:
 {
 
-#line 6086 "cpp_re.inc"
+#line 6101 "cpp_re.inc"
     {
         YYCTYPE yych;
         if((YYLIMIT - YYCURSOR) < 2) YYFILL(2);
         yych = *YYCURSOR;
         if(yych <= 0x0C) {
             if(yych <= 0x08) {
-                if(yych <= 0x00) goto yy924;
+                if(yych <= 0x00) goto yy927;
+                goto yy929;
             } else {
-                if(yych == 0x0A) goto yy920;
-                goto yy923;
+                if(yych == 0x0A) goto yy922;
+                goto yy925;
             }
         } else {
             if(yych <= 0x1F) {
-                if(yych <= 0x0D) goto yy922;
+                if(yych <= 0x0D) goto yy924;
+                goto yy929;
             } else {
-                if(yych == '*') goto yy918;
-                goto yy923;
+                if(yych != '*') goto yy926;
             }
         }
-yy918:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) == '/') goto yy927;
-yy919:
-#line 322 "cpp.re"
+        if((yych = *YYCURSOR) == '/') goto yy932;
+yy921:
+#line 321 "cpp.re"
         { goto ccomment; }
-#line 6112 "cpp_re.inc"
-yy920:
+#line 6127 "cpp_re.inc"
+yy922:
         ++YYCURSOR;
-yy921:
-#line 314 "cpp.re"
+yy923:
+#line 313 "cpp.re"
         {
         /*if(cursor == s->eof) BOOST_WAVE_RET(T_EOF);*/
         /*s->tok = cursor; */
@@ -6120,75 +6135,78 @@
         cursor.column = 1;
         goto ccomment;
     }
-#line 6124 "cpp_re.inc"
-yy922:
+#line 6139 "cpp_re.inc"
+yy924:
         yych = *++YYCURSOR;
-        if(yych == 0x0A) goto yy926;
+        if(yych == 0x0A) goto yy931;
+        goto yy923;
+yy925:
+        yych = *++YYCURSOR;
         goto yy921;
-yy923:
+yy926:
         yych = *++YYCURSOR;
-        goto yy919;
-yy924:
+        goto yy921;
+yy927:
         ++YYCURSOR;
-#line 325 "cpp.re"
+#line 324 "cpp.re"
         {
-        using namespace std;      // some systems have printf in std
         if(cursor == s->eof) 
         {
-            if (s->error_proc)
-                (*s->error_proc)(s, "Unterminated comment");
-            else
-                printf("Error: Unterminated comment\n");
+            BOOST_WAVE_UPDATE_CURSOR();   // adjust the input cursor
+            (*s->error_proc)(s, "Unterminated 'C' style comment");
         }
         else
         {
-            if (s->error_proc)
-                (*s->error_proc)(s, "'\\000' in input stream");
-            else
-                printf("Error: 0 in file");
+            --YYCURSOR;                   // next call returns T_EOF
+            BOOST_WAVE_UPDATE_CURSOR();   // adjust the input cursor
+            (*s->error_proc)(s, "invalid character: '\\000' in input stream");
         }
-        /* adjust cursor such next call returns T_EOF */
-        --YYCURSOR;
-        /* the comment is unterminated, but nevertheless its a comment */
-        BOOST_WAVE_RET(T_CCOMMENT);
     }
-#line 6156 "cpp_re.inc"
-yy926:
+#line 6166 "cpp_re.inc"
+yy929:
+        ++YYCURSOR;
+#line 339 "cpp.re"
+        {
+        // flag the error
+        BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+        (*s->error_proc)(s, "invalid character '\\%03o' in input stream",
+            *--YYCURSOR);
+    }
+#line 6176 "cpp_re.inc"
+yy931:
         yych = *++YYCURSOR;
-        goto yy921;
-yy927:
+        goto yy923;
+yy932:
         ++YYCURSOR;
-#line 311 "cpp.re"
+#line 310 "cpp.re"
         { BOOST_WAVE_RET(T_CCOMMENT); }
-#line 6164 "cpp_re.inc"
+#line 6184 "cpp_re.inc"
     }
 }
-#line 347 "cpp.re"
+#line 345 "cpp.re"
 
 
 cppcomment:
 {
 
-#line 6173 "cpp_re.inc"
+#line 6193 "cpp_re.inc"
     {
         YYCTYPE yych;
         if((YYLIMIT - YYCURSOR) < 2) YYFILL(2);
         yych = *YYCURSOR;
         if(yych <= 0x0A) {
-            if(yych <= 0x00) goto yy937;
-            if(yych <= 0x08) goto yy931;
-            if(yych <= 0x09) goto yy935;
-            goto yy932;
+            if(yych <= 0x00) goto yy942;
+            if(yych <= 0x08) goto yy944;
+            if(yych <= 0x09) goto yy939;
         } else {
-            if(yych <= 0x0C) goto yy935;
-            if(yych <= 0x0D) goto yy934;
-            if(yych >= ' ') goto yy935;
+            if(yych <= 0x0C) goto yy939;
+            if(yych <= 0x0D) goto yy938;
+            if(yych <= 0x1F) goto yy944;
+            goto yy941;
         }
-yy931:
-yy932:
         ++YYCURSOR;
-yy933:
-#line 352 "cpp.re"
+yy937:
+#line 350 "cpp.re"
         {
         /*if(cursor == s->eof) BOOST_WAVE_RET(T_EOF); */
         /*s->tok = cursor; */
@@ -6196,41 +6214,57 @@
         cursor.column = 1;
         BOOST_WAVE_RET(T_CPPCOMMENT);
     }
-#line 6200 "cpp_re.inc"
-yy934:
+#line 6218 "cpp_re.inc"
+yy938:
         yych = *++YYCURSOR;
-        if(yych == 0x0A) goto yy939;
-        goto yy933;
-yy935:
+        if(yych == 0x0A) goto yy946;
+        goto yy937;
+yy939:
         ++YYCURSOR;
-#line 360 "cpp.re"
+yy940:
+#line 358 "cpp.re"
         { goto cppcomment; }
-#line 6209 "cpp_re.inc"
-yy937:
+#line 6228 "cpp_re.inc"
+yy941:
+        yych = *++YYCURSOR;
+        goto yy940;
+yy942:
         ++YYCURSOR;
-#line 363 "cpp.re"
+#line 361 "cpp.re"
         {
-        using namespace std;      // some systems have printf in std
-        if(cursor != s->eof) 
+        if (cursor != s->eof) 
         {
-            if (s->error_proc)
-                (*s->error_proc)(s, "'\\000' in input stream");
-            else
-                printf("Error: 0 in file");
+            --YYCURSOR;                     // next call returns T_EOF
+            BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+            (*s->error_proc)(s, "invalid character '\\000' in input stream");
         }
-        /* adjust cursor such next call returns T_EOF */
-        --YYCURSOR;
-        /* the comment is unterminated, but nevertheless its a comment */
+        
+        --YYCURSOR;                         // next call returns T_EOF
+        if (!s->single_line_only)
+        {
+            BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+            (*s->error_proc)(s, "Unterminated 'C++' style comment");
+        }
         BOOST_WAVE_RET(T_CPPCOMMENT);
     }
-#line 6227 "cpp_re.inc"
-yy939:
+#line 6251 "cpp_re.inc"
+yy944:
         ++YYCURSOR;
+#line 379 "cpp.re"
+        {
+        // flag the error
+        BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+        (*s->error_proc)(s, "invalid character '\\%03o' in input stream",
+            *--YYCURSOR);
+    }
+#line 6261 "cpp_re.inc"
+yy946:
+        ++YYCURSOR;
         yych = *YYCURSOR;
-        goto yy933;
+        goto yy937;
     }
 }
-#line 377 "cpp.re"
+#line 385 "cpp.re"
 
 
 /* this subscanner is called whenever a pp_number has been started */
@@ -6277,254 +6311,254 @@
           0,   0,   0,   0,   0,   0,   0,   0, 
     };
 
-#line 6281 "cpp_re.inc"
+#line 6315 "cpp_re.inc"
     {
         YYCTYPE yych;
         if((YYLIMIT - YYCURSOR) < 2) YYFILL(2);
         yych = *YYCURSOR;
-        if(yych == '.') goto yy943;
-        if(yych <= '/') goto yy942;
-        if(yych <= '9') goto yy944;
-yy942:
+        if(yych == '.') goto yy950;
+        if(yych <= '/') goto yy949;
+        if(yych <= '9') goto yy951;
+yy949:
         YYCURSOR = YYMARKER;
-        goto yy946;
-yy943:
+        goto yy953;
+yy950:
         yych = *++YYCURSOR;
-        if(yych <= '/') goto yy942;
-        if(yych >= ':') goto yy942;
-yy944:
+        if(yych <= '/') goto yy949;
+        if(yych >= ':') goto yy949;
+yy951:
         YYMARKER = ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 64) {
-            goto yy944;
+            goto yy951;
         }
         if(yych <= 'Z') {
-            if(yych == '?') goto yy950;
-            if(yych >= 'A') goto yy947;
+            if(yych == '?') goto yy957;
+            if(yych >= 'A') goto yy954;
         } else {
             if(yych <= '\\') {
-                if(yych >= '\\') goto yy949;
+                if(yych >= '\\') goto yy956;
             } else {
-                if(yych == 'e') goto yy947;
+                if(yych == 'e') goto yy954;
             }
         }
-yy946:
-#line 389 "cpp.re"
+yy953:
+#line 397 "cpp.re"
         { BOOST_WAVE_RET(T_PP_NUMBER); }
-#line 6316 "cpp_re.inc"
-yy947:
+#line 6350 "cpp_re.inc"
+yy954:
         YYMARKER = ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 128) {
-            goto yy947;
+            goto yy954;
         }
         if(yych <= '>') {
             if(yych <= '+') {
-                if(yych == '$') goto yy944;
-                if(yych <= '*') goto yy946;
-                goto yy944;
+                if(yych == '$') goto yy951;
+                if(yych <= '*') goto yy953;
+                goto yy951;
             } else {
                 if(yych <= '.') {
-                    if(yych <= ',') goto yy946;
-                    goto yy944;
+                    if(yych <= ',') goto yy953;
+                    goto yy951;
                 } else {
-                    if(yych <= '/') goto yy946;
-                    if(yych <= '9') goto yy944;
-                    goto yy946;
+                    if(yych <= '/') goto yy953;
+                    if(yych <= '9') goto yy951;
+                    goto yy953;
                 }
             }
         } else {
             if(yych <= '\\') {
                 if(yych <= '@') {
-                    if(yych <= '?') goto yy950;
-                    goto yy946;
+                    if(yych <= '?') goto yy957;
+                    goto yy953;
                 } else {
-                    if(yych <= 'Z') goto yy944;
-                    if(yych <= '[') goto yy946;
+                    if(yych <= 'Z') goto yy951;
+                    if(yych <= '[') goto yy953;
                 }
             } else {
                 if(yych <= '_') {
-                    if(yych <= '^') goto yy946;
-                    goto yy944;
+                    if(yych <= '^') goto yy953;
+                    goto yy951;
                 } else {
-                    if(yych <= '`') goto yy946;
-                    if(yych <= 'z') goto yy944;
-                    goto yy946;
+                    if(yych <= '`') goto yy953;
+                    if(yych <= 'z') goto yy951;
+                    goto yy953;
                 }
             }
         }
-yy949:
+yy956:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych == 'U') goto yy953;
-        if(yych == 'u') goto yy952;
-        goto yy942;
-yy950:
+        if(yych == 'U') goto yy960;
+        if(yych == 'u') goto yy959;
+        goto yy949;
+yy957:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych != '?') goto yy942;
+        if(yych != '?') goto yy949;
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych == '/') goto yy949;
-        goto yy942;
-yy952:
+        if(yych == '/') goto yy956;
+        goto yy949;
+yy959:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych <= '9') goto yy961;
-            goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych <= '9') goto yy968;
+            goto yy949;
         } else {
-            if(yych <= 'F') goto yy961;
-            if(yych <= '`') goto yy942;
-            if(yych <= 'f') goto yy961;
-            goto yy942;
+            if(yych <= 'F') goto yy968;
+            if(yych <= '`') goto yy949;
+            if(yych <= 'f') goto yy968;
+            goto yy949;
         }
-yy953:
+yy960:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy954;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy961;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy954:
+yy961:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy955;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy962;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy955:
+yy962:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy956;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy963;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy956:
+yy963:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy957;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy964;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy957:
+yy964:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy958;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy965;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy958:
+yy965:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy959;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy966;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy959:
+yy966:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy960;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy967;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy960:
+yy967:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych <= '9') goto yy944;
-            goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych <= '9') goto yy951;
+            goto yy949;
         } else {
-            if(yych <= 'F') goto yy944;
-            if(yych <= '`') goto yy942;
-            if(yych <= 'f') goto yy944;
-            goto yy942;
+            if(yych <= 'F') goto yy951;
+            if(yych <= '`') goto yy949;
+            if(yych <= 'f') goto yy951;
+            goto yy949;
         }
-yy961:
+yy968:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy962;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy969;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy962:
+yy969:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy963;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy970;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy963:
+yy970:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych <= '9') goto yy944;
-            goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych <= '9') goto yy951;
+            goto yy949;
         } else {
-            if(yych <= 'F') goto yy944;
-            if(yych <= '`') goto yy942;
-            if(yych <= 'f') goto yy944;
-            goto yy942;
+            if(yych <= 'F') goto yy951;
+            if(yych <= '`') goto yy949;
+            if(yych <= 'f') goto yy951;
+            goto yy949;
         }
     }
 }
-#line 390 "cpp.re"
+#line 398 "cpp.re"
 
     }
     else {
@@ -6564,236 +6598,236 @@
           0,   0,   0,   0,   0,   0,   0,   0, 
     };
 
-#line 6568 "cpp_re.inc"
+#line 6602 "cpp_re.inc"
     {
         YYCTYPE yych;
         unsigned int yyaccept = 0;
         if((YYLIMIT - YYCURSOR) < 4) YYFILL(4);
         yych = *YYCURSOR;
         if(yych <= '/') {
-            if(yych == '.') goto yy971;
+            if(yych == '.') goto yy978;
         } else {
-            if(yych <= '0') goto yy967;
-            if(yych <= '9') goto yy969;
+            if(yych <= '0') goto yy974;
+            if(yych <= '9') goto yy976;
         }
-yy966:
+yy973:
         YYCURSOR = YYMARKER;
         if(yyaccept <= 0) {
-            goto yy968;
+            goto yy975;
         } else {
-            goto yy974;
+            goto yy981;
         }
-yy967:
+yy974:
         yyaccept = 0;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yybm[0+yych] & 64) {
-            goto yy986;
+            goto yy993;
         }
         if(yych <= 'E') {
             if(yych <= '/') {
-                if(yych == '.') goto yy972;
+                if(yych == '.') goto yy979;
             } else {
-                if(yych <= '9') goto yy989;
-                if(yych >= 'E') goto yy982;
+                if(yych <= '9') goto yy996;
+                if(yych >= 'E') goto yy989;
             }
         } else {
             if(yych <= 'd') {
-                if(yych == 'X') goto yy988;
+                if(yych == 'X') goto yy995;
             } else {
-                if(yych <= 'e') goto yy982;
-                if(yych == 'x') goto yy988;
+                if(yych <= 'e') goto yy989;
+                if(yych == 'x') goto yy995;
             }
         }
-yy968:
-#line 397 "cpp.re"
+yy975:
+#line 405 "cpp.re"
         { goto integer_suffix; }
-#line 6611 "cpp_re.inc"
-yy969:
+#line 6645 "cpp_re.inc"
+yy976:
         yyaccept = 0;
         YYMARKER = ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 3) YYFILL(3);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 32) {
-            goto yy969;
+            goto yy976;
         }
         if(yych <= 'D') {
-            if(yych == '.') goto yy972;
-            goto yy968;
+            if(yych == '.') goto yy979;
+            goto yy975;
         } else {
-            if(yych <= 'E') goto yy982;
-            if(yych == 'e') goto yy982;
-            goto yy968;
+            if(yych <= 'E') goto yy989;
+            if(yych == 'e') goto yy989;
+            goto yy975;
         }
-yy971:
+yy978:
         yych = *++YYCURSOR;
-        if(yych <= '/') goto yy966;
-        if(yych >= ':') goto yy966;
-yy972:
+        if(yych <= '/') goto yy973;
+        if(yych >= ':') goto yy973;
+yy979:
         yyaccept = 1;
         YYMARKER = ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 3) YYFILL(3);
         yych = *YYCURSOR;
         if(yych <= 'K') {
             if(yych <= 'D') {
-                if(yych <= '/') goto yy974;
-                if(yych <= '9') goto yy972;
+                if(yych <= '/') goto yy981;
+                if(yych <= '9') goto yy979;
             } else {
-                if(yych <= 'E') goto yy975;
-                if(yych <= 'F') goto yy976;
+                if(yych <= 'E') goto yy982;
+                if(yych <= 'F') goto yy983;
             }
         } else {
             if(yych <= 'e') {
-                if(yych <= 'L') goto yy977;
-                if(yych >= 'e') goto yy975;
+                if(yych <= 'L') goto yy984;
+                if(yych >= 'e') goto yy982;
             } else {
-                if(yych <= 'f') goto yy976;
-                if(yych == 'l') goto yy977;
+                if(yych <= 'f') goto yy983;
+                if(yych == 'l') goto yy984;
             }
         }
-yy974:
-#line 395 "cpp.re"
+yy981:
+#line 403 "cpp.re"
         { BOOST_WAVE_RET(T_FLOATLIT); }
-#line 6657 "cpp_re.inc"
-yy975:
+#line 6691 "cpp_re.inc"
+yy982:
         yych = *++YYCURSOR;
         if(yych <= ',') {
-            if(yych == '+') goto yy979;
-            goto yy966;
+            if(yych == '+') goto yy986;
+            goto yy973;
         } else {
-            if(yych <= '-') goto yy979;
-            if(yych <= '/') goto yy966;
-            if(yych <= '9') goto yy980;
-            goto yy966;
+            if(yych <= '-') goto yy986;
+            if(yych <= '/') goto yy973;
+            if(yych <= '9') goto yy987;
+            goto yy973;
         }
-yy976:
+yy983:
         yych = *++YYCURSOR;
-        if(yych == 'L') goto yy978;
-        if(yych == 'l') goto yy978;
-        goto yy974;
-yy977:
+        if(yych == 'L') goto yy985;
+        if(yych == 'l') goto yy985;
+        goto yy981;
+yy984:
         yych = *++YYCURSOR;
-        if(yych == 'F') goto yy978;
-        if(yych != 'f') goto yy974;
-yy978:
+        if(yych == 'F') goto yy985;
+        if(yych != 'f') goto yy981;
+yy985:
         yych = *++YYCURSOR;
-        goto yy974;
-yy979:
+        goto yy981;
+yy986:
         yych = *++YYCURSOR;
-        if(yych <= '/') goto yy966;
-        if(yych >= ':') goto yy966;
-yy980:
+        if(yych <= '/') goto yy973;
+        if(yych >= ':') goto yy973;
+yy987:
         ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 2) YYFILL(2);
         yych = *YYCURSOR;
         if(yych <= 'K') {
             if(yych <= '9') {
-                if(yych <= '/') goto yy974;
-                goto yy980;
+                if(yych <= '/') goto yy981;
+                goto yy987;
             } else {
-                if(yych == 'F') goto yy976;
-                goto yy974;
+                if(yych == 'F') goto yy983;
+                goto yy981;
             }
         } else {
             if(yych <= 'f') {
-                if(yych <= 'L') goto yy977;
-                if(yych <= 'e') goto yy974;
-                goto yy976;
+                if(yych <= 'L') goto yy984;
+                if(yych <= 'e') goto yy981;
+                goto yy983;
             } else {
-                if(yych == 'l') goto yy977;
-                goto yy974;
+                if(yych == 'l') goto yy984;
+                goto yy981;
             }
         }
-yy982:
+yy989:
         yych = *++YYCURSOR;
         if(yych <= ',') {
-            if(yych != '+') goto yy966;
+            if(yych != '+') goto yy973;
         } else {
-            if(yych <= '-') goto yy983;
-            if(yych <= '/') goto yy966;
-            if(yych <= '9') goto yy984;
-            goto yy966;
+            if(yych <= '-') goto yy990;
+            if(yych <= '/') goto yy973;
+            if(yych <= '9') goto yy991;
+            goto yy973;
         }
-yy983:
+yy990:
         yych = *++YYCURSOR;
-        if(yych <= '/') goto yy966;
-        if(yych >= ':') goto yy966;
-yy984:
+        if(yych <= '/') goto yy973;
+        if(yych >= ':') goto yy973;
+yy991:
         ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 2) YYFILL(2);
         yych = *YYCURSOR;
         if(yych <= 'K') {
             if(yych <= '9') {
-                if(yych <= '/') goto yy974;
-                goto yy984;
+                if(yych <= '/') goto yy981;
+                goto yy991;
             } else {
-                if(yych == 'F') goto yy976;
-                goto yy974;
+                if(yych == 'F') goto yy983;
+                goto yy981;
             }
         } else {
             if(yych <= 'f') {
-                if(yych <= 'L') goto yy977;
-                if(yych <= 'e') goto yy974;
-                goto yy976;
+                if(yych <= 'L') goto yy984;
+                if(yych <= 'e') goto yy981;
+                goto yy983;
             } else {
-                if(yych == 'l') goto yy977;
-                goto yy974;
+                if(yych == 'l') goto yy984;
+                goto yy981;
             }
         }
-yy986:
+yy993:
         yyaccept = 0;
         YYMARKER = ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 3) YYFILL(3);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 64) {
-            goto yy986;
+            goto yy993;
         }
         if(yych <= '9') {
-            if(yych == '.') goto yy972;
-            if(yych <= '/') goto yy968;
-            goto yy989;
+            if(yych == '.') goto yy979;
+            if(yych <= '/') goto yy975;
+            goto yy996;
         } else {
             if(yych <= 'E') {
-                if(yych <= 'D') goto yy968;
-                goto yy982;
+                if(yych <= 'D') goto yy975;
+                goto yy989;
             } else {
-                if(yych == 'e') goto yy982;
-                goto yy968;
+                if(yych == 'e') goto yy989;
+                goto yy975;
             }
         }
-yy988:
+yy995:
         yych = *++YYCURSOR;
         if(yybm[0+yych] & 128) {
-            goto yy991;
+            goto yy998;
         }
-        goto yy966;
-yy989:
+        goto yy973;
+yy996:
         ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 3) YYFILL(3);
         yych = *YYCURSOR;
         if(yych <= '9') {
-            if(yych == '.') goto yy972;
-            if(yych <= '/') goto yy966;
-            goto yy989;
+            if(yych == '.') goto yy979;
+            if(yych <= '/') goto yy973;
+            goto yy996;
         } else {
             if(yych <= 'E') {
-                if(yych <= 'D') goto yy966;
-                goto yy982;
+                if(yych <= 'D') goto yy973;
+                goto yy989;
             } else {
-                if(yych == 'e') goto yy982;
-                goto yy966;
+                if(yych == 'e') goto yy989;
+                goto yy973;
             }
         }
-yy991:
+yy998:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 128) {
-            goto yy991;
+            goto yy998;
         }
-        goto yy968;
+        goto yy975;
     }
 }
-#line 398 "cpp.re"
+#line 406 "cpp.re"
 
     }
 }
@@ -6804,143 +6838,143 @@
     if (s->enable_ms_extensions) {
     {
 
-#line 6808 "cpp_re.inc"
+#line 6842 "cpp_re.inc"
     {
         YYCTYPE yych;
         if((YYLIMIT - YYCURSOR) < 3) YYFILL(3);
         yych = *(YYMARKER = YYCURSOR);
         if(yych <= 'h') {
             if(yych <= 'L') {
-                if(yych >= 'L') goto yy997;
+                if(yych >= 'L') goto yy1004;
             } else {
-                if(yych == 'U') goto yy996;
+                if(yych == 'U') goto yy1003;
             }
         } else {
             if(yych <= 'l') {
-                if(yych <= 'i') goto yy998;
-                if(yych >= 'l') goto yy997;
+                if(yych <= 'i') goto yy1005;
+                if(yych >= 'l') goto yy1004;
             } else {
-                if(yych == 'u') goto yy996;
+                if(yych == 'u') goto yy1003;
             }
         }
-yy995:
-#line 411 "cpp.re"
+yy1002:
+#line 419 "cpp.re"
         { BOOST_WAVE_RET(T_INTLIT); }
-#line 6830 "cpp_re.inc"
-yy996:
+#line 6864 "cpp_re.inc"
+yy1003:
         yych = *++YYCURSOR;
-        if(yych == 'L') goto yy1005;
-        if(yych == 'l') goto yy1005;
-        goto yy995;
-yy997:
+        if(yych == 'L') goto yy1012;
+        if(yych == 'l') goto yy1012;
+        goto yy1002;
+yy1004:
         yych = *++YYCURSOR;
         if(yych <= 'U') {
-            if(yych == 'L') goto yy1004;
-            if(yych <= 'T') goto yy995;
-            goto yy1003;
+            if(yych == 'L') goto yy1011;
+            if(yych <= 'T') goto yy1002;
+            goto yy1010;
         } else {
             if(yych <= 'l') {
-                if(yych <= 'k') goto yy995;
-                goto yy1004;
+                if(yych <= 'k') goto yy1002;
+                goto yy1011;
             } else {
-                if(yych == 'u') goto yy1003;
-                goto yy995;
+                if(yych == 'u') goto yy1010;
+                goto yy1002;
             }
         }
-yy998:
+yy1005:
         yych = *++YYCURSOR;
-        if(yych == '6') goto yy1000;
-yy999:
+        if(yych == '6') goto yy1007;
+yy1006:
         YYCURSOR = YYMARKER;
-        goto yy995;
-yy1000:
+        goto yy1002;
+yy1007:
         yych = *++YYCURSOR;
-        if(yych != '4') goto yy999;
-yy1001:
+        if(yych != '4') goto yy1006;
+yy1008:
         ++YYCURSOR;
-yy1002:
-#line 408 "cpp.re"
+yy1009:
+#line 416 "cpp.re"
         { BOOST_WAVE_RET(T_LONGINTLIT); }
-#line 6865 "cpp_re.inc"
-yy1003:
+#line 6899 "cpp_re.inc"
+yy1010:
         yych = *++YYCURSOR;
-        goto yy995;
-yy1004:
+        goto yy1002;
+yy1011:
         yych = *++YYCURSOR;
-        if(yych == 'U') goto yy1001;
-        if(yych == 'u') goto yy1001;
+        if(yych == 'U') goto yy1008;
+        if(yych == 'u') goto yy1008;
+        goto yy1009;
+yy1012:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == 'L') goto yy1008;
+        if(yych == 'l') goto yy1008;
         goto yy1002;
-yy1005:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == 'L') goto yy1001;
-        if(yych == 'l') goto yy1001;
-        goto yy995;
     }
 }
-#line 412 "cpp.re"
+#line 420 "cpp.re"
 
     }
     else {
     {
 
-#line 6887 "cpp_re.inc"
+#line 6921 "cpp_re.inc"
     {
         YYCTYPE yych;
         if((YYLIMIT - YYCURSOR) < 3) YYFILL(3);
         yych = *YYCURSOR;
         if(yych <= 'U') {
-            if(yych == 'L') goto yy1010;
-            if(yych >= 'U') goto yy1009;
+            if(yych == 'L') goto yy1017;
+            if(yych >= 'U') goto yy1016;
         } else {
             if(yych <= 'l') {
-                if(yych >= 'l') goto yy1010;
+                if(yych >= 'l') goto yy1017;
             } else {
-                if(yych == 'u') goto yy1009;
+                if(yych == 'u') goto yy1016;
             }
         }
-yy1008:
-#line 420 "cpp.re"
+yy1015:
+#line 428 "cpp.re"
         { BOOST_WAVE_RET(T_INTLIT); }
-#line 6905 "cpp_re.inc"
-yy1009:
+#line 6939 "cpp_re.inc"
+yy1016:
         yych = *++YYCURSOR;
-        if(yych == 'L') goto yy1015;
-        if(yych == 'l') goto yy1015;
-        goto yy1008;
-yy1010:
+        if(yych == 'L') goto yy1022;
+        if(yych == 'l') goto yy1022;
+        goto yy1015;
+yy1017:
         yych = *++YYCURSOR;
         if(yych <= 'U') {
-            if(yych == 'L') goto yy1012;
-            if(yych <= 'T') goto yy1008;
+            if(yych == 'L') goto yy1019;
+            if(yych <= 'T') goto yy1015;
         } else {
             if(yych <= 'l') {
-                if(yych <= 'k') goto yy1008;
-                goto yy1012;
+                if(yych <= 'k') goto yy1015;
+                goto yy1019;
             } else {
-                if(yych != 'u') goto yy1008;
+                if(yych != 'u') goto yy1015;
             }
         }
         yych = *++YYCURSOR;
-        goto yy1008;
-yy1012:
+        goto yy1015;
+yy1019:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) == 'U') goto yy1014;
-        if(yych == 'u') goto yy1014;
-yy1013:
-#line 417 "cpp.re"
+        if((yych = *YYCURSOR) == 'U') goto yy1021;
+        if(yych == 'u') goto yy1021;
+yy1020:
+#line 425 "cpp.re"
         { BOOST_WAVE_RET(T_LONGINTLIT); }
-#line 6933 "cpp_re.inc"
-yy1014:
+#line 6967 "cpp_re.inc"
+yy1021:
         yych = *++YYCURSOR;
-        goto yy1013;
-yy1015:
+        goto yy1020;
+yy1022:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) == 'L') goto yy1014;
-        if(yych == 'l') goto yy1014;
-        goto yy1008;
+        if((yych = *YYCURSOR) == 'L') goto yy1021;
+        if(yych == 'l') goto yy1021;
+        goto yy1015;
     }
 }
-#line 421 "cpp.re"
+#line 429 "cpp.re"
 
     }
 }

Modified: boost/trunk/libs/wave/src/cpplexer/re2clex/strict_cpp.re
===================================================================
--- boost/trunk/libs/wave/src/cpplexer/re2clex/strict_cpp.re	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/cpplexer/re2clex/strict_cpp.re	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
     Boost.Wave: A Standard compliant C++ preprocessor library
 
     Copyright (c) 2001 Daniel C. Nuffer
-    Copyright (c) 2001-2006 Hartmut Kaiser. 
+    Copyright (c) 2001-2007 Hartmut Kaiser. 
     Distributed under the Boost Software License, Version 1.0. (See accompanying 
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -16,7 +16,9 @@
 =============================================================================*/
 
 /*!re2c
+re2c:indent:string = "    "; 
 any                = [\t\v\f\r\n\040-\377];
+anyctrl            = [\001-\037];
 OctalDigit         = [0-7];
 Digit              = [0-9];
 HexDigit           = [a-fA-F0-9];
@@ -32,7 +34,7 @@
 HexQuad            = HexDigit HexDigit HexDigit HexDigit;
 UniversalChar      = Backslash ("u" HexQuad | "U" HexQuad HexQuad);
 Newline            = "\r\n" | "\n" | "\r";
-PPSpace            = ([ \t]|("/*"(any\[*]|Newline|("*"+(any\[*/]|Newline)))*"*"+"/"))*;
+PPSpace            = ([ \t\f\v]|("/*"(any\[*]|Newline|("*"+(any\[*/]|Newline)))*"*"+"/"))*;
 Pound              = "#" | "??=" | "%:";
 NonDigit           = [a-zA-Z_] | UniversalChar;
 */
@@ -286,23 +288,20 @@
     {
         if(cursor != s->eof) 
         {
-            using namespace std;      // some systems have printf in std
-            if (0 != s->error_proc)
-                (*s->error_proc)(s, "'\\000' in input stream");
-            else
-                printf("Error: 0 in file\n");
+            BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+            (*s->error_proc)(s, "invalid character '\\000' in input stream");
         }
         BOOST_WAVE_RET(T_EOF);
     }
 
-    any
+    any        { BOOST_WAVE_RET(TOKEN_FROM_ID(*s->tok, UnknownTokenType)); }
+
+    anyctrl
     {
-        /* if (0 != s->error_proc)
-            (*s->error_proc)(s, "Unexpected character: '%c'", *s->tok);
-        else
-            printf("unexpected character: '%c'\n", *s->tok);
-        */
-        BOOST_WAVE_RET(TOKEN_FROM_ID(*s->tok, UnknownTokenType));
+        // flag the error
+        BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+        (*s->error_proc)(s, "invalid character '\\%03o' in input stream", 
+            *--YYCURSOR);
     }
 */
 
@@ -323,27 +322,26 @@
 
     "\000"
     {
-        using namespace std;      // some systems have printf in std
         if(cursor == s->eof) 
         {
-            if (s->error_proc)
-                (*s->error_proc)(s, "Unterminated comment");
-            else
-                printf("Error: Unterminated comment\n");
+            BOOST_WAVE_UPDATE_CURSOR();   // adjust the input cursor
+            (*s->error_proc)(s, "unterminated 'C' style comment");
         }
         else
         {
-            if (s->error_proc)
-                (*s->error_proc)(s, "'\\000' in input stream");
-            else
-                printf("Error: 0 in file");
+            --YYCURSOR;                   // next call returns T_EOF
+            BOOST_WAVE_UPDATE_CURSOR();   // adjust the input cursor
+            (*s->error_proc)(s, "invalid character: '\\000' in input stream");
         }
-        /* adjust cursor such next call returns T_EOF */
-        --YYCURSOR;
-        /* the comment is unterminated, but nevertheless its a comment */
-        BOOST_WAVE_RET(T_CCOMMENT);
     }
 
+    anyctrl
+    {
+        // flag the error
+        BOOST_WAVE_UPDATE_CURSOR();   // adjust the input cursor
+        (*s->error_proc)(s, "invalid character '\\%03o' in input stream", 
+            *--YYCURSOR);
+    }
 */
 
 cppcomment:
@@ -361,19 +359,29 @@
 
     "\000"
     {
-        using namespace std;      // some systems have printf in std
-        if(cursor != s->eof) 
+        if (cursor != s->eof) 
         {
-            if (s->error_proc)
-                (*s->error_proc)(s, "'\\000' in input stream");
-            else
-                printf("Error: 0 in file");
+            --YYCURSOR;                     // next call returns T_EOF
+            BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+            (*s->error_proc)(s, "invalid character '\\000' in input stream");
         }
-        /* adjust cursor such next call returns T_EOF */
-        --YYCURSOR;
-        /* the comment is unterminated, but nevertheless its a comment */
+        
+        --YYCURSOR;                         // next call returns T_EOF
+        if (!s->single_line_only)
+        {
+            BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+            (*s->error_proc)(s, "Unterminated 'C++' style comment");
+        }
         BOOST_WAVE_RET(T_CPPCOMMENT);
     }
+
+    anyctrl
+    {
+        // flag the error
+        BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+        (*s->error_proc)(s, "invalid character '\\%03o' in input stream",
+            *--YYCURSOR);
+    }
 */
 
 /* this subscanner is called whenever a pp_number has been started */

Modified: boost/trunk/libs/wave/src/cpplexer/re2clex/strict_cpp_re.inc
===================================================================
--- boost/trunk/libs/wave/src/cpplexer/re2clex/strict_cpp_re.inc	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/cpplexer/re2clex/strict_cpp_re.inc	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,10 @@
-/* Generated by re2c 0.10.3 on Sun May 21 12:03:39 2006 */
+/* Generated by re2c 0.10.6 on Tue Oct 03 17:06:25 2006 */
 #line 1 "strict_cpp.re"
 /*=============================================================================
     Boost.Wave: A Standard compliant C++ preprocessor library
 
     Copyright (c) 2001 Daniel C. Nuffer
-    Copyright (c) 2001-2006 Hartmut Kaiser. 
+    Copyright (c) 2001-2007 Hartmut Kaiser. 
     Distributed under the Boost Software License, Version 1.0. (See accompanying 
     file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -17,77 +17,77 @@
         handle errors better.
 =============================================================================*/
 
-#line 38 "strict_cpp.re"
+#line 40 "strict_cpp.re"
 
 
 {
     static unsigned char yybm[] = {
         /* table 1 .. 8: 0 */
           0,   0,   0,   0,   0,   0,   0,   0, 
-          0,  61,  32,  57,  57,  64,   0,   0, 
+          0,  58,  32,  58,  58,  64,   0,   0, 
           0,   0,   0,   0,   0,   0,   0,   0, 
           0,   0,   0,   0,   0,   0,   0,   0, 
-         61,  57,  49,  57,  57,  57,  57,  56, 
-         57,  57, 153,  57,  57,  57,  57,  57, 
-         59,  59,  59,  59,  59,  59,  59,  59, 
-         59,  59,  57,  57,  57,  57,  41,  56, 
-         57,  59,  59,  59,  59,  59,  59,  59, 
-         59,  59,  59,  59,  59,  59,  59,  59, 
-         59,  59,  59,  59,  59,  59,  59,  59, 
-         59,  59,  59,  57,  56,  57,  57,  59, 
-         57,  59,  59,  59,  59,  59,  59,  59, 
-         59,  59,  59,  59,  59,  59,  59,  59, 
-         59,  59,  59,  59,  59,  59,  59,  59, 
-         59,  59,  59,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-         57,  57,  57,  57,  57,  57,  57,  57, 
-        /* table 9 .. 13: 256 */
+         58,  58,  50,  58,  58,  58,  58,  56, 
+         58,  58, 154,  58,  58,  58,  58,  58, 
+         62,  62,  62,  62,  62,  62,  62,  62, 
+         62,  62,  58,  58,  58,  58,  42,  56, 
+         58,  62,  62,  62,  62,  62,  62,  62, 
+         62,  62,  62,  62,  62,  62,  62,  62, 
+         62,  62,  62,  62,  62,  62,  62,  62, 
+         62,  62,  62,  58,  57,  58,  58,  62, 
+         58,  62,  62,  62,  62,  62,  62,  62, 
+         62,  62,  62,  62,  62,  62,  62,  62, 
+         62,  62,  62,  62,  62,  62,  62,  62, 
+         62,  62,  62,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+         58,  58,  58,  58,  58,  58,  58,  58, 
+        /* table 9 .. 12: 256 */
           0,   0,   0,   0,   0,   0,   0,   0, 
-          0,  24,   0,  24,  24,   0,   0,   0, 
+          0,  48,   0,  48,  48,   0,   0,   0, 
           0,   0,   0,   0,   0,   0,   0,   0, 
           0,   0,   0,   0,   0,   0,   0,   0, 
-         24,  16,   0,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         48,  48,  48,  48,  48,  48,  48,  48, 
-         48,  48,  16,  16,  16,  16,  16,  64, 
-         16,  48,  48,  48,  48,  48,  48,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16, 128,  16,  16,  16, 
-         16,  48,  48,  48,  48,  48,  48,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
-         16,  16,  16,  16,  16,  16,  16,  16, 
+         48,  32,   0,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         96,  96,  96,  96,  96,  96,  96,  96, 
+         96,  96,  32,  32,  32,  32,  32, 128, 
+         32,  96,  96,  96,  96,  96,  96,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,   0,  32,  32,  32, 
+         32,  96,  96,  96,  96,  96,  96,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
+         32,  32,  32,  32,  32,  32,  32,  32, 
     };
 
 #line 94 "strict_cpp_re.inc"
@@ -97,8 +97,8 @@
 
         if((YYLIMIT - YYCURSOR) < 17) YYFILL(17);
         yych = *YYCURSOR;
-        switch(yych){
-        case 0x00:  goto yy88;
+        switch(yych) {
+        case 0x00:    goto yy88;
         case 0x01:
         case 0x02:
         case 0x03:
@@ -124,27 +124,27 @@
         case 0x1C:
         case 0x1D:
         case 0x1E:
-        case 0x1F:  goto yy2;
+        case 0x1F:    goto yy91;
         case 0x09:
         case 0x0B:
-        case 0x0C:
-        case ' ':   goto yy83;
-        case 0x0A:  goto yy85;
-        case 0x0D:  goto yy87;
-        case '!':   goto yy69;
-        case '"':   goto yy82;
-        case '#':   goto yy46;
-        case '%':   goto yy38;
-        case '&':   goto yy63;
-        case '\'':  goto yy81;
-        case '(':   goto yy48;
-        case ')':   goto yy50;
-        case '*':   goto yy58;
-        case '+':   goto yy54;
-        case ',':   goto yy75;
-        case '-':   goto yy56;
-        case '.':   goto yy5;
-        case '/':   goto yy3;
+        case 0x0C:    goto yy82;
+        case 0x0A:    goto yy85;
+        case 0x0D:    goto yy87;
+        case ' ':    goto yy84;
+        case '!':    goto yy68;
+        case '"':    goto yy81;
+        case '#':    goto yy45;
+        case '%':    goto yy37;
+        case '&':    goto yy62;
+        case '\'':    goto yy80;
+        case '(':    goto yy47;
+        case ')':    goto yy49;
+        case '*':    goto yy57;
+        case '+':    goto yy53;
+        case ',':    goto yy74;
+        case '-':    goto yy55;
+        case '.':    goto yy4;
+        case '/':    goto yy2;
         case '0':
         case '1':
         case '2':
@@ -154,13 +154,13 @@
         case '6':
         case '7':
         case '8':
-        case '9':   goto yy7;
-        case ':':   goto yy44;
-        case ';':   goto yy52;
-        case '<':   goto yy34;
-        case '=':   goto yy71;
-        case '>':   goto yy73;
-        case '?':   goto yy32;
+        case '9':    goto yy6;
+        case ':':    goto yy43;
+        case ';':    goto yy51;
+        case '<':    goto yy33;
+        case '=':    goto yy70;
+        case '>':    goto yy72;
+        case '?':    goto yy31;
         case 'A':
         case 'B':
         case 'C':
@@ -191,40 +191,580 @@
         case 'k':
         case 'q':
         case 'y':
-        case 'z':   goto yy77;
-        case 'L':   goto yy78;
-        case '[':   goto yy40;
-        case '\\':  goto yy79;
-        case ']':   goto yy42;
-        case '^':   goto yy60;
-        case '_':   goto yy29;
-        case 'a':   goto yy9;
-        case 'b':   goto yy11;
-        case 'c':   goto yy12;
-        case 'd':   goto yy13;
-        case 'e':   goto yy14;
-        case 'f':   goto yy15;
-        case 'g':   goto yy16;
-        case 'i':   goto yy17;
-        case 'l':   goto yy18;
-        case 'm':   goto yy19;
-        case 'n':   goto yy20;
-        case 'o':   goto yy21;
-        case 'p':   goto yy22;
-        case 'r':   goto yy23;
-        case 's':   goto yy24;
-        case 't':   goto yy25;
-        case 'u':   goto yy26;
-        case 'v':   goto yy27;
-        case 'w':   goto yy28;
-        case 'x':   goto yy62;
-        case '{':   goto yy30;
-        case '|':   goto yy65;
-        case '}':   goto yy36;
-        case '~':   goto yy67;
+        case 'z':    goto yy76;
+        case 'L':    goto yy77;
+        case '[':    goto yy39;
+        case '\\':    goto yy78;
+        case ']':    goto yy41;
+        case '^':    goto yy59;
+        case '_':    goto yy28;
+        case 'a':    goto yy8;
+        case 'b':    goto yy10;
+        case 'c':    goto yy11;
+        case 'd':    goto yy12;
+        case 'e':    goto yy13;
+        case 'f':    goto yy14;
+        case 'g':    goto yy15;
+        case 'i':    goto yy16;
+        case 'l':    goto yy17;
+        case 'm':    goto yy18;
+        case 'n':    goto yy19;
+        case 'o':    goto yy20;
+        case 'p':    goto yy21;
+        case 'r':    goto yy22;
+        case 's':    goto yy23;
+        case 't':    goto yy24;
+        case 'u':    goto yy25;
+        case 'v':    goto yy26;
+        case 'w':    goto yy27;
+        case 'x':    goto yy61;
+        case '{':    goto yy29;
+        case '|':    goto yy64;
+        case '}':    goto yy35;
+        case '~':    goto yy66;
         default:    goto yy90;
         }
 yy2:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) <= '.') {
+            if(yych == '*') goto yy916;
+        } else {
+            if(yych <= '/') goto yy914;
+            if(yych == '=') goto yy912;
+        }
+#line 177 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_DIVIDE); }
+#line 238 "strict_cpp_re.inc"
+yy4:
+        yyaccept = 0;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= '-') {
+            if(yych == '*') goto yy906;
+        } else {
+            if(yych <= '.') goto yy908;
+            if(yych <= '/') goto yy5;
+            if(yych <= '9') goto yy909;
+        }
+yy5:
+#line 163 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_DOT); }
+#line 252 "strict_cpp_re.inc"
+yy6:
+        ++YYCURSOR;
+yy7:
+#line 45 "strict_cpp.re"
+        { goto pp_number; }
+#line 258 "strict_cpp_re.inc"
+yy8:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 'r') {
+            if(yych == 'n') goto yy892;
+            goto yy195;
+        } else {
+            if(yych <= 's') goto yy893;
+            if(yych == 'u') goto yy894;
+            goto yy195;
+        }
+yy9:
+#line 242 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_IDENTIFIER); }
+#line 273 "strict_cpp_re.inc"
+yy10:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 'n') {
+            if(yych == 'i') goto yy874;
+            goto yy195;
+        } else {
+            if(yych <= 'o') goto yy875;
+            if(yych == 'r') goto yy876;
+            goto yy195;
+        }
+yy11:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        switch(yych) {
+        case 'a':    goto yy836;
+        case 'h':    goto yy837;
+        case 'l':    goto yy838;
+        case 'o':    goto yy839;
+        default:    goto yy195;
+        }
+yy12:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 'n') {
+            if(yych == 'e') goto yy805;
+            goto yy195;
+        } else {
+            if(yych <= 'o') goto yy806;
+            if(yych == 'y') goto yy808;
+            goto yy195;
+        }
+yy13:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 'm') {
+            if(yych == 'l') goto yy780;
+            goto yy195;
+        } else {
+            if(yych <= 'n') goto yy781;
+            if(yych == 'x') goto yy782;
+            goto yy195;
+        }
+yy14:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        switch(yych) {
+        case 'a':    goto yy761;
+        case 'l':    goto yy762;
+        case 'o':    goto yy763;
+        case 'r':    goto yy764;
+        default:    goto yy195;
+        }
+yy15:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'o') goto yy757;
+        goto yy195;
+yy16:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'f') goto yy747;
+        if(yych == 'n') goto yy749;
+        goto yy195;
+yy17:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'o') goto yy743;
+        goto yy195;
+yy18:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'u') goto yy736;
+        goto yy195;
+yy19:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 'd') {
+            if(yych == 'a') goto yy717;
+            goto yy195;
+        } else {
+            if(yych <= 'e') goto yy718;
+            if(yych == 'o') goto yy719;
+            goto yy195;
+        }
+yy20:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'p') goto yy703;
+        if(yych == 'r') goto yy704;
+        goto yy195;
+yy21:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'r') goto yy682;
+        if(yych == 'u') goto yy683;
+        goto yy195;
+yy22:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'e') goto yy654;
+        goto yy195;
+yy23:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 's') {
+            if(yych <= 'g') goto yy195;
+            if(yych <= 'h') goto yy615;
+            if(yych <= 'i') goto yy616;
+            goto yy195;
+        } else {
+            if(yych <= 't') goto yy617;
+            if(yych == 'w') goto yy618;
+            goto yy195;
+        }
+yy24:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 'h') {
+            if(yych == 'e') goto yy578;
+            if(yych <= 'g') goto yy195;
+            goto yy579;
+        } else {
+            if(yych <= 'r') {
+                if(yych <= 'q') goto yy195;
+                goto yy580;
+            } else {
+                if(yych == 'y') goto yy581;
+                goto yy195;
+            }
+        }
+yy25:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'n') goto yy561;
+        if(yych == 's') goto yy562;
+        goto yy195;
+yy26:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'i') goto yy543;
+        if(yych == 'o') goto yy544;
+        goto yy195;
+yy27:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'c') goto yy531;
+        if(yych == 'h') goto yy532;
+        goto yy195;
+yy28:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        switch(yych) {
+        case '_':    goto yy442;
+        case 'a':    goto yy443;
+        case 'b':    goto yy444;
+        case 'c':    goto yy445;
+        case 'd':    goto yy446;
+        case 'f':    goto yy447;
+        case 'i':    goto yy448;
+        case 's':    goto yy449;
+        default:    goto yy195;
+        }
+yy29:
+        ++YYCURSOR;
+#line 127 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_LEFTBRACE); }
+#line 441 "strict_cpp_re.inc"
+yy31:
+        yyaccept = 2;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == '?') goto yy407;
+yy32:
+#line 152 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_QUESTION_MARK); }
+#line 449 "strict_cpp_re.inc"
+yy33:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) <= ':') {
+            if(yych == '%') goto yy403;
+            if(yych >= ':') goto yy401;
+        } else {
+            if(yych <= ';') goto yy34;
+            if(yych <= '<') goto yy399;
+            if(yych <= '=') goto yy397;
+        }
+yy34:
+#line 193 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_LESS); }
+#line 463 "strict_cpp_re.inc"
+yy35:
+        ++YYCURSOR;
+#line 130 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_RIGHTBRACE); }
+#line 468 "strict_cpp_re.inc"
+yy37:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) <= '<') {
+            if(yych == ':') goto yy388;
+        } else {
+            if(yych <= '=') goto yy390;
+            if(yych <= '>') goto yy392;
+        }
+#line 178 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_PERCENT); }
+#line 479 "strict_cpp_re.inc"
+yy39:
+        ++YYCURSOR;
+#line 133 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_LEFTBRACKET); }
+#line 484 "strict_cpp_re.inc"
+yy41:
+        ++YYCURSOR;
+#line 136 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_RIGHTBRACKET); }
+#line 489 "strict_cpp_re.inc"
+yy43:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == ':') goto yy384;
+        if(yych == '>') goto yy386;
+#line 150 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_COLON); }
+#line 496 "strict_cpp_re.inc"
+yy45:
+        yyaccept = 3;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 'c') {
+            if(yych <= ' ') {
+                if(yych <= 0x0A) {
+                    if(yych == 0x09) goto yy261;
+                } else {
+                    if(yych <= 0x0C) goto yy261;
+                    if(yych >= ' ') goto yy261;
+                }
+            } else {
+                if(yych <= '.') {
+                    if(yych == '#') goto yy272;
+                } else {
+                    if(yych <= '/') goto yy261;
+                    if(yych == '?') goto yy271;
+                }
+            }
+        } else {
+            if(yych <= 'p') {
+                if(yych <= 'i') {
+                    if(yych <= 'e') goto yy261;
+                    if(yych >= 'i') goto yy261;
+                } else {
+                    if(yych == 'l') goto yy261;
+                    if(yych >= 'p') goto yy261;
+                }
+            } else {
+                if(yych <= 't') {
+                    if(yych == 'r') goto yy261;
+                } else {
+                    if(yych == 'v') goto yy46;
+                    if(yych <= 'w') goto yy261;
+                }
+            }
+        }
+yy46:
+#line 139 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_POUND); }
+#line 537 "strict_cpp_re.inc"
+yy47:
+        ++YYCURSOR;
+#line 147 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_LEFTPAREN); }
+#line 542 "strict_cpp_re.inc"
+yy49:
+        ++YYCURSOR;
+#line 148 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_RIGHTPAREN); }
+#line 547 "strict_cpp_re.inc"
+yy51:
+        ++YYCURSOR;
+#line 149 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_SEMICOLON); }
+#line 552 "strict_cpp_re.inc"
+yy53:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == '+') goto yy256;
+        if(yych == '=') goto yy258;
+#line 174 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_PLUS); }
+#line 559 "strict_cpp_re.inc"
+yy55:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) <= '<') {
+            if(yych == '-') goto yy250;
+        } else {
+            if(yych <= '=') goto yy252;
+            if(yych <= '>') goto yy248;
+        }
+#line 175 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_MINUS); }
+#line 570 "strict_cpp_re.inc"
+yy57:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == '=') goto yy246;
+#line 176 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_STAR); }
+#line 576 "strict_cpp_re.inc"
+yy59:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == '=') goto yy244;
+#line 179 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_XOR); }
+#line 582 "strict_cpp_re.inc"
+yy61:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'o') goto yy237;
+        goto yy195;
+yy62:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == '&') goto yy233;
+        if(yych == '=') goto yy235;
+#line 182 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_AND); }
+#line 594 "strict_cpp_re.inc"
+yy64:
+        yyaccept = 4;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= '>') {
+            if(yych == '=') goto yy228;
+        } else {
+            if(yych <= '?') goto yy225;
+            if(yych == '|') goto yy226;
+        }
+yy65:
+#line 184 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_OR); }
+#line 607 "strict_cpp_re.inc"
+yy66:
+        ++YYCURSOR;
+#line 187 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_COMPL); }
+#line 612 "strict_cpp_re.inc"
+yy68:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == '=') goto yy223;
+#line 190 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_NOT); }
+#line 618 "strict_cpp_re.inc"
+yy70:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == '=') goto yy221;
+#line 192 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_ASSIGN); }
+#line 624 "strict_cpp_re.inc"
+yy72:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) <= '<') goto yy73;
+        if(yych <= '=') goto yy215;
+        if(yych <= '>') goto yy217;
+yy73:
+#line 194 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_GREATER); }
+#line 633 "strict_cpp_re.inc"
+yy74:
+        ++YYCURSOR;
+#line 226 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_COMMA); }
+#line 638 "strict_cpp_re.inc"
+yy76:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        goto yy195;
+yy77:
+        yyaccept = 1;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yybm[0+yych] & 4) {
+            goto yy194;
+        }
+        if(yych <= '\'') {
+            if(yych == '"') goto yy96;
+            if(yych <= '&') goto yy9;
+            goto yy214;
+        } else {
+            if(yych <= '?') {
+                if(yych <= '>') goto yy9;
+                goto yy197;
+            } else {
+                if(yych == '\\') goto yy196;
+                goto yy9;
+            }
+        }
+yy78:
+        yyaccept = 5;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych == 'U') goto yy186;
+        if(yych == 'u') goto yy185;
+yy79:
+#line 297 "strict_cpp.re"
+        { BOOST_WAVE_RET(TOKEN_FROM_ID(*s->tok, UnknownTokenType)); }
+#line 670 "strict_cpp_re.inc"
+yy80:
+        yyaccept = 5;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 0x0C) {
+            if(yych == 0x09) goto yy142;
+            if(yych <= 0x0A) goto yy79;
+            goto yy142;
+        } else {
+            if(yych <= 0x1F) goto yy79;
+            if(yych == '\'') goto yy79;
+            goto yy142;
+        }
+yy81:
+        yyaccept = 5;
+        yych = *(YYMARKER = ++YYCURSOR);
+        if(yych <= 0x0A) {
+            if(yych == 0x09) goto yy97;
+            goto yy79;
+        } else {
+            if(yych <= 0x0C) goto yy97;
+            if(yych <= 0x1F) goto yy79;
+            goto yy97;
+        }
+yy82:
+        ++YYCURSOR;
+        yych = *YYCURSOR;
+        goto yy95;
+yy83:
+#line 278 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_SPACE); }
+#line 701 "strict_cpp_re.inc"
+yy84:
+        yych = *++YYCURSOR;
+        goto yy95;
+yy85:
+        ++YYCURSOR;
+yy86:
+#line 281 "strict_cpp.re"
+        {
+        s->line++;
+        cursor.column = 1;
+        BOOST_WAVE_RET(T_NEWLINE);
+    }
+#line 714 "strict_cpp_re.inc"
+yy87:
+        yych = *++YYCURSOR;
+        if(yych == 0x0A) goto yy93;
+        goto yy86;
+yy88:
+        ++YYCURSOR;
+#line 288 "strict_cpp.re"
+        {
+        if(cursor != s->eof) 
+        {
+            BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+            (*s->error_proc)(s, "invalid character '\\000' in input stream");
+        }
+        BOOST_WAVE_RET(T_EOF);
+    }
+#line 730 "strict_cpp_re.inc"
+yy90:
+        yych = *++YYCURSOR;
+        goto yy79;
+yy91:
+        ++YYCURSOR;
+#line 300 "strict_cpp.re"
+        {
+        // flag the error
+        BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+        (*s->error_proc)(s, "invalid character '\\%03o' in input stream", 
+            *--YYCURSOR);
+    }
+#line 743 "strict_cpp_re.inc"
+yy93:
+        yych = *++YYCURSOR;
+        goto yy86;
+yy94:
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
+yy95:
+        if(yybm[256+yych] & 16) {
+            goto yy94;
+        }
+        goto yy83;
+yy96:
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
+yy97:
+        if(yybm[256+yych] & 32) {
+            goto yy96;
+        }
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych <= '[') goto yy99;
+        goto yy100;
+yy98:
         YYCURSOR = YYMARKER;
         if(yyaccept <= 51) {
             if(yyaccept <= 25) {
@@ -233,48 +773,48 @@
                         if(yyaccept <= 3) {
                             if(yyaccept <= 1) {
                                 if(yyaccept <= 0) {
-                                    goto yy6;
+                                    goto yy5;
                                 } else {
-                                    goto yy10;
+                                    goto yy9;
                                 }
                             } else {
                                 if(yyaccept <= 2) {
-                                    goto yy33;
+                                    goto yy32;
                                 } else {
-                                    goto yy47;
+                                    goto yy46;
                                 }
                             }
                         } else {
                             if(yyaccept <= 5) {
                                 if(yyaccept <= 4) {
-                                    goto yy66;
+                                    goto yy65;
                                 } else {
-                                    goto yy80;
+                                    goto yy79;
                                 }
                             } else {
-                                goto yy99;
+                                goto yy102;
                             }
                         }
                     } else {
                         if(yyaccept <= 9) {
                             if(yyaccept <= 8) {
                                 if(yyaccept <= 7) {
-                                    goto yy149;
+                                    goto yy152;
                                 } else {
-                                    goto yy236;
+                                    goto yy239;
                                 }
                             } else {
-                                goto yy240;
+                                goto yy243;
                             }
                         } else {
                             if(yyaccept <= 11) {
                                 if(yyaccept <= 10) {
-                                    goto yy276;
+                                    goto yy279;
                                 } else {
-                                    goto yy291;
+                                    goto yy294;
                                 }
                             } else {
-                                goto yy386;
+                                goto yy389;
                             }
                         }
                     }
@@ -283,48 +823,48 @@
                         if(yyaccept <= 16) {
                             if(yyaccept <= 14) {
                                 if(yyaccept <= 13) {
-                                    goto yy414;
+                                    goto yy417;
                                 } else {
-                                    goto yy418;
+                                    goto yy421;
                                 }
                             } else {
                                 if(yyaccept <= 15) {
-                                    goto yy422;
+                                    goto yy425;
                                 } else {
-                                    goto yy453;
+                                    goto yy456;
                                 }
                             }
                         } else {
                             if(yyaccept <= 18) {
                                 if(yyaccept <= 17) {
-                                    goto yy459;
+                                    goto yy462;
                                 } else {
-                                    goto yy467;
+                                    goto yy470;
                                 }
                             } else {
-                                goto yy475;
+                                goto yy478;
                             }
                         }
                     } else {
                         if(yyaccept <= 22) {
                             if(yyaccept <= 21) {
                                 if(yyaccept <= 20) {
-                                    goto yy480;
+                                    goto yy483;
                                 } else {
-                                    goto yy485;
+                                    goto yy488;
                                 }
                             } else {
-                                goto yy488;
+                                goto yy491;
                             }
                         } else {
                             if(yyaccept <= 24) {
                                 if(yyaccept <= 23) {
-                                    goto yy498;
+                                    goto yy501;
                                 } else {
-                                    goto yy504;
+                                    goto yy507;
                                 }
                             } else {
-                                goto yy507;
+                                goto yy510;
                             }
                         }
                     }
@@ -335,48 +875,48 @@
                         if(yyaccept <= 29) {
                             if(yyaccept <= 27) {
                                 if(yyaccept <= 26) {
-                                    goto yy514;
+                                    goto yy517;
                                 } else {
-                                    goto yy521;
+                                    goto yy524;
                                 }
                             } else {
                                 if(yyaccept <= 28) {
-                                    goto yy523;
+                                    goto yy526;
                                 } else {
-                                    goto yy525;
+                                    goto yy528;
                                 }
                             }
                         } else {
                             if(yyaccept <= 31) {
                                 if(yyaccept <= 30) {
-                                    goto yy527;
+                                    goto yy530;
                                 } else {
-                                    goto yy533;
+                                    goto yy536;
                                 }
                             } else {
-                                goto yy539;
+                                goto yy542;
                             }
                         }
                     } else {
                         if(yyaccept <= 35) {
                             if(yyaccept <= 34) {
                                 if(yyaccept <= 33) {
-                                    goto yy549;
+                                    goto yy552;
                                 } else {
-                                    goto yy551;
+                                    goto yy554;
                                 }
                             } else {
-                                goto yy557;
+                                goto yy560;
                             }
                         } else {
                             if(yyaccept <= 37) {
                                 if(yyaccept <= 36) {
-                                    goto yy563;
+                                    goto yy566;
                                 } else {
-                                    goto yy571;
+                                    goto yy574;
                                 }
                             } else {
-                                goto yy574;
+                                goto yy577;
                             }
                         }
                     }
@@ -385,48 +925,48 @@
                         if(yyaccept <= 42) {
                             if(yyaccept <= 40) {
                                 if(yyaccept <= 39) {
-                                    goto yy587;
+                                    goto yy590;
                                 } else {
-                                    goto yy589;
+                                    goto yy592;
                                 }
                             } else {
                                 if(yyaccept <= 41) {
-                                    goto yy592;
+                                    goto yy595;
                                 } else {
-                                    goto yy595;
+                                    goto yy598;
                                 }
                             }
                         } else {
                             if(yyaccept <= 44) {
                                 if(yyaccept <= 43) {
-                                    goto yy597;
+                                    goto yy600;
                                 } else {
-                                    goto yy602;
+                                    goto yy605;
                                 }
                             } else {
-                                goto yy604;
+                                goto yy607;
                             }
                         }
                     } else {
                         if(yyaccept <= 48) {
                             if(yyaccept <= 47) {
                                 if(yyaccept <= 46) {
-                                    goto yy611;
+                                    goto yy614;
                                 } else {
-                                    goto yy620;
+                                    goto yy623;
                                 }
                             } else {
-                                goto yy626;
+                                goto yy629;
                             }
                         } else {
                             if(yyaccept <= 50) {
                                 if(yyaccept <= 49) {
-                                    goto yy630;
+                                    goto yy633;
                                 } else {
-                                    goto yy636;
+                                    goto yy639;
                                 }
                             } else {
-                                goto yy642;
+                                goto yy645;
                             }
                         }
                     }
@@ -439,48 +979,48 @@
                         if(yyaccept <= 55) {
                             if(yyaccept <= 53) {
                                 if(yyaccept <= 52) {
-                                    goto yy646;
+                                    goto yy649;
                                 } else {
-                                    goto yy650;
+                                    goto yy653;
                                 }
                             } else {
                                 if(yyaccept <= 54) {
-                                    goto yy658;
+                                    goto yy661;
                                 } else {
-                                    goto yy672;
+                                    goto yy675;
                                 }
                             }
                         } else {
                             if(yyaccept <= 57) {
                                 if(yyaccept <= 56) {
-                                    goto yy678;
+                                    goto yy681;
                                 } else {
-                                    goto yy685;
+                                    goto yy688;
                                 }
                             } else {
-                                goto yy694;
+                                goto yy697;
                             }
                         }
                     } else {
                         if(yyaccept <= 61) {
                             if(yyaccept <= 60) {
                                 if(yyaccept <= 59) {
-                                    goto yy699;
+                                    goto yy702;
                                 } else {
-                                    goto yy702;
+                                    goto yy705;
                                 }
                             } else {
-                                goto yy706;
+                                goto yy709;
                             }
                         } else {
                             if(yyaccept <= 63) {
                                 if(yyaccept <= 62) {
-                                    goto yy713;
+                                    goto yy716;
                                 } else {
-                                    goto yy718;
+                                    goto yy721;
                                 }
                             } else {
-                                goto yy722;
+                                goto yy725;
                             }
                         }
                     }
@@ -489,48 +1029,48 @@
                         if(yyaccept <= 68) {
                             if(yyaccept <= 66) {
                                 if(yyaccept <= 65) {
-                                    goto yy724;
+                                    goto yy727;
                                 } else {
-                                    goto yy732;
+                                    goto yy735;
                                 }
                             } else {
                                 if(yyaccept <= 67) {
-                                    goto yy739;
+                                    goto yy742;
                                 } else {
-                                    goto yy743;
+                                    goto yy746;
                                 }
                             }
                         } else {
                             if(yyaccept <= 70) {
                                 if(yyaccept <= 69) {
-                                    goto yy745;
+                                    goto yy748;
                                 } else {
-                                    goto yy749;
+                                    goto yy752;
                                 }
                             } else {
-                                goto yy753;
+                                goto yy756;
                             }
                         }
                     } else {
                         if(yyaccept <= 74) {
                             if(yyaccept <= 73) {
                                 if(yyaccept <= 72) {
-                                    goto yy757;
+                                    goto yy760;
                                 } else {
-                                    goto yy766;
+                                    goto yy769;
                                 }
                             } else {
-                                goto yy768;
+                                goto yy771;
                             }
                         } else {
                             if(yyaccept <= 76) {
                                 if(yyaccept <= 75) {
-                                    goto yy772;
+                                    goto yy775;
                                 } else {
-                                    goto yy776;
+                                    goto yy779;
                                 }
                             } else {
-                                goto yy785;
+                                goto yy788;
                             }
                         }
                     }
@@ -541,48 +1081,48 @@
                         if(yyaccept <= 81) {
                             if(yyaccept <= 79) {
                                 if(yyaccept <= 78) {
-                                    goto yy790;
+                                    goto yy793;
                                 } else {
-                                    goto yy795;
+                                    goto yy798;
                                 }
                             } else {
                                 if(yyaccept <= 80) {
-                                    goto yy798;
+                                    goto yy801;
                                 } else {
-                                    goto yy801;
+                                    goto yy804;
                                 }
                             }
                         } else {
                             if(yyaccept <= 83) {
                                 if(yyaccept <= 82) {
-                                    goto yy804;
+                                    goto yy807;
                                 } else {
-                                    goto yy816;
+                                    goto yy819;
                                 }
                             } else {
-                                goto yy821;
+                                goto yy824;
                             }
                         }
                     } else {
                         if(yyaccept <= 87) {
                             if(yyaccept <= 86) {
                                 if(yyaccept <= 85) {
-                                    goto yy827;
+                                    goto yy830;
                                 } else {
-                                    goto yy832;
+                                    goto yy835;
                                 }
                             } else {
-                                goto yy841;
+                                goto yy844;
                             }
                         } else {
                             if(yyaccept <= 89) {
                                 if(yyaccept <= 88) {
-                                    goto yy848;
+                                    goto yy851;
                                 } else {
-                                    goto yy850;
+                                    goto yy853;
                                 }
                             } else {
-                                goto yy856;
+                                goto yy859;
                             }
                         }
                     }
@@ -591,823 +1131,288 @@
                         if(yyaccept <= 93) {
                             if(yyaccept <= 92) {
                                 if(yyaccept <= 91) {
-                                    goto yy860;
+                                    goto yy863;
                                 } else {
-                                    goto yy863;
+                                    goto yy866;
                                 }
                             } else {
-                                goto yy868;
+                                goto yy871;
                             }
                         } else {
                             if(yyaccept <= 95) {
                                 if(yyaccept <= 94) {
-                                    goto yy870;
+                                    goto yy873;
                                 } else {
-                                    goto yy877;
+                                    goto yy880;
                                 }
                             } else {
-                                goto yy880;
+                                goto yy883;
                             }
                         }
                     } else {
                         if(yyaccept <= 99) {
                             if(yyaccept <= 98) {
                                 if(yyaccept <= 97) {
-                                    goto yy885;
+                                    goto yy888;
                                 } else {
-                                    goto yy888;
+                                    goto yy891;
                                 }
                             } else {
-                                goto yy894;
+                                goto yy897;
                             }
                         } else {
                             if(yyaccept <= 101) {
                                 if(yyaccept <= 100) {
-                                    goto yy896;
+                                    goto yy899;
                                 } else {
-                                    goto yy898;
+                                    goto yy901;
                                 }
                             } else {
-                                goto yy902;
+                                goto yy905;
                             }
                         }
                     }
                 }
             }
         }
-yy3:
+yy99:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) <= '.') {
-            if(yych == '*') goto yy913;
-        } else {
-            if(yych <= '/') goto yy911;
-            if(yych == '=') goto yy909;
-        }
-#line 175 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_DIVIDE); }
-#line 649 "strict_cpp_re.inc"
-yy5:
-        yyaccept = 0;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= '-') {
-            if(yych == '*') goto yy903;
-        } else {
-            if(yych <= '.') goto yy905;
-            if(yych <= '/') goto yy6;
-            if(yych <= '9') goto yy906;
-        }
-yy6:
-#line 161 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_DOT); }
-#line 663 "strict_cpp_re.inc"
-yy7:
-        ++YYCURSOR;
-yy8:
-#line 43 "strict_cpp.re"
-        { goto pp_number; }
-#line 669 "strict_cpp_re.inc"
-yy9:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'r') {
-            if(yych == 'n') goto yy889;
-            goto yy192;
-        } else {
-            if(yych <= 's') goto yy890;
-            if(yych == 'u') goto yy891;
-            goto yy192;
-        }
-yy10:
-#line 240 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_IDENTIFIER); }
-#line 684 "strict_cpp_re.inc"
-yy11:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'n') {
-            if(yych == 'i') goto yy871;
-            goto yy192;
-        } else {
-            if(yych <= 'o') goto yy872;
-            if(yych == 'r') goto yy873;
-            goto yy192;
-        }
-yy12:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        switch(yych){
-        case 'a':   goto yy833;
-        case 'h':   goto yy834;
-        case 'l':   goto yy835;
-        case 'o':   goto yy836;
-        default:    goto yy192;
-        }
-yy13:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'n') {
-            if(yych == 'e') goto yy802;
-            goto yy192;
-        } else {
-            if(yych <= 'o') goto yy803;
-            if(yych == 'y') goto yy805;
-            goto yy192;
-        }
-yy14:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'm') {
-            if(yych == 'l') goto yy777;
-            goto yy192;
-        } else {
-            if(yych <= 'n') goto yy778;
-            if(yych == 'x') goto yy779;
-            goto yy192;
-        }
-yy15:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        switch(yych){
-        case 'a':   goto yy758;
-        case 'l':   goto yy759;
-        case 'o':   goto yy760;
-        case 'r':   goto yy761;
-        default:    goto yy192;
-        }
-yy16:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'o') goto yy754;
-        goto yy192;
-yy17:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'f') goto yy744;
-        if(yych == 'n') goto yy746;
-        goto yy192;
-yy18:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'o') goto yy740;
-        goto yy192;
-yy19:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'u') goto yy733;
-        goto yy192;
-yy20:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'd') {
-            if(yych == 'a') goto yy714;
-            goto yy192;
-        } else {
-            if(yych <= 'e') goto yy715;
-            if(yych == 'o') goto yy716;
-            goto yy192;
-        }
-yy21:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'p') goto yy700;
-        if(yych == 'r') goto yy701;
-        goto yy192;
-yy22:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'r') goto yy679;
-        if(yych == 'u') goto yy680;
-        goto yy192;
-yy23:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'e') goto yy651;
-        goto yy192;
-yy24:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 's') {
-            if(yych <= 'g') goto yy192;
-            if(yych <= 'h') goto yy612;
-            if(yych <= 'i') goto yy613;
-            goto yy192;
-        } else {
-            if(yych <= 't') goto yy614;
-            if(yych == 'w') goto yy615;
-            goto yy192;
-        }
-yy25:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'h') {
-            if(yych == 'e') goto yy575;
-            if(yych <= 'g') goto yy192;
-            goto yy576;
-        } else {
-            if(yych <= 'r') {
-                if(yych <= 'q') goto yy192;
-                goto yy577;
-            } else {
-                if(yych == 'y') goto yy578;
-                goto yy192;
-            }
-        }
-yy26:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'n') goto yy558;
-        if(yych == 's') goto yy559;
-        goto yy192;
-yy27:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy540;
-        if(yych == 'o') goto yy541;
-        goto yy192;
-yy28:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'c') goto yy528;
-        if(yych == 'h') goto yy529;
-        goto yy192;
-yy29:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        switch(yych){
-        case '_':   goto yy439;
-        case 'a':   goto yy440;
-        case 'b':   goto yy441;
-        case 'c':   goto yy442;
-        case 'd':   goto yy443;
-        case 'f':   goto yy444;
-        case 'i':   goto yy445;
-        case 's':   goto yy446;
-        default:    goto yy192;
-        }
-yy30:
-        ++YYCURSOR;
-#line 125 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_LEFTBRACE); }
-#line 852 "strict_cpp_re.inc"
-yy32:
-        yyaccept = 2;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == '?') goto yy404;
-yy33:
-#line 150 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_QUESTION_MARK); }
-#line 860 "strict_cpp_re.inc"
-yy34:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) <= ':') {
-            if(yych == '%') goto yy400;
-            if(yych >= ':') goto yy398;
-        } else {
-            if(yych <= ';') goto yy35;
-            if(yych <= '<') goto yy396;
-            if(yych <= '=') goto yy394;
-        }
-yy35:
-#line 191 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_LESS); }
-#line 874 "strict_cpp_re.inc"
-yy36:
-        ++YYCURSOR;
-#line 128 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_RIGHTBRACE); }
-#line 879 "strict_cpp_re.inc"
-yy38:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) <= '<') {
-            if(yych == ':') goto yy385;
-        } else {
-            if(yych <= '=') goto yy387;
-            if(yych <= '>') goto yy389;
-        }
-#line 176 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_PERCENT); }
-#line 890 "strict_cpp_re.inc"
-yy40:
-        ++YYCURSOR;
-#line 131 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_LEFTBRACKET); }
-#line 895 "strict_cpp_re.inc"
-yy42:
-        ++YYCURSOR;
-#line 134 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_RIGHTBRACKET); }
-#line 900 "strict_cpp_re.inc"
-yy44:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == ':') goto yy381;
-        if(yych == '>') goto yy383;
-#line 148 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_COLON); }
-#line 907 "strict_cpp_re.inc"
-yy46:
-        yyaccept = 3;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'e') {
-            if(yych <= '#') {
-                if(yych <= 0x1F) {
-                    if(yych == 0x09) goto yy258;
-                } else {
-                    if(yych <= ' ') goto yy258;
-                    if(yych >= '#') goto yy269;
-                }
-            } else {
-                if(yych <= '>') {
-                    if(yych == '/') goto yy258;
-                } else {
-                    if(yych <= '?') goto yy268;
-                    if(yych >= 'd') goto yy258;
-                }
-            }
-        } else {
-            if(yych <= 'p') {
-                if(yych <= 'k') {
-                    if(yych == 'i') goto yy258;
-                } else {
-                    if(yych <= 'l') goto yy258;
-                    if(yych >= 'p') goto yy258;
-                }
-            } else {
-                if(yych <= 't') {
-                    if(yych == 'r') goto yy258;
-                } else {
-                    if(yych == 'v') goto yy47;
-                    if(yych <= 'w') goto yy258;
-                }
-            }
-        }
-yy47:
-#line 137 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_POUND); }
-#line 947 "strict_cpp_re.inc"
-yy48:
-        ++YYCURSOR;
-#line 145 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_LEFTPAREN); }
-#line 952 "strict_cpp_re.inc"
-yy50:
-        ++YYCURSOR;
-#line 146 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_RIGHTPAREN); }
-#line 957 "strict_cpp_re.inc"
-yy52:
-        ++YYCURSOR;
-#line 147 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_SEMICOLON); }
-#line 962 "strict_cpp_re.inc"
-yy54:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == '+') goto yy253;
-        if(yych == '=') goto yy255;
-#line 172 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_PLUS); }
-#line 969 "strict_cpp_re.inc"
-yy56:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) <= '<') {
-            if(yych == '-') goto yy247;
-        } else {
-            if(yych <= '=') goto yy249;
-            if(yych <= '>') goto yy245;
-        }
-#line 173 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_MINUS); }
-#line 980 "strict_cpp_re.inc"
-yy58:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == '=') goto yy243;
-#line 174 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_STAR); }
-#line 986 "strict_cpp_re.inc"
-yy60:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == '=') goto yy241;
-#line 177 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_XOR); }
-#line 992 "strict_cpp_re.inc"
-yy62:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'o') goto yy234;
-        goto yy192;
-yy63:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == '&') goto yy230;
-        if(yych == '=') goto yy232;
-#line 180 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_AND); }
-#line 1004 "strict_cpp_re.inc"
-yy65:
-        yyaccept = 4;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= '>') {
-            if(yych == '=') goto yy225;
-        } else {
-            if(yych <= '?') goto yy222;
-            if(yych == '|') goto yy223;
-        }
-yy66:
-#line 182 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_OR); }
-#line 1017 "strict_cpp_re.inc"
-yy67:
-        ++YYCURSOR;
-#line 185 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_COMPL); }
-#line 1022 "strict_cpp_re.inc"
-yy69:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == '=') goto yy220;
-#line 188 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_NOT); }
-#line 1028 "strict_cpp_re.inc"
-yy71:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == '=') goto yy218;
-#line 190 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_ASSIGN); }
-#line 1034 "strict_cpp_re.inc"
-yy73:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) <= '<') goto yy74;
-        if(yych <= '=') goto yy212;
-        if(yych <= '>') goto yy214;
-yy74:
-#line 192 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_GREATER); }
-#line 1043 "strict_cpp_re.inc"
-yy75:
-        ++YYCURSOR;
-#line 224 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_COMMA); }
-#line 1048 "strict_cpp_re.inc"
-yy77:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        goto yy192;
-yy78:
-        yyaccept = 1;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
-        }
-        if(yych <= '\'') {
-            if(yych == '"') goto yy94;
-            if(yych <= '&') goto yy10;
-            goto yy211;
-        } else {
-            if(yych <= '?') {
-                if(yych <= '>') goto yy10;
-                goto yy194;
-            } else {
-                if(yych == '\\') goto yy193;
-                goto yy10;
-            }
-        }
-yy79:
-        yyaccept = 5;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'U') goto yy183;
-        if(yych == 'u') goto yy182;
-yy80:
-#line 299 "strict_cpp.re"
-        {
-        /* if (0 != s->error_proc)
-            (*s->error_proc)(s, "Unexpected character: '%c'", *s->tok);
-        else
-            printf("unexpected character: '%c'\n", *s->tok);
-        */
-        BOOST_WAVE_RET(TOKEN_FROM_ID(*s->tok, UnknownTokenType));
-    }
-#line 1087 "strict_cpp_re.inc"
-yy81:
-        yyaccept = 5;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 0x0C) {
-            if(yych == 0x09) goto yy139;
-            if(yych <= 0x0A) goto yy80;
-            goto yy139;
-        } else {
-            if(yych <= 0x1F) goto yy80;
-            if(yych == '\'') goto yy80;
-            goto yy139;
-        }
-yy82:
-        yyaccept = 5;
-        yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 0x0A) {
-            if(yych == 0x09) goto yy95;
-            goto yy80;
-        } else {
-            if(yych <= 0x0C) goto yy95;
-            if(yych <= 0x1F) goto yy80;
-            goto yy95;
-        }
-yy83:
-        ++YYCURSOR;
-        yych = *YYCURSOR;
-        goto yy93;
-yy84:
-#line 276 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_SPACE); }
-#line 1118 "strict_cpp_re.inc"
-yy85:
-        ++YYCURSOR;
-yy86:
-#line 279 "strict_cpp.re"
-        {
-        s->line++;
-        cursor.column = 1;
-        BOOST_WAVE_RET(T_NEWLINE);
-    }
-#line 1128 "strict_cpp_re.inc"
-yy87:
-        yych = *++YYCURSOR;
-        if(yych == 0x0A) goto yy91;
-        goto yy86;
-yy88:
-        ++YYCURSOR;
-#line 286 "strict_cpp.re"
-        {
-        if(cursor != s->eof) 
-        {
-            using namespace std;      // some systems have printf in std
-            if (0 != s->error_proc)
-                (*s->error_proc)(s, "'\\000' in input stream");
-            else
-                printf("Error: 0 in file\n");
-        }
-        BOOST_WAVE_RET(T_EOF);
-    }
-#line 1147 "strict_cpp_re.inc"
-yy90:
-        yych = *++YYCURSOR;
-        goto yy80;
-yy91:
-        yych = *++YYCURSOR;
-        goto yy86;
-yy92:
-        ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-yy93:
-        if(yybm[256+yych] & 8) {
-            goto yy92;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        goto yy84;
-yy94:
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych <= '[') goto yy112;
+yy100:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-yy95:
-        if(yybm[256+yych] & 16) {
-            goto yy94;
-        }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych >= '\\') goto yy97;
-yy96:
-        ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
-        }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych <= '[') goto yy109;
-yy97:
-        ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
         if(yych <= '`') {
             if(yych <= '7') {
                 if(yych <= '&') {
-                    if(yych == '"') goto yy94;
-                    goto yy2;
+                    if(yych == '"') goto yy96;
+                    goto yy98;
                 } else {
-                    if(yych <= '\'') goto yy94;
-                    if(yych <= '/') goto yy2;
-                    goto yy104;
+                    if(yych <= '\'') goto yy96;
+                    if(yych <= '/') goto yy98;
+                    goto yy107;
                 }
             } else {
                 if(yych <= 'T') {
-                    if(yych == '?') goto yy102;
-                    goto yy2;
+                    if(yych == '?') goto yy105;
+                    goto yy98;
                 } else {
-                    if(yych <= 'U') goto yy101;
-                    if(yych == '\\') goto yy94;
-                    goto yy2;
+                    if(yych <= 'U') goto yy104;
+                    if(yych == '\\') goto yy96;
+                    goto yy98;
                 }
             }
         } else {
             if(yych <= 'r') {
                 if(yych <= 'f') {
-                    if(yych <= 'b') goto yy94;
-                    if(yych <= 'e') goto yy2;
-                    goto yy94;
+                    if(yych <= 'b') goto yy96;
+                    if(yych <= 'e') goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych == 'n') goto yy94;
-                    if(yych <= 'q') goto yy2;
-                    goto yy94;
+                    if(yych == 'n') goto yy96;
+                    if(yych <= 'q') goto yy98;
+                    goto yy96;
                 }
             } else {
                 if(yych <= 'u') {
-                    if(yych <= 's') goto yy2;
-                    if(yych <= 't') goto yy94;
-                    goto yy100;
+                    if(yych <= 's') goto yy98;
+                    if(yych <= 't') goto yy96;
+                    goto yy103;
                 } else {
-                    if(yych <= 'v') goto yy94;
-                    if(yych == 'x') goto yy103;
-                    goto yy2;
+                    if(yych <= 'v') goto yy96;
+                    if(yych == 'x') goto yy106;
+                    goto yy98;
                 }
             }
         }
-yy98:
+yy101:
         ++YYCURSOR;
-yy99:
-#line 246 "strict_cpp.re"
+yy102:
+#line 248 "strict_cpp.re"
         { BOOST_WAVE_RET(T_STRINGLIT); }
-#line 1236 "strict_cpp_re.inc"
-yy100:
+#line 1241 "strict_cpp_re.inc"
+yy103:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy135;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy138;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy135;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy135;
-            goto yy2;
+            if(yych <= 'F') goto yy138;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy138;
+            goto yy98;
         }
-yy101:
+yy104:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy128;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy131;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy128;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy128;
-            goto yy2;
+            if(yych <= 'F') goto yy131;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy131;
+            goto yy98;
         }
-yy102:
+yy105:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych <= '[') goto yy108;
-        goto yy97;
-yy103:
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych <= '[') goto yy111;
+        goto yy100;
+yy106:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 32) {
-            goto yy106;
+        if(yybm[256+yych] & 64) {
+            goto yy109;
         }
-        goto yy2;
-yy104:
+        goto yy98;
+yy107:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '"') {
             if(yych <= 0x0A) {
-                if(yych == 0x09) goto yy94;
-                goto yy2;
+                if(yych == 0x09) goto yy96;
+                goto yy98;
             } else {
-                if(yych <= 0x0C) goto yy94;
-                if(yych <= 0x1F) goto yy2;
-                if(yych <= '!') goto yy94;
-                goto yy98;
+                if(yych <= 0x0C) goto yy96;
+                if(yych <= 0x1F) goto yy98;
+                if(yych <= '!') goto yy96;
+                goto yy101;
             }
         } else {
             if(yych <= '>') {
-                if(yych <= '/') goto yy94;
-                if(yych >= '8') goto yy94;
+                if(yych <= '/') goto yy96;
+                if(yych >= '8') goto yy96;
             } else {
-                if(yych <= '?') goto yy96;
-                if(yych == '\\') goto yy97;
-                goto yy94;
+                if(yych <= '?') goto yy99;
+                if(yych == '\\') goto yy100;
+                goto yy96;
             }
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych <= '[') goto yy96;
-        goto yy97;
-yy106:
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych <= '[') goto yy99;
+        goto yy100;
+yy109:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 32) {
-            goto yy106;
+        if(yybm[256+yych] & 64) {
+            goto yy109;
         }
         if(yych <= '!') {
             if(yych <= 0x0A) {
-                if(yych == 0x09) goto yy94;
-                goto yy2;
+                if(yych == 0x09) goto yy96;
+                goto yy98;
             } else {
-                if(yych <= 0x0C) goto yy94;
-                if(yych <= 0x1F) goto yy2;
-                goto yy94;
+                if(yych <= 0x0C) goto yy96;
+                if(yych <= 0x1F) goto yy98;
+                goto yy96;
             }
         } else {
             if(yych <= '?') {
-                if(yych <= '"') goto yy98;
-                if(yych <= '>') goto yy94;
+                if(yych <= '"') goto yy101;
+                if(yych <= '>') goto yy96;
+                goto yy99;
+            } else {
+                if(yych == '\\') goto yy100;
                 goto yy96;
-            } else {
-                if(yych == '\\') goto yy97;
-                goto yy94;
             }
         }
-yy108:
+yy111:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych >= '\\') goto yy97;
-yy109:
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych >= '\\') goto yy100;
+yy112:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 64) {
-            goto yy109;
+        if(yybm[256+yych] & 128) {
+            goto yy112;
         }
         if(yych <= '!') {
             if(yych <= 0x0A) {
-                if(yych == 0x09) goto yy94;
-                goto yy2;
+                if(yych == 0x09) goto yy96;
+                goto yy98;
             } else {
-                if(yych <= 0x0C) goto yy94;
-                if(yych <= 0x1F) goto yy2;
-                goto yy94;
+                if(yych <= 0x0C) goto yy96;
+                if(yych <= 0x1F) goto yy98;
+                goto yy96;
             }
         } else {
             if(yych <= '/') {
-                if(yych <= '"') goto yy98;
-                if(yych <= '.') goto yy94;
+                if(yych <= '"') goto yy101;
+                if(yych <= '.') goto yy96;
             } else {
-                if(yych == '\\') goto yy97;
-                goto yy94;
+                if(yych == '\\') goto yy100;
+                goto yy96;
             }
         }
-yy111:
+yy114:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 128) {
-            goto yy111;
+        if(yybm[0+yych] & 1) {
+            goto yy114;
         }
         if(yych <= '7') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy115;
-                    if(yych <= '/') goto yy94;
-                    goto yy104;
+                    if(yych <= '"') goto yy118;
+                    if(yych <= '/') goto yy96;
+                    goto yy107;
                 }
             }
         } else {
             if(yych <= 'U') {
-                if(yych == '?') goto yy116;
-                if(yych <= 'T') goto yy94;
-                goto yy114;
+                if(yych == '?') goto yy119;
+                if(yych <= 'T') goto yy96;
+                goto yy117;
             } else {
                 if(yych <= 'u') {
-                    if(yych <= 't') goto yy94;
+                    if(yych <= 't') goto yy96;
                 } else {
-                    if(yych == 'x') goto yy106;
-                    goto yy94;
+                    if(yych == 'x') goto yy109;
+                    goto yy96;
                 }
             }
         }
@@ -1416,146 +1421,146 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
-                    goto yy125;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
+                    goto yy128;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
-                goto yy125;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
+                goto yy128;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych <= 'f') goto yy125;
-                    goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych <= 'f') goto yy128;
+                    goto yy96;
                 }
             }
         }
-yy114:
+yy117:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
-                    goto yy118;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
+                    goto yy121;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
-                goto yy118;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
+                goto yy121;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych <= 'f') goto yy118;
-                    goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych <= 'f') goto yy121;
+                    goto yy96;
                 }
             }
         }
-yy115:
+yy118:
         yyaccept = 6;
         YYMARKER = ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        if(yych <= '!') goto yy99;
-        if(yych <= '"') goto yy98;
-        if(yych <= '[') goto yy96;
-        goto yy97;
-yy116:
+        if(yych <= '!') goto yy102;
+        if(yych <= '"') goto yy101;
+        if(yych <= '[') goto yy99;
+        goto yy100;
+yy119:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych >= '\\') goto yy97;
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych >= '\\') goto yy100;
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 64) {
-            goto yy109;
+        if(yybm[256+yych] & 128) {
+            goto yy112;
         }
         if(yych <= '!') {
             if(yych <= 0x0A) {
-                if(yych == 0x09) goto yy94;
-                goto yy2;
+                if(yych == 0x09) goto yy96;
+                goto yy98;
             } else {
-                if(yych <= 0x0C) goto yy94;
-                if(yych <= 0x1F) goto yy2;
-                goto yy94;
+                if(yych <= 0x0C) goto yy96;
+                if(yych <= 0x1F) goto yy98;
+                goto yy96;
             }
         } else {
             if(yych <= '/') {
-                if(yych <= '"') goto yy98;
-                if(yych <= '.') goto yy94;
-                goto yy111;
+                if(yych <= '"') goto yy101;
+                if(yych <= '.') goto yy96;
+                goto yy114;
             } else {
-                if(yych == '\\') goto yy97;
-                goto yy94;
+                if(yych == '\\') goto yy100;
+                goto yy96;
             }
         }
-yy118:
+yy121:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
@@ -1564,29 +1569,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
@@ -1595,29 +1600,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
@@ -1626,29 +1631,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
@@ -1657,29 +1662,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
@@ -1688,71 +1693,71 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych <= '[') goto yy96;
-        goto yy97;
-yy125:
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych <= '[') goto yy99;
+        goto yy100;
+yy128:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
@@ -1761,230 +1766,230 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy94;
-                if(yych <= 0x0A) goto yy2;
-                goto yy94;
+                if(yych == 0x09) goto yy96;
+                if(yych <= 0x0A) goto yy98;
+                goto yy96;
             } else {
                 if(yych <= '!') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy94;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy96;
                 } else {
-                    if(yych <= '"') goto yy98;
-                    if(yych <= '/') goto yy94;
+                    if(yych <= '"') goto yy101;
+                    if(yych <= '/') goto yy96;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy96;
-                if(yych <= '@') goto yy94;
+                if(yych == '?') goto yy99;
+                if(yych <= '@') goto yy96;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy94;
-                    goto yy97;
+                    if(yych <= '[') goto yy96;
+                    goto yy100;
                 } else {
-                    if(yych <= '`') goto yy94;
-                    if(yych >= 'g') goto yy94;
+                    if(yych <= '`') goto yy96;
+                    if(yych >= 'g') goto yy96;
                 }
             }
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[256+yych] & 16) {
-            goto yy94;
+        if(yybm[256+yych] & 32) {
+            goto yy96;
         }
-        if(yych <= '!') goto yy2;
-        if(yych <= '"') goto yy98;
-        if(yych <= '[') goto yy96;
-        goto yy97;
-yy128:
+        if(yych <= '!') goto yy98;
+        if(yych <= '"') goto yy101;
+        if(yych <= '[') goto yy99;
+        goto yy100;
+yy131:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy129;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy132;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy129:
+yy132:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy130;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy133;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy130:
+yy133:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy131;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy134;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy131:
+yy134:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy132;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy135;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy132:
+yy135:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy133;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy136;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy133:
+yy136:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy134;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy137;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy134:
+yy137:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy94;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy96;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy94;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy94;
-            goto yy2;
+            if(yych <= 'F') goto yy96;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy96;
+            goto yy98;
         }
-yy135:
+yy138:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy136;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy139;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy136:
+yy139:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy137;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy140;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-yy137:
+yy140:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy94;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy96;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy94;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy94;
-            goto yy2;
+            if(yych <= 'F') goto yy96;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy96;
+            goto yy98;
         }
-yy138:
+yy141:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-yy139:
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+yy142:
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych >= '\\') goto yy141;
-yy140:
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych >= '\\') goto yy144;
+yy143:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych <= '[') goto yy153;
-yy141:
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych <= '[') goto yy156;
+yy144:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '`') {
             if(yych <= '7') {
                 if(yych <= '&') {
-                    if(yych == '"') goto yy138;
-                    goto yy2;
+                    if(yych == '"') goto yy141;
+                    goto yy98;
                 } else {
-                    if(yych <= '\'') goto yy138;
-                    if(yych <= '/') goto yy2;
-                    goto yy146;
+                    if(yych <= '\'') goto yy141;
+                    if(yych <= '/') goto yy98;
+                    goto yy149;
                 }
             } else {
                 if(yych <= 'T') {
-                    if(yych == '?') goto yy144;
-                    goto yy2;
+                    if(yych == '?') goto yy147;
+                    goto yy98;
                 } else {
-                    if(yych <= 'U') goto yy143;
-                    if(yych == '\\') goto yy138;
-                    goto yy2;
+                    if(yych <= 'U') goto yy146;
+                    if(yych == '\\') goto yy141;
+                    goto yy98;
                 }
             }
         } else {
             if(yych <= 'r') {
                 if(yych <= 'f') {
-                    if(yych <= 'b') goto yy138;
-                    if(yych <= 'e') goto yy2;
-                    goto yy138;
+                    if(yych <= 'b') goto yy141;
+                    if(yych <= 'e') goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych == 'n') goto yy138;
-                    if(yych <= 'q') goto yy2;
-                    goto yy138;
+                    if(yych == 'n') goto yy141;
+                    if(yych <= 'q') goto yy98;
+                    goto yy141;
                 }
             } else {
                 if(yych <= 'u') {
-                    if(yych <= 's') goto yy2;
-                    if(yych <= 't') goto yy138;
+                    if(yych <= 's') goto yy98;
+                    if(yych <= 't') goto yy141;
                 } else {
-                    if(yych <= 'v') goto yy138;
-                    if(yych == 'x') goto yy145;
-                    goto yy2;
+                    if(yych <= 'v') goto yy141;
+                    if(yych == 'x') goto yy148;
+                    goto yy98;
                 }
             }
         }
@@ -1992,202 +1997,202 @@
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy179;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy182;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy179;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy179;
-            goto yy2;
+            if(yych <= 'F') goto yy182;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy182;
+            goto yy98;
         }
-yy143:
+yy146:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy172;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy175;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy172;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy172;
-            goto yy2;
+            if(yych <= 'F') goto yy175;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy175;
+            goto yy98;
         }
-yy144:
+yy147:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych <= '[') goto yy152;
-        goto yy141;
-yy145:
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych <= '[') goto yy155;
+        goto yy144;
+yy148:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy150;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy153;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy150;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy150;
-            goto yy2;
+            if(yych <= 'F') goto yy153;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy153;
+            goto yy98;
         }
-yy146:
+yy149:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '\'') {
             if(yych <= 0x0A) {
-                if(yych == 0x09) goto yy138;
-                goto yy2;
+                if(yych == 0x09) goto yy141;
+                goto yy98;
             } else {
-                if(yych <= 0x0C) goto yy138;
-                if(yych <= 0x1F) goto yy2;
-                if(yych <= '&') goto yy138;
-                goto yy148;
+                if(yych <= 0x0C) goto yy141;
+                if(yych <= 0x1F) goto yy98;
+                if(yych <= '&') goto yy141;
+                goto yy151;
             }
         } else {
             if(yych <= '>') {
-                if(yych <= '/') goto yy138;
-                if(yych >= '8') goto yy138;
+                if(yych <= '/') goto yy141;
+                if(yych >= '8') goto yy141;
             } else {
-                if(yych <= '?') goto yy140;
-                if(yych == '\\') goto yy141;
-                goto yy138;
+                if(yych <= '?') goto yy143;
+                if(yych == '\\') goto yy144;
+                goto yy141;
             }
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych <= '[') goto yy140;
-        goto yy141;
-yy148:
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych <= '[') goto yy143;
+        goto yy144;
+yy151:
         ++YYCURSOR;
-yy149:
-#line 243 "strict_cpp.re"
+yy152:
+#line 245 "strict_cpp.re"
         { BOOST_WAVE_RET(T_CHARLIT); }
-#line 2083 "strict_cpp_re.inc"
-yy150:
+#line 2088 "strict_cpp_re.inc"
+yy153:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
-                    goto yy150;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
+                    goto yy153;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
-                goto yy150;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
+                goto yy153;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
+                } else {
+                    if(yych <= '`') goto yy141;
+                    if(yych <= 'f') goto yy153;
                     goto yy141;
-                } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych <= 'f') goto yy150;
-                    goto yy138;
                 }
             }
         }
-yy152:
+yy155:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych >= '\\') goto yy141;
-yy153:
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych >= '\\') goto yy144;
+yy156:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '\'') {
             if(yych <= 0x0A) {
-                if(yych == 0x09) goto yy138;
-                goto yy2;
+                if(yych == 0x09) goto yy141;
+                goto yy98;
             } else {
-                if(yych <= 0x0C) goto yy138;
-                if(yych <= 0x1F) goto yy2;
-                if(yych <= '&') goto yy138;
-                goto yy148;
+                if(yych <= 0x0C) goto yy141;
+                if(yych <= 0x1F) goto yy98;
+                if(yych <= '&') goto yy141;
+                goto yy151;
             }
         } else {
             if(yych <= '>') {
-                if(yych != '/') goto yy138;
+                if(yych != '/') goto yy141;
             } else {
-                if(yych <= '?') goto yy153;
-                if(yych == '\\') goto yy141;
-                goto yy138;
+                if(yych <= '?') goto yy156;
+                if(yych == '\\') goto yy144;
+                goto yy141;
             }
         }
-yy155:
+yy158:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '>') {
             if(yych <= 0x1F) {
                 if(yych <= 0x09) {
-                    if(yych <= 0x08) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x08) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= 0x0A) goto yy2;
-                    if(yych <= 0x0C) goto yy138;
-                    goto yy2;
+                    if(yych <= 0x0A) goto yy98;
+                    if(yych <= 0x0C) goto yy141;
+                    goto yy98;
                 }
             } else {
                 if(yych <= '\'') {
-                    if(yych <= '&') goto yy138;
-                    goto yy159;
+                    if(yych <= '&') goto yy141;
+                    goto yy162;
                 } else {
-                    if(yych <= '/') goto yy138;
-                    if(yych <= '7') goto yy146;
-                    goto yy138;
+                    if(yych <= '/') goto yy141;
+                    if(yych <= '7') goto yy149;
+                    goto yy141;
                 }
             }
         } else {
             if(yych <= '\\') {
                 if(yych <= 'T') {
-                    if(yych <= '?') goto yy160;
-                    goto yy138;
+                    if(yych <= '?') goto yy163;
+                    goto yy141;
                 } else {
-                    if(yych <= 'U') goto yy158;
-                    if(yych <= '[') goto yy138;
-                    goto yy155;
+                    if(yych <= 'U') goto yy161;
+                    if(yych <= '[') goto yy141;
+                    goto yy158;
                 }
             } else {
                 if(yych <= 'u') {
-                    if(yych <= 't') goto yy138;
+                    if(yych <= 't') goto yy141;
                 } else {
-                    if(yych == 'x') goto yy150;
-                    goto yy138;
+                    if(yych == 'x') goto yy153;
+                    goto yy141;
                 }
             }
         }
@@ -2196,144 +2201,144 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
-                    goto yy169;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
+                    goto yy172;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
-                goto yy169;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
+                goto yy172;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
+                } else {
+                    if(yych <= '`') goto yy141;
+                    if(yych <= 'f') goto yy172;
                     goto yy141;
-                } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych <= 'f') goto yy169;
-                    goto yy138;
                 }
             }
         }
-yy158:
+yy161:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
-                    goto yy162;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
+                    goto yy165;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
-                goto yy162;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
+                goto yy165;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
+                } else {
+                    if(yych <= '`') goto yy141;
+                    if(yych <= 'f') goto yy165;
                     goto yy141;
-                } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych <= 'f') goto yy162;
-                    goto yy138;
                 }
             }
         }
-yy159:
+yy162:
         yyaccept = 7;
         YYMARKER = ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy149;
-        if(yych <= '\'') goto yy148;
-        if(yych <= '[') goto yy140;
-        goto yy141;
-yy160:
+        if(yych <= '&') goto yy152;
+        if(yych <= '\'') goto yy151;
+        if(yych <= '[') goto yy143;
+        goto yy144;
+yy163:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych >= '\\') goto yy141;
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych >= '\\') goto yy144;
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '\'') {
             if(yych <= 0x0A) {
-                if(yych == 0x09) goto yy138;
-                goto yy2;
+                if(yych == 0x09) goto yy141;
+                goto yy98;
             } else {
-                if(yych <= 0x0C) goto yy138;
-                if(yych <= 0x1F) goto yy2;
-                if(yych <= '&') goto yy138;
-                goto yy148;
+                if(yych <= 0x0C) goto yy141;
+                if(yych <= 0x1F) goto yy98;
+                if(yych <= '&') goto yy141;
+                goto yy151;
             }
         } else {
             if(yych <= '>') {
-                if(yych == '/') goto yy155;
-                goto yy138;
+                if(yych == '/') goto yy158;
+                goto yy141;
             } else {
-                if(yych <= '?') goto yy153;
-                if(yych == '\\') goto yy141;
-                goto yy138;
+                if(yych <= '?') goto yy156;
+                if(yych == '\\') goto yy144;
+                goto yy141;
             }
         }
-yy162:
+yy165:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
@@ -2342,29 +2347,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
@@ -2373,29 +2378,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
@@ -2404,29 +2409,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
@@ -2435,29 +2440,29 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
@@ -2466,71 +2471,71 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych <= '[') goto yy140;
-        goto yy141;
-yy169:
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych <= '[') goto yy143;
+        goto yy144;
+yy172:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
@@ -2539,603 +2544,603 @@
         yych = *YYCURSOR;
         if(yych <= '9') {
             if(yych <= 0x0C) {
-                if(yych == 0x09) goto yy138;
-                if(yych <= 0x0A) goto yy2;
-                goto yy138;
+                if(yych == 0x09) goto yy141;
+                if(yych <= 0x0A) goto yy98;
+                goto yy141;
             } else {
                 if(yych <= '&') {
-                    if(yych <= 0x1F) goto yy2;
-                    goto yy138;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy141;
                 } else {
-                    if(yych <= '\'') goto yy148;
-                    if(yych <= '/') goto yy138;
+                    if(yych <= '\'') goto yy151;
+                    if(yych <= '/') goto yy141;
                 }
             }
         } else {
             if(yych <= 'F') {
-                if(yych == '?') goto yy140;
-                if(yych <= '@') goto yy138;
+                if(yych == '?') goto yy143;
+                if(yych <= '@') goto yy141;
             } else {
                 if(yych <= '\\') {
-                    if(yych <= '[') goto yy138;
-                    goto yy141;
+                    if(yych <= '[') goto yy141;
+                    goto yy144;
                 } else {
-                    if(yych <= '`') goto yy138;
-                    if(yych >= 'g') goto yy138;
+                    if(yych <= '`') goto yy141;
+                    if(yych >= 'g') goto yy141;
                 }
             }
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yybm[0+yych] & 1) {
-            goto yy138;
+        if(yybm[0+yych] & 2) {
+            goto yy141;
         }
-        if(yych <= '&') goto yy2;
-        if(yych <= '\'') goto yy148;
-        if(yych <= '[') goto yy140;
-        goto yy141;
-yy172:
-        ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
-        if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
-        } else {
-            if(yych <= 'F') goto yy173;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
-        }
-yy173:
-        ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
-        if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
-        } else {
-            if(yych <= 'F') goto yy174;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
-        }
-yy174:
-        ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
-        if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
-        } else {
-            if(yych <= 'F') goto yy175;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
-        }
+        if(yych <= '&') goto yy98;
+        if(yych <= '\'') goto yy151;
+        if(yych <= '[') goto yy143;
+        goto yy144;
 yy175:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy176;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy176:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy177;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy177:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy178;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy178:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy138;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy138;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy138;
-            goto yy2;
+            if(yych <= 'F') goto yy179;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy179:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy180;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy180:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy181;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy181:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy138;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy141;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy138;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy138;
-            goto yy2;
+            if(yych <= 'F') goto yy141;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy141;
+            goto yy98;
         }
 yy182:
-        yych = *++YYCURSOR;
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy208;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy208;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy208;
-            goto yy2;
+            if(yych <= 'F') goto yy183;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy183:
-        yych = *++YYCURSOR;
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy184;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy184:
-        yych = *++YYCURSOR;
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy141;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy185;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy141;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy141;
+            goto yy98;
         }
 yy185:
         yych = *++YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy211;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy186;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy211;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy211;
+            goto yy98;
         }
 yy186:
         yych = *++YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy187;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy187:
         yych = *++YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy188;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy188:
         yych = *++YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy189;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy189:
         yych = *++YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy190;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy190:
         yych = *++YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy191;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy191:
-        yyaccept = 1;
-        YYMARKER = ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
+        yych = *++YYCURSOR;
+        if(yych <= '@') {
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
+        } else {
+            if(yych <= 'F') goto yy192;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
+        }
 yy192:
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        yych = *++YYCURSOR;
+        if(yych <= '@') {
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
+        } else {
+            if(yych <= 'F') goto yy193;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
-        if(yych == '?') goto yy194;
-        if(yych != '\\') goto yy10;
 yy193:
-        ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
-        if(yych == 'U') goto yy197;
-        if(yych == 'u') goto yy196;
-        goto yy2;
+        yych = *++YYCURSOR;
+        if(yych <= '@') {
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
+        } else {
+            if(yych <= 'F') goto yy194;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
+        }
 yy194:
-        ++YYCURSOR;
+        yyaccept = 1;
+        YYMARKER = ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych != '?') goto yy2;
-        ++YYCURSOR;
-        if(YYLIMIT == YYCURSOR) YYFILL(1);
-        yych = *YYCURSOR;
-        if(yych == '/') goto yy193;
-        goto yy2;
+yy195:
+        if(yybm[0+yych] & 4) {
+            goto yy194;
+        }
+        if(yych == '?') goto yy197;
+        if(yych != '\\') goto yy9;
 yy196:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy205;
-            goto yy2;
-        } else {
-            if(yych <= 'F') goto yy205;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy205;
-            goto yy2;
-        }
+        if(yych == 'U') goto yy200;
+        if(yych == 'u') goto yy199;
+        goto yy98;
 yy197:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
-        } else {
-            if(yych <= 'F') goto yy198;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
-        }
-yy198:
+        if(yych != '?') goto yy98;
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
-        } else {
-            if(yych <= 'F') goto yy199;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
-        }
+        if(yych == '/') goto yy196;
+        goto yy98;
 yy199:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy208;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy200;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= 'F') goto yy208;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy208;
+            goto yy98;
         }
 yy200:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy201;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy201:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy202;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy202:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy203;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy203:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy204;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy204:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy191;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
-            if(yych <= 'F') goto yy191;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy191;
-            goto yy2;
+            if(yych <= 'F') goto yy205;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy205:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy206;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy206:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy207;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy207:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy191;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy194;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy191;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy191;
-            goto yy2;
+            if(yych <= 'F') goto yy194;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy194;
+            goto yy98;
         }
 yy208:
-        yych = *++YYCURSOR;
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy209;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy209:
-        yych = *++YYCURSOR;
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych >= ':') goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
         } else {
             if(yych <= 'F') goto yy210;
-            if(yych <= '`') goto yy2;
-            if(yych >= 'g') goto yy2;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
         }
 yy210:
-        yych = *++YYCURSOR;
+        ++YYCURSOR;
+        if(YYLIMIT == YYCURSOR) YYFILL(1);
+        yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy2;
-            if(yych <= '9') goto yy191;
-            goto yy2;
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy194;
+            goto yy98;
         } else {
-            if(yych <= 'F') goto yy191;
-            if(yych <= '`') goto yy2;
-            if(yych <= 'f') goto yy191;
-            goto yy2;
+            if(yych <= 'F') goto yy194;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy194;
+            goto yy98;
         }
 yy211:
         yych = *++YYCURSOR;
-        if(yych == '\'') goto yy2;
-        goto yy139;
+        if(yych <= '@') {
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
+        } else {
+            if(yych <= 'F') goto yy212;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
+        }
 yy212:
+        yych = *++YYCURSOR;
+        if(yych <= '@') {
+            if(yych <= '/') goto yy98;
+            if(yych >= ':') goto yy98;
+        } else {
+            if(yych <= 'F') goto yy213;
+            if(yych <= '`') goto yy98;
+            if(yych >= 'g') goto yy98;
+        }
+yy213:
+        yych = *++YYCURSOR;
+        if(yych <= '@') {
+            if(yych <= '/') goto yy98;
+            if(yych <= '9') goto yy194;
+            goto yy98;
+        } else {
+            if(yych <= 'F') goto yy194;
+            if(yych <= '`') goto yy98;
+            if(yych <= 'f') goto yy194;
+            goto yy98;
+        }
+yy214:
+        yych = *++YYCURSOR;
+        if(yych == '\'') goto yy98;
+        goto yy142;
+yy215:
         ++YYCURSOR;
-#line 214 "strict_cpp.re"
+#line 216 "strict_cpp.re"
         { BOOST_WAVE_RET(T_GREATEREQUAL); }
-#line 3013 "strict_cpp_re.inc"
-yy214:
+#line 3018 "strict_cpp_re.inc"
+yy217:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) == '=') goto yy216;
-#line 207 "strict_cpp.re"
+        if((yych = *YYCURSOR) == '=') goto yy219;
+#line 209 "strict_cpp.re"
         { BOOST_WAVE_RET(T_SHIFTRIGHT); }
-#line 3019 "strict_cpp_re.inc"
-yy216:
-        ++YYCURSOR;
-#line 208 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_SHIFTRIGHTASSIGN); }
 #line 3024 "strict_cpp_re.inc"
-yy218:
+yy219:
         ++YYCURSOR;
 #line 210 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_EQUAL); }
+        { BOOST_WAVE_RET(T_SHIFTRIGHTASSIGN); }
 #line 3029 "strict_cpp_re.inc"
-yy220:
+yy221:
         ++YYCURSOR;
-#line 211 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_NOTEQUAL); }
+#line 212 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_EQUAL); }
 #line 3034 "strict_cpp_re.inc"
-yy222:
-        yych = *++YYCURSOR;
-        if(yych == '?') goto yy227;
-        goto yy2;
 yy223:
         ++YYCURSOR;
-#line 217 "strict_cpp.re"
-        { BOOST_WAVE_RET(T_OROR); }
-#line 3043 "strict_cpp_re.inc"
+#line 213 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_NOTEQUAL); }
+#line 3039 "strict_cpp_re.inc"
 yy225:
+        yych = *++YYCURSOR;
+        if(yych == '?') goto yy230;
+        goto yy98;
+yy226:
         ++YYCURSOR;
-#line 203 "strict_cpp.re"
+#line 219 "strict_cpp.re"
+        { BOOST_WAVE_RET(T_OROR); }
+#line 3048 "strict_cpp_re.inc"
+yy228:
+        ++YYCURSOR;
+#line 205 "strict_cpp.re"
         { BOOST_WAVE_RET(T_ORASSIGN); }
-#line 3048 "strict_cpp_re.inc"
-yy227:
+#line 3053 "strict_cpp_re.inc"
+yy230:
         yych = *++YYCURSOR;
-        if(yych != '!') goto yy2;
+        if(yych != '!') goto yy98;
         ++YYCURSOR;
-#line 219 "strict_cpp.re"
+#line 221 "strict_cpp.re"
         { BOOST_WAVE_RET(T_OROR_TRIGRAPH); }
-#line 3055 "strict_cpp_re.inc"
-yy230:
+#line 3060 "strict_cpp_re.inc"
+yy233:
         ++YYCURSOR;
-#line 215 "strict_cpp.re"
+#line 217 "strict_cpp.re"
         { BOOST_WAVE_RET(T_ANDAND); }
-#line 3060 "strict_cpp_re.inc"
-yy232:
+#line 3065 "strict_cpp_re.inc"
+yy235:
         ++YYCURSOR;
-#line 201 "strict_cpp.re"
+#line 203 "strict_cpp.re"
         { BOOST_WAVE_RET(T_ANDASSIGN); }
-#line 3065 "strict_cpp_re.inc"
-yy234:
+#line 3070 "strict_cpp_re.inc"
+yy237:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 8;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= 'Z') {
             if(yych <= '>') {
-                if(yych <= '/') goto yy236;
-                if(yych <= '9') goto yy191;
+                if(yych <= '/') goto yy239;
+                if(yych <= '9') goto yy194;
             } else {
-                if(yych <= '?') goto yy194;
-                if(yych >= 'A') goto yy191;
+                if(yych <= '?') goto yy197;
+                if(yych >= 'A') goto yy194;
             }
         } else {
             if(yych <= '^') {
-                if(yych == '\\') goto yy193;
+                if(yych == '\\') goto yy196;
             } else {
-                if(yych <= '_') goto yy237;
-                if(yych <= '`') goto yy236;
-                if(yych <= 'z') goto yy191;
+                if(yych <= '_') goto yy240;
+                if(yych <= '`') goto yy239;
+                if(yych <= 'z') goto yy194;
             }
         }
-yy236:
-#line 179 "strict_cpp.re"
+yy239:
+#line 181 "strict_cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_XOR_ALT); }
-#line 3092 "strict_cpp_re.inc"
-yy237:
+#line 3097 "strict_cpp_re.inc"
+yy240:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'q') goto yy192;
+        if(yych != 'q') goto yy195;
         yyaccept = 9;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy240:
-#line 199 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy243:
+#line 201 "strict_cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_XORASSIGN_ALT); }
-#line 3110 "strict_cpp_re.inc"
-yy241:
+#line 3115 "strict_cpp_re.inc"
+yy244:
         ++YYCURSOR;
-#line 198 "strict_cpp.re"
+#line 200 "strict_cpp.re"
         { BOOST_WAVE_RET(T_XORASSIGN); }
-#line 3115 "strict_cpp_re.inc"
-yy243:
+#line 3120 "strict_cpp_re.inc"
+yy246:
         ++YYCURSOR;
-#line 195 "strict_cpp.re"
+#line 197 "strict_cpp.re"
         { BOOST_WAVE_RET(T_STARASSIGN); }
-#line 3120 "strict_cpp_re.inc"
-yy245:
+#line 3125 "strict_cpp_re.inc"
+yy248:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) == '*') goto yy251;
-#line 235 "strict_cpp.re"
+        if((yych = *YYCURSOR) == '*') goto yy254;
+#line 237 "strict_cpp.re"
         { BOOST_WAVE_RET(T_ARROW); }
-#line 3126 "strict_cpp_re.inc"
-yy247:
+#line 3131 "strict_cpp_re.inc"
+yy250:
         ++YYCURSOR;
-#line 223 "strict_cpp.re"
+#line 225 "strict_cpp.re"
         { BOOST_WAVE_RET(T_MINUSMINUS); }
-#line 3131 "strict_cpp_re.inc"
-yy249:
+#line 3136 "strict_cpp_re.inc"
+yy252:
         ++YYCURSOR;
-#line 194 "strict_cpp.re"
+#line 196 "strict_cpp.re"
         { BOOST_WAVE_RET(T_MINUSASSIGN); }
-#line 3136 "strict_cpp_re.inc"
-yy251:
+#line 3141 "strict_cpp_re.inc"
+yy254:
         ++YYCURSOR;
-#line 226 "strict_cpp.re"
+#line 228 "strict_cpp.re"
         { 
             if (s->act_in_c99_mode) {
                 --YYCURSOR;
@@ -3145,480 +3150,489 @@
                 BOOST_WAVE_RET(T_ARROWSTAR); 
             }
         }
-#line 3149 "strict_cpp_re.inc"
-yy253:
+#line 3154 "strict_cpp_re.inc"
+yy256:
         ++YYCURSOR;
-#line 222 "strict_cpp.re"
+#line 224 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PLUSPLUS); }
-#line 3154 "strict_cpp_re.inc"
-yy255:
+#line 3159 "strict_cpp_re.inc"
+yy258:
         ++YYCURSOR;
-#line 193 "strict_cpp.re"
+#line 195 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PLUSASSIGN); }
-#line 3159 "strict_cpp_re.inc"
-yy257:
+#line 3164 "strict_cpp_re.inc"
+yy260:
         ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 12) YYFILL(12);
         yych = *YYCURSOR;
-yy258:
-        if(yybm[0+yych] & 4) {
-            goto yy257;
-        }
-        if(yych <= 'l') {
-            if(yych <= 'd') {
-                if(yych == '/') goto yy259;
-                if(yych <= 'c') goto yy2;
-                goto yy266;
+yy261:
+        if(yych <= 'h') {
+            if(yych <= ' ') {
+                if(yych <= 0x0A) {
+                    if(yych == 0x09) goto yy260;
+                    goto yy98;
+                } else {
+                    if(yych <= 0x0C) goto yy260;
+                    if(yych <= 0x1F) goto yy98;
+                    goto yy260;
+                }
             } else {
-                if(yych <= 'h') {
-                    if(yych <= 'e') goto yy260;
-                    goto yy2;
+                if(yych <= 'c') {
+                    if(yych != '/') goto yy98;
                 } else {
-                    if(yych <= 'i') goto yy267;
-                    if(yych <= 'k') goto yy2;
-                    goto yy264;
+                    if(yych <= 'd') goto yy269;
+                    if(yych <= 'e') goto yy263;
+                    goto yy98;
                 }
             }
         } else {
-            if(yych <= 'r') {
-                if(yych == 'p') goto yy263;
-                if(yych <= 'q') goto yy2;
-                goto yy261;
+            if(yych <= 'q') {
+                if(yych <= 'l') {
+                    if(yych <= 'i') goto yy270;
+                    if(yych <= 'k') goto yy98;
+                    goto yy267;
+                } else {
+                    if(yych == 'p') goto yy266;
+                    goto yy98;
+                }
             } else {
                 if(yych <= 'u') {
-                    if(yych <= 't') goto yy2;
-                    goto yy265;
+                    if(yych <= 'r') goto yy264;
+                    if(yych <= 't') goto yy98;
+                    goto yy268;
                 } else {
-                    if(yych == 'w') goto yy262;
-                    goto yy2;
+                    if(yych == 'w') goto yy265;
+                    goto yy98;
                 }
             }
         }
-yy259:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych == '*') goto yy374;
-        goto yy2;
-yy260:
+        if(yych == '*') goto yy377;
+        goto yy98;
+yy263:
         yych = *++YYCURSOR;
         if(yych <= 'm') {
-            if(yych == 'l') goto yy350;
-            goto yy2;
+            if(yych == 'l') goto yy353;
+            goto yy98;
         } else {
-            if(yych <= 'n') goto yy351;
-            if(yych == 'r') goto yy352;
-            goto yy2;
+            if(yych <= 'n') goto yy354;
+            if(yych == 'r') goto yy355;
+            goto yy98;
         }
-yy261:
-        yych = *++YYCURSOR;
-        if(yych == 'e') goto yy344;
-        goto yy2;
-yy262:
-        yych = *++YYCURSOR;
-        if(yych == 'a') goto yy337;
-        goto yy2;
-yy263:
-        yych = *++YYCURSOR;
-        if(yych == 'r') goto yy331;
-        goto yy2;
 yy264:
         yych = *++YYCURSOR;
-        if(yych == 'i') goto yy327;
-        goto yy2;
+        if(yych == 'e') goto yy347;
+        goto yy98;
 yy265:
         yych = *++YYCURSOR;
-        if(yych == 'n') goto yy322;
-        goto yy2;
+        if(yych == 'a') goto yy340;
+        goto yy98;
 yy266:
         yych = *++YYCURSOR;
-        if(yych == 'e') goto yy316;
-        goto yy2;
+        if(yych == 'r') goto yy334;
+        goto yy98;
 yy267:
         yych = *++YYCURSOR;
-        if(yych == 'f') goto yy275;
-        if(yych == 'n') goto yy274;
-        goto yy2;
+        if(yych == 'i') goto yy330;
+        goto yy98;
 yy268:
         yych = *++YYCURSOR;
-        if(yych == '?') goto yy271;
-        goto yy2;
+        if(yych == 'n') goto yy325;
+        goto yy98;
 yy269:
+        yych = *++YYCURSOR;
+        if(yych == 'e') goto yy319;
+        goto yy98;
+yy270:
+        yych = *++YYCURSOR;
+        if(yych == 'f') goto yy278;
+        if(yych == 'n') goto yy277;
+        goto yy98;
+yy271:
+        yych = *++YYCURSOR;
+        if(yych == '?') goto yy274;
+        goto yy98;
+yy272:
         ++YYCURSOR;
-#line 140 "strict_cpp.re"
+#line 142 "strict_cpp.re"
         { BOOST_WAVE_RET(T_POUND_POUND); }
-#line 3251 "strict_cpp_re.inc"
-yy271:
+#line 3262 "strict_cpp_re.inc"
+yy274:
         yych = *++YYCURSOR;
-        if(yych != '=') goto yy2;
+        if(yych != '=') goto yy98;
         ++YYCURSOR;
-#line 141 "strict_cpp.re"
+#line 143 "strict_cpp.re"
         { BOOST_WAVE_RET(T_POUND_POUND_TRIGRAPH); }
-#line 3258 "strict_cpp_re.inc"
-yy274:
+#line 3269 "strict_cpp_re.inc"
+yy277:
         yych = *++YYCURSOR;
-        if(yych == 'c') goto yy286;
-        goto yy2;
-yy275:
+        if(yych == 'c') goto yy289;
+        goto yy98;
+yy278:
         yyaccept = 10;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'd') goto yy278;
-        if(yych == 'n') goto yy277;
-yy276:
-#line 258 "strict_cpp.re"
+        if(yych == 'd') goto yy281;
+        if(yych == 'n') goto yy280;
+yy279:
+#line 260 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_IF); }
-#line 3271 "strict_cpp_re.inc"
-yy277:
+#line 3282 "strict_cpp_re.inc"
+yy280:
         yych = *++YYCURSOR;
-        if(yych == 'd') goto yy282;
-        goto yy2;
-yy278:
+        if(yych == 'd') goto yy285;
+        goto yy98;
+yy281:
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'f') goto yy2;
+        if(yych != 'f') goto yy98;
         ++YYCURSOR;
-#line 259 "strict_cpp.re"
+#line 261 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_IFDEF); }
-#line 3284 "strict_cpp_re.inc"
-yy282:
+#line 3295 "strict_cpp_re.inc"
+yy285:
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'f') goto yy2;
+        if(yych != 'f') goto yy98;
         ++YYCURSOR;
-#line 260 "strict_cpp.re"
+#line 262 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_IFNDEF); }
-#line 3293 "strict_cpp_re.inc"
-yy286:
+#line 3304 "strict_cpp_re.inc"
+yy289:
         yych = *++YYCURSOR;
-        if(yych != 'l') goto yy2;
+        if(yych != 'l') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'u') goto yy2;
+        if(yych != 'u') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'd') goto yy2;
+        if(yych != 'd') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         yyaccept = 11;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == '_') goto yy292;
-        goto yy294;
-yy291:
-#line 256 "strict_cpp.re"
+        if(yych == '_') goto yy295;
+        goto yy297;
+yy294:
+#line 258 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_INCLUDE); }
-#line 3310 "strict_cpp_re.inc"
-yy292:
+#line 3321 "strict_cpp_re.inc"
+yy295:
         yych = *++YYCURSOR;
-        if(yych == 'n') goto yy313;
-        goto yy2;
-yy293:
+        if(yych == 'n') goto yy316;
+        goto yy98;
+yy296:
         yyaccept = 11;
         YYMARKER = ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 2) YYFILL(2);
         yych = *YYCURSOR;
-yy294:
-        if(yych <= '!') {
-            if(yych <= 0x09) {
-                if(yych <= 0x08) goto yy291;
-                goto yy293;
+yy297:
+        if(yych <= ' ') {
+            if(yych <= 0x0A) {
+                if(yych == 0x09) goto yy296;
+                goto yy294;
             } else {
-                if(yych == ' ') goto yy293;
-                goto yy291;
+                if(yych <= 0x0C) goto yy296;
+                if(yych <= 0x1F) goto yy294;
+                goto yy296;
             }
         } else {
-            if(yych <= '/') {
-                if(yych <= '"') goto yy297;
-                if(yych <= '.') goto yy291;
+            if(yych <= '.') {
+                if(yych == '"') goto yy300;
+                goto yy294;
             } else {
-                if(yych == '<') goto yy296;
-                goto yy291;
+                if(yych <= '/') goto yy298;
+                if(yych == '<') goto yy299;
+                goto yy294;
             }
         }
+yy298:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych == '*') goto yy306;
-        goto yy2;
-yy296:
+        if(yych == '*') goto yy309;
+        goto yy98;
+yy299:
         yych = *++YYCURSOR;
-        if(yych == '>') goto yy2;
-        goto yy303;
-yy297:
+        if(yych == '>') goto yy98;
+        goto yy306;
+yy300:
         yych = *++YYCURSOR;
-        if(yych == '"') goto yy2;
-        goto yy299;
-yy298:
+        if(yych == '"') goto yy98;
+        goto yy302;
+yy301:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-yy299:
+yy302:
         if(yybm[0+yych] & 8) {
-            goto yy298;
+            goto yy301;
         }
-        if(yych <= '!') goto yy2;
+        if(yych <= '!') goto yy98;
         ++YYCURSOR;
-#line 253 "strict_cpp.re"
+#line 255 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_QHEADER); }
-#line 3363 "strict_cpp_re.inc"
-yy302:
+#line 3377 "strict_cpp_re.inc"
+yy305:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-yy303:
+yy306:
         if(yybm[0+yych] & 16) {
-            goto yy302;
+            goto yy305;
         }
-        if(yych <= '=') goto yy2;
+        if(yych <= '=') goto yy98;
         ++YYCURSOR;
-#line 250 "strict_cpp.re"
+#line 252 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_HHEADER); }
-#line 3376 "strict_cpp_re.inc"
-yy306:
+#line 3390 "strict_cpp_re.inc"
+yy309:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 32) {
-            goto yy306;
+            goto yy309;
         }
-        if(yych == 0x0D) goto yy308;
-        if(yych <= ')') goto yy2;
-        goto yy310;
-yy308:
+        if(yych == 0x0D) goto yy311;
+        if(yych <= ')') goto yy98;
+        goto yy313;
+yy311:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 32) {
-            goto yy306;
+            goto yy309;
         }
-        if(yych == 0x0D) goto yy308;
-        if(yych <= ')') goto yy2;
-yy310:
+        if(yych == 0x0D) goto yy311;
+        if(yych <= ')') goto yy98;
+yy313:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 128) {
-            goto yy310;
+            goto yy313;
         }
         if(yych <= 0x0D) {
-            if(yych <= 0x08) goto yy2;
-            if(yych <= 0x0C) goto yy306;
+            if(yych <= 0x08) goto yy98;
+            if(yych <= 0x0C) goto yy309;
         } else {
-            if(yych <= 0x1F) goto yy2;
-            if(yych == '/') goto yy293;
-            goto yy306;
+            if(yych <= 0x1F) goto yy98;
+            if(yych == '/') goto yy296;
+            goto yy309;
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 32) {
-            goto yy306;
+            goto yy309;
         }
-        if(yych == 0x0D) goto yy308;
-        if(yych <= ')') goto yy2;
-        goto yy310;
-yy313:
+        if(yych == 0x0D) goto yy311;
+        if(yych <= ')') goto yy98;
+        goto yy313;
+yy316:
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'x') goto yy2;
+        if(yych != 'x') goto yy98;
         yych = *++YYCURSOR;
-        if(yych == 't') goto yy293;
-        goto yy2;
-yy316:
+        if(yych == 't') goto yy296;
+        goto yy98;
+yy319:
         yych = *++YYCURSOR;
-        if(yych != 'f') goto yy2;
+        if(yych != 'f') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'i') goto yy2;
+        if(yych != 'i') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'n') goto yy2;
+        if(yych != 'n') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         ++YYCURSOR;
-#line 264 "strict_cpp.re"
+#line 266 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_DEFINE); }
-#line 3440 "strict_cpp_re.inc"
-yy322:
+#line 3454 "strict_cpp_re.inc"
+yy325:
         yych = *++YYCURSOR;
-        if(yych != 'd') goto yy2;
+        if(yych != 'd') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'f') goto yy2;
+        if(yych != 'f') goto yy98;
         ++YYCURSOR;
-#line 265 "strict_cpp.re"
+#line 267 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_UNDEF); }
-#line 3451 "strict_cpp_re.inc"
-yy327:
+#line 3465 "strict_cpp_re.inc"
+yy330:
         yych = *++YYCURSOR;
-        if(yych != 'n') goto yy2;
+        if(yych != 'n') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         ++YYCURSOR;
-#line 266 "strict_cpp.re"
+#line 268 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_LINE); }
-#line 3460 "strict_cpp_re.inc"
-yy331:
+#line 3474 "strict_cpp_re.inc"
+yy334:
         yych = *++YYCURSOR;
-        if(yych != 'a') goto yy2;
+        if(yych != 'a') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'g') goto yy2;
+        if(yych != 'g') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'm') goto yy2;
+        if(yych != 'm') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'a') goto yy2;
+        if(yych != 'a') goto yy98;
         ++YYCURSOR;
-#line 268 "strict_cpp.re"
+#line 270 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_PRAGMA); }
-#line 3473 "strict_cpp_re.inc"
-yy337:
+#line 3487 "strict_cpp_re.inc"
+yy340:
         yych = *++YYCURSOR;
-        if(yych != 'r') goto yy2;
+        if(yych != 'r') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'n') goto yy2;
+        if(yych != 'n') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'i') goto yy2;
+        if(yych != 'i') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'n') goto yy2;
+        if(yych != 'n') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'g') goto yy2;
+        if(yych != 'g') goto yy98;
         ++YYCURSOR;
-#line 270 "strict_cpp.re"
+#line 272 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_WARNING); }
-#line 3488 "strict_cpp_re.inc"
-yy344:
+#line 3502 "strict_cpp_re.inc"
+yy347:
         yych = *++YYCURSOR;
-        if(yych != 'g') goto yy2;
+        if(yych != 'g') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'i') goto yy2;
+        if(yych != 'i') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'o') goto yy2;
+        if(yych != 'o') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'n') goto yy2;
+        if(yych != 'n') goto yy98;
         ++YYCURSOR;
-#line 272 "strict_cpp.re"
+#line 274 "strict_cpp.re"
         { BOOST_WAVE_RET(T_MSEXT_PP_REGION); }
-#line 3501 "strict_cpp_re.inc"
-yy350:
+#line 3515 "strict_cpp_re.inc"
+yy353:
         yych = *++YYCURSOR;
-        if(yych == 'i') goto yy368;
-        if(yych == 's') goto yy369;
-        goto yy2;
-yy351:
+        if(yych == 'i') goto yy371;
+        if(yych == 's') goto yy372;
+        goto yy98;
+yy354:
         yych = *++YYCURSOR;
-        if(yych == 'd') goto yy357;
-        goto yy2;
-yy352:
+        if(yych == 'd') goto yy360;
+        goto yy98;
+yy355:
         yych = *++YYCURSOR;
-        if(yych != 'r') goto yy2;
+        if(yych != 'r') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'o') goto yy2;
+        if(yych != 'o') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'r') goto yy2;
+        if(yych != 'r') goto yy98;
         ++YYCURSOR;
-#line 267 "strict_cpp.re"
+#line 269 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_ERROR); }
-#line 3521 "strict_cpp_re.inc"
-yy357:
+#line 3535 "strict_cpp_re.inc"
+yy360:
         yych = *++YYCURSOR;
-        if(yych == 'i') goto yy358;
-        if(yych == 'r') goto yy359;
-        goto yy2;
-yy358:
+        if(yych == 'i') goto yy361;
+        if(yych == 'r') goto yy362;
+        goto yy98;
+yy361:
         yych = *++YYCURSOR;
-        if(yych == 'f') goto yy366;
-        goto yy2;
-yy359:
+        if(yych == 'f') goto yy369;
+        goto yy98;
+yy362:
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'g') goto yy2;
+        if(yych != 'g') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'i') goto yy2;
+        if(yych != 'i') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'o') goto yy2;
+        if(yych != 'o') goto yy98;
         yych = *++YYCURSOR;
-        if(yych != 'n') goto yy2;
+        if(yych != 'n') goto yy98;
         ++YYCURSOR;
-#line 273 "strict_cpp.re"
+#line 275 "strict_cpp.re"
         { BOOST_WAVE_RET(T_MSEXT_PP_ENDREGION); }
-#line 3545 "strict_cpp_re.inc"
-yy366:
+#line 3559 "strict_cpp_re.inc"
+yy369:
         ++YYCURSOR;
-#line 263 "strict_cpp.re"
+#line 265 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_ENDIF); }
-#line 3550 "strict_cpp_re.inc"
-yy368:
+#line 3564 "strict_cpp_re.inc"
+yy371:
         yych = *++YYCURSOR;
-        if(yych == 'f') goto yy372;
-        goto yy2;
-yy369:
+        if(yych == 'f') goto yy375;
+        goto yy98;
+yy372:
         yych = *++YYCURSOR;
-        if(yych != 'e') goto yy2;
+        if(yych != 'e') goto yy98;
         ++YYCURSOR;
-#line 261 "strict_cpp.re"
+#line 263 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_ELSE); }
-#line 3561 "strict_cpp_re.inc"
-yy372:
+#line 3575 "strict_cpp_re.inc"
+yy375:
         ++YYCURSOR;
-#line 262 "strict_cpp.re"
+#line 264 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_ELIF); }
-#line 3566 "strict_cpp_re.inc"
-yy374:
+#line 3580 "strict_cpp_re.inc"
+yy377:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= 0x0D) {
-            if(yych <= 0x08) goto yy2;
-            if(yych <= 0x0C) goto yy374;
+            if(yych <= 0x08) goto yy98;
+            if(yych <= 0x0C) goto yy377;
         } else {
-            if(yych <= 0x1F) goto yy2;
-            if(yych == '*') goto yy378;
-            goto yy374;
+            if(yych <= 0x1F) goto yy98;
+            if(yych == '*') goto yy381;
+            goto yy377;
         }
-yy376:
+yy379:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= 0x0D) {
-            if(yych <= 0x08) goto yy2;
-            if(yych <= 0x0C) goto yy374;
-            goto yy376;
+            if(yych <= 0x08) goto yy98;
+            if(yych <= 0x0C) goto yy377;
+            goto yy379;
         } else {
-            if(yych <= 0x1F) goto yy2;
-            if(yych != '*') goto yy374;
+            if(yych <= 0x1F) goto yy98;
+            if(yych != '*') goto yy377;
         }
-yy378:
+yy381:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= 0x1F) {
-            if(yych <= 0x08) goto yy2;
-            if(yych <= 0x0C) goto yy374;
-            if(yych >= 0x0E) goto yy2;
+            if(yych <= 0x08) goto yy98;
+            if(yych <= 0x0C) goto yy377;
+            if(yych >= 0x0E) goto yy98;
         } else {
             if(yych <= '*') {
-                if(yych <= ')') goto yy374;
-                goto yy378;
+                if(yych <= ')') goto yy377;
+                goto yy381;
             } else {
-                if(yych == '/') goto yy257;
-                goto yy374;
+                if(yych == '/') goto yy260;
+                goto yy377;
             }
         }
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= 0x0D) {
-            if(yych <= 0x08) goto yy2;
-            if(yych <= 0x0C) goto yy374;
-            goto yy376;
+            if(yych <= 0x08) goto yy98;
+            if(yych <= 0x0C) goto yy377;
+            goto yy379;
         } else {
-            if(yych <= 0x1F) goto yy2;
-            if(yych == '*') goto yy378;
-            goto yy374;
+            if(yych <= 0x1F) goto yy98;
+            if(yych == '*') goto yy381;
+            goto yy377;
         }
-yy381:
+yy384:
         ++YYCURSOR;
-#line 152 "strict_cpp.re"
+#line 154 "strict_cpp.re"
         { 
             if (s->act_in_c99_mode) {
                 --YYCURSOR;
@@ -3628,2411 +3642,2412 @@
                 BOOST_WAVE_RET(T_COLON_COLON); 
             }
         }
-#line 3632 "strict_cpp_re.inc"
-yy383:
+#line 3646 "strict_cpp_re.inc"
+yy386:
         ++YYCURSOR;
-#line 136 "strict_cpp.re"
+#line 138 "strict_cpp.re"
         { BOOST_WAVE_RET(T_RIGHTBRACKET_ALT); }
-#line 3637 "strict_cpp_re.inc"
-yy385:
+#line 3651 "strict_cpp_re.inc"
+yy388:
         yyaccept = 12;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'h') {
-            if(yych <= '$') {
-                if(yych <= 0x09) {
-                    if(yych >= 0x09) goto yy258;
+        if(yych <= 'e') {
+            if(yych <= ' ') {
+                if(yych <= 0x0A) {
+                    if(yych == 0x09) goto yy261;
                 } else {
-                    if(yych == ' ') goto yy258;
+                    if(yych <= 0x0C) goto yy261;
+                    if(yych >= ' ') goto yy261;
                 }
             } else {
-                if(yych <= '/') {
-                    if(yych <= '%') goto yy391;
-                    if(yych >= '/') goto yy258;
+                if(yych <= '.') {
+                    if(yych == '%') goto yy394;
                 } else {
-                    if(yych <= 'c') goto yy386;
-                    if(yych <= 'e') goto yy258;
+                    if(yych <= '/') goto yy261;
+                    if(yych >= 'd') goto yy261;
                 }
             }
         } else {
-            if(yych <= 'q') {
-                if(yych <= 'l') {
-                    if(yych <= 'i') goto yy258;
-                    if(yych >= 'l') goto yy258;
+            if(yych <= 'p') {
+                if(yych <= 'k') {
+                    if(yych == 'i') goto yy261;
                 } else {
-                    if(yych == 'p') goto yy258;
+                    if(yych <= 'l') goto yy261;
+                    if(yych >= 'p') goto yy261;
                 }
             } else {
-                if(yych <= 'u') {
-                    if(yych <= 'r') goto yy258;
-                    if(yych >= 'u') goto yy258;
+                if(yych <= 't') {
+                    if(yych == 'r') goto yy261;
                 } else {
-                    if(yych == 'w') goto yy258;
+                    if(yych == 'v') goto yy389;
+                    if(yych <= 'w') goto yy261;
                 }
             }
         }
-yy386:
-#line 138 "strict_cpp.re"
+yy389:
+#line 140 "strict_cpp.re"
         { BOOST_WAVE_RET(T_POUND_ALT); }
-#line 3677 "strict_cpp_re.inc"
-yy387:
+#line 3691 "strict_cpp_re.inc"
+yy390:
         ++YYCURSOR;
-#line 197 "strict_cpp.re"
+#line 199 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PERCENTASSIGN); }
-#line 3682 "strict_cpp_re.inc"
-yy389:
+#line 3696 "strict_cpp_re.inc"
+yy392:
         ++YYCURSOR;
-#line 130 "strict_cpp.re"
+#line 132 "strict_cpp.re"
         { BOOST_WAVE_RET(T_RIGHTBRACE_ALT); }
-#line 3687 "strict_cpp_re.inc"
-yy391:
+#line 3701 "strict_cpp_re.inc"
+yy394:
         yych = *++YYCURSOR;
-        if(yych != ':') goto yy2;
+        if(yych != ':') goto yy98;
         ++YYCURSOR;
-#line 144 "strict_cpp.re"
+#line 146 "strict_cpp.re"
         { BOOST_WAVE_RET(T_POUND_POUND_ALT); }
-#line 3694 "strict_cpp_re.inc"
-yy394:
+#line 3708 "strict_cpp_re.inc"
+yy397:
         ++YYCURSOR;
-#line 213 "strict_cpp.re"
+#line 215 "strict_cpp.re"
         { BOOST_WAVE_RET(T_LESSEQUAL); }
-#line 3699 "strict_cpp_re.inc"
-yy396:
+#line 3713 "strict_cpp_re.inc"
+yy399:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) == '=') goto yy402;
-#line 206 "strict_cpp.re"
+        if((yych = *YYCURSOR) == '=') goto yy405;
+#line 208 "strict_cpp.re"
         { BOOST_WAVE_RET(T_SHIFTLEFT); }
-#line 3705 "strict_cpp_re.inc"
-yy398:
+#line 3719 "strict_cpp_re.inc"
+yy401:
         ++YYCURSOR;
-#line 133 "strict_cpp.re"
+#line 135 "strict_cpp.re"
         { BOOST_WAVE_RET(T_LEFTBRACKET_ALT); }
-#line 3710 "strict_cpp_re.inc"
-yy400:
+#line 3724 "strict_cpp_re.inc"
+yy403:
         ++YYCURSOR;
-#line 127 "strict_cpp.re"
+#line 129 "strict_cpp.re"
         { BOOST_WAVE_RET(T_LEFTBRACE_ALT); }
-#line 3715 "strict_cpp_re.inc"
-yy402:
+#line 3729 "strict_cpp_re.inc"
+yy405:
         ++YYCURSOR;
-#line 209 "strict_cpp.re"
+#line 211 "strict_cpp.re"
         { BOOST_WAVE_RET(T_SHIFTLEFTASSIGN); }
-#line 3720 "strict_cpp_re.inc"
-yy404:
+#line 3734 "strict_cpp_re.inc"
+yy407:
         yych = *++YYCURSOR;
-        switch(yych){
-        case '!':   goto yy417;
-        case '\'':  goto yy415;
-        case '(':   goto yy409;
-        case ')':   goto yy411;
-        case '-':   goto yy419;
-        case '/':   goto yy421;
-        case '<':   goto yy405;
-        case '=':   goto yy413;
-        case '>':   goto yy407;
-        default:    goto yy2;
+        switch(yych) {
+        case '!':    goto yy420;
+        case '\'':    goto yy418;
+        case '(':    goto yy412;
+        case ')':    goto yy414;
+        case '-':    goto yy422;
+        case '/':    goto yy424;
+        case '<':    goto yy408;
+        case '=':    goto yy416;
+        case '>':    goto yy410;
+        default:    goto yy98;
         }
-yy405:
+yy408:
         ++YYCURSOR;
-#line 126 "strict_cpp.re"
+#line 128 "strict_cpp.re"
         { BOOST_WAVE_RET(T_LEFTBRACE_TRIGRAPH); }
-#line 3739 "strict_cpp_re.inc"
-yy407:
+#line 3753 "strict_cpp_re.inc"
+yy410:
         ++YYCURSOR;
-#line 129 "strict_cpp.re"
+#line 131 "strict_cpp.re"
         { BOOST_WAVE_RET(T_RIGHTBRACE_TRIGRAPH); }
-#line 3744 "strict_cpp_re.inc"
-yy409:
+#line 3758 "strict_cpp_re.inc"
+yy412:
         ++YYCURSOR;
-#line 132 "strict_cpp.re"
+#line 134 "strict_cpp.re"
         { BOOST_WAVE_RET(T_LEFTBRACKET_TRIGRAPH); }
-#line 3749 "strict_cpp_re.inc"
-yy411:
+#line 3763 "strict_cpp_re.inc"
+yy414:
         ++YYCURSOR;
-#line 135 "strict_cpp.re"
+#line 137 "strict_cpp.re"
         { BOOST_WAVE_RET(T_RIGHTBRACKET_TRIGRAPH); }
-#line 3754 "strict_cpp_re.inc"
-yy413:
+#line 3768 "strict_cpp_re.inc"
+yy416:
         yyaccept = 13;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'e') {
-            if(yych <= '#') {
-                if(yych <= 0x1F) {
-                    if(yych == 0x09) goto yy258;
+        if(yych <= 'c') {
+            if(yych <= ' ') {
+                if(yych <= 0x0A) {
+                    if(yych == 0x09) goto yy261;
                 } else {
-                    if(yych <= ' ') goto yy258;
-                    if(yych >= '#') goto yy434;
+                    if(yych <= 0x0C) goto yy261;
+                    if(yych >= ' ') goto yy261;
                 }
             } else {
-                if(yych <= '>') {
-                    if(yych == '/') goto yy258;
+                if(yych <= '.') {
+                    if(yych == '#') goto yy437;
                 } else {
-                    if(yych <= '?') goto yy433;
-                    if(yych >= 'd') goto yy258;
+                    if(yych <= '/') goto yy261;
+                    if(yych == '?') goto yy436;
                 }
             }
         } else {
             if(yych <= 'p') {
-                if(yych <= 'k') {
-                    if(yych == 'i') goto yy258;
+                if(yych <= 'i') {
+                    if(yych <= 'e') goto yy261;
+                    if(yych >= 'i') goto yy261;
                 } else {
-                    if(yych <= 'l') goto yy258;
-                    if(yych >= 'p') goto yy258;
+                    if(yych == 'l') goto yy261;
+                    if(yych >= 'p') goto yy261;
                 }
             } else {
                 if(yych <= 't') {
-                    if(yych == 'r') goto yy258;
+                    if(yych == 'r') goto yy261;
                 } else {
-                    if(yych == 'v') goto yy414;
-                    if(yych <= 'w') goto yy258;
+                    if(yych == 'v') goto yy417;
+                    if(yych <= 'w') goto yy261;
                 }
             }
         }
-yy414:
-#line 139 "strict_cpp.re"
+yy417:
+#line 141 "strict_cpp.re"
         { BOOST_WAVE_RET(T_POUND_TRIGRAPH); }
-#line 3794 "strict_cpp_re.inc"
-yy415:
+#line 3809 "strict_cpp_re.inc"
+yy418:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) == '=') goto yy431;
-#line 178 "strict_cpp.re"
+        if((yych = *YYCURSOR) == '=') goto yy434;
+#line 180 "strict_cpp.re"
         { BOOST_WAVE_RET(T_XOR_TRIGRAPH); }
-#line 3800 "strict_cpp_re.inc"
-yy417:
+#line 3815 "strict_cpp_re.inc"
+yy420:
         yyaccept = 14;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= '>') {
-            if(yych == '=') goto yy426;
+            if(yych == '=') goto yy429;
         } else {
-            if(yych <= '?') goto yy423;
-            if(yych == '|') goto yy424;
+            if(yych <= '?') goto yy426;
+            if(yych == '|') goto yy427;
         }
-yy418:
-#line 184 "strict_cpp.re"
+yy421:
+#line 186 "strict_cpp.re"
         { BOOST_WAVE_RET(T_OR_TRIGRAPH); }
-#line 3813 "strict_cpp_re.inc"
-yy419:
+#line 3828 "strict_cpp_re.inc"
+yy422:
         ++YYCURSOR;
-#line 186 "strict_cpp.re"
+#line 188 "strict_cpp.re"
         { BOOST_WAVE_RET(T_COMPL_TRIGRAPH); }
-#line 3818 "strict_cpp_re.inc"
-yy421:
+#line 3833 "strict_cpp_re.inc"
+yy424:
         yyaccept = 15;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'U') goto yy183;
-        if(yych == 'u') goto yy182;
-yy422:
-#line 236 "strict_cpp.re"
+        if(yych == 'U') goto yy186;
+        if(yych == 'u') goto yy185;
+yy425:
+#line 238 "strict_cpp.re"
         { BOOST_WAVE_RET(T_ANY_TRIGRAPH); }
-#line 3827 "strict_cpp_re.inc"
-yy423:
+#line 3842 "strict_cpp_re.inc"
+yy426:
         yych = *++YYCURSOR;
-        if(yych == '?') goto yy428;
-        goto yy2;
-yy424:
+        if(yych == '?') goto yy431;
+        goto yy98;
+yy427:
         ++YYCURSOR;
-#line 218 "strict_cpp.re"
+#line 220 "strict_cpp.re"
         { BOOST_WAVE_RET(T_OROR_TRIGRAPH); }
-#line 3836 "strict_cpp_re.inc"
-yy426:
+#line 3851 "strict_cpp_re.inc"
+yy429:
         ++YYCURSOR;
-#line 205 "strict_cpp.re"
+#line 207 "strict_cpp.re"
         { BOOST_WAVE_RET(T_ORASSIGN_TRIGRAPH); }
-#line 3841 "strict_cpp_re.inc"
-yy428:
+#line 3856 "strict_cpp_re.inc"
+yy431:
         yych = *++YYCURSOR;
-        if(yych != '!') goto yy2;
+        if(yych != '!') goto yy98;
         ++YYCURSOR;
-#line 221 "strict_cpp.re"
+#line 223 "strict_cpp.re"
         { BOOST_WAVE_RET(T_OROR_TRIGRAPH); }
-#line 3848 "strict_cpp_re.inc"
-yy431:
+#line 3863 "strict_cpp_re.inc"
+yy434:
         ++YYCURSOR;
-#line 200 "strict_cpp.re"
+#line 202 "strict_cpp.re"
         { BOOST_WAVE_RET(T_XORASSIGN_TRIGRAPH); }
-#line 3853 "strict_cpp_re.inc"
-yy433:
+#line 3868 "strict_cpp_re.inc"
+yy436:
         yych = *++YYCURSOR;
-        if(yych == '?') goto yy436;
-        goto yy2;
-yy434:
+        if(yych == '?') goto yy439;
+        goto yy98;
+yy437:
         ++YYCURSOR;
-#line 142 "strict_cpp.re"
+#line 144 "strict_cpp.re"
         { BOOST_WAVE_RET(T_POUND_POUND_TRIGRAPH); }
-#line 3862 "strict_cpp_re.inc"
-yy436:
+#line 3877 "strict_cpp_re.inc"
+yy439:
         yych = *++YYCURSOR;
-        if(yych != '=') goto yy2;
+        if(yych != '=') goto yy98;
         ++YYCURSOR;
-#line 143 "strict_cpp.re"
+#line 145 "strict_cpp.re"
         { BOOST_WAVE_RET(T_POUND_POUND_TRIGRAPH); }
-#line 3869 "strict_cpp_re.inc"
-yy439:
+#line 3884 "strict_cpp_re.inc"
+yy442:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        switch(yych){
-        case 'a':   goto yy440;
-        case 'b':   goto yy441;
-        case 'c':   goto yy442;
-        case 'd':   goto yy443;
-        case 'e':   goto yy492;
-        case 'f':   goto yy490;
-        case 'i':   goto yy489;
-        case 'l':   goto yy493;
-        case 's':   goto yy446;
-        case 't':   goto yy491;
-        default:    goto yy192;
+        switch(yych) {
+        case 'a':    goto yy443;
+        case 'b':    goto yy444;
+        case 'c':    goto yy445;
+        case 'd':    goto yy446;
+        case 'e':    goto yy495;
+        case 'f':    goto yy493;
+        case 'i':    goto yy492;
+        case 'l':    goto yy496;
+        case 's':    goto yy449;
+        case 't':    goto yy494;
+        default:    goto yy195;
         }
-yy440:
+yy443:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 's') goto yy486;
-        goto yy192;
-yy441:
+        if(yych == 's') goto yy489;
+        goto yy195;
+yy444:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy481;
-        goto yy192;
-yy442:
+        if(yych == 'a') goto yy484;
+        goto yy195;
+yy445:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'd') goto yy476;
-        goto yy192;
-yy443:
+        if(yych == 'd') goto yy479;
+        goto yy195;
+yy446:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'e') goto yy468;
-        goto yy192;
-yy444:
+        if(yych == 'e') goto yy471;
+        goto yy195;
+yy447:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy460;
-        goto yy192;
-yy445:
+        if(yych == 'a') goto yy463;
+        goto yy195;
+yy448:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'n') goto yy454;
-        goto yy192;
-yy446:
+        if(yych == 'n') goto yy457;
+        goto yy195;
+yy449:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'd') goto yy192;
+        if(yych != 'd') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 16;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy453:
-#line 117 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy456:
+#line 119 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_STDCALL : T_IDENTIFIER); }
-#line 3945 "strict_cpp_re.inc"
-yy454:
+#line 3960 "strict_cpp_re.inc"
+yy457:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
-yy455:
+        if(yych != 'l') goto yy195;
+yy458:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 17;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy459:
-#line 122 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy462:
+#line 124 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_INLINE : T_IDENTIFIER); }
-#line 3970 "strict_cpp_re.inc"
-yy460:
+#line 3985 "strict_cpp_re.inc"
+yy463:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 18;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy467:
-#line 116 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy470:
+#line 118 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_FASTCALL : T_IDENTIFIER); }
-#line 4000 "strict_cpp_re.inc"
-yy468:
+#line 4015 "strict_cpp_re.inc"
+yy471:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'p') goto yy192;
+        if(yych != 'p') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 19;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy475:
-#line 114 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy478:
+#line 116 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_DECLSPEC : T_IDENTIFIER); }
-#line 4030 "strict_cpp_re.inc"
-yy476:
+#line 4045 "strict_cpp_re.inc"
+yy479:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 20;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy480:
-#line 115 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy483:
+#line 117 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_CDECL : T_IDENTIFIER); }
-#line 4051 "strict_cpp_re.inc"
-yy481:
+#line 4066 "strict_cpp_re.inc"
+yy484:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'd') goto yy192;
+        if(yych != 'd') goto yy195;
         yyaccept = 21;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy485:
-#line 113 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy488:
+#line 115 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_BASED : T_IDENTIFIER); }
-#line 4072 "strict_cpp_re.inc"
-yy486:
+#line 4087 "strict_cpp_re.inc"
+yy489:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'm') goto yy192;
+        if(yych != 'm') goto yy195;
         yyaccept = 22;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy488:
-#line 123 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy491:
+#line 125 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_ASM : T_IDENTIFIER); }
-#line 4087 "strict_cpp_re.inc"
-yy489:
+#line 4102 "strict_cpp_re.inc"
+yy492:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'n') goto yy515;
-        goto yy192;
-yy490:
+        if(yych == 'n') goto yy518;
+        goto yy195;
+yy493:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy460;
-        if(yych == 'i') goto yy508;
-        goto yy192;
-yy491:
+        if(yych == 'a') goto yy463;
+        if(yych == 'i') goto yy511;
+        goto yy195;
+yy494:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'r') goto yy505;
-        goto yy192;
-yy492:
+        if(yych == 'r') goto yy508;
+        goto yy195;
+yy495:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'x') goto yy499;
-        goto yy192;
-yy493:
+        if(yych == 'x') goto yy502;
+        goto yy195;
+yy496:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'v') goto yy192;
+        if(yych != 'v') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 23;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy498:
-#line 121 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy501:
+#line 123 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_LEAVE : T_IDENTIFIER); }
-#line 4132 "strict_cpp_re.inc"
-yy499:
+#line 4147 "strict_cpp_re.inc"
+yy502:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'p') goto yy192;
+        if(yych != 'p') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 24;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy504:
-#line 119 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy507:
+#line 121 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_EXCEPT : T_IDENTIFIER); }
-#line 4156 "strict_cpp_re.inc"
-yy505:
+#line 4171 "strict_cpp_re.inc"
+yy508:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'y') goto yy192;
+        if(yych != 'y') goto yy195;
         yyaccept = 25;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy507:
-#line 118 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy510:
+#line 120 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_TRY : T_IDENTIFIER); }
-#line 4171 "strict_cpp_re.inc"
-yy508:
+#line 4186 "strict_cpp_re.inc"
+yy511:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'y') goto yy192;
+        if(yych != 'y') goto yy195;
         yyaccept = 26;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy514:
-#line 120 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy517:
+#line 122 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_FINALLY : T_IDENTIFIER); }
-#line 4198 "strict_cpp_re.inc"
-yy515:
+#line 4213 "strict_cpp_re.inc"
+yy518:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'l') goto yy455;
-        if(yych != 't') goto yy192;
+        if(yych == 'l') goto yy458;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        switch(yych){
-        case '1':   goto yy517;
-        case '3':   goto yy518;
-        case '6':   goto yy519;
-        case '8':   goto yy520;
-        default:    goto yy192;
+        switch(yych) {
+        case '1':    goto yy520;
+        case '3':    goto yy521;
+        case '6':    goto yy522;
+        case '8':    goto yy523;
+        default:    goto yy195;
         }
-yy517:
+yy520:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == '6') goto yy526;
-        goto yy192;
-yy518:
+        if(yych == '6') goto yy529;
+        goto yy195;
+yy521:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == '2') goto yy524;
-        goto yy192;
-yy519:
+        if(yych == '2') goto yy527;
+        goto yy195;
+yy522:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == '4') goto yy522;
-        goto yy192;
-yy520:
+        if(yych == '4') goto yy525;
+        goto yy195;
+yy523:
         yyaccept = 27;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy521:
-#line 109 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy524:
+#line 111 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_INT8 : T_IDENTIFIER); }
-#line 4239 "strict_cpp_re.inc"
-yy522:
+#line 4254 "strict_cpp_re.inc"
+yy525:
         yyaccept = 28;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy523:
-#line 112 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy526:
+#line 114 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_INT64 : T_IDENTIFIER); }
-#line 4251 "strict_cpp_re.inc"
-yy524:
+#line 4266 "strict_cpp_re.inc"
+yy527:
         yyaccept = 29;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy525:
-#line 111 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy528:
+#line 113 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_INT32 : T_IDENTIFIER); }
-#line 4263 "strict_cpp_re.inc"
-yy526:
+#line 4278 "strict_cpp_re.inc"
+yy529:
         yyaccept = 30;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy527:
-#line 110 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy530:
+#line 112 "strict_cpp.re"
         { BOOST_WAVE_RET(s->enable_ms_extensions ? T_MSEXT_INT16 : T_IDENTIFIER); }
-#line 4275 "strict_cpp_re.inc"
-yy528:
+#line 4290 "strict_cpp_re.inc"
+yy531:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'h') goto yy534;
-        goto yy192;
-yy529:
+        if(yych == 'h') goto yy537;
+        goto yy195;
+yy532:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 31;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy533:
-#line 107 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy536:
+#line 109 "strict_cpp.re"
         { BOOST_WAVE_RET(T_WHILE); }
-#line 4301 "strict_cpp_re.inc"
-yy534:
+#line 4316 "strict_cpp_re.inc"
+yy537:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != '_') goto yy192;
+        if(yych != '_') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 32;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy539:
-#line 106 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy542:
+#line 108 "strict_cpp.re"
         { BOOST_WAVE_RET(T_WCHART); }
-#line 4325 "strict_cpp_re.inc"
-yy540:
+#line 4340 "strict_cpp_re.inc"
+yy543:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'r') goto yy552;
-        goto yy192;
-yy541:
+        if(yych == 'r') goto yy555;
+        goto yy195;
+yy544:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy542;
-        if(yych == 'l') goto yy543;
-        goto yy192;
-yy542:
+        if(yych == 'i') goto yy545;
+        if(yych == 'l') goto yy546;
+        goto yy195;
+yy545:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'd') goto yy550;
-        goto yy192;
-yy543:
+        if(yych == 'd') goto yy553;
+        goto yy195;
+yy546:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 33;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy549:
-#line 105 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy552:
+#line 107 "strict_cpp.re"
         { BOOST_WAVE_RET(T_VOLATILE); }
-#line 4368 "strict_cpp_re.inc"
-yy550:
+#line 4383 "strict_cpp_re.inc"
+yy553:
         yyaccept = 34;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy551:
-#line 104 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy554:
+#line 106 "strict_cpp.re"
         { BOOST_WAVE_RET(T_VOID); }
-#line 4380 "strict_cpp_re.inc"
-yy552:
+#line 4395 "strict_cpp_re.inc"
+yy555:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'u') goto yy192;
+        if(yych != 'u') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 35;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy557:
-#line 103 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy560:
+#line 105 "strict_cpp.re"
         { BOOST_WAVE_RET(T_VIRTUAL); }
-#line 4404 "strict_cpp_re.inc"
-yy558:
+#line 4419 "strict_cpp_re.inc"
+yy561:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy564;
-        if(yych == 's') goto yy565;
-        goto yy192;
-yy559:
+        if(yych == 'i') goto yy567;
+        if(yych == 's') goto yy568;
+        goto yy195;
+yy562:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'g') goto yy192;
+        if(yych != 'g') goto yy195;
         yyaccept = 36;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy563:
-#line 102 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy566:
+#line 104 "strict_cpp.re"
         { BOOST_WAVE_RET(T_USING); }
-#line 4431 "strict_cpp_re.inc"
-yy564:
+#line 4446 "strict_cpp_re.inc"
+yy567:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'o') goto yy572;
-        goto yy192;
-yy565:
+        if(yych == 'o') goto yy575;
+        goto yy195;
+yy568:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'g') goto yy192;
+        if(yych != 'g') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'd') goto yy192;
+        if(yych != 'd') goto yy195;
         yyaccept = 37;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy571:
-#line 101 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy574:
+#line 103 "strict_cpp.re"
         { BOOST_WAVE_RET(T_UNSIGNED); }
-#line 4463 "strict_cpp_re.inc"
-yy572:
+#line 4478 "strict_cpp_re.inc"
+yy575:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 38;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy574:
-#line 100 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy577:
+#line 102 "strict_cpp.re"
         { BOOST_WAVE_RET(T_UNION); }
-#line 4478 "strict_cpp_re.inc"
-yy575:
+#line 4493 "strict_cpp_re.inc"
+yy578:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'm') goto yy605;
-        goto yy192;
-yy576:
+        if(yych == 'm') goto yy608;
+        goto yy195;
+yy579:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy598;
-        if(yych == 'r') goto yy599;
-        goto yy192;
-yy577:
+        if(yych == 'i') goto yy601;
+        if(yych == 'r') goto yy602;
+        goto yy195;
+yy580:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'u') goto yy593;
-        if(yych == 'y') goto yy594;
-        goto yy192;
-yy578:
+        if(yych == 'u') goto yy596;
+        if(yych == 'y') goto yy597;
+        goto yy195;
+yy581:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'p') goto yy192;
+        if(yych != 'p') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= 'h') {
-            if(yych != 'd') goto yy192;
+            if(yych != 'd') goto yy195;
         } else {
-            if(yych <= 'i') goto yy582;
-            if(yych == 'n') goto yy583;
-            goto yy192;
+            if(yych <= 'i') goto yy585;
+            if(yych == 'n') goto yy586;
+            goto yy195;
         }
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'e') goto yy590;
-        goto yy192;
-yy582:
+        if(yych == 'e') goto yy593;
+        goto yy195;
+yy585:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'd') goto yy588;
-        goto yy192;
-yy583:
+        if(yych == 'd') goto yy591;
+        goto yy195;
+yy586:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'm') goto yy192;
+        if(yych != 'm') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 39;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy587:
-#line 99 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy590:
+#line 101 "strict_cpp.re"
         { BOOST_WAVE_RET(T_TYPENAME); }
-#line 4541 "strict_cpp_re.inc"
-yy588:
+#line 4556 "strict_cpp_re.inc"
+yy591:
         yyaccept = 40;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy589:
-#line 98 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy592:
+#line 100 "strict_cpp.re"
         { BOOST_WAVE_RET(T_TYPEID); }
-#line 4553 "strict_cpp_re.inc"
-yy590:
+#line 4568 "strict_cpp_re.inc"
+yy593:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'f') goto yy192;
+        if(yych != 'f') goto yy195;
         yyaccept = 41;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy592:
-#line 97 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy595:
+#line 99 "strict_cpp.re"
         { BOOST_WAVE_RET(T_TYPEDEF); }
-#line 4568 "strict_cpp_re.inc"
-yy593:
+#line 4583 "strict_cpp_re.inc"
+yy596:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'e') goto yy596;
-        goto yy192;
-yy594:
+        if(yych == 'e') goto yy599;
+        goto yy195;
+yy597:
         yyaccept = 42;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy595:
-#line 96 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy598:
+#line 98 "strict_cpp.re"
         { BOOST_WAVE_RET(T_TRY); }
-#line 4585 "strict_cpp_re.inc"
-yy596:
+#line 4600 "strict_cpp_re.inc"
+yy599:
         yyaccept = 43;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy597:
-#line 95 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy600:
+#line 97 "strict_cpp.re"
         { BOOST_WAVE_RET(T_TRUE); }
-#line 4597 "strict_cpp_re.inc"
-yy598:
+#line 4612 "strict_cpp_re.inc"
+yy601:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 's') goto yy603;
-        goto yy192;
-yy599:
+        if(yych == 's') goto yy606;
+        goto yy195;
+yy602:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'o') goto yy192;
+        if(yych != 'o') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'w') goto yy192;
+        if(yych != 'w') goto yy195;
         yyaccept = 44;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy602:
-#line 94 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy605:
+#line 96 "strict_cpp.re"
         { BOOST_WAVE_RET(T_THROW); }
-#line 4620 "strict_cpp_re.inc"
-yy603:
+#line 4635 "strict_cpp_re.inc"
+yy606:
         yyaccept = 45;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy604:
-#line 93 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy607:
+#line 95 "strict_cpp.re"
         { BOOST_WAVE_RET(T_THIS); }
-#line 4632 "strict_cpp_re.inc"
-yy605:
+#line 4647 "strict_cpp_re.inc"
+yy608:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'p') goto yy192;
+        if(yych != 'p') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 46;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy611:
-#line 92 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy614:
+#line 94 "strict_cpp.re"
         { BOOST_WAVE_RET(T_TEMPLATE); }
-#line 4659 "strict_cpp_re.inc"
-yy612:
+#line 4674 "strict_cpp_re.inc"
+yy615:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'o') goto yy647;
-        goto yy192;
-yy613:
+        if(yych == 'o') goto yy650;
+        goto yy195;
+yy616:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'g') goto yy637;
-        if(yych == 'z') goto yy638;
-        goto yy192;
-yy614:
+        if(yych == 'g') goto yy640;
+        if(yych == 'z') goto yy641;
+        goto yy195;
+yy617:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy621;
-        if(yych == 'r') goto yy622;
-        goto yy192;
-yy615:
+        if(yych == 'a') goto yy624;
+        if(yych == 'r') goto yy625;
+        goto yy195;
+yy618:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'h') goto yy192;
+        if(yych != 'h') goto yy195;
         yyaccept = 47;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy620:
-#line 91 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy623:
+#line 93 "strict_cpp.re"
         { BOOST_WAVE_RET(T_SWITCH); }
-#line 4700 "strict_cpp_re.inc"
-yy621:
+#line 4715 "strict_cpp_re.inc"
+yy624:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 't') goto yy627;
-        goto yy192;
-yy622:
+        if(yych == 't') goto yy630;
+        goto yy195;
+yy625:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'u') goto yy192;
+        if(yych != 'u') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 48;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy626:
-#line 90 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy629:
+#line 92 "strict_cpp.re"
         { BOOST_WAVE_RET(T_STRUCT); }
-#line 4726 "strict_cpp_re.inc"
-yy627:
+#line 4741 "strict_cpp_re.inc"
+yy630:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 49;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= 'Z') {
             if(yych <= '>') {
-                if(yych <= '/') goto yy630;
-                if(yych <= '9') goto yy191;
+                if(yych <= '/') goto yy633;
+                if(yych <= '9') goto yy194;
             } else {
-                if(yych <= '?') goto yy194;
-                if(yych >= 'A') goto yy191;
+                if(yych <= '?') goto yy197;
+                if(yych >= 'A') goto yy194;
             }
         } else {
             if(yych <= '^') {
-                if(yych == '\\') goto yy193;
+                if(yych == '\\') goto yy196;
             } else {
-                if(yych <= '_') goto yy631;
-                if(yych <= '`') goto yy630;
-                if(yych <= 'z') goto yy191;
+                if(yych <= '_') goto yy634;
+                if(yych <= '`') goto yy633;
+                if(yych <= 'z') goto yy194;
             }
         }
-yy630:
-#line 88 "strict_cpp.re"
+yy633:
+#line 90 "strict_cpp.re"
         { BOOST_WAVE_RET(T_STATIC); }
-#line 4756 "strict_cpp_re.inc"
-yy631:
+#line 4771 "strict_cpp_re.inc"
+yy634:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 50;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy636:
-#line 89 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy639:
+#line 91 "strict_cpp.re"
         { BOOST_WAVE_RET(T_STATICCAST); }
-#line 4780 "strict_cpp_re.inc"
-yy637:
+#line 4795 "strict_cpp_re.inc"
+yy640:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'n') goto yy643;
-        goto yy192;
-yy638:
+        if(yych == 'n') goto yy646;
+        goto yy195;
+yy641:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'o') goto yy192;
+        if(yych != 'o') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'f') goto yy192;
+        if(yych != 'f') goto yy195;
         yyaccept = 51;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy642:
-#line 87 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy645:
+#line 89 "strict_cpp.re"
         { BOOST_WAVE_RET(T_SIZEOF); }
-#line 4806 "strict_cpp_re.inc"
-yy643:
+#line 4821 "strict_cpp_re.inc"
+yy646:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'd') goto yy192;
+        if(yych != 'd') goto yy195;
         yyaccept = 52;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy646:
-#line 86 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy649:
+#line 88 "strict_cpp.re"
         { BOOST_WAVE_RET(T_SIGNED); }
-#line 4824 "strict_cpp_re.inc"
-yy647:
+#line 4839 "strict_cpp_re.inc"
+yy650:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 53;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy650:
-#line 85 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy653:
+#line 87 "strict_cpp.re"
         { BOOST_WAVE_RET(T_SHORT); }
-#line 4842 "strict_cpp_re.inc"
-yy651:
+#line 4857 "strict_cpp_re.inc"
+yy654:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= 'h') {
-            if(yych != 'g') goto yy192;
+            if(yych != 'g') goto yy195;
         } else {
-            if(yych <= 'i') goto yy653;
-            if(yych == 't') goto yy654;
-            goto yy192;
+            if(yych <= 'i') goto yy656;
+            if(yych == 't') goto yy657;
+            goto yy195;
         }
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy673;
-        goto yy192;
-yy653:
+        if(yych == 'i') goto yy676;
+        goto yy195;
+yy656:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'n') goto yy659;
-        goto yy192;
-yy654:
+        if(yych == 'n') goto yy662;
+        goto yy195;
+yy657:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'u') goto yy192;
+        if(yych != 'u') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 54;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy658:
-#line 84 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy661:
+#line 86 "strict_cpp.re"
         { BOOST_WAVE_RET(T_RETURN); }
-#line 4882 "strict_cpp_re.inc"
-yy659:
+#line 4897 "strict_cpp_re.inc"
+yy662:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'p') goto yy192;
+        if(yych != 'p') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != '_') goto yy192;
+        if(yych != '_') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 55;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy672:
-#line 83 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy675:
+#line 85 "strict_cpp.re"
         { BOOST_WAVE_RET(T_REINTERPRETCAST); }
-#line 4930 "strict_cpp_re.inc"
-yy673:
+#line 4945 "strict_cpp_re.inc"
+yy676:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 56;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy678:
-#line 82 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy681:
+#line 84 "strict_cpp.re"
         { BOOST_WAVE_RET(T_REGISTER); }
-#line 4954 "strict_cpp_re.inc"
-yy679:
+#line 4969 "strict_cpp_re.inc"
+yy682:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy686;
-        if(yych == 'o') goto yy687;
-        goto yy192;
-yy680:
+        if(yych == 'i') goto yy689;
+        if(yych == 'o') goto yy690;
+        goto yy195;
+yy683:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'b') goto yy192;
+        if(yych != 'b') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 57;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy685:
-#line 81 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy688:
+#line 83 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PUBLIC); }
-#line 4984 "strict_cpp_re.inc"
-yy686:
+#line 4999 "strict_cpp_re.inc"
+yy689:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'v') goto yy695;
-        goto yy192;
-yy687:
+        if(yych == 'v') goto yy698;
+        goto yy195;
+yy690:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'd') goto yy192;
+        if(yych != 'd') goto yy195;
         yyaccept = 58;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy694:
-#line 80 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy697:
+#line 82 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PROTECTED); }
-#line 5019 "strict_cpp_re.inc"
-yy695:
+#line 5034 "strict_cpp_re.inc"
+yy698:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 59;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy699:
-#line 79 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy702:
+#line 81 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PRIVATE); }
-#line 5040 "strict_cpp_re.inc"
-yy700:
+#line 5055 "strict_cpp_re.inc"
+yy703:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'e') goto yy707;
-        goto yy192;
-yy701:
+        if(yych == 'e') goto yy710;
+        goto yy195;
+yy704:
         yyaccept = 60;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= 'Z') {
             if(yych <= '>') {
-                if(yych <= '/') goto yy702;
-                if(yych <= '9') goto yy191;
+                if(yych <= '/') goto yy705;
+                if(yych <= '9') goto yy194;
             } else {
-                if(yych <= '?') goto yy194;
-                if(yych >= 'A') goto yy191;
+                if(yych <= '?') goto yy197;
+                if(yych >= 'A') goto yy194;
             }
         } else {
             if(yych <= '^') {
-                if(yych == '\\') goto yy193;
+                if(yych == '\\') goto yy196;
             } else {
-                if(yych <= '_') goto yy703;
-                if(yych <= '`') goto yy702;
-                if(yych <= 'z') goto yy191;
+                if(yych <= '_') goto yy706;
+                if(yych <= '`') goto yy705;
+                if(yych <= 'z') goto yy194;
             }
         }
-yy702:
-#line 220 "strict_cpp.re"
+yy705:
+#line 222 "strict_cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_OROR_ALT); }
-#line 5069 "strict_cpp_re.inc"
-yy703:
+#line 5084 "strict_cpp_re.inc"
+yy706:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'q') goto yy192;
+        if(yych != 'q') goto yy195;
         yyaccept = 61;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy706:
-#line 204 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy709:
+#line 206 "strict_cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_ORASSIGN_ALT); }
-#line 5087 "strict_cpp_re.inc"
-yy707:
+#line 5102 "strict_cpp_re.inc"
+yy710:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'o') goto yy192;
+        if(yych != 'o') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 62;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy713:
-#line 78 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy716:
+#line 80 "strict_cpp.re"
         { BOOST_WAVE_RET(T_OPERATOR); }
-#line 5114 "strict_cpp_re.inc"
-yy714:
+#line 5129 "strict_cpp_re.inc"
+yy717:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'm') goto yy725;
-        goto yy192;
-yy715:
+        if(yych == 'm') goto yy728;
+        goto yy195;
+yy718:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'w') goto yy723;
-        goto yy192;
-yy716:
+        if(yych == 'w') goto yy726;
+        goto yy195;
+yy719:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 63;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= 'Z') {
             if(yych <= '>') {
-                if(yych <= '/') goto yy718;
-                if(yych <= '9') goto yy191;
+                if(yych <= '/') goto yy721;
+                if(yych <= '9') goto yy194;
             } else {
-                if(yych <= '?') goto yy194;
-                if(yych >= 'A') goto yy191;
+                if(yych <= '?') goto yy197;
+                if(yych >= 'A') goto yy194;
             }
         } else {
             if(yych <= '^') {
-                if(yych == '\\') goto yy193;
+                if(yych == '\\') goto yy196;
             } else {
-                if(yych <= '_') goto yy719;
-                if(yych <= '`') goto yy718;
-                if(yych <= 'z') goto yy191;
+                if(yych <= '_') goto yy722;
+                if(yych <= '`') goto yy721;
+                if(yych <= 'z') goto yy194;
             }
         }
-yy718:
-#line 189 "strict_cpp.re"
+yy721:
+#line 191 "strict_cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_NOT_ALT); }
-#line 5151 "strict_cpp_re.inc"
-yy719:
+#line 5166 "strict_cpp_re.inc"
+yy722:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'q') goto yy192;
+        if(yych != 'q') goto yy195;
         yyaccept = 64;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy722:
-#line 212 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy725:
+#line 214 "strict_cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_NOTEQUAL_ALT); }
-#line 5169 "strict_cpp_re.inc"
-yy723:
+#line 5184 "strict_cpp_re.inc"
+yy726:
         yyaccept = 65;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy724:
-#line 77 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy727:
+#line 79 "strict_cpp.re"
         { BOOST_WAVE_RET(T_NEW); }
-#line 5181 "strict_cpp_re.inc"
-yy725:
+#line 5196 "strict_cpp_re.inc"
+yy728:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'p') goto yy192;
+        if(yych != 'p') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 66;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy732:
-#line 76 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy735:
+#line 78 "strict_cpp.re"
         { BOOST_WAVE_RET(T_NAMESPACE); }
-#line 5211 "strict_cpp_re.inc"
-yy733:
+#line 5226 "strict_cpp_re.inc"
+yy736:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'b') goto yy192;
+        if(yych != 'b') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 67;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy739:
-#line 75 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy742:
+#line 77 "strict_cpp.re"
         { BOOST_WAVE_RET(T_MUTABLE); }
-#line 5238 "strict_cpp_re.inc"
-yy740:
+#line 5253 "strict_cpp_re.inc"
+yy743:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'g') goto yy192;
+        if(yych != 'g') goto yy195;
         yyaccept = 68;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy743:
-#line 74 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy746:
+#line 76 "strict_cpp.re"
         { BOOST_WAVE_RET(T_LONG); }
-#line 5256 "strict_cpp_re.inc"
-yy744:
+#line 5271 "strict_cpp_re.inc"
+yy747:
         yyaccept = 69;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy745:
-#line 71 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy748:
+#line 73 "strict_cpp.re"
         { BOOST_WAVE_RET(T_IF); }
-#line 5268 "strict_cpp_re.inc"
-yy746:
+#line 5283 "strict_cpp_re.inc"
+yy749:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'l') goto yy747;
-        if(yych == 't') goto yy748;
-        goto yy192;
-yy747:
+        if(yych == 'l') goto yy750;
+        if(yych == 't') goto yy751;
+        goto yy195;
+yy750:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy750;
-        goto yy192;
-yy748:
+        if(yych == 'i') goto yy753;
+        goto yy195;
+yy751:
         yyaccept = 70;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy749:
-#line 73 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy752:
+#line 75 "strict_cpp.re"
         { BOOST_WAVE_RET(T_INT); }
-#line 5291 "strict_cpp_re.inc"
-yy750:
+#line 5306 "strict_cpp_re.inc"
+yy753:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 71;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy753:
-#line 72 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy756:
+#line 74 "strict_cpp.re"
         { BOOST_WAVE_RET(T_INLINE); }
-#line 5309 "strict_cpp_re.inc"
-yy754:
+#line 5324 "strict_cpp_re.inc"
+yy757:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'o') goto yy192;
+        if(yych != 'o') goto yy195;
         yyaccept = 72;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy757:
-#line 70 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy760:
+#line 72 "strict_cpp.re"
         { BOOST_WAVE_RET(T_GOTO); }
-#line 5327 "strict_cpp_re.inc"
-yy758:
+#line 5342 "strict_cpp_re.inc"
+yy761:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'l') goto yy773;
-        goto yy192;
-yy759:
+        if(yych == 'l') goto yy776;
+        goto yy195;
+yy762:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'o') goto yy769;
-        goto yy192;
-yy760:
+        if(yych == 'o') goto yy772;
+        goto yy195;
+yy763:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'r') goto yy767;
-        goto yy192;
-yy761:
+        if(yych == 'r') goto yy770;
+        goto yy195;
+yy764:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'd') goto yy192;
+        if(yych != 'd') goto yy195;
         yyaccept = 73;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy766:
-#line 69 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy769:
+#line 71 "strict_cpp.re"
         { BOOST_WAVE_RET(T_FRIEND); }
-#line 5366 "strict_cpp_re.inc"
-yy767:
+#line 5381 "strict_cpp_re.inc"
+yy770:
         yyaccept = 74;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy768:
-#line 68 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy771:
+#line 70 "strict_cpp.re"
         { BOOST_WAVE_RET(T_FOR); }
-#line 5378 "strict_cpp_re.inc"
-yy769:
+#line 5393 "strict_cpp_re.inc"
+yy772:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 75;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy772:
-#line 67 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy775:
+#line 69 "strict_cpp.re"
         { BOOST_WAVE_RET(T_FLOAT); }
-#line 5396 "strict_cpp_re.inc"
-yy773:
+#line 5411 "strict_cpp_re.inc"
+yy776:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 76;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy776:
-#line 66 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy779:
+#line 68 "strict_cpp.re"
         { BOOST_WAVE_RET(T_FALSE); }
-#line 5414 "strict_cpp_re.inc"
-yy777:
+#line 5429 "strict_cpp_re.inc"
+yy780:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 's') goto yy799;
-        goto yy192;
-yy778:
+        if(yych == 's') goto yy802;
+        goto yy195;
+yy781:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'u') goto yy796;
-        goto yy192;
-yy779:
+        if(yych == 'u') goto yy799;
+        goto yy195;
+yy782:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'p') goto yy780;
-        if(yych == 't') goto yy781;
-        goto yy192;
-yy780:
+        if(yych == 'p') goto yy783;
+        if(yych == 't') goto yy784;
+        goto yy195;
+yy783:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'l') goto yy786;
-        if(yych == 'o') goto yy787;
-        goto yy192;
-yy781:
+        if(yych == 'l') goto yy789;
+        if(yych == 'o') goto yy790;
+        goto yy195;
+yy784:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 77;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy785:
-#line 65 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy788:
+#line 67 "strict_cpp.re"
         { BOOST_WAVE_RET(T_EXTERN); }
-#line 5457 "strict_cpp_re.inc"
-yy786:
+#line 5472 "strict_cpp_re.inc"
+yy789:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'i') goto yy791;
-        goto yy192;
-yy787:
+        if(yych == 'i') goto yy794;
+        goto yy195;
+yy790:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 78;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy790:
-#line 64 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy793:
+#line 66 "strict_cpp.re"
         { BOOST_WAVE_RET(T_EXPORT); }
-#line 5480 "strict_cpp_re.inc"
-yy791:
+#line 5495 "strict_cpp_re.inc"
+yy794:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 79;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy795:
-#line 63 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy798:
+#line 65 "strict_cpp.re"
         { BOOST_WAVE_RET(T_EXPLICIT); }
-#line 5501 "strict_cpp_re.inc"
-yy796:
+#line 5516 "strict_cpp_re.inc"
+yy799:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'm') goto yy192;
+        if(yych != 'm') goto yy195;
         yyaccept = 80;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy798:
-#line 62 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy801:
+#line 64 "strict_cpp.re"
         { BOOST_WAVE_RET(T_ENUM); }
-#line 5516 "strict_cpp_re.inc"
-yy799:
+#line 5531 "strict_cpp_re.inc"
+yy802:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 81;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy801:
-#line 61 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy804:
+#line 63 "strict_cpp.re"
         { BOOST_WAVE_RET(T_ELSE); }
-#line 5531 "strict_cpp_re.inc"
-yy802:
+#line 5546 "strict_cpp_re.inc"
+yy805:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'f') goto yy822;
-        if(yych == 'l') goto yy823;
-        goto yy192;
-yy803:
+        if(yych == 'f') goto yy825;
+        if(yych == 'l') goto yy826;
+        goto yy195;
+yy806:
         yyaccept = 82;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= '[') {
             if(yych <= '>') {
-                if(yych <= '/') goto yy804;
-                if(yych <= '9') goto yy191;
+                if(yych <= '/') goto yy807;
+                if(yych <= '9') goto yy194;
             } else {
-                if(yych <= '?') goto yy194;
-                if(yych <= '@') goto yy804;
-                if(yych <= 'Z') goto yy191;
+                if(yych <= '?') goto yy197;
+                if(yych <= '@') goto yy807;
+                if(yych <= 'Z') goto yy194;
             }
         } else {
             if(yych <= '`') {
-                if(yych <= '\\') goto yy193;
-                if(yych == '_') goto yy191;
+                if(yych <= '\\') goto yy196;
+                if(yych == '_') goto yy194;
             } else {
-                if(yych == 'u') goto yy817;
-                if(yych <= 'z') goto yy191;
+                if(yych == 'u') goto yy820;
+                if(yych <= 'z') goto yy194;
             }
         }
-yy804:
-#line 58 "strict_cpp.re"
+yy807:
+#line 60 "strict_cpp.re"
         { BOOST_WAVE_RET(T_DO); }
-#line 5562 "strict_cpp_re.inc"
-yy805:
+#line 5577 "strict_cpp_re.inc"
+yy808:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'm') goto yy192;
+        if(yych != 'm') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != '_') goto yy192;
+        if(yych != '_') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 83;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy816:
-#line 60 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy819:
+#line 62 "strict_cpp.re"
         { BOOST_WAVE_RET(T_DYNAMICCAST); }
-#line 5604 "strict_cpp_re.inc"
-yy817:
+#line 5619 "strict_cpp_re.inc"
+yy820:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'b') goto yy192;
+        if(yych != 'b') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 84;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy821:
-#line 59 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy824:
+#line 61 "strict_cpp.re"
         { BOOST_WAVE_RET(T_DOUBLE); }
-#line 5625 "strict_cpp_re.inc"
-yy822:
+#line 5640 "strict_cpp_re.inc"
+yy825:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy828;
-        goto yy192;
-yy823:
+        if(yych == 'a') goto yy831;
+        goto yy195;
+yy826:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 85;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy827:
-#line 57 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy830:
+#line 59 "strict_cpp.re"
         { BOOST_WAVE_RET(T_DELETE); }
-#line 5651 "strict_cpp_re.inc"
-yy828:
+#line 5666 "strict_cpp_re.inc"
+yy831:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'u') goto yy192;
+        if(yych != 'u') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 86;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy832:
-#line 56 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy835:
+#line 58 "strict_cpp.re"
         { BOOST_WAVE_RET(T_DEFAULT); }
-#line 5672 "strict_cpp_re.inc"
-yy833:
+#line 5687 "strict_cpp_re.inc"
+yy836:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'r') goto yy192;
-        if(yych <= 's') goto yy864;
-        if(yych <= 't') goto yy865;
-        goto yy192;
-yy834:
+        if(yych <= 'r') goto yy195;
+        if(yych <= 's') goto yy867;
+        if(yych <= 't') goto yy868;
+        goto yy195;
+yy837:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy861;
-        goto yy192;
-yy835:
+        if(yych == 'a') goto yy864;
+        goto yy195;
+yy838:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy857;
-        goto yy192;
-yy836:
+        if(yych == 'a') goto yy860;
+        goto yy195;
+yy839:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'l') goto yy192;
-        if(yych <= 'm') goto yy838;
-        if(yych >= 'o') goto yy192;
+        if(yych <= 'l') goto yy195;
+        if(yych <= 'm') goto yy841;
+        if(yych >= 'o') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych <= 'r') goto yy192;
-        if(yych <= 's') goto yy842;
-        if(yych <= 't') goto yy843;
-        goto yy192;
-yy838:
+        if(yych <= 'r') goto yy195;
+        if(yych <= 's') goto yy845;
+        if(yych <= 't') goto yy846;
+        goto yy195;
+yy841:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'p') goto yy192;
+        if(yych != 'p') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 87;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy841:
-#line 187 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy844:
+#line 189 "strict_cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_COMPL_ALT); }
-#line 5719 "strict_cpp_re.inc"
-yy842:
+#line 5734 "strict_cpp_re.inc"
+yy845:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 't') goto yy849;
-        goto yy192;
-yy843:
+        if(yych == 't') goto yy852;
+        goto yy195;
+yy846:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'i') goto yy192;
+        if(yych != 'i') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'n') goto yy192;
+        if(yych != 'n') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'u') goto yy192;
+        if(yych != 'u') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 88;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy848:
-#line 55 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy851:
+#line 57 "strict_cpp.re"
         { BOOST_WAVE_RET(T_CONTINUE); }
-#line 5748 "strict_cpp_re.inc"
-yy849:
+#line 5763 "strict_cpp_re.inc"
+yy852:
         yyaccept = 89;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= 'Z') {
             if(yych <= '>') {
-                if(yych <= '/') goto yy850;
-                if(yych <= '9') goto yy191;
+                if(yych <= '/') goto yy853;
+                if(yych <= '9') goto yy194;
             } else {
-                if(yych <= '?') goto yy194;
-                if(yych >= 'A') goto yy191;
+                if(yych <= '?') goto yy197;
+                if(yych >= 'A') goto yy194;
             }
         } else {
             if(yych <= '^') {
-                if(yych == '\\') goto yy193;
+                if(yych == '\\') goto yy196;
             } else {
-                if(yych <= '_') goto yy851;
-                if(yych <= '`') goto yy850;
-                if(yych <= 'z') goto yy191;
+                if(yych <= '_') goto yy854;
+                if(yych <= '`') goto yy853;
+                if(yych <= 'z') goto yy194;
             }
         }
-yy850:
-#line 53 "strict_cpp.re"
+yy853:
+#line 55 "strict_cpp.re"
         { BOOST_WAVE_RET(T_CONST); }
-#line 5772 "strict_cpp_re.inc"
-yy851:
+#line 5787 "strict_cpp_re.inc"
+yy854:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 90;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy856:
-#line 54 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy859:
+#line 56 "strict_cpp.re"
         { BOOST_WAVE_RET(T_CONSTCAST); }
-#line 5796 "strict_cpp_re.inc"
-yy857:
+#line 5811 "strict_cpp_re.inc"
+yy860:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 's') goto yy192;
+        if(yych != 's') goto yy195;
         yyaccept = 91;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy860:
-#line 52 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy863:
+#line 54 "strict_cpp.re"
         { BOOST_WAVE_RET(T_CLASS); }
-#line 5814 "strict_cpp_re.inc"
-yy861:
+#line 5829 "strict_cpp_re.inc"
+yy864:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 92;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy863:
-#line 51 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy866:
+#line 53 "strict_cpp.re"
         { BOOST_WAVE_RET(T_CHAR); }
-#line 5829 "strict_cpp_re.inc"
-yy864:
+#line 5844 "strict_cpp_re.inc"
+yy867:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'e') goto yy869;
-        goto yy192;
-yy865:
+        if(yych == 'e') goto yy872;
+        goto yy195;
+yy868:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'c') goto yy192;
+        if(yych != 'c') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'h') goto yy192;
+        if(yych != 'h') goto yy195;
         yyaccept = 93;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy868:
-#line 50 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy871:
+#line 52 "strict_cpp.re"
         { BOOST_WAVE_RET(T_CATCH); }
-#line 5852 "strict_cpp_re.inc"
-yy869:
+#line 5867 "strict_cpp_re.inc"
+yy872:
         yyaccept = 94;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy870:
-#line 49 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy873:
+#line 51 "strict_cpp.re"
         { BOOST_WAVE_RET(T_CASE); }
-#line 5864 "strict_cpp_re.inc"
-yy871:
+#line 5879 "strict_cpp_re.inc"
+yy874:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 't') goto yy881;
-        goto yy192;
-yy872:
+        if(yych == 't') goto yy884;
+        goto yy195;
+yy875:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'o') goto yy878;
-        goto yy192;
-yy873:
+        if(yych == 'o') goto yy881;
+        goto yy195;
+yy876:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'a') goto yy192;
+        if(yych != 'a') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'k') goto yy192;
+        if(yych != 'k') goto yy195;
         yyaccept = 95;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy877:
-#line 48 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy880:
+#line 50 "strict_cpp.re"
         { BOOST_WAVE_RET(T_BREAK); }
-#line 5895 "strict_cpp_re.inc"
-yy878:
+#line 5910 "strict_cpp_re.inc"
+yy881:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'l') goto yy192;
+        if(yych != 'l') goto yy195;
         yyaccept = 96;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy880:
-#line 47 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy883:
+#line 49 "strict_cpp.re"
         { BOOST_WAVE_RET(T_BOOL); }
-#line 5910 "strict_cpp_re.inc"
-yy881:
+#line 5925 "strict_cpp_re.inc"
+yy884:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'a') goto yy882;
-        if(yych == 'o') goto yy883;
-        goto yy192;
-yy882:
+        if(yych == 'a') goto yy885;
+        if(yych == 'o') goto yy886;
+        goto yy195;
+yy885:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'n') goto yy886;
-        goto yy192;
-yy883:
+        if(yych == 'n') goto yy889;
+        goto yy195;
+yy886:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'r') goto yy192;
+        if(yych != 'r') goto yy195;
         yyaccept = 97;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy885:
-#line 183 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy888:
+#line 185 "strict_cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_OR_ALT); }
-#line 5936 "strict_cpp_re.inc"
-yy886:
+#line 5951 "strict_cpp_re.inc"
+yy889:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'd') goto yy192;
+        if(yych != 'd') goto yy195;
         yyaccept = 98;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy888:
-#line 181 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy891:
+#line 183 "strict_cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_AND_ALT); }
-#line 5951 "strict_cpp_re.inc"
-yy889:
+#line 5966 "strict_cpp_re.inc"
+yy892:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'd') goto yy897;
-        goto yy192;
-yy890:
+        if(yych == 'd') goto yy900;
+        goto yy195;
+yy893:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych == 'm') goto yy895;
-        goto yy192;
-yy891:
+        if(yych == 'm') goto yy898;
+        goto yy195;
+yy894:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 't') goto yy192;
+        if(yych != 't') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'o') goto yy192;
+        if(yych != 'o') goto yy195;
         yyaccept = 99;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy894:
-#line 46 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy897:
+#line 48 "strict_cpp.re"
         { BOOST_WAVE_RET(T_AUTO); }
-#line 5979 "strict_cpp_re.inc"
-yy895:
+#line 5994 "strict_cpp_re.inc"
+yy898:
         yyaccept = 100;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy896:
-#line 45 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy899:
+#line 47 "strict_cpp.re"
         { BOOST_WAVE_RET(T_ASM); }
-#line 5991 "strict_cpp_re.inc"
-yy897:
+#line 6006 "strict_cpp_re.inc"
+yy900:
         yyaccept = 101;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yych <= 'Z') {
             if(yych <= '>') {
-                if(yych <= '/') goto yy898;
-                if(yych <= '9') goto yy191;
+                if(yych <= '/') goto yy901;
+                if(yych <= '9') goto yy194;
             } else {
-                if(yych <= '?') goto yy194;
-                if(yych >= 'A') goto yy191;
+                if(yych <= '?') goto yy197;
+                if(yych >= 'A') goto yy194;
             }
         } else {
             if(yych <= '^') {
-                if(yych == '\\') goto yy193;
+                if(yych == '\\') goto yy196;
             } else {
-                if(yych <= '_') goto yy899;
-                if(yych <= '`') goto yy898;
-                if(yych <= 'z') goto yy191;
+                if(yych <= '_') goto yy902;
+                if(yych <= '`') goto yy901;
+                if(yych <= 'z') goto yy194;
             }
         }
-yy898:
-#line 216 "strict_cpp.re"
+yy901:
+#line 218 "strict_cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_ANDAND_ALT); }
-#line 6015 "strict_cpp_re.inc"
-yy899:
+#line 6030 "strict_cpp_re.inc"
+yy902:
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'e') goto yy192;
+        if(yych != 'e') goto yy195;
         yyaccept = 1;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yych != 'q') goto yy192;
+        if(yych != 'q') goto yy195;
         yyaccept = 102;
         yych = *(YYMARKER = ++YYCURSOR);
-        if(yybm[0+yych] & 2) {
-            goto yy191;
+        if(yybm[0+yych] & 4) {
+            goto yy194;
         }
-        if(yych == '?') goto yy194;
-        if(yych == '\\') goto yy193;
-yy902:
-#line 202 "strict_cpp.re"
+        if(yych == '?') goto yy197;
+        if(yych == '\\') goto yy196;
+yy905:
+#line 204 "strict_cpp.re"
         { BOOST_WAVE_RET(s->act_in_c99_mode ? T_IDENTIFIER : T_ANDASSIGN_ALT); }
-#line 6033 "strict_cpp_re.inc"
-yy903:
+#line 6048 "strict_cpp_re.inc"
+yy906:
         ++YYCURSOR;
-#line 163 "strict_cpp.re"
+#line 165 "strict_cpp.re"
         { 
             if (s->act_in_c99_mode) {
                 --YYCURSOR;
@@ -6042,73 +6057,73 @@
                 BOOST_WAVE_RET(T_DOTSTAR); 
             }
         }
-#line 6046 "strict_cpp_re.inc"
-yy905:
+#line 6061 "strict_cpp_re.inc"
+yy908:
         yych = *++YYCURSOR;
-        if(yych == '.') goto yy907;
-        goto yy2;
-yy906:
+        if(yych == '.') goto yy910;
+        goto yy98;
+yy909:
         yych = *++YYCURSOR;
-        goto yy8;
-yy907:
+        goto yy7;
+yy910:
         ++YYCURSOR;
-#line 149 "strict_cpp.re"
+#line 151 "strict_cpp.re"
         { BOOST_WAVE_RET(T_ELLIPSIS); }
-#line 6058 "strict_cpp_re.inc"
-yy909:
+#line 6073 "strict_cpp_re.inc"
+yy912:
         ++YYCURSOR;
-#line 196 "strict_cpp.re"
+#line 198 "strict_cpp.re"
         { BOOST_WAVE_RET(T_DIVIDEASSIGN); }
-#line 6063 "strict_cpp_re.inc"
-yy911:
+#line 6078 "strict_cpp_re.inc"
+yy914:
         ++YYCURSOR;
-#line 42 "strict_cpp.re"
+#line 44 "strict_cpp.re"
         { goto cppcomment; }
-#line 6068 "strict_cpp_re.inc"
-yy913:
+#line 6083 "strict_cpp_re.inc"
+yy916:
         ++YYCURSOR;
-#line 41 "strict_cpp.re"
+#line 43 "strict_cpp.re"
         { goto ccomment; }
-#line 6073 "strict_cpp_re.inc"
+#line 6088 "strict_cpp_re.inc"
     }
 }
-#line 307 "strict_cpp.re"
+#line 306 "strict_cpp.re"
 
 
 ccomment:
 {
 
-#line 6082 "strict_cpp_re.inc"
+#line 6097 "strict_cpp_re.inc"
     {
         YYCTYPE yych;
         if((YYLIMIT - YYCURSOR) < 2) YYFILL(2);
         yych = *YYCURSOR;
         if(yych <= 0x0C) {
             if(yych <= 0x08) {
-                if(yych <= 0x00) goto yy924;
+                if(yych <= 0x00) goto yy927;
+                goto yy929;
             } else {
-                if(yych == 0x0A) goto yy920;
-                goto yy923;
+                if(yych == 0x0A) goto yy922;
+                goto yy925;
             }
         } else {
             if(yych <= 0x1F) {
-                if(yych <= 0x0D) goto yy922;
+                if(yych <= 0x0D) goto yy924;
+                goto yy929;
             } else {
-                if(yych == '*') goto yy918;
-                goto yy923;
+                if(yych != '*') goto yy926;
             }
         }
-yy918:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) == '/') goto yy927;
-yy919:
-#line 322 "strict_cpp.re"
+        if((yych = *YYCURSOR) == '/') goto yy932;
+yy921:
+#line 321 "strict_cpp.re"
         { goto ccomment; }
-#line 6108 "strict_cpp_re.inc"
-yy920:
+#line 6123 "strict_cpp_re.inc"
+yy922:
         ++YYCURSOR;
-yy921:
-#line 314 "strict_cpp.re"
+yy923:
+#line 313 "strict_cpp.re"
         {
         /*if(cursor == s->eof) BOOST_WAVE_RET(T_EOF);*/
         /*s->tok = cursor; */
@@ -6116,75 +6131,78 @@
         cursor.column = 1;
         goto ccomment;
     }
-#line 6120 "strict_cpp_re.inc"
-yy922:
+#line 6135 "strict_cpp_re.inc"
+yy924:
         yych = *++YYCURSOR;
-        if(yych == 0x0A) goto yy926;
+        if(yych == 0x0A) goto yy931;
+        goto yy923;
+yy925:
+        yych = *++YYCURSOR;
         goto yy921;
-yy923:
+yy926:
         yych = *++YYCURSOR;
-        goto yy919;
-yy924:
+        goto yy921;
+yy927:
         ++YYCURSOR;
-#line 325 "strict_cpp.re"
+#line 324 "strict_cpp.re"
         {
-        using namespace std;      // some systems have printf in std
         if(cursor == s->eof) 
         {
-            if (s->error_proc)
-                (*s->error_proc)(s, "Unterminated comment");
-            else
-                printf("Error: Unterminated comment\n");
+            BOOST_WAVE_UPDATE_CURSOR();   // adjust the input cursor
+            (*s->error_proc)(s, "unterminated 'C' style comment");
         }
         else
         {
-            if (s->error_proc)
-                (*s->error_proc)(s, "'\\000' in input stream");
-            else
-                printf("Error: 0 in file");
+            --YYCURSOR;                   // next call returns T_EOF
+            BOOST_WAVE_UPDATE_CURSOR();   // adjust the input cursor
+            (*s->error_proc)(s, "invalid character: '\\000' in input stream");
         }
-        /* adjust cursor such next call returns T_EOF */
-        --YYCURSOR;
-        /* the comment is unterminated, but nevertheless its a comment */
-        BOOST_WAVE_RET(T_CCOMMENT);
     }
-#line 6152 "strict_cpp_re.inc"
-yy926:
+#line 6162 "strict_cpp_re.inc"
+yy929:
+        ++YYCURSOR;
+#line 339 "strict_cpp.re"
+        {
+        // flag the error
+        BOOST_WAVE_UPDATE_CURSOR();   // adjust the input cursor
+        (*s->error_proc)(s, "invalid character '\\%03o' in input stream", 
+            *--YYCURSOR);
+    }
+#line 6172 "strict_cpp_re.inc"
+yy931:
         yych = *++YYCURSOR;
-        goto yy921;
-yy927:
+        goto yy923;
+yy932:
         ++YYCURSOR;
-#line 311 "strict_cpp.re"
+#line 310 "strict_cpp.re"
         { BOOST_WAVE_RET(T_CCOMMENT); }
-#line 6160 "strict_cpp_re.inc"
+#line 6180 "strict_cpp_re.inc"
     }
 }
-#line 347 "strict_cpp.re"
+#line 345 "strict_cpp.re"
 
 
 cppcomment:
 {
 
-#line 6169 "strict_cpp_re.inc"
+#line 6189 "strict_cpp_re.inc"
     {
         YYCTYPE yych;
         if((YYLIMIT - YYCURSOR) < 2) YYFILL(2);
         yych = *YYCURSOR;
         if(yych <= 0x0A) {
-            if(yych <= 0x00) goto yy937;
-            if(yych <= 0x08) goto yy931;
-            if(yych <= 0x09) goto yy935;
-            goto yy932;
+            if(yych <= 0x00) goto yy942;
+            if(yych <= 0x08) goto yy944;
+            if(yych <= 0x09) goto yy939;
         } else {
-            if(yych <= 0x0C) goto yy935;
-            if(yych <= 0x0D) goto yy934;
-            if(yych >= ' ') goto yy935;
+            if(yych <= 0x0C) goto yy939;
+            if(yych <= 0x0D) goto yy938;
+            if(yych <= 0x1F) goto yy944;
+            goto yy941;
         }
-yy931:
-yy932:
         ++YYCURSOR;
-yy933:
-#line 352 "strict_cpp.re"
+yy937:
+#line 350 "strict_cpp.re"
         {
         /*if(cursor == s->eof) BOOST_WAVE_RET(T_EOF); */
         /*s->tok = cursor; */
@@ -6192,41 +6210,57 @@
         cursor.column = 1;
         BOOST_WAVE_RET(T_CPPCOMMENT);
     }
-#line 6196 "strict_cpp_re.inc"
-yy934:
+#line 6214 "strict_cpp_re.inc"
+yy938:
         yych = *++YYCURSOR;
-        if(yych == 0x0A) goto yy939;
-        goto yy933;
-yy935:
+        if(yych == 0x0A) goto yy946;
+        goto yy937;
+yy939:
         ++YYCURSOR;
-#line 360 "strict_cpp.re"
+yy940:
+#line 358 "strict_cpp.re"
         { goto cppcomment; }
-#line 6205 "strict_cpp_re.inc"
-yy937:
+#line 6224 "strict_cpp_re.inc"
+yy941:
+        yych = *++YYCURSOR;
+        goto yy940;
+yy942:
         ++YYCURSOR;
-#line 363 "strict_cpp.re"
+#line 361 "strict_cpp.re"
         {
-        using namespace std;      // some systems have printf in std
-        if(cursor != s->eof) 
+        if (cursor != s->eof) 
         {
-            if (s->error_proc)
-                (*s->error_proc)(s, "'\\000' in input stream");
-            else
-                printf("Error: 0 in file");
+            --YYCURSOR;                     // next call returns T_EOF
+            BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+            (*s->error_proc)(s, "invalid character '\\000' in input stream");
         }
-        /* adjust cursor such next call returns T_EOF */
-        --YYCURSOR;
-        /* the comment is unterminated, but nevertheless its a comment */
+        
+        --YYCURSOR;                         // next call returns T_EOF
+        if (!s->single_line_only)
+        {
+            BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+            (*s->error_proc)(s, "Unterminated 'C++' style comment");
+        }
         BOOST_WAVE_RET(T_CPPCOMMENT);
     }
-#line 6223 "strict_cpp_re.inc"
-yy939:
+#line 6247 "strict_cpp_re.inc"
+yy944:
         ++YYCURSOR;
+#line 379 "strict_cpp.re"
+        {
+        // flag the error
+        BOOST_WAVE_UPDATE_CURSOR();     // adjust the input cursor
+        (*s->error_proc)(s, "invalid character '\\%03o' in input stream",
+            *--YYCURSOR);
+    }
+#line 6257 "strict_cpp_re.inc"
+yy946:
+        ++YYCURSOR;
         yych = *YYCURSOR;
-        goto yy933;
+        goto yy937;
     }
 }
-#line 377 "strict_cpp.re"
+#line 385 "strict_cpp.re"
 
 
 /* this subscanner is called whenever a pp_number has been started */
@@ -6273,246 +6307,246 @@
           0,   0,   0,   0,   0,   0,   0,   0, 
     };
 
-#line 6277 "strict_cpp_re.inc"
+#line 6311 "strict_cpp_re.inc"
     {
         YYCTYPE yych;
         if((YYLIMIT - YYCURSOR) < 2) YYFILL(2);
         yych = *YYCURSOR;
-        if(yych == '.') goto yy943;
-        if(yych <= '/') goto yy942;
-        if(yych <= '9') goto yy944;
-yy942:
+        if(yych == '.') goto yy950;
+        if(yych <= '/') goto yy949;
+        if(yych <= '9') goto yy951;
+yy949:
         YYCURSOR = YYMARKER;
-        goto yy946;
-yy943:
+        goto yy953;
+yy950:
         yych = *++YYCURSOR;
-        if(yych <= '/') goto yy942;
-        if(yych >= ':') goto yy942;
-yy944:
+        if(yych <= '/') goto yy949;
+        if(yych >= ':') goto yy949;
+yy951:
         YYMARKER = ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 64) {
-            goto yy944;
+            goto yy951;
         }
         if(yych <= 'Z') {
-            if(yych == '?') goto yy950;
-            if(yych >= 'A') goto yy947;
+            if(yych == '?') goto yy957;
+            if(yych >= 'A') goto yy954;
         } else {
             if(yych <= '\\') {
-                if(yych >= '\\') goto yy949;
+                if(yych >= '\\') goto yy956;
             } else {
-                if(yych == 'e') goto yy947;
+                if(yych == 'e') goto yy954;
             }
         }
-yy946:
-#line 389 "strict_cpp.re"
+yy953:
+#line 397 "strict_cpp.re"
         { BOOST_WAVE_RET(T_PP_NUMBER); }
-#line 6312 "strict_cpp_re.inc"
-yy947:
+#line 6346 "strict_cpp_re.inc"
+yy954:
         YYMARKER = ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 128) {
-            goto yy947;
+            goto yy954;
         }
         if(yych <= '?') {
             if(yych <= '.') {
-                if(yych == '+') goto yy944;
-                if(yych <= ',') goto yy946;
-                goto yy944;
+                if(yych == '+') goto yy951;
+                if(yych <= ',') goto yy953;
+                goto yy951;
             } else {
-                if(yych <= '/') goto yy946;
-                if(yych <= '9') goto yy944;
-                if(yych <= '>') goto yy946;
-                goto yy950;
+                if(yych <= '/') goto yy953;
+                if(yych <= '9') goto yy951;
+                if(yych <= '>') goto yy953;
+                goto yy957;
             }
         } else {
             if(yych <= '\\') {
-                if(yych <= '@') goto yy946;
-                if(yych <= 'Z') goto yy944;
-                if(yych <= '[') goto yy946;
+                if(yych <= '@') goto yy953;
+                if(yych <= 'Z') goto yy951;
+                if(yych <= '[') goto yy953;
             } else {
                 if(yych <= '_') {
-                    if(yych <= '^') goto yy946;
-                    goto yy944;
+                    if(yych <= '^') goto yy953;
+                    goto yy951;
                 } else {
-                    if(yych <= '`') goto yy946;
-                    if(yych <= 'z') goto yy944;
-                    goto yy946;
+                    if(yych <= '`') goto yy953;
+                    if(yych <= 'z') goto yy951;
+                    goto yy953;
                 }
             }
         }
-yy949:
+yy956:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych == 'U') goto yy953;
-        if(yych == 'u') goto yy952;
-        goto yy942;
-yy950:
+        if(yych == 'U') goto yy960;
+        if(yych == 'u') goto yy959;
+        goto yy949;
+yy957:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych != '?') goto yy942;
+        if(yych != '?') goto yy949;
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
-        if(yych == '/') goto yy949;
-        goto yy942;
-yy952:
+        if(yych == '/') goto yy956;
+        goto yy949;
+yy959:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych <= '9') goto yy961;
-            goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych <= '9') goto yy968;
+            goto yy949;
         } else {
-            if(yych <= 'F') goto yy961;
-            if(yych <= '`') goto yy942;
-            if(yych <= 'f') goto yy961;
-            goto yy942;
+            if(yych <= 'F') goto yy968;
+            if(yych <= '`') goto yy949;
+            if(yych <= 'f') goto yy968;
+            goto yy949;
         }
-yy953:
+yy960:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy954;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy961;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy954:
+yy961:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy955;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy962;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy955:
+yy962:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy956;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy963;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy956:
+yy963:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy957;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy964;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy957:
+yy964:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy958;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy965;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy958:
+yy965:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy959;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy966;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy959:
+yy966:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy960;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy967;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy960:
+yy967:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych <= '9') goto yy944;
-            goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych <= '9') goto yy951;
+            goto yy949;
         } else {
-            if(yych <= 'F') goto yy944;
-            if(yych <= '`') goto yy942;
-            if(yych <= 'f') goto yy944;
-            goto yy942;
+            if(yych <= 'F') goto yy951;
+            if(yych <= '`') goto yy949;
+            if(yych <= 'f') goto yy951;
+            goto yy949;
         }
-yy961:
+yy968:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy962;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy969;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy962:
+yy969:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych >= ':') goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych >= ':') goto yy949;
         } else {
-            if(yych <= 'F') goto yy963;
-            if(yych <= '`') goto yy942;
-            if(yych >= 'g') goto yy942;
+            if(yych <= 'F') goto yy970;
+            if(yych <= '`') goto yy949;
+            if(yych >= 'g') goto yy949;
         }
-yy963:
+yy970:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yych <= '@') {
-            if(yych <= '/') goto yy942;
-            if(yych <= '9') goto yy944;
-            goto yy942;
+            if(yych <= '/') goto yy949;
+            if(yych <= '9') goto yy951;
+            goto yy949;
         } else {
-            if(yych <= 'F') goto yy944;
-            if(yych <= '`') goto yy942;
-            if(yych <= 'f') goto yy944;
-            goto yy942;
+            if(yych <= 'F') goto yy951;
+            if(yych <= '`') goto yy949;
+            if(yych <= 'f') goto yy951;
+            goto yy949;
         }
     }
 }
-#line 390 "strict_cpp.re"
+#line 398 "strict_cpp.re"
 
     }
     else {
@@ -6552,236 +6586,236 @@
           0,   0,   0,   0,   0,   0,   0,   0, 
     };
 
-#line 6556 "strict_cpp_re.inc"
+#line 6590 "strict_cpp_re.inc"
     {
         YYCTYPE yych;
         unsigned int yyaccept = 0;
         if((YYLIMIT - YYCURSOR) < 4) YYFILL(4);
         yych = *YYCURSOR;
         if(yych <= '/') {
-            if(yych == '.') goto yy971;
+            if(yych == '.') goto yy978;
         } else {
-            if(yych <= '0') goto yy967;
-            if(yych <= '9') goto yy969;
+            if(yych <= '0') goto yy974;
+            if(yych <= '9') goto yy976;
         }
-yy966:
+yy973:
         YYCURSOR = YYMARKER;
         if(yyaccept <= 0) {
-            goto yy968;
+            goto yy975;
         } else {
-            goto yy974;
+            goto yy981;
         }
-yy967:
+yy974:
         yyaccept = 0;
         yych = *(YYMARKER = ++YYCURSOR);
         if(yybm[0+yych] & 64) {
-            goto yy986;
+            goto yy993;
         }
         if(yych <= 'E') {
             if(yych <= '/') {
-                if(yych == '.') goto yy972;
+                if(yych == '.') goto yy979;
             } else {
-                if(yych <= '9') goto yy989;
-                if(yych >= 'E') goto yy982;
+                if(yych <= '9') goto yy996;
+                if(yych >= 'E') goto yy989;
             }
         } else {
             if(yych <= 'd') {
-                if(yych == 'X') goto yy988;
+                if(yych == 'X') goto yy995;
             } else {
-                if(yych <= 'e') goto yy982;
-                if(yych == 'x') goto yy988;
+                if(yych <= 'e') goto yy989;
+                if(yych == 'x') goto yy995;
             }
         }
-yy968:
-#line 397 "strict_cpp.re"
+yy975:
+#line 405 "strict_cpp.re"
         { goto integer_suffix; }
-#line 6599 "strict_cpp_re.inc"
-yy969:
+#line 6633 "strict_cpp_re.inc"
+yy976:
         yyaccept = 0;
         YYMARKER = ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 3) YYFILL(3);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 32) {
-            goto yy969;
+            goto yy976;
         }
         if(yych <= 'D') {
-            if(yych == '.') goto yy972;
-            goto yy968;
+            if(yych == '.') goto yy979;
+            goto yy975;
         } else {
-            if(yych <= 'E') goto yy982;
-            if(yych == 'e') goto yy982;
-            goto yy968;
+            if(yych <= 'E') goto yy989;
+            if(yych == 'e') goto yy989;
+            goto yy975;
         }
-yy971:
+yy978:
         yych = *++YYCURSOR;
-        if(yych <= '/') goto yy966;
-        if(yych >= ':') goto yy966;
-yy972:
+        if(yych <= '/') goto yy973;
+        if(yych >= ':') goto yy973;
+yy979:
         yyaccept = 1;
         YYMARKER = ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 3) YYFILL(3);
         yych = *YYCURSOR;
         if(yych <= 'K') {
             if(yych <= 'D') {
-                if(yych <= '/') goto yy974;
-                if(yych <= '9') goto yy972;
+                if(yych <= '/') goto yy981;
+                if(yych <= '9') goto yy979;
             } else {
-                if(yych <= 'E') goto yy975;
-                if(yych <= 'F') goto yy976;
+                if(yych <= 'E') goto yy982;
+                if(yych <= 'F') goto yy983;
             }
         } else {
             if(yych <= 'e') {
-                if(yych <= 'L') goto yy977;
-                if(yych >= 'e') goto yy975;
+                if(yych <= 'L') goto yy984;
+                if(yych >= 'e') goto yy982;
             } else {
-                if(yych <= 'f') goto yy976;
-                if(yych == 'l') goto yy977;
+                if(yych <= 'f') goto yy983;
+                if(yych == 'l') goto yy984;
             }
         }
-yy974:
-#line 395 "strict_cpp.re"
+yy981:
+#line 403 "strict_cpp.re"
         { BOOST_WAVE_RET(T_FLOATLIT); }
-#line 6645 "strict_cpp_re.inc"
-yy975:
+#line 6679 "strict_cpp_re.inc"
+yy982:
         yych = *++YYCURSOR;
         if(yych <= ',') {
-            if(yych == '+') goto yy979;
-            goto yy966;
+            if(yych == '+') goto yy986;
+            goto yy973;
         } else {
-            if(yych <= '-') goto yy979;
-            if(yych <= '/') goto yy966;
-            if(yych <= '9') goto yy980;
-            goto yy966;
+            if(yych <= '-') goto yy986;
+            if(yych <= '/') goto yy973;
+            if(yych <= '9') goto yy987;
+            goto yy973;
         }
-yy976:
+yy983:
         yych = *++YYCURSOR;
-        if(yych == 'L') goto yy978;
-        if(yych == 'l') goto yy978;
-        goto yy974;
-yy977:
+        if(yych == 'L') goto yy985;
+        if(yych == 'l') goto yy985;
+        goto yy981;
+yy984:
         yych = *++YYCURSOR;
-        if(yych == 'F') goto yy978;
-        if(yych != 'f') goto yy974;
-yy978:
+        if(yych == 'F') goto yy985;
+        if(yych != 'f') goto yy981;
+yy985:
         yych = *++YYCURSOR;
-        goto yy974;
-yy979:
+        goto yy981;
+yy986:
         yych = *++YYCURSOR;
-        if(yych <= '/') goto yy966;
-        if(yych >= ':') goto yy966;
-yy980:
+        if(yych <= '/') goto yy973;
+        if(yych >= ':') goto yy973;
+yy987:
         ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 2) YYFILL(2);
         yych = *YYCURSOR;
         if(yych <= 'K') {
             if(yych <= '9') {
-                if(yych <= '/') goto yy974;
-                goto yy980;
+                if(yych <= '/') goto yy981;
+                goto yy987;
             } else {
-                if(yych == 'F') goto yy976;
-                goto yy974;
+                if(yych == 'F') goto yy983;
+                goto yy981;
             }
         } else {
             if(yych <= 'f') {
-                if(yych <= 'L') goto yy977;
-                if(yych <= 'e') goto yy974;
-                goto yy976;
+                if(yych <= 'L') goto yy984;
+                if(yych <= 'e') goto yy981;
+                goto yy983;
             } else {
-                if(yych == 'l') goto yy977;
-                goto yy974;
+                if(yych == 'l') goto yy984;
+                goto yy981;
             }
         }
-yy982:
+yy989:
         yych = *++YYCURSOR;
         if(yych <= ',') {
-            if(yych != '+') goto yy966;
+            if(yych != '+') goto yy973;
         } else {
-            if(yych <= '-') goto yy983;
-            if(yych <= '/') goto yy966;
-            if(yych <= '9') goto yy984;
-            goto yy966;
+            if(yych <= '-') goto yy990;
+            if(yych <= '/') goto yy973;
+            if(yych <= '9') goto yy991;
+            goto yy973;
         }
-yy983:
+yy990:
         yych = *++YYCURSOR;
-        if(yych <= '/') goto yy966;
-        if(yych >= ':') goto yy966;
-yy984:
+        if(yych <= '/') goto yy973;
+        if(yych >= ':') goto yy973;
+yy991:
         ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 2) YYFILL(2);
         yych = *YYCURSOR;
         if(yych <= 'K') {
             if(yych <= '9') {
-                if(yych <= '/') goto yy974;
-                goto yy984;
+                if(yych <= '/') goto yy981;
+                goto yy991;
             } else {
-                if(yych == 'F') goto yy976;
-                goto yy974;
+                if(yych == 'F') goto yy983;
+                goto yy981;
             }
         } else {
             if(yych <= 'f') {
-                if(yych <= 'L') goto yy977;
-                if(yych <= 'e') goto yy974;
-                goto yy976;
+                if(yych <= 'L') goto yy984;
+                if(yych <= 'e') goto yy981;
+                goto yy983;
             } else {
-                if(yych == 'l') goto yy977;
-                goto yy974;
+                if(yych == 'l') goto yy984;
+                goto yy981;
             }
         }
-yy986:
+yy993:
         yyaccept = 0;
         YYMARKER = ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 3) YYFILL(3);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 64) {
-            goto yy986;
+            goto yy993;
         }
         if(yych <= '9') {
-            if(yych == '.') goto yy972;
-            if(yych <= '/') goto yy968;
-            goto yy989;
+            if(yych == '.') goto yy979;
+            if(yych <= '/') goto yy975;
+            goto yy996;
         } else {
             if(yych <= 'E') {
-                if(yych <= 'D') goto yy968;
-                goto yy982;
+                if(yych <= 'D') goto yy975;
+                goto yy989;
             } else {
-                if(yych == 'e') goto yy982;
-                goto yy968;
+                if(yych == 'e') goto yy989;
+                goto yy975;
             }
         }
-yy988:
+yy995:
         yych = *++YYCURSOR;
         if(yybm[0+yych] & 128) {
-            goto yy991;
+            goto yy998;
         }
-        goto yy966;
-yy989:
+        goto yy973;
+yy996:
         ++YYCURSOR;
         if((YYLIMIT - YYCURSOR) < 3) YYFILL(3);
         yych = *YYCURSOR;
         if(yych <= '9') {
-            if(yych == '.') goto yy972;
-            if(yych <= '/') goto yy966;
-            goto yy989;
+            if(yych == '.') goto yy979;
+            if(yych <= '/') goto yy973;
+            goto yy996;
         } else {
             if(yych <= 'E') {
-                if(yych <= 'D') goto yy966;
-                goto yy982;
+                if(yych <= 'D') goto yy973;
+                goto yy989;
             } else {
-                if(yych == 'e') goto yy982;
-                goto yy966;
+                if(yych == 'e') goto yy989;
+                goto yy973;
             }
         }
-yy991:
+yy998:
         ++YYCURSOR;
         if(YYLIMIT == YYCURSOR) YYFILL(1);
         yych = *YYCURSOR;
         if(yybm[0+yych] & 128) {
-            goto yy991;
+            goto yy998;
         }
-        goto yy968;
+        goto yy975;
     }
 }
-#line 398 "strict_cpp.re"
+#line 406 "strict_cpp.re"
 
     }
 }
@@ -6792,143 +6826,143 @@
     if (s->enable_ms_extensions) {
     {
 
-#line 6796 "strict_cpp_re.inc"
+#line 6830 "strict_cpp_re.inc"
     {
         YYCTYPE yych;
         if((YYLIMIT - YYCURSOR) < 3) YYFILL(3);
         yych = *(YYMARKER = YYCURSOR);
         if(yych <= 'h') {
             if(yych <= 'L') {
-                if(yych >= 'L') goto yy997;
+                if(yych >= 'L') goto yy1004;
             } else {
-                if(yych == 'U') goto yy996;
+                if(yych == 'U') goto yy1003;
             }
         } else {
             if(yych <= 'l') {
-                if(yych <= 'i') goto yy998;
-                if(yych >= 'l') goto yy997;
+                if(yych <= 'i') goto yy1005;
+                if(yych >= 'l') goto yy1004;
             } else {
-                if(yych == 'u') goto yy996;
+                if(yych == 'u') goto yy1003;
             }
         }
-yy995:
-#line 411 "strict_cpp.re"
+yy1002:
+#line 419 "strict_cpp.re"
         { BOOST_WAVE_RET(T_INTLIT); }
-#line 6818 "strict_cpp_re.inc"
-yy996:
+#line 6852 "strict_cpp_re.inc"
+yy1003:
         yych = *++YYCURSOR;
-        if(yych == 'L') goto yy1005;
-        if(yych == 'l') goto yy1005;
-        goto yy995;
-yy997:
+        if(yych == 'L') goto yy1012;
+        if(yych == 'l') goto yy1012;
+        goto yy1002;
+yy1004:
         yych = *++YYCURSOR;
         if(yych <= 'U') {
-            if(yych == 'L') goto yy1004;
-            if(yych <= 'T') goto yy995;
-            goto yy1003;
+            if(yych == 'L') goto yy1011;
+            if(yych <= 'T') goto yy1002;
+            goto yy1010;
         } else {
             if(yych <= 'l') {
-                if(yych <= 'k') goto yy995;
-                goto yy1004;
+                if(yych <= 'k') goto yy1002;
+                goto yy1011;
             } else {
-                if(yych == 'u') goto yy1003;
-                goto yy995;
+                if(yych == 'u') goto yy1010;
+                goto yy1002;
             }
         }
-yy998:
+yy1005:
         yych = *++YYCURSOR;
-        if(yych == '6') goto yy1000;
-yy999:
+        if(yych == '6') goto yy1007;
+yy1006:
         YYCURSOR = YYMARKER;
-        goto yy995;
-yy1000:
+        goto yy1002;
+yy1007:
         yych = *++YYCURSOR;
-        if(yych != '4') goto yy999;
-yy1001:
+        if(yych != '4') goto yy1006;
+yy1008:
         ++YYCURSOR;
-yy1002:
-#line 408 "strict_cpp.re"
+yy1009:
+#line 416 "strict_cpp.re"
         { BOOST_WAVE_RET(T_LONGINTLIT); }
-#line 6853 "strict_cpp_re.inc"
-yy1003:
+#line 6887 "strict_cpp_re.inc"
+yy1010:
         yych = *++YYCURSOR;
-        goto yy995;
-yy1004:
+        goto yy1002;
+yy1011:
         yych = *++YYCURSOR;
-        if(yych == 'U') goto yy1001;
-        if(yych == 'u') goto yy1001;
+        if(yych == 'U') goto yy1008;
+        if(yych == 'u') goto yy1008;
+        goto yy1009;
+yy1012:
+        ++YYCURSOR;
+        if((yych = *YYCURSOR) == 'L') goto yy1008;
+        if(yych == 'l') goto yy1008;
         goto yy1002;
-yy1005:
-        ++YYCURSOR;
-        if((yych = *YYCURSOR) == 'L') goto yy1001;
-        if(yych == 'l') goto yy1001;
-        goto yy995;
     }
 }
-#line 412 "strict_cpp.re"
+#line 420 "strict_cpp.re"
 
     }
     else {
     {
 
-#line 6875 "strict_cpp_re.inc"
+#line 6909 "strict_cpp_re.inc"
     {
         YYCTYPE yych;
         if((YYLIMIT - YYCURSOR) < 3) YYFILL(3);
         yych = *YYCURSOR;
         if(yych <= 'U') {
-            if(yych == 'L') goto yy1010;
-            if(yych >= 'U') goto yy1009;
+            if(yych == 'L') goto yy1017;
+            if(yych >= 'U') goto yy1016;
         } else {
             if(yych <= 'l') {
-                if(yych >= 'l') goto yy1010;
+                if(yych >= 'l') goto yy1017;
             } else {
-                if(yych == 'u') goto yy1009;
+                if(yych == 'u') goto yy1016;
             }
         }
-yy1008:
-#line 420 "strict_cpp.re"
+yy1015:
+#line 428 "strict_cpp.re"
         { BOOST_WAVE_RET(T_INTLIT); }
-#line 6893 "strict_cpp_re.inc"
-yy1009:
+#line 6927 "strict_cpp_re.inc"
+yy1016:
         yych = *++YYCURSOR;
-        if(yych == 'L') goto yy1015;
-        if(yych == 'l') goto yy1015;
-        goto yy1008;
-yy1010:
+        if(yych == 'L') goto yy1022;
+        if(yych == 'l') goto yy1022;
+        goto yy1015;
+yy1017:
         yych = *++YYCURSOR;
         if(yych <= 'U') {
-            if(yych == 'L') goto yy1012;
-            if(yych <= 'T') goto yy1008;
+            if(yych == 'L') goto yy1019;
+            if(yych <= 'T') goto yy1015;
         } else {
             if(yych <= 'l') {
-                if(yych <= 'k') goto yy1008;
-                goto yy1012;
+                if(yych <= 'k') goto yy1015;
+                goto yy1019;
             } else {
-                if(yych != 'u') goto yy1008;
+                if(yych != 'u') goto yy1015;
             }
         }
         yych = *++YYCURSOR;
-        goto yy1008;
-yy1012:
+        goto yy1015;
+yy1019:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) == 'U') goto yy1014;
-        if(yych == 'u') goto yy1014;
-yy1013:
-#line 417 "strict_cpp.re"
+        if((yych = *YYCURSOR) == 'U') goto yy1021;
+        if(yych == 'u') goto yy1021;
+yy1020:
+#line 425 "strict_cpp.re"
         { BOOST_WAVE_RET(T_LONGINTLIT); }
-#line 6921 "strict_cpp_re.inc"
-yy1014:
+#line 6955 "strict_cpp_re.inc"
+yy1021:
         yych = *++YYCURSOR;
-        goto yy1013;
-yy1015:
+        goto yy1020;
+yy1022:
         ++YYCURSOR;
-        if((yych = *YYCURSOR) == 'L') goto yy1014;
-        if(yych == 'l') goto yy1014;
-        goto yy1008;
+        if((yych = *YYCURSOR) == 'L') goto yy1021;
+        if(yych == 'l') goto yy1021;
+        goto yy1015;
     }
 }
-#line 421 "strict_cpp.re"
+#line 429 "strict_cpp.re"
 
     }
 }

Modified: boost/trunk/libs/wave/src/instantiate_cpp_exprgrammar.cpp
===================================================================
--- boost/trunk/libs/wave/src/instantiate_cpp_exprgrammar.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/instantiate_cpp_exprgrammar.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
     Boost.Wave: A Standard compliant C++ preprocessor library
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/src/instantiate_cpp_grammar.cpp
===================================================================
--- boost/trunk/libs/wave/src/instantiate_cpp_grammar.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/instantiate_cpp_grammar.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
     Boost.Wave: A Standard compliant C++ preprocessor library
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -13,6 +13,7 @@
 #if BOOST_WAVE_SEPARATE_GRAMMAR_INSTANTIATION != 0
 
 #include <string>
+#include <list>
 
 #include <boost/wave/cpplexer/cpp_lex_token.hpp>
 #include <boost/wave/cpplexer/cpp_lex_iterator.hpp>
@@ -33,10 +34,12 @@
 //
 ///////////////////////////////////////////////////////////////////////////////
 
-typedef boost::wave::cpplexer::lex_iterator<
-        boost::wave::cpplexer::lex_token<> >
-    lexer_type;
-template struct boost::wave::grammars::cpp_grammar_gen<lexer_type>;
+typedef boost::wave::cpplexer::lex_token<> token_type;
+typedef boost::wave::cpplexer::lex_iterator<token_type> lexer_type;
+typedef std::list<token_type, boost::fast_pool_allocator<token_type> > 
+    token_sequence_type;
+    
+template struct boost::wave::grammars::cpp_grammar_gen<lexer_type, token_sequence_type>;
 
 // the suffix header occurs after all of the code
 #ifdef BOOST_HAS_ABI_HEADERS

Modified: boost/trunk/libs/wave/src/instantiate_cpp_literalgrs.cpp
===================================================================
--- boost/trunk/libs/wave/src/instantiate_cpp_literalgrs.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/instantiate_cpp_literalgrs.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
     Boost.Wave: A Standard compliant C++ preprocessor library
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/src/instantiate_defined_grammar.cpp
===================================================================
--- boost/trunk/libs/wave/src/instantiate_defined_grammar.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/instantiate_defined_grammar.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
     Boost.Wave: A Standard compliant C++ preprocessor library
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/src/instantiate_predef_macros.cpp
===================================================================
--- boost/trunk/libs/wave/src/instantiate_predef_macros.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/instantiate_predef_macros.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
     Boost.Wave: A Standard compliant C++ preprocessor library
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/src/instantiate_re2c_lexer.cpp
===================================================================
--- boost/trunk/libs/wave/src/instantiate_re2c_lexer.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/instantiate_re2c_lexer.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/libs/wave/src/instantiate_re2c_lexer_str.cpp
===================================================================
--- boost/trunk/libs/wave/src/instantiate_re2c_lexer_str.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/instantiate_re2c_lexer_str.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -48,8 +48,10 @@
 //
 ///////////////////////////////////////////////////////////////////////////////
 
+#if !defined(BOOST_WAVE_STRINGTYPE_USE_STDSTRING)
 template struct boost::wave::cpplexer::new_lexer_gen<std::string::iterator>;
 template struct boost::wave::cpplexer::new_lexer_gen<std::string::const_iterator>;
+#endif
 
 // the suffix header occurs after all of the code
 #ifdef BOOST_HAS_ABI_HEADERS

Modified: boost/trunk/libs/wave/src/token_ids.cpp
===================================================================
--- boost/trunk/libs/wave/src/token_ids.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/token_ids.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -13,6 +13,7 @@
 #define BOOST_WAVE_SOURCE 1
 #include <string>
 #include <boost/assert.hpp>
+#include <boost/static_assert.hpp>
 
 #include <boost/wave/wave_config.hpp>
 #include <boost/wave/token_ids.hpp>
@@ -184,7 +185,7 @@
     /* 401 */   "PP_HHEADER",
     /* 402 */   "EOF",
     /* 403 */   "EOI",
-    /* 404 */   "PP_NUMBER"
+    /* 404 */   "PP_NUMBER",
 
               // MS extensions
     /* 405 */   "MSEXT_INT8",
@@ -204,8 +205,13 @@
     /* 419 */   "MSEXT_ASM",
     /* 420 */   "MSEXT_REGION",
     /* 421 */   "MSEXT_ENDREGION",
-    };   
-     
+    };
+
+    // make sure, I have not forgotten any commas (as I did more than once)
+    BOOST_STATIC_ASSERT(
+        sizeof(tok_names)/sizeof(tok_names[0]) == T_LAST_TOKEN-T_FIRST_TOKEN
+    );
+    
     unsigned int id = BASEID_FROM_TOKEN(tokid)-T_FIRST_TOKEN;
     return (id < T_LAST_TOKEN-T_FIRST_TOKEN) ? tok_names[id] : "<UnknownToken>";
 }
@@ -219,7 +225,7 @@
 //
 //      Please note that the sequence of token names must match the sequence of
 //      token id's defined in then enum token_id above.
-static char const *tok_names[] = {
+static char const *tok_values[] = {
     /* 256 */   "&",
     /* 257 */   "&&",
     /* 258 */   "=",
@@ -390,8 +396,13 @@
     /* 421 */   "#endregion",
     };   
      
+    // make sure, I have not forgotten any commas (as I did more than once)
+    BOOST_STATIC_ASSERT(
+        sizeof(tok_values)/sizeof(tok_values[0]) == T_LAST_TOKEN-T_FIRST_TOKEN
+    );
+
     unsigned int id = BASEID_FROM_TOKEN(tokid)-T_FIRST_TOKEN;
-    return (id < T_LAST_TOKEN-T_FIRST_TOKEN) ? tok_names[id] : "<UnknownToken>";
+    return (id < T_LAST_TOKEN-T_FIRST_TOKEN) ? tok_values[id] : "<UnknownToken>";
 }
 
 ///////////////////////////////////////////////////////////////////////////////

Modified: boost/trunk/libs/wave/src/wave_config_constant.cpp
===================================================================
--- boost/trunk/libs/wave/src/wave_config_constant.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/src/wave_config_constant.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,11 +4,13 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2005 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
 
+#define BOOST_WAVE_SOURCE 1
+#include <cstring>
 #include <boost/preprocessor/stringize.hpp>
 
 #include <boost/wave/wave_config.hpp>
@@ -20,7 +22,7 @@
     ///////////////////////////////////////////////////////////////////////////
     //  Call this function to test the configuration of the calling application
     //  against the configuration of the linked library.
-    bool 
+    BOOST_WAVE_DECL bool 
     test_configuration(unsigned int config, char const* pragma_keyword, 
         char const* string_type_str)
     {

Deleted: boost/trunk/libs/wave/test/build/Jamfile
===================================================================
--- boost/trunk/libs/wave/test/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,174 +0,0 @@
-# Boost.Wave: A Standard compliant C++ preprocessor library
-#
-# Boost Wave Library Test Jamfile
-#
-# http://www.boost.org/
-#
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost 
-# Software License, Version 1.0. (See accompanying file 
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-subproject libs/wave/test/build ;
-
-# bring in the rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-#
-# These are the sources to compile for the testwave application
-#
-TESTWAVE_SOURCES = testwave testwave_app    ;
-
-#
-# This is the directory where the test files reside
-#
-TESTWAVE_DIR = $(BOOST_ROOT)/libs/wave/test/testwave/testfiles
-    ;
-
-#
-# This are the arguments for the testwave executable
-#
-TESTWAVE_ARGUMENTS = 
-        -d4                              # use -d4 for verbose results 
-        -S$(TESTWAVE_DIR) 
-        -S$(BOOST_ROOT) -I$(BOOST_ROOT)
-    ;
-
-#
-# These are the names of the different unit tests to run
-#
-TESTWAVE_FILES = test.cfg
-    ;
-
-#
-# this template defines the options common to all wave lexer tests:
-#
-template wave-lexer-test 
-    : 
-        <lib>../../build/boost_wave    # sources
-    : 
-        <include>$(BOOST_ROOT) 
-        <sysinclude>$(BOOST_ROOT)
-        <vc-7_1><*><rtti>off           # workaround for compiler bug
-        <vc-7_1-stlport><*><rtti>off
-        std::locale-support
-    : 
-        debug                          # build variants
-    ;
-
-#
-# this template defines the options common to all wave tests:
-#
-template wave-test 
-    : 
-        <lib>../../build/boost_wave    # sources
-        <lib>../../../program_options/build/boost_program_options
-        <lib>../../../filesystem/build/boost_filesystem
-    : 
-        <include>$(BOOST_ROOT) 
-        <sysinclude>$(BOOST_ROOT)
-        <vc-7_1><*><rtti>off           # workaround for compiler bug
-        <vc-7_1-stlport><*><rtti>off
-        std::locale-support
-    : 
-        debug                          # build variants
-    ;
-
-template wave-test-dll
-    : 
-        <dll>../../build/boost_wave    # sources
-        <dll>../../../program_options/build/boost_program_options
-        <dll>../../../filesystem/build/boost_filesystem
-    : 
-        <include>$(BOOST_ROOT) 
-        <sysinclude>$(BOOST_ROOT)
-        <vc-7_1><*><rtti>off           # workaround for compiler bug
-        <vc-7_1-stlport><*><rtti>off
-        std::locale-support
-        <define>BOOST_ALL_DYN_LINK=1
-        <runtime-link>dynamic
-    : 
-        debug                          # build variants
-    ;
-
-#
-# Wave test suite
-#
-test-suite wave
-    :
-        # test the wave preprocessing component (dll version)
-        [   
-            run
-            # sources
-                <template>wave-test-dll 
-                ../testwave/$(TESTWAVE_SOURCES).cpp
-            :
-            # arguments
-                $(TESTWAVE_ARGUMENTS) 
-                --config-file=$(TESTWAVE_DIR)/$(TESTWAVE_FILES)
-            :
-            # input files
-            :
-            # requirements
-                <define>BOOST_LIB_DIAGNOSTIC=1
-            :
-            # name
-                testwave_dll
-        ]
-        # test the wave preprocessing component
-        [   
-            run
-            # sources
-                <template>wave-test 
-                ../testwave/$(TESTWAVE_SOURCES).cpp
-            :
-            # arguments
-                $(TESTWAVE_ARGUMENTS) 
-                --config-file=$(TESTWAVE_DIR)/$(TESTWAVE_FILES)
-            :
-            # input files
-            :
-            # requirements
-                <define>BOOST_LIB_DIAGNOSTIC=1
-            :
-            # name
-                testwave
-        ]
-        # test the Slex wave lexing component
-        [   
-            run
-            # sources
-                <template>wave-lexer-test 
-                ../testlexers/test_slex_lexer.cpp
-            :
-            # arguments
-            :
-            # input files
-            :
-            # requirements
-                <define>BOOST_LIB_DIAGNOSTIC=1
-            :
-            # name
-                test_slex_lexer
-        ]
-        # test the Re2C wave lexing component
-        [   
-            run
-            # sources
-                <template>wave-lexer-test 
-                ../testlexers/test_re2c_lexer.cpp
-            :
-            # arguments
-            :
-            # input files
-            :
-            # requirements
-                <define>BOOST_LIB_DIAGNOSTIC=1
-            :
-            # name
-                test_re2c_lexer
-        ]
-    ;
-

Modified: boost/trunk/libs/wave/test/testlexers/test_re2c_lexer.cpp
===================================================================
--- boost/trunk/libs/wave/test/testlexers/test_re2c_lexer.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testlexers/test_re2c_lexer.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,7 +13,9 @@
 #include <limits>
 
 #include <boost/wave/wave_config.hpp>
+#if !BOOST_WORKAROUND(__SUNPRO_CC, <= 0x580)
 #undef BOOST_WAVE_SEPARATE_LEXER_INSTANTIATION
+#endif
 
 #include <boost/detail/lightweight_test.hpp>
 #if defined(TESTLEXERS_TIMING)

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_009.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_009.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_009.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,7 @@
 // Tests error reporting: illegal #if expressions. 
 
 // 14.4: Unbalanced parenthesis in #if defined operator.
-//E t_6_009.cpp(20): error: ill formed preprocessor expression: defined()
+//E t_6_009.cpp(20): error: ill formed preprocessor expression: defined(): defined ( MACRO
 #if defined ( MACRO
 #endif
 

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_019.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_019.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_019.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,8 +16,8 @@
 // Tests error reporting: #ifdef, #ifndef syntax errors.
 
 // 15.3: Not an identifier.
-//E t_6_019.cpp(20): error: ill formed preprocessor directive: #ifdef
-#ifdef  "string"
+//E t_6_019.cpp(20): error: ill formed preprocessor directive: #ifdef "string"
+#ifdef "string"
 #endif
 
 /*-

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_020.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_020.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_020.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,7 @@
 // Tests error reporting: #ifdef, #ifndef syntax errors.
 
 // 15.3: Not an identifier.
-//E t_6_020.cpp(20): error: ill formed preprocessor directive: #ifdef
+//E t_6_020.cpp(20): error: ill formed preprocessor directive: #ifdef 123
 #ifdef 123
 #endif
 

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_021.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_021.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_021.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,7 @@
 // Tests error reporting: #ifdef, #ifndef syntax errors.
 
 // 15.4: Excessive token sequence.
-//E t_6_021.cpp(20): error: ill formed preprocessor directive: #ifdef
+//E t_6_021.cpp(20): error: ill formed preprocessor directive: #ifdef  MACRO   Junk
 #ifdef  MACRO   Junk
 #endif
 

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_024.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_024.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_024.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,7 @@
 // Tests error reporting: Trailing junk of #else, #endif.
 
 // 16.2: Trailing junk of #endif.
-//E t_6_024.cpp(23): error: ill formed preprocessor directive: #endif
+//E t_6_024.cpp(23): error: ill formed preprocessor directive: #endif  MACRO_0
 #define MACRO_0     0
 #if     MACRO_0
 #else

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_032.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_032.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_032.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,7 @@
 // Tests error reporting: #define syntax errors.
 
 // 18.4: Not an identifier.
-//E t_6_032.cpp(20): error: ill formed preprocessor directive: #define
+//E t_6_032.cpp(20): error: ill formed preprocessor directive: #define "string"
 #define "string"
 
 /*-

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_033.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_033.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_033.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,7 @@
 // Tests error reporting: #define syntax errors.
 
 // 18.4: Not an identifier.
-//E t_6_033.cpp(20): error: ill formed preprocessor directive: #define
+//E t_6_033.cpp(20): error: ill formed preprocessor directive: #define 123
 #define 123
 
 /*-

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_035.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_035.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_035.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,7 @@
 // Tests error reporting: #define syntax errors.
 
 // 18.6: Empty parameter list.
-//E t_6_035.cpp(20): error: ill formed preprocessor directive: #define
+//E t_6_035.cpp(20): error: ill formed preprocessor directive: #define math( op, a, )      op( (a), (b))
 #define math( op, a, )      op( (a), (b))
 
 /*-

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_037.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_037.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_037.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,7 @@
 // Tests error reporting: #define syntax errors.
 
 // 18.8: Argument is not an identifier.
-//E t_6_037.cpp(20): error: ill formed preprocessor directive: #define
+//E t_6_037.cpp(20): error: ill formed preprocessor directive: #define NUMARGS( 1, +, 2)   (1 + 2)
 #define NUMARGS( 1, +, 2)   (1 + 2)
 
 /*-

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_051.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_051.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_051.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,7 @@
 // Tests error reporting: #undef errors.
 
 // 29.3: Not an identifier.
-//E t_6_051.cpp(20): error: ill formed preprocessor directive: #undef
+//E t_6_051.cpp(20): error: ill formed preprocessor directive: #undef  "string"
 #undef  "string"
 
 /*-

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_052.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_052.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_052.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,7 @@
 // Tests error reporting: #undef errors.
 
 // 29.3: Not an identifier.
-//E t_6_052.cpp(20): error: ill formed preprocessor directive: #undef
+//E t_6_052.cpp(20): error: ill formed preprocessor directive: #undef  123
 #undef  123
 
 /*-

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_053.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_053.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_053.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -16,7 +16,7 @@
 // Tests error reporting: #undef errors.
 
 // 29.4: Excessive token sequence.
-//E t_6_053.cpp(20): error: ill formed preprocessor directive: #undef
+//E t_6_053.cpp(20): error: ill formed preprocessor directive: #undef  MACRO_0     Junk
 #undef  MACRO_0     Junk
 
 /*-

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_058.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_058.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_058.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,7 +17,7 @@
 
 // 32.5: Value of a numerical escape sequence in character constant should
 //       be in the range of char.
-//E t_6_058.cpp(21): warning: character literal out of range: '\x123'
+//E t_6_058.cpp(21): warning: expression contains out of range character literal: '\x123' == 0x123
 #if '\x123' == 0x123
 false
 #else

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_059.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_059.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_059.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,7 +17,7 @@
 
 // 32.5: Value of a numerical escape sequence in character constant should
 //       be in the range of char.
-//E t_6_059.cpp(21): warning: character literal out of range: L'\xabcdef012'
+//E t_6_059.cpp(21): warning: expression contains out of range character literal: L'\xabcdef012' == 0xbcdef012
 #if L'\xabcdef012' == 0xbcdef012
 false
 #else

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_060.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_060.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_060.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,7 +17,7 @@
 
 // In ASCII character set. 
 // 35.2: 
-//E t_6_060.cpp(21): warning: character literal out of range: 'abcdefghi'
+//E t_6_060.cpp(21): warning: expression contains out of range character literal: 'abcdefghi' == '\x61\x62\x63\x64\x65\x66\x67\x68\x69'
 #if 'abcdefghi' == '\x61\x62\x63\x64\x65\x66\x67\x68\x69'
 false
 #else

Modified: boost/trunk/libs/wave/test/testwave/testfiles/t_6_062.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/t_6_062.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/t_6_062.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,7 +17,7 @@
 
 // 7.4: string literal in #line directive shall be a character string
 //      literal.
-//E t_6_062.cpp(21): warning: ill formed #line directive: 123 L"wide"
+//E t_6_062.cpp(21): warning: filename argument of #line directive should be a narrow string literal: 123 L"wide"
 #line 123 L"wide"
 
 /*-

Copied: boost/trunk/libs/wave/test/testwave/testfiles/t_6_063.cpp (from rev 14034, boost/branches/upstream/current/libs/wave/test/testwave/testfiles/t_6_063.cpp)

Copied: boost/trunk/libs/wave/test/testwave/testfiles/t_6_063.hpp (from rev 14034, boost/branches/upstream/current/libs/wave/test/testwave/testfiles/t_6_063.hpp)

Copied: boost/trunk/libs/wave/test/testwave/testfiles/t_6_064.cpp (from rev 14034, boost/branches/upstream/current/libs/wave/test/testwave/testfiles/t_6_064.cpp)

Copied: boost/trunk/libs/wave/test/testwave/testfiles/t_6_065.cpp (from rev 14034, boost/branches/upstream/current/libs/wave/test/testwave/testfiles/t_6_065.cpp)

Copied: boost/trunk/libs/wave/test/testwave/testfiles/t_6_066.cpp (from rev 14034, boost/branches/upstream/current/libs/wave/test/testwave/testfiles/t_6_066.cpp)

Copied: boost/trunk/libs/wave/test/testwave/testfiles/t_6_066.hpp (from rev 14034, boost/branches/upstream/current/libs/wave/test/testwave/testfiles/t_6_066.hpp)

Copied: boost/trunk/libs/wave/test/testwave/testfiles/t_6_067.cpp (from rev 14034, boost/branches/upstream/current/libs/wave/test/testwave/testfiles/t_6_067.cpp)

Copied: boost/trunk/libs/wave/test/testwave/testfiles/t_6_067.hpp (from rev 14034, boost/branches/upstream/current/libs/wave/test/testwave/testfiles/t_6_067.hpp)

Copied: boost/trunk/libs/wave/test/testwave/testfiles/t_6_068.cpp (from rev 14034, boost/branches/upstream/current/libs/wave/test/testwave/testfiles/t_6_068.cpp)

Copied: boost/trunk/libs/wave/test/testwave/testfiles/t_6_069.cpp (from rev 14034, boost/branches/upstream/current/libs/wave/test/testwave/testfiles/t_6_069.cpp)

Copied: boost/trunk/libs/wave/test/testwave/testfiles/t_9_018.cpp (from rev 14034, boost/branches/upstream/current/libs/wave/test/testwave/testfiles/t_9_018.cpp)

Modified: boost/trunk/libs/wave/test/testwave/testfiles/test.cfg
===================================================================
--- boost/trunk/libs/wave/test/testwave/testfiles/test.cfg	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testfiles/test.cfg	2007-02-16 16:48:35 UTC (rev 14035)
@@ -194,6 +194,13 @@
 t_6_060.cpp
 t_6_061.cpp
 t_6_062.cpp
+t_6_063.cpp
+t_6_064.cpp
+t_6_065.cpp
+t_6_066.cpp
+t_6_067.cpp
+t_6_068.cpp
+t_6_069.cpp
 
 #
 # t_9: General preprocessing problems
@@ -215,3 +222,4 @@
 t_9_015.cpp
 t_9_016.cpp
 t_9_017.cpp
+t_9_018.cpp

Modified: boost/trunk/libs/wave/test/testwave/testwave.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testwave.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testwave.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -275,7 +275,7 @@
             std::cout << "." << std::endl;
         }
     }
-    catch (std::exception const &e) {
+    catch (std::exception const& e) {
         std::cerr << "testwave: exception caught: " << e.what() << std::endl;
         return (std::numeric_limits<int>::max)() - 1;
     }

Modified: boost/trunk/libs/wave/test/testwave/testwave_app.cpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testwave_app.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testwave_app.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -160,7 +160,8 @@
                         }
                         std::string source = expected.substr(pos1+3, p-pos1-3);
                         std::string result, error;
-                        bool pp_result = preprocess_file(filename, source, result, error);
+                        bool pp_result = preprocess_file(filename, source, 
+                            result, error, true);
                         if (!pp_result) {
                             std::cerr 
                                 << "testwave: preprocessing error in $E directive: " 
@@ -492,14 +493,12 @@
     std::string const& trim_whitespace(std::string& value)
     {
         std::string::size_type first = value.find_first_not_of(" \t");
-        std::string::size_type last = std::string::npos;
-        
         if (std::string::npos == first) 
             value.clear();
         else {
-            last = value.find_last_not_of(" \t")+1;
+            std::string::size_type last = value.find_last_not_of(" \t");
             assert(std::string::npos != last);
-            value = value.substr(first, last-first);
+            value = value.substr(first, last-first+1);
         }
         return value;
     }
@@ -553,7 +552,8 @@
                         }
                         std::string source = value.substr(4, p-4);
                         std::string result, error;
-                        bool pp_result = preprocess_file(filename, source, result, error);
+                        bool pp_result = preprocess_file(filename, source, 
+                            result, error, true);
                         if (!pp_result) {
                             std::cerr 
                                 << "testwave: preprocessing error in '" << flag
@@ -598,7 +598,8 @@
                         }
                         std::string source = value.substr(4, p-4);
                         std::string result, error;
-                        bool pp_result = preprocess_file(filename, source, result, error);
+                        bool pp_result = preprocess_file(filename, source, 
+                            result, error, true);
                         if (!pp_result) {
                             std::cerr 
                                 << "testwave: preprocessing error in '" << flag
@@ -674,7 +675,7 @@
 template <typename Context>
 bool 
 testwave_app::extract_options(std::string const& filename, 
-    std::string const& instr, Context& ctx)
+    std::string const& instr, Context& ctx, bool single_line)
 {
     if (9 == debuglevel) {
         std::cerr << "extract_options: extracting options" << std::endl;
@@ -691,7 +692,7 @@
     //  object
         po::variables_map local_vm;
         cmd_line_utils::read_config_options(debuglevel, options, desc_options, local_vm);
-        initialise_options(ctx, local_vm);
+        initialise_options(ctx, local_vm, single_line);
     }
     catch (std::exception const &e) {
         std::cerr << filename << ": exception caught: " << e.what() 
@@ -729,10 +730,11 @@
 
 template <typename Context>
 bool 
-testwave_app::initialise_options(Context& ctx, po::variables_map const& vm)
+testwave_app::initialise_options(Context& ctx, po::variables_map const& vm,
+    bool single_line)
 {
     if (9 == debuglevel) {
-        std::cerr << "initialise_options: initialising options" << std::endl;
+        std::cerr << "initialise_options: initializing options" << std::endl;
     }
 
 //  initialize the given context from the parsed options
@@ -787,14 +789,19 @@
     }
     
 // enable trigraph conversion
-    ctx.set_language(boost::wave::set_support_options(ctx.get_language(), 
-        (boost::wave::language_support)(
-            boost::wave::get_support_options(ctx.get_language()) | 
-            boost::wave::support_option_convert_trigraphs |
-            boost::wave::support_option_single_line)
-        )
-    );
+    if (9 == debuglevel) {
+        std::cerr << "initialise_options: option: convert_trigraphs" << std::endl;
+    }
+    ctx.set_language(boost::wave::enable_convert_trigraphs(ctx.get_language()));
 
+// enable single_line mode
+    if (single_line) {
+        if (9 == debuglevel) {
+            std::cerr << "initialise_options: option: single_line" << std::endl;
+        }
+        ctx.set_language(boost::wave::enable_single_line(ctx.get_language()));
+    }
+    
 //  add include directories to the system include search paths
     if (vm.count("sysinclude")) {
     std::vector<std::string> const& syspaths = 
@@ -1094,7 +1101,7 @@
 ///////////////////////////////////////////////////////////////////////////////
 bool 
 testwave_app::preprocess_file(std::string filename, std::string const& instr, 
-    std::string& result, std::string& error)
+    std::string& result, std::string& error, bool single_line)
 {
 //  create the wave::context object and initialize it from the file to 
 //  preprocess (may contain options inside of special comments)
@@ -1113,11 +1120,11 @@
         context_type ctx(instr.begin(), instr.end(), filename.c_str());
 
     //  initialize the context from the options given on the command line
-        if (!initialise_options(ctx, global_vm))
+        if (!initialise_options(ctx, global_vm, single_line))
             return false;
 
     //  extract the options from the input data and initialize the context 
-        if (!extract_options(filename, instr, ctx))
+        if (!extract_options(filename, instr, ctx, single_line))
             return false;
 
     //  add special predefined macros

Modified: boost/trunk/libs/wave/test/testwave/testwave_app.hpp
===================================================================
--- boost/trunk/libs/wave/test/testwave/testwave_app.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/wave/test/testwave/testwave_app.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -67,30 +67,30 @@
         std::string const& instr, std::string& expected);
         
     //  Extracts the required preprocessing options from the given input data 
-    //  and initialises the given Wave context object accordingly. 
+    //  and initializes the given Wave context object accordingly. 
     //  We allow the same (applicable) options to be used as are valid for the 
     //  wave driver executable.
     template <typename Context>
     bool extract_options(std::string const& filename, 
-        std::string const& instr, Context& ctx);
+        std::string const& instr, Context& ctx, bool single_line);
 
     //  transfers the options collected in the vm parameter into the given 
     //  context
     template <typename Context>
     bool initialise_options(Context& ctx, 
-        boost::program_options::variables_map const& vm);
+        boost::program_options::variables_map const& vm, bool single_line);
 
     //  Preprocess the given input data and return the generated output through 
     //  the parameter 'result'.
     bool preprocess_file(std::string filename, std::string const& instr, 
-        std::string& result, std::string& error);
+        std::string& result, std::string& error, bool single_line = false);
 
     //  Add special predefined macros to the context object
     template <typename Context>
     bool add_predefined_macros(Context& ctx);
 
     //  This function compares the real result and the expected one but first 
-    //  replaces all occurences in the expected result of 
+    //  replaces all occurrences in the expected result of 
     //      $E: to the result of preprocessing the given expression
     //      $F: to the passed full filepath 
     //      $P: to the full path

Modified: boost/trunk/libs/xpressive/doc/Jamfile.v2
===================================================================
--- boost/trunk/libs/xpressive/doc/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/doc/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -25,6 +25,10 @@
 xml xpressive
     :
         xpressive.qbk
+#    : : :
+#        <xsl:param>toc.max.depth=3
+#        <xsl:param>toc.section.depth=3
+#        <xsl:param>chunk.section.depth=3
     ;
 
 boostbook standalone

Modified: boost/trunk/libs/xpressive/doc/static_regexes.qbk
===================================================================
--- boost/trunk/libs/xpressive/doc/static_regexes.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/doc/static_regexes.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -156,8 +156,8 @@
     [[[^\B]]              [`~_b`]                                         [not word boundary assertion.]]
     [[[^\\n]]             [`_n`]                                          [literal newline.]]
     [[[^.]]               [`~_n`]                                         [any character except a literal newline (without Perl's /s modifier).]]
-    [[[^\\r?\\n]]         [`_ln`]                                         [logical newline.]]
-    [[[^(?!\[\\r\\n\]).]] [`~_ln`]                                        [any single character not a logical newline.]]
+    [[[^\\r?\\n|\\r]]     [`_ln`]                                         [logical newline.]]
+    [[[^\[^\\r\\n\]]]     [`~_ln`]                                        [any single character not a logical newline.]]
     [[[^\w]]              [`_w`]                                          [a word character, equivalent to set\[alnum | '_'\].]]
     [[[^\W]]              [`~_w`]                                         [not a word character, equivalent to ~set\[alnum | '_'\].]]
     [[[^\d]]              [`_d`]                                          [a digit character.]]

Modified: boost/trunk/libs/xpressive/doc/xpressive.qbk
===================================================================
--- boost/trunk/libs/xpressive/doc/xpressive.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/doc/xpressive.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -49,7 +49,7 @@
 [def _syntax_option_type_    [^[enumref boost::xpressive::regex_constants::syntax_option_type syntax_option_type]]]
 [def _match_flag_type_       [^[enumref boost::xpressive::regex_constants::match_flag_type match_flag_type]]]
 [def _error_type_            [^[enumref boost::xpressive::regex_constants::error_type error_type]]]
-[def _regex_compile_         [^[memberref boost::xpressive::basic_regex::compile basic_regex<>::compile()]]]
+[def _regex_compile_         [^[memberref boost::xpressive::compile basic_regex::compile()]]]
 
 [include preface.qbk]
 

Deleted: boost/trunk/libs/xpressive/example/Jamfile
===================================================================
--- boost/trunk/libs/xpressive/example/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/example/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +0,0 @@
-# xpressive library examples Jamfile
-
-# Copyright Eric Niebler 2004
-
-# Use, modification, and distribution is subject to the Boost Software
-# License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-
-subproject libs/xpressive/examples ;
-
-exe examples : main.cpp : <include>$(BOOST_ROOT) ;

Modified: boost/trunk/libs/xpressive/example/example.vcproj
===================================================================
--- boost/trunk/libs/xpressive/example/example.vcproj	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/example/example.vcproj	2007-02-16 16:48:35 UTC (rev 14035)
@@ -176,6 +176,9 @@
 			<File
 				RelativePath="..\..\..\boost\xpressive\xpressive_static.hpp">
 			</File>
+			<File
+				RelativePath="..\..\..\boost\xpressive\xpressive_typeof.hpp">
+			</File>
 			<Filter
 				Name="detail"
 				Filter="">
@@ -303,9 +306,6 @@
 							RelativePath="..\..\..\boost\xpressive\detail\core\matcher\mark_matcher.hpp">
 						</File>
 						<File
-							RelativePath="..\..\..\boost\xpressive\detail\core\matcher\optional_matcher.hpp">
-						</File>
-						<File
 							RelativePath="..\..\..\boost\xpressive\detail\core\matcher\posix_charset_matcher.hpp">
 						</File>
 						<File
@@ -436,9 +436,6 @@
 						RelativePath="..\..\..\boost\xpressive\detail\utility\cons.hpp">
 					</File>
 					<File
-						RelativePath="..\..\..\boost\xpressive\detail\utility\counted_base.hpp">
-					</File>
-					<File
 						RelativePath="..\..\..\boost\xpressive\detail\utility\dont_care.hpp">
 					</File>
 					<File
@@ -465,9 +462,6 @@
 					<File
 						RelativePath="..\..\..\boost\xpressive\detail\utility\traits_utils.hpp">
 					</File>
-					<File
-						RelativePath="..\..\..\boost\xpressive\detail\utility\width.hpp">
-					</File>
 					<Filter
 						Name="chset"
 						Filter="">
@@ -509,9 +503,6 @@
 					<File
 						RelativePath="..\..\..\boost\xpressive\detail\dynamic\parser_traits.hpp">
 					</File>
-					<File
-						RelativePath="..\..\..\boost\xpressive\detail\dynamic\sequence.hpp">
-					</File>
 				</Filter>
 			</Filter>
 			<Filter

Modified: boost/trunk/libs/xpressive/index.html
===================================================================
--- boost/trunk/libs/xpressive/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,6 +5,11 @@
 <body>
 Automatic redirection failed, please go to
 <a href="../../doc/html/xpressive.html">../../doc/html/xpressive.html</a>
+<p>Copyright&nbsp;Eric Niebler 2006</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying file
+<a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at
+<a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>).
+</p>
 </body>
 </html>
 

Modified: boost/trunk/libs/xpressive/perf/Jamfile.v2
===================================================================
--- boost/trunk/libs/xpressive/perf/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/perf/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,9 @@
+# Copyright Eric Niebler 2006
 
+# Use, modification, and distribution is subject to the Boost Software
+# License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
+
 #project
 #    : requirements <library>../../../../boost/libs/regex/build//boost_regex
 #    ;

Modified: boost/trunk/libs/xpressive/perf/command_line.cpp
===================================================================
--- boost/trunk/libs/xpressive/perf/command_line.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/perf/command_line.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+//  (C) Copyright Eric Niebler 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)
 
 #include <iostream>
 #include <iomanip>
@@ -181,6 +185,14 @@
 void output_xml_results(bool show_description, const std::string& title, const std::string& filename)
 {
     std::stringstream os;
+    // Generate the copyright and license on the output file
+    os << "<!--\n"
+          " Copyright 2004 Eric Niebler.\n"
+          "\n"
+          " Distributed under the Boost Software License, Version 1.0.\n"
+          " (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n"
+          "-->\n";
+
     if(result_list.size())
     {
         // calculate the number of columns in this table

Modified: boost/trunk/libs/xpressive/perf/gcc/long_twain_search.xml
===================================================================
--- boost/trunk/libs/xpressive/perf/gcc/long_twain_search.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/perf/gcc/long_twain_search.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+<!--
+ Copyright 2004 Eric Niebler.
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+-->
 <informaltable frame="all">
 <bridgehead renderas="sect4"><phrase role="table-title">Long Searches</phrase></bridgehead>
 <tgroup cols="4">

Modified: boost/trunk/libs/xpressive/perf/gcc/short_matches.xml
===================================================================
--- boost/trunk/libs/xpressive/perf/gcc/short_matches.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/perf/gcc/short_matches.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+<!--
+ Copyright 2004 Eric Niebler.
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+-->
 <informaltable frame="all">
 <bridgehead renderas="sect4"><phrase role="table-title">Short Matches</phrase></bridgehead>
 <tgroup cols="5">

Modified: boost/trunk/libs/xpressive/perf/gcc/short_twain_search.xml
===================================================================
--- boost/trunk/libs/xpressive/perf/gcc/short_twain_search.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/perf/gcc/short_twain_search.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,7 @@
+<!--
+ Copyright 2004 Eric Niebler.
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+-->
 <para><emphasis>Results not available...</emphasis></para>

Modified: boost/trunk/libs/xpressive/perf/main.cpp
===================================================================
--- boost/trunk/libs/xpressive/perf/main.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/perf/main.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,13 @@
 /*
-*
-* Copyright (c) 2002
-* Dr John Maddock
-*
-* All rights reserved.
-* May not be transfered or disclosed to a third party without
-* prior consent of the author.
-*
-*/
+ *
+ * Copyright (c) 2002
+ * John Maddock
+ *
+ * Use, modification and distribution are subject to the
+ * Boost Software License, Version 1.0. (See accompanying file
+ * LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ *
+ */
 
 #include <iostream>
 #include <fstream>

Modified: boost/trunk/libs/xpressive/perf/msvc/long_twain_search.xml
===================================================================
--- boost/trunk/libs/xpressive/perf/msvc/long_twain_search.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/perf/msvc/long_twain_search.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+<!--
+ Copyright 2004 Eric Niebler.
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+-->
 <informaltable frame="all">
 <bridgehead renderas="sect4"><phrase role="table-title">Long Searches</phrase></bridgehead>
 <tgroup cols="4">

Modified: boost/trunk/libs/xpressive/perf/msvc/short_matches.xml
===================================================================
--- boost/trunk/libs/xpressive/perf/msvc/short_matches.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/perf/msvc/short_matches.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+<!--
+ Copyright 2004 Eric Niebler.
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+-->
 <informaltable frame="all">
 <bridgehead renderas="sect4"><phrase role="table-title">Short Matches</phrase></bridgehead>
 <tgroup cols="5">

Modified: boost/trunk/libs/xpressive/perf/msvc/short_twain_search.xml
===================================================================
--- boost/trunk/libs/xpressive/perf/msvc/short_twain_search.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/perf/msvc/short_twain_search.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,7 @@
+<!--
+ Copyright 2004 Eric Niebler.
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+-->
 <para><emphasis>Results not available...</emphasis></para>

Modified: boost/trunk/libs/xpressive/perf/regex_comparison.hpp
===================================================================
--- boost/trunk/libs/xpressive/perf/regex_comparison.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/perf/regex_comparison.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,11 @@
 /*
  *
  * Copyright (c) 2002
- * Dr John Maddock
+ * John Maddock
  *
- * All rights reserved.
- * May not be transfered or disclosed to a third party without
- * prior consent of the author.
+ * Use, modification and distribution are subject to the
+ * Boost Software License, Version 1.0. (See accompanying file
+ * LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
  *
  */
 
@@ -61,7 +61,7 @@
         static_xpressive_time(-1),
         //posix_time(-1),
         //pcre_time(-1),
-        factor(std::numeric_limits<double>::max()),
+        factor((std::numeric_limits<double>::max)()),
         expression(ex), 
         description(desc)
    {}

Modified: boost/trunk/libs/xpressive/perf/time_boost.cpp
===================================================================
--- boost/trunk/libs/xpressive/perf/time_boost.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/perf/time_boost.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,13 @@
 /*
-*
-* Copyright (c) 2002
-* Dr John Maddock
-*
-* All rights reserved.
-* May not be transfered or disclosed to a third party without
-* prior consent of the author.
-*
-*/
+ *
+ * Copyright (c) 2002
+ * John Maddock
+ *
+ * Use, modification and distribution are subject to the
+ * Boost Software License, Version 1.0. (See accompanying file
+ * LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ *
+ */
 
 #include "./regex_comparison.hpp"
 #include <boost/timer.hpp>

Modified: boost/trunk/libs/xpressive/perf/time_dynamic_xpressive.cpp
===================================================================
--- boost/trunk/libs/xpressive/perf/time_dynamic_xpressive.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/perf/time_dynamic_xpressive.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,13 @@
 /*
-*
-* Copyright (c) 2002
-* Dr John Maddock
-*
-* All rights reserved.
-* May not be transfered or disclosed to a third party without
-* prior consent of the author.
-*
-*/
+ *
+ * Copyright (c) 2002
+ * John Maddock
+ *
+ * Use, modification and distribution are subject to the
+ * Boost Software License, Version 1.0. (See accompanying file
+ * LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ *
+ */
 
 #include "./regex_comparison.hpp"
 #include <cassert>

Modified: boost/trunk/libs/xpressive/perf/time_static_xpressive.cpp
===================================================================
--- boost/trunk/libs/xpressive/perf/time_static_xpressive.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/perf/time_static_xpressive.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,13 @@
 /*
-*
-* Copyright (c) 2002
-* Dr John Maddock
-*
-* All rights reserved.
-* May not be transfered or disclosed to a third party without
-* prior consent of the author.
-*
-*/
+ *
+ * Copyright (c) 2002
+ * John Maddock
+ *
+ * Use, modification and distribution are subject to the
+ * Boost Software License, Version 1.0. (See accompanying file
+ * LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ *
+ */
 
 #include "./regex_comparison.hpp"
 #include <map>

Deleted: boost/trunk/libs/xpressive/test/Jamfile
===================================================================
--- boost/trunk/libs/xpressive/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,84 +0,0 @@
-# xpressive library test Jamfile
-
-# Copyright Eric Niebler 2004
-
-# Use, modification, and distribution is subject to the Boost Software
-# License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-
-subproject libs/xpressive/test ;
-
-# bring in rules for testing
-import testing ;
-
-# A bug in the Win32 intel compilers causes compilation of one of our
-# tests to take forever when debug symbols are enabled. This rule
-# turns them off when added to the requirements section
-local rule xpressive-requirements ( toolset variant : properties * )
-{
-    if $(NT) && [ MATCH (.*intel.*) : $(toolset) ]
-    {
-        properties = [ difference $(properties) : <debug-symbols>on ] <debug-symbols>off ;
-    }
-    if [ MATCH (.*stlport.*) : $(toolset) ]
-    {
-        properties = $(properties) <define>_STLP_EXPOSE_GLOBALS_IMPLEMENTATION ;
-    }
-    return $(properties) ;
-}
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-
-    template multi-threading : <dll>@boost/libs/thread/build/boost_thread :
-        <threading>multi
-        <define>BOOST_ALL_NO_LIB=1
-    ;
-
-    test-suite "xpressive"
-        : [ run regress.cpp : : : xpressive-requirements ]
-          [ run c_traits.cpp : : : xpressive-requirements ]
-          [ run test1.cpp : : : xpressive-requirements ]
-          [ run test2.cpp : : : xpressive-requirements ]
-          [ run test3.cpp : : : xpressive-requirements ]
-          [ run test4.cpp : : : xpressive-requirements ]
-          [ run test5.cpp : : : xpressive-requirements ]
-          [ run test6.cpp : : : xpressive-requirements ]
-          [ run test7.cpp : : : xpressive-requirements ]
-          [ run test8.cpp : : : xpressive-requirements ]
-          [ run test9.cpp : : : xpressive-requirements ]
-          [ run test10.cpp : : : xpressive-requirements ]
-          [ run test11.cpp : : : xpressive-requirements ]
-          [ run test1u.cpp : : : xpressive-requirements ]
-          [ run test2u.cpp : : : xpressive-requirements ]
-          [ run test3u.cpp : : : xpressive-requirements ]
-          [ run test4u.cpp : : : xpressive-requirements ]
-          [ run test5u.cpp : : : xpressive-requirements ]
-          [ run test6u.cpp : : : xpressive-requirements ]
-          [ run test7u.cpp : : : xpressive-requirements ]
-          [ run test8u.cpp : : : xpressive-requirements ]
-          [ run test9u.cpp : : : xpressive-requirements ]
-          [ run test10u.cpp : : : xpressive-requirements ]
-          [ run test11u.cpp : : : xpressive-requirements ]
-          [ run misc1.cpp : : : xpressive-requirements ]
-          [ run test_cycles.cpp  : : : xpressive-requirements ]
-#           [ run test_thread.cpp <template>multi-threading : : : xpressive-requirements ]
-          [ run test_non_char.cpp : : : xpressive-requirements ]
-          [ run test_static.cpp : : : xpressive-requirements ]
-          [ run test_dynamic.cpp : : : xpressive-requirements ]
-          [ link multiple_defs1.cpp multiple_defs2.cpp : xpressive-requirements : multiple_defs ]
-          [ compile test_basic_regex.cpp ]
-          [ compile test_match_results.cpp ]
-          [ compile test_regex_algorithms.cpp ]
-          [ compile test_regex_compiler.cpp ]
-          [ compile test_regex_constants.cpp ]
-          [ compile test_regex_error.cpp ]
-          [ compile test_regex_iterator.cpp ]
-          [ compile test_regex_primitives.cpp ]
-          [ compile test_regex_token_iterator.cpp ]
-          [ compile test_regex_traits.cpp ]
-          [ compile test_sub_match.cpp ]
-        ;
-}

Modified: boost/trunk/libs/xpressive/test/Jamfile.v2
===================================================================
--- boost/trunk/libs/xpressive/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,11 @@
 # bring in rules for testing
 import testing ;
 
-project : requirements <toolset>intel:<debug-symbols>off ;
+project
+  : requirements
+        <toolset>intel:<debug-symbols>off
+        <toolset>msvc,<stdlib>stlport:<define>_STLP_EXPOSE_GLOBALS_IMPLEMENTATION
+  ;
 
 test-suite "xpressive"
        : [ run regress.cpp ]
@@ -19,8 +23,8 @@
          [ run test7.cpp ]
          [ run test8.cpp ]
          [ run test9.cpp ]
-	 [ run test10.cpp ]
-	 [ run test11.cpp ]
+         [ run test10.cpp ]
+         [ run test11.cpp ]
          [ run test1u.cpp ]
          [ run test2u.cpp ]
          [ run test3u.cpp ]
@@ -30,9 +34,10 @@
          [ run test7u.cpp ]
          [ run test8u.cpp ]
          [ run test9u.cpp ]
-	 [ run test10u.cpp ]
-	 [ run test11u.cpp ]
+         [ run test10u.cpp ]
+         [ run test11u.cpp ]
          [ run misc1.cpp ]
+         [ run misc2.cpp ]
          [ run test_cycles.cpp ]
          [ run test_non_char.cpp ]
          [ run test_static.cpp ]

Modified: boost/trunk/libs/xpressive/test/misc1.cpp
===================================================================
--- boost/trunk/libs/xpressive/test/misc1.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/test/misc1.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -199,37 +199,6 @@
 }
 
 ///////////////////////////////////////////////////////////////////////////////
-// test for a sub-match scoping
-//
-void test5()
-{
-    sregex inner = sregex::compile( "(.)\\1" );
-    sregex outer = (s1= _) >> inner >> s1;
-    std::string abba("ABBA");
-
-    BOOST_CHECK(regex_match(abba, outer));
-}
-
-///////////////////////////////////////////////////////////////////////////////
-// Ye olde calculator. Test recursive grammar.
-//
-void test6()
-{
-    sregex group, factor, term, expression;
-
-    group       = '(' >> by_ref(expression) >> ')';
-    factor      = +_d | group;
-    term        = factor >> *(('*' >> factor) | ('/' >> factor));
-    expression  = term >> *(('+' >> term) | ('-' >> term));
-
-    smatch what;
-    std::string str("foo 9*(10+3) bar");
-
-    BOOST_REQUIRE(regex_search(str, what, expression));
-    BOOST_CHECK("9*(10+3)" == what[0]);
-}
-
-///////////////////////////////////////////////////////////////////////////////
 // test_main
 //
 int test_main( int, char*[] )
@@ -238,8 +207,6 @@
     test2();
     test3();
     test4();
-    test5();
-    test6();
 
     return 0;
 }

Copied: boost/trunk/libs/xpressive/test/misc2.cpp (from rev 14034, boost/branches/upstream/current/libs/xpressive/test/misc2.cpp)

Modified: boost/trunk/libs/xpressive/test/multiple_defs1.cpp
===================================================================
--- boost/trunk/libs/xpressive/test/multiple_defs1.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/test/multiple_defs1.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,10 @@
+///////////////////////////////////////////////////////////////////////////////
+// multiple_defs1.cpp
+//
+//  Copyright 2004 Eric Niebler. Distributed under the Boost
+//  Software License, Version 1.0. (See accompanying file
+//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 #include <boost/xpressive/xpressive.hpp>
 extern int f();
 int main()

Modified: boost/trunk/libs/xpressive/test/multiple_defs2.cpp
===================================================================
--- boost/trunk/libs/xpressive/test/multiple_defs2.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/test/multiple_defs2.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,10 @@
+///////////////////////////////////////////////////////////////////////////////
+// multiple_defs2.cpp
+//
+//  Copyright 2004 Eric Niebler. Distributed under the Boost
+//  Software License, Version 1.0. (See accompanying file
+//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
 #include <boost/xpressive/xpressive.hpp>
 
 int f()

Modified: boost/trunk/libs/xpressive/test/regress.txt
===================================================================
--- boost/trunk/libs/xpressive/test/regress.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/test/regress.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+; Copyright 2004 Eric Niebler.
+;
+; Distributed under the Boost Software License, Version 1.0.
+; (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 [test1]
 str=foobarboo

Modified: boost/trunk/libs/xpressive/test/test_cycles.cpp
===================================================================
--- boost/trunk/libs/xpressive/test/test_cycles.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/libs/xpressive/test/test_cycles.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,7 +21,7 @@
 
 ///////////////////////////////////////////////////////////////////////////////
 // test_main
-// regexes refered to by other regexes are kept alive via reference counting.
+// regexes referred to by other regexes are kept alive via reference counting.
 // but cycles are handled naturally. the following works as expected and doesn't leak.
 int test_main( int, char*[] )
 {

Copied: boost/trunk/more/Jamfile.v2 (from rev 14034, boost/branches/upstream/current/more/Jamfile.v2)

Modified: boost/trunk/more/background.html
===================================================================
--- boost/trunk/more/background.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/background.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,132 +1,221 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <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=utf-8">
+    <title>
+      Boost Background Information
+    </title>
+<style type="text/css">
+ body {
+  background-color: #FFFFFF;
+ }
+ p.c2 {font-style: italic; font-weight: bold}
+ span.c1 {color: #FFFFFF; font-family: Arial; font-size: 120%}
+</style>
 
-<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>Boost Background Information</title>
-</head>
+  </head>
+  <body>
+    <table summary="Navigational header"
+		 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"><span class="c1">Home</span></a>
 
-<body bgcolor="#FFFFFF">
+        </td>
+        <td>
+          <a href="../libs/libraries.htm"><span class="c1">Libraries</span></a>
+        </td>
+        <td>
+          <a href="../people/people.htm"><span class="c1">People</span></a>
+        </td>
+        <td>
 
-      <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="../libs/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 Background Information</h1>
-<h2>Why should an organization use Boost?</h2>
-<p>
-In a word, <i><b>Productivity</b></i>. Use of high-quality libraries like 
-Boost speeds initial development,  results in fewer bugs, 
-reduces reinvention-of-the-wheel, and cuts long-term maintenance costs. And 
-since Boost libraries tend to become de facto or de jure standards, many 
-programmers are already familiar with them.</p>
-<p>
-Ten of the Boost libraries are included in the
-<a href="http://open-std.org/jtc1/sc22/wg21/docs/library_technical_report.html">
-C++ Standard Library's TR1</a>, and so are slated for later full 
-standardization. More Boost libraries are in the pipeline for
-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1810.html">TR2</a>. 
-Using Boost libraries gives an organization a head-start in adopting new 
-technologies.</p>
-<p>
-Many organization already use programs implemented with 
-Boost, like Adobe <a href="http://www.adobe.com/products/acrobat/readermain.html">Acrobat
-Reader 7.0</a>.</p>
-<h2>Who else is using Boost?</h2>
-<p>See the <a href="../doc/html/who_s_using_boost_.html">
-Who's Using Boost page</a> for a sampling. We don't know the exact numbers, but 
-a release gets around 100,000 downloads from SourceForge, and that is only one 
-of several distribution routes.</p>
-<h2>What do others say about Boost?</h2>
-<p> <i><b>&quot;...one of the most highly regarded and expertly 
-designed C++ library projects in the world.&quot;</b></i></p>
-      <blockquote>
-<p>-- <a href="http://www.gotw.ca/">Herb Sutter</a> and
-<a href="http://en.wikipedia.org/wiki/Andrei_Alexandrescu">Andrei Alexandrescu</a>, 
-<a href="http://safari.awprofessional.com/?XmlId=0321113586">C++ Coding 
-Standards</a> </p>
-      </blockquote>
-<p> <b><i>&quot;Item 55: Familiarize yourself with Boost.&quot;</i></b></p>
-      <blockquote>
-<p>-- <a href="http://www.aristeia.com/">Scott Meyers</a>, 
-<a href="http://www.awl.com/cseng/titles/0-321-33487-6/">Effective C++, 3rd Ed.</a> </p>
-      </blockquote>
-<p> <i><b>&quot;The obvious solution for most 
-programmers is to use a library that provides an elegant and efficient 
-platform independent to needed services. Examples are BOOST...&quot;</b></i></p>
-      <blockquote>
-<p>--<i><b> </b></i><a href="http://www.research.att.com/~bs/">Bjarne Stroustrup</a>, 
-<a href="http://www.research.att.com/~bs/abstraction.pdf">Abstraction, 
-libraries, and efficiency in C++</a> </p>
-      </blockquote>
-<h2>How do users get support?</h2>
-<p>For relatively straightforward support needs, users rely on the
-<a href="mailing_lists.htm">mailing lists</a>. One of the 
-advantages of Boost is the responsiveness of other users and Boost 
-developers.</p>
-<p>For more involved needs, <a href="links.htm#CommercialSupport">
-Commercial Support</a> is available.</p>
-<h2>What about license issues?</h2>
-<p>Boost has its own <a href="license_info.html">license</a>, developed 
-with help from the Harvard Law School.&nbsp; The
-<a href="license_info.html">Boost license polices</a> encourage both 
-commercial and non-commercial use, and the Boost license is not related to the 
-GPL or other licenses - that are sometimes seen as business unfriendly.</p>
-<h2>What about other intellectual property issues?</h2>
-<p>The Boost libraries tend to be new, fresh, and creative designs. They are not 
-copies, clones, or derivations of proprietary libraries. Boost has a firm policy 
-to respect the IP rights of others. The development of Boost libraries is 
-publicly documented via the mailing lists and version control repository. The 
-source code has been inspected by many, many knowledgeable programmers. Each 
-Boost file has a copyright notice and license information. IP issues have been 
-reviewed by the legal teams from some of the corporations which use Boost, and 
-in some cases these lawyers have been kind enough to give Boost feedback on IP 
-issues. There are no guarantees, but those factors all tend to reduce IP risk.</p>
-<h2>Why would anyone give away valuable software for free?</h2>
-<p>Businesses and other organizations often prefer to have code developed, 
-maintained, and improved in the open source community when it does not contain 
-technology specific to their application domain, because it allows them to focus 
-more development resources on their core business.</p>
-<p>Individuals contribute for the technical challenge, to hone their technical 
-skills, for the sense of community, as part of their graduate school programs, 
-as a way around geographic isolation, to enhance their employment opportunities, 
-and as advertisements for their consulting services. There are probably as many 
-reasons as there are individuals. Some of the apparently individual 
-contributions come from employees of support companies with contracts from 
-businesses or other organizations who have an interest in seeing that a library 
-is well-maintained.</p>
-<h2>Who pays Boost's expenses?</h2>
-<p>Boost doesn't really have any expenses! All the infrastructure is contributed 
-by supporters, such as the <a href="http://www.osl.iu.edu/">Open Systems Lab</a> 
-at Indiana University,&nbsp; <a href="http://sourceforge.net/index.php">
-SourceForge</a>, <a href="http://www.boost-consulting.com/">Boost Consulting</a>,
-<a href="http://www.meta-comm.com/">MetaCommunications</a>, and the 
-individuals, companies, and other organizations who run the regression tests. 
-Borland, HP, Intel, and Microsoft have contributed compilers. And hundreds, or 
-even thousands, of programmers contribute their time. That's what makes Boost 
-possible.</p>
-      <hr>
+          <a href="../more/faq.htm"><span class="c1">FAQ</span></a>
+        </td>
+        <td>
+          <a href="../more/index.htm"><span class="c1">More</span></a>
+        </td>
+      </tr>
+    </table>
+    <h1>
+
+      Boost Background Information
+    </h1>
+    <h2>
+      Why should an organization use Boost?
+    </h2>
+    <p>
+      In a word, <i><b>Productivity</b></i>. Use of high-quality libraries like
+      Boost speeds initial development, results in fewer bugs, reduces
+      reinvention-of-the-wheel, and cuts long-term maintenance costs. And since
+      Boost libraries tend to become de facto or de jure standards, many
+      programmers are already familiar with them.
+    </p>
+    <p>
+
+      Ten of the Boost libraries are included in the <a href=
+      "http://open-std.org/jtc1/sc22/wg21/docs/library_technical_report.html">C++
+      Standard Library's TR1</a>, and so are slated for later full
+      standardization. More Boost libraries are in the pipeline for <a href=
+      "http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1810.html">TR2</a>.
+      Using Boost libraries gives an organization a head-start in adopting new
+      technologies.
+    </p>
+    <p>
+      Many organization already use programs implemented with Boost, like Adobe
+      <a href="http://www.adobe.com/products/acrobat/readermain.html">Acrobat
+      Reader 7.0</a>.
+    </p>
+    <h2>
+      Who else is using Boost?
+    </h2>
+
+    <p>
+      See the <a href="../doc/html/who_s_using_boost_.html">Who's Using Boost
+      page</a> for a sampling. We don't know the exact numbers, but a release
+      gets around 100,000 downloads from SourceForge, and that is only one of
+      several distribution routes.
+    </p>
+    <h2>
+      What do others say about Boost?
+    </h2>
+    <p class="c2">
+      "...one of the most highly regarded and expertly designed C++ library
+      projects in the world."
+    </p>
+
+    <blockquote>
       <p>
-         Revised 
-         <!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %B, %Y" startspan -->07 July, 2005<!--webbot bot="Timestamp" endspan i-checksum="21138" --></p>
+        -- <a href="http://www.gotw.ca/">Herb Sutter</a> and <a href=
+        "http://en.wikipedia.org/wiki/Andrei_Alexandrescu">Andrei
+        Alexandrescu</a>, <a href=
+        "http://safari.awprofessional.com/?XmlId=0321113586">C++ Coding
+        Standards</a>
+      </p>
+    </blockquote>
+
+    <p class="c2">
+      "Item 55: Familiarize yourself with Boost."
+    </p>
+    <blockquote>
       <p>
-         © Copyright Beman Dawes 2005.</p>
+        -- <a href="http://www.aristeia.com/">Scott Meyers</a>, <a href=
+        "http://www.awl.com/cseng/titles/0-321-33487-6/">Effective C++, 3rd
+        Ed.</a>
+      </p>
+
+    </blockquote>
+    <p class="c2">
+      "The obvious solution for most programmers is to use a library that
+      provides an elegant and efficient platform independent to needed services.
+      Examples are BOOST..."
+    </p>
+    <blockquote>
       <p>
-         Use, modification, and distribution are subject to the Boost Software License, 
-         Version 1.0. (See accompanying file 
-         <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
-         or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
-   
-</body>
+        -- <a href="http://www.research.att.com/~bs/">Bjarne Stroustrup</a>,
+        <a href="http://www.research.att.com/~bs/abstraction.pdf">Abstraction,
+        libraries, and efficiency in C++</a>
 
+      </p>
+    </blockquote>
+    <h2>
+      How do users get support?
+    </h2>
+    <p>
+      For relatively straightforward support needs, users rely on the <a href=
+      "mailing_lists.htm">mailing lists</a>. One of the advantages of Boost is
+      the responsiveness of other users and Boost developers.
+    </p>
+    <p>
+
+      For more involved needs, <a href="links.htm#CommercialSupport">Commercial
+      Support</a> is available.
+    </p>
+    <h2>
+      What about license issues?
+    </h2>
+    <p>
+      Boost has its own <a href="license_info.html">license</a>, developed with
+      help from the Harvard Law School.&nbsp; The <a href=
+      "license_info.html">Boost license polices</a> encourage both commercial and
+      non-commercial use, and the Boost license is not related to the GPL or
+      other licenses - that are sometimes seen as business unfriendly.
+    </p>
+
+    <h2>
+      What about other intellectual property issues?
+    </h2>
+    <p>
+      The Boost libraries tend to be new, fresh, and creative designs. They are
+      not copies, clones, or derivations of proprietary libraries. Boost has a
+      firm policy to respect the IP rights of others. The development of Boost
+      libraries is publicly documented via the mailing lists and version control
+      repository. The source code has been inspected by many, many knowledgeable
+      programmers. Each Boost file has a copyright notice and license
+      information. IP issues have been reviewed by the legal teams from some of
+      the corporations which use Boost, and in some cases these lawyers have been
+      kind enough to give Boost feedback on IP issues. There are no guarantees,
+      but those factors all tend to reduce IP risk.
+    </p>
+    <h2>
+      Why would anyone give away valuable software for free?
+    </h2>
+    <p>
+
+      Businesses and other organizations often prefer to have code developed,
+      maintained, and improved in the open source community when it does not
+      contain technology specific to their application domain, because it allows
+      them to focus more development resources on their core business.
+    </p>
+    <p>
+      Individuals contribute for the technical challenge, to hone their technical
+      skills, for the sense of community, as part of their graduate school
+      programs, as a way around geographic isolation, to enhance their employment
+      opportunities, and as advertisements for their consulting services. There
+      are probably as many reasons as there are individuals. Some of the
+      apparently individual contributions come from employees of support
+      companies with contracts from businesses or other organizations who have an
+      interest in seeing that a library is well-maintained.
+    </p>
+    <h2>
+      Who pays Boost's expenses?
+    </h2>
+    <p>
+      Boost doesn't really have any expenses! All the infrastructure is
+      contributed by supporters, such as the <a href=
+      "http://www.osl.iu.edu/">Open Systems Lab</a> at Indiana University,&nbsp;
+
+      <a href="http://sourceforge.net/index.php">SourceForge</a>, <a href=
+      "http://www.boost-consulting.com/">Boost Consulting</a>, <a href=
+      "http://www.meta-comm.com/">MetaCommunications</a>, and the individuals,
+      companies, and other organizations who run the regression tests. Borland,
+      HP, Intel, and Microsoft have contributed compilers. And hundreds, or even
+      thousands, of programmers contribute their time. That's what makes Boost
+      possible.
+    </p>
+    <hr>
+    <p>
+      Revised <!--webbot bot="Timestamp" s-type="EDITED"
+s-format="%d %B, %Y" startspan -->07 July, 2005
+<!--webbot bot="Timestamp" endspan i-checksum="21138" -->
+    </p>
+
+    <p>
+      &copy; Copyright Beman Dawes 2005.
+    </p>
+    <p>
+      Distributed under the Boost Software License, Version 1.0. (See
+      accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+      at <a href=
+      "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)
+    </p>
+  </body>
+
 </html>

Modified: boost/trunk/more/bibliography.html
===================================================================
--- boost/trunk/more/bibliography.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/bibliography.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,14 +1,10 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 	<head>
 		<title>Boost Bibliography</title>
-		<meta name="vs_showGrid" content="True">
-		<meta http-equiv="Content-Language" content="en-us">
-		<meta content="Microsoft FrontPage 5.0" name="GENERATOR">
-		<meta content="FrontPage.Editor.Document" name="ProgId">
-		<meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
 	</head>
 	<body bgColor="#ffffff">
-		<table cellPadding="2" bgColor="#007f7f" border="1">
+		<table summary="Navigational header" cellPadding="2" bgColor="#007f7f" border="1">
 			<tr>
 				<td bgColor="#ffffff"><IMG height="86" alt="boost.png (6897 bytes)" src="../boost.png" width="277"></td>
 				<td><A href="../index.htm"><font face="Arial" color="#ffffff" size="4">Home</font></A></td>
@@ -27,7 +23,8 @@
 			<a href="#Acknowledgements">Acknowledgements</a></p>
 		<h2><a name="Print_publications">Print publications</a> about Boost or Boost 
 			Libraries</h2>
-		<table style="BORDER-COLLAPSE: collapse" borderColor="#111111" cellPadding="5" width="100%"
+		<table summary="List of print publications about Boost or its libraries"
+		 style="BORDER-COLLAPSE: collapse" cellPadding="5" width="100%"
 			border="0">
 			<tr>
 				<td vAlign="top" align="left" width="16%"><b>[<a name="MaddockCleary00">MaddockCleary00</a>]</b></td>
@@ -161,7 +158,8 @@
 		</table>
 		<h2><a name="Online_publications">Online publications</a> about Boost or Boost 
 			Libraries</h2>
-		<table style="BORDER-COLLAPSE: collapse" borderColor="#111111" cellPadding="5" width="100%"
+		<table summary = "Online publications"
+		 style="BORDER-COLLAPSE: collapse" cellPadding="5" width="100%"
 			border="0">
 			<TR>
 				<TD vAlign="top" align="left" width="16%"><b>[<a name="Brownell02">Brownell02</a>]</b></TD>
@@ -205,7 +203,7 @@
 			    towards Spirit: a parser framework</i>. The Code Project, March 24, 2003. <A href="http://www.codeproject.com/cpp/spiritintro.asp"> www.codeproject.com/cpp/spiritintro.asp</A></TD>
 		  </TR>
 			<TR>
-              <TD vAlign="top" align="left"><b>[<a name="Halleux03">Kaiser03</a>]</b></TD>
+              <TD vAlign="top" align="left"><b>[<a name="Kaiser03">Kaiser03</a>]</b></TD>
 			  <TD vAlign="top" align="left">Hartmut Kaiser, <i>Wave: a Standard conformant C++   preprocessor library</i>. The Code Project, March 25, 2003. <A href="http://www.codeproject.com/cpp/wave_preprocessor.asp"> www.codeproject.com/cpp/wave_preprocessor.asp</A></TD>
 		  </TR>
 			<TR>
@@ -229,7 +227,7 @@
 						Developers</i>. MSDN, May 17, 2004. <A href="http://tinyurl.com/2lzyh">tinyurl.com/2lzyh</A></TD>
 			</TR>
 			<TR>
-				<TD vAlign="top" align="left" width="16%"><b>[<a name="D'Agostino04">D'Agostino04</a>]</b></TD>
+				<TD vAlign="top" align="left" width="16%"><b>[<a name="DAgostino04">D'Agostino04</a>]</b></TD>
 				<TD vAlign="top" align="left" width="84%">Jim D'Agostino, <i>Designing Robust Objects with Boost</i>. 
 				The Code Project, August 17, 2004. <A href="http://www.codeproject.com/cpp/Designing_Robust_Objects.asp">
 						www.codeproject.com/cpp/Designing_Robust_Objects.asp</A></TD>
@@ -260,8 +258,8 @@
 			</TR>
 			<TR>
 				<TD vAlign="top" align="left" width="16%"><b>[<a name="Wikipedia04">Wikipedia04</a>]</b></TD>
-				<TD vAlign="top" align="left" width="84%">Wikipedia, <i>Boost (Programming)</i>. 
-					Wikipedia, The Free Encyclopedia, 2004. <A href="http://en.wikipedia.org/wiki/Boost_(programming)">
+				<TD vAlign="top" align="left" width="84%">Wikipedia, <i>Boost</i>. 
+					Wikipedia, The Free Encyclopedia, 2004. <A href="http://en.wikipedia.org/wiki/Boost%20library">
 						en.wikipedia.org/wiki/Boost_(programming)</A></TD>
 			</TR>
 			<TR>
@@ -293,7 +291,8 @@
 			</TR>			
 		</table>
 		<h2><a name="Print_mentions">Print mentions</a> of Boost or Boost Libraries</h2>
-		<table style="BORDER-COLLAPSE: collapse" borderColor="#111111" cellPadding="5" width="100%"
+		<table summary="Print mentions"
+		 style="BORDER-COLLAPSE: collapse" cellPadding="5" width="100%"
 			border="0">
 			<TR>
 				<TD vAlign="top" align="left" width="16%"><b>[<a name="HyslopSutter01">HyslopSutter01</a>]</b></TD>
@@ -415,7 +414,8 @@
 			</TR>
 		</table>
 		<h2><a name="Online_mentions">Online mentions</a> of Boost or Boost Libraries</h2>
-		<table style="BORDER-COLLAPSE: collapse" borderColor="#111111" cellPadding="5" width="100%"
+		<table summary="Online mentions"
+		 style="BORDER-COLLAPSE: collapse" cellPadding="5" width="100%"
 			border="0">
 			<TR>
 				<TD vAlign="top" align="left" width="16%"><b>[<a name="Siek01">Siek01</a>]</b></TD>
@@ -529,7 +529,7 @@
 		<p>Revised 
 			<!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan --> 
 			17 September, 2005<!--webbot bot="Timestamp" endspan i-checksum="40409" --></p>
-		<p>© Copyright Beman Dawes 2003</p>
+		<p>&copy; Copyright Beman Dawes 2003</p>
         <p> Distributed under the Boost Software License, Version 1.0. 
         (See accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or 
         copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)

Modified: boost/trunk/more/blanket-permission.txt
===================================================================
--- boost/trunk/more/blanket-permission.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/blanket-permission.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,86 +1,101 @@
 The following people hereby grant permission to replace all existing
 licenses on their contributions to Boost with the Boost Software
-License, Version 1.0.
+License, Version 1.0. (boostinspect:nolicense boostinspect:nocopyright)
 
-David Abrahams (dave at boost-consulting.com)
-Dave Abrahams (dave at boost-consulting.com)
+Aleksey Gurtovoy (agurtovoy at meta-comm.com)
+Andrei Alexandrescu (andrewalex - at - hotmail.com) (See Boost list message of August 12, 2004 11:06:58 AM EST)   
+Andrew Lumsdaine ()
+Anthony Williams (anthony -at- justsoftwaresolutions.co.uk(
 Beman Dawes (bdawes at acm.org)
+Brad King (brad.king -at- kitware.com) (See Boost list message of Wed, 21 Jul 2004 11:15:46 -0400)
+Brian Osman (osman -at- vvisions.com) (See CVS log)
+Bruce Barr (schmoost -at- yahoo.com) (See Boost list of Mon, 16 Aug 2004 15:06:43 -0500)
+Bruno da Silva de Oliveira (bruno - at - esss.com.br)
+Christain Engstrom (christian.engstrom -at- glindra.org) (See Boost list message of Mon, 30 Aug 2004 14:31:49 +0200)
+Cromwell D Enage (sponage -at- yahoo.com) (See Boost list message of August 12, 2004 11:49:13 AM EST) 
+Dan Gohman (djg -at- cray.com) (See Boost list messsage of Sat, 21 Aug 2004 10:54:59 +0100)
+Dan Nuffer (dan -at- nuffer.name)
 Daniel Frey (d.frey -at- gmx.de, daniel.frey -at- aixigo.de)
+Daniel Nuffer (dan -at- nuffer.name)
+Darin Adler (darin -at- bentspoon.com) (Email to Andreas Huber, see change log)
+Daryle Walker (darylew - at - hotmail.com)
+Dave Abrahams (dave at boost-consulting.com)
+Dave Moore (dmoore -at- viefinancial.com) (See Boost list message of 18 Dec 2003 15:35:50 -0500)
+David Abrahams (dave at boost-consulting.com)
+Dietmar Kuehl (dietmar_kuehl -at- yahoo.com) (Email to Andreas Huber, see change log)
 Douglas Gregor (gregod -at- cs.rpi.edu, dgregor -at- cs.indiana.edu, doug.gregor -at- gmail.com)
-Aleksey Gurtovoy (agurtovoy at meta-comm.com)
-Jaakko Järvi (jajarvi -at- osl.iu.edu)
-Dave Moore (dmoore -at- viefinancial.com) (See Boost list message of 18 Dec 2003 15:35:50 -0500)
-John Maddock (john - at - johnmaddock.co.uk)
 Dr John Maddock (john - at - johnmaddock.co.uk)
-Gary Powell (powellg - at - amazon.com) (See Boost list message of 10 Feb 2004 14:22:46 -0800) 
+Edward D. Brey (brey -at- ductape.net) (Email to Andreas Huber, see change log)
+Eric Ford (un5o6n902 -at- sneakemail.com) (See Boost list message of Sun, 15 Aug 2004 10:29:13 +0100)
+Eric Friedman (ebf at users.sourceforge.net)
+Eric Niebler (eric at boost-consulting.com)
 Fernando Cacciola (fernando_cacciola at ciudad.com.ar)
 Fernando Luis Cacciola Carballal (fernando_cacciola at ciudad.com.ar)
-Michael Glassford (glassfordm - at - hotmail.com)
-Eric Friedman (ebf at users.sourceforge.net)
-Peter Dimov (pdimov at mmltd.net)
+Francois Faure (Francois.Faure -at- imag.fr) (See CVS log)
+Gary Powell (powellg - at - amazon.com) (See Boost list message of 10 Feb 2004 14:22:46 -0800)
+Gennadiy Rozental (rogeeff -at- mail.com) (Email to Andreas Huber, see change log)
+Gottfried Ganssauge (Gottfried.Ganssauge -at- HAUFE.DE) (See Boost List message of Mon, 16 Aug 2004 10:09:19 +0200)
+Gottfried Ganßauge (Gottfried.Ganssauge -at- HAUFE.DE) (Alternative spelling of Gottfried Ganssauge)
+Greg Colvin (gregory.colvin -at- oracle.com) (See Boost list message of Sat, 14 Aug 2004 10:57:00 +0100)
+Gregory Colvin (gregory.colvin -at- oracle.com) (See Boost list message of Sat, 14 Aug 2004 10:57:00 +0100)
+Gunter Winkler (gunter.winkler -at- unibw-muenchen.de) (See Boost List message of Mon, 16 Aug 2004 10:24:17 +0200)
+Hartmut Kaiser (hartmut.kaiser -at- gmail.com)
+Herve Bronnimann (hbr -at- poly.edu)
+Hervé Brönnimann (hbr -at- poly.edu)
+Housemarque Oy (Ilari Kuittinen ilari.kuittinen -at- housemarque.fi)
+Howard Hinnant (hinnant -at- twcny.rr.com) (See Boost list message of July 25, 2004 3:44:49 PM EST)
+Hubert Holin (hubert_holin -at- users.sourceforge.net)
+Indiana University ()
+Itay Maman (imaman -at- users.sourceforge.net)
+Jaakko Järvi (jajarvi -at- osl.iu.edu)
+Jaap Suter (j.suter -at- student.utwente.nl) (See Boost list message of Thu, 16 Sep 2004 09:32:43 -0700)
+Jeff Garland (jeff - at - crystalclearsoftware.com) (see Boost list post of July 25, 2004 19:31:09 -0700)
 Jens Maurer (Jens.Maurer at gmx.net)
-Mac Murrett (mmurrett -at- mac.com)
+Jeremy G Siek (jsiek at osl.iu.edu)
+Jeremy Siek (jsiek at osl.iu.edu)
+Joel de Guzman (joel -at- boost-consulting.com) (See Boost list message of July 25, 2004 8:32:00 PM EST)
 John Bandela (jbandela-at-ufl.edu)
+John Maddock (john - at - johnmaddock.co.uk)
 John R Bandela (jbandela-at-ufl.edu)
-Robert Ramey (ramey at www.rrsd.com)
-Rene Rivera (grafik/redshift-software.com, rrivera/acm.org)
-Paul Mensonides (pmenso57 -at- comcast.net) (See Boost list message of July 21, 2004 1:12:21 AM EST)
-Multi Media Ltd. (pdimov at mmltd.net)
-Brad King (brad.king -at- kitware.com) (See Boost list message of Wed, 21 Jul 2004 11:15:46 -0400)
-Jeremy Siek (jsiek at osl.iu.edu)
-Jeremy G Siek (jsiek at osl.iu.edu)
-Howard Hinnant (hinnant -at- twcny.rr.com) (See Boost list message of July 25, 2004 3:44:49 PM EST)
-Joel de Guzman (joel -at- boost-consulting.com) (See Boost list message of July 25, 2004 8:32:00 PM EST)
-Vladimir Prus (ghost at cs.msu.su)
-Jeff Garland (jeff - at - crystalclearsoftware.com) (see Boost list post of July 25, 2004 19:31:09 -0700)
-Thorsten Jørgen Ottosen (nesotto - at - cs.auc.dk)
-Thorsten Ottosen (nesotto - at - cs.auc.dk)
-Daryle Walker (darylew - at - hotmail.com)
-Toon Knapen (toon dot knapen - at - fft.be)
-Pavol Droba (droba -at- topmail.sk)
-Thomas Witt (witt - at - ive.uni-hannover.de, witt - at - acm.org, witt - at - styleadvisor.com)
-Ralf W. Grosse-Kunstleve (RWGrosse-Kunstleve at lbl.gov)
-R W Grosse-Kunstleve (RWGrosse-Kunstleve at lbl.gov)
-Hervé Brönnimann (hbr -at- poly.edu)
-Herve Bronnimann (hbr -at- poly.edu)
-Andrei Alexandrescu (andrewalex - at - hotmail.com) (See Boost list message of August 12, 2004 11:06:58 AM EST)   
-Cromwell D Enage (sponage -at- yahoo.com) (See Boost list message of August 12, 2004 11:49:13 AM EST) 
+Jonathan Turkanis (turkanis -at- coderage dot com)
 Juergen Hunold (hunold -at- ive.uni-hannover.de) (See Boost List Message of Fri, 13 Aug 2004 19:39:55 +0200)
-Gregory Colvin (gregory.colvin -at- oracle.com) (See Boost list message of Sat, 14 Aug 2004 10:57:00 +0100)
-Greg Colvin (gregory.colvin -at- oracle.com) (See Boost list message of Sat, 14 Aug 2004 10:57:00 +0100)
-Eric Ford (un5o6n902 -at- sneakemail.com) (See Boost list message of Sun, 15 Aug 2004 10:29:13 +0100)
-Gottfried Ganssauge (Gottfried.Ganssauge -at- HAUFE.DE) (See Boost List message of Mon, 16 Aug 2004 10:09:19 +0200)
-Gottfried Ganßauge (Gottfried.Ganssauge -at- HAUFE.DE) (Alternative spelling of Gottfried Ganssauge)
-Gunter Winkler (gunter.winkler -at- unibw-muenchen.de) (See Boost List message of Mon, 16 Aug 2004 10:24:17 +0200)
+Kevlin Henney (kevlin -at- curbralan.com) (See Boost list message of Wed, 15 Sep 2004 18:15:17 +0200)
 Kresimir Fresl (fresl -at- master.grad.hr) (See Boost List message of August 16, 2004 8:23:35 AM EST)
+Lars Gullik Bjønnes (larsbj -at- lyx.org) (See Boost list message of Tue, 17 Aug 2004 15:49:02 +0100)
 Lie-Quan Lee (liequan - at - slac.stanford.edu, llee - at - cs.indiana.edu)
-Bruno da Silva de Oliveira (bruno - at - esss.com.br)
-Bruce Barr (schmoost -at- yahoo.com) (See Boost list of Mon, 16 Aug 2004 15:06:43 -0500)
-Roland Richter (roland -at- flll.jku.at) (See Boost list post of Mon, 16 Aug 2004 22:16:55 +0200)
+Maarten Keijzer (mkeijzer -at- cs.vu.nl) (See Boost list message of Wed, 18 Aug 2004 21:43:18 +0100)
+Mac Murrett (mmurrett -at- mac.com)
+Marc Wintermantel (wintermantel -at- imes.mavt.ethz.ch, wintermantel -at- even-ag.ch) (See CVS log)
+Michael Glassford (glassfordm - at - hotmail.com)
 Michael Stevens (Michael.Stevens - at - epost.de)
+Multi Media Ltd. (pdimov at mmltd.net)
+Nicolai M Josuttis (solutions -at- josuttis.com) (See Boost list message of Mon, 30 Aug 2004 10:52:00 +0100)
+Nikolay Mladenov (nickm -at- sitius.com) (See Boost list message of Tue, 17 Aug 2004 15:45:33 +0100)
+Paul Mensonides (pmenso57 -at- comcast.net) (See Boost list message of July 21, 2004 1:12:21 AM EST)
+Pavol Droba (droba -at- topmail.sk)
+Peter Dimov (pdimov at mmltd.net)
+R W Grosse-Kunstleve (RWGrosse-Kunstleve at lbl.gov)
+Ralf W. Grosse-Kunstleve (RWGrosse-Kunstleve at lbl.gov)
 Rational Discovery LLC (Greg Landrum Landrum -at- RationalDiscovery.com) (See Boost list post of Tue, 17 Aug 2004 10:35:36 +0100)
-Lars Gullik Bjønnes (larsbj -at- lyx.org) (See Boost list message of Tue, 17 Aug 2004 15:49:02 +0100)
-Nikolay Mladenov (nickm -at- sitius.com) (See Boost list message of Tue, 17 Aug 2004 15:45:33 +0100)
-Itay Maman (imaman -at- users.sourceforge.net)
-Hubert Holin (hubert_holin -at- users.sourceforge.net)
-Maarten Keijzer (mkeijzer -at- cs.vu.nl) (See Boost list message of Wed, 18 Aug 2004 21:43:18 +0100)
-Dan Gohman (djg -at- cray.com) (See Boost list messsage of Sat, 21 Aug 2004 10:54:59 +0100)
-Daniel Nuffer (dan -at- nuffer.name)
-Dan Nuffer (dan -at- nuffer.name)
-Nicolai M Josuttis (solutions -at- josuttis.com) (See Boost list message of Mon, 30 Aug 2004 10:52:00 +0100)
-Christain Engstrom (christian.engstrom -at- glindra.org) (See Boost list message of Mon, 30 Aug 2004 14:31:49 +0200)
-Housemarque Oy (Ilari Kuittinen ilari.kuittinen -at- housemarque.fi)
-Kevlin Henney (kevlin -at- curbralan.com) (See Boost list message of Wed, 15 Sep 2004 18:15:17 +0200)
-Jaap Suter (j.suter -at- student.utwente.nl) (See Boost list message of Thu, 16 Sep 2004 09:32:43 -0700)
+Rene Rivera (grafik/redshift-software.com, rrivera/acm.org)
+Robert Ramey (ramey at www.rrsd.com)
+Roland Richter (roland -at- flll.jku.at) (See Boost list post of Mon, 16 Aug 2004 22:16:55 +0200)
+Roland Schwarz (roland.schwarz -at- chello.at)
+Ronald Garcia (garcia -at- cs.indiana.edu) (Email to Andreas Huber, see change log)
 Samuel Krempp (krempp -at- crans.ens-cachan.fr) (See Boost list message of Mon, 27 Sep 2004 13:18:36 +0200)
+Stefan Seefeld (seefeld -at- sympatico.ca)
 Stephen Cleary (scleary -at- jerviswebb.com) (See Boost list message of Tue, 28 Sep 2004 13:11:46 +0100)
 Steve Cleary (Variant of Stephen Cleary)
-Hartmut Kaiser (HartmutKaiser -at- t-online.de)
-Indiana University ()
+Sylvain Pion (Sylvain.Pion - at - sophia.inria.fr)
 The Trustees of Indiana University ()
+Thomas Witt (witt - at - ive.uni-hannover.de, witt - at - acm.org, witt - at - styleadvisor.com)
+Thorsten Jørgen Ottosen (nesotto - at - cs.auc.dk)
+Thorsten Ottosen (nesotto - at - cs.auc.dk)
+Toon Knapen (toon dot knapen - at - fft.be)
 Trustees of Indiana University ()
 University of Notre Dame ()
-Andrew Lumsdaine ()
-Marc Wintermantel (wintermantel -at- imes.mavt.ethz.ch, wintermantel -at- even-ag.ch) (See CVS log)
-Francois Faure (Francois.Faure -at- imag.fr) (See CVS log)
-Brian Osman (osman -at- vvisions.com) (See CVS log)
+Vladimir Prus (ghost at cs.msu.su)
+William E. Kempf () (email to Beman Dawes, 9/14/2006 4:18 PM)
+
+--- end ---
+

Modified: boost/trunk/more/borland_cpp.html
===================================================================
--- boost/trunk/more/borland_cpp.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/borland_cpp.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,103 +1,111 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<title>Portability Hints: Borland C++ 5.5.1</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Portability Hints: Borland C++ 5.5.1</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-<table border="1" bgcolor="#007F7F" cellpadding="2">
-  <tr>
-    <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-    <td><a href="../index.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>Home</big></font></a></td>
-    <td><a href="../libs/libraries.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>Libraries</big></font></a></td>
-    <td><a href="../people/people.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>People</big></font></a></td>
-    <td><a href="faq.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>FAQ</big></font></a></td>
-    <td><a href="index.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>More</big></font></a></td>
-  </tr>
-</table>
+      <td><a href="../index.htm"><font face="Arial,Helvetica" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-<p>
+      <td><a href="../libs/libraries.htm"><font face="Arial,Helvetica" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
 
-<h1>Portability Hints: Borland C++ 5.5.1</h1>
+      <td><a href="../people/people.htm"><font face="Arial,Helvetica" color=
+      "#FFFFFF"><big>People</big></font></a></td>
 
-It is a general aim for boost libraries to be
-<a href="lib_guide.htm#Portability">portable</a>.  The primary means
-for achieving this goal is to adhere to ISO Standard C++.  However,
-ISO C++ is a broad and complex standard and most compilers are
-not fully conformant to ISO C++ yet.  In order to achieve portability
-in the light of this restriction, it seems advisable to get acquainted
-with those language features that some compilers do not fully
-implement yet.
-<p>
+      <td><a href="faq.htm"><font face="Arial,Helvetica" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
 
-This page gives portability hints on some language features of the
-Borland C++ version 5.5.1 compiler.  Furthermore, the appendix
-presents additional problems with Borland C++ version 5.5.  Borland
-C++ 5.5.1 is a freely available command-line compiler for Win32
-available at
-<a href="http://www.borland.com/">http://www.borland.com/</a>.
-<p>
+      <td><a href="index.htm"><font face="Arial,Helvetica" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
 
-Each entry in the following list describes a particular issue,
-complete with sample source code to demonstrate the effect.
-Most sample code herein has been verified to compile with gcc 2.95.2
-and Comeau C++ 4.2.44.
+  <h1>Portability Hints: Borland C++ 5.5.1</h1>
 
+  <p>It is a general aim for boost libraries to be <a href=
+  "lib_guide.htm#Portability">portable</a>. The primary means for achieving
+  this goal is to adhere to ISO Standard C++. However, ISO C++ is a broad and
+  complex standard and most compilers are not fully conformant to ISO C++
+  yet. In order to achieve portability in the light of this restriction, it
+  seems advisable to get acquainted with those language features that some
+  compilers do not fully implement yet.</p>
 
-<h2>Preprocessor symbol</h2>
+  <p>This page gives portability hints on some language features of the
+  Borland C++ version 5.5.1 compiler. Furthermore, the appendix presents
+  additional problems with Borland C++ version 5.5. Borland C++ 5.5.1 is a
+  freely available command-line compiler for Win32 available at <a href=
+  "http://www.borland.com/">http://www.borland.com/</a>.</p>
 
-The preprocessor symbol <code>__BORLANDC__</code> is defined for all
-Borland C++ compilers.  Its value is the version number of the
-compiler interpreted as a hexadecimal number.  The following table
-lists some known values.
-<p>
+  <p>Each entry in the following list describes a particular issue, complete
+  with sample source code to demonstrate the effect. Most sample code herein
+  has been verified to compile with gcc 2.95.2 and Comeau C++ 4.2.44.</p>
 
-<table border="1">
-<tr>
-<th>Compiler</th>
-<th><code>__BORLANDC__</code> value</th>
-</tr>
+  <h2>Preprocessor symbol</h2>
 
-<tr>
-<td>Borland C++ Builder 4</td>
-<td>0x0540</td>
-</tr>
+  <p>The preprocessor symbol <code>__BORLANDC__</code> is defined for all
+  Borland C++ compilers. Its value is the version number of the compiler
+  interpreted as a hexadecimal number. The following table lists some known
+  values.</p>
 
-<tr>
-<td>Borland C++ Builder 5</td>
-<td>0x0550</td>
-</tr>
+  <table border="1" summary="">
+    <tr>
+      <th>Compiler</th>
 
-<tr>
-<td>Borland C++ 5.5</td>
-<td>0x0550</td>
-</tr>
+      <th><code>__BORLANDC__</code> value</th>
+    </tr>
 
-<tr>
-<td>Borland C++ 5.5.1</td>
-<td>0x0551</td>
-</tr>
+    <tr>
+      <td>Borland C++ Builder 4</td>
 
-<tr>
-<td>Borland C++ Builder 6</td>
-<td>0x0560</td>
-</tr>
+      <td>0x0540</td>
+    </tr>
 
-</table>
+    <tr>
+      <td>Borland C++ Builder 5</td>
 
-<h2>Core Language</h2>
+      <td>0x0550</td>
+    </tr>
 
-<h3>[using-directive] Mixing <code>using</code>-declarations and
-<code>using</code>-directives</h3>
+    <tr>
+      <td>Borland C++ 5.5</td>
 
-Mixing <code>using</code>-directives (which refer to whole namespaces)
-and namespace-level <code>using</code>-declarations (which refer to
-individual identifiers within foreign namespaces) causes ambiguities
-where there are none.  The following code fragment illustrates this:
+      <td>0x0550</td>
+    </tr>
 
-<pre>
+    <tr>
+      <td>Borland C++ 5.5.1</td>
+
+      <td>0x0551</td>
+    </tr>
+
+    <tr>
+      <td>Borland C++ Builder 6</td>
+
+      <td>0x0560</td>
+    </tr>
+  </table>
+
+  <h2>Core Language</h2>
+
+  <h3>[using-directive] Mixing <code>using</code>-declarations and
+  <code>using</code>-directives</h3>
+
+  <p>Mixing <code>using</code>-directives (which refer to whole namespaces)
+  and namespace-level <code>using</code>-declarations (which refer to
+  individual identifiers within foreign namespaces) causes ambiguities where
+  there are none. The following code fragment illustrates this:</p>
+  <pre>
 namespace N {
   int x();
 }
@@ -111,15 +119,13 @@
 }
 </pre>
 
+  <h3>[using template] <code>using</code>-declarations for class
+  templates</h3>
 
-<h3>[using template] <code>using</code>-declarations for class
-templates</h3>
-
-Identifiers for class templates can be used as arguments to
-<code>using</code>-declarations as any other identifier.  However, the
-following code fails to compile with Borland C++:
-
-<pre>
+  <p>Identifiers for class templates can be used as arguments to
+  <code>using</code>-declarations as any other identifier. However, the
+  following code fails to compile with Borland C++:</p>
+  <pre>
 template&lt;class T&gt;
 class X { };
 
@@ -130,14 +136,12 @@
 };
 </pre>
 
+  <h3>[template const arg] Deduction of constant arguments to function
+  templates</h3>
 
-<h3>[template const arg] Deduction of constant arguments to function
-templates</h3>
-
-Template function type deduction should omit top-level constness.
-However, this code fragment instantiates "f&lt;const int&gt;(int)":
-
-<pre>
+  <p>Template function type deduction should omit top-level constness.
+  However, this code fragment instantiates "f&lt;const int&gt;(int)":</p>
+  <pre>
 template&lt;class T&gt;
 void f(T x)
 {
@@ -155,16 +159,11 @@
 }
 </pre>
 
-The boost/rational.hpp header exhibits this problem in connection with
-the gcd() function.
+  <h3>[function address] Resolving addresses of overloaded functions</h3>
 
-
-<h3>[function address] Resolving addresses of overloaded
-functions</h3>
-
-Addresses of overloaded functions are not in all contexts properly
-resolved (std:13.4 [over.over]); here is a small example:
-<pre>
+  <p>Addresses of overloaded functions are not in all contexts properly
+  resolved (std:13.4 [over.over]); here is a small example:</p>
+  <pre>
 template&lt;class Arg&gt;
 void f( void(*g)(Arg) );
 
@@ -191,17 +190,16 @@
 }
 </pre>
 
-<strong>Workaround:</strong> Always use C-style casts when determining
-addresses of (potentially) overloaded functions.
+  <p><strong>Workaround:</strong> Always use C-style casts when determining
+  addresses of (potentially) overloaded functions.</p>
 
-<h3>[string conversion] Converting <code>const char *</code> to
-<code>std::string</code></h3>
+  <h3>[string conversion] Converting <code>const char *</code> to
+  <code>std::string</code></h3>
 
-Implicitly converting <code>const char *</code> parameters to
-<code>std::string</code> arguments fails if template functions are
-explicitly instantiated (it works in the usual cases, though):
-
-<pre>
+  <p>Implicitly converting <code>const char *</code> parameters to
+  <code>std::string</code> arguments fails if template functions are
+  explicitly instantiated (it works in the usual cases, though):</p>
+  <pre>
 #include &lt;string&gt;
 
 template&lt;class T&gt;
@@ -215,22 +213,19 @@
 
 </pre>
 
-<strong>Workaround:</strong> Avoid explicit template function
-instantiations (they have significant problems with Microsoft Visual
-C++) and pass default-constructed unused dummy arguments with the
-appropriate type.  Alternatively, if you wish to keep to the explicit
-instantiation, you could use an explicit conversion to
-<code>std::string</code> or declare the template function as taking a
-<code>const char *</code> parameter.
+  <p><strong>Workaround:</strong> Avoid explicit template function
+  instantiations (they have significant problems with Microsoft Visual C++)
+  and pass default-constructed unused dummy arguments with the appropriate
+  type. Alternatively, if you wish to keep to the explicit instantiation, you
+  could use an explicit conversion to <code>std::string</code> or declare the
+  template function as taking a <code>const char *</code> parameter.</p>
 
+  <h3>[template value defaults] Dependent default arguments for template
+  value parameters</h3>
 
-<h3>[template value defaults] Dependent default arguments for template
-value parameters</h3>
-
-Template value parameters which default to an expression dependent on
-previous template parameters don't work:
-
-<pre>
+  <p>Template value parameters which default to an expression dependent on
+  previous template parameters don't work:</p>
+  <pre>
 template&lt;class T&gt;
 struct A
 {
@@ -248,33 +243,29 @@
 
 </pre>
 
+  <p><strong>Workaround:</strong> If the relevant non-type template parameter
+  is an implementation detail, use inheritance and a fully qualified
+  identifier (for example, ::N::A&lt;T&gt;::value).</p>
 
-<strong>Workaround:</strong> If the relevant non-type template
-parameter is an implementation detail, use inheritance and a fully
-qualified identifier (for example, ::N::A&lt;T&gt;::value).
+  <h3>[function partial ordering] Partial ordering of function templates</h3>
 
-
-<h3>[function partial ordering] Partial ordering of function
-templates</h3>
-
-Partial ordering of function templates, as described in std:14.5.5.2
-[temp.func.order], does not work:
-
-<pre>
+  <p>Partial ordering of function templates, as described in std:14.5.5.2
+  [temp.func.order], does not work:</p>
+  <pre>
 #include &lt;iostream&gt;
 
 template&lt;class T&gt; struct A {};
 
 template&lt;class T1&gt;
-void f(const A&lt;T1&gt; &)
+void f(const A&lt;T1&gt; &amp;)
 {
-  std::cout << "f(const A&lt;T1&gt;&)\n";
+  std::cout &lt;&lt; "f(const A&lt;T1&gt;&amp;)\n";
 }
 
 template&lt;class T&gt;
 void f(T)
 {
-  std::cout << "f(T)\n";
+  std::cout &lt;&lt; "f(T)\n";
 }
 
 int main()
@@ -285,16 +276,16 @@
 }
 </pre>
 
-<strong>Workaround:</strong> Declare all such functions uniformly as
-either taking a value or a reference parameter.
+  <p><strong>Workaround:</strong> Declare all such functions uniformly as
+  either taking a value or a reference parameter.</p>
 
+  <h3>[instantiate memfun ptr] Instantiation with member function
+  pointer</h3>
 
-<h3>[instantiate memfun ptr] Instantiation with member function pointer</h3>
-
-When directly instantiating a template with some member function
-pointer, which is itself dependent on some template parameter, the
-compiler cannot cope:
-<pre>
+  <p>When directly instantiating a template with some member function
+  pointer, which is itself dependent on some template parameter, the compiler
+  cannot cope:</p>
+  <pre>
 template&lt;class U&gt; class C { };
 template&lt;class T&gt;
 class A
@@ -303,9 +294,9 @@
 };
 </pre>
 
-<strong>Workaround:</strong> Use an intermediate <code>typedef</code>:
-
-<pre>
+  <p><strong>Workaround:</strong> Use an intermediate
+  <code>typedef</code>:</p>
+  <pre>
 template&lt;class U&gt; class C { };
 template&lt;class T&gt;
 class A
@@ -315,20 +306,16 @@
 };
 </pre>
 
-(Extracted from e-mail exchange of David Abrahams, Fernando Cacciola,
-and Peter Dimov; not actually tested.)
+  <p>(Extracted from e-mail exchange of David Abrahams, Fernando Cacciola,
+  and Peter Dimov; not actually tested.)</p>
 
+  <h2>Library</h2>
 
-<h2>Library</h2>
+  <h3>[cmath.abs] Function <code>double std::abs(double)</code> missing</h3>
 
-
-<h3>[cmath.abs] Function <code>double std::abs(double)</code>
-missing</h3>
-
-The function <code>double std::abs(double)</code> should be defined
-(std:26.5-5 [lib.c.math]), but it is not:
-
-<pre>
+  <p>The function <code>double std::abs(double)</code> should be defined
+  (std:26.5-5 [lib.c.math]), but it is not:</p>
+  <pre>
 #include &lt;cmath&gt;
 
 int main()
@@ -337,40 +324,39 @@
 }
 </pre>
 
-Note that <code>int std::abs(int)</code> will be used without warning
-if you write <code>std::abs(5.1)</code>.
-<p>
-Similar remarks apply to seemingly all of the other standard math
-functions, where Borland C++ fails to provide <code>float</code> and
-<code>long double</code> overloads.
-<p>
-<strong>Workaround:</strong> Use <code>std::fabs</code> instead if
-type genericity is not required.
+  <p>Note that <code>int std::abs(int)</code> will be used without warning if
+  you write <code>std::abs(5.1)</code>.</p>
 
-<h2>Appendix: Additional issues with Borland C++ version 5.5</h2>
+  <p>Similar remarks apply to seemingly all of the other standard math
+  functions, where Borland C++ fails to provide <code>float</code> and
+  <code>long double</code> overloads.</p>
 
-These issues are documented mainly for historic reasons.  If you are
-still using Borland C++ version 5.5, you are strongly encouraged to
-obtain an upgrade to version 5.5.1, which fixes the issues described
-in this section.
+  <p><strong>Workaround:</strong> Use <code>std::fabs</code> instead if type
+  genericity is not required.</p>
 
-<h3>[inline friend] Inline friend functions in template classes</h3>
+  <h2>Appendix: Additional issues with Borland C++ version 5.5</h2>
 
-If a friend function of some class has not been declared before the
-friend function declaration, the function is declared at the namespace
-scope surrounding the class definition.  Together with class templates
-and inline definitions of friend functions, the code in the following
-fragment should declare (and define) a non-template function "bool
-N::f(int,int)", which is a friend of class N::A&lt;int&gt;.  However,
-Borland C++ v5.5 expects the function f to be declared beforehand:
+  <p>These issues are documented mainly for historic reasons. If you are
+  still using Borland C++ version 5.5, you are strongly encouraged to obtain
+  an upgrade to version 5.5.1, which fixes the issues described in this
+  section.</p>
 
-<pre>
+  <h3>[inline friend] Inline friend functions in template classes</h3>
+
+  <p>If a friend function of some class has not been declared before the
+  friend function declaration, the function is declared at the namespace
+  scope surrounding the class definition. Together with class templates and
+  inline definitions of friend functions, the code in the following fragment
+  should declare (and define) a non-template function "bool N::f(int,int)",
+  which is a friend of class N::A&lt;int&gt;. However, Borland C++ v5.5
+  expects the function f to be declared beforehand:</p>
+  <pre>
 namespace N {
 template&lt;class T&gt;
 class A
 {
   // "f is not a member of 'N' in function main()"
-  friend bool f(T x, T y) { return x < y; }
+  friend bool f(T x, T y) { return x &lt; y; }
 };
 }
 
@@ -380,19 +366,29 @@
 }
 </pre>
 
-This technique is extensively used in boost/operators.hpp.  Giving in
-to the wish of the compiler doesn't work in this case, because then
-the "instantiate one template, get lots of helper functions at
-namespace scope" approach doesn't work anymore.  Defining
-BOOST_NO_OPERATORS_IN_NAMESPACE (a define
-BOOST_NO_INLINE_FRIENDS_IN_CLASS_TEMPLATES would match this case
-better) works around this problem and leads to another one, see
-[using-template].
+  <p>This technique is extensively used in boost/operators.hpp. Giving in to
+  the wish of the compiler doesn't work in this case, because then the
+  "instantiate one template, get lots of helper functions at namespace scope"
+  approach doesn't work anymore. Defining BOOST_NO_OPERATORS_IN_NAMESPACE (a
+  define BOOST_NO_INLINE_FRIENDS_IN_CLASS_TEMPLATES would match this case
+  better) works around this problem and leads to another one, see
+  [using-template].</p>
+  <hr>
 
-<p>
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-<hr>
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->03
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38512" --></p>
 
-2000-09-30 <a href="../people/jens_maurer.htm">Jens Maurer</a>
+  <p><i>Copyright &copy; 2000-2002 <a href="../people/jens_maurer.htm">Jens
+  Maurer</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/more/bugs.htm
===================================================================
--- boost/trunk/more/bugs.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/bugs.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -64,7 +64,7 @@
           <li>Make sure that the bug is still present in the code.</li>
           <li>Copy the file <code>intentional_bug.hpp</code> to a file called <code>intentional_bug.hpp.orig</code>.</li>
           <li>Apply your changes to <code>intentional_bug.hpp</code>.</li>
-          <li>Run "<code>diff -c intentional_bug.hpp.orig intentional_bug.hpp &gt; intentional_bug.hpp.patch</code>" from the command prompt.</li>
+          <li>Run "<code>diff -du intentional_bug.hpp.orig intentional_bug.hpp &gt; intentional_bug.hpp.patch</code>" from the command prompt.</li>
           <li>Submit the patch file together with an explanation of the bug
 and the proposed fix; and don't forget to include the word <b>patch</b> or <b>bug</b>
 in the subject if you're submitting to the <a href="http://www.boost.org/more/mailing_lists.htm#main">boost mailing list</a>.<br>

Modified: boost/trunk/more/count_bdy.htm
===================================================================
--- boost/trunk/more/count_bdy.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/count_bdy.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,564 +1,313 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
-<HTML>
+<html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="Author" content="Kevlin Henney">
+  <meta name="KeyWords" content=
+  "C++, Reference Counting, Advanced Techniques, Smart Pointers, Patterns">
 
-<HEAD>
+  <title>Counted Body Techniques</title>
+</head>
 
-   <TITLE>Counted Body Techniques</TITLE>
+<body bgcolor="#FFFFFF" text="#000000">
+  <h1 align="center"><i><font size="+4">Counted Body Techniques</font></i></h1>
 
-   <META NAME="GENERATOR" CONTENT="Microsoft FrontPage 4.0">
+  <center>
+    <p><b><font size="+1"><a href="../people/kevlin_henney.htm">Kevlin Henney</a><br></font> 
+    (<a href=
+    "mailto:kevlin at acm.org">kevlin at acm.org</a>, <a href=
+    "mailto:khenney at qatraining.com">khenney at qatraining.com</a>)</b></p>
+  </center>
 
-   <META NAME="Author" CONTENT="Kevlin Henney">
+  <div style="margin-left: 2em">
+    <p>Reference counting techniques? Nothing new, you might think. Every good 
+    C++ text that takes you to an intermediate or advanced level will 
+    introduce the concept. It has been explored with such thoroughness in the 
+    past that you might be forgiven for thinking that everything that can be 
+    said has been said. Well, let's start from first principles and see if we 
+    can unearth something new....</p>
+  </div>
+  <hr width="100%">
 
-   <META NAME="KeyWords" CONTENT="C++, Reference Counting, Advanced Techniques, Smart Pointers, Patterns">
+  <h2>And then there were none...</h2>
 
-</HEAD>
+  <div style="margin-left: 2em">
+    <p>The principle behind reference counting is to keep a running usage 
+    count of an object so that when it falls to zero we know the object is 
+    unused. This is normally used to simplify the memory management for 
+    dynamically allocated objects: keep a count of the number of references 
+    held to that object and, on zero, delete the object.</p>
 
-<BODY bgcolor="#FFFFFF" text="#000000">
+    <p>How to keep a track of the number of users of an object? Well, normal 
+    pointers are quite dumb, and so an extra level of indirection is required 
+    to manage the count. This is essentially the P<font size="-1">ROXY</font>
+    pattern described in <i>Design Patterns</i> [Gamma, Helm, Johnson &amp; 
+    Vlissides, Addison-Wesley, <font size="-1">ISBN</font> 0-201-63361-2]. The 
+    intent is given as</p>
 
+    <div style="margin-left: 2em">
+      <p><i>Provide a surrogate or placeholder for another object to control 
+      access to it.</i></p>
+    </div>
 
+    <p>Coplien [<i>Advanced C++ Programming Styles and Idioms</i>, 
+    Addison-Wesley, <font size="-1">ISBN</font> 0-201-56365-7] defines a set 
+    of idioms related to this essential separation of a handle and a body 
+    part. The <i>Taligent Guide to Designing Programs</i> [Addison-Wesley,
+    <font size="-1">ISBN</font> 0-201-40888-0] identifies a number of specific 
+    categories for proxies (aka surrogates). Broadly speaking they fall into 
+    two general categories:</p>
 
-<H1 ALIGN=CENTER><I><FONT SIZE=+4>Counted Body Techniques</FONT></I></H1>
+    <ul>
+      <li><i>Hidden</i>: The handle is the object of interest, hiding the body 
+      itself. The functionality of the handle is obtained by delegation to the 
+      body, and the user of the handle is unaware of the body. Reference 
+      counted strings offer a transparent optimisation. The body is shared 
+      between copies of a string until such a time as a change is needed, at 
+      which point a copy is made. Such a C<font size=
+      "-1">OPY</font> <font size="-1">ON</font> W<font size="-1">RITE</font>
+      pattern (a specialisation of L<font size="-1">AZY</font> E<font size=
+      "-1">VALUATION</font>) requires the use of a hidden reference counted 
+      body.</li>
 
+      <li><i>Explicit</i>: Here the body is of interest and the handle merely 
+      provides intelligence for its access and housekeeping. In C++ this is 
+      often implemented as the S<font size="-1">MART</font> P<font size=
+      "-1">OINTER</font> idiom. One such application is that of reference 
+      counted smart pointers that collaborate to keep a count of an object, 
+      deleting it when the count falls to zero.</li>
+    </ul>
+  </div>
+  <hr width="100%">
 
+  <h2>Attached vs detached</h2>
 
-<CENTER><P><B><FONT SIZE=+1><a href="../people/kevlin_henney.htm">Kevlin Henney</a><BR>
+  <div style="margin-left: 2em">
+    <p>For reference counted smart pointers there are two places the count can 
+    exist, resulting in two different patterns, both outlined in
+    <i>Software Patterns</i> [Coplien, SIGS, <font size="-1">ISBN</font>
+    0-884842-50-X]:</p>
 
-</FONT>(<A HREF="mailto:kevlin at acm.org">kevlin at acm.org</A>, <a HREF="mailto:khenney at qatraining.com">khenney at qatraining.com</a>)</B></P></CENTER>
+    <ul>
+      <li>C<font size="-1">OUNTED</font> B<font size="-1">ODY</font> or A<font size="-1">TTACHED</font> 
+      C<font size="-1">OUNTED</font>
+      H<font size="-1">ANDLE</font>/B<font size="-1">ODY</font> places the 
+      count within the object being counted. The benefits are that 
+      countability is a part of the object being counted, and that reference 
+      counting does not require an additional object. The drawbacks are 
+      clearly that this is intrusive, and that the space for the reference 
+      count is wasted when the object is not heap based. Therefore the 
+      reference counting ties you to a particular implementation and style of 
+      use.</li>
 
+      <li>D<font size="-1">ETACHED</font> C<font size="-1">OUNTED</font>
+      H<font size="-1">ANDLE</font>/B<font size="-1">ODY</font> places the 
+      count outside the object being counted, such that they are handled 
+      together. The clear benefit of this is that this technique is completely 
+      unintrusive, with all of the intelligence and support apparatus in the 
+      smart pointer, and therefore can be used on classes created 
+      independently of the reference counted pointer. The main disadvantage is 
+      that frequent use of this can lead to a proliferation of small objects, 
+      i.e. the counter, being created on the heap.</li>
+    </ul>
 
+    <p>Even with this simple analysis, it seems that the D<font size=
+    "-1">ETACHED</font> C<font size="-1">OUNTED</font> H<font size=
+    "-1">ANDLE</font>/B<font size="-1">ODY</font> approach is ahead. Indeed, 
+    with the increasing use of templates this is often the favourite, and is 
+    the principle behind the common - but not standard - <tt><font size=
+    "+1">counted_ptr</font></tt>. <i>[The Boost name is <a href=
+    "../libs/smart_ptr/shared_ptr.htm"><tt><font size=
+    "+1">shared_ptr</font></tt></a> rather than <tt><font size=
+    "+1">counted_ptr</font></tt>.]</i></p>
 
-<UL>
+    <p>A common implementation of C<font size="-1">OUNTED</font> B<font size=
+    "-1">ODY</font> is to provide the counting mechanism in a base class that 
+    the counted type is derived from. Either that, or the reference counting 
+    mechanism is provided anew for each class that needs it. Both of these 
+    approaches are unsatisfactory because they are quite closed, coupling a 
+    class into a particular framework. Added to this the non-cohesiveness of 
+    having the count lying dormant in a non-counted object, and you get the 
+    feeling that excepting its use in widespread object models such as COM and 
+    CORBA the C<font size="-1">OUNTED</font> B<font size="-1">ODY</font>
+    approach is perhaps only of use in specialised situations.</p>
+  </div>
+  <hr width="100%">
 
-<P>Reference counting techniques? Nothing new, you might think. Every good
+  <h2>A requirements based approach</h2>
 
-C++ text that takes you to an intermediate or advanced level will introduce
+  <div style="margin-left: 2em">
+    <p>It is the question of openness that convinced me to revisit the 
+    problems with the C<font size="-1">OUNTED</font> B<font size=
+    "-1">ODY</font> idiom. Yes, there is a certain degree of intrusion 
+    expected when using this idiom, but is there anyway to minimise this and 
+    decouple the choice of counting mechanism from the smart pointer type 
+    used?</p>
 
-the concept. It has been explored with such thoroughness in the past that
+    <p>In recent years the most instructive body of code and specification for 
+    constructing open general purpose components has been the Stepanov and 
+    Lee's STL (Standard Template Library), now part of the C++ standard 
+    library. The STL approach makes extensive use of compile time polymorphism 
+    based on well defined operational requirements for types. For instance, 
+    each container, contained and iterator type is defined by the operations 
+    that should be performable on an object of that type, often with 
+    annotations describing additional constraints. Compile time polymorphism, 
+    as its name suggests, resolves functions at compile time based on function 
+    name and argument usage, i.e. overloading. This is less intrusive, 
+    although less easily diagnosed if incorrect, than runtime poymorphism that 
+    is based on types, names and function signatures.</p>
 
-you might be forgiven for thinking that everything that can be said has
+    <p>This requirements based approach can be applied to reference counting. 
+    The operations we need for a type to be <i>Countable</i> are loosely:</p>
 
-been said. Well, let's start from first principles and see if we can unearth
+    <ul>
+      <li>An <tt><font size="+1">acquire</font></tt> operation that registers 
+      interest in a <i>Countable</i> object.</li>
 
-something new....</P>
+      <li>A <tt><font size="+1">release</font></tt> operation unregisters 
+      interest in a <i>Countable</i> object.</li>
 
-</UL>
+      <li>An <tt><font size="+1">acquired</font></tt> query that returns 
+      whether or not a <i>Countable</i> object is currently acquired.</li>
 
+      <li>A <tt><font size="+1">dispose</font></tt> operation that is 
+      responsible for disposing of an object that is no longer acquired.</li>
+    </ul>
 
+    <p>Note that the count is deduced as a part of the abstract state of this 
+    type, and is not mentioned or defined in any other way. The openness of 
+    this approach derives in part from the use of global functions, meaning 
+    that no particular member functions are implied; a perfect way to wrap up 
+    an existing counted body class without modifying the class itself. The 
+    other aspect to the openness comes from a more precise specification of 
+    the operations.</p>
 
+    <p>For a type to be <i>Countable</i> it must satisfy the following 
+    requirements, where <tt><font size="+1">ptr</font></tt> is a non-null 
+    pointer to a single object (i.e. not an array) of the type, and
+    <i><tt><font size="+1">#function</font></tt></i> indicates number of calls 
+    to <tt><font size="+1"><i>function(</i>ptr<i>)</i></font></tt>:</p>
 
-<HR WIDTH="100%">
-<H2>And then there were none...</H2>
+    <center>
+      <table border="1" cellspacing="2" cellpadding="2" summary="">
+        <tr>
+          <td><i>Expression</i></td>
 
+          <td><i>Return type</i></td>
 
-<UL>
+          <td><i>Semantics and notes</i></td>
+        </tr>
 
-<P>The principle behind reference counting is to keep a running usage count
+        <tr>
+          <td><tt><font size="+1">acquire(ptr)</font></tt></td>
 
-of an object so that when it falls to zero we know the object is unused.
+          <td>no requirement</td>
 
-This is normally used to simplify the memory management for dynamically
+          <td><i>post</i>: <tt><font size="+1">acquired(ptr)</font></tt></td>
+        </tr>
 
-allocated objects: keep a count of the number of references held to that
+        <tr>
+          <td><tt><font size="+1">release(ptr)</font></tt></td>
 
-object and, on zero, delete the object.</P>
+          <td>no requirement</td>
 
+          <td><i>pre</i>: <tt><font size="+1">acquired(ptr)<br></font></tt>
+          <i>post</i>: <tt><font size="+1">acquired(ptr) == #acquire - 
+          #release</font></tt></td>
+        </tr>
 
+        <tr>
+          <td><tt><font size="+1">acquired(ptr)</font></tt></td>
 
-<P>How to keep a track of the number of users of an object? Well, normal
+          <td>convertible to <tt><font size="+1">bool</font></tt></td>
 
-pointers are quite dumb, and so an extra level of indirection is required
+          <td><i>return</i>: <tt><font size="+1">#acquire &gt; #release</font></tt></td>
+        </tr>
 
-to manage the count. This is essentially the P<FONT SIZE=-1>ROXY</FONT>
+        <tr>
+          <td><tt><font size="+1">dispose(ptr, ptr)</font></tt></td>
 
-pattern described in <I>Design Patterns</I> [Gamma, Helm, Johnson &amp;
+          <td>no requirement</td>
 
-Vlissides, Addison-Wesley, <FONT SIZE=-1>ISBN </FONT>0-201-63361-2]. The
+          <td><i>pre</i>: <tt><font size="+1">!acquired(ptr)<br></font></tt>
+          <i>post</i>: <tt><font size="+1">*ptr</font></tt> no longer usable</td>
+        </tr>
+      </table>
+    </center>
 
-intent is given as</P>
+    <p>Note that the two arguments to <tt><font size="+1">dispose</font></tt>
+    are to support selection of the appropriate type safe version of the 
+    function to be called. In the general case the intent is that the first 
+    argument determines the type to be deleted, and would typically be 
+    templated, while the second selects which template to use, e.g. by 
+    conforming to a specific base class.</p>
 
+    <p>In addition the following requirements must also be satisfied, where
+    <tt><font size="+1">null</font></tt> is a null pointer to the
+    <i>Countable</i> type:</p>
 
+    <center>
+      <table border="1" summary="">
+        <tr>
+          <td><i>Expression</i></td>
 
-<UL>
+          <td><i>Return type</i></td>
 
-<P><I>Provide a surrogate or placeholder for another object to control
+          <td><i>Semantics and notes</i></td>
+        </tr>
 
-access to it.</I></P>
+        <tr>
+          <td><tt><font size="+1">acquire(null)</font></tt></td>
 
-</UL>
+          <td>no requirement</td>
 
+          <td><i>action</i>: none</td>
+        </tr>
 
+        <tr>
+          <td><tt><font size="+1">release(null)</font></tt></td>
 
-<P>Coplien [<I>Advanced C++ Programming Styles and Idioms</I>, Addison-Wesley,
+          <td>no requirement</td>
 
-<FONT SIZE=-1>ISBN </FONT>0-201-56365-7] defines a set of idioms related
+          <td><i>action</i>: none</td>
+        </tr>
 
-to this essential separation of a handle and a body part. The <I>Taligent
+        <tr>
+          <td><tt><font size="+1">acquired(null)</font></tt></td>
 
-Guide to Designing Programs </I>[Addison-Wesley, <FONT SIZE=-1>ISBN </FONT>0-201-40888-0]
+          <td>convertible to <tt><font size="+1">bool</font></tt></td>
 
-identifies a number of specific categories for proxies (aka surrogates).
+          <td><i>return</i>: <tt><font size="+1">false</font></tt></td>
+        </tr>
 
-Broadly speaking they fall into two general categories:</P>
+        <tr>
+          <td><tt><font size="+1">dispose(null, null)</font></tt></td>
 
+          <td>no requirement</td>
 
+          <td><i>action</i>: none</td>
+        </tr>
+      </table>
+    </center>
 
-<UL>
+    <p>Note that there are no requirements on these functions in terms of 
+    exceptions thrown or not thrown, except that if exceptions are thrown the 
+    functions themselves should be exception safe.</p>
+  </div>
+  <hr width="100%">
 
-<LI><I>Hidden</I>: The handle is the object of interest, hiding the body
+  <h2>Getting smart</h2>
 
-itself. The functionality of the handle is obtained by delegation to the
+  <div style="margin-left: 2em">
+    <p>Given the <i>Countable</i> requirements for a type, it is possible to 
+    define a generic smart pointer type that uses them for reference counting:</p>
 
-body, and the user of the handle is unaware of the body. Reference counted
-
-strings offer a transparent optimisation. The body is shared between copies
-
-of a string until such a time as a change is needed, at which point a copy
-
-is made. Such a C<FONT SIZE=-1>OPY</FONT> <FONT SIZE=-1>ON</FONT> W<FONT SIZE=-1>RITE</FONT>
-
-pattern (a specialisation of L<FONT SIZE=-1>AZY</FONT> E<FONT SIZE=-1>VALUATION</FONT>)
-
-requires the use of a hidden reference counted body.</LI>
-
-
-
-<LI><I>Explicit</I>: Here the body is of interest and the handle merely
-
-provides intelligence for its access and housekeeping. In C++ this is often
-
-implemented as the S<FONT SIZE=-1>MART</FONT> P<FONT SIZE=-1>OINTER</FONT>
-
-idiom. One such application is that of reference counted smart pointers
-
-that collaborate to keep a count of an object, deleting it when the count
-
-falls to zero.</LI>
-
-</UL>
-
-</UL>
-
-
-
-
-<HR WIDTH="100%">
-<H2>Attached vs detached</H2>
-
-
-<UL>
-
-<P>For reference counted smart pointers there are two places the count
-
-can exist, resulting in two different patterns, both outlined in <I>Software
-
-Patterns</I> [Coplien, SIGS, <FONT SIZE=-1>ISBN </FONT>0-884842-50-X]:</P>
-
-
-
-<UL>
-
-<LI>C<FONT SIZE=-1>OUNTED</FONT> B<FONT SIZE=-1>ODY</FONT> or A<FONT SIZE=-1>TTACHED</FONT>
-
-C<FONT SIZE=-1>OUNTED</FONT> H<FONT SIZE=-1>ANDLE</FONT>/B<FONT SIZE=-1>ODY</FONT>
-
-places the count within the object being counted. The benefits are that
-
-countability is a part of the object being counted, and that reference
-
-counting does not require an additional object. The drawbacks are clearly
-
-that this is intrusive, and that the space for the reference count is wasted
-
-when the object is not heap based. Therefore the reference counting ties
-
-you to a particular implementation and style of use.</LI>
-
-
-
-<LI>D<FONT SIZE=-1>ETACHED</FONT> C<FONT SIZE=-1>OUNTED</FONT> H<FONT SIZE=-1>ANDLE</FONT>/B<FONT SIZE=-1>ODY</FONT>
-
-places the count outside the object being counted, such that they are handled
-
-together. The clear benefit of this is that this technique is completely
-
-unintrusive, with all of the intelligence and support apparatus in the
-
-smart pointer, and therefore can be used on classes created independently
-
-of the reference counted pointer. The main disadvantage is that frequent
-
-use of this can lead to a proliferation of small objects, i.e. the counter,
-
-being created on the heap.</LI>
-
-</UL>
-
-
-
-<P>Even with this simple analysis, it seems that the D<FONT SIZE=-1>ETACHED</FONT>
-
-C<FONT SIZE=-1>OUNTED</FONT> H<FONT SIZE=-1>ANDLE</FONT>/B<FONT SIZE=-1>ODY</FONT>
-
-approach is ahead. Indeed, with the increasing use of templates this is
-
-often the favourite, and is the principle behind the common - but not standard
-
-- <TT><FONT SIZE=+1>counted_ptr</FONT></TT>.
-<I>[The Boost name is <a href="../libs/smart_ptr/shared_ptr.htm"><TT><FONT SIZE=+1>shared_ptr</FONT></TT></a>
-
-rather than <TT><FONT SIZE=+1>counted_ptr</FONT></TT>.]</I></P>
-
-
-
-<P>A common implementation of C<FONT SIZE=-1>OUNTED</FONT> B<FONT SIZE=-1>ODY</FONT>
-
-is to provide the counting mechanism in a base class that the counted type
-
-is derived from. Either that, or the reference counting mechanism is provided
-
-anew for each class that needs it. Both of these approaches are unsatisfactory
-
-because they are quite closed, coupling a class into a particular framework.
-
-Added to this the non-cohesiveness of having the count lying dormant in
-
-a non-counted object, and you get the feeling that excepting its use in
-
-widespread object models such as COM and CORBA the C<FONT SIZE=-1>OUNTED</FONT>
-
-B<FONT SIZE=-1>ODY</FONT> approach is perhaps only of use in specialised
-
-situations.</P>
-
-</UL>
-
-
-
-<HR WIDTH="100%">
-<H2>A requirements based approach</H2>
-
-
-<UL>
-
-<P>It is the question of openness that convinced me to revisit the problems
-
-with the C<FONT SIZE=-1>OUNTED</FONT> B<FONT SIZE=-1>ODY</FONT> idiom.
-
-Yes, there is a certain degree of intrusion expected when using this idiom,
-
-but is there anyway to minimise this and decouple the choice of counting
-
-mechanism from the smart pointer type used?</P>
-
-
-
-<P>In recent years the most instructive body of code and specification
-
-for constructing open general purpose components has been the Stepanov
-
-and Lee's STL (Standard Template Library), now part of the C++ standard
-
-library. The STL approach makes extensive use of compile time polymorphism
-
-based on well defined operational requirements for types. For instance,
-
-each container, contained and iterator type is defined by the operations
-
-that should be performable on an object of that type, often with annotations
-
-describing additional constraints. Compile time polymorphism, as its name
-
-suggests, resolves functions at compile time based on function name and
-
-argument usage, i.e. overloading. This is less intrusive, although less
-
-easily diagnosed if incorrect, than runtime poymorphism that is based on
-
-types, names and function signatures.</P>
-
-
-
-<P>This requirements based approach can be applied to reference counting.
-
-The operations we need for a type to be <I>Countable</I> are loosely:</P>
-
-
-
-<UL>
-
-<LI>An <TT><FONT SIZE=+1>acquire</FONT></TT> operation that registers interest
-
-in a <I>Countable </I>object.</LI>
-
-
-
-<LI>A <TT><FONT SIZE=+1>release</FONT></TT> operation unregisters interest
-
-in a <I>Countable </I>object.</LI>
-
-
-
-<LI>An <TT><FONT SIZE=+1>acquired</FONT></TT> query that returns whether
-
-or not a <I>Countable </I>object is currently acquired.</LI>
-
-
-
-<LI>A <TT><FONT SIZE=+1>dispose</FONT></TT> operation that is responsible
-
-for disposing of an object that is no longer acquired.</LI>
-
-</UL>
-
-
-
-<P>Note that the count is deduced as a part of the abstract state of this
-
-type, and is not mentioned or defined in any other way. The openness of
-
-this approach derives in part from the use of global functions, meaning
-
-that no particular member functions are implied; a perfect way to wrap
-
-up an existing counted body class without modifying the class itself. The
-
-other aspect to the openness comes from a more precise specification of
-
-the operations.</P>
-
-
-
-<P>For a type to be <I>Countable</I> it must satisfy the following requirements,
-
-where <TT><FONT SIZE=+1>ptr</FONT></TT> is a non-null pointer to a single
-
-object (i.e. not an array) of the type, and <I><TT><FONT SIZE=+1>#function</FONT></TT></I>
-
-indicates number of calls to <TT><FONT SIZE=+1><I>function(</I>ptr<I>)</I></FONT></TT>:</P>
-
-
-
-<CENTER><TABLE BORDER=1 CELLSPACING=2 CELLPADDING=2 >
-
-<TR>
-
-<TD><I>Expression</I></TD>
-
-
-
-<TD><I>Return type</I></TD>
-
-
-
-<TD><I>Semantics and notes</I></TD>
-
-</TR>
-
-
-
-<TR>
-
-<TD><TT><FONT SIZE=+1>acquire(ptr)</FONT></TT></TD>
-
-
-
-<TD>no requirement</TD>
-
-
-
-<TD><I>post</I>: <TT><FONT SIZE=+1>acquired(ptr)</FONT></TT></TD>
-
-</TR>
-
-
-
-<TR>
-
-<TD><TT><FONT SIZE=+1>release(ptr)</FONT></TT></TD>
-
-
-
-<TD>no requirement</TD>
-
-
-
-<TD><I>pre</I>: <TT><FONT SIZE=+1>acquired(ptr)<BR>
-
-</FONT></TT><I>post</I>: <TT><FONT SIZE=+1>acquired(ptr) == #acquire -
-
-#release</FONT></TT></TD>
-
-</TR>
-
-
-
-<TR>
-
-<TD><TT><FONT SIZE=+1>acquired(ptr)</FONT></TT></TD>
-
-
-
-<TD>convertible to <TT><FONT SIZE=+1>bool</FONT></TT></TD>
-
-
-
-<TD><I>return</I>: <TT><FONT SIZE=+1>#acquire &gt; #release</FONT></TT></TD>
-
-</TR>
-
-
-
-<TR>
-
-<TD><TT><FONT SIZE=+1>dispose(ptr, ptr)</FONT></TT></TD>
-
-
-
-<TD>no requirement</TD>
-
-
-
-<TD><I>pre</I>: <TT><FONT SIZE=+1>!acquired(ptr)<BR>
-
-</FONT></TT><I>post</I>: <TT><FONT SIZE=+1>*ptr</FONT></TT> no longer usable</TD>
-
-</TR>
-
-</TABLE></CENTER>
-
-
-
-<P>Note that the two arguments to <TT><FONT SIZE=+1>dispose</FONT></TT>
-
-are to support selection of the appropriate type safe version of the function
-
-to be called. In the general case the intent is that the first argument
-
-determines the type to be deleted, and would typically be templated, while
-
-the second selects which template to use, e.g. by conforming to a specific
-
-base class.</P>
-
-
-
-<P>In addition the following requirements must also be satisfied, where
-
-<TT><FONT SIZE=+1>null</FONT></TT> is a null pointer to the <I>Countable</I>
-
-type:</P>
-
-
-
-<CENTER><TABLE BORDER=1 >
-
-<TR>
-
-<TD><I>Expression</I></TD>
-
-
-
-<TD><I>Return type</I></TD>
-
-
-
-<TD><I>Semantics and notes</I></TD>
-
-</TR>
-
-
-
-<TR>
-
-<TD><TT><FONT SIZE=+1>acquire(null)</FONT></TT></TD>
-
-
-
-<TD>no requirement</TD>
-
-
-
-<TD><I>action</I>: none</TD>
-
-</TR>
-
-
-
-<TR>
-
-<TD><TT><FONT SIZE=+1>release(null)</FONT></TT></TD>
-
-
-
-<TD>no requirement</TD>
-
-
-
-<TD><I>action</I>: none</TD>
-
-</TR>
-
-
-
-<TR>
-
-<TD><TT><FONT SIZE=+1>acquired(null)</FONT></TT></TD>
-
-
-
-<TD>convertible to <TT><FONT SIZE=+1>bool</FONT></TT></TD>
-
-
-
-<TD><I>return</I>: <TT><FONT SIZE=+1>false</FONT></TT></TD>
-
-</TR>
-
-
-
-<TR>
-
-<TD><TT><FONT SIZE=+1>dispose(null, null)</FONT></TT></TD>
-
-
-
-<TD>no requirement</TD>
-
-
-
-<TD><I>action</I>: none</TD>
-
-</TR>
-
-</TABLE></CENTER>
-
-
-
-<P>Note that there are no requirements on these functions in terms of exceptions
-
-thrown or not thrown, except that if exceptions are thrown the functions
-
-themselves should be exception safe.</P>
-
-</UL>
-
-
-
-<HR WIDTH="100%">
-<H2>Getting smart</H2>
-
-
-<UL>
-
-<P>Given the <I>Countable</I> requirements for a type, it is possible to
-
-define a generic smart pointer type that uses them for reference counting:</P>
-
-
-
-<UL>
-<PRE><TT>template&lt;typename countable_type&gt;
+    <div style="margin-left: 2em">
+      <pre>
+<tt>template&lt;typename countable_type&gt;
 class countable_ptr
 {
 public: // construction and destruction
@@ -585,27 +334,19 @@
     countable_type *body;
 
 };
-</TT></PRE>
+</tt>
+</pre>
+    </div>
 
-</UL>
+    <p>The interface to this class has been kept intentionally simple, e.g. 
+    member templates and <tt><font size="+1">throw</font></tt> specs have been 
+    omitted, for exposition. The majority of the functions are quite simple in 
+    implementation, relying very much on the <tt><font size=
+    "+1">assign</font></tt> member as a keystone function:</p>
 
-
-
-<P>The interface to this class has been kept intentionally simple, e.g.
-
-member templates and <TT><FONT SIZE=+1>throw</FONT></TT> specs have been
-
-omitted, for exposition. The majority of the functions are quite simple
-
-in implementation, relying very much on the <TT><FONT SIZE=+1>assign</FONT></TT>
-
-member as a keystone function:</P>
-
-
-
-<UL>
-
-<PRE><TT>template&lt;typename countable_type&gt;
+    <div style="margin-left: 2em">
+      <pre>
+<tt>template&lt;typename countable_type&gt;
 countable_ptr&lt;countable_type&gt;::countable_ptr(countable_type *initial)
   : body(initial)
 {
@@ -678,33 +419,24 @@
 {
     return assign(rhs);
 }
-</TT></PRE>
+</tt>
+</pre>
+    </div>
+  </div>
+  <hr width="100%">
 
-</UL>
+  <h2>Public accountability</h2>
 
-</UL>
+  <div style="margin-left: 2em">
+    <p>Conformance to the requirements means that a type can be used with
+    <tt><font size="+1">countable_ptr</font></tt>. Here is an implementation 
+    mix-in class (<i>mix-imp</i>) that confers countability on its derived 
+    classes through member functions. This class can be used as a class 
+    adaptor:</p>
 
-
-
-<HR WIDTH="100%">
-<H2>Public accountability</H2>
-
-
-<UL>
-
-<P>Conformance to the requirements means that a type can be used with <TT><FONT SIZE=+1>countable_ptr</FONT></TT>.
-
-Here is an implementation mix-in class (<I>mix-imp</I>) that confers countability
-
-on its derived classes through member functions. This class can be used
-
-as a class adaptor:</P>
-
-
-
-<UL>
-
-<PRE><TT>class countability
+    <div style="margin-left: 2em">
+      <pre>
+<tt>class countability
 {
 public: // manipulation
 
@@ -727,41 +459,27 @@
     countability &amp;operator=(const countability &amp;);
 
 };
-</TT></PRE>
+</tt>
+</pre>
+    </div>
 
-</UL>
+    <p>Notice that the manipulation functions are <tt><font size=
+    "+1">const</font></tt> and that the <tt><font size="+1">count</font></tt>
+    member itself is <tt><font size="+1">mutable</font></tt>. This is because 
+    countability is not a part of an object's abstract state: memory 
+    management does not depend on the <tt><font size=
+    "+1">const</font></tt>-ness or otherwise of an object. I won't include the 
+    definitions of the member functions here as you can probably guess them: 
+    increment, decrement and return the current count, respectively for the 
+    manipulation functions. In a multithreaded environment you should ensure 
+    that such read and write operations are atomic.</p>
 
+    <p>So how do we make this class <i>Countable</i>? A simple set of 
+    forwarding functions does the job:</p>
 
-
-<P>Notice that the manipulation functions are <TT><FONT SIZE=+1>const</FONT></TT>
-
-and that the <TT><FONT SIZE=+1>count</FONT></TT> member itself is <TT><FONT SIZE=+1>mutable</FONT></TT>.
-
-This is because countability is not a part of an object's abstract state:
-
-memory management does not depend on the <TT><FONT SIZE=+1>const</FONT></TT>-ness
-
-or otherwise of an object. I won't include the definitions of the member
-
-functions here as you can probably guess them: increment, decrement and
-
-return the current count, respectively for the manipulation functions.
-
-In a multithreaded environment you should ensure that such read and write
-
-operations are atomic.</P>
-
-
-
-<P>So how do we make this class <I>Countable</I>? A simple set of forwarding
-
-functions does the job:</P>
-
-
-
-<UL>
-
-<PRE><TT>void acquire(const countability *ptr)
+    <div style="margin-left: 2em">
+      <pre>
+<tt>void acquire(const countability *ptr)
 {
     if(ptr)
     {
@@ -787,21 +505,17 @@
 {
     delete ptr;
 }
-</TT></PRE>
+</tt>
+</pre>
+    </div>
 
-</UL>
+    <p>Any type that now derives from <tt><font size=
+    "+1">countability</font></tt> may now be used with <tt><font size=
+    "+1">countable_ptr</font></tt>:</p>
 
-
-
-<P>Any type that now derives from <TT><FONT SIZE=+1>countability</FONT></TT>
-
-may now be used with <TT><FONT SIZE=+1>countable_ptr</FONT></TT>:</P>
-
-
-
-<UL>
-
-<PRE><TT>class example : public countability
+    <div style="margin-left: 2em">
+      <pre>
+<tt>class example : public countability
 {
     ...
 };
@@ -812,91 +526,59 @@
     countable_ptr&lt;example&gt; qtr(ptr);
     ptr.clear(); // set ptr to point to null
 }   // allocated object deleted when qtr destructs
-</TT></PRE>
-</UL>
-</UL>
+</tt>
+</pre>
+    </div>
+  </div>
+  <hr width="100%">
 
+  <h2>Runtime mixin</h2>
 
+  <div style="margin-left: 2em">
+    <p>The challenge is to apply C<font size="-1">OUNTED</font> B<font size=
+    "-1">ODY</font> in a non-intrusive fashion, such that there is no overhead 
+    when an object is not counted. What we would like to do is confer this 
+    capability on a per object rather than on a per class basis. Effectively 
+    we are after <i>Countability</i> on any object, i.e. anything pointed to 
+    by a <tt><font size="+1">void *</font></tt>! It goes without saying that <tt><font size="+1">
+    void</font></tt> is perhaps the least committed of any type.</p>
 
+    <p>The forces to resolve on this are quite interesting, to say the least. 
+    Interesting, but not insurmountable. Given that the class of a runtime 
+    object cannot change dynamically in any well defined manner, and the 
+    layout of the object must be fixed, we have to find a new place and time 
+    to add the counting state. The fact that this must be added only on heap 
+    creation suggests the following solution:</p>
 
-<HR WIDTH="100%">
-<H2>Runtime mixin</H2>
-
-
-<UL>
-
-<P>The challenge is to apply C<FONT SIZE=-1>OUNTED</FONT> B<FONT SIZE=-1>ODY</FONT>
-
-in a non-intrusive fashion, such that there is no overhead when an object
-
-is not counted. What we would like to do is confer this capability on a
-
-per object rather than on a per class basis. Effectively we are after <I>Countability
-
-</I>on any object, i.e. anything pointed to by a <TT><FONT SIZE=+1>void
-
-*</FONT></TT>! It goes without saying that <TT><FONT SIZE=+1>void</FONT></TT>
-
-is perhaps the least committed of any type.</P>
-
-
-
-<P>The forces to resolve on this are quite interesting, to say the least.
-
-Interesting, but not insurmountable. Given that the class of a runtime
-
-object cannot change dynamically in any well defined manner, and the layout
-
-of the object must be fixed, we have to find a new place and time to add
-
-the counting state. The fact that this must be added only on heap creation
-
-suggests the following solution:</P>
-
-
-
-<UL>
-
-<PRE><TT>struct countable_new;
+    <div style="margin-left: 2em">
+      <pre>
+<tt>struct countable_new;
 extern const countable_new countable;
 
 void *operator new(size_t, const countable_new &amp;);
-void operator delete(void *, const countable_new &amp;);</TT></PRE>
-</UL>
+void operator delete(void *, const countable_new &amp;);</tt>
+</pre>
+    </div>
 
+    <p>We have overloaded <tt><font size="+1">operator new</font></tt> with a 
+    dummy argument to distinguish it from the regular global <tt><font size=
+    "+1">operator new</font></tt>. This is comparable to the use of the
+    <tt><font size="+1">std::nothrow_t</font></tt> type and <tt><font size=
+    "+1">std::nothrow</font></tt> object in the standard library. The 
+    placement <tt><font size="+1">operator delete</font></tt> is there to 
+    perform any tidy up in the event of failed construction. Note that this is 
+    not yet supported on all that many compilers.</p>
 
+    <p>The result of a <tt><font size="+1">new</font></tt> expression using
+    <tt><font size="+1">countable</font></tt> is an object allocated on the 
+    heap that has a header block that holds the count, i.e. we have extended 
+    the object by prefixing it. We can provide a couple of features in an 
+    anonymous namespace (not shown) in the implementation file for for 
+    supporting the count and its access from a raw pointer:</p>
 
-<P>We have overloaded <TT><FONT SIZE=+1>operator new</FONT></TT> with a
-
-dummy argument to distinguish it from the regular global <TT><FONT SIZE=+1>operator
-
-new</FONT></TT>. This is comparable to the use of the <TT><FONT SIZE=+1>std::nothrow_t</FONT></TT>
-
-type and <TT><FONT SIZE=+1>std::nothrow</FONT></TT> object in the standard
-
-library. The placement <TT><FONT SIZE=+1>operator delete</FONT></TT> is
-
-there to perform any tidy up in the event of failed construction. Note
-
-that this is not yet supported on all that many compilers.</P>
-
-
-
-<P>The result of a <TT><FONT SIZE=+1>new</FONT></TT> expression using <TT><FONT SIZE=+1>countable</FONT></TT>
-
-is an object allocated on the heap that has a header block that holds the
-
-count, i.e. we have extended the object by prefixing it. We can provide
-
-a couple of features in an anonymous namespace (not shown) in the implementation
-
-file for for supporting the count and its access from a raw pointer:</P>
-
-
-
-<UL>
-
-<PRE><TT>struct count
+    <div style="margin-left: 2em">
+      <pre>
+<tt>struct count
 {
     size_t value;
 };
@@ -905,49 +587,33 @@
 {
     return const_cast&lt;count *&gt;(static_cast&lt;const count *&gt;(ptr) - 1);
 }
-</TT></PRE>
+</tt>
+</pre>
+    </div>
 
-</UL>
+    <p>An important constraint to observe here is the alignment of
+    <tt><font size="+1">count</font></tt> should be such that it is suitably 
+    aligned for any type. For the definition shown this will be the case on 
+    almost all platforms. However, you may need to add a padding member for 
+    those that don't, e.g. using an anonymous <tt><font size=
+    "+1">union</font></tt> to coalign <tt><font size="+1">count</font></tt>
+    and the most aligned type. Unfortunately, there is no portable way of 
+    specifying this such that the minimum alignment is also observed - this is 
+    a common problem when specifying your own allocators that do not directly 
+    use the results of either <tt><font size="+1">new</font></tt> or
+    <tt><font size="+1">malloc</font></tt>.</p>
 
+    <p>Again, note that the count is not considered to be a part of the 
+    logical state of the object, and hence the conversion from
+    <tt><font size="+1">const</font></tt> to non-<tt><font size=
+    "+1">const</font></tt> - <tt><font size="+1">count</font></tt> is in 
+    effect a <tt><font size="+1">mutable</font></tt> type.</p>
 
+    <p>The allocator functions themselves are fairly straightforward:</p>
 
-<P>An important constraint to observe here is the alignment of <TT><FONT SIZE=+1>count</FONT></TT>
-
-should be such that it is suitably aligned for any type. For the definition
-
-shown this will be the case on almost all platforms. However, you may need
-
-to add a padding member for those that don't, e.g. using an anonymous <TT><FONT SIZE=+1>union</FONT></TT>
-
-to coalign <TT><FONT SIZE=+1>count</FONT></TT> and the most aligned type.
-
-Unfortunately, there is no portable way of specifying this such that the
-
-minimum alignment is also observed - this is a common problem when specifying
-
-your own allocators that do not directly use the results of either <TT><FONT SIZE=+1>new</FONT></TT>
-
-or <TT><FONT SIZE=+1>malloc</FONT></TT>.</P>
-
-
-
-<P>Again, note that the count is not considered to be a part of the logical
-
-state of the object, and hence the conversion from <TT><FONT SIZE=+1>const</FONT></TT>
-
-to non-<TT><FONT SIZE=+1>const</FONT></TT> - <TT><FONT SIZE=+1>count</FONT></TT>
-
-is in effect a <TT><FONT SIZE=+1>mutable</FONT></TT> type.</P>
-
-
-
-<P>The allocator functions themselves are fairly straightforward:</P>
-
-
-
-<UL>
-
-<PRE><TT>void *operator new(size_t size, const countable_new &amp;)
+    <div style="margin-left: 2em">
+      <pre>
+<tt>void *operator new(size_t size, const countable_new &amp;)
 {
     count *allocated = static_cast&lt;count *&gt;(::operator new(sizeof(count) + size));
     *allocated = count(); // initialise the header
@@ -958,23 +624,17 @@
 {
     ::operator delete(header(ptr));
 }
-</TT></PRE>
+</tt>
+</pre>
+    </div>
 
-</UL>
+    <p>Given a correctly allocated header, we now need the <i>Countable</i>
+    functions to operate on <tt><font size="+1">const void *</font></tt> to 
+    complete the picture:</p>
 
-
-
-<P>Given a correctly allocated header, we now need the <I>Countable </I>functions
-
-to operate on <TT><FONT SIZE=+1>const void *</FONT></TT> to complete the
-
-picture:</P>
-
-
-
-<UL>
-
-<PRE><TT>void acquire(const void *ptr)
+    <div style="margin-left: 2em">
+      <pre>
+<tt>void acquire(const void *ptr)
 {
     if(ptr)
     {
@@ -1001,49 +661,32 @@
     ptr-&gt;~countable_type();
     operator delete(const_cast&lt;countable_type *&gt;(ptr), countable);
 }
-</TT></PRE>
+</tt>
+</pre>
+    </div>
 
-</UL>
+    <p>The most complex of these is the <tt><font size=
+    "+1">dispose</font></tt> function that must ensure that the correct type 
+    is destructed and also that the memory is collected from the correct 
+    offset. It uses the value and type of first argument to perform this 
+    correctly, and the second argument merely acts as a strategy selector, 
+    i.e. the use of <tt><font size="+1">const void *</font></tt>
+    distinguishes it from the earlier dispose shown for <tt><font size=
+    "+1">const countability *</font></tt>.</p>
+  </div>
+  <hr width="100%">
 
+  <h2>Getting smarter</h2>
 
+  <div style="margin-left: 2em">
+    <p>Now that we have a way of adding countability at creation for objects 
+    of any type, what extra is needed to make this work with the
+    <tt><font size="+1">countable_ptr</font></tt> we defined earlier? Good 
+    news: nothing!</p>
 
-<P>The most complex of these is the <TT><FONT SIZE=+1>dispose</FONT></TT>
-
-function that must ensure that the correct type is destructed and also
-
-that the memory is collected from the correct offset. It uses the value
-
-and type of first argument to perform this correctly, and the second argument
-
-merely acts as a strategy selector, i.e. the use of <TT><FONT SIZE=+1>const
-
-void *</FONT></TT> distinguishes it from the earlier dispose shown for
-
-<TT><FONT SIZE=+1>const countability *</FONT></TT>.</P>
-
-</UL>
-
-
-
-
-<HR WIDTH="100%">
-<H2>Getting smarter</H2>
-
-
-
-<UL>
-
-<P>Now that we have a way of adding countability at creation for objects
-
-of any type, what extra is needed to make this work with the <TT><FONT SIZE=+1>countable_ptr</FONT></TT>
-
-we defined earlier? Good news: nothing!</P>
-
-
-
-<UL>
-
-<PRE><TT>class example
+    <div style="margin-left: 2em">
+      <pre>
+<tt>class example
 {
     ...
 };
@@ -1054,113 +697,78 @@
     countable_ptr&lt;example&gt; qtr(ptr);
     ptr.clear(); // set ptr to point to null
 }   // allocated object deleted when qtr destructs
-</TT></PRE>
+</tt>
+</pre>
+    </div>
 
-</UL>
+    <p>The <tt><font size="+1">new(countable)</font></tt> expression defines a 
+    different policy for allocation and deallocation and, in common with other 
+    allocators, any attempt to mix your allocation policies, e.g. call
+    <tt><font size="+1">delete</font></tt> on an object allocated with
+    <tt><font size="+1">new(countable)</font></tt>, results in undefined 
+    behaviour. This is similar to what happens when you mix <tt><font size=
+    "+1">new[]</font></tt> with <tt><font size="+1">delete</font></tt> or
+    <tt><font size="+1">malloc</font></tt> with <tt><font size=
+    "+1">delete</font></tt>. The whole point of <i>Countable</i> conformance 
+    is that <i>Countable</i> objects are used with <tt><font size=
+    "+1">countable_ptr</font></tt>, and this ensures the correct use.</p>
 
+    <p>However, accidents will happen, and inevitably you may forget to 
+    allocate using <tt><font size="+1">new(countable)</font></tt> and instead 
+    use <tt><font size="+1">new</font></tt>. This error and others can be 
+    detected in most cases by extending the code shown here to add a check 
+    member to the <tt><font size="+1">count</font></tt>, validating the check 
+    on every access. A benefit of ensuring clear separation between header and 
+    implementation source files means that you can introduce a checking 
+    version of this allocator without having to recompile your code.</p>
+  </div>
+  <hr width="100%">
 
+  <h2>Conclusion</h2>
 
-<P>The <TT><FONT SIZE=+1>new(countable)</FONT></TT> expression defines
+  <div style="margin-left: 2em">
+    <p>There are two key concepts that this article has introduced:</p>
 
-a different policy for allocation and deallocation and, in common with
+    <ul>
+      <li>The use of a generic requirements based approach to simplify and 
+      adapt the use of the C<font size="-1">OUNTED</font> B<font size=
+      "-1">ODY</font> pattern.</li>
 
-other allocators, any attempt to mix your allocation policies, e.g. call
+      <li>The ability, through control of allocation, to dynamically and 
+      non-intrusively add capabilities to fixed types using the R<font size=
+      "-1">UNTIME</font> M<font size="-1">IXIN</font> pattern.</li>
+    </ul>
 
-<TT><FONT SIZE=+1>delete</FONT></TT> on an object allocated with <TT><FONT SIZE=+1>new(countable)</FONT></TT>,
+    <p>The application of the two together gives rise to a new variant of the 
+    essential C<font size="-1">OUNTED</font> B<font size="-1">ODY</font>
+    pattern, U<font size="-1">NINTRUSIVE</font> C<font size=
+    "-1">OUNTED</font> B<font size="-1">ODY</font>. You can take this theme 
+    even further and contrive a simple garbage collection system for C++.</p>
 
-results in undefined behaviour. This is similar to what happens when you
+    <p>The complete code for <tt><font size="+1">countable_ptr</font></tt>,
+    <tt><font size="+1">countability</font></tt>, and the <tt><font size=
+    "+1">countable new</font></tt> is also available.</p>
+  </div>
 
-mix <TT><FONT SIZE=+1>new[]</FONT></TT> with <TT><FONT SIZE=+1>delete</FONT></TT>
+  <div align="right">
+    <hr width="100%">
+    <font size="-1"><i>First published in</i> <a href=
+    "http://www.accu.org/c++sig/public/Overload.html">Overload</a> <i>25, 
+    April 1998, ISSN 1354-3172</i></font>
+  </div>
+  
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
 
-or <TT><FONT SIZE=+1>malloc</FONT></TT> with <TT><FONT SIZE=+1>delete</FONT></TT>.
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
 
-The whole point of <I>Countable </I>conformance is that <I>Countable </I>objects
+  <p><i>Copyright &copy; 1998-1999 Kevlin Henney</i></p>
 
-are used with <TT><FONT SIZE=+1>countable_ptr</FONT></TT>, and this ensures
-
-the correct use.</P>
-
-
-
-<P>However, accidents will happen, and inevitably you may forget to allocate
-
-using <TT><FONT SIZE=+1>new(countable)</FONT></TT> and instead use <TT><FONT SIZE=+1>new</FONT></TT>.
-
-This error and others can be detected in most cases by extending the code
-
-shown here to add a check member to the <TT><FONT SIZE=+1>count</FONT></TT>,
-
-validating the check on every access. A benefit of ensuring clear separation
-
-between header and implementation source files means that you can introduce
-
-a checking version of this allocator without having to recompile your code.</P>
-
-</UL>
-
-
-
-
-<HR WIDTH="100%">
-<H2>Conclusion</H2>
-
-
-
-<UL>
-
-<P>There are two key concepts that this article has introduced:</P>
-
-
-
-<UL>
-
-<LI>The use of a generic requirements based approach to simplify and adapt
-
-the use of the C<FONT SIZE=-1>OUNTED</FONT> B<FONT SIZE=-1>ODY</FONT> pattern.</LI>
-
-
-
-<LI>The ability, through control of allocation, to dynamically and non-intrusively
-
-add capabilities to fixed types using the R<FONT SIZE=-1>UNTIME</FONT>
-
-M<FONT SIZE=-1>IXIN</FONT> pattern.</LI>
-
-</UL>
-
-
-
-<P>The application of the two together gives rise to a new variant of the
-
-essential C<FONT SIZE=-1>OUNTED</FONT> B<FONT SIZE=-1>ODY</FONT> pattern,
-
-U<FONT SIZE=-1>NINTRUSIVE</FONT> C<FONT SIZE=-1>OUNTED</FONT> B<FONT SIZE=-1>ODY</FONT>.
-
-You can take this theme even further and contrive a simple garbage collection
-
-system for C++.</P>
-
-
-
-<P>The complete code for <TT><FONT SIZE=+1>countable_ptr</FONT></TT>, <TT><FONT SIZE=+1>countability</FONT></TT>,
-
-and the <TT><FONT SIZE=+1>countable new</FONT></TT> is also available.</P>
-
-</UL>
-
-
-
-<DIV ALIGN=right><P>
-
-<HR WIDTH="100%"><FONT SIZE=-1><I>First published in </I><a href="http://www.accu.org/c++sig/public/Overload.html">Overload</a> <I>25,
-
-April 1998, ISSN 1354-3172<BR>
-
-&copy; Copyright Kevlin Henney, 1998, 1999</I></FONT></DIV>
-
-
-
-</BODY>
-
-</HTML>
-
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/more/cpp_committee_meetings.html
===================================================================
--- boost/trunk/more/cpp_committee_meetings.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/cpp_committee_meetings.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 
 <head>
@@ -112,10 +113,12 @@
 <p>Revised
 <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%B %d, %Y" startspan -->April 17, 2005<!--webbot bot="Timestamp" endspan i-checksum="17669" --></p>
 <p>© Copyright Beman Dawes, 2002</p>
-<p> Use, modification, and distribution are subject to the Boost Software 
-License, Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a>)</p>
+<p>
+      Distributed under the Boost Software License, Version 1.0. (See
+      accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+      at <a href=
+      "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)
+</p>
 
 </body>
 

Copied: boost/trunk/more/cvs.html (from rev 14034, boost/branches/upstream/current/more/cvs.html)

Modified: boost/trunk/more/discussion_policy.htm
===================================================================
--- boost/trunk/more/discussion_policy.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/discussion_policy.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,17 +2,17 @@
 
 <html>
 <head>
-  <meta name="generator" content=
-  "HTML Tidy for Cygwin (vers 1st September 2004), see www.w3.org">
+  <meta http-equiv="Content-Language" content="en-us">
   <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
-  <meta name="GENERATOR" content="Microsoft FrontPage 5.0">
+
+  <meta name="generator" content="Microsoft FrontPage 6.0">
   <meta name="ProgId" content="FrontPage.Editor.Document">
 
   <title>Boost Discussion Policy</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
-  <table border="1" bgcolor="#007F7F" cellpadding="2">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
     <tr>
       <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
       "boost.png (6897 bytes)" width="277" height="86"></td>
@@ -153,7 +153,6 @@
 
   <blockquote>
     <pre>
-
 <i>Person-you're-replying-to</i> wrote:
 
 &gt; Some part of a paragraph that you wish to reply to goes 
@@ -309,15 +308,16 @@
     far."</li>
   </ul>
 
-  <p>Avoid Parkinson's Bicycle Shed. Parkinson described a committee formed
-  to oversee design of an early nuclear power plant. There were three agenda
-  items - when to have tea, where to put the bicycle shed, and how to ensure
-  nuclear safety. Tea was disposed of quickly as trivial.&nbsp;&nbsp; Nuclear
-  safety was discussed for only an hour - it was so complex, scary, and
-  technical that even among experts few felt comfortable with the issues.
-  Endless days were then spent discussing where to put the bicycle shed (the
-  parking lot would be a modern equivalent) because everyone understood the
-  issues and felt comfortable discussing them.&nbsp;</p>
+  <p>Avoid <i><b>Parkinson's Bicycle Shed</b></i>. Parkinson described a
+  committee formed to oversee design of an early nuclear power plant. There
+  were three agenda items - when to have tea, where to put the bicycle shed,
+  and how to ensure nuclear safety. Tea was disposed of quickly as
+  trivial.&nbsp;Nuclear safety was discussed for only an hour - it was so
+  complex, scary, and technical that even among experts few felt comfortable
+  with the issues. Endless days were then spent discussing construction of
+  the bicycle shed (the parking lot would be the modern equivalent) because
+  everyone though they understood the issues and felt comfortable discussing
+  them.&nbsp;</p>
 
   <h2><a name="lib_names" id="lib_names"></a>Library Names</h2>
 
@@ -353,15 +353,18 @@
   potential Boost libraries.</p>
   <hr>
 
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
   <p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->28
-  May, 2005<!--webbot bot="Timestamp" i-checksum="38549" endspan --></p>
+  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->04 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
 
-  <p>&copy; Beman Dawes, Rob Stewart, and David Abrahams 2000-2005</p>
+  <p><i>Copyright &copy; 2000-2005 Beman Dawes, Rob Stewart, and David Abrahams</i></p>
 
-  <p>Distributed under the Boost Software License, Version 1.0. (See
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
   accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
   at <a href=
-  "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
+  "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/more/faq.htm
===================================================================
--- boost/trunk/more/faq.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/faq.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,7 +24,7 @@
 <h1>Boost Frequently Asked Questions</h1>
 
 <p><strong>How do I download the libraries?</strong>
-&nbsp; See <a href=getting_started.html#Download">Download</a> instructions.</p>
+&nbsp; See <a href="getting_started.html#Download">Download</a> instructions.</p>
 
 <p><b>What support is available for the libraries?</b>&nbsp; The
 <a href="mailing_lists.htm#users">Boost-Users mailing list</a> is a good start.</p>
@@ -168,9 +168,11 @@
 <p>Revised <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->23 June, 2005<!--webbot bot="Timestamp" i-checksum="19916" endspan --></p>
 
 <p>© Copyright Beman Dawes 2001</p>
-<p> Use, modification, and distribution are subject to the Boost Software 
-License, Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a>) </p>
+<p>
+      Distributed under the Boost Software License, Version 1.0. (See
+      accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+      at <a href=
+      "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)
+</p>
 </body>
 </html>
\ No newline at end of file

Modified: boost/trunk/more/feature_model_diagrams.htm
===================================================================
--- boost/trunk/more/feature_model_diagrams.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/feature_model_diagrams.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 
 <head>
@@ -9,11 +10,11 @@
 
 <body bgcolor="#FFFFFF" text="#000000">
 
-<p><img border="0" src="../boost.png" width="277" height="86"></p>
+<p><img border="0" src="../boost.png" alt="Boost logo" width="277" height="86"></p>
 <h1>Feature Model Diagrams in text and HTML</h1>
 <p>By <a href="../people/beman_dawes.html">Beman Dawes</a></p>
 <h2>Introduction</h2>
-<p>In their seminal book, Generative Programming, Czarnecki and Eisenecker (<a href="#Generative Programming">C&amp;E</a>)
+<p>In their seminal book, Generative Programming, Czarnecki and Eisenecker (<a href="#Generative%20Programming">C&amp;E</a>))
 describe how to build feature models [C&amp;E 4.4] consisting of a feature
 diagram plus semantic, rationale, and other attributes.&nbsp; Feature models are
 then used to drive design cycles which eventually lead to manual or automatic
@@ -51,10 +52,10 @@
 of a leading letter, followed by letters, digits, underscores or hyphens, with
 no spaces allowed.</p>
 <p>At least one instance of each name should be hyperlinked to the corresponding
-<a href="#Feature Descriptions">Feature Description</a>.</p>
+<a href="#FeatureDescriptions">Feature Description</a>.</p>
 <p>While the grammar is intended for written communication between people, it
 may also be trivially machine parsed for use by automatic tools.</p>
-<h2><a name="Feature Descriptions">Feature Description</a></h2>
+<h2><a id="FeatureDescriptions" name="FeatureDescriptions"></a></h2>
 <p>Descriptive information is associated with each concept or feature. According
 to [C&amp;E 4.4.2] this includes:</p>
 <ul>
@@ -93,16 +94,18 @@
                     interface( STL-style+cursor-style ) )</pre>
 </blockquote>
 <h2>References</h2>
-<p>Krzysztof Czarnecki and Ulrich W. Eisenecker, <a name="Generative Programming" href="http://www.generative-programming.org">Generative
+<p>Krzysztof Czarnecki and Ulrich W. Eisenecker, <a href="http://www.generative-programming.org">Generative
 Programming</a>, Addison-Wesley, 2000, ISBN 0-201-30977-7</p>
 <hr>
 <p>Revised <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B %Y" startspan -->26 August 2004<!--webbot bot="Timestamp" endspan i-checksum="32277" --></p>
 <p>© Copyright Beman Dawes, 2000</p>
 
-<p> Use, modification, and distribution are subject to the Boost Software 
-License, Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a>)</p>
+<p>
+      Distributed under the Boost Software License, Version 1.0. (See
+      accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+      at <a href=
+      "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)
+</p>
 
 </body>
 

Modified: boost/trunk/more/formal_review_process.htm
===================================================================
--- boost/trunk/more/formal_review_process.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/formal_review_process.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -279,9 +279,11 @@
     <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->15 October, 2003<!--webbot bot="Timestamp" endspan i-checksum="38556" --></p>
 
     <p>© Copyright Beman Dawes 2000</p>
-<p> Use, modification, and distribution are subject to the Boost Software 
-License, Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a>)</p>
+    <p>
+	  Distributed under the Boost Software License, Version 1.0. (See
+      accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+      at <a href=
+      "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)
+    </p>
   </body>
 </html>

Modified: boost/trunk/more/formal_review_schedule.html
===================================================================
--- boost/trunk/more/formal_review_schedule.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/formal_review_schedule.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 
 <head>
@@ -54,12 +55,13 @@
   </tr>
 
   <tr>
-    <td>Physical Quantities System</td>
-    <td>Andy Little</td>
-    <td><a href="http://boost-sandbox.sourceforge.net/vault/">
-	Boost Sandbox Vault</a> - Physical Quantities Units </td>
-    <td>Fred Bertsch</td>
-    <td>May 31 - June 9</td>
+    <td>Message Passing</td>
+    <td>Doug Gregor</td>
+    <td>
+      <a href="http://www.osl.iu.edu/~dgregor/boost.mpi/boost-mpi-20060628.tgz">
+	http://www.osl.iu.edu/~dgregor/boost.mpi/boost-mpi-20060628.tgz</a></td>
+    <td>Needed</td>
+    <td>-</td>
   </tr>
 
 </table>
@@ -76,6 +78,15 @@
   </tr>
 
   <tr>
+    <td>Physical Quantities System</td>
+    <td>Andy Little</td>
+    <td>Fred Bertsch</td>
+    <td>2006 May 31 - 2006 June 9</td>
+    <td><a href="http://lists.boost.org/boost-announce/2006/06/0096.php">
+	Rejected</a></td>
+  </tr>
+
+  <tr>
     <td>Pimpl Pointer</td>
     <td>Asger Mangaard</td>
     <td>Rene Rivera</td>
@@ -89,8 +100,8 @@
     <td>Joel de Guzman</td>
     <td>Ronald Garcia</td>
     <td>2006 May 1 - 2006 May 10</td>
-    <td><a href="http://lists.boost.org/boost-announce/2006/05/0088.php">
-	Pending</a></td>
+    <td><a href="http://lists.boost.org/boost-announce/2006/06/0094.php">
+	Accepted</a></td>
   </tr>
 
   <tr>
@@ -204,7 +215,7 @@
     <td>John Maddock</td>
     <td>Beman Dawes</td>
     <td>2005 September 24 - 2005 October 5</td>
-    <td>Accepted -- not yet added</td>
+    <td>Accepted -- added to cvs</td>
   </tr>
 
   <tr>
@@ -628,11 +639,12 @@
 <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %b %Y" startspan -->15 Apr 2005<!--webbot bot="Timestamp" endspan i-checksum="15045" -->
 </p>
 <p>Copyright Beman Dawes, Tom Brinkman, Jeff Garland 2001 - 2005</p>
-<p>Use, modification, and distribution are subject to the Boost Software 
-License, Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a>)</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See
+accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+at <a href
+="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</p>
 
 </body>
 
 </html>
+

Copied: boost/trunk/more/getting_started (from rev 14034, boost/branches/upstream/current/more/getting_started)

Modified: boost/trunk/more/getting_started.html
===================================================================
--- boost/trunk/more/getting_started.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/getting_started.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,1554 +1,12 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
 <html>
 <head>
-  <title>Getting Started</title>
-  <meta content="HTML Tidy for Cygwin (vers 1st April 2002), see www.w3.org"
-  name="generator">
-  <meta content="Microsoft FrontPage 5.0" name="generator">
-  <meta http-equiv="Content-Language" content="en-us">
-  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
-  <link href="../boost.css" type="text/css" rel="stylesheet">
+<meta http-equiv="refresh" content="0; URL=getting_started/index.html">
 </head>
-
-<body text="#000000" bgcolor="#FFFFFF">
-  <table cellspacing="0" cellpadding="0" width="100%" summary="" border="0">
-    <tr valign="top">
-      <td valign="top" align="left"><img height="86" alt=
-      "boost.png (6897 bytes)" src="../boost.png" width="277"></td>
-
-      <td valign="top" align="right">
-        <table cellspacing="0" cellpadding="2" summary="" border="1">
-          <tr>
-            <td>
-              <table cellspacing="0" cellpadding="2" summary="" border="0">
-                <tr>
-                  <td bgcolor="#DDDDDD">
-                    <p>.&nbsp;<a href="../index.htm">Home</a><br>
-                    .&nbsp;<a href="../libs/libraries.htm">Libraries</a><br>
-                    .&nbsp;<a href="../people/people.htm">People</a><br>
-                    .&nbsp;<a href="faq.htm">FAQ</a><br>
-                    .&nbsp;<a href="index.htm">More</a></p>
-                  </td>
-                </tr>
-              </table>
-            </td>
-          </tr>
-        </table>
-      </td>
-    </tr>
-  </table>
-
-  <h1>Getting Started</h1>
-
-  <ul>
-    <li><a href="#Introduction">Introduction</a></li>
-
-    <li>
-      <a href="#Download">Download</a>
-
-      <ul>
-        <li><a href="#.zip">.zip file</a></li>
-
-        <li><a href="#.tar.gz">.tar.gz and .tar.bz2 files</a></li>
-
-        <li><a href="#CVS">Boost CVS Repository</a></li>
-      </ul>
-    </li>
-
-    <li>
-      <a href="#Preparation">Preparation</a>
-      <ul>
-        <li><a href="#Configuring">Configuring the tools</a></li>
-
-        <li><a href="#Tools">Supported Toolsets</a></li>
-      </ul>
-    </li>
-
-    <li><a href="#Build_Install">Build and Install</a></li>
-
-    <li><a href="#Results">Results</a></li>
-
-    <li><a href="#auto-link">Automatic Linking on Windows</a></li>
-
-    <li><a href="#Additional_Steps">Additional Steps</a></li>
-  </ul>
-
-  <h2><a id="Introduction" name="Introduction">Introduction</a></h2>
-
-  <p>These instructions are intended to help you get started using the Boost
-  Libraries. This walks you through getting, building, and installing the
-  libraries. To summarize these are the steps to get Boost built and
-  installed:</p>
-
-  <ol>
-    <li><a href="#step1">Download Boost</a>.</li>
-
-    <li><a href="#step2">Install Boost.Jam</a>.</li>
-
-    <li><a href="#step3">Configure your compiler toolset</a>.</li>
-
-    <li><a href="#step4">Go to Boost distribution directory</a>.</li>
-
-    <li><a href="#step5">Build and install</a>.</li>
-  </ol>
-
-  <h2><a id="Download" name="Download"></a>Download</h2>
-
-  <table cellspacing="2" cellpadding="2" width="100%" summary="" border="0">
-    <tr valign="top" align="left">
-      <td valign="top" align="center" width="40" bgcolor="#FFFF66">
-      <font size="6"><b><a id="step1" name="step1"></a>1</b></font></td>
-
-      <td>The Boost Libraries are distributed through the SourceForge file
-      distribution system. Click here to <b><a href=
-      "http://sourceforge.net/project/showfiles.php?group_id=7586&amp;package_id=8041">
-      <font size="4">download releases from SourceForge</font></a></b>. And
-      unpack the release to a convenient location.</td>
-    </tr>
-  </table>
-
-  <p>The Boost release includes all of the libraries and other material from
-  the web site. It is available in <a href="#.zip">ZIP</a>, <a href=
-  "#.tar.gz">TAR.GZ</a>, and <a href="#.tar.gz">TAR.BZ2</a> formats. Past
-  releases are also available.</p>It is also possible to download current
-  snapshots of work-in-progress from Boost's <a href="#CVS">CVS
-  repository</a>.
-
-  <h3><a id="zip" name=".zip">.zip</a> file</h3>The .zip format is widely
-  supported by both free decoders and commercial compress/archive utilities.
-  If you don't already have a .zip file decoder, download one from the
-  <a href="http://www.info-zip.org/">Info-ZIP</a> web site, which supplies
-  versions for many operating systems.
-
-  <p>Text file line endings in the .zip file are as supplied by each library
-  developer.&nbsp; This works fine for Windows, but not for Unix/Linux.&nbsp;
-  The .tar.gz and .tar.bz2 files supply Unix/Linux friendly line endings.</p>
-
-  <h3><a id="tar_gz" name=".tar.gz">.tar.gz</a> and .tar.bz2 files</h3>
-
-  <p>The .tar.gz format is widely supported on Unix/Linux platforms. Some
-  Windows compress/archive utilities can read the format as well.&nbsp;
-  Because the gzip format compresses the archive as a single file rather than
-  compressing each file individually, the .tar.gz file is smaller that the
-  .zip file.</p>
-
-  <p>The .tar.bz2 format is becoming widely available on Unix/Linux platforms
-  and is built into many tar utilities. This format differs for the .tar.gz
-  format in the compression used, which is considerably better and therefore
-  creates smaller files.</p>
-
-  <p>Text file line endings in the .tar.gz and .tar.bz2 files have been
-  converted to newlines for ease of use on Unix/Linux platforms.</p>
-
-  <h3>Boost <a id="CVS" name="CVS">CVS</a> Repository</h3>
-
-  <p>All Boost files, including the entire distribution tree including web
-  site HTML is maintained in a CVS repository. Command line, GUI, or browser
-  access is available.</p>
-
-  <h4>Boost CVS access via command line or graphical clients</h4>For those
-  who have CVS clients installed, the libraries are also available from the
-  public <a href="http://sourceforge.net/cvs/?group_id=7586">Boost CVS
-  repository</a>. Free command line clients (often already installed on
-  Linux/Unix systems) are available for many systems, and free GUI clients
-  are available for Windows, Mac, and other systems.
-
-  <p>See the much improved <a href=
-  "http://sourceforge.net/docman/?group_id=1">CVS documentation</a> (Section
-  F) from SourceForge, which includes links to the home pages for various GUI
-  and command line clients.</p>
-
-  <p>The general procedure for command-line clients is something like
-  this:</p>
-
-  <blockquote>
-    <code>cvs -d:pserver:anonymous at boost.cvs.sourceforge.net:/cvsroot/boost
-    login</code><br>
-    [Hit &lt;return&gt; when it asks for a password]<br>
-    <code>cvs -z3 -d:pserver:anonymous at boost.cvs.sourceforge.net:/cvsroot/boost
-    checkout boost</code><br>
-    <code>cvs -d:pserver:anonymous at boost.cvs.sourceforge.net:/cvsroot/boost
-    logout</code>
-  </blockquote>Read the manual for your CVS client for further information.
-
-  <p>This access is read-only; if you are a library author and wish to have
-  CVS write access, please contact one of the <a href=
-  "moderators.html">moderators</a>.</p>
-
-  <h4>Boost CVS access via web <a id="Browser" name=
-  "Browser">Browser</a></h4>For access to the CVS archive from any modern web
-  browser, you can also use the <a href=
-  "http://boost.cvs.sourceforge.net/boost/boost/">web
-  browser&nbsp; interface</a>.&nbsp; Try one of the color diffs to see how a
-  file has changed over time. <b>Note:</b> this interface is only suitable
-  for viewing individual files and their revision histories.
-
-  <h4><a id="generated" name="generated">Documentation</a> generated from
-  BoostBook in CVS</h4>
-
-  <p>Some of the Boost documentation is generated from <a href=
-  "../doc/html/boostbook.html">BoostBook XML</a> source stored in the CVS
-  repository, and will not appear directly in the CVS tree as readable HTML.
-  View a nightly build of the generated HTML on the <a href=
-  "http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/libraries.html">
-  Nightly Generated Documentation</a> page. Where generated HTML is missing
-  from the CVS tree, an attempt has been made to include redirection to this
-  nightly build, but if you are away from an internet connection you may want
-  to download the generated documentation archive from the aforementioned
-  page so you can browse those documents offline.</p>
-
-  <h2><a id="Preparation" name="Preparation"></a>Preparation</h2>
-
-  <p>The recommended way to build and install the Boost Libraries is to use
-  <a href="../tools/build/v1/build_system.htm">Boost.Build</a>, the Boost
-  Build system. The rest of these instructions explain that use, but it is up
-  to you to use this method, or not. Note that some of the libraries also
-  include non Boost.Build makefiles and/or project files. But all include the
-  needed files for building with Boost.Build.</p>
-
-  <table cellspacing="2" cellpadding="2" width="100%" summary="" border="0">
-    <tr valign="top" align="left">
-      <td valign="top" align="center" width="40" bgcolor="#FFFF66">
-      <font size="6"><b><a id="step2" name="step2"></a>2</b></font></td>
-
-      <td>The build system uses <a href=
-      "../tools/jam/index.html">Boost.Jam</a>, an extension of the
-      <a href="http://www.perforce.com/jam/jam.html">Perforce Jam</a>
-      portable <i>make</i> replacement. The recommended way to get Boost.Jam
-      if you are using a Boost distribution is to <strong><a href=
-      "http://sourceforge.net/project/showfiles.php?group_id=7586&amp;package_id=72941">
-      download a prebuilt executable</a></strong> from SourceForge. If a
-      prebuilt executable is not provided for your platform or you are using
-      Boost's sources in an unreleased state, it may be necessary to <a href=
-      "../doc/html/jam/building.html">build <tt>bjam</tt>
-      from sources</a> included in the Boost source tree. To install
-      Boost.Jam, copy the <tt>bjam</tt> executable to a location accessible
-      in your <tt>PATH</tt>.</td>
-    </tr>
-  </table>
-
-  <h3><a id="Configuring" name="Configuring">Configuring the tools</a></h3>
-
-  <p>Before using Boost.Build you will need to configure the compiler tools
-  you are using. The build system's toolsets are designed to work in either
-  of two ways:</p>
-
-  <ol>
-    <li>The user sets up all of the environment for each toolset he wants to
-    use in the normal way. For example, for Microsoft VC++, ...VC98/Bin or
-    .../VC7/Bin is in the PATH environment variable, VCVARS32.BAT or
-    VSVARS32.BAT has been invoked, etc. For Metrowerks CodeWarrior, cwenv.bat
-    or equivalent has been called and ...Other Metrowerks Tools/Command Line
-    Tools is in the path. Many Unix operating systems come preconfigured this
-    way and require no user intervention.<br>
-    <br></li>
-
-    <li>The user doesn't want his environment cluttered with settings or has
-    nonstandard installations for some of his tools. Instead, he or she sets
-    variables which point to the toolset installation directories, either in
-    the command shell environment or on the <code>bjam</code> command-line.
-    These variables are used by the build system to locate the tools and
-    invoke the necessary setup. To set the variables on the <tt>bjam</tt>
-    command-line you use the "<tt>-s</tt>" option. For example:<br>
-    <br>
-    <tt>bjam "-sGCC_ROOT_DIRECTORY=/usr/local/gcc-3.3.2"</tt><br>
-    <br>
-    Some variables, like the toolset <tt>TOOLS</tt> variable, can accept
-    multiple values separated by spaces. Others, like the path above, can
-    contain spaces. For such circumstances you should use quotes appropriate
-    for your command interpreter.<br></li>
-  </ol>
-
-  <h3><a id="Tools" name="Tools">Supported Toolsets</a></h3>
-
-  <table cellspacing="2" cellpadding="2" width="100%" summary="" border="0">
-    <tr valign="top" align="left">
-      <td valign="top" align="center" width="40" bgcolor="#FFFF66">
-      <font size="6"><b><a id="step3" name="step3"></a>3</b></font></td>
-
-      <td>The following toolsets are supported by Boost.Build. For
-      information about <a href="#Configuring">configuring</a> each toolset,
-      click its name in the leftmost column.</td>
-    </tr>
-  </table><br>
-
-  <table cellpadding="5" summary="" border="1">
-    <tr>
-      <td><b>TOOLS Name</b></td>
-
-      <td><b>Description</b></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/borland-tools.html"><code>borland</code></a></td>
-
-      <td><a href=
-      "http://www.borland.com/bcppbuilder/freecompiler">Borland</a> C++</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/como-tools.html"><code>como</code></a></td>
-
-      <td><a href="http://www.comeaucomputing.com">Comeau C++</a> compiler
-      front-end for non-Windows platforms</td>
-    </tr>
-
-    <tr>
-      <td><code><a href=
-      "../tools/build/v1/como-tools.html">como-win32</a></code></td>
-
-      <td><a href="http://www.comeaucomputing.com">Comeau C++</a> compiler
-      front-end for Windows, using Microsoft <a href=
-      "http://msdn.microsoft.com/visualc/">Visual C++</a>as a back-end.</td>
-    </tr>
-
-    <tr>
-      <td><a href="../tools/build/v1/cw-tools.html"><code>cw</code></a></td>
-
-      <td><a href="http://www.metrowerks.com">Metrowerks CodeWarrior</a> Pro
-      6.x, 7.x, 8.x, and 9.x command-line tools</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/darwin-tools.html"><code>darwin</code></a></td>
-
-      <td>Apple Darwin OS hosted GNU <a href=
-      "http://developer.apple.com/tools/compilers.html">GCC</a></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/dmc-tools.html"><code>dmc</code></a></td>
-
-      <td><a href="http://www.digitalmars.com/">Digital Mars C++</a>.</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/dmc-stlport-tools.html"><code>dmc-stlport</code></a></td>
-
-      <td><a href="http://www.digitalmars.com/">Digital Mars C++</a>, using
-      the <a href="http://www.stlport.org">STLport</a> standard library
-      implementation</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/edg-tools.html"><code>edg</code></a></td>
-
-      <td><a href="http://www.edg.com/">Edison Design Group</a> compiler
-      front-end (evaluation version)</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/gcc-tools.html"><code>gcc</code></a></td>
-
-      <td><a href="http://gcc.gnu.org">GNU GCC</a> on Unix and <a href=
-      "http://www.cygwin.com">Cygwin</a>.</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/gcc-stlport-tools.html"><code>gcc-stlport</code></a></td>
-
-      <td><a href="http://gcc.gnu.org">GNU GCC</a> on Unix and <a href=
-      "http://www.cygwin.com">Cygwin</a>, using the <a href=
-      "http://www.stlport.org">STLport</a> standard library
-      implementation</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/gcc-nocygwin-tools.html"><code>gcc-nocygwin</code></a></td>
-
-      <td>GNU GCC Cygwin command line compiler tools running in "no-cygwin"
-      mode (produces commercially redistributable objects)</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/intel-linux-tools.html"><code>intel-linux</code></a></td>
-
-      <td><a href=
-      "http://www.intel.com/software/products/compilers/c60l/">Intel C++ for
-      Linux</a></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/intel-win32-tools.html"><code>intel-win32</code></a></td>
-
-      <td><a href=
-      "http://www.intel.com/software/products/compilers/c60/">Intel C++ for
-      Windows</a> using the Dinkumware standard library in the Intel-required
-      Microsoft <a href="http://msdn.microsoft.com/visualc/">Visual C++</a> 6
-      or 7 installation</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/kcc-tools.html"><code>kcc</code></a></td>
-
-      <td>KAI C++</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/kylix-tools.html"><code>kylix</code></a></td>
-
-      <td><a href="http://www.borland.com/kylix">Borland C++ for Linux
-      (Kylix).</a></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/mingw-tools.html"><code>mingw</code></a></td>
-
-      <td>GNU GCC and associated tools in <a href=
-      "http://www.mingw.org">MinGW</a> configuration (produces commercially
-      redistributable objects)</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/mingw-stlport-tools.html"><code>mingw-stlport</code></a></td>
-
-      <td>GNU GCC and associated tools in <a href=
-      "http://www.mingw.org">MinGW</a> configuration (produces commercially
-      redistributable objects), using the <a href=
-      "http://www.stlport.org">STLport</a> standard library
-      implementation</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/mipspro-tools.html"><code>mipspro</code></a></td>
-
-      <td>SGI <a href=
-      "http://www.sgi.com/developers/devtools/languages/mipspro.html">MIPSpro
-      C and C++</a></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/msvc-tools.html"><code>msvc</code></a></td>
-
-      <td>Microsoft <a href="http://msdn.microsoft.com/visualc/">Visual
-      C++</a> version 6 command-line tools. NOTE; For version 7.x (the .NET
-      series) use the vc7, vc-7_1, or vc-8_0 toolsets below.</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/msvc-stlport-tools.html"><code>msvc-stlport</code></a></td>
-
-      <td>Microsoft <a href="http://msdn.microsoft.com/visualc/">Visual
-      C++</a> version 6 command-line tools, using the <a href=
-      "http://www.stlport.org">STLport</a> standard library implementation.
-      NOTE; For version 7.x (the .NET series) use the vc7-stlport or
-      vc-7_1-stlport toolsets below.</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/sunpro-tools.html"><code>sunpro</code></a></td>
-
-      <td><a href=
-      "http://wwws.sun.com/software/sundev/suncc/index.html">SunPRO C++</a>
-      compiler</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/tru64cxx-tools.html"><code>tru64cxx</code></a></td>
-
-      <td><a href="http://www.tru64unix.compaq.com/cplus/">Compaq C++</a> for
-      Tru64 UNIX (versions prior to 6.5)</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/tru64cxx-tools.html"><code>tru64cxx65</code></a></td>
-
-      <td><a href="http://www.tru64unix.compaq.com/cplus/">Compaq C++</a>
-      Version 6.5 for Tru64 UNIX</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/vacpp-tools.html"><code>vacpp</code></a></td>
-
-      <td><a href="http://www-3.ibm.com/software/ad/vacpp/">IBM Visual Age
-      C++</a> command-line tools</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/vc7-tools.html"><code>vc7</code></a></td>
-
-      <td>Microsoft <a href="http://msdn.microsoft.com/visualc/">Visual
-      C++</a> command-line tools from Visual Studio .NET.</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/vc7-stlport-tools.html"><code>vc7-stlport</code></a></td>
-
-      <td>Microsoft <a href="http://msdn.microsoft.com/visualc/">Visual
-      C++</a> command-line tools from Visual Studio .NET + STLPort.</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/vc-7_1-tools.html"><code>vc-7_1</code></a></td>
-
-      <td>Microsoft <a href="http://msdn.microsoft.com/visualc/">Visual
-      C++</a> command-line tools from Visual Studio .NET 2003.</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/vc-7_1-stlport-tools.html"><code>vc-7_1-stlport</code></a></td>
-
-      <td>Microsoft <a href="http://msdn.microsoft.com/visualc/">Visual
-      C++</a> command-line tools from Visual Studio .NET 2003 + STLPort.</td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/vc-8_0-tools.html"><code>vc-8_0</code></a></td>
-
-      <td>Microsoft <a href="http://msdn.microsoft.com/visualc/">Visual
-      C++</a> command-line tools from Visual Studio .NET 2005.</td>
-    </tr>
-  </table>
-
-  <h2><a id="Build_Install" name="Build_Install"></a>Build and Install</h2>
-
-  <p>The common build and install process is driven by the top-level build
-  file (<a href="../Jamfile">Jamfile</a>).</p>
-
-  <table cellspacing="2" cellpadding="2" width="100%" summary="" border="0">
-    <tr valign="top" align="left">
-      <td valign="top" align="center" width="40" bgcolor="#FFFF66">
-      <font size="6"><b><a id="step4" name="step4"></a>4</b></font></td>
-
-      <td>
-        <p>First you need to change to the directory where you have the Boost
-        distribution you downloaded. For example:</p>
-
-        <blockquote>
-          <p><code>chdir&nbsp;boost-1.31.0</code></p>
-        </blockquote>
-      </td>
-    </tr>
-  </table>
-
-  <p>The default build and install attempts to build all available libraries
-  and install to default locations the libraries and Boost header files. On
-  Unix systems the default install location is "<tt>/usr/local</tt>", and on
-  Windows systems the default is "<tt>C:\Boost</tt>". Within those
-  directories libraries are installed to the "<tt>lib</tt>" subdirectory, and
-  headers to an "<tt>include/boost-1_31</tt>" subdirectory, the version will
-  reflect the distribution you are installing.</p>
-
-  <table cellspacing="2" cellpadding="2" width="100%" summary="" border="0">
-    <tr valign="top" align="left">
-      <td valign="top" align="center" width="40" bgcolor="#FFFF66">
-      <font size="6"><b><a id="step5" name="step5"></a>5</b></font></td>
-
-      <td>
-        Invoke the build system, specifying the <a href=
-        "#Tools">toolset</a>(s) you wish to use, to build and install. For
-        example for GNU/GCC.
-
-        <blockquote>
-          <p><code>bjam&nbsp;"-sTOOLS=gcc" install</code></p>
-        </blockquote>
-
-        <p>Or if you are interested only in the built libraries you can have
-        them built and collected to a common directory without
-        installation.</p>
-
-        <blockquote>
-          <p><code>bjam&nbsp;"-sTOOLS=gcc" stage</code></p>
-        </blockquote>
-      </td>
-    </tr>
-  </table>
-
-  <p>The build and install system can be controlled through a set of options
-  similar in style to GNU configure options. The options allow you to, among
-  other things, change the install location, disable building of libraries,
-  etc. You can see a summary of the available options by invoking "<tt>bjam
-  --help</tt>". The full invocation takes the form:</p>
-
-  <blockquote>
-    <p><code>bjam&nbsp;[<i>options</i>...] [install|stage]</code></p>
-  </blockquote>
-
-  <table cellspacing="0" cellpadding="2" summary="" border="1">
-    <tr>
-      <th>Action</th>
-
-      <td>&nbsp;</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left"><i>none</i></td>
-
-      <td valign="top" align="left">Only builds the Boost libraries. This
-      lets you do the first part of what the <tt>install</tt> action normally
-      does without copying the built libraries to the install location.</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left"><tt>install</tt></td>
-
-      <td valign="top" align="left">Builds and installs Boost libraries and
-      headers.</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left"><tt>stage</tt></td>
-
-      <td valign="top" align="left">Builds the Boost libraries and copies
-      them into a common directory.</td>
-    </tr>
-
-    <tr>
-      <th nowrap>Option</th>
-
-      <td valign="top" align="left">&nbsp;</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left"><tt>--help</tt></td>
-
-      <td valign="top" align="left">Shows a short summary of the options and
-      syntax of the command.</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left">
-      <tt>-sTOOLS=&lt;<i>toolsets</i>&gt;</tt></td>
-
-      <td valign="top" align="left">The list of tools to compile with.
-      Usually only one is needed.</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left"><tt>--prefix=PREFIX</tt></td>
-
-      <td valign="top" align="left">Install architecture independent files
-      here.<br>
-      Default; <tt>C:\Boost</tt> on Win32.<br>
-      Default; <tt>/usr/local</tt> on Unix. Linux, etc.</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left">
-      <tt>--exec-prefix=EPREFIX</tt></td>
-
-      <td valign="top" align="left">Install architecture dependent files
-      here.<br>
-      Default; <tt>PREFIX</tt></td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left"><tt>--libdir=DIR</tt></td>
-
-      <td valign="top" align="left">Install libraries here.<br>
-      Default; <tt>EPREFIX/lib</tt></td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left"><tt>--includedir=DIR</tt></td>
-
-      <td valign="top" align="left">Install source headers here. The Boost
-      headers are installed in a version specific
-      "<tt>boost-&lt;version&gt;</tt>" subdirectory in this directory.<br>
-      Default; <tt>PREFIX/include</tt></td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left"><tt>--builddir=DIR</tt></td>
-
-      <td valign="top" align="left">Build in this location instead of
-      building within the distribution tree. This moves where the sources for
-      the libraries are compiled to before they are installed.
-      Recommended!</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left"><tt>--stagedir=DIR</tt></td>
-
-      <td valign="top" align="left">When staging only, with the
-      "<tt>stage</tt>" action, copy to the given location.<br>
-      Default; <tt>./stage</tt></td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left">
-      <tt>--without-&lt;<i>library</i>&gt;</tt></td>
-
-      <td valign="top" align="left">Do not build, stage, or install the
-      specified library.</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left">
-      <tt>--with-&lt;<i>library</i>&gt;</tt></td>
-
-      <td valign="top" align="left">Build, stage, or install the specified
-      library. This changes the default from trying to build all possible
-      libraries, to only building the specified libraries.</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left">
-      <tt>--with-python-root[=PYTHON_ROOT]</tt></td>
-
-      <td valign="top" align="left">Build Boost.Python libraries with the
-      Python devel packages located at <tt>PYTHON_ROOT</tt>. The Boost.Python
-      libraries are built only if the build can find the Python development
-      package at this location.<br>
-      Default; <tt>C:\Python24</tt> on Win32.<br>
-      Default; <tt>/usr</tt> on Unix, Linux, Cygwin, etc.</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left">
-      <tt>--with-python-version[=2.4]</tt></td>
-
-      <td valign="top" align="left">Build Boost.Python libraries with the
-      Python version indicated.<br>
-      Default; 2.4.</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left"><tt>--with-pydebug</tt></td>
-
-      <td valign="top" align="left">Build Boost.Python libraries using the
-      Python debug runtime. This builds an additional set of libraries for
-      use with the debug version of Python. The regular versions of the
-      Boost.Python libraries are also built.</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left"><tt>-sHAVE_ICU=1</tt></td>
-
-      <td valign="top" align="left">Build Boost.Regex libraries with Unicode
-      support provided by the <a href=
-      "http://www-306.ibm.com/software/globalization/icu/index.jsp">ICU
-      libraries</a>. ICU must have been built with the same compiler that you
-      are using to build Boost, and must be installed into your compiler's
-      include and library search paths. See <a href=
-      "../libs/regex/doc/install.html#unicode">the Boost.Regex installation
-      documentation for more information</a>.</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left">
-      <tt>-sICU_PATH=<i>path</i></tt></td>
-
-      <td valign="top" align="left">Build Boost.Regex libraries with Unicode
-      support provided by the <a href=
-      "http://www-306.ibm.com/software/globalization/icu/index.jsp">ICU
-      libraries</a>. ICU must have been built with the same compiler that you
-      are using to build Boost, and must have been built (or installed to)
-      directory <i>path</i>. For example if you configured ICU with
-      <tt>--prefix=/usr/local/icu/3.3</tt>, then use
-      <tt>-sICU_PATH=/usr/local/icu/3.3</tt>. See <a href=
-      "../libs/regex/doc/install.html#unicode">the Boost.Regex installation
-      documentation for more information</a>.</td>
-    </tr>
-
-    <tr>
-      <td valign="top" nowrap align="left"><tt>-sNO_COMPRESSION=1</tt></td>
-
-      <td valign="top" align="left">Build Boost.Iostreams without support for
-      the compression filters which rely on the non-Boost libraries zlib and
-      libbz2. If you use Windows, this option is enabled by default. If you
-      use UNIX, the compression filters will likely work with no
-      configuration, so this option should not be necessary. For full details
-      see <a href=
-      "http://www.boost.org/libs/iostreams/doc/index.html?path=7">Boost.Iostreams
-      Installation</a>.</td>
-    </tr>
-  </table>
-
-  <p>There are additional options as supported by <a href=
-  "../tools/build/v1/build_system.htm">Boost.Build</a> and <a href=
-  "../tools/jam/index.html">Boost.Jam</a>. Of the additional
-  options perhaps the most imporant is "<tt>-s<a href=
-  "../tools/build/v1/build_system.htm#build">BUILD</a>=&lt;features/variants&gt;</tt>"
-  which lets you override what is built by default. The
-  "<tt>&lt;features/variants&gt;</tt>" value is a list, separated by spaces,
-  of build requests. Features take the form of a tag and a value or values.
-  And variants are single symbolic names for a collection of features. For
-  example the default is to request "<tt>debug release
-  &lt;runtime-link&gt;static/dynamic &lt;threading&gt;single/multi</tt>", in
-  which "<tt>debug</tt>" and "<tt>release</tt>" are variants, and the rest
-  features with two values each.</p>
-
-  <p>If you have some feedback about the build and install process please
-  drop us a line at the <a href="mailing_lists.htm#jamboost">Boost.Build
-  mailing list</a>. We are particularly interested if it works for your
-  platform and if it there is anything that you feel could be done
-  better.</p>
-
-  <h2><a id="Results" name="Results"></a>Results</h2>
-
-  <p>The results of building come in to forms: static libraries, and dynamic
-  libraries. Depending on the platform the libraries produced have different
-  names to accommodate the platform requirements. For a single Boost library
-  the build with the default will produce eight different libraries. For
-  example building the Boost.Datetime library on Unix type system it would
-  produce:</p>
-
-  <ol>
-    <li><tt>libboost_date_time-gcc-d-1_31.so</tt></li>
-
-    <li><tt>libboost_date_time-gcc-mt-d-1_31.so</tt></li>
-
-    <li><tt>libboost_date_time-gcc-1_31.so</tt></li>
-
-    <li><tt>libboost_date_time-gcc-mt-1_31.so</tt></li>
-
-    <li><tt>libboost_date_time-gcc-d-1_31.a</tt></li>
-
-    <li><tt>libboost_date_time-gcc-mt-d-1_31.a</tt></li>
-
-    <li><tt>libboost_date_time-gcc-1_31.a</tt></li>
-
-    <li><tt>libboost_date_time-gcc-mt-1_31.a</tt><br></li>
-  </ol>
-
-  <table cellspacing="0" cellpadding="0" width="100%" summary="" border="0">
-    <tr>
-      <td colspan="11">
-        <table cellspacing="2" cellpadding="2" bgcolor="#CCCCCC" summary=""
-        border="0">
-          <tr>
-            <th>&middot; Library Prefix</th>
-          </tr>
-        </table>
-      </td>
-
-      <td width="80%">&nbsp;</td>
-    </tr>
-
-    <tr>
-      <td valign="bottom" bgcolor="#CCCCCC" rowspan="7"><tt><font size=
-      "+1">lib</font></tt></td>
-
-      <td colspan="11">
-        <table cellspacing="2" cellpadding="2" summary="" border="0">
-          <tr>
-            <th>&middot; Library Name</th>
-          </tr>
-        </table>
-      </td>
-    </tr>
-
-    <tr>
-      <td valign="bottom" rowspan="6"><tt><font size=
-      "+1">boost_date_time</font></tt></td>
-
-      <td colspan="10">
-        <table cellspacing="2" cellpadding="2" bgcolor="#CCCCCC" summary=""
-        border="0">
-          <tr>
-            <th>&middot; Toolset</th>
-          </tr>
-        </table>
-      </td>
-    </tr>
-
-    <tr>
-      <td valign="bottom" bgcolor="#CCCCCC" rowspan="5"><tt><font size=
-      "+1">-</font></tt></td>
-
-      <td valign="bottom" bgcolor="#CCCCCC" rowspan="5"><tt><font size=
-      "+1">gcc</font></tt></td>
-
-      <td colspan="8">
-        <table cellspacing="2" cellpadding="2" summary="" border="0">
-          <tr>
-            <th>&middot; Threading</th>
-          </tr>
-        </table>
-      </td>
-    </tr>
-
-    <tr>
-      <td valign="bottom" rowspan="4"><tt><font size="+1">-</font></tt></td>
-
-      <td valign="bottom" rowspan="4"><tt><font size="+1">mt</font></tt></td>
-
-      <td colspan="6">
-        <table cellspacing="2" cellpadding="2" bgcolor="#CCCCCC" summary=""
-        border="0">
-          <tr>
-            <th>&middot; Runtime</th>
-          </tr>
-        </table>
-      </td>
-    </tr>
-
-    <tr>
-      <td valign="bottom" bgcolor="#CCCCCC" rowspan="3"><tt><font size=
-      "+1">-</font></tt></td>
-
-      <td valign="bottom" bgcolor="#CCCCCC" rowspan="3"><tt><font size=
-      "+1">d</font></tt></td>
-
-      <td colspan="4">
-        <table cellspacing="2" cellpadding="2" summary="" border="0">
-          <tr>
-            <th>&middot; Boost Version</th>
-          </tr>
-        </table>
-      </td>
-    </tr>
-
-    <tr>
-      <td valign="bottom" rowspan="2"><tt><font size="+1">-</font></tt></td>
-
-      <td valign="bottom" rowspan="2"><tt><font size=
-      "+1">1_31</font></tt></td>
-
-      <td colspan="2">
-        <table cellspacing="2" cellpadding="2" bgcolor="#CCCCCC" summary=""
-        border="0">
-          <tr>
-            <th>&middot; Library Type</th>
-          </tr>
-        </table>
-      </td>
-    </tr>
-
-    <tr>
-      <td valign="bottom" bgcolor="#CCCCCC"><tt><font size=
-      "+1">.a</font></tt></td>
-
-      <td>&nbsp;</td>
-    </tr>
-  </table>
-
-  <h3>Library Prefix</h3>
-
-  <p>The "lib" prefix on the libraries is a requirement on many platforms,
-  like Unix, and on others like GCC running on Windows. The prefix is
-  therefore added to all libraries on Unix type systems, and to static
-  libraries on Windows. That is on Unix shared libraries and static libraries
-  (object archives) are named respectively:</p>
-
-  <ul>
-    <li><tt>lib*.so</tt></li>
-
-    <li><tt>lib*.a</tt></li>
-  </ul>
-
-  <p>On Windows shared libraries do not have the prefix to differentiate the
-  import libraries from static libraries. Consequently on Windows the
-  libraries are named:</p>
-
-  <table id="Table1" cellspacing="1" cellpadding="1" width="300" border="0">
-    <tr>
-      <td><font face="Courier New">*.dll</font></td>
-
-      <td>Dynamic library version.</td>
-    </tr>
-
-    <tr>
-      <td><font face="Courier New">*.lib</font></td>
-
-      <td>Import library for the dll.</td>
-    </tr>
-
-    <tr>
-      <td><font face="Courier New">lib*.lib</font></td>
-
-      <td>Static library version.</td>
-    </tr>
-  </table><br>
-  <br>
-
-  <h3>Library Name</h3>
-
-  <p>For Boost libraries the name has the "<tt>boost_</tt>" prefix to
-  separate them from other libraries in your system.</p>
-
-  <h3>Toolset</h3>
-
-  <p>The toolset name is an abbreviation based on the compiler you are
-  building with. The abbreviation is composed of a short, 2 to 4 characters,
-  tag for the compiler and a version number of the compiler's major and minor
-  revision (if available). For example if your toolset is
-  "<tt>gcc-3_2_3</tt>" the toolset tag would be "<tt>gcc32</tt>". The toolset
-  abbreviations used are as follows:</p>
-
-  <table cellpadding="5" summary="" border="1">
-    <tr>
-      <td><b>TOOLS Name</b></td>
-
-      <td><b>Abbreviation</b></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/borland-tools.html"><code>borland</code></a></td>
-
-      <td><tt>bcb</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/como-tools.html"><code>como</code></a></td>
-
-      <td><tt>como</tt></td>
-    </tr>
-
-    <tr>
-      <td><code><a href=
-      "../tools/build/v1/como-tools.html">como-win32</a></code></td>
-
-      <td><tt>como</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href="../tools/build/v1/cw-tools.html"><code>cw</code></a></td>
-
-      <td><tt>cw</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/darwin-tools.html"><code>darwin</code></a></td>
-
-      <td><tt>osx</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/dmc-tools.html"><code>dmc</code></a></td>
-
-      <td><tt>dmc</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/dmc-stlport-tools.html"><code>dmc-stlport</code></a></td>
-
-      <td><tt>dmc</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/edg-tools.html"><code>edg</code></a></td>
-
-      <td><tt>edg</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/gcc-tools.html"><code>gcc</code></a></td>
-
-      <td><tt>gcc</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/gcc-stlport-tools.html"><code>gcc-stlport</code></a></td>
-
-      <td><tt>gcc</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/gcc-nocygwin-tools.html"><code>gcc-nocygwin</code></a></td>
-
-      <td><tt>gcc</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/intel-linux-tools.html"><code>intel-linux</code></a></td>
-
-      <td><tt>il</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/intel-win32-tools.html"><code>intel-win32</code></a></td>
-
-      <td><tt>iw</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/kcc-tools.html"><code>kcc</code></a></td>
-
-      <td><tt>kcc</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/kylix-tools.html"><code>kylix</code></a></td>
-
-      <td><tt>bck</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/mingw-tools.html"><code>mingw</code></a></td>
-
-      <td><tt>mgw</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/mingw-stlport-tools.html"><code>mingw-stlport</code></a></td>
-
-      <td><tt>mgw</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/mipspro-tools.html"><code>mipspro</code></a></td>
-
-      <td><tt>mp</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/msvc-tools.html"><code>msvc</code></a></td>
-
-      <td><tt>vc</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/msvc-stlport-tools.html"><code>msvc-stlport</code></a></td>
-
-      <td><tt>vc</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/sunpro-tools.html"><code>sunpro</code></a></td>
-
-      <td><tt>sw</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/tru64cxx-tools.html"><code>tru64cxx</code></a></td>
-
-      <td><tt>tru</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/tru64cxx-tools.html"><code>tru64cxx65</code></a></td>
-
-      <td><tt>tru</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/vacpp-tools.html"><code>vacpp</code></a></td>
-
-      <td><tt>xlc</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/vc7-tools.html"><code>vc7</code></a></td>
-
-      <td><tt>vc</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/vc7-stlport-tools.html"><code>vc7-stlport</code></a></td>
-
-      <td><tt>vc</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/vc-7_1-tools.html"><code>vc-7_1</code></a></td>
-
-      <td><tt>vc</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/vc-7_1-stlport-tools.html"><code>vc-7_1-stlport</code></a></td>
-
-      <td><tt>vc</tt></td>
-    </tr>
-
-    <tr>
-      <td><a href=
-      "../tools/build/v1/vc-8_0-tools.html"><code>vc-8_0</code></a></td>
-
-      <td><tt>vc</tt></td>
-    </tr>
-
-    <tr>
-      <td>Others</td>
-
-      <td>The first part of the toolset name.</td>
-    </tr>
-  </table>
-
-  <h3>Threading</h3>
-
-  <p>This tag indicates if the library is compiled with threading support. If
-  threading is enabled "<tt>-mt</tt>" is added, otherwise nothing is
-  added.</p>
-
-  <h3>Runtime</h3>
-
-  <p>This specifies the type of runtime the library was compiled against, and
-  the type of code that is compiled. More commonly this encodes the ABI
-  variation used in the code. For each feature of the runtime system and code
-  compilation option a single letter is added to this tag.</p>
-
-  <table cellpadding="5" summary="" border="1">
-    <tr>
-      <td><b>Key</b></td>
-
-      <td><b>Feature</b></td>
-    </tr>
-
-    <tr>
-      <td><tt>s</tt></td>
-
-      <td>Static link to runtime.</td>
-    </tr>
-
-    <tr>
-      <td><tt>g</tt></td>
-
-      <td>Debug runtime.</td>
-    </tr>
-
-    <tr>
-      <td><tt>y</tt></td>
-
-      <td>Debug Python system.</td>
-    </tr>
-
-    <tr>
-      <td><tt>d</tt></td>
-
-      <td>Debug enabled code.</td>
-    </tr>
-
-    <tr>
-      <td><tt>p</tt></td>
-
-      <td>STLport runtime, instead of the vendor toolset runtime.</td>
-    </tr>
-
-    <tr>
-      <td><tt>n</tt></td>
-
-      <td>STLport runtime using the "native" IO streams instead of the
-      STLport IO streams.</td>
-    </tr>
-  </table>
-
-  <p>For example if you compile debug code for STLport using native IO
-  streams, and statically link to the debug runtime the tag would be:
-  "<tt>-sgdpn</tt>".</p>
-
-  <h3>Boost Version</h3>
-
-  <p>This is the short label for the version of the Boost Libraries. The
-  major and minor version numbers are taken together separated by an
-  underscore. For example version 1.31.0 would be tagged as "<tt>-1_31</tt>".
-  For patch versions the patch number is also included, for example a version
-  of 1.31.1 would be tagged as "<tt>-1_31_1</tt>".</p>
-
-  <h3>Library Type</h3>
-
-  <p>The extension holds the type of library. This follows the platform
-  requirements. On Windows this is "<tt>.dll</tt>" for shared libraries, and
-  "<tt>.lib</tt>" for static libraries including import libraries. On Unix
-  this is ".a" for static libraries (archives), and ".so" for shared
-  libraries. For toolsets that support it in Unix they will also have a full
-  version extension (for example "<tt>.so.1.31.0</tt>") with a symbolic link
-  for the un-versioned library.</p>
-
-  <h2><a name="auto-link"></a>Automatic Linking on Windows</h2>
-
-  <p>For most Boost libraries that have separate source, the correct build
-  variant is linked against automatically when you include one of that
-  library's header files.&nbsp; For this feature to work, your compiler must
-  support the <code>#pragma comment(lib, name)</code> feature (Microsoft
-  Visual C++, Intel C++, Metrowerks C++ , and Borland C++ all support
-  this).</p>
-
-  <p>If you are linking to a dynamic runtime, then you can choose to link to
-  either a static or a dynamic Boost library, the default is to do a static
-  link.&nbsp; You can alter this for a specific library <em>whatever</em> by
-  defining BOOST_WHATEVER_DYN_LINK to force Boost library <em>whatever</em>
-  to be linked dynamically.&nbsp; Alternatively you can force all Boost
-  libraries to dynamic link by defining BOOST_ALL_DYN_LINK.</p>
-
-  <p>This feature can be disabled for Boost library <em>whatever</em> by
-  defining BOOST_WHATEVER_NO_LIB, or for all of Boost by defining
-  BOOST_ALL_NO_LIB.</p>
-
-  <p>If you want to observe which libraries are being linked against then
-  defining BOOST_LIB_DIAGNOSTIC will cause the auto-linking code to emit a
-  <code>#pragma message</code> each time a library is selected for
-  linking.</p>
-
-  <p>There are some Boost libraries (<a href=
-  "../libs/test/doc/index.html">Boost.Test</a> is one one special case),
-  where automatic linking is not supported for technical reasons: please
-  consult the documentation for each of the libraries you are using for more
-  information, and the <a href="../libs/config/index.html">Boost.Config</a>
-  documentation for more information on configuration macros.&nbsp; The
-  following table shows the current supported configurations, (Boost
-  libraries not listed here consist of headers only):</p>
-
-  <table id="Table2" cellspacing="1" cellpadding="1" width="100%" border="1">
-    <tr>
-      <td><strong>Library</strong></td>
-
-      <td><strong>Static Link</strong></td>
-
-      <td><strong>Dynamic Link</strong></td>
-
-      <td><strong>Default linkage</strong></td>
-
-      <td><strong>Automatic library selection</strong></td>
-
-      <td><strong>Comments</strong></td>
-    </tr>
-
-    <tr>
-      <td>Date-Time</td>
-
-      <td>Yes</td>
-
-      <td>Yes</td>
-
-      <td>static</td>
-
-      <td>Yes</td>
-
-      <td>&nbsp;</td>
-    </tr>
-
-    <tr>
-      <td>Filesystem</td>
-
-      <td>Yes</td>
-
-      <td>
-        <p>Yes</p>
-      </td>
-
-      <td>static</td>
-
-      <td>Yes</td>
-
-      <td>&nbsp;</td>
-    </tr>
-
-    <tr>
-      <td>Graph</td>
-
-      <td>Yes</td>
-
-      <td>No</td>
-
-      <td>static</td>
-
-      <td>No</td>
-
-      <td>The separate Graph library source is needed only when <a href=
-      "../libs/graph/doc/read_graphviz.html">reading an AT&amp;T graphviz
-      file.</a></td>
-    </tr>
-
-    <tr>
-      <td>Iostreams</td>
-
-      <td>Yes</td>
-
-      <td>
-        <p>Yes</p>
-      </td>
-
-      <td>static</td>
-
-      <td>Yes</td>
-
-      <td>&nbsp;</td>
-    </tr>
-
-    <tr>
-      <td>Program Options</td>
-
-      <td>Yes</td>
-
-      <td>Yes</td>
-
-      <td>static</td>
-
-      <td>Yes</td>
-
-      <td>&nbsp;</td>
-    </tr>
-
-    <tr>
-      <td>Python</td>
-
-      <td>Yes</td>
-
-      <td>Yes</td>
-
-      <td>dynamic</td>
-
-      <td>No</td>
-
-      <td>Since all Python extensions are DLL's it makes sense to dynamic
-      link to the Boost Python library&nbsp;by default (static linking is
-      only really an option if you are embedding python).</td>
-    </tr>
-
-    <tr>
-      <td>Regex</td>
-
-      <td>Yes</td>
-
-      <td>Yes</td>
-
-      <td>static</td>
-
-      <td>Yes</td>
-
-      <td>&nbsp;</td>
-    </tr>
-
-    <tr>
-      <td>Serialization</td>
-
-      <td>Yes</td>
-
-      <td>Yes</td>
-
-      <td>static</td>
-
-      <td>Yes</td>
-
-      <td>&nbsp;</td>
-    </tr>
-
-    <tr>
-      <td>Signals</td>
-
-      <td>Yes</td>
-
-      <td>Yes</td>
-
-      <td>static</td>
-
-      <td>Yes</td>
-
-      <td>&nbsp;</td>
-    </tr>
-
-    <tr>
-      <td>Test</td>
-
-      <td>Yes</td>
-
-      <td>No</td>
-
-      <td>static</td>
-
-      <td>No</td>
-
-      <td>Which library you link to depends upon which program entry point
-      you define, rather than which Boost.Test features you use.</td>
-    </tr>
-
-    <tr>
-      <td>Thread</td>
-
-      <td>Partial</td>
-
-      <td>Yes</td>
-
-      <td>static (Visual C++), otherwise dynamic</td>
-
-      <td>Yes</td>
-
-      <td>For technical reasons static linking is supported on only one
-      Windows compiler (Visual C++).</td>
-    </tr>
-
-    <tr>
-      <td>Wave</td>
-
-      <td>Yes</td>
-
-      <td>Yes</td>
-
-      <td>static</td>
-
-      <td>Yes</td>
-
-      <td>&nbsp;</td>
-    </tr>
-  </table><br>
-  <br>
-
-  <h2><a id="Additional_Steps" name="Additional_Steps"></a>Additional
-  Steps</h2>
-
-  <p>Depending on your platform and configuration you may need to perform
-  some additional configuration to get Boost to build and install.</p>
-
-  <ul>
-    <li><a href="../libs/config/config.htm#configuring">Configure the boost
-    source code</a>. This step should not be required on the vast majority of
-    platforms, but if you're trying to build Boost on an untested or
-    unsupported platform it may be necessary.<br>
-    <br></li>
-
-    <li>If Boost.Build has problems detecting your Python installation it
-    will print a short messages about how to configure for finding the Python
-    installation. For more information, see these detailed <a href=
-    "../libs/python/doc/building.html#building">instructions</a>.</li>
-  </ul>
-  <hr>
-
-  <p>Revised $Date: 2006/05/15 23:47:28 $</p>
-
-  <p>Copyright &copy; Rene Rivera 2003.<br>
-  Copyright &copy; Jens Maurer 2001.<br>
-  Copyright &copy; John Maddock 2004.</p>
-
-  <p><small>Distributed under the Boost Software License, Version 1.0. (See
-  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
-  at <a href=
-  "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
+<body>
+Automatically loading index page... if nothing happens, please go to
+<a href="getting_started/index.html">getting_started/index.html</a>.
 </body>
 </html>
+<!-- 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) -->

Copied: boost/trunk/more/getting_started.rst (from rev 14034, boost/branches/upstream/current/more/getting_started.rst)

Modified: boost/trunk/more/header.htm
===================================================================
--- boost/trunk/more/header.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/header.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 
 <head>
@@ -10,7 +11,8 @@
 
 <body bgcolor="#FFFFFF" text="#000000">
 
-<table border="1" bgcolor="#007F7F" cellpadding="2">
+<table  summary="Navigational header"
+ border="1" bgcolor="#007F7F" cellpadding="2">
   <tr>
     <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
     <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
@@ -24,13 +26,13 @@
 <p>Header files are the place where a library comes into contact with user code
 and other libraries.&nbsp; To co-exist peacefully and productively, headers must
 be &quot;good neighbors&quot;.</p>
-<p>Here are the standards for namespace boost headers.&nbsp;&nbsp;&nbsp; Many of
+<p>Here are the standards for boost headers.&nbsp;&nbsp;&nbsp; Many of
 these are also reasonable guidelines for general use.
 <ul>
-  <li>Headers should have a .hpp (lowercase) filename extension.&nbsp;</li>
-  <li>Wrap the header in #ifndef guards so that multiple inclusion is
-    benign.&nbsp; Use a naming convention that minimizes the chance of clashes
-    with macro names from other's code.&nbsp; The <a href="#Sample header">sample
+  <li>Header filenames should have a .hpp (lowercase) extension.&nbsp;</li>
+  <li>Unless multiple inclusion is intended, wrap the header in #ifndef guards.
+	  Use a naming convention that minimizes the chance of clashes
+    with macro names from other's code.&nbsp; The <a href="#SampleHeader">sample
     header</a> uses the Boost convention of all uppercase letters, with the
     header name prefixed by the namespace name, and suffixed with HPP, separated
     by underscores.</li>
@@ -38,16 +40,16 @@
     pollution. The namespace approach to pollution control is strongly preferred
     to older approaches such as adding funny prefixes to global names.&nbsp;
     Libraries which are designed to work well with other Boost libraries should
-    be placed namespace <tt>boost</tt>.</li>
+    be placed in namespace <tt>boost</tt>.</li>
 
   <li>Make sure that a translation unit consisting of just the
-  contents of the header file will compile successfully.
+  contents of the header file will compile successfully.</li>
 
   <li>Place the header file in a sub-directory to prevent conflict with
     identically named header files in other libraries.&nbsp; The parent
     directory is added to the compiler's include search path.&nbsp; Then both
     your code and user code specifies the sub-directory in <tt>#include</tt>
-    directives.&nbsp; Thus the header <a href="#Sample header">sample header</a>&nbsp;
+    directives.&nbsp; Thus the header <a href="#SampleHeader">sample header</a>&nbsp;
     would be included by <tt>#include &lt;boost/furball.hpp&gt;</tt></li>
   <li>The preferred ordering for class definitions is public members, protected
     members, and finally private members.</li>
@@ -55,15 +57,12 @@
     header</a> if there is a need to deal with compiler or platform
     configuration issues.</li>
 </ul>
-<h2><a name="Sample header"></a>Sample Header</h2>
-<pre><tt>//&nbsp; Boost general library furball.hpp header file&nbsp; ---------------------------//
+<h2><a name="SampleHeader"></a>Sample Header</h2>
+<pre><tt>//&nbsp; Boost general library furball.hpp header file ---------------------------//
 
-//&nbsp; (C) Copyright Your Name 1998. Permission to copy, use, modify, sell and
-//&nbsp; distribute this software is granted provided this copyright notice appears
-//&nbsp; in all copies. This software is provided &quot;as is&quot; without express or implied
-//&nbsp; warranty, and with no claim as to its suitability for any purpose.
+  &lt;<i> Copyright and license notice</i>, as indicated in the <a href="license_info.html">license page</a> &gt;
 
-//&nbsp; See http://www.boost.org for updates, documentation, and revision history.
+//&nbsp; See http://www.boost.org/ for latest version.
 
 #ifndef BOOST_FURBALL_HPP
 #define BOOST_FURBALL_HPP
@@ -82,9 +81,9 @@
 
 } // namespace
 
-#endif&nbsp; // BOOST_FURBALL_HPP</tt></pre>
+#endif&nbsp; // include guard</tt></pre>
 <h2>Coding Style</h2>
-<p>The alert reader will have noticed that the <a href="#Sample header">sample
+<p>The alert reader will have noticed that the <a href="#SampleHeader">sample
 header</a> employs a certain coding style for indentation, positioning braces,
 commenting ending braces, and similar formatting issues.&nbsp; These stylistic
 issues are viewed as personal preferences and are not part of the Boost Header
@@ -92,11 +91,12 @@
 <hr>
 <p>Revised <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->02 October, 2003<!--webbot bot="Timestamp" endspan i-checksum="38549" --></p>
 
-<p>© Copyright Beman Dawes 1998</p>
-<p> Use, modification, and distribution are subject to the Boost Software 
-License, Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a>)</p>
+<p>&copy; Copyright Beman Dawes 1998</p>
+<p>
+   Distributed under the Boost Software License, Version 1.0. (See
+   accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+   at <a href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)
+</p>
 
 </body>
 

Modified: boost/trunk/more/imp_vars.htm
===================================================================
--- boost/trunk/more/imp_vars.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/imp_vars.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 
 <head>
@@ -9,7 +10,8 @@
 
 <body link="#0000ff" vlink="#800080" bgcolor="#FFFFFF" text="#000000">
 
-<table border="1" bgcolor="#007F7F" cellpadding="2">
+<table summary="Navigational header"
+  border="1" bgcolor="#007F7F" cellpadding="2">
   <tr>
     <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
     <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
@@ -32,9 +34,9 @@
 main contribution is the interface, which is augmented with an implementation,
 proving that it is possible to implement the corresponding class and providing a
 free implementation.&quot;</p>
-<b>
+
 <h2>Implementation variations</h2>
-</b>
+
 <p>There may be a need for multiple implementations of an interface, to
 accommodate either platform dependencies or performance tradeoffs. Examples of
 platform dependencies include compiler shortcomings, file systems, thread
@@ -56,9 +58,9 @@
 costs.&nbsp; The term &quot;full costs&quot; is intended to include both
 tangible costs like extra maintenance, and intangible cost like increased
 difficulty in user understanding.</p>
-<b>
+
 <h2>Techniques for providing implementation variations</h2>
-</b>
+
 <p>Several techniques may be used to provide implementation variations. Each is
 appropriate in some situations, and not appropriate in other situations.</p>
 <h3>Single general purpose implementation</h3>
@@ -78,7 +80,7 @@
 affect speed dramatically, coding differences such as changing a class from
 virtual to non-virtual members or removing a level of indirection are unlikely
 to make any measurable difference unless deep in an inner loop. And even in an
-inner loop, modern CPU’s often execute such competing code sequences in the
+inner loop, modern CPUs often execute such competing code sequences in the
 same number of clock cycles!&nbsp; A single general purpose implementation is
 often just fine.&quot;</p>
 <p>Or as Donald Knuth said, &quot;Premature optimization is the root of all
@@ -198,10 +200,11 @@
 
 <p>© Copyright Beman Dawes 2001</p>
 
-<p> Use, modification, and distribution are subject to the Boost Software 
-License, Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a>)</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See
+   accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+   at <a href=
+   "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)
+</p>
 
 </body>
 

Modified: boost/trunk/more/index.htm
===================================================================
--- boost/trunk/more/index.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/index.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
    <head>
       <title>Boost More Information</title>
@@ -6,7 +7,8 @@
       <meta name="GENERATOR" content="Microsoft FrontPage 5.0">
    </head>
    <body bgcolor="#ffffff" text="#000000">
-      <table border="1" cellpadding="2" bgcolor="#007f7f">
+      <table summary ="Navigational header"
+			 border="1" cellpadding="2" bgcolor="#007f7f">
          <tr>
             <td bgcolor="#ffffff">
                <img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
@@ -111,9 +113,11 @@
       <p>
          © Copyright Beman Dawes 2003.</p>
       <p>
-         Use, modification, and distribution are subject to the Boost Software License, 
-         Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
-         or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
+         Distributed under the Boost Software License, Version 1.0. (See
+         accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+         at <a href=
+         "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
    </body>
 </html>
 

Modified: boost/trunk/more/int_const_guidelines.htm
===================================================================
--- boost/trunk/more/int_const_guidelines.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/int_const_guidelines.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 
 <head>
@@ -315,9 +316,10 @@
 <hr>
 
 <p><i>© Copyright Dr John Maddock 2001</i></p>
-<p><i>Use, modification and distribution are subject to the Boost Software License, 
-    Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
-    or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+<p><i>Distributed under the Boost Software License, Version 1.0. (See
+      accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+      at <a href=
+      "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 
 <p>&nbsp;</p>
 

Modified: boost/trunk/more/lib_guide.htm
===================================================================
--- boost/trunk/more/lib_guide.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/lib_guide.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,613 +1,931 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
-   <head>
-      <title>Boost Library Requirements and Guidelines</title>
-      <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-      <meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-      <meta name="ProgId" content="FrontPage.Editor.Document">
-      <meta name="Microsoft Border" content="none, default">
-   </head>
-   <body bgcolor="#ffffff" text="#000000">
-      <table border="1" bgcolor="#007f7f" cellpadding="2">
-         <tr>
-            <td bgcolor="#ffffff"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-            <td><a href="../index.htm"><font face="Arial" color="#ffffff"><big>Home</big></font></a></td>
-            <td><a href="../libs/libraries.htm"><font face="Arial" color="#ffffff"><big>Libraries</big></font></a></td>
-            <td><a href="../people/people.htm"><font face="Arial" color="#ffffff"><big>People</big></font></a></td>
-            <td><a href="faq.htm"><font face="Arial" color="#ffffff"><big>FAQ</big></font></a></td>
-            <td><a href="index.htm"><font face="Arial" color="#ffffff"><big>More</big></font></a></td>
-         </tr>
-      </table>
-      <h1 align="left">Boost Library Requirements and Guidelines</h1>
-      <p align="left"><a href="#Introduction">Introduction</a><br>
-         <a href="#Requirements">Requirements</a><br>
-         &nbsp;&nbsp;&nbsp; <a href="#License">License requirements</a><br>
-         &nbsp;&nbsp;&nbsp; <a href="#Portability">Portability requirements</a><br>
-         &nbsp;&nbsp;&nbsp; <a href="#Ownership">Ownership</a><br>
-         <a href="#Guidelines">Guidelines</a><br>
-         &nbsp;&nbsp;&nbsp; <a href="#Design_and_Programming">Design and programming</a><br>
-         &nbsp;&nbsp;&nbsp; <a href="#Directory_structure">Directory structure and 
-            filenames</a><br>
-         &nbsp;&nbsp;&nbsp; <a href="#Naming&shy;_consistency">Naming consistency</a><br>
-         &nbsp;&nbsp;&nbsp; <a href="#Documentation">Documentation</a><br>
-         <a href="#Rationale">Rationale</a><br>
-         &nbsp;&nbsp;&nbsp; <a href="#Exception-specification">Exception-specification 
-            rationale</a><br>
-         &nbsp;&nbsp;&nbsp; <a href="#Naming">Naming conventions rationale</a><br>
-         &nbsp;&nbsp;&nbsp; <a href="#code_fonts">Source code fonts rationale</a><br>
-         &nbsp;&nbsp;&nbsp; <a href="#Tabs">Tabs rationale</a><br>
-         &nbsp;&nbsp;&nbsp; <a href="#JavaScript">ECMAScript/JavaScript rationale</a><br>
-         &nbsp;&nbsp;&nbsp; <a href="#Rationale_rationale">Rationale rationale</a><br>
-         &nbsp;&nbsp;&nbsp; <a href="#Acknowledgements">Acknowledgements rationale</a></p>
-      <h2 align="left"><a name="Introduction">Introduction</a></h2>
-      <p align="left">This page describes requirements and guidelines for the content of 
-         a library submitted to Boost.</p>
-      <p align="left">See the <a href="submission_process.htm">Boost Library Submission 
-            Process</a> page for a description of the process involved.</p>
-      <h2 align="left"><a name="Requirements">Requirements</a></h2>
-      <p>To avoid the frustration and wasted time of a proposed library being rejected, 
-         it must meets these requirements:</p>
-      <ul>
-         <li>
-            The license must meet the <a href="#License">license requirements</a>
-         below. Restricted licenses like the GPL and LGPL are not acceptable.
-         <li>
-            The copyright <a href="#Ownership">ownership</a>
-         must be clear.
-         <li>
-         The library must be generally useful and not restricted to a narrow problem 
-         domain.
-         <li>
-            The library must meet the <a href="#Portability">portability requirements</a>
-         below.&nbsp;
-         <li>
-            The library must come reasonably close to meeting the <a href="#Guidelines">Guidelines</a>
-            below.
-            <ul>
-               <li>
-                  <a href="#Design_and_Programming">Design and Programming</a>
-               <li>
-                  <a href="#Directory_structure">Directory Structure</a>
-               <li>
-                  <a href="#Documentation">Documentation</a></li>
-            </ul>
-         <li>
-            The author must be willing to participate in discussions on the mailing list, 
-            and to refine the library accordingly.</li>
-      </ul>
-      <p>There's no requirement that an author read the mailing list for a time before 
-         making a submission. It has been noted, however, that submissions which begin 
-         "I just started to read this mailing list ..." seem to fail, often 
-         embarrassingly.</p>
-      <h3 align="left"><a name="License">License</a> requirements</h3>
-      <p>The preferred way to meet the license requirements is to use the <a href="../LICENSE_1_0.txt">
-            Boost Software License</a>. See <a href="license_info.html">license information</a>. 
-         If for any reason you do not intend to use the Boost Software License, please 
-         discuss the issues on the Boost <a href="mailing_lists.htm#main">developers 
-            mailing list</a> first.</p>
-      <p>The license requirements:</p>
-      <ul>
-         <li>
-         Must be simple to read and understand.
-         <li>
-         Must grant permission without fee to copy, use and modify the software for any 
-         use (commercial and non-commercial).
-         <li>
-         Must require that the license appear on all copies of the software source code.
-         <li>
-         Must not require that the license appear with executables or other binary uses 
-         of the library.
-         <li>
-         Must not require that the source code be available for execution or other 
-         binary uses of the library.
-         <li>
-            May restrict the use of the name and description of the library to the standard 
-            version found on the Boost web site.</li>
-      </ul>
-      <h3 align="left"><a name="Portability">Portability</a> requirements</h3>
-      <ul>
-         <li>
-            <p align="left">A library's interface must portable and not restricted to a 
-               particular compiler or operating system.</p>
-         <li>
-            <p align="left">A library's implementation must if possible be portable and not 
-               restricted to a particular compiler or operating system.&nbsp; If a portable 
-               implementation is not possible, non-portable constructions are acceptable if 
-               reasonably easy to port to other environments, and implementations are provided 
-               for at least two popular operating systems (such as UNIX and Windows).</p>
-         <li>
-            <p align="left">There is no requirement that a library run on C++ compilers which 
-               do not conform to the ISO standard.&nbsp;</p>
-         <li>
-            <p align="left">There is no requirement that a library run on any particular C++ 
-               compiler.&nbsp; Boost contributors often try to ensure their libraries work 
-               with popular compilers.&nbsp; The boost/config.hpp <a href="../libs/config/config.htm">
-                  configuration header</a> is the preferred mechanism for working around 
-               compiler deficiencies.</p>
-         </li>
-      </ul>
-      <p align="left">Since there is no absolute way to prove portability, many boost 
-         submissions demonstrate practical portability by compiling and executing 
-         correctly with two different C++ compilers, often under different operating 
-         systems.&nbsp; Otherwise reviewers may disbelieve that porting is in fact 
-         practical.</p>
-      <h3 align="left"><a name="Ownership">Ownership</a></h3>
-      <p align="left">Are you sure you own the library you are thinking of 
-         submitting?&nbsp;&nbsp; "How to Copyright Software" by MJ Salone, Nolo Press, 
-         1990 says:</p>
-      <blockquote>
-         <p align="left">Doing work on your own time that is very similar to programming 
-            you do for your employer on company time can raise nasty legal problems.&nbsp; 
-            In this situation, it's best to get a written release from your employer in 
-            advance.</p>
-      </blockquote>
-      <p align="left">Place a copyright notice in all the important files you submit. 
-         Boost won't accept libraries without clear copyright information.</p>
-      <h2 align="left"><a name="Guidelines">Guidelines</a></h2>
-      <p align="left">Please use these guidelines as a checklist for preparing the 
-         content a library submission.&nbsp; Not every guideline applies to every 
-         library, but a reasonable effort to comply is expected.</p>
-      <h3><a name="Design_and_Programming">Design and Programming</a></h3>
-      <ul>
-         <li>
-            Aim first for clarity and correctness; optimization should be only a secondary 
-            concern in most Boost libraries.</li>
-      </ul>
-      <ul>
-         <li>
-            Aim for ISO Standard C++. Than means making effective use of the standard 
-            features of the language, and avoiding non-standard compiler extensions. It 
-            also means using the C++ Standard Library where applicable.</li>
-      </ul>
-      <ul>
-         <li>
-            Headers should be good neighbors. See the <a href="header.htm">header policy</a>. 
-            See <a href="#Naming&shy;_consistency">Naming consistency</a>.</li>
-      </ul>
-      <ul>
-         <li>
-            Follow quality programming practices. See, for example, "Effective C++" 2nd 
-            Edition, and "More Effective C++", both by Scott Meyers, published by Addison 
-            Wesley.</li>
-      </ul>
-      <ul>
-         <li>
-            Use the C++ Standard Library or other Boost libraries, but only when the 
-            benefits outweigh the costs.&nbsp; Do not use libraries other than the C++ 
-            Standard Library or Boost. See <a href="library_reuse.htm">Library reuse</a>.</li>
-      </ul>
-      <ul>
-         <li>
-            Read <a href="imp_vars.htm">Implementation Variation</a> to see how to supply 
-            performance, platform, or other implementation variations.</li>
-      </ul>
-      <ul>
-         <li>
-            Read the <A href="separate_compilation.html">guidelines for libraries with 
-               separate source</A>
-         to see how to ensure that compiled link libraries meet user expectations.
-         </li>
-      </ul>
-      <ul>
-         <LI>
-            Use the naming conventions of the C++ Standard Library (See <a href="#Naming">Naming 
-               conventions rationale</a>):
+  <head>
+    <title>
+      Boost Library Requirements and Guidelines
+    </title>
+    <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
+    <meta name="GENERATOR" content="Microsoft FrontPage 5.0">
+    <meta name="ProgId" content="FrontPage.Editor.Document">
+    <meta name="Microsoft Border" content="none, default">
+  </head>
+
+  <body bgcolor="#FFFFFF" text="#000000">
+    <table border="1" bgcolor="#007F7F" cellpadding="2">
+      <tr>
+        <td bgcolor="#FFFFFF">
+          <img src="../boost.png" alt="boost.png (6897 bytes)" width="277"
+          height="86">
+        </td>
+        <td>
+          <a href="../index.htm"><font face="Arial" color=
+          "#FFFFFF"><big>Home</big></font></a>
+
+        </td>
+        <td>
+          <a href="../libs/libraries.htm"><font face="Arial" color=
+          "#FFFFFF"><big>Libraries</big></font></a>
+        </td>
+        <td>
+          <a href="../people/people.htm"><font face="Arial" color=
+          "#FFFFFF"><big>People</big></font></a>
+        </td>
+        <td>
+
+          <a href="faq.htm"><font face="Arial" color=
+          "#FFFFFF"><big>FAQ</big></font></a>
+        </td>
+        <td>
+          <a href="index.htm"><font face="Arial" color=
+          "#FFFFFF"><big>More</big></font></a>
+        </td>
+      </tr>
+    </table>
+    <h1 align="left">
+
+      Boost Library Requirements and Guidelines
+    </h1>
+    <p align="left">
+      <a href="#Introduction">Introduction</a><br>
+      <a href="#Requirements">Requirements</a><br>
+      &nbsp;&nbsp;&nbsp; <a href="#License">License requirements</a><br>
+      &nbsp;&nbsp;&nbsp; <a href="#Portability">Portability requirements</a><br>
+
+      &nbsp;&nbsp;&nbsp; <a href="#Ownership">Ownership</a><br>
+      <a href="#Guidelines">Guidelines</a><br>
+      &nbsp;&nbsp;&nbsp; <a href="#Design_and_Programming">Design and
+      programming</a><br>
+      &nbsp;&nbsp;&nbsp; <a href="#Directory_structure">Directory structure and
+      filenames</a><br>
+      &nbsp;&nbsp;&nbsp; <a href="#Naming_consistency">Naming
+      consistency</a><br>
+
+      &nbsp;&nbsp;&nbsp; <a href="#Documentation">Documentation</a><br>
+      <a href="#Rationale">Rationale</a><br>
+      &nbsp;&nbsp;&nbsp; <a href=
+      "#Exception-specification">Exception-specification rationale</a><br>
+      &nbsp;&nbsp;&nbsp; <a href="#Naming">Naming conventions rationale</a><br>
+      &nbsp;&nbsp;&nbsp; <a href="#code_fonts">Source code fonts
+      rationale</a><br>
+
+      &nbsp;&nbsp;&nbsp; <a href="#Tabs">Tabs rationale</a><br>
+      &nbsp;&nbsp;&nbsp; <a href="#JavaScript">ECMAScript/JavaScript
+      rationale</a><br>
+      &nbsp;&nbsp;&nbsp; <a href="#Rationale_rationale">Rationale
+      rationale</a><br>
+      &nbsp;&nbsp;&nbsp; <a href="#Acknowledgements">Acknowledgements
+      rationale</a>
+    </p>
+
+    <h2 align="left">
+      <a name="Introduction" id="Introduction">Introduction</a>
+    </h2>
+    <p align="left">
+      This page describes requirements and guidelines for the content of a
+      library submitted to Boost.
+    </p>
+    <p align="left">
+      See the <a href="submission_process.htm">Boost Library Submission
+      Process</a> page for a description of the process involved.
+    </p>
+
+    <h2 align="left">
+      <a name="Requirements" id="Requirements">Requirements</a>
+    </h2>
+    <p>
+      To avoid the frustration and wasted time of a proposed library being
+      rejected, it must meets these requirements:
+    </p>
+    <ul>
+      <li>The license must meet the <a href="#License">license requirements</a>
+
+      below. Restricted licenses like the GPL and LGPL are not acceptable.
+      </li>
+      <li>The copyright <a href="#Ownership">ownership</a> must be clear.
+      </li>
+      <li>The library must be generally useful and not restricted to a narrow
+      problem domain.
+      </li>
+      <li>The library must meet the <a href="#Portability">portability
+      requirements</a> below.&nbsp;
+
+      </li>
+      <li>The library must come reasonably close to meeting the <a href=
+      "#Guidelines">Guidelines</a> below.
+        <ul>
+          <li>
+            <a href="#Design_and_Programming">Design and Programming</a>
+          </li>
+          <li>
+
+            <a href="#Directory_structure">Directory Structure</a>
+          </li>
+          <li>
+            <a href="#Documentation">Documentation</a>
+          </li>
+        </ul>
+      </li>
+      <li>The author must be willing to participate in discussions on the mailing
+      list, and to refine the library accordingly.
+      </li>
+
+    </ul>
+    <p>
+      There's no requirement that an author read the mailing list for a time
+      before making a submission. It has been noted, however, that submissions
+      which begin "I just started to read this mailing list ..." seem to fail,
+      often embarrassingly.
+    </p>
+    <h3 align="left">
+      <a name="License" id="License">License</a> requirements
+    </h3>
+    <p>
+      The preferred way to meet the license requirements is to use the <a href=
+      "../LICENSE_1_0.txt">Boost Software License</a>. See <a href=
+      "license_info.html">license information</a>. If for any reason you do not
+      intend to use the Boost Software License, please discuss the issues on the
+      Boost <a href="mailing_lists.htm#main">developers mailing list</a> first.
+    </p>
+
+    <p>
+      The license requirements:
+    </p>
+    <ul>
+      <li>Must be simple to read and understand.
+      </li>
+      <li>Must grant permission without fee to copy, use and modify the software
+      for any use (commercial and non-commercial).
+      </li>
+      <li>Must require that the license appear on all copies of the software
+      source code.
+      </li>
+      <li>Must not require that the license appear with executables or other
+      binary uses of the library.
+      </li>
+
+      <li>Must not require that the source code be available for execution or
+      other binary uses of the library.
+      </li>
+      <li>May restrict the use of the name and description of the library to the
+      standard version found on the Boost web site.
+      </li>
+    </ul>
+    <h3 align="left">
+      <a name="Portability" id="Portability">Portability</a> requirements
+    </h3>
+    <ul>
+
+      <li>
+        <p align="left">
+          A library's interface must portable and not restricted to a particular
+          compiler or operating system.
+        </p>
+      </li>
+      <li>
+        <p align="left">
+          A library's implementation must if possible be portable and not
+          restricted to a particular compiler or operating system.&nbsp; If a
+          portable implementation is not possible, non-portable constructions are
+          acceptable if reasonably easy to port to other environments, and
+          implementations are provided for at least two popular operating systems
+          (such as UNIX and Windows).
+        </p>
+
+      </li>
+      <li>
+        <p align="left">
+          There is no requirement that a library run on C++ compilers which do
+          not conform to the ISO standard.&nbsp;
+        </p>
+      </li>
+      <li>
+        <p align="left">
+
+          There is no requirement that a library run on any particular C++
+          compiler.&nbsp; Boost contributors often try to ensure their libraries
+          work with popular compilers.&nbsp; The boost/config.hpp <a href=
+          "../libs/config/config.htm">configuration header</a> is the preferred
+          mechanism for working around compiler deficiencies.
+        </p>
+      </li>
+    </ul>
+    <p align="left">
+      Since there is no absolute way to prove portability, many boost submissions
+      demonstrate practical portability by compiling and executing correctly with
+      two different C++ compilers, often under different operating systems.&nbsp;
+
+      Otherwise reviewers may disbelieve that porting is in fact practical.
+    </p>
+    <h3 align="left">
+      <a name="Ownership" id="Ownership">Ownership</a>
+    </h3>
+    <p align="left">
+      Are you sure you own the library you are thinking of
+      submitting?&nbsp;&nbsp; "How to Copyright Software" by MJ Salone, Nolo
+      Press, 1990 says:
+    </p>
+
+    <blockquote>
+      <p align="left">
+        Doing work on your own time that is very similar to programming you do
+        for your employer on company time can raise nasty legal problems.&nbsp;
+        In this situation, it's best to get a written release from your employer
+        in advance.
+      </p>
+    </blockquote>
+    <p align="left">
+      Place a copyright notice in all the important files you submit. Boost won't
+      accept libraries without clear copyright information.
+    </p>
+
+    <h2 align="left">
+      <a name="Guidelines" id="Guidelines">Guidelines</a>
+    </h2>
+    <p align="left">
+      Please use these guidelines as a checklist for preparing the content a
+      library submission.&nbsp; Not every guideline applies to every library, but
+      a reasonable effort to comply is expected.
+    </p>
+    <h3>
+      <a name="Design_and_Programming" id="Design_and_Programming">Design and
+      Programming</a>
+
+    </h3>
+    <ul>
+      <li>Aim first for clarity and correctness; optimization should be only a
+      secondary concern in most Boost libraries.
+      </li>
+    </ul>
+    <ul>
+      <li>Aim for ISO Standard C++. Than means making effective use of the
+      standard features of the language, and avoiding non-standard compiler
+      extensions. It also means using the C++ Standard Library where applicable.
+      </li>
+    </ul>
+    <ul>
+
+      <li>Headers should be good neighbors. See the <a href="header.htm">header
+      policy</a>. See <a href="#Naming_consistency">Naming consistency</a>.
+      </li>
+    </ul>
+    <ul>
+      <li>Follow quality programming practices. See, for example, "Effective C++"
+      2nd Edition, and "More Effective C++", both by Scott Meyers, published by
+      Addison Wesley.
+      </li>
+    </ul>
+    <ul>
+
+      <li>Use the C++ Standard Library or other Boost libraries, but only when
+      the benefits outweigh the costs.&nbsp; Do not use libraries other than the
+      C++ Standard Library or Boost. See <a href="library_reuse.htm">Library
+      reuse</a>.
+      </li>
+    </ul>
+    <ul>
+      <li>Read <a href="imp_vars.htm">Implementation Variation</a> to see how to
+      supply performance, platform, or other implementation variations.
+      </li>
+
+    </ul>
+    <ul>
+      <li>Read the <a href="separate_compilation.html">guidelines for libraries
+      with separate source</a> to see how to ensure that compiled link libraries
+      meet user expectations.
+      </li>
+    </ul>
+    <ul>
+      <li>Use the naming conventions of the C++ Standard Library (See <a href=
+      "#Naming">Naming conventions rationale</a>):<br>
+
+        &nbsp;
+        <ul>
+          <li>Names (except as noted below) should be all lowercase, with words
+          separated by underscores.
+          </li>
+          <li>Acronyms should be treated as ordinary names (e.g.
+          <code>xml_parser</code> instead of <code>XML_parser</code>).
+          </li>
+          <li>Template parameter names begin with an uppercase letter.
+          </li>
+
+          <li>Macro (gasp!) names all uppercase and begin with BOOST_.
+          </li>
+        </ul>
+      </li>
+    </ul>
+    <ul>
+      <li>Choose meaningful names - explicit is better than implicit, and
+      readability counts. There is a strong preference for clear and descriptive
+      names, even if lengthy.
+      </li>
+    </ul>
+    <ul>
+
+      <li>Use exceptions to report errors where appropriate, and write code that
+      is safe in the face of exceptions.
+      </li>
+    </ul>
+    <ul>
+      <li>Avoid exception-specifications. See <a href="#Exception-specification">
+        exception-specification rationale</a>.
+      </li>
+    </ul>
+    <ul>
+
+      <li>Provide sample programs or confidence tests so potential users can see
+      how to use your library.
+      </li>
+    </ul>
+    <ul>
+      <li>Provide a regression test program or programs which follow the
+        <a href="test_policy.htm">Test Policies and Protocols</a>.
+      </li>
+    </ul>
+    <ul>
+      <li>Although some boost members use proportional fonts, tabs, and
+      unrestricted line lengths in their own code, boost's widely distributed
+      source code should follow more conservative guidelines:
+        <ul>
+
+          <li>Use fixed-width fonts.&nbsp; See <a href="#code_fonts">fonts
+          rationale</a>.
+          </li>
+          <li>Use spaces rather than tabs. See <a href="#Tabs">tabs
+          rationale</a>.
+          </li>
+          <li>Limit line lengths to 80 characters.
+          </li>
+        </ul>
+
+      </li>
+    </ul>
+    <ul>
+      <li>End all documentation files (HTML or otherwise) with a copyright
+      message and a licensing message. See <a href="license_info.html">license
+      information</a> page for the preferred form.
+      </li>
+    </ul>
+    <ul>
+      <li>Begin all source files (including programs, headers, scripts, etc.)
+      with:<br>
+
+        &nbsp;
+        <ul>
+          <li>A comment line describing the contents of the file.<br>
+            &nbsp;
+          </li>
+          <li>Comments describing copyright and licensing: again, the preferred
+          form is indicated in the <a href="license_info.html">license
+          information</a> page<br>
+
             <br>
-            &nbsp;<ul>
-               <li>
-               Names (except as noted below) should be all lowercase, with words separated by 
-               underscores.
-               <li>
-                  Acronyms should be treated as ordinary names (e.g. <code>xml_parser</code> instead 
-                  of <code>XML_parser</code>).
-               <li>
-               Template parameter names begin with an uppercase letter.
-               <li>
-                  Macro (gasp!) names all uppercase and begin with BOOST_.</li>
-            </ul>
-         </LI>
-      </ul>
-      <ul>
-         <li>
-            Choose meaningful names - explicit is better than implicit, and readability 
-            counts. There is a strong preference for clear and descriptive names, even if 
-            lengthy.</li>
-      </ul>
-      <ul>
-         <li>
-            Use exceptions to report errors where appropriate, and write code that is safe 
-            in the face of exceptions.</li>
-      </ul>
-      <ul>
-         <li>
-            Avoid exception-specifications. See <a href="#Exception-specification">exception-specification 
-               rationale</a>.</li>
-      </ul>
-      <ul>
-         <li>
-            Provide sample programs or confidence tests so potential users can see how to 
-            use your library.</li>
-      </ul>
-      <ul>
-         <li>
-            Provide a regression test program or programs which follow the <a href="test_policy.htm">
-               Test Policies and Protocols</a>.</li>
-      </ul>
-      <ul>
-         <li>
-            Although some boost members use proportional fonts, tabs, and unrestricted line 
-            lengths in their own code, boost's widely distributed source code should follow 
-            more conservative guidelines:
+            Note that developers should not provide a copy of
+            <code>LICENSE_1_0.txt</code> with their libraries: Boost
+            distributions already include a copy in the Boost root directory.<br>
+            &nbsp;
+          </li>
+          <li>A comment line referencing your library on the Boost web site. For
+          example:<br>
+            <br>
+
+            <code>//&nbsp; See http://www.boost.org/libs/foo/ for library home
+            page.</code><br>
+            <br>
+            where <code>foo</code> is the directory name (see below) for the
+            library. As well as aiding users who come across a Boost file
+            detached from its documentation, some of Boost's automatic tools
+            depend on this comment to identify which library header files belong
+            to.
+          </li>
+        </ul>
+      </li>
+
+    </ul>
+    <ul>
+      <li>Make sure your code compiles in the presence of the <code>min()</code>
+      and <code>max()</code> macros. Some platform headers define
+      <code>min()</code> and <code>max()</code> macros which cause some common
+      C++ constructs to fail to compile. Some simple tricks can protect your code
+      from inappropriate macro substitution:<br>
+
+        &nbsp;
+        <ul>
+          <li>If you want to call <code>std::min()</code> or
+          <code>std::max()</code>:<br>
+            &nbsp;
             <ul>
-               <li>
-                  Use fixed-width fonts.&nbsp; See <a href="#code_fonts">fonts rationale</a>.
-               <li>
-                  Use spaces rather than tabs. See <a href="#Tabs">tabs rationale</a>.
-               <li>
-                  Limit line lengths to 80 characters.</li>
+              <li>If you do not require argument-dependent look-up, use
+              <code>(std::min)(a,b)</code>.
+              </li>
+
+              <li style="list-style: none">
+                <br>
+              </li>
+              <li>If you do require argument-dependent look-up, you should:
+              </li>
+              <li style="list-style: none">
+                <br>
+                <ul>
+                  <li>
+
+                    <code>#include &lt;boost/config.hpp&gt;</code>
+                  </li>
+                  <li>Use <code>BOOST_USING_STD_MIN();</code> to bring
+                  <code>std::min()</code> into the current scope.
+                  </li>
+                  <li>Use <code>min BOOST_PREVENT_MACRO_SUBSTITUTION
+                  (a,b);</code> to make an argument-dependent call to
+                  <code>min(a,b)</code>.
+                  </li>
+
+                </ul>
+              </li>
             </ul>
-         </li>
-      </ul>
-      <ul>
-         <li>
-            End all documentation files (HTML or otherwise) with a copyright message and a 
-            licensing message. See the <a href="#Copyright">end of this file</a> for an 
-            example of the preferred form.</li>
-      </ul>
-      <ul>
-         <li>
-            Begin all source files (including programs, headers, scripts, etc.) with:
+          </li>
+          <li style="list-style: none">
             <br>
-            &nbsp;<ul>
-               <li>
-                  A comment line describing the contents of the file.<br>
-               &nbsp;
-               <li>
-                  Comments describing copyright and licensing. The preferred form is:<br>
-                  <br>
-                  <code>//&nbsp; Copyright Jane Programmer 2002. Use, modification, and distribution 
-                     are<br>
-                     //&nbsp; subject to the Boost Software License, Version 1.0. (See accompanying<br>
-                     //&nbsp; file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)<br>
-                  </code>
-                  <br>
-                  Please leave an empty line before and after the copyright and license comments. 
-                  It is fine if the copyright and license messages are on different lines, but 
-                  there should be no other intervening text. Do not include "All rights reserved" 
-                  in the copyright message.<br>
-                  <br>
-                  See <a href="license_info.html">license information page</a> for more 
-                  information about the Boost Software License.<br>
-                  <br>
-                  Note that developers should not include a copy of <code>LICENSE_1_0.txt</code> in 
-                  their libraries; Boost distributions already include a copy in the Boost root 
-                  directory.<br>
-               &nbsp;
-               <li>
-                  A comment line referencing your library on the Boost web site. For example:<br>
-                  <br>
-                  <code>//&nbsp; See http://www.boost.org/libs/foo for library home page.</code><br>
-                  <br>
-                  where <code>foo</code> is the directory name (see below) for your library. As 
-                  well as aiding users who come across a Boost file detached from its 
-                  documentation, some of Boost's automatic tools depend on this comment to 
-                  identify which library header files belong to.</li>
-            </ul>
-         </li>
-      </ul>
-      <ul>
-         <li>
-            Make sure your code compiles in the presence of the <code>min()</code> and <code>max()</code>
-            macros. Some platform headers define <code>min()</code> and <code>max()</code> macros which
-            cause some common C++ constructs to fail to compile. Some simple tricks can protect your code
-            from inappropriate macro substitution:<br>&nbsp;
-            <ul>
-               <li>
-                  If you want to call <code>std::min()</code> or <code>std::max()</code>:<br>&nbsp;
-                  <ul>
-                     <li>
-                        If you do not require argument-dependent look-up, use <code>(std::min)(a,b)</code>.
-                     </li>&nbsp;
-                     <li>
-                        If you do require argument-dependent look-up, you should:<br>&nbsp;
-                        <ul>
-                           <li><code>#include &lt;boost/config.hpp&gt;</code></li>&nbsp;
-                           <li>Use <code>BOOST_USING_STD_MIN();</code> to bring <code>std::min()</code> into
-                               the current scope.</li>&nbsp;
-                           <li>Use <code>min BOOST_PREVENT_MACRO_SUBSTITUTION (a,b);</code> to make an
-                               argument-dependent call to <code>min(a,b)</code>.</li>&nbsp;
-                        </ul>
-                     </li>
-                  </ul>&nbsp;
-               </li>
-               <li>
-                  If you want to call <code>std::numeric_limits&lt;int&gt;::max()</code>, use
-                  <code>(std::numeric_limits&lt;int&gt;::max)()</code> instead.<br>&nbsp;
-               </li>
-               <li>
-                  If you want to call a <code>min()</code> or <code>max()</code> member function,
-                  instead to doing <code>obj.min()</code>, use <code>(obj.min)()</code>.<br>&nbsp;
-               </li>
-               <li>
-                  If you want to declare or define a function or a member function named <code>min</code>
-                  or <code>max</code>, then you must use the <code>BOOST_PREVENT_MACRO_SUBSTITUTION</code>
-                  macro. Instead of writing <code>int min() { return 0; }</code> you should write
-                  <code>int min BOOST_PREVENT_MACRO_SUBSTITUTION () { return 0; }</code> This is true
-                  regardless if the function is a free (namespace scope) function, a member function or a
-                  static member function, and it applies for the function declaration as well as the
-                  function definition.<br>&nbsp;
-               </li>
-            </ul>
-         </li>
-      </ul>
-      <h3><a name="Directory_structure">Directory Structure</a> and Filenames</h3>
-      <ul>
-         <li>
-         File and directory names must contain only <b>lowercase</b> ASCII letters , numbers, 
-         underscores, and a period.&nbsp; Leading character must be alphabetic. Maximum 
-         length 31. Only a single period is permitted.&nbsp; These requirements ensure 
-         file and directory names are relatively portable.
-         <li>
-            Files intended to be processed by a C++ compiler as part
-            of a translation unit should have <b>a three-letter
-            extension ending in &quot;pp&quot;</b>.  Other files should
-            <i>not</i> use extensions ending in &quot;pp&quot;.  This
-            convention makes it easy to identify all of the C++ source
-            in Boost.</li>
-         <li>
-            All libraries have at their highest level a primary directory named for the 
-            particular library. See <a href="#Naming&shy;_consistency">Naming consistency</a>. 
-         The primary directory may have sub-directories.
-         <li>
-            For very simple libraries implemented entirely within the library header, all 
-            files go in the primary directory (except headers, which go in the boost header 
-            directory).</li>
-      </ul>
-      <blockquote>
-         <p><b>Boost standard sub-directory names</b></p>
-         <table border="1" cellpadding="5">
-            <tr>
-               <td><b>Sub-directory</b></td>
-               <td><b>Contents</b></td>
-               <td><b>Required</b></td>
-            </tr>
-            <tr>
-               <td><code>build</code></td>
-               <td>Library build files such as a Jamfile.</td>
-               <td>If any build files.</td>
-            </tr>
-            <tr>
-               <td><code>doc</code></td>
-               <td>Documentation (HTML) files.</td>
-               <td>If several doc files.</td>
-            </tr>
-            <tr>
-               <td><code>example</code></td>
-               <td>Sample program files.</td>
-               <td>If several sample files.</td>
-            </tr>
-            <tr>
-               <td><code>src</code></td>
-               <td>Source files which must be compiled to build the library.&nbsp;</td>
-               <td>If any source files.</td>
-            </tr>
-            <tr>
-               <td><code>test</code></td>
-               <td>Regression or other test programs or scripts.</td>
-               <td>If several test files.</td>
-            </tr>
-         </table>
-      </blockquote>
-      <h4><a name="Redirection">Redirection</a></h4>
-      <p>The primary directory should always contain a file named index.html (or 
-         index.htm). Authors have requested this so that they can publish URL's in the 
-         form <i>http://www.boost.org/libs/lib-name</i> with the assurance a 
-         documentation reorganization won't invalidate the URL. Boost's internal tools 
-         are also simplified by knowing that a library's documentation is always 
-         reachable via the simplified URL.</p>
-      <p>If the documentation is in a doc sub-directory, the primary directory 
-         index.html file should just do an automatic redirection to the doc 
-         subdirectory:</p>
-      <blockquote>
-         <pre>&lt;html&gt;
+          </li>
+          <li>If you want to call
+          <code>std::numeric_limits&lt;int&gt;::max()</code>, use
+          <code>(std::numeric_limits&lt;int&gt;::max)()</code> instead.
+          </li>
+
+          <li style="list-style: none">
+            <br>
+          </li>
+          <li>If you want to call a <code>min()</code> or <code>max()</code>
+          member function, instead to doing <code>obj.min()</code>, use
+          <code>(obj.min)()</code>.<br>
+
+          </li>
+          <li style="list-style: none">
+            <br>
+          </li>
+          <li>If you want to declare or define a function or a member function
+          named <code>min</code> or <code>max</code>, then you must use the
+          <code>BOOST_PREVENT_MACRO_SUBSTITUTION</code> macro. Instead of writing
+          <code>int min() { return 0; }</code> you should write <code>int min
+          BOOST_PREVENT_MACRO_SUBSTITUTION () { return 0; }</code><br>
+
+            This is true regardless if the function is a free (namespace scope)
+            function, a member function or a static member function, and it
+            applies for the function declaration as well as for the function
+            definition.<br>
+          </li>
+        </ul>
+      </li>
+    </ul>
+    <h3>
+      <a name="Directory_structure" id="Directory_structure">Directory
+      Structure</a> and Filenames
+    </h3>
+
+    <ul>
+      <li>File and directory names must contain only <b>lowercase</b> ASCII
+      letters , numbers, underscores, and a period.&nbsp; Leading character must
+      be alphabetic. Maximum length 31. Only a single period is permitted.&nbsp;
+      These requirements ensure file and directory names are relatively portable.
+      </li>
+      <li>Files intended to be processed by a C++ compiler as part of a
+      translation unit should have <b>a three-letter filename extension ending in
+      "pp"</b>. Other files should <i>not</i> use extensions ending in "pp". This
+      convention makes it easy to identify all of the C++ source in Boost.
+      </li>
+
+      <li>All libraries have at their highest level a primary directory named for
+      the particular library. See <a href="#Naming_consistency">Naming
+      consistency</a>. The primary directory may have sub-directories.
+      </li>
+      <li>For very simple libraries implemented entirely within the library
+      header, all files go in the primary directory (except headers, which go in
+      the boost header directory).
+      </li>
+    </ul>
+    <blockquote>
+      <p>
+        <b>Boost standard sub-directory names</b>
+
+      </p>
+      <table border="1" cellpadding="5">
+        <tr>
+          <td>
+            <b>Sub-directory</b>
+          </td>
+          <td>
+            <b>Contents</b>
+
+          </td>
+          <td>
+            <b>Required</b>
+          </td>
+        </tr>
+        <tr>
+          <td>
+            <code>build</code>
+
+          </td>
+          <td>
+            Library build files such as a Jamfile.
+          </td>
+          <td>
+            If any build files.
+          </td>
+        </tr>
+        <tr>
+          <td>
+
+            <code>doc</code>
+          </td>
+          <td>
+            Documentation (HTML) files.
+          </td>
+          <td>
+            If several doc files.
+          </td>
+        </tr>
+
+        <tr>
+          <td>
+            <code>example</code>
+          </td>
+          <td>
+            Sample program files.
+          </td>
+          <td>
+            If several sample files.
+          </td>
+
+        </tr>
+        <tr>
+          <td>
+            <code>src</code>
+          </td>
+          <td>
+            Source files which must be compiled to build the library.&nbsp;
+          </td>
+
+          <td>
+            If any source files.
+          </td>
+        </tr>
+        <tr>
+          <td>
+            <code>test</code>
+          </td>
+          <td>
+
+            Regression or other test programs or scripts.
+          </td>
+          <td>
+            If several test files.
+          </td>
+        </tr>
+      </table>
+    </blockquote>
+    <h4>
+      <a name="Redirection" id="Redirection">Redirection</a>
+
+    </h4>
+    <p>
+      The primary directory should always contain a file named index.html (or
+      index.htm). Authors have requested this so that they can publish URL's in
+      the form <i>http://www.boost.org/libs/lib-name</i> with the assurance a
+      documentation reorganization won't invalidate the URL. Boost's internal
+      tools are also simplified by knowing that a library's documentation is
+      always reachable via the simplified URL.
+    </p>
+    <p>
+      If the documentation is in a doc sub-directory, the primary directory
+      index.html file should just do an automatic redirection to the doc
+      subdirectory:
+    </p>
+    <blockquote>
+
+      <pre>
+&lt;html&gt;
 &lt;head&gt;
 &lt;meta http-equiv="refresh" content="0; URL=doc/index.html"&gt;
 &lt;/head&gt;
 &lt;body&gt;
 Automatic redirection failed, please go to
 &lt;a href="doc/index.html"&gt;doc/index.html&lt;/a&gt;
+
 &lt;/body&gt;
-&lt;/html&gt;</pre>
-      </blockquote>
-      <h3><a name="Naming&shy;_consistency">Naming consistency</a></h3>
-      <p>As library developers and users have gained experience with Boost, the 
-         following consistent naming approach has come to be viewed as very helpful, 
-         particularly for larger libraries that need their own header subdirectories 
-         and namespaces.</p>
-      <p>Here is how it works. The library is given a name that describes the contents 
-         of the library. Cryptic abbreviations are strongly discouraged. Following the 
-         practice of the C++ Standard Library, names are usually singular rather than 
-         plural. For example, a library dealing with file systems might chose the 
-         name "filesystem", but not "filesystems", "fs" or "nicecode".</p>
-      <ul>
-         <li>
-            The library's primary directory (in parent <i>boost-root/libs</i>) is given 
-            that same name.&nbsp; For example, <i>boost-root/libs/filesystem</i>.<br>
-         &nbsp;
-         <li>
-            The library's primary header directory (in parent <i>boost-root/boost</i>) is 
-            given that same name. For example, <i>boost-root/boost/filesystem</i>.<br>
-         &nbsp;
-         <li>
-            The library's primary namespace (in parent <i>::boost</i>) is given that same 
-            name, except when there's a component with that name (e.g., <i>boost::tuple</i>), in which case the namespace name is pluralized. For example, <i>::boost::filesystem</i>.</li>
-      </ul>
+&lt;/html&gt;
+</pre>
+    </blockquote>
+    <h3>
+      <a name="Naming_consistency">Naming consistency</a>
+    </h3>
+    <p>
+      As library developers and users have gained experience with Boost, the
+      following consistent naming approach has come to be viewed as very helpful,
+      particularly for larger libraries that need their own header subdirectories
+      and namespaces.
+    </p>
 
-    <p>When documenting Boost libraries, follow these conventions (see also the following section of this document):
+    <p>
+      Here is how it works. The library is given a name that describes the
+      contents of the library. Cryptic abbreviations are strongly discouraged.
+      Following the practice of the C++ Standard Library, names are usually
+      singular rather than plural. For example, a library dealing with file
+      systems might chose the name "filesystem", but not "filesystems", "fs" or
+      "nicecode".
+    </p>
     <ul>
-      <li>The library name is set in roman type.</li>
-      <li>The library name is capitalized.</li>
-      <li>A period between "Boost" and the library name (e.g., Boost.Bind) is used if and only if the library name is not followed by the word "library".</li>
-      <li>The word "library" is not part of the library name and is therefore lowercased.</li>
+      <li>The library's primary directory (in parent <i>boost-root/libs</i>) is
+      given that same name.&nbsp; For example,
+      <i>boost-root/libs/filesystem</i>.<br>
+        &nbsp;
+
+      </li>
+      <li>The library's primary header directory (in parent
+      <i>boost-root/boost</i>) is given that same name. For example,
+      <i>boost-root/boost/filesystem</i>.<br>
+        &nbsp;
+      </li>
+      <li>The library's primary namespace (in parent <i>::boost</i>) is given
+      that same name, except when there's a component with that name (e.g.,
+      <i>boost::tuple</i>), in which case the namespace name is pluralized. For
+      example, <i>::boost::filesystem</i>.
+      </li>
+
     </ul>
-    <p>Here are a few examples of how to apply these conventions:
+    <p>
+      When documenting Boost libraries, follow these conventions (see also the
+      following section of this document):
+    </p>
     <ul>
-      <li>Boost.Bind was written by Peter Dimov.</li>
-      <li>The Boost Bind library was written by Peter Dimov.</li>
-      <li>I regularly use Bind, a Boost library written by Peter Dimov.</li>
+      <li>The library name is set in roman type.
+      </li>
+      <li>The library name is capitalized.
+      </li>
+      <li>A period between "Boost" and the library name (e.g., Boost.Bind) is
+      used if and only if the library name is not followed by the word "library".
+      </li>
+
+      <li>The word "library" is not part of the library name and is therefore
+      lowercased.
+      </li>
     </ul>
+    <p>
+      Here are a few examples of how to apply these conventions:
+    </p>
+    <ul>
+      <li>Boost.Bind was written by Peter Dimov.
+      </li>
+      <li>The Boost Bind library was written by Peter Dimov.
+      </li>
 
-      <h3><a name="Documentation">Documentation</a></h3>
-      <p>Even the simplest library needs some documentation; the amount should be 
-         proportional to the need.&nbsp; The documentation should assume the readers 
-         have a basic knowledge of C++, but are not necessarily experts.</p>
-      <p>The format for documentation should be HTML, and should not require an advanced 
-         browser or server-side extensions. Style sheets are acceptable. 
-         ECMAScript/JavaScript is not acceptable. The documentation entry point should 
-         always be a file named index.html or index.htm; see <a href="#Redirection">Redirection</a>.</p>
-      <p>There is no single right way to do documentation. HTML documentation is often 
-         organized quite differently from traditional printed documents. Task-oriented 
-         styles differ from reference oriented styles. In the end, it comes down to the 
-         question: Is the documentation sufficient for the mythical "average" C++ 
-         programmer to use the library successfully?</p>
-      <p>Appropriate topics for documentation often include:
-         <ul>
-            <li>
-            General introduction to the library.
-            <li>
-            Description of each class.
-            <li>
-            Relationship between classes.
-            <li>
-            For each function, as applicable, description, requirements (preconditions), 
-            effects, post-conditions, returns, and throws.
-            <li>
-            Discussion of error detection and recovery strategy.
-            <li>
-            How to use including description of typical uses.
-            <li>
-            How to compile and link.
-            <li>
-            How to test.
-            <li>
-            Version or revision history.
-            <li>
-               Rationale for design decisions.&nbsp; See <a href="#Rationale">Rationale rationale</a>.
-            <li>
-               Acknowledgements.&nbsp; See <a href="#Acknowledgements">Acknowledgments rationale.</a></li>
-         </ul>
-      <p>If you need more help with how to write documentation you can check out the 
-         article on <a href="writingdoc/index.html">Writing Documentation for Boost</a>.</p>
-      <h2><a name="Rationale">Rationale</a></h2>
-      <p>Rationale for some of the requirements and guidelines follows.</p>
-      <hr>
-      <h3><a name="Exception-specification">Exception-specification</a> rationale</h3>
-      <p>Exception specifications [ISO 15.4] are sometimes coded to indicate what 
-         exceptions may be thrown, or because the programmer hopes they will improved 
-         performance.&nbsp; But consider the following member from a smart pointer:</p>
-      <pre>    T&amp; operator*() const throw()  { return *ptr; }</pre>
-      <p>This function calls no other functions; it only manipulates fundamental data 
-         types like pointers Therefore, no runtime behavior of the 
-         exception-specification can ever be invoked.&nbsp; The function is completely 
-         exposed to the compiler; indeed it is declared inline Therefore, a smart 
-         compiler can easily deduce that the functions are incapable of throwing 
-         exceptions, and make the same optimizations it would have made based on the 
-         empty exception-specification. A "dumb" compiler, however, may make all kinds 
-         of pessimizations.</p>
-      <p>For example, some compilers turn off inlining if there is an 
-         exception-specification.&nbsp; Some compilers add try/catch blocks. Such 
-         pessimizations can be a performance disaster which makes the code unusable in 
-         practical applications.</p>
-      <p>Although initially appealing, an exception-specification tends to have 
-         consequences that require <b>very</b> careful thought to understand. The 
-         biggest problem with exception-specifications is that programmers use them as 
-         though they have the effect the programmer would like, instead of the effect 
-         they actually have.</p>
-      <p>A non-inline function is the one place a "throws nothing" 
-         exception-specification may have some benefit with some compilers.</p>
-      <hr>
-      <h3><a name="Naming">Naming</a> conventions rationale</h3>
-      <p>The C++ standard committee's Library Working Group discussed this issue in 
-         detail, and over a long period of time. The discussion was repeated again in 
-         early boost postings. A short summary:</p>
-      <ul>
-         <li>
-         Naming conventions are contentious, and although several are widely used, no 
-         one style predominates.
-         <li>
-         Given the intent to propose portions of boost for the next revision of the C++ 
-         standard library, boost decided to follow the standard library's conventions.
-         <li>
-            Once a library settles on a particular convention, a vast majority of 
-            stakeholders want that style to be consistently used.
-         </li>
-      </ul>
-      <hr>
-      <h3>Source <a name="code_fonts">code fonts</a> rationale</h3>
-      <p>Dave Abrahams comments: An important purpose (I daresay the primary purpose) of 
-         source code is communication: the documentation of intent. This is a doubly 
-         important goal for boost, I think. Using a fixed-width font allows us to 
-         communicate with more people, in more ways (diagrams are possible) right there 
-         in the source. Code written for fixed-width fonts using spaces will read 
-         reasonably well when viewed with a variable-width font, and as far as I can 
-         tell every editor supporting variable-width fonts also supports fixed width. I 
-         don't think the converse is true.</p>
-      <hr>
-      <h3><a name="Tabs">Tabs</a> rationale</h3>
-      <p>Tabs are banned because of the practical problems caused by tabs in 
-         multi-developer projects like Boost, rather than any dislike in principle. See <a href="mailing_lists.htm#archive">
-            mailing list archives</a>. Problems include maintenance of a single source 
-         file by programmers using tabs and programmers using spaces, and the difficulty 
-         of enforcing a consistent tab policy other than just "no tabs". Discussions 
-         concluded that Boost files should either all use tabs, or all use spaces, and 
-         thus the decision to stick with spaces.</p>
-      <hr>
-      <h3>ECMAScript/<a name="JavaScript">JavaScript</a> rationale</h3>
-      <p>Before the 1.29.0 release, two Boost libraries added ECMAScript/JavaScript 
-         documentation. Controversy followed (see <a href="mailing_lists.htm#archive">mailing 
-            list archives</a>), and the developers were asked to remove the 
-         ECMAScript/JavaScript. Reasons given for banning included:</p>
-      <ul>
-         <li>
-         Incompatible with some older browsers and some text based browsers.
-         <li>
-         Makes printing docs pages difficult.
-         <li>
-         Often results in really bad user interface design.
-         <li>
-         "It's just annoying in general."
-         <li>
-         Would require Boost to test web pages for ECMAScript/JavaScript compliance.
-         <li>
-            Makes docs maintenance by other than the original developer more difficult.</li>
-      </ul>
-      <hr>
-      <h3><a name="Rationale_rationale">Rationale rationale</a></h3>
-      <p>Rationale is defined as "The fundamental reasons for something; basis" by the 
-         American Heritage Dictionary.</p>
-      <p>Beman Dawes comments:&nbsp; Failure to supply contemporaneous rationale for 
-         design decisions is a major defect in many software projects. Lack of accurate 
-         rationale causes issues to be revisited endlessly, causes maintenance bugs when 
-         a maintainer changes something without realizing it was done a certain way for 
-         some purpose, and shortens the useful lifetime of software.</p>
-      <p>Rationale is fairly easy to provide at the time decisions are made, but very 
-         hard to accurately recover even a short time later.</p>
-      <hr>
-      <h3><a name="Acknowledgements">Acknowledgements</a> rationale</h3>
-      <p>As a library matures, it almost always accumulates improvements suggested to 
-         the authors by other boost members.&nbsp; It is a part of the culture of 
-         boost.org to acknowledge such contributions, identifying the person making the 
-         suggestion.&nbsp; Major contributions are usually acknowledged in the 
-         documentation, while minor fixes are often mentioned in comments within the 
-         code itself.</p>
-      <hr>
-      <p>Revised 
-         <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan --> 
-         04 November, 2003<!--webbot bot="Timestamp" endspan i-checksum="39359" --></p>
-      <p>
-         © <a name="Copyright">Copyright</a> Beman Dawes 2003.</p>
-    <p> Distributed under the Boost Software License, Version 1.0. 
-    (See accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or 
-    copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
+      <li>I regularly use Bind, a Boost library written by Peter Dimov.
+      </li>
+    </ul>
+    <h3>
+      <a name="Documentation" id="Documentation">Documentation</a>
+    </h3>
+    <p>
+      Even the simplest library needs some documentation; the amount should be
+      proportional to the need.&nbsp; The documentation should assume the readers
+      have a basic knowledge of C++, but are not necessarily experts.
     </p>
-   </body>
+
+    <p>
+      The format for documentation should be HTML, and should not require an
+      advanced browser or server-side extensions. Style sheets are acceptable.
+      ECMAScript/JavaScript is not acceptable. The documentation entry point
+      should always be a file named index.html or index.htm; see <a href=
+      "#Redirection">Redirection</a>.
+    </p>
+    <p>
+      There is no single right way to do documentation. HTML documentation is
+      often organized quite differently from traditional printed documents.
+      Task-oriented styles differ from reference oriented styles. In the end, it
+      comes down to the question: Is the documentation sufficient for the
+      mythical "average" C++ programmer to use the library successfully?
+    </p>
+    <p>
+      Appropriate topics for documentation often include:
+    </p>
+
+    <ul>
+      <li>General introduction to the library.
+      </li>
+      <li>Description of each class.
+      </li>
+      <li>Relationship between classes.
+      </li>
+      <li>For each function, as applicable, description, requirements
+      (preconditions), effects, post-conditions, returns, and throws.
+      </li>
+      <li>Discussion of error detection and recovery strategy.
+      </li>
+
+      <li>How to use including description of typical uses.
+      </li>
+      <li>How to compile and link.
+      </li>
+      <li>How to test.
+      </li>
+      <li>Version or revision history.
+      </li>
+      <li>Rationale for design decisions.&nbsp; See <a href=
+      "#Rationale">Rationale rationale</a>.
+      </li>
+
+      <li>Acknowledgements.&nbsp; See <a href="#Acknowledgements">Acknowledgments
+      rationale.</a>
+      </li>
+    </ul>
+    <p>
+      If you need more help with how to write documentation you can check out the
+      article on <a href="writingdoc/index.html">Writing Documentation for
+      Boost</a>.
+    </p>
+
+    <h2>
+      <a name="Rationale" id="Rationale">Rationale</a>
+    </h2>
+    <p>
+      Rationale for some of the requirements and guidelines follows.
+    </p>
+    <hr>
+    <h3>
+      <a name="Exception-specification" id=
+      "Exception-specification">Exception-specification</a> rationale
+    </h3>
+
+    <p>
+      Exception specifications [ISO 15.4] are sometimes coded to indicate what
+      exceptions may be thrown, or because the programmer hopes they will
+      improved performance.&nbsp; But consider the following member from a smart
+      pointer:
+    </p>
+    <pre>
+    T&amp; operator*() const throw()  { return *ptr; }
+</pre>
+    <p>
+      This function calls no other functions; it only manipulates fundamental
+      data types like pointers Therefore, no runtime behavior of the
+      exception-specification can ever be invoked.&nbsp; The function is
+      completely exposed to the compiler; indeed it is declared inline Therefore,
+      a smart compiler can easily deduce that the functions are incapable of
+      throwing exceptions, and make the same optimizations it would have made
+      based on the empty exception-specification. A "dumb" compiler, however, may
+      make all kinds of pessimizations.
+    </p>
+
+    <p>
+      For example, some compilers turn off inlining if there is an
+      exception-specification.&nbsp; Some compilers add try/catch blocks. Such
+      pessimizations can be a performance disaster which makes the code unusable
+      in practical applications.
+    </p>
+    <p>
+      Although initially appealing, an exception-specification tends to have
+      consequences that require <b>very</b> careful thought to understand. The
+      biggest problem with exception-specifications is that programmers use them
+      as though they have the effect the programmer would like, instead of the
+      effect they actually have.
+    </p>
+    <p>
+
+      A non-inline function is the one place a "throws nothing"
+      exception-specification may have some benefit with some compilers.
+    </p>
+    <hr>
+    <h3>
+      <a name="Naming" id="Naming">Naming</a> conventions rationale
+    </h3>
+    <p>
+      The C++ standard committee's Library Working Group discussed this issue in
+      detail, and over a long period of time. The discussion was repeated again
+      in early boost postings. A short summary:
+    </p>
+
+    <ul>
+      <li>Naming conventions are contentious, and although several are widely
+      used, no one style predominates.
+      </li>
+      <li>Given the intent to propose portions of boost for the next revision of
+      the C++ standard library, boost decided to follow the standard library's
+      conventions.
+      </li>
+      <li>Once a library settles on a particular convention, a vast majority of
+      stakeholders want that style to be consistently used.
+      </li>
+    </ul>
+    <hr>
+    <h3>
+
+      Source <a name="code_fonts" id="code_fonts">code fonts</a> rationale
+    </h3>
+    <p>
+      Dave Abrahams comments: An important purpose (I daresay the primary
+      purpose) of source code is communication: the documentation of intent. This
+      is a doubly important goal for boost, I think. Using a fixed-width font
+      allows us to communicate with more people, in more ways (diagrams are
+      possible) right there in the source. Code written for fixed-width fonts
+      using spaces will read reasonably well when viewed with a variable-width
+      font, and as far as I can tell every editor supporting variable-width fonts
+      also supports fixed width. I don't think the converse is true.
+    </p>
+    <hr>
+    <h3>
+      <a name="Tabs" id="Tabs">Tabs</a> rationale
+    </h3>
+
+    <p>
+      Tabs are banned because of the practical problems caused by tabs in
+      multi-developer projects like Boost, rather than any dislike in principle.
+      See <a href="mailing_lists.htm#archive">mailing list archives</a>. Problems
+      include maintenance of a single source file by programmers using tabs and
+      programmers using spaces, and the difficulty of enforcing a consistent tab
+      policy other than just "no tabs". Discussions concluded that Boost files
+      should either all use tabs, or all use spaces, and thus the decision to
+      stick with spaces.
+    </p>
+    <hr>
+    <h3>
+      ECMAScript/<a name="JavaScript" id="JavaScript">JavaScript</a> rationale
+    </h3>
+
+    <p>
+      Before the 1.29.0 release, two Boost libraries added ECMAScript/JavaScript
+      documentation. Controversy followed (see <a href=
+      "mailing_lists.htm#archive">mailing list archives</a>), and the developers
+      were asked to remove the ECMAScript/JavaScript. Reasons given for banning
+      included:
+    </p>
+    <ul>
+      <li>Incompatible with some older browsers and some text based browsers.
+      </li>
+      <li>Makes printing docs pages difficult.
+      </li>
+      <li>Often results in really bad user interface design.
+      </li>
+
+      <li>"It's just annoying in general."
+      </li>
+      <li>Would require Boost to test web pages for ECMAScript/JavaScript
+      compliance.
+      </li>
+      <li>Makes docs maintenance by other than the original developer more
+      difficult.
+      </li>
+    </ul>
+    <hr>
+    <h3>
+      <a name="Rationale_rationale" id="Rationale_rationale">Rationale
+      rationale</a>
+
+    </h3>
+    <p>
+      Rationale is defined as "The fundamental reasons for something; basis" by
+      the American Heritage Dictionary.
+    </p>
+    <p>
+      Beman Dawes comments:&nbsp; Failure to supply contemporaneous rationale for
+      design decisions is a major defect in many software projects. Lack of
+      accurate rationale causes issues to be revisited endlessly, causes
+      maintenance bugs when a maintainer changes something without realizing it
+      was done a certain way for some purpose, and shortens the useful lifetime
+      of software.
+    </p>
+    <p>
+      Rationale is fairly easy to provide at the time decisions are made, but
+      very hard to accurately recover even a short time later.
+    </p>
+
+    <hr>
+    <h3>
+      <a name="Acknowledgements" id="Acknowledgements">Acknowledgements</a>
+      rationale
+    </h3>
+    <p>
+      As a library matures, it almost always accumulates improvements suggested
+      to the authors by other boost members.&nbsp; It is a part of the culture of
+      boost.org to acknowledge such contributions, identifying the person making
+      the suggestion.&nbsp; Major contributions are usually acknowledged in the
+      documentation, while minor fixes are often mentioned in comments within the
+      code itself.
+    </p>
+
+    <hr>
+    <p>
+      Revised 
+      <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->
+      04 November, 2003<!--webbot bot="Timestamp" endspan i-checksum="39359" -->
+    </p>
+    <p>
+      &copy; <a name="Copyright" id="Copyright">Copyright</a> Beman Dawes 2003.
+    </p>
+
+    <p>
+      Distributed under the Boost Software License, Version 1.0. (See
+      accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+      at <a href=
+      "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
+    </p>
+  </body>
 </html>

Modified: boost/trunk/more/library_reuse.htm
===================================================================
--- boost/trunk/more/library_reuse.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/library_reuse.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 
 <head>
@@ -65,10 +66,9 @@
 <hr>
 <p>Revised <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B %Y" startspan -->02 October 2003<!--webbot bot="Timestamp" endspan i-checksum="32277" --></p>
 <p>© Copyright Beman Dawes 2000</p>
-<p> Use, modification, and distribution are subject to the Boost Software 
-License, Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a>)</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See
+accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+at <a href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</p>
 
 </body>
 

Modified: boost/trunk/more/license_info.html
===================================================================
--- boost/trunk/more/license_info.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/license_info.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 
 <head>
@@ -4,13 +5,14 @@
 <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">
+<meta http-equiv="Content-Type" content="text/html">
 <title>Boost Software License Background</title>
 </head>
 
 <body bgcolor="#FFFFFF">
 
-<table border="1" bgcolor="#007F7F" cellpadding="2">
+<table summary="Navigational header"
+ border="1" bgcolor="#007F7F" cellpadding="2">
   <tr>
     <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
     <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
@@ -139,15 +141,21 @@
 <p><b>How should Boost programmers apply the license to source and
 header files?</b></p>
 
-<p>Include a comment based on the following template, substituting
+<p>Add a comment based on the following template, substituting
 appropriate text for the italicized portion:
-
+<br>
+<br>
 <pre>
-// Copyright <i>2004 Joe Coder</i>.
-// Distributed under the 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 <i>Joe Coder 2004 - 2006</i>.
+// Distributed under the Boost Software License, Version 1.0.
+//    (See accompanying file LICENSE_1_0.txt or copy at
+//          http://www.boost.org/LICENSE_1_0.txt)
 </pre>
+<br>
+Please leave an empty line before and after the above comment block. 
+It is fine if the copyright and license messages are not on different lines; in
+no case there should be other intervening text. Do not include
+"All rights reserved" anywhere.<br>
 
 <p>Other ways of licensing source files have been considered, but some
 of them turned out to unintentionally nullify legal elements of the
@@ -156,6 +164,17 @@
 Creativity in license reference language is strongly discouraged, but
 judicious changes in the use of whitespace are fine.
 
+<p><b>How should the license be applied to documentation files, instead?</b></p>
+
+<p>Very similarly to the way it is applied to source files: the user should
+see the very same text indicated in the template above, with the only difference
+that both the local and the web copy of LICENSE_1_0.txt should be linked to.
+Refer to the HTML source code of this page in case of doubt.
+
+<p>Note that the location of the local LICENSE_1_0.txt needs to be indicated
+relatively to the position of your documentation file
+(<code>../LICENSE_1_0.txt</code>, <code>../../LICENSE_1_0.txt</code> etc.)</p>
+
 <p><b>How is the Boost license different from the
 <a href="http://www.opensource.org/licenses/gpl-license.php">GNU General Public 
 License (GPL)</a>?</b></p>
@@ -215,7 +234,6 @@
 
 <p><b>Do I have to copyright/license trivial files?</b>  
 
-
 <p>Even a test file that just contains an empty <code>main()</code>
 should have a copyright.  Files without copyrights make corporate
 lawyers nervous, and that's a barrier to adoption.  The more of Boost
@@ -251,7 +269,7 @@
 <p>Revised
 <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->27 August, 2004<!--webbot bot="Timestamp" endspan i-checksum="39365" --></p>
 
-<p> © Copyright 2003-2004 Beman Dawes, Daniel Frey, David Abrahams.</p>
+<p> &copy; Copyright 2003-2004 Beman Dawes, Daniel Frey, David Abrahams.</p>
 <p> Distributed under the Boost Software License, Version 1.0. 
 (See accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or 
 copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)

Modified: boost/trunk/more/links.htm
===================================================================
--- boost/trunk/more/links.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/links.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 
 <head>
@@ -63,9 +64,10 @@
 <p>Revised
 <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->02 October, 2004<!--webbot bot="Timestamp" endspan i-checksum="38677" --></p>
 <p>© Copyright Beman Dawes 2002</p>
-<p>Use, modification, and distribution are subject to the Boost Software License, 
-Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at
-<a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying
+file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at
+<a href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)
+</p>
 
 </body>
 

Modified: boost/trunk/more/mailing_lists.htm
===================================================================
--- boost/trunk/more/mailing_lists.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/mailing_lists.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -40,7 +40,8 @@
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
-  <table border="1" bgcolor="#007F7F" cellpadding="2">
+  <table summary="Navigational header"
+	border="1" bgcolor="#007F7F" cellpadding="2">
     <tr>
       <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
       "boost.png (6897 bytes)" width="277" height="86"></td>
@@ -73,7 +74,7 @@
 
   <p>Access to Boost mailing lists via newsgroup (NNTP) is contributed by
   <a href="http://www.gmane.org/">GMANE</a>.</p><a name="gmane_post" id=
-  "gmane_post"></a><a name="important notes" id="important_notes"></a>
+  "gmane_post"></a><a name="important_notes" id="important_notes"></a>
 
   <div class="admonition-note admonition">
     <p class="first admonition-title">Before Posting</p>
@@ -212,12 +213,12 @@
   mailing list archive</a> has been generously contributed to the <a href=
   "http://aspn.activestate.com">ActiveState Programmer Network</a> by
   <a href="http://aspn.activestate.com">ActiveState Corporation</a>. <a href=
-  "http://aspn.activestate.com"><img align="top" src=
+  "http://aspn.activestate.com"><img alt="ASPN logo" align="top" src=
   "http://www.activestate.com/img/ASPN_logo_smallest.gif" width="65" height=
-  "20"></a><a href="http://www.activestate.com"><img align="top" src=
-  "http://aspn.activestate.com/ASPN/img/ASLogo_57x25.gif" width="57" height=
-  "25"></a></p>Other archives of Boost messages include the <a href=
-  "http://news.gmane.org/thread.php?group=gmane.comp.lib.boost.devel">Boost
+  "20"></a><a href="http://www.activestate.com"><img alt="Active State logo"
+	 align="top" src="http://aspn.activestate.com/ASPN/img/ASLogo_57x25.gif"
+	 width="57" height= "25"></a></p>Other archives of Boost messages include the
+	 <a href="http://news.gmane.org/thread.php?group=gmane.comp.lib.boost.devel">Boost
   GMane NNTP Archive</a>, <a href=
   "http://www.mail-archive.com/boost%40lists.boost.org/">The Mail
   Archive</a>, <a
@@ -391,9 +392,8 @@
 
   <p>Copyright Beman Dawes and David Abrahams 2001-2005</p>
 
-  <p>Use, modification, and distribution are subject to the Boost Software
-  License, Version 1.0. (See accompanying file <a href=
-  "../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at <a href=
-  "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
+  <p>Distributed under the Boost Software License, Version 1.0. (See
+     accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+     at <a href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
 </html>

Modified: boost/trunk/more/microsoft_vcpp.html
===================================================================
--- boost/trunk/more/microsoft_vcpp.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/microsoft_vcpp.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,79 +1,85 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<title>Portability Hints: Microsoft Visual C++ 6.0 SP4</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Portability Hints: Microsoft Visual C++ 6.0 SP4</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-<table border="1" bgcolor="#007F7F" cellpadding="2">
-  <tr>
-    <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-    <td><a href="../index.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>Home</big></font></a></td>
-    <td><a href="../libs/libraries.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>Libraries</big></font></a></td>
-    <td><a href="../people/people.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>People</big></font></a></td>
-    <td><a href="faq.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>FAQ</big></font></a></td>
-    <td><a href="index.htm"><font face="Arial,Helvetica" color="#FFFFFF"><big>More</big></font></a></td>
-  </tr>
-</table>
+      <td><a href="../index.htm"><font face="Arial,Helvetica" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-<p>
+      <td><a href="../libs/libraries.htm"><font face="Arial,Helvetica" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
 
-<h1>Portability Hints: Microsoft Visual C++ 6.0 SP4</h1>
+      <td><a href="../people/people.htm"><font face="Arial,Helvetica" color=
+      "#FFFFFF"><big>People</big></font></a></td>
 
-Similar to the
-<a href="borland_cpp.html">portability hints for Borland C++</a>,
-this page provides hints on some language features of the Microsoft Visual C++
-version 6.0 service pack 4 compiler.  A list of
-acknowledged deficiencies can be found at the
-<a href="http://support.microsoft.com/support/kb/articles/q243/4/51.asp">Microsoft support site</a>.
-<p>
+      <td><a href="faq.htm"><font face="Arial,Helvetica" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
 
-Each entry in the following list describes a particular issue,
-complete with sample source code to demonstrate the effect.
-Most sample code herein has been verified to compile with gcc 2.95.2
-and Comeau C++ 4.2.44.
+      <td><a href="index.htm"><font face="Arial,Helvetica" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
 
+  <h1>Portability Hints: Microsoft Visual C++ 6.0 SP4</h1>
 
-<h2>Preprocessor symbol</h2>
+  <p>Similar to the <a href="borland_cpp.html">portability hints for Borland
+  C++</a>, this page provides hints on some language features of the
+  Microsoft Visual C++ version 6.0 service pack 4 compiler. A list of
+  acknowledged deficiencies can be found at the <a href=
+  "http://support.microsoft.com/support/kb/articles/q243/4/51.asp">Microsoft
+  support site</a>.</p>
 
-The preprocessor symbol <code>_MSC_VER</code> is defined for all
-Microsoft C++ compilers.  Its value is the internal version number of the
-compiler interpreted as a decimal number.  Since a few other compilers
-also define this symbol, boost provides the symbol
-<code>BOOST_MSVC</code>, which is defined in
-<a href="../boost/config.hpp">boost/config.hpp</a>
-to the value of _MSC_VER if and only if the compiler is really
-Microsoft Visual C++.
+  <p>Each entry in the following list describes a particular issue, complete
+  with sample source code to demonstrate the effect. Most sample code herein
+  has been verified to compile with gcc 2.95.2 and Comeau C++ 4.2.44.</p>
 
-The following table lists some known values.
-<p>
+  <h2>Preprocessor symbol</h2>
 
-<table border="1">
-<tr>
-<th>Compiler</th>
-<th><code>BOOST_MSVC</code> value</th>
-</tr>
+  <p>The preprocessor symbol <code>_MSC_VER</code> is defined for all
+  Microsoft C++ compilers. Its value is the internal version number of the
+  compiler interpreted as a decimal number. Since a few other compilers also
+  define this symbol, boost provides the symbol <code>BOOST_MSVC</code>,
+  which is defined in <a href="../boost/config.hpp">boost/config.hpp</a> to
+  the value of _MSC_VER if and only if the compiler is really Microsoft
+  Visual C++. The following table lists some known values.</p>
 
-<tr>
-<td>Microsoft Visual C++ 6.0 (up to SP6)</td>
-<td>1200</td>
-</tr>
+  <table border="1" summary="">
+    <tr>
+      <th>Compiler</th>
 
-<tr>
-<td>Microsoft embedded Visual C++ 4.0</td>
-<td>1200-1202 (cross compilers)</td>
-</tr>
+      <th><code>BOOST_MSVC</code> value</th>
+    </tr>
 
-</table>
+    <tr>
+      <td>Microsoft Visual C++ 6.0 (up to SP6)</td>
 
+      <td>1200</td>
+    </tr>
 
-<h2>Core Language</h2>
+    <tr>
+      <td>Microsoft embedded Visual C++ 4.0</td>
 
-<h3>[chained using] Chaining <code>using</code>-declarations</h3>
+      <td>1200-1202 (cross compilers)</td>
+    </tr>
+  </table>
 
-Chaining <code>using</code>-declarations does not work.
-<pre>
+  <h2>Core Language</h2>
+
+  <h3>[chained using] Chaining <code>using</code>-declarations</h3>
+
+  <p>Chaining <code>using</code>-declarations does not work.</p>
+  <pre>
 void f();
 
 namespace N {
@@ -86,39 +92,33 @@
 }
 </pre>
 
+  <h3>[explicit-instantiation] Explicit function template instantiation</h3>
 
-<h3>[explicit-instantiation] Explicit function template
-instantiation</h3>
-
-Trying to explicitly instantiate a function template leads to the
-wrong function being called silently.
-
-<pre>
+  <p>Trying to explicitly instantiate a function template leads to the wrong
+  function being called silently.</p>
+  <pre>
 #include &lt;stdio.h&gt;
 
 template&lt;class T&gt;
 void f()
 {
-  printf(&quot;%d\n&quot;, sizeof(T));
+  printf("%d\n", sizeof(T));
 }
 
 int main()
 {
-  f&lt;double&gt;();      // output: &quot;1&quot;
-  f&lt;char&gt;();        // output: &quot;1&quot;
+  f&lt;double&gt;();      // output: "1"
+  f&lt;char&gt;();        // output: "1"
   return 0;
 }
 </pre>
 
+  <h3>[for-scoping] Scopes of definitions in for-loops</h3>
 
-<h3>[for-scoping] Scopes of definitions in for-loops</h3>
-
-The scope of variable definitions in <code>for</code> loops should be
-local to the loop's body, but it is instead local to the enclosing
-block.
-
-
-<pre>
+  <p>The scope of variable definitions in <code>for</code> loops should be
+  local to the loop's body, but it is instead local to the enclosing
+  block.</p>
+  <pre>
 int main()
 {
   for(int i = 0; i &lt; 5; ++i)
@@ -129,51 +129,46 @@
 }
 </pre>
 
-<strong>Workaround:</strong> Enclose the offending <code>for</code>
-loops in another pair of curly braces.
-<p>
-Another possible workaround (brought to my attention by Vesa Karvonen)
-is this:
-<pre>
+  <p><strong>Workaround:</strong> Enclose the offending <code>for</code>
+  loops in another pair of curly braces.</p>
+
+  <p>Another possible workaround (brought to my attention by Vesa Karvonen)
+  is this:</p>
+  <pre>
 #ifndef for
 #define for if (0) {} else for
 #endif
 </pre>
 
-Note that platform-specific inline functions in included headers might
-depend on the old-style <code>for</code> scoping.
+  <p>Note that platform-specific inline functions in included headers might
+  depend on the old-style <code>for</code> scoping.</p>
 
+  <h3>[inclass-member-init] In-class member initialization</h3>
 
-<h3>[inclass-member-init] In-class member initialization</h3>
-
-In-class member initialization, required to implement a
-Standard-conforming <code>std::numeric_limits</code> template, does
-not work.
-
-<pre>
+  <p>In-class member initialization, required to implement a
+  Standard-conforming <code>std::numeric_limits</code> template, does not
+  work.</p>
+  <pre>
 struct A
 {
-  static const int i = 5;      // &quot;invalid syntax for pure virtual method&quot;
+  static const int i = 5;      // "invalid syntax for pure virtual method"
 };
 </pre>
 
-<strong>Workaround:</strong> Either use an enum (which has incorrect
-type, but can be used in compile-time constant expressions), or define
-the value out-of-line (which allows for the correct type, but prohibits
-using the constant in compile-time constant expressions).  See
-<a href="int_const_guidelines.htm">Coding Guidelines for Integral Constant Expressions</a>
-for guidelines how to define member constants portably in boost
-libraries.
+  <p><strong>Workaround:</strong> Either use an enum (which has incorrect
+  type, but can be used in compile-time constant expressions), or define the
+  value out-of-line (which allows for the correct type, but prohibits using
+  the constant in compile-time constant expressions). See <a href=
+  "int_const_guidelines.htm">Coding Guidelines for Integral Constant
+  Expressions</a> for guidelines how to define member constants portably in
+  boost libraries.</p>
 
+  <h3>[koenig-lookup] Argument-dependent lookup</h3>
 
-<h3>[koenig-lookup] Argument-dependent lookup</h3>
-
-Argument-dependent lookup, also called Koenig lookup, works for
-overloaded operators, but not for ordinary functions.  No
-additional namespaces induced from the argument types seem to be
-considered.  
-
-<pre>
+  <p>Argument-dependent lookup, also called Koenig lookup, works for
+  overloaded operators, but not for ordinary functions. No additional
+  namespaces induced from the argument types seem to be considered.</p>
+  <pre>
 namespace N {
   struct A {};
   void f(A);
@@ -186,29 +181,26 @@
 }
 </pre>
 
+  <h3>[template-friend] Templates as friends</h3>
 
-<h3>[template-friend] Templates as friends</h3>
-
-A Template cannot be declared a friend of a class.
-
-<pre>
+  <p>A Template cannot be declared a friend of a class.</p>
+  <pre>
 template&lt;class T&gt;
 struct A {};
 
 struct B
 {
   template&lt;class T&gt;
-  friend struct A;     // &quot;syntax error&quot;
+  friend struct A;     // "syntax error"
 };
 </pre>
 
+  <h3>[member-template-outofline] Out-of-line definitions of member
+  templates</h3>
 
-<h3>[member-template-outofline] Out-of-line definitions of member
-templates</h3>
-
-Defining member templates outside their enclosing class does not work.
-
-<pre>
+  <p>Defining member templates outside their enclosing class does not
+  work.</p>
+  <pre>
 template&lt;class T&gt;
 struct A
 {
@@ -217,21 +209,19 @@
 };
 
 template&lt;class T&gt;
-template&lt;class U&gt;   // &quot;syntax error&quot;
-void A&lt;T&gt;::f()      // &quot;T: undeclared identifier&quot;
+template&lt;class U&gt;   // "syntax error"
+void A&lt;T&gt;::f()      // "T: undeclared identifier"
 {
 }
 </pre>
 
-<strong>Workaround:</strong> Define member templates in-line within
-their enclosing class.
+  <p><strong>Workaround:</strong> Define member templates in-line within
+  their enclosing class.</p>
 
+  <h3>[partial-spec] Partial specialization</h3>
 
-<h3>[partial-spec] Partial specialization</h3>
-
-Partial specialization of class templates does not work.
-
-<pre>
+  <p>Partial specialization of class templates does not work.</p>
+  <pre>
 template&lt;class T&gt;
 struct A {};
 
@@ -242,52 +232,45 @@
 struct A&lt;B&lt;T&gt; &gt; {};  // template class was already defined as a non-template
 </pre>
 
-<strong>Workaround:</strong> In some situations where interface
-does not matter, class member templates can simulate partial
-specialization.
+  <p><strong>Workaround:</strong> In some situations where interface does not
+  matter, class member templates can simulate partial specialization.</p>
 
+  <h3>[template-value] Dependent template value parameters</h3>
 
-<h3>[template-value] Dependent template value parameters</h3>
-
-Template value parameters whose type depends on a previous template
-parameter provoke an internal compiler error if the correct syntax
-(with "typename") is used.
-
-<pre>
+  <p>Template value parameters whose type depends on a previous template
+  parameter provoke an internal compiler error if the correct syntax (with
+  "typename") is used.</p>
+  <pre>
 template&lt;class T, typename T::result_type&gt; // C1001: INTERNAL COMPILER ERROR: msc1.cpp, line 1794
 struct B {};
- // (omit &quot;typename&quot; and it compiles)
+ // (omit "typename" and it compiles)
 
 </pre>
 
-<strong>Workaround:</strong> Leave off the "typename" keyword.  That makes
-the program non-conforming, though.
+  <p><strong>Workaround:</strong> Leave off the "typename" keyword. That
+  makes the program non-conforming, though.</p>
 
+  <h3>[wchar_t] <code>wchar_t</code> is not built-in</h3>
 
-<h3>[wchar_t] <code>wchar_t</code> is not built-in</h3>
-
-The type <code>wchar_t</code> is not a built-in type.
-
-<pre>
-wchar_t x;  // &quot;missing storage class or type identifier&quot;
+  <p>The type <code>wchar_t</code> is not a built-in type.</p>
+  <pre>
+wchar_t x;  // "missing storage class or type identifier"
 </pre>
 
-<strong>Workaround:</strong> When using Microsoft Visual C++, the
-header
-<a href="../boost/config.hpp">boost/config.hpp</a>
-includes <code>&lt;cstddef></code>, which defines
-<code>wchar_t</code> as a typedef for <code>unsigned
-short</code>. Note that this means that the compiler does not regard
-<code>wchar_t</code> and <code>unsigned short</code> as distinct
-types, as is required by the standard, and so ambiguities may emanate
-when overloading on <code>wchar_t</code>.  The macro
-<code>BOOST_NO_INTRINSIC_WCHAR_T</code> is defined in this situation.
+  <p><strong>Workaround:</strong> When using Microsoft Visual C++, the header
+  <a href="../boost/config.hpp">boost/config.hpp</a> includes
+  <code>&lt;cstddef&gt;</code>, which defines <code>wchar_t</code> as a
+  typedef for <code>unsigned short</code>. Note that this means that the
+  compiler does not regard <code>wchar_t</code> and <code>unsigned
+  short</code> as distinct types, as is required by the standard, and so
+  ambiguities may emanate when overloading on <code>wchar_t</code>. The macro
+  <code>BOOST_NO_INTRINSIC_WCHAR_T</code> is defined in this situation.</p>
 
+  <h3>[delete-const-pointer] Deleting <code>const X *</code> does not
+  work</h3>
 
-<h3>[delete-const-pointer] Deleting <code>const X *</code> does not work</h3>
-
-Trying to delete a pointer to a cv-qualified type gives an error:
-<pre>
+  <p>Trying to delete a pointer to a cv-qualified type gives an error:</p>
+  <pre>
 void f()
 {
   const int *p = new int(5);
@@ -295,29 +278,49 @@
 }
 </pre>
 
-<strong>Workaround:</strong> Define the function
-<pre>
+  <p><strong>Workaround:</strong> Define the function</p>
+  <pre>
 inline void operator delete(const void *p) throw()
-{ operator delete(const_cast&lt;void*>(p)); }
+{ operator delete(const_cast&lt;void*&gt;(p)); }
 </pre>
-and similar functions for the other cv-qualifier combinations, for
-operator delete[], and for the <code>std::nothrow</code> variants.
 
+  <p>and similar functions for the other cv-qualifier combinations, for
+  operator delete[], and for the <code>std::nothrow</code> variants.</p>
 
+  <h2>Standard Library</h2>
 
-<h2>Standard Library</h2>
+  <h3>[clib-namespace] C library names in global namespace instead of
+  std</h3>
 
-<h3>[clib-namespace] C library names in global namespace instead of std</h3>
-<p>Library names from the &lt;c...&gt; headers are in the global namespace
-instead of namespace std.<p><b>Workaround:</b>&nbsp; The header <a href="../libs/config/config.htm">boost/config.hpp</a>
-will define BOOST_NO_STDC_NAMESPACE. It can be used as follows:
-<pre># ifdef BOOST_NO_STDC_NAMESPACE
+  <p>Library names from the &lt;c...&gt; headers are in the global namespace
+  instead of namespace std.</p>
+
+  <p><b>Workaround:</b>&nbsp; The header <a href=
+  "../libs/config/config.htm">boost/config.hpp</a> will define
+  BOOST_NO_STDC_NAMESPACE. It can be used as follows:</p>
+  <pre>
+# ifdef BOOST_NO_STDC_NAMESPACE
     namespace std { using ::abs; using ::fabs; }
-# endif</pre>
-<p>Because std::size_t and std::ptrdiff_t are so commonly used, the workaround
-for these is already provided in boost/config.hpp.<p>&nbsp;
-<hr>
+# endif
+</pre>
 
-2001-05-04 <a href="../people/jens_maurer.htm">Jens Maurer</a>
+  <p>Because std::size_t and std::ptrdiff_t are so commonly used, the
+  workaround for these is already provided in boost/config.hpp.</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+  <p><i>Copyright &copy; 2001-2002 <a href="../people/jens_maurer.htm">Jens
+  Maurer</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/more/moderators.html
===================================================================
--- boost/trunk/more/moderators.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/moderators.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 
 <head>
@@ -70,10 +71,10 @@
 </p>
 <p>© Beman Dawes 2001-2004</p>
 
-<p> Use, modification, and distribution are subject to the Boost Software 
-License, Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a>)</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See
+accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+at <a href=
+"http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</p>
 
 </body>
 

Modified: boost/trunk/more/release_mgr_checklist.html
===================================================================
--- boost/trunk/more/release_mgr_checklist.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/release_mgr_checklist.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 
 <head>
@@ -182,8 +183,7 @@
   sub-directory. Post a message to the main list asking developers to check 
   contents. (Daniel Frey has volunteered to help check).<br>
 &nbsp;</li>
-  <li>Upload files for SourceForge release incoming directory<b><i>
-  </i></b>using WS_FTP Pro<ul>
+  <li>Upload files for SourceForge release incoming directory using <b>WS_FTP Pro</b><ul>
   <li>Start keep_isdn_awake</li>
   <li>Connection: SourceForge Release Upload | connect</li>
   <li>Select Local system: c:\boost</li>
@@ -195,7 +195,7 @@
 </ul>
   </li>
   <li>Complete the SourceForge
-  <a href="http://sourceforge.net/docman/display_doc.php?docid=6445&group_id=1#createrelease">
+  <a href="http://sourceforge.net/docman/display_doc.php?docid=6445&amp;group_id=1#createrelease">
   release procedure</a>.<ul>
   <li>Admin | File Releases | Add Release for package name boost</li>
   <li>New release name: 1.21.2 | create this release</li>
@@ -267,9 +267,9 @@
 <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->21 November, 2005<!--webbot bot="Timestamp" endspan i-checksum="40405" --></p>
 <p>© Copyright Beman Dawes 2001</p>
 
-<p>Use, modification, and distribution are subject to the Boost Software License, 
-Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at
-<a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying
+file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at
+<a href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</p>
 
 </body>
 

Modified: boost/trunk/more/release_procedures.htm
===================================================================
--- boost/trunk/more/release_procedures.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/release_procedures.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 
 <head>
@@ -203,10 +204,9 @@
 
 <p>© Copyright Beman Dawes 2002</p>
 
-<p> Use, modification, and distribution are subject to the Boost Software 
-License, Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a>)</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See
+accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+at <a href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</p>
 
 </body>
 

Modified: boost/trunk/more/separate_compilation.html
===================================================================
--- boost/trunk/more/separate_compilation.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/separate_compilation.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,19 +5,18 @@
       <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
       <LINK href="../boost.css" type="text/css" rel="stylesheet"></head>
    <body>
-      <P>
-         <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
-            <TR>
-               <td vAlign="top" width="300">
-                  <h3><A href="../index.htm"><IMG height="86" alt="C++ Boost" src="../boost.png" width="277" border="0"></A></h3>
-               </td>
-               <TD width="353">
-                  <H1 align="center">Guidelines for Authors of Boost Libraries Containing Separate 
-                     Source</H1>
-               </TD>
-            </TR>
-         </TABLE>
-      </P>
+      <TABLE summary="Page header" id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
+         <TR>
+            <td vAlign="top" width="300">
+               <h3><A href="../index.htm"><IMG height="86" alt="C++ Boost" src="../boost.png" width="277" border="0"></A></h3>
+            </td>
+            <TD width="353">
+               <H1 align="center">Guidelines for Authors of Boost Libraries Containing Separate 
+                  Source</H1>
+            </TD>
+         </TR>
+      </TABLE>
+      <BR>
       <HR>
       <P>These guidelines are designed for the authors of Boost libraries which have 
          separate source that need compiling in order to use the library. Throughout, 
@@ -25,24 +24,23 @@
          occurrences of "whatever" or "WHATEVER" with your own library's name when 
          copying the examples.</P>
       <H2>Contents</H2>
-      <P>
-         <dl class="index">
-            <dt><A href="#source_changes">Changes Affecting Source Code</A>
-               <dd>
-                  <dl class="index">
-                     <dt><A href="#abi">Preventing Compiler ABI Clashes</A> <dt><A href="#dlls">Supporting 
-                              Windows Dll's</A> <dt><a href="#auto-link">Automatic Library Selection and Linking 
-                                 with auto_link.hpp</a> </dt>
-                  </dl>
-                  <dt><A href="#build_changes">Changes Affecting the Build System</A>
-                     <dd>
-                        <dl class="index">
-                           <dt><A href="#jamfile">Creating the Library Jamfile</A> <dt><A href="#testing">Testing 
-                                    Auto-linking</A> </dt>
-                        </dl>
-                        <dt><A href="#copyright">Copyright</A></dt>
-         </dl>
-      <P></P>
+      <dl class="index">
+         <dt><A href="#source_changes">Changes Affecting Source Code</A>
+            <dd>
+               <dl class="index">
+                  <dt><A href="#abi">Preventing Compiler ABI Clashes</A> <DT><A href="#static_or_dynamic">Static 
+                           or Dymanic Libraries</A>&nbsp; <dt><A href="#dlls">Supporting Windows Dll's</A> <dt>
+                              <a href="#auto-link">Automatic Library Selection and Linking with auto_link.hpp</a>
+                           </dt>
+               </dl>
+               <dt><A href="#build_changes">Changes Affecting the Build System</A>
+                  <dd>
+                     <dl class="index">
+                        <dt><A href="#jamfile">Creating the Library Jamfile</A> <dt><A href="#testing">Testing 
+                                 Auto-linking</A> </dt>
+                     </dl>
+                     <dt><A href="#copyright">Copyright</A></dt>
+      </dl>
       <h2><A name="source_changes"></A>Changes Affecting Source Code</h2>
       <H3><A name="abi"></A>Preventing Compiler ABI Clashes</H3>
       <P>There are some compilers (mostly Microsoft Windows compilers again!), which 
@@ -103,10 +101,19 @@
 
 #endif
 </PRE>
-      <P>You can include this code in your source files as well if you want - although 
-         you probably shouldn't need to - these headers fix the ABI to the default used 
-         by the compiler, and if the user attempts to compile the source with any other 
-         setting then they will get compiler errors if there are any conflicts.</P>
+      <P>You can include this code in your library source files as well if you want, 
+         although you probably shouldn't need to:&nbsp;&nbsp;</P>
+      <UL>
+         <LI>
+            If you <EM>don't</EM>
+         use these in the library source files (but do in your library's headers) and 
+         the user attempts to compile the library source with a non-default ABI setting, 
+         then they will get compiler errors if there are any conflicts.
+         <LI>
+            If you <EM>do </EM>include them in both the library's headers and the library 
+            source files, then the code should always compile no matter what the compiler 
+            settings used, although the result might not match what the user was expecting: 
+            since we've forced the ABI back into default mode.</LI></UL>
       <H4>Rationale:</H4>
       <P>Without some means of managing this issue, users often report bugs along the 
          line of "Your silly library always crashes when I try and call it" and so on. 
@@ -124,7 +131,38 @@
          shared_ptr.hpp also uses them. Authors of header-only boost libraries may not 
          be so keen on this solution - with some justification - since they don't face 
          the same problem.</P>
-      <h3><A name="dlls"></A>Supporting Windows Dll's</h3>
+      <H3><A name="static_or_dynamic"></A>Static or Dynamic Libraries</H3>
+      <P>When the users runtime is dynamically linked the Boost libraries can be built 
+         either as dynamic libraries (.so's on Unix platforms, .dll's on Windows) or as 
+         static libraries (.a's on Unix, .lib's on Windows).&nbsp; So we have a choice 
+         as to which is supported by default:</P>
+      <UL>
+         <LI>
+         On Unix platforms it typically makes no difference to the code: the user just 
+         selects in their makesfile which library they prefer to link to.
+         <LI>
+         On Windows platforms, the code has to be specially annotated to support DLL's, 
+         so we need to pick one option as the default and one as an alternative.
+         <LI>
+            On Windows platforms, we can inject special code to automatically select which 
+            library variant to link against: so again we need to decide which is to be the 
+            default (see the section on auto-linking below).</LI></UL>
+      <P>The recomendation is to pick static linking by default.</P>
+      <H4>Rationale:</H4>
+      <P>There is no one policy that fits all here.
+      </P>
+      <P>The rationale for the current behaviour was inherited from Boost.Regex (and 
+         it's ancestor regex++): this library&nbsp;originally used dynamic linking by 
+         default whenever the runtime was dynamic. It's actually safer that way should 
+         you be using regex from a dll for example. However,&nbsp;this 
+         behavior&nbsp;brought a persistent stream of user complaints: mainly about 
+         deployment, all asking if static linking could be the default. After&nbsp;regex 
+         changed behavior the complaints stopped, and the author hasn't had one 
+         complaint about static linking by default being the wrong choice.</P>
+      <P>Note that other libraries might need to make other choices: for example 
+         libraries that are intended to be used to implement dll pluggin's would like 
+         need to use dynamic linking in almost all cases.</P>
+      <H3>Supporting Windows Dll's</H3>
       <p>On most Unix-like platforms no special annotations of source code are required 
          in order for that source to be compiled as a shared library because all 
          external symbols are exposed. However the majority of Windows compilers require 
@@ -311,140 +349,35 @@
 #include &lt;boost/config/auto_link.hpp&gt;
 #endif  // auto-linking disabled
 </pre>
-      <P></P>
       <p>The library's user documentation should note that the feature can be disabled 
          by defining either BOOST_ALL_NO_LIB or BOOST_WHATEVER_NO_LIB:</p>
       <P>If for any reason you need to debug this feature, the header 
          &lt;boost/config/auto_link.hpp&gt; will output some helpful diagnostic messages 
          if you first define BOOST_LIB_DIAGNOSTIC.</P>
       <H2><A name="build_changes"></A>Changes Affecting the Build System</H2>
-      <H3><a name='build"'></a><A name="jamfile"></A>Creating the library Jamfile</H3>
+      <H3><a name="build"></a><A name="jamfile"></A>Creating the library Jamfile</H3>
       <P>The Jamfile for building library "whatever" typically lives in 
-         boost-root/libs/whatever/build, start by defining the project root for the 
-         Jamfile:</P>
-      <PRE>subproject libs/whatever/build ; </PRE>
-      <P>Then add the static library build target (if supported):</P>
-      <PRE>lib 
-   boost_whatever
-      : # list all the sources for this
-      library:
-   ../src/whatever.cpp
-      : # all build requirements go
-      here. # the "common-variant-tag" rule ensures that the library will
-      # be named according to the rules used by the install
-      # and auto-link features:
-      common-variant-tag 
-      # set include path for Boost headers:
-      &lt;sysinclude&gt;$(BOOST_ROOT)
-   : 
-      # list default build variants here
-      debug release 
-   ; </PRE>
-      <P>Then add the dll build target (if supported).&nbsp;&nbsp;In this case the build 
-         requirements section get an extra define: so that our sources know to export 
-         their own symbols (and import those from any other boost libs on which we may 
-         be dependent).&nbsp; We also restict shared library builds to dynamic-runtime 
-         build variants, if we don't do this then dll's linked against static runtimes 
-         are unlikely to function correctly (the dll will have a separate runtime from 
-         the executable using it, this generally causing problems with new and 
-         delete,&nbsp;as well as exception handling runtimes).</P>
-      <PRE>dll 
-   boost_whatever
-      : # list all the sources for this
-      library:
-   ../src/whatever.cpp
-      : # all build requirements go
-      here. # the "common-variant-tag" rule ensures that the library will
-      # be named according to the rules used by the install
-      # and auto-link features:
-      common-variant-tag 
-      # tell our source that we're building (and maybe using) dll's:
-      &lt;define&gt;BOOST_ALL_DYN_LINK=1
-      # only build this for dynamic runtimes:
-      &lt;runtime-link&gt;dynamic
-      # set include path for Boost headers:
-      &lt;sysinclude&gt;$(BOOST_ROOT)
-   : 
-      # list default build variants here
-      debug release 
-   ; 
-</PRE>
-      <P>Now add an install target so that Boost.Install can find this library to 
-         install:</P>
-      <pre>install whatever lib
-    : &lt;dll&gt;boost_whatever &lt;lib&gt;boost_whatever
-    ;
-</pre>
-      <P>Finally add a stage target that will copy the built libraries to a common 
-         sub-directory (boost-root/stage/lib):</P>
-      <PRE>stage stage/lib : &lt;lib&gt;boost_whatever &lt;dll&gt;boost_whatever
-    :
-        # copy to a path rooted at BOOST_ROOT:
-        &lt;locate&gt;$(BOOST_ROOT)
-        # make sure the names of the libraries are correctly named:
-        common-variant-tag
-        # add this target to the "stage" and "all" psuedo-targets:
-        &lt;target&gt;stage
-        &lt;target&gt;all
-    :
-        debug release
-    ;
-</PRE>
+         boost-root/libs/whatever/build, the only extra step required is to add a 
+         &lt;define&gt; requirement to the library target so that your code knows 
+         whether it's building a dll or static library, a typical Jamfile would like 
+         like this:</P>
+      <PRE>
+lib boost_regex : ../src/whatever.cpp : 
+  &lt;link&gt;shared:&lt;define&gt;BOOST_WHATEVER_DYN_LINK=1 ;
+ </PRE>
       <H3><A name="testing"></A>Testing Auto-linking</H3>
-      <P>Testing the auto-link feature&nbsp;reasonable straightforward using 
-         the&nbsp;Boost.build system: we need to build the "whatever" library's test 
-         files without explicitly specifying the library to link to in the Jamfile, for 
-         example:</P>
-      <PRE>subproject libs/whatever/test/auto-link-test ;
-
-# bring in the rules for testing
-import testing ;
-
-# start with a static linking version:
-
-run 
-   # sources
-      ../whatever_test.cpp
-   :
-   :	# input files
-   : 	# requirements
-      &lt;library-path&gt;../../../../stage/lib
-      &lt;define&gt;BOOST_LIB_DIAGNOSTIC=1
-   : 	# program name
-      whatever_test          
-   ;
-
-   # and then a dll linking version:
-   run 
-   # sources
-      ../whatever_test.cpp
-   :
-   :	# input files
-   : 	# requirements
-      &lt;library-path&gt;../../../../stage/lib
-      &lt;define&gt;BOOST_LIB_DIAGNOSTIC=1
-      &lt;define&gt;BOOST_ALL_DYN_LINK=1
-      &lt;runtime-link&gt;dynamic
-   : 	# program name
-      whatever_test_dll          
-   ;
-
-</PRE>
-      <P>Please note however that this Jamfile will only build with compilers that do 
-         actually support auto-linking, so it should not be added to the regular 
-         regression tests.&nbsp; The Jamfile should also be built for all possible build 
-         variants, for the Microsoft / Borland compilers that means doing a:</P>
-      <PRE>bjam -sBUILD="release debug &lt;threading&gt;multi/single &lt;runtime-link&gt;static/dynamic" test
-      </PRE>
+      <P>Testing the auto-link feature&nbsp;is somewhat convoluted, and requires access 
+         to a compiler that supports the feature: refer to <A href="../libs/config/test/link/test/Jamfile.v2">
+            libs/config/test/link/test/Jamfile.v2</A> for an example.</P>
       <HR>
       <p><A name="copyright"></A>Revised 
-         <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan --> 
+         <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
          26 November, 2003<!--webbot bot="Timestamp" endspan i-checksum="39365" --></p>
       <p><i>© Copyright John Maddock&nbsp;1998- 
             <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%Y" startspan -->  2003<!--webbot bot="Timestamp" endspan i-checksum="746" --></i></p>
-      <P><I>Use, modification and distribution are subject to the Boost Software License, 
-            Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
-            or copy at <A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>).</I></P>
+      <P><I>Distributed under the Boost Software License, Version 1.0. (See accompanying 
+            file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
+               http://www.boost.org/LICENSE_1_0.txt</a>)</I></P>
       <P><EM>The use of code snippets from this article does not require the reproduction 
             of this copyright notice and license declaration; if you wish to provide 
             attribution then please provide a link to this article.</EM></P>

Modified: boost/trunk/more/submission_process.htm
===================================================================
--- boost/trunk/more/submission_process.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/submission_process.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 
 <head>
@@ -32,7 +33,7 @@
   <li><a href="#Refinement">Refinement</a>.</li>
   <li><a href="#Submission">Submission for review</a>.</li>
   <li><a href="#Review">Formal Review</a>.</li>
-  <li><a href="#site posting">Web site posting</a>.</li>
+  <li><a href="#SitePosting">Web site posting</a>.</li>
   <li><a href="#People">People page.</a></li>
   <li><a href="#Lifecycle">Lifecycle</a>.</li>
 </ul>
@@ -99,7 +100,7 @@
 <p>Formal Review schedules are posted on
   the <a href="formal_review_schedule.html">web site</a>.&nbsp;</p>
 
-<h2>Boost web <a name="site posting">site posting</a></h2>
+<h2>Boost web <a name="SitePosting">site posting</a></h2>
 <p>Once an accepted library is ready for inclusion on the Boost web site, the 
 submitter is typically given Boost CVS write access, and expected to check-in 
 and maintain the library in the CVS. Contact the moderators if you need write 
@@ -124,9 +125,9 @@
 <p>Revised <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->26 November, 2003<!--webbot bot="Timestamp" endspan i-checksum="39365" --></p>
 
 <p>© Copyright Beman Dawes 2000</p>
-<p>Use, modification, and distribution are subject to the Boost Software License, 
-Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at
-<a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See
+accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+at <a href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</p>
 
 </body>
 

Modified: boost/trunk/more/test_policy.htm
===================================================================
--- boost/trunk/more/test_policy.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/test_policy.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
 
 <head>
@@ -90,10 +91,9 @@
 <p>Revised <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->08 January, 2004<!--webbot bot="Timestamp" endspan i-checksum="38708" -->
 </p>
 <p>© Copyright Beman Dawes 2001</p>
-<p> Use, modification, and distribution are subject to the Boost Software 
-License, Version 1.0. (See accompanying file <a href="../LICENSE_1_0.txt">
-LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a>)</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See
+accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+at <a href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</p>
 
 </body>
 

Modified: boost/trunk/more/version_history.html
===================================================================
--- boost/trunk/more/version_history.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/version_history.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -57,29 +57,29 @@
 
                         <ul>
                           <li><span class="library"><a href=
-                          "doc/html/any.html">Any Library</a>:</span> Cast to
+                          "../doc/html/any.html">Any Library</a>:</span> Cast to
                           reference types introduced in 1.33.0 is now
                           documented on <code>any_cast</code> documentation
                           page.</li>
 
                           <li>
                             <span class="library"><a href=
-                            "libs/bind/bind.html">Bind Library</a>:</span>
+                            "../libs/bind/bind.html">Bind Library</a>:</span>
 
                             Bind expressions now support
-                            <a href="libs/bind/bind.html#operators">
+                            <a href="../libs/bind/bind.html#operators">
                             comparisons and negation</a>. Example: <code>
                             bind(&amp;X::name, _1) &lt; bind(&amp;X::name,
                             _2)</code>.
                           </li>
 
                           <li><span class="library"><a href=
-                          "libs/config/index.html">Config Library</a>:</span>
+                          "../libs/config/index.html">Config Library</a>:</span>
                           Don't undef BOOST_LIB_TOOLSET after use.</li>
 
                           <li>
                             <span class="library"><a href=
-                            "libs/python/doc/index.html">Boost.Python</a>:</span>
+                            "../libs/python/doc/index.html">Boost.Python</a>:</span>
 
                             <ul>
                               <li>The build now assumes Python 2.4 by
@@ -95,21 +95,21 @@
                           </li>
 
                           <li><span class="library"><a href=
-                          "libs/smart_ptr/index.html">Smart Pointer
+                          "../libs/smart_ptr/index.html">Smart Pointer
                           Library</a>:</span> Fixed problems under Metrowerks
                           CodeWarrior on PowerPC (Mac OS X) with inlining on,
                           GNU GCC on PowerPC 64.</li>
 
                           <li><span class="library"><a href=
-                          "libs/regex/doc/index.html">Regex
+                          "../libs/regex/doc/index.html">Regex
                           Library</a>:</span> Fixed the supplied makefiles,
                           and other small compiler specific changes. Refer to
-                          the <a href="libs/regex/doc/history.html">regex
+                          the <a href="../libs/regex/doc/history.html">regex
                           history page</a> for more information on these and
                           other small changes.</li>
 
                           <li><span class="library"><a href=
-                          "libs/iostreams/doc/index.html">Iostreams
+                          "../libs/iostreams/doc/index.html">Iostreams
                           Library</a>:</span> Improved the interface for
                           accessing a chain's components, added
                           <code>is_open</code> members to the file and file
@@ -119,7 +119,7 @@
 
                           <li>
                             <span class="library"><a href=
-                            "libs/python/doc/index.html">Boost.Python</a>:</span>
+                            "../libs/python/doc/index.html">Boost.Python</a>:</span>
 
                             <ul>
                               <li>Added support for docstrings on nonstatic
@@ -150,20 +150,20 @@
                           </li>
 
                           <li><span class="library"><a href=
-                          "libs/functional/hash/index.html">Functional/Hash
+                          "../libs/functional/hash/index.html">Functional/Hash
                           Library</a>:</span> Fixed the points example.</li>
 
                           <li><span class="library"><a href=
-                          "libs/multi_index/doc/index.html">Multi-index
+                          "../libs/multi_index/doc/index.html">Multi-index
                           Containers Library</a>:</span> Fixed a problem with
                           multithreaded code, and other minor changes. Refer
                           to the library <a href=
-                          "libs/multi_index/doc/release_notes.html#boost_1_33_1">
+                          "../libs/multi_index/doc/release_notes.html#boost_1_33_1">
                           release notes</a> for further details.</li>
 
                           <li>
                             <span class="library"><a href=
-                            "libs/graph/doc/table_of_contents.html">Graph
+                            "../libs/graph/doc/table_of_contents.html">Graph
                             Library</a>:</span>
 
                             <ul>
@@ -172,9 +172,9 @@
                               <tt>dijkstra_shortest_paths</tt>).</li>
 
                               <li>Fixed problems with <a href=
-                              "libs/graph/doc/cuthill_mckee_ordering.html"><code>
+                              "../libs/graph/doc/cuthill_mckee_ordering.html"><code>
                               cuthill_mckee_ordering</code></a> and <a href=
-                              "libs/graph/doc/king_ordering.html"><code>king_ordering</code></a>
+                              "../libs/graph/doc/king_ordering.html"><code>king_ordering</code></a>
                               producing no results.</li>
 
                               <li>Added <tt>color_map</tt> parameter to
@@ -183,20 +183,20 @@
                           </li>
 
                           <li><span class="library"><a href=
-                          "libs/signals/doc/index.html">Signals
+                          "../libs/signals/doc/index.html">Signals
                           Library</a>:</span> Fixed problems with the use of
                           Signals across shared library boundaries.</li>
 
                           <li><span class="library"><a href=
-                          "libs/thread/doc/index.html">Thread
+                          "../libs/thread/doc/index.html">Thread
                           library</a>:</span> <code>read_write_mutex</code>
                           has been removed due to problems with
                           deadlocks.</li>
 
                           <li><span class="library"><a href=
-                          "libs/wave/index.html">Wave library</a>
+                          "../libs/wave/index.html">Wave library</a>
                           (V1.2.1)</span> Fixed a couple of problems, refer
-                          to the <a href="libs/wave/ChangeLog">change log</a>
+                          to the <a href="../libs/wave/ChangeLog">change log</a>
                           for further details.</li>
                         </ul>
 
@@ -261,10 +261,10 @@
 
                         <h4>Acknowledgements</h4>
 
-                        <p><img src="more/boost_1_33_0.jpg" width="128"
+                        <p><img src="boost_1_33_0.jpg" width="128"
                         height="118" alt="Medieval Mr. Gregor" class=
                         "left-inset" /> <a href=
-                        "people/doug_gregor.html">Douglas Gregor</a> managed
+                        "../people/doug_gregor.html">Douglas Gregor</a> managed
                         this release.</p>
 
                         <p>A great number of people contributed their time
@@ -455,11 +455,11 @@
 
                         <ul>
                           <li>New <a href=
-                          "../libs/multi_index/doc/advanced_topics.html#hashed_indices">
+                          "../libs/multi_index/doc/tutorial/indices.html#hashed_indices">
                           hashed indices</a>.</li>
 
                           <li>Added <a href=
-                          "../libs/multi_index/doc/advanced_topics.html#serialization">
+                          "../libs/multi_index/doc/tutorial/creation.html#serialization">
                           serialization support</a>.</li>
 
                           <li>For a complete list of changes, see the library
@@ -1148,15 +1148,11 @@
                       <li>Tests are now run in the context of the user's PATH
                       environment settings</li>
 
-                      <li><a href=
-                      "../tools/build/v1/msvc-stlport-tools.html">msvc-stlport</a>
-                      and <a href=
-                      "../tools/build/v1/intel-win32-tools.html">intel-win32-stlport</a>
+                      <li>msvc-stlport and intel-win32-stlport
                       toolsets now build static libraries with multithreading
                       enabled, to be compatible with the STLPort builds.</li>
 
-                      <li><a href=
-                      "../tools/build/v1/intel-win32-tools.html">intel-win32</a>
+                      <li>intel-win32
                       toolset now handles <code>wchar_t</code> correctly when
                       intel is installed over msvc6.</li>
 
@@ -1176,8 +1172,7 @@
                       "../libs/conversion/lexical_cast.htm">conversion/lexical_cast</a>'s
                       <code>wchar_t</code> fixes from the main trunk.</li>
 
-                      <li><a href=
-                      "../tools/build/v1/intel-linux-tools.html">intel-linux-tools</a>:
+                      <li>intel-linux-tools:
                       added <code>rt</code> to FINDLIBS in order to make the
                       <code>clock_gettime()</code> function available
                       (backport of a patch in CVS HEAD).</li>
@@ -1551,11 +1546,11 @@
                       dynamic storage.</li>
 
                       <li><a href=
-                      "../libs/math/quaternion/index.html">Quaternions</a>:
+                      "../doc/html/boost_math/quaternions.html">Quaternions</a>:
                       added support for GCC 2.95.x.</li>
 
                       <li><a href=
-                      "../libs/math/octonion/index.html">Octonions</a>: added
+                      "../doc/html/boost_math/octonions.html">Octonions</a>: added
                       support for GCC 2.95.x.</li>
 
                       <li><a href="../libs/smart_ptr/index.html">Smart
@@ -1700,11 +1695,11 @@
                       and Jens Maurer.</li>
 
                       <li><a href=
-                      "../libs/math/special_functions/index.html">Special
+                      "../doc/html/boost_math/math_special_functions.html">Special
                       functions</a>, <a href=
-                      "../libs/math/octonion/index.html">octonions</a>,
+                      "../doc/html/boost_math/octonions.html">octonions</a>,
                       <a href=
-                      "../libs/math/quaternion/index.html">quaternions</a>
+                      "../doc/html/boost_math/quaternions.html">quaternions</a>
                       updated, now useable with many more compilers, plus
                       three new special functions, from Hubert Holin, Eric
                       Ford, and others.</li>
@@ -1758,11 +1753,11 @@
                       tokens, from John Bandela.</li>
 
                       <li><a href=
-                      "../libs/math/special_functions/index.html">Special
+                      "../doc/html/boost_math/math_special_functions.html">Special
                       functions</a>, <a href=
-                      "../libs/math/octonion/index.html">octonions</a>,
+                      "../doc/html/boost_math/octonions.html">octonions</a>,
                       <a href=
-                      "../libs/math/quaternion/index.html">quaternions</a>
+                      "../doc/html/boost_math/quaternions.html">quaternions</a>
                       added, from Hubert Holin.</li>
 
                       <li><a href="../libs/smart_ptr/smart_ptr.htm">Smart
@@ -2592,7 +2587,7 @@
         </div>
 
         <div id="footer">
-          <p id="revised">Revised $Date: 2005/12/08 03:08:53 $</p>
+          <p id="revised">Revised $Date: 2007/01/07 23:45:40 $</p>
           <p id="copyright">Copyright Daryle Walker 2004&ndash;2005.
           Copyright Rene Rivera 2005.</p>
 

Modified: boost/trunk/more/whos_using/using.qbk
===================================================================
--- boost/trunk/more/whos_using/using.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/whos_using/using.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
             http://www.boost.org/LICENSE_1_0.txt
         </ulink>)
     ]
-    [last-revision $Date: 2006/05/06 16:23:21 $]
+    [last-revision $Date: 2007/01/04 09:58:04 $]
 ]
 
 [section:intro]
@@ -397,6 +397,16 @@
 behalf of C++ coders everywhere."]
 ]
 
+[blurb [*LW-WORKS Software, Clipboard Recorder]\n\n
+[@http://www.lw-works.com/clipboard-recorder Clipboard Recorder]
+is an application that helps users to manage their
+clipboard history and provides easy ways for users to access their
+saved clipboard data.\n\n
+Libraries used:
+Smart Pointer, Serialization, Asio, String Algorithms, Bind, Thread,
+Conversion/Cast, Iostreams.
+]
+
 [endsect]
 
 [section:open Open Source Boost]
@@ -433,6 +443,28 @@
 [@../../libs/function/index.html Function],
 and [@../../libs/signals/index.html Signals].]
 
+[blurb [*CodeSynthesis XML Schema to C++ Data Binding Compiler (XSD) by Code Synthesis Tools CC]\n\n
+[@http://codesynthesis.com/products/xsd/ CodeSynthesis XML 
+Schema to C++ Data Binding Compiler (XSD)] is an
+open-source, cross-platform XML Data Binding implementation for C++.
+Provided with an XML instance specification (XML Schema), it generates
+C++ classes that represent the given vocabulary as well as parsing and
+serialization code. You can then access the data stored in XML using
+types and functions that semantically correspond to your application
+domain rather than dealing with elements, attributes, and text in a
+direct representation of XML such as DOM or SAX.
+\n\n
+XSD uses the [@../../libs/regex/index.html Regex] and 
+[@../../libs/filesystem/index.html Filesystem] libraries from Boost. 
+[@../../libs/regex/index.html Regex] is used
+to perform transformations on file, type and member names. 
+[@../../libs/filesystem/index.html Filesystem] is used to 
+capture and manipulate XML Schema include and import paths.
+Additionally, we are planning to provide an optional mapping of XML
+Schema date and time types to C++ types from the Boost 
+[@../../libs/date_time/index.html Date Time] library.
+]
+
 [blurb [*CGAL]\n\n
 [@http://www.cgal.org/ CGAL] is the Computational Geometry Algorithms Library,
   an open source C++ library providing generic components

Modified: boost/trunk/more/writingdoc/design.html
===================================================================
--- boost/trunk/more/writingdoc/design.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/writingdoc/design.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,377 +1,576 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../boost.css">
-<title>Writing Documentation for Boost - HTML Design</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link rel="stylesheet" type="text/css" href="../../boost.css">
+
+  <title>Writing Documentation for Boost - HTML Design</title>
 </head>
-<body link="#0000ff" vlink="#800080">
-<table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-  <tr> 
-    <td valign="top" width="300"> 
-      <h3><a href="index.html"><img height="86" width="277" alt="C++ Boost" src="../../boost.png" border="0"></a></h3>
-    </td>
-    <td valign="top"> 
-      <h1 align="center">Writing Documentation for Boost</h1>
-      <h2 align="center">HTML Design</h2>
-    </td>
-  </tr>
-</table>
-<hr>
-<dl class="page-index"> 
-  <dt><a href="#introduction">Introduction</a></dt>
-  <dt><a href="#common-pages">Common Pages Included in HTML Documentation</a></dt>
-  <dl class="page-index"> 
-    <dt><a href="#index-page">Index</a></dt>
-    <dt><a href="#overview-page">Overview</a></dt>
-    <dt><a href="#definitions-page">Definitions</a></dt>
-    <dt><a href="#rationale-page">Rationale</a></dt>
-    <dt><a href="#configuration-page">Configuration Information</a></dt>
-    <dt><a href="#faq-page">Frequently Asked Questions</a></dt>
-    <dt><a href="#bibliography-page">Bibliography</a></dt>
-    <dt><a href="#acknowledgements-page">Acknowledgment</a></dt>
-    <dt><a href="#header-page">Header Reference</a></dt>
+
+<body link="#0000FF" vlink="#800080">
+  <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
+  "header">
+    <tr>
+      <td valign="top" width="300">
+        <h3><a href="index.html"><img height="86" width="277" alt="C++ Boost"
+        src="../../boost.png" border="0"></a></h3>
+      </td>
+
+      <td valign="top">
+        <h1 align="center">Writing Documentation for Boost</h1>
+
+        <h2 align="center">HTML Design</h2>
+      </td>
+    </tr>
+  </table>
+  <hr>
+
+  <dl class="page-index">
+    <dt><a href="#introduction">Introduction</a></dt>
+
+    <dt><a href="#common-pages">Common Pages Included in HTML
+    Documentation</a></dt>
+
+    <dd>
+      <dl class="page-index">
+        <dt><a href="#index-page">Index</a></dt>
+
+        <dt><a href="#overview-page">Overview</a></dt>
+
+        <dt><a href="#definitions-page">Definitions</a></dt>
+
+        <dt><a href="#rationale-page">Rationale</a></dt>
+
+        <dt><a href="#configuration-page">Configuration Information</a></dt>
+
+        <dt><a href="#faq-page">Frequently Asked Questions</a></dt>
+
+        <dt><a href="#bibliography-page">Bibliography</a></dt>
+
+        <dt><a href="#acknowledgements-page">Acknowledgment</a></dt>
+
+        <dt><a href="#header-page">Header Reference</a></dt>
+      </dl>
+    </dd>
+
+    <dt><a href="#layout">Layout</a></dt>
+
+    <dd>
+      <dl class="page-index">
+        <dt><a href="#page-banner">Page Banner</a></dt>
+
+        <dt><a href="#page-index">Page Index</a></dt>
+
+        <dt><a href="#content">Documentation Content</a></dt>
+
+        <dd>
+          <dl class="page-index">
+            <dt><a href="#doc-footnotes">Footnotes</a></dt>
+          </dl>
+        </dd>
+
+        <dt><a href="#revision-info">Revision Information</a></dt>
+
+        <dt><a href="#copyright">Copyright Information</a></dt>
+      </dl>
+    </dd>
+
+    <dt><a href="#format">Format</a></dt>
+
+    <dd>
+      <dl class="page-index">
+        <dt><a href="#style-sheets">Cascading Style Sheets</a></dt>
+
+        <dd>
+          <dl class="page-index">
+            <dt><a href="#boost-style-sheet">Boost Style Sheet</a></dt>
+          </dl>
+        </dd>
+      </dl>
+    </dd>
+
+    <dt><a href="#templates">Templates</a></dt>
+
+    <dd>
+      <dl class="page-index">
+        <dt><a href="#index-template">Index Page Template</a></dt>
+
+        <dt><a href="#overview-template">Overview Page Template</a></dt>
+
+        <dt><a href="#definitions-template">Definitions Page
+        Template</a></dt>
+
+        <dt><a href="#rationale-template">Rationale Page Template</a></dt>
+
+        <dt><a href="#configuration-template">Configuration Page
+        Template</a></dt>
+
+        <dt><a href="#faq-template">FAQ (Frequently Asked Questions) Page
+        Template</a></dt>
+
+        <dt><a href="#bibliography-template">Bibliography Page
+        Template</a></dt>
+
+        <dt><a href="#acknowledgements-template">Acknowledgments Page
+        Template</a></dt>
+
+        <dt><a href="#header-template">Header Page Template</a></dt>
+      </dl>
+    </dd>
   </dl>
-  <dt><a href="#layout">Layout</a></dt>
-  <dl class="page-index"> 
-    <dt><a href="#page-banner">Page Banner</a></dt>
-    <dt><a href="#page-index">Page Index</a></dt>
-    <dt><a href="#content">Documentation Content</a></dt>
-    <dl class="page-index"> 
-      <dt><a href="#doc-footnotes">Footnotes</a></dt>
-    </dl>
-    <dt><a href="#revision-info">Revision Information</a></dt>
-    <dt><a href="#copyright">Copyright Information</a></dt>
-  </dl>
-  <dt><a href="#format">Format</a></dt>
-  <dl class="page-index"> 
-    <dt><a href="#style-sheets">Cascading Style Sheets</a></dt>
-    <dl class="page-index"> 
-      <dt><a href="#boost-style-sheet">Boost Style Sheet</a></dt>
-    </dl>
-  </dl>
-  <dt><a href="#templates">Templates</a></dt>
-  <dl class="page-index"> 
-    <dt><a href="#index-template">Index Page Template</a></dt>
-    <dt><a href="#overview-template">Overview Page Template</a></dt>
-    <dt><a href="#definitions-template">Definitions Page Template</a></dt>
-    <dt><a href="#rationale-template">Rationale Page Template</a></dt>
-    <dt><a href="#configuration-template">Configuration Page Template</a></dt>
-    <dt><a href="#faq-template">FAQ (Frequently Asked Questions) Page Template</a></dt>
-    <dt><a href="#bibliography-template">Bibliography Page Template</a></dt>
-    <dt><a href="#acknowledgements-template">Acknowledgments Page Template</a></dt>
-    <dt><a href="#header-template">Header Page Template</a></dt>
-  </dl>
-</dl>
-<h2><a name="introduction"></a>Introduction</h2>
-<p>Boost places no requirements on the design of HTML documentation for library 
-  submitters. If you are submitting a library for which documentation already 
-  exists in either HTML or in a form easily converted to HTML then there is no 
-  need for you to read this document. However, if you have not yet written the 
-  documentation, or if you expect to have to translate documentation written in 
-  a format not easily convertible to HTML then this document can give you a lot 
-  of information on how to go about writing documentation in HTML.</p>
-<p>In several places this document assumes you're writing the documentation to 
-  conform to the structure described in the <a href="structure.html">Documentation 
-  Structure</a> document. There is no requirement that your documentation content 
-  follow these guidelines, but they provide an effective way to communicate technical 
-  specifications for a library in a terse yet precise manner that's familiar to 
-  many Boost users.</p>
-<p>This document also contains links to <a href="#templates">HTML template files</a> 
-  that can be used to rapidly develop documentation for a library submission. 
-  These templates follow the guidelines presented here and in the <a href="structure.html">Documentation 
-  Structure</a> document.</p>
-<h2><a name="common-pages"></a>Common Pages Included in HTML Documentation</h2>
-<p>Most HTML documentation projects will contain some common pages. General guidelines 
-  for these common pages are provided below.</p>
-<h3><a name="index-page"></a>Index</h3>
-<p>The index page is the first page presented to a user when he browses the documentation. 
-  Generally this page should not contain any actual content, but instead contains 
-  a list of links to specific content. At a minimum this list should contain a 
-  link to every HTML page contained in the documentation. Optionally, sub-lists 
-  may be provided for individual pages linking to specific subjects within the 
-  page. These sub-lists should form a &quot;tree&quot; hierarchy based on the 
-  level of heading tag used for the specific subject. Inclusion of such sub-lists 
-  for every page can make the index rather lengthy, and since each page should 
-  include its own <a href="#page-index">Page Index</a>, it may make the navigation 
-  of the documentation easier if such sub-lists are avoided. However, there is 
-  one exception to this guideline: reference documentation should contain a link 
-  to every header file in the library and a sub-list with a link to every macro, 
-  value, type, class, function and object (see <a href="structure.html">Documentation 
-  Structure</a>) found in the header. Users aren't always sure what header file 
-  any of these may be contained in, so this structure in the index allows for 
-  easy navigation of the reference documentation.</p>
-<p>The index list should generally be constructed using an HTML &quot;definition 
-  list&quot; (&lt;dl&gt; and &lt;dt&gt; tags). A definition list has no bullets 
-  or ordered specifications and produces a cleaner layout then an unordered list 
-  (&lt;ul&gt; and &lt;li&gt; tags) or an ordered list (&lt;ol&gt; and &lt;li&gt; 
-  tags). If you choose to use the common <a href="#boost-style-sheet">Boost Style 
-  Sheet</a> you should add a <code>class="index"</code> attribute/value pair to 
-  the &lt;dl&gt; tag.</p>
-<p>An Index page <a href="#index-template">template</a> is provided for use.</p>
-<h3><a name="overview-page"></a>Overview</h3>
-<p>The Overview page is used to introduce the reader to the library. It should 
-  give a high-level overview of the purpose of the library and introduce the reader 
-  to any concepts they may be unfamiliar with. This may also be an appropriate 
-  place for some &quot;light&quot; rationale, though more thorough presentation 
-  of any rationale would be better placed in the <a href="#rationale-page">Rational 
-  Page</a>.</p>
-<p>Like most content pages, the Overview page should include a <a href="#page-index">Page 
-  Index</a>.</p>
-<p>An Overview page <a href="#overview-template">template</a> is provided for 
+
+  <h2><a name="introduction" id="introduction"></a>Introduction</h2>
+
+  <p>Boost places no requirements on the design of HTML documentation for
+  library submitters. If you are submitting a library for which documentation
+  already exists in either HTML or in a form easily converted to HTML then
+  there is no need for you to read this document. However, if you have not
+  yet written the documentation, or if you expect to have to translate
+  documentation written in a format not easily convertible to HTML then this
+  document can give you a lot of information on how to go about writing
+  documentation in HTML.</p>
+
+  <p>In several places this document assumes you're writing the documentation
+  to conform to the structure described in the <a href=
+  "structure.html">Documentation Structure</a> document. There is no
+  requirement that your documentation content follow these guidelines, but
+  they provide an effective way to communicate technical specifications for a
+  library in a terse yet precise manner that's familiar to many Boost
+  users.</p>
+
+  <p>This document also contains links to <a href="#templates">HTML template
+  files</a> that can be used to rapidly develop documentation for a library
+  submission. These templates follow the guidelines presented here and in the
+  <a href="structure.html">Documentation Structure</a> document.</p>
+
+  <h2><a name="common-pages" id="common-pages"></a>Common Pages Included in
+  HTML Documentation</h2>
+
+  <p>Most HTML documentation projects will contain some common pages. General
+  guidelines for these common pages are provided below.</p>
+
+  <h3><a name="index-page" id="index-page"></a>Index</h3>
+
+  <p>The index page is the first page presented to a user when he browses the
+  documentation. Generally this page should not contain any actual content,
+  but instead contains a list of links to specific content. At a minimum this
+  list should contain a link to every HTML page contained in the
+  documentation. Optionally, sub-lists may be provided for individual pages
+  linking to specific subjects within the page. These sub-lists should form a
+  "tree" hierarchy based on the level of heading tag used for the specific
+  subject. Inclusion of such sub-lists for every page can make the index
+  rather lengthy, and since each page should include its own <a href=
+  "#page-index">Page Index</a>, it may make the navigation of the
+  documentation easier if such sub-lists are avoided. However, there is one
+  exception to this guideline: reference documentation should contain a link
+  to every header file in the library and a sub-list with a link to every
+  macro, value, type, class, function and object (see <a href=
+  "structure.html">Documentation Structure</a>) found in the header. Users
+  aren't always sure what header file any of these may be contained in, so
+  this structure in the index allows for easy navigation of the reference
+  documentation.</p>
+
+  <p>The index list should generally be constructed using an HTML "definition
+  list" (&lt;dl&gt; and &lt;dt&gt; tags). A definition list has no bullets or
+  ordered specifications and produces a cleaner layout then an unordered list
+  (&lt;ul&gt; and &lt;li&gt; tags) or an ordered list (&lt;ol&gt; and
+  &lt;li&gt; tags). If you choose to use the common <a href=
+  "#boost-style-sheet">Boost Style Sheet</a> you should add a
+  <code>class="index"</code> attribute/value pair to the &lt;dl&gt; tag.</p>
+
+  <p>An Index page <a href="#index-template">template</a> is provided for
   use.</p>
-<h3><a name="definitions-page"></a>Definitions</h3>
-<p>The Definitions page is used to provide a list of definitions for terms that 
-  a user may be unfamiliar with.</p>
-<p>The definition list should generally be constructed using an HTML &quot;definition 
-  list&quot; (&lt;dl&gt; and &lt;DT&gt; tags). A definition list has no bullets 
-  or ordered specifications and produces a cleaner layout then an unordered list 
-  (&lt;UL&gt; and &lt;li&gt; tags) or an ordered list (&lt;ol&gt; and &lt;li&gt; 
-  tags). If you choose to use the common <a href="#boost-style-sheet">Boost Style 
-  Sheet</a> you should add a <code>class="definition"</code> attribute/value pair 
-  to the &lt;dl&gt; tag.</p>
-<p>Because this page's content should only contain a list of definitions, it should 
-  not have a <a href="#page-index">Page Index</a>.</p>
-<p></p>
-<p> A Definitions page <a href="#definitions-template">template</a> is provided 
+
+  <h3><a name="overview-page" id="overview-page"></a>Overview</h3>
+
+  <p>The Overview page is used to introduce the reader to the library. It
+  should give a high-level overview of the purpose of the library and
+  introduce the reader to any concepts they may be unfamiliar with. This may
+  also be an appropriate place for some "light" rationale, though more
+  thorough presentation of any rationale would be better placed in the
+  <a href="#rationale-page">Rational Page</a>.</p>
+
+  <p>Like most content pages, the Overview page should include a <a href=
+  "#page-index">Page Index</a>.</p>
+
+  <p>An Overview page <a href="#overview-template">template</a> is provided
   for use.</p>
-<h3><a name="rationale-page"></a>Rationale</h3>
-<p>The Rationale page is used to provide lengthy descriptions of the rationale 
-  behind the library's design. This information helps users to understand why 
-  a library was designed the way it was and may reduce the frequency of a number 
-  of frequently asked questions. For a better description of why rationale is 
-  important see the <a href="http://www.boost.org/more/lib_guide.htm#Rationale">Rationale 
-  rationale</a> in the general submission guidelines.</p>
-<p>Like most content pages, the Rationale page should include a <a href="#page-index">Page 
+
+  <h3><a name="definitions-page" id="definitions-page"></a>Definitions</h3>
+
+  <p>The Definitions page is used to provide a list of definitions for terms
+  that a user may be unfamiliar with.</p>
+
+  <p>The definition list should generally be constructed using an HTML
+  "definition list" (&lt;dl&gt; and &lt;DT&gt; tags). A definition list has
+  no bullets or ordered specifications and produces a cleaner layout then an
+  unordered list (&lt;UL&gt; and &lt;li&gt; tags) or an ordered list
+  (&lt;ol&gt; and &lt;li&gt; tags). If you choose to use the common <a href=
+  "#boost-style-sheet">Boost Style Sheet</a> you should add a
+  <code>class="definition"</code> attribute/value pair to the &lt;dl&gt;
+  tag.</p>
+
+  <p>Because this page's content should only contain a list of definitions,
+  it should not have a <a href="#page-index">Page Index</a>.</p>
+
+  <p>A Definitions page <a href="#definitions-template">template</a> is
+  provided for use.</p>
+
+  <h3><a name="rationale-page" id="rationale-page"></a>Rationale</h3>
+
+  <p>The Rationale page is used to provide lengthy descriptions of the
+  rationale behind the library's design. This information helps users to
+  understand why a library was designed the way it was and may reduce the
+  frequency of a number of frequently asked questions. For a better
+  description of why rationale is important see the <a href=
+  "http://www.boost.org/more/lib_guide.htm#Rationale">Rationale rationale</a>
+  in the general submission guidelines.</p>
+
+  <p>Like most content pages, the Rationale page should include a <a href=
+  "#page-index">Page Index</a>.</p>
+
+  <p>A Rationale page <a href="#rationale-template">template</a> is provided
+  for use.</p>
+
+  <h3><a name="configuration-page" id="configuration-page"></a>Configuration
+  Information</h3>
+
+  <p>The Configuration Information page is used to document configuration
+  macros used by the library. Such macros belong in one of three groups:
+  macros used by library implenters defined in
+  <code>&lt;boost/config.hpp&gt;</code>, macros used by library users to
+  detect platform configuration information and macros defined by library
+  users to configure library behavior.</p>
+
+  <p>Like most content pages, the Overview page should include a <a href=
+  "#page-index">Page Index</a>.</p>
+
+  <p>A Configuration page <a href="#configuration-template">template</a> is
+  provided for use.</p>
+
+  <h3><a name="faq-page" id="faq-page"></a>Frequently Asked Questions</h3>
+
+  <p>As a library matures the users will have questions about the usage of
+  the library. Often users will ask the same questions over and over again.
+  Rather than having to deal with answering the question every time it's
+  asked, a Frequently Asked Questions (commonly known as FAQs) page can be
+  used to document the questions and answers. This is such a valuable piece
+  of documentation not only for the users but for the maintainers as well,
+  that a FAQ page should be provided from the outset. If there are no
+  questions that will obviously become a FAQ, the initial page may just
+  indicate that there are no FAQs yet. This empty place holder helps to
+  indicate to the users that you plan to address any FAQs as they occur.</p>
+
+  <p>The <a href="#page-index">Page Index</a> for the FAQ page should contain
+  a list of all the questions contained in the document. The actual question
+  entries should be formatted with the question in a heading tag and the
+  answers in standard paragraph format. This provides a clean presentation
+  that's easy to read.</p>
+
+  <p>A Frequently Asked Questions page <a href="#faq-template">template</a>
+  is provided for use.</p>
+
+  <h3><a name="bibliography-page" id=
+  "bibliography-page"></a>Bibliography</h3>
+
+  <p>The Bibliography page is used to document any bibliographical
+  information associated with references made within the documentation to
+  external resources. Parenthetical references are used within the
+  documentation which link to entries in the Bibliography page.
+  Bibliographical entries provide detailed information about the external
+  resource and may contain hyper links to the resource if it's available
+  online. There are several formal styles used for writing bibliographies.
+  You may use what ever style you want, but one of the better styles to
+  consider using can be referenced <a href=
+  "http://www.columbia.edu/cu/cup/cgos/idx_basic.html">here</a>.</p>
+
+  <p>Since the Bibliography page should contain only bibliographical
+  information there is no need for a <a href="#page-index">Page
   Index</a>.</p>
-<p></p>
-<p>A Rationale page <a href="#rationale-template">template</a> is provided for 
-  use.</p>
-<h3><a name="configuration-page"></a>Configuration Information</h3>
-<p>The Configuration Information page is used to document configuration macros 
-  used by the library. Such macros belong in one of three groups: macros used 
-  by library implenters defined in <code>&lt;boost/config.hpp&gt;</code>, macros 
-  used by library users to detect platform configuration information and macros 
-  defined by library users to configure library behavior.</p>
-<p>Like most content pages, the Overview page should include a <a href="#page-index">Page 
+
+  <p>A Bibliography page <a href="#bibliography-template">template</a> is
+  provided for use.</p>
+
+  <h3><a name="acknowledgements-page" id=
+  "acknowledgements-page"></a>Acknowledgment</h3>
+
+  <p>The Acknowledgment page is used to give credit where credit is due. When
+  individuals provide input on the design or implementation, or when you make
+  use of someone else's work, you should acknowledge them. This is a courtesy
+  that you'd expect others to extend to you, so you should strive to
+  acknowledge the efforts of everyone else in your own documentation.</p>
+
+  <p>Since the Acknowledgment page should contain only a list of
+  acknowledgment there is no need for a <a href="#page-index">Page
   Index</a>.</p>
-<p></p>
-<p>A Configuration page <a href="#configuration-template">template</a> is provided 
-  for use.</p>
-<h3><a name="faq-page"></a>Frequently Asked Questions</h3>
-<p>As a library matures the users will have questions about the usage of the library. 
-  Often users will ask the same questions over and over again. Rather than having 
-  to deal with answering the question every time it's asked, a Frequently Asked 
-  Questions (commonly known as FAQs) page can be used to document the questions 
-  and answers. This is such a valuable piece of documentation not only for the 
-  users but for the maintainers as well, that a FAQ page should be provided from 
-  the outset. If there are no questions that will obviously become a FAQ, the 
-  initial page may just indicate that there are no FAQs yet. This empty place 
-  holder helps to indicate to the users that you plan to address any FAQs as they 
-  occur.</p>
-<p>The <a href="#page-index">Page Index</a> for the FAQ page should contain a 
-  list of all the questions contained in the document. The actual question entries 
-  should be formatted with the question in a heading tag and the answers in standard 
-  paragraph format. This provides a clean presentation that's easy to read.</p>
-<p>A Frequently Asked Questions page <a href="#faq-template">template</a> is provided 
-  for use.</p>
-<h3><a name="bibliography-page"></a>Bibliography</h3>
-<p>The Bibliography page is used to document any bibliographical information associated 
-  with references made within the documentation to external resources. Parenthetical 
-  references are used within the documentation which link to entries in the Bibliography 
-  page. Bibliographical entries provide detailed information about the external 
-  resource and may contain hyper links to the resource if it's available online. 
-  There are several formal styles used for writing bibliographies. You may use 
-  what ever style you want, but one of the better styles to consider using can 
-  be referenced <a href="http://www.columbia.edu/cu/cup/cgos/idx_basic.html">here</a>.</p>
-<p>Since the Bibliography page should contain only bibliographical information 
-  there is no need for a <a href="#page-index">Page Index</a>.</p>
-<p>A Bibliography page <a href="#bibliography-template">template</a> is provided 
-  for use.</p>
-<h3><a name="acknowledgements-page"></a>Acknowledgment</h3>
-<p>The Acknowledgment page is used to give credit where credit is due. When individuals 
-  provide input on the design or implementation, or when you make use of someone 
-  else's work, you should acknowledge them. This is a courtesy that you'd expect 
-  others to extend to you, so you should strive to acknowledge the efforts of 
-  everyone else in your own documentation.</p>
-<p>Since the Acknowledgment page should contain only a list of acknowledgment 
-  there is no need for a <a href="#page-index">Page Index</a>.</p>
-<p>An Acknowledgments page <a href="#acknowledgements-template">template</a> is 
+
+  <p>An Acknowledgments page <a href=
+  "#acknowledgements-template">template</a> is provided for use.</p>
+
+  <h3><a name="header-page" id="header-page"></a>Header Reference</h3>
+
+  <p>The Header Reference pages are the most important pages in your
+  documentation. They document all library headers, including all the macros,
+  values, types, classes, functions and objects defined in them. In general
+  it may prove useful to follow the guidelines in <a href=
+  "structure.html">Documentation Structure</a> when writing the content for
+  these pages.</p>
+
+  <p>Like most content pages, the Header Reference pages should include a
+  <a href="#page-index">Page Index</a>.</p>
+
+  <p>A Header Reference page <a href="#header-template">template</a> is
   provided for use.</p>
-<h3><a name="header-page"></a>Header Reference</h3>
-<p>The Header Reference pages are the most important pages in your documentation. 
-  They document all library headers, including all the macros, values, types, 
-  classes, functions and objects defined in them. In general it may prove useful 
-  to follow the guidelines in <a href="structure.html">Documentation Structure</a> 
-  when writing the content for these pages.</p>
-<p>Like most content pages, the Header Reference pages should include a <a href="#page-index">Page 
-  Index</a>.</p>
-<p>A Header Reference page <a href="#header-template">template</a> is provided 
-  for use.</p>
-<h2><a name="layout"></a>Layout</h2>
-<p>There are certain page layout concepts that will be used frequently in many 
-  of your pages. This section outlines some general guidelines that you can follow 
-  when designing each of these layout concepts for your documentation.</p>
-<h3><a name="page-banner"></a>Page Banner</h3>
-<p>The Page Banner is located at the very top of a page and provides quick information 
-  about the page contents. This includes the Boost logo, which indicates to the 
-  reader that this page is part of the Boost web site, a title for the documentation 
-  (generally the library name) and the page title. The Boost logo should hyper 
-  link to the Boost home page on the index page and to the index page on all other 
-  pages. This allows the user to easily navigate through the Boost web site and 
-  through the documentation. The &lt;title&gt; tag for the HTML page should consist 
-  of the documentation title and the page title separated by a hyphen.</p>
-<p>The Page Banner should be separated from the rest of the page by the use of 
-  an &lt;hr&gt; tag. This helps to clearly separate the actual content from the 
-  title information and produces cleaner text.</p>
-<h3><a name="page-index"></a>Page Index</h3>
-<p>The page index is used to quickly navigate to the various sections of the documentation 
-  on the page, and when present should be located just below the Page Banner.</p>
-<p>The index list should generally be constructed using an HTML &quot;definition 
-  list&quot; (&lt;dl&gt; and &lt;DT&gt; tags). A definition list has no bullets 
-  or ordered specifications and produces a cleaner layout then an unordered list 
-  (&lt;UL&gt; and &lt;li&gt; tags) or an ordered list (&lt;ol&gt; and &lt;li&gt; 
-  tags). If you choose to use the Boost Style Sheet you should add a <code>class="page-index"</code> 
-  attribute/value pair to the &lt;dl&gt; tag.</p>
-<p>Most pages should include a Page Index.</p>
-<h3><a name="content"></a>Documentation Content</h3>
-<p>The page's actual documentation content will be formatted according to the 
-  specific needs of individual pages, and should be placed right after the Page 
-  Index if present, or after the Page Banner if not. In general the documentation 
-  content will take the form of paragraph text contained underneath section headings.</p>
-<h3><a name="doc-footnotes"></a>Footnotes</h3>
-<p>Footnotes may be used within a page's documentation. Within the documentation 
-  content a footnote reference should take the form of a footnote number in parentheses 
-  (the parentheses make it easier for the reader to click on the hyper link) hyper 
-  linking to the actual footnote at the bottom of the page's documentation content. 
-  You may either use the &lt;sup&gt; tag to format such footnote numbers, or, 
-  preferably, you can use a CSS style class in order to distinguish the number 
-  as a footnote instead of as part of the actual text. If you choose to use the 
-  common <a href="#boost-style-sheet">Boost Style Sheet</a>, a <code>footnote</code> 
+
+  <h2><a name="layout" id="layout"></a>Layout</h2>
+
+  <p>There are certain page layout concepts that will be used frequently in
+  many of your pages. This section outlines some general guidelines that you
+  can follow when designing each of these layout concepts for your
+  documentation.</p>
+
+  <h3><a name="page-banner" id="page-banner"></a>Page Banner</h3>
+
+  <p>The Page Banner is located at the very top of a page and provides quick
+  information about the page contents. This includes the Boost logo, which
+  indicates to the reader that this page is part of the Boost web site, a
+  title for the documentation (generally the library name) and the page
+  title. The Boost logo should hyper link to the Boost home page on the index
+  page and to the index page on all other pages. This allows the user to
+  easily navigate through the Boost web site and through the documentation.
+  The &lt;title&gt; tag for the HTML page should consist of the documentation
+  title and the page title separated by a hyphen.</p>
+
+  <p>The Page Banner should be separated from the rest of the page by the use
+  of an &lt;hr&gt; tag. This helps to clearly separate the actual content
+  from the title information and produces cleaner text.</p>
+
+  <h3><a name="page-index" id="page-index"></a>Page Index</h3>
+
+  <p>The page index is used to quickly navigate to the various sections of
+  the documentation on the page, and when present should be located just
+  below the Page Banner.</p>
+
+  <p>The index list should generally be constructed using an HTML "definition
+  list" (&lt;dl&gt; and &lt;DT&gt; tags). A definition list has no bullets or
+  ordered specifications and produces a cleaner layout then an unordered list
+  (&lt;UL&gt; and &lt;li&gt; tags) or an ordered list (&lt;ol&gt; and
+  &lt;li&gt; tags). If you choose to use the Boost Style Sheet you should add
+  a <code>class="page-index"</code> attribute/value pair to the &lt;dl&gt;
+  tag.</p>
+
+  <p>Most pages should include a Page Index.</p>
+
+  <h3><a name="content" id="content"></a>Documentation Content</h3>
+
+  <p>The page's actual documentation content will be formatted according to
+  the specific needs of individual pages, and should be placed right after
+  the Page Index if present, or after the Page Banner if not. In general the
+  documentation content will take the form of paragraph text contained
+  underneath section headings.</p>
+
+  <h3><a name="doc-footnotes" id="doc-footnotes"></a>Footnotes</h3>
+
+  <p>Footnotes may be used within a page's documentation. Within the
+  documentation content a footnote reference should take the form of a
+  footnote number in parentheses (the parentheses make it easier for the
+  reader to click on the hyper link) hyper linking to the actual footnote at
+  the bottom of the page's documentation content. You may either use the
+  &lt;sup&gt; tag to format such footnote numbers, or, preferably, you can
+  use a CSS style class in order to distinguish the number as a footnote
+  instead of as part of the actual text. If you choose to use the common
+  <a href="#boost-style-sheet">Boost Style Sheet</a>, a <code>footnote</code>
   class is defined for this purpose.</p>
-<h3><a name="revision-info"></a>Revision Information</h3>
-<p>At the bottom of every page should be some revision information indicating 
-  when the page was last revised. This information should be separated from the 
-  rest of the page above by an &lt;hr&gt; tag. The following HTML code snippet 
-  can be used to track this revision information (this code uses some server components 
-  that exist on the Boost web site to automatically track revision dates with 
-  out the need for hand editing the date text):</p>
-<pre>&lt;hr&gt;
+
+  <h3><a name="revision-info" id="revision-info"></a>Revision
+  Information</h3>
+
+  <p>At the bottom of every page should be some revision information
+  indicating when the page was last revised. This information should be
+  separated from the rest of the page above by an &lt;hr&gt; tag. The
+  following HTML code snippet can be used to track this revision information
+  (this code uses some server components that exist on the Boost web site to
+  automatically track revision dates with out the need for hand editing the
+  date text):</p>
+  <pre>
+&lt;hr&gt;
 &lt;p&gt;Revised
-  &lt;!--webbot bot=&quot;Timestamp&quot; S-Type=&quot;EDITED&quot; S-Format=&quot;%d %B, %Y&quot; startspan --&gt;
+  &lt;!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan --&gt;
   01 January, 2001
-  &lt;!--webbot bot=&quot;Timestamp&quot; endspan i-checksum=&quot;39359&quot; --&gt;
+  &lt;!--webbot bot="Timestamp" endspan i-checksum="39359" --&gt;
 &lt;/p&gt;
 </pre>
-<h3><a name="copyright"></a>Copyright Information</h3>
-<p>The very bottom of the page should contain any copyright information that applies 
-  to the document.</p>
-<h2><a name="format"></a>Format</h2>
-<p>This section provides general guidelines for formatting documentation using 
-  HTML. The description of the various &quot;common pages&quot; gave specific 
-  details for formatting specific sections of the documentation, which should 
+
+  <h3><a name="copyright" id="copyright"></a>Copyright Information</h3>
+
+  <p>The very bottom of the page should contain any copyright information
+  that applies to the document.</p>
+
+  <h2><a name="format" id="format"></a>Format</h2>
+
+  <p>This section provides general guidelines for formatting documentation
+  using HTML. The description of the various "common pages" gave specific
+  details for formatting specific sections of the documentation, which should
   override these guidelines.</p>
-<h3><a name="code-format"></a>Code</h3>
-<p>Code within the documentation should be placed within either &lt;code&gt;&lt;/code&gt; 
-  or &lt;pre&gt;&lt;/pre&gt; tags. For code that's placed inline with other text 
-  you use &lt;code&gt;&lt;/code&gt; tags, while &lt;pre&gt;&lt;/pre&gt; tags are 
-  used for code &quot;blocks&quot;. If a cascading style sheet is used to specify 
-  formatting for these tags, a fixed width sans serif font should be used. This 
-  insures that the code is easily distinguishable from the rest of the text. It 
-  may also be beneficial to set the style for &lt;pre&gt;&lt;/pre&gt; tags to 
-  indent the text, to help separate code blocks from other structural HTML blocks. 
-  The <a href="#boost-style-sheet">Boost Style Sheet</a> specifies formatting 
-  for these tags.</p>
-<p><b>Note:</b> &quot;Code&quot; includes variable names, function names, etc.</p>
-<h3><a name="lists"></a>Lists</h3>
-<p>Lists should be constructed as unordered (&lt;UL&gt; and &lt;li&gt; tags), 
-  ordered (&lt;ol&gt; and &lt;li&gt; tags) or definition (&lt;dl&gt; and &lt;DT&gt; 
-  tags) lists in HTML. You use an unordered list when you need a collection of 
-  items that don't have any kind of logical ordering, such as a list of data types 
-  that are defined by the library and can be used for a template argument. You 
-  use an ordered list when the collection of items must be grouped in a logical 
-  ordering, such as when enumerating the steps that an action logically performs. 
-  You use a definition list when the list consists of not only items that have 
-  no logical ordering, but also contains definitions/descriptions/etc. of the 
-  items. A good example of this is the function specifications as described in 
-  <a href="structure.html">Documentation Structure</a>.</p>
-<h3><a name="graphics"></a>Graphics</h3>
-<p>Graphics should be used very sparingly, if at all. Graphic images greatly effect 
-  the download time for many people, which can discourage users from reading the 
-  documentation. If you need graphic images to help illustrate something in your 
-  documentation consider supplying only a link to the image within the documentation, 
-  instead of embedding it directly in the text. If an image is going to be included 
-  in the text of the document you should specify the image's size in the &lt;img&gt; 
-  tag, in order to allow the user's browser to optimize the formatting of the 
-  text before the image is loaded.</p>
-<h3><a name="non-breaking-spaces"></a>Non-breaking Spaces</h3>
-<p>Non-breaking spaces (&amp;nbsp;) should be avoided in HTML text. Generally 
-  there are more appropriate ways to format the document, such as using list constructs 
-  or specifying indentation as a style attribute or in cascading style sheets.</p>
-<h3><a name="style-sheets"></a>Cascading Style Sheets</h3>
-<p>Cascading style sheets allow you to apply some advanced formatting styles to 
-  an HTML document. More importantly, they allow you to change the formatting 
-  in a single file and effect all pages using the style sheet. Instead of struggling 
-  to produce a specific format in HTML it's often easier and more flexible to 
-  specify the formatting in a style sheet.</p>
-<h4><a name="boost-style-sheet"></a>Boost Style Sheet</h4>
-<p>The concept of using cascading style sheets to format HTML is such a good idea 
-  that it can be beneficial to apply this across the entire Boost site. Of course 
-  we can't require this (if Boost were to require such trivia for submissions 
-  it's likely that many programmers would be discouraged from contributing). However, 
-  a &quot;standard&quot; Boost style sheet (http://www.boost.org/boost.css) is 
-  supplied anyway, so that a contributer can quickly and easily produce clear 
-  and consistent documentation that reflects a Boost &quot;brand&quot; if they 
-  so choose. If, at a later date, it's decided to update the Boost &quot;brand&quot;, 
-  it may be done in this single file and all documents using the style sheet will 
-  automatically be updated.</p>
-<p>The Boost supplied style sheet not only specifies styles for many standard 
-  tags, it also specifies several style &quot;classes&quot;. A class is specified 
-  for a given tag instead of being applied to all instances of a given tag type. 
-  Below is a list of the classes specified in the Boost style sheet and a description 
-  of when to use them:</p>
-<dl> 
-  <dt><b>index</b> Used for &lt;dl&gt; tags when writing index lists.</dt>
-  <dt><b>page-index</b> Used for &lt;dl&gt; tags when writing page index lists.</dt>
-  <dt><b>Footnote</b> Used when writing Footnote numbers.</dt>
-  <dt><b>function-semantics</b> Used for &lt;dl&gt; tags when writing function 
-    semantic lists.</dt>
-</dl>
-<h2><a name="templates"></a>Templates</h2>
-<p>Instead of hand coding every HTML page, HTML "templates" can be used instead. 
-  The list below provides links to templates that may be used when writing documentation 
-  for a contribution to Boost. Links provided in these templates assume the files 
-  will reside in the &quot;traditional&quot; directory hierarchy of <i>boost/libs/library/doc</i>. 
-  They may need correcting if the file will reside in some other location.</p>
-<p><b>Note:</b> Since these &quot;templates&quot; are just HTML pages simply clicking 
-  on the links below will load the template in your browser. You will need to 
-  use a browser specific method to download the files instead of loading them 
-  into the browser (for instance, on most Windows browsers you can right click 
-  on the link and select the appropriate command from the context sensitive menu).</p>
-<ul>
-  <li><a name="index-template"></a><a href="template/index.html">Index Page Template</a></li>
-  <li><a name="overview-template"></a><a href="template/overview.html">Overview 
-    Page Template</a></li>
-  <li><a name="definitions-template"></a><a href="template/definitions.html">Definitions 
-    Page Template</a></li>
-  <li><a name="rationale-template"></a><a href="template/rationale.html">Rationale 
-    Page Template</a></li>
-  <li><a name="configuration-template"></a><a href="template/configuration.html">Configuration 
-    Page Template</a></li>
-  <li><a name="faq-template"></a><a href="template/faq.html">FAQ (Frequently Asked 
-    Questions) Page Template</a></li>
-  <li><a name="bibliography-template"></a><a href="template/bibliography.html">Bibliography 
-    Page Template</a></li>
-  <li><a name="acknowledgements-template"></a><a href="template/acknowledgments.html">Acknowledgments 
-    Page Template</a></li>
-  <li><a name="header-template"></a><a href="template/header.html">Header Page 
+
+  <h3><a name="code-format" id="code-format"></a>Code</h3>
+
+  <p>Code within the documentation should be placed within either
+  &lt;code&gt;&lt;/code&gt; or &lt;pre&gt;&lt;/pre&gt; tags. For code that's
+  placed inline with other text you use &lt;code&gt;&lt;/code&gt; tags, while
+  &lt;pre&gt;&lt;/pre&gt; tags are used for code "blocks". If a cascading
+  style sheet is used to specify formatting for these tags, a fixed width
+  sans serif font should be used. This insures that the code is easily
+  distinguishable from the rest of the text. It may also be beneficial to set
+  the style for &lt;pre&gt;&lt;/pre&gt; tags to indent the text, to help
+  separate code blocks from other structural HTML blocks. The <a href=
+  "#boost-style-sheet">Boost Style Sheet</a> specifies formatting for these
+  tags.</p>
+
+  <p><b>Note:</b> "Code" includes variable names, function names, etc.</p>
+
+  <h3><a name="lists" id="lists"></a>Lists</h3>
+
+  <p>Lists should be constructed as unordered (&lt;UL&gt; and &lt;li&gt;
+  tags), ordered (&lt;ol&gt; and &lt;li&gt; tags) or definition (&lt;dl&gt;
+  and &lt;DT&gt; tags) lists in HTML. You use an unordered list when you need
+  a collection of items that don't have any kind of logical ordering, such as
+  a list of data types that are defined by the library and can be used for a
+  template argument. You use an ordered list when the collection of items
+  must be grouped in a logical ordering, such as when enumerating the steps
+  that an action logically performs. You use a definition list when the list
+  consists of not only items that have no logical ordering, but also contains
+  definitions/descriptions/etc. of the items. A good example of this is the
+  function specifications as described in <a href=
+  "structure.html">Documentation Structure</a>.</p>
+
+  <h3><a name="graphics" id="graphics"></a>Graphics</h3>
+
+  <p>Graphics should be used very sparingly, if at all. Graphic images
+  greatly effect the download time for many people, which can discourage
+  users from reading the documentation. If you need graphic images to help
+  illustrate something in your documentation consider supplying only a link
+  to the image within the documentation, instead of embedding it directly in
+  the text. If an image is going to be included in the text of the document
+  you should specify the image's size in the &lt;img&gt; tag, in order to
+  allow the user's browser to optimize the formatting of the text before the
+  image is loaded.</p>
+
+  <h3><a name="non-breaking-spaces" id="non-breaking-spaces"></a>Non-breaking
+  Spaces</h3>
+
+  <p>Non-breaking spaces (&amp;nbsp;) should be avoided in HTML text.
+  Generally there are more appropriate ways to format the document, such as
+  using list constructs or specifying indentation as a style attribute or in
+  cascading style sheets.</p>
+
+  <h3><a name="style-sheets" id="style-sheets"></a>Cascading Style
+  Sheets</h3>
+
+  <p>Cascading style sheets allow you to apply some advanced formatting
+  styles to an HTML document. More importantly, they allow you to change the
+  formatting in a single file and effect all pages using the style sheet.
+  Instead of struggling to produce a specific format in HTML it's often
+  easier and more flexible to specify the formatting in a style sheet.</p>
+
+  <h4><a name="boost-style-sheet" id="boost-style-sheet"></a>Boost Style
+  Sheet</h4>
+
+  <p>The concept of using cascading style sheets to format HTML is such a
+  good idea that it can be beneficial to apply this across the entire Boost
+  site. Of course we can't require this (if Boost were to require such trivia
+  for submissions it's likely that many programmers would be discouraged from
+  contributing). However, a "standard" Boost style sheet
+  (http://www.boost.org/boost.css) is supplied anyway, so that a contributer
+  can quickly and easily produce clear and consistent documentation that
+  reflects a Boost "brand" if they so choose. If, at a later date, it's
+  decided to update the Boost "brand", it may be done in this single file and
+  all documents using the style sheet will automatically be updated.</p>
+
+  <p>The Boost supplied style sheet not only specifies styles for many
+  standard tags, it also specifies several style "classes". A class is
+  specified for a given tag instead of being applied to all instances of a
+  given tag type. Below is a list of the classes specified in the Boost style
+  sheet and a description of when to use them:</p>
+
+  <dl>
+    <dt><b>index</b> Used for &lt;dl&gt; tags when writing index lists.</dt>
+
+    <dt><b>page-index</b> Used for &lt;dl&gt; tags when writing page index
+    lists.</dt>
+
+    <dt><b>Footnote</b> Used when writing Footnote numbers.</dt>
+
+    <dt><b>function-semantics</b> Used for &lt;dl&gt; tags when writing
+    function semantic lists.</dt>
+  </dl>
+
+  <h2><a name="templates" id="templates"></a>Templates</h2>
+
+  <p>Instead of hand coding every HTML page, HTML "templates" can be used
+  instead. The list below provides links to templates that may be used when
+  writing documentation for a contribution to Boost. Links provided in these
+  templates assume the files will reside in the "traditional" directory
+  hierarchy of <i>boost/libs/library/doc</i>. They may need correcting if the
+  file will reside in some other location.</p>
+
+  <p><b>Note:</b> Since these "templates" are just HTML pages simply clicking
+  on the links below will load the template in your browser. You will need to
+  use a browser specific method to download the files instead of loading them
+  into the browser (for instance, on most Windows browsers you can right
+  click on the link and select the appropriate command from the context
+  sensitive menu).</p>
+
+  <ul>
+    <li><a name="index-template" id="index-template"></a><a href=
+    "template/index.html">Index Page Template</a></li>
+
+    <li><a name="overview-template" id="overview-template"></a><a href=
+    "template/overview.html">Overview Page Template</a></li>
+
+    <li><a name="definitions-template" id="definitions-template"></a><a href=
+    "template/definitions.html">Definitions Page Template</a></li>
+
+    <li><a name="rationale-template" id="rationale-template"></a><a href=
+    "template/rationale.html">Rationale Page Template</a></li>
+
+    <li><a name="configuration-template" id=
+    "configuration-template"></a><a href=
+    "template/configuration.html">Configuration Page Template</a></li>
+
+    <li><a name="faq-template" id="faq-template"></a><a href=
+    "template/faq.html">FAQ (Frequently Asked Questions) Page
     Template</a></li>
-</ul>
-<hr>
-<p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->29 November, 2003<!--webbot bot="Timestamp" endspan i-checksum="39371" -->
-</p>
-<p><i>&copy; Copyright <a href="mailto:williamkempf at hotmail.com">William E. Kempf</a> 
-  2001. All Rights Reserved.</i></p>
+
+    <li><a name="bibliography-template" id=
+    "bibliography-template"></a><a href=
+    "template/bibliography.html">Bibliography Page Template</a></li>
+
+    <li><a name="acknowledgements-template" id=
+    "acknowledgements-template"></a><a href=
+    "template/acknowledgments.html">Acknowledgments Page Template</a></li>
+
+    <li><a name="header-template" id="header-template"></a><a href=
+    "template/header.html">Header Page Template</a></li>
+  </ul>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+  <p><i>Copyright &copy; 2001 <a href=
+  "mailto:williamkempf at hotmail.com">William E. Kempf</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
-</html>
\ No newline at end of file
+</html>

Modified: boost/trunk/more/writingdoc/index.html
===================================================================
--- boost/trunk/more/writingdoc/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/writingdoc/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,36 +1,57 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../boost.css">
-<title>Writing Documentation for Boost</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link rel="stylesheet" type="text/css" href="../../boost.css">
+
+  <title>Writing Documentation for Boost</title>
 </head>
-<body link="#0000ff" vlink="#800080">
-<table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-  <tr> 
-    <td valign="top" width="300"> 
-      <h3><a href="../../index.htm"><img height="86" width="277" alt="C++ Boost" src="../../boost.png" border="0"></a></h3>
-    </td>
-    <td valign="top"> 
-      <h1 align="center">Writing Documentation for Boost</h1>
-      <h2 align="center">Index</h2>
-    </td>
-  </tr>
-</table>
-<hr>
-<h2>Contents</h2>
-<dl class="index">
-  <dt><a href="introduction.html">Introduction</a></dt>
-  <dt><a href="structure.html">Documentation Structure</a></dt>
-  <dt><a href="design.html">HTML Design</a></dt>
-</dl>
-<hr>
-<p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
-  05 November, 2001 
-  <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
-</p>
-<p><i>&copy; Copyright <a href="mailto:williamkempf at hotmail.com">William E. Kempf</a> 
-  2001. All Rights Reserved.</i></p>
+
+<body link="#0000FF" vlink="#800080">
+  <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
+  "header">
+    <tr>
+      <td valign="top" width="300">
+        <h3><a href="../../index.htm"><img height="86" width="277" alt=
+        "C++ Boost" src="../../boost.png" border="0"></a></h3>
+      </td>
+
+      <td valign="top">
+        <h1 align="center">Writing Documentation for Boost</h1>
+
+        <h2 align="center">Index</h2>
+      </td>
+    </tr>
+  </table>
+  <hr>
+
+  <h2>Contents</h2>
+
+  <dl class="index">
+    <dt><a href="introduction.html">Introduction</a></dt>
+
+    <dt><a href="structure.html">Documentation Structure</a></dt>
+
+    <dt><a href="design.html">HTML Design</a></dt>
+  </dl>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+  <p><i>Copyright &copy; 2001 <a href=
+  "mailto:williamkempf at hotmail.com">William E. Kempf</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/more/writingdoc/introduction.html
===================================================================
--- boost/trunk/more/writingdoc/introduction.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/writingdoc/introduction.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,46 +1,68 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../boost.css">
-<title>Writing Documentation for Boost - Introduction</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link rel="stylesheet" type="text/css" href="../../boost.css">
+
+  <title>Writing Documentation for Boost - Introduction</title>
 </head>
-<body link="#0000ff" vlink="#800080">
-<table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-  <tr> 
-    <td valign="top" width="300"> 
-      <h3><a href="index.html"><img height="86" width="277" alt="C++ Boost" src="../../boost.png" border="0"></a></h3>
-    </td>
-    <td valign="top"> 
-      <h1 align="center">Writing Documentation for Boost</h1>
-      <h2 align="center">Introduction</h2>
-    </td>
-  </tr>
-</table>
-<hr>
-<p>Boost does not have any requirements on how you write your documentation. If 
-  you are submitting a library that already has written documentation in HTML 
-  format, there is no reason to change it to follow any of the guidelines presented 
-  here. However, if you have documentation that's not in HTML format and can't 
-  be easily converted to HTML, or if you're starting on a library from scratch 
-  or have a library with no documentation then these guidelines can make writing 
-  the documentation much easier.</p>
-<p>The section on <a href="structure.html">Documentation Structure</a> describes 
-  how to go about structuring the documentation's content. This section may be 
-  helpful even for libraries that already have documentation. If there's a desire 
-  to present the library for possible inclusion by the C++ Standards Committee 
-  then there may be a need to restructure the documentation's content in order 
-  to insure the content meets explicit requirements for library components (Section 
-  17.3).</p>
-<p>The section on <a href="design.html">HTML Design</a> gives general rules to 
-  follow when writing HTML documentation in order to give a professional and consistent 
-  look. This section also contains some template files that can be used to rapidly 
-  create documentation pages.</p>
-<hr>
-<p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->29 November, 2003<!--webbot bot="Timestamp" endspan i-checksum="39371" -->
-</p>
-<p><i>&copy; Copyright <a href="mailto:williamkempf at hotmail.com">William E. Kempf</a> 
-  2001. All Rights Reserved.</i></p>
+
+<body link="#0000FF" vlink="#800080">
+  <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
+  "header">
+    <tr>
+      <td valign="top" width="300">
+        <h3><a href="index.html"><img height="86" width="277" alt="C++ Boost"
+        src="../../boost.png" border="0"></a></h3>
+      </td>
+
+      <td valign="top">
+        <h1 align="center">Writing Documentation for Boost</h1>
+
+        <h2 align="center">Introduction</h2>
+      </td>
+    </tr>
+  </table>
+  <hr>
+
+  <p>Boost does not have any requirements on how you write your
+  documentation. If you are submitting a library that already has written
+  documentation in HTML format, there is no reason to change it to follow any
+  of the guidelines presented here. However, if you have documentation that's
+  not in HTML format and can't be easily converted to HTML, or if you're
+  starting on a library from scratch or have a library with no documentation
+  then these guidelines can make writing the documentation much easier.</p>
+
+  <p>The section on <a href="structure.html">Documentation Structure</a>
+  describes how to go about structuring the documentation's content. This
+  section may be helpful even for libraries that already have documentation.
+  If there's a desire to present the library for possible inclusion by the
+  C++ Standards Committee then there may be a need to restructure the
+  documentation's content in order to insure the content meets explicit
+  requirements for library components (Section 17.3).</p>
+
+  <p>The section on <a href="design.html">HTML Design</a> gives general rules
+  to follow when writing HTML documentation in order to give a professional
+  and consistent look. This section also contains some template files that
+  can be used to rapidly create documentation pages.</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+  <p><i>Copyright &copy; 2001 <a href=
+  "mailto:williamkempf at hotmail.com">William E. Kempf</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
-</html>
\ No newline at end of file
+</html>

Modified: boost/trunk/more/writingdoc/structure.html
===================================================================
--- boost/trunk/more/writingdoc/structure.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/writingdoc/structure.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,254 +1,433 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../boost.css">
-<title>Writing Documentation for Boost - Documentation Structure</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link rel="stylesheet" type="text/css" href="../../boost.css">
+
+  <title>Writing Documentation for Boost - Documentation Structure</title>
 </head>
-<body link="#0000ff" vlink="#800080">
-<table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-  <tr> 
-    <td valign="top" width="300"> 
-      <h3><a href="index.html"><img height="86" width="277" alt="C++ Boost" src="../../boost.png" border="0"></a></h3>
-    </td>
-    <td valign="top"> 
-      <h1 align="center">Writing Documentation for Boost</h1>
-      <h2 align="center">Documentation Structure</h2>
-    </td>
-  </tr>
-</table>
-<hr>
-<dl class="page-index">
-  <dt><a href="#introduction">Introduction</a></dt>
-  <dt><a href="#standards-conforming">Standards Conforming Documentation</a></dt>
+
+<body link="#0000FF" vlink="#800080">
+  <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
+  "header">
+    <tr>
+      <td valign="top" width="300">
+        <h3><a href="index.html"><img height="86" width="277" alt="C++ Boost"
+        src="../../boost.png" border="0"></a></h3>
+      </td>
+
+      <td valign="top">
+        <h1 align="center">Writing Documentation for Boost</h1>
+
+        <h2 align="center">Documentation Structure</h2>
+      </td>
+    </tr>
+  </table>
+  <hr>
+
   <dl class="page-index">
-    <dt><a href="#elements">Document elements</a></dt>
-	<dl class="page-index">
-	  <dt><a href="#summary">Summary</a></dt>
-      <dt><a href="#requirements">Requirements</a></dt>
-      <dt><a href="#detailed-specs">Detailed specifications</a></dt>
-      <dt><a href="#ref-cpp">References to the Standard C++ library</a></dt>
-      <dt><a href="#ref-c">References to the Standard C library</a></dt>
-	</dl>
-	<dt><a href="#other">Other conventions</a></dt>
-	<dl class="page-index">
-	  <dt><a href="#type-descs">Type descriptions</a></dt>
-	</dl>
+    <dt><a href="#introduction">Introduction</a></dt>
+
+    <dt><a href="#standards-conforming">Standards Conforming
+    Documentation</a></dt>
+
+    <dd>
+      <dl class="page-index">
+        <dt><a href="#elements">Document elements</a></dt>
+
+        <dd>
+          <dl class="page-index">
+            <dt><a href="#summary">Summary</a></dt>
+
+            <dt><a href="#requirements">Requirements</a></dt>
+
+            <dt><a href="#detailed-specs">Detailed specifications</a></dt>
+
+            <dt><a href="#ref-cpp">References to the Standard C++
+            library</a></dt>
+
+            <dt><a href="#ref-c">References to the Standard C
+            library</a></dt>
+          </dl>
+        </dd>
+
+        <dt><a href="#other">Other conventions</a></dt>
+
+        <dd>
+          <dl class="page-index">
+            <dt><a href="#type-descs">Type descriptions</a></dt>
+          </dl>
+        </dd>
+      </dl>
+    </dd>
+
+    <dt><a href="#more">More Information</a></dt>
+
+    <dd>
+      <dl class="page-index">
+        <dt><a href="#function-semantic-explanations">Function semantic
+        element explanations</a></dt>
+
+        <dd>
+          <dl class="page-index">
+            <dt><a href="#requires">Requires</a></dt>
+
+            <dt><a href="#effects">Effects</a></dt>
+
+            <dt><a href="#postconditions">Postconditions</a></dt>
+
+            <dt><a href="#returns">Returns</a></dt>
+
+            <dt><a href="#throws">Throws</a></dt>
+
+            <dt><a href="#complexity">Complexity</a></dt>
+
+            <dt><a href="#rationale">Rationale</a></dt>
+          </dl>
+        </dd>
+      </dl>
+    </dd>
+
+    <dt><a href="#footnotes">Footnotes</a></dt>
   </dl>
-  <dt><a href="#more">More Information</a></dt>
-  <dl class="page-index">
-    <dt><a href="#function-semantic-explanations">Function semantic element explanations</a></dt>
-	<dl class="page-index">
-	  <dt><a href="#requires">Requires</a></dt>
-	  <dt><a href="#effects">Effects</a></dt>
-	  <dt><a href="#postconditions">Postconditions</a></dt>
-	  <dt><a href="#returns">Returns</a></dt>
-	  <dt><a href="#throws">Throws</a></dt>
-	  <dt><a href="#complexity">Complexity</a></dt>
-	  <dt><a href="#rationale">Rationale</a></dt>
-	</dl>
+
+  <h2><a name="introduction" id="introduction">Introduction</a></h2>
+
+  <p>Boost itself does not require any specific documentation structure. The
+  C++ Standard, however, has very explicit requirements for the description
+  of library components (Section 17.3). So for Boost libraries likely to be
+  proposed for inclusion in the standard, it is highly desirable to structure
+  documentation in a way that meets the requirements of the the standard.
+  Doing so eliminates the need to rewrite the documentation for
+  standardization.</p>
+
+  <p>Library developers should remember that for a library to be accepted as
+  part of the C++ Standard Library, the proposal must include full wording.
+  The committee will not do that work for you.</p>
+
+  <p>Beyond that, the documentation structure required for the standard is an
+  effective way to communicate the technical specifications for a library.
+  Although terse, it is already familiar to many Boost users, and is far more
+  precise than most ad hoc documentation structures.</p>
+
+  <p>The following description is for the structure of documentation required
+  by the standard. Boost libraries should also provided additional
+  documentation, such as introductory, tutorial, example, and rationale
+  material.</p>
+
+  <h2><a name="standards-conforming" id="standards-conforming">Standards
+  Conforming</a> Documentation</h2>
+
+  <h3><a name="elements" id="elements">Document elements</a></h3>
+
+  <p>Each document contains the following elements, as applicable<a class=
+  "footnote" href="#footnote1">(1)</a>:</p>
+
+  <ul>
+    <li><a href="#summary">Summary</a></li>
+
+    <li><a href="#requirements">Requirements</a></li>
+
+    <li><a href="#detailed-specs">Detailed specifications</a></li>
+
+    <li><a href="#ref-cpp">References to the Standard C++ library</a></li>
+
+    <li><a href="#ref-c">References to the Standard C library</a></li>
+  </ul>
+
+  <h4><a name="summary" id="summary">Summary</a></h4>
+
+  <p>The Summary provides a synopsis of the category, and introduces the
+  first-level subclauses. Each subclause also provides a summary, listing the
+  headers specified in the subclause and the library entities provided in
+  each header.</p>
+
+  <p>Paragraphs labeled "Note(s):" or "Example(s):" are informative, other
+  paragraphs are normative.</p>
+
+  <p>The summary and the detailed specifications are presented in the
+  order:</p>
+
+  <ul>
+    <li>Macros</li>
+
+    <li>Values</li>
+
+    <li>Types</li>
+
+    <li>Classes</li>
+
+    <li>Functions</li>
+
+    <li>Objects</li>
+  </ul>
+
+  <h4><a name="requirements" id="requirements">Requirements</a></h4>
+
+  <p>The library can be extended by a C++ program. Each clause, as
+  applicable, describes the requirements that such extensions must meet. Such
+  extensions are generally one of the following:</p>
+
+  <ul>
+    <li>Template arguments</li>
+
+    <li>Derived classes</li>
+
+    <li>Containers, iterators, and/or algorithms that meet an interface
+    convention</li>
+  </ul>
+
+  <p>Interface convention requirements are stated as generally as possible.
+  Instead of stating "<code>class X</code> has to define a member function
+  <code>operator++()</code>," the interface requires "for any object
+  <code>x</code> of <code>class X</code>, <code>++x</code> is defined." That
+  is, whether the operator is a member is unspecified.</p>
+
+  <p>Requirements are stated in terms of well-defined expressions, which
+  define valid terms of the types that satisfy the requirements. For every
+  set of requirements there is a table that specifies an initial set of the
+  valid expressions and their semantics. Any generic algorithm that uses the
+  requirements is described in terms of the valid expressions for its formal
+  type parameters.</p>
+
+  <p>Template argument requirements are sometimes referenced by name.</p>
+
+  <p>In some cases the semantic requirements are presented as C++ code. Such
+  code is intended as a specification of equivalance of a construct to
+  another construct, not necessarily as the way the construct must be
+  implemented.<a class="footnote" href="#footnote2">(2)</a></p>
+
+  <h4><a name="detailed-specs" id="detailed-specs">Detailed
+  specification</a></h4>
+
+  <p>The detailed specifications each contain the following elements:</p>
+
+  <ul>
+    <li>Name and brief description</li>
+
+    <li>Synopsis (class definition or function prototype, as
+    appropriate)</li>
+
+    <li>Restrictions on template arguments, if any</li>
+
+    <li>Description of class invariants</li>
+
+    <li>Description of function semantics</li>
+  </ul>
+
+  <p>Descriptions of class member functions follow the order (as
+  appropriate)<a class="footnote" href="#footnote3">(3)</a>:</p>
+
+  <ul>
+    <li>Constructor(s) and destructor</li>
+
+    <li>Copying and assignment functions</li>
+
+    <li>Comparison functions</li>
+
+    <li>Modifier functions</li>
+
+    <li>Observer functions</li>
+
+    <li>Operators and other non-member functions</li>
+  </ul>
+
+  <p>Descriptions of function semantics contain the following <a name=
+  "function-elements" id="function-elements">elements</a> (as
+  appropriate)<a class="footnote" href="#footnote4">(4):</a></p>
+
+  <dl class="function-semantics">
+    <dt><b><a href="#requires">Requires:</a></b> the preconditions for
+    calling the function</dt>
+
+    <dt><b><a href="#effects">Effects:</a></b> the actions performed by the
+    function</dt>
+
+    <dt><b><a href="#postconditions">Postconditions:</a></b> the observable
+    results established by the function</dt>
+
+    <dt><b><a href="#returns">Returns:</a></b> a description of the value(s)
+    returned by the function</dt>
+
+    <dt><b><a href="#throws">Throws:</a></b> any exceptions thrown by the
+    function, and the conditions that would cause the exception</dt>
+
+    <dt><b><a href="#complexity">Complexity:</a></b> the time and/or space
+    complexity of the function</dt>
+
+    <dt><b><a href="#rationale">Rationale:</a></b> the rationale for the
+    function's design or existence</dt>
   </dl>
-  <dt><a href="#footnotes">Footnotes</a></dt>
-</dl>
-<h2><a name="introduction">Introduction</a></h2>
-<p>Boost itself does not require any specific documentation structure. The C++ 
-  Standard, however, has very explicit requirements for the description of library 
-  components (Section 17.3). So for Boost libraries likely to be proposed for 
-  inclusion in the standard, it is highly desirable to structure documentation 
-  in a way that meets the requirements of the the standard. Doing so eliminates 
-  the need to rewrite the documentation for standardization.</p>
-<p>Library developers should remember that for a library to be accepted as part 
-  of the C++ Standard Library, the proposal must include full wording. The committee 
-  will not do that work for you.</p>
-<p>Beyond that, the documentation structure required for the standard is an effective 
-  way to communicate the technical specifications for a library. Although terse, 
-  it is already familiar to many Boost users, and is far more precise than most 
-  ad hoc documentation structures.</p>
-<p>The following description is for the structure of documentation required by 
-  the standard. Boost libraries should also provided additional documentation, 
-  such as introductory, tutorial, example, and rationale material.</p>
-<h2><a name="standards-conforming">Standards Conforming</a> Documentation</h2>
-<h3><a name="elements">Document elements</a></h3>
-<p>Each document contains the following elements, as applicable<a class="footnote" href="#footnote1">(1)</a>:</p>
-<ul>
-  <li><a href="#summary">Summary</a></li>
-  <li><a href="#requirements">Requirements</a></li>
-  <li><a href="#detailed-specs">Detailed specifications</a></li>
-  <li><a href="#ref-cpp">References to the Standard C++ library</a></li>
-  <li><a href="#ref-c">References to the Standard C library</a></li>
-</ul>
-<h4><a name="summary">Summary</a></h4>
-<p>The Summary provides a synopsis of the category, and introduces the first-level 
-  subclauses. Each subclause also provides a summary, listing the headers specified 
-  in the subclause and the library entities provided in each header.</p>
-<p>Paragraphs labeled "Note(s):" or "Example(s):" are informative, other paragraphs 
-  are normative.</p>
-<p>The summary and the detailed specifications are presented in the order:</p>
-<ul>
-  <li>Macros</li>
-  <li>Values</li>
-  <li>Types</li>
-  <li>Classes</li>
-  <li>Functions</li>
-  <li>Objects</li>
-</ul>
-<h4><a name="requirements">Requirements</a></h4>
-<p>The library can be extended by a C++ program. Each clause, as applicable, describes 
-  the requirements that such extensions must meet. Such extensions are generally 
-  one of the following:</p>
-<ul>
-  <li>Template arguments</li>
-  <li>Derived classes</li>
-  <li>Containers, iterators, and/or algorithms that meet an interface convention</li>
-</ul>
-<p>Interface convention requirements are stated as generally as possible. Instead 
-  of stating "<code>class X</code> has to define a member function <code>operator++()</code>," 
-  the interface requires "for any object <code>x</code> of <code>class X</code>, 
-  <code>++x</code> is defined." That is, whether the operator is a member is unspecified.</p>
-<p>Requirements are stated in terms of well-defined expressions, which define 
-  valid terms of the types that satisfy the requirements. For every set of requirements 
-  there is a table that specifies an initial set of the valid expressions and 
-  their semantics. Any generic algorithm that uses the requirements is described 
-  in terms of the valid expressions for its formal type parameters.</p>
-<p>Template argument requirements are sometimes referenced by name.</p>
-<p>In some cases the semantic requirements are presented as C++ code. Such code 
-  is intended as a specification of equivalance of a construct to another construct, 
-  not necessarily as the way the construct must be implemented.<a class="footnote" href="#footnote2">(2)</a></p>
-<h4><a name="detailed-specs">Detailed specification</a></h4>
-<p>The detailed specifications each contain the following elements:</p>
-<ul>
-  <li>Name and brief description</li>
-  <li>Synopsis (class definition or function prototype, as appropriate)</li>
-  <li>Restrictions on template arguments, if any</li>
-  <li>Description of class invariants</li>
-  <li>Description of function semantics</li>
-</ul>
-<p>Descriptions of class member functions follow the order (as appropriate)<a class="footnote" href="#footnote3">(3)</a>:</p>
-<ul>
-  <li>Constructor(s) and destructor</li>
-  <li>Copying and assignment functions</li>
-  <li>Comparison functions</li>
-  <li>Modifier functions</li>
-  <li>Observer functions</li>
-  <li>Operators and other non-member functions</li>
-</ul>
-<p>Descriptions of function semantics contain the following <a name="function-elements">elements</a> 
-  (as appropriate)<a class="footnote" href="#footnote4">(4):</a></p>
-<dl class="function-semantics">
-  <dt><b><a href="#requires">Requires:</a></b> the preconditions for calling the 
-    function</dt>
-  <dt><b><a href="#effects">Effects:</a></b> the actions performed by the function</dt>
-  <dt><b><a href="#postconditions">Postconditions:</a></b> the observable results 
-    established by the function</dt>
-  <dt><b><a href="#returns">Returns:</a></b> a description of the value(s) returned 
-    by the function</dt>
-  <dt><b><a href="#throws">Throws:</a></b> any exceptions thrown by the function, 
-    and the conditions that would cause the exception</dt>
-  <dt><b><a href="#complexity">Complexity:</a></b> the time and/or space complexity 
-    of the function</dt>
-  <dt><b><a href="#rationale">Rationale:</a></b> the rationale for the function's design
-    or existence</dt>
-</dl>
-<p>Complexity requirements specified in the library clauses are upper bounds, 
-  and implementations that provide better complexity guarantees satisfy the requirements.</p>
-<h4><a name="ref-cpp">References to the C++ Standard library</a></h4>
-<h4><a name="ref-c">References to the C Standard library</a></h4>
-<h3><a name="other">Other conventions</a></h3>
-<p>These conventions are for describing implementation-defined types, and member 
-  functions.</p>
-<h4><a name="type-descs">Type descriptions</a></h4>
-<p>The Requirements subclauses may describe names that are used to specify constraints 
-  on template arguments.</p>
-<h2><a name="more">More Information</a></h2>
-<h3><a name="function-semantic-explanations">Function semantic element explanations</a></h3>
-<p>The function semantic element description <a href="#function-elements">above</a> 
-  is taken directly from the C++ standard, and is quite terse. Here is a more 
-  detailed explanation of each of the elements.</p>
-<p>Note the use of the <code>&lt;code&gt; ... &lt;/code&gt;</code> font tag to 
-  distinguish actual C++ usage from English prose.</p>
-<h4><a name="requires">Requires</a></h4>
-<p>Preconditions for calling the function, typically expressed as predicates. 
-  The most common preconditions are requirements on the value of arguments, often 
-  in the form of C++ expressions. For example, 
-<pre> 
+
+  <p>Complexity requirements specified in the library clauses are upper
+  bounds, and implementations that provide better complexity guarantees
+  satisfy the requirements.</p>
+
+  <h4><a name="ref-cpp" id="ref-cpp">References to the C++ Standard
+  library</a></h4>
+
+  <h4><a name="ref-c" id="ref-c">References to the C Standard
+  library</a></h4>
+
+  <h3><a name="other" id="other">Other conventions</a></h3>
+
+  <p>These conventions are for describing implementation-defined types, and
+  member functions.</p>
+
+  <h4><a name="type-descs" id="type-descs">Type descriptions</a></h4>
+
+  <p>The Requirements subclauses may describe names that are used to specify
+  constraints on template arguments.</p>
+
+  <h2><a name="more" id="more">More Information</a></h2>
+
+  <h3><a name="function-semantic-explanations" id=
+  "function-semantic-explanations">Function semantic element
+  explanations</a></h3>
+
+  <p>The function semantic element description <a href=
+  "#function-elements">above</a> is taken directly from the C++ standard, and
+  is quite terse. Here is a more detailed explanation of each of the
+  elements.</p>
+
+  <p>Note the use of the <code>&lt;code&gt; ... &lt;/code&gt;</code> font tag
+  to distinguish actual C++ usage from English prose.</p>
+
+  <h4><a name="requires" id="requires">Requires</a></h4>
+
+  <p>Preconditions for calling the function, typically expressed as
+  predicates. The most common preconditions are requirements on the value of
+  arguments, often in the form of C++ expressions. For example,</p>
+  <pre>
+ 
 <code>void limit( int * p, int min, int max );</code>
 </pre>
-<dl class="function-semantics">
-  <dt><b>Requires:</b> <code>p != 0 &amp;&amp; min &lt;= max</code></dt>
-</dl>
-<p>Requirements already enforced by the C++ language rules (such as the type of 
-  arguments) are not repeated in Requires paragraphs.</p>
-<h4><a name="effects">Effects</a></h4>
-<p>The actions performed by the function, described either in prose or in C++. 
-  A description in prose is often less limiting on implementors, but is often 
-  less precise than C++ code.</p>
-<p>If an effect is specified in one of the other elements, particularly <i>postconditions</i>, 
-  <i>returns</i>, or <i>throws</i>, it is not also described in the <i>effects</i> 
-  paragraph. Having only a single description ensures that there is one and only 
-  one specification, and thus eliminates the risk of divergence.</p>
-<h4><a name="postconditions">Postconditions</a></h4>
-<p>The observable results of the function, such as the value of variables. Postconditions 
-  are often expressed as predicates that are true after the function completes, 
-  in the form of C++ expressions. For example:</p>
-<pre> 
+
+  <dl class="function-semantics">
+    <dt><b>Requires:</b> <code>p != 0 &amp;&amp; min &lt;= max</code></dt>
+  </dl>
+
+  <p>Requirements already enforced by the C++ language rules (such as the
+  type of arguments) are not repeated in Requires paragraphs.</p>
+
+  <h4><a name="effects" id="effects">Effects</a></h4>
+
+  <p>The actions performed by the function, described either in prose or in
+  C++. A description in prose is often less limiting on implementors, but is
+  often less precise than C++ code.</p>
+
+  <p>If an effect is specified in one of the other elements, particularly
+  <i>postconditions</i>, <i>returns</i>, or <i>throws</i>, it is not also
+  described in the <i>effects</i> paragraph. Having only a single description
+  ensures that there is one and only one specification, and thus eliminates
+  the risk of divergence.</p>
+
+  <h4><a name="postconditions" id="postconditions">Postconditions</a></h4>
+
+  <p>The observable results of the function, such as the value of variables.
+  Postconditions are often expressed as predicates that are true after the
+  function completes, in the form of C++ expressions. For example:</p>
+  <pre>
+ 
 void make_zero_if_negative( int &amp; x );
 </pre>
-<dl class="function-semantics">
-  <dt><b>Postcondition:</b> <code>x &gt;= 0</code></dt>
-</dl>
-<h4><a name="returns">Returns</a></h4>
-<p>The value returned by the function, usually in the form of a C++ expression. 
-  For example:</p>
-<pre>int sum( int x, int y );
+
+  <dl class="function-semantics">
+    <dt><b>Postcondition:</b> <code>x &gt;= 0</code></dt>
+  </dl>
+
+  <h4><a name="returns" id="returns">Returns</a></h4>
+
+  <p>The value returned by the function, usually in the form of a C++
+  expression. For example:</p>
+  <pre>
+int sum( int x, int y );
 </pre>
-<dl class="function-semantics"> 
-  <dt><b>Returns:</b> <code>x + y</code></dt>
-</dl>
-<p>Only specify the return value; the type is already dictated by C++ language 
-  rules. 
-<h4><a name="throws">Throws</a></h4>
-<p>Specify both the type of exception thrown, and the condition that causes the 
-  exception to be thrown. For example, the <code>std::basic_string</code> class 
-  specifies: 
-<pre> 
+
+  <dl class="function-semantics">
+    <dt><b>Returns:</b> <code>x + y</code></dt>
+  </dl>
+
+  <p>Only specify the return value; the type is already dictated by C++
+  language rules.</p>
+
+  <h4><a name="throws" id="throws">Throws</a></h4>
+
+  <p>Specify both the type of exception thrown, and the condition that causes
+  the exception to be thrown. For example, the <code>std::basic_string</code>
+  class specifies:</p>
+  <pre>
+ 
 void resize(size_type n, charT c);
 </pre>
-<dl class="function-semantics">
-  <dt><b>Throws:</b> <code> length_error</code> if <code>n &gt; max_size()</code>.</dt>
-</dl>
-<h4><a name="complexity">Complexity</a></h4>
-<p>Specifying the time and/or space complexity of a function is often not desirable 
-  because it over-constrains implementors and is hard to specify correctly. Complexity 
-  is thus often best left as a quality of implementation issue.</p>
-<p>A library component, however, can become effectively non-portable if there 
-  is wide variation in performance between conforming implementations. Containers 
-  are a prime example. In these cases it becomes worthwhile to specify complexity.</p>
-<p>Complexity is often specified in generalized <a href="http://hissa.nist.gov/dads/HTML/bigOnotation.html"> 
-  &quot;Big-O&quot; notation</a>.</p>
-<h4><a name="rationale">Rationale</a></h4>
-<p>Specifying the rationale for a function's design or existence can often give users
-  a lot of insight into why a library is designed the way it is. More importantly, it
-  can help prevent "fixing" something that wasn't really broken as the library matures.</p>  
-<h2><a name="footnotes">Footnotes</a></h2>
-<dl>
-  <dt><a class="footnote" name="footnote1">(1)</a> 
-    To save space, items that do not apply to a clause are omitted. For example, 
-    if a clause does not specify any requirements, there will be no "Requirements" 
+
+  <dl class="function-semantics">
+    <dt><b>Throws:</b> <code>length_error</code> if <code>n &gt;
+    max_size()</code>.</dt>
+  </dl>
+
+  <h4><a name="complexity" id="complexity">Complexity</a></h4>
+
+  <p>Specifying the time and/or space complexity of a function is often not
+  desirable because it over-constrains implementors and is hard to specify
+  correctly. Complexity is thus often best left as a quality of
+  implementation issue.</p>
+
+  <p>A library component, however, can become effectively non-portable if
+  there is wide variation in performance between conforming implementations.
+  Containers are a prime example. In these cases it becomes worthwhile to
+  specify complexity.</p>
+
+  <p>Complexity is often specified in generalized <a href=
+  "http://hissa.nist.gov/dads/HTML/bigOnotation.html">"Big-O"
+  notation</a>.</p>
+
+  <h4><a name="rationale" id="rationale">Rationale</a></h4>
+
+  <p>Specifying the rationale for a function's design or existence can often
+  give users a lot of insight into why a library is designed the way it is.
+  More importantly, it can help prevent "fixing" something that wasn't really
+  broken as the library matures.</p>
+
+  <h2><a name="footnotes" id="footnotes">Footnotes</a></h2>
+
+  <dl>
+    <dt><a class="footnote" name="footnote1" id="footnote1">(1)</a> To save
+    space, items that do not apply to a clause are omitted. For example, if a
+    clause does not specify any requirements, there will be no "Requirements"
     subclause.</dt>
-  <dt><a class="footnote" name="footnote2">(2)</a> Although in some cases the 
-    code is unambiguously the optimum implementation.</dt>
-  <dt><a class="footnote" name="footnote3">(3)</a> To save space, items that do 
-    not apply to a class are omitted. For example, if a class does not specify 
-    any comparison functions, there will be no "Comparison functions" subclause.</dt>
-  <dt><a class="footnote" name="footnote4">(4)</a> To save space, items that do 
-    not apply to a function are omitted. For example, if a function does not specify 
-    any precondition, there will be no "Requires" paragraph.</dt>
-</dl>
-<hr>
-<p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->29 November, 2003<!--webbot bot="Timestamp" endspan i-checksum="39371" -->
-</p>
-<p><i>&copy; Copyright <a href="mailto:williamkempf at hotmail.com">William E. Kempf</a> 
-  2001. All Rights Reserved.</i></p>
+
+    <dt><a class="footnote" name="footnote2" id="footnote2">(2)</a> Although
+    in some cases the code is unambiguously the optimum implementation.</dt>
+
+    <dt><a class="footnote" name="footnote3" id="footnote3">(3)</a> To save
+    space, items that do not apply to a class are omitted. For example, if a
+    class does not specify any comparison functions, there will be no
+    "Comparison functions" subclause.</dt>
+
+    <dt><a class="footnote" name="footnote4" id="footnote4">(4)</a> To save
+    space, items that do not apply to a function are omitted. For example, if
+    a function does not specify any precondition, there will be no "Requires"
+    paragraph.</dt>
+  </dl>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+  <p><i>Copyright &copy; 2001 <a href=
+  "mailto:williamkempf at hotmail.com">William E. Kempf</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
-</html>
\ No newline at end of file
+</html>

Modified: boost/trunk/more/writingdoc/template/acknowledgments.html
===================================================================
--- boost/trunk/more/writingdoc/template/acknowledgments.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/writingdoc/template/acknowledgments.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,31 +1,48 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../../boost.css">
-<title>{{Library}} - Acknowledgments</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link rel="stylesheet" type="text/css" href="../../../boost.css">
+
+  <title>{{Library}} - Acknowledgments</title>
 </head>
-<body link="#0000ff" vlink="#800080">
-<table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-  <tr> 
-    <td valign="top" width="300"> 
-      <h3><a href="../../../index.htm"><img height="86" width="277" alt="C++ Boost" src="../../../boost.png" border="0"></a></h3>
-    </td>
-    <td valign="top"> 
-      <h1 align="center">{{Library}}</h1>
-      <h2 align="center">Acknowledgments</h2>
-    </td>
-  </tr>
-</table>
-<hr>
-{{text}}
-<hr>
-<p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
-  05 November, 2001 
-  <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
-</p>
-<p><i>&copy; Copyright <a href="mailto:{{address}}">{{author}}</a> 
-  2002. All Rights Reserved.</i></p>
+
+<body link="#0000FF" vlink="#800080">
+  <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
+  "header">
+    <tr>
+      <td valign="top" width="300">
+        <h3><a href="../../../index.htm"><img height="86" width="277" alt=
+        "C++ Boost" src="../../../boost.png" border="0"></a></h3>
+      </td>
+
+      <td valign="top">
+        <h1 align="center">{{Library}}</h1>
+
+        <h2 align="center">Acknowledgments</h2>
+      </td>
+    </tr>
+  </table>
+  <hr>
+  {{text}}
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+  <p><i>Copyright &copy; 2006 <a href=
+  "mailto:{{address}}">{{author}}</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/more/writingdoc/template/bibliography.html
===================================================================
--- boost/trunk/more/writingdoc/template/bibliography.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/writingdoc/template/bibliography.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,31 +1,48 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../../boost.css">
-<title>{{Library}} - Bibliography</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link rel="stylesheet" type="text/css" href="../../../boost.css">
+
+  <title>{{Library}} - Bibliography</title>
 </head>
-<body link="#0000ff" vlink="#800080">
-<table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-  <tr> 
-    <td valign="top" width="300"> 
-      <h3><a href="../../../index.htm"><img height="86" width="277" alt="C++ Boost" src="../../../boost.png" border="0"></a></h3>
-    </td>
-    <td valign="top"> 
-      <h1 align="center">{{Library}}</h1>
-      <h2 align="center">Bibliography</h2>
-    </td>
-  </tr>
-</table>
-<hr>
-{{bibliographical information}}
-<hr>
-<p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
-  05 November, 2001 
-  <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
-</p>
-<p><i>&copy; Copyright <a href="mailto:{{address}}">{{author}}</a> 
-  2002. All Rights Reserved.</i></p>
+
+<body link="#0000FF" vlink="#800080">
+  <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
+  "header">
+    <tr>
+      <td valign="top" width="300">
+        <h3><a href="../../../index.htm"><img height="86" width="277" alt=
+        "C++ Boost" src="../../../boost.png" border="0"></a></h3>
+      </td>
+
+      <td valign="top">
+        <h1 align="center">{{Library}}</h1>
+
+        <h2 align="center">Bibliography</h2>
+      </td>
+    </tr>
+  </table>
+  <hr>
+  {{bibliographical information}}
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+  <p><i>Copyright &copy; 2006 <a href=
+  "mailto:{{address}}">{{author}}</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/more/writingdoc/template/configuration.html
===================================================================
--- boost/trunk/more/writingdoc/template/configuration.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/writingdoc/template/configuration.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,90 +1,145 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../../boost.css">
-<title>{{Library}} - Configuration</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link rel="stylesheet" type="text/css" href="../../../boost.css">
+
+  <title>{{Library}} - Configuration</title>
 </head>
-<body link="#0000ff" vlink="#800080">
-<table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-  <tr> 
-    <td valign="top" width="300"> 
-      <h3><a href="../../../index.htm"><img height="86" width="277" alt="C++ Boost" src="../../../boost.png" border="0"></a></h3>
-    </td>
-    <td valign="top"> 
-      <h1 align="center">{{Library}}</h1>
-      <h2 align="center">Configuration</h2>
-    </td>
-  </tr>
-</table>
-<hr>
-<dl class="page-index">
-  <dt><a href="#introduction">Introduction</a></dt>
-  <dt><a href="#app-defined">Application Defined Macros</a></dt>
-  <dt><a href="#lib-defined-public">Public Library Defined Macros</a></dt>
-  <dt><a href="#lib-defined-impl">Library Defined Implementation Macros</a></dt>
-</dl>
-<h2><a name="introduction"></a>Introduction</h2>
-<p>{{library}} uses several configuration macros in <a href="http://www.boost.org/libs/config/config.htm">&lt;boost/config.hpp&gt;</a>, 
-  as well as configuration macros meant to be supplied by the application. These 
-  macros are documented here.</p>
-<h2><a name="app-defined"></a>Application Defined Macros</h2>
-<p>These are the macros that may be defined by an application using {{library}}.</p>
-<table summary="application defined macros" cellspacing="10" width="100%">
-  <tr>
-    <td><b>Macro</b></td>
-    <td><b>Meaning</b></td>
-  </tr>
-  <tr>
-    <td>{{macro}}</td>
-	<td>{{meaning}}</td>
-  </tr>
-  <tr>
-    <td>{{macro}}</td>
-	<td>{{meaning}}</td>
-  </tr>
-</table>
-<h2><a name="lib-defined-public"></a>Public Library Defined Macros</h2>
-<p>These macros are defined by {{library}} but are expected to be used by application 
-  code.</p>
-<table summary="public library defined macros" cellspacing="10" width="100%">
-  <tr>
-    <td><b>Macro</b></td>
-    <td><b>Meaning</b></td>
-  </tr>
-  <tr>
-    <td>{{macro}}</td>
-	<td>{{meaning}}</td>
-  </tr>
-  <tr>
-    <td>{{macro}}</td>
-	<td>{{meaning}}</td>
-  </tr>
-</table>
-<h2><a name="lib-defined-impl"></a>Library Defined Implementation Macros</h2>
-<p>These macros are defined by {{library}} and are implementation details of interest 
-  only to implementers.</p>
-<table summary="library defined implementation macros" cellspacing="10" width="100%">
-  <tr>
-    <td><b>Macro</b></td>
-    <td><b>Meaning</b></td>
-  </tr>
-  <tr>
-    <td>{{macro}}</td>
-	<td>{{meaning}}</td>
-  </tr>
-  <tr>
-    <td>{{macro}}</td>
-	<td>{{meaning}}</td>
-  </tr>
-</table>
-<hr>
-<p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
-  05 November, 2001 
-  <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
-</p>
-<p><i>&copy; Copyright <a href="mailto:{{address}}">{{author}}</a> 
-  2002. All Rights Reserved.</i></p>
+
+<body link="#0000FF" vlink="#800080">
+  <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
+  "header">
+    <tr>
+      <td valign="top" width="300">
+        <h3><a href="../../../index.htm"><img height="86" width="277" alt=
+        "C++ Boost" src="../../../boost.png" border="0"></a></h3>
+      </td>
+
+      <td valign="top">
+        <h1 align="center">{{Library}}</h1>
+
+        <h2 align="center">Configuration</h2>
+      </td>
+    </tr>
+  </table>
+  <hr>
+
+  <dl class="page-index">
+    <dt><a href="#introduction">Introduction</a></dt>
+
+    <dt><a href="#app-defined">Application Defined Macros</a></dt>
+
+    <dt><a href="#lib-defined-public">Public Library Defined Macros</a></dt>
+
+    <dt><a href="#lib-defined-impl">Library Defined Implementation
+    Macros</a></dt>
+  </dl>
+
+  <h2><a name="introduction" id="introduction"></a>Introduction</h2>
+
+  <p>{{library}} uses several configuration macros in <a href=
+  "http://www.boost.org/libs/config/config.htm">&lt;boost/config.hpp&gt;</a>,
+  as well as configuration macros meant to be supplied by the application.
+  These macros are documented here.</p>
+
+  <h2><a name="app-defined" id="app-defined"></a>Application Defined
+  Macros</h2>
+
+  <p>These are the macros that may be defined by an application using
+  {{library}}.</p>
+
+  <table summary="application defined macros" cellspacing="10" width="100%">
+    <tr>
+      <td><b>Macro</b></td>
+
+      <td><b>Meaning</b></td>
+    </tr>
+
+    <tr>
+      <td>{{macro}}</td>
+
+      <td>{{meaning}}</td>
+    </tr>
+
+    <tr>
+      <td>{{macro}}</td>
+
+      <td>{{meaning}}</td>
+    </tr>
+  </table>
+
+  <h2><a name="lib-defined-public" id="lib-defined-public"></a>Public Library
+  Defined Macros</h2>
+
+  <p>These macros are defined by {{library}} but are expected to be used by
+  application code.</p>
+
+  <table summary="public library defined macros" cellspacing="10" width=
+  "100%">
+    <tr>
+      <td><b>Macro</b></td>
+
+      <td><b>Meaning</b></td>
+    </tr>
+
+    <tr>
+      <td>{{macro}}</td>
+
+      <td>{{meaning}}</td>
+    </tr>
+
+    <tr>
+      <td>{{macro}}</td>
+
+      <td>{{meaning}}</td>
+    </tr>
+  </table>
+
+  <h2><a name="lib-defined-impl" id="lib-defined-impl"></a>Library Defined
+  Implementation Macros</h2>
+
+  <p>These macros are defined by {{library}} and are implementation details
+  of interest only to implementers.</p>
+
+  <table summary="library defined implementation macros" cellspacing="10"
+  width="100%">
+    <tr>
+      <td><b>Macro</b></td>
+
+      <td><b>Meaning</b></td>
+    </tr>
+
+    <tr>
+      <td>{{macro}}</td>
+
+      <td>{{meaning}}</td>
+    </tr>
+
+    <tr>
+      <td>{{macro}}</td>
+
+      <td>{{meaning}}</td>
+    </tr>
+  </table>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+  <p><i>Copyright &copy; 2006 <a href=
+  "mailto:{{address}}">{{author}}</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/more/writingdoc/template/definitions.html
===================================================================
--- boost/trunk/more/writingdoc/template/definitions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/writingdoc/template/definitions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,47 +1,78 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../../boost.css">
-<title>{{Library}} - Definitions</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link rel="stylesheet" type="text/css" href="../../../boost.css">
+
+  <title>{{Library}} - Definitions</title>
 </head>
-<body link="#0000ff" vlink="#800080">
-<table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-  <tr> 
-    <td valign="top" width="300"> 
-      <h3><a href="../../../index.htm"><img height="86" width="277" alt="C++ Boost" src="../../../boost.png" border="0"></a></h3>
-    </td>
-    <td valign="top"> 
-      <h1 align="center">{{Library}}</h1>
-      <h2 align="center">Definitions</h2>
-    </td>
-  </tr>
-</table>
-<hr>
-<h2>Contents</h2>
-<dl class="page-index">
-  <dt><a href="#introduction">Introduction</a></dt>
-  <dt><a href="#definitions">Definitions</a></dt>
+
+<body link="#0000FF" vlink="#800080">
+  <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
+  "header">
+    <tr>
+      <td valign="top" width="300">
+        <h3><a href="../../../index.htm"><img height="86" width="277" alt=
+        "C++ Boost" src="../../../boost.png" border="0"></a></h3>
+      </td>
+
+      <td valign="top">
+        <h1 align="center">{{Library}}</h1>
+
+        <h2 align="center">Definitions</h2>
+      </td>
+    </tr>
+  </table>
+  <hr>
+
+  <h2>Contents</h2>
+
   <dl class="page-index">
-    <dt><a href="#definition-term1">Term 1</a></dt>
-	<dt><a href="#definition-term2">Term 2</a></dt>
+    <dt><a href="#introduction">Introduction</a></dt>
+
+    <dt><a href="#definitions">Definitions</a></dt>
+
+    <dd>
+      <dl class="page-index">
+        <dt><a href="#definition-term1">Term 1</a></dt>
+
+        <dt><a href="#definition-term2">Term 2</a></dt>
+      </dl>
+    </dd>
   </dl>
-</dl>
-<hr>
-<h2><a name="introduction"></a>Introduction</h2>
-<p>{{Introductory text}}</p>
-<h2><a name="definitions"></a>Definitions</h2>
-<dl class="definitions">
-  <dt><a name="definition-term1"></a><b>{{term}}:</b> {{definition}}</dt>
-  <dt><a name="definition-term2"></a><b>{{term}}:</b> {{definition}}</dt>
-</dl>
-<hr>
-<p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
-  05 November, 2001 
-  <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
-</p>
-<p><i>&copy; Copyright <a href="mailto:{{address}}">{{author}}</a> 
-  2002. All Rights Reserved.</i></p>
+  <hr>
+
+  <h2><a name="introduction" id="introduction"></a>Introduction</h2>
+
+  <p>{{Introductory text}}</p>
+
+  <h2><a name="definitions" id="definitions"></a>Definitions</h2>
+
+  <dl class="definitions">
+    <dt><a name="definition-term1" id="definition-term1"></a><b>{{term}}:</b>
+    {{definition}}</dt>
+
+    <dt><a name="definition-term2" id="definition-term2"></a><b>{{term}}:</b>
+    {{definition}}</dt>
+  </dl>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+  <p><i>Copyright &copy; 2006 <a href=
+  "mailto:{{address}}">{{author}}</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/more/writingdoc/template/faq.html
===================================================================
--- boost/trunk/more/writingdoc/template/faq.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/writingdoc/template/faq.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,38 +1,61 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../../boost.css">
-<title>{{Library}} - FAQ</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link rel="stylesheet" type="text/css" href="../../../boost.css">
+
+  <title>{{Library}} - FAQ</title>
 </head>
-<body link="#0000ff" vlink="#800080">
-<table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-  <tr> 
-    <td valign="top" width="300"> 
-      <h3><a href="../../../index.htm"><img height="86" width="277" alt="C++ Boost" src="../../../boost.png" border="0"></a></h3>
-    </td>
-    <td valign="top"> 
-      <h1 align="center">{{Library}}</h1>
-      <h2 align="center">Frequently Asked Questions (FAQs)</h2>
-    </td>
-  </tr>
-</table>
-<hr>
-<dl class="page-index">
-  <dt><a href="#question1">{{question}}</a></dt>
-  <dt><a href="#question2">{{question}}</a></dt>
-</dl>
-<h2><a name="question1"></a>{{question}}</h2>
-<p>{{answer}}</p>
-<h2><a name="question2"></a>{{question}}</h2>
-<p>{{answer}}</p>
-<hr>
-<p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
-  05 November, 2001 
-  <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
-</p>
-<p><i>&copy; Copyright <a href="mailto:{{address}}">{{author}}</a> 
-  2002. All Rights Reserved.</i></p>
+
+<body link="#0000FF" vlink="#800080">
+  <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
+  "header">
+    <tr>
+      <td valign="top" width="300">
+        <h3><a href="../../../index.htm"><img height="86" width="277" alt=
+        "C++ Boost" src="../../../boost.png" border="0"></a></h3>
+      </td>
+
+      <td valign="top">
+        <h1 align="center">{{Library}}</h1>
+
+        <h2 align="center">Frequently Asked Questions (FAQs)</h2>
+      </td>
+    </tr>
+  </table>
+  <hr>
+
+  <dl class="page-index">
+    <dt><a href="#question1">{{question}}</a></dt>
+
+    <dt><a href="#question2">{{question}}</a></dt>
+  </dl>
+
+  <h2><a name="question1" id="question1"></a>{{question}}</h2>
+
+  <p>{{answer}}</p>
+
+  <h2><a name="question2" id="question2"></a>{{question}}</h2>
+
+  <p>{{answer}}</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+  <p><i>Copyright &copy; 2006 <a href=
+  "mailto:{{address}}">{{author}}</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/more/writingdoc/template/header.html
===================================================================
--- boost/trunk/more/writingdoc/template/header.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/writingdoc/template/header.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,195 +1,346 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../../boost.css">
-<title>{{library}} - Header &lt;{{header}}&gt;</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link rel="stylesheet" type="text/css" href="../../../boost.css">
+
+  <title>{{library}} - Header &lt;{{header}}&gt;</title>
 </head>
-<body link="#0000ff" vlink="#800080">
-<table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-  <tr> 
-    <td valign="top" width="300"> 
-      <h3><a href="../../../index.htm"><img height="86" width="277" alt="C++ Boost" src="../../../boost.png" border="0"></a></h3>
-    </td>
-    <td valign="top"> 
-      <h1 align="center">{{library}}</h1>
-      <h2 align="center">Header &lt;{{header}}&gt;</h2>
-    </td>
-  </tr>
-</table>
-<hr>
-<h2>Contents</h2>
-<dl class="page-index"> 
-  <dt><a href="#introduction">Introduction</a></dt>
-  <dt><a href="#macros">Macros</a></dt>
+
+<body link="#0000FF" vlink="#800080">
+  <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
+  "header">
+    <tr>
+      <td valign="top" width="300">
+        <h3><a href="../../../index.htm"><img height="86" width="277" alt=
+        "C++ Boost" src="../../../boost.png" border="0"></a></h3>
+      </td>
+
+      <td valign="top">
+        <h1 align="center">{{library}}</h1>
+
+        <h2 align="center">Header &lt;{{header}}&gt;</h2>
+      </td>
+    </tr>
+  </table>
+  <hr>
+
+  <h2>Contents</h2>
+
   <dl class="page-index">
-    <dt><a href="#macro-spec">{{macro name}}</a></dt>
+    <dt><a href="#introduction">Introduction</a></dt>
+
+    <dt><a href="#macros">Macros</a></dt>
+
+    <dd>
+      <dl class="page-index">
+        <dt><a href="#macro-spec">{{macro name}}</a></dt>
+      </dl>
+    </dd>
+
+    <dt><a href="#values">Values</a></dt>
+
+    <dd>
+      <dl class="page-index">
+        <dt><a href="#value-spec">{{value name}}</a></dt>
+      </dl>
+    </dd>
+
+    <dt><a href="#types">Types</a></dt>
+
+    <dd>
+      <dl class="page-index">
+        <dt><a href="#type-spec">{{type name}}</a></dt>
+      </dl>
+    </dd>
+
+    <dt><a href="#classes">Classes</a></dt>
+
+    <dd>
+      <dl class="page-index">
+        <dt><a href="#class-spec">Class <code>{{class name}}</code></a></dt>
+
+        <dd>
+          <dl class="page-index">
+            <dt><a href="#class-spec-synopsis">Class <code>{{class
+            name}}</code> synopsis</a></dt>
+
+            <dt><a href="#class-spec-ctors">Class <code>{{class name}}</code>
+            constructors and destructor</a></dt>
+
+            <dt><a href="#class-spec-comparisons">Class <code>{{class
+            name}}</code> comparison functions</a></dt>
+
+            <dt><a href="#class-spec-modifiers">Class <code>{{class
+            name}}</code> modifier functions</a></dt>
+
+            <dt><a href="#class-spec-observers">Class <code>{{class
+            name}}</code> observer functions</a></dt>
+
+            <dt><a href="#class-spec-statics">Class <code>{{class
+            name}}</code> static functions</a></dt>
+          </dl>
+        </dd>
+      </dl>
+    </dd>
+
+    <dt><a href="#functions">Functions</a></dt>
+
+    <dd>
+      <dl class="page-index">
+        <dt><a href="#function-spec">{{function name}}</a></dt>
+      </dl>
+    </dd>
+
+    <dt><a href="#objects">Objects</a></dt>
+
+    <dd>
+      <dl class="page-index">
+        <dt><a href="#object-spec">{{object name}}</a></dt>
+      </dl>
+    </dd>
+
+    <dt><a href="#examples">Example(s)</a></dt>
   </dl>
-  <dt><a href="#values">Values</a></dt>
-  <dl class="page-index">
-    <dt><a href="#value-spec">{{value name}}</a></dt>
-  </dl>
-  <dt><a href="#types">Types</a></dt>
-  <dl class="page-index">
-    <dt><a href="#type-spec">{{type name}}</a></dt>
-  </dl>
-  <dt><a href="#classes">Classes</a></dt>
-  <dl class="page-index">
-    <dt><a href="#class-spec">Class <code>{{class name}}</code></a></dt>
-	<dl class="page-index">
-	  <dt><a href="#class-spec-synopsis">Class <code>{{class name}}</code> synopsis</a></dt>
-	  <dt><a href="#class-spec-ctors">Class <code>{{class name}}</code> constructors and destructor</a></dt>
-  	  <dt><a href="#class-spec-comparisons">Class <code>{{class name}}</code> comparison functions</a></dt>
-  	  <dt><a href="#class-spec-modifiers">Class <code>{{class name}}</code> modifier functions</a></dt>
-  	  <dt><a href="#class-spec-observers">Class <code>{{class name}}</code> observer functions</a></dt>
-  	  <dt><a href="#class-spec-statics">Class <code>{{class name}}</code> static functions</a></dt>
-	</dl>
-  </dl>
-  <dt><a href="#functions">Functions</a></dt>
-  <dl class="page-index">
-    <dt><a href="#function-spec">{{function name}}</a></dt>
-  </dl>
-  <dt><a href="#objects">Objects</a></dt>
-  <dl class="page-index">
-    <dt><a href="#object-spec">{{object name}}</a></dt>
-  </dl>
-  <dt><a href="#examples">Example(s)</a></dt>
-</dl>
-<hr>
-<h2><a name="introduction"></a>Introduction</h2>
-<p>{{Introductory text}}</p>
-<h2><a name="macros"></a>Macros</h2>
-<p><a name="macro-spec"></a>{{Macro specifications}}</p>
-<h2><a name="values"></a>Values</h2>
-<p><a name="value-spec"></a>{{Value specifications}}</p>
-<h2><a name="types"></a>Types</h2>
-<p><a name="type-spec"></a>{{Type specifications}}</p>
-<h2><a name="classes"></a>Classes</h2>
-<h3><a name="class-spec"></a>Class <code>{{class name}}</code></h3>
-<p>{{class overview text}}</p>
-<h4><a name="class-spec-synopsis"></a>Class <code>{{class name}}</code> synopsis</h4>
-<pre>
+  <hr>
+
+  <h2><a name="introduction" id="introduction"></a>Introduction</h2>
+
+  <p>{{Introductory text}}</p>
+
+  <h2><a name="macros" id="macros"></a>Macros</h2>
+
+  <p><a name="macro-spec" id="macro-spec"></a>{{Macro specifications}}</p>
+
+  <h2><a name="values" id="values"></a>Values</h2>
+
+  <p><a name="value-spec" id="value-spec"></a>{{Value specifications}}</p>
+
+  <h2><a name="types" id="types"></a>Types</h2>
+
+  <p><a name="type-spec" id="type-spec"></a>{{Type specifications}}</p>
+
+  <h2><a name="classes" id="classes"></a>Classes</h2>
+
+  <h3><a name="class-spec" id="class-spec"></a>Class <code>{{class
+  name}}</code></h3>
+
+  <p>{{class overview text}}</p>
+
+  <h4><a name="class-spec-synopsis" id="class-spec-synopsis"></a>Class
+  <code>{{class name}}</code> synopsis</h4>
+  <pre>
 namespace boost
 {
     class {{class name}}
-	{
-	};
+        {
+        };
 };
 </pre>
-<h4><a name="class-spec-ctors"></a>Class <code>{{class name}}</code> constructors and destructor</h4>
-<pre>
+
+  <h4><a name="class-spec-ctors" id="class-spec-ctors"></a>Class
+  <code>{{class name}}</code> constructors and destructor</h4>
+  <pre>
 {{constructor}}
 </pre>
-<dl class="function-semantics"> 
-  <dt><b>Requires:</b> {{text}}</dt>
-  <dt><b>Effects:</b> {{text}}</dt>
-  <dt><b>Postconditions:</b> {{text}}</dt>
-  <dt><b>Returns:</b> {{text}}</dt>
-  <dt><b>Throws:</b> {{text}}</dt>
-  <dt><b>Complexity:</b> {{text}}</dt>
-  <dt><b>Note:</b> {{text}}</dt>
-  <dt><b>Danger:</b> {{text}}</dt>
-  <dt><b>Rationale:</b> {{text}}</dt>
-</dl>
-<pre>
+
+  <dl class="function-semantics">
+    <dt><b>Requires:</b> {{text}}</dt>
+
+    <dt><b>Effects:</b> {{text}}</dt>
+
+    <dt><b>Postconditions:</b> {{text}}</dt>
+
+    <dt><b>Returns:</b> {{text}}</dt>
+
+    <dt><b>Throws:</b> {{text}}</dt>
+
+    <dt><b>Complexity:</b> {{text}}</dt>
+
+    <dt><b>Note:</b> {{text}}</dt>
+
+    <dt><b>Danger:</b> {{text}}</dt>
+
+    <dt><b>Rationale:</b> {{text}}</dt>
+  </dl>
+  <pre>
 {{destructor}}
 </pre>
-<dl class="function-semantics"> 
-  <dt><b>Requires:</b> {{text}}</dt>
-  <dt><b>Effects:</b> {{text}}</dt>
-  <dt><b>Postconditions:</b> {{text}}</dt>
-  <dt><b>Returns:</b> {{text}}</dt>
-  <dt><b>Throws:</b> {{text}}</dt>
-  <dt><b>Complexity:</b> {{text}}</dt>
-  <dt><b>Note:</b> {{text}}</dt>
-  <dt><b>Danger:</b> {{text}}</dt>
-  <dt><b>Rationale:</b> {{text}}</dt>
-</dl>
-<h4><a name="class-spec-comparisons"></a>Class <code>{{class name}}</code> comparison functions</h4>
-<pre>
+
+  <dl class="function-semantics">
+    <dt><b>Requires:</b> {{text}}</dt>
+
+    <dt><b>Effects:</b> {{text}}</dt>
+
+    <dt><b>Postconditions:</b> {{text}}</dt>
+
+    <dt><b>Returns:</b> {{text}}</dt>
+
+    <dt><b>Throws:</b> {{text}}</dt>
+
+    <dt><b>Complexity:</b> {{text}}</dt>
+
+    <dt><b>Note:</b> {{text}}</dt>
+
+    <dt><b>Danger:</b> {{text}}</dt>
+
+    <dt><b>Rationale:</b> {{text}}</dt>
+  </dl>
+
+  <h4><a name="class-spec-comparisons" id="class-spec-comparisons"></a>Class
+  <code>{{class name}}</code> comparison functions</h4>
+  <pre>
 {{function}}
 </pre>
-<dl class="function-semantics"> 
-  <dt><b>Requires:</b> {{text}}</dt>
-  <dt><b>Effects:</b> {{text}}</dt>
-  <dt><b>Postconditions:</b> {{text}}</dt>
-  <dt><b>Returns:</b> {{text}}</dt>
-  <dt><b>Throws:</b> {{text}}</dt>
-  <dt><b>Complexity:</b> {{text}}</dt>
-  <dt><b>Note:</b> {{text}}</dt>
-  <dt><b>Danger:</b> {{text}}</dt>
-  <dt><b>Rationale:</b> {{text}}</dt>
-</dl>
-<h4><a name="class-spec-modifiers"></a>Class <code>{{class name}}</code> modifier functions</h4>
-<pre>
+
+  <dl class="function-semantics">
+    <dt><b>Requires:</b> {{text}}</dt>
+
+    <dt><b>Effects:</b> {{text}}</dt>
+
+    <dt><b>Postconditions:</b> {{text}}</dt>
+
+    <dt><b>Returns:</b> {{text}}</dt>
+
+    <dt><b>Throws:</b> {{text}}</dt>
+
+    <dt><b>Complexity:</b> {{text}}</dt>
+
+    <dt><b>Note:</b> {{text}}</dt>
+
+    <dt><b>Danger:</b> {{text}}</dt>
+
+    <dt><b>Rationale:</b> {{text}}</dt>
+  </dl>
+
+  <h4><a name="class-spec-modifiers" id="class-spec-modifiers"></a>Class
+  <code>{{class name}}</code> modifier functions</h4>
+  <pre>
 {{function}}
 </pre>
-<dl class="function-semantics"> 
-  <dt><b>Requires:</b> {{text}}</dt>
-  <dt><b>Effects:</b> {{text}}</dt>
-  <dt><b>Postconditions:</b> {{text}}</dt>
-  <dt><b>Returns:</b> {{text}}</dt>
-  <dt><b>Throws:</b> {{text}}</dt>
-  <dt><b>Complexity:</b> {{text}}</dt>
-  <dt><b>Note:</b> {{text}}</dt>
-  <dt><b>Danger:</b> {{text}}</dt>
-  <dt><b>Rationale:</b> {{text}}</dt>
-</dl>
-<h4><a name="class-spec-observers"></a>Class <code>{{class name}}</code> observer functions</h4>
-<pre>
+
+  <dl class="function-semantics">
+    <dt><b>Requires:</b> {{text}}</dt>
+
+    <dt><b>Effects:</b> {{text}}</dt>
+
+    <dt><b>Postconditions:</b> {{text}}</dt>
+
+    <dt><b>Returns:</b> {{text}}</dt>
+
+    <dt><b>Throws:</b> {{text}}</dt>
+
+    <dt><b>Complexity:</b> {{text}}</dt>
+
+    <dt><b>Note:</b> {{text}}</dt>
+
+    <dt><b>Danger:</b> {{text}}</dt>
+
+    <dt><b>Rationale:</b> {{text}}</dt>
+  </dl>
+
+  <h4><a name="class-spec-observers" id="class-spec-observers"></a>Class
+  <code>{{class name}}</code> observer functions</h4>
+  <pre>
 {{function}}
 </pre>
-<dl class="function-semantics"> 
-  <dt><b>Requires:</b> {{text}}</dt>
-  <dt><b>Effects:</b> {{text}}</dt>
-  <dt><b>Postconditions:</b> {{text}}</dt>
-  <dt><b>Returns:</b> {{text}}</dt>
-  <dt><b>Throws:</b> {{text}}</dt>
-  <dt><b>Complexity:</b> {{text}}</dt>
-  <dt><b>Note:</b> {{text}}</dt>
-  <dt><b>Danger:</b> {{text}}</dt>
-  <dt><b>Rationale:</b> {{text}}</dt>
-</dl>
-<h4><a name="class-spec-statics"></a>Class <code>{{class name}}</code> static functions</h4>
-<pre>
+
+  <dl class="function-semantics">
+    <dt><b>Requires:</b> {{text}}</dt>
+
+    <dt><b>Effects:</b> {{text}}</dt>
+
+    <dt><b>Postconditions:</b> {{text}}</dt>
+
+    <dt><b>Returns:</b> {{text}}</dt>
+
+    <dt><b>Throws:</b> {{text}}</dt>
+
+    <dt><b>Complexity:</b> {{text}}</dt>
+
+    <dt><b>Note:</b> {{text}}</dt>
+
+    <dt><b>Danger:</b> {{text}}</dt>
+
+    <dt><b>Rationale:</b> {{text}}</dt>
+  </dl>
+
+  <h4><a name="class-spec-statics" id="class-spec-statics"></a>Class
+  <code>{{class name}}</code> static functions</h4>
+  <pre>
 {{function}}
 </pre>
-<dl class="function-semantics"> 
-  <dt><b>Requires:</b> {{text}}</dt>
-  <dt><b>Effects:</b> {{text}}</dt>
-  <dt><b>Postconditions:</b> {{text}}</dt>
-  <dt><b>Returns:</b> {{text}}</dt>
-  <dt><b>Throws:</b> {{text}}</dt>
-  <dt><b>Complexity:</b> {{text}}</dt>
-  <dt><b>Note:</b> {{text}}</dt>
-  <dt><b>Danger:</b> {{text}}</dt>
-  <dt><b>Rationale:</b> {{text}}</dt>
-</dl>
-<h2><a name="functions"></a>Functions</h2>
-<pre>
-<a name="function-spec"></a>{{function}}
+
+  <dl class="function-semantics">
+    <dt><b>Requires:</b> {{text}}</dt>
+
+    <dt><b>Effects:</b> {{text}}</dt>
+
+    <dt><b>Postconditions:</b> {{text}}</dt>
+
+    <dt><b>Returns:</b> {{text}}</dt>
+
+    <dt><b>Throws:</b> {{text}}</dt>
+
+    <dt><b>Complexity:</b> {{text}}</dt>
+
+    <dt><b>Note:</b> {{text}}</dt>
+
+    <dt><b>Danger:</b> {{text}}</dt>
+
+    <dt><b>Rationale:</b> {{text}}</dt>
+  </dl>
+
+  <h2><a name="functions" id="functions"></a>Functions</h2>
+  <pre>
+<a name="function-spec" id="function-spec"></a>{{function}}
 </pre>
-<dl class="function-semantics"> 
-  <dt><b>Requires:</b> {{text}}</dt>
-  <dt><b>Effects:</b> {{text}}</dt>
-  <dt><b>Postconditions:</b> {{text}}</dt>
-  <dt><b>Returns:</b> {{text}}</dt>
-  <dt><b>Throws:</b> {{text}}</dt>
-  <dt><b>Complexity:</b> {{text}}</dt>
-  <dt><b>Note:</b> {{text}}</dt>
-  <dt><b>Danger:</b> {{text}}</dt>
-  <dt><b>Rationale:</b> {{text}}</dt>
-</dl>
-<h2><a name="objects"></a>Objects</h2>
-<p><a name="object-spec"></a>{{Object specifications}}</p>
-<h2><a name="examples"></a>Example(s)</h2>
-<p>{{Example(s)}}</p>
-<p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
-  05 November, 2001 
-  <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
-</p>
-<p><i>&copy; Copyright <a href="mailto:{{address}}">{{author}}</a> 
-  2002. All Rights Reserved.</i></p>
+
+  <dl class="function-semantics">
+    <dt><b>Requires:</b> {{text}}</dt>
+
+    <dt><b>Effects:</b> {{text}}</dt>
+
+    <dt><b>Postconditions:</b> {{text}}</dt>
+
+    <dt><b>Returns:</b> {{text}}</dt>
+
+    <dt><b>Throws:</b> {{text}}</dt>
+
+    <dt><b>Complexity:</b> {{text}}</dt>
+
+    <dt><b>Note:</b> {{text}}</dt>
+
+    <dt><b>Danger:</b> {{text}}</dt>
+
+    <dt><b>Rationale:</b> {{text}}</dt>
+  </dl>
+
+  <h2><a name="objects" id="objects"></a>Objects</h2>
+
+  <p><a name="object-spec" id="object-spec"></a>{{Object specifications}}</p>
+
+  <h2><a name="examples" id="examples"></a>Example(s)</h2>
+
+  <p>{{Example(s)}}</p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+  <p><i>Copyright &copy; 2006 <a href=
+  "mailto:{{address}}">{{author}}</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/more/writingdoc/template/index.html
===================================================================
--- boost/trunk/more/writingdoc/template/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/writingdoc/template/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,70 +1,126 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../../boost.css">
-<title>{{Library}}</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link rel="stylesheet" type="text/css" href="../../../boost.css">
+
+  <title>{{Library}}</title>
 </head>
-<body link="#0000ff" vlink="#800080">
-<table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-  <tr> 
-    <td valign="top" width="300"> 
-      <h3><a href="../../../index.htm"><img height="86" width="277" alt="C++ Boost" src="../../../boost.png" border="0"></a></h3>
-    </td>
-    <td valign="top"> 
-      <h1 align="center">{{Library}}</h1>
-      <h2 align="center">Index</h2>
-    </td>
-  </tr>
-</table>
-<hr>
-<h2>Contents</h2>
-<dl class="index">
-  <dt><a href="overview.html">Overview</a></dt>
-  <dt>Reference</dt>
+
+<body link="#0000FF" vlink="#800080">
+  <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
+  "header">
+    <tr>
+      <td valign="top" width="300">
+        <h3><a href="../../../index.htm"><img height="86" width="277" alt=
+        "C++ Boost" src="../../../boost.png" border="0"></a></h3>
+      </td>
+
+      <td valign="top">
+        <h1 align="center">{{Library}}</h1>
+
+        <h2 align="center">Index</h2>
+      </td>
+    </tr>
+  </table>
+  <hr>
+
+  <h2>Contents</h2>
+
   <dl class="index">
-    <dt><a href="header.html">{{header}}</a></dt>
-	<dl class="index">
-      <dt><a href="header.html#macros">Macros</a></dt>
-	  <dl class="index">
-	    <dt><a href="header.html#macro-spec">{{macro name}}</a></dt>
-	  </dl>
-      <dt><a href="header.html#values">Values</a></dt>
-	  <dl class="index">
-	    <dt><a href="header.html#value-spec">{{value name}}</a></dt>
-	  </dl>
-      <dt><a href="header.html#types">Types</a></dt>
-	  <dl class="index">
-	    <dt><a href="header.html#value-spec">{{type name}}</a></dt>
-	  </dl>
-      <dt><a href="header.html#classes">Classes</a></dt>
-	  <dl class="index">
-	    <dt><a href="header.html#value-spec">{{class name}}</a></dt>
-	  </dl>
-      <dt><a href="header.html#functions">Functions</a></dt>
-	  <dl class="index">
-	    <dt><a href="header.html#value-spec">{{function name}}</a></dt>
-	  </dl>
-      <dt><a href="header.html#objects">Objects</a></dt>
-	  <dl class="index">
-	    <dt><a href="header.html#value-spec">{{object name}}</a></dt>
-	  </dl>
-	</dl>
+    <dt><a href="overview.html">Overview</a></dt>
+
+    <dt>Reference</dt>
+
+    <dd>
+      <dl class="index">
+        <dt><a href="header.html">{{header}}</a></dt>
+
+        <dd>
+          <dl class="index">
+            <dt><a href="header.html#macros">Macros</a></dt>
+
+            <dd>
+              <dl class="index">
+                <dt><a href="header.html#macro-spec">{{macro name}}</a></dt>
+              </dl>
+            </dd>
+
+            <dt><a href="header.html#values">Values</a></dt>
+
+            <dd>
+              <dl class="index">
+                <dt><a href="header.html#value-spec">{{value name}}</a></dt>
+              </dl>
+            </dd>
+
+            <dt><a href="header.html#types">Types</a></dt>
+
+            <dd>
+              <dl class="index">
+                <dt><a href="header.html#value-spec">{{type name}}</a></dt>
+              </dl>
+            </dd>
+
+            <dt><a href="header.html#classes">Classes</a></dt>
+
+            <dd>
+              <dl class="index">
+                <dt><a href="header.html#value-spec">{{class name}}</a></dt>
+              </dl>
+            </dd>
+
+            <dt><a href="header.html#functions">Functions</a></dt>
+
+            <dd>
+              <dl class="index">
+                <dt><a href="header.html#value-spec">{{function
+                name}}</a></dt>
+              </dl>
+            </dd>
+
+            <dt><a href="header.html#objects">Objects</a></dt>
+
+            <dd>
+              <dl class="index">
+                <dt><a href="header.html#value-spec">{{object name}}</a></dt>
+              </dl>
+            </dd>
+          </dl>
+        </dd>
+      </dl>
+    </dd>
+
+    <dt><a href="configuration.html">Configuration Information</a></dt>
+
+    <dt><a href="rationale.html">Rationale</a></dt>
+
+    <dt><a href="definitions.html">Definitions</a></dt>
+
+    <dt><a href="faq.html">Frequently Asked Questions (FAQs)</a></dt>
+
+    <dt><a href="bibliography.html">Bibliography</a></dt>
+
+    <dt><a href="acknowledgments.html">Acknowledgments</a></dt>
   </dl>
-  <dt><a href="configuration.html">Configuration Information</a></dt>
-  <dt><a href="rationale.html">Rationale</a></dt>
-  <dt><a href="definitions.html">Definitions</a></dt>
-  <dt><a href="faq.html">Frequently Asked Questions (FAQs)</a></dt>
-  <dt><a href="bibliography.html">Bibliography</a></dt>
-  <dt><a href="acknowledgments.html">Acknowledgments</a></dt>
-</dl>
-<hr>
-<p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
-  05 November, 2001 
-  <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
-</p>
-<p><i>&copy; Copyright <a href="mailto:{{address}}">{{author}}</a> 
-  2002. All Rights Reserved.</i></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+  <p><i>Copyright &copy; 2006 <a href=
+  "mailto:{{address}}">{{author}}</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/more/writingdoc/template/overview.html
===================================================================
--- boost/trunk/more/writingdoc/template/overview.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/writingdoc/template/overview.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,47 +1,79 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../../boost.css">
-<title>{{Library}} - Overview</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link rel="stylesheet" type="text/css" href="../../../boost.css">
+
+  <title>{{Library}} - Overview</title>
 </head>
-<body link="#0000ff" vlink="#800080">
-<table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-  <tr> 
-    <td valign="top" width="300"> 
-      <h3><a href="../../../index.htm"><img height="86" width="277" alt="C++ Boost" src="../../../boost.png" border="0"></a></h3>
-    </td>
-    <td valign="top"> 
-      <h1 align="center">{{Library}}</h1>
-      <h2 align="center">Overview</h2>
-    </td>
-  </tr>
-</table>
-<hr>
-<dl class="index">
-  <dt><a href="#introduction">Introduction</a></dt>
-  <dt><a href="#topic1">First topic</a></dt>
-  <dt><a href="#topic2">Second topic</a></dt>
-  <dt><a href="#footnotes">Footnotes</a></dt>
-</dl>
-<h2><a name="introduction"></a>Introduction</h2>
-<p>{{text}}</p>
-<h2><a name="topic1"></a>First Topic</h2>
-<p>{{text}}</p>
-<h2><a name="topic2"></a>Second Topic</h2>
-<p>{{text}}</p>
-<h2><a name="footnotes"></a>Footnotes</h2>
-<dl>
-  <dt><a name="footnote1" class="footnote">(1)</a> {{text}}</dt>
-  <dt><a name="footnote2" class="footnote">(2)</a> {{text}}</dt>
-</dl>
-<hr>
-<p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
-  05 November, 2001 
-  <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
-</p>
-<p><i>&copy; Copyright <a href="mailto:{{address}}">{{author}}</a> 
-  2002. All Rights Reserved.</i></p>
+
+<body link="#0000FF" vlink="#800080">
+  <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
+  "header">
+    <tr>
+      <td valign="top" width="300">
+        <h3><a href="../../../index.htm"><img height="86" width="277" alt=
+        "C++ Boost" src="../../../boost.png" border="0"></a></h3>
+      </td>
+
+      <td valign="top">
+        <h1 align="center">{{Library}}</h1>
+
+        <h2 align="center">Overview</h2>
+      </td>
+    </tr>
+  </table>
+  <hr>
+
+  <dl class="index">
+    <dt><a href="#introduction">Introduction</a></dt>
+
+    <dt><a href="#topic1">First topic</a></dt>
+
+    <dt><a href="#topic2">Second topic</a></dt>
+
+    <dt><a href="#footnotes">Footnotes</a></dt>
+  </dl>
+
+  <h2><a name="introduction" id="introduction"></a>Introduction</h2>
+
+  <p>{{text}}</p>
+
+  <h2><a name="topic1" id="topic1"></a>First Topic</h2>
+
+  <p>{{text}}</p>
+
+  <h2><a name="topic2" id="topic2"></a>Second Topic</h2>
+
+  <p>{{text}}</p>
+
+  <h2><a name="footnotes" id="footnotes"></a>Footnotes</h2>
+
+  <dl>
+    <dt><a name="footnote1" class="footnote" id="footnote1">(1)</a>
+    {{text}}</dt>
+
+    <dt><a name="footnote2" class="footnote" id="footnote2">(2)</a>
+    {{text}}</dt>
+  </dl>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+  <p><i>Copyright &copy; 2006 <a href=
+  "mailto:{{address}}">{{author}}</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/more/writingdoc/template/rationale.html
===================================================================
--- boost/trunk/more/writingdoc/template/rationale.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/more/writingdoc/template/rationale.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,47 +1,79 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../../boost.css">
-<title>{{Library}} - Rationale</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <link rel="stylesheet" type="text/css" href="../../../boost.css">
+
+  <title>{{Library}} - Rationale</title>
 </head>
-<body link="#0000ff" vlink="#800080">
-<table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
-    "header">
-  <tr> 
-    <td valign="top" width="300"> 
-      <h3><a href="../../../index.htm"><img height="86" width="277" alt="C++ Boost" src="../../../boost.png" border="0"></a></h3>
-    </td>
-    <td valign="top"> 
-      <h1 align="center">{{Library}}</h1>
-      <h2 align="center">Rationale</h2>
-    </td>
-  </tr>
-</table>
-<hr>
-<dl class="index">
-  <dt><a href="#introduction">Introduction</a></dt>
-  <dt><a href="#topic1">First topic</a></dt>
-  <dt><a href="#topic2">Second topic</a></dt>
-  <dt><a href="#footnotes">Footnotes</a></dt>
-</dl>
-<h2><a name="introduction"></a>Introduction</h2>
-<p>{{text}}</p>
-<h2><a name="topic1"></a>First Topic</h2>
-<p>{{text}}</p>
-<h2><a name="topic2"></a>Second Topic</h2>
-<p>{{text}}</p>
-<h2><a name="footnotes"></a>Footnotes</h2>
-<dl>
-  <dt><a name="footnote1" class="footnote">(1)</a> {{text}}</dt>
-  <dt><a name="footnote2" class="footnote">(2)</a> {{text}}</dt>
-</dl>
-<hr>
-<p>Revised 
-  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
-  05 November, 2001 
-  <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
-</p>
-<p><i>&copy; Copyright <a href="mailto:{{address}}">{{author}}</a> 
-  2002. All Rights Reserved.</i></p>
+
+<body link="#0000FF" vlink="#800080">
+  <table border="0" cellpadding="7" cellspacing="0" width="100%" summary=
+  "header">
+    <tr>
+      <td valign="top" width="300">
+        <h3><a href="../../../index.htm"><img height="86" width="277" alt=
+        "C++ Boost" src="../../../boost.png" border="0"></a></h3>
+      </td>
+
+      <td valign="top">
+        <h1 align="center">{{Library}}</h1>
+
+        <h2 align="center">Rationale</h2>
+      </td>
+    </tr>
+  </table>
+  <hr>
+
+  <dl class="index">
+    <dt><a href="#introduction">Introduction</a></dt>
+
+    <dt><a href="#topic1">First topic</a></dt>
+
+    <dt><a href="#topic2">Second topic</a></dt>
+
+    <dt><a href="#footnotes">Footnotes</a></dt>
+  </dl>
+
+  <h2><a name="introduction" id="introduction"></a>Introduction</h2>
+
+  <p>{{text}}</p>
+
+  <h2><a name="topic1" id="topic1"></a>First Topic</h2>
+
+  <p>{{text}}</p>
+
+  <h2><a name="topic2" id="topic2"></a>Second Topic</h2>
+
+  <p>{{text}}</p>
+
+  <h2><a name="footnotes" id="footnotes"></a>Footnotes</h2>
+
+  <dl>
+    <dt><a name="footnote1" class="footnote" id="footnote1">(1)</a>
+    {{text}}</dt>
+
+    <dt><a name="footnote2" class="footnote" id="footnote2">(2)</a>
+    {{text}}</dt>
+  </dl>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->04
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+  <p><i>Copyright &copy; 2006 <a href=
+  "mailto:{{address}}">{{author}}</a></i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
+  copy at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/people/aleksey_gurtovoy.htm
===================================================================
--- boost/trunk/people/aleksey_gurtovoy.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/aleksey_gurtovoy.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,43 +1,87 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Aleksey Gurtovoy</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/aleksey_gurtovoy.jpg"><img border="0" src="http://boost.sourceforge.net/photos/aleksey_gurtovoy_small.jpg" alt="http://boost.sourceforge.net/photos/aleksey_gurtovoy.jpg (12871 bytes)" align="left" hspace="10" vspace="5" width="100" height="120"></a></p>
-    <p>Aleksey Gurtovoy is a Russian guy from Siberia, who now lives and 
-      works in the United States. He is a technical lead at <a href="http://www.meta-comm.com">
-        MetaCommunications</a>, a job and people which have taught him so much.</p>
-    <p>He was born in early 1977, has been in love with computers since 1989, and 
-      still has a lot of exciting ideas for his &quot;spare time&quot; in the next 
-      few years. He graduated with honors from Krasnoyarsk Technical State University in 
-      1998 with a Master Degree in Computer Science.</p>
-    <p>While being acknowledged as a talented programmer, Aleksey tries to be a 
-      better engineer than he is now and hopes that reading good books will help him 
-      with that task. He reads a lot. One of his favorite books about his 
-      profession is 'The Mythical Man-Month' by Frederic P. Brooks, Jr.</p>
-    <p>Aleksey has been working with C++ since 1993, he loves the language, and is
-      involved in its progress. Sometimes you can come across his articles in the <a href="news:comp.lang.c++.moderated">
-        comp.lang.c++.moderated</a> and <a href="news:comp.std.c++">comp.std.c++</a><a>
-      newsgroups. The other numerous things Aleksey is interested in include 
-      patterns, programming languages, organization 
-      of software development process, and tools &amp; technologies which make 
-      programmer's life easier (e.g. compilers).</p>
-    <p>He is not married, but he has in mind one great girl he hopes to be with 
-      someday.</p>
-    <p>You can contact him by sending mail to </a><a href="mailto:alexy at meta-comm.com">alexy at meta-comm.com</a><a>.</p>
-    </a>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Aleksey Gurtovoy</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/aleksey_gurtovoy.jpg"><img border="0"
+  src="http://boost.sourceforge.net/photos/aleksey_gurtovoy_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/aleksey_gurtovoy.jpg (12871 bytes)"
+  align="left" hspace="10" vspace="5" width="100" height="120"></a></p>
+
+  <p>Aleksey Gurtovoy is a Russian guy from Siberia, who now lives and works
+  in the United States. He is a technical lead at <a href=
+  "http://www.meta-comm.com">MetaCommunications</a>, a job and people which
+  have taught him so much.</p>
+
+  <p>He was born in early 1977, has been in love with computers since 1989,
+  and still has a lot of exciting ideas for his "spare time" in the next few
+  years. He graduated with honors from Krasnoyarsk Technical State University
+  in 1998 with a Master Degree in Computer Science.</p>
+
+  <p>While being acknowledged as a talented programmer, Aleksey tries to be a
+  better engineer than he is now and hopes that reading good books will help
+  him with that task. He reads a lot. One of his favorite books about his
+  profession is 'The Mythical Man-Month' by Frederic P. Brooks, Jr.</p>
+
+  <p>Aleksey has been working with C++ since 1993, he loves the language, and
+  is involved in its progress. Sometimes you can come across his articles in
+  the <a href="news:comp.lang.c++.moderated">comp.lang.c++.moderated</a> and
+  <a href="news:comp.std.c++">comp.std.c++</a> <a>newsgroups. The other
+  numerous things Aleksey is interested in include patterns, programming
+  languages, organization of software development process, and tools &amp;
+  technologies which make programmer's life easier (e.g. compilers).</a></p>
+
+  <p>He is not married, but he has in mind one great girl he hopes to be with
+  someday.</p>
+
+  <p>You can contact him by sending mail to <a href=
+  "mailto:alexy at meta-comm.com">alexy at meta-comm.com</a>.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2004 Aleksey Gurtovoy</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Copied: boost/trunk/people/andreas_huber.html (from rev 14034, boost/branches/upstream/current/people/andreas_huber.html)

Modified: boost/trunk/people/beman_dawes.html
===================================================================
--- boost/trunk/people/beman_dawes.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/beman_dawes.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,32 +1,76 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Beman Dawes</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/beman_dawes.jpg"><img src="http://boost.sourceforge.net/photos/beman_dawes_small.jpg" alt="http://boost.sourceforge.net/photos/beman_dawes.jpg (62536 bytes)" border="0" align="left" hspace="10" vspace="5" width="100" height="133"></a>
-      Beman Dawes is a software developer from Virginia in the United States and the 
-      founder of boost.org.</p>
-    <p>He is the author of the StreetQuick® geographic atlas library used by digital 
-      map publishers to help people get really, really, lost.</p>
-    <p>He wrote his first computer program 40 years ago, and does not mourn the 
-      passing of <a href="http://www.mta.ca/~amiller/ibm650/ibm650.htm">bi-quinary</a>
-      arithmetic.</p>
-    <p>Beman has been a voting member of the ANSI/ISO C++ Standards Committee since 
-      1992, and chaired the Library Working Group for five years.</p>
-    <p>He enjoys travel, sailing, hiking, and biking. He is married, and he and his 
-      wife have three cats.</p>
-    <p>Email: <a href="mailto:bdawes at acm.org">bdawes at acm.org</a></p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Beman Dawes</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href="http://boost.sourceforge.net/photos/beman_dawes.jpg"><img src=
+  "http://boost.sourceforge.net/photos/beman_dawes_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/beman_dawes.jpg (62536 bytes)" border=
+  "0" align="left" hspace="10" vspace="5" width="100" height="133"></a> Beman
+  Dawes is a software developer from Virginia in the United States and the
+  founder of boost.org.</p>
+
+  <p>He is the author of the StreetQuick&reg; geographic atlas library used
+  by digital map publishers to help people get really, really, lost.</p>
+
+  <p>He wrote his first computer program 40 years ago, and does not mourn the
+  passing of <a href=
+  "http://www.mta.ca/~amiller/ibm650/ibm650.htm">bi-quinary</a>
+  arithmetic.</p>
+
+  <p>Beman has been a voting member of the ANSI/ISO C++ Standards Committee
+  since 1992, and chaired the Library Working Group for five years.</p>
+
+  <p>He enjoys travel, sailing, hiking, and biking. He is married, and he and
+  his wife have three cats.</p>
+
+  <p>Email: <a href="mailto:bdawes at acm.org">bdawes at acm.org</a><br clear=
+  "all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2004 Beman Dawes</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/darin_adler.htm
===================================================================
--- boost/trunk/people/darin_adler.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/darin_adler.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,46 +1,94 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Darin Adler</title>
-  </head>
-  <body>
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/darin_adler.jpg"><img border="0"
-      src="http://boost.sourceforge.net/photos/darin_adler_small.jpg"
-      alt="http://boost.sourceforge.net/photos/darin_adler.jpg (30416 bytes)" align="left" hspace="10" vspace="5" width="100" height="135"></a>Darin 
-      Adler has been programming computers since 1976. He loves to do it.</p>
-    <p>His first major professional experience was at <a href="http://apple.com">Apple 
-        Computer</a>. In 1988 he led the team that rewrote the Macintosh Finder in 
-      C++. Before that project was completed, he was shanghaied to be the technical 
-      lead for the System 7 project (these days they would call it &quot;Mac OS 
-      7&quot;). The group he formed to help him do that, the Blue Meanies, is still a <a href="http://www.cupertino.de/pages/archiv/EasterEggs/BlueMeanies.html">
-        legend</a> in the Apple community.</p>
-    <p>Since Apple, Darin has worked at <a href="http://www.generalmagic.com">General 
-        Magic</a> as an architect of the <a href="http://www.google.com/search?q=Magic+Cap">
-        Magic Cap</a> OS, used the moniker <a href="http://bentspoon.com">Bent Spoon 
-        Software</a> to do consulting, and helped start Eazel, a company that worked 
-      to make Linux easier to use and developed the Nautilus graphical shell for <a href="http://www.gnome.org">
-        GNOME</a>. Since 1997, he has worked from his home in Los Angeles, CA, 
-      collaborating with clients and coworkers in other locations.</p>
-    <p>He prefers to use and program Macintosh computers with C++. But work on the 
-      GNOME project is best accomplished with a non-Macintosh PC. (That's why Darin 
-      is sitting in front of <a href="http://boost.sourceforge.net/photos/darin_adler.jpg">two computers</a>.) The other 
-      people working on the GNOME project don't like C++, so he's writing a lot of C 
-      code these days.</p>
-    <p>The <a href="http://boost.sourceforge.net/photos/darin_adler.jpg">larger version</a> of his picture shows him hard 
-      at work with his C++ guru, his daughter Sophia.</p>
-    <p>He has hobbies and stuff but you don't want to read about that here.</p>
-    <p>You can contact him by sending mail to <a href="mailto:darin at bentspoon.com">darin at bentspoon.com</a>.</p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Darin Adler</title>
+</head>
+
+<body>
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/darin_adler.jpg"><img border="0" src=
+  "http://boost.sourceforge.net/photos/darin_adler_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/darin_adler.jpg (30416 bytes)" align=
+  "left" hspace="10" vspace="5" width="100" height="135"></a>Darin Adler has
+  been programming computers since 1976. He loves to do it.</p>
+
+  <p>His first major professional experience was at <a href=
+  "http://apple.com">Apple Computer</a>. In 1988 he led the team that rewrote
+  the Macintosh Finder in C++. Before that project was completed, he was
+  shanghaied to be the technical lead for the System 7 project (these days
+  they would call it "Mac OS 7"). The group he formed to help him do that,
+  the Blue Meanies, is still a <a href=
+  "http://www.cupertino.de/pages/archiv/EasterEggs/BlueMeanies.html">legend</a>
+  in the Apple community.</p>
+
+  <p>Since Apple, Darin has worked at <a href=
+  "http://www.generalmagic.com">General Magic</a> as an architect of the
+  <a href="http://www.google.com/search?q=Magic+Cap">Magic Cap</a> OS, used
+  the moniker <a href="http://bentspoon.com">Bent Spoon Software</a> to do
+  consulting, and helped start Eazel, a company that worked to make Linux
+  easier to use and developed the Nautilus graphical shell for <a href=
+  "http://www.gnome.org">GNOME</a>. Since 1997, he has worked from his home
+  in Los Angeles, CA, collaborating with clients and coworkers in other
+  locations.</p>
+
+  <p>He prefers to use and program Macintosh computers with C++. But work on
+  the GNOME project is best accomplished with a non-Macintosh PC. (That's why
+  Darin is sitting in front of <a href=
+  "http://boost.sourceforge.net/photos/darin_adler.jpg">two computers</a>.)
+  The other people working on the GNOME project don't like C++, so he's
+  writing a lot of C code these days.</p>
+
+  <p>The <a href="http://boost.sourceforge.net/photos/darin_adler.jpg">larger
+  version</a> of his picture shows him hard at work with his C++ guru, his
+  daughter Sophia.</p>
+
+  <p>He has hobbies and stuff but you don't want to read about that here.</p>
+
+  <p>You can contact him by sending mail to <a href=
+  "mailto:darin at bentspoon.com">darin at bentspoon.com</a>.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->24
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2001 Darin Adler</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/daryle_walker.html
===================================================================
--- boost/trunk/people/daryle_walker.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/daryle_walker.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,22 +1,56 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <title>Daryle Walker</title>
-  </head>
-  <body bgcolor="white" text="black">
-    <table border="1" bgcolor="teal" cellpadding="2">
-      <tr>
-        <td bgcolor="white"><img src="../boost.png" alt="boost.png
-			(6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="white"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="white"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="white"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="white"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="white"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/daryle_walker.jpg"><img src="http://boost.sourceforge.net/photos/daryle_walker.jpg" alt="http://boost.sourceforge.net/photos/daryle_walker.jpg (3618 bytes)" border="0" align="left" hspace="10" vspace="5" width="100" height="127"></a>
-      Daryle Walker, born and raised in the United States since 1973, needs to write 
-      a fuller biography.</p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Daryle Walker</title>
+</head>
+
+<body bgcolor="white" text="black">
+  <table border="1" bgcolor="teal" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="white"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "white"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "white"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "white"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "white"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "white"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/daryle_walker.jpg"><img src="http://boost.sourceforge.net/photos/daryle_walker.jpg"
+  alt="http://boost.sourceforge.net/photos/daryle_walker.jpg (3618 bytes)"
+  border="0" align="left" hspace="10" vspace="5" width="100" height=
+  "127"></a> Daryle Walker, born and raised in the United States since 1973,
+  needs to write a fuller biography.</p><br clear="all">
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11 November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2001 Daryle Walker</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/dave_abrahams.htm
===================================================================
--- boost/trunk/people/dave_abrahams.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/dave_abrahams.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,6 +5,9 @@
     <meta name="ProgId" content="FrontPage.Editor.Document">
     <title>Dave Abrahams</title>
   </head>
+<!-- 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) -->
   <body bgcolor="#FFFFFF" text="#000000">
     <table border="1" bgcolor="#007F7F" cellpadding="2">
       <tr>

Modified: boost/trunk/people/dietmar_kuehl.htm
===================================================================
--- boost/trunk/people/dietmar_kuehl.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/dietmar_kuehl.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,48 +1,81 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-    <title>Dietmar Kuehl </title>
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" WIDTH="277" HEIGHT="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home </big></font>
-          </a>
-        </td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries </big>
-            </font></a>
-        </td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People </big></font>
-          </a>
-        </td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ </big></font>
-          </a>
-        </td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More </big></font>
-          </a>
-        </td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/dietmar_kuehl.jpg"><img src="http://boost.sourceforge.net/photos/dietmar_kuehl_small.jpg" hspace="10" vspace="5" alt="dietmar_kuehl.jpg (57821 bytes)" border="0" align="left" WIDTH="100" HEIGHT="133"></a>Dietmar 
-      Kuehl (the &quot;ue&quot; is actually a &quot;u-umlaut&quot;, ie. one of those 
-      funny German characters which has two dots above it) was fork(2)ed in early 
-      1968.</p>
-    <p>He visited school more or less successfully from 1973 to 1987. In 1987 he 
-      started to study at the Technical University of Berlin. He finished his studies 
-      in 1997 with a Diplom (roughly the German equivalent of a masters) in 
-      Mathematics. His thesis was &quot;Design Pattern for the Implementation of 
-      Graph Algorithms&quot;; strike the &quot;Design Pattern&quot; and put in 
-      &quot;Generic&quot; somehow to get an idea of the main topic. The thesis is 
-      available from <a href="http://www.dietmar-kuehl.de/generic-graph-algorithms.pdf">
-        http://www.dietmar-kuehl.de/generic-graph-algorithms.pdf</a>.</p>
-    <p>Since 1997 he has worked as consultant for a small company called Claas 
-      Solutions (the &quot;aa&quot; is no typo), mainly working for major German 
-      banks. Since late 1995 Dietmar Kuehl has been one of the moderators of the 
-      newsgroup <a href="news:comp.lang.c++.moderated">comp.lang.c++.moderated</a>. 
-      He is active on the C++ Standards committee.</p>
-    <p>Email: <a href="mailto:dietmar_kuehl at yahoo.com">dietmar_kuehl at yahoo.com</a></p>
-    <p>Home page:&nbsp; <a href="http://www.dietmar-kuehl.de/">http://www.dietmar-kuehl.de/</a></p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Dietmar Kuehl</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/dietmar_kuehl.jpg"><img src="http://boost.sourceforge.net/photos/dietmar_kuehl_small.jpg"
+  hspace="10" vspace="5" alt="dietmar_kuehl.jpg (57821 bytes)" border="0"
+  align="left" width="100" height="133"></a>Dietmar Kuehl (the "ue" is
+  actually a "u-umlaut", ie. one of those funny German characters which has
+  two dots above it) was fork(2)ed in early 1968.</p>
+
+  <p>He visited school more or less successfully from 1973 to 1987. In 1987
+  he started to study at the Technical University of Berlin. He finished his
+  studies in 1997 with a Diplom (roughly the German equivalent of a masters)
+  in Mathematics. His thesis was "Design Pattern for the Implementation of
+  Graph Algorithms"; strike the "Design Pattern" and put in "Generic" somehow
+  to get an idea of the main topic. The thesis is available from <a href=
+  "http://www.dietmar-kuehl.de/generic-graph-algorithms.pdf">http://www.dietmar-kuehl.de/generic-graph-algorithms.pdf</a>.</p>
+
+  <p>Since 1997 he has worked as consultant for a small company called Claas
+  Solutions (the "aa" is no typo), mainly working for major German banks.
+  Since late 1995 Dietmar Kuehl has been one of the moderators of the
+  newsgroup <a href=
+  "news:comp.lang.c++.moderated">comp.lang.c++.moderated</a>. He is active on
+  the C++ Standards committee.</p>
+
+  <p>Email: <a href=
+  "mailto:dietmar_kuehl at yahoo.com">dietmar_kuehl at yahoo.com</a></p>
+
+  <p>Home page:&nbsp; <a href=
+  "http://www.dietmar-kuehl.de/">http://www.dietmar-kuehl.de/</a><br clear=
+  "all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->21
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39358" --></p>
+
+  <p><i>Copyright &copy; 2000 Dietmar Kuehl</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/doug_gregor.html
===================================================================
--- boost/trunk/people/doug_gregor.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/doug_gregor.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,42 +1,78 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Doug Gregor</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a
-    href="http://boost.sourceforge.net/photos/doug_gregor.jpg"><img
-    src="http://boost.sourceforge.net/photos/doug_gregor_small.jpg"
-    alt="doug_gregor.jpg (62536 bytes)" border="0" align="left"
-    hspace="10" vspace="5" width="100" height="133"></a> <p>Doug is a
-    post-doctoral research fellow in the <a
-    href="http://www.osl.iu.edu">Open Systems Lab</a>, part of the <a
-    href="http://www.cs.indiana.edu">Computer Science</a> department
-    at <a href="http://www.iub.edu">Indiana University,
-    Bloomington.</a>.
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
 
-    <p>As a generic programming zealot, his search for the One True
-    Generic Language has seen him through the trials of the <a
-    href="http://www.cs.rpi.edu/research/gpg">Generic Programming
-    Group</a>, and <a href="http://www.boost.org">many</a> <a
-    href="http://www.open-std.org/jtc1/sc22/wg21/">diversions</a>.
+  <title>Doug Gregor</title>
+</head>
 
-    <p>When not hunched over in front of an <a
-    href="http://www.xemacs.org">XEmacs</a> window, Doug looks to his
-    wife Amy to help him navigate through the daylight. Once there, he
-    enjoys tennis and the occasional game of paintball.  <p>Email:
-    dgregor -at- cs.indiana.edu</p> <p>Home page: <a
-    href="http://www.osl.iu.edu/~dgregor"><code>http://www.osl.iu.edu/~dgregor</code></a>
-  </body>
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href="http://boost.sourceforge.net/photos/doug_gregor.jpg"><img src=
+  "http://boost.sourceforge.net/photos/doug_gregor_small.jpg" alt=
+  "doug_gregor.jpg (62536 bytes)" border="0" align="left" hspace="10" vspace=
+  "5" width="100" height="133"></a></p>
+
+  <p>Doug is a post-doctoral research fellow in the <a href=
+  "http://www.osl.iu.edu">Open Systems Lab</a>, part of the <a href=
+  "http://www.cs.indiana.edu">Computer Science</a> department at <a href=
+  "http://www.iub.edu">Indiana University, Bloomington.</a>.</p>
+
+  <p>As a generic programming zealot, his search for the One True Generic
+  Language has seen him through the trials of the <a href=
+  "http://www.cs.rpi.edu/research/gpg">Generic Programming Group</a>, and
+  <a href="http://www.boost.org">many</a> <a href=
+  "http://www.open-std.org/jtc1/sc22/wg21/">diversions</a>.</p>
+
+  <p>When not hunched over in front of an <a href=
+  "http://www.xemacs.org">XEmacs</a> window, Doug looks to his wife Amy to
+  help him navigate through the daylight. Once there, he enjoys tennis and
+  the occasional game of paintball.</p>
+
+  <p>Email: dgregor -at- cs.indiana.edu</p>
+
+  <p>Home page: <a href=
+  "http://www.osl.iu.edu/~dgregor"><code>http://www.osl.iu.edu/~dgregor</code></a><br clear="all">
+  </p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11 November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2005 Doug Gregor</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/ed_brey.htm
===================================================================
--- boost/trunk/people/ed_brey.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/ed_brey.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,45 +1,85 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Ed Brey</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/ed_brey.jpg"><img src="http://boost.sourceforge.net/photos/ed_brey_small.jpg" alt="ed_brey.jpg" border="0" align="left" hspace="10" vspace="5" width="100" height="133"></a>
-    Ed Brey lives in Menomonee Falls, Wisconsin, a village outside of Milwaukee. In 
-    the summertime, he likes to play tennis with his wife, and in the winter, if 
-    there is enough snow, he likes to go tobogganing or ice-skating. If it is not 
-    nice enough outside for either of those, he plays on the piano.
-    <p>Ed works at <a href="http://www.eaton.com">Eaton Corporation</a> in Milwaukee. 
-      He started working there as part of <a href="http://www.mu.edu">Marquette 
-        University</a>'s engineering co-op program. Upon graduation in 1995 from 
-      Marquette with a BS in electrical and computer engineering, he was hired on 
-      full-time, where he initially worked on firmware for industrial controls. More 
-      recently, he has been working on a PC-based configuration tool for industrial 
-      networks. Ed received his MS in computer engineering in 2001 from <a href="http://www.ntu.edu">
-        NTU</a>
-    .
-    <p>
-    Ed has held programming as a pastime since his grade school days, when he wrote 
-    a babysitting invoicing program. Soon after, he wrote a game inspired by the TV 
-    game show &ldquo;Press Your Luck&rdquo;. Ever since, programming languages and 
-    concepts, along with finding ways to improve the art and science of coding 
-    software, have always peeked his interest.
-    <p>Lastly, Ed has managed to retain his perspective. As fun as computers and 
-      programming are, Ed's true loves in life are the Lord Jesus whom he serves and 
-      his dear wife Beth.</p>
-    <hr>
-    <p>Home page: <a href="http://BreyFamily.net">http://BreyFamily.net</a>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Ed Brey</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href="http://boost.sourceforge.net/photos/ed_brey.jpg"><img src=
+  "http://boost.sourceforge.net/photos/ed_brey_small.jpg" alt="ed_brey.jpg"
+  border="0" align="left" hspace="10" vspace="5" width="100" height=
+  "133"></a>Ed Brey lives in Menomonee Falls, Wisconsin, a village outside of
+  Milwaukee. In the summertime, he likes to play tennis with his wife, and in
+  the winter, if there is enough snow, he likes to go tobogganing or
+  ice-skating. If it is not nice enough outside for either of those, he plays
+  on the piano.</p>
+
+  <p>Ed works at <a href="http://www.eaton.com">Eaton Corporation</a> in
+  Milwaukee. He started working there as part of <a href=
+  "http://www.mu.edu">Marquette University</a>'s engineering co-op program.
+  Upon graduation in 1995 from Marquette with a BS in electrical and computer
+  engineering, he was hired on full-time, where he initially worked on
+  firmware for industrial controls. More recently, he has been working on a
+  PC-based configuration tool for industrial networks. Ed received his MS in
+  computer engineering in 2001 from <a href="http://www.ntu.edu">NTU</a>
+  .</p>
+
+  <p>Ed has held programming as a pastime since his grade school days, when
+  he wrote a babysitting invoicing program. Soon after, he wrote a game
+  inspired by the TV game show &ldquo;Press Your Luck&rdquo;. Ever since,
+  programming languages and concepts, along with finding ways to improve the
+  art and science of coding software, have always peeked his interest.</p>
+
+  <p>Lastly, Ed has managed to retain his perspective. As fun as computers
+  and programming are, Ed's true loves in life are the Lord Jesus whom he
+  serves and his dear wife Beth.</p>
+  <hr>
+
+  <p>Home page: <a href=
+  "http://BreyFamily.net">http://BreyFamily.net</a><br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->20
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39356" --></p>
+
+  <p><i>Copyright &copy; 2002 Ed Brey</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/eric_friedman.htm
===================================================================
--- boost/trunk/people/eric_friedman.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/eric_friedman.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,40 +1,69 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
 <head>
-<title>Eric Friedman</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Eric Friedman</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-<table border="1" bgcolor="#007F7F" cellpadding="2">
-  <tr>
-    <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-    <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-    <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-    <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-    <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-    <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-  </tr>
-</table>
-<p>
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-<a href="http://boost.sourceforge.net/photos/eric_friedman.jpg">
-  <img border="0" src="http://boost.sourceforge.net/photos/eric_friedman_small.jpg" alt="eric_friedman.jpg" align="left" hspace="10" vspace="5" width="100" height="131">
-</a>
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
 
-Eric Friedman is an undergraduate at Stanford University. Born in 1984, he
-discovered programming at 10 and Boost at 17. He is a Computer Science major,
-with interests in Political Science and Arabic.<br>
-<br>
-Eric is co-author of the <a href="../libs/variant/index.html">Variant library</a> and
-intends to author more.<br>
-<br>
-He enjoys rap music, discussing politics, and, of course, programming.<br>
-<br>
-Though not starving, Eric is a college student and so appreciates both
-spontaneous donations and internship opportunities. He can be contacted at
-<a href="mailto:ebf at users.sourceforge.net">ebf at users.sourceforge.net</a>.
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
 
-</p>
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
 
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/eric_friedman.jpg"><img border="0"
+  src="http://boost.sourceforge.net/photos/eric_friedman_small.jpg" alt=
+  "eric_friedman.jpg" align="left" hspace="10" vspace="5" width="100" height=
+  "131"></a> Eric Friedman is an undergraduate at Stanford University. Born
+  in 1984, he discovered programming at 10 and Boost at 17. He is a Computer
+  Science major, with interests in Political Science and Arabic.<br>
+  <br>
+  Eric is co-author of the <a href="../libs/variant/index.html">Variant
+  library</a> and intends to author more.<br>
+  <br>
+  He enjoys rap music, discussing politics, and, of course, programming.<br>
+  <br>
+  Though not starving, Eric is a college student and so appreciates both
+  spontaneous donations and internship opportunities. He can be contacted at
+  <a href=
+  "mailto:ebf at users.sourceforge.net">ebf at users.sourceforge.net</a>.<br clear=
+  "all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2003 Eric Friedman</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
-</html>
\ No newline at end of file
+</html>

Modified: boost/trunk/people/fernando_cacciola.html
===================================================================
--- boost/trunk/people/fernando_cacciola.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/fernando_cacciola.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,48 +1,84 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
 <html>
 <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Fernando Cacciola</title>
-    <link rel="stylesheet" href="../boost.css" type="text/css">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Fernando Cacciola</title>
+  <link rel="stylesheet" href="../boost.css" type="text/css">
 </head>
 
-    <body>
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-        <tr>
-            <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (8819 bytes)" width="277" height="86"></td>
-            <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-            <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-            <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-            <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-            <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-        </tr>
-    </table>
-    <p>
-    <a href="http://boost.sourceforge.net/photos/fernando_cacciola.jpg"><img
-border="0"
-src="http://boost.sourceforge.net/photos/fernando_cacciola_small.jpg"
-alt="http://boost.sourceforge.net/photos/fernando_cacciola.jpg (38339 bytes)"
-align="left" width="100" height="96"></a>
+<body>
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (8819 bytes)" width="277" height="86"></td>
 
-    <p>
-    <a href=mailto:fernando_cacciola at hotmail.com>Fernando Cacciola</a> has been programming since 1984 when he got his hand
-on a Tandy Color Computer II for the first time. He started with BASIC at the time, but quickly moved to Assembly Language to get
-the most out of the Home Computers of the time (from a Sinclair 1500 [Z80] to a Commodore 64 [Motorola 6510]).</p>
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-    <p>
-    In 1990 he discovered
-the C programming language and started to work as a professional programmer. In 1995 he discovered C++,
-    and during his long time employement in a company producing CAD systems, the
-    fields of Computational Geometry, Computer Graphics, Image Processing and
-    Numerics in general.</p>
-    <p>He studied Biochemistry at the John F. Kennedy (Argentina) University for 4 years, but had to drop because of his full-time job
-    as a programmer. He would complete a CS degree if he only had the time.</p>
-    <p>After 13 years of being an employed programmer (in just a couple of companies), by the end of 2003 he became a freelancer
-    and founded SciSoft, a company specialized in technically/scientifically-oriented software.</p>
-    <p>He loves to spend his spare-time, which isn't much, with his wife and 
-    kids. If there's any time left, he enjoys stoping by a friend with his family, and studying math,
-    pyshics and chemistry. He would also enjoy some outdoor activity or sport, but there is no time left for this.</p>
-    <p>He was born in 1971 in Buenos Aires, Argentina.</p>
-    </body>
-</html>
\ No newline at end of file
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/fernando_cacciola.jpg"><img border="0"
+  src="http://boost.sourceforge.net/photos/fernando_cacciola_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/fernando_cacciola.jpg (38339 bytes)"
+  align="left" width="100" height="96"></a></p>
+
+  <p><a href="mailto:fernando_cacciola at hotmail.com">Fernando Cacciola</a> has
+  been programming since 1984 when he got his hand on a Tandy Color Computer
+  II for the first time. He started with BASIC at the time, but quickly moved
+  to Assembly Language to get the most out of the Home Computers of the time
+  (from a Sinclair 1500 [Z80] to a Commodore 64 [Motorola 6510]).</p>
+
+  <p>In 1990 he discovered the C programming language and started to work as
+  a professional programmer. In 1995 he discovered C++, and during his long
+  time employement in a company producing CAD systems, the fields of
+  Computational Geometry, Computer Graphics, Image Processing and Numerics in
+  general.</p>
+
+  <p>He studied Biochemistry at the John F. Kennedy (Argentina) University
+  for 4 years, but had to drop because of his full-time job as a programmer.
+  He would complete a CS degree if he only had the time.</p>
+
+  <p>After 13 years of being an employed programmer (in just a couple of
+  companies), by the end of 2003 he became a freelancer and founded SciSoft,
+  a company specialized in technically/scientifically-oriented software.</p>
+
+  <p>He loves to spend his spare-time, which isn't much, with his wife and
+  kids. If there's any time left, he enjoys stoping by a friend with his
+  family, and studying math, pyshics and chemistry. He would also enjoy some
+  outdoor activity or sport, but there is no time left for this.</p>
+
+  <p>He was born in 1971 in Buenos Aires, Argentina.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2004 Fernando Cacciola</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>

Modified: boost/trunk/people/gary_powell.htm
===================================================================
--- boost/trunk/people/gary_powell.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/gary_powell.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,30 +1,71 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Gary Powell</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/gary_powell.jpg"><img border="0" src="http://boost.sourceforge.net/photos/gary_powell_small.jpg" alt="gary_powell.jpg (13577 bytes)" align="left" hspace="10" vspace="5" width="100" height="133"></a>Gary 
-      Powell has been messing around with C++ since '87 when he dreamed about adding 
-      his own operators to the language. Since then he's been busy overloading 
-      everything in sight, and working on bringing functional programming to C++.</p>
-    <p>He currently works for Sierra On-line <a href="http://www.sierra.com">http://www.sierra.com</a>
-      a division of Havas Interactive, a wholly owned subsidiary of Vivedi Universal 
-      of France, <a href="http://www.vivendi.com">http://www.vivendi.com</a> as a 
-      game programmer where he writes AI.</p>
-    <p>He can be reached at <a href="mailto:gary.powell at sierra.com">gary.powell at sierra.com</a>
-      but don't ask him how to solve the riddle of the left handed troll.</p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Gary Powell</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/gary_powell.jpg"><img border="0" src=
+  "http://boost.sourceforge.net/photos/gary_powell_small.jpg" alt=
+  "gary_powell.jpg (13577 bytes)" align="left" hspace="10" vspace="5" width=
+  "100" height="133"></a>Gary Powell has been messing around with C++ since
+  '87 when he dreamed about adding his own operators to the language. Since
+  then he's been busy overloading everything in sight, and working on
+  bringing functional programming to C++.</p>
+
+  <p>He currently works for Sierra On-line <a href=
+  "http://www.sierra.com">http://www.sierra.com</a> a division of Havas
+  Interactive, a wholly owned subsidiary of Vivedi Universal of France,
+  <a href="http://www.vivendi.com">http://www.vivendi.com</a> as a game
+  programmer where he writes AI.</p>
+
+  <p>He can be reached at <a href=
+  "mailto:gary.powell at sierra.com">gary.powell at sierra.com</a> but don't ask
+  him how to solve the riddle of the left handed troll.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2000 Gary Powell</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/gennadiy_rozental.htm
===================================================================
--- boost/trunk/people/gennadiy_rozental.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/gennadiy_rozental.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,35 +1,69 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
 <html>
 <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Gennadiy Rozental</title>
-    <link rel="stylesheet" href="../boost.css" type="text/css">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Gennadiy Rozental</title>
+  <link rel="stylesheet" href="../boost.css" type="text/css">
 </head>
 
-    <body>
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-        <tr>
-            <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (8819 bytes)" width="277" height="86"></td>
-            <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-            <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-            <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-            <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-            <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-        </tr>
-    </table>
-    <p>
-    <a href="http://boost.sourceforge.net/photos/gennadiy_rozental.jpg"><img
-border="0"
-src="http://boost.sourceforge.net/photos/gennadiy_rozental_small.jpg"
-alt="http://boost.sourceforge.net/photos/gennadiy_rozental.jpg"
-align="left" width="100" height="75"></a> Gennadiy Rozental is a software 
-    developer from Ukraine, who now lives in New Jersey, United States and work 
-    for Thomson Financial in New York. He is married, with son and daughter.<p>
-    Gennadiy graduated from MIPT: Moscow Institute of Physics and Technology 
-    with Master degree in computer science. Ever since Gennadiy has been 
-    programming mostly in C++.<p>
-    In his spare time he not only works on boost, but also enjoy origami making.<p>
-    You can contact him by sending mail to rogeeff at mail dot com
+<body>
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (8819 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/gennadiy_rozental.jpg"><img border="0"
+  src="http://boost.sourceforge.net/photos/gennadiy_rozental_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/gennadiy_rozental.jpg" align="left"
+  width="100" height="75"></a>Gennadiy Rozental is a software developer from
+  Ukraine, who now lives in New Jersey, United States and work for Thomson
+  Financial in New York. He is married, with son and daughter.</p>
+
+  <p>Gennadiy graduated from MIPT: Moscow Institute of Physics and Technology
+  with Master degree in computer science. Ever since Gennadiy has been
+  programming mostly in C++.</p>
+
+  <p>In his spare time he not only works on boost, but also enjoy origami
+  making.</p>
+
+  <p>You can contact him by sending mail to rogeeff at mail dot com<br clear=
+  "all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->21
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39358" --></p>
+
+  <p><i>Copyright &copy; 2004 Gennadiy Rozental</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
-</html>
\ No newline at end of file
+</html>

Modified: boost/trunk/people/greg_colvin.htm
===================================================================
--- boost/trunk/people/greg_colvin.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/greg_colvin.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,34 +1,59 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-    <title>Greg Colvin</title>
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" WIDTH="277" HEIGHT="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home </big></font>
-          </a>
-        </td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries </big>
-            </font></a>
-        </td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People </big></font>
-          </a>
-        </td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ </big></font>
-          </a>
-        </td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More </big></font>
-          </a>
-        </td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/greg_colvin.jpg"><img src="http://boost.sourceforge.net/photos/greg_colvin_small.jpg" alt="greg_colvin.jpg (52k bytes)" border="0" align="left" hspace="10" vspace="5" WIDTH="100" HEIGHT="133"></a>
-      Dr. Greg Colvin has been hacking happily since 1972. He is a member of the 
-      ANSI/ISO C++ standards committee and a Principal Member of Technical Staff with 
-      the Java Products Group at Oracle Corporation. In his spare time he plays 
-      apocalyptic electric blues guitar in his Colorado, USA home studio.</p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Greg Colvin</title>
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href="http://boost.sourceforge.net/photos/greg_colvin.jpg"><img src=
+  "http://boost.sourceforge.net/photos/greg_colvin_small.jpg" alt=
+  "greg_colvin.jpg (52k bytes)" border="0" align="left" hspace="10" vspace=
+  "5" width="100" height="133"></a>Dr. Greg Colvin has been hacking happily
+  since 1972. He is a member of the ANSI/ISO C++ standards committee and a
+  Principal Member of Technical Staff with the Java Products Group at Oracle
+  Corporation. In his spare time he plays apocalyptic electric blues guitar
+  in his Colorado, USA home studio.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11 November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2000 Greg Colvin</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/hartmut_kaiser.htm
===================================================================
--- boost/trunk/people/hartmut_kaiser.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/hartmut_kaiser.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,43 +1,69 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
 
-<head>
-<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>Harmut Kaiser</title>
+  <title>Harmut Kaiser</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    
-    <p><a href="http://boost.sourceforge.net/photos/hartmut_kaiser.jpg">
-    <img src="http://boost.sourceforge.net/photos/hartmut_kaiser_small.jpg"
-    alt="http://boost.sourceforge.net/photos/hartmut_kaiser.jpg"
-    border="0" align="left" hspace="10" vspace="5" height="133"></a>
-    After 15+ interesting years that 
-    Hartmut spent working in industrial
-    software development, he still tremendously enjoys working with modern
-    software development technologies and techniques. His preferred field of
-    interest is the software development in the area of object-oriented and
-    component-based programming in C++ and its application in complex
-    contexts, such as for spatial information systems, internet based
-    applications and parser technologies. Hartmut enjoys using and learning
-    about modern C++ programming techniques, such as template based generic
-    and meta-programming and preprocessor based meta-programming.</p>
-    
-    <p>You can contact him by sending mail to: Hartmut.Kaiser [at] gmail
-    [dot] com</p>
-    
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/hartmut_kaiser.jpg"><img src=
+  "http://boost.sourceforge.net/photos/hartmut_kaiser_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/hartmut_kaiser.jpg" border="0" align=
+  "left" hspace="10" vspace="5" height="133"></a> After 15+ interesting years
+  that Hartmut spent working in industrial software development, he still
+  tremendously enjoys working with modern software development technologies
+  and techniques. His preferred field of interest is the software development
+  in the area of object-oriented and component-based programming in C++ and
+  its application in complex contexts, such as for spatial information
+  systems, internet based applications and parser technologies. Hartmut
+  enjoys using and learning about modern C++ programming techniques, such as
+  template based generic and meta-programming and preprocessor based
+  meta-programming.</p>
+
+  <p>You can contact him by sending mail to: Hartmut.Kaiser [at] gmail [dot]
+  com<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11 November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2006 Harmut Kaiser</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
-
-</html>
\ No newline at end of file
+</html>

Modified: boost/trunk/people/herve_bronnimann.htm
===================================================================
--- boost/trunk/people/herve_bronnimann.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/herve_bronnimann.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,46 +1,65 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Herve Bronnimann</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home </big></font>
-          </a>
-        </td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries </big>
-            </font></a>
-        </td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People </big></font>
-          </a>
-        </td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ </big></font>
-          </a>
-        </td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More </big></font>
-          </a>
-        </td>
-      </tr>
-    </table>
-    <p><a
-href="http://boost.sourceforge.net/photos/herve_bronnimann.jpg"><img
-border="0"
-src="http://boost.sourceforge.net/photos/herve_bronnimann_small.jpg"
-alt="herve_bronnimann.jpg (12867 bytes)" align="left" hspace="10"
-vspace="5" width="100" height="133"></a>Herv&eacute;
-      Br&ouml;nnimann is an Assistant Professor at the
-      <a href="http://www.poly.edu">Polytechnic University</a> in Brooklyn, NY.
-      His research deals with computational geometry, algorithms, and
-      implementation.
-      Prior to crossing the Atlantic, he was a researcher at INRIA,
-      participating in the development of the
-      <a href="http://www.cgal.org">CGAL library</a> for geometric computation.<br>
-      <br>
-      In Boost, he is one of the authors of the Interval library, and of the
-      Minmax library.</p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Herve Bronnimann</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/herve_bronnimann.jpg"><img border="0"
+  src="http://boost.sourceforge.net/photos/herve_bronnimann_small.jpg" alt=
+  "herve_bronnimann.jpg (12867 bytes)" align="left" hspace="10" vspace="5"
+  width="100" height="133"></a>Herv&eacute; Br&ouml;nnimann is an Assistant
+  Professor at the <a href="http://www.poly.edu">Polytechnic University</a>
+  in Brooklyn, NY. His research deals with computational geometry,
+  algorithms, and implementation. Prior to crossing the Atlantic, he was a
+  researcher at INRIA, participating in the development of the <a href=
+  "http://www.cgal.org">CGAL library</a> for geometric computation.<br>
+  <br>
+  In Boost, he is one of the authors of the Interval library, and of the
+  Minmax library.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11 November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2004 Herv&eacute; Br&ouml;nnimann</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/howard_hinnant.htm
===================================================================
--- boost/trunk/people/howard_hinnant.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/howard_hinnant.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,38 +1,75 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Howard Hinnant</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home </big></font>
-          </a>
-        </td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries </big>
-            </font></a>
-        </td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People </big></font>
-          </a>
-        </td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ </big></font>
-          </a>
-        </td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More </big></font>
-          </a>
-        </td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/howard_hinnant.jpg"><img border="0" src="http://boost.sourceforge.net/photos/howard_hinnant_small.jpg" align="left" hspace="10" vspace="5" alt="howard_hinnant.jpg (19817 bytes)" width="100" height="97"></a>When 
-      Howard Hinnant is not monkeying around, he is the principal author of the 
-      Metrowerks CodeWarrior C++ library. He is also a member of the C++ Standards 
-      committee.</p>
-    <p>Howard is married with four children, two dogs, one cat, a rabbit, an 
-      undetermined number of rodents (which the cat ignores), and ... well, we're 
-      really not sure what else. When not sitting in front of his computer, Howard 
-      enjoys snow skiing and ... more, snow skiing.</p>
-  </body>
-</html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 5.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Howard Hinnant</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/howard_hinnant.jpg"><img border="0"
+  src="http://boost.sourceforge.net/photos/howard_hinnant_small.jpg" align=
+  "left" hspace="10" vspace="5" alt="howard_hinnant.jpg (19817 bytes)" width=
+  "100" height="97"></a>When Howard Hinnant is not monkeying around, he is a 
+  software engineer for Apple and represents Apple on the C++ Standards 
+  committee as Library Working Group Chairman.&nbsp; Howard has is also one of the 
+  co-authors / co-inventors of the rvalue reference work for C++09 making move 
+  semantics and perfect forwarding practical in C++.&nbsp; In the past Howard was the 
+  principal author of the CodeWarrior C++ library.</p>
+ 
+  <p>Howard is married with four children, four dogs (he really isn't that fond of 
+  dogs), a rabbit, several exotic lizards with the usual accompaniment of 
+  insects (which the lizards are supposed to eat but find more entertaining to 
+  turn loose in the house), um... let's see ... fish, wild mice (they eventually 
+  kidnapped all the domesticated rodents), several dozen chickens (no I'm not 
+  kidding)...&nbsp; The neighbors are trying to turn my property into a federally 
+  protected wildlife preserve.&nbsp; They've got a fighting chance ... the kids alone 
+  would qualify.</p>
+    
+  <p>When not sitting in front of his computer, Howard enjoys snow skiing and ... 
+  more, snow skiing. <br clear="all"></p>
+
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->06 December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38518" --></p>
+
+  <p><i>Copyright &copy; 2000 Howard Hinnant</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
+</html>
\ No newline at end of file

Modified: boost/trunk/people/hubert_holin.html
===================================================================
--- boost/trunk/people/hubert_holin.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/hubert_holin.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,46 +1,77 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <title>Hubert Holin</title>
-    <meta http-equiv="generator" content="Adobe GoLive 5">
-    <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" WIDTH="277" HEIGHT="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home </big></font>
-          </a>
-        </td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries </big>
-            </font></a>
-        </td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People </big></font>
-          </a>
-        </td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ </big></font>
-          </a>
-        </td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More </big></font>
-          </a>
-        </td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/hubert_holin.jpg"><img src="http://boost.sourceforge.net/photos/hubert_holin_small.jpg" width="100" height="120" border="0" align="left"></a>Hubert 
-      Holin is a mathematician. He is currently a civil servant of the french state 
-      (no longer indentured, but still stuck). He has also worked as a developper in 
-      a small french start-up , and as a math teacher in a private non-religious 
-      higher-ed school.</p>
-    <p>His first programs were in assembly language/micro-code on an Hewlett-Packard <a href="http://www.hpmuseum.org/hp25.htm">
-        HP 25</a> hand-held calculator (a marked improvement over his father's use of 
-      binary-on-strips-of-paper on some forgoten piece of metal...), back in the 
-      mists of time. He is a Mac-using refugee of the Atari, and on a personal jihad 
-      against The Evil Empire Of Computing &#153;.</p>
-    <p>Very much a Child of the World, he has lived in Europe, Africa, the U.S.A., 
-      and is married with a chinese girl (with whom he has both a daughter and a 
-      son).</p>
-    <p></p>
-    <hr>
-    <p>Email: <a href="mailto:Hubert.Holin at Bigfoot.com">Hubert.Holin at Bigfoot.com</a></p>
-    <p>Home page: <a href="http://www.Bigfoot.com/~Hubert.Holin">http://www.Bigfoot.com/~Hubert.Holin</a></p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta http-equiv="generator" content="Adobe GoLive 5">
+
+  <title>Hubert Holin</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href="http://boost.sourceforge.net/photos/hubert_holin.jpg"><img src=
+  "http://boost.sourceforge.net/photos/hubert_holin_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/hubert_holin.jpg" width="100" height=
+  "120" border="0" align="left"></a>Hubert Holin is a mathematician. He is
+  currently a civil servant of the french state (no longer indentured, but
+  still stuck). He has also worked as a developper in a small french start-up
+  , and as a math teacher in a private non-religious higher-ed school.</p>
+
+  <p>His first programs were in assembly language/micro-code on an
+  Hewlett-Packard <a href="http://www.hpmuseum.org/hp25.htm">HP 25</a>
+  hand-held calculator (a marked improvement over his father's use of
+  binary-on-strips-of-paper on some forgoten piece of metal...), back in the
+  mists of time. He is a Mac-using refugee of the Atari, and on a personal
+  jihad against The Evil Empire Of Computing &trade;.</p>
+
+  <p>Very much a Child of the World, he has lived in Europe, Africa, the
+  U.S.A., and is married with a chinese girl (with whom he has both a
+  daughter and a son).</p>
+  <hr>
+
+  <p>Email: <a href=
+  "mailto:Hubert.Holin at Bigfoot.com">Hubert.Holin at Bigfoot.com</a></p>
+
+  <p>Home page: <a href=
+  "http://www.Bigfoot.com/~Hubert.Holin">http://www.Bigfoot.com/~Hubert.Holin</a><br clear="all">
+  </p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11 November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2001 Hubert Holin</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/jaakko_jarvi.htm
===================================================================
--- boost/trunk/people/jaakko_jarvi.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/jaakko_jarvi.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,28 +1,69 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Jaakko Järvi</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/jaakko_jarvi.jpg"><img border="0" src="http://boost.sourceforge.net/photos/jaakko_jarvi_small.jpg" alt="jaakko_jarvi.jpg (25365 bytes)" align="center" hspace="10" vspace="5" width="100" height="82"></a></p>
-    <p>Jaakko Järvi is currently a researcher (Post doc) in the <a href="http://www.osl.iu.edu/">Open Systems Lab</a> at Indiana University.<br>
-      <br>
-      He's the author of the <a href="../libs/tuple/index.html">Tuple 
-        Library</a> and co-author of the <a href="../libs/lambda/index.html">Lambda Library.</a><br>
-      <br>
-      He can be reached at <a href="mailto:jajarvi at cs.indiana.edu">jajarvi at cs.indiana.edu</a>.
-    </p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Jaakko J&auml;rvi</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/jaakko_jarvi.jpg"><img border="0" src=
+  "http://boost.sourceforge.net/photos/jaakko_jarvi_small.jpg" alt=
+  "jaakko_jarvi.jpg (25365 bytes)" align="middle" hspace="10" vspace="5"
+  width="100" height="82"></a></p>
+
+  <p>Jaakko J&auml;rvi is currently a researcher (Post doc) in the <a href=
+  "http://www.osl.iu.edu/">Open Systems Lab</a> at Indiana University.<br>
+  <br>
+  He's the author of the <a href="../libs/tuple/index.html">Tuple Library</a>
+  and co-author of the <a href="../libs/lambda/index.html">Lambda
+  Library.</a><br>
+  <br>
+  He can be reached at <a href=
+  "mailto:jajarvi at cs.indiana.edu">jajarvi at cs.indiana.edu</a>.<br clear=
+  "all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2003 Jaakko J&auml;rvi</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/jeff_garland.html
===================================================================
--- boost/trunk/people/jeff_garland.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/jeff_garland.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,38 +1,74 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <title>Jeff Garland</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/jeff_garland.jpg"><img src="http://boost.sourceforge.net/photos/jeff_garland_small.jpg" alt="http://boost.sourceforge.net/photos/jeff_garland.jpg" border="0" align="left" hspace="10" vspace="5" width="100" height="133"></a>
-       Jeff Garland a software developer/consultant from sunny Phoenix, 
-      Arizona USA (that's always UTC-7 since there's no DST in AZ).
-      He is the author of the
-      <a href="http://www.boost.org/doc/html/date_time.html">boost date-time library</a>
-       as well as a book on
-      <a href="http://www.largescalesoftwarearchitecture.com">representing software architecture</a>.
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
-    </p>
-    <p>Jeff has been distracted from finishing all those cool features people
-       want in date-time by running the
-      <a href="http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl">Boost Wiki</a>,
-       serving as a review manager, and a
-      <a href="http://www.boost.org/more/moderators.html">Boost Moderator</a>.
-    </p>
-    <p>On the rare day that he's not in front of a computer from morning till night you 
-        might find him
-        out hiking, biking, or skiing in Arizona's mountains and canyons with his wife 
-        and 2 daughters.</p>
+  <title>Jeff Garland</title>
+</head>
 
-    <p>Email: <a href="mailto:jeff&#64;crystalclearsoftware.com">jeff at crystalclearsoftware.com</a></p>
-  </body>
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href="http://boost.sourceforge.net/photos/jeff_garland.jpg"><img src=
+  "http://boost.sourceforge.net/photos/jeff_garland_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/jeff_garland.jpg" border="0" align=
+  "left" hspace="10" vspace="5" width="100" height="133"></a>Jeff Garland a
+  software developer/consultant from sunny Phoenix, Arizona USA (that's
+  always UTC-7 since there's no DST in AZ). He is the author of the <a href=
+  "http://www.boost.org/doc/html/date_time.html">boost date-time library</a>
+  as well as a book on <a href=
+  "http://www.largescalesoftwarearchitecture.com">representing software
+  architecture</a>.</p>
+
+  <p>Jeff has been distracted from finishing all those cool features people
+  want in date-time by running the <a href=
+  "http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl">Boost
+  Wiki</a>, serving as a review manager, and a <a href=
+  "http://www.boost.org/more/moderators.html">Boost Moderator</a>.</p>
+
+  <p>On the rare day that he's not in front of a computer from morning till
+  night you might find him out hiking, biking, or skiing in Arizona's
+  mountains and canyons with his wife and 2 daughters.</p>
+
+  <p>Email: <a href="mailto:jeff at crystalclearsoftware.com">jeff at
+  crystalclearsoftware.com</a><br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2005 Jeff Garland</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/jens_maurer.htm
===================================================================
--- boost/trunk/people/jens_maurer.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/jens_maurer.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,34 +1,75 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Jens Maurer</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/jens_maurer.jpg"><img border="0" src="http://boost.sourceforge.net/photos/jens_maurer_small.jpg" alt="jens_maurer.jpg (15698 bytes)" hspace="10" vspace="5" align="left" width="100" height="124"></a>
-      Jens Maurer is a software developer from Germany who lives close to 
-      Frankfurt/Main. He was born in 1973 and hasn't died yet.</p>
-    <p>He has worked for a multimedia company programming home-banking applications, 
-      CGI scripts and Java applications. He also helped program some simulation 
-      systems for long-term decision support to aid businessmen in arguing about 
-      company investments.</p>
-    <p>He is neither married nor does he have a girl friend, but asked his colleagues 
-      to find one for him.</p>
-    <p>In his spare time, he likes visiting foreign countries but dislikes getting 
-      there in uncomfortable airplane seats. On random week-ends, he enjoys 
-      participating in historic dance courses (without a costume, of course). 
-      Sometimes, he needs fresh air and goes for a walk.&nbsp;</p>
-    <p>Email: <a href="mailto:Jens.Maurer at gmx.net">Jens.Maurer at gmx.net</a></p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Jens Maurer</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/jens_maurer.jpg"><img border="0" src=
+  "http://boost.sourceforge.net/photos/jens_maurer_small.jpg" alt=
+  "jens_maurer.jpg (15698 bytes)" hspace="10" vspace="5" align="left" width=
+  "100" height="124"></a>Jens Maurer is a software developer from Germany who
+  lives close to Frankfurt/Main. He was born in 1973 and hasn't died yet.</p>
+
+  <p>He has worked for a multimedia company programming home-banking
+  applications, CGI scripts and Java applications. He also helped program
+  some simulation systems for long-term decision support to aid businessmen
+  in arguing about company investments.</p>
+
+  <p>He is neither married nor does he have a girl friend, but asked his
+  colleagues to find one for him.</p>
+
+  <p>In his spare time, he likes visiting foreign countries but dislikes
+  getting there in uncomfortable airplane seats. On random week-ends, he
+  enjoys participating in historic dance courses (without a costume, of
+  course). Sometimes, he needs fresh air and goes for a walk.&nbsp;</p>
+
+  <p>Email: <a href=
+  "mailto:Jens.Maurer at gmx.net">Jens.Maurer at gmx.net</a><br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2000 Jens Maurer</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/jeremy_siek.htm
===================================================================
--- boost/trunk/people/jeremy_siek.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/jeremy_siek.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,42 +1,71 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Jeremy Siek</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home </big></font>
-          </a>
-        </td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries </big>
-            </font></a>
-        </td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People </big></font>
-          </a>
-        </td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ </big></font>
-          </a>
-        </td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More </big></font>
-          </a>
-        </td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/jeremy_siek.jpg"><img border="0" src="http://boost.sourceforge.net/photos/jeremy_siek_small.jpg" alt="jeremy_siek.jpg (12867 bytes)" align="left" hspace="10" vspace="5" width="100" height="133"></a>Jeremy 
-      Siek is a Ph.D. student at Indiana Univ. Bloomington.<br>
-      <br>
-      He is the author of the Matrix Template Library (MTL), and helped design the 
-      Generic Graph Component Library, which is now the Boost Graph Library (BGL).<br>
-      <br>
-      Once in a while Jeremy "comes up for air" and enjoys fencing, hiking, skiing, 
-      and reading. He's also been spotted at a few fightin' irish tailgaters (BYOB).<br>
-      <br>
-      Jeremy has an intense fear for the ancient dark forests where dusty decks 
-      thrive and devour programmers, places where the light of abstraction has not 
-      yet reached.</p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Jeremy Siek</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/jeremy_siek.jpg"><img border="0" src=
+  "http://boost.sourceforge.net/photos/jeremy_siek_small.jpg" alt=
+  "jeremy_siek.jpg (12867 bytes)" align="left" hspace="10" vspace="5" width=
+  "100" height="133"></a>Jeremy Siek is a Ph.D. student at Indiana Univ.
+  Bloomington.<br>
+  <br>
+  He is the author of the Matrix Template Library (MTL), and helped design
+  the Generic Graph Component Library, which is now the Boost Graph Library
+  (BGL).<br>
+  <br>
+  Once in a while Jeremy "comes up for air" and enjoys fencing, hiking,
+  skiing, and reading. He's also been spotted at a few fightin' irish
+  tailgaters (BYOB).<br>
+  <br>
+  Jeremy has an intense fear for the ancient dark forests where dusty decks
+  thrive and devour programmers, places where the light of abstraction has
+  not yet reached.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2001 Jeremy Siek</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/joaquin_lopez.htm
===================================================================
--- boost/trunk/people/joaquin_lopez.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/joaquin_lopez.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,47 +1,72 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0.1 Transitional//EN">
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz</title>
 </head>
 
 <body bgcolor="#FFFFFF">
-<table cellPadding="2" bgColor="#007f7f" border="1">
-  <tr>
-    <td bgColor="#ffffff">
-      <img alt="boost.png (6897 bytes)" src="../boost.png" width="277" height="86"></td>
-    <td><a href="../index.htm"><font face="Arial" color="#ffffff"><big>Home</big></font></a></td>
-    <td><a href="../libs/libraries.htm"><font face="Arial" color="#ffffff"><big> Libraries</big></font></a></td>
-    <td><a href="people.htm"><font face="Arial" color="#ffffff"><big>People</big></font></a></td>
-    <td><a href="../more/faq.htm"><font face="Arial" color="#ffffff"><big>FAQ</big></font></a></td>
-    <td><a href="../more/index.htm"><font face="Arial" color="#ffffff"><big>More</big></font></a></td>
-  </tr>
-</table>
+  <table cellpadding="2" bgcolor="#007F7F" border="1" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img alt="boost.png (6897 bytes)" src=
+      "../boost.png" width="277" height="86"></td>
 
-<p>
-<a href="http://boost.sourceforge.net/photos/joaquin_lopez.jpg">
-<img border="0"
-   src="http://boost.sourceforge.net/photos/joaquin_lopez_small.jpg"
-   alt="http://boost.sourceforge.net/photos/joaquin_lopez.jpg (30625 bytes)"
-   align="left" hspace="10" vspace="5" width="100" height="135">
-</a> Joaqu&iacute;n is a telecom engineer from the <a href="http://www.upm.es">Polytechnic
-University of Madrid</a>. He currently works at
-<a href="http://www.tid.es">Telef&oacute;nica, Investigaci&oacute;n y Desarrollo</a>,
-the R&D branch of the Telef&oacute;nica Group, where he leads a small group
-of developers of multimedia mobile applications. Though actual programming is not
-one of his job responsibilities, he still does some C++ for fun when nobody's around.
-</p>
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-<p>
-Joaqu&iacute;n's professional career began with his first exposure
-to a Dragon 32 (a Tandy TRS-80 clone) at the age of 13, though at the time he
-probably was unaware of the future impact of this event.
-He enjoys Mathematics, Logic and Latin; his lower case interests include paper
-folding, compulsory reading, travel and visiting all sorts of pubs and restaurants.
-You can contact him at <a href="mailto:joaquin at tid.es">joaquin at tid.es</a>.
-</p>
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
 
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/joaquin_lopez.jpg"><img border="0"
+  src="http://boost.sourceforge.net/photos/joaquin_lopez_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/joaquin_lopez.jpg (30625 bytes)"
+  align="left" hspace="10" vspace="5" width="100" height=
+  "135"></a>Joaqu&iacute;n is a telecom engineer from the <a href=
+  "http://www.upm.es">Polytechnic University of Madrid</a>. He currently
+  works at <a href="http://www.tid.es">Telef&oacute;nica,
+  Investigaci&oacute;n y Desarrollo</a>, the R&amp;D branch of the
+  Telef&oacute;nica Group, where he leads a small group of engineers working on
+  advanced mobile services. Though actual programming is not one of his
+  job responsibilities, he still does some C++ for fun when nobody's
+  around.</p>
+
+  <p>Joaqu&iacute;n's professional career began with his first exposure to a
+  Dragon 32 (a Tandy TRS-80 clone) at the age of 13, though at the time he
+  probably was unaware of the future impact of this event. He enjoys
+  Mathematics, Logic and Latin; his lower case interests include paper
+  folding, compulsive reading, travel and visiting all sorts of pubs and
+  restaurants. You can contact him at <a href=
+  "mailto:joaquin at tid.es">joaquin at tid.es</a>.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->12
+  February, 2007<!--webbot bot="Timestamp" endspan i-checksum="39358" --></p>
+
+  <p><i>Copyright &copy; 2004-2007 Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>
-

Modified: boost/trunk/people/joel_de_guzman.htm
===================================================================
--- boost/trunk/people/joel_de_guzman.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/joel_de_guzman.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,44 +1,72 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
 
-<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>Joel de Guzman</title>
+  <title>Joel de Guzman</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/joel_de_guzman.jpg">
-    <img src="http://boost.sourceforge.net/photos/joel_de_guzman_small.jpg"
-    alt="http://boost.sourceforge.net/photos/joel_de_guzman.jpg"
-    border="0" align="left" hspace="10" vspace="5" height="133"></a>
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-    Joel got into electronics and programming in the 80s because almost 
-    everything in music, his first love, is becoming electronic and digital. 
-    Back then, he used to build his own guitars, effect boxes and synths. He 
-    enjoys playing distortion-laden rock guitar, composes and produces his own 
-    music in his home studio.</p>
-    <p>In the 90s, he went to Japan and worked there as a software engineer. 
-    There, he learned C++ and immediately fell in love it. He's still trying his 
-    best to master the language in all its immensity.</p>
-    
-<p>Joel is quite adept in writing code using modern C++ techniques such as template 
-  metaprogramming and C++ functional programming. He's very happy and enthusiastic 
-  with his current job as a consultant and engineer at <a href="http://www.boost-consulting.com">Boost 
-  Consulting</a>.</p>
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
 
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/joel_de_guzman.jpg"><img src=
+  "http://boost.sourceforge.net/photos/joel_de_guzman_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/joel_de_guzman.jpg" border="0" align=
+  "left" hspace="10" vspace="5" height="133"></a>Joel got into electronics
+  and programming in the 80s because almost everything in music, his first
+  love, is becoming electronic and digital. Back then, he used to build his
+  own guitars, effect boxes and synths. He enjoys playing distortion-laden
+  rock guitar, composes and produces his own music in his home studio.</p>
+
+  <p>In the 90s, he went to Japan and worked there as a software engineer.
+  There, he learned C++ and immediately fell in love it. He's still trying
+  his best to master the language in all its immensity.</p>
+
+  <p>Joel is quite adept in writing code using modern C++ techniques such as
+  template metaprogramming and C++ functional programming. He's very happy
+  and enthusiastic with his current job as a consultant and engineer at
+  <a href="http://www.boost-consulting.com">Boost Consulting</a>.<br clear=
+  "all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2003 Joel de Guzman</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
-
-</html>
\ No newline at end of file
+</html>

Modified: boost/trunk/people/john_maddock.htm
===================================================================
--- boost/trunk/people/john_maddock.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/john_maddock.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,34 +1,65 @@
+<!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="GENERATOR" content="Microsoft FrontPage Express 2.0">
-    <title>John Maddock</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="../libs/libraries.htm"><font color="#FFFFFF" size="4" face="Arial">Libraries
-            </font></a>
-        </td>
-        <td><a href="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>
-    <p><a href="http://boost.sourceforge.net/photos/john_maddock.jpg"><img src="http://boost.sourceforge.net/photos/john_maddock_small.jpg" alt="john_maddock.jpg (14611bytes)" align="left" border="0" hspace="10" vspace="5" width="100" height="133"></a>
-      John Maddock is a software developer from England and holds a PhD in Chemistry, 
-      but found that computers smell less and explode less often!</p>
-    <p>John is the author of the <a href="http://ourworld.compuserve.com/homepages/John_Maddock/regexpp.htm">
-        regex++ regular expression package</a>, has an almost pathological interest 
-      in anything that &quot;can't be done&quot;, and can be contacted at <a href="mailto:john at johnmaddock.co.uk">
-        john at johnmaddock.co.uk</a>.</p>
-  </body>
+<head>
+  <title>John Maddock</title>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" cellpadding="2" bgcolor="#007F7F" summary="">
+    <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="../libs/libraries.htm"><font color="#FFFFFF" size="4"
+      face="Arial">Libraries</font></a></td>
+
+      <td><a href="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>
+
+  <p><a href="http://boost.sourceforge.net/photos/john_maddock.jpg"><img src=
+  "http://boost.sourceforge.net/photos/john_maddock_small.jpg" alt=
+  "john_maddock.jpg (14611bytes)" align="left" border="0" hspace="10" vspace=
+  "5" width="100" height="133"></a> John Maddock is a software developer from
+  England and holds a PhD in Chemistry, but found that computers smell less
+  and explode less often!</p>
+
+  <p>John is the author of the <a href=
+  "http://ourworld.compuserve.com/homepages/John_Maddock/regexpp.htm">regex++
+  regular expression package</a>, has an almost pathological interest in
+  anything that "can't be done", and can be contacted at <a href=
+  "mailto:john at johnmaddock.co.uk">john at johnmaddock.co.uk</a>.<br clear=
+  "all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2003 John Maddock</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/jonathan_turkanis.htm
===================================================================
--- boost/trunk/people/jonathan_turkanis.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/jonathan_turkanis.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,26 +1,64 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Jonathan Turkanis</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png
-    (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/jonathan_turkanis.jpg">
-    <img src="http://boost.sourceforge.net/photos/jonathan_turkanis_small.jpg"
-     alt="jonathan_turkanis.jpg" border="0" align="left" hspace="10" vspace="5" width="100" height="133"></a>Jonathan Turkanis is a Ph.D. Candidate in mathematical logic at the University of California at Berkeley and a coauthor of the forthcoming <I>C++ Cookbook</I>, published by O'Reily.</p>
-    <p>You can contact him by sending mail to </a><a href="mailto:technews at kangaroologic.com">technews at kangaroologic.com</a><a>.</p>
-    </a>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Jonathan Turkanis</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/jonathan_turkanis.jpg"><img src=
+  "http://boost.sourceforge.net/photos/jonathan_turkanis_small.jpg" alt=
+  "jonathan_turkanis.jpg" border="0" align="left" hspace="10" vspace="5"
+  width="100" height="133"></a>Jonathan Turkanis is a Ph.D. Candidate in
+  mathematical logic at the University of California at Berkeley and a
+  coauthor of the forthcoming <i>C++ Cookbook</i>, published by O'Reily.</p>
+
+  <p>You can contact him by sending mail to <a href=
+  "mailto:technews at kangaroologic.com">technews at kangaroologic.com</a>.<br clear="all">
+  </p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->24
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38516" --></p>
+
+  <p><i>Copyright &copy; 2005 Jonathan Turkanis</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/kevlin_henney.htm
===================================================================
--- boost/trunk/people/kevlin_henney.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/kevlin_henney.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,55 +1,84 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Kevlin Henney</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home </big></font>
-          </a>
-        </td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries </big>
-            </font></a>
-        </td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People </big></font>
-          </a>
-        </td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ </big></font>
-          </a>
-        </td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More </big></font>
-          </a>
-        </td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/kevlin_henney.jpg"><img border="0" src="http://boost.sourceforge.net/photos/kevlin_henney_small.jpg" alt="kevlin_henney.jpg (18107 bytes)" align="left" hspace="10" vspace="5" width="100" height="142"></a>
-      Kevlin Henney (<a href="mailto:kevlin at curbralan.com">mailto:kevlin at curbralan.com</a>,
-      <a href="http://www.curbralan.com">http://www.curbralan.com</a>) is an 
-      independent consultant and trainer based in the UK. He has developed and 
-      delivered training course material and consultancy on many aspects of OO 
-      development, which he has practiced across a number of domains for longer than 
-      he cares (or can) remember. His professional interests include patterns, OO and 
-      component-based design, architecture, distributed object systems, and 
-      languages, including C++, C#, Java, and Ruby. He is also a member of the BSI 
-      C++ standards committee.
-    </p>
-    <p>Now that writing code is no longer the core responsibility of his job, his 
-      non-professional interests seem to include the hacking associated with the 
-      aforementioned professional interests. However, never being one to keep 
-      something to himself (like C++'s relationship with C, this is regarded as both 
-      a strength and a weakness), he shares/inflicts (delete as necessary) his 
-      professional and non-professional development experiences with/on (ditto) 
-      others through writing articles and presenting tutorials, workshops and papers 
-      at conferences.</p>
-    <p>He is married, and not just to his work. He and Carolyn have one child, 
-      Stefan. The little spare time that remains to him is taken up with music, 
-      reading, pub appreciation, etc. Although with a newborn, there is more reading 
-      and less pub appreciation (pubs are still appreciated, but more in memory than 
-      in interaction).&nbsp; Finally, although he enjoys writing, Kevlin is not 
-      really one for writing in the third person.</p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Kevlin Henney</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/kevlin_henney.jpg"><img border="0"
+  src="http://boost.sourceforge.net/photos/kevlin_henney_small.jpg" alt=
+  "kevlin_henney.jpg (18107 bytes)" align="left" hspace="10" vspace="5"
+  width="100" height="142"></a>Kevlin Henney (<a href=
+  "mailto:kevlin at curbralan.com">mailto:kevlin at curbralan.com</a>, <a href=
+  "http://www.curbralan.com">http://www.curbralan.com</a>) is an independent
+  consultant and trainer based in the UK. He has developed and delivered
+  training course material and consultancy on many aspects of OO development,
+  which he has practiced across a number of domains for longer than he cares
+  (or can) remember. His professional interests include patterns, OO and
+  component-based design, architecture, distributed object systems, and
+  languages, including C++, C#, Java, and Ruby. He is also a member of the
+  BSI C++ standards committee.</p>
+
+  <p>Now that writing code is no longer the core responsibility of his job,
+  his non-professional interests seem to include the hacking associated with
+  the aforementioned professional interests. However, never being one to keep
+  something to himself (like C++'s relationship with C, this is regarded as
+  both a strength and a weakness), he shares/inflicts (delete as necessary)
+  his professional and non-professional development experiences with/on
+  (ditto) others through writing articles and presenting tutorials, workshops
+  and papers at conferences.</p>
+
+  <p>He is married, and not just to his work. He and Carolyn have one child,
+  Stefan. The little spare time that remains to him is taken up with music,
+  reading, pub appreciation, etc. Although with a newborn, there is more
+  reading and less pub appreciation (pubs are still appreciated, but more in
+  memory than in interaction).&nbsp; Finally, although he enjoys writing,
+  Kevlin is not really one for writing in the third person.<br clear=
+  "all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2002 Kevlin Henney</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/liequan_lee.htm
===================================================================
--- boost/trunk/people/liequan_lee.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/liequan_lee.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,28 +1,66 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Lie-Quan Lee</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    &nbsp;
-    <p><a href="http://boost.sourceforge.net/photos/liequan_lee.jpg"><img border="0" src="http://boost.sourceforge.net/photos/liequan_lee_small.jpg" alt="liequan_lee.jpg (24165 bytes)" hspace="10" vspace="5" width="93" height="133" align="left"></a>Lie-Quan 
-      Lee, AKA Rich Lee, is a graduate stduent in Computer Science at University of 
-      Notre Dame. He is the author of the Generic Graph Component Library (GGCL).</p>
-    <p>He has a strong desire of learning to disassemble and assemable any electrical 
-      appliances. He likes playing bridge but never had a chance to play it after he 
-      entered the wonderful world of computers.</p>
-    <p>He can be contacted at liequan at slac.stanford.edu.</p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Lie-Quan Lee</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>&nbsp;
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/liequan_lee.jpg"><img border="0" src=
+  "http://boost.sourceforge.net/photos/liequan_lee_small.jpg" alt=
+  "liequan_lee.jpg (24165 bytes)" hspace="10" vspace="5" width="93" height=
+  "133" align="left"></a>Lie-Quan Lee, AKA Rich Lee, is a graduate stduent in
+  Computer Science at University of Notre Dame. He is the author of the
+  Generic Graph Component Library (GGCL).</p>
+
+  <p>He has a strong desire of learning to disassemble and assemable any
+  electrical appliances. He likes playing bridge but never had a chance to
+  play it after he entered the wonderful world of computers.</p>
+
+  <p>He can be contacted at liequan at slac.stanford.edu.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2004 Lie-Quan Lee</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/mac_murrett.htm
===================================================================
--- boost/trunk/people/mac_murrett.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/mac_murrett.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,27 +1,65 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <title>Mac Murrett</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/mac_murrett.jpg"><img border="0" src="http://boost.sourceforge.net/photos/mac_murrett_small.jpg" alt="mac_murrett.jpg (19542 bytes)" align="left" hspace="10" vspace="5" width="100" height="135"></a>
-      Mac Murrett is an Advanced Developer at <a href="http://www.vanteon.com/">Vanteon</a>. 
-      He lives in Rochester, NY, where everything closes at 10 PM. This gives him 
-      plenty of time to think.</p>
-    <p>Mac graduated from SUNY: University at Buffalo with a degree in Mathematics. 
-      He has been programming Macintoshes since he was 12 years old, and recently won <a href="http://www.hax.com/MacHack/HackContest.html">
-        the Best Hack Contest</a> at <a href="http://www.machack.com/">MacHack 2001<a />. 
-      Nonetheless, he swears up and down that his name has nothing to do with the 
-      computer.</p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Mac Murrett</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/mac_murrett.jpg"><img border="0" src=
+  "http://boost.sourceforge.net/photos/mac_murrett_small.jpg" alt=
+  "mac_murrett.jpg (19542 bytes)" align="left" hspace="10" vspace="5" width=
+  "100" height="135"></a> Mac Murrett is an Advanced Developer at <a href=
+  "http://www.vanteon.com/">Vanteon</a>. He lives in Rochester, NY, where
+  everything closes at 10 PM. This gives him plenty of time to think.</p>
+
+  <p>Mac graduated from SUNY: University at Buffalo with a degree in
+  Mathematics. He has been programming Macintoshes since he was 12 years old,
+  and recently won <a href="http://www.hax.com/MacHack/HackContest.html">the
+  Best Hack Contest</a> at <a href="http://www.machack.com/">MacHack
+  2001</a>. Nonetheless, he swears up and down that his name has nothing to
+  do with the computer.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2002 Mac Murrett</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/mark_rodgers.htm
===================================================================
--- boost/trunk/people/mark_rodgers.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/mark_rodgers.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,33 +1,74 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Mark Rodgers</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/mark_rodgers.jpg"><img border="0" src="http://boost.sourceforge.net/photos/mark_rodgers_small.jpg" alt="mark_rodgers.jpg (23035 bytes)" align="left" hspace="10" vspace="5" width="100" height="75"></a>Mark 
-      Rodgers lives in <a href="http://www.wellington.govt.nz/">Wellington</a>, 
-      the capital of New Zealand, 
-      with his wife, Clare, and their son, Ronnie.</p>
-    <p>He studied Computer Science at <a href="http://www.vuw.ac.nz/home/index.asp">Victoria 
-        University of Wellington</a> from 1983 to 1986, completing a <nobr>B.Sc. 
-        (Hons).</nobr> He now works as consultant through his company, Cadenza New 
-      Zealand Ltd, and also markets Cadenza Drawing Board™, a CAD system he 
-      developed.</p>
-    <p>Mark has been programming in C++ since about 1990, and loves every minute of 
-      it, but is continually amazed at how much more he still has to learn.</p>
-    <p>You can contact Mark at <a href="mailto:mark.rodgers at cadenza.co.nz">mark.rodgers at cadenza.co.nz</a>
-    .
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Mark Rodgers</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/mark_rodgers.jpg"><img border="0" src=
+  "http://boost.sourceforge.net/photos/mark_rodgers_small.jpg" alt=
+  "mark_rodgers.jpg (23035 bytes)" align="left" hspace="10" vspace="5" width=
+  "100" height="75"></a>Mark Rodgers lives in <a href=
+  "http://www.wellington.govt.nz/">Wellington</a>, the capital of New
+  Zealand, with his wife, Clare, and their son, Ronnie.</p>
+
+  <p>He studied Computer Science at <a href=
+  "http://www.vuw.ac.nz/home/index.asp">Victoria University of Wellington</a>
+  from 1983 to 1986, completing a B.Sc.&nbsp;(Hons). He now works as
+  consultant through his company, Cadenza New Zealand Ltd, and also markets
+  Cadenza Drawing Board&trade;, a CAD system he developed.</p>
+
+  <p>Mark has been programming in C++ since about 1990, and loves every
+  minute of it, but is continually amazed at how much more he still has to
+  learn.</p>
+
+  <p>You can contact Mark at <a href=
+  "mailto:mark.rodgers at cadenza.co.nz">mark.rodgers at cadenza.co.nz</a>.<br clear="all">
+  </p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->02
+  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38510" --></p>
+
+  <p><i>Copyright &copy; 2000 Mark Rodgers</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/mat_marcus.htm
===================================================================
--- boost/trunk/people/mat_marcus.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/mat_marcus.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,56 +1,69 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 3.2//EN">
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
 <html>
-  <head>
-    <meta name="generator" content=
-    "HTML Tidy for Cygwin (vers 1st April 2002), see www.w3.org">
-    <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">
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
 
-    <title>Mat Marcus</title>
-  </head>
+  <title>Mat Marcus</title>
+</head>
 
-  <body bgcolor="#FFFFFF">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
-        "boost.png (6897 bytes)" width="277" height="86"></td>
+<body bgcolor="#FFFFFF">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-        <td><a href="../index.htm"><font face="Arial" color=
-        "#FFFFFF"><big>Home</big></font></a></td>
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-        <td><a href="../libs/libraries.htm"><font face="Arial" color=
-        "#FFFFFF"><big>Libraries</big></font></a></td>
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
 
-        <td><a href="people.htm"><font face="Arial" color=
-        "#FFFFFF"><big>People</big></font></a></td>
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
 
-        <td><a href="../more/faq.htm"><font face="Arial" color=
-        "#FFFFFF"><big>FAQ</big></font></a></td>
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
 
-        <td><a href="../more/index.htm"><font face="Arial" color=
-        "#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
 
-    <p><a href="http://boost.sourceforge.net/photos/mat_marcus.jpg"><img
-    border="0" src="http://boost.sourceforge.net/photos/mat_marcus_small.jpg"
-    xthumbnail-orig-image="mat_marcus.jpg" width="112" height="130" align=
-    "left" hspace="10" vspace="5"></a></p>
+  <p><a href=
+  "http://boost.sourceforge.net/photos/mat_marcus.jpg"><img border="0" src=
+  "http://boost.sourceforge.net/photos/mat_marcus_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/mat_marcus.jpg" width="112" height=
+  "130" align="left" hspace="10" vspace="5"></a></p>
 
-    <p><a href="http://www.emarcus.org">Mat Marcus</a> is a senior computer
-    scientist in the Software Technology Lab at Adobe Systems, Inc. He has
-    been developing software since 1985. Recent projects include a
-    collaboration with <a href="http://www.stepanovpapers.com">Alex
-    Stepanov</a> on a programming class and work on the <a href=
-    "http://opensource.adobe.com">Adobe Source Library</a>. Mat's first
-    contribution to Boost came in the summer of 2000, when he discovered a
-    way to exploit the properties of the sizeof operator to simulate partial
-    specialization (is_pointer, etc. with Jesse Jones). Mat lives in Seattle
-    with his wife and son.</p>
-  </body>
+  <p><a href="http://www.emarcus.org">Mat Marcus</a> is a senior computer
+  scientist in the Software Technology Lab at Adobe Systems, Inc. He has been
+  developing software since 1985. Recent projects include a collaboration
+  with <a href="http://www.stepanovpapers.com">Alex Stepanov</a> on a
+  programming class and work on the <a href=
+  "http://opensource.adobe.com">Adobe Source Library</a>. Mat's first
+  contribution to Boost came in the summer of 2000, when he discovered a way
+  to exploit the properties of the sizeof operator to simulate partial
+  specialization (is_pointer, etc. with Jesse Jones). Mat lives in Seattle
+  with his wife and son.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->21
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39358" --></p>
+
+  <p><i>Copyright &copy; 2002 Mat Marcus</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>
-

Modified: boost/trunk/people/paul_mensonides.htm
===================================================================
--- boost/trunk/people/paul_mensonides.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/paul_mensonides.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,25 +1,60 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <title>Paul Mensonides</title>
-    <body bgcolor="#FFFFFF" text="#000000">
-      <table border="1" bgcolor="#007F7F" cellpadding="2">
-        <tr>
-          <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-          <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-          <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-          <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-          <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-          <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-        </tr>
-      </table>
-      <p>
-        <a href="http://boost.sourceforge.net/photos/paul_mensonides.jpg"><img border="0" src="http://boost.sourceforge.net/photos/paul_mensonides_small.jpg" alt="paul_mensonides.jpg (286309 bytes)" align="left" hspace="10" vspace="5" width="100" height="131"></a>
-        Paul Mensonides was born on March 31 in 1977.&nbsp; He lives in Tacoma, 
-        Washington.
-      </p>
-      <p>
-        His interests include musical composition, playing the guitar, skiing, and 
-        programming--particularly in C and C++.
-      </p>
-    </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Paul Mensonides</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/paul_mensonides.jpg"><img border="0"
+  src="http://boost.sourceforge.net/photos/paul_mensonides_small.jpg" alt=
+  "paul_mensonides.jpg (286309 bytes)" align="left" hspace="10" vspace="5"
+  width="100" height="131"></a>Paul Mensonides was born on March 31 in 1977.
+  He lives in Tacoma, Washington.</p>
+
+  <p>His interests include musical composition, playing the guitar, skiing,
+  and programming--particularly in C and C++.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2002 Paul Mensonides</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/pavol_droba.htm
===================================================================
--- boost/trunk/people/pavol_droba.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/pavol_droba.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,42 +1,76 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Pavol Droba</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p>
-    <a href="http://boost.sourceforge.net/photos/pavol_droba.jpg"><img border="0" src="http://boost.sourceforge.net/photos/pavol_droba_small.jpg" alt="http://boost.sourceforge.net/photos/pavol_droba.jpg (23801 bytes)" align="left" width="100" height="110"></a>
-    Pavol Droba lives in Bratislava, the capital of Slovakia with his beautiful wife Lenka.
-    </p>
-    <p>
-    Since childhood he has always been messing with computers in one way or the other until he
-    settled down with C++. Since then he did a lot of various projects but he retained his
-    affinity to his favorite programming language.
-    </p>
-    <p>    
-    He loves to design nice programs that works and to see how the pieces of the puzzle called
-    design come together.
-    </p>
-    <p>
-    Currently he is a developer in a small company where he leads a group of 5 other guys.
-    </p>
-    <p>
-    When he is not at the computer Pavol enjoys his time with his wife. In winter he likes
-    skiing, in summer he does some scuba diving.
-    </p>
-    <p>
-    You can leave him a message at <a href="mailto:droba at topmail.sk">droba at topmail.sk</a>.
-    </p>
-    </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Pavol Droba</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/pavol_droba.jpg"><img border="0" src=
+  "http://boost.sourceforge.net/photos/pavol_droba_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/pavol_droba.jpg (23801 bytes)" align=
+  "left" width="100" height="110"></a> Pavol Droba lives in Bratislava, the
+  capital of Slovakia with his beautiful wife Lenka.</p>
+
+  <p>Since childhood he has always been messing with computers in one way or
+  the other until he settled down with C++. Since then he did a lot of
+  various projects but he retained his affinity to his favorite programming
+  language.</p>
+
+  <p>He loves to design nice programs that works and to see how the pieces of
+  the puzzle called design come together.</p>
+
+  <p>Currently he is a developer in a small company where he leads a group of
+  5 other guys.</p>
+
+  <p>When he is not at the computer Pavol enjoys his time with his wife. In
+  winter he likes skiing, in summer he does some scuba diving.</p>
+
+  <p>You can leave him a message at <a href=
+  "mailto:droba at topmail.sk">droba at topmail.sk</a>.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2004 Pavol Droba</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/people.htm
===================================================================
--- boost/trunk/people/people.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/people.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,212 +1,529 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-    <title>Boost People</title>
-    <meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <meta name="Microsoft Border" content="none, default">
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF">
-          <img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <h1>Boost People</h1>
-    <p>(Click on the names for biographies)<br>
-      (Click on the images for enlarged images)</p>
-    <table border="0" cellpadding="4" cellspacing="4">
-      <tr>
-        <td><a href="dave_abrahams.htm">Dave Abrahams</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/dave_abrahams.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/dave_abrahams_small.jpg" alt="http://boost.sourceforge.net/photos/dave_abrahams.jpg (30926 bytes)" width="100" height="75"></a></td>
-      </tr>
-      <tr>
-        <td><a href="darin_adler.htm">Darin Adler</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/darin_adler.jpg"><img border="0" src="http://boost.sourceforge.net/photos/darin_adler_small.jpg" alt="http://boost.sourceforge.net/photos/darin_adler.jpg (30416 bytes)" width="100" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="ed_brey.htm">Ed Brey</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/ed_brey.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/ed_brey_small.jpg" alt="http://boost.sourceforge.net/photos/ed_brey.jpg (13913 bytes)" width="100" height="118"></a></td>
-      </tr>
-      <tr>
-        <td><a href="herve_bronnimann.htm">Herv&eacute; Br&ouml;nnimann</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/herve_bronnimann.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/herve_bronnimann_small.jpg" alt="http://boost.sourceforge.net/photos/herve_bronnimann.jpg (12867 bytes)" width="100" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="fernando_cacciola.html">Fernando Cacciola</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/fernando_cacciola.jpg"> <img src="http://boost.sourceforge.net/photos/fernando_cacciola_small.jpg" alt="http://boost.sourceforge.net/photos/fernando_cacciola.jpg (38339 bytes)" border="0" width="100" height="96"></a></td>
-      </tr>
-      <tr>
-        <td><a href="greg_colvin.htm">Greg Colvin</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/greg_colvin.jpg"> <img src="http://boost.sourceforge.net/photos/greg_colvin_small.jpg" alt="http://boost.sourceforge.net/photos/greg_colvin.jpg (52740 bytes)" border="0" width="100" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="beman_dawes.html">Beman Dawes</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/beman_dawes.jpg"> <img src="http://boost.sourceforge.net/photos/beman_dawes_small.jpg" alt="http://boost.sourceforge.net/photos/beman_dawes.jpg (47863 bytes)" border="0" width="100" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="joel_de_guzman.htm">Joel de Guzman</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/joel_de_guzman.jpg">
-        <img border="0" src="http://boost.sourceforge.net/photos/joel_de_guzman_small.jpg" alt="http://boost.sourceforge.net/photos/joel_de_guzman.jpg" width="100" height="124"></a></td>
-      </tr>
-      <tr>
-        <td><a href="peter_dimov.htm">Peter Dimov</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/peter_dimov.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/peter_dimov_small.jpg" alt="http://boost.sourceforge.net/photos/peter_dimov.jpg (56340 bytes)" width="100" height="123"></a></td>
-      </tr>
-      <tr>
-        <td><a href="pavol_droba.htm">Pavol Droba</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/pavol_droba.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/pavol_droba_small.jpg" alt="http://boost.sourceforge.net/photos/pavol_droba.jpg (23801 bytes)" width="100" height="110"></a></td>
-      </tr>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
 
-      <tr>
-        <td><a href="eric_friedman.htm">Eric Friedman</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/eric_friedman.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/eric_friedman_small.jpg" alt="http://boost.sourceforge.net/photos/eric_friedman.jpg" width="100" height="130"></a></td>
-      </tr>
-      <tr>
-        <td><a href="ronald_garcia.htm">Ron Garcia</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/ronald_garcia.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/ronald_garcia_small.jpg" alt="http://boost.sourceforge.net/photos/ronald_garcia.jpg" width="92" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="jeff_garland.html">Jeff Garland</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/jeff_garland.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/jeff_garland_small.jpg" alt="http://boost.sourceforge.net/photos/jeff_garland.jpg" width="100" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="doug_gregor.html">Doug Gregor</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/doug_gregor.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/doug_gregor_small.jpg" alt="http://boost.sourceforge.net/photos/doug_gregor.jpg (30947 bytes)" width="100" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="ralf_w_grosse_kunstleve.htm">Ralf W Grosse-Kunstleve</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/ralf_w_grosse_kunstleve.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/ralf_w_grosse_kunstleve_sm.jpg" alt="http://boost.sourceforge.net/photos/ralf_w_grosse_kunstleve.jpg (29133 bytes)" width="100" height="134"></td>
-      </tr>
-      <tr>
-        <td><a href="aleksey_gurtovoy.htm">Aleksey Gurtovoy</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/aleksey_gurtovoy.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/aleksey_gurtovoy_small.jpg" alt="http://boost.sourceforge.net/photos/aleksey_gurtovoy.jpg (12871 bytes)" width="100" height="120"></a></td>
-      </tr>
-      <tr>
-        <td><a href="kevlin_henney.htm">Kevlin Henney</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/kevlin_henney.jpg"><img src="http://boost.sourceforge.net/photos/kevlin_henney_small.jpg" alt="http://boost.sourceforge.net/photos/kevlin_henney.jpg (27191 bytes)" border="0" width="100" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="howard_hinnant.htm">Howard Hinnant</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/howard_hinnant.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/howard_hinnant_small.jpg" alt="http://boost.sourceforge.net/photos/howard_hinnant.jpg (19817 bytes)" width="100" height="97"></a></td>
-      </tr>
-      <tr>
-        <td><a href="hubert_holin.html">Hubert Holin</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/hubert_holin.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/hubert_holin_small.jpg" alt="http://boost.sourceforge.net/photos/hubert_holin.jpg (xxx bytes)" width="100" height="120"></a></td>
-      </tr>
-      <tr>
-        <td><a href="http://www.josuttis.com">Nicolai Josuttis</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/nicolai_josuttis.jpg"> <img src="http://boost.sourceforge.net/photos/nicolai_josuttis_small.jpg" alt="http://boost.sourceforge.net/photos/nicolai_josuttis.jpg (40745 bytes)" border="0" width="100" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="jaakko_jarvi.htm">Jaakko Järvi</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/jaakko_jarvi.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/jaakko_jarvi_small.jpg" alt="http://boost.sourceforge.net/photos/jaakko_jarvi.jpg (25365 bytes)" width="100" height="82"></a></td>
-      </tr>
-      <tr>
-        <td><a href="hartmut_kaiser.htm">Hartmut Kaiser</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/hartmut_kaiser.jpg">
-        <img border="0" src="http://boost.sourceforge.net/photos/hartmut_kaiser_small.jpg" alt="http://boost.sourceforge.net/photos/hartmut_kaiser.jpg" width="100" height="144"></a></td>
-      </tr>
-      <tr>
-        <td><a href="vesa_karvonen.htm">Vesa Karvonen</a></td>
-        <td><img border="0" src="http://boost.sourceforge.net/photos/vesa_karvonen.jpg" width="100" height="133"></td>
-      </tr>
-      <tr>
-        <td><a href="william_kempf.htm">William Kempf</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/william_kempf.jpg"><img border="0" src="http://boost.sourceforge.net/photos/william_kempf_small.jpg" alt="http://boost.sourceforge.net/photos/william_kempf.jpg (10935 bytes)" width="100"></a></td>
-      </tr>
-      <tr>
-        <td><a href="samuel_krempp.htm">Samuel Krempp</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/samuel_krempp.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/samuel_krempp_small.jpg" alt="http://boost.sourceforge.net/photos/samuel_krempp.jpg" width="100" height="76"></a></td>
-      </tr>
-      <tr>
-        <td><a href="dietmar_kuehl.htm">Dietmar Kühl</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/dietmar_kuehl.jpg"> <img src="http://boost.sourceforge.net/photos/dietmar_kuehl_small.jpg" alt="http://boost.sourceforge.net/photos/dietmar_kuehl.jpg (57821 bytes)" border="0" width="100" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="liequan_lee.htm">Lie-Quan Lee</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/liequan_lee.jpg"><img border="0" src="http://boost.sourceforge.net/photos/liequan_lee_small.jpg" alt="http://boost.sourceforge.net/photos/liequan_lee.jpg (24165 bytes)" width="93" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="joaquin_lopez.htm">Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/joaquin_lopez.jpg"><img border="0" src="http://boost.sourceforge.net/photos/joaquin_lopez_small.jpg" alt="http://boost.sourceforge.net/photos/joaquin_lopez.jpg (30625 bytes)" width="100" height="135"></a></td>
-      </tr>
-      <tr>
-        <td><a href="john_maddock.htm">John Maddock</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/john_maddock.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/john_maddock_small.jpg" alt="http://boost.sourceforge.net/photos/john_maddock.jpg (14611 bytes)" width="100" height="132"></a></td>
-      </tr>
-      <tr>
-        <td><a href="mat_marcus.htm">Mat Marcus</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/mat_marcus.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/mat_marcus_small.jpg" alt="http://boost.sourceforge.net/photos/mat_marcus.jpg" width="95" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="jens_maurer.htm">Jens Maurer</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/jens_maurer.jpg"><img border="0" src="http://boost.sourceforge.net/photos/jens_maurer_small.jpg" width="100" height="124"></a></td>
-      </tr>
-      <tr>
-        <td><a href="paul_mensonides.htm">Paul Mensonides</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/paul_mensonides.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/paul_mensonides_small.jpg" alt="http://boost.sourceforge.net/photos/paul_mensonides.jpg (286309 bytes)" width="100" height="131"></a></td>
-      </tr>
-      <tr>
-        <td><a href="paul_moore.htm">Paul Moore</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/paul_moore.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/paul_moore_small.jpg" alt="http://boost.sourceforge.net/photos/paul_moore.jpg (12023 bytes)" width="100" height="81"></a></td>
-      </tr>
-      <tr>
-        <td><a href="mac_murrett.htm">Mac Murrett</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/mac_murrett.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/mac_murrett_small.jpg" alt="http://boost.sourceforge.net/photos/mac_murrett.jpg" width="100" height="141"></a></td>
-      </tr>
-      <tr>
-          <td><a href="thorsten_ottosen.html">Thorsten Ottosen</a></td>
-          <td><a href="http://boost.sourceforge.net/photos/thorsten_ottosen.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/thorsten_ottosen_small.jpg" alt="http://boost.sourceforge.net/photos/thorsten_ottosen.jpg.jpg" width="100" > </a></td> </tr> <tr>
-        <td><a href="gary_powell.htm">Gary Powell</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/gary_powell.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/gary_powell_small.jpg" alt="http://boost.sourceforge.net/photos/gary_powell.jpg (13577 bytes)" width="100" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="vladimir_prus.htm">Vladimir Prus</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/vladimir_prus.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/vladimir_prus_small.jpg" alt="http://boost.sourceforge.net/photos/vladimir_prus.jpg (25247 bytes)" width="100" height="123"></a></td>
-      </tr>
-      <tr>
-        <td><a href="robert_ramey.htm">Robert Ramey</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/robert_ramey.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/robert_ramey_small.jpg" alt="http://boost.sourceforge.net/photos/robert_ramey.jpg (6508 bytes)" width="100"></a></td>
-      </tr>
-      <tr>
-        <td><a href="rene_rivera.htm">Rene Rivera</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/rene_rivera.jpg">
-        <img border="0" src="http://boost.sourceforge.net/photos/rene_rivera.jpg" alt="http://boost.sourceforge.net/photos/rene_rivera.jpg" width="100" height="105"></a></td>
-      </tr>
-      <tr>
-        <td><a href="mark_rodgers.htm">Mark Rodgers</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/mark_rodgers.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/mark_rodgers_small.jpg" alt="http://boost.sourceforge.net/photos/mark_rodgers.jpg (23035 bytes)" width="100" height="75"></a></td>
-      </tr>
-      <tr>
-        <td><a href="gennadiy_rozental.htm">Gennadiy Rozental</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/gennadiy_rozental.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/gennadiy_rozental_small.jpg" alt="http://boost.sourceforge.net/photos/gennadiy_rozental.jpg" width="100" height="75"></a></td>
-      </tr>
-      <tr>
-        <td><a href="jeremy_siek.htm">Jeremy Siek</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/jeremy_siek.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/jeremy_siek_small.jpg" alt="http://boost.sourceforge.net/photos/jeremy_siek.jpg (12867 bytes)" width="100" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="jonathan_turkanis.htm">Jonathan Turkanis</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/jonathan_turkanis.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/jonathan_turkanis_small.jpg" alt="http://boost.sourceforge.net/photos/jonathan_turkanis.jpg (31865 bytes)" width="100" height="133"></a></td>
-      </tr>
-      <tr>
-        <td><a href="daryle_walker.html">Daryle Walker</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/daryle_walker.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/daryle_walker.jpg" width="100" height="127"></td>
-      </tr>
-      <tr>
-        <td><a href="thomas_witt.html">Thomas Witt</a></td>
-        <td><a href="http://boost.sourceforge.net/photos/thomas_witt.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/thomas_witt_small.jpg" alt="http://boost.sourceforge.net/photos/thomas_witt.jpg" width="100" height="133"></a></td>
-      </tr>
-    </table>
-    <p>Revised
-      <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->2 August, 2005<!--webbot bot="Timestamp" endspan i-checksum="38677" -->
-    </p>
-  </body>
+  <title>Boost People</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <h1>Boost People</h1>
+
+  <p>(Click on the names for biographies)<br>
+  (Click on the images for enlarged images)</p>
+
+  <table border="0" cellpadding="4" cellspacing="4" summary="">
+    <tr>
+      <td><a href="dave_abrahams.htm">Dave Abrahams</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/dave_abrahams.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/dave_abrahams_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/dave_abrahams.jpg (30926 bytes)"
+      width="100" height="75"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="darin_adler.htm">Darin Adler</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/darin_adler.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/darin_adler_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/darin_adler.jpg (30416 bytes)"
+      width="100" height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="ed_brey.htm">Ed Brey</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/ed_brey.jpg"><img border="0" src=
+      "http://boost.sourceforge.net/photos/ed_brey_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/ed_brey.jpg (13913 bytes)" width=
+      "100" height="118"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="herve_bronnimann.htm">Herv&eacute;
+      Br&ouml;nnimann</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/herve_bronnimann.jpg"><img border=
+      "0" src=
+      "http://boost.sourceforge.net/photos/herve_bronnimann_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/herve_bronnimann.jpg (12867 bytes)"
+      width="100" height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="fernando_cacciola.html">Fernando Cacciola</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/fernando_cacciola.jpg"><img src=
+      "http://boost.sourceforge.net/photos/fernando_cacciola_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/fernando_cacciola.jpg (38339 bytes)"
+      border="0" width="100" height="96"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="greg_colvin.htm">Greg Colvin</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/greg_colvin.jpg"><img src=
+      "http://boost.sourceforge.net/photos/greg_colvin_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/greg_colvin.jpg (52740 bytes)"
+      border="0" width="100" height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="beman_dawes.html">Beman Dawes</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/beman_dawes.jpg"><img src=
+      "http://boost.sourceforge.net/photos/beman_dawes_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/beman_dawes.jpg (47863 bytes)"
+      border="0" width="100" height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="joel_de_guzman.htm">Joel de Guzman</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/joel_de_guzman.jpg"><img border=
+      "0" src="http://boost.sourceforge.net/photos/joel_de_guzman_small.jpg"
+      alt="http://boost.sourceforge.net/photos/joel_de_guzman.jpg" width=
+      "100" height="124"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="peter_dimov.htm">Peter Dimov</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/peter_dimov.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/peter_dimov_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/peter_dimov.jpg (56340 bytes)"
+      width="100" height="123"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="pavol_droba.htm">Pavol Droba</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/pavol_droba.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/pavol_droba_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/pavol_droba.jpg (23801 bytes)"
+      width="100" height="110"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="eric_friedman.htm">Eric Friedman</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/eric_friedman.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/eric_friedman_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/eric_friedman.jpg" width="100"
+      height="130"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="ronald_garcia.htm">Ron Garcia</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/ronald_garcia.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/ronald_garcia_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/ronald_garcia.jpg" width="92"
+      height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="jeff_garland.html">Jeff Garland</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/jeff_garland.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/jeff_garland_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/jeff_garland.jpg" width="100"
+      height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="doug_gregor.html">Doug Gregor</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/doug_gregor.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/doug_gregor_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/doug_gregor.jpg (30947 bytes)"
+      width="100" height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="ralf_w_grosse_kunstleve.htm">Ralf W
+      Grosse-Kunstleve</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/ralf_w_grosse_kunstleve.jpg"><img border="0"
+      src=
+      "http://boost.sourceforge.net/photos/ralf_w_grosse_kunstleve_sm.jpg"
+      alt=
+      "http://boost.sourceforge.net/photos/ralf_w_grosse_kunstleve.jpg (29133 bytes)"
+      width="100" height="134"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="aleksey_gurtovoy.htm">Aleksey Gurtovoy</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/aleksey_gurtovoy.jpg"><img border=
+      "0" src=
+      "http://boost.sourceforge.net/photos/aleksey_gurtovoy_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/aleksey_gurtovoy.jpg (12871 bytes)"
+      width="100" height="120"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="kevlin_henney.htm">Kevlin Henney</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/kevlin_henney.jpg"><img src=
+      "http://boost.sourceforge.net/photos/kevlin_henney_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/kevlin_henney.jpg (27191 bytes)"
+      border="0" width="100" height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="howard_hinnant.htm">Howard Hinnant</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/howard_hinnant.jpg"><img border=
+      "0" src="http://boost.sourceforge.net/photos/howard_hinnant_small.jpg"
+      alt=
+      "http://boost.sourceforge.net/photos/howard_hinnant.jpg (19817 bytes)"
+      width="100" height="97"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="hubert_holin.html">Hubert Holin</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/hubert_holin.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/hubert_holin_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/hubert_holin.jpg (xxx bytes)"
+      width="100" height="120"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="andreas_huber.html">Andreas Huber</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/andreas_huber.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/andreas_huber_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/andreas_huber.jpg (95642 bytes)"
+      width="100" height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="http://www.josuttis.com">Nicolai Josuttis</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/nicolai_josuttis.jpg"><img src=
+      "http://boost.sourceforge.net/photos/nicolai_josuttis_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/nicolai_josuttis.jpg (40745 bytes)"
+      border="0" width="100" height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="jaakko_jarvi.htm">Jaakko J&auml;rvi</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/jaakko_jarvi.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/jaakko_jarvi_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/jaakko_jarvi.jpg (25365 bytes)"
+      width="100" height="82"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="hartmut_kaiser.htm">Hartmut Kaiser</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/hartmut_kaiser.jpg"><img border=
+      "0" src="http://boost.sourceforge.net/photos/hartmut_kaiser_small.jpg"
+      alt="http://boost.sourceforge.net/photos/hartmut_kaiser.jpg" width=
+      "100" height="144"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="vesa_karvonen.htm">Vesa Karvonen</a></td>
+
+      <td><img border="0" src=
+      "http://boost.sourceforge.net/photos/vesa_karvonen.jpg" alt=
+      "http://boost.sourceforge.net/photos/vesa_karvonen.jpg" width="100"
+      height="133"></td>
+    </tr>
+
+    <tr>
+      <td><a href="william_kempf.htm">William Kempf</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/william_kempf.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/william_kempf_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/william_kempf.jpg (10935 bytes)"
+      width="100"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="samuel_krempp.htm">Samuel Krempp</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/samuel_krempp.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/samuel_krempp_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/samuel_krempp.jpg" width="100"
+      height="76"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="dietmar_kuehl.htm">Dietmar K&uuml;hl</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/dietmar_kuehl.jpg"><img src=
+      "http://boost.sourceforge.net/photos/dietmar_kuehl_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/dietmar_kuehl.jpg (57821 bytes)"
+      border="0" width="100" height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="liequan_lee.htm">Lie-Quan Lee</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/liequan_lee.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/liequan_lee_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/liequan_lee.jpg (24165 bytes)"
+      width="93" height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="joaquin_lopez.htm">Joaqu&iacute;n M L&oacute;pez
+      Mu&ntilde;oz</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/joaquin_lopez.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/joaquin_lopez_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/joaquin_lopez.jpg (30625 bytes)"
+      width="100" height="135"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="john_maddock.htm">John Maddock</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/john_maddock.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/john_maddock_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/john_maddock.jpg (14611 bytes)"
+      width="100" height="132"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="mat_marcus.htm">Mat Marcus</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/mat_marcus.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/mat_marcus_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/mat_marcus.jpg" width="95" height=
+      "133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="jens_maurer.htm">Jens Maurer</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/jens_maurer.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/jens_maurer_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/jens_maurer.jpg" width="100"
+      height="124"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="paul_mensonides.htm">Paul Mensonides</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/paul_mensonides.jpg"><img border=
+      "0" src="http://boost.sourceforge.net/photos/paul_mensonides_small.jpg"
+      alt=
+      "http://boost.sourceforge.net/photos/paul_mensonides.jpg (286309 bytes)"
+      width="100" height="131"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="paul_moore.htm">Paul Moore</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/paul_moore.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/paul_moore_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/paul_moore.jpg (12023 bytes)"
+      width="100" height="81"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="mac_murrett.htm">Mac Murrett</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/mac_murrett.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/mac_murrett_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/mac_murrett.jpg" width="100"
+      height="141"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="thorsten_ottosen.html">Thorsten Ottosen</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/thorsten_ottosen.jpg"><img border=
+      "0" src=
+      "http://boost.sourceforge.net/photos/thorsten_ottosen_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/thorsten_ottosen.jpg.jpg" width=
+      "100"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="gary_powell.htm">Gary Powell</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/gary_powell.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/gary_powell_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/gary_powell.jpg (13577 bytes)"
+      width="100" height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="vladimir_prus.htm">Vladimir Prus</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/vladimir_prus.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/vladimir_prus_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/vladimir_prus.jpg (25247 bytes)"
+      width="100" height="123"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="robert_ramey.htm">Robert Ramey</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/robert_ramey.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/robert_ramey_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/robert_ramey.jpg (6508 bytes)"
+      width="100"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="rene_rivera.htm">Rene Rivera</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/rene_rivera.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/rene_rivera.jpg" alt=
+      "http://boost.sourceforge.net/photos/rene_rivera.jpg" width="100"
+      height="105"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="mark_rodgers.htm">Mark Rodgers</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/mark_rodgers.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/mark_rodgers_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/mark_rodgers.jpg (23035 bytes)"
+      width="100" height="75"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="gennadiy_rozental.htm">Gennadiy Rozental</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/gennadiy_rozental.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/gennadiy_rozental_small.jpg"
+      alt="http://boost.sourceforge.net/photos/gennadiy_rozental.jpg" width=
+      "100" height="75"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="jeremy_siek.htm">Jeremy Siek</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/jeremy_siek.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/jeremy_siek_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/jeremy_siek.jpg (12867 bytes)"
+      width="100" height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="jonathan_turkanis.htm">Jonathan Turkanis</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/jonathan_turkanis.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/jonathan_turkanis_small.jpg"
+      alt=
+      "http://boost.sourceforge.net/photos/jonathan_turkanis.jpg (31865 bytes)"
+      width="100" height="133"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="daryle_walker.html">Daryle Walker</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/daryle_walker.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/daryle_walker.jpg" alt=
+      "http://boost.sourceforge.net/photos/daryle_walker.jpg" width="100"
+      height="127"></a></td>
+    </tr>
+
+    <tr>
+      <td><a href="thomas_witt.html">Thomas Witt</a></td>
+
+      <td><a href=
+      "http://boost.sourceforge.net/photos/thomas_witt.jpg"><img border="0"
+      src="http://boost.sourceforge.net/photos/thomas_witt_small.jpg" alt=
+      "http://boost.sourceforge.net/photos/thomas_witt.jpg" width="100"
+      height="133"></a></td>
+    </tr>
+  </table>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2004 Beman Dawes</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/peter_dimov.htm
===================================================================
--- boost/trunk/people/peter_dimov.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/peter_dimov.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,26 +1,63 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Peter Dimov</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/peter_dimov.jpg"><img border="0" src="http://boost.sourceforge.net/photos/peter_dimov_small.jpg" alt="peter_dimov.jpg (56340 bytes)" align="left" hspace="10" vspace="5" width="100" height="123"><br>
-        <br>
-      </a><a href="http://www.pdimov.com/">Peter Dimov</a> is a software 
-      developer from Plovdiv, Bulgaria.</p>
-    <p>He likes C++. Not to the extent to donate a kidney for every proposed 
-      extension, but close.</p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Peter Dimov</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/peter_dimov.jpg"><img border="0" src=
+  "http://boost.sourceforge.net/photos/peter_dimov_small.jpg" alt=
+  "peter_dimov.jpg (56340 bytes)" align="left" hspace="10" vspace="5" width=
+  "100" height="123"><br>
+  <br></a> <a href="http://www.pdimov.com/">Peter Dimov</a> is a software
+  developer from Plovdiv, Bulgaria.</p>
+
+  <p>He likes C++. Not to the extent to donate a kidney for every proposed
+  extension, but close.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2005 Peter Dimov</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/ralf_w_grosse_kunstleve.htm
===================================================================
--- boost/trunk/people/ralf_w_grosse_kunstleve.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/ralf_w_grosse_kunstleve.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,52 +1,94 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <title>Ralf W. Grosse-Kunstleve</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/ralf_w_grosse_kunstleve.jpg"><img src="http://boost.sourceforge.net/photos/ralf_w_grosse_kunstleve_sm.jpg" alt="ralf_w_grosse_kunstleve.jpg" border="0" align="left" hspace="10" vspace="5" width="100" height="134"></a>
-      Ralf is a crystallographer. He has a degree in Mineralogy (<a href="http://www.mineralogie.ruhr-uni-bochum.de/eng/index.html">Bochum, 
-        Germany</a>), and a Ph.D. in Crystallography (<a href="http://www.crystal.mat.ethz.ch/Intro/lfkcry">ETH 
-        Zurich</a>
-    , Switzerland). Real Mineralogists and Crystallographers run experiments with 
-    x-rays and hardware that is not normally associated with C++ and Boost. 
-    However, when Ralf kept breaking the expensive experimental equipment too 
-    often, he decided that he would cause less damage as a computational 
-    crystallographer.
-    <p>
-      Being a scientist, Ralf spent most of his life programming in Fortran, the 
-      great grand-father of all good programming languages (if you know Backus-Naur 
-      you know the name of the <a href="http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Backus.html">
-        inventor of Fortran</a>). Ralf is a co-author of the <a href="http://cns.csb.yale.edu/">
-        CNS</a> Fortran program that is very popular in structural biology. When he 
-      learned that a real programmer can write Fortran in any language, Ralf knew 
-      that it was time for him to learn C++. Of course, absorbing four decades of 
-      progress in the field of computer science all at once crashed his brain. To be 
-      able to deal with the challenge, he spawned two child processes and named them 
-      Lisa and Anna. To see Lisa, click on the picture and turn your monitor by 180 
-      degrees around the view axis. (Other pictures of <a href="http://cci.lbl.gov/~rwgk/Lisa-Roza-Illes/">
-        Lisa</a> and <a href="http://cci.lbl.gov/~rwgk/Anna-Rhona-Illes/">Anna</a>
-    do not require gymnastics with the monitor.)
-    <p>
-      Right now, Ralf is working for the <a href="http://cci.lbl.gov/">Computational 
-        Crystallography Initiative</a> at the <a href="http://www.lbl.gov/">Lawrence 
-        Berkeley National Laboratory</a> in California. The goal of this initiative 
-      is to write a software system for high-throughput protein crystal structure 
-      determination, also known as <a href="http://www.nigms.nih.gov/news/announcements/psi.html">
-        Structural Genomics</a>. Surprisingly, the gestation period for such a system 
-      turns out to be much longer than it was for Lisa and Anna. However, pre-natal 
-      diagnosis already revealed that Python and C++ are the parents-to-be. For an 
-      ultra-sound image of the new system at its early developmental stage <a href="http://cctbx.sourceforge.net/">
-        click here</a>
-    .
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Ralf W. Grosse-Kunstleve</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/ralf_w_grosse_kunstleve.jpg"><img src=
+  "http://boost.sourceforge.net/photos/ralf_w_grosse_kunstleve_sm.jpg" alt=
+  "ralf_w_grosse_kunstleve.jpg" border="0" align="left" hspace="10" vspace=
+  "5" width="100" height="134"></a> Ralf is a crystallographer. He has a
+  degree in Mineralogy (<a href=
+  "http://www.mineralogie.ruhr-uni-bochum.de/eng/index.html">Bochum,
+  Germany</a>), and a Ph.D. in Crystallography (<a href=
+  "http://www.crystal.mat.ethz.ch/Intro/lfkcry">ETH Zurich</a> ,
+  Switzerland). Real Mineralogists and Crystallographers run experiments with
+  x-rays and hardware that is not normally associated with C++ and Boost.
+  However, when Ralf kept breaking the expensive experimental equipment too
+  often, he decided that he would cause less damage as a computational
+  crystallographer.</p>
+
+  <p>Being a scientist, Ralf spent most of his life programming in Fortran,
+  the great grand-father of all good programming languages (if you know
+  Backus-Naur you know the name of the <a href=
+  "http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Backus.html">inventor
+  of Fortran</a>). Ralf is a co-author of the <a href=
+  "http://cns.csb.yale.edu/">CNS</a> Fortran program that is very popular in
+  structural biology. When he learned that a real programmer can write
+  Fortran in any language, Ralf knew that it was time for him to learn C++.
+  Of course, absorbing four decades of progress in the field of computer
+  science all at once crashed his brain. To be able to deal with the
+  challenge, he spawned two child processes and named them Lisa and Anna. To
+  see Lisa, click on the picture and turn your monitor by 180 degrees around
+  the view axis. (Other pictures of <a href=
+  "http://cci.lbl.gov/~rwgk/Lisa-Roza-Illes/">Lisa</a> and <a href=
+  "http://cci.lbl.gov/~rwgk/Anna-Rhona-Illes/">Anna</a> do not require
+  gymnastics with the monitor.)</p>
+
+  <p>Right now, Ralf is working for the <a href=
+  "http://cci.lbl.gov/">Computational Crystallography Initiative</a> at the
+  <a href="http://www.lbl.gov/">Lawrence Berkeley National Laboratory</a> in
+  California. The goal of this initiative is to write a software system for
+  high-throughput protein crystal structure determination, also known as
+  <a href="http://www.nigms.nih.gov/news/announcements/psi.html">Structural
+  Genomics</a>. Surprisingly, the gestation period for such a system turns
+  out to be much longer than it was for Lisa and Anna. However, pre-natal
+  diagnosis already revealed that Python and C++ are the parents-to-be. For
+  an ultra-sound image of the new system at its early developmental stage
+  <a href="http://cctbx.sourceforge.net/">click here</a>.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2001 Ralf W. Grosse-Kunstleve</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/rene_rivera.htm
===================================================================
--- boost/trunk/people/rene_rivera.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/rene_rivera.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,17 +2,18 @@
 
 <html>
 <head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
   <meta name="generator" content=
   "HTML Tidy for Linux/x86 (vers 1st September 2003), see www.w3.org">
   <meta name="GENERATOR" content="Microsoft FrontPage 5.0">
   <meta name="ProgId" content="FrontPage.Editor.Document">
-  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
 
   <title>Rene Rivera</title>
 </head>
 
 <body bgcolor="#FFFFFF" text="#000000">
-  <table border="1" bgcolor="#007F7F" cellpadding="2">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
     <tr>
       <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
       "boost.png (6897 bytes)" width="277" height="86"></td>
@@ -56,6 +57,22 @@
   two versions of "Who Wants To Be a Millionaire".</p>
 
   <p>His motto of "clean code, clean graphics, it can always stand
-  improvement" has repeatedly gotten him in trouble.</p>
+  improvement" has repeatedly gotten him in trouble.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2003 Rene Rivera</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
 </body>
 </html>

Modified: boost/trunk/people/robert_ramey.htm
===================================================================
--- boost/trunk/people/robert_ramey.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/robert_ramey.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,35 +1,71 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>Robert Ramey</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png
-    (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/robert_ramey.jpg">
-    <img src="http://boost.sourceforge.net/photos/robert_ramey_small.jpg"
-     alt="http://boost.sourceforge.net/photos/robert_ramey.jpg" border="0" align="left" hspace="10" vspace="5" width="100"></a>
-      <a href="http://www.rrsd.com">Robert Ramey</a> is a contract software developer living
-      in Santa Barbara, California.  He has been involved in all aspects of the computer
-      industry for more than 30 years.
-      <p>
-      After graduating with an MS in Operations Research from U.C. Berkeley in 1971 and serving
-      18 months in the miltary, he left on a trip to Ecuador.  There he founded a data processing company
-      which is still in operation today.  Returning to California in 1986, he focused on the more
-      technical aspects of software development.  This has resulted in the completion of
-      projects such as the Postman's Sort and Boost serialization library - among others.
-      <p>
-      Other current interests include hanggliding, squash, hiking and bike riding.
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Robert Ramey</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href="http://boost.sourceforge.net/photos/robert_ramey.jpg"><img src=
+  "http://boost.sourceforge.net/photos/robert_ramey_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/robert_ramey.jpg" border="0" align=
+  "left" hspace="10" vspace="5" width="100"></a><a href=
+  "http://www.rrsd.com">Robert Ramey</a> is a contract software developer
+  living in Santa Barbara, California. He has been involved in all aspects of
+  the computer industry for more than 30 years.</p>
+
+  <p>After graduating with an MS in Operations Research from U.C. Berkeley in
+  1971 and serving 18 months in the miltary, he left on a trip to Ecuador.
+  There he founded a data processing company which is still in operation
+  today. Returning to California in 1986, he focused on the more technical
+  aspects of software development. This has resulted in the completion of
+  projects such as the Postman's Sort and Boost serialization library - among
+  others.</p>
+
+  <p>Other current interests include hanggliding, squash, hiking and bike
+  riding.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2004 Robert Ramey</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/ronald_garcia.htm
===================================================================
--- boost/trunk/people/ronald_garcia.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/ronald_garcia.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,31 +1,67 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <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>Ronald Garcia</title>
-  </head>
-  <body bgcolor="#FFFFFF">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/ronald_garcia.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/ronald_garcia_small.jpg" align="left" hspace="10" vspace="5" xthumbnail-orig-image="ronald_garcia.jpg" width="100" height="144"></a>Ronald 
-      Garcia is a Ph.D. student at Indiana University in Bloomington, Indiana. He is 
-      the author of the Boost Multidimensional Array Library (<a href="../libs/multi_array/doc/index.html">MultiArray</a>). 
-      His research interests include software engineering tools and techniques, 
-      programming languages, generic and generative programming and high performance 
-      scientific computing.
-    </p>
-    <p>When he's not in front of a computer, Ron's interests include playing ultimate 
-      frisbee, bass guitar, drumset, and West African percussion.
-    </p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Ronald Garcia</title>
+</head>
+
+<body bgcolor="#FFFFFF">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/ronald_garcia.jpg"><img border="0"
+  src="http://boost.sourceforge.net/photos/ronald_garcia_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/ronald_garcia.jpg" align="left"
+  hspace="10" vspace="5" width="100" height="144"></a>Ronald Garcia is a
+  Ph.D. student at Indiana University in Bloomington, Indiana. He is the
+  author of the Boost Multidimensional Array Library (<a href=
+  "../libs/multi_array/doc/index.html">MultiArray</a>). His research
+  interests include software engineering tools and techniques, programming
+  languages, generic and generative programming and high performance
+  scientific computing.</p>
+
+  <p>When he's not in front of a computer, Ron's interests include playing
+  ultimate frisbee, bass guitar, drumset, and West African
+  percussion.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->20 November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39356" --></p>
+
+  <p><i>Copyright &copy; 2002 Ronald Garcia</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/samuel_krempp.htm
===================================================================
--- boost/trunk/people/samuel_krempp.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/samuel_krempp.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,31 +1,70 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <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>Samuel Krempp</title>
-  </head>
-  <body bgcolor="#FFFFFF">
-    <table cellPadding="2" bgColor="#007f7f" border="1">
-      <tr>
-        <td bgColor="#ffffff">
-          <img alt="boost.png (6897 bytes)" src="../boost.png" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#ffffff"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#ffffff"><big> Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#ffffff"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#ffffff"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#ffffff"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/samuel_krempp.jpg"> <img border="0" src="http://boost.sourceforge.net/photos/samuel_krempp_small.jpg" xthumbnail-orig-image="samuel_krempp.jpg" align="left" hspace="10" vspace="5" width="100" height="65"></a>Samuel 
-      Krempp is a PhD student in mathematics, at the CMLA in the 'Ecole Normale 
-      Supérieure' de Cachan (France). He spends most of his time implementing 
-      complicated image recognition algorithms, and thus had to get acquainted with 
-      C++.</p>
-    <p>He enjoys many other things - one of them is diving in wonderful, warm, sunny 
-      seas when he can afford it. And obviously, another is eating camembert and 
-      bread, drinking wine... and other activities typical of a French guy :)</p>
-    <p>He's the author of the <a href="../libs/format/index.html">Boost Format library</a>.</p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Samuel Krempp</title>
+</head>
+
+<body bgcolor="#FFFFFF">
+  <table cellpadding="2" bgcolor="#007F7F" border="1" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img alt="boost.png (6897 bytes)" src=
+      "../boost.png" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/samuel_krempp.jpg"><img border="0"
+  src="http://boost.sourceforge.net/photos/samuel_krempp_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/samuel_krempp.jpg" align="left"
+  hspace="10" vspace="5" width="100" height="65"></a>Samuel Krempp is a PhD
+  student in mathematics, at the CMLA in the 'Ecole Normale
+  Sup&eacute;rieure' de Cachan (France). He spends most of his time
+  implementing complicated image recognition algorithms, and thus had to get
+  acquainted with C++.</p>
+
+  <p>He enjoys many other things - one of them is diving in wonderful, warm,
+  sunny seas when he can afford it. And obviously, another is eating
+  camembert and bread, drinking wine... and other activities typical of a
+  French guy :)</p>
+
+  <p>He's the author of the <a href="../libs/format/index.html">Boost Format
+  library</a>.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2002 Samuel Krempp</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/thomas_witt.html
===================================================================
--- boost/trunk/people/thomas_witt.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/thomas_witt.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,49 +1,75 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
-   "http://www.w3.org/TR/html4/loose.dtd">
+"http://www.w3.org/TR/html4/loose.dtd">
 
 <html>
-  <head>
-    <meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
-    <title>Thomas Witt</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a
-    href="http://boost.sourceforge.net/photos/thomas_witt.jpg"><img
-    src="http://boost.sourceforge.net/photos/thomas_witt_small.jpg"
-    alt="http://boost.sourceforge.net/photos/thomas_witt.jpg"
-    border="0" align="left" hspace="10" vspace="5" width="100"
-    height="133"></a> 
-    <p>
-      Thomas Witt is a senior software developer
-      at <a href="http://www.styleadvisor.com">Zephyr Associates,
-      Inc.</a>. Being a mechanical engineer by training, he nowadays
-      spends most of his time developing applications and libraries in
-      C++. Twice a year he is allowed to leave his office to attend
-      C++ standards committee meetings.
-    </p> 
-    <p>
-      Thomas is coauthor of the Boost.Iterator library and in a less
-      busy and distant past was acting as
-      <a href="http://boost.sourceforge.net/more/formal_review_process.htm">Boost Review Wizard</a>
-    </p>
-    <p>
-      In his spare time Thomas likes reading, running, swimming and
-      skiing. There is also rumor of him being a railroad enthusiast,
-      but Thomas refuses to comment on this. Thomas lives in
-      Stateline, Nevada enjoying the view of Lake Tahoe and the slopes
-      of the surrounding ski resorts.
-    </p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>Thomas Witt</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href="http://boost.sourceforge.net/photos/thomas_witt.jpg"><img src=
+  "http://boost.sourceforge.net/photos/thomas_witt_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/thomas_witt.jpg" border="0" align=
+  "left" hspace="10" vspace="5" width="100" height="133"></a></p>
+
+  <p>Thomas Witt is a senior software developer at <a href=
+  "http://www.styleadvisor.com">Zephyr Associates, Inc.</a>. Being a
+  mechanical engineer by training, he nowadays spends most of his time
+  developing applications and libraries in C++. Twice a year he is allowed to
+  leave his office to attend C++ standards committee meetings.</p>
+
+  <p>Thomas is coauthor of the Boost.Iterator library and in a less busy and
+  distant past was acting as <a href=
+  "http://boost.sourceforge.net/more/formal_review_process.htm">Boost Review
+  Wizard</a></p>
+
+  <p>In his spare time Thomas likes reading, running, swimming and skiing.
+  There is also rumor of him being a railroad enthusiast, but Thomas refuses
+  to comment on this. Thomas lives in Stateline, Nevada enjoying the view of
+  Lake Tahoe and the slopes of the surrounding ski resorts.<br clear=
+  "all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2005 Thomas Witt</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/thorsten_ottosen.html
===================================================================
--- boost/trunk/people/thorsten_ottosen.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/thorsten_ottosen.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,50 +1,73 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
 <html>
 <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Thorsten Ottosen </title>
-    <link rel="stylesheet" href="../boost.css" type="text/css">
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Thorsten Ottosen</title>
+  <link rel="stylesheet" href="../boost.css" type="text/css">
 </head>
 
-    <body>
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-        <tr>
-            <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-            <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-            <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-            <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-            <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-            <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-        </tr>
-    </table>
-    <p>
-    <a href="http://boost.sourceforge.net/photos/thorsten_ottosen.jpg"><img 
-border="0"
-src="http://boost.sourceforge.net/photos/thorsten_ottosen_small.jpg" 
-alt="http://boost.sourceforge.net/photos/thorsten_ottosen.jpg " 
-align="left" height="110"></a>
+<body>
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
 
-    <p>
-    <a href=mailto:nesotto at cs.auc.dk>Thorsten Ottosen</a> holds a Bsc in Computer 
-    Science at Aalborg University, Denmark. After having studied mathematics at 
-    University of Technology in Sydney, Australia, he has now returned to Denmark to 
-    write a second thesis in the area of decision support systems. His first <a href=http://www.cs.auc.dk/~nesotto/pie/>thesis</a>
-    was in computer graphics since he used to dream about making computer games.
-    </p>
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
 
-    <p>
-    Thorsten is also a co-owner and part-time employee of <a href=http://www.dezide.com>Dezide</a>,
-    a company that specializes is trouble-shooting programs based on Bayesian-network 
-    technology.
-    </p>
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
 
-    <p>
-    In his spare-time he codes/reads/hacks C++ and participates in ANSI/ISO C++ 
-    committee meetings. In his spare-time of his spare-time he enjoys jogging,
-    reading, and being with family and friends.
-    </p>
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
 
-    </body>
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/thorsten_ottosen.jpg"><img border="0"
+  src="http://boost.sourceforge.net/photos/thorsten_ottosen_small.jpg" alt=
+  "http://boost.sourceforge.net/photos/thorsten_ottosen.jpg " align="left"
+  height="110"></a></p>
+
+  <p><a href="mailto:nesotto at cs.auc.dk">Thorsten Ottosen</a> holds a Bsc in
+  Computer Science at Aalborg University, Denmark. After having studied
+  mathematics at University of Technology in Sydney, Australia, he has now
+  returned to Denmark to write a second thesis in the area of decision
+  support systems. His first <a href=
+  "http://www.cs.auc.dk/~nesotto/pie/">thesis</a> was in computer graphics
+  since he used to dream about making computer games.</p>
+
+  <p>Thorsten is also a co-owner and part-time employee of <a href=
+  "http://www.dezide.com">Dezide</a>, a company that specializes is
+  trouble-shooting programs based on Bayesian-network technology.</p>
+
+  <p>In his spare-time he codes/reads/hacks C++ and participates in ANSI/ISO
+  C++ committee meetings. In his spare-time of his spare-time he enjoys
+  jogging, reading, and being with family and friends.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2004 Thorsten Ottosen</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>
-

Modified: boost/trunk/people/vladimir_prus.htm
===================================================================
--- boost/trunk/people/vladimir_prus.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/vladimir_prus.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,33 +1,65 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <title>Vladimir Prus</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png
-    (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/vladimir_prus.jpg">
-    <img src="http://boost.sourceforge.net/photos/vladimir_prus_small.jpg"
-     alt="vladimir_prus.jpg (25247 bytes)" border="0" align="left" hspace="10" vspace="5" width="100" height="123"></a>
-      <a href="mailto:ghost at cs.msu.su">Vladimir Prus</a> is a PhD student at
-      Moscow State University. He's supposed to do some research about
-      program analysis, processors and graphs, but also has various other
-      interests, like software engineering tools and compilers.
-    </p>
-    <p>
-      Volodya would probably spend all his time staring at the monitor and
-      haunting MSU corridors, but luckily is married and hardly can be seen in
-      front of a computer on weekends. He's not into any extreme sports, and
-      spends spare time going to cinema or just walking with his wife Caroline
-      in quiet parts of Moscow.
-      </p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+
+  <title>Vladimir Prus</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/vladimir_prus.jpg"><img src="http://boost.sourceforge.net/photos/vladimir_prus_small.jpg"
+  alt="vladimir_prus.jpg (25247 bytes)" border="0" align="left" hspace="10"
+  vspace="5" width="100" height="123"></a><a href=
+  "mailto:ghost at cs.msu.su">Vladimir Prus</a> is a PhD student at Moscow State
+  University. He's supposed to do some research about program analysis,
+  processors and graphs, but also has various other interests, like software
+  engineering tools and compilers.</p>
+
+  <p>Volodya would probably spend all his time staring at the monitor and
+  haunting MSU corridors, but luckily is married and hardly can be seen in
+  front of a computer on weekends. He's not into any extreme sports, and
+  spends spare time going to cinema or just walking with his wife Caroline in
+  quiet parts of Moscow.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2004 Vladimir Prus</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/people/william_kempf.htm
===================================================================
--- boost/trunk/people/william_kempf.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/people/william_kempf.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,30 +1,69 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
 <html>
-  <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-    <meta name="GENERATOR" content="Microsoft FrontPage 4.0">
-    <meta name="ProgId" content="FrontPage.Editor.Document">
-    <title>William Kempf</title>
-  </head>
-  <body bgcolor="#FFFFFF" text="#000000">
-    <table border="1" bgcolor="#007F7F" cellpadding="2">
-      <tr>
-        <td bgcolor="#FFFFFF"><img src="../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td>
-        <td><a href="../index.htm"><font face="Arial" color="#FFFFFF"><big>Home</big></font></a></td>
-        <td><a href="../libs/libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries</big></font></a></td>
-        <td><a href="people.htm"><font face="Arial" color="#FFFFFF"><big>People</big></font></a></td>
-        <td><a href="../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ</big></font></a></td>
-        <td><a href="../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More</big></font></a></td>
-      </tr>
-    </table>
-    <p><a href="http://boost.sourceforge.net/photos/william_kempf.jpg"><img border="0" src="http://boost.sourceforge.net/photos/william_kempf_small.jpg" alt="william_kempf.jpg (10935 bytes)" align="left" hspace="10" vspace="5" width="107" height="130"></a>
-      Bill Kempf lives in Omaha, NE with his wife Bonnie, his cat Dexter and his two 
-      Chinchillas, Chimney and Minuet. He married on Oct. 30, 1999 where he and his 
-      wife held a Halloween costume reception. If that doesn't give you an idea of 
-      what kind of guy he is, nothing will.</p>
-    <p>Bill graduated from Doane, a small private college in Nebraska in 1992 with a 
-      B.S. in Computer Science/Math. Being in the wrong place at the wrong time he 
-      had to take a job as the only person in an IS shop for a local affiliate of the 
-      Bunge Grain Company. In 1995 he moved on to a job as a software engineer for 
-      First Data Resources where he worked on client/server financial applications.</p>
-  </body>
+<head>
+  <meta http-equiv="Content-Language" content="en-us">
+  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+  <meta name="GENERATOR" content="Microsoft FrontPage 6.0">
+  <meta name="ProgId" content="FrontPage.Editor.Document">
+
+  <title>William Kempf</title>
+</head>
+
+<body bgcolor="#FFFFFF" text="#000000">
+  <table border="1" bgcolor="#007F7F" cellpadding="2" summary="">
+    <tr>
+      <td bgcolor="#FFFFFF"><img src="../boost.png" alt=
+      "boost.png (6897 bytes)" width="277" height="86"></td>
+
+      <td><a href="../index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Home</big></font></a></td>
+
+      <td><a href="../libs/libraries.htm"><font face="Arial" color=
+      "#FFFFFF"><big>Libraries</big></font></a></td>
+
+      <td><a href="people.htm"><font face="Arial" color=
+      "#FFFFFF"><big>People</big></font></a></td>
+
+      <td><a href="../more/faq.htm"><font face="Arial" color=
+      "#FFFFFF"><big>FAQ</big></font></a></td>
+
+      <td><a href="../more/index.htm"><font face="Arial" color=
+      "#FFFFFF"><big>More</big></font></a></td>
+    </tr>
+  </table>
+
+  <p><a href=
+  "http://boost.sourceforge.net/photos/william_kempf.jpg"><img border="0"
+  src="http://boost.sourceforge.net/photos/william_kempf_small.jpg" alt=
+  "william_kempf.jpg (10935 bytes)" align="left" hspace="10" vspace="5"
+  width="107" height="130"></a>Bill Kempf lives in Omaha, NE with his wife
+  Bonnie, his cat Dexter and his two Chinchillas, Chimney and Minuet. He
+  married on Oct. 30, 1999 where he and his wife held a Halloween costume
+  reception. If that doesn't give you an idea of what kind of guy he is,
+  nothing will.</p>
+
+  <p>Bill graduated from Doane, a small private college in Nebraska in 1992
+  with a B.S. in Computer Science/Math. Being in the wrong place at the wrong
+  time he had to take a job as the only person in an IS shop for a local
+  affiliate of the Bunge Grain Company. In 1995 he moved on to a job as a
+  software engineer for First Data Resources where he worked on client/server
+  financial applications.<br clear="all"></p>
+  <hr>
+
+  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+  "http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional"
+  height="31" width="88"></a></p>
+
+  <p>Revised 
+  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->11
+  November, 2006<!--webbot bot="Timestamp" endspan i-checksum="39357" --></p>
+
+  <p><i>Copyright &copy; 2000 William Kempf</i></p>
+
+  <p><i>Distributed under the Boost Software License, Version 1.0. (See
+  accompanying file <a href="../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
+  at <a href=
+  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
+</body>
 </html>

Modified: boost/trunk/project-root.jam
===================================================================
--- boost/trunk/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
+# Copyright Rene Rivera, Vladimir Prus, 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)
 
 path-constant BOOST_ROOT : . ;
-
-using lex ;
-using bison ;
-using testing ;

Modified: boost/trunk/rst.css
===================================================================
--- boost/trunk/rst.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/rst.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,327 +1,142 @@
-/*
-:Authors: David Goodger, David Abrahams
-:Contact: goodger at users.sourceforge.net, dave at boost-consulting.com
-:date: $Date: 2005/08/12 13:02:33 $
-:version: $Revision: 1.9 $
-:copyright: This stylesheet has been placed in the public domain.
-
-This stylesheet is for the use of ReStructuredText in a Boost context.
-It is basically an agglomeration of boost.css and the default.css that
-comes from docutils.
-
+ at import url("doc/html/boostbook.css");
+ at import url("doc/html/docutils.css");
+/* 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)
  */
 
-.first {
-  margin-top: 0 }
-
-.last {
-  margin-bottom: 0 }
-
-a.toc-backref {
-  text-decoration: none ;
-  color: black }
-
-dd {
-  margin-bottom: 0.5em }
-
-div.abstract {
-  margin: 2em 5em }
-
-div.abstract p.topic-title {
-  font-weight: bold ;
-  text-align: center }
-
-div.attention, div.caution, div.danger, div.error, div.hint,
-div.important, div.note, div.tip, div.warning, div.admonition {
-  margin: 2em ;
-  border: medium outset ;
-  padding: 1em }
-
-div.attention p.admonition-title, div.caution p.admonition-title,
-div.danger p.admonition-title, div.error p.admonition-title,
-div.warning p.admonition-title {
-  color: red ;
-  font-weight: bold ;
-  font-family: sans-serif }
-
-div.hint p.admonition-title, div.important p.admonition-title,
-div.note p.admonition-title, div.tip p.admonition-title,
-div.admonition p.admonition-title {
-  font-weight: bold ;
-  font-family: sans-serif }
-
-div.dedication {
-  margin: 2em 5em ;
-  text-align: center ;
-  font-style: italic }
-
-div.dedication p.topic-title {
-  font-weight: bold ;
-  font-style: normal }
-
-div.figure {
-  margin-left: 2em }
-
-div.footer, div.header {
-  font-size: smaller }
-
-div.line-block { display: block }
-div.line-block div.line-block { margin-left: 1.5em }
-
-div.sidebar {
-  margin-left: 1em ;
-  border: medium outset ;
-  padding: 0em 1em ;
-  background-color: #ffffee ;
-  width: 40% ;
-  float: right ;
-  clear: right }
-
-div.sidebar p.rubric {
-  font-family: sans-serif ;
-  font-size: medium }
-
-div.system-messages {
-  margin: 5em }
-
-div.system-messages h1 {
-  color: red }
-
-div.system-message {
-  border: medium outset ;
-  padding: 1em }
-
-div.system-message p.system-message-title {
-  color: red ;
+dl.docutils dt {
   font-weight: bold }
 
-div.topic {
-  margin: 2em }
+img.boost-logo {
+  border: none;
+  vertical-align: middle
+}
 
-dt {
-  font-weight: bold
+pre.literal-block span.concept {
+  font-style: italic;
 }
 
-H1.title
-{
-    FONT-SIZE: 200%;
-    COLOR: #00008B;
-    text-align: center
+.nav { 
+display: inline;
+list-style-type: none;
 }
-H1
-{
-    FONT-SIZE: 150%;
-}
-H2
-{
-    FONT-SIZE: 125%;
-}
-h2.subtitle {
-  text-align: center }
-H3
-{
-    FONT-SIZE: 108%;
-}
-BODY
-{
-    FONT-SIZE: 100%;
-    BACKGROUND-COLOR: #ffffff;
-}
-PRE
-{
-    MARGIN-LEFT: 2em;
-    FONT-FAMILY: Courier;
-}
-CODE
-{
-    FONT-FAMILY: Courier;
-    white-space: pre;
-}
-.pre
-{
-    FONT-FAMILY: Courier;
-    white-space: pre;
-}
-.index
-{
-    TEXT-ALIGN: left;
-}
-.page-index
-{
-    TEXT-ALIGN: left;
-}
-.definition
-{
-    TEXT-ALIGN: left;
-}
-.footnote
-{
-    FONT-SIZE: 80%;
-    VERTICAL-ALIGN: super;
-    TEXT-DECORATION: none;
-}
-.function-semantics
-{
-    CLEAR: left;
-}
 
-hr {
-  width: 75% }
-
-ol.simple, ul.simple {
-  margin-bottom: 1em }
-
-ol.arabic {
-  list-style: decimal }
-
-ol.loweralpha {
-  list-style: lower-alpha }
-
-ol.upperalpha {
-  list-style: upper-alpha }
-
-ol.lowerroman {
-  list-style: lower-roman }
-
-ol.upperroman {
-  list-style: upper-roman }
-
-p.attribution {
-  text-align: right ;
-  margin-left: 50% }
-
-p.caption {
-  font-style: italic }
-
-p.credits {
-  font-style: italic ;
-  font-size: smaller }
-
-p.label {
-  white-space: nowrap }
-
-p.rubric {
-  font-weight: bold ;
-  font-size: larger ;
-  color: maroon ;
-  text-align: center }
-
-p.sidebar-title {
-  font-family: sans-serif ;
-  font-weight: bold ;
-  font-size: larger }
-
-p.sidebar-subtitle {
-  font-family: sans-serif ;
-  font-weight: bold }
-
-p.topic-title {
-  font-weight: bold }
-
-pre.address {
-  margin-bottom: 0 ;
-  margin-top: 0 ;
-  font-family: serif ;
-  font-size: 100% }
-
-pre.line-block {
-  font-family: serif ;
-  font-size: 100% }
-
-pre.literal-block, pre.doctest-block {
-  margin-left: 2em ;
-  margin-right: 2em ;
-  background-color: #eeeeee }
-
-span.class {
-  font-family: monospace;
+.prevpage {
+padding-top: -5px;
+text-align: left;
+float: left;
 }
 
-span.classifier {
-  font-family: sans-serif ;
-  font-style: oblique }
-
-span.classifier-delimiter {
-  font-family: sans-serif ;
-  font-weight: bold }
-
-span.doublesize {
-  font-size: 200%
+.nextpage {
+padding-top: -20px;
+text-align: right;
+float: right;
 }
 
-span.interpreted {
-  font-family: sans-serif }
+div.small {
+   font-size: smaller }
 
-span.concept {
-  font-family: sans-serif }
-
-span.function {
-  font-family: monospace;
+h2 a { 
+   font-size: 90%; 
 }
+h3 a { 
+   font-size: 80%; 
+}
+h4 a { 
+   font-size: 70%; 
+}
+h5 a { 
+   font-size: 60%; 
+}
 
-span.option {
-  white-space: nowrap }
-
-span.option-argument {
-  font-style: italic }
-
-span.pre {
-  white-space: pre }
-
-span.problematic {
-  color: red }
-
-/* Firefox, at least, seems to need some help lowering
-   subscripts. Without the following, subscripts seem not to drop
-   at all when in a preformatted block.  -- DWA
-*/
-
-sub {
-  vertical-align: -20%
+dl,table
+{
+   text-align: left;
+   font-size: 10pt; 
+   line-height: 1.15;
 }
 
-table {
-  margin-top: 0.5em ;
-  margin-bottom: 0.5em }
 
-table.citation {
-  border-left: solid thin gray ;
-  padding-left: 0.5ex }
+/*=============================================================================
+    Tables
+=============================================================================*/
 
-table.docinfo {
-  margin: 2em 4em }
+    table.table
+    {
+        width: 92%;
+        margin-left: 4%;
+        margin-right: 4%;
+    }
+    
+    table.table
+    {
+        padding: 4px;
+    }
+    
+    /* Table Cells */
+    table.table tr td
+    {
+        padding: 0.5em;
+        text-align: left;
+        font-size: 9pt;
+    }
 
-table.footnote {
-  border-left: solid thin black ;
-  padding-left: 0.5ex }
+    table.table tr th
+    {
+        padding: 0.5em 0.5em 0.5em 0.5em;
+        border: 1pt solid white;
+        font-size: 80%;
+    }
 
-td, th {
-  padding-left: 0.5em ;
-  padding-right: 0.5em ;
-  vertical-align: top }
+    @media screen
+    {
+    
+    /* Tables */
+        table.table tr td
+        {
+            border: 1px solid #DCDCDC;
+        }
+    
+        table.table tr th
+        {
+            background-color: #F0F0F0;
+            border: 1px solid #DCDCDC;
+        }
 
-th.docinfo-name, th.field-name {
-  font-weight: bold ;
-  text-align: left ;
-  white-space: nowrap }
+        pre, 
+        .screen
+        {
+            border: 1px solid #DCDCDC;
+        }
+    
+        td pre
+        td .screen
+        {
+            border: 0px
+        }
+    
+        .sidebar pre
+        {
+            border: 0px
+        }
+    
+    }
 
-/* 
-  dwa 2003/7/29 -- commented out so that it wouldn't override earlier
-  styles from boost.css
+    pre, 
+    .screen
+    {
+        font-size: 9pt;
+        display: block;
+        margin: 1pc 4% 0pc 4%;
+        padding: 0.5pc 0.5pc 0.5pc 0.5pc;
+    }
 
-h1 tt, h2 tt, h3 tt, h4 tt, h5 tt, h6 tt {
-  font-size: 100% }
-*/
+    /* Program listings in tables don't get borders */
+    td pre, 
+    td .screen
+    {
+        margin: 0pc 0pc 0pc 0pc;
+        padding:  0pc 0pc 0pc 0pc;
+    }
 
-ul.auto-toc {
-  list-style-type: none }
-
-img.boost-logo {
-  border: none;
-  vertical-align: middle
-}
-
-pre.literal-block span.concept {
-  font-style: italic;
-}
-

Deleted: boost/trunk/status/.cvsignore
===================================================================
--- boost/trunk/status/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/status/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +0,0 @@
-*.log
-boosttmp.*
-regression
-rng.saved
-rng.tmp

Deleted: boost/trunk/status/Jamfile
===================================================================
--- boost/trunk/status/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/status/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,197 +0,0 @@
-# Boost regression-testing Jamfile
-#  (C) Copyright David Abrahams 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
-
-subproject status ;
-
-# bring in the rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-# Tests from Jamfiles in individual library test subdirectories
-# Please keep these in alphabetic order by test-suite name
-
-subinclude libs/any/test ;                 # test-suite any
-subinclude libs/algorithm/minmax/test ;    # test-suite algorithm/minmax
-subinclude libs/algorithm/string/test ;    # test-suite algorithm/string
-subinclude libs/assign/test ;              # test-suite assign
-subinclude libs/bind/test ;                # test-suite bind
-subinclude libs/conversion/test ;          # test-suite conversion
-subinclude libs/concept_check ;            # test-suite concept_check
-subinclude libs/date_time/test ;           # test-suite date_time
-subinclude libs/dynamic_bitset ;           # test suite dynamic_bitset
-subinclude libs/filesystem/test ;          # test-suite filesystem
-subinclude libs/foreach/test ;             # test-suite foreach
-subinclude libs/format/test ;              # test-suite format
-subinclude libs/function/test ;            # test-suite function
-subinclude libs/functional/hash/test ;     # test-suite functional/hash
-subinclude libs/graph/test ;               # test-suite graph
-subinclude libs/io/test ;                  # test-suite io
-subinclude libs/iostreams/test ;           # test-suite iostreams
-subinclude libs/iterator/test ;            # test-suite iterator
-subinclude libs/logic/test ;               # test-suite logic
-subinclude libs/math/test ;                # test-suite math
-subinclude libs/mpl/test ;                 # test-suite mpl
-subinclude libs/multi_array/test ;         # test-suite multi_array
-subinclude libs/multi_index/test ;         # test-suite multi_index
-subinclude libs/numeric/conversion/test ;  # test-suite numeric/conversion
-subinclude libs/numeric/interval/test ;    # test-suite numeric/interval
-subinclude libs/numeric/ublas/test ;       # test-suite numeric/uBLAS
-subinclude libs/optional/test ;            # test-suite optional
-subinclude libs/parameter/test ;           # test-suite parameter
-subinclude libs/program_options/test ;     # test-suite program_options
-subinclude libs/property_map/test ;        # test-suite property_map
-subinclude libs/ptr_container/test ;       # test-suite ptr_container
-subinclude libs/python/test ;              # test-suite python
-subinclude libs/random/test ;              # test-suite random
-subinclude libs/range/test ;               # test-suite range
-subinclude libs/regex/test ;               # test-suite regex
-subinclude libs/regex/example ;            # test-suite regex-examples
-subinclude libs/serialization/test ;       # test-suite serialization
-subinclude libs/signals/test ;             # test-suite signals
-subinclude libs/smart_ptr/test ;           # test-suite smart_ptr
-subinclude libs/spirit/test ;              # test-suite spirit
-subinclude libs/statechart/test ;          # test-suite statechart
-subinclude libs/static_assert ;            # test-suite static_assert
-subinclude libs/thread/test ;              # test-suite thread
-subinclude libs/tr1/test ;                 # test-suite tr1
-subinclude libs/type_traits/test ;         # test-suite type_traits
-subinclude libs/typeof/test ;              # test-suite typeof
-subinclude libs/utility/enable_if/test ;   # test-suite utility/enable_if
-subinclude libs/utility/test ;             # test-suite utility
-subinclude libs/variant/test ;             # test-suite variant
-subinclude libs/wave/test/build ;          # test-suite wave
-subinclude libs/xpressive/test ;           # test-suite xpressive
- 
-
-# Tests specified in this Jamfile
-{
-    # look in BOOST_ROOT for sources first, just in this Jamfile
-    local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-    
-    test-suite config
-        : [ run libs/config/test/config_test.cpp
-                : #args
-                : #input-files
-                : #requirements
-                <threading>multi <no-warn>config_test.cpp
-          ]
-           [ run libs/config/test/config_info.cpp : : : <test-info>always_show_run_output ]
-           [ run libs/config/test/math_info.cpp : : : 
-           	<test-info>always_show_run_output 
-           	<borland><*><runtime-link>static
-           	<borland-5_6_4><*><runtime-link>static ]
-           [ run libs/config/test/abi/abi_test.cpp libs/config/test/abi/main.cpp ]
-           [ run libs/config/test/limits_test.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-           [ run libs/config/test/link/main.cpp <dll>../libs/config/test/link/link_test
-                : #args
-                : #input-files
-                : #requirements
-                <runtime-link>dynamic
-                <define>BOOST_DYN_LINK=1
-                <define>BOOST_CONFIG_NO_LIB=1
-                :
-                config_link_test
-          ]
-          [ compile-fail libs/config/test/threads/test_thread_fail1.cpp ]
-          [ compile-fail libs/config/test/threads/test_thread_fail2.cpp ]
-        ;
-
-    test-suite array
-        : [ run libs/array/array1.cpp ]
-          [ run libs/array/array2.cpp ]
-          [ run libs/array/array3.cpp ]
-          [ run libs/array/array4.cpp ]
-          [ run libs/array/array5.cpp ]
-        ;
-
-    run libs/crc/crc_test.cpp <lib>../libs/test/build/boost_test_exec_monitor ;
-
-
-    test-suite disjoint_sets
-        : [ run libs/disjoint_sets/disjoint_set_test.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-        ;
-
-    run libs/functional/function_test.cpp ;
-
-    test-suite integer
-        : [ run libs/integer/cstdint_test.cpp ]
-          [ run libs/integer/integer_test.cpp ]
-          [ run libs/integer/integer_traits_test.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-        ;
-
-    test-suite lambda
-        : [ run libs/lambda/test/algorithm_test.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/lambda/test/bind_tests_simple.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/lambda/test/bind_tests_advanced.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/lambda/test/bind_tests_simple_f_refs.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/lambda/test/bll_and_function.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/lambda/test/cast_test.cpp <lib>../libs/test/build/boost_test_exec_monitor : : : : lambda_cast_test ]
-          [ run libs/lambda/test/constructor_tests.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/lambda/test/control_structures.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/lambda/test/exception_test.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/lambda/test/extending_rt_traits.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/lambda/test/is_instance_of_test.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/lambda/test/member_pointer_test.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/lambda/test/operator_tests_simple.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/lambda/test/phoenix_control_structures.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/lambda/test/switch_construct.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-        ;
-
-
-    run libs/pool/test/test_pool_alloc.cpp  <lib>../libs/test/build/boost_test_exec_monitor ;
-
-    test-suite preprocessor
-        : [ compile libs/preprocessor/test/arithmetic.cpp ]
-          [ compile libs/preprocessor/test/array.cpp ]
-          [ compile libs/preprocessor/test/comparison.cpp ]
-          [ compile libs/preprocessor/test/control.cpp ]
-          [ compile libs/preprocessor/test/debug.cpp ]
-          [ compile libs/preprocessor/test/facilities.cpp ]
-          [ compile libs/preprocessor/test/iteration.cpp ]
-          [ compile libs/preprocessor/test/list.cpp ]
-          [ compile libs/preprocessor/test/logical.cpp ]
-          [ compile libs/preprocessor/test/repetition.cpp ]
-          [ compile libs/preprocessor/test/selection.cpp ]
-          [ compile libs/preprocessor/test/seq.cpp ]
-          [ compile libs/preprocessor/test/slot.cpp ]
-          [ compile libs/preprocessor/test/tuple.cpp ]
-        ;
-
-    test-suite rational
-        : [ run libs/rational/rational_example.cpp ]
-          [ run libs/rational/rational_test.cpp <lib>../libs/test/build/boost_unit_test_framework ]
-        ;
-
-    subinclude libs/test/test ;
-#     subinclude libs/test/example ;
-#     subinclude libs/test/example/cla ;
-#     subinclude libs/test/example/cla/validation ;
-#     subinclude libs/test/example/env ;
-#     subinclude libs/test/example/env/validation ;
-    
-    compile libs/timer/timer_test.cpp ;
-
-    test-suite tokenizer
-        : [ run libs/tokenizer/examples.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/tokenizer/simple_example_1.cpp ]
-          [ run libs/tokenizer/simple_example_2.cpp ]
-          [ run libs/tokenizer/simple_example_3.cpp ]
-          [ run libs/tokenizer/simple_example_4.cpp ]
-          [ run libs/tokenizer/simple_example_5.cpp ]
-        ;
-
-    test-suite tuple
-        : [ run libs/tuple/test/tuple_test_bench.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-          [ run libs/tuple/test/io_test.cpp <lib>../libs/test/build/boost_test_exec_monitor ]
-    ;
-}
-
-
-
-
-

Modified: boost/trunk/status/Jamfile.v2
===================================================================
--- boost/trunk/status/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/status/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -113,7 +113,8 @@
         ;
     
     test-suite array_suite # !!!
-        : [ run libs/array/array1.cpp ]
+        : [ run libs/array/array0.cpp ]
+          [ run libs/array/array1.cpp ]
           [ run libs/array/array2.cpp ]
           [ run libs/array/array3.cpp ]
           [ run libs/array/array4.cpp ]

Modified: boost/trunk/status/explicit-failures-markup.xml
===================================================================
--- boost/trunk/status/explicit-failures-markup.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/status/explicit-failures-markup.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,12 @@
-<explicit-failures-markup
-    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
-    xsi:noNamespaceSchemaLocation="http://boost.cvs.sourceforge.net/*checkout*/boost/boost/status/explicit-failures.xsd"
-    >
+<explicit-failures-markup xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+ xsi:noNamespaceSchemaLocation="explicit-failures.xsd">
 
     <!--
     PLEASE VALIDATE THE XML BEFORE COMMITTING YOUR CHANGES!
+    
+    Locally, the xmlint tool can be used:
+    
+        xmllint <two-dashes>valid explicit-failures-markup.xml <two-dashes>schema explicit-failures.xsd
 
     The following online services can be used to validate your changes to this
     file:
@@ -20,39 +22,36 @@
     -->
 
     <!-- /////////////// Toolsets /////////////// -->
-    <mark-toolset name="borland-5_6_4" status="required"/>
-    <mark-toolset name="cw-9_4" status="required"/>
-    <mark-toolset name="cw-8_3" status="required"/>
-    <mark-toolset name="cw-9_5-darwin" status="required"/>
-    <mark-toolset name="msvc" status="required"/>
-    <mark-toolset name="msvc-stlport" status="required"/>
-    <mark-toolset name="vc7" status="required"/>
-    <mark-toolset name="vc-6_5" status="required"/>
+    <mark-toolset name="borland-5.6.4" status="required"/>
+    <mark-toolset name="borland-5.8.2" status="required"/>
+    <mark-toolset name="cw-9.4" status="required"/>
     <mark-toolset name="msvc-6.5" status="required"/>
-    <mark-toolset name="vc-6_5-stlport" status="required"/>
-    <mark-toolset name="vc-7_0" status="required"/>
-    <mark-toolset name="vc-7_1" status="required"/>
-    <mark-toolset name="mingw-3_4_2" status="required"/>
-    <mark-toolset name="gcc-2.95.3-linux" status="required"/>
-    <mark-toolset name="gcc-2.95.3-stlport-4.5.3-linux" status="required"/>
-    <mark-toolset name="gcc-2.95.3-stlport-4.6.2-linux" status="required"/>
-    <mark-toolset name="gcc-3.2.3-linux" status="required"/>
-    <mark-toolset name="gcc-3.3.6-linux" status="required"/>
-    <mark-toolset name="gcc-3.4.4-linux" status="required"/>
-    <mark-toolset name="gcc-3.4.5-linux" status="required"/>
-    <mark-toolset name="gcc-4.0.0-linux" status="required"/>
-    <mark-toolset name="gcc-4.0.1-linux" status="required"/>
-    <mark-toolset name="gcc-4.0.2-linux" status="required"/>
-    <mark-toolset name="gcc-3_3-darwin" status="required"/>
-    <mark-toolset name="gcc-4_0-darwin" status="required"/>
+    <mark-toolset name="msvc-6.5_stlport4" status="required"/>
+    <mark-toolset name="msvc-7.0" status="required"/>
+    <mark-toolset name="msvc-7.1_stlport4" status="required"/>
+    <mark-toolset name="msvc-7.1" status="required"/>
+    <mark-toolset name="msvc-8.0" status="required"/>
+    <mark-toolset name="gcc-mingw-3.4.2" status="required"/>
+    <mark-toolset name="gcc-mingw-3.4.5" status="required"/>
+    <mark-toolset name="gcc-3.3.6" status="required"/>
+    <mark-toolset name="gcc-cygwin-3.4.4" status="required"/>
+    <mark-toolset name="gcc-3.2.3_linux" status="required"/>
+    <mark-toolset name="gcc-3.3.6_linux" status="required"/>
+    <mark-toolset name="gcc-3.4.5_linux" status="required"/>
+    <mark-toolset name="gcc-3.4.5_linux" status="required"/>
+    <mark-toolset name="gcc-4.0.3_linux" status="required"/>
+    <mark-toolset name="gcc-4.1.0_linux" status="required"/>
+    <mark-toolset name="gcc-3.4.5_linux_x86_64" status="required"/>
+    <mark-toolset name="gcc-4.1.0_linux_x86_64" status="required"/>
+    <mark-toolset name="gcc-3_4_4_tru64" status="required"/>
+    <mark-toolset name="gcc-4_0_3_tru64" status="required"/>
     <mark-toolset name="gcc-3.4.3_sunos" status="required"/>
-    <mark-toolset name="intel-win32-8_1" status="required"/>
-    <mark-toolset name="intel-win32-9_0" status="required"/>
-    <mark-toolset name="intel-8.1-linux" status="required"/>
-    <mark-toolset name="intel-9.0-linux" status="required"/>
+    <mark-toolset name="darwin-4.0.1" status="required"/>
+    <mark-toolset name="intel-vc71-win-9.1" status="required"/>
+    <mark-toolset name="intel-linux-9.0" status="required"/>
     <mark-toolset name="hp_cxx-71_006_tru64" status="required"/>
-    <mark-toolset name="qcc-3.3.5-cpp" status="required"/>
-    <mark-toolset name="qcc-3.3.5-gpp" status="required"/>
+    <mark-toolset name="sun-5.8" status="required"/>
+    <mark-toolset name="gcc-4.1.1_sunos_i86pc" status="required"/>
 
     <!-- /////////////// Libraries /////////////// -->
 
@@ -67,9 +66,8 @@
     <library name="algorithm/string">
         <mark-unusable>
             <toolset name="borland"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
+            <toolset name="msvc-7.1_stlport4"/>
             <toolset name="iw-7_1-vc6"/>
             <toolset name="gcc-2.95.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
@@ -82,12 +80,10 @@
         </mark-unusable>
         <test name="regex">
             <mark-failure>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <note author="A.Meredith">
-                    The reason for this failure has not been diagnosed yet.
+                <toolset name="borland-5.8*"/>
+			    <toolset name="borland-5.6.4"/>
+                <note author="P.Droba">
+                    The toolset is not supported by Boost.Regex.
                 </note>
             </mark-failure>
         </test>
@@ -97,8 +93,6 @@
     <library name="any">
         <test name="any_to_ref_test">
           <mark-failure>
-              <toolset name="msvc"/>
-              <toolset name="vc-6_5*"/>
               <toolset name="msvc-6.5*"/>
               <note author="Vladimir Prus">
                 The test fail with ICE, but the exact reason for ICE is not
@@ -113,15 +107,24 @@
 
     <!-- array -->
     <library name="array">
+        <test name="array0">
+            <mark-failure>
+                <toolset name="msvc-6.5"/>
+                <toolset name="msvc-6.5_stlport4"/>
+                <toolset name="msvc-7.0"/>
+                <note author="A.Meredith">
+                    Compilers need to support partial template specialization
+                    to work with zero length arrays.
+                </note>
+            </mark-failure>
+        </test>
         <test name="array3">
             <mark-failure>
                 <toolset name="borland"/>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-6.5_stlport4"/>
+                <toolset name="msvc-7.0"/>
                 <note refid="3"/>
             </mark-failure>
             <mark-failure>
@@ -132,12 +135,10 @@
         <test name="array4">
             <mark-failure>
                 <toolset name="borland"/>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-6.5_stlport4"/>
+                <toolset name="msvc-7.0"/>
                 <note refid="3"/>
             </mark-failure>
         </test>
@@ -150,9 +151,8 @@
         </mark-unusable>
         <mark-expected-failures>
             <test name="array"/>
-            <toolset name="msvc-stlport"/>
-            <toolset name="vc-6_5-stlport"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-6.5_stlport4"/>
+            <toolset name="msvc-7.0"/>
             <note author="Thorsten Ottosen" >
                 The test would (most likely) compile and run properly if the workaround
                 syntax .to_container( c ) was applied to all list_of() expressions.
@@ -165,10 +165,10 @@
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="list_inserter"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <toolset name="sunpro-5_3-sunos"/>
             <toolset name="tru64cxx65*"/>
-            <toolset name="intel-win32"/>
+            <toolset name="hp_cxx-65*"/>
             <note refid="6" author="Thorsten Ottosen"/>
         </mark-expected-failures>
         <mark-expected-failures>
@@ -183,11 +183,10 @@
             <test name="list_of"/>
             <toolset name="sunpro-5_3-sunos"/>
             <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <toolset name="borland-5*"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="Thorsten Ottosen" >
                 The test would (most likely) compile and run properly if the workaround
                 syntax .to_container( c ) was applied to all list_of() expressions.
@@ -204,19 +203,20 @@
         <mark-expected-failures>
             <test name="multi_index_container"/>
             <toolset name="sunpro-5_3-sunos"/>
+            <toolset name="sun-5.8"/>
             <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <toolset name="borland-5*"/>
             <toolset name="gcc-2.95.3*"/>
             <note refid="27" author="Thorsten Ottosen"/>
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="multi_index_container"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <toolset name="mipspro"/>
             <toolset name="tru64cxx65"/>
+            <toolset name="hp_cxx-65*"/>
             <note author="Thorsten Ottosen" >
                 The test would (most likely) compile and run properly if the workaround
                 syntax .to_container( c ) was applied to all list_of() expressions.
@@ -231,12 +231,11 @@
             <test name="ptr_list_inserter"/>
             <toolset name="sunpro-5_3-sunos"/>
             <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <toolset name="borland-5*"/>
             <toolset name="gcc-2.95.3*"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <toolset name="mipspro"/>
             <note author="Thorsten Ottosen" >
                 The test depends on Boost.Pointer Container which probably does not work for
@@ -246,10 +245,9 @@
         <mark-expected-failures>
             <test name="ptr_list_of"/>
             <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <toolset name="borland-5*"/>
             <toolset name="gcc-2.95.3*"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
             <toolset name="mipspro"/>
             <note author="Thorsten Ottosen" >
@@ -260,10 +258,9 @@
         <mark-expected-failures>
             <test name="ptr_map_inserter"/>
             <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <toolset name="borland-5*"/>
             <toolset name="gcc-2.95.3*"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
             <toolset name="mipspro"/>
             <note author="Thorsten Ottosen" >
@@ -283,10 +280,8 @@
             <test name="tuple_list_of"/>
             <toolset name="sunpro-5_3-sunos"/>
             <toolset name="borland-5*"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="Thorsten Ottosen" >
                 The test depends on Boost.Tuple which probably does not work for
                 this compiler.
@@ -306,11 +301,9 @@
         <mark-expected-failures>
             <test name="bind_dm2_test"/>
             <test name="mem_fn_dm_test"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
-            <toolset name="cw-8_3"/>
+            <toolset name="msvc-7.0"/>
+            <toolset name="cw-8.3"/>
             <note refid="31" author="Peter Dimov"/>
         </mark-expected-failures>
         <mark-expected-failures>
@@ -333,7 +326,8 @@
         <mark-expected-failures>
             <test name="bind_rv_sp_test"/>
             <toolset name="tru64cxx*"/>
-            <toolset name="hp_cxx*"/>
+            <toolset name="hp_cxx-65*"/>
+            <toolset name="hp_cxx-71*"/>
             <note author="Markus Schoepflin">
               This failure is caused by a bug in the compiler triggered by the
               use of the debug flag '-gall'. It has been reported to the
@@ -343,11 +337,17 @@
         <mark-expected-failures>
             <test name="bind_dm3_test"/>
             <toolset name="borland-5*"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note refid="31" author="Peter Dimov"/>
         </mark-expected-failures>
+        <mark-expected-failures>
+          <test name="mem_fn_eq_test"/>
+          <toolset name="msvc-7.1"/>
+          <note author="Peter Dimov">
+            This failure is only present in release mode and is caused by /OPT:ICF.
+          </note>
+        </mark-expected-failures>
     </library>
 
 
@@ -355,10 +355,18 @@
     <library name="concept_check">
         <test name="class_concept_fail_expected">
             <mark-failure>
-                <toolset name="cw-8_3*"/>
+                <toolset name="cw-8.3*"/>
                 <note author="B. Dawes" refid="3"/>
             </mark-failure>
         </test>
+        <test name="class_concept_fail_expected">
+            <mark-failure>
+                <toolset name="borland-5*"/>
+                <toolset name="msvc-6.5*"/>
+                <toolset name="msvc-7.0"/>
+                <note author="Jeremy Siek"/>
+            </mark-failure>
+        </test>
         <test name="stl_concept_covering">
             <mark-failure>
                 <toolset name="*"/>
@@ -369,12 +377,6 @@
 
     <!-- config -->
     <library name="config">
-        <test name="config_test">
-            <mark-failure>
-                <toolset name="intel-win32"/>
-                <note author="B. Dawes" refid="3"/>
-            </mark-failure>
-        </test>
         <test name="config_link_test">
             <mark-failure>
                 <toolset name="*como-4_3_3-vc7*"/>
@@ -383,10 +385,18 @@
         </test>
         <test name="limits_test">
             <mark-failure>
-                <toolset name="cw-8_3*"/>
+                <toolset name="cw-8.3*"/>
                 <note author="B. Dawes" refid="3"/>
             </mark-failure>
         </test>
+        <test name="limits_test">
+            <mark-failure>
+                <toolset name="gcc-3_4_4_tru64"/>
+                <note author="John Maddock">
+                   Long double NaN's are apparently handled incorrectly on this platform.
+                </note>
+            </mark-failure>
+        </test>
 
         <test name="limits_test">
             <mark-failure>
@@ -396,10 +406,7 @@
         </test>
         <test name="limits_test">
             <mark-failure>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
+                <toolset name="borland-5.8*"/>
                 <note author="A.Meredith">
                     This failure is due to NaNs trapping.
                 </note>
@@ -444,21 +451,21 @@
     <!-- date_time -->
     <library name="date_time">
         <mark-unusable>
+            <toolset name="como-4_3_3-vc7_1"/>
             <toolset name="sunpro-5_3-sunos"/>
-            <toolset name="msvc-stlport"/>
-            <toolset name="vc-6_5-stlport"/>
-            <toolset name="vc-6_5"/>
             <toolset name="msvc-6.5"/>
+            <toolset name="msvc-6.5_stlport5"/>
+            <toolset name="msvc-6.5_stlport4"/>
+            <toolset name="msvc-7.0"/>
+            <toolset name="msvc-7.0_stlport5"/>
             <toolset name="iw-7_1-vc6-stlp-4_5_3"/>
             <toolset name="iw-7_1-vc6"/>
-            <toolset name="dmc-8_47-stlport-4_5_3"/>
+            <toolset name="dmc-*"/>
         </mark-unusable>
 
         <test name="testgreg_serialize*">
             <mark-failure>
             <toolset name="gcc-2.*"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
             <note author="B. Garst">The serialization library does not support this compiler.
             </note>
@@ -467,7 +474,7 @@
 
         <test name="testgreg_serialize_xml">
             <mark-failure>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="J. Garland">XML serialization is not supported on this compiler.
             </note>
             </mark-failure>
@@ -476,8 +483,6 @@
         <test name="testtime_serialize*">
             <mark-failure>
             <toolset name="gcc-2.*"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
             <note author="B. Garst">The serialization library does not support this compiler.
             </note>
@@ -486,7 +491,7 @@
 
         <test name="testtime_serialize_xml*">
             <mark-failure>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="J. Garland">XML serialization is not supported on this compiler.
             </note>
             </mark-failure>
@@ -521,18 +526,14 @@
 
         <test name="testgreg_wstream">
             <mark-failure>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
-                <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
-                <toolset name="cw-8_3*"/>
-                <toolset name="borland-5_6_4"/>
+                <toolset name="msvc-6.5*"/>
+                <toolset name="msvc-7.0*"/>
+                <toolset name="cw-8.3*"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="mingw*"/>
+                <toolset name="*mingw*"/>
+                <toolset name="*cygwin*"/>
                 <toolset name="gcc-2.95.3-linux"/>
                 <toolset name="gcc-3.1-darwin"/>
                 <toolset name="*como-4_3_3*"/>
@@ -542,9 +543,8 @@
 
         <test name="testdate_input_facet*">
             <mark-failure>
-            <toolset name="cw-9_4"/>
             <toolset name="cw-9.4"/>
-            <toolset name="cw-9_5*"/>
+            <toolset name="cw-9.5*"/>
                 <note author="J. Garland">
                    For some reason Code Warrior has difficulty compiling some of the
                    input code.  This may be related to limitations of locale handling,
@@ -556,20 +556,14 @@
 
         <test name="testlocal_time_facet">
             <mark-failure>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="*como-4_3_3*"/>
             <toolset name="gcc-2.95.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5"/>
             <toolset name="msvc-6.5"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
                 <note author="J. Garland">
                    Some older compilers are confused by the template code here.
                    These are new features to date-time in 1.33 and there is no
@@ -580,16 +574,10 @@
 
         <test name="testlocal_time">
             <mark-failure>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5"/>
             <toolset name="msvc-6.5"/>
             <toolset name="*como-4_3_3*"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="gcc-2.95.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
@@ -603,16 +591,10 @@
 
         <test name="testlocal_time_iterator">
             <mark-failure>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5"/>
             <toolset name="msvc-6.5"/>
             <toolset name="*como-4_3_3*"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="gcc-2.95.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
@@ -626,16 +608,10 @@
 
         <test name="testlocal_time_period">
             <mark-failure>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5"/>
             <toolset name="msvc-6.5"/>
             <toolset name="*como-4_3_3*"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="gcc-2.95.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
@@ -650,16 +626,10 @@
         <test name="testclocks">
             <mark-failure>
             <toolset name="*como-4_3_3*"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="gcc-2.95.3-linux"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-7_0"/>
-            <toolset name="vc-6_5"/>
+            <toolset name="msvc-7.0"/>
             <toolset name="msvc-6.5"/>
                 <note author="J. Garland">
                    Some compilers are confused by the template code here.
@@ -671,21 +641,15 @@
 
         <test name="testlocal_time_input_facet">
             <mark-failure>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="*como-4_3_3*"/>
-            <toolset name="cw-8_3*"/>
+            <toolset name="cw-8.3*"/>
             <toolset name="gcc-2.95.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5"/>
             <toolset name="msvc-6.5"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
                 <note author="J. Garland">
                    Some older compilers are confused by the template code here.
                    These are new features to date-time in 1.33 and there is no
@@ -697,21 +661,15 @@
 
         <test name="testtime_input_facet">
             <mark-failure>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="*como-4_3_3*"/>
-            <toolset name="cw-8_3*"/>
+            <toolset name="cw-8.3*"/>
             <toolset name="gcc-2.95.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5"/>
             <toolset name="msvc-6.5"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
                 <note author="J. Garland">
                    Some older compilers are confused by the template code here.
                    These are new features to date-time in 1.33 and there is no
@@ -722,13 +680,10 @@
 
         <test name="testcustom_time_zone">
             <mark-failure>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
+            <toolset name="borland-5.8.1"/>
             <toolset name="gcc-2.95.3-linux"/>
             <toolset name="*como-4_3_3*"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5"/>
             <toolset name="msvc-6.5"/>
                 <note author="J. Garland">
                    Some older compilers are confused by the template code here.
@@ -740,12 +695,9 @@
 
         <test name="testposix_time_zone">
             <mark-failure>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
+            <toolset name="borland-5.8.1"/>
             <toolset name="gcc-2.95.3-linux"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5"/>
             <toolset name="msvc-6.5"/>
                 <note author="J. Garland">
                    Some older compilers are confused by the template code here.
@@ -757,13 +709,10 @@
 
         <test name="testtz_database">
             <mark-failure>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
+                <toolset name="borland-5.8.1"/>
                 <toolset name="*como-4_3_3*"/>
                 <toolset name="gcc-2.95.3-linux"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
                 <toolset name="msvc-6.5"/>
                 <note author="J. Garland">
                    Some compilers are confused by the template code here.
@@ -777,19 +726,16 @@
             <mark-failure>
                 <toolset name="gcc-2.95.3-linux"/>
                 <toolset name="gcc-3.1-darwin"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
-                <toolset name="borland-5_6_4"/>
+                <toolset name="msvc-7.0"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="mingw*"/>
+                <toolset name="*mingw*"/>
+                <toolset name="*cygwin*"/>
                 <toolset name="*como-4_3_3*"/>
                 <toolset name="tru64cxx65-042"/>
+                <toolset name="hp_cxx-65*"/>
                 <note author="B. Garst" refid="19,21,22"/>
             </mark-failure>
         </test>
@@ -798,19 +744,14 @@
             <mark-failure>
                 <toolset name="gcc-2.95.3-linux"/>
                 <toolset name="gcc-3.1-darwin"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
-                <toolset name="borland-5_6_4"/>
+                <toolset name="msvc-7.0"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="mingw*"/>
                 <toolset name="*como-4_3_3*"/>
                 <toolset name="tru64cxx65-042"/>
+                <toolset name="hp_cxx-65*"/>
                 <note author="B. Garst" refid="19,21,22"/>
             </mark-failure>
         </test>
@@ -818,17 +759,11 @@
             <mark-failure>
                 <toolset name="gcc-2.95.3-linux"/>
                 <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="cw-8_3*"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
+                <toolset name="borland-5.8*"/>
+                <toolset name="cw-8.3*"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note author="J. Garland">
                 These compilers are unfortunately able to correctly compile the
                 new format-based input-output code for date time.  Suitable, but 
@@ -840,17 +775,11 @@
             <mark-failure>
                 <toolset name="gcc-2.95.3-linux"/>
                 <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="cw-8_3*"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
+                <toolset name="borland-5.8*"/>
+                <toolset name="cw-8.3*"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note author="J. Garland">
                 These compilers are unfortunately able to correctly compile the
                 new format-based input-output code for date time.  Suitable, but 
@@ -862,17 +791,11 @@
             <mark-failure>
                 <toolset name="gcc-2.95.3-linux"/>
                 <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="cw-8_3*"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
+                <toolset name="borland-5.8*"/>
+                <toolset name="cw-8.3*"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note author="J. Garland">
                 These compilers are unfortunately able to correctly compile the
                 new format-based input-output code for date time.  Suitable, but 
@@ -884,8 +807,10 @@
         <test name="testwcustom_time_zone">
             <mark-failure>
                 <toolset name="gcc-2.95.3-linux"/>
-                <toolset name="mingw-3_4_2"/>
-                <toolset name="mingw-3_4_5"/>
+                <toolset name="gcc-3.4.2_mingw"/>
+                <toolset name="gcc-3.4.5_mingw"/>
+                <toolset name="*mingw*"/>
+                <toolset name="*cygwin*"/>
                 <note author="J. Garland">
                 These compilers are unfortunately able to correctly compile the
                 new format-based input-output code for date time.  Suitable, but 
@@ -897,8 +822,10 @@
         <test name="testwposix_time_zone">
             <mark-failure>
                 <toolset name="gcc-2.95.3-linux"/>
-                <toolset name="mingw-3_4_2"/>
-                <toolset name="mingw-3_4_5"/>
+                <toolset name="gcc-3.4.2_mingw"/>
+                <toolset name="gcc-3.4.5_mingw"/>
+                <toolset name="*mingw*"/>
+                <toolset name="*cygwin*"/>
                 <note author="J. Garland">
                 These compilers are unfortunately able to correctly compile the
                 new format-based input-output code for date time.  Suitable, but 
@@ -911,16 +838,14 @@
             <mark-failure>
                 <toolset name="gcc-2.95.3-linux"/>
                 <toolset name="gcc-3.1-darwin"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
                 <toolset name="msvc-6.5"/>
                 <toolset name="mingw*"/>
-                <toolset name="borland-5_6_4"/>
+                <toolset name="*mingw*"/>
+                <toolset name="*cygwin*"/>
+                <toolset name="gcc-3.4.2_mingw"/>
+                <toolset name="gcc-3.4.5_mingw"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
+                <toolset name="borland-5.8*"/>
                 <note author="B. Garst" refid="18,19"/>
             </mark-failure>
         </test>
@@ -928,16 +853,14 @@
             <mark-failure>
                 <toolset name="gcc-2.95.3-linux"/>
                 <toolset name="gcc-3.1-darwin"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
                 <toolset name="msvc-6.5"/>
                 <toolset name="mingw*"/>
-                <toolset name="borland-5_6_4"/>
+                <toolset name="*mingw*"/>
+                <toolset name="*cygwin*"/>
+                <toolset name="gcc-3.4.2_mingw"/>
+                <toolset name="gcc-3.4.5_mingw"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="*como-4_3_3*"/>
                 <note author="B. Garst" refid="18,19"/>
             </mark-failure>
@@ -950,16 +873,10 @@
         <test name="testparse_date">
             <mark-failure>
                 <toolset name="gcc-2.95.3-linux"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
-                <toolset name="borland-5_6_4"/>
+                <toolset name="msvc-7.0"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
+                <toolset name="borland-5.8*"/>
                 <note author="B. Garst" refid="18,20"/>
             </mark-failure>
         </test>
@@ -975,17 +892,15 @@
             <mark-failure>
                 <toolset name="gcc-2.95.3-linux"/>
                 <toolset name="gcc-3.1-darwin"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
-                <toolset name="borland-5_6_4"/>
+                <toolset name="msvc-7.0"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="mingw-3*"/>
+                <toolset name="gcc-3.4.2_mingw"/>
+                <toolset name="gcc-3.4.5_mingw"/>
+                <toolset name="*mingw*"/>
+                <toolset name="*cygwin*"/>
                 <toolset name="mingw"/>
                 <toolset name="*como-4_3_3*"/>
                 <note author="B. Garst" refid="18,19,20"/>
@@ -1020,16 +935,60 @@
             <test name="testgenerators_dll"/>
             <test name="testgreg_durations_dll"/>
             <test name="testperiod_dll"/>
-            <toolset name="cw-8_3*"/>
+            <toolset name="cw-8.3*"/>
             <note author="R. Rivera" refid="25"/>
         </mark-expected-failures>
 
         <mark-expected-failures>
+            <test name="testdate_facet_new"/>
+            <test name="testdate_facet_new_dll"/>
+            <test name="testdate_input_facet"/>
+            <test name="testdate_input_facet_dll"/>
+            <test name="testdate_facet"/>
+            <test name="testdate_facet_dll"/>
+            <test name="testtime_facet"/>
+            <test name="testtime_input_facet"/>
+            <toolset name="sun-5.8"/>
+            <note author="J. Garland">
+               The sun 5.8 compiler and standard library have a problem with 
+               the classic facet which causes some of the io tests for date-time
+               to fail.  Overall this should not affect most uses of the library.
+            </note>
+        </mark-expected-failures>
+
+        <mark-expected-failures>
+            <test name="testdate_facet_new"/>
+            <test name="testdate_facet_new_dll"/>
+            <test name="testtime_facet"/>
+            <toolset name="msvc-8.0_stlport5"/>
+            <note author="J. Garland">
+               The STLPort standard library has issues with the handling
+               of the classic facet which causes some fo the i/o tests
+               for date-time to fail.  Overall this should not affect 
+               most uses of the library.
+            </note>
+        </mark-expected-failures>
+
+
+        <mark-expected-failures>
+            <test name="testgreg_wstream"/>
+            <test name="testtime_facet"/>
+            <test name="testtime_input_facet"/>
+            <test name="testtime_wstream"/>
+            <toolset name="msvc-7.1_stlport4"/>
+            <note author="J. Garland">
+               MSVC 7.1 with its standard library passes all date-time tests.
+               For some reason when paired with stlport a few widestream
+               io tests do not format output correctly.   Overall this should 
+               not affect most uses of the library.
+            </note>
+        </mark-expected-failures>
+
+        <mark-expected-failures>
             <test name="testlocal_time_input_facet"/>
             <test name="testtime_input_facet"/>
-            <toolset name="cw-9_4"/>
             <toolset name="cw-9.4"/>
-            <toolset name="cw-9_5*"/>
+            <toolset name="cw-9.5*"/>
             <note author="J. Garland">
                  Although these tests compile, the execution aborts for
                  an unknown reason. Note that sometimes the excution is
@@ -1042,8 +1001,7 @@
             <test name="testlocal_time"/>
             <test name="testlocal_time_input_facet"/>
             <test name="testtime_input_facet"/>
-            <toolset name="vc-8_0*"/>
-        <toolset name="msvc-8.0*"/>
+            <toolset name="msvc-8.0*"/>
             <note author="J. Garland">
                These tests are failing with the beta2 version of VC_8.  At least
                one of them is directly a result of the new VC_8 standard library
@@ -1069,14 +1027,25 @@
             <test name="testfacet_dll"/>
             <toolset name="tru64cxx*"/>
             <toolset name="hp_cxx*"/>
+            <toolset name="acc"/>
             <note author="Markus Schoepflin">
             The failure is caused by a standard library bug. It doesn't
-            support used defined facets which are not default
+            support user defined facets which are not default
             constructible. This has been reported to the compiler vendor.
             </note>
         </mark-expected-failures>
 
         <mark-expected-failures>
+            <test name="testtime_wstream"/>
+            <toolset name="hp_cxx-65*"/>
+            <note author="Jeff Garland">
+            The failure is caused by a standard library bug. It doesn't
+            support user defined facets which are not default
+            constructible. This has been reported to the compiler vendor.
+            </note>
+        </mark-expected-failures>
+
+        <mark-expected-failures>
             <test name="testgreg_wstream"/>
             <test name="testparse_date"/>
             <test name="teststreams"/>
@@ -1107,13 +1076,29 @@
 
     <!-- dynamic_bitset -->
     <library name="dynamic_bitset">
+        <test name="dyn_bitset_unit_tests1">
+            <mark-failure>
+                <toolset name="msvc-6.5_stlport4"/>
+                <note author="Gennaro Prota" refid="37" />
+            </mark-failure>
+        </test>
+        <test name="dyn_bitset_unit_test2">
+            <mark-failure>
+                <toolset name="borland-5.8.2"/>
+                <note author="Roland Schwarz">
+                    The exact reason of this (linker related) bug is unresearched. The test passes
+                    on some environments. The test was found to fail on a platform whit a german
+                    version of the compiler.
+                </note>
+            </mark-failure>
+        </test>
         <test name="dyn_bitset_unit_tests4">
             <mark-failure>
-                <toolset name="cw-9_3"/>
+                <toolset name="cw-9.3"/>
                 <note author="Aleksey Gurtovoy" refid="2"/>
             </mark-failure>
             <mark-failure>
-                <toolset name="cw-9_3-darwin"/>
+                <toolset name="cw-9.3-darwin"/>
                 <note author="Douglas Gregor" refid="2"/>
             </mark-failure>
             <mark-failure>
@@ -1135,40 +1120,55 @@
             </note>
         </mark-unusable>
         <mark-unusable>
-            <toolset name="cw-8_3"/>
+            <toolset name="cw-8.3"/>
             <note author="Beman Dawes">
                 Due to standard library bugs, this version is not supported.
                 More recent version of the library should work OK.
             </note>
         </mark-unusable>
         <mark-expected-failures>
+          <test name="fstream_test"/>
+          <toolset name="msvc-6.5*"/>
+          <note author="Beman Dawes">
+              fstream for this compiler has serious problems and is not supported
+          </note>
+        </mark-expected-failures>
+        <mark-expected-failures>
           <test name="operations_test_dll"/>
           <test name="path_test_dll"/>
-          <toolset name="borland-5_6_4"/>
           <toolset name="borland-5.6.4"/>
-          <toolset name="mingw-3_4_2"/>
-          <note author="Beman Dawes" refid="35"/>
+          <toolset name="borland-5.8.2"/>
+          <toolset name="gcc-3.4.2_mingw"/>
+          <toolset name="gcc-3.4.2_mingw"/>
+          <note author="Beman Dawes" refid="35"/> <!-- dll's don't work - use static -->
         </mark-expected-failures>
         <mark-expected-failures>
+          <test name="operations_test"/>
+          <test name="operations_test_dll"/>
+            <toolset name="msvc-6.5*"/>
+          <note author="Beman Dawes" refid="31"/> <!-- esoteric features don't work -->
+        </mark-expected-failures>
+        <mark-expected-failures>
           <test name="mbcopy"/>
           <test name="mbpath"/>
           <test name="wide_test"/>
-          <toolset name="mingw-3_4_2"/>
-          <toolset name="mingw-3_4_5"/>
+          <toolset name="gcc-3.4.2_mingw"/>
+          <toolset name="gcc-3.4.5_mingw"/>
+          <toolset name="gcc-mingw-3.4.5"/>
+          <toolset name="gcc-mingw-3.4.2"/>
+          <toolset name="gcc-cygwin-3.4.4"/>
           <note author="Beman Dawes" refid="19"/> <!-- no wchar_t, wstring support -->
         </mark-expected-failures>
         <mark-expected-failures>
           <test name="mbcopy"/>
           <test name="mbpath"/>
           <test name="wide_test"/>
-            <toolset name="msvc*"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
-            <toolset name="borland-5_6_4"/>
+            <toolset name="msvc-7.0"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="cw-8_3"/>
+            <toolset name="borland-5.8.1"/>
+            <toolset name="borland-5.8.2"/>
+            <toolset name="cw-8.3"/>
             <toolset name="dmc-8_4_7*"/>
           <note author="Beman Dawes">
               The library does not support wide paths on this compiler because
@@ -1179,9 +1179,18 @@
           <test name="mbcopy"/>
           <test name="mbpath"/>
           <test name="wide_test"/>
-          <toolset name="qcc-3.3.5-gpp"/>
+          <toolset name="qcc-3.3.5_gpp"/>
           <note author="Jim Douglas" refid="36"/>
         </mark-expected-failures>
+        <mark-expected-failures>
+          <test name="mbcopy"/>
+          <test name="wide_test"/>
+          <toolset name="sun-5.8"/>
+           <note author="John Maddock">
+              These failures are reported to be fixed in Sun's 
+              next compiler release.
+           </note>
+        </mark-expected-failures>
       </library>
 
     <!-- foreach -->
@@ -1197,30 +1206,24 @@
 
         <mark-expected-failures>
             <test name="rvalue_const"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
-            <toolset name="borland-5_6_4"/>
+            <toolset name="msvc-7.0"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="gcc-2*"/>
             <toolset name="gcc-3.2*"/>
             <toolset name="gcc-3_3-darwin"/>
             <toolset name="intel-linux"/>
             <toolset name="vacpp"/>
-            <toolset name="cw-8_3"/>
-            <toolset name="cw-9_4"/>
+            <toolset name="cw-8.3"/>
             <toolset name="cw-9.4"/>
-            <toolset name="cw-9_5-darwin"/>
+            <toolset name="cw-9.5-darwin"/>
             <toolset name="sunpro*"/>
             <toolset name="mingw"/>
             <toolset name="tru64cxx*"/>
             <toolset name="hp_cxx*"/>
             <toolset name="intel-win32-8_1"/>
+            <toolset name="sun-5.8"/>
             <note author="Eric Niebler">
                 This compiler does not support detection of
                 const rvalues.
@@ -1228,19 +1231,14 @@
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="rvalue_nonconst"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
-            <toolset name="borland-5_6_4"/>
+            <toolset name="msvc-7.0"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="tru64cxx*"/>
             <toolset name="hp_cxx*"/>
             <toolset name="sunpro*"/>
+            <toolset name="sun-5.8"/>
             <note author="Eric Niebler">
                 This compiler does not support detection of
                 rvalues.
@@ -1250,6 +1248,7 @@
             <test name="dependent_type"/>
             <toolset name="gcc-2.95.3*"/>
             <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <note author="Eric Niebler">
                 These compilers cannot handle BOOST_FOREACH
                 in a template, where the collection type
@@ -1258,16 +1257,24 @@
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="user_defined"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0*"/>
+            <toolset name="msvc-7.0*"/>
             <note author="Eric Niebler">
                 This failure is because the Boost.Range extension
                 mechanism is broken on these compilers. It requires
                 ADL which these compilers do not support.
             </note>
         </mark-expected-failures>
+        <mark-expected-failures>
+            <test name="noncopyable"/>
+            <toolset name="sun-5.8"/>
+            <note author="Eric Niebler">
+                is_base_and_derived&lt;&gt; is broken on this compiler, but
+                the problem can be worked around by specializing
+                boost::foreach::is_noncopyable&lt;&gt; for collection
+                types that are noncopyable.
+            </note>
+        </mark-expected-failures>
     </library>
 
     <!-- format -->
@@ -1287,6 +1294,7 @@
             <test name="format_test2"/>
             <test name="format_test3"/>
             <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <note author="Markus Schoepflin" refid="33"/>
         </mark-expected-failures>
     </library>
@@ -1295,10 +1303,7 @@
     <library name="functional/hash">
         <mark-expected-failures>
             <test name="hash_value_array_test"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
             <toolset name="msvc-7.0*"/>
             <note author="Daniel James">
               hash_value is not overloaded for arrays for older versions
@@ -1310,10 +1315,7 @@
 
         <mark-expected-failures>
             <test name="hash_function_pointer_test"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
             <toolset name="msvc-7.0*"/>
             <note refid="2" author="Daniel James"/>
         </mark-expected-failures>
@@ -1337,10 +1339,7 @@
         <mark-expected-failures>
             <test name="point" />
             <test name="books" />
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
             <toolset name="msvc-7.0*"/>
             <note author="Daniel James">
                 These examples only work on compilers with support for ADL.
@@ -1351,12 +1350,8 @@
 
         <mark-expected-failures>
             <test name="point" />
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <note author="Daniel James">
                 It appears that Borland doesn't find friend functions defined
                 in a class by ADL. This is easily fixed but this example is
@@ -1367,12 +1362,8 @@
 
         <mark-expected-failures>
             <test name="hash_global_namespace_test" />
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <note author="Daniel James">
                 The test demonstrates a Borland bug - functions that aren't
                 in a namespace don't appear to be found by ADL.
@@ -1383,42 +1374,48 @@
     <!-- graph -->
     <library name="graph">
         <mark-unusable>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="msvc-6.5*"/>
             <toolset name="sunpro-5_3-sunos"/>
         </mark-unusable>
         <mark-expected-failures>
             <test name="adj_matrix_cc"/>
             <test name="biconnected_components_test"/>
+            <test name="bidir_remove_edge"/>
             <test name="bfs_cc"/>
             <test name="bundled_properties"/>
+            <test name="csr_graph_test"/>
             <test name="dfs_cc"/>
             <test name="dijkstra_cc"/>
+            <test name="dominator_tree_test"/>
             <test name="floyd_warshall_test"/>
             <test name="gursoy_atun_layout_test"/>
             <test name="graphviz_test"/>
+            <test name="matching_test"/>
+            <test name="serialize"/>
             <test name="subgraph"/>
             <test name="transitive_closure_test"/>
             <test name="vector_graph_cc"/>
-            <toolset name="vc-7_0"/>
-            <note refid="3" author="D. Gregor"/>
+            <toolset name="msvc-7.0"/>
+            <note refid="3" author="Doug Gregor"/>
         </mark-expected-failures>
         <mark-expected-failures>
           <test name="graphviz_test"/>
           <toolset name="vc-8_0"/>
-          <note refid="1" author="D. Gregor"/>
+          <toolset name="msvc-8_0"/>
+          <toolset name="intel-vc71-win-9.1"/>
+          <note refid="1" author="Doug Gregor"/>
         </mark-expected-failures>
         <mark-expected-failures>
+          <test name="serialize"/>
+          <toolset name="sun-5.8"/>
+          <note refid="2" author="Doug Gregor"/>
+        </mark-expected-failures>
+        <mark-expected-failures>
             <test name="betweenness_centrality_test"/>
             <toolset name="iw-7_1-vc6*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note refid="3" author="Aleksey Gurtovoy"/>
         </mark-expected-failures>
         <mark-expected-failures>
@@ -1427,12 +1424,10 @@
           <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
           <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
           <toolset name="como-4_3_3-vc7_1"/>
-          <toolset name="cw-8_3"/>
-          <toolset name="cw-9_3-darwin"/>
-          <toolset name="cw-9_4-darwin"/>
-          <toolset name="cw-9_4"/>
-          <toolset name="cw-9_4-darwin"/>
-          <toolset name="cw-9_5-darwin"/>
+          <toolset name="cw-8.3"/>
+          <toolset name="cw-9.3-darwin"/>
+          <toolset name="cw-9.4-darwin"/>
+          <toolset name="cw-9.5-darwin"/>
           <toolset name="iw-7_1-vc6"/>
           <toolset name="iw-7_1-vc6-stlp-4_5_3"/>
           <note refid="3" author="Doug Gregor"/>
@@ -1442,12 +1437,21 @@
           <toolset name="gcc-2.95.3-linux"/>
           <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
           <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
+          <note refid="28" author="Vladimir Prus"/>
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="bundled_properties"/>
             <toolset name="qcc-3.3*"/>
             <note author="Jim Douglas" date="18 Feb 06" refid="27"/>
         </mark-expected-failures>
+        <mark-expected-failures>
+            <test name="csr_graph_test"/>
+            <toolset name="msvc-8.0"/>
+            <note author="Doug Gregor">
+              This failure is due to a problem with partial ordering
+              of class template partial specializations.
+            </note>
+        </mark-expected-failures>
     </library>
 
 
@@ -1455,11 +1459,9 @@
     <library name="io">
         <mark-expected-failures>
             <test name="ios_state_unit_test"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
+            <toolset name="borland-5.8.2"/>
             <toolset name="iw-7_1-vc6*"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
             <note refid="4" author="Aleksey Gurtovoy"/>
         </mark-expected-failures>
@@ -1467,6 +1469,7 @@
             <test name="ios_state_test"/>
             <test name="ios_state_unit_test"/>
             <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <note refid="34" author="Markus Schoepflin"/>
         </mark-expected-failures>
         <mark-expected-failures>
@@ -1474,11 +1477,13 @@
             <toolset name="gcc-2.95.3-*"/>
             <note refid="3" author="Doug Gregor"/>
         </mark-expected-failures>
-        <mark-expected-failures>
-            <test name="ios_state_unit_test"/>
-            <toolset name="intel-win32-8*"/>
-            <note refid="3" author="Stefan Slapeta"/>
-        </mark-expected-failures>
+       <mark-expected-failures>
+          <test name="ios_state_unit_test"/>
+          <toolset name="gcc-4.1.0*"/>
+          <note author="John Maddock">
+             This is gcc bug 26526, and is fixed in later releases.
+          </note>
+       </mark-expected-failures>
     </library>
 
     <!-- iostreams -->
@@ -1489,27 +1494,36 @@
             <note author="Jonathan Turkanis" refid="17"/>
         </mark-unusable>
         <mark-expected-failures>
+            <!-- STLPort bug -->
             <test name="seekable_file_test"/>
-            <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
-            <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
             <toolset name="iw-7_1-vc6-stlp-4_5_3"/>
-            <toolset name="msvc-stlport"/>
-            <toolset name="vc-6_5-stlport"/>
             <toolset name="*como-4_3_3*"/>
+            <toolset name="*stlport"/>
             <note author="Jonathan Turkanis" refid="4"/>
         </mark-expected-failures>
         <mark-expected-failures>
+            <!-- Insufficient wide character support -->
             <test name="code_converter_test"/>
             <test name="wide_stream_test"/>
             <toolset name="gcc-2.95.3-linux"/>
-            <toolset name="*mingw*"/>
+            <!-- Must enumerate MinGW's since some use STLPort -->
+            <toolset name="gcc-3.4.2_mingw"/>
+            <toolset name="mingw-3_4_4"/>
+            <toolset name="gcc-3.4.5_mingw"/>
+            <toolset name="gcc-3.4.5_mingw"/>
             <toolset name="*cygwin*"/>
             <toolset name="gcc-3.3.6-osf1"/>
             <note author="Jonathan Turkanis" refid="19"/>
         </mark-expected-failures>
         <mark-expected-failures>
+            <!-- Insufficient wide character support -->
+            <test name="code_converter_test"/>
+            <test name="wide_stream_test"/>
+            <toolset name="qcc-3.3.5*gpp"/>
+            <note author="Jim Douglas" date="12 Feb 06" refid="36"/>
+        </mark-expected-failures>
+        <mark-expected-failures>
             <test name="bzip2_test"/>
             <test name="file_descriptor_test"/>
             <test name="mapped_file_test"/>
@@ -1532,13 +1546,6 @@
             <toolset name="*como-4_3_3*"/>
             <note author="Jonathan Turkanis" refid="0"/>
         </mark-expected-failures>
-        <!--
-        <mark-expected-failures>
-            <test name="mapped_file_test"/>
-            <toolset name="intel-win32-9_0"/>
-            <note author="Jonathan Turkanis" refid="0"/>
-        </mark-expected-failures>
-        -->
         <mark-expected-failures reason="?">
             <test name="direct_adapter_test"/>
             <test name="gzip_test"/>
@@ -1552,23 +1559,23 @@
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="finite_state_filter_test"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <toolset name="gcc-2.95.3*"/>
             <note author="Jonathan Turkanis" refid="2"/>
         </mark-expected-failures>
-
         <mark-expected-failures>
-            <test name="code_converter_test"/>
-            <test name="wide_stream_test"/>
-            <toolset name="qcc-3.3.5-gpp"/>
-            <note author="Jim Douglas" date="12 Feb 06" refid="36"/>
+          <test name="finite_state_filter_test"/>
+          <toolset name="cw-9.4"/>
+          <note author="Jonathan Turkanis" date="20 Dec 06">
+            I'm not sure whether CodeWarrior is correct to report that the member 
+            in question is inaccessible; however, when the member is made public
+            an internal error occur that I have not been able to fix, so for
+            now the question is moot.
+          </note>
         </mark-expected-failures>
-
         <mark-expected-failures>
             <test name="mapped_file_test"/>
             <toolset name="qcc-3.3*"/>
@@ -1576,8 +1583,23 @@
                 Memory mapped files are not supported in QNX Neutrino version 6.3.0.
             </note>
         </mark-expected-failures>
-
         <mark-expected-failures>
+            <test name="compose_test"/>
+            <toolset name="borland-5.6.4"/>
+            <note author="Jonathan Turkanis">
+				Fails to compile on some installations but not others; may 
+            	depend on which compiler updates have been installed
+            </note>
+        </mark-expected-failures>
+        <mark-expected-failures>
+            <test name="compose_test"/>
+            <toolset name="msvc-6.5_stlport4"/>
+            <note author="Jonathan Turkanis">
+				These six tests pass individually but cause a compiler stack overflow
+            	when compiled as a group
+            </note>
+        </mark-expected-failures>
+        <mark-expected-failures>
             <test name="bzip2_test"/>
             <toolset name="gcc-3.4.3_sunos"/>
             <note author="Caleb Epstein">
@@ -1590,25 +1612,18 @@
     <!-- lambda -->
     <library name="lambda">
         <mark-unusable>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="borland"/>
-            <toolset name="borland-5_5_1"/>
-            <toolset name="borland-5_6_4"/>
+            <toolset name="borland-5.5.1"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="borland-5.8*"/>
+            <toolset name="msvc-7.0"/>
             <toolset name="sunpro-5_3-sunos"/>
             <note refid="17">
             </note>
         </mark-unusable>
         <mark-expected-failures>
             <test name="bll_and_function"/>
-            <toolset name="vc-8_0"/>
+            <toolset name="msvc-8.0"/>
             <note author="Aleksey Gurtovoy" refid="6"/>
         </mark-expected-failures>
         <mark-expected-failures>
@@ -1622,11 +1637,11 @@
     <library name="logic">
       <test name="tribool_io_test">
         <mark-failure>
-          <toolset name="msvc-stlport"/>
-          <toolset name="vc-6_5-stlport"/>
+          <toolset name="msvc-6.5_stlport4"/>
           <toolset name="gcc-2.95.3-linux"/>
           <toolset name="sunpro-5_3-sunos"/>
-          <toolset name="tru64cxx65-042"/>
+          <toolset name="tru64cxx65*"/>
+          <toolset name="hp_cxx-65*"/>
           <note author="Douglas Gregor" refid="4"/>
         </mark-failure>
       </test>
@@ -1650,7 +1665,7 @@
             <test name="has_xxx"/>
             <test name="no_has_xxx"/>
             <test name="single_view"/>
-            <toolset name="cw-8_3*"/>
+            <toolset name="cw-8.3*"/>
             <note author="Aleksey Gurtovoy" date="17 Sep 2004">
                 This failure is caused by a deficient SFINAE implementation; the bug
                 was fixed in the next major compiler version (CodeWarrior 9.x).
@@ -1661,12 +1676,8 @@
             <test name="is_sequence"/>
             <test name="as_sequence"/>
             <test name="has_xxx"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="gcc-2.95.3*"/>
             <note author="Aleksey Gurtovoy" date="17 Sep 2004">
                 This failure is caused by a deficient SFINAE implementation.
@@ -1703,7 +1714,6 @@
             <test name="vector"/>
             <test name="vector_c"/>
 
-            <toolset name="borland-5_8_1"/>
             <toolset name="borland-5.8.1"/>
 
             <note author="A. Meredith" date="17 May 2006">
@@ -1716,12 +1726,8 @@
             <test name="multiset"/>
             <test name="zip_view"/>
 
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <note author="Aleksey Gurtovoy" date="17 Sep 2004" refid="26"/>
         </mark-expected-failures>
 
@@ -1741,14 +1747,8 @@
 
         <mark-expected-failures>
             <test name="quote"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="msvc-6.5*"/>
             <toolset name="mipspro"/>
             <note author="Aleksey Gurtovoy" date="17 Sep 2004">
@@ -1761,12 +1761,8 @@
             <test name="map"/>
             <test name="set"/>
             <test name="set_c"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="gcc-2.95.3*"/>
             <toolset name="mipspro"/>
             <note author="Aleksey Gurtovoy" date="17 Sep 2004">
@@ -1777,29 +1773,42 @@
 
         <mark-expected-failures>
             <test name="map"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="Aleksey Gurtovoy" date="17 Sep 2004">
                 This is an advanced functionality that hasn't been ported to the deficient
                 compilers (yet). Patches are welcome!
             </note>
         </mark-expected-failures>
 
+        <mark-expected-failures>
+            <test name="apply"/>
+            <toolset name="gcc-4.1.0*"/>
+            <toolset name="gcc-4.1.1*"/>
+            <note author="Caleb Epstein">
+              This is a regression in the gcc 4.1 series that will be
+              fixed in gcc 4.1.2.  See <a
+              href="http://gcc.gnu.org/bugzilla/show_bug.cgi?id=28088">bug
+              #28088</a> for details.
+            </note>
+        </mark-expected-failures>
+       <mark-expected-failures>
+          <test name="vector_c"/>
+          <toolset name="sun-5.8"/>
+          <note author="John Maddock">
+             This is reported to be fixed in the next Sun
+             compiler release.
+          </note>
+       </mark-expected-failures>
+
     </library>
 
     <!-- multi_array -->
     <library name="multi_array">
         <mark-unusable>
-            <toolset name="borland"/>
-            <toolset name="borland-5_5_1"/>
-            <toolset name="borland-5_6_4"/>
+            <toolset name="borland-5.5.1"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <note author="Alisdair Meredith" date="30 Jan 2004">
                 <p>
                 This library has never worked [on Borland 5.5.1 and 5.6.4], and the only tests
@@ -1824,8 +1833,6 @@
         </mark-unusable> -->
         <test name="constructors">
             <mark-failure>
-               <toolset name="msvc"/>
-               <toolset name="vc-6_5"/>
                <toolset name="msvc-6.5"/>
                <note author="Ronald Garcia" date="13 Jul 2004">
                   Known error in MSVC. see
@@ -1857,15 +1864,11 @@
     <!-- multi_index -->
     <library name="multi_index">
         <mark-unusable>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
             <note author="J. L&#243;pez" date="05 Jul 2004" refid="17"/>
         </mark-unusable>
         <mark-unusable>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <note author="Alisdair Meredith" date="26 May 2006"/>
         </mark-unusable>
         <mark-unusable>
@@ -1892,12 +1895,13 @@
         <mark-unusable>
             <toolset name="dmc-8_43-stlport-4_5_3"/>
             <toolset name="dmc-8_44b-stlport-4_5_3"/>
+            <toolset name="dmc-8_47-stlport-4_5_3"/>
             <note author="J. L&#243;pez" date="03 Jun 2005" refid="17"/>
         </mark-unusable>
         <mark-expected-failures>
             <test name="test_serialization"/>
             <toolset name="msvc-stlport"/>
-            <toolset name="vc-6_5-stlport"/>
+            <toolset name="msvc-6.5_stlport4"/>
             <note author="J. L&#243;pez" date="10 Jan 2005">
               This error shows when using the dynamic version of the STLport
               library. The problem is reportedly fixed in STLport 5.0 (in beta
@@ -1914,7 +1918,8 @@
         <mark-expected-failures>
             <test name="test_serialization"/>
             <toolset name="tru64cxx71-006"/>
-            <toolset name="hp_cxx-71_006_tru64"/>
+            <toolset name="hp_cxx-65*"/>
+            <toolset name="hp_cxx-71*"/>
             <note author="J. L&#243;pez" date="16 Mar 2006">
               This test fails due to limitations of the template
               instantiation model used in the testing environment
@@ -1930,20 +1935,14 @@
     <library name="optional">
         <mark-expected-failures>
             <test name="optional_test_ref"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="Aleksey Gurtovoy" refid="3"/>
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="optional_test_ref_fail1"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <note author="Fernando Cacciola" refid="2"/>
         </mark-expected-failures>
         <mark-expected-failures>
@@ -1969,11 +1968,30 @@
     <library name="preprocessor">
         <mark-expected-failures>
             <test name="seq"/>
-            <toolset name="cw-8_3"/>
+            <toolset name="cw-8.3"/>
             <note author="Paul Mensonides" refid="2"/>
         </mark-expected-failures>
     </library>
 
+    <!-- rational -->
+    <library name="rational">
+        <mark-expected-failures>
+            <test name="rational_test"/>
+            <toolset name="sun-5.8"/>
+            <note author="J. L&#243;pez" date="19 Oct 2006">
+              The test is exposing the following known error of Sun Studio 11:
+              overload resolution fails if
+              a) some class has a conversion operator to a reference to
+              a built-in type, and
+              b) overload resolution involves a user-defined operator as well
+              as a built-in operator, and
+              c) the built-in operator takes the result of the conversion
+              mentioned in a) as an operand.
+              A fix will be reportedly included in patch no 6 of Sun Studio 11.
+            </note>
+        </mark-expected-failures>
+    </library>
+
     <!-- serialization -->
     <library name="serialization">
         <mark-unusable>
@@ -1990,17 +2008,18 @@
 
         <mark-expected-failures>
             <test name="*_warchive"/>
+            <test name="*_warchive_dll"/>
             <test name="test_codecvt_null"/>
             <test name="test_utf8_codecvt"/>
             <toolset name="mingw*"/>
+            <toolset name="*mingw*"/>
+            <toolset name="*cygwin*"/>
             <toolset name="gcc-2.95.3-linux"/>
-            <note author="Robert Ramey" date="12 Feb 05" refid="19"/>
+            <note author="Robert Ramey,Roland Schwarz" date="16 Feb 07" refid="19"/>
         </mark-expected-failures>
 
         <mark-expected-failures>
             <test name="test_void_cast*"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
             <note author="Robert Ramey" date="20 Sep 2004" refid="16,29"/>
         </mark-expected-failures>
@@ -2014,33 +2033,19 @@
         </mark-expected-failures>
 
         <mark-expected-failures>
-             <test name="test_demo_portable_archive_dll"/>
-             <toolset name="vc*"/>
-             <toolset name="borland-5_6_4"/>
-             <toolset name="borland-5.6.4"/>
-             <toolset name="msvc"/>
-             <toolset name="vc-6_5*"/>
-             <toolset name="msvc-6.5*"/>
-             <toolset name="iw*"/>
-             <toolset name="intel-win32-*"/>
-             <note author="Robert Ramey" date="12 Feb 05" refid="2,29"/>
-        </mark-expected-failures>
-
-        <mark-expected-failures>
              <test name="test_reset_object_address*"/>
-             <toolset name="msvc"/>
-             <toolset name="vc-6_5*"/>
              <toolset name="msvc-6.5*"/>
              <note author="Robert Ramey" date="12 Feb 05" refid="6,29"/>
         </mark-expected-failures>
 
         <mark-expected-failures>
-            <test name="test_array*"/>
-            <test name="test_demo_fast_archive"/>
-            <test name="test_demo_fast_archive_dll"/>
-            <toolset name="borland*"/>
-            <note author="Robert Ramey" date="12 Feb 05" refid="26">
-                Borland compilers don't handle templates with array type arguments properly.
+            <test name="test_reset_object_address*"/>
+            <toolset name="msvc-7.0"/>
+            <note author="J. L&#243;pez" date="20 Dec 2006">
+              This error shows when the code has become too complex for the
+              compiler to handle. The problem has no relationship with the
+              functionality being tested, which in fact does work for
+              MSVC++ 7.0.
             </note>
         </mark-expected-failures>
 
@@ -2055,28 +2060,22 @@
             <test name="test_demo_xml_load"/>
             <test name="test_demo_xml_save_dll"/>
             <test name="test_demo_xml_load_dll"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="Robert Ramey" refid="6"/>
         </mark-expected-failures>
 
         <mark-expected-failures>
             <test name="test_demo_fast_archive"/>
             <test name="test_demo_fast_archive_dll"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
             <note author="Robert Ramey" refid="6"/>
         </mark-expected-failures>
 
         <mark-expected-failures>
             <test name="test_const"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="Aleksey Gurtovoy" refid="29"/>
         </mark-expected-failures>
 
@@ -2086,10 +2085,8 @@
             <test name="test_diamond*"/>
             <test name="test_mult_archive_types"/>
             <test name="test_mult_archive_types_dll"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="Robert Ramey" refid="6">
                 msvc 6 compiler failure.  The facility being tested conflicts the the
                 compiler in a fundamental way and cannnot be worked around.
@@ -2098,8 +2095,6 @@
 
         <mark-expected-failures>
             <test name="test_mi*"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
             <note author="Robert Ramey" refid="6">
                 msvc 6 compiler failure.  The facility being tested conflicts the the
@@ -2110,7 +2105,7 @@
         <mark-expected-failures>
             <test name="*_dll"/>
             <toolset name="msvc-stlport"/>
-            <toolset name="vc-6_5-stlport"/>
+            <toolset name="msvc-6.5_stlport4"/>
             <note author="Robert Ramey">
                 This failure appears when STLPort is built and used as a DLL with msvc 6.
                 STLPort suggests that the next version of STLPort(5.0) will include a workaround
@@ -2150,149 +2145,20 @@
 
         <mark-expected-failures>
             <test name="test_no_rtti_*"/>
-            <test name="test_set_*"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
+            <toolset name="borland-5.8.2"/>
             <note author="Aleksey Gurtovoy" refid="29"/>
         </mark-expected-failures>
 
         <mark-expected-failures>
-            <test name="test_array_binary_archive"/>
-            <test name="test_array_text_*"/>
-            <note author="Aleksey Gurtovoy" refid="29"/>
-        </mark-expected-failures>
-
-        <mark-expected-failures>
             <test name="test_smart_cast"/>
             <toolset name="intel-7.1-linux"/>
             <note author="Aleksey Gurtovoy" refid="29"/>
         </mark-expected-failures>
 
         <mark-expected-failures>
-            <test name="test_array_text_archive_dll"/>
-            <test name="test_array_text_warchive_dll"/>
-            <test name="test_array_xml_archive_dll"/>
-            <test name="test_array_xml_warchive_dll"/>
-            <test name="test_binary_text_archive_dll"/>
-            <test name="test_binary_text_warchive_dll"/>
-            <test name="test_binary_xml_archive_dll"/>
-            <test name="test_binary_xml_warchive_dll"/>
-            <test name="test_class_info_save_text_archive_dll"/>
-            <test name="test_class_info_save_text_warchive_dll"/>
-            <test name="test_class_info_save_xml_warchive_dll"/>
-            <test name="test_contained_class_text_archive_dll"/>
-            <test name="test_contained_class_text_warchive_dll"/>
-            <test name="test_contained_class_xml_archive_dll"/>
-            <test name="test_contained_class_xml_warchive_dll"/>
-            <test name="test_cyclic_ptrs_text_archive_dll"/>
-            <test name="test_cyclic_ptrs_text_warchive_dll"/>
-            <test name="test_cyclic_ptrs_xml_archive_dll"/>
-            <test name="test_cyclic_ptrs_xml_warchive_dll"/>
-            <test name="test_delete_pointer_text_archive_dll"/>
-            <test name="test_delete_pointer_text_warchive_dll"/>
-            <test name="test_delete_pointer_xml_archive_dll"/>
-            <test name="test_delete_pointer_xml_warchive_dll"/>
-            <test name="test_demo_auto_ptr_dll"/>
-            <test name="test_demo_dll"/>
-            <test name="test_demo_exception_dll"/>
-            <test name="test_demo_pimpl_dll"/>
-            <test name="test_demo_polymorphic_dll"/>
-            <test name="test_deque_text_archive_dll"/>
-            <test name="test_deque_text_warchive_dll"/>
-            <test name="test_deque_xml_archive_dll"/>
-            <test name="test_deque_xml_warchive_dll"/>
-            <test name="test_derived_class_ptr_text_archive_dll"/>
-            <test name="test_derived_class_ptr_text_warchive_dll"/>
-            <test name="test_derived_class_ptr_xml_archive_dll"/>
-            <test name="test_derived_class_ptr_xml_warchive_dll"/>
-            <test name="test_derived_class_text_archive_dll"/>
-            <test name="test_derived_class_text_warchive_dll"/>
-            <test name="test_derived_class_xml_archive_dll"/>
-            <test name="test_derived_class_xml_warchive_dll"/>
-            <test name="test_derived_text_archive_dll"/>
-            <test name="test_derived_text_warchive_dll"/>
-            <test name="test_derived_xml_warchive_dll"/>
-            <test name="test_list_ptrs_text_archive_dll"/>
-            <test name="test_list_ptrs_text_warchive_dll"/>
-            <test name="test_list_ptrs_xml_archive_dll"/>
-            <test name="test_list_ptrs_xml_warchive_dll"/>
-            <test name="test_list_text_archive_dll"/>
-            <test name="test_list_text_warchive_dll"/>
-            <test name="test_list_xml_archive_dll"/>
-            <test name="test_list_xml_warchive_dll"/>
-            <test name="test_map_text_archive_dll"/>
-            <test name="test_map_text_warchive_dll"/>
-            <test name="test_map_xml_archive_dll"/>
-            <test name="test_map_xml_warchive_dll"/>
-            <test name="test_multiple_ptrs_text_archive_dll"/>
-            <test name="test_multiple_ptrs_text_warchive_dll"/>
-            <test name="test_multiple_ptrs_xml_archive_dll"/>
-            <test name="test_multiple_ptrs_xml_warchive_dll"/>
-            <test name="test_non_default_ctor_text_archive_dll"/>
-            <test name="test_non_default_ctor_text_warchive_dll"/>
-            <test name="test_non_default_ctor_xml_archive_dll"/>
-            <test name="test_non_default_ctor_xml_warchive_dll"/>
-            <test name="test_non_intrusive_ctor_text_archive_dll"/>
-            <test name="test_non_intrusive_ctor_text_warchive_dll"/>
-            <test name="test_non_intrusive_ctor_xml_archive_dll"/>
-            <test name="test_non_intrusive_ctor_xml_warchive_dll"/>
-            <test name="test_non_intrusive_text_archive_dll"/>
-            <test name="test_non_intrusive_text_warchive_dll"/>
-            <test name="test_non_intrusive_xml_archive_dll"/>
-            <test name="test_non_intrusive_xml_warchive_dll"/>
-            <test name="test_null_ptr_text_archive_dll"/>
-            <test name="test_null_ptr_text_warchive_dll"/>
-            <test name="test_null_ptr_xml_archive_dll"/>
-            <test name="test_null_ptr_xml_warchive_dll"/>
-            <test name="test_nvp_text_archive_dll"/>
-            <test name="test_nvp_text_warchive_dll"/>
-            <test name="test_nvp_xml_archive_dll"/>
-            <test name="test_nvp_xml_warchive_dll"/>
-            <test name="test_object_text_warchive_dll"/>
-            <test name="test_object_xml_warchive_dll"/>
-            <test name="test_optional_text_archive_dll"/>
-            <test name="test_optional_text_warchive_dll"/>
-            <test name="test_optional_xml_archive_dll"/>
-            <test name="test_optional_xml_warchive_dll"/>
-            <test name="test_polymorphic_text_archive_dll"/>
-            <test name="test_polymorphic_text_warchive_dll"/>
-            <test name="test_polymorphic_xml_archive_dll"/>
-            <test name="test_polymorphic_xml_warchive_dll"/>
-            <test name="test_primitive_text_warchive_dll"/>
-            <test name="test_primitive_xml_warchive_dll"/>
-            <test name="test_private_ctor_dll"/>
-            <test name="test_recursion_text_archive_dll"/>
-            <test name="test_recursion_text_warchive_dll"/>
-            <test name="test_recursion_xml_archive_dll"/>
-            <test name="test_recursion_xml_warchive_dll"/>
-            <test name="test_reset_object_address_dll"/>
-            <test name="test_set_text_archive_dll"/>
-            <test name="test_set_text_warchive_dll"/>
-            <test name="test_set_xml_archive_dll"/>
-            <test name="test_set_xml_warchive_dll"/>
-            <test name="test_simple_class_ptr_text_archive_dll"/>
-            <test name="test_simple_class_ptr_text_warchive_dll"/>
-            <test name="test_simple_class_ptr_xml_archive_dll"/>
-            <test name="test_simple_class_ptr_xml_warchive_dll"/>
-            <test name="test_simple_class_text_archive_dll"/>
-            <test name="test_simple_class_text_warchive_dll"/>
-            <test name="test_simple_class_xml_archive_dll"/>
-            <test name="test_simple_class_xml_warchive_dll"/>
-            <test name="test_split_text_archive_dll"/>
-            <test name="test_split_text_warchive_dll"/>
-            <test name="test_split_xml_warchive_dll"/>
-            <test name="test_tracking_text_archive_dll"/>
-            <test name="test_tracking_text_warchive_dll"/>
-            <test name="test_tracking_xml_warchive_dll"/>
-            <test name="test_variant_text_archive_dll"/>
-            <test name="test_variant_text_warchive_dll"/>
-            <test name="test_variant_xml_archive_dll"/>
-            <test name="test_variant_xml_warchive_dll"/>
-            <test name="test_vector_text_archive_dll"/>
-            <test name="test_vector_text_warchive_dll"/>
-            <test name="test_vector_xml_archive_dll"/>
-            <test name="test_vector_xml_warchive_dll"/>
-            <toolset name="cw-9_5-darwin"/>
+            <test name="*_dll"/>
+            <toolset name="cw*"/>
             <note author="Doug Gregor" refid="35"/>
         </mark-expected-failures>
 
@@ -2311,7 +2177,7 @@
         <mark-expected-failures>
             <test name="test_diamond*"/>
             <toolset name="cw-8*"/>
-            <toolset name="cw-9_5-darwin"/>
+            <toolset name="cw-9.5-darwin"/>
             <note author="Rene Rivera">
                 The CW compilers have problems with the static construction idiom used to
                 implement the type registration in the Boost.Serialization library. In many
@@ -2325,13 +2191,12 @@
         <mark-expected-failures>
             <test name="test_class_info_load_text*"/>
             <test name="test_class_info_load_xml_warchive*"/>
-            <toolset name="cw-9_5-darwin"/>
+            <toolset name="cw-9.5-darwin"/>
             <note author="Rene Rivera" refid="29"/>
         </mark-expected-failures>
 
         <mark-expected-failures>
             <test name="test_class_info_load_text_warchive_dll"/>
-            <toolset name="vc-6_5"/>
             <toolset name="msvc-6.5"/>
             <note author="Doug Gregor" refid="29"/>
         </mark-expected-failures>
@@ -2341,8 +2206,8 @@
             <test name="test_const_load_fail1_nvp"/>
             <test name="test_const_load_fail2"/>
             <test name="test_const_load_fail2_nvp"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
+            <toolset name="borland-5.8.2"/>
             <note author="Doug Gregor" refid="29"/>
         </mark-expected-failures>
 
@@ -2350,10 +2215,9 @@
             <test name="test_const_save_fail1"/>
             <test name="test_const_save_fail2"/>
             <test name="test_const_save_fail3"/>
-            <toolset name="vc-6_5"/>
             <toolset name="msvc-6.5"/>
-            <toolset name="vc-6_5-stlport"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-6.5_stlport4"/>
+            <toolset name="msvc-7.0"/>
             <note author="Doug Gregor" refid="29"/>
         </mark-expected-failures>
 
@@ -2361,31 +2225,15 @@
             <test name="test_map_binary_archive_dll"/>
             <test name="test_map_text_archive_dll"/>
             <test name="test_map_text_warchive_dll"/>
-            <toolset name="vc-6_5"/>
             <toolset name="msvc-6.5"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="Doug Gregor" refid="29"/>
         </mark-expected-failures>
 
         <mark-expected-failures>
-          <test name="test_shared_ptr_132_xml_archive_dll"/>
-          <toolset name="intel-win32-8_1"/>
-          <note author="Doug Gregor" refid="29"/>
-        </mark-expected-failures>
-
-        <mark-expected-failures>
-          <test name="test_demo_dll"/>
-          <test name="test_demo_exception_dll"/>
-          <test name="test_demo_shared_ptr_dll"/>
-          <test name="test_demo_xml_load_dll"/>
-          <test name="test_demo_xml_save_dll"/>
-          <toolset name="intel-win32-8_1"/>
-          <note author="Doug Gregor" refid="35"/>
-        </mark-expected-failures>
-
-        <mark-expected-failures>
             <test name="test_variant_*"/>
             <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <note author="Markus Schoepflin">
                 The variant library is not supported for this compiler version.
                 Therefore serialization of variants doesn't work.
@@ -2395,9 +2243,31 @@
         <mark-expected-failures>
             <test name="*_warchive"/>
             <test name="*_warchive_dll"/>
-            <toolset name="qcc-3.3.5-gpp"/>
+            <toolset name="qcc-3.3.5*gpp"/>
             <note author="Jim Douglas" date="12 Feb 06" refid="36"/>
         </mark-expected-failures>
+	
+	<mark-expected-failures>
+            <test name="test_variant_*"/>
+            <toolset name="borland-5.8.2*"/>
+            <note author="Vladimir Prus">
+                The compiler fails with an error supposedly related to std::fpos&lt;&gt;::_Stz from the
+		&lt;iosfwd&gt; header. It is not known what causes the compiler to instantiate this
+		field and what causes the instantiation to fail.
+            </note>
+        </mark-expected-failures>
+
+        <mark-expected-failures>
+            <test name="test_demo_shared_ptr_dll"/>
+            <toolset name="qcc-3.3.5_gpp"/>
+            <note author="J. L&#243;pez" date="21 Dec 2006">
+              This failure is caused by an unresearched compiler bug; the
+              conditions under which the bug manifests itself seem to be
+              uncommon, however, and the static version of this same test
+              builds and runs correctly.
+            </note>
+        </mark-expected-failures>
+
     </library>
 
 
@@ -2424,13 +2294,13 @@
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="pointer_to_other_test"/>
-            <toolset name="vc-6*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-6.5*"/>
+            <toolset name="msvc-7.0"/>
             <note refid="31" author="Peter Dimov"/>
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="shared_ptr_alloc2_test"/>
-            <toolset name="vc-6*"/>
+            <toolset name="msvc-6.5*"/>
             <note refid="31" author="Peter Dimov"/>
         </mark-expected-failures>
     </library>
@@ -2438,17 +2308,11 @@
     <!-- spirit -->
     <library name="spirit">
         <mark-unusable>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="borland-5_5_1"/>
-            <toolset name="borland-5_6_4"/>
+            <toolset name="borland-5.5.1"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="borland-5.8*"/>
+            <toolset name="msvc-7.0"/>
             <toolset name="gcc-2.95.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
@@ -2526,29 +2390,30 @@
             <toolset name="borland*"/>
             <toolset name="gcc-2.95.*"/>
             <toolset name="sunpro*"/>
-            <toolset name="dmc*"/>
             <note author="Arkadiy Vertleyb">
                 This compiler is not supported.
             </note>
         </mark-unusable>
         <mark-expected-failures>
             <test name="*_native"/>
+            <toolset name="acc"/>
             <toolset name="vc-8_0*"/>
             <toolset name="msvc-8.0*"/>
-            <toolset name="intel-win*"/>
+            <toolset name="intel-vc71-win*"/>
+            <toolset name="intel-vc8-win*"/>
             <toolset name="como-4_3_3-vc7_1"/>
             <toolset name="tru64*"/>
             <toolset name="hp_cxx*"/>
+            <toolset name="sun-5.8"/>
+            <toolset name="dmc*"/>
             <note author="Arkadiy Vertleyb">
                 Native mode is not supported for this compiler.
             </note>
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="*_emulation"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <toolset name="cw-8_*"/>
             <note author="Arkadiy Vertleyb">
                 Emulation mode is not supported for this compiler.
@@ -2557,10 +2422,10 @@
         <mark-expected-failures>
             <test name="function_native"/>
             <test name="template_tpl_native"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
+            <test name="function_binding_native"/>
+            <test name="odr_no_uns"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="Arkadiy Vertleyb">
                 The feature is not supported by this compiler.
             </note>
@@ -2582,17 +2447,13 @@
         </mark-unusable>
         <test name="allocator_test">
             <mark-failure>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note author="B. Dawes" refid="5"/>
             </mark-failure>
         </test>
         <test name="contains_test">
             <mark-failure>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5*"/>
                 <toolset name="msvc-6.5*"/>
                 <note refid="3" author="D. Gregor"/>
             </mark-failure>
@@ -2605,133 +2466,82 @@
         </test>
         <test name="function_arith_cxx98">
             <mark-failure>
-                <toolset name="borland"/>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note author="B. Dawes" refid="3"/>
             </mark-failure>
         </test>
         <test name="function_ref_cxx98">
             <mark-failure>
-                <toolset name="borland"/>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note author="B. Dawes" refid="3"/>
             </mark-failure>
         </test>
         <test name="lambda_test">
             <mark-failure>
-                <toolset name="borland"/>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note author="B. Dawes" refid="3"/>
             </mark-failure>
             <mark-failure>
-                <toolset name="cw-8_3*"/>
+                <toolset name="cw-8.3*"/>
                 <note author="B. Dawes" refid="2"/>
             </mark-failure>
         </test>
         <test name="lib_function_test">
             <mark-failure>
-                <toolset name="borland"/>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note author="B. Dawes" refid="3"/>
             </mark-failure>
             <mark-failure>
-                <toolset name="cw-8_3*"/>
+                <toolset name="cw-8.3*"/>
                 <note author="B. Dawes" refid="2"/>
             </mark-failure>
         </test>
         <test name="mem_fun_cxx98">
             <mark-failure>
-                <toolset name="borland"/>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note author="B. Dawes" refid="3"/>
             </mark-failure>
             <mark-failure>
-                <toolset name="cw-8_3*"/>
+                <toolset name="cw-8.3*"/>
                 <note author="B. Dawes" refid="2"/>
             </mark-failure>
         </test>
         <test name="std_bind_cxx98">
             <mark-failure>
-                <toolset name="borland"/>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note author="B. Dawes" refid="3"/>
             </mark-failure>
         </test>
         <test name="std_bind_portable">
             <mark-failure>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
                 <toolset name="msvc-6.5"/>
                 <note author="B. Dawes" refid="5"/>
             </mark-failure>
         </test>
         <test name="sum_avg_cxx98">
             <mark-failure>
-                <toolset name="borland"/>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note author="B. Dawes" refid="3"/>
             </mark-failure>
         </test>
@@ -2743,7 +2553,6 @@
         <test name="interoperable_fail" category="Corner-case tests">
             <mark-failure>
                 <toolset name="gcc-3.3*"/>
-                <toolset name="gcc-3_3*"/>
                 <toolset name="gcc-3.2*"/>
                 <toolset name="gcc-2*"/>
                 <toolset name="gcc"/>
@@ -2769,9 +2578,8 @@
                 <toolset name="mingw"/>
                 <toolset name="borland*"/>
                 <toolset name="cw-8*"/>
-                <toolset name="vc-6*"/>
-                <toolset name="vc-7_0*"/>
-                <toolset name="msvc"/>
+                <toolset name="msvc-6*"/>
+                <toolset name="msvc-7.0*"/>
                 <note author="D. Abrahams">
                     This failure is caused by a compiler bug.
                     <code>is_convertible&lt;T,U&gt;::value</code> may be true for unrelated
@@ -2790,13 +2598,8 @@
         <mark-expected-failures>
             <test name="indirect_iter_member_types"/>
             <test name="pointee"/>
-            <toolset name="borland"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <note author="D. Abrahams">
                 This failure is caused by a compiler bug.  The
                 compiler tends to drop const-ness and as a result
@@ -2808,13 +2611,8 @@
 
         <mark-expected-failures>
             <test name="zip_iterator_test"/>
-            <toolset name="borland"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <note author="Aleksey Gurtovoy" date="19 Sep 2004" refid="26"/>
         </mark-expected-failures>
 
@@ -2828,16 +2626,9 @@
           <note author="Doug Gregor" refid="3"/>
         </mark-unusable>
         <mark-unusable>
-          <toolset name="borland-5_6_4"/>
           <toolset name="borland-5.6.4"/>
           <note author="A.Meredith"/>
         </mark-unusable>
-        <test name="quaternion_mult_incl_test">
-            <mark-failure>
-                <toolset name="intel-win32"/>
-                <note author="B. Dawes" refid="3"/>
-            </mark-failure>
-        </test>
         <mark-expected-failures>
             <test name="octonion_test"/>
             <test name="quaternion_test"/>
@@ -2859,7 +2650,6 @@
         <mark-expected-failures>
             <test name="complex_test"/>
             <test name="hypot_test"/>
-            <toolset name="borland-5_8_2"/>
             <toolset name="borland-5.8.2"/>
             <note author="A.Meredith">
               Not yet diagnosed the precise reason these tests give bad results.
@@ -2867,7 +2657,6 @@
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="log1p_expm1_test"/>
-            <toolset name="borland-5_8_2"/>
             <toolset name="borland-5.8.2"/>
             <note author="A.Meredith">
               std::numeric_limits&gt;long double&lt;::infinity() is apparently
@@ -2876,28 +2665,77 @@
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="complex_test"/>
-            <toolset name="msvc"/>
+            <toolset name="msvc-6*"/>
             <note author="John Maddock">
               Incomplete std::complex support make these tests pointless
               (the complex trig functions are absent).
             </note>
         </mark-expected-failures>
-        <mark-expected-failures>
+       <mark-expected-failures>
+          <test name="special_functions_test"/>
+          <test name="octonion_test"/>
+          <test name="quaternion_test"/>
+          <test name="quaternion_mult_incl_test"/>
+          <toolset name="sun-5.8"/>
+          <note author="John Maddock">
+             These have yet to fully investigated, but the code is known
+             to compile with more conforming compilers, probably workarounds
+             are possible if someone is prepared to invest the time.
+          </note>
+       </mark-expected-failures>
+       <mark-expected-failures>
+          <test name="special_functions_test"/>
+          <test name="octonion_test"/>
+          <test name="quaternion_test"/>
+          <test name="quaternion_mult_incl_test"/>
+          <toolset name="msvc-6*"/>
+          <note author="John Maddock">
+             This compiler is not sufficiently conforming to compile these tests.
+          </note>
+       </mark-expected-failures>
+       <mark-expected-failures>
+          <test name="quaternion_test"/>
+          <toolset name="msvc-7.1_stlport4"/>
+          <note author="John Maddock">
+             Appears to be a bug in STLport's complex abs function, but needs more investigation.
+          </note>
+       </mark-expected-failures>
+       <mark-expected-failures>
             <test name="complex_test"/>
-            <toolset name="qcc-3.3.5-cpp"/>
+            <toolset name="qcc-3.3.5*cpp"/>
             <note author="Jim Douglas" date="14 Feb 06" refid="27"/>
        </mark-expected-failures>
     </library>
 
     <!-- numeric/conversion -->
     <library name="numeric/conversion">
+        <test name="bounds_test">
+            <mark-failure>
+                <toolset name="borland-5.6.4"/>
+                <toolset name="borland-5.8.2"/>
+                <note author="Fernando Cacciola" refid="3"/>
+            </mark-failure>
+        </test>
+        <test name="converter_test">
+            <mark-failure>
+                <toolset name="gcc-3.4.5_linux_x86_64"/>
+                <toolset name="borland-5.6.4"/>
+                <toolset name="borland-5.8.2"/>
+                <note author="Fernando Cacciola" refid="3"/>
+            </mark-failure>
+        </test>
+        <test name="traits_test">
+            <mark-failure>
+                <toolset name="borland-5.6.4"/>
+                <toolset name="borland-5.8.2"/>
+                <note author="Fernando Cacciola" refid="3"/>
+            </mark-failure>
+        </test>
         <test name="udt_example_0">
             <mark-failure>
-                <toolset name="vc-6_5-stlport"/>
-                <toolset name="borland-5_6_4"/>
+                <toolset name="msvc-6.5_stlport4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5*"/>
+                <toolset name="borland-5.8.2"/>
                 <toolset name="msvc-6.5*"/>
                 <note author="Fernando Cacciola" refid="30"/>
             </mark-failure>
@@ -2905,6 +2743,8 @@
         <test name="udt_support_test">
             <mark-failure>
                 <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
+                <toolset name="borland-5.6.4"/>
+                <toolset name="borland-5.8.2"/>
                 <note author="Fernando Cacciola" refid="3"/>
             </mark-failure>
         </test>
@@ -2913,13 +2753,9 @@
     <!-- numeric/interval -->
     <library name="numeric/interval">
         <mark-unusable>
-            <toolset name="borland"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
         </mark-unusable>
         <mark-expected-failures>
             <test name="det"/>
@@ -2941,7 +2777,6 @@
             <test name="det"/>
             <test name="integer"/>
             <test name="overflow"/>
-            <toolset name="borland-5_8_2"/>
             <toolset name="borland-5.8.2"/>
             <note author="A.Meredith">
                 This compiler has some problems with name looup / overload resolution.
@@ -2956,7 +2791,7 @@
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="det"/>
-            <toolset name="cw-8_3*"/>
+            <toolset name="cw-8.3*"/>
             <note author="Aleksey Gurtovoy" refid="2"/>
         </mark-expected-failures>
     </library>
@@ -2965,29 +2800,37 @@
     <!-- numeric/ublas -->
     <library name="numeric/ublas">
         <mark-unusable>
-            <toolset name="borland"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="gcc-3_3-darwin"/>
             <note author="M.Stevens" refid="17"/>
         </mark-unusable>
         <mark-unusable>
-            <toolset name="cw-8_3"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
+            <toolset name="cw-9.4"/>
+            <note author="M.Stevens" refid="2"/>
+        </mark-unusable>
+        <mark-unusable>
+            <toolset name="sun-5.8"/>
+            <note author="M.Stevens" refid="4"/>
+        </mark-unusable>
+        <mark-unusable>
+            <toolset name="cw-8.3"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <toolset name="iw-7_1-vc6"/>
             <toolset name="gcc-2.95*"/>
             <note author="M.Stevens" refid="30"/>
         </mark-unusable>
+        <mark-unusable>
+            <toolset name="msvc-7.1_stlport4"/>
+            <note author="Roland Schwarz">
+                This old version of the stlport library causes the BOOST_NO_STDC_NAMESPACE 
+                macro to be set. But this conflicts with the requirements of the library.
+            </note>
+        </mark-unusable>
         <mark-expected-failures>
             <test name="test3"/>
-            <toolset name="qcc-3.3.5-cpp"/>
+            <toolset name="qcc-3.3.5*cpp"/>
             <note author="Jim Douglas" date="14 Feb 06" refid="27"/>
        </mark-expected-failures>
     </library>
@@ -3012,14 +2855,12 @@
         </mark-unusable>
 
         <mark-unusable>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
             <note refid="17"/>
         </mark-unusable>
 
         <mark-unusable>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note refid="29"/>
         </mark-unusable>
 
@@ -3029,8 +2870,6 @@
             <mark-failure>
                 <toolset name="iw-7_1-vc6"/>
                 <toolset name="iw-7_1-vc6-stlp-4_5_3"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5*"/>
                 <toolset name="msvc-6.5*"/>
                 <note>The failures are caused by problems
                     with std::locale implementation</note>
@@ -3039,8 +2878,6 @@
 
         <test name="options_description_test_dll">
              <mark-failure>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
                 <toolset name="msvc-6.5"/>
                 <toolset name="iw-7_1-vc6"/>
                 <note refid="23"/>
@@ -3056,7 +2893,7 @@
 
         <test name="*dll">
             <mark-failure>
-                <toolset name="cw-8_3*"/>
+                <toolset name="cw-8.3*"/>
                 <note refid="18"/>
             </mark-failure>
         </test>
@@ -3071,8 +2908,6 @@
         <mark-expected-failures>
             <test name="variable_map_test"/>
             <test name="variable_map_test_dll"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
             <note>
                The failures are caused by compiler bug: it's not possible to
@@ -3095,6 +2930,11 @@
         <mark-expected-failures>
             <test name="unicode_test*"/>
             <toolset name="mingw-3*"/>
+            <toolset name="gcc-3.4.2_mingw"/>
+            <toolset name="gcc-3.4.5_mingw"/>
+            <toolset name="gcc-mingw-3.4.5"/>
+            <toolset name="gcc-mingw-3.4.2"/>
+            <toolset name="gcc-cygwin-3.4.4"/>
             <note refid="19"/>
         </mark-expected-failures>
         
@@ -3106,25 +2946,164 @@
 
         <mark-expected-failures>
             <test name="unicode_test*"/>
-            <toolset name="qcc-3.3.5-gpp"/>
+            <toolset name="qcc-3.3.5*gpp"/>
             <note author="Jim Douglas" date="12 Feb 06" refid="36"/>
         </mark-expected-failures>
 
     </library>
 
+    <!-- parameter -->
+    <library name="parameter">
+        <mark-expected-failures>
+            <test name="duplicates"/>
+            <toolset name="borland-5.6*"/>
+            <toolset name="borland-5.8*"/>
+            <note refid="32" author="David Abrahams"/>
+        </mark-expected-failures>
+        <mark-expected-failures>
+            <test name="unnamed_fail"/>
+            <toolset name="msvc-7.0"/>
+            <toolset name="msvc-6*"/>
+            <note refid="32" author="David Abrahams"/>
+        </mark-expected-failures>
+        <test name="preprocessor">
+          <toolset name="[Ss]un-5.8"/>
+            <note>
+              Several compiler bugs were worked around in order to get
+              this test to pass, so it could be considered to be only
+              partially working.  However, the library's macro system,
+              which is really being tested here, does work on this
+              compiler, which is why we worked around the failures.
+              Please see the <a
+              href="http://www.boost.org/libs/parameter/test/preprocessor.cpp">test's
+              source file</a> for details.
+            </note>
+        </test>
+
+        <mark-expected-failures>
+            <test name="maybe"/>
+            <toolset name="borland-5.6.4"/>
+            <toolset name="borland-5.8.2"/>
+            <toolset name="msvc-6*"/>
+            <toolset name="msvc-7.0"/>
+            <note refid="31" author="Daniel Wallin"/>
+        </mark-expected-failures>
+
+        <mark-expected-failures>
+            <test name="python-parameter-test"/>
+            <toolset name="borland-5.6.4"/>
+            <toolset name="borland-5.8.2"/>
+            <toolset name="msvc-6*"/>
+            <toolset name="msvc-7.0"/>
+            <note refid="31" author="Daniel Wallin"/>
+        </mark-expected-failures>
+
+        <mark-expected-failures>
+            <test name="python_test"/>
+            <toolset name="borland-5.6.4"/>
+            <toolset name="borland-5.8.2"/>
+            <toolset name="msvc-6*"/>
+            <toolset name="msvc-7.0"/>
+            <note refid="31" author="Daniel Wallin"/>
+        </mark-expected-failures>
+
+        <mark-expected-failures>
+            <test name="optional_deduced_sfinae"/>
+            <toolset name="msvc-6*"/>
+            <toolset name="msvc-7.0"/>
+            <toolset name="borland-5.6.4"/>
+            <toolset name="borland-5.8.2"/>
+            <note author="Daniel Wallin">
+              These compilers do not support SFINAE, so are expected to
+              fail this test.
+            </note>
+        </mark-expected-failures>
+
+        <mark-expected-failures>
+            <test name="preprocessor_deduced"/>
+            <toolset name="borland-5.6.4"/>
+            <toolset name="borland-5.8.2"/>
+            <note author="Daniel Wallin">
+              Borland does not support this feature. A compatibility syntax
+              might be developed later on.
+            </note>
+        </mark-expected-failures>       
+
+        <mark-expected-failures>
+            <test name="normalized_argument_types"/>
+            <toolset name="borland-5.6.4"/>
+            <toolset name="borland-5.8.2"/>
+            <toolset name="msvc-6*"/>
+            <toolset name="msvc-7.0"/>
+            <note author="Daniel Wallin">
+              This feature generally requires advanced compiler
+              features not supported by these compilers. It might
+              be possible to work around the issue on VC6/7, but
+              at this time no such workaround has been done.
+            </note>
+        </mark-expected-failures>
+
+        <mark-expected-failures>
+            <test name="unnamed"/>
+            <toolset name="*"/>
+            <note author="Daniel Wallin">
+              This is old and should not be tested any more.
+            </note>
+        </mark-expected-failures>
+
+        <mark-expected-failures>
+            <test name="deduced_dependent_predicate"/>
+            <toolset name="msvc-6*"/>
+            <note refid="31" author="Daniel Wallin"/>
+        </mark-expected-failures>
+       <mark-expected-failures>
+          <test name="optional_deduced_sfinae"/>
+          <test name="preprocessor_deduced"/>
+          <test name="python_test"/>
+          <toolset name="sun-5.8"/>
+          <note author="John Maddock">
+             These test failure are reported to be under investigation
+             at Sun's compiler labs.
+          </note>
+       </mark-expected-failures>
+
+        <mark-expected-failures>
+            <test name="result_of"/>
+            <toolset name="msvc-6*"/>
+            <toolset name="msvc-7.0"/>
+            <toolset name="borland-5.6.4"/>
+            <toolset name="borland-5.8.2"/>
+            <note refid="31" author="Daniel Wallin"/>
+        </mark-expected-failures>
+
+        <mark-expected-failures>
+            <test name="python_test"/>
+            <toolset name="qcc-3.3.5_gpp"/>
+            <note refid="6" author="Daniel Wallin"/>
+        </mark-expected-failures>
+
+        <mark-expected-failures>
+            <test name="sfinae"/>
+            <toolset name="borland-5.8.2"/>
+            <toolset name="msvc-6.5_stlport4"/>
+            <note refid="29" author="Daniel Wallin"/>
+        </mark-expected-failures>
+
+    </library>
+
      <!-- pointer container -->
     <library name="ptr_container">
         <mark-unusable>
             <toolset name="gcc-2.95.3*"/>
             <toolset name="sunpro-5_3-sunos"/>
-            <toolset name="tru64cxx65-042"/>
-            <toolset name="borland-5_6_4"/>
+            <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
-            <toolset name="dmc-8_43-stlport-4_5_3"/>
+            <toolset name="msvc-7.0"/>
+            <toolset name="dmc-8_47-stlport-4_5_3"/>
+            <toolset name="hp_cxx-65_042_tru64"/>
         </mark-unusable>
         <mark-expected-failures>
             <test name="ptr_list"/>
@@ -3142,25 +3121,129 @@
                 It should be fixed in newer versions of the compiler.
             </note>
         </mark-expected-failures>
-
+        <mark-expected-failures>
+            <test name="incomplete_type_test"/>
+            <toolset name="cw-9.4"/>
+            <note author="Thorsten Ottosen">
+                This error seems to be a bug the compiler. Please submit a 
+                patch.
+            </note>
+        </mark-expected-failures>
+        <mark-expected-failures>
+            <test name="iterator_test"/>
+            <toolset name="gcc-3.2.3*"/>
+            <toolset name="gcc-3.3.6*"/>
+            <toolset name="gcc"/>
+            <toolset name="qcc-3.3.5*"/>  
+            <note author="Thorsten Ottosen">
+                This error seems to be a bug the standard library. Please submit a 
+                patch.
+            </note>
+        </mark-expected-failures>
+        <mark-expected-failures>
+            <test name="no_exceptions"/>
+            <toolset name="cw-9.4"/>
+            <toolset name="sun-5.8"/>
+            <note author="Thorsten Ottosen">
+                This test fails because the test ptr_vector fails. Please see the note
+                for that test.
+            </note>
+        </mark-expected-failures>
+        <mark-expected-failures>
+            <test name="ptr_deque"/>
+            <toolset name="cw-9.4"/>
+            <toolset name="sun-5.8"/>
+            <note author="Thorsten Ottosen">
+                For sun the problem is that <code>insert(iterator,range)</code>
+                is not available due to partial ordering errors (the core library remains usable).
+                For codewarrior the problem is at least <code>std::auto_ptr</code> overloads (the core library remains usable).
+            </note>
+        </mark-expected-failures>
+        <mark-expected-failures>
+            <test name="ptr_list"/>
+            <toolset name="cw-9.4"/>
+            <toolset name="sun-5.8"/>
+            <note author="Thorsten Ottosen">
+                For sun the problem is that <code>insert(iterator,range)</code>
+                is not available due to partial ordering errors (the core library remains usable).
+                For codewarrior the problem is at least <code>std::auto_ptr</code> overloads (the core library remains usable).
+            </note>
+        </mark-expected-failures>
+        <mark-expected-failures>
+            <test name="ptr_vector"/>
+            <toolset name="cw-9.4"/>
+            <toolset name="sun-5.8"/>
+            <note author="Thorsten Ottosen">
+                For sun the problem is that <code>insert(iterator,range)</code>
+                is not available due to partial ordering errors (the core library remains usable).
+                For codewarrior the problem is at least <code>std::auto_ptr</code> overloads (the core library remains usable).
+            </note>
+        </mark-expected-failures>
+        <mark-expected-failures>
+            <test name="ptr_map"/>
+            <toolset name="hp_cxx-71_006_tru64"/>
+            <toolset name="cw-9.4"/>
+            <toolset name="sun-5.8"/>
+            <note author="Thorsten Ottosen">
+                For hp, this compiler bug is insignificant.
+                For sun the problem is that <code>transfer(range,ptr_map)</code>
+                is not available due to partial ordering errors (the core library remains usable).
+                For codewarrior the problem is not known so please submit a patch.
+            </note>
+        </mark-expected-failures>
+        <mark-expected-failures>
+            <test name="ptr_set"/>
+            <toolset name="cw-9.4"/>
+            <toolset name="sun-5.8"/>
+            <note author="Thorsten Ottosen">
+                For sun the problem is that <code>transfer(range,ptr_map)</code> and
+                <code>insert(range)</code>code>
+                is not available due to partial ordering errors (the core library remains usable).
+                For codewarrior the problem is at least <code>std::auto_ptr</code> overloads (the core library remains usable)..
+            </note>
+        </mark-expected-failures>
+           <mark-expected-failures>
+            <test name="serialization"/>
+            <toolset name="cw*"/>
+            <note author="Thorsten Ottosen">
+                This cause of this problem is unknown. Please submit a patch.
+            </note>
+        </mark-expected-failures>
+           <mark-expected-failures>
+               <test name="tree_test"/>
+               <toolset name="sun-5.8"/>
+               <note author="Thorsten Ottosen">
+                   For sun the problem is due to Boost.Test.                  
+               </note>
+           </mark-expected-failures>
+           <mark-expected-failures>
+               <test name="tut1"/>
+               <toolset name="cw-9.4"/>
+               <note author="Thorsten Ottosen">
+                   Seem like a bug in the compiler. Please submit a patch.                  
+               </note>
+           </mark-expected-failures>
+           <mark-expected-failures>
+               <test name="view_example"/>
+               <toolset name="cw-9.4"/>
+               <note author="Thorsten Ottosen">
+                   Seem like a bug in the compiler. Please submit a patch.                  
+               </note>
+           </mark-expected-failures>
     </library>
 
     <!-- python -->
     <library name="python">
         <mark-unusable>
-            <toolset name="borland"/>
-            <toolset name="borland-5_5_1"/>
-            <toolset name="borland-5_6_4"/>
+            <toolset name="borland-5.5.1"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <note refid="2"/>
             <note refid="17"/>
         </mark-unusable>
         <mark-unusable>
             <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <note author="Markus Schoepflin">
             The library fails to compile because of an error in the C++
             standard library implementation on this platform. It incorrectly
@@ -3168,6 +3251,14 @@
             the case. This is fixed in a later release.
             </note>
         </mark-unusable>
+        <mark-unusable>
+            <toolset name="sun-5.8*"/>
+            <note author="David Abrahams">
+            This compiler seems to be having trouble digesting
+            Boost.Tuple.  Until it can handle Boost.Tuple there's
+            little chance it will handle Boost.Python
+            </note>
+        </mark-unusable>
         <mark-expected-failures>
             <test name="args"/>
             <test name="auto_ptr"/>
@@ -3203,90 +3294,6 @@
              </note>
         </mark-expected-failures>
         <mark-expected-failures>
-            <test name="args"/>
-            <test name="auto_ptr"/>
-            <test name="back_reference"/>
-            <test name="ben_scott1"/>
-            <test name="bienstman1"/>
-            <test name="bienstman2"/>
-            <test name="bienstman3"/>
-            <test name="bienstman4"/>
-            <test name="bienstman5"/>
-            <test name="callbacks"/>
-            <test name="cltree"/>
-            <test name="const_argument"/>
-            <test name="crossmod_exception_a"/>
-            <test name="crossmod_exception_b"/>
-            <test name="data_members"/>
-            <test name="defaults"/>
-            <test name="dict"/>
-            <test name="docstring"/>
-            <test name="enum"/>
-            <test name="exception_translator"/>
-            <test name="extract"/>
-            <test name="implicit"/>
-            <test name="injected"/>
-            <test name="input_iterator"/>
-            <test name="int_map_indexing_suite"/>
-            <test name="iterator"/>
-            <test name="keywords"/>
-            <test name="list"/>
-            <test name="long"/>
-            <test name="m1"/>
-            <test name="m2"/>
-            <test name="map_indexing_suite"/>
-            <test name="minimal"/>
-            <test name="module_tail"/>
-            <test name="multi_arg_constructor"/>
-            <test name="nested"/>
-            <test name="object"/>
-            <test name="opaque"/>
-            <test name="operators"/>
-            <test name="pickle1"/>
-            <test name="pickle2"/>
-            <test name="pickle3"/>
-            <test name="pickle4"/>
-            <test name="polymorphism"/>
-            <test name="polymorphism2"/>
-            <test name="properties"/>
-            <test name="register_ptr"/>
-            <test name="return_arg"/>
-            <test name="shared_ptr"/>
-            <test name="slice"/>
-            <test name="staticmethod"/>
-            <test name="str"/>
-            <test name="test_builtin_converters"/>
-            <test name="test_pointer_adoption"/>
-            <test name="tuple"/>
-            <test name="vector_indexing_suite"/>
-            <test name="virtual_functions"/>
-            <toolset name="intel-7.1-linux"/>
-            <toolset name="intel-8.0-linux"/>
-            <note author="Aleksey Gurtovoy">
-                The library is <a href="http://article.gmane.org/gmane.comp.lib.boost.devel/110420">known to work</a>
-                in this configuration. The failures are due to configuration issues of
-                the particular testing environment these tests have been run in. The
-                regression runners and library developers are aware of the problem and
-                plan to fix it for the next release.
-            </note>
-        </mark-expected-failures>
-        <mark-expected-failures>
-            <test name="builtin_converters"/>
-            <test name="extract"/>
-            <test name="list"/>
-            <test name="operators"/>
-            <test name="pickle1"/>
-            <test name="pickle2"/>
-            <test name="pickle3"/>
-            <test name="pickle4"/>
-            <toolset name="gcc-3.4.2-linux"/>
-            <note author="Aleksey Gurtovoy">
-                The test is <a href="http://article.gmane.org/gmane.comp.lib.boost.devel/110671">known to work</a>
-                in this configuration. The failures are due to configuration issues of
-                the particular testing environment these tests have been run in.
-            </note>
-        </mark-expected-failures>
-        <mark-expected-failures>
             <test name="pointer_vector"/>
             <test name="polymorphism"/>
             <toolset name="tru64cxx7*"/>
@@ -3299,33 +3306,37 @@
     <library name="random">
         <mark-unusable>
             <toolset name="msvc"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="B. Dawes" refid="10"/>
         </mark-unusable>
         <test name="random_test">
             <mark-failure>
-                <toolset name="cw-8_3*"/>
+                <toolset name="cw-8.3*"/>
                 <note author="B. Dawes" refid="3"/>
             </mark-failure>
             <mark-failure>
-                <toolset name="borland"/>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
+                <toolset name="borland-5.8*"/>
                 <note author="B. Dawes" refid="2"/>
             </mark-failure>
             <mark-failure>
-                <toolset name="intel-win32-*"/>
+                <toolset name="intel-vc71-win*"/>
+                <toolset name="intel-vc8-win*"/>
                 <note author="S. Slapeta" refid="1"/>
             </mark-failure>
             <mark-failure>
-                <toolset name="qcc-3.3.5-*"/>
+                <toolset name="intel-linux-9.0"/>
+                <note author="John Maddock">
+                  Reported to Intel as issue 409291, and confirmed
+                  as a problem.  Probably this relates to a specific
+                  Linux-Kernal or GLibC version.
+                </note>
+            </mark-failure>
+            <mark-failure>
+                <toolset name="qcc-3.3.5*"/>
                 <note author="Jim Douglas" date="13 Feb 06">
                     Test fails with ranlux*_O1 RNGs when saving and recalling the state due to a bug in the
-                    double to string conversion. The problem has been reported to QNX as PR29252. 	
+                    double to string conversion. The problem has been reported to QNX as PR29252.
                 </note>
             </mark-failure>
             <mark-failure>
@@ -3350,19 +3361,17 @@
         <mark-expected-failures>
             <test name="array"/>
             <toolset name="como-4_3_3*"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="sun-5.8"/>
+            <toolset name="borland-5.8*"/>
             <note refid="27" author="Thorsten Ottosen"/>
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="iterator_range"/>
             <toolset name="msvc-stlport"/>
-            <toolset name="vc-6_5-stlport"/>
-            <toolset name="tru64cxx65"/>
+            <toolset name="msvc-6.5_stlport4"/>
+            <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <note author="Thorsten Ottosen">
                 For most compilers this is due to problems
                 with built-in arrays (notably char arrays) and operator==()
@@ -3374,7 +3383,8 @@
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="reversible_range"/>
-            <toolset name="tru64cxx65"/>
+            <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <note author="Thorsten Ottosen">
                 This test probably fails because it uses built-in arrays. So do expect these
                 functions to work in normal code.
@@ -3382,13 +3392,11 @@
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="string"/>
-            <toolset name="tru64cxx65"/>
-            <toolset name="borland-5_6_4"/>
+            <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="sun-5.8"/>
+            <toolset name="borland-5.8*"/>
             <note author="Thorsten Ottosen">
                 The string functionality is expected to work if
                 the user employs std::string and stays away from built-in
@@ -3397,13 +3405,14 @@
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="sub_range"/>
-            <toolset name="vc-8_0"/>
-        <toolset name="msvc-8.0"/>
+            <toolset name="msvc-8.0"/>
+            <toolset name="intel-vc8-*"/>
             <toolset name="iw-7_1-vc6-stlp-4_5_3"/>
-            <toolset name="msvc-stlport"/>
-            <toolset name="vc-6_5-stlport"/>
-            <toolset name="vc-7_0"/>
-            <toolset name="tru64cxx65"/>
+            <toolset name="msvc-6.5_stlport4"/>
+            <toolset name="msvc-7.0"/>
+            <toolset name="msvc-7.1_stlport4"/>
+            <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <note refid="6" author="Thorsten Ottosen">
                 For most compilers this is due to problems
                 with built-in arrays (notably char arrays) and operator==()
@@ -3420,14 +3429,21 @@
                 "singularity" of an iterator range is likely to change.
             </note>
         </mark-expected-failures>
+        <mark-expected-failures>
+            <test name="extension_mechanism"/>
+            <toolset name="msvc-6.5*"/>
+            <toolset name="msvc-7.0"/>
+            <note author="Thorsten Ottosen">
+                The test requires support for Argument Dependent Lookup (ADL)
+                which the compiler in question does not provide.
+            </note>
+        </mark-expected-failures>
     </library>
 
     <!-- regex -->
     <library name="regex">
         <test name="regex_token_iterator_eg_2">
             <mark-failure>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
                 <toolset name="msvc-6.5"/>
                 <note author="J. Maddock"/>
             </mark-failure>
@@ -3438,6 +3454,22 @@
                 <note author="J. Maddock"/>
             </mark-failure>
         </test>
+        <test name="wide_posix_api_check">
+            <mark-failure>
+                <toolset name="qcc-3.3.5_gpp"/>
+                <note author="J. Maddock">
+                    No Wide character support on this platform.
+                </note>
+            </mark-failure>
+        </test>
+        <test name="wide_posix_api_check_c">
+            <mark-failure>
+                <toolset name="qcc-3.3.5_gpp"/>
+                <note author="J. Maddock">
+                    No Wide character support on this platform.
+                </note>
+            </mark-failure>
+        </test>
         <test name="*_dll">
             <mark-failure>
                 <toolset name="*como-4_3_3*"/>
@@ -3449,17 +3481,28 @@
         </test>
         <mark-expected-failures>
             <test name="static_mutex_test"/>
-            <test name="grep"/>
+            <test name="test_grep"/>
             <toolset name="*como-4_3_3*"/>
             <note author="J. Maddock">
             This test requires features that are unsupported by Como:
             use and building of dll's mainly.
             </note>
         </mark-expected-failures>
+        <mark-expected-failures>
+            <test name="regex_regress_threaded"/>
+            <toolset name="gcc-*_tru64"/>
+            <note author="J. Maddock">
+              GCC on tru64 appears not to cope with C++ exceptions
+              thrown from within threads.
+            </note>
+        </mark-expected-failures>
         <test name="concept_check">
             <mark-failure>
-                <toolset name="vc-8_0"/>
+                <toolset name="msvc-8.0"/>
                 <toolset name="sunpro-5_3-sunos"/>
+                <toolset name="sun-5.8"/>
+                <toolset name="borland-5.8.2"/>
+                <toolset name="qcc-3.3.5_cpp"/>
                 <note author="John Maddock" refid="2"/>
             </mark-failure>
             <mark-failure>
@@ -3468,14 +3511,13 @@
                 <note author="Markus Schoepflin" refid="3"/>
             </mark-failure>
         </test>
-        <test name="grep">
+        <test name="test_grep">
             <mark-failure>
                 <toolset name="gcc-2.95.3-linux"/>
                 <toolset name="sunpro-5_3-sunos"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5*"/>
-                <toolset name="msvc-6.5*"/>
-                <toolset name="vc-7_0"/>
+               <toolset name="sun-5.8"/>
+               <toolset name="msvc-6.5*"/>
+                <toolset name="msvc-7.0"/>
                 <note author="John Maddock">
                   This test fails because a dependency (Boost.Program Options) doesn't build with this compiler.
                 </note>
@@ -3488,16 +3530,35 @@
             <note author="John Maddock" refid="29"/>
         </mark-expected-failures>
         <mark-expected-failures>
+            <test name="regex_regress"/>
+            <test name="regex_regress_threaded"/>
+            <test name="regex_regress_dll"/>
+            <toolset name="borland*"/>
+            <note author="John Maddock">
+              There appears to be a linker bug that prevents these
+              projects from building, see http://qc.borland.com/wc/qcmain.aspx?d=32020.
+            </note>
+        </mark-expected-failures>
+        <mark-expected-failures>
             <test name="unicode_iterator_test"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
             <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
             <note author="John Maddock" refid="6"/>
         </mark-expected-failures>
         <mark-expected-failures>
+            <test name="regex_regress"/>
+            <test name="regex_regress_threaded"/>
+            <test name="regex_regress_dll"/>
+            <toolset name="borland*"/>
+            <note author="John Maddock">
+              There appears to be a linker bug that prevents these
+              projects from building, see http://qc.borland.com/wc/qcmain.aspx?d=32020.
+            </note>
+        </mark-expected-failures>
+        <mark-expected-failures>
             <test name="regex_timer"/>
-            <toolset name="vc-6_5-stlport"/>
+            <toolset name="msvc-6.5_stlport4"/>
             <note author="John Maddock">
                Test fails due to unresilved externals from STLport: appears to be
                an STLport bug. </note>
@@ -3511,21 +3572,14 @@
         </mark-unusable>
         <test name="signal_test">
             <mark-failure>
-                <toolset name="cw-8_3*"/>
+                <toolset name="cw-8.3*"/>
                 <note author="B. Dawes" refid="2"/>
             </mark-failure>
             <mark-failure>
-                <toolset name="borland"/>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="msvc-6.5"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note author="B. Dawes" refid="3"/>
             </mark-failure>
         </test>
@@ -3539,19 +3593,18 @@
             <toolset name="dmc-8*"/>
             <toolset name="gcc-2*"/>
             <toolset name="hp_cxx-65*"/>
-            <toolset name="msvc"/>
             <toolset name="msvc-6.5*"/>
             <toolset name="msvc-7.0*"/>
             <toolset name="sun-5*"/>
             <toolset name="tru64cxx65*"/>
-            <toolset name="vc-6_5*"/>
-            <toolset name="vc-7_0*"/>
+            <toolset name="hp_cxx-65*"/>
             <note author="Andreas Huber" refid="17"/>
         </mark-unusable>
         <mark-expected-failures>
             <test name="DllTestNormal"/>
-            <toolset name="mingw*"/>
+            <toolset name="*mingw*"/>
             <toolset name="hp_cxx-71*"/>
+            <toolset name="cw-9*"/>
             <note author="Andreas Huber">
                 A runtime failure of this test indicates that this platform
                 <b>dynamically</b> links code in a manner such that under
@@ -3574,19 +3627,24 @@
             </note>
         </mark-expected-failures>
         <mark-expected-failures reason="?">
+            <test name="CameraExample"/>
             <test name="CustomReactionTest*"/>
+            <test name="PerformanceExample"/>
             <test name="TransitionTest*"/>
-            <test name="DllTestNormal"/>
             <toolset name="cw-9*"/>
             <note author="Andreas Huber" refid="29"/>
         </mark-expected-failures>
         <mark-expected-failures reason="?">
             <test name="CustomReactionTest*"/>
-            <test name="FifoSchedulerTest*"/>
             <test name="TransitionTest*"/>
             <toolset name="hp_cxx-71*"/>
             <note author="Andreas Huber" refid="29"/>
         </mark-expected-failures>
+        <mark-expected-failures reason="?">
+            <test name="CustomReactionTest*"/>
+            <toolset name="acc"/>
+            <note author="Andreas Huber" refid="29"/>
+        </mark-expected-failures>
     </library>
 
     <!-- static_assert -->
@@ -3599,12 +3657,8 @@
         </test>
         <test name="static_assert_test">
             <mark-failure>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
+                <toolset name="borland-5.8*"/>
                 <note author="A.Meredith" date="26 May 2006">
                   This test runs without problem on Borland compilers,
                   which means the static assertion is not being caught.
@@ -3623,8 +3677,6 @@
 
         <mark-expected-failures>
             <test name="custom_exception_test"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
             <note author="Gennadiy Rozental" refid="2"/>
         </mark-expected-failures>
@@ -3637,16 +3689,15 @@
 
         <mark-expected-failures>
             <test name="token_iterator_test"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
             <toolset name="iw-7_1-vc6"/>
-            <toolset name="vc-7_0"/>
-            <toolset name="vc-7_0-stlport"/>
+            <toolset name="msvc-7.0"/>
+            <toolset name="msvc-7.0-stlport"/>
             <toolset name="gcc-2.95.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
-            <toolset name="tru64cxx65-042"/>
+            <toolset name="tru64cxx65-*"/>
+            <toolset name="hp_cxx-65*"/>
             <toolset name="sunpro*"/>
             <toolset name="borland*"/>
             <note author="Gennadiy Rozental" refid="3"/>
@@ -3654,23 +3705,17 @@
 
         <mark-expected-failures>
             <test name="token_iterator_test"/>
-            <toolset name="qcc-3.3.5-gpp"/>
+            <toolset name="qcc-3.3.5*gpp"/>
             <note author="Jim Douglas" date="14 Feb 06" refid="36"/>
        </mark-expected-failures>
 
         <mark-expected-failures>
             <test name="test_fp_comparisons"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
-            <toolset name="vc-7_0-stlport"/>
-            <toolset name="borland-5_6_4"/>
+            <toolset name="msvc-7.0"/>
+            <toolset name="msvc-7.0-stlport"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <note author="Gennadiy Rozental" refid="3"/>
         </mark-expected-failures>
 
@@ -3688,11 +3733,21 @@
         </mark-expected-failures>
 
         <mark-expected-failures>
-          <test name="errors_handling_test"/>
           <test name="test_tools_test"/>
-          <toolset name="cw-9_4"/>
+          <toolset name="cw-9.4"/>
           <note refid="29" author="Doug Gregor"/>
         </mark-expected-failures>
+
+        <mark-expected-failures>
+            <test name="prg_exec_fail2"/>
+            <toolset name="darwin-4.0.1"/>
+            <note author="Vladimir Prus">
+              The test appears to test that division by zero is
+              detected by Boost.Test. This is not happening on
+              Darwin, for unknown reasons.
+            </note>
+        </mark-expected-failures>
+
     </library>
 
 
@@ -3704,28 +3759,11 @@
         </mark-unusable>
         <test name="test_mutex">
             <mark-failure>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note author="B. Dawes" refid="0"/>
                 <note author="B. Dawes" refid="6"/>
             </mark-failure>
         </test>
-        <test name="test_tss_lib">
-            <mark-failure>
-                <toolset name="mingw*"/>
-                <toolset name="borland-5_6_4"/>
-                <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="cw-*"/>
-                <toolset name="vc-7_0"/>
-                <note author="Aleksey Gurtovoy" date="19 Sep 2004">
-                    This functionality has not been implemented yet. The library
-                    developers plan to implement it for the next release.
-                </note>
-            </mark-failure>
-        </test>
         <mark-expected-failures>
             <test name="*_lib"/>
             <toolset name="intel-8.0-linux*"/>
@@ -3741,31 +3779,43 @@
                 something else is known to resolve the issue.
             </note>
         </mark-expected-failures>
-        <mark-expected-failures>
-            <test name="test_barrier_lib"/>
-            <toolset name="vc-8_0"/>
-            <note author="Aleksey Gurtovoy" refid="6"/>
-        </mark-expected-failures>
-
-        <mark-expected-failures>
-            <test name="test_thread"/>
-            <toolset name="vc-7_1"/>
-            <note author="Aleksey Gurtovoy" refid="6"/>
-        </mark-expected-failures>
-
         <mark-expected-failures reason="?">
             <test name="*_lib"/>
             <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
             <note author="Aleksey Gurtovoy" refid="29"/>
         </mark-expected-failures>
-
+        <!--
+        It is unclear why this has been marked as expected failure. The
+        pthread_timedwait is giving an error code of EINVAL, which needs to
+        be resolved, since the timed behaviour is affected by this bug.
+        Marked as a failure again by Roland Schwarz, 2007-01-12
         <mark-expected-failures>
             <test name="test_mutex"/>
             <test name="test_mutex_lib"/>
             <toolset name="qcc-3.3*"/>
             <note author="Jim Douglas" date="13 Feb 06" refid="16"/>
         </mark-expected-failures>
+        -->
+        <mark-expected-failures>
+            <test name="test_tss_lib"/>
+            <toolset name="borland-*"/>
+            <toolset name="cw-9.4"/>
+            <toolset name="gcc-mingw*"/>
+            <note author="Roland Schwarz" date="2006-12-14">
+                When a thread ends, tss data needs to be cleaned up. This process
+                is mostly automatic. When threads are launched by the Boost.Thread API
+                cleanup is handled by the library implementation. For threads, launched
+                by the native operating system API it is not possible to get this cleanup
+                on every compiler/platform. A warning (error) will be present in this case,
+                which cleary states this fact. It is recommended to start threads only
+                by means of the Boost.Thread API if you need to avoid the leaks that appear
+                on the end of the thread. If this is not possible the cleanup can be invoked
+                from user code before the process actually ends. For library implementors
+                this means to call these functions during library initialization and 
+                finalization.   
+            </note>
+        </mark-expected-failures>
     </library>
 
     <!-- tuple -->
@@ -3773,10 +3823,6 @@
         <mark-unusable>
             <toolset name="sunpro-5_3-sunos"/>
         </mark-unusable>
-        <test name="io_test">
-            <toolset name="intel-win32"/>
-            <note author="B. Dawes" refid="3"/>
-        </test>
     </library>
 
     <!-- type_traits -->
@@ -3795,10 +3841,8 @@
             <test name="remove_all_extents_test"/>
             <test name="rank_test"/>
             <test name="is_unsigned_test"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="Aleksey Gurtovoy">
                 This failure is caused by the lack of compiler support for class template
                 partial specialization. A limited subset of the tested functionality is
@@ -3809,32 +3853,31 @@
             </note>
         </mark-expected-failures>
         <mark-expected-failures>
-            <test name="tricky_incomplete_type_test"/>
             <test name="decay_test"/>
             <test name="extent_test"/>
+            <test name="is_base_and_derived_test"/>
             <test name="is_base_of_test"/>
+            <test name="is_convertible_test"/>
             <test name="rank_test"/>
             <test name="remove_all_extents_test"/>
+            <test name="remove_bounds_test"/>
+            <test name="remove_const_test"/>
             <test name="remove_extent_test"/>
+            <test name="remove_pointer_test"/>
+            <test name="remove_volatile_test"/>
+            <test name="tricky_add_pointer_test"/>
             <test name="tricky_function_type_test"/>
-            <toolset name="borland-5_6_4"/>
+            <test name="tricky_incomplete_type_test"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.6.4"/>
+            <toolset name="borland-5.8*"/>
+            <toolset name="borland-5.8*"/>
             <note author="John Maddock" refid="2"/>
         </mark-expected-failures>
         <test name="tricky_is_enum_test">
             <mark-failure>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5*"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="msvc-6.5*"/>
                 <toolset name="gcc-2.95.3-*"/>
             </mark-failure>
@@ -3847,30 +3890,22 @@
         </test>
         <test name="is_abstract_test">
             <mark-failure>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="cw-8_3*"/>
-                <toolset name="cw-9_3*"/>
-                <toolset name="cw-9_4*"/>
-                <toolset name="cw-9_5*"/>
+                <toolset name="borland-5.8*"/>
+                <toolset name="cw-8.3*"/>
+                <toolset name="cw-9.3*"/>
                 <toolset name="cw-9.4"/>
                 <toolset name="cw-9.5"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5*"/>
                 <toolset name="msvc-6.5*"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <toolset name="mingw-3_3*"/>
                 <toolset name="gcc-2*"/>
                 <toolset name="gcc-3.2*"/>
                 <toolset name="gcc-3.3*"/>
-                <toolset name="gcc-3_3*"/>
                 <toolset name="qcc-3.3*"/>
                 <toolset name="sunpro-5_3-sunos"/>
-                <toolset name="tru64cxx65-042"/>
+                <toolset name="tru64cxx65-*"/>
+                <toolset name="hp_cxx-65*"/>
                 <toolset name="darwin"/>
                 <toolset name="mingw"/>
                 <note author="Aleksey Gurtovoy">
@@ -3929,7 +3964,28 @@
             <toolset name="sunpro-5_3-sunos"/>
             <note author="John Maddock" refid="2"/>
         </mark-expected-failures>
-        <mark-expected-failures>
+       <mark-expected-failures>
+          <test name="decay_test"/>
+          <test name="extent_test"/>
+          <test name="is_abstract_test"/>
+          <test name="is_empty_test"/>
+          <test name="is_function_test"/>
+          <test name="is_member_func_test"/>
+          <test name="is_member_obj_test"/>
+          <test name="is_object_test"/>
+          <test name="is_reference_test"/>
+          <test name="rank_test"/>
+          <test name="tricky_function_type_test"/>
+          <toolset name="sun-5.8"/>
+
+          <note author="John Maddock">
+             The Type Traits library is broken when used with Sunpro-5.8 and the
+             argument to the template is a function type.  Most other argument types
+             do work as expected: in other words the functionality is limited
+             with this compiler, but not so much as to render the library unuseable.
+          </note>
+       </mark-expected-failures>
+       <mark-expected-failures>
             <test name="tricky_function_type_test"/>
             <test name="is_const_test"/>
             <test name="is_volatile_test"/>
@@ -3939,7 +3995,7 @@
         </mark-expected-failures>
         <mark-expected-failures>
             <test name="aligned_storage_test"/>
-            <toolset name="cw-8_3"/>
+            <toolset name="cw-8.3"/>
             <note author="John Maddock">
                Older versions of MWCW incorrectly align pointers to member functions
                (they use 12-byte boundaries, rather than a power-of-2 boundary),
@@ -3952,10 +4008,10 @@
     <!-- tr1 -->
     <library name="tr1">
         <mark-unusable>
-            <toolset name="msvc"/>
-            <toolset name="VC6*"/>
+            <toolset name="msvc-7.0"/>
+            <toolset name="msvc-6*"/>
             <note author="John Maddock">
-                VC6 has a buggy using declaration syntax which
+                VC6/7 has a buggy using declaration syntax which
                 basically makes it impossible to implement the 
                 namespace forwarding that this library relies upon.
                 See KB article 263630 here: http://support.microsoft.com/default.aspx?scid=kb;en-us;263630
@@ -3971,17 +4027,16 @@
             </note>
         </mark-unusable>
         <mark-expected-failures>
-            <test name="test_array_tricky"/>
             <test name="test_mem_fn_tricky"/>
             <test name="test_bind_tricky"/>
-            <test name="test_reference_wrapper_tricky"/>
+            <test name="test_ref_wrapper_tricky"/>
             <test name="test_function_tricky"/>
-            <test name="std_test_array_tricky"/>
             <test name="std_test_mem_fn_tricky"/>
             <test name="std_test_bind_tricky"/>
+            <test name="std_test_ref_wrapper_tricky"/>
+            <test name="std_test_function_tricky"/>
             <test name="std_test_reference_wrapper_tricky"/>
-            <test name="std_test_function_tricky"/>
-            <test name="std_test_tuple_tricky"/>
+            <test name="test_reference_wrapper_tricky"/>
             <toolset name="*"/>
             <note author="John Maddock">
                 These tests test features that are not supported in the
@@ -3997,7 +4052,7 @@
             <test name="test_hash"/>
             <test name="std_test_hash"/>
             <toolset name="mingw*"/>
-            <toolset name="qcc-3.3.5-gpp*"/>
+            <toolset name="qcc*gpp"/>
             <toolset name="gcc-2*"/>
             <note author="John Maddock">
                These tests fail on this platform due to a lack of
@@ -4008,6 +4063,8 @@
         <mark-expected-failures>
             <test name="test_array"/>
             <test name="std_test_array"/>
+            <test name="test_array_tricky"/>
+            <test name="std_test_array_tricky"/>
             <test name="test_complex"/>
             <test name="std_test_complex"/>
             <test name="test_function"/>
@@ -4026,6 +4083,8 @@
             <test name="std_test_tr1_include"/>
             <test name="test_tuple"/>
             <test name="std_test_tuple"/>
+            <test name="test_tuple_tricky"/>
+            <test name="std_test_tuple_tricky"/>
             <test name="test_type_traits"/>
             <test name="std_test_type_traits"/>
             <test name="run_complex_overloads"/>
@@ -4033,57 +4092,57 @@
             <test name="run_random"/>
             <test name="std_run_random"/>
             <test name="test_tuple_tricky"/>
-           <test name="tr1_add_const_test"/>
-           <test name="tr1_add_cv_test"/>
-           <test name="tr1_add_pointer_test"/>
-           <test name="tr1_add_reference_test"/>
-           <test name="tr1_add_volatile_test"/>
-           <test name="tr1_aligned_storage_test"/>
-           <test name="tr1_alignment_of_test"/>
-           <test name="tr1_has_nothrow_assign_test"/>
-           <test name="tr1_has_nothrow_constr_test"/>
-           <test name="tr1_has_nothrow_copy_test"/>
-           <test name="tr1_has_trivial_assign_test"/>
-           <test name="tr1_has_trivial_constr_test"/>
-           <test name="tr1_has_trivial_copy_test"/>
-           <test name="tr1_has_trivial_destructor_test"/>
-           <test name="tr1_has_virtual_destructor_test"/>
-           <test name="tr1_is_arithmetic_test"/>
-           <test name="tr1_is_array_test"/>
-           <test name="tr1_is_class_test"/>
-           <test name="tr1_is_compound_test"/>
-           <test name="tr1_is_const_test"/>
-           <test name="tr1_is_convertible_test"/>
-           <test name="tr1_is_empty_test"/>
-           <test name="tr1_is_enum_test"/>
-           <test name="tr1_is_floating_point_test"/>
-           <test name="tr1_is_function_test"/>
-           <test name="tr1_is_fundamental_test"/>
-           <test name="tr1_is_integral_test"/>
-           <test name="tr1_is_member_func_test"/>
-           <test name="tr1_is_member_obj_test"/>
-           <test name="tr1_is_member_pointer_test"/>
-           <test name="tr1_is_object_test"/>
-           <test name="tr1_is_pod_test"/>
-           <test name="tr1_is_pointer_test"/>
-           <test name="tr1_is_polymorphic_test"/>
-           <test name="tr1_is_reference_test"/>
-           <test name="tr1_is_same_test"/>
-           <test name="tr1_is_scalar_test"/>
-           <test name="tr1_is_signed_test"/>
-           <test name="tr1_is_union_test"/>
-           <test name="tr1_is_unsigned_test"/>
-           <test name="tr1_is_void_test"/>
-           <test name="tr1_is_volatile_test"/>
-           <test name="tr1_remove_const_test"/>
-           <test name="tr1_remove_cv_test"/>
-           <test name="tr1_remove_pointer_test"/>
-           <test name="tr1_remove_reference_test"/>
-           <test name="tr1_remove_volatile_test"/>
-           <test name="tr1_tricky_abstract_type_test"/>
-           <test name="tr1_tricky_add_pointer_test"/>
-           <test name="tr1_tricky_partial_spec_test"/>
-            <toolset name="borland*"/>
+            <test name="tr1_add_const_test"/>
+            <test name="tr1_add_cv_test"/>
+            <test name="tr1_add_pointer_test"/>
+            <test name="tr1_add_reference_test"/>
+            <test name="tr1_add_volatile_test"/>
+            <test name="tr1_aligned_storage_test"/>
+            <test name="tr1_alignment_of_test"/>
+            <test name="tr1_has_nothrow_assign_test"/>
+            <test name="tr1_has_nothrow_constr_test"/>
+            <test name="tr1_has_nothrow_copy_test"/>
+            <test name="tr1_has_trivial_assign_test"/>
+            <test name="tr1_has_trivial_constr_test"/>
+            <test name="tr1_has_trivial_copy_test"/>
+            <test name="tr1_has_trivial_destr_test"/>
+            <test name="tr1_has_virtual_destr_test"/>
+            <test name="tr1_is_arithmetic_test"/>
+            <test name="tr1_is_array_test"/>
+            <test name="tr1_is_class_test"/>
+            <test name="tr1_is_compound_test"/>
+            <test name="tr1_is_const_test"/>
+            <test name="tr1_is_convertible_test"/>
+            <test name="tr1_is_empty_test"/>
+            <test name="tr1_is_enum_test"/>
+            <test name="tr1_is_floating_point_test"/>
+            <test name="tr1_is_function_test"/>
+            <test name="tr1_is_fundamental_test"/>
+            <test name="tr1_is_integral_test"/>
+            <test name="tr1_is_member_func_test"/>
+            <test name="tr1_is_member_obj_test"/>
+            <test name="tr1_is_member_pointer_test"/>
+            <test name="tr1_is_object_test"/>
+            <test name="tr1_is_pod_test"/>
+            <test name="tr1_is_pointer_test"/>
+            <test name="tr1_is_polymorphic_test"/>
+            <test name="tr1_is_reference_test"/>
+            <test name="tr1_is_same_test"/>
+            <test name="tr1_is_scalar_test"/>
+            <test name="tr1_is_signed_test"/>
+            <test name="tr1_is_union_test"/>
+            <test name="tr1_is_unsigned_test"/>
+            <test name="tr1_is_void_test"/>
+            <test name="tr1_is_volatile_test"/>
+            <test name="tr1_remove_const_test"/>
+            <test name="tr1_remove_cv_test"/>
+            <test name="tr1_remove_pointer_test"/>
+            <test name="tr1_remove_reference_test"/>
+            <test name="tr1_remove_volatile_test"/>
+            <test name="tr1_tky_abstract_type_test"/>
+            <test name="tr1_tricky_add_pointer_test"/>
+            <test name="tr1_tky_partial_spec_test"/>
+            <toolset name="borland-5.6*"/>
             <note author="John Maddock">
                Support for Borland C++ in the various TR1 libraries is pretty
                poor (due to numerous compiler bugs sadly).  The TR1 concept
@@ -4096,9 +4155,49 @@
         </mark-expected-failures>
 
         <mark-expected-failures>
+            <test name="test_complex"/>
+            <test name="std_test_complex"/>
+            <test name="test_function"/>
+            <test name="std_test_function"/>
+            <test name="test_mem_fn"/>
+            <test name="std_test_mem_fn"/>
+            <test name="test_random"/>
+            <test name="std_test_random"/>
+            <test name="test_result_of"/>
+            <test name="std_test_result_of"/>
+            <test name="test_shared_ptr"/>
+            <test name="std_test_shared_ptr"/>
+            <test name="test_tuple"/>
+            <test name="std_test_tuple"/>
+            <test name="test_tuple_tricky"/>
+            <test name="std_test_tuple_tricky"/>
+            <test name="test_type_traits"/>
+            <test name="std_test_type_traits"/>
+            <test name="run_complex_overloads"/>
+            <test name="std_run_complex_overloads"/>
+            <test name="run_random"/>
+            <test name="std_run_random"/>
+            <test name="test_tuple_tricky"/>
+            <test name="tr1_is_convertible_test"/>
+            <test name="tr1_remove_const_test"/>
+            <test name="tr1_remove_pointer_test"/>
+            <test name="tr1_remove_volatile_test"/>
+            <test name="tr1_tricky_add_pointer_test"/>
+            <toolset name="borland-5.8*"/>
+            <note author="John Maddock">
+               Support for Borland C++ in the various TR1 libraries is pretty
+               poor (due to numerous compiler bugs sadly).  The TR1 concept
+               checks are *very* strict, and are expected to fail with this
+               compiler.  More conservative uses are more likely to succeed
+               with this compiler however.
+            </note>
+        </mark-expected-failures>
+
+        <mark-expected-failures>
             <test name="std_test_bind"/>
             <test name="test_bind"/>
-            <toolset name="gcc-4_0-darwin"/>
+            <toolset name="gcc-4*darwin"/>
+            <toolset name="darwin*"/>
             <note author="John Maddock">
                These tests fail on this platform due to a recuring GCC bug.
             </note>
@@ -4109,12 +4208,11 @@
             <test name="std_test_type_traits"/>
             <test name="tr1_is_abstract_test"/>
             <toolset name="gcc-3.3.*"/>
-            <toolset name="gcc-3_3*"/>
-            <toolset name="qcc-3.3.*"/>
             <toolset name="gcc-3.2*"/>
+            <toolset name="qcc-3.3*"/>
             <note author="John Maddock">
                These tests fail due to a known compiler bug 
-               that is fixed in more recent releases.  Users are
+               that is fixed in more recent GNU compiler releases.  Users are
                very unlikely to encounter this as a real problem 
                in practice.
             </note>
@@ -4167,7 +4265,7 @@
            <test name="std_run_complex_overloads"/>
            <test name="std_test_complex"/>
            <test name="test_complex"/>
-           <toolset name="qcc-3.3.5-gpp"/>
+           <toolset name="qcc-3.3.5*gpp"/>
             <note author="John Maddock">
                These tests fail due to a known stdlib bug 
                that has been reported to the vendor.
@@ -4188,10 +4286,8 @@
             <test name="tr1_remove_all_extents_test"/>
             <test name="tr1_rank_test"/>
             <test name="tr1_is_unsigned_test"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="Aleksey Gurtovoy">
                 This failure is caused by the lack of compiler support for class template
                 partial specialization. A limited subset of the tested functionality is
@@ -4202,32 +4298,23 @@
             </note>
         </mark-expected-failures>
         <mark-expected-failures>
-            <test name="tr1_tricky_incomplete_type_test"/>
+            <test name="tr1_tky_incomplete_type_test"/>
+            <test name="tr1_tky_incomp_type_test"/>
             <test name="tr1_decay_test"/>
             <test name="tr1_extent_test"/>
             <test name="tr1_is_base_of_test"/>
             <test name="tr1_rank_test"/>
             <test name="tr1_remove_all_extents_test"/>
             <test name="tr1_remove_extent_test"/>
-            <test name="tr1_tricky_function_type_test"/>
-            <toolset name="borland-5_6_4"/>
+            <test name="tr1_tky_function_type_test"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <note author="John Maddock" refid="2"/>
         </mark-expected-failures>
         <test name="tr1_tricky_is_enum_test">
             <mark-failure>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5*"/>
+                <toolset name="borland-5.8*"/>
                 <toolset name="msvc-6.5*"/>
                 <toolset name="gcc-2.95.3-*"/>
             </mark-failure>
@@ -4238,29 +4325,37 @@
                 <note author="John Maddock" refid="2"/>
             </mark-failure>
         </test>
+        <test name="tr1_tricky_incomp_type_test">
+            <mark-failure>
+                <toolset name="iw-7_1*"/>
+                <note author="John Maddock" refid="2"/>
+            </mark-failure>
+        </test>
+        <test name="tr1_tky_incomp_type_test">
+            <mark-failure>
+                <toolset name="iw-7_1*"/>
+                <note author="John Maddock" refid="2"/>
+            </mark-failure>
+        </test>
         <test name="tr1_is_abstract_test">
             <mark-failure>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
-                <toolset name="cw-8_3*"/>
-                <toolset name="cw-9_3*"/>
-                <toolset name="cw-9_4*"/>
-                <toolset name="cw-9_5*"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5*"/>
+                <toolset name="borland-5.8*"/>
+                <toolset name="cw-8.3*"/>
+                <toolset name="cw-9.3*"/>
+                <toolset name="cw-9.4*"/>
+                <toolset name="cw-9.5*"/>
                 <toolset name="msvc-6.5*"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <toolset name="mingw-3_3*"/>
                 <toolset name="gcc-2*"/>
                 <toolset name="gcc-3.2*"/>
                 <toolset name="gcc-3.3*"/>
                 <toolset name="gcc-3_3*"/>
+                <toolset name="qcc-3_3*"/>
                 <toolset name="sunpro-5_3-sunos"/>
-                <toolset name="tru64cxx65-042"/>
+                <toolset name="tru64cxx65*"/>
+                <toolset name="hp_cxx-65*"/>
                 <toolset name="darwin"/>
                 <toolset name="mingw"/>
                 <note author="Aleksey Gurtovoy">
@@ -4285,7 +4380,7 @@
             <test name="tr1_has_trivial_assign_test"/>
             <test name="tr1_has_trivial_constr_test"/>
             <test name="tr1_has_trivial_copy_test"/>
-            <test name="tr1_has_trivial_destructor_test"/>
+            <test name="tr1_has_trivial_destr_test"/>
             <test name="tr1_is_array_test"/>
             <test name="tr1_is_base_and_derived_test"/>
             <test name="tr1_is_base_of_test"/>
@@ -4307,7 +4402,55 @@
                 with this compiler, but not so much as to render the library unuseable.
             </note>
         </mark-expected-failures>
-        <mark-expected-failures>
+       <mark-expected-failures>
+          <test name="tr1_decay_test"/>
+          <test name="tr1_extent_test"/>
+          <test name="tr1_is_abstract_test"/>
+          <test name="tr1_is_empty_test"/>
+          <test name="tr1_is_function_test"/>
+          <test name="tr1_is_member_func_test"/>
+          <test name="tr1_is_member_obj_test"/>
+          <test name="tr1_is_object_test"/>
+          <test name="tr1_is_reference_test"/>
+          <test name="tr1_rank_test"/>
+          <test name="tr1_tricky_function_type_test"/>
+          <test name="tr1_tky_function_type_test"/>
+          <test name="test_type_traits"/>
+          <test name="std_test_type_traits"/>
+          <toolset name="sun-5.8"/>
+
+          <note author="John Maddock">
+             The Type Traits library is broken when used with Sunpro-5.8 and the
+             argument to the template is a function type.  Most other argument types
+             do work as expected: in other words the functionality is limited
+             with this compiler, but not so much as to render the library unuseable.
+          </note>
+       </mark-expected-failures>
+       <mark-expected-failures>
+          <test name="test_random"/>
+          <test name="std_test_random"/>
+          <toolset name="sun-5.8"/>
+
+          <note author="John Maddock">
+             These failures appear to represent a genuine issue with the
+             Boost.Random library that has yet to be addressed.
+          </note>
+       </mark-expected-failures>
+       <mark-expected-failures>
+          <test name="test_boost"/>
+          <test name="test_hash"/>
+          <test name="test_random"/>
+          <test name="test_regex"/>
+          <toolset name="msvc-7.1_stlport4"/>
+
+          <note author="John Maddock">
+             These failures are completely spurious: they're caused by the tests
+             being run with bjam -j2 and the post-processing not coping with the
+             resulting output.  These failures should clear if these tests
+             are re-run at some point in the future.
+          </note>
+       </mark-expected-failures>
+       <mark-expected-failures>
             <test name="tr1_is_empty_test"/>
             <test name="tr1_is_function_test"/>
             <test name="tr1_is_member_func_test"/>
@@ -4315,11 +4458,12 @@
             <test name="tr1_is_reference_test"/>
             <test name="tr1_tricky_function_type_test"/>
             <test name="tr1_tricky_incomplete_type_test"/>
+            <test name="tr1_tricky_incomp_type_test"/>
             <test name="tr1_tricky_is_enum_test"/>
             <toolset name="sunpro-5_3-sunos"/>
             <note author="John Maddock" refid="2"/>
         </mark-expected-failures>
-        <mark-expected-failures>
+       <mark-expected-failures>
             <test name="tr1_tricky_function_type_test"/>
             <test name="tr1_is_const_test"/>
             <test name="tr1_is_volatile_test"/>
@@ -4328,8 +4472,36 @@
             <note author="John Maddock" refid="2"/>
         </mark-expected-failures>
         <mark-expected-failures>
+            <test name="test_array"/>
+            <test name="std_test_array"/>
+            <test name="test_array_tricky"/>
+            <test name="std_test_array_tricky"/>
+            <test name="test_bind"/>
+            <test name="std_test_bind"/>
+            <test name="test_complex"/>
+            <test name="std_test_complex"/>
+            <test name="test_function"/>
+            <test name="std_test_function"/>
+            <test name="test_random"/>
+            <test name="std_test_random"/>
+            <test name="test_reference_wrapper"/>
+            <test name="std_test_reference_wrapper"/>
+            <test name="test_regex"/>
+            <test name="std_test_regex"/>
+            <test name="test_result_of"/>
+            <test name="std_test_result_of"/>
+            <test name="test_shared_ptr"/>
+            <test name="std_test_shared_ptr"/>
+            <test name="test_tuple"/>
+            <test name="std_test_tuple"/>
+            <toolset name="vc-7"/>
+            <note author="John Maddock">
+            This library is almost unusable with VC7 due to name lookup issues.
+            </note>
+        </mark-expected-failures>
+        <mark-expected-failures>
             <test name="tr1_aligned_storage_test"/>
-            <toolset name="cw-8_3"/>
+            <toolset name="cw-8.3"/>
             <note author="John Maddock">
                Older versions of MWCW incorrectly align pointers to member functions
                (they use 12-byte boundaries, rather than a power-of-2 boundary),
@@ -4342,18 +4514,11 @@
     <!-- utility/enable_if -->
     <library name="utility/enable_if">
         <mark-unusable>
-            <toolset name="borland"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
-            <toolset name="cw-8_3*"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
+            <toolset name="borland-5.8*"/>
+            <toolset name="cw-8.3*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <toolset name="gcc-2.95.3-*"/>
             <note refid="3"/>
         </mark-unusable>
@@ -4382,12 +4547,8 @@
         </test>
         <test name="numeric_traits_test">
             <mark-failure>
-                <toolset name="borland-5_6_4"/>
                 <toolset name="borland-5.6.4"/>
-                <toolset name="borland-5_8_1"/>
-                <toolset name="borland-5.8.1"/>
-                <toolset name="borland-5_8_2"/>
-                <toolset name="borland-5.8.2"/>
+                <toolset name="borland-5.8*"/>
                 <note author="A.Meredith">
                   Compiler has a problem with BOOST_STATIC_CONSTANT in nested templates
                   inside class template specializations.
@@ -4397,11 +4558,9 @@
         <test name="result_of_test">
             <mark-failure>
                 <toolset name="borland-5*"/>
-                <toolset name="cw-8_3*"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5*"/>
+                <toolset name="cw-8.3*"/>
                 <toolset name="msvc-6.5*"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <toolset name="gcc-2.95.3*"/>
                 <toolset name="sunpro-5_3-sunos"/>
                 <note refid="3" author="D. Gregor"/>
@@ -4409,16 +4568,26 @@
         </test>
         <mark-expected-failures>
             <test name="value_init_test"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="Aleksey Gurtovoy">
                 This failure is caused by a compiler bug (default-constructed scalar
                 types are not zero-initialized) that has been fixed in the latest
                 versions of the compiler (VC 7.1 and greater).
             </note>
         </mark-expected-failures>
+        <mark-expected-failures>
+            <test name="operators_test"/>
+            <toolset name="gcc-3.4.5_linux_x86_64"/>
+            <note author="Vladimir Prus">
+                The test takes more that 30 minutes to compile and the
+                compilation is automatically killed. It is likely caused
+                by the compiler bug, but it unknown how much this
+                bug affects regular use of the operators library. Is it
+                also unknown if the test can be refactored so that
+                not to trigger this bug.
+            </note>
+        </mark-expected-failures>
     </library>
 
 
@@ -4428,15 +4597,14 @@
             <toolset name="mipspro"/>
             <toolset name="sunpro-5_3-sunos"/>
             <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <note refid="2"/>
         </mark-unusable>
         <test name="recursive_variant_test">
             <mark-failure>
                 <toolset name="como-win32"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5*"/>
                 <toolset name="msvc-6.5*"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note refid="3"/>
             </mark-failure>
         </test>
@@ -4445,26 +4613,18 @@
             <test name="variant_test1"/>
             <test name="variant_test5"/>
             <test name="variant_visit_test"/>
-            <toolset name="borland"/>
-            <toolset name="borland-5_6_4"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <note author="Aleksey Gurtovoy" refid="3"/>
         </mark-expected-failures>
         <test name="variant_reference_test">
             <mark-failure>
-                <toolset name="cw-8_3*"/>
-                <toolset name="msvc"/>
-                <toolset name="vc-6_5*"/>
+                <toolset name="cw-8.3*"/>
                 <toolset name="msvc-6.5*"/>
-                <toolset name="vc-7_0"/>
+                <toolset name="msvc-7.0"/>
                 <note refid="3"/>
             </mark-failure>
             <mark-failure>
-                <toolset name="intel-win32"/>
                 <toolset name="iw-7_1*"/>
                 <toolset name="intel-7.1*"/>
                 <note refid="2"/>
@@ -4475,25 +4635,19 @@
     <!-- wave -->
     <library name="wave">
         <mark-unusable>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
             <toolset name="sunpro-5_3-sunos"/>
-            <toolset name="borland-5_5_1"/>
-            <toolset name="borland-5_6_4"/>
+            <toolset name="borland-5.5.1"/>
             <toolset name="borland-5.6.4"/>
-            <toolset name="borland-5_8_1"/>
-            <toolset name="borland-5.8.1"/>
-            <toolset name="borland-5_8_2"/>
-            <toolset name="borland-5.8.2"/>
+            <toolset name="borland-5.8*"/>
             <toolset name="gcc-2.95.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.5.3-linux"/>
             <toolset name="gcc-2.95.3-stlport-4.6.2-linux"/>
             <toolset name="tru64cxx65*"/>
+            <toolset name="hp_cxx-65*"/>
             <note refid="29"/>
         </mark-unusable>
        <mark-unusable>
-            <toolset name="vc-7_0"/>
             <toolset name="msvc-7.0"/>
             <note>
                This toolset isn't supported because of the used Spirit V1.8.x, which in turn is
@@ -4511,16 +4665,16 @@
         <mark-expected-failures>
             <test name="testwave"/>
             <toolset name="gcc-3.2.3-linux"/>
-        <toolset name="gcc-3.2.3_linux"/>
+            <toolset name="gcc-3.2.3_linux"/>
             <toolset name="gcc-3.3.6-linux"/>
-            <toolset name="gcc-3.3.6"/>	    
+            <toolset name="gcc-3.3.6"/>
             <note author="Hartmut Kaiser" refid="29"/>
         </mark-expected-failures>
 
         <mark-expected-failures>
             <test name="testwave"/>
-            <toolset name="qcc-3.3.5_gpp"/>
-            <toolset name="qcc-3.3.5-gpp"/>
+            <!-- <toolset name="qcc-3.3.5_gpp"/> -->
+            <toolset name="qcc-3.3.5*gpp"/>
             <note author="Hartmut Kaiser" refid="29"/>
         </mark-expected-failures>
 
@@ -4538,7 +4692,7 @@
 
         <mark-expected-failures>
             <test name="test_slex_lexer"/>
-            <toolset name="hp_cxx-65_042_tru64"/>
+            <toolset name="hp_cxx-65*"/>
             <note author="Hartmut Kaiser" refid="2"/>
         </mark-expected-failures>
 
@@ -4549,10 +4703,8 @@
 
         <mark-unusable>
             <toolset name="gcc-2.95.3*"/>
-            <toolset name="msvc"/>
-            <toolset name="vc-6_5*"/>
             <toolset name="msvc-6.5*"/>
-            <toolset name="vc-7_0"/>
+            <toolset name="msvc-7.0"/>
             <note author="Eric Niebler">
                 These compilers do not support class template partial
                 specialization.
@@ -4565,7 +4717,7 @@
             </note>
         </mark-unusable>
         <mark-unusable>
-            <toolset name="cw-8_3"/>
+            <toolset name="cw-8.3"/>
             <note author="Eric Niebler">
                 This compiler doesn't support SFINAE / enable_if
             </note>
@@ -4577,6 +4729,11 @@
                 such as "template &lt; class T, bool B = is_foo &lt; T &gt; ::value &gt;"
             </note>
         </mark-unusable>
+        <mark-unusable>
+            <toolset name="sunpro-5_3-sunos"/>
+            <toolset name="sun-5.8"/>
+            <note refid="17"/>
+        </mark-unusable>
     </library>
 
     <!-- /////////////// Standard note definitions /////////////// -->
@@ -4586,7 +4743,7 @@
     </note>
 
     <note id="1">
-        The failure is caused by a problem in Boost code. The Boost developers is aware of
+        The failure is caused by a problem in Boost code. The Boost developers are aware of
         the problem and plan to fix it.
     </note>
 
@@ -4609,7 +4766,7 @@
     </note>
 
     <note id="6">
-        The failure is probably caused by the test code, harness, or configuration. Thus
+        The failure is probably caused by the test code, harness, or configuration. Thus,
         it may not affect users of the library.
     </note>
 
@@ -4691,7 +4848,7 @@
     </note>
 
     <note id="28">
-        Unresearched failure, please contact library developers for more
+        Unresearched failure -- please contact library developers for more
         information about possible causes.
     </note>
 
@@ -4745,6 +4902,24 @@
         supplied on the QNX Neutrino version 6.3.0 distribution. 
     </note>
 
-</explicit-failures-markup>
+    <note id="37">
+        This problem is due to the non-conforming STLport
+        implementation of vector's swap: it can be easily
+        reproduced with the following code snippet:
 
+            typedef std::vector&lt;int&gt; vector_type;
+            typedef vector_type::reference reference_type;
 
+            vector_type v1(4u, 1);
+            vector_type v2(7u, 0);
+
+            reference_type ref = v1[2];
+            int x = ref;
+
+            std::swap(v1, v2);
+            BOOST_CHECK(v2[2] == x); // ok
+            v2[2] = 1 - v2[2];
+            BOOST_CHECK(ref != x);   // oops
+    </note>
+
+</explicit-failures-markup>

Modified: boost/trunk/status/explicit-failures.xsd
===================================================================
--- boost/trunk/status/explicit-failures.xsd	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/status/explicit-failures.xsd	2007-02-16 16:48:35 UTC (rev 14035)
@@ -61,9 +61,9 @@
     <xs:element name="mark-expected-failures">
         <xs:complexType>
             <xs:sequence>
-                <xs:element ref="test" minOccurs="0" maxOccurs="unbounded"/>
-                <xs:element ref="toolset" minOccurs="0" maxOccurs="unbounded"/>
-                <xs:element ref="note" minOccurs="0"/>
+                <xs:element ref="test" maxOccurs="unbounded"/>
+                <xs:element ref="toolset" maxOccurs="unbounded"/>
+                <xs:element ref="note"/>
             </xs:sequence>
             <xs:attribute name="reason" type="xs:string"/>
         </xs:complexType>

Modified: boost/trunk/tools/Jamfile.v2
===================================================================
--- boost/trunk/tools/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
+# Copyright 2005 Rene Rivera 
+# Copyright 2005 Hartmut Kaiser 
+# Copyright 2005 John Maddock 
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 # Jamfile which builds all the tools.
 
 project 

Deleted: boost/trunk/tools/bcp/Jamfile
===================================================================
--- boost/trunk/tools/bcp/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/bcp/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,27 +0,0 @@
-# Inspect Jamfile
-
-subproject tools/bcp ;
-
-exe bcp
-  : add_path.cpp bcp_imp.cpp copy_path.cpp file_types.cpp
-    fileview.cpp main.cpp path_operations.cpp scan_cvs_path.cpp 
-    licence_info.cpp scan_licence.cpp output_licence_info.cpp
-  <lib>../../libs/filesystem/build/boost_filesystem
-  <lib>../../libs/regex/build/boost_regex
-  <lib>../../libs/test/build/boost_prg_exec_monitor
-  :
-  <sysinclude>$(BOOST_ROOT)
-  <define>BOOST_REGEX_NO_LIB=1
-  :
-        release
-  ;
-
-
-stage run
-    :
-        <exe>bcp
-    : : release ;
-
-
-
-

Modified: boost/trunk/tools/bcp/Jamfile.v2
===================================================================
--- boost/trunk/tools/bcp/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/bcp/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# (C) Copyright John Maddock 2006.
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
+
 exe bcp
     :
     add_path.cpp bcp_imp.cpp copy_path.cpp file_types.cpp
@@ -31,3 +35,4 @@
     :
     release
     ;
+

Modified: boost/trunk/tools/bcp/bcp.html
===================================================================
--- boost/trunk/tools/bcp/bcp.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/bcp/bcp.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -185,11 +185,9 @@
          <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
       </p>
       <P><I>© Copyright <a href="mailto:jm at regex.fsnet.co.uk">John Maddock</a>&nbsp;2003-4</I></P>
-      <P align="left"><I>Permission to use, copy, modify, distribute and sell this software 
-            and its documentation for any purpose is hereby granted without fee, provided 
-            that the above copyright notice appear in all copies and that both that 
-            copyright notice and this permission notice appear in supporting documentation. 
-            Dr John Maddock makes no representations about the suitability of this software 
-            for any purpose. It is provided "as is" without express or implied warranty.</I></P>
+      <P align="left"><I>Distributed under the Boost Software License, Version 1.0.
+       (See accompanying file LICENSE_1_0.txt or <a href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>) 
+       </I></P>
    </body>
 </html>
+

Modified: boost/trunk/tools/boostbook/doc/Jamfile.v2
===================================================================
--- boost/trunk/tools/boostbook/doc/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/doc/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+#   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+# 
+#   Distributed under the Boost Software License, Version 1.0.
+#   (See accompanying file LICENSE_1_0.txt or copy at
+#   http://www.boost.org/LICENSE_1_0.txt)
+
 project boost/doc ;
 import boostbook : boostbook ;
 

Modified: boost/trunk/tools/boostbook/doc/boostbook.xml
===================================================================
--- boost/trunk/tools/boostbook/doc/boostbook.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/doc/boostbook.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE part PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
 <part xmlns:xi="http://www.w3.org/2001/XInclude" id="boostbook"
-     last-revision="$Date: 2005/12/08 03:02:48 $">
+     last-revision="$Date: 2006/12/15 13:06:32 $">
   <partinfo>
     <author>
       <firstname>Douglas</firstname>
@@ -130,7 +137,7 @@
       <title>Manual setup for all systems</title>
     
       <para>This section describes how to manually configure Boost
-      Boost version 2 (BBv@) for BoostBook. If you can use the
+      Boost version 2 (BBv2) for BoostBook. If you can use the
       automatic setup script, you should. All configuration will
       happen in the BBv2 user configuration file,
       <filename>user-config.jam</filename>. If you do not have a copy
@@ -179,7 +186,7 @@
 
           <listitem><para>The DocBook DTD, available as a ZIP archive
           at the <ulink
-          url="http://www.oasis-open.org/docbook/xml/4.2/index.shtml">OASIS
+          url="http://www.oasis-open.org/docbook/xml/4.2/index.1.shtml">OASIS
           DocBook site</ulink>. The package is called "DocBook XML
           4.2". Extract the DocBook DTD to a directory on your hard
           disk (which we'll refer to as the
@@ -205,9 +212,13 @@
         documentation for libraries that do not require Doxygen. To
         test this, change into the directory <filename
         class="directory">$BOOST_ROOT/libs/function/doc</filename> and
-        run the command <code>bjam --v2</code>: it should produce HTML
+        run the command <code>bjam</code>: it should produce HTML
         documentation for the Boost.Function library in the
-        <code>html</code> subdirectory.</para>
+        <code>html</code> subdirectory. This documentation 
+	will look a little strange, because the BoostBook stylesheet is 
+	missing. You can copy the <code>boostbook.css</code> stylesheet from
+	<filename class="directory">$BOOST_ROOT/doc/html</filename> to
+	fix this problem.</para>
       </section>
 
       <section id="boostbook.setup.doxygen">

Modified: boost/trunk/tools/boostbook/doc/documenting.xml
===================================================================
--- boost/trunk/tools/boostbook/doc/documenting.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/doc/documenting.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE chapter PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
 <chapter xmlns:xi="http://www.w3.org/2001/XInclude" id="boostbook.documenting"
-         last-revision="$Date: 2004/07/05 16:26:11 $">
+         last-revision="$Date: 2006/11/03 19:39:44 $">
   <title>Documenting libraries</title>
     
   <para>BoostBook is an extension to <ulink
@@ -33,7 +40,7 @@
 &lt;!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd"&gt;
 &lt;library name="Any" dirname="any" xmlns:xi="http://www.w3.org/2001/XInclude"
-  id="any" last-revision="$Date: 2004/07/05 16:26:11 $"&gt;
+  id="any" last-revision="$Date: 2006/11/03 19:39:44 $"&gt;
   &lt;libraryinfo&gt;
     &lt;author&gt;
       &lt;firstname&gt;Kevlin&lt;/firstname&gt;
@@ -92,7 +99,7 @@
       <varlistentry>
         <term><code>last-revision</code></term>
         <listitem>
-          <simpara>Always set to <code>$Date: 2004/07/05 16:26:11 $</code>, which is
+          <simpara>Always set to <code>$Date: 2006/11/03 19:39:44 $</code>, which is
           expanded by CVS to include the date and time that the file
           was last modified.</simpara>
         </listitem>

Modified: boost/trunk/tools/boostbook/doc/reference.xml
===================================================================
--- boost/trunk/tools/boostbook/doc/reference.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/doc/reference.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" standalone="yes"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <chapter id="reference">
   <title>Reference</title>
   <para>Elements:<itemizedlist spacing="compact"><listitem><simpara><link linkend="boostbook.dtd.boostbook">Element <sgmltag>boostbook</sgmltag> - Defines a BoostBook book</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.class">Element <sgmltag>class</sgmltag> - Declares a class or class template</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.class-specialization">Element <sgmltag>class-specialization</sgmltag> - A specialization (partial or full) of a class template</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.code">Element <sgmltag>code</sgmltag> - Mimics the <sgmltag>code</sgmltag> tag in HTML</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.compile-fail-test">Element <sgmltag>compile-fail-test</sgmltag> - A testcase that should fail to compile</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.compile-test">Element <sgmltag>compile-test</sgmltag> - A testcase that should compile correctly</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.complexity">Element <sgmltag>complexity</sgmltag> - The time/space/etc. complexity of a function</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.constructor">Element <sgmltag>constructor</sgmltag> - Declares a constructor of the enclosing class</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.copy-assignment">Element <sgmltag>copy-assignment</sgmltag> - Declares a copy-assignment operator</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.data-member">Element <sgmltag>data-member</sgmltag> - Declares a data member of a class</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.default">Element <sgmltag>default</sgmltag> - The default value of a function or template parameter</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.description">Element <sgmltag>description</sgmltag> - Detailed description of a construct</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.destructor">Element <sgmltag>destructor</sgmltag> - Declares a destructor for the enclosing class</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.effects">Element <sgmltag>effects</sgmltag> - Declares the side effects of a function</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.enum">Element <sgmltag>enum</sgmltag> - Declares an enumeration type</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.enumvalue">Element <sgmltag>enumvalue</sgmltag> - A single value of an enumeration</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.free-function-group">Element <sgmltag>free-function-group</sgmltag> - A set of functions that are grouped together under one name</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.function">Element <sgmltag>function</sgmltag> - Declares a function</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.functionname">Element <sgmltag>functionname</sgmltag> - References a function with the given name</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.header">Element <sgmltag>header</sgmltag> - Declares a C++ header with the given name</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.if-fails">Element <sgmltag>if-fails</sgmltag> - What it means when a testcase fails</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.inherit">Element <sgmltag>inherit</sgmltag> - Declares a base class of the enclosing class or struct</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.lib">Element <sgmltag>lib</sgmltag> - A library dependency</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.library">Element <sgmltag>library</sgmltag> - Top-level element for a library</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.library-reference">Element <sgmltag>library-reference</sgmltag> - Declares the reference material for a library</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.librarycategory">Element <sgmltag>librarycategory</sgmltag> - Declares that the enclosing library is in this category</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.librarycategorydef">Element <sgmltag>librarycategorydef</sgmltag> - Defines a new library category</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.librarycategorylist">Element <sgmltag>librarycategorylist</sgmltag> - Categorized listing of libraries</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.libraryinfo">Element <sgmltag>libraryinfo</sgmltag> - Provides information about a library</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.librarylist">Element <sgmltag>librarylist</sgmltag> - Placeholder for an alphabetical list of libraries</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.libraryname">Element <sgmltag>libraryname</sgmltag> - References a library of the given name</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.librarypurpose">Element <sgmltag>librarypurpose</sgmltag> - Describes in one short sentence or phrase the purpose of a library</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.link-fail-test">Element <sgmltag>link-fail-test</sgmltag> - Declares a test that should compile but fail to link</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.link-test">Element <sgmltag>link-test</sgmltag> - Declares a test that should compile and link</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.method">Element <sgmltag>method</sgmltag> - Declares a method, i.e., a member function</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.method-group">Element <sgmltag>method-group</sgmltag> - A set of methods that are grouped together under one name</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.namespace">Element <sgmltag>namespace</sgmltag> - Declares a namespace</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.notes">Element <sgmltag>notes</sgmltag> - Non-normative notes about a function's semantics</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.overloaded-function">Element <sgmltag>overloaded-function</sgmltag> - An overloaded function</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.overloaded-method">Element <sgmltag>overloaded-method</sgmltag> - An overloaded method</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.parameter">Element <sgmltag>parameter</sgmltag> - A function parameter</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.paramtype">Element <sgmltag>paramtype</sgmltag> - The type of a function parameter</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.postconditions">Element <sgmltag>postconditions</sgmltag> - Conditions that must hold after the function returns</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.precondition">Element <sgmltag>precondition</sgmltag> - Conditions that must be met prior to executing a function</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.programlisting">Element <sgmltag>programlisting</sgmltag> - A sample of program code</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.purpose">Element <sgmltag>purpose</sgmltag> - A short description of an entity's use</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.rationale">Element <sgmltag>rationale</sgmltag> - Describes the rationale for a particular function's design</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.requirement">Element <sgmltag>requirement</sgmltag> - A requirement/property in the Jamfile for a testcase</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.requires">Element <sgmltag>requires</sgmltag> - Declares the requirements of a function</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.returns">Element <sgmltag>returns</sgmltag> - Description of the return value of a function</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.run-fail-test">Element <sgmltag>run-fail-test</sgmltag> - A testcase that should compile and link, but fail on execution</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.run-test">Element <sgmltag>run-test</sgmltag> - A testcase that should compile, link, and execute</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.signature">Element <sgmltag>signature</sgmltag> - One signature of an overloaded function or method</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.snippet">Element <sgmltag>snippet</sgmltag> - Pulls in a code snippet from a <sgmltag>programlisting</sgmltag> element</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.source">Element <sgmltag>source</sgmltag> - Defines source code for a test</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.specialization">Element <sgmltag>specialization</sgmltag> - Defines the specialization arguments for a class specialization</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.static-constant">Element <sgmltag>static-constant</sgmltag> - Declares a static constant, e.g., <code>const int foo = 5;</code>.</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.struct">Element <sgmltag>struct</sgmltag> - Declares a C++ struct</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.struct-specialization">Element <sgmltag>struct-specialization</sgmltag> - A specialization (full or partial) of a struct template</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.template">Element <sgmltag>template</sgmltag> - Declares the template parameters of a class or function</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.template-arg">Element <sgmltag>template-arg</sgmltag> - A template argument in a specialization</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.template-nontype-parameter">Element <sgmltag>template-nontype-parameter</sgmltag> - A nontype template parameter</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.template-type-parameter">Element <sgmltag>template-type-parameter</sgmltag> - Declares a template type parameter</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.template-varargs">Element <sgmltag>template-varargs</sgmltag> - Declares a variable-length list of template parameters</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.testsuite">Element <sgmltag>testsuite</sgmltag> - Describes a library testsuite</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.throws">Element <sgmltag>throws</sgmltag> - Description of the exceptions thrown by a function</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.type">Element <sgmltag>type</sgmltag> - The type of an element or return type of a function</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.typedef">Element <sgmltag>typedef</sgmltag> - Declares a typedef</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.union">Element <sgmltag>union</sgmltag> - Declares a C++ union or union template</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.union-specialization">Element <sgmltag>union-specialization</sgmltag> - A specialization (full or partial) of a union template</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.using-class">Element <sgmltag>using-class</sgmltag> - Injects the method and function names of a class into the local scope</link></simpara></listitem><listitem><simpara><link linkend="boostbook.dtd.using-namespace">Element <sgmltag>using-namespace</sgmltag> - Injects the declared names from a namespace into the local scope</link></simpara></listitem></itemizedlist></para>
@@ -29,7 +36,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -133,7 +140,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -169,7 +176,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -211,7 +218,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -251,7 +258,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>specifiers</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>The specifiers for this function, e.g., inline, static, etc.</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -287,7 +294,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -332,7 +339,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -370,7 +377,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -433,7 +440,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -473,7 +480,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -508,7 +515,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -550,7 +557,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>access</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry/></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -593,7 +600,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -711,7 +718,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>specifiers</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>The specifiers for this function, e.g., inline, static, etc.</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
@@ -748,7 +755,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -822,7 +829,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>cv</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>cv-qualifiers for this method, e.g., const volatile</entry></row>
 <row><entry>specifiers</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>The specifiers for this function, e.g., inline, static, etc.</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
@@ -898,7 +905,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>specifiers</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>The specifiers for this function, e.g., inline, static, etc.</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -950,7 +957,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -1009,7 +1016,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -1053,7 +1060,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -1088,7 +1095,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -1124,7 +1131,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -1159,7 +1166,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -1195,7 +1202,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -1230,7 +1237,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -1266,7 +1273,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -1301,7 +1308,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -1336,7 +1343,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -1414,7 +1421,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -1449,7 +1456,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -1484,7 +1491,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -1554,7 +1561,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -1598,7 +1605,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>cv</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>cv-qualifiers for this method, e.g., const volatile</entry></row>
 <row><entry>specifiers</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>The specifiers for this function, e.g., inline, static, etc.</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
@@ -1669,7 +1676,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -1738,7 +1745,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -1773,7 +1780,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -1850,7 +1857,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>cv</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>cv-qualifiers for this method, e.g., const volatile</entry></row>
 <row><entry>specifiers</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>The specifiers for this function, e.g., inline, static, etc.</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
@@ -1892,7 +1899,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -1973,7 +1980,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -2012,7 +2019,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -2048,7 +2055,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -2083,7 +2090,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -2124,7 +2131,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -2193,7 +2200,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -2228,7 +2235,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -2263,7 +2270,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -2299,7 +2306,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>dirname</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry/></row>
 <row><entry>url</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry/></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
@@ -2343,7 +2350,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -2378,7 +2385,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -2414,7 +2421,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -2450,7 +2457,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -2503,7 +2510,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -2539,7 +2546,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -2574,7 +2581,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -2609,7 +2616,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -2644,7 +2651,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -2679,7 +2686,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>
@@ -2714,7 +2721,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>name</entry><entry>#REQUIRED</entry><entry>CDATA</entry><entry>The name of the element being declared to referenced</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
@@ -2750,7 +2757,7 @@
           </thead>
           <tbody>
 
-<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2004/07/05 16:26:11 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
+<row><entry>last-revision</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Set to $Date: 2006/11/03 19:39:44 $ to keep &quot;last revised&quot; information in sync with CVS changes</entry></row>
 <row><entry>id</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>A global identifier for this element</entry></row>
 <row><entry>xml:base</entry><entry>#IMPLIED</entry><entry>CDATA</entry><entry>Implementation detail used by XIncludes</entry></row>
 </tbody>

Modified: boost/trunk/tools/boostbook/doc/together.xml
===================================================================
--- boost/trunk/tools/boostbook/doc/together.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/doc/together.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,15 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE chapter PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
 <chapter xmlns:xi="http://www.w3.org/2001/XInclude" id="boostbook.together"
-         last-revision="$Date: 2004/07/05 16:26:11 $">
+         last-revision="$Date: 2006/11/03 19:39:44 $">
   <title>Bringing Together a BoostBook Document</title>
 
   <section id="boostbook.linking">

Modified: boost/trunk/tools/boostbook/setup_boostbook.py
===================================================================
--- boost/trunk/tools/boostbook/setup_boostbook.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/setup_boostbook.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+#   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+# 
+#   Distributed under the 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 is a rewrite of setup_boostbook.sh in Python
 # It will work on Posix and Windows systems
 # The rewrite is not finished yet, so please don't use it
@@ -7,7 +13,7 @@
 DOCBOOK_XSL_VERSION = "1.67.2"
 DOCBOOK_DTD_VERSION = "4.2"
 FOP_VERSION = "0.20.5"
-FOP_MIRROR = "http://mirrors.ibiblio.org/pub/mirrors/apache/xml/fop/"
+FOP_MIRROR = "http://mirrors.ibiblio.org/pub/mirrors/apache/xmlgraphics/fop/"
 SOURCEFORGE_MIRROR = "http://puzzle.dl.sourceforge.net"
 
 # No user configuration below this point-------------------------------------

Modified: boost/trunk/tools/boostbook/setup_boostbook.sh
===================================================================
--- boost/trunk/tools/boostbook/setup_boostbook.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/setup_boostbook.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,9 @@
 #!/bin/sh
+#   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+# 
+#   Distributed under the Boost Software License, Version 1.0.
+#   (See accompanying file LICENSE_1_0.txt or copy at
+#   http://www.boost.org/LICENSE_1_0.txt)
 
 # User configuration
 DOCBOOK_XSL_VERSION=1.68.1

Modified: boost/trunk/tools/boostbook/xsl/admon.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/admon.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/admon.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
 

Modified: boost/trunk/tools/boostbook/xsl/annotation.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/annotation.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/annotation.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,14 +1,22 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
   <xsl:key name="classes" match="class|struct|union" use="@name"/>
   <xsl:key name="methods" match="method|overloaded-method" use="@name"/>
   <xsl:key name="functions" match="function|overloaded-function" use="@name"/>
   <xsl:key name="enums" match="enum" use="@name"/>
+  <xsl:key name="concepts" match="concept" use="@name"/>
   <xsl:key name="libraries" match="library" use="@name"/>
   <xsl:key name="macros" match="macro" use="@name"/>
   <xsl:key name="headers" match="header" use="@name"/>
-  <xsl:key name="named-entities" match="class|struct|union|function|overloaded-function|macro|library|namespace/data-member|header/data-member|*[attribute::id]" use="@name|@id"/>
+  <xsl:key name="named-entities" match="class|struct|union|concept|function|overloaded-function|macro|library|namespace/data-member|header/data-member|*[attribute::id]" use="@name|@id"/>
 
   <xsl:template match="function|overloaded-function" mode="generate.id">
     <xsl:variable name="name" select="normalize-space(@name)"/>

Modified: boost/trunk/tools/boostbook/xsl/caramel/concept2docbook.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/caramel/concept2docbook.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/caramel/concept2docbook.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,9 +5,10 @@
                         All rights reserved.
 Copyright (c) 2000-2001 University of Notre Dame. All rights reserved.
 
-The software included in this source file is licensed under the terms and
-conditions of the Software License, version 1.0, in the file LICENSE at the
-top level of the Caramel distribution. -->
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+-->
 
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform" version="1.0">
   <xsl:strip-space elements="* xsl:*"/>

Modified: boost/trunk/tools/boostbook/xsl/caramel/cpp-operators.xml
===================================================================
--- boost/trunk/tools/boostbook/xsl/caramel/cpp-operators.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/caramel/cpp-operators.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,9 +5,9 @@
                         All rights reserved.
 Copyright (c) 2000-2001 University of Notre Dame. All rights reserved.
 
-The software included in this source file is licensed under the terms and
-conditions of the Software License, version 1.0, in the file LICENSE at the
-top level of the Caramel distribution. -->
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt) -->
 
 <operator-list>
   <!-- This list is from Pohl's book, and needs to be checked for accuracy -->

Modified: boost/trunk/tools/boostbook/xsl/caramel/unparser.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/caramel/unparser.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/caramel/unparser.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,9 +5,9 @@
                         All rights reserved.
 Copyright (c) 2000-2001 University of Notre Dame. All rights reserved.
 
-The software included in this source file is licensed under the terms and
-conditions of the Software License, version 1.0, in the file LICENSE at the
-top level of the Caramel distribution. -->
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt) -->
 
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform" version="1.0">
   <xsl:template name="unparse-cpp">

Modified: boost/trunk/tools/boostbook/xsl/chunk-common.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/chunk-common.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/chunk-common.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
 

Modified: boost/trunk/tools/boostbook/xsl/docbook-layout.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/docbook-layout.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/docbook-layout.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version = "1.0" encoding = "utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 
 <xsl:stylesheet version = "1.0"
    xmlns:xsl = "http://www.w3.org/1999/XSL/Transform"

Modified: boost/trunk/tools/boostbook/xsl/docbook.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/docbook.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/docbook.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
   <xsl:include href="reference.xsl"/>
@@ -50,15 +57,23 @@
 
           <xsl:if test="concept">
             <section>
+              <xsl:choose>
+                <xsl:when test="@id">
+                  <xsl:attribute name="id">
+                    <xsl:value-of select="@id"/>
+                    <xsl:text>.concepts</xsl:text>
+                  </xsl:attribute>
+                </xsl:when>
+                <xsl:when test="ancestor::library/attribute::id">
+                  <xsl:attribute name="id">
+                    <xsl:value-of select="ancestor::library/attribute::id"/>
+                    <xsl:text>.concepts</xsl:text>
+                  </xsl:attribute>
+                </xsl:when>
+              </xsl:choose>
+
               <title>Concepts</title>
-
-              <xsl:if test="ancestor::library/attribute::id">
-                <xsl:attribute name="id">
-                  <xsl:value-of select="ancestor::library/attribute::id"/>
-                  <xsl:text>.concepts</xsl:text>
-                </xsl:attribute>
-              </xsl:if>
-
+              
               <itemizedlist>
                 <xsl:for-each select="concept">
                   <listitem>

Modified: boost/trunk/tools/boostbook/xsl/doxygen/collect.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/doxygen/collect.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/doxygen/collect.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet        xmlns:xsl="http://www.w3.org/1999/XSL/Transform" version="1.0">
   <xsl:output method="xml" version="1.0" indent="yes" standalone="yes" />
  

Modified: boost/trunk/tools/boostbook/xsl/doxygen/doxygen2boostbook.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/doxygen/doxygen2boostbook.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/doxygen/doxygen2boostbook.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
   <xsl:import href="../lookup.xsl"/>

Modified: boost/trunk/tools/boostbook/xsl/dtd/dtd2boostbook.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/dtd/dtd2boostbook.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/dtd/dtd2boostbook.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
 

Modified: boost/trunk/tools/boostbook/xsl/error.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/error.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/error.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
   <xsl:template name="print.warning.context">

Modified: boost/trunk/tools/boostbook/xsl/fo.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/fo.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/fo.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!-- Copyright 2003 Douglas Gregor -->
+<!-- Distributed under the Boost Software License, Version 1.0. -->
+<!-- (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) -->
+
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 xmlns:fo="http://www.w3.org/1999/XSL/Format"
                 version="1.0">

Modified: boost/trunk/tools/boostbook/xsl/function.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/function.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/function.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
 
@@ -357,7 +364,7 @@
       <!-- Information for this parameter -->
       <xsl:variable name="parameter" select="$parameters[position()=1]"/>
       <xsl:variable name="name">
-        <xsl:if test="$include-names">
+        <xsl:if test="$include-names and $parameter/@name != ''">
           <xsl:text> </xsl:text><xsl:value-of select="$parameter/@name"/>
         </xsl:if>
       </xsl:variable>
@@ -1002,8 +1009,8 @@
 
   <!-- Group member functions together under a category name (synopsis)-->
   <xsl:template match="method-group" mode="synopsis">
+    <xsl:param name="indentation"/>
     <xsl:if test="count(child::*) &gt; 0">
-      <xsl:param name="indentation"/>
       <xsl:text>&#10;</xsl:text>
       <xsl:text>&#10;</xsl:text>
       <xsl:call-template name="indent">

Modified: boost/trunk/tools/boostbook/xsl/global.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/global.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/global.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8" ?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform" version="1.0">
   <xsl:template name="global-synopsis">
     <xsl:param name="indentation" select="0" />

Modified: boost/trunk/tools/boostbook/xsl/html-single.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/html-single.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/html-single.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"
                 version="1.0">

Modified: boost/trunk/tools/boostbook/xsl/html.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/html.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/html.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"
                 version="1.0">
@@ -104,6 +111,59 @@
                                  $time, ' GMT')"/>
   </xsl:template>
 
+
+  <xsl:template name="format.svn.revision">
+    <xsl:param name="text"/>
+
+    <!-- Remove the "$Date: " -->
+    <xsl:variable name="text.noprefix" 
+      select="substring-after($text, '$Date: ')"/>
+
+    <!-- Grab the year -->
+    <xsl:variable name="year" select="substring-before($text.noprefix, '-')"/>
+    <xsl:variable name="text.noyear" 
+      select="substring-after($text.noprefix, '-')"/>
+
+    <!-- Grab the month -->
+    <xsl:variable name="month" select="substring-before($text.noyear, '-')"/>
+    <xsl:variable name="text.nomonth" 
+      select="substring-after($text.noyear, '-')"/>
+
+    <!-- Grab the year -->
+    <xsl:variable name="day" select="substring-before($text.nomonth, ' ')"/>
+    <xsl:variable name="text.noday" 
+      select="substring-after($text.nomonth, ' ')"/>
+
+    <!-- Get the time -->
+    <xsl:variable name="time" select="substring-before($text.noday, ' ')"/>
+    <xsl:variable name="text.notime" 
+      select="substring-after($text.noday, ' ')"/>
+
+    <!-- Get the timezone -->
+    <xsl:variable name="timezone" select="substring-before($text.notime, ' ')"/>
+
+    <xsl:variable name="month.name">
+      <xsl:choose>
+        <xsl:when test="$month=1">January</xsl:when>
+        <xsl:when test="$month=2">February</xsl:when>
+        <xsl:when test="$month=3">March</xsl:when>
+        <xsl:when test="$month=4">April</xsl:when>
+        <xsl:when test="$month=5">May</xsl:when>
+        <xsl:when test="$month=6">June</xsl:when>
+        <xsl:when test="$month=7">July</xsl:when>
+        <xsl:when test="$month=8">August</xsl:when>
+        <xsl:when test="$month=9">September</xsl:when>
+        <xsl:when test="$month=10">October</xsl:when>
+        <xsl:when test="$month=11">November</xsl:when>
+        <xsl:when test="$month=12">December</xsl:when>
+      </xsl:choose>
+    </xsl:variable>
+
+    <xsl:value-of select="concat($month.name, ' ', $day, ', ', $year, ' at ',
+                                 $time, ' ', $timezone)"/>
+  </xsl:template>
+
+
   <xsl:template match="copyright" mode="boost.footer">
     <xsl:if test="position() &gt; 1">
       <br/>
@@ -144,9 +204,18 @@
               <small>
                 <p>
                   <xsl:text>Last revised: </xsl:text>
-                  <xsl:call-template name="format.cvs.revision">
-                    <xsl:with-param name="text" select="$revision-text"/>
-                  </xsl:call-template>
+                  <xsl:choose>
+                    <xsl:when test="contains($revision-text, '/')">
+                      <xsl:call-template name="format.cvs.revision">
+                        <xsl:with-param name="text" select="$revision-text"/>
+                      </xsl:call-template>
+                    </xsl:when>
+                    <xsl:otherwise>
+                      <xsl:call-template name="format.svn.revision">
+                        <xsl:with-param name="text" select="$revision-text"/>
+                      </xsl:call-template>
+                    </xsl:otherwise>
+                  </xsl:choose>
                 </p>
               </small>
             </xsl:if>

Modified: boost/trunk/tools/boostbook/xsl/index.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/index.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/index.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
   <xsl:template match="class-index">

Modified: boost/trunk/tools/boostbook/xsl/library.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/library.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/library.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
   <xsl:key name="library-categories" match="library" 

Modified: boost/trunk/tools/boostbook/xsl/lookup.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/lookup.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/lookup.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
 

Modified: boost/trunk/tools/boostbook/xsl/macro.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/macro.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/macro.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
   <xsl:template match="macro" mode="synopsis">

Modified: boost/trunk/tools/boostbook/xsl/manpages.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/manpages.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/manpages.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
 

Modified: boost/trunk/tools/boostbook/xsl/navbar.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/navbar.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/navbar.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
 

Modified: boost/trunk/tools/boostbook/xsl/reference.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/reference.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/reference.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
   <xsl:include href="annotation.xsl"/>

Modified: boost/trunk/tools/boostbook/xsl/relative-href.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/relative-href.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/relative-href.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
 

Modified: boost/trunk/tools/boostbook/xsl/source-highlight.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/source-highlight.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/source-highlight.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
   <xsl:param name="boost.syntax.highlight">1</xsl:param>

Modified: boost/trunk/tools/boostbook/xsl/template.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/template.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/template.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
   <!-- Determine the length of a template header synopsis -->

Modified: boost/trunk/tools/boostbook/xsl/testing/Jamfile.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/testing/Jamfile.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/testing/Jamfile.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
   <xsl:include href="http://docbook.sourceforge.net/release/xsl/current/html/chunker.xsl"/>

Modified: boost/trunk/tools/boostbook/xsl/testing/testsuite.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/testing/testsuite.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/testing/testsuite.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
   <xsl:template match="testsuite">

Modified: boost/trunk/tools/boostbook/xsl/type.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/type.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/type.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 version="1.0">
 

Modified: boost/trunk/tools/boostbook/xsl/utility.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/utility.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/utility.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0" encoding="utf-8"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <!DOCTYPE xsl:stylesheet [
 <!ENTITY nbsp "&#160;">
 ]>

Modified: boost/trunk/tools/boostbook/xsl/xref.xsl
===================================================================
--- boost/trunk/tools/boostbook/xsl/xref.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/boostbook/xsl/xref.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 <?xml version="1.0"?>
+<!--
+   Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+  
+   Distributed under the Boost Software License, Version 1.0.
+   (See accompanying file LICENSE_1_0.txt or copy at
+   http://www.boost.org/LICENSE_1_0.txt)
+  -->
 <xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
                 xmlns:suwl="http://nwalsh.com/xslt/ext/com.nwalsh.saxon.UnwrapLinks"
                 exclude-result-prefixes="suwl"

Modified: boost/trunk/tools/build/boost.css
===================================================================
--- boost/trunk/tools/build/boost.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/boost.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+/*
+Copyright 2002 David Abrahams.
+Distributed under the Boost Software License, Version 1.0.
+(See accompanying file LICENSE_1_0.txt or copy at
+http://www.boost.org/LICENSE_1_0.txt)
+ */
 H1
 {
     FONT-SIZE: 200%

Modified: boost/trunk/tools/build/index.html
===================================================================
--- boost/trunk/tools/build/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,21 @@
-<html>
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+<!-- 
+  Copyright 2003 Rene Rivera.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or copy at
+  http://www.boost.org/LICENSE_1_0.txt)
+   -->
+
+<html xmlns="http://www.w3.org/1999/xhtml">
 <head>
-<meta http-equiv="refresh" content="0; URL=v1/index.html">
+  <meta http-equiv="refresh" content="0; URL=v2/index.html" />
+
+  <title></title>
 </head>
+
 <body>
-Automatic redirection failed, please go to
-<a href="v1/build_system.htm">v1/build_system.htm</a>.
+  Automatic redirection failed, please go to <a href=
+  "v2/index.html">v2/index.html</a>.
 </body>
 </html>

Modified: boost/trunk/tools/build/v2/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,8 @@
+# Copyright 2001, 2002 Dave Abrahams
+# Copyright 2002 Rene Rivera
+# Copyright 2003 Vladimir Prus
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
 
+
 boost-build kernel ;

Modified: boost/trunk/tools/build/v2/boost.css
===================================================================
--- boost/trunk/tools/build/v2/boost.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/boost.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+/* Copyright 2002 Dave Abrahams */
+/* Distributed under the Boost Software License, Version 1.0. */
+/* (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) */
+
 H1
 {
     FONT-SIZE: 200%

Modified: boost/trunk/tools/build/v2/build/alias.jam
===================================================================
--- boost/trunk/tools/build/v2/build/alias.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/build/alias.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,6 @@
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003, 2004, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  This module defines the 'alias' rule and associated class.
 #
@@ -63,7 +62,7 @@
     
     targets.main-target-alternative
       [ new alias-target-class $(name) : $(project) 
-        : [ targets.main-target-sources $(sources) : $(name) ] 
+        : [ targets.main-target-sources $(sources) : $(name) : no-renaming ] 
         : [ targets.main-target-requirements $(requirements) : $(project) ] 
         : [ targets.main-target-default-build $(default-build) : $(project) ] 
         : [ targets.main-target-usage-requirements $(usage-requirements) : $(project) ]           

Modified: boost/trunk/tools/build/v2/build/feature.jam
===================================================================
--- boost/trunk/tools/build/v2/build/feature.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/build/feature.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,8 @@
-#  (C) Copyright David Abrahams 2001. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2001, 2002, 2003 Dave Abrahams 
+# Copyright 2002, 2006 Rene Rivera 
+# Copyright 2002, 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 import "class" : * ;
 
@@ -438,6 +439,38 @@
     }
 }
 
+# A helper that computes:
+#  * the name(s) of the module-local variable(s) used to record the
+#    correspondence between subvalue(s) and a subfeature
+#
+#  * the value of that variable when such a subfeature/subvalue has
+#    been defined
+#
+# Returns a list consisting of the latter followed by the former
+local rule subvalue-var ( 
+  feature           # Main feature name
+    
+    value-string ?  # If supplied, specifies a specific value of the
+                    # main feature for which the subfeature values
+                    # are valid
+    
+    : subfeature    # The name of the subfeature
+    : subvalues *   # The subfeature values
+)
+{
+    feature = [ grist $(feature) ] ;
+    validate-feature $(feature) ;
+    if $(value-string)
+    {
+        validate-value-string $(feature) $(value-string) ;
+    }
+
+    local subfeature-name = [ get-subfeature-name $(subfeature) $(value-string) ] ;
+
+    return $(subfeature-name)
+    $(feature)$(value-string:E="")<>$(subvalues).subfeature ;
+}
+
 # Extends the given subfeature with the subvalues.  If the optional
 # value-string is provided, the subvalues are only valid for the given
 # value of the feature. Thus, you could say that
@@ -456,23 +489,31 @@
     : subvalues *   # The additional values of the subfeature being defined.
 )
 {
-    feature = [ grist $(feature) ] ;
-    validate-feature $(feature) ;
-    if $(value-string)
-    {
-        validate-value-string $(feature) $(value-string) ;
-    }
-
-    local subfeature-name = [ get-subfeature-name $(subfeature) $(value-string) ] ;
+    local subfeature-vars = [ 
+      subvalue-var $(feature) $(value-string) : $(subfeature) : $(subvalues) ] ;
     
-    local f = [ utility.ungrist $(feature) ] ;
-    extend $(f)-$(subfeature-name) : $(subvalues) ;
+    local f = [ utility.ungrist [ grist $(feature) ] ] ;
+    extend $(f)-$(subfeature-vars[1]) : $(subvalues) ;
     
     # provide a way to get from the given feature or property and
     # subfeature value to the subfeature name.
-    $(feature)$(value-string:E="")<>$(subvalues).subfeature = $(subfeature-name) ;
+    $(subfeature-vars[2-]) = $(subfeature-vars[1]) ;
 }
 
+# Returns true iff the subvalues are valid for the feature.  When the
+# optional value-string is provided, returns true iff the subvalues
+# are valid for the given value of the feature.
+rule is-subvalue ( feature : value-string ? : subfeature : subvalue )
+{
+    local subfeature-vars = [ 
+      subvalue-var $(feature) $(value-string) : $(subfeature) : $(subvalue) ] ;
+    
+    if $($(subfeature-vars[2])) = $(subfeature-vars[1]) 
+    {
+        return true ;
+    }
+}
+
 # Can be called three ways:
 #
 #    1. extend feature : values *
@@ -1020,6 +1061,17 @@
     subfeature toolset gcc : version : 2.95.2 2.95.3 2.95.4
       3.0 3.0.1 3.0.2 ;
     
+    assert.true is-subvalue toolset : gcc : version : 2.95.3 ;
+    assert.false is-subvalue toolset : gcc : version : 1.1 ;
+
+    assert.false is-subvalue toolset : msvc : version : 2.95.3 ;
+    assert.false is-subvalue toolset : : version : yabba ;
+    
+    feature yabba ;
+    subfeature yabba : version : dabba ;
+    assert.true is-subvalue yabba : : version : dabba ;
+    
+    
     subfeature toolset gcc : platform : linux cygwin : optional ;
     
     assert.result <toolset-gcc:version>

Modified: boost/trunk/tools/build/v2/build/generators.jam
===================================================================
--- boost/trunk/tools/build/v2/build/generators.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/build/generators.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,9 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright Vladimir Prus 2002.
+# Copyright Rene Rivera 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)
 
 #  Manages 'generators' --- objects which can do transformation between different
 #  target types and contain algorithm for finding transformation from sources
@@ -105,7 +107,6 @@
     import virtual-target ;
     import "class" : new ;
     import property ;
-    import path ;
    
     EXPORT class at generator : indent increase-indent decrease-indent generators.dout ;
     
@@ -220,7 +221,7 @@
             return ;
         }
     }
-        
+    
     # Returns another generator which differers from $(self) in
     # - id
     # - value to <toolset> feature in properties
@@ -265,6 +266,8 @@
     
     # Tries to invoke this generator on the given sources. Returns a
     # list of generated targets (instances of 'virtual-target').
+    # Returning nothing from run indicates that the generator was
+    # unable to create the target.
     rule run ( project  # Project for which the targets are generated
                name ?   # Determines the name of 'name' attribute for 
                         # all generated targets. See 'generated-targets' method.
@@ -368,8 +371,38 @@
             }                        
         }
         return $(result) ;
-    }   
+    }
     
+    # Determine the name of the produced target from the
+    # names of the sources.
+    rule determine-output-name ( sources + )
+    {
+        # The simple case if when a name
+        # of source has single dot. Then, we take the part before
+        # dot. Several dots can be caused by:
+        # - Using source file like a.host.cpp
+        # - A type which suffix has a dot. Say, we can
+        #   type 'host_cpp' with extension 'host.cpp'.
+        # In the first case, we want to take the part till the last
+        # dot. In the second case -- no sure, but for now take
+        # the part till the last dot too.
+        name = [ utility.basename [ $(sources[1]).name ] ] ;
+                        
+        for local s in $(sources[2])
+        {
+            local n2 = [ utility.basename [ $(s).name ] ] ;
+            if $(n2) != $(name)
+            {
+                error "$(self.id): source targets have different names: cannot determine target name" ;
+            }
+        }
+        
+        # Names of sources might include directory. We should strip it.
+        name = $(name:D=) ;
+        
+        return $(name) ;
+    }
+    
     # Constructs targets that are created after consuming 'sources'.
     # The result will be the list of virtual-target, which the same length
     # as 'target-types' attribute and with corresponding types.
@@ -394,41 +427,7 @@
     {
         if ! $(name)
         {
-            # Determine the name of the produced target from the
-            # names of the sources. The simple case if when a name
-            # of source has single dot. Then, we take the part before
-            # dot. Several dots can be caused by:
-            # - Using source file like a.host.cpp
-            # - A type which suffix has a dot. Say, we can
-            #   type 'host_cpp' with extension 'host.cpp'.
-            # In the first case, we want to take the part till the last
-            # dot. In the second case -- no sure, but for now take
-            # the part till the last dot too.
-            name = [ utility.basename [ $(sources[1]).name ] ] ;
-                        
-            for local s in $(sources[2])
-            {
-                local n2 = [ utility.basename [ $(s).name ] ] ;
-                if $(n2) != $(name)
-                {
-                    error "$(self.id): source targets have different names: cannot determine target name" ;
-                }
-            }
-
-            # See if we need to add directory to the target name.
-            local dir = [ $(sources[1]).name ] ;            
-            dir = $(dir:D) ;
-            if $(dir) && 
-              # Never append '..' to target path.
-              ! [ MATCH .*(\\.\\.).* : $(dir) ] 
-                && 
-              ! [ path.is-rooted $(dir) ]
-            {
-                # Relative path is always relative to the source
-                # directory. Retain it, so that users can have files
-                # with the same in two different subdirectories.
-                name = $(dir)/$(name) ;                
-            }            
+            name = [ determine-output-name $(sources) ] ;
         }
         
         # Assign an action for each target
@@ -648,7 +647,6 @@
 # a generator and then call 'run' method on that generator, bypassing all
 # generator selection.
 rule register-standard ( id : source-types * : target-types + : requirements * )
-
 {
     local g = [ new generator $(id) : $(source-types) : $(target-types)
       : $(requirements) ] ;
@@ -673,6 +671,15 @@
     return $(.generators-for-toolset.$(toolset)) ;
 }
 
+# Make generator 'overrider-id' be preferred to
+# 'overridee-id'. If, when searching for generators
+# that could produce a target of certain type,
+# both those generators are amoung viable generators,
+# the overridden generator is immediately discarded.
+#
+# The overridden generators are discarded immediately
+# after computing the list of viable generators, before
+# running any of them.
 rule override ( overrider-id : overridee-id )
 {
     .override.$(overrider-id) += $(overridee-id) ;    
@@ -834,22 +841,28 @@
       ] ;
             
     local usage-requirements ;
-    if $(targets) && [ class.is-a $(targets[1]) : property-set ]
+    local success ;
+    if $(targets)
     {
-        usage-requirements = $(targets[1]) ;
-        targets = $(targets[2-]) ;
+        success = true ;
+    
+        if  [ class.is-a $(targets[1]) : property-set ]
+        {
+            usage-requirements = $(targets[1]) ;
+            targets = $(targets[2-]) ;
+        }
+        else
+        {
+            usage-requirements = [ property-set.empty ] ;
+        }
     }
-    else
-    {
-        usage-requirements = [ property-set.empty ] ;
-    }
     
     generators.dout [ indent ] "  generator" [ $(generator).id ] " spawned " ;
     generators.dout [ indent ] " " $(targets) ; 
-    if $(targets)
+    if $(success)
     {
         return $(usage-requirements) $(targets) ;
-    }    
+    }
 }
 
 # Checks if generator invocation can be pruned, because it's guaranteed
@@ -994,13 +1007,13 @@
     for local g in $(generators)
     {
         generators.dout [ indent ] "trying generator" [ $(g).id ] "(" [ $(g).source-types ] -> [ $(g).target-types ] ")" ;
-            
+        
         local m = [ $(g).match-rank $(property-set) ] ;
-        if $(m) 
+        if $(m)
         {
             generators.dout [ indent ] "  is viable" ;
             viable-generators += $(g) ;
-        }                                    
+        }
     }
                             
     return $(viable-generators) ;
@@ -1137,12 +1150,7 @@
 # 'construct' in stack, returns only targets of requested 'target-type',
 # otherwise, returns also unused sources and additionally generated
 # targets.    
-#
-# Does not return target which are not of 'allowed-type' or of type derived from
-# it. If 'allowed-type' is not specified, it's defaulted to 'target-type'.
-# See lib-target-class for use case of this.
-rule construct ( project name ? : target-type : property-set * : sources * 
-   : allowed-type * )
+rule construct ( project name ? : target-type : property-set * : sources * )
 {
     if (.construct-stack)
     {
@@ -1176,3 +1184,22 @@
     return $(result) ;        
 }
 
+# Given 'result', obtained from some generator or 
+# generators.construct, adds 'raw-properties' as usage requirements
+# to it. If result already contains usage requirements -- that is
+# the first element of result of an instance of the property-set class,
+# the existing usage requirements and 'raw-properties' are combined.
+rule add-usage-requirements ( result * : raw-properties * )
+{
+    if $(result)
+    {
+        if [ class.is-a $(result[1]) : property-set ] 
+        {
+            return [ $(result[1]).add-raw $(raw-properties) ] $(result[2-]) ;
+        }
+        else
+        {
+            return [ property-set.create $(raw-properties) ] $(result) ;
+        }        
+    }    
+}

Modified: boost/trunk/tools/build/v2/build/project.jam
===================================================================
--- boost/trunk/tools/build/v2/build/project.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/build/project.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,8 @@
-#  Copyright (C) Vladimir Prus and Rene Rivera 2002.
-#  Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2002, 2003 Dave Abrahams 
+# Copyright 2002, 2005, 2006 Rene Rivera 
+# Copyright 2002, 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Implements project representation and loading.
 #   Each project is represented by 
@@ -76,22 +76,28 @@
         # to child projects from parent projects, we don't immediately
         # loading child projects when seing those attributes. Instead,
         # we record the minimal information that will be used only later.
-
-        local used = [ modules.peek $(module-name) : .used-projects ] ;
-                import project ;
-        while $(used)
-        {
-            local id = $(used[1]) ;
-            local where = $(used[2]) ;
-            
-            project.use $(id) : [ path.root 
-                [ path.make $(where) ] $(jamfile-location) ] ;
-            used = $(used[3-]) ;
-        }        
+        load-used-projects $(module-name) ;
     }                
     return $(module-name) ;        
 }
 
+rule load-used-projects ( module-name )
+{
+    local used = [ modules.peek $(module-name) : .used-projects ] ;
+    local location = [ attribute $(module-name) location ] ;
+    import project ;
+    while $(used)
+    {
+        local id = $(used[1]) ;
+        local where = $(used[2]) ;
+        
+        project.use $(id) : [ path.root 
+            [ path.make $(where) ] $(location) ] ;
+        used = $(used[3-]) ;
+    }            
+}
+
+
 # Note the use of character groups, as opposed to listing
 # 'Jamroot' and 'jamroot'. With the latter, we'd get duplicate
 # matches on windows and would have to eliminate duplicates.
@@ -562,16 +568,9 @@
         }
         else if $(attribute) = "requirements" 
         {
-            local result = [ property-set.create-from-user-input
-                $(specification) : $(self.project-module) $(self.location) ] ;
-            
-            # If we have inherited properties, need to refine them with the
-            # specified.
-            local current = $(self.requirements) ;                                    
-            if $(current)
-            {
-                result = [ $(current).refine $(result) ] ;
-            }
+            local result = [ property-set.refine-from-user-input
+                $(self.requirements) : $(specification)
+                  : $(self.project-module) : $(self.location) ] ;
 
             if $(result[1]) = "@error"
             {
@@ -734,6 +733,78 @@
     .current-project = $(saved-project) ;
 }
 
+# Defines a Boost.Build extension project. Such extensions usually
+# contain library targets and features that can be used by many people.
+# Even though extensions are really projects, they can be initialize as
+# a module would be with the "using" (project.project-rules.using)
+# mechanism.
+rule extension ( id : options * : * )
+{
+    # The caller is a standalone module for the extension.
+    local mod = [ CALLER_MODULE ] ;
+    
+    # We need to do the rest within the extension module.
+    module $(mod)
+    {
+        import path ;
+        
+        # Find the root project.
+        local root-project = [ project.current ] ;
+        root-project = [ $(root-project).project-module ] ;
+        while
+            [ project.attribute $(root-project) parent-module ] &&
+            [ project.attribute $(root-project) parent-module ] != user-config
+        {
+            root-project = [ project.attribute $(root-project) parent-module ] ;
+        }
+        
+        # Create the project data, and bring in the project rules
+        # into the module.
+        project.initialize $(__name__) :
+            [ path.join [ project.attribute $(root-project) location ] ext $(1:L) ] ;
+        
+        # Create the project itself, i.e. the attributes.
+        # All extensions are created in the "/ext" project space.
+        project /ext/$(1) : $(2) : $(3) : $(4) : $(5) : $(6) : $(7) : $(8) : $(9) ;
+        local attributes = [ project.attributes $(__name__) ] ;
+        
+        # Inherit from the root project of whomever is defining us.
+        project.inherit-attributes $(__name__) : $(root-project) ;
+        $(attributes).set parent-module : $(root-project) : exact ;
+    }
+}
+
+rule glob-internal ( project : wildcards + : excludes * : rule-name )
+{
+    local location = [ $(project).get source-location ] ;
+    
+    local result ;
+    local paths = [ path.$(rule-name) $(location) 
+      : [ sequence.transform path.make : $(wildcards) ] 
+        : [ sequence.transform path.make : $(excludes) ] ] ;
+    if $(wildcards:D) || $(rule-name) != glob
+    {
+        # The paths we've found are relative to current directory,
+        # but the names specified in sources list are assumed to
+        # be relative to source directory of the corresponding
+        # prject. So, just make the name absolute.
+        for local p in $(paths)
+        {
+            result += [ path.root $(p) [ path.pwd ] ] ;
+        }                
+    }
+    else 
+    {
+        # There were not directory in wildcard, so the files are all
+        # in the source directory of the project. Just drop the
+        # directory, instead of making paths absolute.
+        result = $(paths:D="") ;
+    }
+    
+    return $(result) ;                
+}
+
+
 # This module defines rules common to all projects
 module project-rules
 {                
@@ -903,50 +974,36 @@
         }        
     }    
     
-    rule glob ( wildcards + )
+    rule glob ( wildcards + : excludes * )
     {
-        import path ;
         import project ;
-        import sequence ;
+        return [ project.glob-internal [ project.current ] 
+          : $(wildcards) : $(excludes) : glob ] ;
+    }
+
+    rule glob-tree ( wildcards + : excludes * )
+    {
+        import project ;
         
-        local current = [ project.current ] ;
-                
-        local location = [ $(current).get source-location ] ;
-
-        local result ;
-        local paths = [ path.glob $(location) : 
-          [ sequence.transform path.make : $(wildcards) ] ] ;
-        if $(wildcards:D)
+        if $(wildcards:D) || $(excludes:D)
         {
-            # The paths we've found are relative to current directory,
-            # but the names specified in sources list are assumed to
-            # be relative to source directory of the corresponding
-            # prject. So, just make the name absolute.
-            for local p in $(paths)
-            {
-                # If the path is below source location, use relative path.
-                # Otherwise, use full path just to avoid any ambiguities.
-                local rel = [ path.relative $(p) $(location) : no-error ] ;
-                if $(rel) = not-a-child
-                {                   
-                    result += [ path.root $(p) [ path.pwd ] ] ;
-                }
-                else
-                {
-                    result += $(rel) ;
-                }                
-            }                
+            errors.user-error "The patterns to 'glob-tree' may not include directory" ;
         }
-        else 
-        {
-            # There were not directory in wildcard, so the files are all
-            # in the source directory of the project. Just drop the
-            # directory, instead of making paths absolute.
-            result = $(paths:D="") ;
-        }
+        return [ project.glob-internal [ project.current ] 
+          : $(wildcards) : $(excludes) : glob-tree ] ;
+    }
 
-        return $(result) ;                
-    }        
+    # Calculates conditional requirements for multiple requirements
+    # at once. This is a shorthand to be reduce duplication and to
+    # keep an inline declarative syntax. For example:
+    #
+    #   lib x : x.cpp : [ conditional <toolset>gcc <variant>debug :
+    #       <define>DEBUG_EXCEPTION <define>DEBUG_TRACE ] ;
+    #
+    rule conditional ( condition + : requirements * )
+    {
+        return $(condition:J=,):$(requirements) ;
+    }
 }
 
 

Modified: boost/trunk/tools/build/v2/build/property-set.jam
===================================================================
--- boost/trunk/tools/build/v2/build/property-set.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/build/property-set.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,12 +1,13 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Dave Abrahams 
+# Copyright 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 import "class" : new ;
 import feature ;
 import property ;
 import sequence ;
+import set ;
 
 # Class for storing a set of properties.
 # - there's 1<->1 correspondence between identity and value. No
@@ -386,8 +387,66 @@
     return $(result) ;
 }
 
+# Refines requirements with requirements provided by the user.
+# Specially handles "-<property>value" syntax in specification
+# to remove given requirements.
+# - parent-requirements -- property-set object with requirements
+#   to refine
+# - specification -- string list of requirements provided by the use
+# - project-module -- the module to which context indirect features
+#   will be bound.
+# - location -- the path to which path features are relative.
+#
+#
+rule refine-from-user-input ( parent-requirements : specification * 
+    : project-module : location )
+{
+    if ! $(specification)
+    {
+        return $(parent-requirements) ;
+    }
+    else
+    {
+        local add-requirements ;
+        local remove-requirements ;
+        
+        for local r in $(specification)
+        {
+            local m = [ MATCH "^-(.*)" : $(r) ] ;
+            if $(m)
+            {
+                remove-requirements += $(m) ;
+            }
+            else
+            {
+                add-requirements += $(r) ;
+            }
+        }
+        
+        if $(remove-requirements)
+        {
+            # Need to create property set, so that path features
+            # and indirect features are translated just like they
+            # are in project requirements.
+            local ps = [ property-set.create-from-user-input 
+                $(remove-requirements) : $(project-module) $(location) ] ;
+            
+            parent-requirements = [ property-set.create 
+                [ set.difference [ $(parent-requirements).raw ] 
+                  : [ $(ps).raw ] ] ] ;
+            specification = $(add-requirements) ;
+        }
 
+        local requirements = [ property-set.create-from-user-input 
+            $(specification) : $(project-module) $(location) ] ;
+        
+        requirements = [ $(parent-requirements).refine $(requirements) ] ;    
+        return $(requirements) ;
+    }
+}
 
+
+
 # Returns property-set with empty set of properties.
 rule empty ( )
 {

Modified: boost/trunk/tools/build/v2/build/property.jam
===================================================================
--- boost/trunk/tools/build/v2/build/property.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/build/property.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,13 +1,15 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2001, 2002, 2003 Dave Abrahams 
+# Copyright 2006 Rene Rivera 
+# Copyright 2002, 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 import utility : ungrist ;
 import sequence : unique ;
 import errors : error ;
 import feature ;
 import regex ;
+import string ;
 import sequence ;
 import set ;
 import path ;
@@ -191,6 +193,30 @@
     }
 }
 
+local rule abbreviate-dashed ( string )
+{
+    local r ;
+    for local part in [ regex.split $(string) - ]
+    {
+        r += [ string.abbreviate $(part) ] ;
+    }
+    return $(r:J=-) ;
+}
+
+local rule identity ( string )
+{
+    return $(string) ;
+}
+
+if --abbreviate-paths in [ modules.peek : ARGV ]
+{
+    .abbrev = abbreviate-dashed ;
+}
+else
+{
+    .abbrev = identity ;
+}
+
 # Returns a path which represents the given expanded property set.
 rule as-path ( properties * )
 {
@@ -210,12 +236,10 @@
             if $(p:G)
             {
                 local f = [ ungrist $(p:G) ] ;
-                components += $(f)-$(p:G=) ;
+                p = $(f)-$(p:G=) ;
             }
-            else
-            {
-                components += $(p) ;
-            }
+            
+            components += [ $(.abbrev) $(p) ] ;
         }
         
         $(entry) = $(components:J=/) ;
@@ -527,7 +551,7 @@
     import feature : feature subfeature compose ;
     
     # local rules must be explicitly re-imported
-    import property : path-order ;
+    import property : path-order abbreviate-dashed ;
     
     feature.prepare-test property-test-temp ;
 
@@ -555,28 +579,28 @@
     assert.true path-order $(test-space) <optimization>on <rtti>on ;
     assert.false path-order $(test-space) <rtti>on <optimization>on ;
       
-    assert.result <toolset>gcc <rtti>off <define>FOO
+    assert.result-equal <toolset>gcc <rtti>off <define>FOO
         : refine <toolset>gcc <rtti>off
         : <define>FOO
         : $(test-space)
         ;
 
-    assert.result <toolset>gcc <optimization>on
+    assert.result-equal <toolset>gcc <optimization>on
         : refine <toolset>gcc <optimization>off
         : <optimization>on
         : $(test-space)
         ;
 
-    assert.result <toolset>gcc <rtti>off
+    assert.result-equal <toolset>gcc <rtti>off
         : refine <toolset>gcc : <rtti>off : $(test-space)
         ;
 
-    assert.result <toolset>gcc <rtti>off <rtti>off:<define>FOO
+    assert.result-equal <toolset>gcc <rtti>off <rtti>off:<define>FOO
         : refine <toolset>gcc : <rtti>off <rtti>off:<define>FOO 
         : $(test-space)
         ;
     
-    assert.result <toolset>gcc:<define>foo <toolset>gcc:<define>bar 
+    assert.result-equal <toolset>gcc:<define>foo <toolset>gcc:<define>bar 
         : refine <toolset>gcc:<define>foo : <toolset>gcc:<define>bar 
         : $(test-space)
         ;
@@ -597,7 +621,10 @@
       : as-path <toolset>gcc <optimization>off <rtti>off <variant>debug
       : $(test-space)
       ;
-        
+
+    assert.result optmz-off : abbreviate-dashed optimization-off ;
+    assert.result rntm-lnk-sttc : abbreviate-dashed runtime-link-static ;
+    
     try ;
         validate <feature>value : $(test-space) ;
     catch "Invalid property '<feature>value': unknown feature 'feature'." ;
@@ -617,19 +644,19 @@
     catch "value" is not a value of an implicit feature ;
            
 
-    assert.result <rtti>on 
+    assert.result-equal <rtti>on 
         : remove free implicit : <toolset>gcc <define>foo <rtti>on : $(test-space) ;
 
-    assert.result <include>a 
+    assert.result-equal <include>a 
         : select include : <include>a <toolset>gcc ;
 
-    assert.result <include>a 
+    assert.result-equal <include>a 
         : select include bar : <include>a <toolset>gcc ;
 
-    assert.result <include>a <toolset>gcc
+    assert.result-equal <include>a <toolset>gcc
         : select include <bar> <toolset> : <include>a <toolset>gcc ;
     
-    assert.result <toolset>kylix <include>a 
+    assert.result-equal <toolset>kylix <include>a 
         : change <toolset>gcc <include>a : <toolset> kylix ;
 
     pm = [ new property-map ] ;
@@ -658,7 +685,7 @@
       ;
     
     # Test conditional feature
-    assert.result <toolset>gcc,<toolset-gcc:version>3.0 <define>FOO
+    assert.result-equal <toolset>gcc,<toolset-gcc:version>3.0 <define>FOO
       : split-conditional <toolset>gcc,<toolset-gcc:version>3.0:<define>FOO
       ;
     

Modified: boost/trunk/tools/build/v2/build/readme.txt
===================================================================
--- boost/trunk/tools/build/v2/build/readme.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/build/readme.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+Copyright 2001, 2002 Dave Abrahams 
+Copyright 2002 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 Development code for new build system. To run unit tests for jam code, execute:
 
   bjam --debug --build-system=test

Modified: boost/trunk/tools/build/v2/build/scanner.jam
===================================================================
--- boost/trunk/tools/build/v2/build/scanner.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/build/scanner.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003, 2004, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Implements scanners: objects that compute implicit dependencies for
 #  files, such as includes in C++.

Modified: boost/trunk/tools/build/v2/build/targets.jam
===================================================================
--- boost/trunk/tools/build/v2/build/targets.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/build/targets.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,9 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright Vladimir Prus 2002.
+# Copyright Rene Rivera 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)
 
 
 #   Supports 'abstract' targets, which are targets explicitly defined in Jamfile.
@@ -80,6 +82,7 @@
 import set ;
 import assert ;
 import indirect ;
+import toolset ;
 
 # Base class for all abstract targets.
 class abstract-target 
@@ -733,8 +736,11 @@
         for local p in $(all-property-sets)
         {
             local r = [ generate-really $(p) ] ;
-            usage-requirements = [ $(usage-requirements).add $(r[1]) ] ;
-            result += $(r[2-]) ;
+            if $(r)
+            {
+                usage-requirements = [ $(usage-requirements).add $(r[1]) ] ;
+                result += $(r[2-]) ;
+            }
         }
         end-building $(__name__) ;
         return $(usage-requirements) [ sequence.unique $(result) ] ;                
@@ -908,30 +914,38 @@
     }        
     result = [ $($(key)).add-raw $(free) ] ;
 }
-    
-rule common-properties2 ( build-request requirements )
-{           
-    # This guarantees that default properties are present
-    # in result, unless they are overrided by some requirement.
-    # FIXME: There is possibility that we've added <foo>bar, which is composite
-    # and expands to <foo2>bar2, but default value of <foo2> is not bar2,
-    # in which case it's not clear what to do.
+
+# Given 'context' -- a set of already present properties, and 'requirements',
+# decide which extra properties should be applied to 'context'. 
+# For conditional requirements, this means evaluating condition. For 
+# indirect conditional requirements, this means calling a rule. Ordinary
+# requirements are always applied.
+#
+# Handles situation where evaluating one conditional requirements affects
+# condition of another conditional requirements, for example:
+#
+#     <toolset>gcc:<variant>release <variant>release:<define>RELEASE
+#
+# If 'what' is 'refined' returns context refined with new requirements. 
+# If 'what' is 'added' returns just the requirements that must be applied.
+rule evaluate-requirements ( requirements : context : what )
+{
+    # Apply non-conditional requirements. 
+    # It's possible that that further conditional requirement change 
+    # a value set by non-conditional requirements. For example:
+    #
+    #    exe a : a.cpp : <threading>single <toolset>foo:<threading>multi ;
     # 
-    build-request = [ $(build-request).add-defaults ] ;
-    # Featured added by 'add-default' can be composite and expand
-    # to features without default values -- so they are not added yet.
-    # It could be clearer/faster to expand only newly added properties
-    # but that's not critical.
-    build-request = [ $(build-request).expand ] ;
+    # I'm not sure if this should be an error, or not, especially given that
+    #
+    #    <threading>single 
+    #
+    # might come from project's requirements.
     
-    # Apply non-conditional requirements. 
-    # There's a slight bug here: it's possible that conditional
-    # requirement change a value set by non-conditional requirements. This
-    # should be error, but we don't detect it yet.   
+    local unconditional = [ feature.expand [ $(requirements).non-conditional ] ] ;
     
-    local raw = [ $(build-request).raw ] ;
-    raw = [ property.refine $(raw) : 
-      [ feature.expand [ $(requirements).non-conditional ] ] ] ;
+    local raw = [ $(context).raw ] ;
+    raw = [ property.refine $(raw) : $(unconditional) ] ;
       
     # We've collected properties that surely must be present in common
     # properties. We now try to figure out what other properties
@@ -948,12 +962,13 @@
     local count = $(conditionals) 
                   [ $(requirements).get <conditional> ]                    
                   and-once-more ;
-    local prev ;
     
+    local added-requirements ;
+    
     local current = $(raw) ;
     
     # It's assumed that ordinary conditional requirements can't add
-    # <indirect-conditional> properties, and that rules refered
+    # <indirect-conditional> properties, and that rules referred
     # by <indirect-conditional> properties can't add new 
     # <indirect-conditional> properties. So the list of indirect conditionals
     # does not change.
@@ -973,7 +988,7 @@
             e += [ indirect.call $(i) $(current) ] ;
         }
                              
-        if $(e) = $(prev)
+        if $(e) = $(added-requirements)
         {                
             # If we got the same result, we've found final properties.
             count = ;      
@@ -981,11 +996,11 @@
         }         
         else
         {
-            # Oops, results of evaluation of conditionals has changes
+            # Oops, results of evaluation of conditionals has changed.
             # Also 'current' contains leftover from previous evaluation.
             # Recompute 'current' using initial properties and conditional
             # requirements.
-            prev = $(e) ;
+            added-requirements = $(e) ;
             current = [ property.refine $(raw) : [ feature.expand $(e) ] ] ;
         }            
         count = $(count[2-]) ;
@@ -995,8 +1010,39 @@
         errors.error "Can't evaluate conditional properties " $(conditionals) ;
     }
     
+
+    if $(what) = added
+    {
+        return [ property-set.create $(unconditional) $(added-requirements) ] ;
+    }
+    else if $(what) = refined
+    {        
+        return [ property-set.create $(current) ] ;    
+    }
+    else
+    {
+        errors.error "Invalid value of the 'what' parameter" ;
+    }    
+}
+
     
-    return [ property-set.create $(current) ] ;
+rule common-properties2 ( build-request requirements )
+{           
+    # This guarantees that default properties are present
+    # in result, unless they are overrided by some requirement.
+    # FIXME: There is possibility that we've added <foo>bar, which is composite
+    # and expands to <foo2>bar2, but default value of <foo2> is not bar2,
+    # in which case it's not clear what to do.
+    # 
+    build-request = [ $(build-request).add-defaults ] ;
+    # Featured added by 'add-default' can be composite and expand
+    # to features without default values -- so they are not added yet.
+    # It could be clearer/faster to expand only newly added properties
+    # but that's not critical.
+    build-request = [ $(build-request).expand ] ;
+    
+    return [ evaluate-requirements $(requirements) 
+      : $(build-request) : refined ] ;
 }
 
 # Implements the most standard way of constructing main target
@@ -1036,7 +1082,7 @@
         
         if $(sources:G)
         {
-            errors.error "gristed element in sources for" [ full-name ] ;
+            errors.user-error "properties found in the 'sources' parameter for" [ full-name ] ;
         }
     }
     
@@ -1135,19 +1181,23 @@
     {
         if [ modules.peek : .debug-building ] 
         {
-            ECHO [ targets.indent ] "Building target '$(self.name)'" ;
+            ECHO ;
+            local fn = [ full-name ] ;
+            ECHO [ targets.indent ] "Building target '$(fn)'" ;
+            targets.increase-indent ;
             ECHO [ targets.indent ] "Build request: " [ $(property-set).raw ] ;
-            targets.increase-indent ;
+            ECHO [ targets.indent ] "Target requirements: " [ $(self.requirements).raw ] ;            
         }
                 
         if ! $(self.generated.$(property-set)) 
-        {           
+        {
             local rproperties = [ targets.common-properties $(property-set) 
               $(self.requirements) ] ;           
             
             if [ modules.peek : .debug-building ] 
             {
-                ECHO [ targets.indent ] "Common properties are" [ $(rproperties).raw ] ;
+                ECHO ;
+                ECHO [ targets.indent ] "Common properties:" [ $(rproperties).raw ] ;
             }
                         
             if $(rproperties[1]) != "@error" && [ $(rproperties).get <build> ] != no
@@ -1165,6 +1215,7 @@
                 
                 if [ modules.peek : .debug-building ] 
                 {
+                    ECHO ;
                     ECHO [ targets.indent ] 
                       "Usage requirements for $(self.name) are " $(usage-requirements) ;
                 }
@@ -1173,6 +1224,12 @@
                   $(usage-requirements) ] ;
                 usage-requirements = [ property-set.create $(usage-requirements) ] ;
                 
+                if [ modules.peek : .debug-building ] 
+                {
+                    ECHO [ targets.indent ] 
+                      "Build properties: " [ $(rproperties).raw ] ;
+                }
+                
                 local extra = [ $(rproperties).get <source> ] ;                
                 source-targets += $(extra:G=) ;
                 # We might get duplicate sources, for example if
@@ -1184,37 +1241,38 @@
                   [ construct $(self.name) : 
                     $(source-targets) : $(rproperties) ] ;
                 
-                local gur = $(result[1]) ;
-                result = $(result[2-]) ;
+                if $(result)
+                {
+                    local gur = $(result[1]) ;
+                    result = $(result[2-]) ;
 
-                local s = [ create-subvariant 
-                    $(result) :
-                    [ virtual-target.recent-targets ] 
-                      : $(property-set) : $(source-targets)
-                  : $(rproperties) : $(usage-requirements) ] ;
-                virtual-target.clear-recent-targets ;
+                    local s = [ create-subvariant 
+                        $(result) :
+                        [ virtual-target.recent-targets ] 
+                          : $(property-set) : $(source-targets)
+                      : $(rproperties) : $(usage-requirements) ] ;
+                    virtual-target.clear-recent-targets ;
 
-                local ur = [ compute-usage-requirements $(s) ] ;
-                ur = [ $(ur).add $(gur) ] ;
-                $(s).set-usage-requirements $(ur) ;
-                if [ modules.peek : .debug-building ] 
-                {
-                    ECHO [ targets.indent ]
-                      "Usage requirements from $(self.name) are "
-                        [ $(ur).raw ] ;
+                    local ur = [ compute-usage-requirements $(s) ] ;
+                    ur = [ $(ur).add $(gur) ] ;
+                    $(s).set-usage-requirements $(ur) ;
+                    if [ modules.peek : .debug-building ] 
+                    {
+                        ECHO [ targets.indent ]
+                          "Usage requirements from $(self.name) are "
+                            [ $(ur).raw ] ;
+                    }
+                    
+                    self.generated.$(property-set) = $(ur) $(result) ;
                 }
-                
-                
-                self.generated.$(property-set) = $(ur) $(result) ;
             } 
             else
             {
+                # We're here either because there's error computing
+                # properties, or there's <build>no in properties.
+                # In the latter case we don't want any diagnostic.
+                # In the former case, we need diagnostics. FIXME.
                 self.generated.$(property-set) = $(rproperties) ;
-                
-                if $(rproperties[1]) != "@error"
-                {
-                    ECHO "Skipping build of" [ full-name ] "-- <build>no in properties." ;
-                }
             }       
         }                
         else
@@ -1224,8 +1282,7 @@
                 ECHO [ targets.indent ] "Already built" ;
             }            
         }
-        
-        
+
         targets.decrease-indent ;
         return $(self.generated.$(property-set)) ;
     }
@@ -1236,8 +1293,10 @@
     rule compute-usage-requirements ( subvariant )
     {
         local rproperties = [ $(subvariant).build-properties ] ;
-        xusage-requirements = [ $(self.usage-requirements).evaluate-conditionals 
-          $(rproperties) ] ;                
+        xusage-requirements = [ targets.evaluate-requirements 
+            $(self.usage-requirements) 
+              : $(rproperties) 
+                : added ] ;                
         
         # We generate all dependency properties and add them,
         # as well as their usage requirements, to result.
@@ -1339,7 +1398,7 @@
             : $(source-targets) ] ;
         if ! $(r)
         {                        
-            ECHO "error: unable to construct " [ full-name ] ;
+            ECHO "warn: Unable to construct" [ full-name ] ;
             
             # Are there any top-level generators for this type/property set.
             if ! [ generators.find-viable-generators 
@@ -1349,10 +1408,10 @@
                 ECHO "error: and the requested properties" ;
                 ECHO "error: make sure you've configured the needed tools" ;
                 ECHO "See http://boost.org/boost-build2/doc/html/bbv2/advanced/configuration.html" ;
+                
+                ECHO "To debug this problem, try the --debug-generators option." ;
+                EXIT ;
             }
-            
-            ECHO "To debug this problem, try the --debug-generators option." ;
-            EXIT ;
         }
         
         return $(r) ;
@@ -1361,18 +1420,27 @@
 
 # Return the list of sources to use, if main target rule is invoked
 # with 'sources'. If there are any objects in 'sources', they are treated
-# as main target instances, and WRITEME.
-rule main-target-sources ( sources * : main-target-name )
+# as main target instances, and the name of such targets are adjusted to
+# be '<name_of_this_target>__<name_of_source_target>'. Such renaming
+# is disabled is non-empty value is passed for 'no-renaming' parameter.
+# 
+rule main-target-sources ( sources * : main-target-name : no-renaming ? )
 {
     local result ;
     for local t in $(sources)
     {
         if [ class.is-instance $(t) ]
         {
-            local name = [ $(t).name ] ;
-            local new-name = $(main-target-name)__$(name) ;
-            $(t).rename $(new-name) ;
-            result += $(new-name) ;
+            local name = [ $(t).name ] ;            
+            if ! $(no-renaming)
+            {                
+                name = $(main-target-name)__$(name) ;
+                $(t).rename $(name) ;
+            }            
+            # Inline targets are not built by default.
+            local p = [ $(t).project ] ;
+            $(p).mark-target-as-explicit $(name) ;            
+            result += $(name) ;
         }
         else
         {
@@ -1392,13 +1460,12 @@
   : project       # Project where the main target is to be declared
       )
 {
-    local loc = [ $(project).get location ] ;
-    local jamfile-module = [ $(project).project-module ] ;
-    local requirements = [ property-set.create-from-user-input $(specification)
-      : $(jamfile-module) $(loc) ] ;
+    specification += [ toolset.requirements ] ;
     
-    local project-requirements = [ $(project).get requirements ] ;
-    requirements = [ $(project-requirements).refine $(requirements) ] ;    
+    local requirements = [ property-set.refine-from-user-input 
+        [ $(project).get requirements ] : $(specification) :
+        [ $(project).project-module ] : [ $(project).get location ] ] ;
+    
     if $(requirements[1]) = "@error" 
     {
         errors.error "Conflicting requirements for target:" $(requirements) ;
@@ -1417,10 +1484,15 @@
 {
     local loc = [ $(project).get location ] ;         
     local project-usage-requirements = [ $(project).get usage-requirements ] ;
-        
-    local usage-requirements = [ property-set.create 
-        [ property.translate-paths $(specification) : $(loc) ] ] ;
     
+    # We don't use 'refine-from-user-input' because I'm not sure if:
+    # - removing of parent's usage requirements makes sense
+    # - refining of usage requirements is not needed, since usage requirements
+    #   are always free.
+    local usage-requirements = [ property-set.create-from-user-input 
+        $(specification) 
+          : [ $(project).project-module ] [ $(project).get location ] ] ;
+            
     return [ $(project-usage-requirements).add $(usage-requirements) ] ;
 }
 

Modified: boost/trunk/tools/build/v2/build/toolset.jam
===================================================================
--- boost/trunk/tools/build/v2/build/toolset.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/build/toolset.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,8 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Dave Abrahams 
+# Copyright 2005 Rene Rivera 
+# Copyright 2002, 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Support for toolset definition.
 
@@ -44,6 +45,23 @@
 }
 
 
+# Specifies if the 'flags' rule should do checking that
+# the invoking module is the same as module we're setting
+# flag for.
+# 'v' can be either 'checked' or 'unchecked'.
+# Subsequent call to 'pop-checking-for-flags-module'
+# will restore the behaviour that was in effect before
+# calling this rule.
+rule push-checking-for-flags-module ( v )
+{
+    .flags-module-checking = $(v) $(.flags-module-checking) ;
+}
+
+rule pop-checking-for-flags-module ( )
+{
+    .flags-module-checking = $(.flags-module-checking[2-]) ;
+}
+
 # Specifies the flags (variables) that must be set on targets under certain
 # conditions, described by arguments.
 rule flags ( rule-or-module   # If contains dot, should be a rule name.
@@ -104,7 +122,9 @@
     else
     {              
         local module_ = [ MATCH "([^.]*).*" : $(rule-or-module) ] ;
-        if $(unchecked) != unchecked && $(module_) != $(caller)
+        if $(unchecked) != unchecked 
+            && $(.flags-module-checking[1]) != unchecked
+            && $(module_) != $(caller)
         {
             errors.error "Module $(caller) attempted to set flags for module $(module_)" ;
         }
@@ -387,9 +407,18 @@
     }    
 }
 
-# properties listed in prohibited-properties won't
-# be inherited. Note that <debug-symbols>on and
-# <debug-symbols>off are two different properties
+# Brings all flag definitions from 'base' toolset into
+# other toolset 'toolset'. Flag definitions which
+# condition make use of properties in 'prohibited-properties'
+# are ignored. Don't confuse property and feature, for
+# example <debug-symbols>on and <debug-symbols>off, so blocking
+# one of them does not block the other one.
+#
+# The flag conditions are not altered at all, so if condition
+# includes name, or version of base toolset, it won't ever match
+# the inheriting toolset. When such flag settings must be
+# inherited, define a rule in base toolset module and call it
+# as needed.
 rule inherit-flags ( toolset : base : prohibited-properties * )
 {
     for local f in $(.module-flags.$(base))
@@ -436,7 +465,23 @@
     IMPORT $(toolset) : $(rules) : : $(toolset).$(rules) ;
 }
 
+# Return the list of global 'toolset requirements'.
+# Those requirements will be automatically added to
+# the requirements of any main target.
+rule requirements ( )
+{
+    return $(.requirements) ;
+}
 
+# Adds elements to the list of global 'toolset requirements'.
+# The requirements will be automatically added to the requirements
+# for all main targets, as if they were specified literally.
+# For best results, all requirements added should be conditional or
+# indirect conditional.
+rule add-requirements ( requirements * )
+{
+    .requirements += $(requirements) ;
+}
 
 local rule __test__ ( )
 {

Modified: boost/trunk/tools/build/v2/build/type.jam
===================================================================
--- boost/trunk/tools/build/v2/build/type.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/build/type.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2002, 2003 Dave Abrahams 
+# Copyright 2002, 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Deals with target type declaration and defines target class which supports
 #  typed targets.

Modified: boost/trunk/tools/build/v2/build/version.jam
===================================================================
--- boost/trunk/tools/build/v2/build/version.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/build/version.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,10 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2002, 2003, 2004, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 rule boost-build ( )
 {
-    return "V2 (Milestone 10)" ;
+    return "V2 (Milestone 11)" ;
 }
 rule jam ( )
 {

Modified: boost/trunk/tools/build/v2/build/virtual-target.jam
===================================================================
--- boost/trunk/tools/build/v2/build/virtual-target.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/build/virtual-target.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,8 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Dave Abrahams 
+# Copyright 2005, 2006 Rene Rivera 
+# Copyright 2002, 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Implements virtual targets, which correspond to actual files created during
 #  build, but are not yet targets in Jam sense. They are needed, for example,
@@ -402,6 +403,14 @@
             ps = [ property-set.empty ] ;
         }
         
+        #~ We add ourselves to the properties so that any tag rule can get
+        #~ more direct information about the target than just that available
+        #~ through the properties. This is useful in implementing
+        #~ name changes based on the sources of the target. For example to
+        #~ make unique names of object files based on the source file.
+        #~ --grafik
+        ps = [ property-set.create [ $(ps).raw ] <target>$(__name__) ] ;
+        
         local tag = [ $(ps).get <tag> ] ;
 
         if $(tag)

Modified: boost/trunk/tools/build/v2/build-system.jam
===================================================================
--- boost/trunk/tools/build/v2/build-system.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/build-system.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,8 @@
-#  (C) Copyright David Abrahams 2001-2003. Permission to copy, use,
-#  modify, sell and distribute this software is granted provided this
-#  copyright notice appears in all copies. This software is provided
-#  "as is" without express or implied warranty, and with no claim as
-#  to its suitability for any purpose.
+# Copyright 2003, 2005 Dave Abrahams 
+# Copyright 2006 Rene Rivera 
+# Copyright 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # This file is part of Boost.Build version 2.  You can think of it as
 # forming the main() routine.  It is invoked by the bootstrapping code
@@ -22,6 +22,8 @@
 import errors : error ;
 import virtual-target ;
 import "class" : new ;
+import toolset ;
+import regex ;
 
 import builtin ;
 import make ;
@@ -43,10 +45,15 @@
 # Check if we can load 'test-config.jam'. If we can, load it and
 # ignore user configs.
 
+local argv = [ modules.peek : ARGV ] ;
+
 local test-config = [ GLOB [ os.environ BOOST_BUILD_PATH ] : test-config.jam ] ;
+
+local debug-config = [ MATCH ^(--debug-configuration)$ : [ modules.peek : ARGV ] ] ;
+
 if $(test-config)
 {
-    if --debug-configuration in [ modules.peek : ARGV ]
+    if $(debug-config)
     {
         ECHO "notice: loading test-config.jam from" 
           [ NORMALIZE_PATH $(test-config[1]) ] ;
@@ -68,64 +75,146 @@
 
 local user-path = [ os.home-directories ] [ os.environ BOOST_BUILD_PATH ] ;
     
+# Unless ignore-config is set, load the configuration file in
+# $(path)/$(basename).jam
+local rule load-config ( basename : path + )
+{       
+    if ! $(ignore-config)    
+    {
+        if $(debug-config)
+        {
+            local where = [ GLOB $(path) : $(basename).jam ] ;
+            if $(where)
+            {            
+                ECHO notice: loading $(basename).jam from
+                  [ NORMALIZE_PATH $(where[1]) ] ;
+            }        
+        }        
+
+        modules.load $(basename) : : $(path) ;
+        project.load-used-projects $(basename) ;
+    }
+}
+
+#
 # Load site-config.
+#
 module site-config 
 {
     import project : initialize ;
     initialize site-config ;        
 }
-    
-if ! $(ignore-config)
-{   
-    local path ; 
-    if [ os.name ] in NT CYGWIN
-    {    
-        path = [ modules.peek : SystemRoot ] $(user-path) ;   
-    }
-    else
-    {
-        path = /etc $(user-path) ;
-    }
-    
-    
-    if --debug-configuration in [ modules.peek : ARGV ]
-    {
-        local where = [ GLOB $(path) : site-config.jam ] ;
-        if $(where)
-        {            
-            ECHO "notice: loading site-config.jam from" 
-              [ NORMALIZE_PATH $(where[1]) ] ;
-        }        
-    }        
-        
-    modules.load site-config : : $(path) ;
+
+local site-path = /etc $(user-path) ; 
+
+if [ os.name ] in NT CYGWIN
+{    
+    site-path = [ modules.peek : SystemRoot ] $(user-path) ;   
 }
 
+load-config site-config : $(site-path) ;
 
+#
 # Load user-config.
+#
 module user-config 
 {
     import project : initialize ;
     initialize user-config ;        
 }
 
+local user-config-path = [ MATCH ^--user-config=(.*) : $(argv) ] ;
+
+if $(user-config-path)
+{
+    if $(debug-config)
+    {
+        ECHO "Loading explicitly specifier user configuration file:" ;
+        ECHO "    $(user-config-path)" ;
+    }
+    
+    
+    modules.load user-config : $(user-config-path:BS) : $(user-config-path:D) ;
+    project.load-used-projects user-config ;
+}
+else
+{    
+    load-config user-config : $(user-path) ;
+}
+
+
+#
+# Autoconfigure toolsets based on any instances of --toolset=xx,yy,...zz or
+# toolset=xx,yy,...zz in the command line
+#
+local option-toolsets = [ regex.split-list [ MATCH ^--toolset=(.*) : $(argv) ] : "," ] ;
+local feature-toolsets = [ regex.split-list [ MATCH ^toolset=(.*) : $(argv) ] : "," ] ;
+
+# if the user specified --toolset=..., we need to add toolset=... to
+# the build request
+local extra-build-request ; 
+
 if ! $(ignore-config)
-{    
-    if --debug-configuration in [ modules.peek : ARGV ]
+{
+    for local t in $(option-toolsets) $(feature-toolsets)
     {
-        local where = [ GLOB $(user-path) : user-config.jam ] ;
-        if $(where)
+        # Parse toolset-version/properties
+        local (t-v,t,v) = [ MATCH (([^-/]+)-?([^/]+)?)/?.* : $(t) ] ;
+        local toolset-version = $((t-v,t,v)[1]) ;
+        local toolset = $((t-v,t,v)[2]) ;
+        local version = $((t-v,t,v)[3]) ;
+
+        if $(debug-config)
         {
-            ECHO "notice: loading user-config.jam from" 
-              [ NORMALIZE_PATH $(where[1]) ] ;
-        }        
-    }    
-        
-    modules.load user-config : : $(user-path) ;    
+            ECHO notice: [cmdline-cfg] Detected command-line request for 
+              $(toolset-version): toolset= \"$(toolset)\" "version= \""$(version)\" ;
+        }
 
-}    
+        local known ;
 
+        # if the toolset isn't known, configure it now.
+        if $(toolset) in [ feature.values <toolset>  ]
+        {
+            known = true ;
+        }
 
+        if $(known) && $(version) 
+          && ! [ feature.is-subvalue toolset : $(toolset) : version : $(version) ]
+        {
+            known = ;
+        }
+
+        if ! $(known)
+        {
+            if $(debug-config)
+            {
+                ECHO notice: [cmdline-cfg] toolset $(toolset-version) 
+                  not previously configured; configuring now ; 
+            }
+            toolset.using $(toolset) : $(version) ;
+        }
+        else
+        {
+            if $(debug-config)
+            {
+                ECHO notice: [cmdline-cfg] toolset $(toolset-version) already configured ;
+            }
+        }
+
+        # make sure we get an appropriate property into the build request in
+        # case the user used the "--toolset=..." form
+        if ! $(t) in $(argv)
+            && ! $(t) in $(feature-toolsets) 
+        {
+            if $(debug-config)
+            {
+                ECHO notice: [cmdline-cfg] adding toolset=$(t) "to build request." ;
+            }
+            extra-build-request += toolset=$(t) ;
+        }
+    }
+}
+    
 if USER_MODULE in [ RULENAMES ]
 {
     USER_MODULE site-config user-config ;
@@ -151,16 +240,32 @@
 
 if ! [ feature.values <toolset> ] 
 {
-    ECHO "warning: no toolsets are configured." ;
-    ECHO "warning: you won't be able to build C++ programs." ;
-    ECHO "warning: please consult the documentation." ;
-    ECHO ;
+    local default-toolset = gcc ;
+    if [ os.name ] = NT
+    {
+        default-toolset = msvc ;
+    }
+    
+    ECHO "warning: No toolsets are configured." ;
+    ECHO "warning: Configuring default toolset" \"$(default-toolset)\". ;
+    ECHO "warning: If the default is wrong, you may not be able to build C++ programs." ;
+    ECHO "warning: Use the \"--toolset=xxxxx\" option to override our guess." ;
+    ECHO "warning: For more configuration options, please consult"
+    ECHO "warning: http://boost.org/boost-build2/doc/html/bbv2/advanced/configuration.html" ;
+
+    
+    if ! $(ignore-config)
+    {
+        toolset.using $(default-toolset) ;
+    }
 }
 
+build-request = [ 
+  build-request.from-command-line [ 
+    modules.peek : ARGV 
+  ] $(extra-build-request) 
+] ;
 
-
-build-request = [ build-request.from-command-line [ modules.peek : ARGV ] ] ;
-
 properties = [ $(build-request).get-at 2 ] ;
 
 if $(properties) 

Modified: boost/trunk/tools/build/v2/changes.txt
===================================================================
--- boost/trunk/tools/build/v2/changes.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/changes.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,47 @@
+Copyright 2004, 2006 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
-Milestone 11 (not yet released)
+Milestone 12 (in development)
 
 Changes in this release:
 
+    - Support for autoconfiguration of toolset based on command-line
+      toolset=xxxx or --toolset=xxxx options, and for default toolset
+      configuration as a fallback.
+    - Support for precompiled headers for gcc toolset,
+      and improvements for msvc.
+    - Mechanism for removing inherited requirements.
+    - The 'make' rule support specifying usage-requirements.
+    - New 'project.extension' rule for declaring standalone
+      projects.
+    - New 'conditional' convenience rule.
+    - New 'glob-tree' rule.
+    - The 'glob' rule accepts patterns to exclude.
+    - Inline targets are now marked explicit automatically.
+    - Toolsets can now implicitly add requirements to
+    all targets.
+    - New 'generate' rule.
+
+Documentation changes:
+
+    - Installation instructions for Linux distributors.
+
+The following bugs were fixed:
+
+    - The 'cflags' and 'linkflags' features not working for Darwin.
+    - The intel toolset not working on Windows.
+    - Fix library search options for CodeWarriour toolset.
+    - The <install-source-root> could cause duplicate
+    mkdir commands.
+    - Numerious fixes in Boost autolink support
+    - Numerious fixes in Boost.Python support.
+    - Indirect properties not evaluates in usage requirements.
+
+Milestone 11 (Jule 20, 2006)
+
+Changes in this release:
+
     - New C++ compilers: IBM xlf, HP aCC, HP CXX, Intel fortran compiler.
     - New tools: Qt4 support, MS message compiler and IDL compiler.
     - New main targets: 'notfile' and 'cast'.

Modified: boost/trunk/tools/build/v2/doc/development_plan.html
===================================================================
--- boost/trunk/tools/build/v2/doc/development_plan.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/doc/development_plan.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- Copyright 2004 Aleksey Gurtovoy -->
+<!-- Copyright 2003, 2004 Vladimir Prus -->
+<!-- Distributed under the Boost Software License, Version 1.0. -->
+<!-- (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) -->
+
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/tools/build/v2/doc/src/advanced.xml
===================================================================
--- boost/trunk/tools/build/v2/doc/src/advanced.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/doc/src/advanced.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
 
   <chapter id="bbv2.advanced">
-    <title>User documentation</title>
+    <title>Overview</title>
 
   <para>This section will provide the information necessary to create your own
   projects using Boost.Build. The information provided here is relatively
@@ -49,36 +49,27 @@
               How to configure Boost.Build</link></para>
         </listitem>
         <listitem>
-          <para><link linkend="bbv2.advanced.jamfiles">
-              How to write Jamfiles</link></para>
+          <para><link linkend="bbv2.advanced.targets">
+              How to write declares targets in Jamfiles</link></para>
         </listitem>
         <listitem>
           <para><link linkend="bbv2.advanced.build_process">
               How the build process works</link></para>
         </listitem>
         <listitem>
-          <para>Some Basics about the Boost.Jam language. See also the
-          <ulink 
-          url="http://www.boost.org/tools/jam/index.html">Boost.Jam</ulink>
-          documentation.
-          <!-- Something better than this is desperately needed; the
-               tutorial at least should clarify that whitespace is
-               significant and we shouldn't get any further than the
-               beginning of this document before briefly explaining
-               Jam's data and procedural model, rule
-               signatures, and Boost.Build modules -->
+          <para>Some Basics about the Boost.Jam language. See 
+          <xref linkend="bbv2.advanced.jam_language"/>.
           </para>
         </listitem>
       </itemizedlist>
     </para>
     
     <section id="bbv2.advanced.jam_language">
-      <title>Boost.Jam language</title>
+      <title>Boost.Jam Language</title>
 
       <para>This section will describe the basics of the Boost.Jam
       language&#x2014;just enough for writing Jamfiles. For more information,
-      please see the <ulink
-      url="http://www.boost.org/tools/jam/index.html">Boost.Jam</ulink>
+      please see the <link linkend="bbv2.jam">Boost.Jam</link>
       documentation.</para>
 
       <para>Boost.Jam has an interpreted, procedural language. 
@@ -536,14 +527,14 @@
     </section>
 
     <section id="bbv2.advanced.targets">
-      <title>Declaring targets</title>
+      <title>Declaring Targets</title>
 
       <para id="bbv2.advanced.targets.main">
         A <firstterm>Main target</firstterm> is a user-defined named
         entity that can be built, for example an executable file.
         Declaring a main target is usually done using one of the main
         target rules described in <xref linkend=
-        "bbv2.advanced.builtins.targets"/>.  The user can also declare
+        "bbv2.reference.rules"/>.  The user can also declare
         custom main target rules as shown in <xref
         linkend="bbv2.extending.rules"/>.
       </para>
@@ -603,7 +594,7 @@
           <simpara>
             <parameter>default-build</parameter> is the list of properties that will be used
             unless some other value of the same feature is already
-            specified, e.g. on the command line or by propogation from a dependent target.
+            specified, e.g. on the command line or by propagation from a dependent target.
           </simpara>
         </listitem>
         
@@ -617,8 +608,8 @@
       </itemizedlist>
 
       <para>          
-        Some main target rules have a different list of parameters, their 
-        documentation explicitly says so.
+        Some main target rules have a different list of parameters as explicitly
+        stated in their documentation.
       </para>
 
       <para>The actual requirements for a target are obtained by refining
@@ -631,13 +622,17 @@
       <section>
         <title>Name</title>
 
+        <!-- perphaps we should use 'name-target-name' to closer
+        bind this description to the rule's signature. Here, and for
+        other parameters.  -->
         <para>The name of main target has two purposes. First, it's used to refer to this target from
         other targets and from command line. Second, it's used to compute the names of the generated files.
         Typically, filenames are obtained from main target name by appending system-dependent suffixes and
         prefixes.
         </para>
 
-        <para>Name of main target can contain alphanumeral characters, dash, undescore and dot. The entire
+        <para>The name of a main target can contain alphanumeric characters, 
+        dashes, undescores and dots. The entire
         name is significant when resolving references from other targets. For determining filenames, only the
         part before the first dot is taken. For example:</para>
 <programlisting>
@@ -658,28 +653,31 @@
         files. Sometimes, you'll want to automatically construct the
         list of source files rather than having to spell it out
         manually, in which case you can use the
-        <functionname>glob</functionname> rule. Here are two examples:
+        <functionname>glob</functionname> rule. Here are two examples:</para>
 <programlisting>
 exe a : a.cpp ;           # a.cpp is the only source file
 exe b : [ glob *.cpp ] ;  # all .cpp files in this directory are sources 
 </programlisting>
+        <para>
         Unless you specify a file with an absolute path, the name is
-        considered relative to the source directory&#x2014;which is typically
+        considered relative to the source directory&#x200A;&#x2014;&#x200A;which is typically
         the directory where the Jamfile is located, but can be changed as
         described in <xref linkend=
           "bbv2.advanced.projects.attributes.projectrule"/>.
         </para>
-      
+
         <para>
           <!-- use "project-id" here? -->
           The list of sources can also refer to other main targets.
           Targets in the same project can be referred to by name, while
           targets in other projects must be qualified with a directory or a
           symbolic project name. The directory/project name is separated from
-          the target name by double slash. There's no special syntax to
-          distinguish directory name from project name&#x2014;the part before
-          double slash is first looked up as project name, and then as directory
+          the target name by a double forward slash. There's no special syntax to
+          distinguish the directory name from the project name&#x2014;the part before
+          the double slash is first looked up as project name, and then as directory
           name. For example:
+        </para>
+      
 <programlisting>
 lib helper : helper.cpp ;
 exe a : a.cpp helper ;
@@ -687,6 +685,7 @@
 exe b : b.cpp ..//utils ;
 exe c : c.cpp /boost/program_options//program_options ;
 </programlisting>
+        <para>
           The first exe uses the library defined in the same
           project. The second one uses some target (most likely library)
           defined by Jamfile one level higher. Finally, the third target
@@ -745,7 +744,8 @@
         </para>
 
         <para id="bbv2.advanced.targets.requirements.indirect">
-          More powerfull variant of conditional requirements is <firstterm>indirect conditional requiremens</firstterm>.
+          A more powerful variant of conditional requirements 
+          is <firstterm>indirect conditional requirements</firstterm>.
           You can provide a rule that will be called with the current build properties and can compute additional properties
           to be added. For example:
 <programlisting>
@@ -766,10 +766,38 @@
         requirements can be easier to write and understand.
         </para>
 
+        <para>Requirements explicitly specified for a target are usually
+        combined with the requirements specified for the containing project. You
+        can cause a target to completely ignore specific project's requirement
+        using the syntax by adding a minus sign before a property, for example:
+<programlisting>
+exe main : main.cpp : <emphasis role="bold">-&lt;define&gt;UNNECESSARY_DEFINE</emphasis> ;
+</programlisting>
+        This syntax is the only way to ignore free properties from a parent,
+        such as defines. It can be also useful for ordinary properties. Consider
+        this example:
+<programlisting>
+project test : requirements &lt;threading;&gt;multi ;
+exe test1 : test1.cpp ;
+exe test2 : test2.cpp : &lt;threading;&gt;single ;
+exe test3 : test3.cpp : -&lt;threading;&gt;multi ;
+</programlisting>
+        Here, <code>test1</code> inherits project requirements and will always
+        be built in multi-threaded mode. The <code>test2</code> target
+        <emphasis>overrides</emphasis> project's requirements and will
+        always be built in single-threaded mode. In contrast, the 
+        <code>test3</code> target <emphasis>removes</emphasis> a property
+        from project requirements and will be built either in single-threaded or
+        multi-threaded mode depending on which variant is requested by the
+        user.</para>
+
+        <para>Note that the removal of requirements is completely textual: 
+        you need to specify exactly the same property to remove it.</para>
+        
       </section>
 
       <section>
-        <title>Default build</title>
+        <title>Default Build</title>
 
         <para>The <varname>default-build</varname> parameter
         is a set of properties to be used if the build request does
@@ -777,15 +805,15 @@
 <programlisting>
 exe hello : hello.cpp : : &lt;threading&gt;multi ;
 </programlisting>
-        would build a multi-threaded target in unless the user
+        would build a multi-threaded target unless the user
         explicitly requests a single-threaded version. The difference between
         requirements and default-build is that requirements cannot be
-        overriden in any way.
+        overridden in any way.
         </para>
       </section>
 
       <section>
-        <title>Additional information</title>
+        <title>Additional Information</title>
 
         <para>
           The ways a target is built can be so different that
@@ -826,7 +854,7 @@
          explicit request, this can be expressed by the
          <functionname>explicit</functionname> rule:
          <programlisting>
-         explicit install_programs ;</programlisting>
+explicit install_programs ;</programlisting>
          </para>
 
       </section>
@@ -978,17 +1006,9 @@
         </para>
 
       <para>Besides defining projects and main targets, Jamfiles
-      commonly invoke utility rules such as
-      <functionname>constant</functionname> and
-      <functionname>path-constant</functionname>, which inject a
-      specified Boost.Jam variable setting into this project's Jamfile
-      module and those of all its subprojects.  See <xref
-      linkend="bbv2.advanced.other-rules"/> for a complete description
-      of these utility rules.  Jamfiles are regular Boost.Jam source
-      files and Boost.Build modules, so naturally they can contain any kind of Boost.Jam code,
-      including rule definitions.
-      <!-- I improved that sentence, but I don't think it belongs
-           here.  I suggest you strike it. -->
+      often invoke various utility rules. For the full list of rules
+      that can be directly used in Jamfile see 
+      <xref linkend="bbv2.reference.rules"/>.
       </para>
 
       <para>Each subproject inherits attributes, constants and rules
@@ -1008,9 +1028,8 @@
       subprojects, so that every definition made in a parent project
       is always available to its children. The loading order of any
       other projects is unspecified.  Even if one project refers to
-      another via <xref
-      linkend="bbv2.advanced.projects.relationships.useprojectrule"><functionname>use-project</functionname></xref>,
-      or a target reference, no specific order should be assumed.
+      another via the <code>use-project</code> or a target reference, 
+      no specific order should be assumed.
       </para>
 
       <note>
@@ -1028,90 +1047,6 @@
            perfectly appropriate to start a user guide with that kind
            of material. -->
     </section>
-
-    
-    <section id="bbv2.advanced.other-rules">
-      <title>Jamfile Utility Rules</title>
-
-      <para>The following table describes utility rules that can be
-      used in Jamfiles. Detailed information for any of these rules can
-      be obtained by running:
-<screen>
-bjam --help project.<replaceable>rulename</replaceable>
-</screen>
-      </para>
-
-      <table>
-        <title/>
-        <tgroup cols="2">
-          <thead>
-            <row>
-              <entry>Rule</entry>
-              
-              <entry>Semantics</entry>
-            </row>
-          </thead>
-          
-          <tbody>
-            <row>
-              <entry><link linkend=
-                  "bbv2.advanced.projects.attributes.projectrule">project</link>
-              </entry>
-              
-              <entry>Define this project's symbolic ID or attributes.</entry>
-            </row>
-            
-            <row>
-              <entry><xref linkend=
-                  "bbv2.advanced.projects.relationships.useprojectrule">use-project</xref></entry>
-              
-              <entry>Make another project known so that it can be referred to by symbolic ID.</entry>
-            </row>
-            
-            <row>
-              <entry><xref linkend=
-                  "bbv2.advanced.projects.relationships.buildprojectrule">build-project</xref></entry>
-              
-              <entry>Cause another project to be built when this one is built.</entry>
-            </row>
-            
-            <row>
-              <entry><xref linkend=
-                  "bbv2.reference.buildprocess.explict">explicit</xref></entry>
-              
-              <entry>State that a target should be built only by explicit
-                request.</entry>
-            </row>
-            
-            <row>
-              <entry>glob</entry>
-              
-              <entry>Translate a list of shell-style wildcards into a
-              corresponding list of files.</entry>
-            </row>
-
-            <row>
-              <entry>constant</entry>
-              
-              <entry>Injects a variable setting into this project's
-              Jamfile module and those of all its subprojects.</entry>
-            </row>
-
-            <row>
-              <entry>path-constant</entry>
-              
-              <entry>Injects a variable set to a path value into
-              this project's Jamfile module and those of all its subprojects.
-              If the value is a relative path it will be adjusted for
-              each subproject so that it refers to the same
-              directory.</entry>
-            </row>
-
-
-          </tbody>
-        </tgroup>
-      </table>
-    </section>
                
   <section id="bbv2.advanced.build_process">
     <title>The Build Process</title>
@@ -1146,8 +1081,8 @@
       </para>
     </tip>
 
-    <section>
-      <title>Build request</title>
+    <section id="bbv2.advanced.build_request">
+      <title>Build Request</title>
 
       <para>
         The command line specifies which targets to build and with which
@@ -1253,7 +1188,7 @@
       </para>
     </section>
 
-    <section><title>Building a project</title>
+    <section><title>Building a Project</title>
 
       <para>Often, a user builds a complete project, not just one main
       target. In fact, invoking <command>bjam</command> without
@@ -1287,764 +1222,7 @@
     </section>
 
   </section>
-
-  <section id="bbv2.advanced.builtins.targets">
-    <title>Builtin target types</title>
-
-    <para>This section describes main targets types that Boost.Build supports
-    of-of-the-box. Unless otherwise noted, all mentioned main target rules
-    have the common signature, described in <xref
-    linkend="bbv2.main-target-rule-syntax"/>.
-    </para>
-
-    <section>
-      <title>Programs</title>
-
-      <indexterm><primary>Builtin
-      rules</primary><secondary>exe</secondary></indexterm>
-      <para>Programs are created using the <code>exe</code> rule, which
-        follows the <link linkend="bbv2.main-target-rule-syntax">common
-          syntax</link>. For example:
-<programlisting>
-exe hello : hello.cpp some_library.lib /some_project//library 
-          : &lt;threading&gt;multi 
-          ;
-</programlisting>
-        This will create an executable file from the sources -- in this case,
-        one C++ file, one library file present in the same directory, and
-        another library that is created by Boost.Build. Generally, sources
-        can include C and C++ files, object files and libraries. Boost.Build
-        will automatically try to convert targets of other types.
-      </para>
-
-      <tip>
-        <para>         
-          On Windows, if an application uses dynamic libraries, and both
-          the application and the libraries are built by Boost.Build, its not
-          possible to immediately run the application, because the
-          <literal>PATH</literal> environment variable should include the path
-          to the libraries. It means you have to either add the paths
-          manually, or place the application and the libraries to the same
-          directory, for example using the <link linkend="bbv2.builtins.stage">
-            stage</link> rule.
-        </para>
-        <!-- We should be emphasizing the use of the built-in testing
-             rules rather than continually discussing these quirks of
-             running programs with dynamic libraries. -->
-      </tip>
-    </section>
-
-    <section>
-      <title>Libraries</title>
-
-      <para>Libraries are created using the <code>lib</code> rule, which
-        follows the <link linkend="bbv2.main-target-rule-syntax">common
-          syntax</link>. For example:
-<programlisting>
-lib helpers : helpers.cpp : &lt;include&gt;boost : : &lt;include&gt;. ;
-</programlisting>
-      </para>
-      <!-- Add one sentence that says what the above does. -->
-      <para>In the most common case, the <code>lib</code> creates a library
-        from the specified sources. Depending on the value of
-        &lt;link&gt; feature the library will be either static or
-        shared. There are two other cases. First is when the library is
-        installed somewhere in compiler's search paths, and should be
-        searched by the compiler (typically, using the <option>-l</option>
-        option). The second case is where the library is available as a 
-        prebuilt file and the full path is known.          
-        <!-- But the first case is also prebuilt.  This is confusingly phrased. -->
-        </para>
-      
-      <para>
-        The syntax for these case is given below:
-<programlisting>
-lib z : : &lt;name&gt;z &lt;search&gt;/home/ghost ;            
-lib compress : : &lt;file&gt;/opt/libs/compress.a ;
-</programlisting>
-        The <code>name</code> property specifies the name that should be
-        passed to the <option>-l</option> option, and the <code>file</code>
-        property specifies the file location. The <varname>search</varname> feature
-        specifies paths in which to search for the library. That feature can
-        be specified several times, or it can be omitted, in which case only
-        default compiler paths will be searched.
-      </para>
-
-      <para>The difference between using the <varname>file</varname> feature as
-        opposed to the <varname>name</varname> feature together with the
-        <varname>search</varname> feature is that <varname>file</varname> is more
-        precise. A specific file will be used. On the other hand, the
-        <varname>search</varname> feature only adds a library path, and the
-        <varname>name</varname> feature gives the basic name of the library. The
-        search rules are specific to the linker. For example, given these
-        definition:
-<programlisting>
-lib a : : &lt;variant&gt;release &lt;file&gt;/pool/release/a.so ;
-lib a : : &lt;variant&gt;debug &lt;file&gt;/pool/debug/a.so ;
-lib b : : &lt;variant&gt;release &lt;file&gt;/pool/release/b.so ;
-lib b : : &lt;variant&gt;debug &lt;file&gt;/pool/debug/b.so ;
-</programlisting>
-        It's possible to use release version of <code>a</code> and debug
-        version of <code>b</code>. Had we used the <varname>name</varname> and
-        <varname>search</varname> features, the linker would always pick either
-        release or debug versions.
-        <!-- explain -->
-      </para>
-      
-      <para>
-        For convenience, the following syntax is allowed:
-<programlisting>
-lib z ;
-lib gui db aux ;
-</programlisting>
-          and is does exactly the same as:
-<programlisting>
-lib z : : &lt;name&gt;z ;            
-lib gui : : &lt;name&gt;gui ;            
-lib db : : &lt;name&gt;db ;            
-lib aux : : &lt;name&gt;aux ;            
-</programlisting>
-      </para>
-          
-      <para>When a library uses another library you should put that other
-        library in the list of sources. This will do the right thing in all
-        cases. For portability, you should specify library dependencies even
-        for searched and prebuilt libraries, othewise, static linking on
-        Unix won't work. For example:
-<programlisting>
-lib z ;
-lib png : z : &lt;name&gt;png ;
-</programlisting>
-        </para>
-
-      <note>
-        <para>When a library (say, <code>a</code>), that has another
-          library, (say, <code>b</code>) 
-          <!-- how can a library "have" a library? -->
-          is linked dynamically, the <code>b</code>
-          library will be incorporated 
-          <!-- Incorporated?  Be precise. -->
-          in <code>a</code>. (If <code>b</code>
-          is dynamic library as well, then <code>a</code> will only refer to
-          it, and not include any extra code.) 
-          <!-- Don't parenthesize a whole sentence. -->
-          When the <code>a</code>
-          library is linked statically, Boost.Build will assure that all
-          executables that link to <code>a</code> will also link to
-          <code>b</code>.
-        </para>
-      </note>
-         
-      <para>One feature of Boost.Build that is very important for libraries
-        is usage requirements. 
-        <!-- Rephrase that.  But then, it's much too late for an
-             introduction of usage requirements - you've already
-             discussed them many times. -->
-        For example, if you write:
-<programlisting>
-lib helpers : helpers.cpp : : : &lt;include&gt;. ;
-</programlisting>
-        then the compiler include path for all targets that use
-        <code>helpers</code> will contain the directory 
-        <!-- The rest of this sentence is unintelligible -->
-        where the target is defined.path to "helpers.cpp". The user
-        only needs to add <code>helpers</code> to the list of sources,
-        and needn't consider the requirements its use imposes on a
-        dependent target. This feature greatly simplifies Jamfiles.
-        <!-- You can't say “allows to”—you need a noun.  This error is
-             repeated throughout. -->
-      </para>
-
-      <note>
-        <para>If you don't want shared libraries to include all libraries
-          that are specified in sources (especially statically linked ones),
-          you'd need to use the following:
-<programlisting>
-lib b : a.cpp ;
-lib a : a.cpp : &lt;use&gt;b : : &lt;library&gt;b ;
-</programlisting>
-          This specifies that <code>a</code> uses <code>b</code>, and causes
-          all executables that link to <code>a</code> also link to
-          <code>b</code>. In this case, even for shared linking, the
-          <code>a</code> library won't even refer to <code>b</code>.
-        </para>
-      </note>
-          
-    </section>
-
-    <section id="bbv2.builtins.alias">
-      <title>Alias</title>
-
-      <para>
-        The <functionname>alias</functionname> rule gives alternative name to
-        a group of targets. For example, to give the name
-        <filename>core</filename> to a group of three other targets with the
-        following code:
-        <programlisting>
-alias core : im reader writer ;</programlisting>
-        Using <filename>core</filename> on the command line, or in the source list
-        of any other target is the same as explicitly using
-        <filename>im</filename>, <filename>reader</filename>, and
-        <filename>writer</filename>, but it is just more convenient.
-
-      </para>
-
-
-      <para>
-        Another use of the <code>alias</code> rule is to change build
-        properties. For example, if you always want static linking for a
-        specific C++ Boost library, you can write the following:
-<programlisting>
-alias threads : /boost/thread//boost_thread : &lt;link&gt;static ;
-</programlisting>
-        and use only the <code>threads</code> alias in your Jamfiles.
-        <!-- changed name for clarity -->
-      </para>              
-
-      <para>
-        You can also specify usage requirements for the
-        <code>alias</code> target. If you write the following:
-<programlisting>
-alias header_only_library : : : :  &lt;include&gt;/usr/include/header_only_library ; 
-</programlisting>
-        then using <code>header_only_library</code> in sources will only add an
-        include path. Also note that when there are some sources, their usage
-        requirements are propagated, too. For example:
-<programlisting>
-lib lib : lib.cpp : : : &lt;include&gt;. ;
-alias lib_alias ; <!-- This line can't possibly be correct!?? -->
-exe main : main.cpp lib_alias ;
-</programlisting>
-        will compile <filename>main.cpp</filename> with the additional include.
-      </para>
- 
-    </section>
-
-    <section id="bbv2.builtins.stage">
-      <title>Installing</title>
-
-      <para>For installing a built target you should use the
-        <code>install</code> rule, which follows the <link
-          linkend="bbv2.main-target-rule-syntax">common syntax</link>. For
-        example:
-<programlisting>
-install dist : hello helpers ;
-</programlisting>
-        will cause the targets <code>hello</code> and <code>helpers</code> to
-        be moved to the <filename>dist</filename> directory, relative to
-        Jamfile's directory. The directory can
-        be changed with the <code>location</code> property:
-<programlisting>
-install dist : hello helpers : &lt;location&gt;/usr/bin ;
-</programlisting>
-        While you can achieve the same effect by changing the target name to
-        <filename>/usr/bin</filename>, using the <code>location</code>
-        property is better, because it allows you to use a mnemonic target
-        name.
-      </para>
-
-      <para>The <code>location</code> property is especially handy when the location
-        is not fixed, but depends on build variant or environment variables:
-<programlisting>
-install dist : hello helpers : &lt;variant&gt;release:&lt;location&gt;dist/release
-                             &lt;variant&gt;debug:&lt;location&gt;dist/debug ;
-install dist2 : hello helpers : &lt;location&gt;$(DIST) ;
-</programlisting> 
-        See also <link linkend="bbv2.reference.variants.propcond">conditional
-          properties</link> and <link linkend="bbv2.faq.envar">environment variables</link>
-      </para>
-      
-      <para>
-        Specifying the names of all libraries to install can be boring. The
-        <code>install</code> allows you to specify only the top-level executable
-        targets to install, and automatically install all dependencies:
-<programlisting>
-install dist : hello 
-           : &lt;install-dependencies&gt;on &lt;install-type&gt;EXE
-             &lt;install-type&gt;LIB
-           ;
-</programlisting>
-        will find all targets that <code>hello</code> depends on, and install
-        all of those which are either executables or libraries. More
-        specifically, for each target, other targets that were specified as
-        sources or as dependency properties, will be recursively found.  One
-        exception is that targets referred with the <link
-        linkend="bbv2.builtin.features.use"><code>use</code></link> feature
-        are not considered, because that feature is typically used to refer to
-        header-only libraries.
-        If the set of target types is specified, only targets of that type
-        will be installed, otherwise, all found target will be installed.
-      </para>
-
-      <para>The <link linkend="bbv2.builtins.alias"><code>alias</code></link>
-      rule can be used when targets must be installed into several
-      directories:
-<programlisting>
-alias install : install-bin install-lib ;
-install install-bin : applications : /usr/bin ;
-install install-lib : helper : /usr/lib ;
-</programlisting>
-    </para>
-
-    <para>Because the <code>install</code> rule just copies targets, most 
-    free features <footnote><para>see the definition of "free" in <xref
-    linkend="bbv2.reference.features.attributes"/>.</para></footnote>
-    have no effect when used in requirements of the <code>install</code> rule.
-    The only two which matter are  
-    <link linkend="bbv2.builtin.features.dependency">
-    <varname>dependency</varname></link> and, on Unix,
-    <link linkend="bbv2.builtin.feature.dll-path"><varname>dll-path</varname></link>. 
-    </para>
-
-    <note>
-      <para>
-        (Unix specific). On Unix, executables built with Boost.Build typically
-        contain the list of paths to all used dynamic libraries. For
-        installing, this is not desired, so Boost.Build relinks the executable
-        with an empty list of paths. You can also specify additional paths for
-        installed executables with the <varname>dll-path</varname> feature.
-      </para>
-    </note>
-      
-
-    </section>
-
-    <section id="bbv2.builtins.testing">
-
-      <title>Testing</title>
-
-      <para>Boost.Build has convenient support for running unit tests. The
-        simplest way is the <code>unit-test</code> rule, which follows the
-        <link linkend="bbv2.main-target-rule-syntax">common syntax</link>. For
-        example:
-<programlisting>
-unit-test helpers_test : helpers_test.cpp helpers ;
-</programlisting>
-      </para>
-
-      <para>The <functionname>unit-test</functionname> rule behaves like the
-        <functionname>exe</functionname> rule, but after the executable is created it is
-        run. If the executable returns an error code, the build system will also
-        return an error and will try running the executable on the next
-        invocation until it runs successfully. This behaviour ensures that you
-        can't miss a unit test failure.
-      </para>
-
-      <para>By default, the executable is run directly. Sometimes, it's 
-      desirable to run the executable using some helper command. You should use the
-      <literal>testing.launcher</literal> property to specify the name of the
-      helper command. For example, if you write:
-      </para>
-<programlisting>
-unit-test helpers_test 
-   : helpers_test.cpp helpers 
-   : <emphasis role="bold">&lt;testing.launcher&gt;valgrind</emphasis>
-   ;  
-</programlisting>
-      <para>The command used to run the executable will be:</para>
-<screen>
-<emphasis role="bold">valgrind</emphasis> bin/$toolset/debug/helpers_test 
-</screen>
-      
-      
-
-      <para>There are rules for more elaborate testing: <code>compile</code>,
-        <code>compile-fail</code>, <code>run</code> and
-        <code>run-fail</code>. They are more suitable for automated testing, and
-        are not covered here.
-      </para>        
-    </section>
-
-    <section id="bbv2.builtins.raw">
-
-      <title>Raw commands: 'make' and 'notfile'</title>
-
-      <para>Sometimes, the builtin target types are not enough, and you
-      want Boost.Build to just run specific commands. There are two main
-      target rules that make it possible: <functionname>make</functionname>
-      and <functionname>notfile</functionname>.
-      </para>
-
-      <para>The <functionname>make</functionname> rule is used when you want to
-      create one file from a number of sources using some specific command.
-      The <functionname>notfile</functionname> is used to unconditionally run
-      a command. 
-      </para>
-
-      <para>
-        Suppose you want to create file <filename>file.out</filename> from
-        file <filename>file.in</filename> by running command 
-        <command>in2out</command>. Here's how you'd do this in Boost.Build:
-<programlisting>
-actions in2out
-{
-    in2out $(&lt;) $(&gt;)
-}
-make file.out : file.in : @in2out ;
-</programlisting>
-        If you run <command>bjam</command> and <filename>file.out</filename> 
-        does not exist, Boost.Build will run the <command>in2out</command>
-        command to create that file. For more details on specifying actions,
-        see <xref linkend="bbv2.advanced.jam_language.actions"/>.
-      </para>
-
-      <note>
-        <para>
-          The <functionname>make</functionname> rule is useful to express custom
-          transformation that are used just once or twice in your project. For
-          transformations that are used often, you are advised to declare
-          new generator, as described in <xref linkend="bbv2.extending.tools"/>.
-        </para>
-      </note>
-
-      <para>
-        It could be that you just want to run some command unconditionally,
-        and that command does not create any specific files. The, you can use
-        the <functionname>notfile</functionname> rule. For example:
-<programlisting>
-notfile echo_something : @echo ;
-actions echo
-{
-    echo "something"
-}
-</programlisting>
-        The only difference from the <functionname>make</functionname> rule is
-        that the name of the target is not considered a name of a file, so
-        Boost.Build will unconditionally run the action.
-      </para>
-            
-    </section>
     
-  </section>
-  
-  <section id="bbv2.advanced.builtins.features">
-    <title>Builtin features</title> 
-        
-    <variablelist>
-      <varlistentry><term><literal>variant</literal></term>
-        
-        <listitem>
-          <para>
-            A feature that combines several low-level features, making
-            it easy to request common build configurations.
-          </para>
-          
-          <para><emphasis role="bold">Allowed values:</emphasis> <literal>debug</literal>, <literal>release</literal>,
-            <literal>profile</literal>.</para>
-          
-          <para>The value <literal>debug</literal> expands to</para>
-          
-<programlisting>
-&lt;optimization&gt;off &lt;debug-symbols&gt;on &lt;inlining&gt;off &lt;runtime-debugging&gt;on
-</programlisting>
-          
-          <para>The value <literal>release</literal> expands to</para>
-          
-<programlisting>
-&lt;optimization&gt;speed &lt;debug-symbols&gt;off &lt;inlining&gt;full &lt;runtime-debugging&gt;off
-</programlisting>
-          
-          <para>The value <literal>profile</literal> expands to the same as
-          <literal>release</literal>, plus:</para>
-          
-<programlisting>
-&lt;profiling&gt;on &lt;debug-symbols&gt;on
-</programlisting>
-
-          <para>User can define his own build variants using the <code>variant</code> rule from the <code>common</code>
-          module.</para>
-          
-          <para><emphasis role="bold">Notee:</emphasis> Runtime
-          debugging is on in debug builds to suit the expectations of
-          people used to various IDEs. 
-          <!-- Define "runtime debugging." Why will those people expect it to be on in debug builds? -->
-          </para>
-        </listitem></varlistentry>
-      
-      <varlistentry id="bbv2.advanced.builtins.features.link">
-        <term><literal>link</literal></term>
-        
-        <listitem>
-          <simpara>
-            A feature that controls how libraries are built.
-          </simpara>
-          
-          <para><emphasis role="bold">Allowed values:</emphasis> <literal>shared</literal>,
-            <literal>static</literal></para>
-        </listitem></varlistentry>
-      
-      <varlistentry><term><literal>source</literal></term>
-        
-        <listitem>
-          <simpara>
-            The <code>&lt;source&gt;X</code> feature has the same effect on 
-            building a target as putting X in the list of sources. 
-            It's useful when you want to add
-            the same source to all targets in the project 
-            (you can put &lt;source&gt; in requirements) or to conditionally
-            include a source (using conditional requirements, see <xref linkend="bbv2.tutorial.conditions"/>)
-            See also the <code>&lt;library&gt;</code> feature.
-          </simpara>
-        </listitem>
-      </varlistentry>
-      
-      <varlistentry><term><literal>library</literal></term>
-        
-        <listitem>
-          <simpara>
-            This feature is almost equivalent to the <code>&lt;source&gt;</code> feature, 
-            except that it takes effect only for linking. When you want to 
-            link all targets in a Jamfile to certain library, the 
-            <code>&lt;library&gt;</code> feature is preferred over 
-            <code>&lt;source&gt;X</code> -- the latter will add the library to
-            all targets, even those that have nothing to do with libraries.
-          </simpara>
-        </listitem>
-      </varlistentry>
-
-      <varlistentry><term><anchor id="bbv2.builtin.features.dependency"/>
-          <literal>dependency</literal></term>
-        
-        <listitem>
-          <simpara>
-            Introduces a dependency on the target named by the
-            value of this feature (so it will be brought
-            up-to-date whenever the target being declared is).
-            The dependency is not used in any other way. For example, in
-            application with plugins, the plugins are not used when linking
-            the application, 
-            application might have dependency on its plugins, even though 
-
-
-            , and
-            adds its usage requirements to the build properties 
-            of the target being declared.  
-
- The primary use case is when you want
-            the usage requirements (such as <code>#include</code> paths) of some
-            library to be applied, but don't want to link to it.
-            <!-- It's hard to picture why anyone would want to do
-                 that.  Please flesh out this motivation -->
-          </simpara>
-        </listitem>
-      </varlistentry>
-
-            
-      <varlistentry><term><anchor id="bbv2.builtin.features.use"/>
-          <literal>use</literal></term>
-        
-        <listitem>
-          <simpara>
-            Introduces a dependency on the target named by the
-            value of this feature (so it will be brought
-            up-to-date whenever the target being declared is), and
-            adds its usage requirements to the build properties 
-            <!-- Do you really mean "to the requirements?" -->
-            of the target being declared.  The dependency is not used
-            in any other way. The primary use case is when you want
-            the usage requirements (such as <code>#include</code> paths) of some
-            library to be applied, but don't want to link to it.
-            <!-- It's hard to picture why anyone would want to do
-                 that.  Please flesh out this motivation -->
-          </simpara>
-        </listitem>
-      </varlistentry>
-      
-      <varlistentry><term><anchor id="bbv2.builtin.features.dll-path"/>
-      <literal>dll-path</literal></term>
-        
-        <listitem>
-          <simpara>
-            Specify an additional directory where the system should
-            look for shared libraries when the executable or shared
-            library is run. This feature only affects Unix
-            compilers. Plase see <xref linkend="bbv2.faq.dll-path"/>
-            in <xref linkend="bbv2.faq"/> for details.
-          </simpara>
-        </listitem></varlistentry>
-      
-      <varlistentry><term><literal>hardcode-dll-paths</literal></term>
-        
-        <listitem>
-          <simpara>
-            Controls automatic generation of dll-path properties.
-          </simpara>
-          
-          <para><emphasis role="bold">Allowed values:</emphasis>
-            <literal>true</literal>, <literal>false</literal>.  This property
-            is specific to Unix systems. If an executable is built with
-            <code>&lt;hardcode-dll-paths&gt;true</code>, the generated binary
-            will contain the list of all the paths to the used shared
-            libraries. As the result, the executable can be run without
-            changing system paths to shared libraries or installing the
-            libraries to system paths. This 
-            <!-- you need an antecedent.  This _what_? -->
-            is very convenient during
-            development. Plase see the <link
-            linkend="bbv2.faq.dll-path">FAQ entry</link> for details.
-            Note that on Mac OSX, the paths are unconditionally hardcoded by
-            the linker, and it's not possible to disable that behaviour.
-          </para>
-        </listitem></varlistentry>
-
-      <varlistentry>
-        <term><literal>cflags</literal></term>
-        <term><literal>cxxflags</literal></term>
-        <term><literal>linkflags</literal></term>
-        
-        <listitem>
-          <simpara>
-            The value of those features is passed without modification to the
-            corresponding tools. For <code>cflags</code> that's both the C and C++
-            compilers, for <code>cxxflags</code> that's the C++ compiler and for
-            <code>linkflags</code> that's the linker. The features are handy when
-            you're trying to do something special that cannot be achieved by
-            higher-level feature in Boost.Build.
-          </simpara>
-        </listitem>
-      </varlistentry>
-
-      <varlistentry><term><literal>warnings</literal></term>
-        
-        <listitem>
-          <simpara>
-            The <code>&lt;warnings&gt;</code> feature controls the warning level of compilers. It has the following values:
-            <itemizedlist>
-              <listitem><para><code>off</code> - disables all warnings.</para></listitem>
-              <listitem><para><code>on</code> - enables default warning level for the tool.</para></listitem>
-              <listitem><para><code>all</code> - enables all warnings.</para></listitem>
-            </itemizedlist>
-            Default value is <code>all</code>.
-          </simpara>
-        </listitem>
-      </varlistentry>
-
-      <varlistentry><term><literal>warnings-as-errors</literal></term>
-        
-        <listitem>
-          <simpara>
-            The <code>&lt;warnings-as-errors&gt;</code> makes it possible to treat warnings as errors and abort
-            compilation on a warning. The value <code>on</code> enables this behaviour. The default value is
-            <code>off</code>.
-          </simpara>
-        </listitem>
-      </varlistentry>
-
-      <varlistentry><term><literal>build</literal></term>
-        
-        <listitem>
-          <para><emphasis role="bold">Allowed values:</emphasis> <literal>no</literal></para>
-
-          <para>
-            The <code>build</code> feature is used to conditionally disable build of a target. If <code>&lt;build&gt;no</code>
-            is in properties when building a target, build of that target is skipped. Combined with conditional requirements this
-            allows to skip building some target in configurations where the build is known to fail. 
-          </para>
-        </listitem>
-      </varlistentry>
-
-
-
-
-
-    </variablelist>
-  </section>
-
-  <section id="bbv2.advanced.differences_to_v1">
-    <title>Differences to Boost.Build V1</title>
-    <!-- "Differences to" is the British English usage.  American
-         English is "differences from."  You can use the former but be
-         sure you know what you're doing -->
-
-    <para>While Boost.Build V2 is based on the same ideas as Boost.Build V1,
-    some of the syntax was changed, and some new important features were
-    added. This chapter describes most of the changes.</para>
-
-    <section id="bbv2.advanced.differences_to_v1.configuration">
-      <title>Configuration</title>
-      
-      <para>In V1, toolsets were configured by environment variables. If you
-      wanted to use two versions of the same toolset, you had to create a new
-      toolset module that would set the variables and then invoke the base
-      toolset. In V2, toolsets are configured by the
-      <functionname>using</functionname>, and you can easily configure several
-      versions of a toolset. See <xref
-      linkend="bbv2.advanced.configuration"/> for details.
-      </para>
-      
-    </section>
-
-    <section id="bbv2.advanced.differences_to_v1.jamfiles">
-      <title>Writing Jamfiles</title>
-
-      <para>Probably one of the most important differences in V2 Jamfiles is
-      the use of project requirements. In V1, if several targets had the same
-      requirements (for example, a common <code>#include</code> path), it was necessary to
-      manually write the requirements or use a helper rule or template target. In V2, the
-      common properties can be specified with the <code>requirements</code> project
-      attribute, as documented in <xref linkend="bbv2.advanced.projects"/>.
-      </para>
-
-      <para><link linkend="bbv2.tutorial.libs">Usage requirements</link>
-      also help to simplify Jamfiles. 
-      <!-- Simplify, simplify, simplify!  You could go through the
-           entire document several times and make changes like that
-           one -->
-      If a library requires
-      all clients to use specific <code>#include</code> paths or macros when compiling 
-      code that depends on the library, that information can be cleanly
-      represented.</para>
-
-      <para>The difference between <code>lib</code> and <code>dll</code> targets in V1 is completely
-      eliminated in V2. There's only one library target type, <code>lib</code>, which can create
-      either static or shared libraries depending on the value of the 
-        <link linkend="bbv2.advanced.builtins.features.link"><varname>&lt;link&gt;</varname>
-      feature</link>. If your target should be only built in one way<!--"variant" has a different meaning here-->, you
-      can add <code>&lt;link&gt;shared</code> or <code>&lt;link&gt;static</code> to its requirements.
-      </para>
-
-      <para>The syntax for referring to other targets was changed a bit. While
-      in V1 one would use:
-<programlisting>
-exe a : a.cpp &lt;lib&gt;../foo/bar ;
-</programlisting> 
-        the V2 syntax is:
-<programlisting>
-exe a : a.cpp ../foo//bar ;
-</programlisting>
-        Note that you don't need to specify the type of other target, but the
-        last element should be separated from the others by a double slash to indicate that
-        you're referring to target <filename>bar</filename> in project <filename>../foo</filename>, and not to
-        project <filename>../foo/bar</filename>.
-        </para>
-      
-                  
-    </section>
-
-    <section id="bbv2.advanced.differences_to_v1.build_process">
-      <title>Build process</title>
-
-      <para>The command line syntax in V2 is completely different. For example
-<programlisting>
-bjam -sTOOLS=msvc -sBUILD=release some_target
-</programlisting>
-        now becomes:
-<programlisting>
-bjam toolset=msvc variant=release some_target
-</programlisting>
-        or, using implicit features, just:
-<programlisting>
-bjam msvc release some_target
-</programlisting>
-      See <link linkend="bbv2.reference.commandline">the reference</link> for a
-      complete description of the syntax.
-      </para>
-
-            
-    </section>
-
-  </section>
-    
   </chapter>
 
 <!--

Modified: boost/trunk/tools/build/v2/doc/src/extending.xml
===================================================================
--- boost/trunk/tools/build/v2/doc/src/extending.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/doc/src/extending.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -55,9 +55,6 @@
 type.register VERBATIM : vrb ;
 </programlisting>
 
-<!-- changed "verbatim" to "vrb."  Too many similar things
-     (verbatim/VERBATIM) makes for easy confusion -->
-
   <para>The first parameter to
   <functionname>type.register</functionname> gives the name of the
   declared type. By convention, it's uppercase. The second parameter
@@ -385,7 +382,7 @@
         program will import itself, not the extension. Here's how it can be
         done:
 <programlisting>
-rule run ( project name ? : property-set : sources * : multiple ? )
+rule run ( project name ? : property-set : sources * )
 {       
     local python ;
     for local s in $(sources)

Copied: boost/trunk/tools/build/v2/doc/src/fragments.xml (from rev 14034, boost/branches/upstream/current/tools/build/v2/doc/src/fragments.xml)

Modified: boost/trunk/tools/build/v2/doc/src/install.xml
===================================================================
--- boost/trunk/tools/build/v2/doc/src/install.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/doc/src/install.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -64,9 +64,9 @@
           a prebuilt executable</ulink></emphasis> from SourceForge.
           If a prebuilt executable is not provided for your platform
           or you are using Boost's sources in an unreleased state, it
-          may be necessary to <ulink
-          url= "../../doc/html/jam/buildin.html">build <command>bjam</command>
-          from sources</ulink> included in the Boost source tree.
+          may be necessary to 
+          <link linkend="jam.building">build <command>bjam</command>
+          from sources</link> included in the Boost source tree.
         </simpara>
       </listitem>
 
@@ -159,12 +159,70 @@
       </listitem>
     </itemizedlist>
 
-  <para><emphasis role="bold">N.B.</emphasis>
-  When <command>bjam</command> is invoked from anywhere in the Boost
-  directory tree <emphasis>other than</emphasis> the Boost.Build root
-  and its subdirectories, <ulink url="../../tools/build/index.html">Boost.Build
-  v1</ulink> is used by default. To override the default and use
-  Boost.Build v2, you have to add the <option>--v2</option> command
-  line option to all <command>bjam</command> invocations.</para>
+        <bridgehead>Information for distributors</bridgehead>
 
+        <para>
+          If you're planning to package Boost.Build for a Linux distribution,
+          please follow these guidelines:
+
+          <itemizedlist>
+            <listitem><para>Create a separate package for Boost.Jam.</para></listitem>
+
+            <listitem>
+              <para>Create another package for Boost.Build, and make
+              this package install all Boost.Build files to
+              <filename>/usr/share/boost-build</filename> directory. After
+              install, that directory should contain everything you see in
+              Boost.Build release package, except for
+              <filename>jam_src</filename> directory.  If you're using Boost CVS
+              to obtain Boost.Build, as opposed to release package, take
+              everything from the <filename>tools/build/v2</filename> directory.
+              For a check, make sure that
+              <filename>/usr/share/boost-build/boost-build.jam</filename> is installed.
+              </para>
+
+              <para>Placing Boost.Build into <filename>/usr/share/boost-build</filename>
+              will make sure that <command>bjam</command> will find Boost.Build
+              without any additional setup.</para>
+            </listitem>
+
+            <listitem><para>Provide a
+            <filename>/etc/site-config.jam</filename> configuration file that will
+            contain:
+<programlisting>
+using gcc ;
+</programlisting>
+             You might want to add dependency from Boost.Build package to gcc,
+             to make sure that users can always build Boost.Build examples.
+            </para></listitem>
+          </itemizedlist>
+        </para>
+
+        <para>If those guidelines are met, users will be able to invoke
+        <command>bjam</command> without any explicit configuration.
+        </para>
+
+    
+      
+
   </chapter>
+
+<!--
+     Local Variables:
+     mode: nxml
+     sgml-indent-data:t
+     sgml-parent-document:("userman.xml" "chapter")
+     sgml-set-face: t
+     sgml-omittag:nil
+     sgml-shorttag:nil
+     sgml-namecase-general:t
+     sgml-general-insert-case:lower
+     sgml-minimize-attributes:nil
+     sgml-always-quote-attributes:t
+     sgml-indent-step:2
+     sgml-exposed-tags:nil
+     sgml-local-catalogs:nil
+     sgml-local-ecat-files:nil
+     End:
+-->
+

Modified: boost/trunk/tools/build/v2/doc/src/reference.xml
===================================================================
--- boost/trunk/tools/build/v2/doc/src/reference.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/doc/src/reference.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,14 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <!DOCTYPE chapter PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
-  "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
+  "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd"
+[
+<!ENTITY toolset_ops "<optional><replaceable>version</replaceable></optional> : <optional><replaceable>c++-compile-command</replaceable></optional> : <optional><replaceable>compiler options</replaceable></optional>">
+<!ENTITY option_list_intro "<para>The following options can be provided, using <literal>&lt;<replaceable>option-name</replaceable>&gt;<replaceable>option-value</replaceable></literal> syntax:</para>">
+<!ENTITY using_repeation "<para>This statement may be repeated several times, if you want to configure several versions of the compiler.</para>">
+]>
 
-<chapter id="bbv2.reference">
+<chapter id="bbv2.reference"
+         xmlns:xi="http://www.w3.org/2001/XInclude">
   <title>Detailed reference</title>
 
   <section id="bbv2.reference.general">
@@ -147,7 +153,7 @@
               An argument containing either slashes or
               the <code>=</code> symbol specifies a number of build
               request elements (see <xref
-              linkend="bbv2.reference.buildreq"/>). In its simplest
+              linkend="bbv2.advanced.build_request"/>). In its simplest
               form, it's just a set of properties, separated by
               slashes, which become a single build request element,
               for example:
@@ -228,49 +234,975 @@
 
   </section>
 
-  <section id="bbv2.reference.jamfiles">
-    <title>Writing Jamfiles</title>
+  <section id="bbv2.reference.rules">
+    <title>Builtin rules</title>
 
-    <para>This section describes specific information about writing Jamfiles.</para>
+    <para>This section contains the list of all rules that
+    can be used in Jamfile&#x2014;both rules that define new
+    targets and auxiliary rules.</para>
 
-    <section id="bbv2.reference.headers">
-      <title>Generated headers</title>
+    <variablelist>
+      <varlistentry>
+        <term><literal>exe</literal></term>
+        
+        <listitem><para>Creates an executable file. See 
+        <xref linkend="bbv2.tasks.programs"/>.</para></listitem>
+      </varlistentry>
 
-      <para>Usually, Boost.Build handles implicit dependendies completely
-        automatically. For example, for C++ files, all <literal>#include</literal>
-        statements are found and handled. The only aspect where user help
-        might be needed is implicit dependency on generated files.</para>
+      <varlistentry>
+        <term><literal>lib</literal></term>
+        
+        <listitem><para>Creates an library file. See 
+        <xref linkend="bbv2.tasks.libraries"/>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry>
+        <term><literal>install</literal></term>
+        
+        <listitem><para>Installs built targets and other files. See 
+        <xref linkend="bbv2.tasks.installing"/>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry>
+        <term><literal>alias</literal></term>
+        
+        <listitem><para>Creates an alias for other targets. See 
+        <xref linkend="bbv2.tasks.alias"/>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry>
+        <term><literal>unit-test</literal></term>
+        
+        <listitem><para>Creates an executable that will be automatically run. See 
+        <xref linkend="bbv2.tutorial.testing"/>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry>
+        <term><literal>compile</literal></term>
+        <term><literal>compile-fail</literal></term>
+        <term><literal>link</literal></term>
+        <term><literal>link-fail</literal></term>
+        <term><literal>run</literal></term>
+        <term><literal>run-fail</literal></term>
+        
+        <listitem><para>Specialized rules for testing. See 
+        <xref linkend="bbv2.tutorial.testing"/>.</para></listitem>
+      </varlistentry>
+
+
+      <varlistentry>
+        <term><literal>obj</literal></term>
+        
+        <listitem><para>Creates an object file. Useful when a single source
+        file must be compiled with special properties.</para></listitem>
+      </varlistentry>
+
+      <varlistentry>
+        <term><literal>glob</literal></term>
+        
+        <listitem><para>The <code>glob</code> rule takes a list shell pattern 
+        and returns the list of files in the project's source directory that
+        match the pattern. For example:
+        <programlisting>
+lib tools : [ glob *.cpp ] ;
+        </programlisting>
+        It is possible to also pass a second argument&#x2014;the list of
+        exclude patterns. The result will then include the list of
+        files patching any of include patterns, and not matching any
+        of the exclude patterns. For example:
+        <programlisting>
+lib tools : [ glob *.cpp : file_to_exclude.cpp bad*.cpp ] ;
+        </programlisting>
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry>
+        <term><literal>glob-tree</literal></term>
+        
+        <listitem><para>The <code>glob-tree</code> is similar to the
+        <code>glob</code> except that it operates recursively from
+        the directory of the containing Jamfile. For example:
+        <programlisting>
+ECHO [ glob-tree *.cpp : .svn ] ;
+        </programlisting>
+        will print the names of all C++ files in your project. The 
+        <literal>.svn</literal> exclude pattern prevents the 
+        <code>glob-tree</code> rule from entering administrative
+        directories of the Subverion version control system.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry>
+        <term><literal>project</literal></term>
+        
+        <listitem><para>Declares project id and attributes, including
+        project requirements. See <xref linkend="bbv2.advanced.projects"/>.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry>
+        <term><literal>use-project</literal></term>
+        
+        <listitem><para>Assigns a symbolic project ID to a project at 
+        a given path. This rule must be better documented!
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry>
+        <term><literal>explicit</literal></term>
+        
+        <listitem><para>The <literal>explicit</literal> rule takes a single
+        parameter&#x2014;a list of target names. The named targets will
+        be marked explicit, and will be built only if they are explicitly
+        requested on the command line, or if their dependents are built.
+        Compare this to ordinary targets, that are built implicitly when
+        their containing project is built.</para></listitem>
+      </varlistentry>
+
+      <varlistentry>
+        <term><literal>constant</literal></term>
+        
+        <listitem><para>Sets project-wide constant. Takes two
+        parameters: variable name and a value and makes the specified
+        variable name accessible in this Jamfile and any child Jamfiles.
+        For example:
+        <programlisting>
+constant VERSION : 1.34.0 ;
+        </programlisting>
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry>
+        <term><literal>path-constant</literal></term>
+        
+        <listitem><para>Same as <literal>constant</literal> except that
+        the value is treated as path relative to Jamfile location. For example,
+        if <command>bjam</command> is invoked in the current directory,
+        and Jamfile in <filename>helper</filename> subdirectory has:
+        <programlisting>
+path-constant DATA : data/a.txt ;
+        </programlisting>
+        then the variable <varname>DATA</varname> will be set to 
+        <literal>helper/data/a.txt</literal>, and if <command>bjam</command>
+        is invoked from the <filename>helper</filename> directory, then
+        the variable <varname>DATA</varname> will be set to 
+        <literal>data/a.txt</literal>.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry>
+        <term><literal>build-project</literal></term>
+        
+        <listitem><para>Cause some other project to be built. This rule
+        takes a single parameter&#x2014;a directory name relative to
+        the containing Jamfile. When the containing Jamfile is built,
+        the project located at that directory will be built as well.
+        At the moment, the parameter to this rule should be a directory
+        name. Project ID or general target references are not allowed.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry>
+        <term><literal>test-suite</literal></term>
+        
+        <listitem><para>This rule is deprecated and equivalent to
+        <code>alias</code>.</para></listitem>
+      </varlistentry>
+
+    </variablelist>
+
+  </section>
+
+  <section id="bbv2.advanced.builtins.features">
+    <title>Builtin features</title> 
+        
+    <variablelist>
+      <varlistentry><term><literal>variant</literal></term>
+        
+        <listitem>
+          <para>
+            A feature that combines several low-level features, making
+            it easy to request common build configurations.
+          </para>
+          
+          <para><emphasis role="bold">Allowed values:</emphasis> <literal>debug</literal>, <literal>release</literal>,
+            <literal>profile</literal>.</para>
+          
+          <para>The value <literal>debug</literal> expands to</para>
+          
+<programlisting>
+&lt;optimization&gt;off &lt;debug-symbols&gt;on &lt;inlining&gt;off &lt;runtime-debugging&gt;on
+</programlisting>
+          
+          <para>The value <literal>release</literal> expands to</para>
+          
+<programlisting>
+&lt;optimization&gt;speed &lt;debug-symbols&gt;off &lt;inlining&gt;full &lt;runtime-debugging&gt;off
+</programlisting>
+          
+          <para>The value <literal>profile</literal> expands to the same as
+          <literal>release</literal>, plus:</para>
+          
+<programlisting>
+&lt;profiling&gt;on &lt;debug-symbols&gt;on
+</programlisting>
+
+          <para>User can define his own build variants using the <code>variant</code> rule from the <code>common</code>
+          module.</para>
+          
+          <para><emphasis role="bold">Notee:</emphasis> Runtime
+          debugging is on in debug builds to suit the expectations of
+          people used to various IDEs. 
+          <!-- Define "runtime debugging." Why will those people expect it to be on in debug builds? -->
+          </para>
+        </listitem></varlistentry>
       
-      <para>By default, Boost.Build handles such dependencies within one
-        main target. For example, assume that main target "app" has two
-        sources, "app.cpp" and "parser.y". The latter source is converted
-        into "parser.c" and "parser.h". Then, if "app.cpp" includes
-        "parser.h", Boost.Build will detect this dependency. Moreover,
-        since "parser.h" will be generated into a build directory, the
-        path to that directory will automatically added to include
-        path.</para>
+      <varlistentry id="bbv2.advanced.builtins.features.link">
+        <term><literal>link</literal></term>
+        
+        <listitem>
+          <simpara>
+            A feature that controls how libraries are built.
+          </simpara>
+          
+          <para><emphasis role="bold">Allowed values:</emphasis> <literal>shared</literal>,
+            <literal>static</literal></para>
+        </listitem></varlistentry>
       
-      <para>Making this mechanism work across main target boundaries is
-        possible, but imposes certain overhead. For that reason, if
-        there's implicit dependency on files from other main targets, the
-        <literal>&lt;implicit-dependency&gt;</literal> [ link ] feature must
-        be used, for example:</para>
+      <varlistentry><term><literal>source</literal></term>
+        
+        <listitem>
+          <simpara>
+            The <code>&lt;source&gt;X</code> feature has the same effect on 
+            building a target as putting X in the list of sources. 
+            It's useful when you want to add
+            the same source to all targets in the project 
+            (you can put &lt;source&gt; in requirements) or to conditionally
+            include a source (using conditional requirements, see <xref linkend="bbv2.tutorial.conditions"/>)
+            See also the <code>&lt;library&gt;</code> feature.
+          </simpara>
+        </listitem>
+      </varlistentry>
       
+      <varlistentry><term><literal>library</literal></term>
+        
+        <listitem>
+          <simpara>
+            This feature is almost equivalent to the <code>&lt;source&gt;</code> feature, 
+            except that it takes effect only for linking. When you want to 
+            link all targets in a Jamfile to certain library, the 
+            <code>&lt;library&gt;</code> feature is preferred over 
+            <code>&lt;source&gt;X</code> -- the latter will add the library to
+            all targets, even those that have nothing to do with libraries.
+          </simpara>
+        </listitem>
+      </varlistentry>
+
+      <varlistentry><term><anchor id="bbv2.builtin.features.dependency"/>
+          <literal>dependency</literal></term>
+        
+        <listitem>
+          <simpara>
+            Introduces a dependency on the target named by the
+            value of this feature (so it will be brought
+            up-to-date whenever the target being declared is).
+            The dependency is not used in any other way. For example, in
+            application with plugins, the plugins are not used when linking
+            the application, 
+            application might have dependency on its plugins, even though 
+
+
+            , and
+            adds its usage requirements to the build properties 
+            of the target being declared.  
+
+ The primary use case is when you want
+            the usage requirements (such as <code>#include</code> paths) of some
+            library to be applied, but don't want to link to it.
+            <!-- It's hard to picture why anyone would want to do
+                 that.  Please flesh out this motivation -->
+          </simpara>
+        </listitem>
+      </varlistentry>
+
+            
+      <varlistentry><term><anchor id="bbv2.builtin.features.use"/>
+          <literal>use</literal></term>
+        
+        <listitem>
+          <simpara>
+            Introduces a dependency on the target named by the
+            value of this feature (so it will be brought
+            up-to-date whenever the target being declared is), and
+            adds its usage requirements to the build properties 
+            <!-- Do you really mean "to the requirements?" -->
+            of the target being declared.  The dependency is not used
+            in any other way. The primary use case is when you want
+            the usage requirements (such as <code>#include</code> paths) of some
+            library to be applied, but don't want to link to it.
+            <!-- It's hard to picture why anyone would want to do
+                 that.  Please flesh out this motivation -->
+          </simpara>
+        </listitem>
+      </varlistentry>
+      
+      <varlistentry><term><anchor id="bbv2.reference.features.dll-path"/>
+      <literal>dll-path</literal></term>
+        
+        <listitem>
+          <simpara>
+            Specify an additional directory where the system should
+            look for shared libraries when the executable or shared
+            library is run. This feature only affects Unix
+            compilers. Plase see <xref linkend="bbv2.faq.dll-path"/>
+            in <xref linkend="bbv2.faq"/> for details.
+          </simpara>
+        </listitem></varlistentry>
+      
+      <varlistentry><term><literal>hardcode-dll-paths</literal></term>
+        
+        <listitem>
+          <simpara>
+            Controls automatic generation of dll-path properties.
+          </simpara>
+          
+          <para><emphasis role="bold">Allowed values:</emphasis>
+            <literal>true</literal>, <literal>false</literal>.  This property
+            is specific to Unix systems. If an executable is built with
+            <code>&lt;hardcode-dll-paths&gt;true</code>, the generated binary
+            will contain the list of all the paths to the used shared
+            libraries. As the result, the executable can be run without
+            changing system paths to shared libraries or installing the
+            libraries to system paths. This 
+            <!-- you need an antecedent.  This _what_? -->
+            is very convenient during
+            development. Plase see the <link
+            linkend="bbv2.faq.dll-path">FAQ entry</link> for details.
+            Note that on Mac OSX, the paths are unconditionally hardcoded by
+            the linker, and it's not possible to disable that behaviour.
+          </para>
+        </listitem></varlistentry>
+
+      <varlistentry>
+        <term><literal>cflags</literal></term>
+        <term><literal>cxxflags</literal></term>
+        <term><literal>linkflags</literal></term>
+        
+        <listitem>
+          <simpara>
+            The value of those features is passed without modification to the
+            corresponding tools. For <code>cflags</code> that's both the C and C++
+            compilers, for <code>cxxflags</code> that's the C++ compiler and for
+            <code>linkflags</code> that's the linker. The features are handy when
+            you're trying to do something special that cannot be achieved by
+            higher-level feature in Boost.Build.
+          </simpara>
+        </listitem>
+      </varlistentry>
+
+      <varlistentry><term><literal>warnings</literal></term>
+        
+        <listitem>
+          <simpara>
+            The <code>&lt;warnings&gt;</code> feature controls the warning level of compilers. It has the following values:
+            <itemizedlist>
+              <listitem><para><code>off</code> - disables all warnings.</para></listitem>
+              <listitem><para><code>on</code> - enables default warning level for the tool.</para></listitem>
+              <listitem><para><code>all</code> - enables all warnings.</para></listitem>
+            </itemizedlist>
+            Default value is <code>all</code>.
+          </simpara>
+        </listitem>
+      </varlistentry>
+
+      <varlistentry><term><literal>warnings-as-errors</literal></term>
+        
+        <listitem>
+          <simpara>
+            The <code>&lt;warnings-as-errors&gt;</code> makes it possible to treat warnings as errors and abort
+            compilation on a warning. The value <code>on</code> enables this behaviour. The default value is
+            <code>off</code>.
+          </simpara>
+        </listitem>
+      </varlistentry>
+
+      <varlistentry><term><literal>build</literal></term>
+        
+        <listitem>
+          <para><emphasis role="bold">Allowed values:</emphasis> <literal>no</literal></para>
+
+          <para>
+            The <code>build</code> feature is used to conditionally disable build of a target. If <code>&lt;build&gt;no</code>
+            is in properties when building a target, build of that target is skipped. Combined with conditional requirements this
+            allows to skip building some target in configurations where the build is known to fail. 
+          </para>
+        </listitem>
+      </varlistentry>
+
+      <varlistentry><term><literal>tag</literal></term>
+
+        <listitem><para>The <literal>tag</literal> feature is used to customize
+        the name of the generated files. The value should have the form:
+<programlisting>@<replaceable>rulename</replaceable></programlisting> where
+        <replaceable>rulename</replaceable> should be a name of a rule with
+        the following signature:
+<programlisting>rule tag ( name : type ? : property-set )</programlisting>
+        The rule will be called for each target with the default name computed
+        by Boost.Build, the type of the target, and property set. The rule
+        can either return a string that must be used as the name of the
+        target, or empty string, in which case the default name will be used.
+        </para>
+
+        <para>Most typical use of the <literal>tag</literal> feature is
+        to encode build properties, or library version in library target names.
+        You should take care to return non-empty string from the tag rule
+        only for types you care about &#x2014; otherwise, you might
+        end up modifying names of object files, generated header file and
+        other targets for which changing names does not make sense.</para>
+        </listitem>
+
+      </varlistentry>
+
+      <varlistentry><term><literal>debug-symbols</literal></term>
+        
+        <listitem>        
+          <para><emphasis role="bold">Allowed values:</emphasis> <literal>on</literal>, <literal>off</literal>.</para>
+
+          <para>The <literal>debug-symbols</literal> feature specifies if
+          produced object files, executables and libraries should include 
+          debug information.
+          Typically, the value of this feature is implicitly set by the
+          <literal>variant</literal> feature, but it can be explicitly
+          specified by the user. The most common usage is to build
+          release variant with debugging information.</para>
+        </listitem>
+      </varlistentry>
+      
+
+
+    </variablelist>
+  </section>
+
+    <section id="bbv2.reference.tools">
+      <title>Builtin tools</title>
+
+      <para>Boost.Build comes with support for a large number of C++ compilers,
+      and other tools. This section documents how to use those tools.</para>
+
+      <para>Before using any tool, you must declare your intention, and possibly
+      specify additional information about tool's configuration. This is done
+      with the <code>using</code> rule, for example:
 <programlisting>
-lib parser : parser.y ;
-exe app : app.cpp : &lt;implicit-dependency&gt;parser ;
+using gcc ;
 </programlisting>
+      additional parameters can be passed just like for other rules, for example:
+<programlisting>
+using gcc : 4.0 : g++-4.0 ;
+</programlisting>
+      The options that can be passed to each tool will be documented in the
+      subsequent sections.</para>
 
-      <para>
-        The above example tells the build system that when scanning
-        all sources of "app" for implicit-dependencies, it should consider
-        targets from "parser" as potential dependencies.
-      </para>
-    </section>
+      <section id="bbv2.reference.tools.compilers">
 
+        <title>C++ Compilers</title>
 
-  </section>
+        <para>This section lists all Boost.Build modules that support C++
+        compilers and documents how each one can be initialized.</para>
 
+        <section id="bbv2.reference.tools.compiler.gcc">
+
+          <title>GNU C++</title>
+          
+          <para>The <code>gcc</code> module supports the 
+          <ulink url="http://gcc.gnu.org">GNU C++ compiler</ulink> 
+          on Linux, a number of Unix-like system including MacOS X, SunOS and
+          BeOS, and on Windows (either <ulink url="http://www.cygwin.com">Cygwin</ulink>
+          or <ulink url="http://www.mingw.org">MinGW</ulink>).
+          </para>
+
+          <para>The <code>gcc</code> module is initialized using the following
+          syntax:</para>
+          <programlisting>
+using gcc : &toolset_ops; ;</programlisting>
+
+          &using_repeation;
+
+          <!-- FIXME: mention everywhere what is the semantic
+          of version is -->
+
+          <para>
+          If the version is not explicitly specified, it will be
+          automatically detected by running the compiler with the <code>-v</code>
+          option. If the command is not specified, the <command>g++</command>
+          binary will be searched in <envar>PATH</envar>.</para>
+
+          &option_list_intro;
+          <variablelist>
+
+            <xi:include href="fragments.xml#xpointer(id('common_options')/*)" 
+                        parse="xml"/> 
+
+            <xi:include href="fragments.xml#xpointer(id('root_option')/*)" 
+                        parse="xml"/> 
+
+            <varlistentry>
+              <term><literal>rc</literal></term>
+
+              <listitem>
+                <para>Specifies the resource compiler command
+                that will be used with the version of gcc that is being
+                configured. This setting makes sense only for Windows and only
+                if you plan to use resource files. By
+                default <command>windres</command> will be used.</para>
+              </listitem>
+            </varlistentry>
+
+            <varlistentry>
+              <term><literal>rc-type</literal></term>
+
+              <listitem>
+                <para>Specifies the type of resource compiler. The value can
+                be either <code>windres</code> for msvc resource compiler,
+                or <code>rc</code> for borland's resource compiler.</para>
+              </listitem>
+            </varlistentry>
+            
+          </variablelist>
+
+        </section>
+
+
+        <section id="bbv2.reference.tools.compiler.msvc">
+
+          <title>Microsoft Visual C++</title>
+
+          <para>The <code>msvc</code> module supports the  
+          <ulink url="http://msdn.microsoft.com/visualc/">Microsoft Visual
+          C++</ulink> command-line tools on Microsoft Windows. The supported
+          products and versions of command line tools are listed below:</para>
+          <itemizedlist>
+            <listitem><para>Visual Studio 2005&#x2014;8.0</para></listitem>
+            <listitem><para>Visual Studio .NET 2003&#x2014;7.1</para></listitem>
+            <listitem><para>Visual Studio .NET&#x2014;7.0</para></listitem>
+            <listitem><para>Visual Studio 6.0, Service Pack 5&#x2014;6.5</para></listitem>
+          </itemizedlist>
+
+          <para>The <code>msvc</code> module is initialized using the following
+          syntax:</para>
+          <programlisting>
+using msvc : &toolset_ops; ;
+          </programlisting>
+          &using_repeation;
+          <para>If the version is not explicitly specified, the most recent
+          version found in the registry will be used instead.  If the
+          special value <code>all</code> is passed as the version, all
+          versions found in the registry will be configured. If a version is
+          specified, but the command is not, the compiler binary will be
+          searched in standard installation paths for that version, followed
+          by <envar>PATH</envar>.
+          </para>
+
+          <para>The compiler command should be specified using forward slashes,
+          and quoted.</para>
+
+          &option_list_intro;
+          <variablelist>
+
+            <xi:include href="fragments.xml#xpointer(id('common_options')/*)" 
+                        parse="xml"/> 
+
+            <varlistentry>
+              <term><literal>setup</literal></term>
+
+              <listitem><para>The filename of the environment setup scripts
+              to run before invoking the compiler. If not specified, 
+              <command>vcvars32.bat</command> alongside the compiler binary
+              will be used.</para>
+              </listitem>
+            </varlistentry>
+
+            <varlistentry>
+              <term><literal>compiler</literal></term>
+
+              <listitem><para>The command that compiles C and C++ sources.
+              If not specified, <command>cl</command> will be used. The
+              command will be invoked after the setup script was
+              executed and adjusted the <envar>PATH</envar> variable.</para>
+              </listitem>
+            </varlistentry>
+
+            <varlistentry>
+              <term><literal>linker</literal></term>
+
+              <listitem><para>The command that links executables and dynamic
+              libraries.
+              If not specified, <command>link</command> will be used. The
+              command will be invoked after the setup script was
+              executed and adjusted the <envar>PATH</envar> variable.</para>
+              </listitem>
+            </varlistentry>
+
+            <varlistentry>
+              <term><literal>assembler</literal></term>
+
+              <listitem><para>The command that compiles assember files.
+              If not specified, <command>cl</command> will be used. The
+              command will be invoked after the setup script was
+              executed and adjusted the <envar>PATH</envar> variable.</para>
+              </listitem>
+            </varlistentry>
+
+            <varlistentry>
+              <term><literal>resource-compiler</literal></term>
+
+              <listitem><para>The command that compiles resource files.
+              If not specified, <command>rc</command> will be used. The
+              command will be invoked after the setup script was
+              executed and adjusted the <envar>PATH</envar> variable.</para>
+              </listitem>
+            </varlistentry>
+
+            <varlistentry>
+              <term><literal>idl-compiler</literal></term>
+
+              <listitem><para>The command that compiles Microsoft COM
+              interface definition files.
+              If not specified, <command>midl</command> will be used. The
+              command will be invoked after the setup script was
+              executed and adjusted the <envar>PATH</envar> variable.</para>
+              </listitem>
+            </varlistentry>
+
+            <varlistentry>
+              <term><literal>mc-compiler</literal></term>
+
+              <listitem><para>The command that compiles Microsoft message
+              catalog files.
+              If not specified, <command>mt</command> will be used. The
+              command will be invoked after the setup script was
+              executed and adjusted the <envar>PATH</envar> variable.</para>
+              </listitem>
+            </varlistentry>
+
+
+          </variablelist>
+                 
+        </section>
+
+        <section id="bbv2.reference.tools.compiler.intel">
+
+          <title>Intel C++</title>
+
+          <para>The <code>intel-linux</code> and <code>intel-win</code> modules
+          support the Intel C++ command-line compiler&#x2014;the <ulink url=
+          "http://www.intel.com/software/products/compilers/clin/index.htm">Linux</ulink>
+          and <ulink url=
+          "http://www.intel.com/cd/software/products/asmo-na/eng/compilers/284527.htm">
+          Windows</ulink> versions respectively.</para>
+
+          <para>The module is initialized using the following syntax:</para>
+          <programlisting>
+using intel-linux : &toolset_ops; ;</programlisting>
+          <para>or</para>
+          <programlisting>
+using intel-win : &toolset_ops; ;</programlisting>
+          <para>respectively.</para>
+
+          &using_repeation;
+
+          <para>
+          If compiler command is not specified, then Boost.Build will
+          look in <envar>PATH</envar> for an executable <command>icpc</command>
+          (on Linux), or <command>icc.exe</command> (on Windows).
+          </para>
+          
+          &option_list_intro;
+          <variablelist>
+
+            <xi:include href="fragments.xml#xpointer(id('common_options')/*)" 
+                        parse="xml"/> 
+
+          </variablelist>
+          
+          <para>The Linux version supports the following additional options:</para>
+          <variablelist>
+
+            <xi:include href="fragments.xml#xpointer(id('root_option')/*)" 
+                        parse="xml"/> 
+
+          </variablelist>
+
+          <!-- the compatibility option appears to be messed up -->
+                 
+        </section>
+
+        <section id="bbv2.reference.tools.compiler.acc">
+
+          <title>HP aC++ compiler</title>
+
+          <para>The <code>acc</code> module supports the
+<ulink url="http://h21007.www2.hp.com/dspp/tech/tech_TechSoftwareDetailPage_IDX/1,1703,1740,00.html">HP aC++ compiler</ulink>
+          for the HP-UX operating system.</para>
+
+          <para>The module is initialized using the following
+          syntax:</para>
+          <programlisting>
+using acc ;</programlisting>
+
+          <para>There are no configuration options. The
+          compiler will always be invoked as <command>aCC</command> and should
+          be in <envar>PATH</envar>.</para>
+       
+        </section>
+
+        <section id="bbv2.reference.tools.compiler.borland">
+
+          <title>Borland C++ Compiler</title>
+
+          <para>The <code>borland</code> module supports the command line
+          C++ compiler included in
+          <ulink url="http://www.borland.com/us/products/cbuilder/index.html">C++ Builder 2006</ulink>
+          product and earlier version of it, running on Microsoft Windows.</para>
+
+          <para>The supported products are listed below. The version reported
+          by the command lines tools is also listed for reference.:</para>
+          <itemizedlist>
+            <listitem><para>C++ Builder 2006&#x2014;5.8.2</para></listitem>
+            <listitem><para>CBuilderX&#x2014;5.6.5, 5.6.4 (depending on release)</para></listitem>
+            <listitem><para>CBuilder6&#x2014;5.6.4</para></listitem>
+            <listitem><para>Free command line tools&#x2014;5.5.1</para></listitem>
+          </itemizedlist>
+
+          <para>The module is initialized using the following syntax:</para>
+          <programlisting>
+using borland : &toolset_ops; ;</programlisting>
+
+          &using_repeation;
+
+          <para>If the command is not specified, Boost.Build will search for
+          a binary named <command>bcc32</command> in <envar>PATH</envar>.</para>
+
+          &option_list_intro;
+          <variablelist>
+            <xi:include href="fragments.xml#xpointer(id('common_options')/*)" 
+                        parse="xml"/> 
+          </variablelist>
+       
+        </section>
+
+        <section id="bbv2.reference.tools.compiler.como">
+
+          <title>Comeau C/C++ Compiler</title>
+
+          <para>The <code>como-linux</code> and the <code>como-win</code>
+          modules supports the 
+          <ulink url="http://www.comeaucomputing.com/">Comeau C/C++ Compiler</ulink>
+          on Linux and Windows respectively.</para>
+
+          <para>The module is initialized using the following syntax:</para>
+          <programlisting>
+using como-linux : &toolset_ops; ;</programlisting>
+
+          &using_repeation;
+
+          <para>If the command is not specified, Boost.Build will search for
+          a binary named <command>como</command> in 
+          <envar>PATH</envar>.</para>
+
+          &option_list_intro;
+          <variablelist>
+            <xi:include href="fragments.xml#xpointer(id('common_options')/*)" 
+                        parse="xml"/> 
+          </variablelist>
+
+          <para>Before using the windows version of the compiler, 
+          you need to setup necessary environment variables per compiler's
+          documentation. In particular, the <envar>COMO_XXX_INCLUDE</envar>
+          variable should be set, where <envar>XXX</envar> corresponds to the
+          used backend C compiler.</para>
+       
+        </section>
+
+        <section id="bbv2.reference.tools.compiler.cw">
+
+          <title>Code Warrior</title>
+
+          <para>The <code>cw</code> module support CodeWarrior compiler,
+          originally produced by Metrowerks and presently developed
+          by Freescale. Boost.Build supports only the versions of the compiler
+          that target x86 processors. All such versions were released by
+          Metrowerks before aquisition and are not sold any longer. 
+          The last version known to work is 9.4</para>
+
+          <para>The module is initialized using the following syntax:</para>
+          <programlisting>
+using cw : &toolset_ops; ;</programlisting>
+
+          &using_repeation;
+
+          <para>If the command is not specified, Boost.Build will search for
+          a binary named <command>mwcc</command> in default installation
+          paths and in <envar>PATH</envar>.</para>
+
+          &option_list_intro;
+          <variablelist>
+
+            <xi:include href="fragments.xml#xpointer(id('common_options')/*)" 
+                        parse="xml"/> 
+
+            <xi:include href="fragments.xml#xpointer(id('root_option')/*)" 
+                        parse="xml"/> 
+
+            <varlistentry>
+              <term><literal>setup</literal></term>
+
+              <listitem><para>The command that sets up environment variables
+              prior to invoking the compiler. If not specified, 
+              <command>cwenv.bat</command> alongside the compiler binary
+              will be used.</para>
+              </listitem>
+            </varlistentry>
+
+
+            <varlistentry>
+              <term><literal>compiler</literal></term>
+
+              <listitem><para>The command that compiles C and C++ sources.
+              If not specified, <command>mwcc</command> will be used. The
+              command will be invoked after the setup script was
+              executed and adjusted the <envar>PATH</envar> variable.</para>
+              </listitem>
+            </varlistentry>
+
+            <varlistentry>
+              <term><literal>linker</literal></term>
+
+              <listitem><para>The command that links executables and dynamic
+              libraries.
+              If not specified, <command>mwld</command> will be used. The
+              command will be invoked after the setup script was
+              executed and adjusted the <envar>PATH</envar> variable.</para>
+              </listitem>
+            </varlistentry>
+                      
+          </variablelist>
+                 
+        </section>
+
+        <section id="bbv2.reference.tools.compiler.dmc">
+
+          <title>Digital Mars C/C++ Compiler</title>
+
+          <para>The <code>dmc</code> module supports the
+          <ulink url="http://www.digitalmars.com/">Digital Mars C++ compiler.</ulink>
+          </para>
+
+          <para>The module is initialized using the following syntax:</para>
+          <programlisting>
+using dmc : &toolset_ops; ;</programlisting>
+
+          &using_repeation;
+
+          <para>If the command is not specified, Boost.Build will search for
+          a binary named <command>como</command> in 
+          <envar>PATH</envar>.</para>
+
+          &option_list_intro;
+          <variablelist>
+            <xi:include href="fragments.xml#xpointer(id('common_options')/*)" 
+                        parse="xml"/> 
+          </variablelist>
+       
+        </section>
+
+        <section id="bbv2.reference.tools.compiler.hp_cxx">
+
+          <title>HP C++ Compiler for Tru64 Unix</title>
+
+          <para>The <code>hp_cxx</code> modules supports the
+          <ulink url="http://h30097.www3.hp.com/cplus/?jumpid=reg_R1002_USEN">
+            HP C++ Compiler</ulink> for Tru64 Unix.</para>
+
+          <para>The module is initialized using the following syntax:</para>
+          <programlisting>
+using hp_cxx : &toolset_ops; ;</programlisting>
+
+          &using_repeation;
+
+          <para>If the command is not specified, Boost.Build will search for
+          a binary named <command>hp_cxx</command> in <envar>PATH</envar>.</para>
+
+          &option_list_intro;
+          <variablelist>
+            <xi:include href="fragments.xml#xpointer(id('common_options')/*)" 
+                        parse="xml"/> 
+          </variablelist>
+       
+        </section>
+
+        <section id="bbv2.reference.tools.compiler.sun">
+
+          <title>Sun Studio</title>
+
+          <para>The <code>sun</code> module supports the
+          <ulink url="http://developers.sun.com/sunstudio/index.jsp">
+          Sun Studio</ulink> C++ compilers for the Solaris OS.</para>
+
+          <para>The module is initialized using the following syntax:</para>
+          <programlisting>
+using sun : &toolset_ops; ;</programlisting>
+
+          &using_repeation;
+
+          <para>If the command is not specified, Boost.Build will search for
+          a binary named <command>CC</command>
+          in <filename>/opt/SUNWspro/bin</filename> and in 
+          <envar>PATH</envar>.</para>
+
+          <para>When using this compiler on complex C++ code, such as the
+          <ulink url="http://boost.org">Boost C++ library</ulink>, it is
+          recommended to specify the following options when intializing the
+          <code>sun</code> module:
+          <screen>
+-library=stlport4 -features=tmplife -features=tmplrefstatic
+          </screen> See the <ulink url="http://blogs.sun.com/sga/entry/command_line_options">
+          Sun C++ Frontend Tales</ulink> for details.</para>
+
+          &option_list_intro;
+          <variablelist>
+            <xi:include href="fragments.xml#xpointer(id('common_options')/*)" 
+                        parse="xml"/> 
+          </variablelist>
+       
+        </section>
+
+        <section id="bbv2.reference.tools.compiler.vacpp">
+
+          <title>IBM Visual Age</title>
+          <para>The <code>vacpp</code> module supports the
+          <ulink url="http://www.ibm.com/software/ad/vacpp">IBM Visual
+          Age</ulink> C++ Compiler, for the AIX operating system. Versions
+          7.1 and 8.0 are known to work.</para>
+
+          <para>The module is initialized using the following
+          syntax:</para>
+          <programlisting>
+using vacpp ;</programlisting>
+
+          <para>The module does not accept any initialization options. The
+          compiler should be installed in the <filename>/usr/vacpp/bin</filename>
+          directory.</para>
+
+          <para>Later versions of Visual Age are known as XL C/C++. They
+          were not tested with the the <code>vacpp</code> module.</para>
+       
+        </section>
+
+
+      </section>
+  
+    </section>
+
   <section id="bbv2.reference.buildprocess">
     <title>Build process</title>
 

Modified: boost/trunk/tools/build/v2/doc/src/standalone.xml
===================================================================
--- boost/trunk/tools/build/v2/doc/src/standalone.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/doc/src/standalone.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,27 +1,30 @@
 <?xml version="1.0" encoding="UTF-8"?>
-<!DOCTYPE part PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
+<!DOCTYPE book PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
 
-<part xmlns:xi="http://www.w3.org/2001/XInclude"
-      id="bbv2" last-revision="$Date: 2006/04/12 22:35:19 $" status="draft">
+<book xmlns:xi="http://www.w3.org/2001/XInclude"
+      id="bbv2" last-revision="$Date: 2006/10/14 21:41:23 $">
 
-  <title>Boost.Build v2 User Manual</title>
+  <title>Boost.Build V2 User Manual</title>
 
   <!-- Chapters -->
   <xi:include href="howto.xml"/>
   <xi:include href="install.xml"/>
   <xi:include href="tutorial.xml"/>
   <xi:include href="advanced.xml"/>
+  <xi:include href="tasks.xml"/>
   <xi:include href="extending.xml"/>
   <xi:include href="reference.xml"/>
   <xi:include href="faq.xml"/>
 
   <!-- Appendicies -->
-  <xi:include href="architecture.xml"/>
+<!--  <xi:include href="architecture.xml"/> -->
   <appendix id="bbv2.jam">
-    <title>Boost.Jam documentation</title>
+    <title>Boost.Jam Documentation</title>
     <xi:include href="jam_docs.xml" parse="xml" 
 	xpointer="xpointer(id('jam.intro')|id('jam.intro')/following-sibling::*)"/>
   </appendix>    
 
-</part>
+  <xi:include href="v1_vs_v2.xml"/>
+
+</book>

Copied: boost/trunk/tools/build/v2/doc/src/tasks.xml (from rev 14034, boost/branches/upstream/current/tools/build/v2/doc/src/tasks.xml)

Modified: boost/trunk/tools/build/v2/doc/src/tutorial.xml
===================================================================
--- boost/trunk/tools/build/v2/doc/src/tutorial.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/doc/src/tutorial.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
 
 <?psgml nofill screen programlisting literallayout?>
 
-<chapter id="bbv2.tutorial" status="draft">
+<chapter id="bbv2.tutorial">
   <title>Tutorial</title>
 
 <!--   You can't launch into this stuff without describing how to configure -->
@@ -521,7 +521,7 @@
 exe e1 : e1.cpp foo ;
 exe e10 : e10.cpp foo ;</programlisting>
 
-        The <link linkend="bbv2.builtins.alias"><functionname>alias</functionname></link> 
+        The <link linkend="bbv2.tasks.alias"><functionname>alias</functionname></link> 
         rule is specifically used to rename a reference to a target and possibly
         change the properties.
         

Modified: boost/trunk/tools/build/v2/doc/src/userman.xml
===================================================================
--- boost/trunk/tools/build/v2/doc/src/userman.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/doc/src/userman.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,20 +3,22 @@
   "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
 
 <part xmlns:xi="http://www.w3.org/2001/XInclude"
-      id="bbv2" last-revision="$Date: 2006/04/12 22:35:19 $" status="draft">
+      id="bbv2" last-revision="$Date: 2006/10/14 21:41:23 $">
 
-  <title>Boost.Build v2 User Manual</title>
+  <title>Boost.Build V2 User Manual</title>
 
   <!-- Chapters -->
   <xi:include href="howto.xml"/>
   <xi:include href="install.xml"/>
   <xi:include href="tutorial.xml"/>
   <xi:include href="advanced.xml"/>
+  <xi:include href="tasks.xml"/>
   <xi:include href="extending.xml"/>
   <xi:include href="reference.xml"/>
   <xi:include href="faq.xml"/>
 
   <!-- Appendicies -->
-  <xi:include href="architecture.xml"/>
+<!--  <xi:include href="architecture.xml"/> -->
+  <xi:include href="v1_vs_v2.xml"/>
 
 </part>

Copied: boost/trunk/tools/build/v2/doc/src/v1_vs_v2.xml (from rev 14034, boost/branches/upstream/current/tools/build/v2/doc/src/v1_vs_v2.xml)

Modified: boost/trunk/tools/build/v2/doc/tools.html
===================================================================
--- boost/trunk/tools/build/v2/doc/tools.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/doc/tools.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- Copyright 2004 Aleksey Gurtovoy -->
+<!-- Copyright 2003, 2004 Vladimir Prus -->
+<!-- Distributed under the Boost Software License, Version 1.0. -->
+<!-- (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) -->
+
 <html>
   <head>
     <meta name="generator" content=

Modified: boost/trunk/tools/build/v2/example/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/example/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,6 @@
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
-boost-build ../kernel ;
\ No newline at end of file
+
+boost-build ../kernel ;

Modified: boost/trunk/tools/build/v2/example/customization/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/example/customization/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/customization/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 exe codegen : codegen.cpp class.verbatim usage.verbatim 
-    t1.verbatim ;
\ No newline at end of file
+    t1.verbatim ;

Modified: boost/trunk/tools/build/v2/example/customization/inline_file.py
===================================================================
--- boost/trunk/tools/build/v2/example/customization/inline_file.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/customization/inline_file.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 import sys
 from string import strip

Modified: boost/trunk/tools/build/v2/example/customization/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/example/customization/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/customization/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,6 @@
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
-import verbatim ;
\ No newline at end of file
+
+import verbatim ;

Modified: boost/trunk/tools/build/v2/example/customization/readme.txt
===================================================================
--- boost/trunk/tools/build/v2/example/customization/readme.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/customization/readme.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+Copyright 2003 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 This example show how to add a new target type and a new tool
 support to Boost.Build. Please refer to extender manual for
 complete description of this example.

Modified: boost/trunk/tools/build/v2/example/customization/verbatim.jam
===================================================================
--- boost/trunk/tools/build/v2/example/customization/verbatim.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/customization/verbatim.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,7 @@
-#  Copyright (C) Vladimir Prus 2003-2004. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
-#
 #  This file shows some of the primary customization mechanisms in Boost.Build V2
 #  and should serve as a basic for your own customization.
 #  Each part has a comment describing its purpose, and you can pick the parts
@@ -50,4 +48,4 @@
 actions inline-file 
 {
     "./inline_file.py" $(<) $(>)
-}
\ No newline at end of file
+}

Copied: boost/trunk/tools/build/v2/example/generate (from rev 14034, boost/branches/upstream/current/tools/build/v2/example/generate)

Copied: boost/trunk/tools/build/v2/example/generator (from rev 14034, boost/branches/upstream/current/tools/build/v2/example/generator)

Modified: boost/trunk/tools/build/v2/example/gettext/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/example/gettext/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/gettext/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2003, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 # Declare a main target.
 exe main : main.cpp ;
 

Modified: boost/trunk/tools/build/v2/example/gettext/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/example/gettext/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/gettext/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,6 @@
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
-using gettext ;
\ No newline at end of file
+
+using gettext ;

Modified: boost/trunk/tools/build/v2/example/gettext/readme.txt
===================================================================
--- boost/trunk/tools/build/v2/example/gettext/readme.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/gettext/readme.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+Copyright 2003 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 This example shows how it's possible to used GNU gettext utilities with
 Boost.Build.
 

Modified: boost/trunk/tools/build/v2/example/libraries/app/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/example/libraries/app/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/libraries/app/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
+# Copyright 2002, 2003, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 # Declare a executable file, which uses a library. Note that
 # includes that for library will be automatically used
 # when compiling 'app.cpp'
-exe app : app.cpp /library-example/foo//bar ;
\ No newline at end of file
+exe app : app.cpp /library-example/foo//bar ;

Modified: boost/trunk/tools/build/v2/example/libraries/util/foo/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/example/libraries/util/foo/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/libraries/util/foo/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
+# Copyright 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 project 
     : usage-requirements <include>include ;
 
-lib bar : bar.cpp ;
\ No newline at end of file
+lib bar : bar.cpp ;

Modified: boost/trunk/tools/build/v2/example/make/Jamroot
===================================================================
--- boost/trunk/tools/build/v2/example/make/Jamroot	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/make/Jamroot	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,7 +7,7 @@
 # Create 'main.cpp' from 'main.cpp.pro' using action
 # 'do-something' defined below. 
 #
-make main.cpp : main.cpp.pro : @do-something ;
+make main.cpp : main_cpp.pro : @do-something ;
 
 # In this example, we'll just copy a file.
 # Need to find out the name of a command to copy a file.

Deleted: boost/trunk/tools/build/v2/example/make/main.cpp.pro
===================================================================
--- boost/trunk/tools/build/v2/example/make/main.cpp.pro	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/make/main.cpp.pro	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +0,0 @@
-
-int main() { return 0; }

Copied: boost/trunk/tools/build/v2/example/make/main_cpp.pro (from rev 14034, boost/branches/upstream/current/tools/build/v2/example/make/main_cpp.pro)

Modified: boost/trunk/tools/build/v2/example/make/readme.txt
===================================================================
--- boost/trunk/tools/build/v2/example/make/readme.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/make/readme.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+Copyright 2002, 2005 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 Example of using custom command to create one file from
 another, using the builtin 'make' rule.

Copied: boost/trunk/tools/build/v2/example/pch (from rev 14034, boost/branches/upstream/current/tools/build/v2/example/pch)

Copied: boost/trunk/tools/build/v2/example/python_modules (from rev 14034, boost/branches/upstream/current/tools/build/v2/example/python_modules)

Modified: boost/trunk/tools/build/v2/example/qt/README.txt
===================================================================
--- boost/trunk/tools/build/v2/example/qt/README.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/qt/README.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+Copyright 2005 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 This directory contains Boost.Build examples for the Qt library
 (http://www.trolltech.com/products/qt/index.html).
 

Modified: boost/trunk/tools/build/v2/example/variant/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/example/variant/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/variant/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 # By default, build the project with two variants
 # we've defined in project-root.jam
 project

Modified: boost/trunk/tools/build/v2/example/variant/libs/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/example/variant/libs/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/variant/libs/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,6 @@
+# Copyright 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
-lib l : l.cpp ;
\ No newline at end of file
+
+lib l : l.cpp ;

Modified: boost/trunk/tools/build/v2/example/variant/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/example/variant/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/variant/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 # Define a build variant which is just combination
 # of four properties. 
 variant crazy : <optimization>speed <inlining>off 
@@ -7,4 +11,4 @@
 # Define a built variant inherited from 'release'.
 # It defines one new property and get all properties
 # from parent variant.		
-variant super_release : release : <define>USE_ASM ;
\ No newline at end of file
+variant super_release : release : <define>USE_ASM ;

Modified: boost/trunk/tools/build/v2/example/variant/readme.txt
===================================================================
--- boost/trunk/tools/build/v2/example/variant/readme.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/variant/readme.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,11 @@
+Copyright 2004 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 This example shows how user can create his own build variants.
 Two variants are defined: "crazy", which is just random combination
 of properties, and "super-release", which is inherited from "release",
 and differs by a single define.
 
-See the project-root.jam for the definitions.
\ No newline at end of file
+See the project-root.jam for the definitions.

Modified: boost/trunk/tools/build/v2/example/versioned/jamfile.jam
===================================================================
--- boost/trunk/tools/build/v2/example/versioned/jamfile.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/versioned/jamfile.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,6 @@
-# (C) Copyright Rene Rivera, 2003.
-#
-# See accompanying license for terms and conditions of use.
-#
+# Copyright 2003 Rene Rivera 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #~ exe hello : hello.cpp : <version>1.0 ;
 lib hello : hello.cpp : <version>1.0 ;

Modified: boost/trunk/tools/build/v2/example/versioned/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/example/versioned/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/example/versioned/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,8 @@
-# (C) Copyright Rene Rivera, 2003.
-#
-# See accompanying license for terms and conditions of use.
-#
+# Copyright 2003 Rene Rivera 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 import gcc ;
 import toolset ;
 import modifiers ;

Modified: boost/trunk/tools/build/v2/generators_prototype.py
===================================================================
--- boost/trunk/tools/build/v2/generators_prototype.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/generators_prototype.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,6 @@
-# Copyright David Abrahams 2003. Permission to copy, use,
-# modify, sell and distribute this software is granted provided this
-# copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as
-# to its suitability for any purpose.
+# Copyright 2003 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # Importing by a different name keeps PyChecker happy
 from __future__ import generators as generators_ 

Modified: boost/trunk/tools/build/v2/hacking.txt
===================================================================
--- boost/trunk/tools/build/v2/hacking.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/hacking.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+Copyright 2003, 2006 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
              ----------------------------------
              Boost.Build contributor guidelines
              ----------------------------------

Modified: boost/trunk/tools/build/v2/index.html
===================================================================
--- boost/trunk/tools/build/v2/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 
+<!-- Copyright 2004 Aleksey Gurtovoy -->
+<!-- Copyright 2004, 2005, 2006 Vladimir Prus -->
+<!-- Distributed under the Boost Software License, Version 1.0. -->
+<!-- (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) -->
+
 <html>
   <head>
     <meta name="generator" content=
@@ -36,9 +41,9 @@
         <b>Quick access</b>
         <ul>
         <li>Download: <a href=
-    "http://prdownloads.sourceforge.net/boost/boost-build-2.0-m10.zip">[zip]
+    "http://prdownloads.sourceforge.net/boost/boost-build-2.0-m11.zip">[zip]
           </a>, <a href=
-    "http://prdownloads.sourceforge.net/boost/boost-build-2.0-m10.tar.bz2">[tar.bz2]
+    "http://prdownloads.sourceforge.net/boost/boost-build-2.0-m11.tar.bz2">[tar.bz2]
           </a>
         <li>Nightly build: <a href="http://boost.org/boost-build2/boost-build.zip">[zip]</a>, 
           <a href="http://boost.org/boost-build2/boost-build.tar.bz2">[tar.bz2]</a>
@@ -129,9 +134,9 @@
     </a> section of the Boost getting started docs.</p>
 
     <p>Boost.Build releases are also available. There's <a href=
-    "http://prdownloads.sourceforge.net/boost/boost-build-2.0-m10.zip">zip
+    "http://prdownloads.sourceforge.net/boost/boost-build-2.0-m11.zip">zip
     archive</a>, and <a href=
-    "http://prdownloads.sourceforge.net/boost/boost-build-2.0-m10.tar.bz2">tar.bz2
+    "http://prdownloads.sourceforge.net/boost/boost-build-2.0-m11.tar.bz2">tar.bz2
     archive</a> of the current release. Older releases are available from the
     <a href=
     "http://sourceforge.net/project/showfiles.php?group_id=7586">SourceForce
@@ -158,7 +163,7 @@
 
     <p>Revised 
     <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan
-                                            -->Fed 14, 2006 
+                                            -->Jul 20, 2006 
     <!--webbot bot="Timestamp" endspan i-checksum="13972"
                                             -->
     </p>

Modified: boost/trunk/tools/build/v2/kernel/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/kernel/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/kernel/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,5 @@
-# Copyright David Abrahams 2003. Permission to copy, use,
-# modify, sell and distribute this software is granted provided this
-# copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as
-# to its suitability for any purpose.
-boost-build . ;
\ No newline at end of file
+# Copyright 2003 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
+boost-build . ;

Modified: boost/trunk/tools/build/v2/kernel/bootstrap.jam
===================================================================
--- boost/trunk/tools/build/v2/kernel/bootstrap.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/kernel/bootstrap.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,8 @@
-# (C) Copyright David Abrahams, 2001.
-# (C) Copyright Rene Rivera, 2003 2006.
-#
-# See accompanying license for terms and conditions of use.
-#
+# Copyright 2003 Dave Abrahams 
+# Copyright 2003, 2005, 2006 Rene Rivera 
+# Copyright 2003, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # First of all, check the jam version
 

Modified: boost/trunk/tools/build/v2/kernel/class.jam
===================================================================
--- boost/trunk/tools/build/v2/kernel/class.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/kernel/class.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,8 @@
-#  (C) Copyright David Abrahams 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2001, 2002, 2003 Dave Abrahams 
+# Copyright 2002, 2005 Rene Rivera 
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # Polymorphic class system built on top of core Jam facilities.
 #
@@ -427,4 +428,4 @@
     assert.true is-a $(c) : derived2 ;
     assert.true is-a $(d) : myclass ;
     assert.false is-a literal : myclass ;
-}
\ No newline at end of file
+}

Modified: boost/trunk/tools/build/v2/kernel/errors.jam
===================================================================
--- boost/trunk/tools/build/v2/kernel/errors.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/kernel/errors.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
-#  (C) Copyright David Abrahams 2001. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Dave Abrahams 
+# Copyright 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # Print a stack backtrace leading to this rule's caller. Each
 # argument represents a line of output to be printed after the first

Modified: boost/trunk/tools/build/v2/kernel/modules.jam
===================================================================
--- boost/trunk/tools/build/v2/kernel/modules.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/kernel/modules.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
-#  (C) Copyright David Abrahams 2001. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Dave Abrahams 
+# Copyright 2003, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # Essentially an include guard; ensures that no module is loaded multiple times
 .loaded ?= ;

Modified: boost/trunk/tools/build/v2/nightly.sh
===================================================================
--- boost/trunk/tools/build/v2/nightly.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/nightly.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,16 +1,29 @@
 #!/bin/bash
 
+# Copyright 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # This script create a nightly tarball of Boost.Build V2
 # and updates the web site.
 
 # Create the packages
 set -e
+trap "echo 'Nightly build failed'" ERR
+
+export QTDIR=/usr/share/qt3
+export LC_ALL=C
+export LC_MESSAGES=C
+export LANG=C
 cd /tmp
 rm -rf boost-build
+echo "Checking out sources"
 cvs -d :ext:vladimir_prus at boost.cvs.sourceforge.net:/cvsroot/boost co -P -d  boost-build boost/tools > /tmp/boost_build_checkout_log
 mv /tmp/boost_build_checkout_log boost-build/checkout-log
 cd boost-build/build/v2
-./roll.sh > ../roll-log
+echo "Building packages and uploading docs"
+./roll.sh > ../roll-log 2>&1
 cd ..
-scp boost-build.zip boost-build.tar.bz2 vladimir_prus at shell.sf.net:/home/groups/b/bo/boost/htdocs/boost-build2 > scp-log
-echo "Upload successfull"
+echo "Uploading packages"
+scp boost-build.zip boost-build.tar.bz2 vladimir_prus at shell.sourceforge.net:/home/groups/b/bo/boost/htdocs/boost-build2 > scp-log
+echo "Nightly build successful"

Modified: boost/trunk/tools/build/v2/notes/README.txt
===================================================================
--- boost/trunk/tools/build/v2/notes/README.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/notes/README.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+Copyright 2005 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 This directory contains various development notes. Some of them
 may eventually find the way into documentation, so are purely
 imlementation comments.

Modified: boost/trunk/tools/build/v2/notes/build_dir_option.txt
===================================================================
--- boost/trunk/tools/build/v2/notes/build_dir_option.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/notes/build_dir_option.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+Copyright 2005 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 Summary
 -------
 

Modified: boost/trunk/tools/build/v2/notes/relative_source_paths.txt
===================================================================
--- boost/trunk/tools/build/v2/notes/relative_source_paths.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/notes/relative_source_paths.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+Copyright 2005 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 Hi,
 recently, we had a couple of problems caused by using relative file paths, and 
 I'd like to discuss what to do.

Modified: boost/trunk/tools/build/v2/options/help.jam
===================================================================
--- boost/trunk/tools/build/v2/options/help.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/options/help.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,8 @@
-# (C) Copyright David Abrahams, 2003.
-# (C) Copyright Rene Rivera, 2003.
-#
-# See accompanying license for terms and conditions of use.
-#
+# Copyright 2003 Dave Abrahams 
+# Copyright 2003, 2006 Rene Rivera 
+# Copyright 2003, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # This module is the plug-in handler for the --help and --help-.*
 # command-line options
@@ -14,8 +14,9 @@
 import project ;
 import print ;
 import os ;
+import version ;
+import path ;
 
-
 # List of possible modules, but which really aren't.
 #
 .not-modules =
@@ -44,7 +45,7 @@
     local did-help = ;
     switch $(command)
     {
-        case --help-all :
+        case --help-internal :
         local path-to-modules = [ modules.peek : BOOST_BUILD_PATH ] ;
         path-to-modules ?= . ;
         local possible-modules = [ GLOB $(path-to-modules) : *\\.jam ] ;
@@ -79,12 +80,12 @@
         set-output-file $(values[1]) ;
         did-help = true ;
 
-        case --help-options :
+        case --help-doc-options :
         local doc-module-spec = [ split-symbol doc ] ;
         do-scan $(doc-module-spec[1]) : print-help-options ;
         did-help = true ;
 
-        case --help-usage :
+        case --help-options :
         print-help-usage ;
         did-help = true ;
 
@@ -113,10 +114,18 @@
         }
         else
         {
-            # First print documentation from the current Jamfile, if any.
-            local project-file =
-                [ project.find-jamfile . : no-error ]
-                [ project.find-jamfile . parent : no-error ] ;
+            version.print ;
+            ECHO ;
+            # First print documentation from the current Jamfile, if any.            
+            # FIXME: Generally, this duplication of project.jam logic is bad.
+            local names = [ modules.peek project : JAMROOT ]
+              [ modules.peek project : JAMFILE ] ;
+            local project-file = [ path.glob . : $(names) ] ;
+            if ! $(project-file)
+            {
+                project-file = [ path.glob-in-parents . : $(names) ] ;
+            }
+            
             for local p in $(project-file)
             {
                 do-scan $(p) : print-help-project $(p) ;

Modified: boost/trunk/tools/build/v2/release_procedure.txt
===================================================================
--- boost/trunk/tools/build/v2/release_procedure.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/release_procedure.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,31 +1,33 @@
+Copyright 2003, 2005, 2006 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
    Boost.Build V2 release procedure.
 
 [ Must be done from a Unix shell ]
 
-
-
 0. Look for all issues for current milestone in the tracker. Close the fixed one,
    if not already closed. Move to a later milestone, or fix all the unfixed
    ones.
 
    Make sure that "bjam --version" output is correct. Update version string if
    needed. Update bjam version and the version check is necessary.  
-   Check the download locations in "index_v2.html". Check that "last modified"
+   Check the download locations in "index.html". Check that "last modified"
    strings in docs are correct.
 
 1. Make sure you don't have any local modification, and tag the CVS tree with 
-   Milestone_X tag.
+   Milestone_X tag. Be sure to tag both Boost.Build and Boost.Jam sources.
   
 2. Run
 
-   cvs -d :ext:<your_user_name>@cvs.boost.sourceforge.net:/cvsroot/boost co -r
-   Milestone_X -P -d  boost-build boost/tools/build
+   cvs -d :ext:<your_user_name>@boost.cvs.sourceforge.net:/cvsroot/boost co -r
+   Milestone_X -P -d  boost-build boost/tools
 
    Note: it turns out that anonymous CVS access uses some backup server, which
    is not up-to-date.
 
-3. Go to "boost-build/v2" directory.
+3. Go to "boost-build/build/v2" directory.
 
 4. Run "./roll.sh". This will create "boost-build.zip" and
    "boost-build.tar.bz2" in parent directory, and also upload
@@ -33,18 +35,45 @@
 
 5. Unpack "boost-build.tar.bz2", and build jam.
 
-6. Go to "test" and copy "test-config.jam.in" to "test-config.jam". Run gcc
-   tests:
-      python test_all.py gcc
+6. Go to "test" and copy "test-config-example.jam" to "test-config.jam".
+   If you're not ghost, edit test-config.jam to specify all the right paths.
+   Run gcc tests:
 
+      python test_all.py gcc --extras
+
 7. Build all projects in examples-v2, using the bjam binary created at step 4.
    Note: "threading=multi" might be needed to build QT examples.
 
-8. Announce the release, etc.
+8. Make SF release:
 
-9. Update the "next milestone query" in the tracker.
+   - Go to
+     https://sourceforge.net/project/admin/editpackages.php?group_id=7586
+   
+   - Create new Boost.Build release. Name it 2.0-mXX
 
-10. Login to SF and update the current-release redirects in .htaccess.
+   - Upload the changelog. Be sure to turn the "Preserve my pre-formatted
+     text" checkbox.
 
+   - Rename previously built packages to boost-build-2.0-mXX.tar.bz2
+     and boost-build-2.0-mXX.zip. Upload them to the
+     /incoming directory on ftp://upload.sourceforge.net
 
+   - Add those file to release, edit file properties.
+
+   - In a separate browser, verify changelog is not damaged.
+
+   - In a separate browser, Download the files and verify checksums.
+
+   - In SF file release interface, send email notice.
+       
+9. Announce the release, etc.
+
+10. Login to SF and update the current-release redirects in 
+    /home/groups/b/bo/boost/htdocs/boost-build2/.htaccess.
+
+11. If any issues were found during release in this document or in 
+    test-config-example.jam, commit those changes. The release need
+    not be redone, but changes must be comitted.
+
+12. Set release date in changes.txt and commit.
    

Modified: boost/trunk/tools/build/v2/roll.sh
===================================================================
--- boost/trunk/tools/build/v2/roll.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/roll.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,11 @@
 #!/bin/bash
 
+# Copyright 2004 Aleksey Gurtovoy
+# Copyright 2006 Rene Rivera 
+# Copyright 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 set -e
 # Do some renames/rearrangments
 
@@ -10,8 +16,6 @@
 
 # This one is not fully finished
 rm -rf example/versioned
-# This one is too low-level and misleading
-rm -rf example/make
 
 # Remove unnecessary top-level files
 find . -maxdepth 1 -type f | egrep -v "roll.sh|bootstrap.jam|build-system.jam|boost_build_v2.html|boost.png|index.html|hacking.txt|site-config.jam|user-config.jam" | xargs rm -f
@@ -21,7 +25,7 @@
 
 # Build the documentation
 touch doc/project-root.jam
-export BOOST_ROOT=/home/ghost/Work/boost-rc
+export BOOST_BUILD_PATH=/home/ghost/Work/boost-rc/tools/build/v2
 cd doc
 /home/ghost/Work/boost-rc/tools/jam/src/bin.linuxx86/bjam --v2
 /home/ghost/Work/boost-rc/tools/jam/src/bin.linuxx86/bjam --v2 pdf
@@ -50,4 +54,4 @@
 # Upload docs to sourceforge
 perl -pi -e 's%<!-- sf logo -->%<a href="http://sourceforge.net"><img src="http://sourceforge.net/sflogo.php?group_id=7586&amp;type=1" width="88" height="31" border="0" alt="SourceForge.net Logo" align="right"/></a>%' index.html doc/*.html
 scp -r  doc example *.html hacking.txt vladimir_prus at shell.sourceforge.net:/home/groups/b/bo/boost/htdocs/boost-build2
-scp ../userman.pdf vladimir_prus at shell.sourceforge.net:/home/groups/b/bo/boost/htdocs/boost-build2/doc
\ No newline at end of file
+scp ../userman.pdf vladimir_prus at shell.sourceforge.net:/home/groups/b/bo/boost/htdocs/boost-build2/doc

Modified: boost/trunk/tools/build/v2/site-config.jam
===================================================================
--- boost/trunk/tools/build/v2/site-config.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/site-config.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,4 @@
-# No copyright, since this file is empty
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+

Deleted: boost/trunk/tools/build/v2/test/.cvsignore
===================================================================
--- boost/trunk/tools/build/v2/test/.cvsignore	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/.cvsignore	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +0,0 @@
-*.pyc test_results.txt failed_test test-config.jam
\ No newline at end of file

Modified: boost/trunk/tools/build/v2/test/BoostBuild.py
===================================================================
--- boost/trunk/tools/build/v2/test/BoostBuild.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/BoostBuild.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+# Copyright 2002-2005 Vladimir Prus.
+# Copyright 2002-2003 Dave Abrahams.
+# Copyright 2006 Rene Rivera.
+# Distributed under the Boost Software License, Version 1.0.
+#    (See accompanying file LICENSE_1_0.txt or copy at
+#         http://www.boost.org/LICENSE_1_0.txt)
 
 import TestCmd
 from tree import build_tree, trees_difference
@@ -3,5 +9,7 @@
 import copy
 import fnmatch
+import glob
 import os
+import re
 import shutil
 import string
@@ -10,7 +18,6 @@
 import time
 import tempfile
 import sys
-import re
 
 def get_toolset():
     toolset = None;
@@ -39,6 +46,17 @@
     if os.__dict__.has_key('uname') and os.uname()[0] == 'Darwin':
         suffixes['.dll'] = '.dylib'
 
+def re_remove(sequence,regex):
+    me = re.compile(regex)
+    result = filter( lambda x: me.match(x), sequence )
+    for r in result:
+        sequence.remove(r)
+
+def glob_remove(sequence,pattern):
+    result = fnmatch.filter(sequence,pattern)
+    for r in result:
+        sequence.remove(r)
+
 lib_prefix = 1
 if windows:
     lib_prefix = 0
@@ -92,73 +110,77 @@
 
         self.toolset = get_toolset()
         self.pass_toolset = pass_toolset
-        
+
         prepare_suffix_map(pass_toolset and self.toolset or 'gcc')
 
-        jam_build_dir = ""
-        if os.name == 'nt':
-            jam_build_dir = "bin.ntx86"
-        elif os.name == 'posix' and os.__dict__.has_key('uname'):
-            if os.uname()[0].lower().startswith('cygwin'):
-                jam_build_dir = "bin.cygwinx86"
-                if 'TMP' in os.environ and os.environ['TMP'].find('~') != -1:
-                    print 'Setting $TMP to /tmp to get around problem with short path names'
-                    os.environ['TMP'] = '/tmp'
-            elif os.uname()[0] == 'Linux':
-                cpu = os.uname()[4]
-                if re.match("i.86", cpu):
-                    jam_build_dir = "bin.linuxx86";
+        if not '--default-bjam' in sys.argv:
+            jam_build_dir = ""
+            if os.name == 'nt':
+                jam_build_dir = "bin.ntx86"
+            elif os.name == 'posix' and os.__dict__.has_key('uname'):
+                if os.uname()[0].lower().startswith('cygwin'):
+                    jam_build_dir = "bin.cygwinx86"
+                    if 'TMP' in os.environ and os.environ['TMP'].find('~') != -1:
+                        print 'Setting $TMP to /tmp to get around problem with short path names'
+                        os.environ['TMP'] = '/tmp'
+                elif os.uname()[0] == 'Linux':
+                    cpu = os.uname()[4]
+                    if re.match("i.86", cpu):
+                        jam_build_dir = "bin.linuxx86";
+                    else:
+                        jam_build_dir = "bin.linux" + os.uname()[4]
+                elif os.uname()[0] == 'SunOS':
+                    jam_build_dir = "bin.solaris"
+                elif os.uname()[0] == 'Darwin':
+                    jam_build_dir = "bin.macosxppc"
+                elif os.uname()[0] == "AIX":
+                    jam_build_dir = "bin.aix"
+                elif os.uname()[0] == "IRIX64":
+                    jam_build_dir = "bin.irix"
+                elif os.uname()[0] == "FreeBSD":
+                    jam_build_dir = "bin.freebsd"
+                elif os.uname()[0] == "OSF1":
+                    jam_build_dir = "bin.osf"
                 else:
-                    jam_build_dir = "bin.linux" + os.uname()[4]
-            elif os.uname()[0] == 'SunOS':
-                jam_build_dir = "bin.solaris"
-            elif os.uname()[0] == 'Darwin':
-                jam_build_dir = "bin.macosxppc"
-            elif os.uname()[0] == "AIX":
-                jam_build_dir = "bin.aix"
-            elif os.uname()[0] == "IRIX64":
-                jam_build_dir = "bin.irix"
-            elif os.uname()[0] == "FreeBSD":
-                jam_build_dir = "bin.freebsd"
-            elif os.uname()[0] == "OSF1":
-                jam_build_dir = "bin.osf"
+                    raise "Don't know directory where jam is build for this system: " + os.name + "/" + os.uname()[0]
             else:
-                raise "Don't know directory where jam is build for this system: " + os.name + "/" + os.uname()[0]
-        else:
-            raise "Don't know directory where jam is build for this system: " + os.name
+                raise "Don't know directory where jam is build for this system: " + os.name
 
-        if boost_build_path is None:
-            boost_build_path = self.original_workdir
-            
+            # Find there jam_src is located.
+            # try for the debug version if it's lying around
 
+            dirs = [os.path.join('../../../jam/src', jam_build_dir + '.debug'),
+                    os.path.join('../../../jam/src', jam_build_dir),
+                    os.path.join('../../jam_src', jam_build_dir + '.debug'),
+                    os.path.join('../../jam_src', jam_build_dir),
+                    os.path.join('../jam_src', jam_build_dir + '.debug'),
+                    os.path.join('../jam_src', jam_build_dir),
+                    ]
+
+            for d in dirs:
+                if os.path.exists(d):
+                    jam_build_dir = d
+                    break
+            else:
+                print "Cannot find built Boost.Jam"
+                os.exit(1)
+
         verbosity = ['-d0', '--quiet']
         if '--verbose' in sys.argv:
             keywords['verbose'] = 1
             verbosity = ['-d+2']
 
+        if boost_build_path is None:
+            boost_build_path = self.original_workdir
+
         program_list = []
-
-        # Find there jam_src is located.
-        # try for the debug version if it's lying around
-
-        dirs = [os.path.join('../../../jam/src', jam_build_dir + '.debug'),
-                os.path.join('../../../jam/src', jam_build_dir),
-                os.path.join('../../jam_src', jam_build_dir + '.debug'),
-                os.path.join('../../jam_src', jam_build_dir),
-                os.path.join('../jam_src', jam_build_dir + '.debug'),
-                os.path.join('../jam_src', jam_build_dir),
-                ]
-
-        for d in dirs:
-            if os.path.exists(d):
-                jam_build_dir = d
-                break
+        
+        if '--default-bjam' in sys.argv:
+            program_list.append(executable)
+            inpath_bjam = True
         else:
-            print "Cannot find built Boost.Jam"
-            os.exit(1)                                    
-        
-            
-        program_list.append(os.path.join(jam_build_dir, executable))
+            program_list.append(os.path.join(jam_build_dir, executable))
+            inpath_bjam = None
         program_list.append('-sBOOST_BUILD_PATH=' + boost_build_path)
         if verbosity:
             program_list += verbosity
@@ -170,6 +192,7 @@
             , program=program_list
             , match=match
             , workdir = workdir
+            , inpath = inpath_bjam
             , **keywords)
 
         os.chdir(self.workdir)
@@ -234,6 +257,13 @@
         self.wait_for_time_change()
         self.write(dst, self.read(src))
 
+    def copy_preserving_timestamp(self, src, dst):
+        src_name = self.native_file_name(src)
+        dst_name = self.native_file_name(dst)
+        stats = os.stat(src_name)        
+        self.write(dst, self.read(src))
+        os.utime(dst_name, (stats.st_atime, stats.st_mtime))
+        
     def touch(self, names):
         self.wait_for_time_change()
         for name in self.adjust_names(names):
@@ -248,10 +278,13 @@
         os.chdir(self.original_workdir)
         for name in names:
             n = self.native_file_name(name)
-            if os.path.isdir(n):
-                shutil.rmtree(n, ignore_errors=0)
-            else:
-                os.unlink(n)
+            n = glob.glob(n)
+            if n:
+                n = n[0]
+                if os.path.isdir(n):
+                    shutil.rmtree(n, ignore_errors=0)
+                else:
+                    os.unlink(n)
 
         # Create working dir root again, in case
         # we've removed it
@@ -351,10 +384,10 @@
         self.last_build_time = time.time()
 
     def read(self, name):
-        return open(self.native_file_name(name), "rb").read()
+        return open(glob.glob(self.native_file_name(name))[0], "rb").read()
 
     def read_and_strip(self, name):
-        lines = open(self.native_file_name(name), "rb").readlines()
+        lines = open(glob.glob(self.native_file_name(name))[0], "rb").readlines()
         result = string.join(map(string.rstrip, lines), "\n")
         if lines and lines[-1][-1] == '\n':
             return result + '\n'
@@ -392,7 +425,7 @@
     def expect_addition(self, names):        
         for name in self.adjust_names(names):
                 try:
-                        self.unexpected_difference.added_files.remove(name)
+                        glob_remove(self.unexpected_difference.added_files,name)
                 except:
                         print "File %s not added as expected" % (name,)
                         self.fail_test(1)
@@ -403,7 +436,7 @@
     def expect_removal(self, names):
         for name in self.adjust_names(names):
                 try:
-                        self.unexpected_difference.removed_files.remove(name)
+                        glob_remove(self.unexpected_difference.removed_files,name)
                 except:
                         print "File %s not removed as expected" % (name,)
                         self.fail_test(1)
@@ -436,7 +469,7 @@
 
             while filesets:
                 try:
-                    filesets[-1].remove(name)
+                    glob_remove(filesets[-1],name)
                     break
                 except ValueError:
                     filesets.pop()
@@ -489,22 +522,67 @@
            print 'FAILED'
            print '------- The following changes were unexpected ------- '
            self.unexpected_difference.pprint()
-           self.fail_test(1)       
+           self.fail_test(1)
 
-    def expect_content(self, name, content, exact=0):
+    def _expect_line(self, content, expected):
+        expected = expected.strip()
+        lines = content.splitlines()
+        found = 0
+        for line in lines:
+            line = line.strip()
+            if fnmatch.fnmatch(line, expected):
+                found = 1
+                break
+
+        if not found:
+            print "Did not found expected line in output:"
+            print expected
+            print "The output was:"
+            print content
+            self.fail_test(1)
+
+    def expect_output_line(self, expected):
+        self._expect_line(self.stdout(), expected)
+
+    def expect_content_line(self, name, expected):
+        content = self._read_file(name)
+        self._expect_line(content, expected)
+
+    def _read_file(self, name, exact=0):
         name = self.adjust_names(name)[0]
+        result = ""
         try:
             if exact:
-                actual = self.read(name)
+                result = self.read(name)
             else:
-                actual = string.replace(self.read_and_strip(name), "\\", "/")
+                result = string.replace(self.read_and_strip(name), "\\", "/")
         except IOError:
             print "Note: could not open file", name
             self.fail_test(1)
+        return result
+            
 
-        content = string.replace(content, "$toolset", self.toolset)
+    def expect_content(self, name, content, exact=0):
+        actual = self._read_file(name, exact)
+        content = string.replace(content, "$toolset", self.toolset+"*")
 
-        if actual != content:
+        matched = 0
+        if exact:
+            matched = fnmatch.fnmatch(actual,content)
+        else:
+            actual_ = map(lambda x: sorted(x.split()),actual.splitlines())
+            content_ = map(lambda x: sorted(x.split()),content.splitlines())
+            if len(actual_) == len(content_):
+                matched = map(
+                    lambda x,y: map(lambda n,p: fnmatch.fnmatch(n,p),x,y),
+                    actual_, content_ )
+                matched = reduce(
+                    lambda x,y: x and reduce(
+                        lambda a,b: a and b,
+                    y ),
+                    matched )
+
+        if not matched:
             print "Expected:\n"
             print content
             print "Got:\n"
@@ -589,7 +667,7 @@
                 names = [names]
         r = map(self.adjust_lib_name, names)
         r = map(self.adjust_suffix, r)
-        r = map(lambda x, t=self.toolset: string.replace(x, "$toolset", t), r)
+        r = map(lambda x, t=self.toolset: string.replace(x, "$toolset", t+"*"), r)
         return r
 
     def native_file_name(self, name):

Modified: boost/trunk/tools/build/v2/test/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2001 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 # establish a project root right here in the test directory, so that we can test
 # things independently of the boost jambase, etc.
 project-root ; 

Modified: boost/trunk/tools/build/v2/test/TestCmd.py
===================================================================
--- boost/trunk/tools/build/v2/test/TestCmd.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/TestCmd.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -41,6 +41,14 @@
 # AND THERE IS NO OBLIGATION WHATSOEVER TO PROVIDE MAINTENANCE,
 # SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
 
+# Copyright 2002-2003 Vladimir Prus.
+# Copyright 2002-2003 Dave Abrahams.
+# Copyright 2006 Rene Rivera.
+# Distributed under the Boost Software License, Version 1.0.
+#    (See accompanying file LICENSE_1_0.txt or copy at
+#         http://www.boost.org/LICENSE_1_0.txt)
+
+
 from string import join, split
 
 __author__ = "Steven Knight <knight at baldmt.com>"
@@ -198,10 +206,14 @@
                         workdir = None,
                         subdir = None,
                         verbose = 0,
-                        match = None):
+                        match = None,
+                        inpath = None):
         self._cwd = os.getcwd()
         self.description_set(description)
-        self.program_set(program)
+        if inpath:
+            self.program = program
+        else:
+            self.program_set(program)
         self.interpreter_set(interpreter)
         self.verbose_set(verbose)
         if not match is None:
@@ -392,7 +404,7 @@
             os.chdir(chdir)
         cmd = []
         if program and program[0]:
-            if not os.path.isabs(program[0]):
+            if program[0] != self.program[0] and not os.path.isabs(program[0]):
                 program[0] = os.path.join(self._cwd, program[0])
             cmd += program
         #    if interpreter:

Modified: boost/trunk/tools/build/v2/test/absolute_sources.py
===================================================================
--- boost/trunk/tools/build/v2/test/absolute_sources.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/absolute_sources.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test that sources with absolute names are handled OK.
 
 from BoostBuild import Tester

Modified: boost/trunk/tools/build/v2/test/alias.py
===================================================================
--- boost/trunk/tools/build/v2/test/alias.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/alias.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester, List
 t = Tester()
 

Modified: boost/trunk/tools/build/v2/test/alternatives.py
===================================================================
--- boost/trunk/tools/build/v2/test/alternatives.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/alternatives.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2003, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test main target alternatives.
 
 from BoostBuild import Tester

Modified: boost/trunk/tools/build/v2/test/assert-equal.jam
===================================================================
--- boost/trunk/tools/build/v2/test/assert-equal.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/assert-equal.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright 2001 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Evaluates [ rulename arg1... : arg2... : ... : argN... ] and compares the
 # result to expected-results. If there is a mismatch, prints an error message
 # and exits.

Modified: boost/trunk/tools/build/v2/test/bad_dirname.py
===================================================================
--- boost/trunk/tools/build/v2/test/bad_dirname.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/bad_dirname.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,9 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
-
 #  Regression test: when directory of project root contained regex metacharacters,
 #  Boost.Build failed to work. Bug reported by Michael Stevens
 

Modified: boost/trunk/tools/build/v2/test/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/test/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright 2002, 2003 Dave Abrahams 
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # Assume BOOST_BUILD_PATH point to the 'test' directory.
 # We need to leave 'test' there, so that 'test-config.jam'

Modified: boost/trunk/tools/build/v2/test/boostbook/a.hpp
===================================================================
--- boost/trunk/tools/build/v2/test/boostbook/a.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/boostbook/a.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+/* Copyright 2004, 2006 Vladimir Prus */
+/* Distributed under the Boost Software License, Version 1.0. */
+/* (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) */
 
+
 // Seems like Boostbook does like classes outside of namespaces,
 // and won't generate anything for them.
 namespace boost {
@@ -9,4 +13,4 @@
     /// A constructor
     A();    
 };
-}
\ No newline at end of file
+}

Modified: boost/trunk/tools/build/v2/test/boostbook/docs.xml
===================================================================
--- boost/trunk/tools/build/v2/test/boostbook/docs.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/boostbook/docs.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,11 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
      "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
+
+<!-- Copyright 2004 Vladimir Prus -->
+<!-- Distributed under the Boost Software License, Version 1.0. -->
+<!-- (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) -->
+
 <library 
     name="library"
     dirname="librarys" id="library" 

Modified: boost/trunk/tools/build/v2/test/boostbook.py
===================================================================
--- boost/trunk/tools/build/v2/test/boostbook.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/boostbook.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2004. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2004, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 from BoostBuild import Tester, List
 
@@ -12,11 +11,11 @@
 
 t.set_tree("boostbook")
 # For some reason, the messages are sent to stderr.
-t.run_build_system(stderr="""Writing A.html for refentry(A)
+t.run_build_system(stderr="""Writing boost/A.html for refentry(boost.A)
 Writing library/reference.html for section(library.reference)
 Writing index.html for chapter(library)
 Writing HTML.manifest
 """)
-t.expect_addition(["html/A.html", "html/index.html"])
+t.expect_addition(["html/boost/A.html", "html/index.html"])
 
 t.cleanup()

Modified: boost/trunk/tools/build/v2/test/build_dir.py
===================================================================
--- boost/trunk/tools/build/v2/test/build_dir.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/build_dir.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test that we can change build directory using 
 # the 'build-dir' project attribute.
 

Modified: boost/trunk/tools/build/v2/test/build_no.py
===================================================================
--- boost/trunk/tools/build/v2/test/build_no.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/build_no.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -28,8 +28,6 @@
 t.run_build_system()
 t.expect_nothing_more()
 
-t.fail_test(string.find(t.stdout(), "Skipping build of ./hello -- <build>no in properties.") == -1)
-
 t.run_build_system("release")
 t.expect_addition("bin/$toolset/release/hello.exe")
 

Modified: boost/trunk/tools/build/v2/test/c_file.py
===================================================================
--- boost/trunk/tools/build/v2/test/c_file.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/c_file.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Test that C files are compiled by C compiler
 from BoostBuild import Tester, List

Modified: boost/trunk/tools/build/v2/test/chain.py
===================================================================
--- boost/trunk/tools/build/v2/test/chain.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/chain.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # This tests that 
 # 1) the 'make' correctly assigns types to produced targets
 # 2) than if 'make' create targets of type CPP, they are

Modified: boost/trunk/tools/build/v2/test/check-arguments.jam
===================================================================
--- boost/trunk/tools/build/v2/test/check-arguments.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/check-arguments.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,6 @@
-# (C) Copyright David Abrahams 2001. Permission to copy, use,
-# modify, sell and distribute this software is granted provided this
-# copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as
-# to its suitability for any purpose.
+# Copyright 2001 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #
 # Jam code for testing the named-argument patch.

Modified: boost/trunk/tools/build/v2/test/check-bindrule.jam
===================================================================
--- boost/trunk/tools/build/v2/test/check-bindrule.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/check-bindrule.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright 2001 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # This rule establishes a dependency, with no special build actions
 rule do-nothing ( target : source )
 {
@@ -22,4 +26,4 @@
     ECHO found: $(target) at $(path) ;
 }
 
-DEPENDS all : fake-target ;
\ No newline at end of file
+DEPENDS all : fake-target ;

Modified: boost/trunk/tools/build/v2/test/check-jam-patches.jam
===================================================================
--- boost/trunk/tools/build/v2/test/check-jam-patches.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/check-jam-patches.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright 2001, 2002 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Get the recursive Jam invocation code
 include recursive.jam ;
 include assert-equal.jam ;
@@ -286,4 +290,4 @@
         }
     }
     module1.f ;
-}
\ No newline at end of file
+}

Modified: boost/trunk/tools/build/v2/test/check-test-tools.jam
===================================================================
--- boost/trunk/tools/build/v2/test/check-test-tools.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/check-test-tools.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright 2001 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 include recursive.jam ;
 include assert-equal.jam ;
 

Modified: boost/trunk/tools/build/v2/test/composite.py
===================================================================
--- boost/trunk/tools/build/v2/test/composite.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/composite.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Test that composite properties are handled correctly.
 from BoostBuild import Tester, List

Modified: boost/trunk/tools/build/v2/test/conditionals.py
===================================================================
--- boost/trunk/tools/build/v2/test/conditionals.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/conditionals.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test conditional properties
 
 from BoostBuild import Tester, List

Modified: boost/trunk/tools/build/v2/test/conditionals2.py
===================================================================
--- boost/trunk/tools/build/v2/test/conditionals2.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/conditionals2.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Regression test: it was possible that due to evaluation of conditional
 #  requirements, two different values of non-free features were present in

Modified: boost/trunk/tools/build/v2/test/conditionals3.py
===================================================================
--- boost/trunk/tools/build/v2/test/conditionals3.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/conditionals3.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Test that conditional properties work, even if property is free, and
 #  value includes colon.

Modified: boost/trunk/tools/build/v2/test/core_d12.py
===================================================================
--- boost/trunk/tools/build/v2/test/core_d12.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/core_d12.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # This tests correct handling of "-d1" and "-d2" options.
 
 import BoostBuild

Modified: boost/trunk/tools/build/v2/test/core_delete_module.py
===================================================================
--- boost/trunk/tools/build/v2/test/core_delete_module.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/core_delete_module.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # This tests the facilities for deleting modules.
 
 import BoostBuild

Modified: boost/trunk/tools/build/v2/test/core_dependencies.py
===================================================================
--- boost/trunk/tools/build/v2/test/core_dependencies.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/core_dependencies.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # This tests correct handling of dependencies, specifically, on
 # generated sources, and from generated sources.
 

Modified: boost/trunk/tools/build/v2/test/core_import_module.py
===================================================================
--- boost/trunk/tools/build/v2/test/core_import_module.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/core_import_module.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 from BoostBuild import Tester, List
 

Modified: boost/trunk/tools/build/v2/test/core_modifiers.py
===================================================================
--- boost/trunk/tools/build/v2/test/core_modifiers.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/core_modifiers.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # This tests the "existing" and "updated" modifiers on actions.
 
 import BoostBuild

Modified: boost/trunk/tools/build/v2/test/core_typecheck.py
===================================================================
--- boost/trunk/tools/build/v2/test/core_typecheck.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/core_typecheck.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # This tests the typechecking facilities.
 
 import BoostBuild

Modified: boost/trunk/tools/build/v2/test/core_varnames.py
===================================================================
--- boost/trunk/tools/build/v2/test/core_varnames.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/core_varnames.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # This tests the core rule for enumerating the variable names in a module
 
 import BoostBuild

Modified: boost/trunk/tools/build/v2/test/custom_generator.py
===================================================================
--- boost/trunk/tools/build/v2/test/custom_generator.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/custom_generator.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003, 2004, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 
 from BoostBuild import Tester, List

Modified: boost/trunk/tools/build/v2/test/default_build.py
===================================================================
--- boost/trunk/tools/build/v2/test/default_build.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/default_build.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test that default build clause actually has any effect.
 
 from BoostBuild import Tester, List

Modified: boost/trunk/tools/build/v2/test/default_features.py
===================================================================
--- boost/trunk/tools/build/v2/test/default_features.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/default_features.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Test that features with default values are always present 
 #  in build properties of any target.

Modified: boost/trunk/tools/build/v2/test/dependency-test/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/dependency-test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/dependency-test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2002, 2003, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 project test 
     : requirements <include>src1 
     ;

Modified: boost/trunk/tools/build/v2/test/dependency-test/foo.jam
===================================================================
--- boost/trunk/tools/build/v2/test/dependency-test/foo.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/dependency-test/foo.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 import type ;
 import generators ;
 import os ;

Modified: boost/trunk/tools/build/v2/test/dependency-test/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/test/dependency-test/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/dependency-test/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 import gcc ;
 import foo ;

Modified: boost/trunk/tools/build/v2/test/dependency-test/src1/z.h
===================================================================
--- boost/trunk/tools/build/v2/test/dependency-test/src1/z.h	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/dependency-test/src1/z.h	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,5 @@
+/* Copyright 2003, 2004, 2006 Vladimir Prus */
+/* Distributed under the Boost Software License, Version 1.0. */
+/* (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) */
+
 extern int dummy_variabled_need_to_suppress_empty_file_warning_on_hp_cxx_compiler;

Modified: boost/trunk/tools/build/v2/test/direct-request-test/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/direct-request-test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/direct-request-test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 # This will link correctly only if symbol MACROS is defined when compiling
 # b.cpp. However, this is only possible if that symbol is requested
 # on command line and b.cpp is compiled with directly requested
@@ -6,4 +10,4 @@
 
 exe a : a.cpp b ;
 
-lib b : b.cpp ;
\ No newline at end of file
+lib b : b.cpp ;

Modified: boost/trunk/tools/build/v2/test/direct-request-test/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/test/direct-request-test/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/direct-request-test/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,6 @@
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 import gcc ;

Modified: boost/trunk/tools/build/v2/test/dll_path.py
===================================================================
--- boost/trunk/tools/build/v2/test/dll_path.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/dll_path.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -119,10 +119,9 @@
 
 es1 = t.adjust_names(["a/bin/$toolset/debug"])[0]
 es2 = t.adjust_names(["b/bin/$toolset/debug"])[0]
-content = t.read("bin/$toolset/debug/mp.pathlist")
 
-t.fail_test(find(content, es1) == -1)
-t.fail_test(find(content, es2) == -1)
+t.expect_content_line("bin/$toolset/debug/mp.pathlist", "*" + es1);
+t.expect_content_line("bin/$toolset/debug/mp.pathlist", "*" + es2);
 
 t.cleanup()
 

Modified: boost/trunk/tools/build/v2/test/generators-test/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/generators-test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/generators-test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2002, 2003, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 project 
     # This is needed to supress gcc warning on flex output, which otherwise
     # results in test failure

Modified: boost/trunk/tools/build/v2/test/generators-test/extra.jam
===================================================================
--- boost/trunk/tools/build/v2/test/generators-test/extra.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/generators-test/extra.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2002, 2003, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 import type ;
 import generators ;
 import "class" : new ;

Modified: boost/trunk/tools/build/v2/test/generators-test/lex.jam
===================================================================
--- boost/trunk/tools/build/v2/test/generators-test/lex.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/generators-test/lex.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,6 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2002, 2003, 2004, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 import type ;
 import generators ;
@@ -24,4 +23,4 @@
 
 actions lex 
 {
-}
\ No newline at end of file
+}

Modified: boost/trunk/tools/build/v2/test/generators-test/lib/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/generators-test/lib/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/generators-test/lib/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,9 @@
+# Copyright 2002 Dave Abrahams 
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 static-lib auxilliary : c.cpp ;
 
-lib auxilliary2 : c.cpp ;
\ No newline at end of file
+lib auxilliary2 : c.cpp ;

Modified: boost/trunk/tools/build/v2/test/generators-test/nm.jam
===================================================================
--- boost/trunk/tools/build/v2/test/generators-test/nm.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/generators-test/nm.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright 2002, 2003 Dave Abrahams 
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 import modules ;
 
 rule target-source ( targets * : sources * : properties * )

Modified: boost/trunk/tools/build/v2/test/generators-test/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/test/generators-test/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/generators-test/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2002, 2003, 2004, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 import "class" : new ;
 
 import lex ;

Modified: boost/trunk/tools/build/v2/test/generators-test/qt.jam
===================================================================
--- boost/trunk/tools/build/v2/test/generators-test/qt.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/generators-test/qt.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright 2002 Dave Abrahams 
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 import modules ;
 
 if [ modules.peek : NT ]

Modified: boost/trunk/tools/build/v2/test/generators_test.py
===================================================================
--- boost/trunk/tools/build/v2/test/generators_test.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/generators_test.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester, List
 import os
 

Deleted: boost/trunk/tools/build/v2/test/glob.py
===================================================================
--- boost/trunk/tools/build/v2/test/glob.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/glob.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,119 +0,0 @@
-#!/usr/bin/python
-
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
-
-#  Test the 'glob' rule in Jamfile context.
-from BoostBuild import Tester, List
-import os
-import string
-
-# Create a temporary working directory
-t = Tester()
-
-t.write("project-root.jam", """ 
-""")
-
-t.write("Jamfile", """ 
-""")
-
-t.write("d1/a.cpp", """ 
-int main() { return 0; }
-
-""")
-
-t.write("d1/Jamfile", """ 
-exe a : [ glob *.cpp ] ../d2/d//l ; 
-""")
-
-t.write("d2/d/l.cpp", """ 
-#if defined(_WIN32)
-__declspec(dllexport)
-void force_import_lib_creation() {}
-#endif
-""")
-
-t.write("d2/d/Jamfile", """ 
-lib l : [ glob *.cpp ] ; 
-""")
-
-t.write("d3/d/Jamfile", """
-exe a : [ glob ../*.cpp ] ;
-""")
-t.write("d3/a.cpp", """
-int main()
-{
-    return 0;
-}
-""")
-
-t.run_build_system(subdir="d1")
-t.expect_addition("d1/bin/$toolset/debug/a.exe")
-
-t.run_build_system(subdir="d3/d")
-t.expect_addition("d3/d/bin/$toolset/debug/a.exe")
-
-t.rm("d2/d/bin")
-t.run_build_system(subdir="d2/d")
-t.expect_addition("d2/d/bin/$toolset/debug/l.dll")
-
-# Test that when 'source-location' is explicitly-specified
-# glob works relatively to source location
-t.rm("d1")
-
-t.write("d1/src/a.cpp", """ 
-int main() { return 0; }
-
-""")
-
-t.write("d1/Jamfile", """
-project : source-location src ;
-exe a : [ glob *.cpp ] ../d2/d//l ; 
-""")
-
-t.run_build_system(subdir="d1")
-t.expect_addition("d1/bin/$toolset/debug/a.exe")
-
-# Test that wildcards can include directories
-t.rm("d1")
-
-t.write("d1/src/foo/a.cpp", """
-void bar();
-int main() { bar(); return 0; }
-
-""")
-
-t.write("d1/src/bar/b.cpp", """
-void bar() {}
-
-""")
-
-
-t.write("d1/Jamfile", """
-project : source-location src ;
-exe a : [ glob foo/*.cpp bar/*.cpp ] ../d2/d//l ; 
-""")
-
-t.run_build_system(subdir="d1")
-t.expect_addition("d1/bin/$toolset/debug/a.exe")
-
-# Test that 'glob' works with absolute names
-t.rm("d1/bin")
-
-# Note that to get current dir, we use bjam's PWD,
-# not Python's os.getcwd, because the former will
-# always return long path. The latter might return
-# short path, and that will confuse path.glob.
-t.write("d1/Jamfile", """
-project : source-location src ;
-local pwd = [ PWD ] ; # Always absolute
-exe a : [ glob $(pwd)/src/foo/*.cpp $(pwd)/src/bar/*.cpp ] ../d2/d//l ; 
-""")
-
-t.run_build_system(subdir="d1")
-t.expect_addition("d1/bin/$toolset/debug/a.exe")
-
-
-t.cleanup()

Modified: boost/trunk/tools/build/v2/test/indirect_conditional.py
===================================================================
--- boost/trunk/tools/build/v2/test/indirect_conditional.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/indirect_conditional.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,7 +17,7 @@
 {
     if <variant>debug in $(properties)
     {
-	    return <define>OK ;
+        return <define>OK ;
     }
 }
 

Modified: boost/trunk/tools/build/v2/test/inherit_toolset.py
===================================================================
--- boost/trunk/tools/build/v2/test/inherit_toolset.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/inherit_toolset.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 from BoostBuild import Tester, List
 from string import find

Modified: boost/trunk/tools/build/v2/test/inline.py
===================================================================
--- boost/trunk/tools/build/v2/test/inline.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/inline.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,20 +1,20 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 from BoostBuild import Tester, List
 
 t = Tester()
 
-t.write("project-root.jam", "")
-t.write("Jamfile", """ 
-alias everything : [ exe a : a.cpp ] ; 
+t.write("Jamroot", """
+project : requirements <link>static ;
+exe a : a.cpp [ lib helper : helper.cpp ] ; 
 """)
 
-t.write("a.cpp", """ 
+t.write("a.cpp", """
+extern void helper();
 int main()
 {
     return 0;
@@ -22,29 +22,49 @@
 
 """)
 
+t.write("helper.cpp", """
+void helper()
+{
+}
+""")
+
 t.run_build_system()
-t.expect_addition("bin/$toolset/debug/everything__a.exe")
-t.rm("bin/$toolset/debug/everything__a.exe")
+t.expect_addition("bin/$toolset/debug/link-static/a__helper.lib")
+t.rm("bin/$toolset/debug/link-static/a__helper.lib")
 
-t.run_build_system("everything__a")
-t.expect_addition("bin/$toolset/debug/everything__a.exe")
+t.run_build_system("a__helper")
+t.expect_addition("bin/$toolset/debug/link-static/a__helper.lib")
 
 t.rm("bin")
 
 # Now check that inline targets with the same name but
 # present in different places are not confused between
 # each other, and with top-level targets.
-t.write("Jamfile", """
-exe a : a.cpp ;
-alias everything : [ exe a : a.cpp ] ;
-alias everything2 : [ exe a : a.cpp ] ; 
+t.write("Jamroot", """
+project : requirements <link>static ;
+exe a : a.cpp [ lib helper : helper.cpp ] ;
+exe a2 : a.cpp [ lib helper : helper.cpp ] ; 
 """)
 
 t.run_build_system()
-t.expect_addition("bin/$toolset/debug/a.exe")
-t.expect_addition("bin/$toolset/debug/everything__a.exe")
-t.expect_addition("bin/$toolset/debug/everything2__a.exe")
+t.expect_addition("bin/$toolset/debug/link-static/a.exe")
+t.expect_addition("bin/$toolset/debug/link-static/a__helper.lib")
+t.expect_addition("bin/$toolset/debug/link-static/a2__helper.lib")
 
+# Check that the 'alias' target does not change name of
+# inline targets, and that inline targets are explicit.
+t.write("Jamroot", """
+project : requirements <link>static ;
+alias a : [ lib helper : helper.cpp ] ;
+explicit a ;
+""")
+t.rm("bin")
 
+t.run_build_system()
+t.expect_nothing_more()
+
+t.run_build_system("a")
+t.expect_addition("bin/$toolset/debug/link-static/helper.lib")
+
 t.cleanup()
 

Modified: boost/trunk/tools/build/v2/test/library_chain.py
===================================================================
--- boost/trunk/tools/build/v2/test/library_chain.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/library_chain.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Test that a chain of libraries work ok, not matter if we use static or
 #  shared linking.
@@ -115,6 +114,7 @@
 t.write("Jamroot", "")
 t.write("a/Jamfile", """
 lib a : a.cpp ;
+install dist : a ;
 """)
 t.write("a/a.cpp", """
 #if defined(_WIN32)
@@ -123,12 +123,12 @@
 void a() {}
 """)
 t.run_build_system(subdir="a")
-t.expect_addition("a/bin/$toolset/debug/a.dll")
+t.expect_addition("a/dist/a.dll")
 
 if (os.name == 'nt' or os.uname()[0].lower().startswith('cygwin')) and get_toolset() != 'gcc':
-    file = t.adjust_names(["a/bin/$toolset/debug/a.lib"])[0]
+    file = t.adjust_names(["a/dist/a.lib"])[0]
 else:
-    file = t.adjust_names(["a/bin/$toolset/debug/a.dll"])[0]
+    file = t.adjust_names(["a/dist/a.dll"])[0]
 
 t.write("b/Jamfile", """
 lib b : b.cpp ../%s ;

Modified: boost/trunk/tools/build/v2/test/library_order.py
===================================================================
--- boost/trunk/tools/build/v2/test/library_order.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/library_order.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2004. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 from BoostBuild import Tester, List
 import string

Modified: boost/trunk/tools/build/v2/test/library_property.py
===================================================================
--- boost/trunk/tools/build/v2/test/library_property.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/library_property.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2004. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Test that the <library> property has no effect on "obj" targets.
 #  Previously, it affected all targets, so

Modified: boost/trunk/tools/build/v2/test/loop.py
===================================================================
--- boost/trunk/tools/build/v2/test/loop.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/loop.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 from BoostBuild import Tester, List
 from string import find

Modified: boost/trunk/tools/build/v2/test/m1-01.py
===================================================================
--- boost/trunk/tools/build/v2/test/m1-01.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/m1-01.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,9 @@
 #!/usr/bin/python
+
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test the very basic 'make' functionality.
 
 from BoostBuild import Tester, List

Modified: boost/trunk/tools/build/v2/test/m1-02.py
===================================================================
--- boost/trunk/tools/build/v2/test/m1-02.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/m1-02.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Tests that 'make' accepts target from other directories and that
 # build request for those targets can be overriden.
 

Modified: boost/trunk/tools/build/v2/test/m1-03.py
===================================================================
--- boost/trunk/tools/build/v2/test/m1-03.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/m1-03.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,9 @@
 #!/usr/bin/python
+
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Tests that we can use objects from other projects
 # (i.e. with other project root)
 # Test also that we can refer to those target using project-id.

Modified: boost/trunk/tools/build/v2/test/make_rule.py
===================================================================
--- boost/trunk/tools/build/v2/test/make_rule.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/make_rule.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2003, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test the 'make' rule
 
 from BoostBuild import Tester

Modified: boost/trunk/tools/build/v2/test/module-actions/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/test/module-actions/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/module-actions/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,5 @@
+# Copyright 2003 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 boost-build . ;

Modified: boost/trunk/tools/build/v2/test/module-actions/bootstrap.jam
===================================================================
--- boost/trunk/tools/build/v2/test/module-actions/bootstrap.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/module-actions/bootstrap.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright 2003 Dave Abrahams 
+# Copyright 2006 Rene Rivera 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Demonstration that module variables have the right effect in actions
 
 # Set a variable which says how to dump a file to stdout
@@ -39,10 +44,7 @@
         ALWAYS $(target) ;
     }
     
-    actions act
-    {
-        echo A.act $(<):  $(X1)  $(X2)  $(X3)
-    }
+    actions act { echo A.act $(<): $(X1) $(X2) $(X3) }
     
     make t1 : : A.act ;
     make t2 : : A.act ;
@@ -53,20 +55,14 @@
 {
     X2 = X2-B ;
     
-    actions act
-    {
-        echo B.act $(<):  $(X1)  $(X2)  $(X3)
-    }
+    actions act { echo B.act $(<): $(X1) $(X2) $(X3) }
     
     make t1 : : B.act ;
     make t2 : : B.act ;
     make t3 : : B.act ;
 }
 
-actions act
-{
-    echo act $(<):  $(X1)  $(X2)  $(X3)
-}
+actions act { echo act $(<): $(X1) $(X2) $(X3) }
 
 make t1 : : act ;
 make t2 : : act ;

Modified: boost/trunk/tools/build/v2/test/module_actions.py
===================================================================
--- boost/trunk/tools/build/v2/test/module_actions.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/module_actions.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,11 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2006 Rene Rivera 
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester, List
 import os
 import re
@@ -11,15 +17,15 @@
 
 t.set_tree('module-actions')
 
-expected = r'''A.act t1:   X1-t1     
-B.act t1:   X1-t1   X2-B   
-act t1:   X1-t1   X2-global   X3-global 
-A.act t2:   X1-A   X2-t2   
-B.act t2:     X2-t2   
-act t2:   X1-global   X2-t2   X3-global 
-A.act t3:   X1-A     X3-t3 
-B.act t3:     X2-B   X3-t3 
-act t3:   X1-global   X2-global   X3-t3 
+expected = r'''A.act t1: X1-t1   
+B.act t1: X1-t1 X2-B  
+act t1: X1-t1 X2-global X3-global 
+A.act t2: X1-A X2-t2  
+B.act t2:  X2-t2  
+act t2: X1-global X2-t2 X3-global 
+A.act t3: X1-A  X3-t3 
+B.act t3:  X2-B X3-t3 
+act t3: X1-global X2-global X3-t3 
 '''
 
 # On Unixes, call to 'echo 1     2      3' produces '1 2 3' (note spacing)

Modified: boost/trunk/tools/build/v2/test/ndebug.py
===================================================================
--- boost/trunk/tools/build/v2/test/ndebug.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/ndebug.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Test that building with optimization brings NDEBUG define, and, more
 #  importantly, that dependency targets are built with NDEBUG as well,

Modified: boost/trunk/tools/build/v2/test/no_type.py
===================================================================
--- boost/trunk/tools/build/v2/test/no_type.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/no_type.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test that we cannot specify targets of unknown type as sources.
 # This is based on the fact that Unix 'ar' will happily consume
 # just about anything.

Modified: boost/trunk/tools/build/v2/test/notfile.py
===================================================================
--- boost/trunk/tools/build/v2/test/notfile.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/notfile.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,6 +10,7 @@
 from BoostBuild import Tester, List
 import string
 import os
+import fnmatch
 
 t = Tester()
 
@@ -48,7 +49,7 @@
 name = t.adjust_names(["bin/$toolset/debug/hello.exe"])[0]
 name = apply(os.path.join, string.split(name, "/"));
 c = "valgrind " + name
-t.fail_test(string.find(t.stdout(), c) == -1)
+t.expect_output_line(c)
 
 
 t.cleanup()

Modified: boost/trunk/tools/build/v2/test/ordered_properties.py
===================================================================
--- boost/trunk/tools/build/v2/test/ordered_properties.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/ordered_properties.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2004. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  This file is template for Boost.Build tests. It creates a simple
 #  project that builds one exe from one source, and checks that the exe

Modified: boost/trunk/tools/build/v2/test/path_features.py
===================================================================
--- boost/trunk/tools/build/v2/test/path_features.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/path_features.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester
 t = Tester()
 

Copied: boost/trunk/tools/build/v2/test/pch.py (from rev 14034, boost/branches/upstream/current/tools/build/v2/test/pch.py)

Modified: boost/trunk/tools/build/v2/test/prebuilt/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/prebuilt/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/prebuilt/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 project test
     : requirements <variant>release:<define>RELEASE
     ;

Modified: boost/trunk/tools/build/v2/test/prebuilt/ext/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/prebuilt/ext/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/prebuilt/ext/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,13 @@
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 project ext 
     : requirements <variant>release:<define>RELEASE
     ;
 
-lib a : a.cpp ;
\ No newline at end of file
+lib a : a.cpp ;
+
+install dist : a : <variant>release:<location>release
+                   <variant>debug:<location>debug ;

Modified: boost/trunk/tools/build/v2/test/prebuilt/ext/Jamfile2
===================================================================
--- boost/trunk/tools/build/v2/test/prebuilt/ext/Jamfile2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/prebuilt/ext/Jamfile2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -26,13 +26,13 @@
 project ext ;
 
 lib a : 
-    : <file>bin/$toolset/debug/$(prefix)a.$(dll-suffix) <variant>debug
+    : <file>debug/$(prefix)a.$(dll-suffix) <variant>debug
     :
     : <include>debug
     ;
     
 lib a :
-    : <file>bin/$toolset/release/$(prefix)a.$(dll-suffix) <variant>release
+    : <file>release/$(prefix)a.$(dll-suffix) <variant>release
     :
     : <include>release
     ;

Modified: boost/trunk/tools/build/v2/test/prebuilt/ext/Jamfile3
===================================================================
--- boost/trunk/tools/build/v2/test/prebuilt/ext/Jamfile3	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/prebuilt/ext/Jamfile3	2007-02-16 16:48:35 UTC (rev 14035)
@@ -33,13 +33,13 @@
 local pwd = [ PWD ] ;
 
 lib a : 
-    : <file>$(pwd)/ext/bin/$toolset/debug/$(prefix)a.$(dll-suffix) <variant>debug
+    : <file>$(pwd)/ext/debug/$(prefix)a.$(dll-suffix) <variant>debug
     :
     : <include>debug
     ;
     
 lib a :
-    : <file>$(pwd)/ext/bin/$toolset/release/$(prefix)a.$(dll-suffix) <variant>release
+    : <file>$(pwd)/ext/release/$(prefix)a.$(dll-suffix) <variant>release
     :
     : <include>release
     ;

Modified: boost/trunk/tools/build/v2/test/prebuilt/ext/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/test/prebuilt/ext/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/prebuilt/ext/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,5 @@
+# Copyright 2002, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+

Modified: boost/trunk/tools/build/v2/test/prebuilt/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/test/prebuilt/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/prebuilt/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -0,0 +1,4 @@
+# Copyright 2002, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+

Modified: boost/trunk/tools/build/v2/test/prebuilt.py
===================================================================
--- boost/trunk/tools/build/v2/test/prebuilt.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/prebuilt.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2002, 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test that we can use already built sources
 
 from BoostBuild import Tester

Modified: boost/trunk/tools/build/v2/test/print.py
===================================================================
--- boost/trunk/tools/build/v2/test/print.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/print.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Douglas Gregor 
+# Copyright 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester, List
 
 t = Tester()

Modified: boost/trunk/tools/build/v2/test/project-test1/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/project-test1/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test1/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright 2002 Dave Abrahams 
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 project /boost-build-test-project-1
     : requirements <threading>multi <include>/home/ghost/local/include ;
 

Modified: boost/trunk/tools/build/v2/test/project-test1/dir/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/project-test1/dir/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test1/dir/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 project /boost-build-test-project-1/dir 
     : source-location src 
     : default-build release
-    ;
\ No newline at end of file
+    ;

Modified: boost/trunk/tools/build/v2/test/project-test1/dir2/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/project-test1/dir2/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test1/dir2/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,9 @@
+# Copyright 2004 Rene Rivera 
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 project /cool-library 
     : requirements <include>/home/ghost/build/boost-cvs 
     ;

Modified: boost/trunk/tools/build/v2/test/project-test1/dir2/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/test/project-test1/dir2/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test1/dir2/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -0,0 +1,4 @@
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+

Modified: boost/trunk/tools/build/v2/test/project-test1/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/test/project-test1/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test1/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,6 @@
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
-import builtin ;
\ No newline at end of file
+
+import builtin ;

Modified: boost/trunk/tools/build/v2/test/project-test1/project-test1.jam
===================================================================
--- boost/trunk/tools/build/v2/test/project-test1/project-test1.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test1/project-test1.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+# Copyright 2002, 2003 Dave Abrahams 
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 import project ;
 import targets ;
 import assert ;

Modified: boost/trunk/tools/build/v2/test/project-test1/readme.txt
===================================================================
--- boost/trunk/tools/build/v2/test/project-test1/readme.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test1/readme.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,8 @@
+Copyright 2003 Dave Abrahams 
+Copyright 2002 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 This tests for basic project handling -- declaring subprojects, finding
-parent projects and project roots and for working project-ids.
\ No newline at end of file
+parent projects and project roots and for working project-ids.

Modified: boost/trunk/tools/build/v2/test/project-test1/standalone-project.jam
===================================================================
--- boost/trunk/tools/build/v2/test/project-test1/standalone-project.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test1/standalone-project.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,12 @@
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 import project ;
 
 # Convert ourself into a real project.
 project.initialize $(__name__) ;
 
 # Now we can identify ourselfs.
-project /teeest ;
\ No newline at end of file
+project /teeest ;

Modified: boost/trunk/tools/build/v2/test/project-test1.jam
===================================================================
--- boost/trunk/tools/build/v2/test/project-test1.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test1.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+# Copyright 2002, 2003 Dave Abrahams 
+# Copyright 2002 Rene Rivera 
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 import project ;
 import targets ;
 import assert ;

Modified: boost/trunk/tools/build/v2/test/project-test3/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/project-test3/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test3/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 use-project /lib2 : lib2 ;
 use-project /lib3 : lib3 ;
 
@@ -6,4 +10,4 @@
 make a.obj : a.cpp : yfc-compile ; 
 
 build-project lib2 ;
-build-project lib ;
\ No newline at end of file
+build-project lib ;

Modified: boost/trunk/tools/build/v2/test/project-test3/lib/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/project-test3/lib/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test3/lib/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 use-project /lib2 : ../lib2 ;
 
 make b.obj : b.cpp : yfc-compile ;
-make m.exe : b.obj /lib2//c.obj : yfc-link ;
\ No newline at end of file
+make m.exe : b.obj /lib2//c.obj : yfc-link ;

Modified: boost/trunk/tools/build/v2/test/project-test3/lib2/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/project-test3/lib2/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test3/lib2/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 project lib2 ;
 use-project /lib2/helper : helper ;
 

Modified: boost/trunk/tools/build/v2/test/project-test3/lib2/helper/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/project-test3/lib2/helper/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test3/lib2/helper/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 project lib2/helper ;
 
 make e.obj : e.cpp : yfc-compile ;

Modified: boost/trunk/tools/build/v2/test/project-test3/lib3/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/project-test3/lib3/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test3/lib3/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -11,10 +11,10 @@
     local r ;
     for local p in $(properties)
     {
-	    if $(p:G) != <action>
-	    {
-	        r += $(p) ;
-	    }
+        if $(p:G) != <action>
+        {
+            r += $(p) ;
+        }
     }
     return [ property.as-path
         [ property.remove incidental : $(r) ] ] ;

Modified: boost/trunk/tools/build/v2/test/project-test3/lib3/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/test/project-test3/lib3/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test3/lib3/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -0,0 +1,5 @@
+# Copyright 2002 Rene Rivera 
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+

Modified: boost/trunk/tools/build/v2/test/project-test3/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/test/project-test3/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test3/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright 2002-2005 Vladimir Prus.
+# Distributed under the Boost Software License, Version 1.0.
+#    (See accompanying file LICENSE_1_0.txt or copy at
+#         http://www.boost.org/LICENSE_1_0.txt)
 
 import gcc ;
 import property ;
@@ -7,10 +11,10 @@
     local r ;
     for local p in $(properties)
     {
-	if $(p:G) != <action>
-	{
-	    r += $(p) ;
-	}
+        if $(p:G) != <action>
+        {
+            r += $(p) ;
+        }
     }
     return [ property.as-path
         [ property.remove incidental : $(r) ] ] ;

Modified: boost/trunk/tools/build/v2/test/project-test3/readme.txt
===================================================================
--- boost/trunk/tools/build/v2/test/project-test3/readme.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test3/readme.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+Copyright 2002 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 This test checks that we have minimally working 'make' rule and that we can use target from
 different project with different project roots.

Modified: boost/trunk/tools/build/v2/test/project-test4/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/project-test4/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test4/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,9 @@
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 project test : requirements <include>everything <threading>single ;
 
 make a.exe : a.obj lib//b.obj/<optimization>speed : yfc-link ;

Modified: boost/trunk/tools/build/v2/test/project-test4/lib/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/project-test4/lib/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test4/lib/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,6 @@
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 make b.obj : b.cpp : yfc-compile ;

Modified: boost/trunk/tools/build/v2/test/project-test4/lib2/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/project-test4/lib2/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test4/lib2/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 project
     : requirements <rtti>off
     ;

Modified: boost/trunk/tools/build/v2/test/project-test4/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/test/project-test4/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test4/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2002, 2003, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 import gcc ;
 import property ;
 

Modified: boost/trunk/tools/build/v2/test/project-test4/readme.txt
===================================================================
--- boost/trunk/tools/build/v2/test/project-test4/readme.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project-test4/readme.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,6 @@
+Copyright 2002 Vladimir Prus 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
-This test checks for correct properties of generated and used targets.
\ No newline at end of file
+
+This test checks for correct properties of generated and used targets.

Modified: boost/trunk/tools/build/v2/test/project_dependencies.py
===================================================================
--- boost/trunk/tools/build/v2/test/project_dependencies.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project_dependencies.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test that we can specify a dependency property
 # in project requirements, and that it won't
 # cause every main target in the project to

Copied: boost/trunk/tools/build/v2/test/project_glob.py (from rev 14034, boost/branches/upstream/current/tools/build/v2/test/project_glob.py)

Modified: boost/trunk/tools/build/v2/test/project_root_constants.py
===================================================================
--- boost/trunk/tools/build/v2/test/project_root_constants.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project_root_constants.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003, 2004, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 from BoostBuild import Tester, List
 from string import find

Modified: boost/trunk/tools/build/v2/test/project_test1.py
===================================================================
--- boost/trunk/tools/build/v2/test/project_test1.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project_test1.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2002 Dave Abrahams 
+# Copyright 2002, 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester
 import os
 

Modified: boost/trunk/tools/build/v2/test/project_test3.py
===================================================================
--- boost/trunk/tools/build/v2/test/project_test3.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project_test3.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2002, 2003 Dave Abrahams 
+# Copyright 2002, 2003, 2004, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester, List
 import os
 from string import strip

Modified: boost/trunk/tools/build/v2/test/project_test4.py
===================================================================
--- boost/trunk/tools/build/v2/test/project_test4.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/project_test4.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester
 import os
 from string import strip, find

Modified: boost/trunk/tools/build/v2/test/property_expansion.py
===================================================================
--- boost/trunk/tools/build/v2/test/property_expansion.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/property_expansion.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 from BoostBuild import Tester, List
 

Modified: boost/trunk/tools/build/v2/test/railsys/libx/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/test/railsys/libx/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/railsys/libx/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,13 @@
+#  Copyright (c) 2002 Institute of Transport, 
+#             Railway Construction and Operation, 
+#             University of Hanover, Germany
+#  Copyright (c) 2006 Jürgen Hunold
+#
+#  Distributed under the Boost Software License, Version 1.0.
+#    (See accompanying file LICENSE_1_0.txt or copy at
+#          http://www.boost.org/LICENSE_1_0.txt)
 
-# Tell that QT should be used. QTDIR will give installation
-# prefix. 
-using qt ;
+# Tell that Qt3 should be used. QTDIR will give installation prefix.
+using qt3 ;
 
 

Modified: boost/trunk/tools/build/v2/test/railsys/libx/src/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/railsys/libx/src/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/railsys/libx/src/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,10 +2,11 @@
 #             Railway Construction and Operation, 
 #             University of Hanover, Germany
 #
-# Permission to copy, use, modify, sell and distribute this software is
-# granted provided this copyright notice appears in all copies. This
-# software is provided "as is" without express or implied warranty, and
-# with no claim as to its suitability for any purpose.
+#  Copyright (c) 2006 Jürgen Hunold
+#
+# Distributed under the Boost Software License, Version 1.0.
+#    (See accompanying file LICENSE_1_0.txt or copy at
+#          http://www.boost.org/LICENSE_1_0.txt)
 
 project libx 
     : requirements 

Modified: boost/trunk/tools/build/v2/test/railsys/program/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/railsys/program/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/railsys/program/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -6,15 +6,14 @@
 #  Copyright (c) 2002 Institute of Transport, 
 #             Railway Construction and Operation, 
 #             University of Hanover, Germany
+#  Copyright (c) 2006 Jürgen Hunold
 #
-# Permission to copy, use, modify, sell and distribute this software is
-# granted provided this copyright notice appears in all copies. This
-# software is provided "as is" without express or implied warranty, and
-# with no claim as to its suitability for any purpose.
+#  Distributed under the Boost Software License, Version 1.0.
+#    (See accompanying file LICENSE_1_0.txt or copy at
+#          http://www.boost.org/LICENSE_1_0.txt)
 #
 #  02/21/02! Jürgen Hunold
 #
-#  $Id: Jamfile,v 1.6 2004/10/30 08:31:48 vladimir_prus Exp $
 #
 # ================================================================
 
@@ -26,7 +25,7 @@
     : requirements 
         <include>$(BOOST_ROOT)
         <threading>multi
-        <library>/qt//qt    
+        <library>/qt3//qt    
         <hardcode-dll-paths>true
         <stdlib>stlport
         <use>/libx
@@ -37,10 +36,9 @@
         : 
         default-build release
         <threading>multi
-        <library>/qt//qt
+        <library>/qt3//qt
         <hardcode-dll-paths>true
         ;
 
-
 build-project main ;
 

Modified: boost/trunk/tools/build/v2/test/railsys/program/liba/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/railsys/program/liba/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/railsys/program/liba/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,14 +1,14 @@
 #  Copyright (c) 2003 Institute of Transport, 
 #             Railway Construction and Operation, 
 #             University of Hanover, Germany
+#  Copyright (c) 2006 Jürgen Hunold
 #
-# Permission to copy, use, modify, sell and distribute this software is
-# granted provided this copyright notice appears in all copies. This
-# software is provided "as is" without express or implied warranty, and
-# with no claim as to its suitability for any purpose.
+# Distributed under the Boost Software License, Version 1.0.
+#    (See accompanying file LICENSE_1_0.txt or copy at
+#          http://www.boost.org/LICENSE_1_0.txt)
 
 project liba ;
 
 lib liba : test ../include/test_a.h ;
 
-obj test : test_a.cpp : <optimization>off ;
\ No newline at end of file
+obj test : test_a.cpp : <optimization>off ;

Modified: boost/trunk/tools/build/v2/test/railsys/program/main/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/railsys/program/main/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/railsys/program/main/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,12 +1,12 @@
 #  Copyright (c) 2002 Institute of Transport, 
 #             Railway Construction and Operation, 
 #             University of Hanover, Germany
+#  Copyright (c) 2006 Jürgen Hunold
 #
-# Permission to copy, use, modify, sell and distribute this software is
-# granted provided this copyright notice appears in all copies. This
-# software is provided "as is" without express or implied warranty, and
-# with no claim as to its suitability for any purpose.
+#  Distributed under the Boost Software License, Version 1.0.
+#    (See accompanying file LICENSE_1_0.txt or copy at
+#          http://www.boost.org/LICENSE_1_0.txt)
 
 project main ;
 
-exe test_a : main.cpp ../liba//liba /libx ;
\ No newline at end of file
+exe test_a : main.cpp ../liba//liba /libx ;

Modified: boost/trunk/tools/build/v2/test/railsys/program/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/test/railsys/program/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/railsys/program/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,14 @@
+#  Copyright (c) 2002 Institute of Transport, 
+#             Railway Construction and Operation, 
+#             University of Hanover, Germany
+#  Copyright (c) 2006 Jürgen Hunold
+#
+#  Distributed under the Boost Software License, Version 1.0.
+#    (See accompanying file LICENSE_1_0.txt or copy at
+#          http://www.boost.org/LICENSE_1_0.txt)
 
-# Tell that QT should be used. QTDIR will give installation
-# prefix. 
-using qt ;
+# Tell that Qt3 should be used. QTDIR will give installation prefix. 
+using qt3 ;
 
 # Not that good, but sufficient for testing
 using stlport : : /path/to/stlport ;

Modified: boost/trunk/tools/build/v2/test/railsys.py
===================================================================
--- boost/trunk/tools/build/v2/test/railsys.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/railsys.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 from BoostBuild import Tester, List
 

Modified: boost/trunk/tools/build/v2/test/rebuilds.py
===================================================================
--- boost/trunk/tools/build/v2/test/rebuilds.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/rebuilds.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2005 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # This tests the typechecking facilities.
 
 import BoostBuild
@@ -15,7 +19,7 @@
 actions make
 {
     echo "******" making $(<) from $(>) "******"
-    echo made from $(>) >> $(<)
+    echo made from $(>) > $(<)
 }
 
 make aux1 : bar ;

Modified: boost/trunk/tools/build/v2/test/recursive.jam
===================================================================
--- boost/trunk/tools/build/v2/test/recursive.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/recursive.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,7 @@
-# (C) Copyright David Abrahams 2001. Permission to copy, use,
-# modify, sell and distribute this software is granted provided this
-# copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as
-# to its suitability for any purpose.
+# Copyright 2001, 2002 Dave Abrahams 
+# Copyright 2005 Rene Rivera 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 ##############################################################
 # Rules and actions that test Jam by invoking it recursively #

Modified: boost/trunk/tools/build/v2/test/regression.py
===================================================================
--- boost/trunk/tools/build/v2/test/regression.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/regression.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,9 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright (C) Vladimir Prus 2003.
+# Distributed under the Boost Software License, Version 1.0.
+#    (See accompanying file LICENSE_1_0.txt or copy at
+#         http://www.boost.org/LICENSE_1_0.txt)
 
 #  Test for the regression testing framework.
 from BoostBuild import Tester, List
@@ -74,7 +74,7 @@
 
 # Make sure args are handled.
 t.expect_content("bin/r.test/$toolset/debug/r.output",
-                 "foo\nbar\n\nEXIT STATUS: 0\n")
+                 "foo\nbar\n\nEXIT STATUS: 0\n",True)
 
 # Test that input file is handled as well.
 t.write("r.cpp", """

Modified: boost/trunk/tools/build/v2/test/relative_sources.py
===================================================================
--- boost/trunk/tools/build/v2/test/relative_sources.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/relative_sources.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,34 +1,19 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test that we can specify sources using relative names.
 
 from BoostBuild import Tester
 t = Tester()
 
-# Test that relative path to source, 'src', is preserved.
-t.write("Jamroot", "exe a : src/a.cpp ;")
+t.write("project-root.jam", "import gcc ;")
+t.write("Jamfile", "exe a : src/a.cpp ;")
 t.write("src/a.cpp", "int main() { return 0; }\n")
 
 t.run_build_system()
-t.expect_addition("bin/$toolset/debug/src/a.obj")
 
-
-# Test that the relative path to source is preserved
-# when using 'glob'.
-t.rm("bin")
-t.write("Jamroot", "exe a : [ glob src/*.cpp ] ;")
-t.run_build_system()
-t.expect_addition("bin/$toolset/debug/src/a.obj")
-
-
-# Test that relative path with ".." is *not* added to
-# target path.
-t.rm(".")
-t.write("Jamroot", "")
-t.write("a.cpp", "int main() { return 0; }\n")
-t.write("build/Jamfile", "exe a : ../a.cpp ; ")
-t.run_build_system(subdir="build")
-t.expect_addition("build/bin/$toolset/debug/a.obj")
-
-
 t.cleanup()

Copied: boost/trunk/tools/build/v2/test/remove_requirement.py (from rev 14034, boost/branches/upstream/current/tools/build/v2/test/remove_requirement.py)

Modified: boost/trunk/tools/build/v2/test/searched_lib.py
===================================================================
--- boost/trunk/tools/build/v2/test/searched_lib.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/searched_lib.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test usage of searched-libs: one which are found via -l
 # switch to the linker/compiler. 
 

Modified: boost/trunk/tools/build/v2/test/skipping.py
===================================================================
--- boost/trunk/tools/build/v2/test/skipping.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/skipping.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Test that V2 does not fail gracelessy when any target is skipped.
 from BoostBuild import Tester, List

Modified: boost/trunk/tools/build/v2/test/stage.py
===================================================================
--- boost/trunk/tools/build/v2/test/stage.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/stage.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test staging
 
 from BoostBuild import Tester

Modified: boost/trunk/tools/build/v2/test/standalone.py
===================================================================
--- boost/trunk/tools/build/v2/test/standalone.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/standalone.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,9 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
-
 from BoostBuild import Tester, List
 
 t = Tester()

Modified: boost/trunk/tools/build/v2/test/startup/boost-root/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/test/startup/boost-root/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/startup/boost-root/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,7 @@
+# Copyright 2002 Dave Abrahams 
+# Copyright 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Emulate v1 behavior; with the boost-build file in the boost root directory.
 boost-build build ;

Modified: boost/trunk/tools/build/v2/test/startup/boost-root/build/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/test/startup/boost-root/build/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/startup/boost-root/build/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,6 @@
+# Copyright 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # The presence of this file emulates the Boost 1.27.0 release
 include $(BOOST_ROOT)/tools/build/bootstrap.jam ;

Modified: boost/trunk/tools/build/v2/test/startup/boost-root/build/bootstrap.jam
===================================================================
--- boost/trunk/tools/build/v2/test/startup/boost-root/build/bootstrap.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/startup/boost-root/build/bootstrap.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 ECHO build system bootstrapped ;
 DEPENDS all : nothing ;
 NOTFILE nothing ;

Modified: boost/trunk/tools/build/v2/test/startup/bootstrap-env/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/test/startup/bootstrap-env/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/startup/bootstrap-env/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,5 @@
-boost-build ;
\ No newline at end of file
+# Copyright 2002 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
+boost-build ;

Modified: boost/trunk/tools/build/v2/test/startup/bootstrap-explicit/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/test/startup/bootstrap-explicit/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/startup/bootstrap-explicit/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,6 @@
-boost-build ../boost-root/build ;
\ No newline at end of file
+# Copyright 2002 Dave Abrahams 
+# Copyright 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
+boost-build ../boost-root/build ;

Modified: boost/trunk/tools/build/v2/test/startup/bootstrap-implicit/readme.txt
===================================================================
--- boost/trunk/tools/build/v2/test/startup/bootstrap-implicit/readme.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/startup/bootstrap-implicit/readme.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,5 @@
-This file is only here so that cvs update -P won't fail to create a directory
\ No newline at end of file
+Copyright 2002 Dave Abrahams 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
+This file is only here so that cvs update -P won't fail to create a directory

Modified: boost/trunk/tools/build/v2/test/startup/no-bootstrap1/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/test/startup/no-bootstrap1/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/startup/no-bootstrap1/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,6 @@
+# Copyright 2002 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Bootstrap file not found via implicit lookup in BOOST_BUILD_PATH
 boost-build ;

Modified: boost/trunk/tools/build/v2/test/startup/no-bootstrap1/subdir/readme.txt
===================================================================
--- boost/trunk/tools/build/v2/test/startup/no-bootstrap1/subdir/readme.txt	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/startup/no-bootstrap1/subdir/readme.txt	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,5 @@
-This file is only here so cvs update -P will create the directory.
\ No newline at end of file
+Copyright 2002 Dave Abrahams 
+Distributed under the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
+This file is only here so cvs update -P will create the directory.

Modified: boost/trunk/tools/build/v2/test/startup/no-bootstrap2/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/test/startup/no-bootstrap2/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/startup/no-bootstrap2/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,6 @@
+# Copyright 2002 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Bootstrap file not found via explicit lookup in .
-boost-build . ;
\ No newline at end of file
+boost-build . ;

Modified: boost/trunk/tools/build/v2/test/startup/no-bootstrap3/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/test/startup/no-bootstrap3/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/startup/no-bootstrap3/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,5 @@
-# Call to boost-build is intentionally missing
\ No newline at end of file
+# Copyright 2002 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
+# Call to boost-build is intentionally missing

Modified: boost/trunk/tools/build/v2/test/startup_v1.py
===================================================================
--- boost/trunk/tools/build/v2/test/startup_v1.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/startup_v1.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2002 Dave Abrahams 
+# Copyright 2003, 2004, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester
 import os
 import re

Modified: boost/trunk/tools/build/v2/test/startup_v2.py
===================================================================
--- boost/trunk/tools/build/v2/test/startup_v2.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/startup_v2.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2002 Dave Abrahams 
+# Copyright 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester
 import os
 import re

Modified: boost/trunk/tools/build/v2/test/suffix.py
===================================================================
--- boost/trunk/tools/build/v2/test/suffix.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/suffix.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 from BoostBuild import Tester, List
 

Modified: boost/trunk/tools/build/v2/test/symlink.py
===================================================================
--- boost/trunk/tools/build/v2/test/symlink.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/symlink.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test the 'symlink' rule
 
 from BoostBuild import Tester, List

Modified: boost/trunk/tools/build/v2/test/test-config-example.jam
===================================================================
--- boost/trunk/tools/build/v2/test/test-config-example.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/test-config-example.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,15 +1,19 @@
+# Copyright 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 # Skeleton for test configuration. If your local configuration 
 # interferes with testing, rename this files to 'test-system.jam'
 # and tweak it. When tests are run, only this file will be loaded,
 # while site-config.jam and user-config.jam will be ignored.
 
 using gcc ;
-using msvc : : "P:/Program Files/Microsoft Visual Studio/vc98" : : vcvars32-p.bat ;
 using borland ;
 
 using boostbook 
-     : /home/ghost/build/docbook/xsl
-     : /home/ghost/build/docbook/dtd
-    ; 
-using doxygen ;
\ No newline at end of file
+     : /home/ghost/Store/docbook/xsl
+     : /home/ghost/Store/docbook/dtd
+     : /home/ghost/Work/boost-rc/tools/boostbook
+     ; 
+using doxygen ;

Modified: boost/trunk/tools/build/v2/test/test.jam
===================================================================
--- boost/trunk/tools/build/v2/test/test.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/test.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,9 @@
+# Copyright 2001, 2002, 2003 Dave Abrahams 
+# Copyright 2002 Rene Rivera 
+# Copyright 2002, 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 import indirect ;
 import string ;
 import numbers ;

Modified: boost/trunk/tools/build/v2/test/test1.py
===================================================================
--- boost/trunk/tools/build/v2/test/test1.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/test1.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 import BoostBuild
 
 t = BoostBuild.Tester()

Modified: boost/trunk/tools/build/v2/test/test2/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/test2/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/test2/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 project-root ;
 
-exe foo : foo.cpp ;
\ No newline at end of file
+exe foo : foo.cpp ;

Modified: boost/trunk/tools/build/v2/test/test2.py
===================================================================
--- boost/trunk/tools/build/v2/test/test2.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/test2.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2002, 2003 Dave Abrahams 
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester, List
 from time import sleep
 

Modified: boost/trunk/tools/build/v2/test/test_all.py
===================================================================
--- boost/trunk/tools/build/v2/test/test_all.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/test_all.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,11 @@
 #!/usr/bin/python
+
+# Copyright 2002-2005 Dave Abrahams.
+# Copyright 2002-2006 Vladimir Prus.
+# Distributed under the Boost Software License, Version 1.0.
+#    (See accompanying file LICENSE_1_0.txt or copy at
+#         http://www.boost.org/LICENSE_1_0.txt)
+
 import os, sys, string
 from BoostBuild import get_toolset
 
@@ -112,7 +119,7 @@
           "suffix",
           "inherit_toolset",
           "skipping",
-          "glob",
+          "project_glob",
           "project_root_constants",
           "double_loading",
           "dll_path",
@@ -142,6 +149,7 @@
           "implicit_dependency",
           "example_libraries",
           "example_make",
+          "remove_requirement",
           ]
 
 if os.name == 'posix':
@@ -154,8 +162,9 @@
     if string.find(os.uname()[0], "CYGWIN") == -1:
         tests.append("library_order")
 
-if string.find(get_toolset(), 'gcc') == 0:
+if string.find(get_toolset(), 'gcc') == 0 or string.find(get_toolset(), 'msvc') == 0:
     tests.append("gcc_runtime")
+    tests.append("pch")
 
 if "--extras" in sys.argv:
     tests.append("boostbook")

Modified: boost/trunk/tools/build/v2/test/test_nt_line_length.jam
===================================================================
--- boost/trunk/tools/build/v2/test/test_nt_line_length.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/test_nt_line_length.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,6 @@
-# (C) Copyright David Abrahams 2001. Permission to copy, use,
-# modify, sell and distribute this software is granted provided this
-# copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as
-# to its suitability for any purpose.
+# Copyright 2001 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # Test that the patch which allows long command-lines in actions on NT is
 # working. For reasons of backward-compatibility, this patch requires that the

Modified: boost/trunk/tools/build/v2/test/testing-primitives/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/test/testing-primitives/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/testing-primitives/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,5 @@
+# Copyright 2002 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 boost-build . ;

Modified: boost/trunk/tools/build/v2/test/testing-primitives/bootstrap.jam
===================================================================
--- boost/trunk/tools/build/v2/test/testing-primitives/bootstrap.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/testing-primitives/bootstrap.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright 2002 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Proof-of-concept for bjam-based testing mechanism. This file should
 # work on NT, Cygwin, and Linux. No promises for other platforms.
 

Modified: boost/trunk/tools/build/v2/test/testing_primitives.py
===================================================================
--- boost/trunk/tools/build/v2/test/testing_primitives.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/testing_primitives.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2002 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester, List
 import os
 from string import strip

Modified: boost/trunk/tools/build/v2/test/tree.py
===================================================================
--- boost/trunk/tools/build/v2/test/tree.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/tree.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,7 @@
-# Copyright (C) 2001 Vladimir Prus. Permission to copy, use, modify, sell and
-# distribute this software is granted, provided this copyright notice appears
-# in all copies and modified versions are clearly marked as such. This software
-# is provided "as is" without express or implied warranty, and with no claim as
-# to is suitability for any purpose.
+# Copyright 2003 Dave Abrahams 
+# Copyright 2001, 2002 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # This file is based in part on the content of svn_tree.py.
 

Modified: boost/trunk/tools/build/v2/test/unit-tests.jam
===================================================================
--- boost/trunk/tools/build/v2/test/unit-tests.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/unit-tests.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,6 @@
-# (C) Copyright David Abrahams 2001. Permission to copy, use,
-# modify, sell and distribute this software is granted provided this
-# copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as
-# to its suitability for any purpose.
+# Copyright 2001 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # assert_equal a : b
 #
@@ -261,4 +259,4 @@
     $(gTOP)_TOKENS = .. .. ;
     assert_equal [ simplify-path-tokens .. .. d e : xxx ] : xxx ; 
     assert_equal [ simplify-path-tokens .. .. d e f g : xxx ] : f g ; 
-}
\ No newline at end of file
+}

Modified: boost/trunk/tools/build/v2/test/unit_test.py
===================================================================
--- boost/trunk/tools/build/v2/test/unit_test.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/unit_test.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Test the unit_test rule
 from BoostBuild import Tester, List

Modified: boost/trunk/tools/build/v2/test/unit_tests.py
===================================================================
--- boost/trunk/tools/build/v2/test/unit_tests.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/unit_tests.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester
 
 t = Tester(pass_toolset=0)

Modified: boost/trunk/tools/build/v2/test/unused/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/unused/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/unused/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,11 @@
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 exe a : a.cpp b c ;
 
 make-b-main-target ;
 
 # Expands to nothing, intentionally.
-alias c ;
\ No newline at end of file
+alias c ;

Modified: boost/trunk/tools/build/v2/test/unused/b.cpp
===================================================================
--- boost/trunk/tools/build/v2/test/unused/b.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/unused/b.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -0,0 +1,4 @@
+/* Copyright 2003 Vladimir Prus */
+/* Distributed under the Boost Software License, Version 1.0. */
+/* (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) */
+

Modified: boost/trunk/tools/build/v2/test/unused/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/test/unused/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/unused/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,8 @@
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
+
 import type ;
 import generators ;
 import print ;

Modified: boost/trunk/tools/build/v2/test/unused.py
===================================================================
--- boost/trunk/tools/build/v2/test/unused.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/unused.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,9 @@
 #!/usr/bin/python
 
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 # Test that unused sources are at least reported.
 
 from BoostBuild import Tester

Modified: boost/trunk/tools/build/v2/test/use_requirements.py
===================================================================
--- boost/trunk/tools/build/v2/test/use_requirements.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/use_requirements.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003, 2004, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester
 t = Tester()
 
@@ -320,4 +325,35 @@
 t.run_build_system("link=static")
 t.expect_addition("libs/bin/$toolset/debug/link-static/a_d.obj")
 
+
+# Test that indirect conditionals are respected in
+# usage requirements.
+t.rm(".")
+
+t.write("Jamroot", """
+rule has-foo ( properties * )
+{
+    return <define>HAS_FOO ;
+}
+
+exe a : a.cpp b ;
+lib b : b.cpp : <link>static : : <conditional>@has-foo ;
+""")
+t.write("a.cpp", """
+#ifdef HAS_FOO
+void foo();
+int main() { foo(); }
+#endif
+""")
+t.write("b.cpp", """
+void
+#if defined(_WIN32) && defined(SHARED_B)
+__declspec(dllexport)
+#endif
+foo() {}\n
+""")
+t.run_build_system()
+t.expect_addition("bin/$toolset/debug/a.exe")
+
+
 t.cleanup()

Modified: boost/trunk/tools/build/v2/test/v1-testing/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/v1-testing/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/v1-testing/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright 2002, 2003 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 import testing ;
 
 # A number of tests which should succeed
@@ -19,4 +23,4 @@
 
 # Make sure we still fail if a dependency of an expected-failure test
 # fails. 
-link-fail b.cpp : : fail-link-no-dependency ;
\ No newline at end of file
+link-fail b.cpp : : fail-link-no-dependency ;

Modified: boost/trunk/tools/build/v2/test/v1-testing/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/test/v1-testing/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/v1-testing/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,6 @@
+# Copyright 2002 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 TOOLS = gcc ;
 boost-build ../.. ;

Modified: boost/trunk/tools/build/v2/test/v1_testing/Jamfile
===================================================================
--- boost/trunk/tools/build/v2/test/v1_testing/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/v1_testing/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+# Copyright 2002, 2003 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 TOOLS = $(TOOLS[1]) ;
 project-root ;
 
@@ -16,4 +20,4 @@
   : # args
   : # input-files
   : <define>RUN
-  : run ;
\ No newline at end of file
+  : run ;

Modified: boost/trunk/tools/build/v2/test/v1_testing/boost-build.jam
===================================================================
--- boost/trunk/tools/build/v2/test/v1_testing/boost-build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/v1_testing/boost-build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,2 +1,6 @@
+# Copyright 2002 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 TOOLS = gcc ;
-boost-build ../.. ;
\ No newline at end of file
+boost-build ../.. ;

Modified: boost/trunk/tools/build/v2/test/v1_testing/project-root.jam
===================================================================
--- boost/trunk/tools/build/v2/test/v1_testing/project-root.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/v1_testing/project-root.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1 +1,5 @@
-# just label the project root
\ No newline at end of file
+# Copyright 2002 Dave Abrahams 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
+# just label the project root

Modified: boost/trunk/tools/build/v2/test/v1_testing.py
===================================================================
--- boost/trunk/tools/build/v2/test/v1_testing.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/v1_testing.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/python
 
+# Copyright 2002 Dave Abrahams 
+# Copyright 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 from BoostBuild import Tester, List
 import os
 from string import strip

Modified: boost/trunk/tools/build/v2/test/wrapper.py
===================================================================
--- boost/trunk/tools/build/v2/test/wrapper.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/test/wrapper.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,8 @@
 #!/usr/bin/python
 
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Test that the user can define his own rule that will call builtin main
 #  target rule and that this will work.

Modified: boost/trunk/tools/build/v2/tools/acc.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/acc.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/acc.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,7 +5,7 @@
 # or copy at http://www.boost.org/LICENSE_1_0.txt)
 
 #
-# Boost.Build V2 toolset for the IBM VisualAge compiler
+# Boost.Build V2 toolset for the HP aC++ compiler.
 #
 
 import toolset : flags ;

Modified: boost/trunk/tools/build/v2/tools/bison.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/bison.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/bison.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,6 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 import generators ;
 import feature ;
@@ -30,4 +29,4 @@
 actions bison 
 {
     bison $(PREFIX_OPT) -d -o $(<[1]) $(>)
-}
\ No newline at end of file
+}

Modified: boost/trunk/tools/build/v2/tools/boostbook.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/boostbook.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/boostbook.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,9 @@
-#  Copyright (C) 2003 Doug Gregor. Permission to copy, use, modify,
-#  sell and distribute this software is granted provided this
-#  copyright notice appears in all copies. This software is provided
-#  "as is" without express or implied warranty, and with no claim as
-#  to its suitability for any purpose.
+# Copyright 2003, 2004, 2005 Dave Abrahams 
+# Copyright 2003, 2004, 2005 Douglas Gregor 
+# Copyright 2005, 2006 Rene Rivera 
+# Copyright 2003, 2004, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  This module defines rules to handle generation of documentation
 #  from BoostBook sources.
@@ -112,12 +113,6 @@
           : $(search-dirs:J="
 ") ;
     }    
-    # Add trailing slash since some other code 
-    # uses :B modifier to add last element, and fails
-    # without trailing slash. The code really should be fixed,
-    # but not now.
-    .boostbook-xsl-dir = $(.boostbook-xsl-dir)/ ;
-    .boostbook-dtd-dir = $(.boostbook-dtd-dir)/ ;   
     
     # Register generators only if we've were called via "using boostbook ; "
     generators.register-standard boostbook.dtdxml-to-boostbook : DTDXML : XML ;
@@ -161,36 +156,31 @@
 
 rule boostbook-to-docbook ( target : source : properties * )
 {
-  local native-path = [ path.native $(.boostbook-xsl-dir) ] ;
-  local stylesheet = $(native-path:B=docbook:S=.xsl) ;
+  local stylesheet = [ path.native $(.boostbook-xsl-dir)/docbook.xsl ] ;
   xslt $(target) : $(source) $(stylesheet) : $(properties) ;
 }
 
 rule docbook-to-onehtml ( target : source : properties * )
 {
-  local native-path = [ path.native $(.boostbook-xsl-dir) ] ;
-  local stylesheet = $(native-path:B=html-single:S=.xsl) ;
+  local stylesheet = [ path.native $(.boostbook-xsl-dir)/html-single.xsl ] ;
   xslt $(target) : $(source) $(stylesheet) : $(properties) ;
 }
 
 rule docbook-to-htmldir ( target : source : properties * )
 {
-  local native-path = [ path.native $(.boostbook-xsl-dir) ] ;
-  local stylesheet = $(native-path:B=html:S=.xsl) ;
+  local stylesheet = [ path.native $(.boostbook-xsl-dir)/html.xsl ] ;
   xslt-dir $(target) : $(source) $(stylesheet) : $(properties) : html ;
 }
 
 rule docbook-to-manpages ( target : source : properties * )
 {
-  local native-path = [ path.native $(.boostbook-xsl-dir) ] ;
-  local stylesheet = $(native-path:B=manpages:S=.xsl) ;
+  local stylesheet = [ path.native $(.boostbook-xsl-dir)/manpages.xsl ] ;
   xslt-dir $(target) : $(source) $(stylesheet) : $(properties) : man ;
 }
 
 rule docbook-to-fo ( target : source : properties * )
 {
-  local native-path = [ path.native $(.boostbook-xsl-dir) ] ;
-  local stylesheet = $(native-path:B=fo:S=.xsl) ;
+  local stylesheet = [ path.native $(.boostbook-xsl-dir)/fo.xsl ] ;
   xslt $(target) : $(source) $(stylesheet) : $(properties) ;
 }
 
@@ -271,9 +261,7 @@
        
         # Add the catalog to the property set
         local catalog-path = [ $(catalog).path ] ;
-        catalog-path = "$(catalog-path)/" ;
-        local catalog-file = $(catalog-path:G=<catalog>:B=catalog:S=.xml) ;
-        property-set = [ $(property-set).add-raw $(catalog-file) ] ;
+        property-set = [ $(property-set).add-raw <catalog>$(catalog-path)/catalog.xml ] ;
 
         # local targets = $(catalog) ;
 

Modified: boost/trunk/tools/build/v2/tools/borland.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/borland.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/borland.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,8 @@
-# (C) Copyright David Abrahams 2001. 
-# (C) Copyright Vladimir Prus 2003.
-# (C) Copyright Rene Rivera 2003.
-# Permission to copy, use, modify, sell and distribute this software 
-# is granted provided this copyright notice appears in all copies. This 
-# software is provided "as is" without express or implied warranty, and 
-# with no claim as to its suitability for any purpose.
+# Copyright 2005 Dave Abrahams 
+# Copyright 2003 Rene Rivera 
+# Copyright 2003, 2004, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Support for the Borland's command line compiler
 
@@ -154,13 +152,16 @@
 # The NEED_IMPLIB variable controls whether we need to invoke implib.
 
 flags borland.archive AROPTIONS <archiveflags> ;
+
 # Declare action for archives. We don't use response file
 # since it's hard to get "+-" there.
+# The /P256 increases 'page' size -- with too low
+# values tlib fails when building large applications.
 # CONSIDER: don't know what 'together' is for...
 actions updated together piecemeal archive
 { 
     $(.set-path)$(.root:W)$(.old-path)
-    tlib $(AROPTIONS) /u /a /C "$(<:W)" +-"$(>:W)"
+    tlib $(AROPTIONS) /P256 /u /a /C "$(<:W)" +-"$(>:W)"
 }
 
 

Modified: boost/trunk/tools/build/v2/tools/builtin.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/builtin.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/builtin.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,10 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2002, 2003, 2004, 2005 Dave Abrahams 
+# Copyright 2002, 2005, 2006 Rene Rivera 
+# Copyright 2006 Juergen Hunold 
+# Copyright 2005 Toon Knapen 
+# Copyright 2002, 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Defines standard features and rules.
 
@@ -22,12 +25,65 @@
 import print ;
 import utility ;
 import project ;
+import generate ;
 
 # This feature is used to determine which OS we're on.
 # In future, this may become <target-os> and <host-os>
+# The future is now...
 local os = [ modules.peek : OS ] ;
 feature os : $(os) : propagated link-incompatible ;
 
+# Translates from bjam current OS to the os tags used
+# in host-os and target-os. I.e. it returns the
+# running host-os.
+local rule default-host-os ( )
+{
+    local host-os ;
+    local os-list = [ feature.values host-os ] ;
+    if [ os.name ] in $(os-list:U)
+    {
+        host-os = [ os.name ] ;
+    }
+    else
+    {
+        switch [ os.name ]
+        {
+            case NT : host-os = windows ;
+            case AS400 : host-os = unix ;
+            case MINGW : host-os = windows ;
+            case BSDI : host-os = bsd ;
+            case COHERENT : host-os = unix ;
+            case DRAGONFLYBSD : host-os = bsd ;
+            case IRIX : host-os = sgi ;
+            case MACOSX : host-os = darwin ;
+            case KFREEBSD : host-os = freebsd ;
+            case LINUX : host-os = linux ;
+            case * : host-os = unix ;
+        }
+    }
+    return $(host-os:L) ;
+}
+
+# The two OS features define a known set of abstract OS
+# names. The host-os is the OS under which bjam is running.
+# Even though this should really be a fixed property we need
+# to list all the values to prevent unkown value errors.
+# Both set the default value to the current OS to account for
+# the default use case of building on the target OS.
+feature host-os
+    :   amiga aix bsd cygwin darwin dos emx freebsd hpux
+        linux netbsd openbsd osf qnx qnxnto sgi solaris sun sunos
+        svr4 sysv ultrix unix unixware vms windows
+    :   optional ;
+        feature.set-default host-os : [ default-host-os ] ;
+feature target-os
+    :   amiga aix bsd cygwin darwin dos emx freebsd hpux
+        linux netbsd openbsd osf qnx qnxnto sgi solaris sun sunos
+        svr4 sysv ultrix unix unixware vms windows
+    :   propagated link-incompatible ;
+        feature.set-default target-os : [ default-host-os ] ;
+
+
 feature toolset : : implicit propagated symmetric ;
 
 feature stdlib : native : propagated composite ;
@@ -60,6 +116,9 @@
 feature archiveflags : : free ;
 feature version : : free ;
 
+# Generic, i.e. non-lanugage specific, flags for tools.
+feature flags : : free ;
+
 feature.feature location-prefix : : free ;
 
 
@@ -163,7 +222,7 @@
     itanium itanium1 merced itanium2 mckinley
     # Sparc
     v7 cypress v8 supersparc sparclite hypersparc sparclite86x
-    f930 f934 sparclet tsc701 v9 ultrasparc
+    f930 f934 sparclet tsc701 v9 ultrasparc ultrasparc3
     # RS/6000 & PowerPC
     401 403 405 405fp 440 440fp 505
     601 602 603 603e 604 604e 620 630 740 7400 7450 750
@@ -405,8 +464,8 @@
             local properties = [ $(property-set).raw ] ;
             # Determine the needed target type
             local actual-type ;
-	        # <source>files can be generated by <conditional>@rule feature
-	        # in which case we don't consider it a SEARCHED_LIB type.
+                # <source>files can be generated by <conditional>@rule feature
+                # in which case we don't consider it a SEARCHED_LIB type.
             if ! <source> in $(properties:G) &&
                ( <search> in $(properties:G) || <name> in $(properties:G) )
             {
@@ -428,7 +487,7 @@
             property-set = [ $(property-set).add-raw <main-target-type>LIB ] ;
             # Construct the target.
             return [ generators.construct $(project) $(name) : $(actual-type) 
-              : $(property-set) : $(sources) : LIB ] ;        
+              : $(property-set) : $(sources) ] ;        
         }  
     }    
     
@@ -447,6 +506,7 @@
 rule lib ( names + : sources * : requirements * : default-build * 
     : usage-requirements * )
 {
+    local result ;
     local project = [ project.current ] ;
     
     # This is a circular module dependency, so it must be imported here
@@ -684,10 +744,13 @@
         local result = [ generator.run $(project) $(name) : $(property-set)
           : $(sources) ] ;
         
-        local ur = [ extra-usage-requirements $(result) : $(property-set) ] ;
-        ur = [ $(ur).add 
-          [ property-set.create <xdll-path>$(extra-xdll-paths) ] ] ;
-                        
+        local ur ;
+        if $(result)
+        {            
+          ur = [ extra-usage-requirements $(result) : $(property-set) ] ;
+            ur = [ $(ur).add 
+              [ property-set.create <xdll-path>$(extra-xdll-paths) ] ] ;                        
+        }        
         return $(ur) $(result) ;
     }
     
@@ -842,7 +905,21 @@
     generators.register $(g) ;
 }
 
+# Generators that accepts everything, and produces nothing.
+# Usefull as general fallback for toolset-specific actions, like
+# PCH generation.
+class dummy-generator : generator
+{
+    import property-set ;
+    
+    rule run ( project name ? : property-set : sources + )
+    {
+        return [ property-set.empty ] ;
+    }
+}
 
+
+
 IMPORT $(__name__) : register-linker register-archiver 
   : : generators.register-linker generators.register-archiver ;
 

Modified: boost/trunk/tools/build/v2/tools/common.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/common.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/common.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,9 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003, 2005 Dave Abrahams 
+# Copyright 2005, 2006 Rene Rivera 
+# Copyright 2005 Toon Knapen 
+# Copyright 2002, 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Provides actions common to all toolsets, for as making directoies and
 #  removing files.
@@ -16,11 +18,16 @@
 import path ;
 import sequence ;
 import toolset ;
+import virtual-target ;
 
 if [ MATCH (--debug-configuration) : [ modules.peek : ARGV ] ]
 {
     .debug-configuration = true ;
 }
+if [ MATCH (--show-configuration) : [ modules.peek : ARGV ] ]
+{
+    .show-configuration = true ;
+}
 
 # Configurations
 #
@@ -211,6 +218,10 @@
     .all-signatures += $(sig) ;
     .init-loc.$(sig) = [ errors.nearest-user-location ] ;
     
+    if $(.show-configuration)
+    {
+        ECHO notice: $(condition) ;
+    }
     return $(condition) ;
 }
 
@@ -400,11 +411,13 @@
     RM = del /f /q ;
     CP = copy ;
     IGNORE = "2>nul >nul & setlocal" ;
+    LN              ?= $(CP) ;
 }
 else
 {
     RM = rm -f ;
     CP = cp ;
+    LN = ln ;
 }
 
 nl = "
@@ -565,6 +578,222 @@
     $(RM) "$(>)" $(IGNORE)
 }
 
+actions hard-link
+{
+    $(RM) "$(<)" 2$(NULL_OUT) $(NULL_OUT)
+    $(LN) "$(>)" "$(<)" $(NULL_OUT)    
+}
+
+
+# Given a target, as given to a custom tag rule, returns a string formatted
+# according to the passed format. Format is a list of properties that is
+# represented in the result. For each element of format the corresponding
+# target information is obtained and added to the result string.
+# For all, but the literal, the format value is taken as the as string to
+# prepend to the output to join the item to the rest of the result. If not
+# given "-" is used as a joiner.
+#
+# The format options can be:
+#
+#   <base>[joiner]
+#       ::  The basename of the target name.
+#   <toolset>[joiner]
+#       ::  The abbreviated toolset tag being used to build the target.
+#   <threading>[joiner]
+#       ::  Indication of a multi-threaded build.
+#   <runtine>[joiner]
+#       ::  Collective tag of the build runtime.
+#   <version:/version-feature | X.Y[.Z]/>[joiner]
+#       ::  Short version tag taken from the given "version-feature"
+#           in the build properties. Or if not present the literal
+#           value as the version number.
+#   <property:/property-name/>[joiner]
+#       ::  Direct lookup of the given property-name value in the
+#           build properties.
+#   /otherwise/
+#       ::  The literal value of the format argument.
+#
+# For example this format:
+#
+#   boost_ <base> <toolset> <threading> <runtime> <version:boost-version>
+#
+# Might return:
+#
+#   boost_thread-vc80-mt-gd-1_33.dll, or
+#   boost_regex-vc80-gd-1_33.dll
+#
+# The returned name also has the target type specific prefix and suffix
+# which puts it in a ready form to use as the value from a custom tag rule.
+#
+rule format-name ( format * : name : type ? : property-set )
+{
+    if [ type.is-derived $(type) LIB ]
+    {
+        local result = "" ;
+        for local f in $(format)
+        {
+            switch $(f:G)
+            {
+                case <base> :
+                result += $(name:B) ;
+                
+                case <toolset> :
+                result += [ join-tag $(f:G=) :
+                    [ toolset-tag $(name) : $(type) : $(property-set) ] ] ;
+                
+                case <threading> :
+                result += [ join-tag $(f:G=) :
+                    [ threading-tag $(name) : $(type) : $(property-set) ] ] ;
+                
+                case <runtime> :
+                result += [ join-tag $(f:G=) :
+                    [ runtime-tag $(name) : $(type) : $(property-set) ] ] ;
+                
+                case <version:*> :
+                local key = [ MATCH <version:(.*)> : $(f:G) ] ;
+                local version = [ $(property-set).get <$(key)> ] ;
+                version ?= $(key) ;
+                version = [ MATCH "^([^.]+)[.]([^.]+)[.]?([^.]*)"
+                    : $(version) ] ;
+                result += [ join-tag $(f:G=) : $(version[1])_$(version[2]) ] ;
+                
+                case <property:*> :
+                local key = [ MATCH <property:(.*)> : $(f:G) ] ;
+                local p = [ $(property-set).get [ MATCH <property:(.*)> : $(f:G) ] ] ;
+                if $(p)
+                {
+                    result += [ join-tag $(f:G=) : $(p) ] ;
+                }
+                
+                case * :
+                result += $(f:G=) ;
+            }
+        }
+        result = [ virtual-target.add-prefix-and-suffix
+            $(result:J=) : $(type) : $(property-set) ] ;
+        return $(result) ;
+    }
+}
+
+local rule join-tag ( joiner ? : tag ? )
+{
+    if ! $(joinder) { joiner = - ; }
+    return $(joiner)$(tag) ;
+}
+
+local rule toolset-tag ( name : type ? : property-set )
+{
+    local tag = ;
+    
+    local properties = [ $(property-set).raw ] ;
+    switch [ $(property-set).get <toolset> ]
+    {
+        case borland* : tag += bcb ;
+        case como* : tag += como ;
+        case cw : tag += cw ;
+        case darwin* : tag += ;
+        case edg* : tag += edg ;
+        case gcc* :
+        {
+            switch [ $(property-set).get <toolset-gcc:flavor> ]
+            {
+                case *mingw* : tag += mgw ;
+                case * : tag += gcc ;
+            }
+        }
+        case intel : 
+        if [ $(property-set).get <toolset-intel:platform> ] = win
+        {
+            tag += iw ;
+        }
+        else
+        {
+            tag += il ;
+        }
+        case kcc* : tag += kcc ;
+        case kylix* : tag += bck ;
+        #case metrowerks* : tag += cw ;
+        #case mingw* : tag += mgw ;
+        case mipspro* : tag += mp ;
+        case msvc* : tag += vc ;
+        case sun* : tag += sw ;
+        case tru64cxx* : tag += tru ;
+        case vacpp* : tag += xlc ;
+    }
+    local version = [ MATCH "<toolset.*version>([0123456789]+)[.]([0123456789]*)"
+        : $(properties) ] ;
+    # For historical reasons, vc6.0 and vc7.0 use different
+    # naming.
+    if $(tag) = vc
+    {
+        if $(version[1]) = 6
+        {
+            # Cancel minor version.
+            version = 6 ;
+        }
+        else if $(version[1]) = 7 && $(version[2]) = 0
+        {
+            version = 7 ;
+        }
+    }
+    # On intel, version is not added, because it does not
+    # matter and it's the version of vc used as backend
+    # that matters. Ideally, we'd encode the backend
+    # version but that will break compatibility with
+    # V1.
+    if $(tag) = iw
+    {
+        version = ;
+    }
+    
+    # On borland, version is not added for compatibility
+    # with V1.
+    if $(tag) = bcb
+    {
+        version = ;
+    }
+        
+    tag += $(version) ;
+    
+    return $(tag:J=) ;
+}
+
+local rule threading-tag ( name : type ? : property-set )
+{
+    local tag = ;
+    local properties = [ $(property-set).raw ] ;
+    if <threading>multi in $(properties) { tag = mt ; }
+    
+    return $(tag:J=) ;
+}
+
+local rule runtime-tag ( name : type ? : property-set )
+{
+    local tag = ;
+    
+    local properties = [ $(property-set).raw ] ;
+    if <runtime-link>static in $(properties) { tag += s ; }
+    
+    # This is ugly thing. In V1, there's a code to automatically
+    # detect which properties affect a target. So, if 
+    # <runtime-debugging> does not affect gcc toolset, the
+    # tag rules won't even see <runtime-debugging>.
+    # Similar functionality in V2 is not implemented yet, so we just
+    # check for toolsets which are know to care about runtime debug
+    if <toolset>msvc in $(properties)
+      || <stdlib>stlport in $(properties)
+    {
+        if <runtime-debugging>on in $(properties) { tag += g ; }        
+    }
+      
+    if <variant>debug-python in $(properties) { tag += y ; }
+    if <variant>debug in $(properties) { tag += d ; }
+    if <stdlib>stlport in $(properties) { tag += p ; }
+    if <stdlib-stlport:iostream>hostios in $(properties) { tag += n ; }
+    
+    return $(tag:J=) ;
+}
+
 rule __test__ ( ) {
 
     import assert ;

Modified: boost/trunk/tools/build/v2/tools/como-linux.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/como-linux.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/como-linux.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,6 @@
-# modify, sell and distribute this software is granted provided this
-# copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as
-# to its suitability for any purpose.
+# Copyright 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # The following #// line will be used by the regression test table generation
 # program as the column heading for HTML tables. Must not include version number.

Modified: boost/trunk/tools/build/v2/tools/como-win.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/como-win.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/como-win.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -104,16 +104,9 @@
     $(CONFIG_COMMAND) -c -e5 --no_version --no_prelink_verbose --display_error_number --long_long --diag_suppress=9,21,161,748,940,962 --diag_error=461 -D__STL_LONG_LONG -U$(UNDEFS) -D$(DEFINES) $(WARN) $(CFLAGS) $(C++FLAGS) -I"$(HDRS)" -I"$(STDHDRS)" -I"$(SYSHDRS)" -o "$(<)" "$(>)"
 }
 
-#### Archive ####
-
-rule archive ( targets + : sources * : properties * )    
-{
-    common.response-file $(targets) : $(sources) : $(targets[2]) : $(properties) ;             
-}
-
 actions updated together piecemeal archive
 {
-    $(CONFIG_COMMAND) --no_version --no_prelink_verbose --prelink_object "$(LIBRARIES)"
-    lib $(ARFLAGS) /nologo /out:"$(<:S=.lib)" "$(LIBRARIES)"
+    $(CONFIG_COMMAND) --no_version --no_prelink_verbose --prelink_object "$(>)"
+    lib $(ARFLAGS) /nologo /out:"$(<:S=.lib)" "$(>)"
 }
 

Modified: boost/trunk/tools/build/v2/tools/cw.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/cw.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/cw.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,6 +23,8 @@
 
 feature.extend toolset : cw ;
 
+toolset.add-requirements <toolset>cw,<runtime-link>shared:<threading>multi ;
+
 nl = "
 " ;
 
@@ -188,6 +190,7 @@
 
 flags cw.link DEF_FILE <def-file> ;
 
+flags cw LINKFLAGS : -search ;
 flags cw LINKFLAGS <debug-symbols>on : -g ;
 flags cw LINKFLAGS <user-interface>console : -subsystem console ;
 flags cw LINKFLAGS <user-interface>gui : -subsystem windows ;
@@ -196,7 +199,6 @@
 flags cw LINKFLAGS <user-interface>auto : -subsystem auto ;
 
 flags cw LINKFLAGS <main-target-type>LIB/<link>static : -library ;
-flags cw LINKFLAGS <main-target-type>LIB/<link>shared : -shared ;
 
 flags cw.link USER_LINKFLAGS <linkflags> ;
 flags cw.link LINKPATH <library-path> ;
@@ -238,6 +240,6 @@
 
 actions link.dll bind DEF_FILE
 {
-   $(.LD) -o "$(<[1]:W)" -implib "$(<[2]:W)" -L"$(LINKPATH)" $(LINKFLAGS) -f"$(DEF_FILE)" $(USER_LINKFLAGS) @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)$(LIBRARIES_MENTIONED_BY_FILE) $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_ST:S=.lib)" $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_SA:S=.lib)")"
+   $(.LD) -shared -o "$(<[1]:W)" -implib "$(<[2]:W)" -L"$(LINKPATH)" $(LINKFLAGS) -f"$(DEF_FILE)" $(USER_LINKFLAGS) @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)$(LIBRARIES_MENTIONED_BY_FILE) $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_ST:S=.lib)" $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_SA:S=.lib)")"
 }
 

Modified: boost/trunk/tools/build/v2/tools/darwin.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/darwin.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/darwin.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,8 @@
-#  Copyright (C) Christopher Currie 2003. Permission to copy, use,
-#  modify, sell and distribute this software is granted provided this
-#  copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as to
-#  its suitability for any purpose.
+# Copyright 2003 Christopher Currie
+# Copyright 2006 Dave Abrahams 
+# Copyright 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Please see http://article.gmane.org/gmane.comp.lib.boost.build/3389/
 #  for explanation why it's a separate toolset.
@@ -60,15 +60,40 @@
 
 _ = " " ;
 
+# set up the -F option to include the paths to any frameworks used.
+local rule prepare-framework-path ( target + )
+{
+    local framework-path = [ on $(target) return $(FRAMEWORK:D) ] ;
+    
+    if $(framework-path)
+    {
+        FRAMEWORK_PATH on $(target) += -F$(framework-path) ;
+    }
+    else
+    {
+        FRAMEWORK_PATH on $(target) = ;
+    }
+}
+
+rule link
+{
+    prepare-framework-path $(<) ;
+}
+
 actions link bind LIBRARIES
 {
-    $(CONFIG_COMMAND) -L"$(LINKPATH)" -o "$(<)" "$(>)" "$(LIBRARIES)" -l$(FINDLIBS-SA) -l$(FINDLIBS-ST) -framework$(_)$(FRAMEWORK) $(OPTIONS)
+    $(CONFIG_COMMAND) -L"$(LINKPATH)" -o "$(<)" "$(>)" "$(LIBRARIES)" -l$(FINDLIBS-SA) -l$(FINDLIBS-ST) $(FRAMEWORK_PATH) -framework$(_)$(FRAMEWORK:D=) $(OPTIONS) $(USER_OPTIONS)
     $(NEED_STRIP)strip $(NEED_STRIP)"$(<)"
 }
 
+rule link.dll
+{
+    prepare-framework-path $(<) ;
+}
+
 actions link.dll bind LIBRARIES
 {
-    $(CONFIG_COMMAND) -dynamiclib -L"$(LINKPATH)" -o "$(<)" "$(>)" "$(LIBRARIES)" -l$(FINDLIBS-SA) -l$(FINDLIBS-ST) -framework$(_)$(FRAMEWORK) $(OPTIONS) 
+    $(CONFIG_COMMAND) -dynamiclib -L"$(LINKPATH)" -o "$(<)" "$(>)" "$(LIBRARIES)" -l$(FINDLIBS-SA) -l$(FINDLIBS-ST) $(FRAMEWORK_PATH) -framework$(_)$(FRAMEWORK:D=) $(OPTIONS) $(USER_OPTIONS)
 }
 
 actions piecemeal archive

Modified: boost/trunk/tools/build/v2/tools/docutils.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/docutils.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/docutils.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,11 +19,19 @@
 
 class rst-scanner : common-scanner
 {
+    rule __init__ ( paths * )
+    {
+        common-scanner.__init__ . $(paths) ;
+    }
+    
     rule pattern ( )
     {
-         return "^\\w*\\.\\.\\w+include::\w+(.*)"
-        "^\\w*\\.\\.\\w+image::\w+(.*)"
-        "^\\w*\\.\\.\\w+figure::\w+(.*)"
+         return "^[ 	]*\\.\\.[ 	]+include::[ 	]+([^
+]+)"
+        "^[ 	]*\\.\\.[ 	]+image::[ 	]+([^
+]+)"
+        "^[ 	]*\\.\\.[ 	]+figure::[ 	]+([^
+]+)"
         ;
     }
 }
@@ -33,7 +41,7 @@
 
 generators.register-standard docutils.html : ReST : HTML ;
 
-rule init ( docutils-dir )
+rule init ( docutils-dir ? )
 {
     docutils-dir ?= [ modules.peek : DOCUTILS_DIR ] ;
 
@@ -50,18 +58,24 @@
 
 rule html ( target : source : properties *  )
 {
-    docutils-dir on $(target) = $(.docutils-dir) ;
+    local command-prefix = "python "$(.docutils-dir)/tools/ ;
+    if ! [ on $(target) return $(RST2XXX) ]
+    {
+        RST2XXX on $(target) = $(command-prefix:E="")rst2html.py ;
+    }
 }
 
 
 feature docutils : : free ;
 feature docutils-html : : free ;
+feature docutils-cmd : : free ;
 toolset.flags docutils COMMON-FLAGS : <docutils> ;
 toolset.flags docutils HTML-FLAGS : <docutils-html> ;
+toolset.flags docutils RST2XXX : <docutils-cmd> ;
   
 actions html
 {
     $(.setup)
-    python $(docutils-dir)/tools/rst2html.py $(COMMON-FLAGS) $(HTML-FLAGS) $(>) $(<)
+    $(RST2XXX) $(COMMON-FLAGS) $(HTML-FLAGS) $(>) $(<)
 }
 

Copied: boost/trunk/tools/build/v2/tools/doxproc.py (from rev 14034, boost/branches/upstream/current/tools/build/v2/tools/doxproc.py)

Modified: boost/trunk/tools/build/v2/tools/doxygen-config.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/doxygen-config.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/doxygen-config.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,47 +1,11 @@
-#~ Copyright 2005 Rene Rivera.
+#~ Copyright 2005, 2006 Rene Rivera.
 #~ Distributed under the Boost Software License, Version 1.0.
 #~ (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
 
-# Automatic configuration for Python tools and librries. To use, just import this module.
+# Automatic configuration for Doxygen tools. To use, just import this module.
 
-import os ;
 import toolset : using ;
 
-if [ os.name ] = NT
-{
-    local ProgramFiles = [ modules.peek : ProgramFiles ] ;
-    if $(ProgramFiles)
-    {
-        ProgramFiles = "$(ProgramFiles:J= )" ;
-    }
-    else
-    {
-        ProgramFiles = "C:\\Program Files" ;
-    }
-    
-    local doxygen-path = [ GLOB [ modules.peek : PATH ] "$(ProgramFiles)\\doxygen\\bin" : doxygen\.exe ] ;
-    doxygen-path = $(doxygen-path[1]) ;
-    
-    if $(doxygen-path)
-    {
-        if --debug-configuration in [ modules.peek : ARGV ]
-        {
-            ECHO "notice:" using doxygen ":" $(doxygen-path) ;
-        }
-        using doxygen : $(doxygen-path) ;
-    }
-}
-else
-{
-    local doxygen-path = [ GLOB [ modules.peek : PATH ] : doxygen ] ;
-    doxygen-path = $(doxygen-path[1]) ;
-    
-    if $(xsltproc-path)
-    {
-        if --debug-configuration in [ modules.peek : ARGV ]
-        {
-            ECHO "notice:" using doxygen ":" $(doxygen-path) ;
-        }
-        using doxygen : $(doxygen-path) ;
-    }
-}
+ECHO "warning: doxygen-config.jam is deprecated. Use 'using doxygen ;' instead." ;
+
+using doxygen ;

Modified: boost/trunk/tools/build/v2/tools/doxygen.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/doxygen.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/doxygen.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,22 @@
-#  Copyright (C) 2003 Doug Gregor. Permission to copy, use, modify,
-#  sell and distribute this software is granted provided this
-#  copyright notice appears in all copies. This software is provided
-#  "as is" without express or implied warranty, and with no claim as
-#  to its suitability for any purpose.
+# Copyright 2003, 2004 Douglas Gregor
+# Copyright 2003, 2004, 2005 Vladimir Prus
+# Copyright 2006 Rene Rivera
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
 
-#  This module defines rules to handle generation of BoostBook XML
-#  from Doxygen XML output. 
+# This module defines rules to handle generation of various outputs
+# from source files documented with doxygen comments. The supported
+# transformations are:
+#
+# * Source -> Doxygen XML -> BoostBook XML
+# * Source -> Doxygen HTML
+#
+# The type of transformation is selected based on the target requested.
+# For BoostBook XML, the default, specifying a target with an ".xml" suffix,
+# or an empty suffix, will produce a <target>.xml and <target>.boostbook.
+# For Doxygen HTML specifying a target with an ".html" suffix will produce
+# a directory <target> with the Doxygen html files, and a <target>.html file
+# redirecting to that directory.
 
 import "class" : new ;
 import targets ;
@@ -19,92 +30,164 @@
 import regex ;
 import stage ;
 import project ;
-
 import xsltproc ;
+import make ;
+import os ;
 
+# Use to specify extra configuration paramters. These get translated
+# into a doxyfile which configures the building of the docs.
 feature.feature doxygen:param : : free ;
+
+# Specify the "<xsl:param>boost.doxygen.header.prefix" XSLT option.
 feature.feature prefix : : free ;
+
+# Specify the "<xsl:param>boost.doxygen.reftitle" XSLT option.
 feature.feature reftitle : : free ;
 
-type.register DOXYFILE : doxyfile ; # Doxygen input file
-type.register DOXYGEN_XML_MULTIFILE : : XML ; # Doxygen XML multi-file output
-type.register DOXYGEN_XML : doxygen : XML ; # Doxygen XML output
+# Doxygen configuration input file.
+type.register DOXYFILE : doxyfile ;
 
+# Doxygen XML multi-file output.
+type.register DOXYGEN_XML_MULTIFILE : : XML ;
+
+# Doxygen XML coallesed output.
+type.register DOXYGEN_XML : doxygen : XML ;
+
+# Doxygen HTML multifile directory.
+type.register DOXYGEN_HTML_MULTIFILE : dir : HTML ;
+
+# Redirection HTML file to HTML multifile directory.
+type.register DOXYGEN_HTML : : HTML ;
+
 # Initialize the Doxygen module. Parameters are:
 #   name: the name of the 'doxygen' executable. If not specified, the name
 #         'doxygen' will be used
 rule init ( name ? )
 {
-  if ! $(.initialized)
-  {
-    .initialized = true ;
-      
-    if $(name)
+    if ! $(.initialized)
     {
-      .doxygen = $(name) ; 
-    }   
-    
-    generators.register-composing doxygen.headers-to-doxyfile : H HPP : DOXYFILE ; 
-    generators.register-standard doxygen.run : DOXYFILE : DOXYGEN_XML_MULTIFILE ;
-    generators.register-standard doxygen.xml-to-boostbook : DOXYGEN_XML : BOOSTBOOK ;
-    generators.register-standard doxygen.collect : DOXYGEN_XML_MULTIFILE : DOXYGEN_XML ;
-            
-    IMPORT $(__name__) : doxygen : : doxygen ;
-  }
+        .initialized = true ;
+
+        if ! $(name)
+        {
+            if [ os.name ] = NT
+            {
+                local ProgramFiles = [ modules.peek : ProgramFiles ] ;
+                if $(ProgramFiles)
+                {
+                    ProgramFiles = "$(ProgramFiles:J= )" ;
+                }
+                else
+                {
+                    ProgramFiles = "C:\\Program Files" ;
+                }
+                
+                local doxygen-path =
+                    [ GLOB
+                        [ modules.peek : PATH ]
+                        "$(ProgramFiles)\\doxygen\\bin"
+                        : doxygen\.exe ] ;
+                doxygen-path = $(doxygen-path[1]) ;
+                
+                if $(doxygen-path)
+                {
+                    if --debug-configuration in [ modules.peek : ARGV ]
+                    {
+                        ECHO "notice:" using doxygen ":" $(doxygen-path) ;
+                    }
+                    .doxygen = $(doxygen-path) ;
+                }
+            }
+            else
+            {
+                local doxygen-path =
+                    [ GLOB
+                        [ modules.peek : PATH ]
+                        : doxygen ] ;
+                doxygen-path = $(doxygen-path[1]) ;
+                
+                if $(doxygen-path)
+                {
+                    if --debug-configuration in [ modules.peek : ARGV ]
+                    {
+                        ECHO "notice:" using doxygen ":" $(doxygen-path) ;
+                    }
+                    .doxygen = $(doxygen-path) ;
+                }
+            }
+        }
+        else
+        {
+            if --debug-configuration in [ modules.peek : ARGV ]
+            {
+                ECHO "notice:" using doxygen ":" $(name) ;
+            }
+            .doxygen = $(name) ;
+        }
+        .doxygen ?= doxygen ;
+
+        generators.register-composing doxygen.headers-to-doxyfile : H HPP CPP : DOXYFILE ;
+        generators.register-standard doxygen.run : DOXYFILE : DOXYGEN_XML_MULTIFILE ;
+        generators.register-standard doxygen.xml-to-boostbook : DOXYGEN_XML : BOOSTBOOK ;
+        generators.register-standard doxygen.collect : DOXYGEN_XML_MULTIFILE : DOXYGEN_XML ;
+        generators.register-standard doxygen.run : DOXYFILE : DOXYGEN_HTML_MULTIFILE ;
+        generators.register-standard doxygen.html-redirect : DOXYGEN_HTML_MULTIFILE : DOXYGEN_HTML ;
+
+        IMPORT $(__name__) : doxygen : : doxygen ;
+    }
 }
 
 rule name ( )
 {
-  return $(.doxygen) ;
+    return $(.doxygen) ;
 }
 
 # Runs Doxygen on the given Doxygen configuration file (the source) to
-# generate Doxygen XML (in multiple files). The output is dumped
-# according to the settings in the Doxygen configuration file, not
-# according to the target! Because of this, we essentially "touch" the
-# target file, in effect making it look like we've really written
-# something useful to it. Anyone that uses this action must deal with
-# this behavior.  
-actions doxygen-action 
+# generate the Doxygen files. The output is dumped according to the settings
+# in the Doxygen configuration file, not according to the target! Because
+# of this, we essentially "touch" the target file, in effect making it look
+# like we've really written something useful to it. Anyone that uses this
+# action must deal with this behavior.
+actions doxygen-action
 {
-  "$(NAME:E=doxygen)" $(>) ;
-  echo "Stamped" > "$(<)"
+    "$(NAME:E=doxygen)" $(>) && echo "Stamped" > "$(<)"
 }
 
 # Generates a doxygen configuration file (doxyfile) given a set of C++
-# sources anda property list that may contain <doxygen:param>
+# sources and a property list that may contain <doxygen:param>
 # features.
 rule headers-to-doxyfile ( target : sources * : properties * )
 {
-  local text "# Generated by Boost.Build version 2" ;
+    local text "# Generated by Boost.Build version 2" ;
 
-  # Translate <doxygen:param> into command line flags.  
-  for local param in [ feature.get-values <doxygen:param> : $(properties) ]
-  {
-    local namevalue = [ regex.match ([^=]*)=(.*) : $(param) ] ;
-    text += "$(namevalue[1]) = $(namevalue[2])" ;
-  }
- 
-  local headers = "" ;
-  for local source in $(sources:G=)
-  {
-    headers = "$(headers) $(source)" ;
-  }
+    # Translate <doxygen:param> into command line flags.
+    for local param in [ feature.get-values <doxygen:param> : $(properties) ]
+    {
+        local namevalue = [ regex.match ([^=]*)=(.*) : $(param) ] ;
+        text += "$(namevalue[1]) = $(namevalue[2])" ;
+    }
 
-  text += "GENERATE_HTML = NO" ;
-  text += "GENERATE_LATEX = NO" ;
-  text += "GENERATE_XML = YES" ;
-  text += "INPUT = $(headers) " ;
-  print.output $(target) plain ;
-  print.text $(text) : true ;
+    local headers = "" ;
+    for local source in $(sources:G=)
+    {
+        headers = "$(headers) $(source)" ;
+    }
+
+    # Doxygen generates LaTex by default. So disable it unconditionally,
+    # or at least until someone needs, and hence writes support for, LaTex
+    # output.
+    text += "GENERATE_LATEX = NO" ;
+    text += "INPUT = $(headers) " ;
+    print.output $(target) plain ;
+    print.text $(text) : true ;
 }
 
 # Run Doxygen. See doxygen-action for a description of the strange
 # properties of this rule
 rule run ( target : source : properties * )
 {
-  doxygen-action $(target) : $(source) ;  
-  NAME on $(target) = $(.doxygen) ;
+    doxygen-action $(target) : $(source) ;
+    NAME on $(target) = $(.doxygen) ;
 }
 
 # The rules below require Boost.Book stylesheets, so we need
@@ -119,10 +202,9 @@
         ECHO "error: which requires Boost.Book," ;
         ECHO "error: but never initialized Boost.Book." ;
         EXIT "error: Hint: add 'using boostbook ;' to your user-config.jam" ;
-    }      
+    }
 }
 
-
 # Collect the set of Doxygen XML files into a single XML source file
 # that can be handled by an XSLT processor. The source is completely
 # ignored (see doxygen-action), because this action picks up the
@@ -132,58 +214,135 @@
 # Doxygen XML file.
 rule collect ( target : source : properties * )
 {
-  check-boostbook ;
-  local collect-xsl-dir = [ path.native 
-                        [ path.join [ boostbook.xsl-dir ] doxygen collect ] 
-                          ] ;
-  local collect-path = [ path.join [ path.pwd ] xml ] ;
-  local real-source = [ path.native xml/index.xml ] ;
-  NOTFILE $(real-source) ;
-  xsltproc.xslt $(target) : $(real-source) $(collect-xsl-dir:S=.xsl) 
-                 : <xsl:param>doxygen.xml.path=$(collect-path)
-                 ;
+    check-boostbook ;
+    local collect-xsl-dir = [ path.native
+        [ path.join [ boostbook.xsl-dir ] doxygen collect ]
+        ] ;
+    local collect-path = [ path.join [ path.pwd ] xml ] ;
+    local real-source = [ path.native xml/index.xml ] ;
+    NOTFILE $(real-source) ;
+    xsltproc.xslt $(target) : $(real-source) $(collect-xsl-dir:S=.xsl)
+        : <xsl:param>doxygen.xml.path=$(collect-path)
+        ;
 }
 
 # Translate Doxygen XML into BoostBook
 rule xml-to-boostbook ( target : source : properties * )
 {
-  check-boostbook ;
-  local xsl-dir = [ boostbook.xsl-dir ] ;
-  local d2b-xsl = [ path.native 
-                  [ path.join [ boostbook.xsl-dir ] doxygen 
-                    doxygen2boostbook.xsl ] ] ;
+    check-boostbook ;
+    local xsl-dir = [ boostbook.xsl-dir ] ;
+    local d2b-xsl = [ path.native
+        [ path.join [ boostbook.xsl-dir ] doxygen
+        doxygen2boostbook.xsl ] ] ;
 
-  local xslt-properties = $(properties) ;
-  for local prefix in [ feature.get-values <prefix> : $(properties) ]
-  {
-    xslt-properties += "<xsl:param>boost.doxygen.header.prefix=$(prefix)" ;
-  }
-  for local title in [ feature.get-values <reftitle> : $(properties) ]
-  {
-    xslt-properties += "<xsl:param>boost.doxygen.reftitle=\"$(title)\"" ;
-  }
+    local xslt-properties = $(properties) ;
+    for local prefix in [ feature.get-values <prefix> : $(properties) ]
+    {
+        xslt-properties += "<xsl:param>boost.doxygen.header.prefix=$(prefix)" ;
+    }
+    for local title in [ feature.get-values <reftitle> : $(properties) ]
+    {
+        xslt-properties += "<xsl:param>boost.doxygen.reftitle=\"$(title)\"" ;
+    }
 
-  xsltproc.xslt $(target) : $(source) $(d2b-xsl) : $(xslt-properties) ;
+    xsltproc.xslt $(target) : $(source) $(d2b-xsl) : $(xslt-properties) ;
 }
 
-# User-level rule to generate BoostBook XML from a set of headers via Doxygen. 
-rule doxygen ( target-name : sources * : requirements * : default-build * )
+# Generate the HTML redirect to HTML dir index.html file.
+rule html-redirect ( target : source : properties * )
 {
-  local project = [ project.current ] ;
+    local uri = "$(target:B)/index.html" ;
+    print.output $(target) plain ;
+    print.text
+"<!DOCTYPE html PUBLIC \"-//W3C//DTD XHTML 1.0 Strict//EN\"
+    \"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd\">
+<html xmlns=\"http://www.w3.org/1999/xhtml\">
+<head>
+  <meta http-equiv=\"refresh\" content=\"0; URL=$(uri)\" />
 
-  local doxyfile = [ 
-    new typed-target $(target-name) : $(project) : BOOSTBOOK
-        : [ targets.main-target-sources $(sources) : $(target-name) ] 
-        : [ targets.main-target-requirements $(requirements) : $(project) ] 
-        : [ targets.main-target-default-build $(default-build) : $(project) ]
-    ] ;
+  <title></title>
+</head>
 
-  targets.main-target-alternative $(doxyfile) ;
+<body>
+  Automatic redirection failed, please go to <a href=
+  \"$(uri)\">$(uri)</a>.
+</body>
+</html>
+"
+        : true ;
+}
 
-  targets.main-target-alternative
-    [ new install-target-class $(target-name:S=.xml) : $(project) 
-      : [ $(doxyfile).name ]
-      : [ targets.main-target-requirements $(requirements) <location>. : $(project) ] 
-      : [ targets.main-target-default-build $(default-build) : $(project) ] 
-    ] ;
-}
\ No newline at end of file
+# User-level rule to generate BoostBook XML from a set of headers via Doxygen.
+rule doxygen ( target : sources * : requirements * : default-build * )
+{
+    local project = [ project.current ] ;
+
+    if $(target:S) = .html
+    {
+        # Build an HTML directory from the sources.
+        local html-location = [ feature.get-values <location> : $(requirements) ] ;
+        local output-dir = [ path.root
+            [ path.join $(html-location:E=html) [ $(project).get build-dir ] ]
+            [ path.pwd ]
+            ] ;
+        local output-dir-native = [ path.native $(output-dir) ] ;
+        requirements = [ property.change $(requirements) : <location> ] ;
+        
+        ## The doxygen configuration file.
+        targets.main-target-alternative
+            [ new typed-target $(target:S=.tag) : $(project) : DOXYFILE
+                : [ targets.main-target-sources $(sources) : $(target:S=.tag) ]
+                : [ targets.main-target-requirements $(requirements)
+                    <doxygen:param>GENERATE_HTML=YES
+                    <doxygen:param>GENERATE_XML=NO
+                    <doxygen:param>"OUTPUT_DIRECTORY=$(output-dir-native)"
+                    <doxygen:param>HTML_OUTPUT=$(target:B)
+                    : $(project) ]
+                : [ targets.main-target-default-build $(default-build) : $(project) ]
+            ] ;
+        $(project).mark-target-as-explicit $(target:S=.tag) ;
+        
+        ## The html directory to generate by running doxygen.
+        targets.main-target-alternative
+            [ new typed-target $(target:S=.dir) : $(project) : DOXYGEN_HTML_MULTIFILE
+                : $(target:S=.tag)
+                : [ targets.main-target-requirements $(requirements)
+                    : $(project) ]
+                : [ targets.main-target-default-build $(default-build) : $(project) ]
+                ] ;
+        $(project).mark-target-as-explicit $(target:S=.dir) ;
+        
+        ## The redirect html file into the generated html.
+        targets.main-target-alternative
+            [ new typed-target $(target) : $(project) : DOXYGEN_HTML
+                : $(target:S=.dir)
+                : [ targets.main-target-requirements $(requirements)
+                    <location>$(output-dir)
+                    : $(project) ]
+                : [ targets.main-target-default-build $(default-build) : $(project) ]
+                ] ;
+    }
+    else
+    {
+        # Build a BoostBook XML file from the sources.
+        local doxyfile = [
+            new typed-target $(target) : $(project) : BOOSTBOOK
+                : [ targets.main-target-sources $(sources) : $(target) ]
+                : [ targets.main-target-requirements $(requirements)
+                    <doxygen:param>GENERATE_HTML=NO
+                    <doxygen:param>GENERATE_XML=YES
+                    : $(project) ]
+                : [ targets.main-target-default-build $(default-build) : $(project) ]
+            ] ;
+        targets.main-target-alternative $(doxyfile) ;
+
+        targets.main-target-alternative
+            [ new install-target-class $(target:S=.xml) : $(project)
+                : [ $(doxyfile).name ]
+                : [ targets.main-target-requirements $(requirements)
+                    <location>.
+                    : $(project) ]
+                : [ targets.main-target-default-build $(default-build) : $(project) ]
+            ] ;
+    }
+}

Modified: boost/trunk/tools/build/v2/tools/gcc.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/gcc.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/gcc.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,10 +1,12 @@
-#  Copyright (c) 2001 David Abrahams.
-#  Copyright (c) 2002-2003 Rene Rivera.
-#  Copyright (c) 2002-2003 Vladimir Prus.
+# Copyright 2001 David Abrahams.
+# Copyright 2002-2006 Rene Rivera.
+# Copyright 2002-2003 Vladimir Prus.
+#  Copyright (c) 2005 Reece H. Dunn.
+# Copyright 2006 Ilya Sokolov.
 #
-#  Use, modification and distribution is subject to the Boost Software
-#  License Version 1.0. (See accompanying file LICENSE_1_0.txt or
-#  http://www.boost.org/LICENSE_1_0.txt)
+# Distributed under the Boost Software License, Version 1.0.
+#    (See accompanying file LICENSE_1_0.txt or copy at
+#          http://www.boost.org/LICENSE_1_0.txt)
 
 import toolset : flags ;
 import property ;
@@ -16,6 +18,9 @@
 import set ;
 import common ;
 import errors ;
+import property-set ;
+import pch ;
+import regex ;
 
 if [ MATCH (--debug-configuration) : [ modules.peek : ARGV ] ]
 {
@@ -52,10 +57,51 @@
 #   using gcc : 3.4 : : <cxxflags>foo <linkflags>bar <linker-type>sun ;
 rule init ( version ? : command * : options * )
 {
-    local condition = [ common.check-init-parameters gcc : version $(version) ] ;
-    
+    # Information about the gcc command...
+    #   The command.
     local command = [ common.get-invocation-command gcc : g++ : $(command) ] ;
+    #   The root directory of the tool install.
+    local root = [ feature.get-values <root> : $(options) ] ;
+    #   The bin directory where to find the command to execute.
+    local bin ;
+    #   The flavor of compiler.
+    local flavor = [ feature.get-values <flavor> : $(options) ] ;
+    #   Autodetect the root and bin dir if not given.
+    if $(command)
+    {
+        bin ?= [ common.get-absolute-tool-path $(command[-1]) ] ;
+        root ?= $(bin:D) ;
+    }
+    #   Autodetect the version and flavor if not given.
+    if $(command)
+    {
+        # The 'command' variable can have multiple-element. When calling
+        # the SHELL builtin we need a single string.
+        local command-string = $(command:J=" ") ;
+        local command-info = [ MATCH "^[^ ]+[ ]+[^ ]+[ ]+([^ ]+)[^(]*[(]?([^)]*)"
+            : [ SHELL "$(command-string) --version" ] ] ;
+        version ?= $(command-info[1]) ;
+        switch $(command-info[2]:L)
+        {
+            case *mingw* : flavor ?= mingw ;
+        }
+    }
 
+    local condition ;
+    if $(flavor)
+    {
+        condition = [ common.check-init-parameters gcc
+            : version $(version)
+            : flavor $(flavor)
+            ] ;
+    }
+    else
+    {
+        condition = [ common.check-init-parameters gcc
+            : version $(version)
+            ] ;
+    }
+    
     common.handle-options gcc : $(condition) : $(command) : $(options) ;
     
     local linker = [ feature.get-values <linker-type> : $(options) ] ;
@@ -72,13 +118,6 @@
     }
     init-link-flags gcc $(linker) $(condition) ;
     
-    local root = [ feature.get-values <root> : $(options) ] ;
-    local bin ;
-    if $(command)
-    {
-        bin ?= [ common.get-absolute-tool-path $(command[-1]) ] ;
-        root ?= $(bin:D) ;
-    }
     
     # If gcc is installed in non-standard location, we'd need to
     # add LD_LIBRARY_PATH when running programs created with it
@@ -90,7 +129,7 @@
         # will pick the right onces.
         # Note that we don't provide a clean way to build 32-bit binary
         # with 64-bit compiler, but user can always pass -m32 manually.
-        local lib_path = $(root)/lib $(root)/lib32 $(root)/lib64 ;
+        local lib_path = $(root)/bin $(root)/lib $(root)/lib32 $(root)/lib64 ;
         if $(.debug-configuration)
         {
             ECHO notice: using gcc libraries :: $(condition) :: $(lib_path) ;
@@ -144,7 +183,85 @@
 generators.register-c-compiler gcc.compile.c : C : OBJ : <toolset>gcc ;
 generators.register-c-compiler gcc.compile.asm : ASM : OBJ : <toolset>gcc ;
 
+# pch support
 
+# The compiler looks for a precompiled header in each directory just 
+# before it looks for the include file in that directory.
+# The name searched for is the name specified in the #include directive 
+# with ".gch" suffix appended.
+# The logic in gcc-pch-generator will make sure that BASE_PCH suffix is
+# appended to full name of the header.
+
+type.set-generated-target-suffix PCH : <toolset>gcc : gch ;
+
+# GCC-specific pch generator.
+class gcc-pch-generator : pch-generator
+{
+    import project ;
+    import property-set ;
+    import type ;
+
+    rule run-pch ( project name ? : property-set : sources + )
+    {
+        # Find the header in sources. Ignore any CPP sources.
+        local header ;
+        for local s in $(sources)
+        {
+            if [ type.is-derived [ $(s).type ] H ] 
+            {
+                header = $(s) ;
+            }            
+        }
+                
+        # error handling
+        # base name of header file should be the same as the base name 
+        # of precompiled header.
+        local header-name = [ $(header).name ] ;
+        local header-basename = $(header-name:B) ;
+        if $(header-basename) != $(name)
+        {
+            local location = [ $(project).project-module ] ;
+            errors.user-error "in" $(location)": pch target name `"$(name)"' should be the same as the base name of header file `"$(header-name)"'" ;
+        }
+
+        local pch-file =
+            [ 
+              generator.run $(project) $(name)
+                : $(property-set)
+                : $(header)
+            ]
+          ;
+
+        # return result of base class and pch-file property as usage-requirements
+        return
+            [ property-set.create <pch-file>$(pch-file) <cflags>-Winvalid-pch ]
+            $(pch-file)
+          ;
+    }
+    
+    # Calls the base version specifying source's name as the
+    # name of the created target. As result, the PCH will be named
+    # whatever.hpp.gch, and not whatever.gch.
+    rule generated-targets ( sources + : property-set : project name ? )
+    {
+        name = [ $(sources[1]).name ] ;
+        return [ generator.generated-targets $(sources) 
+          : $(property-set) : $(project) $(name) ] ;
+    }    
+}
+
+# Note: the 'H' source type will catch both '.h' header and '.hpp' header. The latter
+# have HPP type, but HPP type is derived from H.  The type of compilation is determined
+# entirely by the destination type.
+generators.register [ new gcc-pch-generator gcc.compile.c.pch   : H :   C_PCH : <pch>on <toolset>gcc ] ;
+generators.register [ new gcc-pch-generator gcc.compile.c++.pch : H : CPP_PCH : <pch>on <toolset>gcc ] ;
+
+# Override default do-nothing generators.
+generators.override gcc.compile.c.pch   : pch.default-c-pch-generator   ;
+generators.override gcc.compile.c++.pch : pch.default-cpp-pch-generator ;
+
+flags gcc.compile PCH_FILE <pch>on : <pch-file> ;
+
 # Declare flags and action for compilation
 flags gcc.compile OPTIONS <optimization>off : -O0 ;
 flags gcc.compile OPTIONS <optimization>speed : -O3 ;
@@ -205,6 +322,16 @@
 flags gcc.compile DEFINES <define> ;
 flags gcc.compile INCLUDES <include> ;
 
+actions compile.c++.pch
+{
+    "$(CONFIG_COMMAND)" -x c++-header $(OPTIONS) -D$(DEFINES) -I"$(INCLUDES)" -c -o "$(<)" "$(>)" 
+}
+
+actions compile.c.pch
+{
+    "$(CONFIG_COMMAND)" -x c-header $(OPTIONS) -D$(DEFINES) -I"$(INCLUDES)" -c -o "$(<)" "$(>)" 
+}
+
 rule compile.c++
 {
     # Some extensions are compiled as C++ by default. For others, we need
@@ -214,14 +341,9 @@
     {
         LANG on $(<) = "-x c++" ;
     }    
+    DEPENDS $(<) : [ on $(<) return $(PCH_FILE) ] ;
 }
 
-
-actions compile.c++
-{
-    "$(CONFIG_COMMAND)" $(LANG) -ftemplate-depth-128 $(OPTIONS) $(USER_OPTIONS) -D$(DEFINES) -I"$(INCLUDES)" -c -o "$(<)" "$(>)" 
-}
-
 rule compile.c
 {
     # If we use the name g++ then default file suffix -> language mapping
@@ -231,12 +353,17 @@
     #{
         LANG on $(<) = "-x c" ;
     #}    
+    DEPENDS $(<) : [ on $(<) return $(PCH_FILE) ] ;
 }
 
+actions compile.c++ bind PCH_FILE
+{
+    "$(CONFIG_COMMAND)" $(LANG) -ftemplate-depth-128 $(OPTIONS) $(USER_OPTIONS) -D$(DEFINES) -I"$(PCH_FILE:D)" -I"$(INCLUDES)" -c -o "$(<:W)" "$(>:W)"
+}
 
-actions compile.c
+actions compile.c bind PCH_FILE
 {
-    "$(CONFIG_COMMAND)" $(LANG) $(OPTIONS) $(USER_OPTIONS) -D$(DEFINES) -I"$(INCLUDES)" -c -o "$(<)" "$(>)" 
+    "$(CONFIG_COMMAND)" $(LANG) $(OPTIONS) $(USER_OPTIONS) -D$(DEFINES) -I"$(PCH_FILE:D)" -I"$(INCLUDES)" -c -o "$(<)" "$(>)" 
 }
 
 rule compile.asm
@@ -254,36 +381,56 @@
 # since it's not supported by gcc/libc.
 class gcc-linking-generator : unix-linking-generator
 {
-    rule generated-targets ( sources + : property-set : project name ? )
+    rule run ( project name ? : property-set : sources + )
     {
-        if <runtime-link>static in [ $(property-set).raw ] 
+        #~ TODO: Replace this with the use of a target-os property.
+        local no-static-link = ;
+        if [ modules.peek : UNIX ]
         {
-            local m ;
-            if [ id ] = "gcc.link.dll"
+            switch [ modules.peek : JAMUNAME ]
             {
-                m = "on gcc, DLL can't be build with <runtime-link>static" ;
-            }         
-            if ! $(m) {                
+                case * : no-static-link = true ;
+            }
+        }
+
+        local properties = [ $(property-set).raw ] ;
+        local reason ;
+        if $(no-static-link) && <runtime-link>static in $(properties)
+        {
+            if <link>shared in $(properties)
+            {
+                reason =
+                    "On gcc, DLL can't be build with '<runtime-link>static'." ;
+            }
+            else if [ type.is-derived $(self.target-types[1]) EXE ]
+            {
                 for local s in $(sources)
                 {
                     local type = [ $(s).type ] ;
-                    if $(type) &&  [ type.is-derived $(type) SHARED_LIB ] 
+                    if $(type) &&  [ type.is-derived $(type) SHARED_LIB ]
                     {
-                        m = "on gcc, using DLLS together with the <runtime-link>static options is not possible " ;
-                    }                
-                }                
+                        reason =
+                            "On gcc, using DLLS together with the"
+                            "<runtime-link>static options is not possible " ;
+                    }
+                }
             }
-            if $(m)
-            {
-                errors.user-error $(m) :
-                  "it's suggested to use <runtime-link>static together with the <link>static" ;
-            }
-            
         }
-                        
-        return [ unix-linking-generator.generated-targets 
-            $(sources) : $(property-set) : $(project) $(name) ] ;
-    }    
+        if $(reason)
+        {
+            ECHO warning:
+                $(reason) ;
+            ECHO warning:
+                "It's suggested to use '<runtime-link>static' together"
+                "with the '<link>static'." ;
+            return ;
+        }
+        else
+        {
+            return [ unix-linking-generator.run $(project) $(name)
+                : $(property-set) : $(sources) ] ;
+        }
+    }
 }
 
 generators.register [ new gcc-linking-generator gcc.link : LIB OBJ : EXE 
@@ -507,3 +654,113 @@
         }
     }
 }
+
+local rule cpu-flags ( toolset variable : architecture : instruction-set + : values + : default ? )
+{
+    if $(default)
+    {
+        flags $(toolset) $(variable)
+            <architecture>$(architecture)/<instruction-set>
+            : $(values) ;
+    }
+    flags $(toolset) $(variable)
+        <architecture>/<instruction-set>$(instruction-set)
+        <architecture>$(architecture)/<instruction-set>$(instruction-set)
+        : $(values) ;
+}
+
+# Set architecture/instruction-set options.
+#
+# x86 and compatible
+flags gcc OPTIONS <architecture>x86/<address-model>32 : -m32 ;
+flags gcc OPTIONS <architecture>x86/<address-model>64 : -m64 ;
+cpu-flags gcc OPTIONS : x86 : i386 : -march=i386 : default ;
+cpu-flags gcc OPTIONS : x86 : i486 : -march=i486 ;
+cpu-flags gcc OPTIONS : x86 : i586 : -march=i586 ;
+cpu-flags gcc OPTIONS : x86 : i686 : -march=i686 ;
+cpu-flags gcc OPTIONS : x86 : pentium : -march=pentium ;
+cpu-flags gcc OPTIONS : x86 : pentium-mmx : -march=pentium-mmx ;
+cpu-flags gcc OPTIONS : x86 : pentiumpro : -march=pentiumpro ;
+cpu-flags gcc OPTIONS : x86 : pentium2 : -march=pentium2 ;
+cpu-flags gcc OPTIONS : x86 : pentium3 : -march=pentium3 ;
+cpu-flags gcc OPTIONS : x86 : pentium3m : -march=pentium3m ;
+cpu-flags gcc OPTIONS : x86 : pentium-m : -march=pentium-m ;
+cpu-flags gcc OPTIONS : x86 : pentium4 : -march=pentium4 ;
+cpu-flags gcc OPTIONS : x86 : pentium4m : -march=pentium4m ;
+cpu-flags gcc OPTIONS : x86 : prescott : -march=prescott ;
+cpu-flags gcc OPTIONS : x86 : nocona : -march=nocona ;
+cpu-flags gcc OPTIONS : x86 : k6 : -march=k6 ;
+cpu-flags gcc OPTIONS : x86 : k6-2 : -march=k6-2 ;
+cpu-flags gcc OPTIONS : x86 : k6-3 : -march=k6-3 ;
+cpu-flags gcc OPTIONS : x86 : athlon : -march=athlon ;
+cpu-flags gcc OPTIONS : x86 : athlon-tbird : -march=athlon-tbird ;
+cpu-flags gcc OPTIONS : x86 : athlon-4 : -march=athlon-4 ;
+cpu-flags gcc OPTIONS : x86 : athlon-xp : -march=athlon-xp ;
+cpu-flags gcc OPTIONS : x86 : athlon-mp : -march=athlon-mp ;
+##
+cpu-flags gcc OPTIONS : x86 : k8 : -march=k8 ;
+cpu-flags gcc OPTIONS : x86 : opteron : -march=opteron ;
+cpu-flags gcc OPTIONS : x86 : athlon64 : -march=athlon64 ;
+cpu-flags gcc OPTIONS : x86 : athlon-fx : -march=athlon-fx ;
+cpu-flags gcc OPTIONS : x86 : winchip-c6 : -march=winchip-c6 ;
+cpu-flags gcc OPTIONS : x86 : winchip2 : -march=winchip2 ;
+cpu-flags gcc OPTIONS : x86 : c3 : -march=c3 ;
+cpu-flags gcc OPTIONS : x86 : c3-2 : -march=c3-2 ;
+# Sparc
+flags gcc OPTIONS <architecture>sparc/<address-model>32 : -m32 ;
+flags gcc OPTIONS <architecture>sparc/<address-model>64 : -m64 ;
+cpu-flags gcc OPTIONS : sparc : c3 : -mcpu=c3 : default ;
+cpu-flags gcc OPTIONS : sparc : v7 : -mcpu=v7 ;
+cpu-flags gcc OPTIONS : sparc : cypress : -mcpu=cypress ;
+cpu-flags gcc OPTIONS : sparc : v8 : -mcpu=v8 ;
+cpu-flags gcc OPTIONS : sparc : supersparc : -mcpu=supersparc ;
+cpu-flags gcc OPTIONS : sparc : sparclite : -mcpu=sparclite ;
+cpu-flags gcc OPTIONS : sparc : hypersparc : -mcpu=hypersparc ;
+cpu-flags gcc OPTIONS : sparc : sparclite86x : -mcpu=sparclite86x ;
+cpu-flags gcc OPTIONS : sparc : f930 : -mcpu=f930 ;
+cpu-flags gcc OPTIONS : sparc : f934 : -mcpu=f934 ;
+cpu-flags gcc OPTIONS : sparc : sparclet : -mcpu=sparclet ;
+cpu-flags gcc OPTIONS : sparc : tsc701 : -mcpu=tsc701 ;
+cpu-flags gcc OPTIONS : sparc : v9 : -mcpu=v9 ;
+cpu-flags gcc OPTIONS : sparc : ultrasparc : -mcpu=ultrasparc ;
+cpu-flags gcc OPTIONS : sparc : ultrasparc3 : -mcpu=ultrasparc3 ;
+# RS/6000 & PowerPC
+flags gcc OPTIONS <architecture>power/<address-model>32 : -m32 ;
+flags gcc OPTIONS <architecture>power/<address-model>64 : -m64 ;
+flags gcc OPTIONS <architecture>power/<address-model>/<instruction-set> : -mcpu=common ;
+cpu-flags gcc OPTIONS : power : 403 : -mcpu=403 ;
+cpu-flags gcc OPTIONS : power : 505 : -mcpu=505 ;
+cpu-flags gcc OPTIONS : power : 601 : -mcpu=601 ;
+cpu-flags gcc OPTIONS : power : 602 : -mcpu=602 ;
+cpu-flags gcc OPTIONS : power : 603 : -mcpu=603 ;
+cpu-flags gcc OPTIONS : power : 603e : -mcpu=603e ;
+cpu-flags gcc OPTIONS : power : 604 : -mcpu=604 ;
+cpu-flags gcc OPTIONS : power : 604e : -mcpu=604e ;
+cpu-flags gcc OPTIONS : power : 620 : -mcpu=620 ;
+cpu-flags gcc OPTIONS : power : 630 : -mcpu=630 ;
+cpu-flags gcc OPTIONS : power : 740 : -mcpu=740 ;
+cpu-flags gcc OPTIONS : power : 7400 : -mcpu=7400 ;
+cpu-flags gcc OPTIONS : power : 7450 : -mcpu=7450 ;
+cpu-flags gcc OPTIONS : power : 750 : -mcpu=750 ;
+cpu-flags gcc OPTIONS : power : 801 : -mcpu=801 ;
+cpu-flags gcc OPTIONS : power : 821 : -mcpu=821 ;
+cpu-flags gcc OPTIONS : power : 823 : -mcpu=823 ;
+cpu-flags gcc OPTIONS : power : 860 : -mcpu=860 ;
+cpu-flags gcc OPTIONS : power : 970 : -mcpu=970 ;
+cpu-flags gcc OPTIONS : power : 8540 : -mcpu=8540 ;
+cpu-flags gcc OPTIONS : power : power : -mcpu=power ;
+cpu-flags gcc OPTIONS : power : power2 : -mcpu=power2 ;
+cpu-flags gcc OPTIONS : power : power3 : -mcpu=power3 ;
+cpu-flags gcc OPTIONS : power : power4 : -mcpu=power4 ;
+cpu-flags gcc OPTIONS : power : power5 : -mcpu=power5 ;
+cpu-flags gcc OPTIONS : power : powerpc : -mcpu=powerpc ;
+cpu-flags gcc OPTIONS : power : powerpc64 : -mcpu=powerpc64 ;
+cpu-flags gcc OPTIONS : power : rios : -mcpu=rios ;
+cpu-flags gcc OPTIONS : power : rios1 : -mcpu=rios1 ;
+cpu-flags gcc OPTIONS : power : rios2 : -mcpu=rios2 ;
+cpu-flags gcc OPTIONS : power : rsc : -mcpu=rsc ;
+cpu-flags gcc OPTIONS : power : rs64a : -mcpu=rs64 ;
+# AIX variant of RS/6000 & PowerPC
+flags gcc OPTIONS <architecture>power/<address-model>32/<target-os>aix : -maix32 ;
+flags gcc OPTIONS <architecture>power/<address-model>64/<target-os>aix : -maix64 ;
+flags gcc AROPTIONS <architecture>power/<address-model>64/<target-os>aix : "-X 64" ;

Copied: boost/trunk/tools/build/v2/tools/generate.jam (from rev 14034, boost/branches/upstream/current/tools/build/v2/tools/generate.jam)

Modified: boost/trunk/tools/build/v2/tools/gettext.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/gettext.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/gettext.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,6 @@
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  This module support GNU gettext internationalization utilities.
 # 
@@ -232,4 +231,4 @@
 IMPORT $(__name__) : update : : gettext.update ;
 
 
-                  
\ No newline at end of file
+                  

Modified: boost/trunk/tools/build/v2/tools/intel-linux.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/intel-linux.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/intel-linux.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -97,5 +97,5 @@
 # Differ from 'link' above only by -shared.
 actions link.dll bind LIBRARIES
 {
-    "$(CONFIG_COMMAND)" -L"$(LINKPATH)" -Wl,-R$(SPACE)-Wl,"$(RPATH)" -o "$(<)" -Wl,-h$(SPACE)-Wl,$(<[1]:D=) -shared "$(>)"  "$(LIBRARIES)" -l$(FINDLIBS-SA) -l$(FINDLIBS-ST) $(OPTIONS)
+    "$(CONFIG_COMMAND)" -L"$(LINKPATH)" -Wl,-R$(SPACE)-Wl,"$(RPATH)" -o "$(<)" -Wl,-soname$(SPACE)-Wl,$(<[1]:D=) -shared "$(>)"  "$(LIBRARIES)" -l$(FINDLIBS-SA) -l$(FINDLIBS-ST) $(OPTIONS)
 }

Modified: boost/trunk/tools/build/v2/tools/intel-win.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/intel-win.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/intel-win.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,6 +7,7 @@
 import feature ;
 import toolset : flags ;
 import os ;
+import errors ;
 
 # This is needed because the rule we import here depend on 'common'
 # That's nasty.
@@ -21,6 +22,8 @@
 toolset.inherit-flags intel-win : msvc ;
 toolset.inherit-rules intel-win : msvc ;
 
+toolset.add-requirements <toolset>intel-win,<runtime-link>shared:<threading>multi ;
+
 # Initializes the intel toolset for windows
 rule init ( version ? :     # the compiler version
             command * :     # the command to invoke the compiler itself
@@ -63,7 +66,8 @@
     
     flags intel-win.compile .CC $(condition) : $(setup)icl ; 
     flags intel-win.link .LD $(condition) : $(setup)xilink ; 
-    flags intel-win.archive .LD $(condition) : $(setup)xilink ;       
+    flags intel-win.archive .LD $(condition) : $(setup)xilink /lib ;       
+    flags intel-win.link .MT $(condition) : mt -nologo ;
     
     local m = [ MATCH (.).* : $(version) ] ;
     local major = $(m[1]) ;
@@ -109,6 +113,8 @@
               ;
         }
     }        
+    
+    
     if $(compatibility) && $(compatibility) != native
     {        
         C++FLAGS += /Q$(base-vc) ;
@@ -131,6 +137,22 @@
     
     flags intel-win CFLAGS $(condition) : $(C++FLAGS) ;
     
+    if ! $(compatibility)
+    {
+        # If there's no backend version, assume 7.1.
+        compatibility = vc7.1 ;
+    }
+    
+    local extract-version = [ MATCH ^vc(.*) : $(compatibility) ] ;
+    if ! $(extract-version)
+    {
+        errors.user-error "Invalid value for compatibility option:"
+          $(compatibility) ;
+    }
+    
+    msvc.configure-version-specific intel-win : $(extract-version[1]) : $(condition) ;
 }
 
 flags intel-win.link LIBRARY_OPTION <toolset>intel : "" ;
+
+

Deleted: boost/trunk/tools/build/v2/tools/kylix.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/kylix.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/kylix.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,22 +0,0 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
-
-#  Support for the Borland's Kylix command line compiler
-
-import toolset ;
-
-toolset.register kylix ;
-
-toolset.inherit kylix : borland ;
-
-COMPILER_NAME = bc++ ;
-LINKER_NAME = bc++ ;
-
-actions link bind LIBRARIES
-{
-    $(LINKER_NAME) $(OPTIONS) -q -L$(LINKPATH) -e$(<[1]) $(>) $(LIBRARIES) lib$(FINDLIBS-ST).a lib$(FINDLIBS-SA).so
-}
-
-

Modified: boost/trunk/tools/build/v2/tools/lex.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/lex.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/lex.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,6 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 import type ;
 import generators ;
@@ -31,4 +30,4 @@
 actions lex 
 {
     flex -P$(PREFIX) -o$(<) $(>)    
-}
\ No newline at end of file
+}

Modified: boost/trunk/tools/build/v2/tools/make.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/make.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/make.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,9 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Dave Abrahams 
+# Copyright 2003 Douglas Gregor 
+# Copyright 2006 Rene Rivera 
+# Copyright 2002, 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  This module defines the 'make' main target rule.
 
@@ -19,10 +21,11 @@
     import type regex virtual-target ;    
     import "class" : new ;
     
-    rule __init__ ( name : project : sources * : requirements * : default-build * )
+    rule __init__ ( name : project : sources * : requirements *
+        : default-build * : usage-requirements * )
     {     
         basic-target.__init__ $(name) : $(project) : $(sources) 
-          : $(requirements) : $(default-build) ;
+          : $(requirements) : $(default-build) : $(usage-requirements) ;
     }
         
     rule construct ( name : source-targets * : property-set )
@@ -41,7 +44,8 @@
 }
 
 # Declares the 'make' main target.
-rule make ( target-name : sources * : generating-rule + : requirements * )
+rule make ( target-name : sources * : generating-rule + : requirements *
+    : usage-requirements * )
 {
     local project = [ project.current ] ;
     
@@ -59,6 +63,7 @@
        : [ targets.main-target-sources $(sources) : $(target-name) ] 
        : [ targets.main-target-requirements $(requirements) : $(project) ] 
        : [ targets.main-target-default-build : $(project) ] 
+       : [ targets.main-target-usage-requirements $(usage-requirements) : $(project) ]
      ] ;
          
 }

Copied: boost/trunk/tools/build/v2/tools/mpi.jam (from rev 14034, boost/branches/upstream/current/tools/build/v2/tools/mpi.jam)

Modified: boost/trunk/tools/build/v2/tools/msvc.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/msvc.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/msvc.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,8 @@
 # Copyright (c) 2003 David Abrahams.
 # Copyright (c) 2005 Vladimir Prus.
 # Copyright (c) 2005 Alexey Pakhunov.
+# Copyright (c) 2006 Bojan Resnik.
+# Copyright (c) 2006 Ilya Sokolov.
 #
 # Use, modification and distribution is subject to the Boost Software
 # License Version 1.0. (See accompanying file LICENSE_1_0.txt or
@@ -45,6 +47,10 @@
 # Inherit MC flags
 toolset.inherit-flags msvc : mc ;
 
+# Dynamic runtime comes only in MT flavour.
+toolset.add-requirements <toolset>msvc,<runtime-link>shared:<threading>multi ;
+
+
 RM =  [ common.rm-command ] ;
 nl = "
 " ;
@@ -96,6 +102,10 @@
     #       - if compiler is not found in default locations, PATH will be searched.    
     : options * 
     # options can include <setup>, <compiler>, <assembler>, <linker> and <resource-compiler>
+    #
+    #   <compiler-filter>
+    #       Command to pipe the output of running the compiler. For example
+    #       to pass the output to STLfilt.
 )
 {
     if $(command)
@@ -328,6 +338,8 @@
         mc-compiler ?= mc ;
 
         manifest-tool = mt ;
+        
+        local cc-filter = [ get-values <compiler-filter> : $(options) ] ;
 
         for local i in 1 2 3
         {
@@ -343,23 +355,31 @@
                         "command: '$(command[$(i)])'" ;
                 }
         
-                flags msvc.compile .CC  $(cond) : $(command[$(i)])$(compiler) ;
+                flags msvc.compile .CC  $(cond) : $(command[$(i)])$(compiler) /Zm800 -nologo ;
                 flags msvc.compile .RC  $(cond) : $(command[$(i)])$(resource-compiler) ;
                 flags msvc.compile .ASM $(cond) : $(command[$(i)])$(assembler) ;
-                flags msvc.link    .LD  $(cond) : $(command[$(i)])$(linker) ;
-                flags msvc.archive .LD  $(cond) : $(command[$(i)])$(linker) ;
+                flags msvc.link    .LD  $(cond) : $(command[$(i)])$(linker) /NOLOGO /INCREMENTAL:NO ;
+                flags msvc.archive .LD  $(cond) : $(command[$(i)])$(linker) /lib /NOLOGO  ;
                 flags msvc.compile .IDL $(cond) : $(command[$(i)])$(idl-compiler) ;
                 flags msvc.compile .MC  $(cond) : $(command[$(i)])$(mc-compiler) ;
 
                 if ! [ os.name ] in NT
                 {
-                    flags msvc.link .MT $(cond) : $(command[$(i)])$(manifest-tool) ;
+                    flags msvc.link .MT $(cond) : $(command[$(i)])$(manifest-tool) -nologo ;
                 }
+                else
+                {
+                    flags msvc.link .MT $(cond) : $(manifest-tool) -nologo ;
+                }
+                
+                if $(cc-filter)
+                {
+                    flags msvc .CC.FILTER $(cond) : "|" $(cc-filter) ;
+                }
             }
-        }   
-
+        }
         # Set version-specific flags
-        configure-version-specific $(version) : $(condition) ;
+        configure-version-specific msvc : $(version) : $(condition) ;
     }
 }
 
@@ -380,9 +400,15 @@
 cpu-type-itanium = itanium itanium1 merced ;
 cpu-type-itanium2 = itanium2 mckinley ;
 
-
-local rule configure-version-specific ( version : condition )
+# Sets up flag definitions that are dependent on the version ot
+# compiler. 
+# - 'version' is the version of compiler in N.M format.
+# - 'condition' is the property set to be used as condition for flag
+# - 'toolset' is the toolset for which flag settings are to be defined
+#   This makes the rule reusable for other msvc-option-compatible compilers.
+rule configure-version-specific ( toolset : version : condition )
 {
+    toolset.push-checking-for-flags-module unchecked ;
     # Starting with versions 7.0, the msvc compiler have the /Zc:forScope
     # and /Zc:wchar_t options that improve C++ standard conformance, but
     # those options are off by default.
@@ -391,38 +417,54 @@
     # or if the installation path contain 7.* (this is checked above).
     if ! [ MATCH ^(6\\.) : $(version) ]
     {
-        flags msvc.compile CFLAGS $(condition) : /Zc:forScope /Zc:wchar_t ;
-        flags msvc.compile.c++ C++FLAGS $(condition) : /wd4675 ;
+        flags $(toolset).compile CFLAGS $(condition) : /Zc:forScope /Zc:wchar_t ;
+        flags $(toolset).compile.c++ C++FLAGS $(condition) : /wd4675 ;
         # disable the function is deprecated warning
         # Some version of msvc have a bug, that cause deprecation
         # warning to be emitted even with /W0
-        flags msvc.compile CFLAGS $(condition)/<warnings>off : /wd4996 ; 
+        flags $(toolset).compile CFLAGS $(condition)/<warnings>off : /wd4996 ; 
         # 64-bit compatibility warning
-        flags msvc.compile CFLAGS $(condition)/<warnings>all : /Wp64 ; 
+        flags $(toolset).compile CFLAGS $(condition)/<warnings>all : /Wp64 ; 
     }
     
     #
     # Processor-specific optimization
     #
 
-    if [ MATCH ^([67]\\.) : $(version) ]
+    if [ MATCH ^([67]) : $(version) ]
     {
         # 8.0 deprecates some of the options
-        flags msvc.compile CFLAGS $(condition)/<optimization>speed $(condition)/<optimization>space : /Ogiy /Gs ;
-        flags msvc.compile CFLAGS $(condition)/<optimization>speed : /Ot ;
-        flags msvc.compile CFLAGS $(condition)/<optimization>space : /Os ;
+        flags $(toolset).compile CFLAGS $(condition)/<optimization>speed $(condition)/<optimization>space : /Ogiy /Gs ;
+        flags $(toolset).compile CFLAGS $(condition)/<optimization>speed : /Ot ;
+        flags $(toolset).compile CFLAGS $(condition)/<optimization>space : /Os ;
 
-        flags msvc.compile CFLAGS $(condition)/$(cpu-arch-i386)/<instruction-set> : /GB ;
-        flags msvc.compile CFLAGS $(condition)/$(cpu-arch-i386)/<instruction-set>i386 : /G3 ;
-        flags msvc.compile CFLAGS $(condition)/$(cpu-arch-i386)/<instruction-set>i486 : /G4 ;
-        flags msvc.compile CFLAGS $(condition)/$(cpu-arch-i386)/<instruction-set>$(cpu-type-g5) : /G5 ;
-        flags msvc.compile CFLAGS $(condition)/$(cpu-arch-i386)/<instruction-set>$(cpu-type-g6) : /G6 ;
-        flags msvc.compile CFLAGS $(condition)/$(cpu-arch-i386)/<instruction-set>$(cpu-type-g7) : /G7 ;
+        flags $(toolset).compile CFLAGS $(condition)/$(cpu-arch-i386)/<instruction-set> : /GB ;
+        flags $(toolset).compile CFLAGS $(condition)/$(cpu-arch-i386)/<instruction-set>i386 : /G3 ;
+        flags $(toolset).compile CFLAGS $(condition)/$(cpu-arch-i386)/<instruction-set>i486 : /G4 ;
+        flags $(toolset).compile CFLAGS $(condition)/$(cpu-arch-i386)/<instruction-set>$(cpu-type-g5) : /G5 ;
+        flags $(toolset).compile CFLAGS $(condition)/$(cpu-arch-i386)/<instruction-set>$(cpu-type-g6) : /G6 ;
+        flags $(toolset).compile CFLAGS $(condition)/$(cpu-arch-i386)/<instruction-set>$(cpu-type-g7) : /G7 ;
         
         # Improve floating-point accuracy. Otherwise, some of C++ Boost's
         # "math" tests will fail.
-        flags msvc.compile CFLAGS $(condition) : /Op ;
+        flags $(toolset).compile CFLAGS $(condition) : /Op ;
+
+        # 7.1 and below have single-threaded static RTL
+        flags $(toolset).compile CFLAGS $(condition)/<runtime-debugging>off/<runtime-link>static/<threading>single : /ML ;
+        flags $(toolset).compile CFLAGS $(condition)/<runtime-debugging>on/<runtime-link>static/<threading>single : /MLd ;
     }
+    else
+    {
+        # 8.0 adds some more options
+        flags $(toolset).compile CFLAGS $(condition)/$(cpu-arch-amd64)/<instruction-set> : /favor:blend ;
+        flags $(toolset).compile CFLAGS $(condition)/$(cpu-arch-amd64)/<instruction-set>$(cpu-type-em64t) : /favor:EM64T ;
+        flags $(toolset).compile CFLAGS $(condition)/$(cpu-arch-amd64)/<instruction-set>$(cpu-type-amd64) : /favor:AMD64 ;
+
+        # 8.0 only has multi-threaded static RTL
+        flags $(toolset).compile CFLAGS $(condition)/<runtime-debugging>off/<runtime-link>static/<threading>single : /MT ;
+        flags $(toolset).compile CFLAGS $(condition)/<runtime-debugging>on/<runtime-link>static/<threading>single : /MTd ;
+    }
+    toolset.pop-checking-for-flags-module ;
 }
 
 
@@ -508,8 +550,90 @@
 generators.register-standard msvc.compile.mc : MC : H RC : <toolset>msvc ;
 generators.override msvc.compile.mc : mc.compile ;
 
-generators.register [ new pch-generator msvc.compile.pch : PCHEADER : OBJ PCH : <toolset>msvc ] ;
+# pch support
 
+feature pch-source : : free dependency ;
+
+class msvc-pch-generator : pch-generator
+{
+    import property-set ;
+
+    rule run-pch ( project name ? : property-set : sources * )
+    {        
+        # searching header and source file in the sources
+        local pch-header ;
+        local pch-source ;
+        for local s in $(sources)
+        {
+            if [ type.is-derived [ $(s).type ] H ]
+            {
+                pch-header = $(s) ;
+            }
+            else if
+                 [ type.is-derived [ $(s).type ] CPP ]
+              || [ type.is-derived [ $(s).type ] C ]
+            {
+                pch-source = $(s) ;
+            }
+        }
+        
+        if ! $(pch-header)
+        {
+            errors.user-error "can't build pch without pch-header" ;
+        }
+
+        # If we don't have PCH source, it's fine, we'll
+        # create temporary .cpp file in the action.
+
+        local generated =
+            [
+              # Passing of <pch-source> is a dirty trick,
+              # needed because non-composing generators
+              # with multiple inputs are subtly broken:
+              # https://zigzag.cs.msu.su:7813/boost.build/ticket/111
+              generator.run $(project) $(name)
+                : [
+                    property-set.create
+                      <pch-source>$(pch-source)
+                      [ $(property-set).raw ]
+                  ]
+                : $(pch-header)
+            ]
+          ;
+
+        local pch-file ;
+        for local g in $(generated)
+        {
+            if [ type.is-derived [ $(g).type ] PCH ]
+            {
+                pch-file = $(g) ;
+            }
+        }
+
+        return
+            [ 
+              property-set.create
+                <pch-header>$(pch-header)
+                <pch-file>$(pch-file)
+            ]
+            $(generated)
+          ;
+    }
+}
+
+# Note: the 'H' source type will catch both '.h' header and '.hpp' header. The latter
+# have HPP type, but HPP type is derived from H.  The type of compilation is determined
+# entirely by the destination type.
+generators.register [ new msvc-pch-generator msvc.compile.c.pch   : H :   C_PCH OBJ : <pch>on <toolset>msvc ] ;
+generators.register [ new msvc-pch-generator msvc.compile.c++.pch : H : CPP_PCH OBJ : <pch>on <toolset>msvc ] ;
+
+generators.override msvc.compile.c.pch   : pch.default-c-pch-generator ;
+generators.override msvc.compile.c++.pch : pch.default-cpp-pch-generator ;
+
+flags msvc.compile PCH_FILE <pch>on : <pch-file> ;
+flags msvc.compile PCH_SOURCE  <pch>on : <pch-source>  ;
+flags msvc.compile PCH_HEADER  <pch>on : <pch-header>  ;
+
 #
 # Declare flags and action for compilation
 #
@@ -518,10 +642,6 @@
 flags msvc.compile CFLAGS <optimization>speed : /O2 ;
 flags msvc.compile CFLAGS <optimization>space : /O1 ;
 
-flags msvc.compile CFLAGS $(cpu-arch-amd64)/<instruction-set> : /favor:blend ;
-flags msvc.compile CFLAGS $(cpu-arch-amd64)/<instruction-set>$(cpu-type-em64t) : /favor:EM64T ;
-flags msvc.compile CFLAGS $(cpu-arch-amd64)/<instruction-set>$(cpu-type-amd64) : /favor:AMD64 ;
-
 flags msvc.compile CFLAGS $(cpu-arch-ia64)/<instruction-set>$(cpu-type-itanium) : /G1 ;
 flags msvc.compile CFLAGS $(cpu-arch-ia64)/<instruction-set>$(cpu-type-itanium2) : /G2 ;
 
@@ -546,8 +666,6 @@
 flags msvc.compile CFLAGS <runtime-debugging>off/<runtime-link>shared : /MD ;
 flags msvc.compile CFLAGS <runtime-debugging>on/<runtime-link>shared : /MDd ;
 
-flags msvc.compile CFLAGS <runtime-debugging>off/<runtime-link>static/<threading>single : /ML ;
-flags msvc.compile CFLAGS <runtime-debugging>on/<runtime-link>static/<threading>single : /MLd ;
 flags msvc.compile CFLAGS <runtime-debugging>off/<runtime-link>static/<threading>multi : /MT ;
 flags msvc.compile CFLAGS <runtime-debugging>on/<runtime-link>static/<threading>multi : /MTd ;
 
@@ -560,45 +678,82 @@
 flags msvc.compile UNDEFS <undef> ;
 flags msvc.compile INCLUDES <include> ;
 
-flags msvc.compile PCH_SOURCE <pch-source> ;
-flags msvc.compile PCH_HEADER <pch>on : <pch-header> ;
-flags msvc.compile PCH_FILE <pch>on : <pch-file> ;
+rule get-rspline ( target : lang-opt )
+{
+    CC_RSPLINE on $(target) = [ on $(target) return $(lang-opt) -U$(UNDEFS) $(CFLAGS) $(C++FLAGS) $(OPTIONS) -c $(nl)-D$(DEFINES) $(nl)\"-I$(INCLUDES)\" ] ;
+}
 
+rule compile-c-c++ ( targets + : sources * )
+{
+    DEPENDS $(<[1]) : [ on $(<[1]) return $(PCH_HEADER) ] ;
+    DEPENDS $(<[1]) : [ on $(<[1]) return $(PCH_FILE) ] ;
+}
+
+actions compile-c-c++
+{
+    $(.CC) @"@($(<[1]:W).rsp:E="$(>[1]:W)" -Fo"$(<[1]:W)" -Yu"$(>[3]:D=)" -Fp"$(>[2]:W)" $(CC_RSPLINE))" $(.CC.FILTER)
+}
+
 rule compile.c ( targets + : sources * : properties * )
 {
-    DEPENDS $(<) : [ on $(<) return $(PCH_HEADER) ] ;
-    DEPENDS $(<) : [ on $(<) return $(PCH_FILE) ] ;
+    C++FLAGS on $(targets[1]) = ;
+    get-rspline $(targets) : -TC ;
+    compile-c-c++ $(<) : $(>) [ on $(<) return $(PCH_FILE) ] [ on $(<) return $(PCH_HEADER) ] ;
 }
 
 rule compile.c++ ( targets + : sources * : properties * )
 {
-    DEPENDS $(<) : [ on $(<) return $(PCH_HEADER) ] ;
-    DEPENDS $(<) : [ on $(<) return $(PCH_FILE) ] ;
+    get-rspline $(targets) : -TP ;
+    compile-c-c++ $(<) : $(>) [ on $(<) return $(PCH_FILE) ] [ on $(<) return $(PCH_HEADER) ] ;
 }
 
-rule compile.pch ( targets + : sources * : properties * )
+actions compile-c-c++-pch-s
 {
-    DEPENDS $(<) : [ on $(<) return $(PCH_SOURCE) ] ;
+    $(.CC) @"@($(<[1]:W).rsp:E="$(>[2]:W)" -Fo"$(<[2]:W)" -Yc"$(>[1]:D=)" -Yl"__bjam_pch_symbol_$(>[1]:D=)" -Fp"$(<[1]:W)" $(CC_RSPLINE))" $(.CC.FILTER)
 }
 
+# Needed only to avoid messing up Emacs syntax highlighting in
+# the messing N-quoted code below.
+quote = "\"" ;
 
-# The actions differ only by explicit selection of input language
-actions compile.c bind PCH_HEADER PCH_FILE
+actions compile-c-c++-pch
 {
-    $(.CC) /Zm800 -nologo -TC -U$(UNDEFS) $(CFLAGS) $(OPTIONS) @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)-D$(DEFINES) $(nl)"-I$(INCLUDES)")" -c -Fo"$(<[1]:W)" -Yu"$(PCH_HEADER:D=)" -Fp"$(PCH_FILE:W)"
+    $(.CC) @"@($(<[1]:W).rsp:E="$(>[2]:W)" -Fo"$(<[2]:W)" -Yc"$(>[1]:D=)" -Yl"__bjam_pch_symbol_$(>[1]:D=)" -Fp"$(<[1]:W)" $(CC_RSPLINE))" "@($(<[1]:W).cpp:E=#include $(quote)$(>[1]:D=)$(quote))" $(.CC.FILTER)
 }
 
-actions compile.c++ bind PCH_HEADER PCH_FILE
+rule compile.c.pch ( targets + : sources * : properties * )
 {
-    $(.CC) /Zm800 -nologo -TP -U$(UNDEFS) $(CFLAGS) $(C++FLAGS) $(OPTIONS) @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)-D$(DEFINES) $(nl)"-I$(INCLUDES)")" -c -Fo"$(<[1]:W)" -Yu"$(PCH_HEADER:D=)" -Fp"$(PCH_FILE:W)"
+    C++FLAGS on $(targets[1]) = ;
+    get-rspline $(targets[1]) : -TC ;
+    get-rspline $(targets[2]) : -TC ;
+    local pch-source = [ on $(<) return $(PCH_SOURCE) ] ;
+    if $(pch-source)
+    {        
+        DEPENDS $(<) : $(pch-source) ;
+        compile-c-c++-pch-s $(targets) : $(sources) $(pch-source) ;
+    }
+    else
+    {
+        compile-c-c++-pch $(targets) : $(sources) ;
+    }    
 }
 
-actions compile.pch bind PCH_SOURCE
+rule compile.c++.pch ( targets + : sources * : properties * )
 {
-    $(.CC) /Zm800 -nologo -TP -U$(UNDEFS) $(CFLAGS) $(C++FLAGS) $(OPTIONS) @"@($(<[1]:W).rsp:E=$(nl)"$(PCH_SOURCE:W)" $(nl)-D$(DEFINES) $(nl)"-I$(INCLUDES)")" -c -Fo"$(<[1]:W)" /Yc"$(>[1]:D=)" -Fp"$(<[2]:W)"
+    get-rspline $(targets[1]) : -TP ;
+    get-rspline $(targets[2]) : -TP ;
+    local pch-source = [ on $(<) return $(PCH_SOURCE) ] ;
+    if $(pch-source)
+    {        
+        DEPENDS $(<) : $(pch-source) ;
+        compile-c-c++-pch-s $(targets) : $(sources) $(pch-source) ;
+    }
+    else
+    {
+        compile-c-c++-pch $(targets) : $(sources) ;
+    }    
 }
 
-
 actions compile.rc
 {
     $(.RC) -l 0x409 -U$(UNDEFS) -D$(DEFINES) -I"$(INCLUDES)" -fo "$(<:W)" "$(>:W)"
@@ -673,7 +828,7 @@
     actions archive
     {  
         if exist "$(<[1])" DEL "$(<[1])"  
-        $(.LD) /lib /NOLOGO $(AROPTIONS) /out:"$(<[1])" @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)$(LIBRARIES_MENTIONED_BY_FILE) $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_ST:S=.lib)" $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_SA:S=.lib)")"
+        $(.LD) $(AROPTIONS) /out:"$(<[1])" @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)$(LIBRARIES_MENTIONED_BY_FILE) $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_ST:S=.lib)" $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_SA:S=.lib)")"
     }
 }
 else
@@ -681,7 +836,7 @@
     actions archive
     {  
         $(RM) "$(<[1])"
-        $(.LD) /lib /NOLOGO $(AROPTIONS) /out:"$(<[1])" @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)$(LIBRARIES_MENTIONED_BY_FILE) $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_ST:S=.lib)" $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_SA:S=.lib)")"
+        $(.LD) $(AROPTIONS) /out:"$(<[1])" @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)$(LIBRARIES_MENTIONED_BY_FILE) $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_ST:S=.lib)" $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_SA:S=.lib)")"
     }
 }
         
@@ -701,35 +856,37 @@
 {
     actions link bind DEF_FILE
     {
-        $(.LD) /NOLOGO $(LINKFLAGS) /out:"$(<[1]:W)" /INCREMENTAL:NO /LIBPATH:"$(LINKPATH:W)" $(OPTIONS) @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)$(LIBRARIES_MENTIONED_BY_FILE) $(nl)$(LIBRARIES) $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_ST:S=.lib)" $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_SA:S=.lib)")"
+        $(.LD) $(LINKFLAGS) /out:"$(<[1]:W)" /LIBPATH:"$(LINKPATH:W)" $(OPTIONS) @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)$(LIBRARIES_MENTIONED_BY_FILE) $(nl)$(LIBRARIES) $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_ST:S=.lib)" $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_SA:S=.lib)")"
+        if %ERRORLEVEL% NEQ 0 EXIT %ERRORLEVEL%
         if exist "$(<[1]).manifest" (
-            mt -nologo -manifest "$(<[1]).manifest" "-outputresource:$(<[1]);1"
+            $(.MT) -manifest "$(<[1]).manifest" "-outputresource:$(<[1]);1"
         )
-    }    
+    }
 
     actions link.dll bind DEF_FILE
     {
-        $(.LD) /NOLOGO /DLL $(LINKFLAGS) /out:"$(<[1]:W)" /INCREMENTAL:NO /IMPLIB:"$(<[2]:W)" /LIBPATH:"$(LINKPATH:W)" /def:$(DEF_FILE) $(OPTIONS) @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)$(LIBRARIES_MENTIONED_BY_FILE) $(nl)$(LIBRARIES) $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_ST:S=.lib)" $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_SA:S=.lib)")"
+        $(.LD) /DLL $(LINKFLAGS) /out:"$(<[1]:W)" /IMPLIB:"$(<[2]:W)" /LIBPATH:"$(LINKPATH:W)" /def:$(DEF_FILE) $(OPTIONS) @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)$(LIBRARIES_MENTIONED_BY_FILE) $(nl)$(LIBRARIES) $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_ST:S=.lib)" $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_SA:S=.lib)")"
+        if %ERRORLEVEL% NEQ 0 EXIT %ERRORLEVEL%
         if exist "$(<[1]).manifest" (
-            mt -nologo -manifest "$(<[1]).manifest" "-outputresource:$(<[1]);2"
+            $(.MT) -manifest "$(<[1]).manifest" "-outputresource:$(<[1]);2"
         )
-    } 
+    }
 }
 else
 {
     actions link bind DEF_FILE
     {
-        $(.LD) /NOLOGO $(LINKFLAGS) /out:"$(<[1]:W)" /INCREMENTAL:NO /LIBPATH:"$(LINKPATH:W)" $(OPTIONS) @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)$(LIBRARIES_MENTIONED_BY_FILE) $(nl)$(LIBRARIES) $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_ST:S=.lib)" $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_SA:S=.lib)")"
+        $(.LD) $(LINKFLAGS) /out:"$(<[1]:W)" /LIBPATH:"$(LINKPATH:W)" $(OPTIONS) @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)$(LIBRARIES_MENTIONED_BY_FILE) $(nl)$(LIBRARIES) $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_ST:S=.lib)" $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_SA:S=.lib)")"
         if test -e "$(<[1]).manifest"; then
-            $(.MT) -nologo -manifest "$(<[1]:W).manifest" "-outputresource:$(<[1]:W);1"
+            $(.MT) -manifest "$(<[1]:W).manifest" "-outputresource:$(<[1]:W);1"
         fi
     }
 
     actions link.dll bind DEF_FILE
     {
-        $(.LD) /NOLOGO /DLL $(LINKFLAGS) /out:"$(<[1]:W)" /INCREMENTAL:NO /IMPLIB:"$(<[2]:W)" /LIBPATH:"$(LINKPATH:W)" /def:$(DEF_FILE) $(OPTIONS) @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)$(LIBRARIES_MENTIONED_BY_FILE) $(nl)$(LIBRARIES) $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_ST:S=.lib)" $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_SA:S=.lib)")"
+        $(.LD) /DLL $(LINKFLAGS) /out:"$(<[1]:W)" /IMPLIB:"$(<[2]:W)" /LIBPATH:"$(LINKPATH:W)" /def:$(DEF_FILE) $(OPTIONS) @"@($(<[1]:W).rsp:E=$(nl)"$(>)" $(nl)$(LIBRARIES_MENTIONED_BY_FILE) $(nl)$(LIBRARIES) $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_ST:S=.lib)" $(nl)"$(LIBRARY_OPTION)$(FINDLIBS_SA:S=.lib)")"
         if test -e "$(<[1]).manifest"; then
-            $(.MT) -nologo -manifest "$(<[1]:W).manifest" "-outputresource:$(<[1]:W);2"
+            $(.MT) -manifest "$(<[1]:W).manifest" "-outputresource:$(<[1]:W);2"
         fi
     }
 }
@@ -753,6 +910,7 @@
 
 # Version aliases
 .version-alias-6 = 6.0 ;
+.version-alias-6.5 = 6.0 ;
 .version-alias-7 = 7.0 ;
 .version-alias-8 = 8.0 ;
  

Modified: boost/trunk/tools/build/v2/tools/package.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/package.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/package.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,4 +1,5 @@
 #  Copyright (c) 2005 Vladimir Prus.
+#  Copyright 2006 Rene Rivera.
 #
 #  Use, modification and distribution is subject to the Boost Software
 #  License Version 1.0. (See accompanying file LICENSE_1_0.txt or
@@ -39,18 +40,25 @@
 
 rule install ( name : requirements * : binaries * : libraries * : headers * )
 {
-    local install-source-root = [ property.select <install-source-root> 
-        : $(requirements) ] ;
     # If <install-source-root> is not specified, all headers are installed
     # to prefix/include, no matter what their relative path is. Sometimes
     # that's what needed.
-        
+    local install-source-root
+        = [ property.select <install-source-root> : $(requirements) ] ;
     requirements = [ property.change $(requirements) : <install-source-root> ] ;
     
+    #
+    local install-header-subdir
+        = [ property.select <install-header-subdir> : $(requirements) ] ;
+    install-header-subdir = /$(install-header-subdir:G=) ;
+    install-header-subdir ?= "" ;
+    requirements = [ property.change $(requirements) : <install-header-subdir> ] ;
     
-    # First, figure out all locations.
-    local prefix = [ option.get prefix : "" ] ;
-    
+    # First, figure out all locations. Use the default if no prefix option given.
+    local prefix = [ option.get prefix :
+        [ property.select <install-default-prefix> : $(requirements) ] ] ;
+    requirements = [ property.change $(requirements) : <install-default-prefix> ] ;
+    # Or some likely defaults if neither is given.
     if ! $(prefix)
     {
         if [ modules.peek : NT ] { prefix = C:\\$(name) ; }
@@ -77,7 +85,8 @@
           <install-dependencies>on <install-type>LIB 
         ;
     stage.install $(name)-headers : $(headers) : $(requirements) 
-      <location>$(include-locate) <install-source-root>$(install-source-root) ;
+      <location>$(include-locate)$(install-header-subdir)
+      <install-source-root>$(install-source-root) ;
     alias $(name) : $(name)-bin $(name)-lib $(name)-headers ;
     
     local c = [ project.current ] ;

Modified: boost/trunk/tools/build/v2/tools/pch.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/pch.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/pch.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,68 +1,97 @@
-# Copyright (c) 2005 Reece H. Dunn.
-#
-# Use, modification and distribution is subject to the Boost Software
-# License Version 1.0. (See accompanying file LICENSE_1_0.txt or
-# http://www.boost.org/LICENSE_1_0.txt)
-
-import type ;
-import feature : feature ;
-import generators ;
-
-##### Using Pre-compiled Headers (Quick Guide) #####
-#
-# Make mypch.hpp a pre-compiled header (PCH) using mypch.cpp as the source file:
-#    import cast ;
-#    pch mypch : [ cast _ pcheader : pch.hpp ] pch.cpp ;
-#
-# Enable PCHs in a target:
-#    exe hello : mypch main.cpp hello.cpp ;
-#                ^^^^^ -- mypch.hpp is a PCH
-#
-# Don't use PCHs for a specific source:
-#    obj nopch : nopch.cpp : <pch>off ;
-#
-
-type.register PCH : pch ;
-type.register PCHEADER : pcheader ;
-
-feature pch : # control precompiled header (PCH) generation
-    on  # this file has support for using PCHs (if available)
-    off # this file doesn't use PCHs
-  ;
-
-feature pch-source : : free dependency ; # mypch.cpp
-feature pch-header : : free dependency ; # mypch.h[pp]
-feature pch-file   : : free dependency ; # mypch.pch
-
-class pch-generator : generator
-{
-    import property-set ;
-
-    rule __init__ ( * : * )
-    {
-        generator.__init__ $(1) : $(2) : $(3) : $(4) : $(5) : $(6) : $(7) : $(8) : $(9) ;
-    }
-
-    rule action-class ( )
-    {
-        return compile-action ;
-    }
-
-    rule run ( project name ? : property-set : sources * )
-    {
-        local r =
-          [ generator.run $(project) $(name) :
-            [
-              property-set.create
-                <pch-source>$(sources[2]) # mypch.cpp
-                [ $(property-set).raw ]
-            ] : $(sources)
-          ] ;
-
-        return
-          [ property-set.create
-              <pch-header>$(sources[1]) # mypch.h[pp]
-              <pch-file>$(r[2])         # mypch.pch
-          ] $(r) ;
-    }
-}
+# Copyright (c) 2005 Reece H. Dunn.
+# Copyright 2006 Ilya Sokolov
+#
+# Use, modification and distribution is subject to the Boost Software
+# License Version 1.0. (See accompanying file LICENSE_1_0.txt or
+# http://www.boost.org/LICENSE_1_0.txt)
+
+##### Using Precompiled Headers (Quick Guide) #####
+#
+# Make precompiled mypch.hpp:
+#
+#    import pch ;
+#
+#    cpp-pch mypch
+#      : # sources
+#        mypch.hpp
+#      : # requiremnts
+#        <toolset>msvc:<source>mypch.cpp
+#      ;
+#
+# Add cpp-pch to sources:
+#
+#    exe hello
+#      : main.cpp hello.cpp mypch
+#      ;
+
+import "class" : new ;
+import type ;
+import feature ;
+import generators ;
+
+type.register     PCH : pch ;
+
+type.register   C_PCH : : PCH ;
+type.register CPP_PCH : : PCH ;
+
+# control precompiled header (PCH) generation
+feature.feature pch :
+    on
+    off
+  : propagated    
+  ;
+
+feature.feature pch-header : : free dependency ;
+feature.feature pch-file   : : free dependency ;
+
+# Base PCH generator. The 'run' method has the logic to
+# prevent this generator from being run unless it's used
+# in top-level PCH target.
+class pch-generator : generator
+{
+    import property-set ;
+
+    rule action-class ( )
+    {
+        return compile-action ;
+    }
+
+    rule run ( project name ? : property-set : sources + )
+    {
+        if ! $(name)
+        {
+            # Unless this generator is invoked as the top-most
+            # generator for a main target, fail. This allows using
+            # 'H' type as input type for this generator, while
+            # preventing Boost.Build to try this generator when not
+            # explicitly asked for.
+            #
+            # One bad example is msvc, where pch generator produces
+            # both PCH target and OBJ target, so if there's any
+            # header generated (like by bison, or by msidl), we'd
+            # try to use pch generator to get OBJ from that H, which
+            # is completely wrong. By restricting this generator
+            # only to pch main target, such problem is solved.
+        }
+        else
+        {
+            local r = [ run-pch $(project) $(name) 
+              : [ $(property-set).add-raw <define>BOOST_BUILD_PCH_ENABLED ]
+              : $(sources) ] ;
+            return [ generators.add-usage-requirements $(r)
+              : <define>BOOST_BUILD_PCH_ENABLED ] ;
+        }                        
+    }
+    
+    # This rule must be overridden by the derived classes.
+    rule run-pch ( project name ? : property-set : sources + )
+    {        
+    }    
+}
+
+# NOTE: requiremetns are empty, 
+# default pch generator can be applied when pch=off
+generators.register [ 
+  new dummy-generator pch.default-c-pch-generator   : :   C_PCH ] ;
+generators.register [ 
+  new dummy-generator pch.default-cpp-pch-generator : : CPP_PCH ] ;

Modified: boost/trunk/tools/build/v2/tools/python.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/python.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/python.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -21,9 +21,6 @@
 #   SHARED_LIB, not PYTHON_EXTENSION. That's because we reuse 
 #   'lib-target-class', which creates SHARED_LIB explicitly.
 
-
-
-
 import type ;
 import testing ;
 import generators ;
@@ -34,6 +31,7 @@
 import os ;
 import common ;
 import toolset : flags ;
+import regex ;
 
 # Make this module a project
 project.initialize $(__name__) ;
@@ -44,12 +42,18 @@
 # not in whatever project we were called by.
 .project = [ project.current ] ;
 
+.alias-defined = ;
+
 # Dynamic linker lib. Necessary to specify it explicitly 
 # on some platforms.
 lib dl ;  
 # This contains 'openpty' function need by python. Again, on
 # some system need to pass this to linker explicitly.
 lib util ;
+# Python uses pthread symbols.
+lib pthread ;
+# Extra library needed by phtread on some platforms.
+lib rt ;
 
 
 # Initializes the Python toolset.
@@ -90,34 +94,149 @@
         init-unix $(version) : $(root) : $(includes) : $(libraries) : $(cygwin-condition) ;
     }
     
+    if [ os.on-windows ] && ! $(.alias-defined)
+    {
+        .alias-defined = true ;
+        alias python_for_extensions : python ;
+    }
+    
+    
     project.pop-current ;
 }
 
+# Retrieves the Python interpreter
+rule get-python-interpreter ( )
+{
+  return $(PYTHON) ;
+}
+
+# Retrieves the Python version number
+rule get-python-version ( )
+{
+  return [ python-version [ get-python-interpreter ] ] ;
+}
+
+local rule python-version ( cmd )
+{
+    cmd ?= python ;
+    local version = [ SHELL $(cmd)" -c 'import sys; print sys.version'" : exit-status ] ;
+    
+    if $(version[2]) = 0
+    {
+        return [ MATCH ^([0-9]+.[0-9]+) : $(version[1]) : 1 ] ;
+    }
+    else
+    {
+        return ;
+    }
+}
+
+local rule python-interpreter ( cmd )
+{
+    local which = [ SHELL "which "$(cmd) : exit-status ] ;
+    if $(which[2]) = 0
+    {
+        return $(which[1]) ;
+    }
+    else
+    {
+        return ;
+    }
+}
+
+local rule python-root ( cmd )
+{
+    return [ MATCH (.*)/bin/[^/]* : [ SHELL "which "$(cmd) ] : 1 ] ;
+}
+
+
+local rule debug-message ( message * )
+{
+    if --debug-configuration in [ modules.peek : ARGV ]
+    {
+        ECHO notice: $(message) ;
+    }
+}
+
+# condition is a list of properties for which this python initialization applies.
 rule init-unix ( version ? : root ? : includes ? : libraries ? : condition * )
 {
-    root ?= /usr ;
-    includes ?= $(root)/include/python$(version) ;
-    libraries ?= $(root)/lib/python$(version)/config ;
+    #
+    # Autoconfiguration sequence
+    #
+    if $(version)
+    {
+        local v = [ MATCH ^([0-9]+\.[0-9]+)(.*)$ : $(version) : 1 2 ] ;
+        if ! $(v) || $(v[2])
+        {
+            ECHO "Warning: \"using python\" expects a two part (major, minor) version number; got" $(version) instead ;
+            if $(v)
+            {
+                version = $(v[1]) ;
+            }
+        }
+        debug-message looking for python $(version) ;
+    }
     
-    # Find the 'python' binary, which is used for testing.
-    # Look first in $(root)/bin, then in PATH.    
-    local interpreter = [ common.get-invocation-command 
-        python : python : : $(root)/bin : path-last ] ;
+    # if root is explicitly specified, look in its bin subdirectory
+    local bin = bin/ ;
+    bin = $(bin:R=$(root)) ; # will null out $(bin) if $(root) is empty.
     
-    if $(interpreter:D) != $(root)/bin
-    {            
-        ECHO "warning: was expecting Python interpreter in " $(root)/bin ;
-        ECHO "warning: found only in PATH:" $(interpreter) ;
-    }        
-                
-    if --debug-configuration in [ modules.peek : ARGV ]
+    if $(bin)
     {
-        ECHO "notice: Python include path is" $(includes) ;
-        ECHO "notice: Python library path is" $(libraries) ;
-        ECHO "notice: Python interpreter is" $(interpreter) ;                
+        debug-message searching for python binaries in $(bin) ;
     }
     
-    # If not specific condition is specified, set global value
+    # Form the python commands to try in order.  First look for python
+    # with the explicit version number, then without it
+    local python = python ;
+    local cmds = $(python:D=$(bin:E=""))$(version:E="") $(python:D=$(bin:E="")) ;
+
+    local interpreter ;
+    while $(cmds)
+    {
+        # pop a command
+        interpreter = $(cmds[0]) ; cmds = $(cmds[2-]) ;
+        debug-message trying Python interpreter command $(interpreter) ;
+          
+        # Check to see what version that command actually runs, if any
+        local true-version = [ python-version $(interpreter) ] ;
+        
+        if ! $(true-version)
+        {
+            debug-message $(interpreter) does not invoke a working Python interpreter ;
+        }
+        else
+        {
+            debug-message $(interpreter) invokes actual Python (major,minor) version $(true-version) ;
+            
+            # if no version was specified, assume that's OK
+            version ?= $(true-version) ;
+            
+            # if the version is a match, stop searching
+            if $(version) = $(true-version)
+            {
+                debug-message qualifying Python interpreter found ;
+                root ?= [ python-root $(interpreter) ] ;
+                cmds = ; # break
+            }
+        }
+    }
+    debug-message "Python interpreter command is" $(interpreter) ;
+    
+    includes ?= $(root)/include/python$(version) ;
+    debug-message "Python include path is" $(includes) ;
+    
+    libraries ?= $(root)/lib/python$(version)/config ;
+    debug-message "Python library path is" $(libraries) ;
+    
+    #
+    # End autoconfiguration sequence
+    #
+    
+    
+    # Set up the PYTHON variable to point at the interpreter.
+    # If no specific condition is specified, set global value
     # If condition is specified, set PYTHON on target. It will
     # override the global value.
     if ! $(condition)
@@ -129,65 +248,89 @@
         flags python.capture-output PYTHON $(condition:J=/) : $(interpreter) ;
     }   
 
+    # Provide system library dependencies for targets linking with
+    # static Python libraries.
+    #
+    # On many systems, Python uses libraries such as pthreads or
+    # libdl.  Since static libraries carry no library dependency
+    # information of their own that the linker can extract, these
+    # extra dependencies have to be given explicitly on the link line
+    # of the client.  The information about these dependencies is
+    # packaged into the "python" target below.
+
+    # Even where Python itself uses pthreads, it never allows
+    # extension modules to be entered concurrently (unless they
+    # explicitly give up the interpreter lock).  Therefore, extension
+    # modules don't need the efficiency overhead of threadsafe code as
+    # produced by <threading>multi, and we handle libpthread along
+    # with other libraries here.  Note: this optimization is based on
+    # an assumption that the compiler generates link-compatible code
+    # in both the single- and multi-threaded cases, and that system
+    # libraries don't change their ABIs either.  
+
+    # Most libraries are added to 'extra-libs'. Those that depend on
+    # the toolset are added to 'extra-libs-conditional', which will be
+    # used to form more specific target alternatives.
     
-    local extra-libs ;
-    if [ os.name ] = SOLARIS
+    local extra-libs extra-libs-conditional ;
+
+    switch [ os.name ]
     {
-        extra-libs = dl ;
+        case SOLARIS :
+        {
+            extra-libs = pthread dl ;
+            
+            # Add a librt dependency for the gcc toolset on SunOS (the
+            # sun toolset adds -lrt unconditionally). While this
+            # appears to duplicate the logic already in gcc.jam, it
+            # doesn't as long as we're not forcing <threading>multi.
+            extra-libs-conditional = <toolset>gcc:<source>rt ;
+        }
+        
+        case OSF :     
+        {
+            extra-libs = pthread ;
+            extra-libs-conditional = <toolset>gcc:<source>rt ;
+        }
+        
+        case QNX* :    
+        {
+            extra-libs =                 ;
+        }
+        
+        case HPUX :
+        {
+            extra-libs = pthread rt ;
+        }
+        
+        case * :       extra-libs = pthread dl util ;
     }
-    else if [ os.name ] = OSF || [ os.name ] = QNXTO
+    
+    if ! [ os.on-windows ]
     {
-        # Nothing.
-    }   
-    else
-    {
-        extra-libs = dl util ;
+        # On *nix, we don't want to link either Boost.Python or Python
+        # extensions to libpython, because the Python interpreter itself
+        # provides all those symbols. If we linked to libpython, we'd get
+        # duplicate symbols. So declare two targets -- one for building
+        # extensions and another for embedding
+        alias python_for_extensions
+                     :  
+                     : $(condition)
+                     :
+                     : <include>$(includes) 
+                     ;
     }
     
     
-    # On Linux, we don't want to link either Boost.Python or
-    # Python extensions to libpython, so that when extensions
-    # loaded in the interpreter, the symbols in the interpreter
-    # are used. If we linked to libpython, we'd get duplicate
-    # symbols. So declare two targets -- one for headers and another
-    # for library.   
-    alias python_for_extensions
-                 :  
-                 : $(condition)
-                 :
-                 : <include>$(includes) 
-                 ;
-    
+    # This should really be called python_for_embedding
     alias python
-                 :  $(extra-libs)
-                 : $(condition)
+                 : $(extra-libs) 
+                 : $(condition) $(extra-libs-conditional)
                  :
                  : <include>$(includes) 
                    <library-path>$(libraries)
                    <find-shared-library>python$(version)
                  ;
-    
-    # NOTES:
-    # - V1 had logic to force intel to use gcc's runtime.
-    #   Note sure why that was needed, with icc 8.0 extensions
-    #   built with intel are loaded by python without problems.
-    # - There was 'python-static-multithread' logic. Don't know
-    #   what it affected, so can't test.
-    
-    # TODO: need to figure out when the following code is needed:
-    # for builtin extensions only or in some other cases too.
-
-    
-    #    if [ modules.peek $(OS) ] = OSF
-    #    {
-    #        PYTHON_PROPERTIES += <*><*><linkflags>"-expect_unresolved 'Py*' -expect_unresolved '_Py*'" ;
-    #    }
-    #    else if [ modules.peek $(OS) ] = AIX
-    #    {
-    #        PYTHON_PROPERTIES 
-    #          += <*><*><linkflags>"-Wl,-bI:$(PYTHON_LIB_PATH)/python.exp"
-    #            <*><*><find-library>pthreads ;
-    #    }
 }
 
 rule init-mac ( version : root ? : includes ? : libraries ? )
@@ -221,6 +364,7 @@
         ECHO "notice: Python interpreter is" $(interpreter) ;        
     }
     
+    PYTHON = $(interpreter) ;
     flags python.capture-output PYTHON : $(interpreter) ;
     
     PYTHON_FRAMEWORK ?= $(root) ;
@@ -230,80 +374,67 @@
     }
     PYTHON_FRAMEWORK = $(PYTHON_FRAMEWORK:D)/Python ;
 
-    alias python_for_extensions
-      : 
-      :
-      : 
-      : <include>$(includes)
-      ;  
-    
     alias python
       :
       : <os>MACOSX <toolset>darwin
       :
       : <include>$(includes) <framework>$(PYTHON_FRAMEWORK)
       ;  
+
+    # Unlike most *nix systems, Mac OS X's linker does not permit undefined
+    # symbols when linking a shared library. So, we still need to link
+    # against the Python framework, even when building extensions. 
+    # Note that framework builds of Python always use shared libraries,
+    # so we do not need to worry about duplicate Python symbols.
+    .alias-defined = true ;
+    alias python_for_extensions : python ;
 }
 
-.alias-defined = ;
 rule init-nt ( version : root ? : includes ? : libraries ? : cygwin-condition ? )
 {
-#    PYTHON_PROPERTIES =
-#      boost-python-disable-borland
-#      select-nt-python-includes
-#      <runtime-link>dynamic
-#      <sysinclude>@boost
-#      <$(gcc-compilers)><*><define>USE_DL_IMPORT
-#      ;
-
     if ! $(cygwin-condition)
     {        
-        root ?= c:/tools/python ;
-        
+        # The name of Python library file does not have a dot between
+        # major and minor version. 
+        local PYTHON_VERSION_NODOT = [ regex.match ([0-9]+)[.]([0-9]+).* : $(version) : 1 2 ] ;
+
+        PYTHON_VERSION_NODOT = $(PYTHON_VERSION_NODOT:J="") ;
+
+        root ?= c:/python$(PYTHON_VERSION_NODOT) ;
+	          
         local PATH = [ modules.peek : PATH ] ;
         local PATH = [ modules.peek : Path ] ;        
         
+        PYTHON_INCLUDES = $(includes) ;
+        PYTHON_LIB_PATH = $(libraries) ;
+
         PYTHON_LIB_PATH ?= $(root)/libs [ GLOB $(root) : PCbuild ] ;
         
         PYTHON_INCLUDES ?= $(root)/include [ GLOB $(root) : PC ] ;
         
+        
         PYTHON_DLL ?= [ GLOB $(PATH) $(Path) : python$(PYTHON_VERSION_NODOT).dll ] ;
         PYTHON_DEBUG_DLL ?= [ GLOB $(PATH) $(Path) : python$(PYTHON_VERSION_NODOT)_d.dll ] ;
         PYTHON_IMPORT_LIB ?= [ GLOB $(PYTHON_LIB_PATH) : libpython$(PYTHON_VERSION_NODOT).* ] ;
         PYTHON_DEBUG_IMPORT_LIB ?= [ GLOB $(PYTHON_LIB_PATH) : libpython$(PYTHON_VERSION_NODOT).* ] ;        
         
-        
         local interpreter = [ common.get-invocation-command 
-            python : python : : $(root)/bin 
+            python.exe : python.exe : : $(root)/bin 
                                           $(root)
                                           $(root)/PCBuild
                                             : path-last ] ;
         
         if --debug-configuration in [ modules.peek : ARGV ]
         {
-            ECHO "notice: Python include path is" $(includes) ;
-            ECHO "notice: Python library path is" $(libraries) ;
+            ECHO "notice: Python include path is" $(PYTHON_INCLUDES) ;
+            ECHO "notice: Python library path is" $(PYTHON_LIB_PATH) ;
             ECHO "notice: Python interpreter is" $(interpreter) ;        
+            ECHO "notice: Python library name is" python$(PYTHON_VERSION_NODOT) ;
         }
         
+        PYTHON = $(interpreter) ;
         flags python.capture-output PYTHON : $(interpreter) ;
-
-                
-        # This is mingw-specific V1 code. I don't yet understand
-        # why mingw must be specially-cased.
-        #local lib = $(PYTHON_IMPORT_LIB) ;
-        #if <define>BOOST_DEBUG_PYTHON in $(properties)
-        #{
-        #    lib = $(PYTHON_DEBUG_IMPORT_LIB) ;
-        #}
-        #lib ?= $(PYTHON_DLL) ;
-        #if <define>BOOST_DEBUG_PYTHON in $(properties)
-        #{
-        #    lib ?= $(PYTHON_DEBUG_DLL) ;
-        #}
-        #properties += <library-file>$(lib) ;
-        #}
-        
+               
         properties += <library-path>$(PYTHON_LIB_PATH) ;
             
         # msvc compilers auto-find the python library
@@ -318,11 +449,6 @@
           ;
                        
         local lib = python$(PYTHON_VERSION_NODOT) ;
-        # TODO: don't support BOOST_DEBUG_PYTHON yet.        
-        #    if <define>BOOST_DEBUG_PYTHON in $(properties)
-        #    {
-        #            lib = python$(PYTHON_VERSION_NODOT)_d ;
-        #    }
         
         alias python
           :
@@ -330,7 +456,7 @@
           :
           : <library-path>$(PYTHON_LIB_PATH)    
             <include>$(PYTHON_INCLUDES)
-            <find-library>$(lib) ;                
+            <find-shared-library>$(lib) ;                
     }
     else
     {        
@@ -351,19 +477,12 @@
         CYGWIN_PYTHON_DEBUG_LIB_PATH ?= $(CYGWIN_PYTHON_DEBUG_ROOT)/lib/python$(CYGWIN_PYTHON_DEBUG_VERSION)/config ;        
         
         local properties ;
-        # TODO: don't support BOOST_DEBUG_PYTHON yet.                
-        #if <define>BOOST_DEBUG_PYTHON in $(properties)
-        #{
-        #    properties += <library-path>$(CYGWIN_PYTHON_DEBUG_LIB_PATH) <find-library>python$(CYGWIN_PYTHON_DEBUG_VERSION).dll ;
-        #}
-        #else
-        #{
+
         properties += <library-path>$(CYGWIN_PYTHON_LIB_PATH) 
-                      <find-library>python$(CYGWIN_PYTHON_VERSION).dll ;
+                      <find-shared-library>python$(CYGWIN_PYTHON_VERSION).dll ;
         
         properties += <include>$(root)/include/python$(version) ;          
           
-        #}
         alias python
           :
           : $(cygwin-condition)
@@ -371,12 +490,6 @@
           : $(properties)
           ;        
     }    
-    
-    if ! $(.alias-defined)
-    {
-        .alias-defined = true ;
-        alias python_for_extensions : python ;
-    }    
 }
 
 
@@ -386,13 +499,14 @@
 }
         
 type.register PYTHON_EXTENSION : : SHARED_LIB ;
+
 # We can't give "dll" suffix to PYTHON_EXTENSION, because
 # we would not know what "a.dll" is: python extenstion or
 # ordinary library. Therefore, we specify only suffixes
 # used for generation of targets.
 type.set-generated-target-suffix PYTHON_EXTENSION : : so ;
-type.set-generated-target-suffix PYTHON_EXTENSION : <os>NT : dll ;
-type.set-generated-target-suffix PYTHON_EXTENSION : <os>CYGWIN : so ;
+type.set-generated-target-suffix PYTHON_EXTENSION : <os>NT : pyd ;
+type.set-generated-target-suffix PYTHON_EXTENSION : <os>CYGWIN : dll ;
 
 # Unset 'lib' prefix for PYTHON_EXTENSION
 type.set-generated-target-prefix PYTHON_EXTENSION : : "" ;
@@ -401,35 +515,7 @@
                         usage-requirements * )
 {
     requirements += <use>/python//python_for_extensions ;
-        
-    # TODO: handle the following V1 code
-    #if $(OS) = MACOSX && $(toolset) = darwin
-    #{
-    #    if <target-type>PYD in $(properties)
-    #    {
-    #        properties += <link-format>bundle ;
-    #    }
-    #    properties += <framework>$(PYTHON_FRAMEWORK) ;
-    #}    
-               
-#        <metrowerks><*><cxxflags>"-inline deferred" 
-#      <cwpro8><*><cxxflags>"-inline deferred"  # added for internal testing purposes
-#        <cxx><*><sysinclude>@boost/boost/compatibility/cpp_c_headers
-#         <define>BOOST_PYTHON_DYNAMIC_LIB
-    
-    
-#    PYTHON_PROPERTIES += 
-#        <sysinclude>@boost
-#          <stlport-iostream>on
-#            select-python-library
-    
-#      boost-python-disable-borland
-#      select-nt-python-includes
-#      <runtime-link>dynamic
-#      <sysinclude>@boost
-#      <$(gcc-compilers)><*><define>USE_DL_IMPORT
-#          <sysinclude>$(PYTHON_INCLUDES)
-            
+                    
     local project = [ project.current ] ;
 
     
@@ -462,11 +548,21 @@
     rule run ( project name ? : property-set : sources * : multiple ? )
     {       
         local python ;
+        local other-pythons ;
         for local s in $(sources)
         {
             if [ $(s).type ] = PY
             {
-                python = $(s) ;
+                if ! $(python)
+                {
+                    # First Python source ends up on command line.
+                    python = $(s) ;
+                }
+                else
+                {
+                    # Other Python sources become dependencies.
+                    other-pythons += $(s) ;
+                }                
             }
         }
         
@@ -512,7 +608,8 @@
             }
         }
 
-            
+        property-set = [ $(property-set).add-raw <dependency>$(other-pythons) ] ;
+        
         result = [ construct-result $(python) $(extensions) $(new-sources) 
           : $(project) $(name) : $(property-set) ] ;        
     }    
@@ -525,10 +622,23 @@
   : RUN_PYD_OUTPUT : RUN_PYD ;
 
 
+# The flag settings on testing.capture-output do not
+# apply to python.capture output at the moment.
+# Redo this explicitly.
+toolset.flags python.capture-output ARGS <testing.arg> ;
 rule capture-output ( target : sources * : properties * )
 {
+    # Setup up proper DLL search path.
+    # Here, $(sources[1]) is python module and $(sources[2]) is
+    # DLL. Only $(sources[1]) is passed to testing.capture-output,
+    # so RUN_PATH variable on $(sources[2]) is not consulted. Move it
+    # over explicitly.
+    RUN_PATH on $(sources[1]) = [ on $(sources[2]) return $(RUN_PATH) ] ;
     PYTHONPATH = [ on $(sources[2]) return $(LOCATE) ] ;
-    testing.capture-output $(target) : $(sources[1]) : $(properties) ;
+    # After test is run, we remove the Python module, but not the Python
+    # script.
+    testing.capture-output $(target) : $(sources[1]) : $(properties) 
+      : $(sources[2]) ;
     local c = [ common.prepend-path-variable-command PYTHONPATH : $(PYTHONPATH) ] ;
     LAUNCHER on $(target) = $(c) [ on $(target) return $(PYTHON) ] ;
 }

Modified: boost/trunk/tools/build/v2/tools/qcc.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/qcc.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/qcc.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -58,7 +58,7 @@
 
 
 # Declare flags for compilation
-flags qcc.compile OPTIONS <debug-symbols>on : -gstabs+ ;
+flags qcc.compile OPTIONS <debug-symbols>on : -g ;
 
 # Declare flags and action for compilation
 flags qcc.compile OPTIONS <optimization>off : -O0 ;
@@ -85,7 +85,7 @@
 
 actions compile.c++
 {
-    "$(CONFIG_COMMAND)" -Wc,-ftemplate-depth-100 $(OPTIONS) -D$(DEFINES) -I"$(INCLUDES)" -c -o "$(<)" "$(>)" 
+    "$(CONFIG_COMMAND)" -Wc,-ftemplate-depth-128 $(OPTIONS) -D$(DEFINES) -I"$(INCLUDES)" -c -o "$(<)" "$(>)" 
 }
 
 actions compile.c
@@ -148,7 +148,7 @@
 
 # Declare flags for linking
 # First, the common flags
-flags qcc.link OPTIONS <debug-symbols>on : -gstabs+ ;
+flags qcc.link OPTIONS <debug-symbols>on : -g ;
 flags qcc.link OPTIONS <profiling>on : -p ;
 flags qcc.link OPTIONS <linkflags> ;
 flags qcc.link LINKPATH <library-path> ;

Modified: boost/trunk/tools/build/v2/tools/qt3.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/qt3.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/qt3.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,6 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  Support for the Qt GUI library version 3
 #  (http://www.trolltech.com/products/qt3/index.html).

Modified: boost/trunk/tools/build/v2/tools/qt4.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/qt4.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/qt4.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -47,6 +47,24 @@
 import os ;
 import virtual-target ;
 
+# Qt3Support control feature
+#
+# Qt4 configure defaults to build Qt4 libraries with Qt3Support.
+# The autodetection is missing, so we default to disable Qt3Support.
+# This prevents the user from inadvertedly using a deprecated API.
+#
+# The Qt3Support library can be activated by adding
+# "<qt3support>on" to requirements
+# 
+# Use "<qt3support>on:<define>QT3_SUPPORT_WARNINGS"
+# to get warnings about deprecated Qt3 support funtions and classes.
+# Files ported by the "qt3to4" conversion tool contain _tons_ of 
+# warnings, so this define is not set as default. 
+#
+# Todo: Detect Qt3Support from Qt's configure data.
+#       Or add more auto-configuration (like python).
+feature.feature qt3support : off on : propagated link-incompatible ;
+
 project.initialize $(__name__) ;
 project qt ;
 
@@ -96,7 +114,7 @@
         if [ glob $(.prefix)/Jamroot ]
         {
             # Import all Qt Modules
-            local all-libraries = QtCore QtGui QtNetwork QtXml QtSql QtSvg QtOpenGL Qt3Support QtTest QtAssistantClient QtUiTools ;
+            local all-libraries = QtCore QtGui QtNetwork QtXml QtSql QtSvg QtOpenGL Qt3Support QtTest QtAssistantClient QtDesigner QtUiTools QtDBus ;
             for local l in $(all-libraries) 
             {
                 alias $(l) 
@@ -126,20 +144,38 @@
                 # Also, on NT we must link against qtmain library (for WinMain)
                 suffix_version = "4" ;
                 suffix_debug = "d" ;
-                lib qtmain : : <name>qtmain$(suffix_debug) <variant>debug ;
-                lib qtmain : : <name>qtmain <variant>release ;
+                lib qtmain 
+                    : # sources
+                    : # requirements
+                      <name>qtmain$(suffix_debug)
+                      <variant>debug
+                    ;
+
+                lib qtmain 
+                    : # sources 
+                    : # requirements
+                        <name>qtmain  
+                    ;
                 main = qtmain ;
             } 
-            else 
+            else if [ os.name ] = MACOSX
             {
-                # On X11, debug versions of libs have "_debug" suffix
+                # On MacOS X, both debug and release libraries are available.
                 suffix_version = "" ;
                 suffix_debug = "_debug" ;
             }
+            else 
+            {
+                # Since Qt-4.2, debug versions on unix have to be built separately 
+                # and therefore have no suffix. 
+                suffix_version = "" ;
+                suffix_debug = "" ;
+            }
             
             lib QtCore : $(main)
-                : <name>QtCore$(suffix_version) <variant>release
-                :
+                : # requirements
+                  <name>QtCore$(suffix_version) 
+                : # default-build
                 : # usage-requirements
                   <define>QT_CORE_LIB
                   <define>QT_NO_DEBUG
@@ -147,8 +183,10 @@
                   $(usage-requirements)
                 ;
             lib QtCore : $(main)
-                : <name>QtCore$(suffix_debug)$(suffix_version) <variant>debug
-                :
+                : # requirements
+                  <name>QtCore$(suffix_debug)$(suffix_version)
+                  <variant>debug
+                : # default-build
                 : # usage-requirements
                   <define>QT_CORE_LIB
                   <include>$(.prefix)/include/QtCore 
@@ -156,8 +194,9 @@
                 ;
             
             lib QtGui : QtCore
-                : <name>QtGui$(suffix_version) <variant>release
-                :
+                : # requirements
+                  <name>QtGui$(suffix_version) 
+                : # default-build
                 : # usage-requirements
                   <define>QT_GUI_LIB
                   <include>$(.prefix)/include/QtGui 
@@ -165,8 +204,10 @@
                 ;
             
             lib QtGui : QtCore
-                : <name>QtGui$(suffix_debug)$(suffix_version) <variant>debug
-                :
+                : # requirements
+                  <name>QtGui$(suffix_debug)$(suffix_version)
+                  <variant>debug
+                : # default-build
                 : # usage-requirements
                   <define>QT_GUI_LIB
                   <include>$(.prefix)/include/QtGui 
@@ -174,78 +215,100 @@
                 ;
             
             lib QtNetwork : QtCore
-                : <name>QtNetwork$(suffix_version) <variant>release
-                :
+                : # requirements
+                  <name>QtNetwork$(suffix_version) 
+                : # default-build
                 : # usage-requirements
                   <define>QT_NETWORK_LIB
                   <include>$(.prefix)/include/QtNetwork  
                 ;
             lib QtNetwork : QtCore
-                : <name>QtNetwork$(suffix_debug)$(suffix_version) <variant>debug
-                :
+                : # requirements
+                  <name>QtNetwork$(suffix_debug)$(suffix_version)
+                  <variant>debug
+                : # default-build
                 : # usage-requirements
                   <define>QT_NETWORK_LIB
                   <include>$(.prefix)/include/QtNetwork  
                 ;
             
             lib QtSql : QtCore
-                : <name>QtSql$(suffix_version) <variant>release
-                :
+                : # requirements
+                  <name>QtSql$(suffix_version) 
+                : # default-build
                 : # usage-requirements
                   <define>QT_SQL_LIB
                   <include>$(.prefix)/include/QtSql 
                 ;
             lib QtSql : QtCore
-                : <name>QtSql$(suffix_debug)$(suffix_version) <variant>debug
-                :
+                : # requirements
+                  <name>QtSql$(suffix_debug)$(suffix_version)
+                  <variant>debug
+                : # default-build
                 : # usage-requirements
                   <define>QT_SQL_LIB
                   <include>$(.prefix)/include/QtSql 
                 ;
             
             lib QtXml : QtCore
-                : <name>QtXml$(suffix_version) <variant>release
-                :
+                : # requirements
+                  <name>QtXml$(suffix_version) 
+                : # default-build
                 : # usage-requirements
                   <define>QT_XML_LIB
                   <include>$(.prefix)/include/QtXml 
                 ;
             lib QtXml : QtCore
-                : <name>QtXml$(suffix_debug)$(suffix_version) <variant>debug
-                :
+                : # requirements
+                  <name>QtXml$(suffix_debug)$(suffix_version)
+                  <variant>debug
+                : # default-build
                 : # usage-requirements
                   <define>QT_XML_LIB
                   <include>$(.prefix)/include/QtXml 
                 ;
             
             lib Qt3Support : QtGui QtNetwork QtXml QtSql
-                : <name>Qt3Support$(suffix_version) <variant>release
-                :
+                : # requirements
+                  <name>Qt3Support$(suffix_version)
+                  <qt3support>on
+                : # default-build
                 : # usage-requirements
                   <define>QT_QT3SUPPORT_LIB
                   <define>QT3_SUPPORT
                   <include>$(.prefix)/include/Qt3Support 
                 ;
+ 
             lib Qt3Support : QtGui QtNetwork QtXml QtSql
-                : <name>Qt3Support$(suffix_debug)$(suffix_version) <variant>debug
-                :
+                : # requirements
+                  <name>Qt3Support$(suffix_debug)$(suffix_version)
+                  <qt3support>on
+                  <variant>debug
+                : # default-build
                 : # usage-requirements
                   <define>QT_QT3SUPPORT_LIB
                   <define>QT3_SUPPORT
                   <include>$(.prefix)/include/Qt3Support 
                 ;
+
+            # Dummy target to enable "<qt3support>off" and "<library>/qt//Qt3Support" at the same time.
+            # This enables quick switching from one to the other for test/porting purposes.        
+            alias Qt3Support : : <qt3support>off ;
             
             # OpenGl Support
             lib QtOpenGL : QtGui
-                : <name>QtOpenGL$(suffix_version) <variant>release
-                :
+                : # requirements
+                  <name>QtOpenGL$(suffix_version) 
+                : # default-build
                 : # usage-requirements
                   <define>QT_OPENGL_LIB
                   <include>$(.prefix)/include/QtOpenGL 
                 ;
             lib QtOpenGL : QtGui
-                : <name>QtOpenGL$(suffix_debug)$(suffix_version) <variant>debug
-                :
+                : # requirements
+                  <name>QtOpenGL$(suffix_debug)$(suffix_version)
+                  <variant>debug
+                : # default-build
                 : # usage-requirements
                   <define>QT_OPENGL_LIB
                   <include>$(.prefix)/include/QtOpenGL 
@@ -253,15 +316,18 @@
             
             # SVG-Support (Qt 4.1)
             lib QtSvg : QtXml QtOpenGL
-                : <name>QtSvg$(suffix_version) <variant>release
-                :
+                : # requirements
+                  <name>QtSvg$(suffix_version) 
+                : # default-build
                 : # usage-requirements
                   <define>QT_SVG_LIB
                   <include>$(.prefix)/include/QtSvg 
                 ;
             lib QtSvg : QtXml QtOpenGL
-                : <name>QtSvg$(suffix_debug)$(suffix_version) <variant>debug
-                :
+                : # requirements
+                  <name>QtSvg$(suffix_debug)$(suffix_version)
+                  <variant>debug
+                : # default-build
                 : # usage-requirements 
                   <define>QT_SVG_LIB
                   <include>$(.prefix)/include/QtSvg 
@@ -269,45 +335,89 @@
             
             # Test-Support (Qt 4.1)
             lib QtTest : QtCore
-                : <name>QtTest$(suffix_version) <variant>release
-                :
+                : # requirements
+                  <name>QtTest$(suffix_version) 
+                : # default-build
                 : # usage-requirements
                   <include>$(.prefix)/include/QtTest 
                 ;
             lib QtTest : QtCore
-                : <name>QtTest$(suffix_debug)$(suffix_version) <variant>debug
-                :
+                : # requirements
+                  <name>QtTest$(suffix_debug)$(suffix_version)
+                  <variant>debug 
+                : # default-build
                 : # usage-requirements
                   <include>$(.prefix)/include/QtTest 
                 ;
             
             # AssistantClient Support
             lib QtAssistantClient : QtGui
-                : <name>QtAssistantClient$(suffix_version) <variant>release
-                :
+                : # requirements
+                  <name>QtAssistantClient$(suffix_version) 
+                : # default-build
                 : # usage-requirements
-                  <include>$(.prefix)/include/QtAssistantClient 
+                  <include>$(.prefix)/include/QtAssistant
                 ;
             lib QtAssistantClient : QtGui
-                : <name>QtAssistantClient$(suffix_debug)$(suffix_version) <variant>debug
-                :
+                : # requirements
+                  <name>QtAssistantClient$(suffix_debug)$(suffix_version) 
+                  <variant>debug 
+                : # default-build
                 : # usage-requirements
-                  <include>$(.prefix)/include/QtAssistantClient 
+                  <include>$(.prefix)/include/QtAssistant
                 ;
             
+            # Qt designer library
+            lib QtDesigner : QtGui QtXml
+                : # requirements
+                  <name>QtDesigner$(suffix_version) 
+                : # default-build  
+                : # usage-requirements
+                  <include>$(.prefix)/include/QtDesigner
+                ;
+
+            lib QtDesigner : QtGui QtXml
+                : # requirements
+                  <name>QtDesigner$(suffix_debug)$(suffix_version) 
+                  <variant>debug 
+                : # default-build  
+                : # usage-requirements
+                  <include>$(.prefix)/include/QtDesigner
+                ;
+
             # Support for dynamic Widgets (Qt 4.1)
             lib QtUiTools : QtGui QtXml
-                : <name>QtUiTools$(suffix_version) <variant>release
-                :
+                : # requirements 
+                  <name>QtUiTools
+                : # default-build
                 : # usage-requirements
                   <include>$(.prefix)/include/QtUiTools 
                 ;
             lib QtUiTools : QtGui QtXml
-                : <name>QtUiTools$(suffix_debug)$(suffix_version) <variant>debug
-                :   
+                : # requirements
+                  <name>QtUiTools$(suffix_debug) 
+                  <variant>debug 
+                : # default-build  
                 : # usage-requirements
                   <include>$(.prefix)/include/QtUiTools 
                 ;
+
+            # DBus-Support (Qt 4.2)
+            lib QtDBus : QtXml
+                : # requirements
+                  <name>QtDBus$(suffix_version) 
+                : # default-build
+                : # usage-requirements
+                  <include>$(.prefix)/include/QtDBus 
+                ;
+            lib QtDBus : QtXml
+                : # requirements
+                  <name>QtDBus$(suffix_debug)$(suffix_version) 
+                  <variant>debug 
+                : # default-build
+                : # usage-requirements
+                  <include>$(.prefix)/include/QtDBus 
+                ;
         }
     }
     

Modified: boost/trunk/tools/build/v2/tools/quickbook.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/quickbook.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/quickbook.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,7 @@
 #
 #   Copyright (c) 2005 João Abecasis
 #   Copyright (c) 2005 Vladimir Prus
+#   Copyright (c) 2006 Rene Rivera
 #
 #   Distributed under the Boost Software License, Version 1.0. (See
 #   accompanying file LICENSE_1_0.txt or copy at
@@ -109,6 +110,8 @@
 import toolset ;
 import type ;
 import scanner ;
+import project ;
+import targets ;
 
 # The one and only QUICKBOOK type!
 type.register QUICKBOOK : qbk ;
@@ -296,3 +299,16 @@
     $(QB-COMMAND) --output-file=$(1) $(2)  
 }
 
+# Declare a main target to convert a quickbook source into a boostbook
+# XML file.
+rule to-boostbook ( target-name : sources * : requirements * : default-build * )
+{ 
+  local project = [ project.current ] ;
+    
+  targets.main-target-alternative 
+    [ new typed-target $(target-name) : $(project) : XML
+        : [ targets.main-target-sources $(sources) : $(target-name) ] 
+        : [ targets.main-target-requirements $(requirements) : $(project) ]
+        : [ targets.main-target-default-build $(default-build) : $(project) ] 
+    ] ;
+}

Modified: boost/trunk/tools/build/v2/tools/rc.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/rc.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/rc.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -47,6 +47,8 @@
     {
         flags rc.compile.resource .RC $(condition) : $(command) ;
         flags rc.compile.resource .RC_TYPE $(condition) : $(rc-type:L) ;
+        flags rc.compile.resource DEFINES <define> ;
+        flags rc.compile.resource INCLUDES <include> ;
         if $(.debug-configuration)
         {
             ECHO notice: using rc compiler :: $(condition) :: $(command) ;

Modified: boost/trunk/tools/build/v2/tools/stage.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/stage.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/stage.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,8 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Dave Abrahams 
+# Copyright 2005, 2006 Rene Rivera 
+# Copyright 2002, 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  This module defines the 'install' rule, used to copy a set of targets to
 #  a single location
@@ -23,6 +24,9 @@
 feature.feature <install-dependencies> : off on : incidental ;
 feature.feature <install-type> : : free incidental ;
 feature.feature <install-source-root> : : free path  ;
+# If 'on', version symblinks for shared libraries won't be created
+# This feature has effect only on Unix.
+feature.feature <install-no-version-symlinks> : on : optional incidental ;
 feature.feature <so-version> : : free incidental ;
 
 class install-target-class : basic-target
@@ -94,6 +98,9 @@
         local d = [ $(build-property-set).get <location> ] ;
         ps-raw += $(d:G=<location>) ;
         
+        local ns = [ $(build-property-set).get <install-no-version-symlinks> ] ;
+        ps-raw += $(ns:G=<install-no-version-symlinks>) ;
+        
         local d = [ $(build-property-set).get <install-source-root> ] ;
         # Make the path absolute: we'll use it to compute relative
         # paths and making the path absolute will help.
@@ -150,7 +157,7 @@
                 else
                 {
                     local targets = [ generators.construct $(self.project) $(name) : 
-                      INSTALLED_$(t) : $(new-properties) : $(i) : * ] ;
+                      INSTALLED_$(t) : $(new-properties) : $(i) ] ;
                     staged-targets += $(targets[2-]) ;                                
                 }                                                
             }
@@ -286,11 +293,19 @@
         # path. The 'source-root' is already absolute, see the
         # 'adjust-properties' method above.
         path = [ path.root $(path) [ path.pwd ] ] ;
-
-        relative = [ path.relative-to $(source-root) $(path) ] ;
         
-        targets = [ new file-target $(name:D=$(relative)) exact : [ $(source).type ] 
+        relative = [ path.relative-to $(source-root) $(path) ] ;        
+        # Note: using $(name:D=$(relative)) might be faster
+        # here, but then we need to explicitly check that
+        # relative is not ".", otherwise we might get paths like
+        #
+        #   <prefix>/boost/.
+        #
+        # try to create it, and mkdir will obviously fail.
+        name = [ path.root $(name:D=) $(relative) ] ;                      
+        targets = [ new file-target $(name) exact : [ $(source).type ] 
           : $(project) : $(new-a) ] ;
+                
     }        
     else
     {
@@ -416,12 +431,28 @@
               : [ $(copied).name ] ] ;
             if $(m)
             {
-                result += [ stage.symlink $(m[1]).$(m[2]) : $(project)
-                  : $(copied) : $(property-set) ] ;
-                result += [ stage.symlink $(m[1]).$(m[2]).$(m[3])  : $(project)
-                  : $(copied) : $(property-set) ] ;
+                # Symlink without version at all is used to make
+                # -lsome_library work.
+                result += [ stage.symlink $(m[1]) : $(project)
+                  : $(copied) : $(property-set) ] ;                
+                
+                # Symlinks of some libfoo.N and libfoo.N.M are used
+                # so that library can found at runtime, if libfoo.N.M.X
+                # has soname of libfoo.N. That happens when the library
+                # makes some binary compatibility guarantees. If not,
+                # it's possible to skip those symlinks.
+                local suppress = 
+                  [ $(property-set).get <install-no-version-symlinks> ] ;
+                
+                if $(suppress) != "on"
+                {                    
+                    result += [ stage.symlink $(m[1]).$(m[2]) : $(project)
+                      : $(copied) : $(property-set) ] ;
+                    result += [ stage.symlink $(m[1]).$(m[2]).$(m[3])  : $(project)
+                      : $(copied) : $(property-set) ] ;
+                }                
             }
-                                    
+                                                
             return $(result) ;
         }                
     }    
@@ -460,95 +491,3 @@
 
 IMPORT $(__name__) : install : : install ;
 IMPORT $(__name__) : install : : stage ;
-
-rule add-variant-and-compiler ( name : type ? : property-set )
-{
-    return [ rename $(name) : $(type) : $(property-set) ] ;
-}
-
-rule add-variant ( name : type ? : property-set )
-{
-    return [ rename $(name) : $(type) : $(property-set) : unversioned ] ;
-}
-
-rule rename ( name : type ? : property-set : unversioned ? )
-{    
-    if [ type.is-derived $(type) LIB ]
-    {            
-        local properties = [ $(property-set).raw ] ;
-    
-        local tags = ;
-    
-        local thread-tag ;
-        if <threading>multi in $(properties) { thread-tag = mt ; }
-        
-        local runtime-tag = ;
-        if <runtime-link>static in $(properties) { runtime-tag += s ; }
-        if <runtime-debugging>on in $(properties) { runtime-tag += g ; }
-        
-        if <variant>debug-python in $(properties) { runtime-tag += y ; }
-        if <variant>debug in $(properties) { runtime-tag += d ; }
-        if <stdlib>stlport in $(properties) { runtime-tag += p ; }
-        if <stdlib-stlport:iostream>hostios in $(properties) { runtime-tag += n ; }
-        
-        local toolset-tag = ;
-        # 'unversioned' should be a parameter.
-        if ! $(unversioned)
-        {
-            switch [ $(property-set).get <toolset> ]
-            {
-                case borland* : toolset-tag += bcb ;
-                case como* : toolset-tag += como ;
-                case cw : toolset-tag += cw ;
-                case darwin* : toolset-tag += ;
-                case edg* : toolset-tag += edg ;
-                case gcc* : toolset-tag += gcc ;
-                case intel-linux* : toolset-tag += il ;
-                case intel-win* : toolset-tag += iw ;
-                case kcc* : toolset-tag += kcc ;
-                case kylix* : toolset-tag += bck ;
-                #case metrowerks* : toolset-tag += cw ;
-                #case mingw* : toolset-tag += mgw ;
-                case mipspro* : toolset-tag += mp ;
-                case msvc* : toolset-tag += vc ;
-                case sun* : toolset-tag += sw ;
-                case tru64cxx* : toolset-tag += tru ;
-                case vacpp* : toolset-tag += xlc ;
-            }
-            local version = [ MATCH "<toolset.*version>([0123456789]+)[.]([0123456789]*)" : $(properties) ] ;
-            toolset-tag += $(version) ;
-        }
-
-        # Note yet clear if this should be added on Linux (where we have
-        # version in soname) and how it should be done on Windows.
-        #local version-tag = ;
-        #if ! $(gUNVERSIONED_VARIANT_TAG)
-        #{
-        #    local version-number = [ get-values <version> : $(properties) ] ;
-        #    version-number ?= $(BOOST_VERSION) ;
-        #    version-tag = [ MATCH "^([^.]+)[.]([^.]+)" : $(version-number[1]) ] ;
-        #    version-tag = $(version-tag:J="_") ;
-        #}
-    
-        tags += $(toolset-tag:J=) ;
-        tags += $(thread-tag:J=) ;
-        tags += $(runtime-tag:J=) ;
-        #tags += $(version-tag) ;
-    
-        local result ;
-        
-        if $(tags)
-        {
-            result = $(name)-$(tags:J=-) ;
-        }
-        else
-        {
-            result = $(name) ;
-        }
-        return [ virtual-target.add-prefix-and-suffix $(result) : $(type) 
-          : $(property-set) ] ;
-    }    
-}
-
-
-

Modified: boost/trunk/tools/build/v2/tools/stlport.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/stlport.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/stlport.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,11 +1,8 @@
-# (C) Copyright Gennadiy Rozental 2002.
-# (C) Copyright Vladimir Prus 2003.
-# (C) Copyright Rene Rivera 2006.
-# Permission to copy, use,
-# modify, sell and distribute this software is granted provided this
-# copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as
-# to its suitability for any purpose.
+# Copyright Gennadiy Rozental
+# Copyright 2006 Rene Rivera 
+# Copyright 2003, 2004, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # The STLPort is usable by means of 'stdlib' feature. When
 # stdlib=stlport is specified, default version of STLPort will be used,
@@ -88,37 +85,11 @@
         self.headers = $(headers) ;
         self.libraries = $(libraries) ;
         self.version = $(version) ;
-        self.version.5 = [ MATCH "^(5[.][^.]+).*" : $(version) ] ;
-    }
-
-    rule match ( property-set )
-    {
-        # Override the rule which detects if this basic-target is
-        # suitable for the specified property set.
-        # Basically, just checks that requested version is equal to
-        # self.version. We could have added stlport-$(version) to
-        # requirements, but then stlport-$(version) would show in
-        # the common properties, causing recursive building of ourselfs.
+        self.version.5 = [ MATCH "^(5[.][0123456789]+).*" : $(version) ] ;
         
-        local matched ;
-        if [ $(property-set).get <stdlib-stlport:version> ] = $(self.version)
-        {
-            if $(self.version.5)
-            {
-                # And for STLport 5.x multi-threading is required.
-                if [ $(property-set).get <threading> ] = multi
-                {
-                    matched = stlport-$(self.version) ;
-                }
-            }
-            else
-            {
-                matched = stlport-$(self.version) ;
-            }
-        }
-        matched ?= no-match ;
-        
-        return $(matched) ;
+        local requirements ;
+        requirements += <stdlib-stlport:version>$(self.version) ;
+        self.requirements = [ property-set.create $(requirements) ] ;
     }
 
     rule generate ( property-set )
@@ -128,8 +99,13 @@
         # cause a loop in main target references. Remove that property
         # manually.
 
-        property-set = [ property-set.create [ difference
-            [ $(property-set).raw ] : <library>/stlport//stlport <stdlib>stlport ] ] ;
+        property-set = [ property-set.create
+            [ difference
+                [ $(property-set).raw ] :
+                <library>/stlport//stlport
+                <stdlib>stlport
+                ]
+            ] ;
         return [ basic-target.generate $(property-set) ] ;
     }
 
@@ -193,7 +169,7 @@
                     = [ targets.main-target-requirements
                         [ $(lib-file.props).raw ] <file>$(lib-file[-1])
                         : $(self.project) ] ;
-                return [ generators.construct $(self.project) $(name) : LIB : $(lib-file.requirements) : : LIB ] ;
+                return [ generators.construct $(self.project) $(name) : LIB : $(lib-file.requirements) ] ;
             }
             else
             {
@@ -257,6 +233,19 @@
                 <define>_STLP_NO_OWN_IOSTREAMS=1
                 <define>_STLP_HAS_NO_NEW_IOSTREAMS=1 ;
         }
+        if $(self.version.5)
+        {
+            # Version 5.x
+            if [ $(rproperties).get <threading> ] = "single"
+            {
+                # Since STLport5 doesn't normally support single-thread
+                # we force STLport5 into the multi-thread mode. Hence
+                # getting what other libs provide of single-thread code
+                # linking against a multi-thread lib.
+                usage-requirements +=
+                    <define>_STLP_THREADS=1 ;
+            }
+        }
         
         #~ Allow setting up to use STLport by only using the library target
         #~ /stlport//stlport.

Modified: boost/trunk/tools/build/v2/tools/sun.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/sun.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/sun.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -29,7 +29,11 @@
     
     command = [ common.get-invocation-command sun : CC 
         : $(command) : "/opt/SUNWspro/bin" ] ;
-    
+
+    # Even if the real compiler is not found, put CC to
+    # command line so that user see command line that would have being executed.
+    command ?= CC ;
+
     common.handle-options sun : $(condition) : $(command) : $(options) ;
     
     command_c = $(command[1--2]) $(command[-1]:B=cc) ;
@@ -44,7 +48,7 @@
 # Declare flags and actions for compilation
 flags sun.compile OPTIONS <debug-symbols>on : -g ;
 flags sun.compile OPTIONS <profiling>on : -xprofile=tcov ;
-flags sun.compile OPTIONS <optimization>speed : -fast -xarch=generic ;
+flags sun.compile OPTIONS <optimization>speed : -fast ;
 flags sun.compile OPTIONS <optimization>space : -xO2 -xspace ;
 flags sun.compile OPTIONS <threading>multi : -mt ;
 
@@ -84,6 +88,9 @@
 # it, even though it's bad idea.
 flags sun.link RPATH <xdll-path> ;
 
+# The POSIX real-time library is always needed (nanosleep, clock_gettime etc.)
+flags sun.link FINDLIBS-SA : rt ;
+
 rule link ( targets * : sources * : properties * )
 {
     SPACE on $(targets) = " " ;

Modified: boost/trunk/tools/build/v2/tools/symlink.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/symlink.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/symlink.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,8 @@
-# (C) Copyright Rene Rivera, 2002-2003.
-#
-# See accompanying license for terms and conditions of use.
-#
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003 Rene Rivera 
+# Copyright 2002, 2003, 2004, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # Defines the "symlink" special target. 'symlink' targets make symbolic links
 # to the sources.

Modified: boost/trunk/tools/build/v2/tools/testing.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/testing.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/testing.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,7 @@
-#  (C) Copyright David Abrahams 2002. 
-#  (C) Copyright Vladimir Prus 2002-2003. 
-#  Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2005 Dave Abrahams 
+# Copyright 2002, 2003, 2004, 2005, 2006 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  This module implements regression testing framework. It declares a number of 
 #  main target rules, which perform some action, and if the results are ok,
@@ -101,6 +99,8 @@
     return $(t) ;    
 }
 
+# Note: passing more that one cpp file here is know to
+# fail. Passing a cpp file and a library target works.
 rule compile ( sources + : requirements * : target-name ? )
 {    
     return [ make-test compile : $(sources) : $(requirements) : $(target-name) ] ;
@@ -155,20 +155,12 @@
     return [ make-test run-fail : $(sources) : $(requirements) : $(target-name) ] ;
 }
 
-# Rule for grouping tests in suites.
-rule test-suite ( suite-name : tests + ) 
-{
-    # In V2, if 'tests' are instances of 'abstract-target', they will be considered
-    # 'inline-targets' and will suffer some adjustments. This will not be compatible
-    # with V1 behaviour, so we get names of 'tests' and use them.
-    local names ;
-    for local t in $(tests)
-    {
-        names += [ $(t).name ] ;
-    }    
-    modules.call-in [ CALLER_MODULE ] : alias $(suite-name) : $(names) ;
-}
 
+# Use 'test-suite' as synonym for 'alias', for backward compatibility.
+IMPORT : alias : : test-suite ;
+
+
+
 # For all main target in 'project-module', 
 # which are typed target with type derived from 'TEST', 
 # produce some interesting information.
@@ -194,7 +186,10 @@
     else if $(match3) { return "" ; }
     else if --dump-tests in [ modules.peek : ARGV ] 
     { 
-        EXIT Cannot extract library name from path $(path) ; 
+        # The 'run' rule and others might be used outside
+        # boost. In that case, just return the path,
+        # since the 'library name' makes no sense.
+        return $(path) ;
     }
 }
 
@@ -343,11 +338,23 @@
     }            
 }
 
+local argv = [ modules.peek : ARGV ] ;
+if --preserve-test-targets in $(argv)
+{
+    preserve-test-targets = true ;
+}
 
 toolset.flags testing.capture-output ARGS <testing.arg> ;
 toolset.flags testing.capture-output INPUT_FILES <testing.input-file> ;
 toolset.flags testing.capture-output LAUNCHER <testing.launcher> ;
-rule capture-output ( target : source : properties * )
+
+# Runs executable 'sources' and stores stdout in file 'target'.
+# If --preserve-test-targets command line option, removes the executable.
+# The 'target-to-remove' parameter controls what should be removed:
+#   - if 'none', does not remove anything, ever
+#   - if empty, removes 'source'
+#   - if non-empty and not 'none', contains a list of sources to remove.
+rule capture-output ( target : source : properties * : targets-to-remove ? )
 {
     output-file on $(target) = $(target:S=.output) ;
     LOCATE on $(target:S=.output) = [ on $(target) return $(LOCATE) ] ;
@@ -364,7 +371,33 @@
     # on them and not LOCATE setting of $(target), as in other case (due to jam bug).
     DEPENDS $(target) : [ on $(target) return $(INPUT_FILES) ] ;
     
+    if $(targets-to-remove) = none
+    {
+        targets-to-remove = ;
+    }
+    else if ! $(targets-to-remove)
+    {
+        targets-to-remove = $(source) ;
+    }
+            
     run-path-setup $(target) : $(source) : $(properties) ;
+    
+    if ! $(preserve-test-targets)
+    {
+        TEMPORARY $(targets-to-remove) ;
+        # Set a second action on target that will
+        # be executed after capture output action.
+        # The 'RmTemps' rule has the 'ignore' modifier
+        # so it's always considered succeeded.
+        # This is needed for 'run-fail' test. For that
+        # test the target will be marked with FAIL_EXPECTED,
+        # and without 'ingore' successfull execution 
+        # will be negated and be reported as failure.
+        # With 'ignore' we don't detect a case where
+        # removing files, but it's not likely to
+        # happen.
+        RmTemps $(target) : $(targets-to-remove) ;
+    }
 }
 
 
@@ -406,15 +439,18 @@
     VERBOSE_TEST = 0 ;
 }
 
+
+RM = [ common.rm-command ] ;
+
 actions capture-output bind INPUT_FILES output-file
 {
     $(PATH_SETUP)
-    $(LAUNCHER) $(>) $(ARGS) "$(INPUT_FILES)" > $(output-file) 2>&1      
+    $(LAUNCHER) "$(>)" $(ARGS) "$(INPUT_FILES)" > "$(output-file)" 2>&1      
     $(SET_STATUS)
-    $(RUN_OUTPUT_NL) >> $(output-file)
-    echo EXIT STATUS: $(STATUS) >> $(output-file)
+    $(RUN_OUTPUT_NL) >> "$(output-file)"
+    echo EXIT STATUS: $(STATUS) >> "$(output-file)"
     if $(STATUS_0)
-        $(CP) $(output-file) $(<)
+        $(CP) "$(output-file)" "$(<)"
     $(ENDIF)
     $(SHELL_SET)verbose=$(VERBOSE_TEST)
     if $(STATUS_NOT_0)
@@ -422,12 +458,17 @@
     $(ENDIF)
     if $(VERBOSE)
         echo ====== BEGIN OUTPUT ======
-        $(CATENATE) $(output-file)
+        $(CATENATE) "$(output-file)"
         echo ====== END OUTPUT ======
-    $(ENDIF)
+    $(ENDIF)    
     exit $(STATUS)      
 }
 
+actions quietly updated ignore piecemeal together RmTemps
+{
+    $(RM) "$(>)"
+}
+
 MAKE_FILE = [ common.file-creation-command ] ;
 
 toolset.flags testing.unit-test LAUNCHER <testing.launcher> ;
@@ -442,8 +483,8 @@
     $(LAUNCHER) $(>) && $(MAKE_FILE) $(<)
 }
 
-IMPORT $(__name__) : compile compile-fail test-suite run run-fail link link-fail 
-  : : compile compile-fail test-suite run run-fail link link-fail ;
+IMPORT $(__name__) : compile compile-fail run run-fail link link-fail 
+  : : compile compile-fail run run-fail link link-fail ;
 
 
 type.register TIME : time ;

Modified: boost/trunk/tools/build/v2/tools/types/lib.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/types/lib.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/types/lib.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -15,9 +15,11 @@
 type STATIC_LIB : lib a : LIB : NT CYGWIN ;
 type STATIC_LIB : a : LIB : MACOSX ;
 type STATIC_LIB : a : LIB ;
+type.set-generated-target-prefix STATIC_LIB : : lib ;
 
 type IMPORT_LIB : : STATIC_LIB ;
 type.set-generated-target-suffix IMPORT_LIB : : lib ;
+type.set-generated-target-prefix IMPORT_LIB : : "" ;
 
 type SHARED_LIB : dll : LIB : NT CYGWIN ;
 type SHARED_LIB : dylib : LIB : MACOSX ;

Modified: boost/trunk/tools/build/v2/tools/xsltproc.jam
===================================================================
--- boost/trunk/tools/build/v2/tools/xsltproc.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/tools/xsltproc.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -10,6 +10,7 @@
 #  Note: except for 'init', this modules does not provide any rules
 #  for end users. 
 
+import toolset : flags ;
 import feature ;
 import regex ;
 import sequence ;
@@ -38,6 +39,10 @@
 rule compute-xslt-flags ( target : properties * )
 {
   local flags ;
+  
+  # Raw flags.
+  flags += [ feature.get-values <flags> : $(properties) ] ;
+  
   # Translate <xsl:param> into command line flags.  
   for local param in [ feature.get-values <xsl:param> : $(properties) ]
   {
@@ -75,7 +80,7 @@
 local rule .xsltproc ( target : source stylesheet : properties * : dirname ? : action )
 {
     STYLESHEET on $(target) = $(stylesheet) ;
-    FLAGS on $(target) = [ compute-xslt-flags $(target) : $(properties) ] ;
+    FLAGS on $(target) += [ compute-xslt-flags $(target) : $(properties) ] ;
     NAME on $(target) = $(.xsltproc) ;
     
     for local catalog in [ feature.get-values <catalog> : $(properties) ]

Modified: boost/trunk/tools/build/v2/user-config.jam
===================================================================
--- boost/trunk/tools/build/v2/user-config.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/user-config.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,8 @@
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003, 2005 Douglas Gregor 
+# Copyright 2004 John Maddock 
+# Copyright 2002, 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  This file is used to configure your Boost.Build installation. Please read
 #  the user manual to find out where to put it.

Modified: boost/trunk/tools/build/v2/util/assert.jam
===================================================================
--- boost/trunk/tools/build/v2/util/assert.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/util/assert.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,8 @@
-#  (C) Copyright David Abrahams 2001. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2001, 2002, 2003 Dave Abrahams 
+# Copyright 2006 Rene Rivera 
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 import errors : error-skip-frames lol->list ;
 import modules ;
@@ -36,6 +37,35 @@
     }
 }
 
+rule .set.equal ( set1 * : set2 * )
+{
+    if ( $(set1) in $(set2) ) && ( $(set2) in $(set1) )
+    {
+        return true ;
+    }
+}
+
+# assert that EXPECTED is equal to the result of calling RULE-NAME with the
+# given arguments
+rule result-equal ( expected * : rule-name args * : * )
+{
+    local result ;
+    module [ CALLER_MODULE ]
+    {
+        modules.poke assert : result
+            : [ $(2) : $(3) : $(4) : $(5) : $(6) : $(7) : $(8) : $(9) ] ;
+    }
+
+    if ! [ .set.equal $(result) : $(expected) ]
+    {
+        error-skip-frames 3 assertion failure: "[" $(rule-name) 
+          [ lol->list $(args) : $(3) : $(4) : $(5) : $(6) : $(7) : $(8) : $(9) ]
+            "]"
+          : expected: \"$(expected)\"
+          : got: \"$(result)\" ;
+    }
+}
+
 # assert that the given variable is nonempty.
 rule nonempty-variable ( name )
 {
@@ -56,7 +86,7 @@
     module [ CALLER_MODULE ]
     {
         modules.poke assert : result
-          : [ $(1) : $(2) $(3) : $(4)
+          : [ $(1) : $(2) : $(3) : $(4)
             : $(5) : $(6) : $(7) : $(8) : $(9) ] ;
     }
 
@@ -78,7 +108,7 @@
     module [ CALLER_MODULE ]
     {
         modules.poke assert : result
-          : [ $(1) : $(2) $(3) : $(4)
+          : [ $(1) : $(2) : $(3) : $(4)
             : $(5) : $(6) : $(7) : $(8) : $(9) ] ;
     }
 
@@ -109,4 +139,4 @@
         error-skip-frames 3 assertion failure: did not expect $(element) in 
                           "[" $(list) "]" ;
     }
-}
\ No newline at end of file
+}

Modified: boost/trunk/tools/build/v2/util/container.jam
===================================================================
--- boost/trunk/tools/build/v2/util/container.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/util/container.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,8 @@
-# (C) Copyright Rene Rivera, 2002.
-#
-# See accompanying license for terms and conditions of use.
-#
+# Copyright 2003 Dave Abrahams 
+# Copyright 2002, 2003 Rene Rivera 
+# Copyright 2002, 2003, 2004 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # Various container classes.
 

Modified: boost/trunk/tools/build/v2/util/doc.jam
===================================================================
--- boost/trunk/tools/build/v2/util/doc.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/util/doc.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,8 @@
-# (C) Copyright Rene Rivera, 2002-2003.
-#
-# See accompanying license for terms and conditions of use.
-#
+# Copyright 2002, 2005 Dave Abrahams 
+# Copyright 2002, 2003, 2006 Rene Rivera 
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # Documentation system, handles --help requests.
 # It defines rules that attach documentation to modules, rules, and variables.
@@ -234,26 +235,36 @@
 # Generates a general description of the documentation and help system.
 #
 local rule print-help-top ( )
-{
-    print.section "Available Help"
-        These are the available options for obtaining documentation.
-        Some options have additional instructions on how to get more
-        detailed information. Multiple options are allowed and
-        sometimes required. For example, the options that configure
-        the help system still require a regular help request option
-        for any output to be generated.
-        ;
+{    
+    print.section "General command line usage" ;
+
+    print.text "    bjam [options] [properties] [targets]
+      
+  Options, properties and targets can be specified in any order.
+      " ;
+        
+    print.section "Important Options" ;          
+    
+    print.list-start ;    
+    print.list-item "--clean Remove targets instead of building" ;
+    print.list-item "-a Rebuild everything" ;
+    print.list-item "-n Don't execute the commands, only print them" ;
+    print.list-item "-d+2 Show commands as they are executed" ;
+    print.list-item "-d0 Supress all informational messages" ;
+    print.list-item "-q Stop at first error" ;
+    print.list-item "--debug-configuration Diagnose configuration" ;
+    print.list-item "--debug-building Report which targets are built with what properties" ;
+    print.list-item "--debug-generator Diagnose generator search/execution" ;
+    print.list-end ;
+        
+    print.section "Further Help"
+        The following options can be used to obtain additional documentation.
+      ;
+ 
     print.list-start ;
-    print.list-item --help; This help message. ;
-    print.list-item --help-usage; How to invoke '"bjam".' ;
-    print.list-item --help-all; Brief information on available modules. ;
-    print.list-item --help <module-name>; Get information about a module. ;
-    print.list-item --help-options; Options for controlling the help display. ;
-    print.list-item --help-output <type>; The type of output to genetare.
-        '"console" is formated text echoed to the console (the default);'
-        '"text" is formated text appended to the output file;'
-        '"html" is HTML output to the file.' ;
-    print.list-item --help-output-file <file>; The file to output the documentation. ;
+    print.list-item "--help-options Print more obscure command line options." ;
+    print.list-item "--help-internal Boost.Build implementation details." ;
+    print.list-item "--help-doc-options Implementation details doc formatting." ;
     print.list-end ;
 }
 

Modified: boost/trunk/tools/build/v2/util/indirect.jam
===================================================================
--- boost/trunk/tools/build/v2/util/indirect.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/util/indirect.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,8 @@
-# Copyright David Abrahams 2003. Permission to copy, use,
-# modify, sell and distribute this software is granted provided this
-# copyright notice appears in all copies. This software is provided
-# "as is" without express or implied warranty, and with no claim as
-# to its suitability for any purpose.
+# Copyright 2003 Dave Abrahams 
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 import modules ;
 import numbers ;
 
@@ -100,4 +100,4 @@
     
     
     call [ make foo-barr! : [ CALLER_MODULE ] ] x ;
-}
\ No newline at end of file
+}

Modified: boost/trunk/tools/build/v2/util/numbers.jam
===================================================================
--- boost/trunk/tools/build/v2/util/numbers.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/util/numbers.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
-#  (C) Copyright David Abrahams 2001. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2001, 2002 Dave Abrahams 
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 digits = 0 1 2 3 4 5 6 7 8 9 ;
 powers = 1 ;

Modified: boost/trunk/tools/build/v2/util/os.jam
===================================================================
--- boost/trunk/tools/build/v2/util/os.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/util/os.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,8 @@
-#  (C) Copyright David Abrahams 2001. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2001, 2002, 2003, 2005 Dave Abrahams 
+# Copyright 2006 Rene Rivera 
+# Copyright 2003, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 import modules ;
 
@@ -63,7 +64,7 @@
 if $(.name) = NT
 {
     local home = [ environ HOMEDRIVE HOMEPATH ] ;
-    .home-directories = $(home[1])$(home[2]) [ environ HOME ] ;
+    .home-directories = $(home[1])$(home[2]) [ environ HOME ] [ environ USERPROFILE ] ;
 }
 else
 {

Modified: boost/trunk/tools/build/v2/util/path.jam
===================================================================
--- boost/trunk/tools/build/v2/util/path.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/util/path.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,10 @@
-#  Copyright (C) Vladimir Prus 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright Vladimir Prus 2002-2006.
+# Copyright Dave Abrahams 2003-2004.
+# Copyright Rene Rivera 2003-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)
 
 #  Performs various path manipulations. Path are always in a 'normilized' 
 #  representation. In it, a path may be either:
@@ -18,6 +21,7 @@
 import sequence ;
 import regex ;
 import errors : error ;
+import set ;
 
 
 os = [ modules.peek : OS ] ;
@@ -218,10 +222,11 @@
 #    For example: 
 #        [ glob . : *.cpp ] 
 #        [ glob . : */build/Jamfile ] 
-rule glob ( dirs * : patterns + )
+rule glob ( dirs * : patterns + : exclude-patterns * )
 {
     local result ;
     local real-patterns ;
+    local real-exclude-patterns ;
     for local d in $(dirs)
     {
         for local p in $(patterns)
@@ -229,14 +234,60 @@
             local pattern = [ path.root $(p) $(d) ] ;
             real-patterns += [ path.native $(pattern) ] ;
         }        
+        
+        for local p in $(exclude-patterns)
+        {
+            local pattern = [ path.root $(p) $(d) ] ;
+            real-exclude-patterns += [ path.native $(pattern) ] ;
+        }        
     }        
+
+    local inc = [ GLOB-RECURSIVELY $(real-patterns) ] ;
+    local exc = [ GLOB-RECURSIVELY $(real-exclude-patterns) ] ;
     
     return [ sequence.transform path.make : 
-        [ GLOB-RECURSIVELY $(real-patterns) ] ] ;
-
+        [ set.difference $(inc) : $(exc) ] ] ;
 }    
 
+# Recursive version of GLOB. Builds the glob of files while
+# also searching in the subdirectories of the given roots. An
+# optional set of exclusion patterns will filter out the
+# matching entries from the result. The exclusions also apply
+# to the subdirectory scanning, such that directories that
+# match the exclusion patterns will not be searched.
+#
+rule glob-tree ( roots * : patterns + : exclude-patterns * )
+{
+    return [ sequence.transform path.make : [ .glob-tree
+        [ sequence.transform path.native : $(roots) ]
+        : $(patterns)
+        : $(exclude-patterns)
+        ] ] ;
+}
 
+local rule .glob-tree ( roots * : patterns * : exclude-patterns * )
+{
+    local excluded ;
+    if $(exclude-patterns)
+    {
+        excluded = [ GLOB $(roots) : $(exclude-patterns) ] ;
+    }
+    local result = [ set.difference
+        [ GLOB $(roots) : $(patterns) ] : $(excluded) ] ;
+    local subdirs ;
+    for local d in [ set.difference
+        [ GLOB $(roots) : * ] : $(excluded) ]
+    {
+        if ! ( $(d:D=) in . .. ) && ! [ CHECK_IF_FILE $(d) ] { subdirs += $(d) ; }
+    }
+    if $(subdirs)
+    {
+        result += [ .glob-tree $(subdirs) : $(patterns) : $(exclude-patterns) ] ;
+    }
+    return $(result) ;
+}
+
+
 #
 #    Returns true is the specified file exists.
 #
@@ -306,9 +357,8 @@
 # Assuming 'child' is a subdirectory of 'parent', return the relative
 # path from 'parent' to 'child'
 #
-rule relative ( child parent : no-error ? )
+rule relative ( child parent )
 {
-    local not-a-child ;
     if $(parent) = "." 
     {
         return $(child) ;
@@ -327,26 +377,10 @@
             }
             else
             {
-                not-a-child = true ;
-                split1 = ;
+                errors.error $(child) is not a subdir of $(parent) ;
             }                
         }    
-        
-        if $(not-a-child)
-        {
-            if $(no-error)
-            {
-                return not-a-child ;
-            }
-            else
-            {
-                errors.error $(child) is not a subdir of $(parent) ;
-            }                        
-        }
-        else
-        {
-            return [ join $(split2) ] ;    
-        }        
+        return [ join $(split2) ] ;    
     }    
 }
 

Modified: boost/trunk/tools/build/v2/util/print.jam
===================================================================
--- boost/trunk/tools/build/v2/util/print.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/util/print.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,8 @@
-# (C) Copyright Rene Rivera, 2002-2003.
-#
-# See accompanying license for terms and conditions of use.
-#
+# Copyright 2003 Douglas Gregor 
+# Copyright 2002, 2003, 2005 Rene Rivera 
+# Copyright 2002, 2003, 2004, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # Utilities for generating format independent output. Using these
 # will help in generation of documentation in at minimum plain/console
@@ -191,7 +192,7 @@
 {
     if $(output-type) = plain
     {
-        lines [ split-at-words "*" $(item) ] : "  " ;
+        lines [ split-at-words "*" $(item) ] : "    " "  " ;
     }
     else if $(output-type) = html
     {

Modified: boost/trunk/tools/build/v2/util/regex.jam
===================================================================
--- boost/trunk/tools/build/v2/util/regex.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/util/regex.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,9 @@
-#  (C) Copyright David Abrahams 2001. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2001, 2002 Dave Abrahams 
+# Copyright 2003 Douglas Gregor 
+# Copyright 2003 Rene Rivera 
+# Copyright 2002, 2003, 2004, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #
 #   Returns a list of the following substrings:
@@ -32,6 +34,18 @@
     return $(s) $(result) ;
 }
 
+# Returns the concatenated results of Applying regex.split to every
+# element of list using the separator pattern.
+rule split-list ( list * : separator )
+{
+    local result ;
+    for s in $(list)
+    {
+        result += [ split $(s) $(separator) ] ;
+    }
+    return $(result) ;
+}
+  
 # Match string against pattern, and return the elements indicated by
 # indices.
 rule match ( pattern : string : indices * )

Modified: boost/trunk/tools/build/v2/util/sequence.jam
===================================================================
--- boost/trunk/tools/build/v2/util/sequence.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/util/sequence.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,8 @@
-#  (C) Copyright David Abrahams 2002. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2001, 2002, 2003 Dave Abrahams 
+# Copyright 2006 Rene Rivera 
+# Copyright 2002, 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 import assert ;
 import numbers ; 
@@ -138,52 +139,40 @@
     return $(s:J=$(joint)) ;
 }
 
-# Find the length of any sequence in log(N) time.
+# Find the length of any sequence.
 rule length ( s * )
 {
-    local length = "" ;
-    local zeros p10 d z ; # declared once for speed
-
-    # Find the power of 10 that is just less than length(s)
-    zeros = "" ;
-    p10 = 1 ;
-    while $(s[$(p10)0])
+    local result = 0 ;
+    for local i in $(s)
     {
-        p10 = $(p10)0 ;
-        zeros = $(zeros[1])0 $(zeros) ;
+        result = [ CALC $(result) + 1 ] ;
     }
+    return $(result) ;
+}
 
-    # zeros is a list of the form  ... 000 00 0 ""
-    for z in $(zeros) # for each digit in the result
+rule unique ( list * : stable ? )
+{
+    local result ;
+    local prev ;
+    if $(stable)
     {
-        # Find the next digit
-        d = 0 1 2 3 4 5 6 7 8 9 ;
-        while $(s[$(d[2])$(z)])
+        for local f in $(list)
         {
-            d = $(d[2-]) ;
+            if ! $(f) in $(result)
+            {
+                result += $(f) ;
+            }
         }
-
-        # append it to the result
-        length = $(length)$(d[1]) ;
-
-        # Explanation: $(d[1])$(z) the largest number x of the form
-        # n000..., where n is a digit, such that x <= length(s). Here
-        # we're deleting x elements from the list. Since $(s[n]-)
-        # removes n - 1 elements from the list, we chop an additional
-        # one off the end.
-        s = $(s[$(d[1])$(z)--2]) ;
     }
-    return $(length) ;
-}
-
-rule unique ( list * )
-{
-    local result ;
-    for local f in $(list)
+    else
     {
-        if ! $(f) in $(result)
+        for local i in [ SORT $(list) ]
         {
-            result += $(f) ;
+            if $(i) != $(prev)
+            {
+                result += $(i) ;
+            }
+            prev = $(i) ;
         }
     }
     return $(result) ;

Modified: boost/trunk/tools/build/v2/util/set.jam
===================================================================
--- boost/trunk/tools/build/v2/util/set.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/util/set.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
-#  (C) Copyright David Abrahams 2001. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2001, 2002 Dave Abrahams 
+# Copyright 2003 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 # difference
 # returns the elements of B that are not in A

Modified: boost/trunk/tools/build/v2/util/string.jam
===================================================================
--- boost/trunk/tools/build/v2/util/string.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/util/string.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +1,7 @@
-# (C) Copyright David Abrahams, 2002.
-# (C) Copyright Rene Rivera, 2003.
-#
-# See accompanying license for terms and conditions of use.
-#
+# Copyright 2002 Dave Abrahams 
+# Copyright 2002, 2003 Rene Rivera 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 import regex ;
 
@@ -51,6 +50,57 @@
     return $(result) ;
 }
 
+# Apply a set of standard transformations to string to produce an
+# abbreviation no more than 5 characters long
+#
+rule abbreviate ( string )
+{
+    local r = $(.abbreviated-$(string)) ;
+    if $(r)
+    {
+        return $(r) ;
+    }
+    # Anything less than 4 characters gets no abbreviation
+    else if ! [ MATCH (....) : $(string) ]
+    {
+        $(.abbreviated-$(string)) = $(string) ;
+        return $(string) ;
+    }
+    else
+    {
+        # Separate the initial letter in case it's a vowel
+        local s1 = [ MATCH ^(.)(.*) : $(string) ] ;
+        
+        # drop trailing "ing"
+        local s2 = [ MATCH ^(.*)ing$ : $(s1[2]) ] ;
+        s2 ?= $(s1[2]) ;
+        
+        # Reduce all doubled characters to one
+        local last = "" ;
+        for local c in [ chars $(s2) ]
+        {
+            if $(c) != $(last)
+            {
+                r += $(c) ;
+                last = $(c) ;
+            }
+        }
+        s2 = $(r:J="") ;
+        
+        # Chop all vowels out of the remainder
+        s2 = [ regex.replace $(s2) [AEIOUaeiou] "" ] ;
+
+        # Shorten remaining consonants to 4 characters
+        s2 = [ MATCH ^(.?.?.?.?) : $(s2) ] ;
+        
+        # Glue the initial character back on to the front
+        s2 = $(s1[1])$(s2) ;
+        
+        $(.abbreviated-$(string)) = $(s2) ;
+        return $(s2) ;
+    }
+}
+
 # Concatenates the given strings, inserting the given separator
 # between each string.
 #
@@ -102,6 +152,15 @@
     import assert ;
     assert.result a b c : chars abc ;
     
+    assert.result rntm : abbreviate runtime ;
+    assert.result ovrld : abbreviate overload ;
+    assert.result dbg : abbreviate debugging ;
+    assert.result async : abbreviate asynchronous ;
+    assert.result pop : abbreviate pop ;
+    assert.result aaa : abbreviate aaa ;
+    assert.result qck : abbreviate quack ;
+    assert.result sttc : abbreviate static ;
+    
     # check boundary cases
     assert.result a : chars a ;
     assert.result : chars "" ;

Modified: boost/trunk/tools/build/v2/util/utility.jam
===================================================================
--- boost/trunk/tools/build/v2/util/utility.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/build/v2/util/utility.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
-#  (C) Copyright David Abrahams 2001. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2001, 2002 Dave Abrahams 
+# Copyright 2002, 2003, 2004, 2005 Vladimir Prus 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 import "class" : is-instance ;
 import errors ;

Modified: boost/trunk/tools/index.html
===================================================================
--- boost/trunk/tools/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,12 @@
+<!-- Copyright 2004 Aleksey Gurtovoy -->
+<!-- Copyright 2003 Beman Dawes -->
+<!-- Copyright 2003 Douglas Gregor -->
+<!-- Copyright 2005 Eric Niebler -->
+<!-- Copyright 2005 Hartmut Kaiser -->
+<!-- Copyright 2004 John Maddock -->
+<!-- Distributed under the Boost Software License, Version 1.0. -->
+<!-- (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) -->
+
 <html>
    <head>
       <title>Boost Tools</title>

Deleted: boost/trunk/tools/inspect/build/Jamfile
===================================================================
--- boost/trunk/tools/inspect/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,29 +0,0 @@
-# Inspect Jamfile
-
-# © Copyright Beman Dawes, 2002
-# Copyright Rene Rivera 2004.
-# 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)
-
-subproject tools/inspect/build ;
-
-exe inspect
-  :
-  ../inspect.cpp ../license_check.cpp ../link_check.cpp ../long_name_check.cpp ../tab_check.cpp ../crlf_check.cpp ../copyright_check.cpp ../minmax_check.cpp
-  <lib>../../../libs/filesystem/build/boost_filesystem
-  <lib>../../../libs/regex/build/boost_regex
-  :
-  <sysinclude>$(BOOST_ROOT)
-  <define>BOOST_ALL_NO_LIB=1
-  :
-        release
-  ;
-
-stage run
-    :
-        <exe>inspect
-    :
-    :
-        release
-        <suppress>true
-    ;

Modified: boost/trunk/tools/inspect/build/Jamfile.v2
===================================================================
--- boost/trunk/tools/inspect/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,19 +3,16 @@
 project
     :
     requirements
-    <link>static
-    <runtime-link>static
-    <threading>single
     :
     source-location .. 
     ;
 
 exe inspect
     :
-    inspect.cpp license_check.cpp link_check.cpp long_name_check.cpp tab_check.cpp crlf_check.cpp
+    inspect.cpp license_check.cpp link_check.cpp long_name_check.cpp tab_check.cpp crlf_check.cpp unnamed_namespace_check.cpp
     copyright_check.cpp minmax_check.cpp
-    /boost/filesystem//boost_filesystem
-    /boost/regex//boost_regex
+    /boost//filesystem/<link>static
+    /boost//regex/<link>static
     :
     :
     release

Modified: boost/trunk/tools/inspect/copyright_check.cpp
===================================================================
--- boost/trunk/tools/inspect/copyright_check.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/copyright_check.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,17 +14,19 @@
    copyright_check::copyright_check() : m_files_with_errors(0)
    {
    }
-     
+
    void copyright_check::inspect(
       const string & library_name,
       const path & full_path,   // example: c:/foo/boost/filesystem/path.hpp
       const string & contents )     // contents of file to be inspected
     {
+      if (contents.find( "boostinspect:" "nocopyright" ) != string::npos) return;
+
       if ( contents.find( "Copyright" ) == string::npos
         && contents.find( "copyright" ) == string::npos )
       {
         ++m_files_with_errors;
-        error( library_name, full_path, desc() );
+        error( library_name, full_path, name() );
       }
     }
   } // namespace inspect

Modified: boost/trunk/tools/inspect/copyright_check.hpp
===================================================================
--- boost/trunk/tools/inspect/copyright_check.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/copyright_check.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,6 +2,7 @@
 
 //  Copyright Beman Dawes 2002, 2003.
 //  Copyright Rene Rivera 2004.
+//
 //  Distributed under the Boost Software License, Version 1.0.
 //  (See accompanying file LICENSE_1_0.txt or copy at
 //  http://www.boost.org/LICENSE_1_0.txt)
@@ -21,8 +22,8 @@
     public:
 
       copyright_check();
-      virtual const char * name() const { return "copyright-check"; }
-      virtual const char * desc() const { return "missing copyright"; }
+      virtual const char * name() const { return "*C*"; }
+      virtual const char * desc() const { return "missing copyright notice"; }
 
       virtual void inspect(
         const std::string & library_name,
@@ -30,7 +31,7 @@
         const std::string & contents );
 
       virtual ~copyright_check()
-        { std::cout << "  " << m_files_with_errors << " files missing copyrights\n"; }
+        { std::cout << "  " << m_files_with_errors << " files " << desc() << '\n'; }
     };
   }
 }

Modified: boost/trunk/tools/inspect/crlf_check.cpp
===================================================================
--- boost/trunk/tools/inspect/crlf_check.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/crlf_check.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,7 @@
 //  crlf_check implementation  ------------------------------------------------//
 
 //  Copyright Beman Dawes 2002.
+//
 //  Distributed under the Boost Software License, Version 1.0.
 //  (See accompanying file LICENSE_1_0.txt or copy at
 //  http://www.boost.org/LICENSE_1_0.txt)
@@ -22,6 +23,11 @@
       const path & full_path,   // example: c:/foo/boost/filesystem/path.hpp
       const string & contents )     // contents of file to be inspected
     {
+      if (contents.find( "boostinspect:" "nocrlf" ) != string::npos) return;
+
+      // this file deliberately contains errors
+      const char test_file_name[] = "wrong_line_ends_test.cpp";
+
       bool failed = false;
       // The understanding on line endings, as I remember it, was that
       // either "\n" or "\r\n" is OK, and they can be mixed, but "\r" alone
@@ -29,7 +35,7 @@
       // are commonly edited in both Windows and UNIX environments, and editors
       // in those environments generally accept either ending. Even Mac people
       // agreed with this policy. --Beman
-      
+
       // Joerg's original implementation is saved below,
       // in case we change our minds!
 
@@ -43,13 +49,13 @@
         }
       }
 
-      if (failed && full_path.leaf() != "wrong_line_ends_test.cpp")
+      if (failed && full_path.leaf() != test_file_name)
       {
         ++m_files_with_errors;
-        error( library_name, full_path, desc() );
+        error( library_name, full_path, name() );
       }
 
-      if (!failed && full_path.leaf() == "wrong_line_ends_test.cpp")
+      if (!failed && full_path.leaf() == test_file_name)
       {
         ++m_files_with_errors;
         error( library_name, full_path, "should have cr-only line endings" );

Modified: boost/trunk/tools/inspect/crlf_check.hpp
===================================================================
--- boost/trunk/tools/inspect/crlf_check.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/crlf_check.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,7 +23,7 @@
     public:
 
       crlf_check();
-      virtual const char * name() const { return "crlf-check"; }
+      virtual const char * name() const { return "*R*"; }
       virtual const char * desc() const { return "invalid (cr only) line-ending"; }
 
       virtual void inspect(

Modified: boost/trunk/tools/inspect/cvs_iterator.hpp
===================================================================
--- boost/trunk/tools/inspect/cvs_iterator.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/cvs_iterator.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,7 @@
 //  cvs_iterator  ------------------------------------------------------------//
 
 //  Copyright Beman Dawes 2003.
+//
 //  Distributed under the Boost Software License, Version 1.0.
 //  (See accompanying file LICENSE_1_0.txt or copy at
 //  http://www.boost.org/LICENSE_1_0.txt)
@@ -8,14 +9,17 @@
 //  WARNING: This is just a quick hack. It doesn't conform to C++ Standard
 //  Library iterator requirements.
 
-#include <boost/filesystem/path.hpp>
-#include <boost/filesystem/exception.hpp>
-#include <boost/filesystem/operations.hpp>
-#include <boost/filesystem/fstream.hpp>
-#include <boost/noncopyable.hpp>
+#ifndef BOOST_CVS_ITERATOR_HPP
+#define BOOST_CVS_ITERATOR_HPP
+
 #include <string>
-#include <cassert>
+#include <assert.h>
 
+#include "boost/filesystem/path.hpp"
+#include "boost/filesystem/operations.hpp"
+#include "boost/filesystem/fstream.hpp"
+#include "boost/noncopyable.hpp"
+
 namespace hack
 {
   class cvs_iterator : boost::noncopyable
@@ -31,7 +35,7 @@
 
     cvs_iterator( const boost::filesystem::path & dir_path ) : dir_path(dir_path)
     {
-      boost::filesystem::path entries_file_path( dir_path / "CVS/Entries" ); 
+      boost::filesystem::path entries_file_path( dir_path / "CVS/Entries" );
       entries_file.open( entries_file_path );
       if ( !entries_file )
         throw std::string( "could not open: " ) + entries_file_path.string();
@@ -50,8 +54,8 @@
         {
           std::getline( entries_file, contents );
           if ( entries_file.eof() )
-          { 
-            entries_file.close(); 
+          {
+            entries_file.close();
             value_path = "";
             return *this;
           }
@@ -61,7 +65,7 @@
           / boost::filesystem::path( contents.substr( 1, contents.find( '/', 1 ) ), boost::filesystem::no_check );
 
       // in case entries file is mistaken, do until value_path actually found
-      } while ( !boost::filesystem::exists( value_path ) );  
+      } while ( !boost::filesystem::exists( value_path ) );
       return *this;
     }
 
@@ -73,3 +77,5 @@
 
   };
 }
+
+#endif // include guard

Modified: boost/trunk/tools/inspect/index.html
===================================================================
--- boost/trunk/tools/inspect/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -38,7 +38,7 @@
   <li><a href="tab_check.hpp">tab_check.hpp</a> and <a href="tab_check.cpp">
   tab_check.cpp</a></li>
 </ul>
-<p>A <a href="build/Jamfile">Jamfile</a> is provided to build the program.</p>
+<p>A <a href="build/Jamfile.v2">Jamfile</a> is provided to build the program.</p>
 <hr>
 <p>Revised
 <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->29 December, 2003<!--webbot bot="Timestamp" endspan i-checksum="38523" --></p>
@@ -51,4 +51,4 @@
 
 </body>
 
-</html>
\ No newline at end of file
+</html>

Modified: boost/trunk/tools/inspect/inspect.cpp
===================================================================
--- boost/trunk/tools/inspect/inspect.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/inspect.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,9 @@
 //  inspect program  ---------------------------------------------------------//
 
 //  Copyright Beman Dawes 2002.
-//  Copyright Rene Rivera 2004.
+//  Copyright Rene Rivera 2004-2006.
+//  Copyright Gennaro Prota 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)
@@ -11,24 +13,23 @@
 //  and the code that identifies library names assumes the Boost directory
 //  structure.
 
-//  See http://www.boost.org/tools/inspect for more information.
+//  See http://www.boost.org/tools/inspect/ for more information.
 
-#include <boost/shared_ptr.hpp>
-#include <boost/filesystem/exception.hpp>
-#include <boost/filesystem/operations.hpp>
-#include <boost/filesystem/fstream.hpp>
 
-#include <iostream>
-#include <cassert>
 #include <vector>
 #include <list>
-#include <utility>
 #include <algorithm>
 #include <cstring>
 
-#include "inspector.hpp" // includes <string>, <boost/filesystem/path.hpp>,
-                         // <iostream>, <set>
-                         // and gives using for string and path.
+#include "boost/shared_ptr.hpp"
+#include "boost/filesystem/operations.hpp"
+#include "boost/filesystem/fstream.hpp"
+
+#include "time_string.hpp"
+
+#include "inspector.hpp"
+
+// the inspectors
 #include "copyright_check.hpp"
 #include "crlf_check.hpp"
 #include "license_check.hpp"
@@ -36,26 +37,31 @@
 #include "long_name_check.hpp"
 #include "tab_check.hpp"
 #include "minmax_check.hpp"
+#include "unnamed_namespace_check.hpp"
+
 #include "cvs_iterator.hpp"
 
+#include "boost/test/included/prg_exec_monitor.hpp"
+
 namespace fs = boost::filesystem;
 
 namespace
 {
-  typedef boost::shared_ptr< boost::inspect::inspector > inspector_ptr;
+  class inspector_element
+  {
+    typedef boost::shared_ptr< boost::inspect::inspector > inspector_ptr;
 
-  struct inspector_element
-  {
+  public:
     inspector_ptr  inspector;
-
+    explicit
     inspector_element( boost::inspect::inspector * p ) : inspector(p) {}
   };
 
   typedef std::list< inspector_element > inspector_list;
 
-  long file_count;
-  long directory_count;
-  long error_count;
+  long file_count = 0;
+  long directory_count = 0;
+  long error_count = 0;
 
   boost::inspect::string_set content_signatures;
 
@@ -84,12 +90,23 @@
 
   bool visit_predicate( const path & pth )
   {
+    string local( boost::inspect::relative_to( pth, fs::initial_path() ) );
     string leaf( pth.leaf() );
     return
+      // so we can inspect a checkout
       leaf != "CVS"
+      // don't look at binaries
       && leaf != "bin"
-      && leaf != "jam_src" // this really out of our hands
-      && leaf != "status"  // too many issues with generated HTML files
+      && leaf != "bin.v2"
+      // this really out of our hands
+      && leaf != "jam_src"
+      && local.find("tools/jam/src") != 0
+      // too many issues with generated HTML files
+      && leaf != "status"
+      // no point in checking doxygen xml output
+      && local.find("doc/xml") != 0
+      // ignore some web files
+      && leaf != ".htaccess"
       ;
   }
 
@@ -97,17 +114,25 @@
 
   string library_from_content( const string & content )
   {
-    string::size_type pos( content.find( "www.boost.org/libs/" ) );
+    const string unknown_library ( "unknown" );
+    const string lib_root ( "www.boost.org/libs/" );
+    string::size_type pos( content.find( lib_root ) );
 
-    if ( pos == string::npos ) return "unknown";
+    string lib = unknown_library;
 
-    string lib;
-    pos += 19;
-    while ( content[pos] != ' '
-      && content[pos] != '/'
-      && content[pos] != '\n'
-      && content[pos] != '\r'
-      && content[pos] != '\t' ) lib += content[pos++];
+    if ( pos != string::npos ) {
+
+        pos += lib_root.length();
+
+        const char delims[] = " " // space and...
+                              "/\n\r\t";
+
+        string::size_type n = content.find_first_of( string(delims), pos );
+        if (n != string::npos)
+            lib = string(content, pos, n - pos);
+        
+    }
+
     return lib;
   }
 
@@ -184,36 +209,68 @@
         ++file_count;
         string content;
         load_content( *itr, content );
-        check( lib == "unknown"
-          ? library_from_content( content ) : lib, *itr, content, insps );
+        check( lib.empty()
+                ? library_from_content( content ) : lib
+               , *itr, content, insps );
       }
     }
   }
 
+//  display  -----------------------------------------------------------------//
+
+  enum display_format_type
+  {
+    display_html, display_text
+  }
+  display_format = display_html;
+
+  enum display_mode_type
+  {
+    display_full, display_brief
+  }
+  display_mode = display_full;
+
 //  display_summary_helper  --------------------------------------------------//
 
   void display_summary_helper( const string & current_library, int err_count )
   {
-    std::cout << "  <tr><td><a href=\"#" 
-              << current_library
-              << "\">" << current_library
-              << "</a></td><td align=\"center\">"
-              << err_count << "</td></tr>\n";
+    if (display_text == display_format)
+    {
+        std::cout << "  " << current_library << " (" << err_count << ")\n";
+    }
+    else
+    {
+      std::cout
+        << "  <tr><td><a href=\"#"
+        << current_library          // what about malformed for URI refs? [gps]
+        << "\">" << current_library
+        << "</a></td><td align=\"center\">"
+        << err_count << "</td></tr>\n";
+    }
   }
-  
+
 //  display_summary  ---------------------------------------------------------//
 
   void display_summary()
   {
-    std::cout << "</pre>\n"
-            "<h2>Summary</h2>\n"
-            "<table border=\"1\" cellpadding=\"5\" cellspacing=\"0\">\n"
-            "  <tr>\n"
-            "    <td><b>Library</b></td>\n"
-            "    <td><b>Problems</b></td>\n"
-            "  </tr>\n"
-            ;
-    string current_library( msgs.begin()->library ); 
+    if (display_text == display_format)
+    {
+      std::cout << "Summary:\n";
+    }
+    else
+    {
+      std::cout
+        << "</pre>\n"
+        "<h2>Summary</h2>\n"
+        "<table border=\"1\" cellpadding=\"5\" cellspacing=\"0\">\n"
+        "  <tr>\n"
+        "    <td><b>Library</b></td>\n"
+        "    <td><b>Problems</b></td>\n"
+        "  </tr>\n"
+        ;
+    }
+
+    string current_library( msgs.begin()->library );
     int err_count = 0;
     for ( error_msg_vector::iterator itr ( msgs.begin() );
       itr != msgs.end(); ++itr )
@@ -228,7 +285,14 @@
     }
     display_summary_helper( current_library, err_count );
 
-    std::cout << "</table>\n";
+    if (display_text == display_format)
+    {
+      std::cout << "\n";
+    }
+    else
+    {
+      std::cout << "</table>\n";
+    }
   }
 
 
@@ -236,41 +300,95 @@
 
   void display_details()
   {
-    std::cout << "<h2>Details</h2>\n";
+    // gps - review this
 
-    // display error messages with group indication
-    error_msg current;
-    string sep;
-    bool first = true;
-    for ( error_msg_vector::iterator itr ( msgs.begin() );
-      itr != msgs.end(); ++itr )
+    if (display_text == display_format)
     {
-      if ( current.library != itr->library )
+      // display error messages with group indication
+      error_msg current;
+      string sep;
+      for ( error_msg_vector::iterator itr ( msgs.begin() );
+        itr != msgs.end(); ++itr )
       {
-        if ( !first ) std::cout << "</pre>\n";
-        std::cout << "\n<h3><a name=\"" << itr->library
-                  << "\">" << itr->library << "</a></h3>\n<pre>";
+        if ( current.library != itr->library )
+        {
+          if ( display_full == display_mode )
+              std::cout << "\n|" << itr->library << "|\n";
+          else
+              std::cout << "\n\n|" << itr->library << '|';
+        }
+
+        if ( current.library != itr->library
+          || current.rel_path != itr->rel_path )
+        {
+          if ( display_full == display_mode )
+          {
+            std::cout << "  " << itr->rel_path << ":\n";
+          }
+          else
+          {
+            path current_rel_path(current.rel_path);
+            path this_rel_path(itr->rel_path);
+            if (current_rel_path.branch_path() != this_rel_path.branch_path())
+            {
+              std::cout << "\n  " << this_rel_path.branch_path().string() << '/';
+            }
+            std::cout << "\n    " << this_rel_path.leaf() << ':';
+          }
+        }
+        if ( current.library != itr->library
+          || current.rel_path != itr->rel_path
+          || current.msg != itr->msg )
+        {
+          const string m = itr->msg;
+
+          if ( display_full == display_mode )
+              std::cout << "    " << m << '\n';
+          else
+              std::cout << ' ' << m;
+        }
+        current.library = itr->library;
+        current.rel_path = itr->rel_path;
+        current.msg = itr->msg;
       }
-      if ( current.library != itr->library
-        || current.rel_path != itr->rel_path )
+      std::cout << "\n";
+    }
+    else
+    {
+      // display error messages with group indication
+      error_msg current;
+      string sep;
+      bool first = true;
+      for ( error_msg_vector::iterator itr ( msgs.begin() );
+        itr != msgs.end(); ++itr )
       {
-        std::cout << "\n";
-        std::cout << itr->rel_path;
-        sep = ": ";
+        if ( current.library != itr->library )
+        {
+          if ( !first ) std::cout << "</pre>\n";
+          std::cout << "\n<h3><a name=\"" << itr->library
+                    << "\">" << itr->library << "</a></h3>\n<pre>";
+        }
+        if ( current.library != itr->library
+          || current.rel_path != itr->rel_path )
+        {
+          std::cout << "\n";
+          std::cout << itr->rel_path;
+          sep = ": ";
+        }
+        if ( current.library != itr->library
+          || current.rel_path != itr->rel_path
+          || current.msg != itr->msg )
+        {
+          std::cout << sep << itr->msg;
+          sep = ", ";
+        }
+        current.library = itr->library;
+        current.rel_path = itr->rel_path;
+        current.msg = itr->msg;
+        first = false;
       }
-      if ( current.library != itr->library
-        || current.rel_path != itr->rel_path
-        || current.msg != itr->msg )
-      {
-        std::cout << sep << itr->msg;
-        sep = ", ";
-      }
-      current.library = itr->library;
-      current.rel_path = itr->rel_path;
-      current.msg = itr->msg;
-      first = false;
-   }
-   std::cout << "</pre>\n";
+      std::cout << "</pre>\n";
+    }
   }
 
   const char * options()
@@ -283,9 +401,29 @@
          "  -long_name\n"
          "  -tab\n"
          "  -minmax\n"
-         "default is all checks on; otherwise options specify desired checks\n";
+         "  -unnamed\n"
+         " default is all checks on; otherwise options specify desired checks"
+         "\n";
   }
 
+  const char * doctype_declaration()
+  {
+    return
+         "<!DOCTYPE html PUBLIC \"-//W3C//DTD XHTML 1.0 Strict//EN\"\n"
+         "\"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd\">"
+         ;
+  }
+
+  std::string validator_link(const std::string & text)
+  {
+    return
+        // with link to validation service
+        "<a href=\"http://validator.w3.org/check?uri=referer\">"
+        + text
+        + "</a>"
+        ;
+  }
+
 } // unnamed namespace
 
 namespace boost
@@ -318,7 +456,7 @@
 //        << msg << '\n';
 
     }
-    
+
     source_inspector::source_inspector()
     {
       // C/C++ source code...
@@ -331,12 +469,12 @@
       register_signature( ".hxx" );
       register_signature( ".inc" );
       register_signature( ".ipp" );
-      
+
       // Boost.Build BJam source code...
       register_signature( "Jamfile" );
       register_signature( ".jam" );
       register_signature( ".v2" );
-      
+
       // Other scripts; Python, shell, autoconfig, etc.
       register_signature( "configure.in" );
       register_signature( "GNUmakefile" );
@@ -346,7 +484,7 @@
       register_signature( ".pl" );
       register_signature( ".py" );
       register_signature( ".sh" );
-      
+
       // Hypertext, Boost.Book, and other text...
       register_signature( "news" );
       register_signature( "readme" );
@@ -365,7 +503,7 @@
       register_signature( ".xsd" );
       register_signature( ".xsl" );
     }
-    
+
     hypertext_inspector::hypertext_inspector()
     {
       register_signature( ".htm" );
@@ -375,18 +513,19 @@
 
 //  impute_library  ----------------------------------------------------------//
 
+    // may return an empty string [gps]
     string impute_library( const path & full_dir_path )
     {
       path relative( relative_to( full_dir_path, fs::initial_path() ),
         fs::no_check );
       if ( relative.empty() ) return "boost-root";
       string first( *relative.begin() );
-      string second =  // borland 5.61 requires op=  
+      string second =  // borland 5.61 requires op=
         ++relative.begin() == relative.end()
           ? string() : *++relative.begin();
 
       if ( first == "boost" )
-        return second.empty() ? string( "unknown" ) : second;
+        return second;
 
       return (( first == "libs" || first == "tools" ) && !second.empty())
         ? second : first;
@@ -397,19 +536,21 @@
 
 //  cpp_main()  --------------------------------------------------------------//
 
-#include <boost/test/included/prg_exec_monitor.hpp>
-
-int cpp_main( int argc, char * argv[] )
+int cpp_main( int argc_param, char * argv_param[] )
 {
-  fs::initial_path();
+  // <hack> for the moment, let's be on the safe side
+  // and ensure we don't modify anything being pointed to;
+  // then we'll do some cleanup here
+  int argc = argc_param;
+  const char* const * argv = &argv_param[0];
 
   if ( argc > 1 && (std::strcmp( argv[1], "-help" ) == 0
     || std::strcmp( argv[1], "--help" ) == 0 ) )
   {
-    std::clog << "Usage: inspect [-cvs] [options...]\n"
-      "options:\n"
-      << options();
-    return 1;
+    std::clog << "Usage: inspect [-cvs] [-text] [-brief] [options...]\n\n"
+      " Options:\n"
+      << options() << '\n';
+    return 0;
   }
 
   bool license_ck = true;
@@ -419,6 +560,7 @@
   bool long_name_ck = true;
   bool tab_ck = true;
   bool minmax_ck = true;
+  bool unnamed_ck = true;
   bool cvs = false;
 
   if ( argc > 1 && std::strcmp( argv[1], "-cvs" ) == 0 )
@@ -427,6 +569,18 @@
     --argc; ++argv;
   }
 
+  if ( argc > 1 && std::strcmp( argv[1], "-text" ) == 0 )
+  {
+    display_format = display_text;
+    --argc; ++argv;
+  }
+
+  if ( argc > 1 && std::strcmp( argv[1], "-brief" ) == 0 )
+  {
+    display_mode = display_brief;
+    --argc; ++argv;
+  }
+
   if ( argc > 1 && *argv[1] == '-' )
   {
     license_ck = false;
@@ -436,8 +590,10 @@
     long_name_ck = false;
     tab_ck = false;
     minmax_ck = false;
+    unnamed_ck = false;
   }
 
+  bool invalid_options = false;
   for(; argc > 1; --argc, ++argv )
   {
     if ( std::strcmp( argv[1], "-license" ) == 0 )
@@ -454,15 +610,28 @@
       tab_ck = true;
     else if ( std::strcmp( argv[1], "-minmax" ) == 0 )
         minmax_ck = true;
+    else if ( std::strcmp( argv[1], "-unnamed" ) == 0 )
+        unnamed_ck = true;
     else
     {
-      std::cerr << "unknown option: " << argv[1]
-      << "\nvalid options are:\n"
-      << options();
-      return 1;
+      std::cerr << "unknown option: " << argv[1] << '\n';
+      invalid_options = true;
     }
   }
+  if ( invalid_options ) {
+      std::cerr << "\nvalid options are:\n"
+                << options();
+      return 1;
+  }
 
+  string inspector_keys;
+  fs::initial_path();
+
+  {
+
+  // note how this is in its own block; reporting will happen
+  // automatically, from each registered inspector, when
+  // leaving, due to destruction of the inspector_list object
   inspector_list inspectors;
 
   if ( license_ck )
@@ -474,11 +643,13 @@
   if ( link_ck )
     inspectors.push_back( inspector_element( new boost::inspect::link_check ) );
   if ( long_name_ck )
-    inspectors.push_back( inspector_element( new boost::inspect::long_name_check ) );
+    inspectors.push_back( inspector_element( new boost::inspect::file_name_check ) );
   if ( tab_ck )
       inspectors.push_back( inspector_element( new boost::inspect::tab_check ) );
   if ( minmax_ck )
       inspectors.push_back( inspector_element( new boost::inspect::minmax_check ) );
+  if ( unnamed_ck )
+      inspectors.push_back( inspector_element( new boost::inspect::unnamed_namespace_check ) );
 
   // perform the actual inspection, using the requested type of iteration
   if ( cvs )
@@ -495,54 +666,120 @@
     itr->inspector->close();
   }
 
-  char run_date[128];
-  std::time_t tod;
-  std::time( &tod );
-  std::strftime( run_date, sizeof(run_date),
-    "%X UTC, %A %d %B %Y", std::gmtime( &tod ) );
+  string run_date ( "n/a" );
+  boost::time_string( run_date );
 
-  std::cout << "<html>\n"
-          "<head>\n"
-          "<title>Boost Inspection Report</title>\n"
-          "</head>\n"
-          "<body bgcolor=\"#ffffff\" text=\"#000000\">\n"
-          "<table border=\"0\">\n"
-          "<tr>\n"
-          "<td><img border=\"0\" src=\"../boost.png\" width=\"277\" "
-          "height=\"86\"></td>\n"
-          "<td align=\"center\">\n"
-          "<h1>Boost Inspection Report</h1>\n"
-          "<b>Run Date:</b> " << run_date  << "\n"
-          "</td>\n"
-          "</table>\n"
-          "<p>An <a href=\"http://www.boost.org/tools/inspect/index.html\">inspection\n" 
-          "program</a> checks each file in the current Boost CVS for various problems,\n" 
-          "generating this web page as output. Problems detected include tabs in files,\n" 
-          "missing copyrights, broken URL's, and similar misdemeanors.</p>\n"
-          ;
+  if (display_text == display_format)
+  {
+    std::cout
+      <<
+        "Boost Inspection Report\n"
+        "Run Date: " << run_date  << "\n"
+        "\n"
+        "An inspection program <http://www.boost.org/tools/inspect/index.html>\n"
+        "checks each file in the current Boost CVS for various problems,\n"
+        "generating this as output. Problems detected include tabs in files,\n"
+        "missing copyrights, broken URL's, and similar misdemeanors.\n"
+        "\n"
+      ;
 
-  std::cout << "<h2>Totals</h2>\n<pre>"
-            << file_count << " files scanned\n"
-            << directory_count << " directories scanned\n"
-            << error_count << " problems reported\n";
+    std::cout
+      << "Totals:\n"
+      << "  " << file_count << " files scanned\n"
+      << "  " << directory_count << " directories scanned (including root)\n"
+      << "  " << error_count << " problems reported\n"
+      << '\n'
+      ;
+  }
+  else
+  {
+    //
+    std::cout << doctype_declaration() << '\n';
 
-  std::cout << "\nproblem counts:\n";
+    std::cout
+      << "<html>\n"
+      "<head>\n"
+      "<title>Boost Inspection Report</title>\n"
+      "</head>\n"
 
+      "<body>\n"
+      // we should not use a table, of course [gps]
+      "<table>\n"
+      "<tr>\n"
+      "<td><img src=\"../boost.png\" alt=\"Boost logo\" />"
+      "</td>\n"
+      "<td>\n"
+      "<h1>Boost Inspection Report</h1>\n"
+      "<b>Run Date:</b> " << run_date  << "\n"
+      "&nbsp;&nbsp;/ " << validator_link( "validate me" ) << " /\n"
+      "</td>\n"
+      "</tr>\n"
+      "</table>\n"
+
+      "<p>An <a href=\"http://www.boost.org/tools/inspect/index.html\">inspection\n"
+      "program</a> checks each file in the current Boost CVS for various problems,\n"
+      "generating this web page as output. Problems detected include tabs in files,\n"
+      "missing copyrights, broken URL's, and similar misdemeanors.</p>\n"
+      ;
+
+    std::cout
+      << "<h2>Totals</h2>\n<pre>"
+      << file_count << " files scanned\n"
+      << directory_count << " directories scanned (including root)\n"
+      << error_count << " problems reported\n";
+  }
+
   for ( inspector_list::iterator itr = inspectors.begin();
         itr != inspectors.end(); ++itr )
   {
-    itr->inspector.reset();
+    const string line_break (
+        display_text == display_format? "\n" : "<br />\n"); // gps
+
+    inspector_keys += static_cast<string>("  ")
+        + itr->inspector->name()
+        + ' ' + itr->inspector->desc()
+        + line_break
+        ;
   }
 
+  
+  std::cout
+      << "\nProblem counts:\n";
+
+  } // end of block: starts reporting
+
+  if (display_text == display_format)
+  {
+    std::cout << "\n" ;
+  }
+
   std::sort( msgs.begin(), msgs.end() );
 
   if ( !msgs.empty() )
   {
     display_summary();
+
+    if (display_text == display_format)
+    {
+      std::cout << "Details:\n" << inspector_keys;
+    }
+    else
+    {
+      std::cout << "<h2>Details</h2>\n" << inspector_keys;
+    }
     display_details();
   }
 
-  std::cout << "</body>\n"
-               "</html>\n";
+  if (display_text == display_format)
+  {
+    std::cout << "\n\n" ;
+  }
+  else
+  {
+    std::cout
+      << "</body>\n"
+      "</html>\n";
+  }
+
   return 0;
 }

Modified: boost/trunk/tools/inspect/inspector.hpp
===================================================================
--- boost/trunk/tools/inspect/inspector.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/inspector.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,6 +2,8 @@
 
 //  Copyright Beman Dawes 2002.
 //  Copyright Rene Rivera 2004.
+//  Copyright Gennaro Prota 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)
@@ -9,10 +11,11 @@
 #ifndef BOOST_INSPECTOR_HPP
 #define BOOST_INSPECTOR_HPP
 
+#include <set>
+#include <iostream>
+#include <ostream>
 #include <string>
-#include <iostream>
-#include <set>
-#include <boost/filesystem/path.hpp>
+#include "boost/filesystem/path.hpp"
 
 using std::string;
 using boost::filesystem::path;
@@ -22,9 +25,12 @@
   namespace inspect
   {
     typedef std::set< string > string_set;
-        
+
     class inspector
     {
+    protected:
+        inspector() {}
+
     public:
       virtual ~inspector() {}
 
@@ -33,14 +39,16 @@
 
       // always called:
       virtual void inspect(
-        const string & library_name, // "filesystem"
-        const path & full_path ) {}  // "c:/foo/boost/filesystem/path.hpp"
+        const string & /*library_name*/, // "filesystem"
+        const path & /*full_path*/ ) {}  // "c:/foo/boost/filesystem/path.hpp"
 
       // called only for registered leaf() signatures:
       virtual void inspect(
         const string & library_name, // "filesystem"
         const path & full_path,      // "c:/foo/boost/filesystem/path.hpp"
-        const string & contents ) {} // contents of file
+        const string & contents )    // contents of file
+      = 0
+      ;
 
       // called after all paths visited, but still in time to call error():
       virtual void close() {}
@@ -59,7 +67,7 @@
     private:
       string_set m_signatures;
     };
-    
+
     // for inspection of source code of one form or other
     class source_inspector : public inspector
     {
@@ -67,7 +75,7 @@
       // registers the basic set of known source signatures
       source_inspector();
     };
-    
+
     // for inspection of hypertext, specifically html
     class hypertext_inspector : public inspector
     {
@@ -78,17 +86,16 @@
 
     inline string relative_to( const path & src_arg, const path & base_arg )
     {
-      path src( src_arg );
-      src.normalize();
       path base( base_arg );
       base.normalize();
       string::size_type pos( base.string().size() );
-      return src.string().substr(
-        pos + ( pos < src.string().size() ? 1 : 0 ) );
+      path src( src_arg.string().substr(pos) );
+      src.normalize();
+      return src.string().substr(1);
     }
 
     string impute_library( const path & full_dir_path );
- 
+
   }
 }
 

Modified: boost/trunk/tools/inspect/license_check.cpp
===================================================================
--- boost/trunk/tools/inspect/license_check.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/license_check.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -5,13 +5,18 @@
 //  (See accompanying file LICENSE_1_0.txt or copy at
 //  http://www.boost.org/LICENSE_1_0.txt)
 
-#include <boost/regex.hpp>
+#include "boost/regex.hpp"
 #include "license_check.hpp"
 
 namespace
 {
   boost::regex license_regex(
-    "boost(\\s+|\\s+#\\s*|\\s+//\\s*)software(\\s+|\\s+#\\s*|\\s+//\\s*)license",
+    //~ The next two lines change the regex so that it detects when the license
+    //~ doesn't follow the prefered statement. Disabled because it currently
+    //~ generates a large number of issues.
+    //~ "Distributed[\\s\\W]+"
+    //~ "under[\\s\\W]+the[\\s\\W]+"
+    "boost[\\s\\W]+software[\\s\\W]+license",
     boost::regbase::normal | boost::regbase::icase);
 
 } // unnamed namespace
@@ -23,16 +28,18 @@
    license_check::license_check() : m_files_with_errors(0)
    {
    }
-     
+
    void license_check::inspect(
       const string & library_name,
       const path & full_path,   // example: c:/foo/boost/filesystem/path.hpp
       const string & contents )     // contents of file to be inspected
     {
+      if (contents.find( "boostinspect:" "nolicense" ) != string::npos) return;
+
       if ( !boost::regex_search( contents, license_regex ) )
       {
         ++m_files_with_errors;
-        error( library_name, full_path, desc() );
+        error( library_name, full_path, name() );
       }
     }
   } // namespace inspect

Modified: boost/trunk/tools/inspect/license_check.hpp
===================================================================
--- boost/trunk/tools/inspect/license_check.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/license_check.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,6 +2,7 @@
 
 //  Copyright Beman Dawes 2002, 2003.
 //  Copyright Rene Rivera 2004.
+//
 //  Distributed under the Boost Software License, Version 1.0.
 //  (See accompanying file LICENSE_1_0.txt or copy at
 //  http://www.boost.org/LICENSE_1_0.txt)
@@ -21,8 +22,8 @@
     public:
 
       license_check();
-      virtual const char * name() const { return "license-check"; }
-      virtual const char * desc() const { return "missing Boost license info"; }
+      virtual const char * name() const { return "*L*"; }
+      virtual const char * desc() const { return "missing Boost license info, or wrong reference text"; }
 
       virtual void inspect(
         const std::string & library_name,
@@ -31,7 +32,7 @@
 
       virtual ~license_check()
         { std::cout << "  "
-            << m_files_with_errors << " files missing Boost license info\n"; }
+            << m_files_with_errors << " files missing Boost license info or having wrong reference text\n"; }
     };
   }
 }

Modified: boost/trunk/tools/inspect/link_check.cpp
===================================================================
--- boost/trunk/tools/inspect/link_check.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/link_check.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,14 +1,14 @@
 //  link_check implementation  -----------------------------------------------//
 
 //  Copyright Beman Dawes 2002.
+//
 //  Distributed under the Boost Software License, Version 1.0.
 //  (See accompanying file LICENSE_1_0.txt or copy at
 //  http://www.boost.org/LICENSE_1_0.txt)
 
 #include "link_check.hpp"
-#include <boost/regex.hpp>
-#include <boost/filesystem/operations.hpp>
-#include <boost/filesystem/exception.hpp>
+#include "boost/regex.hpp"
+#include "boost/filesystem/operations.hpp"
 
 namespace fs = boost::filesystem;
 
@@ -27,17 +27,17 @@
   {
 
 //  link_check constructor  --------------------------------------------------//
-    
+
    link_check::link_check()
      : m_broken_errors(0), m_unlinked_errors(0), m_invalid_errors(0),
        m_bookmark_errors(0)
    {
    }
-     
+
 //  inspect (all)  -----------------------------------------------------------//
 
    void link_check::inspect(
-      const string & library_name,
+      const string & /*library_name*/,
       const path & full_path )
     {
       // keep track of paths already encountered to reduce disk activity
@@ -52,22 +52,24 @@
       const path & full_path,   // example: c:/foo/boost/filesystem/path.hpp
       const string & contents )     // contents of file to be inspected
     {
+      if (contents.find( "boostinspect:" "nolink" ) != string::npos) return;
+
       string::const_iterator start( contents.begin() );
       string::const_iterator end( contents.end() );
-      boost::match_results< string::const_iterator > what; 
-      boost::match_flag_type flags = boost::match_default; 
+      boost::match_results< string::const_iterator > what;
+      boost::match_flag_type flags = boost::match_default;
 
-      while( boost::regex_search( start, end, what, url_regex, flags) ) 
-      { 
+      while( boost::regex_search( start, end, what, url_regex, flags) )
+      {
         // what[0] contains the whole string iterators.
-        // what[1] contains the URL iterators. 
+        // what[1] contains the URL iterators.
         do_url( string( what[1].first, what[1].second ),
           library_name, full_path );
 
         start = what[0].second; // update search position
         flags |= boost::match_prev_avail; // update flags
-        flags |= boost::match_not_bob; 
-      } 
+        flags |= boost::match_not_bob;
+      }
     }
 
 //  do_url  ------------------------------------------------------------------//
@@ -87,7 +89,7 @@
       if ( url.find( "file:" ) == 0 )
       {
         ++m_invalid_errors;
-        error( library_name, source_path, "invalid URL (hardwired file): " + url );
+        error( library_name, source_path, string(name()) + " invalid URL (hardwired file): " + url );
         return;
       }
 
@@ -95,9 +97,9 @@
       if ( url.find_first_of( " <>\"{}|\\^[]'" ) != string::npos )
       {
         ++m_invalid_errors;
-        error( library_name, source_path, "invalid character in URL: " + url );
+        error( library_name, source_path, string(name()) + " invalid character in URL: " + url );
       }
-      
+
       // strip url of bookmarks
       string plain_url( url );
       string::size_type pos( plain_url.find( '#' ) );
@@ -108,7 +110,7 @@
         if ( url.find( '#', pos+1 ) != string::npos )
         {
           ++m_bookmark_errors;
-          error( library_name, source_path, "invalid bookmark: " + url );
+          error( library_name, source_path, string(name()) + " invalid bookmark: " + url );
         }
       }
 
@@ -116,13 +118,13 @@
       if ( plain_url[0]=='.' && plain_url[1]=='/' ) plain_url.erase( 0, 2 );
 
       // url is relative source_path.branch()
-      // convert to target_path, which is_complete() 
+      // convert to target_path, which is_complete()
       path target_path;
       try { target_path = source_path.branch_path() /= path( plain_url, fs::no_check ); }
       catch ( const fs::filesystem_error & )
       {
         ++m_invalid_errors;
-        error( library_name, source_path, "invalid URL: " + url );
+        error( library_name, source_path, string(name()) + " invalid URL: " + url );
         return;
       }
 
@@ -143,7 +145,7 @@
       if ( (itr->second & m_present) == 0 )
       {
         ++m_broken_errors;
-        error( library_name, source_path, "broken link: " + url );
+        error( library_name, source_path, string(name()) + " broken link: " + url );
       }
     }
 
@@ -164,7 +166,7 @@
        {
          ++m_unlinked_errors;
          path full_path( fs::initial_path() / path(itr->first, fs::no_check) );
-         error( impute_library( full_path ), full_path, "unlinked file" );
+         error( impute_library( full_path ), full_path, string(name()) + " unlinked file" );
        }
      }
    }

Modified: boost/trunk/tools/inspect/link_check.hpp
===================================================================
--- boost/trunk/tools/inspect/link_check.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/link_check.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,11 +9,10 @@
 #ifndef BOOST_LINK_CHECK_HPP
 #define BOOST_LINK_CHECK_HPP
 
-#include "inspector.hpp"
-
 #include <map>
-#include <utility> // for make_pair()
 
+#include "inspector.hpp"
+
 namespace boost
 {
   namespace inspect
@@ -36,7 +35,7 @@
     public:
 
       link_check();
-      virtual const char * name() const { return "link-check"; }
+      virtual const char * name() const { return "*A*"; }
       virtual const char * desc() const { return "invalid bookmarks, invalid urls, broken links, unlinked files"; }
 
       virtual void inspect(

Modified: boost/trunk/tools/inspect/long_name_check.cpp
===================================================================
--- boost/trunk/tools/inspect/long_name_check.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/long_name_check.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,35 +1,46 @@
 //  long_name_check implementation  ------------------------------------------//
 
 //  Copyright Beman Dawes 2002.
+//  Copyright Gennaro Prota 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)
 
 #include "long_name_check.hpp"
 
-#include <boost/filesystem/operations.hpp>
-#include <boost/filesystem/exception.hpp>
-#include <boost/bind.hpp>
-#include <boost/next_prior.hpp>
+#include "boost/filesystem/operations.hpp"
+#include "boost/lexical_cast.hpp"
 
 #include <locale>
 #include <algorithm>
 
 namespace { namespace aux {
 
-bool starts_with_nonalpha( std::string const& x )
+bool starts_with_nonalpha( path const & p )
 {
-  return !std::isalpha( *x.begin(), std::locale::classic() )
-      && *x.begin() != '_'
+  const string & x = p.string();
+  assert(!x.empty());
+
+  const string::value_type first = x[0];
+
+  return !std::isalpha( first, std::locale::classic() )
+      && first != '_'
       && x != ".cvsignore"
       ;
 }
 
-bool contains_dot( std::string const& x )
+bool contains_dot( path const & p)
 {
-    return x.find( '.' ) != std::string::npos;
+    return p.string().find( '.' ) != std::string::npos;
 }
 
+// ISO 9660
+path::iterator::difference_type depth( path const & p)
+{
+    return std::distance( p.begin(), p.end() );
+}
+
 }}
 
 
@@ -37,58 +48,96 @@
 {
   namespace inspect
   {
-    long_name_check::long_name_check() : m_long_name_errors(0) {}
-     
-    void long_name_check::inspect(
+    const char file_name_check::limits::name[] = "ISO 9660 Level 3";
+
+    file_name_check::file_name_check() : m_name_errors(0) {}
+
+    void file_name_check::inspect(
       const string & library_name,
       const path & full_path )
     {
       std::string const leaf( full_path.leaf() );
 
-      if ( leaf.size() > 31 )
+      // checks on the leaf name ----------------------------------//
       {
-        ++m_long_name_errors;
-        error( library_name, full_path, "filename &gt; 31 chars" );
+          const unsigned m = filesystem::is_directory(full_path)
+              ? limits::max_dirname_length
+              : limits::max_filename_length;
+
+          if ( leaf.size() > m )
+          {
+              ++m_name_errors;
+              error( library_name, full_path, string(name())
+                  + " name exceeds "
+                  + boost::lexical_cast<string>(m)
+                  + " characters" );
+          }
       }
 
       if ( std::count( leaf.begin(), leaf.end(), '.' ) > 1 )
       {
-        ++m_long_name_errors;
-        error( library_name, full_path, "filename contains more than one dot character ('.')" );
+        ++m_name_errors;
+        error( library_name, full_path, string(name())
+            + " name contains more than one dot character ('.')" );
       }
 
       if ( *leaf.rbegin() == '.' )
       {
-        ++m_long_name_errors;
-        error( library_name, full_path, "filename ends with the dot character ('.')" );
+        ++m_name_errors;
+        error( library_name, full_path, string(name())
+            + " filename ends with the dot character ('.')" );
       }
-      
-      path const relative_path( relative_to( full_path, filesystem::initial_path() ), &filesystem::no_check );
 
-      if ( std::find_if( relative_path.begin(), relative_path.end(), boost::bind( &aux::starts_with_nonalpha, _1 ) )
-            != relative_path.end() )
+      path const relative_path(
+          relative_to( full_path, filesystem::initial_path() )
+          , &filesystem::no_check );
+
+
+      // checks on the directory name --------------------------- //
+
+      if( aux::starts_with_nonalpha( path(leaf)) )
       {
-        ++m_long_name_errors;
-        error( library_name, full_path, "leading character of one of the path compontents is not alphabetic" );
+        ++m_name_errors;
+        error( library_name, full_path, string(name())
+            + " leading character of \""
+            + leaf + "\""
+            + " is not alphabetic" );
       }
 
-      if ( std::find_if( relative_path.begin(), boost::prior( relative_path.end() )
-            , boost::bind( &aux::contains_dot, _1 ) ) != boost::prior( relative_path.end() ) )
+      if ( filesystem::is_directory( full_path )
+          && aux::contains_dot( relative_path ) )
       {
-        ++m_long_name_errors;
-        error( library_name, full_path, "directory name contains the dot character ('.')" );
+        ++m_name_errors;
+        error( library_name, full_path, string(name())
+            + " directory name contains the dot character ('.')" );
       }
 
-      if ( std::distance( relative_path.begin(), boost::prior( relative_path.end() ) ) >= 8 )
       {
-        ++m_long_name_errors;
-        error( library_name, full_path, "file's directory depth will exceed 8 levels if placed on a CD" );
+          const int m = limits::max_directory_depth;
+          if ( filesystem::is_directory( full_path ) 
+              && aux::depth( relative_path) > m )
+          {
+              ++m_name_errors;
+              error( library_name, full_path, string(name())
+                  + " directory depth exceeds "
+                  + boost::lexical_cast<string>(m)
+                  + " (maximum for " + limits::name + " (CD-ROMs))" );
+          }
       }
 
-      if ( relative_path.string().size() > ( 100 - string( "boost_X_XX_X/" ).size() ) )
+      const unsigned max_relative_path = 100; // [gps] Explain this
+      const string generic_root( "boost_X_XX_X/" );
+      if ( relative_path.string().size() >
+          ( max_relative_path - generic_root.size() ) )
       {
-        ++m_long_name_errors;
-        error( library_name, full_path, "file path will be > 100 chars if placed on a CD" );
+        ++m_name_errors;
+        error( library_name, full_path,
+            string(name())
+            + " file path will exceed "
+            + boost::lexical_cast<string>(max_relative_path)
+            + " characters in a directory tree with a root of the form "
+            + generic_root )
+            ;
       }
 
       if (relative_path.leaf() != ".cvsignore")
@@ -99,15 +148,15 @@
         }
         catch ( filesystem::filesystem_error const& )
         {
-          ++m_long_name_errors;
-          error( library_name, full_path, "nonportable path" );
+          ++m_name_errors;
+          error( library_name, full_path, string(name()) + " nonportable path" );
         }
       }
     }
 
-    long_name_check::~long_name_check()
+    file_name_check::~file_name_check()
     {
-      std::cout << "  " << m_long_name_errors << " " << desc() << '\n';
+      std::cout << "  " << m_name_errors << " " << desc() << '\n';
     }
 
 

Modified: boost/trunk/tools/inspect/long_name_check.hpp
===================================================================
--- boost/trunk/tools/inspect/long_name_check.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/long_name_check.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,9 @@
 //  long_name_check header  --------------------------------------------------//
+//  (main class renamed to: file_name_check) - gps
 
 //  Copyright Beman Dawes 2002.
+//  Copyright Gennaro Prota 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)
@@ -14,19 +17,43 @@
 {
   namespace inspect
   {
-    class long_name_check : public inspector
+    class file_name_check : public inspector
     {
-      long m_long_name_errors;
+      long m_name_errors;
+
+      // ISO 9660 Level 3
+      //
+      struct iso_9660_limits
+      {
+          enum { max_directory_depth = 8 };
+          enum { max_dirname_length = 31 };
+          enum { max_filename_length = 31 }; // > level 2!
+
+          static const char name[];
+      };
+
     public:
-      long_name_check();
-      virtual ~long_name_check();
 
-      virtual const char * name() const { return "long-name-check"; }
-      virtual const char * desc() const { return "file names too long"; }
+      typedef iso_9660_limits limits;
 
+      file_name_check();
+      virtual ~file_name_check();
+
+      virtual const char * name() const { return "*N*"; }
+      virtual const char * desc() const { return "file/directory names issues"; }
+
       virtual void inspect(
-        const std::string & library_name,
+        const string & library_name,
         const path & full_path );
+
+      virtual void inspect(
+        const string &, // "filesystem"
+        const path &,   // "c:/foo/boost/filesystem/path.hpp"
+        const string &)
+      { /* empty */ }
+
+
+
     };
   }
 }

Modified: boost/trunk/tools/inspect/minmax_check.cpp
===================================================================
--- boost/trunk/tools/inspect/minmax_check.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/minmax_check.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,20 +1,32 @@
-//  minmax_check implementation  -----------------------------------------------//
+//  minmax_check implementation  --------------------------------------------//
 
-//  Copyright Beman Dawes 2002.
+//  Copyright Beman Dawes   2002.
+//  Copyright Gennaro Prota 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)
 
+
+#include <algorithm>
+
 #include "minmax_check.hpp"
-#include <boost/regex.hpp>
-#include <boost/lexical_cast.hpp>
+#include "boost/regex.hpp"
+#include "boost/lexical_cast.hpp"
 
 namespace
 {
   boost::regex minmax_regex(
-    "\\b(min|max)\\b" // match min or max, whole word
-    "\\s*\\(",        // followed by 0 or more spaces and an opening paren
-    boost::regex::normal);
+    "("
+    "^\\s*#\\s*undef\\s*" // # undef
+    "\\b(min|max)\\b"     // followed by min or max, whole word
+    ")"
+    "|"                   // or
+    "("
+    "\\b(min|max)\\b" // min or max, whole word
+    "\\s*\\("         // followed by 0 or more spaces and an opening paren
+    ")"
+    , boost::regex::normal);
 
 } // unnamed namespace
 
@@ -23,7 +35,7 @@
   namespace inspect
   {
 
-    //  minmax_check constructor  --------------------------------------------------//
+    //  minmax_check constructor  -------------------------------------------//
 
     minmax_check::minmax_check()
       : m_errors(0)
@@ -39,22 +51,68 @@
       register_signature( ".ipp" );
     }
 
-    //  inspect ( C++ source files )  ----------------------------------------------//
+    //  inspect ( C++ source files )  ---------------------------------------//
 
     void minmax_check::inspect(
       const string & library_name,
       const path & full_path,      // example: c:/foo/boost/filesystem/path.hpp
       const string & contents)     // contents of file to be inspected
     {
+      if (contents.find( "boostinspect:" "nominmax" ) != string::npos) return;
+
       boost::sregex_iterator cur(contents.begin(), contents.end(), minmax_regex), end;
 
-      for( ; cur != end; ++cur, ++m_errors )
+      for( ; cur != end; ++cur /*, ++m_errors*/ )
       {
-        std::string linenbr = boost::lexical_cast<string>(
-          std::count( contents.begin(), (*cur)[0].first, '\n' ) + 1);
+        // ~ experimental: try to filter out apparent
+        // ~ min/max guideline violations in one-line comments
+        //
+        // This is just a quick hack to avoid impacting the
+        // overall application design. To be on the safe side,
+        // we only aim at one-line comments; the comment must be
+        // the only non-blank content of the line, and no quote
+        // character or "*/" shall appear within it. Otherwise we
+        // give up filtering, at the cost of possible false positives.
+        //
+        const string one_line_comment_line ( "^\\s*//" );
 
-        error( library_name, full_path, "violation of Boost min/max guidelines on line " + linenbr );
-      } 
+        string::const_iterator it = contents.begin();
+        string::const_iterator match_it = (*cur)[0].first;
+
+        string::const_iterator line_start = it;
+
+        string::size_type line_number = 1;
+        for ( ; it != match_it; ++it) {
+            if (string::traits_type::eq(*it, '\n')) {
+                ++line_number;
+                line_start = it + 1; // could be end()
+            }
+        }
+
+        string::const_iterator past_line_content =
+            std::find(it, contents.end(), '\n');
+
+        // one-line comment spanning the whole line
+        // with no quotes and no "*/" pair
+        //
+        match_results<string::const_iterator> m;
+        const string whole_line( line_start, past_line_content );
+        const bool filter_out =
+               regex_search( line_start, past_line_content
+               , m, boost::regex(one_line_comment_line) )
+                 && string::npos == whole_line.find('\"')
+                 && string::npos == whole_line.find("*/")
+               ;
+
+        if (!filter_out) {
+
+                ++m_errors;
+                error( library_name, full_path, string(name())
+                    + " violation of Boost min/max guidelines on line "
+                    + boost::lexical_cast<string>( line_number ) );
+        }
+
+      }
     }
 
   } // namespace inspect

Modified: boost/trunk/tools/inspect/minmax_check.hpp
===================================================================
--- boost/trunk/tools/inspect/minmax_check.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/minmax_check.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,9 @@
 //  minmax_check header  -------------------------------------------------------//
 
-//  Copyright Beman Dawes 2002
-//  Copyright Rene Rivera 2004.
+//  Copyright Beman Dawes   2002
+//  Copyright Rene Rivera   2004.
+//  Copyright Gennaro Prota 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)
@@ -22,8 +24,10 @@
     public:
 
       minmax_check();
-      virtual const char * name() const { return "minmax-check"; }
-      virtual const char * desc() const { return "uses of min and max that have not been protected from the min/max macros"; }
+      virtual const char * name() const { return "*M*"; }
+      virtual const char * desc() const { return "uses of min or max that"
+          " have not been protected from the min/max macros,"
+          " or unallowed #undef-s"; }
 
       virtual void inspect(
         const std::string & library_name,

Copied: boost/trunk/tools/inspect/run_inspect.sh (from rev 14034, boost/branches/upstream/current/tools/inspect/run_inspect.sh)

Modified: boost/trunk/tools/inspect/tab_check.cpp
===================================================================
--- boost/trunk/tools/inspect/tab_check.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/tab_check.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,7 @@
 //  tab_check implementation  ------------------------------------------------//
 
 //  Copyright Beman Dawes 2002.
+//
 //  Distributed under the Boost Software License, Version 1.0.
 //  (See accompanying file LICENSE_1_0.txt or copy at
 //  http://www.boost.org/LICENSE_1_0.txt)
@@ -23,17 +24,18 @@
      register_signature( "Jamfile" );
      register_signature( ".py" );
    }
-     
+
    void tab_check::inspect(
       const string & library_name,
       const path & full_path,   // example: c:/foo/boost/filesystem/path.hpp
       const string & contents )     // contents of file to be inspected
     {
-      if ( contents.find( '\t' ) != string::npos &&
-           contents.find( "boostinspect:notab" ) == string::npos)
+      if (contents.find( "boostinspect:" "notab" ) != string::npos) return;
+
+      if ( contents.find( '\t' ) != string::npos )
       {
         ++m_files_with_errors;
-        error( library_name, full_path, desc() );
+        error( library_name, full_path, name() );
       }
     }
   } // namespace inspect

Modified: boost/trunk/tools/inspect/tab_check.hpp
===================================================================
--- boost/trunk/tools/inspect/tab_check.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/inspect/tab_check.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -20,7 +20,7 @@
     public:
 
       tab_check();
-      virtual const char * name() const { return "tab-check"; }
+      virtual const char * name() const { return "*T*"; }
       virtual const char * desc() const { return "tabs in file"; }
 
       virtual void inspect(

Copied: boost/trunk/tools/inspect/time_string.hpp (from rev 14034, boost/branches/upstream/current/tools/inspect/time_string.hpp)

Copied: boost/trunk/tools/inspect/unnamed_namespace_check.cpp (from rev 14034, boost/branches/upstream/current/tools/inspect/unnamed_namespace_check.cpp)

Copied: boost/trunk/tools/inspect/unnamed_namespace_check.hpp (from rev 14034, boost/branches/upstream/current/tools/inspect/unnamed_namespace_check.hpp)

Modified: boost/trunk/tools/jam/doc/bjam.qbk
===================================================================
--- boost/trunk/tools/jam/doc/bjam.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/jam/doc/bjam.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,6 +1,6 @@
 [article Boost.Jam
     [quickbook 1.3]
-    [version 3.1.12]
+    [version: 3.1.14]
     [authors [Rivera, Rene], [Abrahams, David], [Prus, Vladimir]]
     [copyright 2003 2004 2005 2006 Rene Rivera, David Abrahams, Vladimir Prus]
     [category tool-build]
@@ -21,7 +21,7 @@
 
 [/ Shortcuts ]
 
-[def :version:              3.1.12]
+[def :version: 3.1.14]
 
 [/ Images ]
 

Modified: boost/trunk/tools/jam/index.html
===================================================================
--- boost/trunk/tools/jam/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/jam/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,6 +4,12 @@
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
   <meta http-equiv="refresh" content="0; URL=../../doc/html/jam.html" />
+  <!-- boostinspect:nolink -->
+  <!--
+  Copyright 2006 Rene Rivera.
+  Distributed under the Boost Software License, Version 1.0.
+  (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
+  -->
 
   <title></title>
 </head>

Modified: boost/trunk/tools/jam/src/boost-jam.spec
===================================================================
--- boost/trunk/tools/jam/src/boost-jam.spec	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/jam/src/boost-jam.spec	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 Name: boost-jam
-Version: 3.1.12
+Version: 3.1.14
 Summary: Build tool
 Release: 1
 Source: %{name}-%{version}.tgz
@@ -52,7 +52,7 @@
 ln -sf bjam-%{version} $RPM_BUILD_ROOT%{_bindir}/bjam
 cp -R *.html *.png *.css LICENSE*.txt images jam $RPM_BUILD_ROOT%{_docdir}/%{name}-%{version}
 
-find $RPM_BUILD_ROOT -name CVS -type d -depth -exec rm -r {} \;
+find $RPM_BUILD_ROOT -name CVS -type d -exec rm -r {} \;
 
 %files
 %defattr(-,root,root)

Modified: boost/trunk/tools/jam/src/build.bat
===================================================================
--- boost/trunk/tools/jam/src/build.bat	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/jam/src/build.bat	2007-02-16 16:48:35 UTC (rev 14035)
@@ -59,94 +59,94 @@
 
 setlocal & endlocal
 if NOT "_%VS80COMNTOOLS%_" == "__" (
-    set BOOST_JAM_TOOLSET=vc8
-    set BOOST_JAM_TOOLSET_ROOT=%VS80COMNTOOLS%..\..\VC\
+    set "BOOST_JAM_TOOLSET=vc8"
+    set "BOOST_JAM_TOOLSET_ROOT=%VS80COMNTOOLS%..\..\VC\"
     goto :eof)
 setlocal & endlocal
 if EXIST "%ProgramFiles%\Microsoft Visual Studio 8\VC\bin\VCVARS32.BAT" (
-    set BOOST_JAM_TOOLSET=vc8
-    set BOOST_JAM_TOOLSET_ROOT=%ProgramFiles%\Microsoft Visual Studio 8\VC\
+    set "BOOST_JAM_TOOLSET=vc8"
+    set "BOOST_JAM_TOOLSET_ROOT=%ProgramFiles%\Microsoft Visual Studio 8\VC\"
     goto :eof)
 setlocal & endlocal
 if NOT "_%VS71COMNTOOLS%_" == "__" (
-    set BOOST_JAM_TOOLSET=vc7
-    set BOOST_JAM_TOOLSET_ROOT=%VS71COMNTOOLS%\..\..\VC7\
+    set "BOOST_JAM_TOOLSET=vc7"
+    set "BOOST_JAM_TOOLSET_ROOT=%VS71COMNTOOLS%\..\..\VC7\"
     goto :eof)
 setlocal & endlocal
 if NOT "_%VCINSTALLDIR%_" == "__" (
-    set BOOST_JAM_TOOLSET=vc7
-    set BOOST_JAM_TOOLSET_ROOT=%VCINSTALLDIR%\VC7\
+    set "BOOST_JAM_TOOLSET=vc7"
+    set "BOOST_JAM_TOOLSET_ROOT=%VCINSTALLDIR%\VC7\"
     goto :eof)
 setlocal & endlocal
 if EXIST "%ProgramFiles%\Microsoft Visual Studio .NET 2003\VC7\bin\VCVARS32.BAT" (
-    set BOOST_JAM_TOOLSET=vc7
-    set BOOST_JAM_TOOLSET_ROOT=%ProgramFiles%\Microsoft Visual Studio .NET 2003\VC7\
+    set "BOOST_JAM_TOOLSET=vc7"
+    set "BOOST_JAM_TOOLSET_ROOT=%ProgramFiles%\Microsoft Visual Studio .NET 2003\VC7\"
     goto :eof)
 setlocal & endlocal
 if EXIST "%ProgramFiles%\Microsoft Visual Studio .NET\VC7\bin\VCVARS32.BAT" (
-    set BOOST_JAM_TOOLSET=vc7
-    set BOOST_JAM_TOOLSET_ROOT=%ProgramFiles%\Microsoft Visual Studio .NET\VC7\
+    set "BOOST_JAM_TOOLSET=vc7"
+    set "BOOST_JAM_TOOLSET_ROOT=%ProgramFiles%\Microsoft Visual Studio .NET\VC7\"
     goto :eof)
 setlocal & endlocal
 if NOT "_%MSVCDir%_" == "__" (
-    set BOOST_JAM_TOOLSET=msvc
-    set BOOST_JAM_TOOLSET_ROOT=%MSVCDir%\
+    set "BOOST_JAM_TOOLSET=msvc"
+    set "BOOST_JAM_TOOLSET_ROOT=%MSVCDir%\"
     goto :eof)
 setlocal & endlocal
 if EXIST "%ProgramFiles%\Microsoft Visual Studio\VC98\bin\VCVARS32.BAT" (
-    set BOOST_JAM_TOOLSET=msvc
-    set BOOST_JAM_TOOLSET_ROOT=%ProgramFiles%\Microsoft Visual Studio\VC98\
+    set "BOOST_JAM_TOOLSET=msvc"
+    set "BOOST_JAM_TOOLSET_ROOT=%ProgramFiles%\Microsoft Visual Studio\VC98\"
     goto :eof)
 setlocal & endlocal
 if EXIST "%ProgramFiles%\Microsoft Visual C++\VC98\bin\VCVARS32.BAT" (
-    set BOOST_JAM_TOOLSET=msvc
-    set BOOST_JAM_TOOLSET_ROOT=%ProgramFiles%\Microsoft Visual C++\VC98\
+    set "BOOST_JAM_TOOLSET=msvc"
+    set "BOOST_JAM_TOOLSET_ROOT=%ProgramFiles%\Microsoft Visual C++\VC98\"
     goto :eof)
 setlocal & endlocal
 call :Test_Path cl.exe
 if not errorlevel 1 (
-    set BOOST_JAM_TOOLSET=msvc
-    set BOOST_JAM_TOOLSET_ROOT=%FOUND_PATH%..\
+    set "BOOST_JAM_TOOLSET=msvc"
+    set "BOOST_JAM_TOOLSET_ROOT=%FOUND_PATH%..\"
     goto :eof)
 setlocal & endlocal
 call :Test_Path vcvars32.bat
 if not errorlevel 1 (
-    set BOOST_JAM_TOOLSET=msvc
+    set "BOOST_JAM_TOOLSET=msvc"
     call "%FOUND_PATH%VCVARS32.BAT"
-    set BOOST_JAM_TOOLSET_ROOT=%MSVCDir%\
+    set "BOOST_JAM_TOOLSET_ROOT=%MSVCDir%\"
     goto :eof)
 setlocal & endlocal
 if EXIST "C:\Borland\BCC55\Bin\bcc32.exe" (
-    set BOOST_JAM_TOOLSET=borland
-    set BOOST_JAM_TOOLSET_ROOT=C:\Borland\BCC55\
+    set "BOOST_JAM_TOOLSET=borland"
+    set "BOOST_JAM_TOOLSET_ROOT=C:\Borland\BCC55\"
     goto :eof)
 setlocal & endlocal
 call :Test_Path bcc32.exe
 if not errorlevel 1 (
-    set BOOST_JAM_TOOLSET=borland
-    set BOOST_JAM_TOOLSET_ROOT=%FOUND_PATH%..\
+    set "BOOST_JAM_TOOLSET=borland"
+    set "BOOST_JAM_TOOLSET_ROOT=%FOUND_PATH%..\"
     goto :eof)
 setlocal & endlocal
 call :Test_Path icl.exe
 if not errorlevel 1 (
-    set BOOST_JAM_TOOLSET=intel-win32
-    set BOOST_JAM_TOOLSET_ROOT=%FOUND_PATH%..\
+    set "BOOST_JAM_TOOLSET=intel-win32"
+    set "BOOST_JAM_TOOLSET_ROOT=%FOUND_PATH%..\"
     goto :eof)
 setlocal & endlocal
 if EXIST "C:\MinGW\bin\gcc.exe" (
-    set BOOST_JAM_TOOLSET=mingw
-    set BOOST_JAM_TOOLSET_ROOT=C:\MinGW\
+    set "BOOST_JAM_TOOLSET=mingw"
+    set "BOOST_JAM_TOOLSET_ROOT=C:\MinGW\"
     goto :eof)
 setlocal & endlocal
 if NOT "_%CWFolder%_" == "__" (
-    set BOOST_JAM_TOOLSET=metrowerks
-    set BOOST_JAM_TOOLSET_ROOT=%CWFolder%\
+    set "BOOST_JAM_TOOLSET=metrowerks"
+    set "BOOST_JAM_TOOLSET_ROOT=%CWFolder%\"
     goto :eof )
 setlocal & endlocal
 call :Test_Path mwcc.exe
 if not errorlevel 1 (
-    set BOOST_JAM_TOOLSET=metrowerks
-    set BOOST_JAM_TOOLSET_ROOT=%FOUND_PATH%..\..\
+    set "BOOST_JAM_TOOLSET=metrowerks"
+    set "BOOST_JAM_TOOLSET_ROOT=%FOUND_PATH%..\..\"
     goto :eof)
 setlocal & endlocal
 call :Error_Print "Could not find a suitable toolset."
@@ -157,16 +157,16 @@
 setlocal & endlocal
 call :Test_Path yacc.exe
 if not errorlevel 1 (
-    set YACC=yacc -d
+    set "YACC=yacc -d"
     goto :eof)
 setlocal & endlocal
 call :Test_Path bison.exe
 if not errorlevel 1 (
-    set YACC=bison -d --yacc
+    set "YACC=bison -d --yacc"
     goto :eof)
 setlocal & endlocal
 if EXIST "C:\Program Files\GnuWin32\bin\bison.exe" (
-    set YACC="C:\Program Files\GnuWin32\bin\bison.exe" -d --yacc
+    set "YACC=C:\Program Files\GnuWin32\bin\bison.exe" -d --yacc
     goto :eof)
 setlocal & endlocal
 call :Error_Print "Could not find Yacc to build the Jam grammar."
@@ -182,13 +182,13 @@
     call :Guess_Toolset
     if not errorlevel 1 goto Setup_Toolset
 ) else (
-    call :Test_Option %1
+    call :Test_Option "%1"
     if not errorlevel 1 (
         call :Guess_Toolset
         if not errorlevel 1 goto Setup_Toolset
     ) else (
         setlocal & endlocal
-        set BOOST_JAM_TOOLSET=%1
+        set "BOOST_JAM_TOOLSET=%1"
         shift
         goto Setup_Toolset
     )
@@ -206,60 +206,68 @@
 REM is a single command, even though it's in multiple lines here.
 if "_%BOOST_JAM_TOOLSET%_" == "_metrowerks_" (
     if NOT "_%CWFolder%_" == "__" (
-        set BOOST_JAM_TOOLSET_ROOT=%CWFolder%\) )
+        set "BOOST_JAM_TOOLSET_ROOT=%CWFolder%\"
+        ) )
 if "_%BOOST_JAM_TOOLSET%_" == "_metrowerks_" (
     if not "_%BOOST_JAM_TOOLSET_ROOT%_" == "__" (
-        set PATH=%BOOST_JAM_TOOLSET_ROOT%Other Metrowerks Tools\Command Line Tools;%PATH%)
-    set BOOST_JAM_CC=mwcc -runtime ss -cwd include -DNT -ladvapi32.lib
-    set BOOST_JAM_OPT_JAM=-o bootstrap\jam0.exe
-    set BOOST_JAM_OPT_MKJAMBASE=-o bootstrap\mkjambase0.exe
-    set BOOST_JAM_OPT_YYACC=-o bootstrap\yyacc0.exe
-    set _known_=1
+        set "PATH=%BOOST_JAM_TOOLSET_ROOT%Other Metrowerks Tools\Command Line Tools;%PATH%"
+        )
+    set "BOOST_JAM_CC=mwcc -runtime ss -cwd include -DNT -lkernel32.lib -ladvapi32.lib -luser32.lib"
+    set "BOOST_JAM_OPT_JAM=-o bootstrap\jam0.exe"
+    set "BOOST_JAM_OPT_MKJAMBASE=-o bootstrap\mkjambase0.exe"
+    set "BOOST_JAM_OPT_YYACC=-o bootstrap\yyacc0.exe"
+    set "_known_=1"
 )
 if "_%BOOST_JAM_TOOLSET%_" == "_msvc_" (
     if NOT "_%MSVCDir%_" == "__" (
-        set BOOST_JAM_TOOLSET_ROOT=%MSVCDir%\) )
+        set "BOOST_JAM_TOOLSET_ROOT=%MSVCDir%\"
+        ) )
 if "_%BOOST_JAM_TOOLSET%_" == "_msvc_" (
     if EXIST "%BOOST_JAM_TOOLSET_ROOT%bin\VCVARS32.BAT" (
         call "%BOOST_JAM_TOOLSET_ROOT%bin\VCVARS32.BAT" ) )
 if "_%BOOST_JAM_TOOLSET%_" == "_msvc_" (
     if not "_%BOOST_JAM_TOOLSET_ROOT%_" == "__" (
-        set PATH=%BOOST_JAM_TOOLSET_ROOT%bin;%PATH%)
-    set BOOST_JAM_CC=cl /nologo /GZ /Zi /MLd -DNT -DYYDEBUG kernel32.lib advapi32.lib
-    set BOOST_JAM_OPT_JAM=/Febootstrap\jam0
-    set BOOST_JAM_OPT_MKJAMBASE=/Febootstrap\mkjambase0
-    set BOOST_JAM_OPT_YYACC=/Febootstrap\yyacc0
-    set _known_=1
+        set "PATH=%BOOST_JAM_TOOLSET_ROOT%bin;%PATH%"
+        )
+    set "BOOST_JAM_CC=cl /nologo /GZ /Zi /MLd -DNT -DYYDEBUG kernel32.lib advapi32.lib user32.lib"
+    set "BOOST_JAM_OPT_JAM=/Febootstrap\jam0"
+    set "BOOST_JAM_OPT_MKJAMBASE=/Febootstrap\mkjambase0"
+    set "BOOST_JAM_OPT_YYACC=/Febootstrap\yyacc0"
+    set "_known_=1"
 )
 if "_%BOOST_JAM_TOOLSET%_" == "_vc7_" (
     if NOT "_%MSVCDir%_" == "__" (
-        set BOOST_JAM_TOOLSET_ROOT=%MSVCDir%\) )
+        set "BOOST_JAM_TOOLSET_ROOT=%MSVCDir%\"
+        ) )
 if "_%BOOST_JAM_TOOLSET%_" == "_vc7_" (
     if EXIST "%BOOST_JAM_TOOLSET_ROOT%bin\VCVARS32.BAT" (
         call "%BOOST_JAM_TOOLSET_ROOT%bin\VCVARS32.BAT" ) )
 if "_%BOOST_JAM_TOOLSET%_" == "_vc7_" (
     if not "_%BOOST_JAM_TOOLSET_ROOT%_" == "__" (
-        set PATH=%BOOST_JAM_TOOLSET_ROOT%bin;%PATH%)
-    set BOOST_JAM_CC=cl /nologo /GZ /Zi /MLd -DNT -DYYDEBUG kernel32.lib advapi32.lib
-    set BOOST_JAM_OPT_JAM=/Febootstrap\jam0
-    set BOOST_JAM_OPT_MKJAMBASE=/Febootstrap\mkjambase0
-    set BOOST_JAM_OPT_YYACC=/Febootstrap\yyacc0
-    set _known_=1
+        set "PATH=%BOOST_JAM_TOOLSET_ROOT%bin;%PATH%"
+        )
+    set "BOOST_JAM_CC=cl /nologo /GZ /Zi /MLd -DNT -DYYDEBUG kernel32.lib advapi32.lib user32.lib"
+    set "BOOST_JAM_OPT_JAM=/Febootstrap\jam0"
+    set "BOOST_JAM_OPT_MKJAMBASE=/Febootstrap\mkjambase0"
+    set "BOOST_JAM_OPT_YYACC=/Febootstrap\yyacc0"
+    set "_known_=1"
 )
 if "_%BOOST_JAM_TOOLSET%_" == "_vc8_" (
     if NOT "_%MSVCDir%_" == "__" (
-        set BOOST_JAM_TOOLSET_ROOT=%MSVCDir%\) )
+        set "BOOST_JAM_TOOLSET_ROOT=%MSVCDir%\"
+        ) )
 if "_%BOOST_JAM_TOOLSET%_" == "_vc8_" (
     if EXIST "%BOOST_JAM_TOOLSET_ROOT%bin\VCVARS32.BAT" (
         call "%BOOST_JAM_TOOLSET_ROOT%bin\VCVARS32.BAT" ) )
 if "_%BOOST_JAM_TOOLSET%_" == "_vc8_" (
     if not "_%BOOST_JAM_TOOLSET_ROOT%_" == "__" (
-        set PATH=%BOOST_JAM_TOOLSET_ROOT%bin;%PATH%)
-    set BOOST_JAM_CC=cl /nologo /RTC1 /Zi /MTd -DNT -DYYDEBUG -wd4996 kernel32.lib advapi32.lib
-    set BOOST_JAM_OPT_JAM=/Febootstrap\jam0
-    set BOOST_JAM_OPT_MKJAMBASE=/Febootstrap\mkjambase0
-    set BOOST_JAM_OPT_YYACC=/Febootstrap\yyacc0
-    set _known_=1
+        set "PATH=%BOOST_JAM_TOOLSET_ROOT%bin;%PATH%"
+        )
+    set "BOOST_JAM_CC=cl /nologo /RTC1 /Zi /MTd -DNT -DYYDEBUG -wd4996 kernel32.lib advapi32.lib user32.lib"
+    set "BOOST_JAM_OPT_JAM=/Febootstrap\jam0"
+    set "BOOST_JAM_OPT_MKJAMBASE=/Febootstrap\mkjambase0"
+    set "BOOST_JAM_OPT_YYACC=/Febootstrap\yyacc0"
+    set "_known_=1"
 )
 if "_%BOOST_JAM_TOOLSET%_" == "_borland_" (
     if "_%BOOST_JAM_TOOLSET_ROOT%_" == "__" (
@@ -267,50 +275,55 @@
 if "_%BOOST_JAM_TOOLSET%_" == "_borland_" (
     if "_%BOOST_JAM_TOOLSET_ROOT%_" == "__" (
         if not errorlevel 1 (
-            set BOOST_JAM_TOOLSET_ROOT=%FOUND_PATH%..\) ) )
+            set "BOOST_JAM_TOOLSET_ROOT=%FOUND_PATH%..\"
+            ) ) )
 if "_%BOOST_JAM_TOOLSET%_" == "_borland_" (
-    if not "_%BOOST_JAM_TOOLSET_ROOT%_" == "__" (set PATH=%BOOST_JAM_TOOLSET_ROOT%Bin;%PATH%)
-    set BOOST_JAM_CC=bcc32 -WC -w- -q "-I%BOOST_JAM_TOOLSET_ROOT%Include" "-L%BOOST_JAM_TOOLSET_ROOT%Lib" /DNT -nbootstrap
-    set BOOST_JAM_OPT_JAM=-ejam0
-    set BOOST_JAM_OPT_MKJAMBASE=-emkjambasejam0
-    set BOOST_JAM_OPT_YYACC=-eyyacc0
-    set _known_=1
+    if not "_%BOOST_JAM_TOOLSET_ROOT%_" == "__" (
+        set "PATH=%BOOST_JAM_TOOLSET_ROOT%Bin;%PATH%"
+        )
+    set "BOOST_JAM_CC=bcc32 -WC -w- -q "-I%BOOST_JAM_TOOLSET_ROOT%Include" "-L%BOOST_JAM_TOOLSET_ROOT%Lib" /DNT -nbootstrap"
+    set "BOOST_JAM_OPT_JAM=-ejam0"
+    set "BOOST_JAM_OPT_MKJAMBASE=-emkjambasejam0"
+    set "BOOST_JAM_OPT_YYACC=-eyyacc0"
+    set "_known_=1"
 )
 if "_%BOOST_JAM_TOOLSET%_" == "_como_" (
-    set BOOST_JAM_CC=como -DNT
-    set BOOST_JAM_OPT_JAM=-o bootstrap\jam0.exe
-    set BOOST_JAM_OPT_MKJAMBASE=-o bootstrap\mkjambase0.exe
-    set BOOST_JAM_OPT_YYACC=-o bootstrap\yyacc0.exe
-    set _known_=1
+    set "BOOST_JAM_CC=como -DNT"
+    set "BOOST_JAM_OPT_JAM=-o bootstrap\jam0.exe"
+    set "BOOST_JAM_OPT_MKJAMBASE=-o bootstrap\mkjambase0.exe"
+    set "BOOST_JAM_OPT_YYACC=-o bootstrap\yyacc0.exe"
+    set "_known_=1"
 )
 if "_%BOOST_JAM_TOOLSET%_" == "_gcc_" (
-    set BOOST_JAM_CC=gcc -DNT
-    set BOOST_JAM_OPT_JAM=-o bootstrap\jam0.exe
-    set BOOST_JAM_OPT_MKJAMBASE=-o bootstrap\mkjambase0.exe
-    set BOOST_JAM_OPT_YYACC=-o bootstrap\yyacc0.exe
-    set _known_=1
+    set "BOOST_JAM_CC=gcc -DNT"
+    set "BOOST_JAM_OPT_JAM=-o bootstrap\jam0.exe"
+    set "BOOST_JAM_OPT_MKJAMBASE=-o bootstrap\mkjambase0.exe"
+    set "BOOST_JAM_OPT_YYACC=-o bootstrap\yyacc0.exe"
+    set "_known_=1"
 )
 if "_%BOOST_JAM_TOOLSET%_" == "_gcc-nocygwin_" (
-    set BOOST_JAM_CC=gcc -DNT -mno-cygwin
-    set BOOST_JAM_OPT_JAM=-o bootstrap\jam0.exe
-    set BOOST_JAM_OPT_MKJAMBASE=-o bootstrap\mkjambase0.exe
-    set BOOST_JAM_OPT_YYACC=-o bootstrap\yyacc0.exe
-    set _known_=1
+    set "BOOST_JAM_CC=gcc -DNT -mno-cygwin"
+    set "BOOST_JAM_OPT_JAM=-o bootstrap\jam0.exe"
+    set "BOOST_JAM_OPT_MKJAMBASE=-o bootstrap\mkjambase0.exe"
+    set "BOOST_JAM_OPT_YYACC=-o bootstrap\yyacc0.exe"
+    set "_known_=1"
 )
 if "_%BOOST_JAM_TOOLSET%_" == "_intel-win32_" (
-    set BOOST_JAM_CC=icl -DNT /nologo kernel32.lib advapi32.lib
-    set BOOST_JAM_OPT_JAM=/Febootstrap\jam0
-    set BOOST_JAM_OPT_MKJAMBASE=/Febootstrap\mkjambase0
-    set BOOST_JAM_OPT_YYACC=/Febootstrap\yyacc0
-    set _known_=1
+    set "BOOST_JAM_CC=icl -DNT /nologo kernel32.lib advapi32.lib user32.lib"
+    set "BOOST_JAM_OPT_JAM=/Febootstrap\jam0"
+    set "BOOST_JAM_OPT_MKJAMBASE=/Febootstrap\mkjambase0"
+    set "BOOST_JAM_OPT_YYACC=/Febootstrap\yyacc0"
+    set "_known_=1"
 )
 if "_%BOOST_JAM_TOOLSET%_" == "_mingw_" (
-    if not "_%BOOST_JAM_TOOLSET_ROOT%_" == "__" (set PATH=%BOOST_JAM_TOOLSET_ROOT%bin;%PATH%)
-    set BOOST_JAM_CC=gcc -DNT
-    set BOOST_JAM_OPT_JAM=-o bootstrap\jam0.exe
-    set BOOST_JAM_OPT_MKJAMBASE=-o bootstrap\mkjambase0.exe
-    set BOOST_JAM_OPT_YYACC=-o bootstrap\yyacc0.exe
-    set _known_=1
+    if not "_%BOOST_JAM_TOOLSET_ROOT%_" == "__" (
+        set "PATH=%BOOST_JAM_TOOLSET_ROOT%bin;%PATH%"
+        )
+    set "BOOST_JAM_CC=gcc -DNT"
+    set "BOOST_JAM_OPT_JAM=-o bootstrap\jam0.exe"
+    set "BOOST_JAM_OPT_MKJAMBASE=-o bootstrap\mkjambase0.exe"
+    set "BOOST_JAM_OPT_YYACC=-o bootstrap\yyacc0.exe"
+    set "_known_=1"
 )
 if "_%_known_%_" == "__" (
     call :Error_Print "Unknown toolset: %BOOST_JAM_TOOLSET%"

Modified: boost/trunk/tools/jam/src/build.jam
===================================================================
--- boost/trunk/tools/jam/src/build.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/jam/src/build.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -12,7 +12,7 @@
 else { . = "." ; }
 
 # Info about what we are building.
-_VERSION_ = 3 1 12 ;
+_VERSION_ = 3 1 14 ;
 NAME = boost-jam ;
 VERSION = $(_VERSION_:J=$(.)) ;
 RELEASE = 1 ;
@@ -177,7 +177,7 @@
     [ opt --release : /ML /O2 /Ob2 /Gy /GF /GA /GB ]
     [ opt --debug : /MLd /DEBUG /Z7 /Od /Ob0 ]
     -I$(--python-include)
-    : kernel32.lib advapi32.lib $(--python-lib[1]) ;
+    : kernel32.lib advapi32.lib user32.lib $(--python-lib[1]) ;
 ## KCC ?
 toolset kcc KCC : "-o " : -D
     :
@@ -203,7 +203,7 @@
         [ opt --debug : -runtime ssd -opt none -inline off ]
         -I$(--python-include) ;
     toolset metrowerks $(mwcc) .link : "-o " :
-        : -subsystem console -ladvapi32.lib
+        : -subsystem console -lkernel32.lib -ladvapi32.lib -luser32.lib
         [ opt --release : -runtime ss ]
         [ opt --debug : -runtime ssd ]
         : $(--python-lib[1]) ;
@@ -228,7 +228,7 @@
     [ opt --release : /ML /O2 /Ob2 /Gy /GF /GA /GB ]
     [ opt --debug : /MLd /DEBUG /Z7 /Od /Ob0 ]
     -I$(--python-include)
-    : kernel32.lib advapi32.lib $(--python-lib[1]) ;
+    : kernel32.lib advapi32.lib user32.lib $(--python-lib[1]) ;
 ## QNX 6.x GCC 3.x/2.95.3
 toolset qcc qcc : "-o " : -D
     : -Wc,-pedantic
@@ -264,14 +264,14 @@
     [ opt --release : /ML /O2 /Ob2 /Gy /GF /GA /GB ]
     [ opt --debug : /MLd /DEBUG /Z7 /Od /Ob0 ]
     -I$(--python-include)
-    : kernel32.lib advapi32.lib $(--python-lib[1]) ;
+    : kernel32.lib advapi32.lib user32.lib $(--python-lib[1]) ;
 ## Microsoft Visual C++ 2005
 toolset vc8 cl : /Fe : -D
     : /nologo
     [ opt --release : /MT /O2 /Ob2 /Gy /GF /GA /wd4996 ]
     [ opt --debug : /MTd /DEBUG /Z7 /Od /Ob0 /wd4996 ]
     -I$(--python-include)
-    : kernel32.lib advapi32.lib $(--python-lib[1]) ;
+    : kernel32.lib advapi32.lib user32.lib $(--python-lib[1]) ;
 ## VMS/OpenVMS DEC C
 toolset vmsdecc cc : /OBJECT= : "/DEFINES=(" "," ")"
     : /STANDARD=VAXC /PREFIX_LIBRARY_ENTRIES=ALL_ENTRIES
@@ -762,7 +762,8 @@
 
 if $(NT)
 {
-    zip ?= [ GLOB "$(ProgramFiles:J= )\\7-ZIP" "C:\\Program Files\\7-ZIP" : "7z.exe" "7zn.exe" ] ;
+    zip ?= [ GLOB "$(ProgramFiles:J= )\\7-ZIP" "C:\\Program Files\\7-ZIP" : "7z.exe" ] ;
+    zip ?= [ GLOB "$(ProgramFiles:J= )\\7-ZIP" "C:\\Program Files\\7-ZIP" : "7zn.exe" ] ;
     zip ?= [ GLOB $(PATH) : zip.exe ] ;
     zip ?= zip ;
     zip = $(zip[1]) ;
@@ -849,7 +850,9 @@
 }
 
 # RPM distro file.
-rpm-tool = [ GLOB $(PATH) : "rpmbuild" "rpm" ] ;
+rpm-tool = [ GLOB $(PATH) : "rpmbuild" ] ;
+rpm-tool ?= [ GLOB $(PATH) : "rpm" ] ;
+rpm-tool = $(rpm-tool[1]) ;
 rule .rpm ( name : source )
 {
     local rpm-arch = ;
@@ -878,8 +881,9 @@
     .clean $(name).$(rpm-arch).rpm $(name).src.rpm ;
 }
 actions [RPM] {
+    set -e
     export BOOST_JAM_TOOLSET="$(toolset)"
-    $(rpm-tool[1]) -ta $(target-opt)$(arch) $(>) | tee rpm.out
+    $(rpm-tool) -ta $(target-opt)$(arch) $(>) | tee rpm.out
     cp `grep -e '^Wrote:' rpm.out | sed 's/^Wrote: //'` .
     rm -f rpm.out
 }

Modified: boost/trunk/tools/jam/src/builtins.c
===================================================================
--- boost/trunk/tools/jam/src/builtins.c	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/jam/src/builtins.c	2007-02-16 16:48:35 UTC (rev 14035)
@@ -937,6 +937,17 @@
     *result = list_new( *result, copystr( *(char**)np ) );
 }
 
+static struct hash *get_running_module_vars()
+{
+    struct hash *dummy, *vars = NULL;
+    /* Get the global variables pointer (that of the currently running module) */
+    var_hash_swap(&vars);
+    dummy = vars;
+    /* Put the global variables pointer in its right place */
+    var_hash_swap(&dummy);
+    return vars;
+}
+
 LIST *
 builtin_varnames(
     PARSE   *parse,
@@ -946,8 +957,14 @@
     LIST *result = L0;
     module_t* source_module = bindmodule( arg0 ? arg0->string : 0 );
 
-    if ( source_module->variables )
-        hashenumerate( source_module->variables, add_hash_key, &result );
+    /* The running module _always_ has its 'variables' member set to NULL
+     * due to the way enter_module and var_hash_swap work */
+    struct hash *vars = 
+        source_module == frame->module ? 
+            get_running_module_vars() : source_module->variables;
+
+    if ( vars )
+        hashenumerate( vars, add_hash_key, &result );
     return result;
 }
 

Modified: boost/trunk/tools/jam/src/bump_version.py
===================================================================
--- boost/trunk/tools/jam/src/bump_version.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/jam/src/bump_version.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,49 +7,74 @@
 # and updates all necessary files. For the time being, it's assumes presense
 # of 'perl' executable and Debian-specific 'dch' executable.
 #
- 
 
+
+import os
+import os.path
+import re
+import string
 import sys
-import string
-import os
 
-def spec(version):
-    os.system("perl -pi -e 's|^Version:.*|Version: %s|' boost-jam.spec" %
-              string.join(version, "."))
+srcdir = os.path.abspath(os.path.dirname(__file__ ))
+docdir = os.path.abspath(os.path.join(srcdir,"..","doc"))
 
-def build_jam(version):
-    os.system("perl -pi -e 's|^VERSION = .* ;|VERSION = %s\$(.)%s\$(.)%s ;|' build.jam"
-              % (version[0], version[1], version[2]))
+def edit(file,replacements):
+    print "  '%s'..." %(file)
+    text = open(file,'r').read()
+    while len(replacements) > 0:
+        #~ print  "  '%s' ==> '%s'" % (replacements[0],replacements[1])
+        text = re.compile(replacements[0],re.M).subn(replacements[1],text)[0]
+        replacements = replacements[2:]
+    #~ print text
+    open(file,'w').write(text)
 
-def index_html(version):
-    os.system("perl -pi -e 's|This is version .* of BJam|This is version %s of BJam|' index.html"
-              % string.join(version, "."))
+def make_edits(version):
+    edit(os.path.join(srcdir,"boost-jam.spec"), [
+        '^Version:.*$','Version: %s' % string.join(version, "."),
+        ])
 
-def jam_c(version):
-    re = "\\*major_version = .*, \\*minor_version = .*, \\*changenum = .*";
-    new = ('*major_version = "%02d", *minor_version = "%02d", *changenum = "%02d";' %
-        (int(version[0]), int(version[1]), int(version[2])))
-    os.system("perl -pi -e 's|%s|%s|' jam.c" % (re, new))
+    edit(os.path.join(srcdir,"build.jam"), [
+        '^_VERSION_ = .* ;$','_VERSION_ = %s %s %s ;' % (version[0], version[1], version[2]),
+        ])
 
-def patchlevel(version):
-    os.system("perl -pi -e 's|VERSION .*|VERSION \"%s\"|' patchlevel.h" %
-              string.join(version, "."))
+    edit(os.path.join(docdir,"bjam.qbk"), [
+        '\[version.*\]','[version: %s]' % string.join(version, '.'),
+        '\[def :version:.*\]','[def :version: %s]' % string.join(version, '.'),
+        ])
 
-def dch(version):
-    os.system("dch --ignore-dirname -v " + string.join(version, ".") + "-1")
-       
-bumpers = [spec, build_jam, index_html, jam_c, patchlevel, dch]
+    edit(os.path.join(srcdir,"patchlevel.h"), [
+        '^#define VERSION_MAJOR .*$',
+            '#define VERSION_MAJOR %s' % (version[0]),
+        '^#define VERSION_MINOR .*$',
+            '#define VERSION_MINOR %s' % (version[1]),
+        '^#define VERSION_PATCH .*$',
+            '#define VERSION_PATCH %s' % (version[2]),
+        '^#define VERSION_MAJOR_SYM .*$',
+            '#define VERSION_MAJOR_SYM "0%s"' % (version[0]),
+        '^#define VERSION_MINOR_SYM .*$',
+            '#define VERSION_MINOR_SYM "%s"' % (version[1]),
+        '^#define VERSION_PATCH_SYM .*$',
+            '#define VERSION_PATCH_SYM "%s"' % (version[2]),
+        '^#define VERSION .*$',
+            '#define VERSION "%s"' % string.join(version, '.'),
+        '^#define JAMVERSYM .*$',
+            '#define JAMVERSYM "JAMVERSION=%s.%s"' % (version[0],version[1]),
+        ])
 
 def main():
 
     if len(sys.argv) < 2:
         print "Expect new version as argument"
         sys.exit(1)
-                
-    new_version = string.split(sys.argv[1], ".")
-    print "Setting version to", new_version
-    for b in bumpers:
-        b(new_version)
 
+    version = string.split(sys.argv[1], ".")
+    print "Setting version to", version
+    make_edits(version)
+
 if __name__ == '__main__':
     main()
+
+#~ Copyright 2006 Rene Rivera.
+#~ Copyright 2005-2006 Vladimir Prus.
+#~ Distributed under the Boost Software License, Version 1.0.
+#~ (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)

Modified: boost/trunk/tools/jam/src/debian/copyright
===================================================================
--- boost/trunk/tools/jam/src/debian/copyright	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/jam/src/debian/copyright	2007-02-16 16:48:35 UTC (rev 14035)
@@ -17,9 +17,9 @@
 
 Some portions are also:
 
-    Copyright 2001-2004 David Abrahams.
-    Copyright 2002-2005 Rene Rivera.
-    Copyright 2003-2005 Vladimir Prus.
+    Copyright 2001-2006 David Abrahams.
+    Copyright 2002-2006 Rene Rivera.
+    Copyright 2003-2006 Vladimir Prus.
     
     Distributed under the Boost Software License, Version 1.0.
     (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)

Modified: boost/trunk/tools/jam/src/execnt.c
===================================================================
--- boost/trunk/tools/jam/src/execnt.c	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/jam/src/execnt.c	2007-02-16 16:48:35 UTC (rev 14035)
@@ -915,6 +915,17 @@
     return 0.0;
 }
 
+static double
+creation_time(HANDLE process)
+{
+    FILETIME creation, exit, kernel, user, current;
+    if (GetProcessTimes(process, &creation, &exit, &kernel, &user))
+    {
+        return filetime_seconds(creation);
+    }
+    return 0.0;
+}
+
 /* it's just stupidly silly that one has to do this! */
 typedef struct PROCESS_BASIC_INFORMATION__ {
     LONG ExitStatus;
@@ -998,6 +1009,162 @@
     TerminateProcess(process,-2);
 }
 
+/* Recursive check if first process is parent (directly or indirectly) of 
+the second one. Both processes are passed as process ids, not handles.
+Special return value 2 means that the second process is smss.exe and its 
+parent process is System (first argument is ignored) */
+static int 
+is_parent_child(DWORD parent, DWORD child)
+{
+    HANDLE process_snapshot_h = INVALID_HANDLE_VALUE;
+
+    if (!child)
+        return 0;
+    if (parent == child)
+        return 1;
+
+    process_snapshot_h = CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS,0);
+    if (INVALID_HANDLE_VALUE != process_snapshot_h)
+    {
+        BOOL ok = TRUE;
+        PROCESSENTRY32 pinfo;
+        pinfo.dwSize = sizeof(PROCESSENTRY32);
+        for (
+            ok = Process32First(process_snapshot_h, &pinfo); 
+            ok == TRUE; 
+            ok = Process32Next(process_snapshot_h, &pinfo) )
+        {
+            if (pinfo.th32ProcessID == child)
+            {
+                /*
+                Unfortunately, process ids are not really unique. There might 
+                be spurious "parent and child" relationship match between
+                two non-related processes if real parent process of a given
+                process has exited (while child process kept running as an 
+                "orphan") and the process id of such parent process has been 
+                reused by internals of the operating system when creating 
+                another process. Thus additional check is needed - process
+                creation time. This check may fail (ie. return 0) for system 
+                processes due to insufficient privileges, and that's OK. */
+                double tchild = 0.0;
+                double tparent = 0.0;
+                HANDLE hchild = OpenProcess(PROCESS_QUERY_INFORMATION, FALSE, pinfo.th32ProcessID);
+
+                CloseHandle(process_snapshot_h);
+
+                /* csrss.exe may display message box like following:
+                    xyz.exe - Unable To Locate Component
+                    This application has failed to start because 
+                    boost_foo-bar.dll was not found. Re-installing the 
+                    application may fix the problem
+                This actually happens when starting test process that depends
+                on a dynamic library which failed to build. We want to 
+                automatically close these message boxes even though csrss.exe
+                is not our child process. We may depend on the fact that (in
+                all current versions of Windows) csrss.exe is directly 
+                child of smss.exe process, which in turn is directly child of
+                System process, which always has process id == 4 .
+                This check must be performed before comparison of process 
+                creation time */
+                if (stricmp(pinfo.szExeFile, "csrss.exe") == 0
+                    && is_parent_child(parent, pinfo.th32ParentProcessID) == 2)
+                {
+                    return 1;
+                }
+                else if (stricmp(pinfo.szExeFile, "smss.exe") == 0
+                    && pinfo.th32ParentProcessID == 4)
+                {
+                    return 2;
+                }
+
+                if (hchild != 0)
+                {
+                    HANDLE hparent = OpenProcess(PROCESS_QUERY_INFORMATION, FALSE, pinfo.th32ParentProcessID);
+                    if (hparent != 0)
+                    {
+                        tchild = creation_time(hchild);
+                        tparent = creation_time(hparent);
+                        
+                        CloseHandle(hparent);
+                    }
+                    CloseHandle(hchild);
+                }
+
+                /* return 0 if one of the following is true:
+                1. we failed to read process creation time
+                2. child was created before alleged parent */
+                if (tchild == 0.0 || tparent == 0.0 || tchild < tparent)
+                    return 0;
+
+                return is_parent_child(parent, pinfo.th32ParentProcessID) & 1;
+            }
+        }
+
+        CloseHandle(process_snapshot_h);
+    }
+
+    return 0;
+}
+
+typedef struct PROCESS_HANDLE_ID {HANDLE h; DWORD pid;} PROCESS_HANDLE_ID;
+
+/* This function is called by the operating system for each topmost window. */
+BOOL CALLBACK
+window_enum(HWND hwnd, LPARAM lParam)
+{
+    char buf[7] = {0};
+    PROCESS_HANDLE_ID p = *((PROCESS_HANDLE_ID*) (lParam));
+    DWORD pid = 0;
+    DWORD tid = 0;
+
+    /* we want to find and close any window that:
+    1. is visible and
+    2. is a dialog and
+    3. is displayed by any of our child processes */
+    if (!IsWindowVisible(hwnd))
+        return TRUE;
+
+    if (!GetClassNameA(hwnd, buf, sizeof(buf)))
+        return TRUE; /* failed to read class name; presume it's not a dialog */
+ 
+    if (strcmp(buf, "#32770") != 0)
+        return TRUE; /* not a dialog */
+
+    /* GetWindowThreadProcessId returns 0 on error, otherwise thread id
+    of window message pump thread */
+    tid = GetWindowThreadProcessId(hwnd, &pid);
+ 
+    if (tid && is_parent_child(p.pid, pid))
+    {
+        /* ask really nice */
+        PostMessageA(hwnd, WM_CLOSE, 0, 0);
+        /* now wait and see if it worked. If not, insist */
+        if (WaitForSingleObject(p.h, 200) == WAIT_TIMEOUT)
+        {
+            PostThreadMessageA(tid, WM_QUIT, 0, 0);
+            WaitForSingleObject(p.h, 300);
+        }
+        
+        /* done, we do not want to check any other window now */
+        return FALSE;
+    }
+
+    return TRUE;
+}
+
+static void 
+close_alert(HANDLE process)
+{
+    DWORD pid = get_process_id(process);
+    /* If process already exited or we just cannot get its process id, do not 
+    go any further */
+    if (pid)
+    {
+        PROCESS_HANDLE_ID p = {process, pid};
+        EnumWindows(&window_enum, (LPARAM) &p);
+    }
+}
+
 static int
 my_wait( int *status )
 {
@@ -1033,9 +1200,10 @@
     
     if ( globs.timeout > 0 )
     {
+        unsigned int alert_wait = 1;
         /* with a timeout we wait for a finish or a timeout, we check every second
          to see if something timed out */
-        for (waitcode = WAIT_TIMEOUT; waitcode == WAIT_TIMEOUT;)
+        for (waitcode = WAIT_TIMEOUT; waitcode == WAIT_TIMEOUT; ++alert_wait)
         {
             waitcode = WaitForMultipleObjects( num_active, active_handles, FALSE, 1*1000 /* 1 second */ );
             if ( waitcode == WAIT_TIMEOUT )
@@ -1044,8 +1212,17 @@
                 for ( i = 0; i < num_active; ++i )
                 {
                     double t = running_time(active_handles[i]);
+
+                    /* periodically (each 5 secs) check and close message boxes
+                    displayed by any of our child processes */
+                    if ((alert_wait % ((unsigned int) 5)) == 0)
+                        close_alert(active_handles[i]);
+
                     if ( t > (double)globs.timeout )
                     {
+                        /* the job may have left an alert dialog around,
+                        try and get rid of it before killing */
+                        close_alert(active_handles[i]);
                         /* we have a "runaway" job, kill it */
                         kill_all(0,active_handles[i]);
                         /* indicate the job "finished" so we query its status below */

Modified: boost/trunk/tools/jam/src/headers.c
===================================================================
--- boost/trunk/tools/jam/src/headers.c	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/jam/src/headers.c	2007-02-16 16:48:35 UTC (rev 14035)
@@ -148,6 +148,15 @@
 
 	while( fgets( buf, sizeof( buf ), f ) )
 	{
+            int size = strlen (buf);
+            /* Remove trailing \r and \n, if any. */
+            while (size > 0 
+                   && (buf[size-1] == '\n' && buf[size-1] == '\r'))
+            {
+                buf[size-1] = '\0';
+                --size;
+            }
+
 	    for( i = 0; i < rec; i++ )
 		if( regexec( re[i], buf ) && re[i]->startp[1] )
 	    {

Modified: boost/trunk/tools/jam/src/patchlevel.h
===================================================================
--- boost/trunk/tools/jam/src/patchlevel.h	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/jam/src/patchlevel.h	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,9 +9,9 @@
 
 #define VERSION_MAJOR 3
 #define VERSION_MINOR 1
-#define VERSION_PATCH 12
+#define VERSION_PATCH 14
 #define VERSION_MAJOR_SYM "03"
 #define VERSION_MINOR_SYM "1"
-#define VERSION_PATCH_SYM "12"
-#define VERSION "3.1.12"
+#define VERSION_PATCH_SYM "14"
+#define VERSION "3.1.14"
 #define JAMVERSYM "JAMVERSION=3.1"

Modified: boost/trunk/tools/jam/src/variable.c
===================================================================
--- boost/trunk/tools/jam/src/variable.c	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/jam/src/variable.c	2007-02-16 16:48:35 UTC (rev 14035)
@@ -291,8 +291,7 @@
                         }
                         
                         /* expand the file value into the file reference */
-                        if ( !globs.noexec )
-                            var_string_to_file( split+3, ine-split-4, file_name_s, lol );
+                        var_string_to_file( split+3, ine-split-4, file_name_s, lol );
                         
                         /* continue on with the expansion */
                         out += strlen(out);
@@ -352,8 +351,13 @@
 {
     const char * ine = in+insize;
     FILE * out_file = 0;
-    if ( strcmp( out, "STDOUT" ) == 0 )
+    int out_debug = DEBUG_EXEC ? 1 : 0;
+    if ( globs.noexec )
     {
+        /* out_debug = 1; */
+    }
+    else if ( strcmp( out, "STDOUT" ) == 0 )
+    {
         out_file = stdout;
     }
     else if ( strcmp( out, "STDERR" ) == 0 )
@@ -382,6 +386,8 @@
         string_free(&out_name);
     }
 
+    if ( out_debug ) printf("\nfile %s\n",out);
+
     while( *in && in < ine )
     {
         int dollar = 0;
@@ -396,7 +402,8 @@
         }
         if ( output_0 < output_1 )
         {
-            fwrite(output_0,output_1-output_0,1,out_file);
+            if ( out_file ) fwrite(output_0,output_1-output_0,1,out_file);
+            if ( out_debug ) fwrite(output_0,output_1-output_0,1,stdout);
         }
         output_0 = output_1;
 
@@ -411,7 +418,7 @@
             ++output_1;
         }
 
-        /* If a variable encountered, expand it and and embed the */
+        /* If a variable encountered, expand it and embed the */
         /* space-separated members of the list in the output. */
 
         if( dollar )
@@ -422,26 +429,34 @@
 
             while ( l )
             {
-                fputs( l->string, out_file );
+                if ( out_file ) fputs( l->string, out_file );
+                if ( out_debug ) puts( l->string );
                 l = list_next( l );
-                if ( l ) fputc( ' ', out_file );
+                if ( l )
+                {
+                    if ( out_file ) fputc( ' ', out_file );
+                    if ( out_debug ) fputc( ' ', stdout );
+                }
             }
 
             list_free( l );
         }
         else if ( output_0 < output_1 )
         {
-            fwrite(output_0,output_1-output_0,1,out_file);
+            if ( out_file ) fwrite(output_0,output_1-output_0,1,out_file);
+            if ( out_debug ) fwrite(output_0,output_1-output_0,1,stdout);
         }
         
         in = output_1;
     }
 
-    if ( out_file != stdout && out_file != stderr )
+    if ( out_file && out_file != stdout && out_file != stderr )
     {
         fflush( out_file );
         fclose( out_file );
     }
+
+    if ( out_debug ) fputc('\n',stdout);
 }
 
 /*

Modified: boost/trunk/tools/make-cputime-page.pl
===================================================================
--- boost/trunk/tools/make-cputime-page.pl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/make-cputime-page.pl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,10 @@
 #!/usr/bin/perl -w
 
+# Copyright 2004 Aleksey Gurtovoy 
+# Copyright 2001 Jens Maurer 
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
+
 use strict;
 
 my $filename;

Modified: boost/trunk/tools/quickbook/block.hpp
===================================================================
--- boost/trunk/tools/quickbook/block.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/block.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,7 +23,7 @@
 {
     using namespace boost::spirit;
 
-    template <typename Actions, bool skip_initial_spaces = false>
+    template <typename Actions>
     struct block_grammar : grammar<block_grammar<Actions> >
     {
         block_grammar(Actions& actions_)
@@ -39,18 +39,9 @@
                 using detail::var;
                 Actions& actions = self.actions;
 
-                if (skip_initial_spaces)
-                {
-                    start_ =
-                        *(space_p | comment) >> blocks >> blank
-                        ;
-                }
-                else
-                {
-                    start_ =
-                        blocks >> blank
-                        ;
-                }
+                start_ =
+                    *(space_p | comment) >> blocks >> blank
+                    ;
 
                 blocks =
                    +(   block_markup
@@ -110,7 +101,6 @@
                         |   variablelist
                         |   xinclude
                         |   include
-                        |   template_
                         )
                     >>  (   (space >> ']' >> +eol)
                         |   eps_p                       [actions.error]
@@ -131,10 +121,9 @@
                     ;
 
                 headings =
-                    h1 | h2 | h3 | h4 | h5 | h6 | h
+                    h1 | h2 | h3 | h4 | h5 | h6
                     ;
 
-                h = "heading" >> hard_space >> phrase   [actions.h];
                 h1 = "h1" >> hard_space >> phrase       [actions.h1];
                 h2 = "h2" >> hard_space >> phrase       [actions.h2];
                 h3 = "h3" >> hard_space >> phrase       [actions.h3];
@@ -180,38 +169,12 @@
                         ;
                 }
 
-                macro_identifier =
-                    +(anychar_p - (space_p | ']'))
-                    ;
-
                 def_macro =
                     "def" >> hard_space
-                    >> macro_identifier                 [actions.macro_identifier]
-                    >> blank >> phrase                  [actions.macro_definition]
+                    >> identifier                       [actions.identifier]
+                    >> blank >> phrase                  [actions.macro_def]
                     ;
 
-                identifier =
-                    (alpha_p | '_') >> *(alnum_p | '_')
-                    ;
-
-                template_ =
-                    "template"
-                    >> hard_space >> identifier         [push_back_a(actions.template_info)]
-                    >> space >> '('
-                    >> space >> identifier              [push_back_a(actions.template_info)]
-                    >> *(
-                            space >> ','
-                            >> space >> identifier      [push_back_a(actions.template_info)]
-                        )
-                    >> space >> ')'
-                    >> template_body                    [actions.template_body]
-                    ;
-                
-                template_body =
-                   *(('[' >> template_body >> ']') | (anychar_p - ']'))
-                    >> space >> eps_p(']')
-                    ;
-
                 variablelist =
                     "variablelist"
                     >>  (eps_p(*blank_p >> eol_p) | hard_space)
@@ -320,6 +283,10 @@
                     >> (*(anychar_p -
                             close_bracket))             [actions.include]
                     ;
+
+                identifier =
+                    +(anychar_p - (space_p | ']'))
+                    ;
                 
                 code =
                     (
@@ -385,16 +352,13 @@
             bool is_not_preformatted;
             
             rule<Scanner>   start_, blocks, block_markup, code, code_line, 
-                            paragraph, space, blank, comment, headings, h, h1, h2, 
+                            paragraph, space, blank, comment, headings, h1, h2, 
                             h3, h4, h5, h6, hr, blurb, blockquote, admonition,
                             phrase, list, close_bracket, ordered_list, def_macro,
-                            macro_identifier, table, table_row, variablelist,
+                            identifier, table, table_row, variablelist,
                             varlistentry, varlistterm, varlistitem, table_cell,
                             preformatted, list_item, begin_section, end_section,
-                            xinclude, include, hard_space, eol, paragraph_end,
-                            template_, identifier, template_formal_arg,
-                            template_body;
-
+                            xinclude, include, hard_space, eol, paragraph_end;
             symbols<>       paragraph_end_markups;
             
             phrase_grammar<Actions> common;

Modified: boost/trunk/tools/quickbook/detail/actions.cpp
===================================================================
--- boost/trunk/tools/quickbook/detail/actions.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/detail/actions.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -14,10 +14,6 @@
 #include <boost/filesystem/convenience.hpp>
 #include "./actions.hpp"
 #include "./utils.hpp"
-#include "./markups.hpp"
-#include "./actions_class.hpp"
-#include "../block.hpp"
-#include "../phrase.hpp"
 
 #if (defined(BOOST_MSVC) && (BOOST_MSVC <= 1310))
 #pragma warning(disable:4355)
@@ -25,59 +21,6 @@
 
 namespace quickbook
 {
-    collector::collector()
-        : main(default_)
-        , top(default_)
-    {
-    }
-
-    collector::collector(std::stringstream& out)
-        : main(out) 
-        , top(out) 
-    {
-    }
-    
-    collector::~collector()
-    {
-        BOOST_ASSERT(streams.empty()); // assert there are no more pushes than pops!!!
-    }
-    
-    std::ostream& 
-    collector::get() const
-    {
-        return top.get();
-    }
-    
-    std::string
-    collector::str() const
-    {
-        return top.get().str();
-    }
-    
-    void 
-    collector::str(std::string const& s)
-    {
-        top.get().str(s);
-    }
-    
-    void collector::push()
-    {
-        streams.push(new std::stringstream());
-        top = boost::ref(*streams.top());
-    }
-    
-    void collector::pop()
-    {
-        BOOST_ASSERT(!streams.empty());
-        delete streams.top();
-        streams.pop();
-
-        if (streams.empty())
-            top = boost::ref(main);
-        else
-            top = boost::ref(*streams.top());
-    }
-
     void error_action::operator()(iterator const& first, iterator const& /*last*/) const
     {
         boost::spirit::file_position const pos = first.get_position();
@@ -87,82 +30,49 @@
 
     void phrase_action::operator()(iterator const& first, iterator const& last) const
     {
-        std::string str = phrase.str();
-        detail::convert_nbsp(str);
-        phrase.str(std::string());
-        out << pre << str << post;
+        if (out)
+        {
+            std::string str = phrase.str();
+            detail::convert_nbsp(str);
+            phrase.str(std::string());
+            out << pre << str << post;
+        }
     }
 
-    void header_action::operator()(iterator const& first, iterator const& last) const
+    void anchored_phrase_action::operator()(iterator const& first, iterator const& last) const
     {
-        std::string str = phrase.str();
-        detail::convert_nbsp(str);
-        phrase.str(std::string());
-
-        if (qbk_version_n < 103) // version 1.2 and below
+        if (out)
         {
-            out << "<anchor id=\""
-                << section_id << '.'
-                << detail::make_identifier(str.begin(), str.end())
-                << "\" />"
-                << pre << str << post
-                ;
+            std::string str = phrase.str();
+            detail::convert_nbsp(str);
+            if (qbk_version_n < 103) // version 1.2 and below
+            {
+                out << "<anchor id=\""
+                    << section_id << '.'
+                    << detail::make_identifier(str.begin(), str.end())
+                    << "\" />";
+            }
+            else // version 1.3 and above
+            {
+                out << "<anchor id=\""
+                    << library_id << '.' << qualified_section_id << '.'
+                    << detail::make_identifier(str.begin(), str.end())
+                    << "\" />";
+            }
+            phrase.str(std::string());
+            out << pre << str << post;
         }
-        else // version 1.3 and above
-        {
-            std::string anchor = 
-                library_id + '.' + qualified_section_id + '.' +
-                detail::make_identifier(str.begin(), str.end());
-
-            out << "<anchor id=\"" << anchor << "\"/>"
-                << pre 
-                << "<link linkend=\"" << anchor << "\">"
-                << str 
-                << "</link>"
-                << post
-                ;
-        }
     }
 
-    void generic_header_action::operator()(iterator const& first, iterator const& last) const
-    {
-        int level_ = section_level + 2;     // section_level is zero-based. We need to use a 
-                                            // 0ne-based heading which is one greater
-                                            // than the current. Thus: section_level + 2.
-        if (level_ > 6)                     // The max is h6, clip it if it goes 
-            level_ = 6;                     // further than that
-        std::string str = phrase.str();
-        detail::convert_nbsp(str);
-
-        std::string anchor = 
-            library_id + '.' + qualified_section_id + '.' +
-            detail::make_identifier(str.begin(), str.end());
-
-        phrase.str(std::string());
-        out 
-            << "<anchor id=\"" << anchor << "\"/>"
-            << "<bridgehead renderas=\"sect" << level_ << "\">"
-            << "<link linkend=\"" << anchor << "\">"
-            << str 
-            << "</link>"
-            << "</bridgehead>"
-            ;
-    }
-
     void simple_phrase_action::operator()(iterator first, iterator const& last) const
     {
-        out << pre;
-        std::string str(first, last);
-        if (std::string const* ptr = find(macro, str.c_str()))
+        if (out)
         {
-            out << *ptr;
-        }
-        else
-        {
+            out << pre;
             while (first != last)
-                detail::print_char(*first++, out.get());
+                detail::print_char(*first++, out);
+            out << post;
         }
-        out << post;
     }
 
     void list_action::operator()(iterator const& first, iterator const& last) const
@@ -181,7 +91,7 @@
                 out << std::string("\n</listitem>");
         }
 
-        list_indent = -1; // reset
+        indent = -1; // reset
     }
 
     void list_format_action::operator()(iterator first, iterator const& last) const
@@ -205,15 +115,15 @@
         char mark = *first;
         BOOST_ASSERT(mark == '#' || mark == '*'); // expecting a mark
 
-        if (list_indent == -1) // the very start
+        if (indent == -1) // the very start
         {
             BOOST_ASSERT(new_indent == 0);
         }
 
-        if (new_indent > list_indent)
+        if (new_indent > indent)
         {
-            list_indent = new_indent;
-            list_marks.push(mark_type(mark, list_indent));
+            indent = new_indent;
+            list_marks.push(mark_type(mark, indent));
             if (list_marks.size() > 1)
             {
                 // Make this new list a child of the previous list.
@@ -231,12 +141,12 @@
             out << std::string((mark == '#') ? "<orderedlist>\n" : "<itemizedlist>\n");
         }
 
-        else if (new_indent < list_indent)
+        else if (new_indent < indent)
         {
             BOOST_ASSERT(!list_marks.empty());
-            list_indent = new_indent;
+            indent = new_indent;
 
-            while (!list_marks.empty() && (list_indent < list_marks.top().second))
+            while (!list_marks.empty() && (indent < list_marks.top().second))
             {
                 char mark = list_marks.top().first;
                 list_marks.pop();
@@ -246,7 +156,7 @@
             }
         }
 
-        if (mark != list_marks.top().first) // new_indent == list_indent
+        if (mark != list_marks.top().first) // new_indent == indent
         {
             boost::spirit::file_position const pos = first.get_position();
             detail::outerr(pos.file,pos.line)
@@ -258,23 +168,30 @@
 
     void span::operator()(iterator first, iterator const& last) const
     {
-        out << "<phrase role=\"" << name << "\">";
-        while (first != last)
-            detail::print_char(*first++, out.get());
-        out << "</phrase>";
+        if (out)
+        {
+            out << "<phrase role=\"" << name << "\">";
+            while (first != last)
+                detail::print_char(*first++, out);
+            out << "</phrase>";
+        }
     }
 
     void unexpected_char::operator()(char) const
     {
-        out << '#'; // print out an unexpected character
+        if (out)
+            out << '#'; // print out an unexpected character
     }
 
     void anchor_action::operator()(iterator first, iterator const& last) const
     {
-        out << "<anchor id=\"";
-        while (first != last)
-            detail::print_char(*first++, out.get());
-        out << "\" />\n";
+        if (out)
+        {
+            out << "<anchor id=\"";
+            while (first != last)
+                detail::print_char(*first++, out);
+            out << "\" />\n";
+        }
     }
 
     void do_macro_action::operator()(std::string const& str) const
@@ -299,14 +216,19 @@
 
     void space::operator()(char ch) const
     {
-
-        detail::print_space(ch, out.get());
+        if (out)
+        {
+            detail::print_space(ch, out);
+        }
     }
 
     void space::operator()(iterator first, iterator const& last) const
     {
-        while (first != last)
-            detail::print_space(*first++, out.get());
+        if (out)
+        {
+            while (first != last)
+                detail::print_space(*first++, out);
+        }
     }
 
     void pre_escape_back::operator()(iterator const& first, iterator const& last) const
@@ -323,41 +245,44 @@
 
     void code_action::operator()(iterator const& first, iterator const& last) const
     {
-        std::string save = phrase.str();
-        phrase.str(std::string());
+        if (out)
+        {
+            std::string save = phrase.str();
+            phrase.str(std::string());
 
-        // preprocess the code section to remove the initial indentation
-        std::string program_(first, last);
-        detail::unindent(program_);
+            // preprocess the code section to remove the initial indentation
+            std::string program_(first, last);
+            detail::unindent(program_);
 
-        // $$$ fix me $$$ this is wasteful. we have to convert
-        // back to a vector<char> so we can use the same iterator type 
-        // used by the rest of the system, otherwise, it is wasteful 
-        // of function template instantiations
+            // $$$ fix me $$$ this is wasteful. we have to convert
+            // back to a vector<char> so we can use the same iterator type 
+            // used by the rest of the system, otherwise, it is wasteful 
+            // of function template instantiations
 
-        std::vector<char> program(program_.begin(), program_.end());
-        iterator first_(program.begin(), program.end());
-        iterator last_(program.end(), program.end());
-        first_.set_position(first.get_position());
+            std::vector<char> program(program_.begin(), program_.end());
+            iterator first_(program.begin(), program.end());
+            iterator last_(program.end(), program.end());
+            first_.set_position(first.get_position());
 
-        // print the code with syntax coloring
-        if (source_mode == "c++")
-        {
-            parse(first_, last_, cpp_p);
-        }
-        else if (source_mode == "python")
-        {
-            parse(first_, last_, python_p);
-        }
-        
-        std::string str = temp.str();
-        temp.str(std::string());
-        phrase.str(std::string());
-        phrase << save;
+            // print the code with syntax coloring
+            if (source_mode == "c++")
+            {
+                parse(first_, last_, cpp_p);
+            }
+            else if (source_mode == "python")
+            {
+                parse(first_, last_, python_p);
+            }
+            
+            std::string str = temp.str();
+            temp.str(std::string());
+            phrase.str(std::string());
+            phrase << save;
 
-        out << "<programlisting>\n";
-        out << str;
-        out << "</programlisting>\n";
+            out << "<programlisting>\n";
+            out << str;
+            out << "</programlisting>\n";
+        }
     }
 
     void inline_code_action::operator()(iterator const& first, iterator const& last) const
@@ -396,12 +321,12 @@
 
     void plain_char_action::operator()(char ch) const
     {
-        detail::print_char(ch, phrase.get());
+        detail::print_char(ch, phrase);
     }
 
     void plain_char_action::operator()(iterator const& first, iterator const& /*last*/) const
     {
-        detail::print_char(*first, phrase.get());
+        detail::print_char(*first, phrase);
     }
 
     void image_action::operator()(iterator first, iterator const& last) const
@@ -412,183 +337,40 @@
 
         phrase << "<imageobject><imagedata fileref=\"";
         while (first != last)
-            detail::print_char(*first++, phrase.get());
+            detail::print_char(*first++, phrase);
         phrase << "\"></imagedata></imageobject>";
 
         // Also add a textobject -- use the basename of the image file.
         // This will mean we get "alt" attributes of the HTML img.
         phrase << "<textobject><phrase>";
-        detail::print_string(fs::basename(img_path), phrase.get());
+        detail::print_string(fs::basename(img_path), phrase);
         phrase << "</phrase></textobject>";
 
         phrase << "</inlinemediaobject>";
     }
 
-    void macro_identifier_action::operator()(iterator const& first, iterator const& last) const
+    void indentifier_action::operator()(iterator const& first, iterator const& last) const
     {
         actions.macro_id.assign(first, last);
-        actions.macro_phrase_save = actions.phrase.str();
+        actions.phrase_save = actions.phrase.str();
         actions.phrase.str(std::string());
     }
 
-    void macro_definition_action::operator()(iterator const& first, iterator const& last) const
+    void macro_def_action::operator()(iterator const& first, iterator const& last) const
     {
         actions.macro.add(
             actions.macro_id.begin()
           , actions.macro_id.end()
           , actions.phrase.str());
-        actions.phrase.str(actions.macro_phrase_save);
+        actions.phrase.str(actions.phrase_save);
     }
 
-    void template_body_action::operator()(iterator const& first, iterator const& last) const
-    {
-        BOOST_ASSERT(actions.template_info.size());
-        actions.template_info.push_back(std::string(first, last));
-        actions.templates.add(
-            actions.template_info[0].begin()
-          , actions.template_info[0].end()
-          , boost::make_tuple(actions.template_info, first.get_position()));
-        actions.template_info.clear();
-    }
-
-    void do_template_action::operator()(iterator const& first, iterator const&) const
-    {
-        boost::spirit::file_position const pos = first.get_position();
-        ++actions.template_depth;
-        if (actions.template_depth > actions.max_template_depth)
-        {
-            detail::outerr(pos.file,pos.line)
-                << "Infinite loop detected" << std::endl;
-            --actions.template_depth;
-            return;
-        }
-        
-        std::string result;
-        actions.push(); // scope the actions' states
-        {
-            actions.phrase.str(std::string()); // clear the phrase
-            
-            simple_phrase_grammar<quickbook::actions> phrase_p(actions);
-            block_grammar<quickbook::actions, true> block_p(actions);
-
-            template_symbol const* symbol = 
-                find(actions.templates, actions.template_info[0].c_str());
-            BOOST_ASSERT(symbol);
-            
-            std::vector<std::string> template_ = boost::get<0>(*symbol);
-            boost::spirit::file_position template_pos = boost::get<1>(*symbol);
-
-            std::vector<std::string> template_info;
-            std::swap(template_info, actions.template_info);
-            
-            if (template_.size()-1 != template_info.size())
-            {
-                actions.pop(); // restore the actions' states
-                detail::outerr(pos.file,pos.line)
-                    << "Invalid number of arguments passed. Expecting: "
-                    << template_.size()-2
-                    << " argument(s), got: "
-                    << template_info.size()-1
-                    << " argument(s) instead."
-                    << std::endl;
-                --actions.template_depth;
-                return;
-            }
-
-            std::vector<std::string>::const_iterator arg = template_info.begin()+1; 
-            std::vector<std::string>::const_iterator tpl = template_.begin()+1; 
-
-            // Expand each of the argument passed in:
-            while (arg != template_info.end())
-            {
-                std::vector<char> temp;
-                temp.assign(arg->begin(), arg->end());
-                iterator first(temp.begin(), temp.end(), actions.filename.native_file_string().c_str());
-                first.set_position(pos);
-                iterator last(temp.end(), temp.end());
-                bool r = boost::spirit::parse(first, last, phrase_p).full;
-
-                if (!r)
-                {
-                    boost::spirit::file_position const pos = first.get_position();
-                    detail::outerr(pos.file,pos.line)
-                        << "Expanding template" << std::endl;
-                }
-                else
-                {
-                    if (std::string* s = find(actions.macro, tpl->c_str()))
-                    {
-                        *s = actions.phrase.str();
-                    }
-                    else
-                    {
-                        actions.macro.add(tpl->begin(), tpl->end(), actions.phrase.str());
-                    }
-                }
-                actions.phrase.str(std::string()); // clear the phrase
-                ++arg; ++tpl;
-            }
-            
-            // parse the template body:
-            std::vector<char> temp;
-            temp.assign(tpl->begin(), tpl->end());
-            temp.reserve(temp.size()+2); // reserve 2 more
-            
-            // How do we know if we are to parse the template as a block or
-            // a phrase? We apply a simple heuristic: if the body starts with
-            // a newline, then we regard is as a block, otherwise, we parse
-            // it as a phrase.
-            
-            std::vector<char>::const_iterator iter = temp.begin();
-            while (iter != temp.end() && ((*iter == ' ') || (*iter == '\t')))
-                ++iter; // skip spaces and tabs
-            bool is_block = (iter != temp.end()) && ((*iter == '\r') || (*iter == '\n'));
-            bool r = false;
-
-            if (!is_block)
-            {
-                //  do a phrase level parse
-                iterator first(temp.begin(), temp.end(), actions.filename.native_file_string().c_str());
-                first.set_position(template_pos);
-                iterator last(temp.end(), temp.end());
-                r = boost::spirit::parse(first, last, phrase_p).full;
-                result = actions.phrase.str();
-            }
-            else
-            {
-                //  do a block level parse
-                //  ensure that we have enough trailing newlines to eliminate
-                //  the need to check for end of file in the grammar.
-                temp.push_back('\n');
-                temp.push_back('\n');
-                while (iter != temp.end() && ((*iter == '\r') || (*iter == '\n')))
-                    ++iter; // skip initial newlines
-                iterator first(iter, temp.end(), actions.filename.native_file_string().c_str());
-                first.set_position(template_pos);
-                iterator last(temp.end(), temp.end());
-                r = boost::spirit::parse(first, last, block_p).full;
-                result = actions.out.str();
-            }
-
-            if (!r)
-            {
-                boost::spirit::file_position const pos = first.get_position();
-                detail::outerr(pos.file,pos.line)
-                    << "Expanding template" << std::endl;
-            }
-        }
-
-        actions.pop(); // restore the actions' states
-        actions.phrase << result; // print it!!!
-        --actions.template_depth;
-    }
-
     void link_action::operator()(iterator first, iterator const& last) const
     {
         iterator save = first;
         phrase << tag;
         while (first != last)
-            detail::print_char(*first++, phrase.get());
+            detail::print_char(*first++, phrase);
         phrase << "\">";
 
         // Yes, it is safe to dereference last here. When we
@@ -600,66 +382,72 @@
         {
             first = save;
             while (first != last)
-                detail::print_char(*first++, phrase.get());
+                detail::print_char(*first++, phrase);
         }
     }
 
     void variablelist_action::operator()(iterator, iterator) const
     {
-        actions.out << "<variablelist>\n";
+        if (!!actions.out)
+        {
+            actions.out << "<variablelist>\n";
 
-        actions.out << "<title>";
-        std::string::iterator first = actions.table_title.begin();
-        std::string::iterator last = actions.table_title.end();
-        while (first != last)
-            detail::print_char(*first++, actions.out.get());
-        actions.out << "</title>\n";
+            actions.out << "<title>";
+            std::string::iterator first = actions.table_title.begin();
+            std::string::iterator last = actions.table_title.end();
+            while (first != last)
+                detail::print_char(*first++, actions.out);
+            actions.out << "</title>\n";
 
-        std::string str = actions.phrase.str();
-        actions.phrase.str(std::string());
-        actions.out << str;
+            std::string str = actions.phrase.str();
+            actions.phrase.str(std::string());
+            actions.out << str;
 
-        actions.out << "</variablelist>\n";
-        actions.table_span = 0;
-        actions.table_header.clear();
-        actions.table_title.clear();
+            actions.out << "</variablelist>\n";
+            actions.table_span = 0;
+            actions.table_header.clear();
+            actions.table_title.clear();
+        }
     }
 
     void table_action::operator()(iterator, iterator) const
     {
-        actions.out << "<informaltable frame=\"all\">\n"
-                     << "<bridgehead renderas=\"sect4\">";
-
-        std::string::iterator first = actions.table_title.begin();
-        std::string::iterator last = actions.table_title.end();
-        if (first != last) // allow no title
+        if (!!actions.out)
         {
-            actions.out << "<phrase role=\"table-title\">";
-            while (first != last)
-                detail::print_char(*first++, actions.out.get());
-            actions.out << "</phrase>";
-        }
-        actions.out << "</bridgehead>\n"
-                     << "<tgroup cols=\"" << actions.table_span << "\">\n";
+            actions.out << "<informaltable frame=\"all\">\n"
+                         << "<bridgehead renderas=\"sect4\">";
 
-        if (!actions.table_header.empty())
-        {
-            actions.out << "<thead>" << actions.table_header << "</thead>\n";
-        }
+            std::string::iterator first = actions.table_title.begin();
+            std::string::iterator last = actions.table_title.end();
+            if (first != last) // allow no title
+            {
+                actions.out << "<phrase role=\"table-title\">";
+                while (first != last)
+                    detail::print_char(*first++, actions.out);
+                actions.out << "</phrase>";
+            }
+            actions.out << "</bridgehead>\n"
+                         << "<tgroup cols=\"" << actions.table_span << "\">\n";
 
-        actions.out << "<tbody>\n";
+            if (!actions.table_header.empty())
+            {
+                actions.out << "<thead>" << actions.table_header << "</thead>\n";
+            }
 
-        std::string str = actions.phrase.str();
-        detail::convert_nbsp(str);
-        actions.phrase.str(std::string());
-        actions.out << str;
+            actions.out << "<tbody>\n";
 
-        actions.out << "</tbody>\n"
-                     << "</tgroup>\n"
-                     << "</informaltable>\n";
-        actions.table_span = 0;
-        actions.table_header.clear();
-        actions.table_title.clear();
+            std::string str = actions.phrase.str();
+            detail::convert_nbsp(str);
+            actions.phrase.str(std::string());
+            actions.out << str;
+
+            actions.out << "</tbody>\n"
+                         << "</tgroup>\n"
+                         << "</informaltable>\n";
+            actions.table_span = 0;
+            actions.table_header.clear();
+            actions.table_title.clear();
+        }
     }
 
     void start_row_action::operator()(char) const
@@ -691,12 +479,12 @@
         if (section_id.empty())
             section_id = detail::make_identifier(first, last);
 
-        if (section_level != 0)
+        if (level != 0)
             qualified_section_id += '.';
         else
             BOOST_ASSERT(qualified_section_id.empty());
         qualified_section_id += section_id;
-        ++section_level;
+        ++level;
 
         if (qbk_version_n < 103) // version 1.2 and below
         {
@@ -711,35 +499,21 @@
         std::string str;
         str = phrase.str();
         phrase.str(std::string());
-
-        if (qbk_version_n < 103) // version 1.2 and below
-        {
-            out << "<title>" << str << "</title>\n";
-        }
-        else // version 1.3 and above
-        {
-            out << "<title>" 
-                << "<link linkend=\"" << library_id
-                    << "." << qualified_section_id << "\">"
-                << str 
-                << "</link>"
-                << "</title>\n"
-                ;
-        }
+        out << "<title>" << str << "</title>\n";
     }
 
     void end_section_action::operator()(iterator const& first, iterator const& last) const
     {
         out << "</section>";
 
-        --section_level;
-        if (section_level < 0)
+        --level;
+        if (level < 0)
         {
             boost::spirit::file_position const pos = first.get_position();
             detail::outerr(pos.file,pos.line)
                 << "Mismatched [endsect] near column " << pos.column << ".\n";
         }
-        if (section_level == 0)
+        if (level == 0)
         {
             qualified_section_id.clear();
         }
@@ -780,7 +554,7 @@
             xmlfile = path_difference(outdir, xmlfile);
         }
         out << "\n<xi:include href=\"";
-        detail::print_string(detail::escape_uri(xmlfile.string()), out.get());
+        detail::print_string(detail::escape_uri(xmlfile.string()), out);
         out << "\" />\n";
     }
 
@@ -806,9 +580,7 @@
         actions.doc_last_revision.swap(doc_last_revision);
 
         // scope the macros
-        string_symbols macro = actions.macro;
-        // scope the templates
-        template_symbols templates = actions.templates;
+        macros_type macro = actions.macro;
 
         // if an id is specified in this include (in in [include:id foo.qbk]
         // then use it as the doc_id.
@@ -832,10 +604,7 @@
         actions.doc_dirname.swap(doc_dirname);
         actions.doc_last_revision.swap(doc_last_revision);
 
-        // restore the macros
         actions.macro = macro;
-        // restore the templates
-        actions.templates = templates;
     }
 
     void xml_author::operator()(std::pair<std::string, std::string> const& author) const
@@ -851,7 +620,7 @@
         out << "      <year>" << year << "</year>\n";
     }
 
-    void pre(collector& out, quickbook::actions& actions, bool ignore_docinfo)
+    void pre(std::ostream& out, quickbook::actions& actions, bool ignore_docinfo)
     {
         // The doc_info in the file has been parsed. Here's what we'll do 
         // *before* anything else.
@@ -979,7 +748,7 @@
         }
     }
 
-    void post(collector& out, quickbook::actions& actions, bool ignore_docinfo)
+    void post(std::ostream& out, quickbook::actions& actions, bool ignore_docinfo)
     {
         // if we're ignoring the document info, do nothing.
         if (ignore_docinfo)
@@ -998,7 +767,7 @@
         phrase.str(std::string());
     }
 
-    actions::actions(char const* filein_, fs::path const& outdir_, std::stringstream& out_)
+    actions::actions(char const* filein_, fs::path const& outdir_, std::ostream &out_)
         : filename(fs::complete(fs::path(filein_, fs::native)))
         , outdir(outdir_)
         , out(out_)
@@ -1011,7 +780,6 @@
         , code_block(phrase, phrase, temp, source_mode, macro, *this)
         , inline_code(phrase, temp, source_mode, macro, *this)
         , paragraph(out, phrase, paragraph_pre, paragraph_post)
-        , h(out, phrase, doc_id, section_id, qualified_section_id, section_level)
         , h1(out, phrase, doc_id, section_id, qualified_section_id, h1_pre, h1_post)
         , h2(out, phrase, doc_id, section_id, qualified_section_id, h2_pre, h2_post)
         , h3(out, phrase, doc_id, section_id, qualified_section_id, h3_pre, h3_post)
@@ -1030,10 +798,11 @@
         , plain_char(phrase)
         , raw_char(phrase)
         , image(phrase)
+        , list_buffer()
         , list_marks()
-        , list_indent(-1)
-        , list(out, list_buffer, list_indent, list_marks)
-        , list_format(list_buffer, list_indent, list_marks)
+        , indent(-1)
+        , list(out, list_buffer, indent, list_marks)
+        , list_format(list_buffer, indent, list_marks)
         , list_item(list_buffer, phrase, list_item_pre, list_item_post)
         , funcref_pre(phrase, funcref_pre_)
         , funcref_post(phrase, funcref_post_)
@@ -1061,11 +830,11 @@
         , replaceable_post(phrase, replaceable_post_)
         , footnote_pre(phrase, footnote_pre_)
         , footnote_post(phrase, footnote_post_)
-        , simple_bold(phrase, bold_pre_, bold_post_, macro)
-        , simple_italic(phrase, italic_pre_, italic_post_, macro)
-        , simple_underline(phrase, underline_pre_, underline_post_, macro)
-        , simple_teletype(phrase, teletype_pre_, teletype_post_, macro)
-        , simple_strikethrough(phrase, strikethrough_pre_, strikethrough_post_, macro)
+        , simple_bold(phrase, bold_pre_, bold_post_)
+        , simple_italic(phrase, italic_pre_, italic_post_)
+        , simple_underline(phrase, underline_pre_, underline_post_)
+        , simple_teletype(phrase, teletype_pre_, teletype_post_)
+        , simple_strikethrough(phrase, strikethrough_pre_, strikethrough_post_)
         , variablelist(*this)
         , start_varlistentry(phrase, start_varlistentry_)
         , end_varlistentry(phrase, end_varlistentry_)
@@ -1074,11 +843,9 @@
         , start_varlistitem(phrase, start_varlistitem_)
         , end_varlistitem(phrase, end_varlistitem_)
         , break_(phrase, break_mark)
-        , macro_identifier(*this)
-        , macro_definition(*this)
+        , identifier(*this)
+        , macro_def(*this)
         , do_macro(phrase)
-        , template_body(*this)
-        , do_template(*this)
         , url_pre(phrase, url_pre_)
         , url_post(phrase, url_post_)
         , link_pre(phrase, link_pre_)
@@ -1089,14 +856,13 @@
         , start_cell(phrase, table_span)
         , end_cell(phrase, end_cell_)
         , anchor(out)
-        , begin_section(out, phrase, doc_id, section_id, section_level, qualified_section_id)
-        , end_section(out, section_level, qualified_section_id)
+        , begin_section(out, phrase, doc_id, section_id, level, qualified_section_id)
+        , end_section(out, level, qualified_section_id)
         , xinclude(out, *this)
         , include(*this)
-        , section_level(0)
+        , level(0)
         , escape_pre(phrase, escape_pre_)
         , escape_post(phrase, escape_post_)
-        , template_depth(0)
     {
         // turn off __FILENAME__ macro on debug mode = true
         std::string filename_str = debug_mode ? 
@@ -1110,45 +876,4 @@
             ("__FILENAME__", filename_str)
         ;
     }
-
-    void actions::push()
-    {
-        state_stack.push(
-            boost::make_tuple(
-                filename
-              , outdir
-              , macro
-              , templates
-              , section_level
-              , section_id
-              , qualified_section_id
-              , source_mode
-            )
-        );
-        
-        out.push();
-        phrase.push();
-        temp.push();
-        list_buffer.push();
-    }   
-
-    void actions::pop()
-    {
-        boost::tie(
-            filename
-          , outdir
-          , macro
-          , templates
-          , section_level
-          , section_id
-          , qualified_section_id
-          , source_mode
-        ) = state_stack.top();
-        state_stack.pop();
-
-        out.pop();
-        phrase.pop();
-        temp.pop();
-        list_buffer.pop();
-    }
 }

Modified: boost/trunk/tools/quickbook/detail/actions.hpp
===================================================================
--- boost/trunk/tools/quickbook/detail/actions.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/detail/actions.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -19,9 +19,6 @@
 #include <sstream>
 #include <boost/spirit/iterator/position_iterator.hpp>
 #include <boost/filesystem/operations.hpp>
-#include <boost/noncopyable.hpp>
-#include <boost/foreach.hpp>
-#include <boost/tuple/tuple.hpp>
 #include "../syntax_highlight.hpp"
 #include "utils.hpp"
 
@@ -36,24 +33,6 @@
     typedef std::vector<char> file_storage;
     typedef position_iterator<file_storage::const_iterator> iterator;
     typedef std::string::const_iterator string_iterator;
-    typedef symbols<std::string> string_symbols;
-
-    //  template symbols are stored as follows:
-    //
-    //      template name
-    //      template param name[0]
-    //      template param name[1]
-    //      ... 
-    //      template param name[N]
-    //      template body
-
-    typedef boost::tuple<
-        std::vector<std::string>
-      , boost::spirit::file_position
-    > template_symbol;
-
-    typedef symbols<template_symbol> template_symbols;
-
     struct actions;
     extern tm* current_time; // the current time
     extern tm* current_gm_time; // the current UTC time
@@ -65,33 +44,105 @@
     // forward declarations
     struct actions;
     int parse(char const* filein_, actions& actor, bool ignore_docinfo = false);
-    
-    struct collector : boost::noncopyable
+
+    namespace
     {
-        collector();
-        collector(std::stringstream& out);
-        ~collector();
-        
-        std::ostream& get() const;
-        std::string str() const;
-        void str(std::string const& s);
-        void push();
-        void pop();
-
-    private:
-
-        std::stack<std::stringstream*> streams;
-        boost::reference_wrapper<std::stringstream> main;
-        boost::reference_wrapper<std::stringstream> top;
-        std::stringstream default_;
-    };
+        // Some markups
     
-    template <typename T>
-    inline collector& 
-    operator<<(collector& out, T const& val)
-    {
-        out.get() << val;
-        return out;
+        const char* paragraph_pre   = "<para>\n";
+        const char* paragraph_post  = "</para>\n";
+        const char* h1_pre          = "<bridgehead renderas=\"sect1\">";
+        const char* h1_post         = "</bridgehead>";
+        const char* h2_pre          = "<bridgehead renderas=\"sect2\">";
+        const char* h2_post         = "</bridgehead>";
+        const char* h3_pre          = "<bridgehead renderas=\"sect3\">";
+        const char* h3_post         = "</bridgehead>";
+        const char* h4_pre          = "<bridgehead renderas=\"sect4\">";
+        const char* h4_post         = "</bridgehead>";
+        const char* h5_pre          = "<bridgehead renderas=\"sect5\">";
+        const char* h5_post         = "</bridgehead>";
+        const char* h6_pre          = "<bridgehead renderas=\"sect6\">";
+        const char* h6_post         = "</bridgehead>";
+        const char* hr_             = "<para/>";
+    
+        const char* blurb_pre =
+            "<informaltable frame=\"all\">\n"
+            "<?dbhtml table-width=\"74%\" ?>\n"
+            "<tgroup cols=\"1\">\n"
+            "<tbody>\n"
+            "<row>\n"
+            "<entry role=\"blurb\">\n"
+            ;
+    
+        const char* blurb_post =
+            "</entry>\n"
+            "</row>\n"
+            "</tbody>\n"
+            "</tgroup>\n"
+            "</informaltable>\n"
+            ;
+    
+        const char* blockquote_pre      = "<blockquote><para>";
+        const char* blockquote_post     = "</para></blockquote>";
+        const char* preformatted_pre    = "<programlisting>";
+        const char* preformatted_post   = "</programlisting>";
+        const char* warning_pre         = "<warning><para>";
+        const char* warning_post        = "</para></warning>";
+        const char* caution_pre         = "<caution><para>";
+        const char* caution_post        = "</para></caution>";
+        const char* important_pre     = "<important><para>";
+        const char* important_post    = "</para></important>";
+        const char* note_pre            = "<note><para>";
+        const char* note_post           = "</para></note>";
+        const char* tip_pre             = "<tip><para>";
+        const char* tip_post            = "</para></tip>";
+        const char* list_item_pre       = "<listitem>\n";
+        const char* list_item_post      = "\n</listitem>";
+        const char* bold_pre_           = "<emphasis role=\"bold\">";
+        const char* bold_post_          = "</emphasis>";
+        const char* italic_pre_         = "<emphasis>";
+        const char* italic_post_        = "</emphasis>";
+        const char* underline_pre_      = "<emphasis role=\"underline\">";
+        const char* underline_post_     = "</emphasis>";
+        const char* teletype_pre_       = "<literal>";
+        const char* teletype_post_      = "</literal>";
+        const char* strikethrough_pre_  = "<emphasis role=\"strikethrough\">";
+        const char* strikethrough_post_ = "</emphasis>";
+        const char* quote_pre_          = "<quote>";
+        const char* quote_post_         = "</quote>";
+        const char* break_mark          = "<sbr/>\n";
+        const char* url_pre_            = "<ulink url=\"";
+        const char* url_post_           = "</ulink>";
+        const char* link_pre_           = "<link linkend=\"";
+        const char* link_post_          = "</link>";
+        const char* start_varlistentry_ = "<varlistentry>";
+        const char* end_varlistentry_   = "</varlistentry>\n";
+        const char* start_varlistterm_  = "<term>";
+        const char* end_varlistterm_    = "</term>";
+        const char* start_varlistitem_  = "<listitem>";
+        const char* end_varlistitem_    = "</listitem>";
+        const char* start_header_       = "<thead>";
+        const char* end_header_         = "</thead>\n";
+        const char* start_row_          = "<row>";
+        const char* end_row_            = "</row>\n";
+        const char* start_cell_         = "<entry>";
+        const char* end_cell_           = "</entry>";
+        const char* funcref_pre_        = "<functionname alt=\"";
+        const char* funcref_post_       = "</functionname>";
+        const char* classref_pre_       = "<classname alt=\"";
+        const char* classref_post_      = "</classname>";
+        const char* memberref_pre_      = "<methodname alt=\"";
+        const char* memberref_post_     = "</methodname>";
+        const char* enumref_pre_        = "<enumname alt=\"";
+        const char* enumref_post_       = "</enumname>";
+        const char* headerref_pre_      = "<headername alt=\"";
+        const char* headerref_post_     = "</headername>";
+        const char* footnote_pre_       = "<footnote><para>";
+        const char* footnote_post_      = "</para></footnote>";
+        const char* escape_pre_         = "<!--quickbook-escape-prefix-->";
+        const char* escape_post_        = "<!--quickbook-escape-postfix-->";
+        const char* replaceable_pre_    = "<replaceable>";
+        const char* replaceable_post_   = "</replaceable>";
     }
     
     struct error_action
@@ -107,10 +158,10 @@
         //  unordered_list, ordered_list
 
         phrase_action(
-            collector& out,
-            collector& phrase,
-            std::string const& pre,
-            std::string const& post)
+            std::ostream&       out,
+            std::stringstream&  phrase,
+            std::string const&  pre,
+            std::string const&  post)
         : out(out)
         , phrase(phrase)
         , pre(pre)
@@ -118,24 +169,24 @@
 
         void operator()(iterator const& first, iterator const& last) const;
 
-        collector& out;
-        collector& phrase;
-        std::string pre;
-        std::string post;
+        std::ostream&       out;
+        std::stringstream&  phrase;
+        std::string         pre;
+        std::string         post;
     };
 
-    struct header_action
+    struct anchored_phrase_action
     {
         //  Handles paragraph, h1, h2, h3, h4, h5, h6,
 
-        header_action(
-            collector& out,
-            collector& phrase,
-            std::string const& library_id,
-            std::string const& section_id,
-            std::string const& qualified_section_id,
-            std::string const& pre,
-            std::string const& post)
+        anchored_phrase_action(
+            std::ostream&       out,
+            std::stringstream&  phrase,
+            std::string const&  library_id,
+            std::string const&  section_id,
+            std::string const&  qualified_section_id,
+            std::string const&  pre,
+            std::string const&  post)
         : out(out)
         , phrase(phrase)
         , library_id(library_id)
@@ -146,63 +197,32 @@
 
         void operator()(iterator const& first, iterator const& last) const;
 
-        collector& out;
-        collector& phrase;
-        std::string const& library_id;
-        std::string const& section_id;
-        std::string const& qualified_section_id;
-        std::string pre;
-        std::string post;
+        std::ostream&       out;
+        std::stringstream&  phrase;
+        std::string const&  library_id;
+        std::string const&  section_id;
+        std::string const&  qualified_section_id;
+        std::string         pre;
+        std::string         post;
     };
 
-    struct generic_header_action
-    {
-        //  Handles h
-
-        generic_header_action(
-            collector& out,
-            collector& phrase,
-            std::string const& library_id,
-            std::string const& section_id,
-            std::string const& qualified_section_id,
-            int const& section_level)
-        : out(out)
-        , phrase(phrase)
-        , library_id(library_id)
-        , section_id(section_id)
-        , qualified_section_id(qualified_section_id)
-        , section_level(section_level) {}
-
-        void operator()(iterator const& first, iterator const& last) const;
-
-        collector& out;
-        collector& phrase;
-        std::string const& library_id;
-        std::string const& section_id;
-        std::string const& qualified_section_id;
-        int const& section_level;
-    };
-
     struct simple_phrase_action
     {
         //  Handles simple text formats
 
         simple_phrase_action(
-            collector& out
-          , std::string const& pre
-          , std::string const& post
-          , string_symbols const& macro)
+            std::ostream&       out,
+            std::string const&  pre,
+            std::string const&  post)
         : out(out)
         , pre(pre)
-        , post(post)
-        , macro(macro) {}
+        , post(post) {}
 
         void operator()(iterator first, iterator const& last) const;
 
-        collector& out;
-        std::string pre;
-        std::string post;
-        string_symbols const& macro;
+        std::ostream&   out;
+        std::string     pre;
+        std::string     post;
     };
 
     struct list_action
@@ -211,20 +231,20 @@
 
         typedef std::pair<char, int> mark_type;
         list_action(
-            collector& out
-          , collector& list_buffer
-          , int& list_indent
+            std::ostream& out
+          , std::stringstream& list_buffer
+          , int& indent
           , std::stack<mark_type>& list_marks)
         : out(out)
         , list_buffer(list_buffer)
-        , list_indent(list_indent)
+        , indent(indent)
         , list_marks(list_marks) {}
 
         void operator()(iterator const& first, iterator const& last) const;
 
-        collector& out;
-        collector& list_buffer;
-        int& list_indent;
+        std::ostream& out;
+        std::stringstream& list_buffer;
+        int& indent;
         std::stack<mark_type>& list_marks;
     };
 
@@ -234,17 +254,17 @@
 
         typedef std::pair<char, int> mark_type;
         list_format_action(
-            collector& out
-          , int& list_indent
+            std::stringstream& out
+          , int& indent
           , std::stack<mark_type>& list_marks)
         : out(out)
-        , list_indent(list_indent)
+        , indent(indent)
         , list_marks(list_marks) {}
 
         void operator()(iterator first, iterator const& last) const;
 
-        collector& out;
-        int& list_indent;
+        std::stringstream& out;
+        int& indent;
         std::stack<mark_type>& list_marks;
     };
 
@@ -252,37 +272,37 @@
     {
         // Decorates c++ code fragments
 
-        span(char const* name, collector& out)
+        span(char const* name, std::ostream& out)
         : name(name), out(out) {}
 
         void operator()(iterator first, iterator const& last) const;
 
         char const* name;
-        collector& out;
+        std::ostream& out;
     };
 
     struct unexpected_char
     {
         // Handles unexpected chars in c++ syntax
 
-        unexpected_char(collector& out)
+        unexpected_char(std::ostream& out)
         : out(out) {}
 
         void operator()(char) const;
 
-        collector& out;
+        std::ostream& out;
     };
 
     struct anchor_action
     {
         // Handles anchors
 
-        anchor_action(collector& out)
+        anchor_action(std::ostream& out)
             : out(out) {}
 
         void operator()(iterator first, iterator const& last) const;
 
-        collector& out;
+        std::ostream& out;
     };
 
     namespace
@@ -295,24 +315,24 @@
     {
         // Handles macro substitutions
 
-        do_macro_action(collector& phrase)
-            : phrase(phrase) {}
+        do_macro_action(std::ostream& phrase)
+        : phrase(phrase) {}
 
         void operator()(std::string const& str) const;
-        collector& phrase;
+        std::ostream& phrase;
     };
 
     struct space
     {
         // Prints a space
 
-        space(collector& out)
-            : out(out) {}
+        space(std::ostream& out)
+        : out(out) {}
 
         void operator()(iterator first, iterator const& last) const;
         void operator()(char ch) const;
 
-        collector& out;
+        std::ostream& out;
     };
 
     struct pre_escape_back
@@ -332,51 +352,51 @@
     {
         // Escapes back from code to quickbook (Post)
 
-        post_escape_back(collector& out, actions& escape_actions, std::string& save)
+        post_escape_back(std::ostream& out, actions& escape_actions, std::string& save)
             : out(out), escape_actions(escape_actions), save(save) {}
 
         void operator()(iterator const& first, iterator const& last) const;
 
-        collector& out;
+        std::ostream& out;
         actions& escape_actions;
         std::string& save;
     };
 
+    typedef symbols<std::string> macros_type;
     typedef cpp_highlight<
         span
       , space
-      , string_symbols
+      , macros_type
       , do_macro_action
       , pre_escape_back
       , post_escape_back
       , actions
       , unexpected_char
-      , collector>
+      , std::ostream>
     cpp_p_type;
         
     typedef python_highlight<
         span
       , space
-      , string_symbols
+      , macros_type
       , do_macro_action
       , pre_escape_back
       , post_escape_back
       , actions
       , unexpected_char
-      , collector>
+      , std::ostream>
     python_p_type;
 
     struct code_action
     {
         // Does the actual syntax highlighing of code
 
-        code_action(
-            collector& out
-          , collector& phrase
-          , collector& temp
-          , std::string const& source_mode
-          , string_symbols const& macro
-          , actions& escape_actions)
+        code_action(std::ostream& out,
+                    std::stringstream& phrase,
+                    std::stringstream& temp,
+                    std::string const& source_mode,
+                    macros_type const& macro,
+                    actions& escape_actions)
         : out(out)
         , phrase(phrase)
         , temp(temp)
@@ -388,9 +408,9 @@
 
         void operator()(iterator const& first, iterator const& last) const;
 
-        collector& out;
-        collector& phrase;
-        collector& temp;
+        std::ostream& out;
+        std::stringstream& phrase;
+        std::stringstream& temp;
         std::string const& source_mode;
 
         cpp_p_type cpp_p;
@@ -401,12 +421,11 @@
     {
         // Does the actual syntax highlighing of code inlined in text
 
-        inline_code_action(
-            collector& out
-          , collector& temp
-          , std::string const& source_mode
-          , string_symbols const& macro
-          , actions& escape_actions)
+        inline_code_action(std::stringstream& out,
+                           std::stringstream& temp,
+                           std::string const& source_mode,
+                           macros_type const& macro,
+                           actions& escape_actions)
         : out(out)
         , source_mode(source_mode)
         , temp(temp)
@@ -416,9 +435,9 @@
 
         void operator()(iterator const& first, iterator const& last) const;
 
-        collector& out;
+        std::stringstream& out;
         std::string const& source_mode;
-        collector& temp;
+        std::stringstream& temp;
 
         cpp_p_type cpp_p;
         python_p_type python_p;
@@ -429,13 +448,13 @@
         // Prints a single raw (unprocessed) char.
         // Allows '<', '>'... etc.
 
-        raw_char_action(collector& phrase)
+        raw_char_action(std::ostream& phrase)
         : phrase(phrase) {}
 
         void operator()(char ch) const;
         void operator()(iterator const& first, iterator const& /*last*/) const;
 
-        collector& phrase;
+        std::ostream& phrase;
     };
 
     struct plain_char_action
@@ -443,32 +462,32 @@
         // Prints a single plain char.
         // Converts '<' to "&lt;"... etc See utils.hpp
 
-        plain_char_action(collector& phrase)
+        plain_char_action(std::ostream& phrase)
         : phrase(phrase) {}
 
         void operator()(char ch) const;
         void operator()(iterator const& first, iterator const& /*last*/) const;
 
-        collector& phrase;
+        std::ostream& phrase;
     };
 
     struct image_action
     {
         // Handles inline images
 
-        image_action(collector& phrase)
+        image_action(std::ostream& phrase)
         : phrase(phrase) {}
 
         void operator()(iterator first, iterator const& last) const;
 
-        collector& phrase;
+        std::ostream& phrase;
     };
     
     struct markup_action
     {
         // A generic markup action
 
-        markup_action(collector& phrase, std::string const& str)
+        markup_action(std::ostream& phrase, std::string const& str)
         : phrase(phrase), str(str) {}
 
         template <typename T>
@@ -483,15 +502,15 @@
             phrase << str;
         }
 
-        collector& phrase;
+        std::ostream& phrase;
         std::string str;
     };
 
-    struct macro_identifier_action
+    struct indentifier_action
     {
         // Handles macro identifiers
 
-        macro_identifier_action(quickbook::actions& actions)
+        indentifier_action(quickbook::actions& actions)
         : actions(actions) {}
 
         void operator()(iterator const& first, iterator const& last) const;
@@ -499,11 +518,11 @@
         quickbook::actions& actions;
     };
 
-    struct macro_definition_action
+    struct macro_def_action
     {
         // Handles macro definitions
 
-        macro_definition_action(quickbook::actions& actions)
+        macro_def_action(quickbook::actions& actions)
         : actions(actions) {}
 
         void operator()(iterator const& first, iterator const& last) const;
@@ -511,40 +530,16 @@
         quickbook::actions& actions;
     };
 
-    struct template_body_action
-    {
-        // Handles template definitions
-
-        template_body_action(quickbook::actions& actions)
-        : actions(actions) {}
-
-        void operator()(iterator const& first, iterator const& last) const;
-
-        quickbook::actions& actions;
-    };
-
-    struct do_template_action
-    {
-        // Handles template substitutions
-        
-        do_template_action(quickbook::actions& actions)
-        : actions(actions) {}
-
-        void operator()(iterator const& first, iterator const& last) const;
-
-        quickbook::actions& actions;
-    };
-
     struct link_action
     {
         // Handles links (URL, XML refentry, function, class, member)
 
-        link_action(collector& phrase, char const* tag)
+        link_action(std::ostream& phrase, char const* tag)
         : phrase(phrase), tag(tag) {}
 
         void operator()(iterator first, iterator const& last) const;
 
-        collector& phrase;
+        std::ostream& phrase;
         char const* tag;
     };
 
@@ -576,13 +571,13 @@
     {
         // Handles table rows
 
-        start_row_action(collector& phrase, unsigned& span, std::string& header)
+        start_row_action(std::stringstream& phrase, unsigned& span, std::string& header)
             : phrase(phrase), span(span), header(header) {}
 
         void operator()(char) const;
         void operator()(iterator f, iterator) const;
 
-        collector& phrase;
+        std::stringstream& phrase;
         unsigned& span;
         std::string& header;
     };
@@ -591,12 +586,12 @@
     {
         // Handles table columns
 
-        start_col_action(collector& phrase, unsigned& span)
+        start_col_action(std::ostream& phrase, unsigned& span)
         : phrase(phrase), span(span) {}
 
         void operator()(char) const;
 
-        collector& phrase;
+        std::ostream& phrase;
         unsigned& span;
     };
 
@@ -605,55 +600,55 @@
         // Handles begin page
 
         begin_section_action(
-            collector& out
-          , collector& phrase
+            std::ostream& out
+          , std::stringstream& phrase
           , std::string& library_id
           , std::string& section_id
-          , int& section_level
+          , int& level
           , std::string& qualified_section_id)
         : out(out)
         , phrase(phrase)
         , library_id(library_id)
         , section_id(section_id)
-        , section_level(section_level)
+        , level(level)
         , qualified_section_id(qualified_section_id) {}
 
         void operator()(iterator first, iterator const& last) const;
 
-        collector& out;
-        collector& phrase;
+        std::ostream& out;
+        std::stringstream& phrase;
         std::string& library_id;
         std::string& section_id;
-        int& section_level;
+        int& level;
         std::string& qualified_section_id;
     };
 
     struct end_section_action
     {
         end_section_action(
-            collector& out
-          , int& section_level
+            std::ostream& out
+          , int& level
           , std::string& qualified_section_id)
         : out(out)
-        , section_level(section_level)
+        , level(level)
         , qualified_section_id(qualified_section_id) {}
 
         void operator()(iterator const& first, iterator const& last) const;
 
-        collector& out;
-        int& section_level;
+        std::ostream& out;
+        int& level;
         std::string& qualified_section_id;
    };
 
     struct xinclude_action
     {
         // Handles XML includes
-        xinclude_action(collector& out_, quickbook::actions& actions_)
+        xinclude_action(std::ostream& out_, quickbook::actions& actions_)
             : out(out_), actions(actions_) {}
 
         void operator()(iterator const& first, iterator const& last) const;
 
-        collector& out;
+        std::ostream& out;
         quickbook::actions& actions;
     };
 
@@ -673,40 +668,177 @@
     {
         // Handles xml author
 
-        xml_author(collector& out)
+        xml_author(std::ostream& out)
         : out(out) {}
 
         void operator()(std::pair<std::string, std::string> const& author) const;
 
-        collector& out;
+        std::ostream& out;
     };
 
     struct xml_year
     {
         // Handles xml year
 
-        xml_year(collector& out)
+        xml_year(std::ostream& out)
             : out(out) {}
 
         void operator()(std::string const &year) const;
 
-        collector& out;
+        std::ostream& out;
     };
 
-    void pre(collector& out, quickbook::actions& actions, bool ignore_docinfo = false);
-    void post(collector& out, quickbook::actions& actions, bool ignore_docinfo = false);
+    void pre(std::ostream& out, quickbook::actions& actions, bool ignore_docinfo = false);
+    void post(std::ostream& out, quickbook::actions& actions, bool ignore_docinfo = false);
 
     struct phrase_to_string_action
     {
-        phrase_to_string_action(std::string& out, collector& phrase)
+        phrase_to_string_action(std::string& out, std::stringstream& phrase)
             : out(out) , phrase(phrase) {}
 
         void operator()(iterator const& first, iterator const& last) const;
 
-        std::string& out;
-        collector& phrase;
+        std::string&        out;
+        std::stringstream&  phrase;
     };
+
+    ///////////////////////////////////////////////////////////////////////////
+    //
+    //  Our actions
+    //
+    ///////////////////////////////////////////////////////////////////////////
+    struct actions
+    {
+        actions(char const* filein_, fs::path const& outdir, std::ostream &out_);
+
+        fs::path                filename;
+        fs::path                outdir;
+        std::string             macro_id;
+        std::string             phrase_save;
+        std::string             table_title;
+        std::ostream&           out;
+        error_action            error;
+
+        typedef std::vector<std::string> copyright_list;
+        typedef std::vector<std::pair<std::string, std::string> > author_list;
+
+        std::string             doc_type;
+        std::string             doc_title;
+        std::string             doc_version;
+        std::string             doc_id;
+        std::string             doc_dirname;
+        copyright_list          doc_copyright_years;
+        std::string             doc_copyright_holder;
+        std::string             doc_purpose;
+        std::string             doc_category;
+        author_list             doc_authors;
+        std::string             doc_license;
+        std::string             doc_last_revision;
+        std::string             include_doc_id;
+        phrase_to_string_action extract_doc_license;
+        phrase_to_string_action extract_doc_purpose;
+        std::string             doc_license_1_1;
+        std::string             doc_purpose_1_1;
+
+        std::string             page_title;
+        std::string             section_id;
+        std::string             previous;
+        std::stringstream       phrase;
+        std::stringstream       temp;
+        unsigned                table_span;
+        std::string             table_header;
+
+        macros_type             macro;
+        std::string             source_mode;
+        code_action             code;
+        code_action             code_block;
+        inline_code_action      inline_code;
+        phrase_action           paragraph;
+        anchored_phrase_action  h1, h2, h3, h4, h5, h6;
+        markup_action           hr;
+        phrase_action           blurb, blockquote, preformatted;
+        phrase_action           warning, caution, important, note, tip;
+        plain_char_action       plain_char;
+        raw_char_action         raw_char;
+        image_action            image;
+
+        typedef std::pair<char, int> mark_type;
+        std::stringstream       list_buffer;
+        std::stack<mark_type>   list_marks;
+        int                     indent;
+        list_action             list;
+        list_format_action      list_format;
+        phrase_action           list_item;
+
+        link_action             funcref_pre;
+        markup_action           funcref_post;
+        link_action             classref_pre;
+        markup_action           classref_post;
+        link_action             memberref_pre;
+        markup_action           memberref_post;
+        link_action             enumref_pre;
+        markup_action           enumref_post;
+        link_action             headerref_pre;
+        markup_action           headerref_post;
+
+        markup_action           bold_pre;
+        markup_action           bold_post;
+        markup_action           italic_pre;
+        markup_action           italic_post;
+        markup_action           underline_pre;
+        markup_action           underline_post;
+        markup_action           teletype_pre;
+        markup_action           teletype_post;
+        markup_action           strikethrough_pre;
+        markup_action           strikethrough_post;
+        markup_action           quote_pre;
+        markup_action           quote_post;
+        markup_action           replaceable_pre;
+        markup_action           replaceable_post;
+        markup_action           footnote_pre;
+        markup_action           footnote_post;
+
+        simple_phrase_action    simple_bold;
+        simple_phrase_action    simple_italic;
+        simple_phrase_action    simple_underline;
+        simple_phrase_action    simple_teletype;
+        simple_phrase_action    simple_strikethrough;
+
+        variablelist_action     variablelist;
+        markup_action           start_varlistentry;
+        markup_action           end_varlistentry;
+        markup_action           start_varlistterm;
+        markup_action           end_varlistterm;
+        markup_action           start_varlistitem;
+        markup_action           end_varlistitem;
+
+        markup_action           break_;
+        indentifier_action      identifier;
+        macro_def_action        macro_def;
+        do_macro_action         do_macro;
+        link_action             url_pre;
+        markup_action           url_post;
+        link_action             link_pre;
+        markup_action           link_post;
+        table_action            table;
+        start_row_action        start_row;
+        markup_action           end_row;
+        start_col_action        start_cell;
+        markup_action           end_cell;
+        anchor_action           anchor;
+
+        begin_section_action    begin_section;
+        end_section_action      end_section;
+        xinclude_action         xinclude;
+        include_action          include;
+
+        markup_action           escape_pre;
+        markup_action           escape_post;
+
+        int                     level;
+        std::string             qualified_section_id;
+    };
 }
 
-#endif // BOOST_SPIRIT_QUICKBOOK_ACTIONS_HPP
+#endif // BOOST_SPIRIT_QUICKBOOK_UTILS_HPP
 

Deleted: boost/trunk/tools/quickbook/detail/actions_class.hpp
===================================================================
--- boost/trunk/tools/quickbook/detail/actions_class.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/detail/actions_class.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,191 +0,0 @@
-/*=============================================================================
-    Copyright (c) 2002 2004 Joel de Guzman
-    Copyright (c) 2004 Eric Niebler
-    http://spirit.sourceforge.net/
-
-    Use, modification and distribution is subject to the Boost Software
-    License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-    http://www.boost.org/LICENSE_1_0.txt)
-=============================================================================*/
-#if !defined(BOOST_SPIRIT_ACTIONS_CLASS_HPP)
-#define BOOST_SPIRIT_ACTIONS_CLASS_HPP
-
-#include "./actions.hpp"
-#include <boost/tuple/tuple.hpp>
-
-namespace quickbook 
-{
-    using namespace boost::spirit;
-    namespace fs = boost::filesystem;
-
-    struct actions
-    {
-        actions(char const* filein_, fs::path const& outdir, std::stringstream& out_);
-
-    ///////////////////////////////////////////////////////////////////////////
-    // State
-    ///////////////////////////////////////////////////////////////////////////
-
-        typedef std::vector<std::string> string_list;
-        typedef std::vector<std::pair<std::string, std::string> > author_list;
-        typedef std::pair<char, int> mark_type;
-        static int const max_template_depth = 100;
-
-    // header info
-        std::string             doc_type;
-        std::string             doc_title;
-        std::string             doc_version;
-        std::string             doc_id;
-        std::string             doc_dirname;
-        string_list             doc_copyright_years;
-        std::string             doc_copyright_holder;
-        std::string             doc_purpose;
-        std::string             doc_category;
-        author_list             doc_authors;
-        std::string             doc_license;
-        std::string             doc_last_revision;
-        std::string             include_doc_id;
-        std::string             doc_license_1_1;
-        std::string             doc_purpose_1_1;
-
-    // main output stream
-        collector               out;
-    
-    // auxilliary streams
-        collector               phrase;
-        collector               temp;
-        collector               list_buffer;
-
-    // state
-        fs::path                filename;
-        fs::path                outdir;
-        string_symbols          macro;
-        template_symbols        templates;
-        int                     section_level;
-        std::string             section_id;
-        std::string             qualified_section_id;
-        std::string             source_mode;                   
-        
-        typedef boost::tuple<
-            fs::path   
-          , fs::path   
-          , string_symbols
-          , template_symbols
-          , int        
-          , std::string
-          , std::string
-          , std::string>
-        state_tuple;
-        
-        std::stack<state_tuple> state_stack;
-       
-    // temporary or global state
-        std::string             table_title;
-        unsigned                table_span;
-        std::string             table_header;
-        std::string             macro_id;
-        std::string             macro_phrase_save;
-        std::stack<mark_type>   list_marks;
-        int                     list_indent;
-        string_list             template_info;
-        int                     template_depth;
-
-    // push/pop the states and the streams
-        void push();
-        void pop();
-
-    ///////////////////////////////////////////////////////////////////////////
-    // actions
-    ///////////////////////////////////////////////////////////////////////////
-        error_action            error;
-        phrase_to_string_action extract_doc_license;
-        phrase_to_string_action extract_doc_purpose;
-
-        code_action             code;
-        code_action             code_block;
-        inline_code_action      inline_code;
-        phrase_action           paragraph;
-        generic_header_action   h;
-        header_action           h1, h2, h3, h4, h5, h6;
-        markup_action           hr;
-        phrase_action           blurb, blockquote, preformatted;
-        phrase_action           warning, caution, important, note, tip;
-        plain_char_action       plain_char;
-        raw_char_action         raw_char;
-        image_action            image;
-
-        list_action             list;
-        list_format_action      list_format;
-        phrase_action           list_item;
-
-        link_action             funcref_pre;
-        markup_action           funcref_post;
-        link_action             classref_pre;
-        markup_action           classref_post;
-        link_action             memberref_pre;
-        markup_action           memberref_post;
-        link_action             enumref_pre;
-        markup_action           enumref_post;
-        link_action             headerref_pre;
-        markup_action           headerref_post;
-
-        markup_action           bold_pre;
-        markup_action           bold_post;
-        markup_action           italic_pre;
-        markup_action           italic_post;
-        markup_action           underline_pre;
-        markup_action           underline_post;
-        markup_action           teletype_pre;
-        markup_action           teletype_post;
-        markup_action           strikethrough_pre;
-        markup_action           strikethrough_post;
-        markup_action           quote_pre;
-        markup_action           quote_post;
-        markup_action           replaceable_pre;
-        markup_action           replaceable_post;
-        markup_action           footnote_pre;
-        markup_action           footnote_post;
-
-        simple_phrase_action    simple_bold;
-        simple_phrase_action    simple_italic;
-        simple_phrase_action    simple_underline;
-        simple_phrase_action    simple_teletype;
-        simple_phrase_action    simple_strikethrough;
-
-        variablelist_action     variablelist;
-        markup_action           start_varlistentry;
-        markup_action           end_varlistentry;
-        markup_action           start_varlistterm;
-        markup_action           end_varlistterm;
-        markup_action           start_varlistitem;
-        markup_action           end_varlistitem;
-
-        markup_action           break_;
-        macro_identifier_action macro_identifier;
-        macro_definition_action macro_definition;
-        do_macro_action         do_macro;
-        template_body_action    template_body;
-        do_template_action      do_template;
-        link_action             url_pre;
-        markup_action           url_post;
-        link_action             link_pre;
-        markup_action           link_post;
-        table_action            table;
-        start_row_action        start_row;
-        markup_action           end_row;
-        start_col_action        start_cell;
-        markup_action           end_cell;
-        anchor_action           anchor;
-
-        begin_section_action    begin_section;
-        end_section_action      end_section;
-        xinclude_action         xinclude;
-        include_action          include;
-
-        markup_action           escape_pre;
-        markup_action           escape_post;
-    };
-}
-
-#endif // BOOST_SPIRIT_ACTIONS_CLASS_HPP
-

Deleted: boost/trunk/tools/quickbook/detail/markups.hpp
===================================================================
--- boost/trunk/tools/quickbook/detail/markups.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/detail/markups.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,96 +0,0 @@
-/*=============================================================================
-    Copyright (c) 2002 2004 Joel de Guzman
-    Copyright (c) 2004 Eric Niebler
-    http://spirit.sourceforge.net/
-
-    Use, modification and distribution is subject to the Boost Software
-    License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-    http://www.boost.org/LICENSE_1_0.txt)
-=============================================================================*/
-#if !defined(BOOST_SPIRIT_MARKUPS_HPP)
-#define BOOST_SPIRIT_MARKUPS_HPP
-
-namespace quickbook { namespace /*unnamed*/
-{
-    const char* paragraph_pre       = "<para>\n";
-    const char* paragraph_post      = "</para>\n";
-    const char* h1_pre              = "<bridgehead renderas=\"sect1\">";
-    const char* h1_post             = "</bridgehead>";
-    const char* h2_pre              = "<bridgehead renderas=\"sect2\">";
-    const char* h2_post             = "</bridgehead>";
-    const char* h3_pre              = "<bridgehead renderas=\"sect3\">";
-    const char* h3_post             = "</bridgehead>";
-    const char* h4_pre              = "<bridgehead renderas=\"sect4\">";
-    const char* h4_post             = "</bridgehead>";
-    const char* h5_pre              = "<bridgehead renderas=\"sect5\">";
-    const char* h5_post             = "</bridgehead>";
-    const char* h6_pre              = "<bridgehead renderas=\"sect6\">";
-    const char* h6_post             = "</bridgehead>";
-    const char* hr_                 = "<para/>";
-    const char* blurb_pre           = "<para role=\"blurb\">\n";
-    const char* blurb_post          = "</para>\n";
-    const char* blockquote_pre      = "<blockquote><para>";
-    const char* blockquote_post     = "</para></blockquote>";
-    const char* preformatted_pre    = "<programlisting>";
-    const char* preformatted_post   = "</programlisting>";
-    const char* warning_pre         = "<warning><para>";
-    const char* warning_post        = "</para></warning>";
-    const char* caution_pre         = "<caution><para>";
-    const char* caution_post        = "</para></caution>";
-    const char* important_pre       = "<important><para>";
-    const char* important_post      = "</para></important>";
-    const char* note_pre            = "<note><para>";
-    const char* note_post           = "</para></note>";
-    const char* tip_pre             = "<tip><para>";
-    const char* tip_post            = "</para></tip>";
-    const char* list_item_pre       = "<listitem>\n";
-    const char* list_item_post      = "\n</listitem>";
-    const char* bold_pre_           = "<emphasis role=\"bold\">";
-    const char* bold_post_          = "</emphasis>";
-    const char* italic_pre_         = "<emphasis>";
-    const char* italic_post_        = "</emphasis>";
-    const char* underline_pre_      = "<emphasis role=\"underline\">";
-    const char* underline_post_     = "</emphasis>";
-    const char* teletype_pre_       = "<literal>";
-    const char* teletype_post_      = "</literal>";
-    const char* strikethrough_pre_  = "<emphasis role=\"strikethrough\">";
-    const char* strikethrough_post_ = "</emphasis>";
-    const char* quote_pre_          = "<quote>";
-    const char* quote_post_         = "</quote>";
-    const char* break_mark          = "<sbr/>\n";
-    const char* url_pre_            = "<ulink url=\"";
-    const char* url_post_           = "</ulink>";
-    const char* link_pre_           = "<link linkend=\"";
-    const char* link_post_          = "</link>";
-    const char* start_varlistentry_ = "<varlistentry>";
-    const char* end_varlistentry_   = "</varlistentry>\n";
-    const char* start_varlistterm_  = "<term>";
-    const char* end_varlistterm_    = "</term>";
-    const char* start_varlistitem_  = "<listitem>";
-    const char* end_varlistitem_    = "</listitem>";
-    const char* start_header_       = "<thead>";
-    const char* end_header_         = "</thead>\n";
-    const char* start_row_          = "<row>";
-    const char* end_row_            = "</row>\n";
-    const char* start_cell_         = "<entry>";
-    const char* end_cell_           = "</entry>";
-    const char* funcref_pre_        = "<functionname alt=\"";
-    const char* funcref_post_       = "</functionname>";
-    const char* classref_pre_       = "<classname alt=\"";
-    const char* classref_post_      = "</classname>";
-    const char* memberref_pre_      = "<methodname alt=\"";
-    const char* memberref_post_     = "</methodname>";
-    const char* enumref_pre_        = "<enumname alt=\"";
-    const char* enumref_post_       = "</enumname>";
-    const char* headerref_pre_      = "<headername alt=\"";
-    const char* headerref_post_     = "</headername>";
-    const char* footnote_pre_       = "<footnote><para>";
-    const char* footnote_post_      = "</para></footnote>";
-    const char* escape_pre_         = "<!--quickbook-escape-prefix-->";
-    const char* escape_post_        = "<!--quickbook-escape-postfix-->";
-    const char* replaceable_pre_    = "<replaceable>";
-    const char* replaceable_post_   = "</replaceable>";
-}}
-
-#endif // BOOST_SPIRIT_MARKUPS_HPP
-

Modified: boost/trunk/tools/quickbook/detail/quickbook.cpp
===================================================================
--- boost/trunk/tools/quickbook/detail/quickbook.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/detail/quickbook.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -7,11 +7,11 @@
     License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
     http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
-#include "./actions_class.hpp"
 #include "../block.hpp"
 #include "../doc_info.hpp"
 #include "./post_process.hpp"
-#include "./utils.hpp"
+#include "utils.hpp"
+#include "actions.hpp"
 #include <boost/spirit/iterator/position_iterator.hpp>
 #include <boost/program_options.hpp>
 #include <boost/filesystem/path.hpp>
@@ -127,11 +127,11 @@
     }
 
     static int
-    parse(char const* filein_, fs::path const& outdir, std::stringstream& out, bool ignore_docinfo = false)
+        parse(char const* filein_, fs::path const& outdir, std::ostream& out, bool ignore_docinfo = false)
     {
         actions actor(filein_, outdir, out);
         bool r = parse(filein_, actor);
-        if (actor.section_level != 0)
+        if (actor.level != 0)
             detail::outwarn(filein_,1)
                 << "Warning missing [endsect] detected at end of file."
                 << std::endl;
@@ -162,9 +162,7 @@
         }
         else
         {
-            std::stringstream buffer;
-            result = parse(filein_, outdir, buffer);
-            fileout << buffer.str();
+            result = parse(filein_, outdir, fileout);
         }
         return result;
     }

Modified: boost/trunk/tools/quickbook/doc/Jamfile.v2
===================================================================
--- boost/trunk/tools/quickbook/doc/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/doc/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,13 @@
+#==============================================================================
+#   Copyright (c) 2002 2004 Joel de Guzman
+#   Copyright (c) 2004 Eric Niebler
+#   http://spirit.sourceforge.net/
+#
+#   Use, modification and distribution is subject to the Boost Software
+#   License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+#   http://www.boost.org/LICENSE_1_0.txt)
+#==============================================================================
+
 project boost/quickbook/doc ;
 
 import boostbook : boostbook ;
@@ -14,4 +24,5 @@
         <xsl:param>generate.section.toc.level=3
         <xsl:param>chunk.section.depth=2
         <xsl:param>chunk.first.sections=1
+        <xsl:param>admon.graphics=1
     ;

Deleted: boost/trunk/tools/quickbook/doc/html/HTML.manifest
===================================================================
--- boost/trunk/tools/quickbook/doc/html/HTML.manifest	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/doc/html/HTML.manifest	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,8 +0,0 @@
-index.html
-quickbook/intro.html
-quickbook/change_log.html
-quickbook/syntax.html
-quickbook/syntax/comments.html
-quickbook/syntax/phrase.html
-quickbook/syntax/block.html
-quickbook/ref.html

Modified: boost/trunk/tools/quickbook/doc/html/boostbook.css
===================================================================
--- boost/trunk/tools/quickbook/doc/html/boostbook.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/doc/html/boostbook.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -23,24 +23,23 @@
 
     p 
     {
-        text-align: left;
-        font-size: 10pt; 
-        line-height: 1.15;
+        text-align: justify;
+        font-size: 11pt; 
+        line-height: 1.2;
     }
 
 /*=============================================================================
     Program listings
 =============================================================================*/
 
-    /* Code on paragraphs */
-    p tt.computeroutput
+    tt.computeroutput
     {
-        font-size: 9pt;
+        font-size: 10pt;
     }
 
     pre.synopsis
     {
-        font-size: 90%;
+        font-size: 10pt;
         margin: 1pc 4% 0pc 4%;
         padding: 0.5pc 0.5pc 0.5pc 0.5pc;
     }
@@ -48,36 +47,32 @@
     .programlisting, 
     .screen
     {
-        font-size: 9pt;
+        font-size: 10pt;
         display: block;
         margin: 1pc 4% 0pc 4%;
         padding: 0.5pc 0.5pc 0.5pc 0.5pc;
     }
 
-    /* Program listings in tables don't get borders */
-    td .programlisting, 
-    td .screen
-    {
-        margin: 0pc 0pc 0pc 0pc;
-        padding:  0pc 0pc 0pc 0pc;
-    }
-
 /*=============================================================================
     Headings
 =============================================================================*/
 
-    h1, h2, h3, h4, h5, h6 
+    h1, 
+    h2, 
+    h3, 
+    h4, 
+    h5, 
+    h6 
     { 
         text-align: left; 
-        margin: 1em 0em 0.5em 0em;
-        font-weight: bold;
+        margin-top: 2pc; 
     }
 
-    h1 { font: 140% }
+    h1 { font: 170% }
     h2 { font: bold 140% }
-    h3 { font: bold 130% }
-    h4 { font: bold 120% }
-    h5 { font: italic 110% }
+    h3 { font: bold 120% }
+    h4 { font: bold 100% }
+    h5 { font: italic 100% }
     h6 { font: italic 100% }
 
     /* Top page titles */
@@ -94,62 +89,33 @@
         margin-bottom: 1pc;
     }
 
-    h1.title { font-size: 140% }
-    h2.title { font-size: 140% }
-    h3.title { font-size: 130% }
-    h4.title { font-size: 120% }
-    h5.title { font-size: 110% }
-    h6.title { font-size: 100% }
+    h1.title { font-size: 220% }
+    h2.title { font-size: 220% }
+    h3.title { font-size: 170% }
+    h4.title { font-size: 140% }
+    h5.title { font-size: 120% }
+    h6.title { font-size: 120% }
 
-    .section h1 
-    {
-        margin: 0em 0em 0.5em 0em;
-        font-size: 140%;
-    }
-
-    .section h2 { font-size: 140% }
-    .section h3 { font-size: 130% }
-    .section h4 { font-size: 120% }
-    .section h5 { font-size: 110% }
-    .section h6 { font-size: 100% }
-
-    /* Code on titles */
-    h1 tt.computeroutput { font-size: 140% }
-    h2 tt.computeroutput { font-size: 140% }
-    h3 tt.computeroutput { font-size: 130% }
-    h4 tt.computeroutput { font-size: 120% }
-    h5 tt.computeroutput { font-size: 110% }
-    h6 tt.computeroutput { font-size: 100% }
-
 /*=============================================================================
-    Author
-=============================================================================*/
-
-    h3.author 
-    { 
-        font-size: 100% 
-    }
-
-/*=============================================================================
     Lists
 =============================================================================*/
 
     li
     {
-        font-size: 10pt;
+        font-size: 11pt;
         line-height: 1.3;
     }
     
     /* Unordered lists */
     ul 
     {
-        text-align: left;
+        text-align: justify;
     }
     
     /* Ordered lists */
     ol 
     {
-        text-align: left;
+        text-align: justify;
     }
 
 /*=============================================================================
@@ -193,9 +159,9 @@
     .toc
     {
        margin: 1pc 4% 0pc 4%;
-       padding: 0.1pc 1pc 0.1pc 1pc;
-       font-size: 80%; 
-       line-height: 1.15;
+       padding: 0.5pc;
+       font-size: 11pt; 
+       line-height: 1.3;
     }
     
     .boost-toc
@@ -214,20 +180,20 @@
         margin-left: 4%;
         padding-right: 0.5em; 
         padding-left: 0.5em;
+        font-size: 120%;
     }
     
     .informaltable table, 
     .table table
     {
         width: 92%;
-        margin-left: 4%;
-        margin-right: 4%;
+        margin: 0% 4% 0% 4%;
     }
     
     div.informaltable table, 
     div.table table
     {
-        padding: 4px;
+        padding: 4px 0px 4px 0px;
     }
     
     /* Table Cells */
@@ -236,7 +202,7 @@
     {
         padding: 0.5em;
         text-align: left;
-        font-size: 9pt;
+        font-size: 11pt;
     }
 
     div.informaltable table tr th, 
@@ -244,76 +210,51 @@
     {
         padding: 0.5em 0.5em 0.5em 0.5em;
         border: 1pt solid white;
-        font-size: 80%;
     }
 
 /*=============================================================================
     Blurbs
 =============================================================================*/
 
-    div.note,
-    div.tip,
-    div.important,
-    div.caution,
-    div.warning,
-    p.blurb
+    div.informaltable table tr td.blurb
     {
-        font-size: 9pt; /* A little bit smaller than the main text */
+        font-size: 10pt; /* A little bit smaller than the main text */
         line-height: 1.2;
-        display: block;
-        margin: 1pc 4% 0pc 4%;
-        padding: 0.5pc 0.5pc 0.5pc 0.5pc;
     }
-    
-    p.blurb img
+
+    td.blurb img
     {
         padding: 1pt;
     }
 
 /*=============================================================================
-    Variable Lists
+    Misc
 =============================================================================*/
 
-    /* Make the terms in definition lists bold */
-    div.variablelist dl dt,
-    span.term
+    /* Tone down the title of Parameter lists */
+    div.variablelist p.title
     {
         font-weight: bold;
-        font-size: 10pt;
-    }
-
-    div.variablelist table tbody tr td
-    {
+        font-size: 100%;
         text-align: left;
-        vertical-align: top;
-        padding: 0em 2em 0em 0em;
-        font-size: 10pt;
-        margin: 0em 0em 0.5em 0em;
-        line-height: 1;
     }
-
+    
+    /* Tabularize parameter lists */
     div.variablelist dl dt
     {
-        margin-bottom: 0.2em;
+        float: left;
+        clear: left;
+        display: block;
+        font-style: italic;
     }
-
+    
     div.variablelist dl dd
     {
-        margin: 0em 0em 0.5em 2em;
-        font-size: 10pt;
+        display: block;
+        clear:   right;
+        padding-left: 8pc;
     }
 
-    div.variablelist table tbody tr td p,
-    div.variablelist dl dd p
-    {
-        margin: 0em 0em 0.5em 0em;
-        line-height: 1;
-    }
-
-/*=============================================================================
-    Misc
-=============================================================================*/
-
     /* Title of books and articles in bibliographies */
     span.title
     {
@@ -352,14 +293,6 @@
         {
             color: #9c5a9c;
         }
-
-        h1 a, h2 a, h3 a, h4 a, h5 a, h6 a,
-        h1 a:hover, h2 a:hover, h3 a:hover, h4 a:hover, h5 a:hover, h6 a:hover,
-        h1 a:visited, h2 a:visited, h3 a:visited, h4 a:visited, h5 a:visited, h6 a:visited
-        {
-            text-decoration: none; /* no underline */
-            color: #000000;
-        }
     
     /* Syntax Highlighting */
         .keyword        { color: #0000AA; }
@@ -388,50 +321,49 @@
     /* Program listing */
         pre.synopsis
         {
-            border: 1px solid #DCDCDC;
+            background-color: #F3F3F3;
+            border: 1pt solid #C0C0C0;
         }
     
         .programlisting, 
         .screen
         {
-            border: 1px solid #DCDCDC;
+            background-color: #F3F3F3;
+            border: 1pt solid #C0C0C0;
         }
     
-        td .programlisting, 
-        td .screen
+    /* Blurbs */
+        div.informaltable table tr td.blurb
         {
-            border: 0px solid #DCDCDC;
+            background-color: #FFFFF0;
+            border: 1pt solid #707070;
         }
     
-    /* Blurbs */
-        div.note,
-        div.tip,
-        div.important,
-        div.caution,
-        div.warning,
-        p.blurb
+    /* Admonitions */
+        div.note, div.tip, div.important, div.warning, div.caution
         {
-            border: 1px solid #DCDCDC;
+            background-color: #FFFFF0;
+            border: 1pt solid #707070;
         }
     
+
     /* Table of contents */
         .toc
         {
-            border: 1px solid #DCDCDC;
+            background-color: #F3F3F3;
         }
     
     /* Tables */
         div.informaltable table tr td, 
         div.table table tr td
         {
-            border: 1px solid #DCDCDC;
+            background-color: #F0F0F0;
         }
-    
+
         div.informaltable table tr th, 
         div.table table tr th
         {
-            background-color: #F0F0F0;
-            border: 1px solid #DCDCDC;
+            background-color: #E4E4E4;
         }
     
     /* Misc */
@@ -471,12 +403,6 @@
             border: 1px solid gray;
         }
     
-        td .programlisting, 
-        td .screen
-        {
-            border: 0px solid #DCDCDC;
-        }
-    
     /* Table of contents */
         .toc
         {

Modified: boost/trunk/tools/quickbook/doc/html/index.html
===================================================================
--- boost/trunk/tools/quickbook/doc/html/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/doc/html/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
 <title>Quickbook 1.3</title>
 <link rel="stylesheet" href="boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.68.1">
 <link rel="start" href="index.html" title="Quickbook 1.3">
 <link rel="next" href="quickbook/intro.html" title=" Introduction">
 </head>
@@ -31,7 +31,7 @@
 </h3></div></div>
 <div><p class="copyright">Copyright © 2002, 2004 Joel de Guzman, Eric Niebler</p></div>
 <div><div class="legalnotice">
-<a name="id442832"></a><p>
+<a name="id2549106"></a><p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
@@ -54,8 +54,8 @@
 </dl>
 </div>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><small><p>Last revised: May 22, 2006 at 09:05:58 GMT</p></small></td>
+<table width="100%"><tr>
+<td align="left"><small><p>Last revised: August 27, 2006 at 05:24:19 GMT</p></small></td>
 <td align="right"><small></small></td>
 </tr></table>
 <hr>

Modified: boost/trunk/tools/quickbook/doc/html/quickbook/change_log.html
===================================================================
--- boost/trunk/tools/quickbook/doc/html/quickbook/change_log.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/doc/html/quickbook/change_log.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,20 @@
 <html>
 <head>
+
+    <--
+    Copyright (c) 2002 2004 Joel de Guzman
+    Copyright (c) 2004 Eric Niebler
+    http://spirit.sourceforge.net/
+
+    Use, modification and distribution is subject to the Boost Software
+    License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+    http://www.boost.org/LICENSE_1_0.txt)
+    -->
+
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
 <title> Change Log</title>
 <link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.68.1">
 <link rel="start" href="../index.html" title="Quickbook 1.3">
 <link rel="up" href="../index.html" title="Quickbook 1.3">
 <link rel="prev" href="intro.html" title=" Introduction">
@@ -24,10 +35,10 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="quickbook.change_log"></a><a href="change_log.html" title=" Change Log"> Change Log</a></h2></div></div></div>
+<a name="quickbook.change_log"></a> Change Log</h2></div></div></div>
 <a name="quickbook.change_log.version_1_3"></a><h3>
-<a name="id372687"></a>
-      <a href="change_log.html#quickbook.change_log.version_1_3">Version 1.3</a>
+<a name="id2512618"></a>
+      Version 1.3
     </h3>
 <div class="itemizedlist"><ul type="disc">
 <li>
@@ -65,7 +76,7 @@
 </li>
 <li>
         Fully qualified section and headers. Subsection names are concatenated to
-        the ID to avoid clashing. Example: <tt class="computeroutput"><span class="identifier">doc_name</span><span class="special">.</span><span class="identifier">sect_name</span><span class="special">.</span><span class="identifier">sub_sect_name</span><span class="special">.</span><span class="identifier">sub_sub_sect_name</span></tt>
+        the ID to avoid clashing. Example: <code class="computeroutput"><span class="identifier">doc_name</span><span class="special">.</span><span class="identifier">sect_name</span><span class="special">.</span><span class="identifier">sub_sect_name</span><span class="special">.</span><span class="identifier">sub_sub_sect_name</span></code>
 </li>
 <li>
         Better &amp;nbsp; and whitespace handling in code snippets.
@@ -92,21 +103,9 @@
 <li>
         Replaceable, with the [~replacement] syntax.
       </li>
-<li>
-        Generic Headers
-      </li>
-<li>
-        Code changes to allow full recursion (i.e. Collectors and push/pop functions)
-      </li>
-<li>
-        Various code cleanup/maintenance
-      </li>
-<li>
-        Templates!
-      </li>
 </ul></div>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<table width="100%"><tr>
 <td align="left"></td>
 <td align="right"><small>Copyright © 2002, 2004 Joel de Guzman, Eric Niebler</small></td>
 </tr></table>

Modified: boost/trunk/tools/quickbook/doc/html/quickbook/intro.html
===================================================================
--- boost/trunk/tools/quickbook/doc/html/quickbook/intro.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/doc/html/quickbook/intro.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,20 @@
 <html>
 <head>
+
+    <--
+    Copyright (c) 2002 2004 Joel de Guzman
+    Copyright (c) 2004 Eric Niebler
+    http://spirit.sourceforge.net/
+
+    Use, modification and distribution is subject to the Boost Software
+    License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+    http://www.boost.org/LICENSE_1_0.txt)
+    -->
+
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
 <title> Introduction</title>
 <link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.68.1">
 <link rel="start" href="../index.html" title="Quickbook 1.3">
 <link rel="up" href="../index.html" title="Quickbook 1.3">
 <link rel="prev" href="../index.html" title="Quickbook 1.3">
@@ -24,10 +35,10 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="quickbook.intro"></a><a href="intro.html" title=" Introduction"> Introduction</a></h2></div></div></div>
+<a name="quickbook.intro"></a> Introduction</h2></div></div></div>
 <div class="blockquote"><blockquote class="blockquote"><p>
-        <span class="bold"><b><span class="emphasis"><em>&#8220;<span class="quote">Why program by hand in five days what
-        you can spend five years of your life automating?</span>&#8221;</em></span></b></span><br>
+        <span class="bold"><strong><span class="emphasis"><em>&#8220;<span class="quote">Why program by hand in five days what
+        you can spend five years of your life automating?</span>&#8221;</em></span></strong></span><br>
         <br> -- Terrence Parr, author ANTLR/PCCTS
       </p></blockquote></div>
 <p>
@@ -81,7 +92,7 @@
       </li>
 </ul></div>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<table width="100%"><tr>
 <td align="left"></td>
 <td align="right"><small>Copyright © 2002, 2004 Joel de Guzman, Eric Niebler</small></td>
 </tr></table>

Modified: boost/trunk/tools/quickbook/doc/html/quickbook/ref.html
===================================================================
--- boost/trunk/tools/quickbook/doc/html/quickbook/ref.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/doc/html/quickbook/ref.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,20 @@
 <html>
 <head>
+
+    <--
+    Copyright (c) 2002 2004 Joel de Guzman
+    Copyright (c) 2004 Eric Niebler
+    http://spirit.sourceforge.net/
+
+    Use, modification and distribution is subject to the Boost Software
+    License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+    http://www.boost.org/LICENSE_1_0.txt)
+    -->
+
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
 <title> Quick Reference</title>
 <link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.68.1">
 <link rel="start" href="../index.html" title="Quickbook 1.3">
 <link rel="up" href="../index.html" title="Quickbook 1.3">
 <link rel="prev" href="syntax/block.html" title=" Block Level Elements">
@@ -23,10 +34,10 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="quickbook.ref"></a><a href="ref.html" title=" Quick Reference"> Quick Reference</a></h2></div></div></div>
+<a name="quickbook.ref"></a> Quick Reference</h2></div></div></div>
 <div class="informaltable">
 <h4>
-<a name="id447332"></a>
+<a name="id2562261"></a>
         <span class="table-title">Syntax Compendium</span>
       </h4>
 <table class="table">
@@ -43,16 +54,16 @@
 <tbody>
 <tr>
 <td>comment</td>
-<td><tt class="literal">
+<td><code class="literal">
 [/ some comment]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/comments.html" title="Comments">Comments</a></td>
 </tr>
 <tr>
 <td><span class="emphasis"><em>italics</em></span></td>
-<td><tt class="literal">
+<td><code class="literal">
 ['italics] or /italics/
-            </tt></td>
+            </code></td>
 <td>
 <a href="syntax/phrase.html#quickbook.syntax.phrase.font_styles" title="Font Styles">Font
             Styles</a> and <a href="syntax/phrase.html#quickbook.syntax.phrase.simple_formatting" title="Simple formatting">formatting
@@ -60,10 +71,10 @@
 </td>
 </tr>
 <tr>
-<td><span class="bold"><b>bold</b></span></td>
-<td><tt class="literal">
+<td><span class="bold"><strong>bold</strong></span></td>
+<td><code class="literal">
 [*bold] or *bold*
-            </tt></td>
+            </code></td>
 <td>
 <a href="syntax/phrase.html#quickbook.syntax.phrase.font_styles" title="Font Styles">Font
             Styles</a> and <a href="syntax/phrase.html#quickbook.syntax.phrase.simple_formatting" title="Simple formatting">formatting
@@ -72,9 +83,9 @@
 </tr>
 <tr>
 <td><span class="underline">underline</span></td>
-<td><tt class="literal">
+<td><code class="literal">
 [_underline] or _underline_
-            </tt></td>
+            </code></td>
 <td>
 <a href="syntax/phrase.html#quickbook.syntax.phrase.font_styles" title="Font Styles">Font
             Styles</a> and <a href="syntax/phrase.html#quickbook.syntax.phrase.simple_formatting" title="Simple formatting">formatting
@@ -82,10 +93,10 @@
 </td>
 </tr>
 <tr>
-<td><tt class="literal">teletype</tt></td>
-<td><tt class="literal">
+<td><code class="literal">teletype</code></td>
+<td><code class="literal">
 [^teletype] or =teletype=
-            </tt></td>
+            </code></td>
 <td>
 <a href="syntax/phrase.html#quickbook.syntax.phrase.font_styles" title="Font Styles">Font
             Styles</a> and <a href="syntax/phrase.html#quickbook.syntax.phrase.simple_formatting" title="Simple formatting">formatting
@@ -94,9 +105,9 @@
 </tr>
 <tr>
 <td><span class="strikethrough">strikethrough</span></td>
-<td><tt class="literal">
+<td><code class="literal">
 [-strikethrough]
-            </tt></td>
+            </code></td>
 <td>
 <a href="syntax/phrase.html#quickbook.syntax.phrase.font_styles" title="Font Styles">Font
             Styles</a> and <a href="syntax/phrase.html#quickbook.syntax.phrase.simple_formatting" title="Simple formatting">formatting
@@ -105,153 +116,151 @@
 </tr>
 <tr>
 <td>
-            <i class="replaceable"><tt>
+            <em class="replaceable"><code>
               replaceable
-            </tt></i>
+            </code></em>
             </td>
-<td><tt class="literal">
+<td><code class="literal">
 [~replaceable]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.replaceable" title="Replaceable">Replaceble</a></td>
 </tr>
 <tr>
 <td>source mode</td>
 <td>
-<tt class="literal">[c++]</tt> or <tt class="literal">[python]</tt>
+<code class="literal">[c++]</code> or <code class="literal">[python]</code>
 </td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.source_mode" title="Source Mode">Source Mode</a></td>
 </tr>
 <tr>
 <td>inline code</td>
-<td><tt class="literal">
+<td><code class="literal">
 `int main();`
-            </tt></td>
+            </code></td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.inline_code" title="Inline code">Inline
             code</a></td>
 </tr>
 <tr>
 <td>code block</td>
-<td><tt class="literal">
+<td><code class="literal">
 ``int main();``
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.code" title="Code">Code</a></td>
 </tr>
 <tr>
 <td>code escape</td>
-<td><tt class="literal">
+<td><code class="literal">
 ``from c++ to QuickBook``
-            </tt></td>
-<td><a href="syntax/block.html#quickbook.syntax.block.escape_back" title=" Escaping Back
-        To QuickBook">Escaping
+            </code></td>
+<td><a href="syntax/block.html#quickbook.syntax.block.escape_back" title=" Escaping Back To QuickBook">Escaping
             Back To QuickBook</a></td>
 </tr>
 <tr>
 <td>line break</td>
-<td><tt class="literal">
+<td><code class="literal">
 [br] or \n
-            </tt></td>
+            </code></td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.line_break" title="line-break">line-break</a></td>
 </tr>
 <tr>
 <td>anchor</td>
-<td><tt class="literal">
+<td><code class="literal">
 [#anchor]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.anchors" title="Anchors">Anchors</a></td>
 </tr>
 <tr>
 <td>link</td>
-<td><tt class="literal">
+<td><code class="literal">
 [@http://www.boost.org Boost]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.links" title="Links">Links</a></td>
 </tr>
 <tr>
 <td>anchor link</td>
-<td><tt class="literal">
+<td><code class="literal">
 [link section.anchor Link text]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.anchor_links" title="Anchor links">Anchor
             links</a></td>
 </tr>
 <tr>
 <td>refentry link</td>
-<td><tt class="literal">
+<td><code class="literal">
 [link xml.refentry Link text]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.refentry_links" title="refentry links">refentry
             links</a></td>
 </tr>
 <tr>
 <td>function link</td>
-<td><tt class="literal">
+<td><code class="literal">
 [funcref fully::qualified::function_name Link text]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.code_links" title=" Code Links">function,
             class, member, enum or header links</a></td>
 </tr>
 <tr>
 <td>class link</td>
-<td><tt class="literal">
+<td><code class="literal">
 [classref fully::qualified::class_name Link text]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.code_links" title=" Code Links">function,
             class, member, enum or header links</a></td>
 </tr>
 <tr>
 <td>member link</td>
-<td><tt class="literal">
+<td><code class="literal">
 [memberref fully::qualified::member_name Link text]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.code_links" title=" Code Links">function,
             class, member, enum or header links</a></td>
 </tr>
 <tr>
 <td>enum link</td>
-<td><tt class="literal">
+<td><code class="literal">
 [enumref fully::qualified::enum_name Link text]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.code_links" title=" Code Links">function,
             class, member, enum or header links</a></td>
 </tr>
 <tr>
 <td>header link</td>
-<td><tt class="literal">
+<td><code class="literal">
 [headerref path/to/header.hpp Link text]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.code_links" title=" Code Links">function,
             class, member, enum or header links</a></td>
 </tr>
 <tr>
 <td>escape</td>
-<td><tt class="literal">'''escaped text (no processing/formatting)'''</tt></td>
+<td><code class="literal">'''escaped text (no processing/formatting)'''</code></td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.escape" title="Escape">Escape</a></td>
 </tr>
 <tr>
 <td>single char escape</td>
-<td><tt class="literal">\c</tt></td>
-<td><a href="syntax/phrase.html#quickbook.syntax.phrase.single_char_escape" title="Single
-        char escape">Single char escape</a></td>
+<td><code class="literal">\c</code></td>
+<td><a href="syntax/phrase.html#quickbook.syntax.phrase.single_char_escape" title="Single char escape">Single char escape</a></td>
 </tr>
 <tr>
 <td>images</td>
-<td><tt class="literal">
+<td><code class="literal">
 [$image.jpg]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/phrase.html#quickbook.syntax.phrase.images" title="Images">Images</a></td>
 </tr>
 <tr>
 <td>begin section</td>
-<td><tt class="literal">
+<td><code class="literal">
 [section The Section Title]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.section" title="Section">Section</a></td>
 </tr>
 <tr>
 <td>end section</td>
-<td><tt class="literal">
+<td><code class="literal">
 [endsect]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.section" title="Section">Section</a></td>
 </tr>
 <tr>
@@ -262,18 +271,16 @@
 </tr>
 <tr>
 <td>ordered list</td>
-<td><tt class="literal"># one<br> # two<br> #
-            three<br> </tt></td>
-<td><a href="syntax/block.html#quickbook.syntax.block.lists.ordered_lists" title="Ordered
-          lists">Ordered
+<td><code class="literal"># one<br> # two<br> #
+            three<br> </code></td>
+<td><a href="syntax/block.html#quickbook.syntax.block.lists.ordered_lists" title="Ordered lists">Ordered
             lists</a></td>
 </tr>
 <tr>
 <td>unordered list</td>
-<td><tt class="literal">* one<br> * two<br>
-            * three<br> </tt></td>
-<td><a href="syntax/block.html#quickbook.syntax.block.lists.unordered_lists" title="Unordered
-          lists">Unordered
+<td><code class="literal">* one<br> * two<br>
+            * three<br> </code></td>
+<td><a href="syntax/block.html#quickbook.syntax.block.lists.unordered_lists" title="Unordered lists">Unordered
             lists</a></td>
 </tr>
 <tr>
@@ -284,106 +291,106 @@
 </tr>
 <tr>
 <td>preformatted</td>
-<td><tt class="literal">
+<td><code class="literal">
 [pre preformatted]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.preformatted" title="Preformatted">Preformatted</a></td>
 </tr>
 <tr>
 <td>block quote</td>
-<td><tt class="literal">
+<td><code class="literal">
 [:sometext...]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.blockquote" title="Blockquote">Blockquote</a></td>
 </tr>
 <tr>
 <td>heading 1</td>
-<td><tt class="literal">
+<td><code class="literal">
 [h1 Heading 1]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.headings" title="Headings">Heading</a></td>
 </tr>
 <tr>
 <td>heading 2</td>
-<td><tt class="literal">
+<td><code class="literal">
 [h2 Heading 2]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.headings" title="Headings">Heading</a></td>
 </tr>
 <tr>
 <td>heading 3</td>
-<td><tt class="literal">
+<td><code class="literal">
 [h3 Heading 3]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.headings" title="Headings">Heading</a></td>
 </tr>
 <tr>
 <td>heading 4</td>
-<td><tt class="literal">
+<td><code class="literal">
 [h4 Heading 4]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.headings" title="Headings">Heading</a></td>
 </tr>
 <tr>
 <td>heading 5</td>
-<td><tt class="literal">
+<td><code class="literal">
 [h5 Heading 5]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.headings" title="Headings">Heading</a></td>
 </tr>
 <tr>
 <td>heading 6</td>
-<td><tt class="literal">
+<td><code class="literal">
 [h6 Heading 6]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.headings" title="Headings">Heading</a></td>
 </tr>
 <tr>
 <td>macro</td>
-<td><tt class="literal">
+<td><code class="literal">
 [def macro_identifier some text]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.macros" title="Macros">Macros</a></td>
 </tr>
 <tr>
 <td>blurb</td>
-<td><tt class="literal">
+<td><code class="literal">
 [blurb advertisement or note...]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.blurbs" title="Blurbs">Blurbs</a></td>
 </tr>
 <tr>
 <td>admonition</td>
-<td><tt class="literal">
+<td><code class="literal">
 [warning Warning text...]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.admonitions" title="Admonitions">Admonitions</a></td>
 </tr>
 <tr>
 <td>table</td>
-<td><tt class="literal">[table Title<br> [[a][b][c]]<br>
-            [[a][b][c]]<br> ]</tt></td>
+<td><code class="literal">[table Title<br> [[a][b][c]]<br>
+            [[a][b][c]]<br> ]</code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.tables" title="Tables">Tables</a></td>
 </tr>
 <tr>
 <td>variablelist</td>
-<td><tt class="literal">[variablelist Title<br>
-            [[a][b]]<br> [[a][b]]<br> ]</tt></td>
+<td><code class="literal">[variablelist Title<br>
+            [[a][b]]<br> [[a][b]]<br> ]</code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.variable_lists" title="Variable Lists">Variable
             Lists</a></td>
 </tr>
 <tr>
 <td>include</td>
-<td><tt class="literal">
+<td><code class="literal">
 [include someother.qbk]
-            </tt></td>
+            </code></td>
 <td><a href="syntax/block.html#quickbook.syntax.block.include" title="Include">Include</a></td>
 </tr>
 </tbody>
 </table>
 </div>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<table width="100%"><tr>
 <td align="left"></td>
 <td align="right"><small>Copyright © 2002, 2004 Joel de Guzman, Eric Niebler</small></td>
 </tr></table>

Modified: boost/trunk/tools/quickbook/doc/html/quickbook/syntax/block.html
===================================================================
--- boost/trunk/tools/quickbook/doc/html/quickbook/syntax/block.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/doc/html/quickbook/syntax/block.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,20 @@
 <html>
 <head>
+
+    <--
+    Copyright (c) 2002 2004 Joel de Guzman
+    Copyright (c) 2004 Eric Niebler
+    http://spirit.sourceforge.net/
+
+    Use, modification and distribution is subject to the Boost Software
+    License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+    http://www.boost.org/LICENSE_1_0.txt)
+    -->
+
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
 <title> Block Level Elements</title>
 <link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.68.1">
 <link rel="start" href="../../index.html" title="Quickbook 1.3">
 <link rel="up" href="../syntax.html" title=" Syntax Summary">
 <link rel="prev" href="phrase.html" title=" Phrase Level Elements">
@@ -24,7 +35,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="quickbook.syntax.block"></a><a href="block.html" title=" Block Level Elements"> Block Level Elements</a></h3></div></div></div>
+<a name="quickbook.syntax.block"></a> Block Level Elements</h3></div></div></div>
 <div class="toc"><dl>
 <dt><span class="section"><a href="block.html#quickbook.syntax.block.document">Document</a></span></dt>
 <dt><span class="section"><a href="block.html#quickbook.syntax.block.section">Section</a></span></dt>
@@ -32,17 +43,13 @@
 <dt><span class="section"><a href="block.html#quickbook.syntax.block.paragraphs">Paragraphs</a></span></dt>
 <dt><span class="section"><a href="block.html#quickbook.syntax.block.lists">Lists</a></span></dt>
 <dt><span class="section"><a href="block.html#quickbook.syntax.block.code">Code</a></span></dt>
-<dt><span class="section"><a href="block.html#quickbook.syntax.block.escape_back"> Escaping Back
-        To QuickBook</a></span></dt>
+<dt><span class="section"><a href="block.html#quickbook.syntax.block.escape_back"> Escaping Back To QuickBook</a></span></dt>
 <dt><span class="section"><a href="block.html#quickbook.syntax.block.preformatted">Preformatted</a></span></dt>
 <dt><span class="section"><a href="block.html#quickbook.syntax.block.blockquote">Blockquote</a></span></dt>
 <dt><span class="section"><a href="block.html#quickbook.syntax.block.admonitions">Admonitions</a></span></dt>
 <dt><span class="section"><a href="block.html#quickbook.syntax.block.headings">Headings</a></span></dt>
-<dt><span class="section"><a href="block.html#quickbook.syntax.block.generic_heading">Generic Heading</a></span></dt>
 <dt><span class="section"><a href="block.html#quickbook.syntax.block.macros">Macros</a></span></dt>
-<dt><span class="section"><a href="block.html#quickbook.syntax.block.predefined_macros">Predefined
-        Macros</a></span></dt>
-<dt><span class="section"><a href="block.html#quickbook.syntax.block.templates">Templates</a></span></dt>
+<dt><span class="section"><a href="block.html#quickbook.syntax.block.predefined_macros">Predefined Macros</a></span></dt>
 <dt><span class="section"><a href="block.html#quickbook.syntax.block.blurbs">Blurbs</a></span></dt>
 <dt><span class="section"><a href="block.html#quickbook.syntax.block.tables">Tables</a></span></dt>
 <dt><span class="section"><a href="block.html#quickbook.syntax.block.variable_lists">Variable Lists</a></span></dt>
@@ -50,7 +57,7 @@
 </dl></div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.document"></a><a href="block.html#quickbook.syntax.block.document" title="Document">Document</a></h4></div></div></div>
+<a name="quickbook.syntax.block.document"></a>Document</h4></div></div></div>
 <p>
           Every document must begin with a Document Info section, which should look
           like this:
@@ -111,21 +118,21 @@
           for. In its absence, version 1.1 is assumed.
         </p>
 <p>
-          <tt class="literal">version</tt>, <tt class="literal">id</tt>, <tt class="literal">dirname</tt>,
-          <tt class="literal">copyright</tt>, <tt class="literal">purpose</tt>, <tt class="literal">category</tt>,
-          <tt class="literal">authors</tt>, <tt class="literal">license</tt>, <tt class="literal">last-revision</tt>
-          and <tt class="literal">source-mode</tt> are optional information.
+          <code class="literal">version</code>, <code class="literal">id</code>, <code class="literal">dirname</code>,
+          <code class="literal">copyright</code>, <code class="literal">purpose</code>, <code class="literal">category</code>,
+          <code class="literal">authors</code>, <code class="literal">license</code>, <code class="literal">last-revision</code>
+          and <code class="literal">source-mode</code> are optional information.
         </p>
 <p>
-          <tt class="literal">source-type</tt> is a lowercase string setting the initial
+          <code class="literal">source-type</code> is a lowercase string setting the initial
           <a href="phrase.html#quickbook.syntax.phrase.source_mode" title="Source Mode">Source Mode</a>.
-          If the <tt class="literal">source-mode</tt> field is omitted, a default value
-          of <tt class="literal">c++</tt> will be used.
+          If the <code class="literal">source-mode</code> field is omitted, a default value
+          of <code class="literal">c++</code> will be used.
         </p>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.section"></a><a href="block.html#quickbook.syntax.block.section" title="Section">Section</a></h4></div></div></div>
+<a name="quickbook.syntax.block.section"></a>Section</h4></div></div></div>
 <p>
           Starting a new section is accomplished with:
         </p>
@@ -134,8 +141,8 @@
 <p>
           where <span class="emphasis"><em>id</em></span> is optional. id will be the filename of the
           generated section. If it is not present, "The Section Title"
-          will be normalized and become the id. Valid characters are <tt class="literal">a-Z</tt>,
-          <tt class="literal">A-Z</tt>, <tt class="literal">0-9</tt> and <tt class="literal">_</tt>.
+          will be normalized and become the id. Valid characters are <code class="literal">a-Z</code>,
+          <code class="literal">A-Z</code>, <code class="literal">0-9</code> and <code class="literal">_</code>.
           All non-valid characters are converted to underscore and all upper-case
           are converted to lower case. Thus: "The Section Title" will be
           normalized to "the_section_title".
@@ -151,7 +158,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.xinclude"></a><a href="block.html#quickbook.syntax.block.xinclude" title="xinclude">xinclude</a></h4></div></div></div>
+<a name="quickbook.syntax.block.xinclude"></a>xinclude</h4></div></div></div>
 <p>
           You can include another XML file with:
         </p>
@@ -164,7 +171,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.paragraphs"></a><a href="block.html#quickbook.syntax.block.paragraphs" title="Paragraphs">Paragraphs</a></h4></div></div></div>
+<a name="quickbook.syntax.block.paragraphs"></a>Paragraphs</h4></div></div></div>
 <p>
           Paragraphs start left-flushed and are terminated by two or more newlines.
           No markup is needed for paragraphs. QuickBook automatically detects paragraphs
@@ -175,23 +182,17 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.lists"></a><a href="block.html#quickbook.syntax.block.lists" title="Lists">Lists</a></h4></div></div></div>
+<a name="quickbook.syntax.block.lists"></a>Lists</h4></div></div></div>
 <div class="toc"><dl>
-<dt><span class="section"><a href="block.html#quickbook.syntax.block.lists.ordered_lists">Ordered
-          lists</a></span></dt>
-<dt><span class="section"><a href="block.html#quickbook.syntax.block.lists.list_hierarchies">List
-          Hierarchies</a></span></dt>
-<dt><span class="section"><a href="block.html#quickbook.syntax.block.lists.long_list_lines">Long
-          List Lines</a></span></dt>
-<dt><span class="section"><a href="block.html#quickbook.syntax.block.lists.unordered_lists">Unordered
-          lists</a></span></dt>
+<dt><span class="section"><a href="block.html#quickbook.syntax.block.lists.ordered_lists">Ordered lists</a></span></dt>
+<dt><span class="section"><a href="block.html#quickbook.syntax.block.lists.list_hierarchies">List Hierarchies</a></span></dt>
+<dt><span class="section"><a href="block.html#quickbook.syntax.block.lists.long_list_lines">Long List Lines</a></span></dt>
+<dt><span class="section"><a href="block.html#quickbook.syntax.block.lists.unordered_lists">Unordered lists</a></span></dt>
 <dt><span class="section"><a href="block.html#quickbook.syntax.block.lists.mixed_lists">Mixed lists</a></span></dt>
 </dl></div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h5 class="title">
-<a name="quickbook.syntax.block.lists.ordered_lists"></a><a href="block.html#quickbook.syntax.block.lists.ordered_lists" title="Ordered
-          lists">Ordered
-          lists</a></h5></div></div></div>
+<a name="quickbook.syntax.block.lists.ordered_lists"></a>Ordered lists</h5></div></div></div>
 <pre class="programlisting"># One
 # Two
 # Three
@@ -213,9 +214,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h5 class="title">
-<a name="quickbook.syntax.block.lists.list_hierarchies"></a><a href="block.html#quickbook.syntax.block.lists.list_hierarchies" title="List
-          Hierarchies">List
-          Hierarchies</a></h5></div></div></div>
+<a name="quickbook.syntax.block.lists.list_hierarchies"></a>List Hierarchies</h5></div></div></div>
 <p>
             List hierarchies are supported. Example:
           </p>
@@ -276,9 +275,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h5 class="title">
-<a name="quickbook.syntax.block.lists.long_list_lines"></a><a href="block.html#quickbook.syntax.block.lists.long_list_lines" title="Long
-          List Lines">Long
-          List Lines</a></h5></div></div></div>
+<a name="quickbook.syntax.block.lists.long_list_lines"></a>Long List Lines</h5></div></div></div>
 <p>
             Long lines will be wrapped appropriately. Example:
           </p>
@@ -307,9 +304,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h5 class="title">
-<a name="quickbook.syntax.block.lists.unordered_lists"></a><a href="block.html#quickbook.syntax.block.lists.unordered_lists" title="Unordered
-          lists">Unordered
-          lists</a></h5></div></div></div>
+<a name="quickbook.syntax.block.lists.unordered_lists"></a>Unordered lists</h5></div></div></div>
 <pre class="programlisting">* First
 * Second
 * Third
@@ -331,7 +326,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h5 class="title">
-<a name="quickbook.syntax.block.lists.mixed_lists"></a><a href="block.html#quickbook.syntax.block.lists.mixed_lists" title="Mixed lists">Mixed lists</a></h5></div></div></div>
+<a name="quickbook.syntax.block.lists.mixed_lists"></a>Mixed lists</h5></div></div></div>
 <p>
             Mixed lists (ordered and unordered) are supported. Example:
           </p>
@@ -442,7 +437,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.code"></a><a href="block.html#quickbook.syntax.block.code" title="Code">Code</a></h4></div></div></div>
+<a name="quickbook.syntax.block.code"></a>Code</h4></div></div></div>
 <p>
           Preformatted code starts with a space or a tab. The code will be syntax
           highlighted according to the current <a href="phrase.html#quickbook.syntax.phrase.source_mode" title="Source Mode">Source
@@ -473,23 +468,21 @@
 <p>
           Macros that are already defined are expanded in source code. Example:
         </p>
-<pre class="programlisting">[def __syntax_highlight__ [@quickbook/highlight.html syntax_highlight]]
-[def __quickbook__ [@index.html quickbook]]
+<pre class="programlisting">[def __array__ [@http://www.boost.org/doc/html/array/reference.html array]]
+[def __boost__ [@http://www.boost.org/libs/libraries.htm boost]]
 
-    using __quickbook__::__syntax_highlight__;
+    using __boost__::__array__;
 </pre>
 <p>
           Generates:
         </p>
 <pre class="programlisting">
-<span class="identifier">using</span> <a href="../../index.html" target="_top">quickbook</a><span class="special">::</span><a href="../highlight.html" target="_top">syntax_highlight</a><span class="special">;</span>
+<span class="identifier">using</span> <a href="http://www.boost.org/libs/libraries.htm" target="_top">boost</a><span class="special">::</span><a href="http://www.boost.org/doc/html/array/reference.html" target="_top">array</a><span class="special">;</span>
 </pre>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.escape_back"></a><a href="block.html#quickbook.syntax.block.escape_back" title=" Escaping Back
-        To QuickBook"> Escaping Back
-        To QuickBook</a></h4></div></div></div>
+<a name="quickbook.syntax.block.escape_back"></a> Escaping Back To QuickBook</h4></div></div></div>
 <p>
           Inside code, code blocks and inline code, QuickBook does not allow any
           markup to avoid conflicts with the target syntax (e.g. c++). In case you
@@ -517,10 +510,10 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.preformatted"></a><a href="block.html#quickbook.syntax.block.preformatted" title="Preformatted">Preformatted</a></h4></div></div></div>
+<a name="quickbook.syntax.block.preformatted"></a>Preformatted</h4></div></div></div>
 <p>
           Sometimes, you don't want some preformatted text to be parsed as C++. In
-          such cases, use the <tt class="literal">[pre ... ]</tt> markup block.
+          such cases, use the <code class="literal">[pre ... ]</code> markup block.
         </p>
 <pre class="programlisting">[pre
 
@@ -537,21 +530,21 @@
           level markup, pre (and Code) are the only ones that allow multiple newlines.
           The markup above will generate:
         </p>
-<pre class="programlisting">Some <span class="bold"><b>preformatted</b></span> text                    Some <span class="bold"><b>preformatted</b></span> text
+<pre class="programlisting">Some <span class="bold"><strong>preformatted</strong></span> text                    Some <span class="bold"><strong>preformatted</strong></span> text
 
-    Some <span class="bold"><b>preformatted</b></span> text            Some <span class="bold"><b>preformatted</b></span> text
+    Some <span class="bold"><strong>preformatted</strong></span> text            Some <span class="bold"><strong>preformatted</strong></span> text
 
-        Some <span class="bold"><b>preformatted</b></span> text    Some <span class="bold"><b>preformatted</b></span> text
+        Some <span class="bold"><strong>preformatted</strong></span> text    Some <span class="bold"><strong>preformatted</strong></span> text
 
 </pre>
 <p>
           Notice that unlike Code, phrase markup such as font style is still permitted
-          inside <tt class="literal">pre</tt> blocks.
+          inside <code class="literal">pre</code> blocks.
         </p>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.blockquote"></a><a href="block.html#quickbook.syntax.block.blockquote" title="Blockquote">Blockquote</a></h4></div></div></div>
+<a name="quickbook.syntax.block.blockquote"></a>Blockquote</h4></div></div></div>
 <pre class="programlisting">[:sometext...]
 </pre>
 <div class="blockquote"><blockquote class="blockquote"><p>
@@ -560,7 +553,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.admonitions"></a><a href="block.html#quickbook.syntax.block.admonitions" title="Admonitions">Admonitions</a></h4></div></div></div>
+<a name="quickbook.syntax.block.admonitions"></a>Admonitions</h4></div></div></div>
 <pre class="programlisting">[note This is a note]
 [tip This is a tip]
 [important This is important]
@@ -575,7 +568,7 @@
 <td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../images/note.png"></td>
 <th align="left">Note</th>
 </tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
             This is a note
           </p></td></tr>
 </table></div>
@@ -584,7 +577,7 @@
 <td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../images/tip.png"></td>
 <th align="left">Tip</th>
 </tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
             This is a tip
           </p></td></tr>
 </table></div>
@@ -593,7 +586,7 @@
 <td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../images/important.png"></td>
 <th align="left">Important</th>
 </tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
             This is important
           </p></td></tr>
 </table></div>
@@ -602,7 +595,7 @@
 <td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../images/caution.png"></td>
 <th align="left">Caution</th>
 </tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
             This is a caution
           </p></td></tr>
 </table></div>
@@ -611,19 +604,19 @@
 <td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../images/warning.png"></td>
 <th align="left">Warning</th>
 </tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
             This is a warning
           </p></td></tr>
 </table></div>
 <p>
           These are the only admonitions supported by <a href="http://www.docbook.org/" target="_top">DocBook</a>.
-          So, for example <tt class="literal">[information This is some information]</tt>
+          So, for example <code class="literal">[information This is some information]</code>
           is unlikely to produce the desired effect.
         </p>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.headings"></a><a href="block.html#quickbook.syntax.block.headings" title="Headings">Headings</a></h4></div></div></div>
+<a name="quickbook.syntax.block.headings"></a>Headings</h4></div></div></div>
 <pre class="programlisting">[h1 Heading 1]
 [h2 Heading 2]
 [h3 Heading 3]
@@ -632,36 +625,36 @@
 [h6 Heading 6]
 </pre>
 <a name="quickbook.syntax.block.headings.heading_1"></a><h1>
-<a name="id445811"></a>
-          <a href="block.html#quickbook.syntax.block.headings.heading_1">Heading 1</a>
+<a name="id2561073"></a>
+          Heading 1
         </h1>
 <a name="quickbook.syntax.block.headings.heading_2"></a><h2>
-<a name="id445836"></a>
-          <a href="block.html#quickbook.syntax.block.headings.heading_2">Heading 2</a>
+<a name="id2561085"></a>
+          Heading 2
         </h2>
 <a name="quickbook.syntax.block.headings.heading_3"></a><h3>
-<a name="id445860"></a>
-          <a href="block.html#quickbook.syntax.block.headings.heading_3">Heading 3</a>
+<a name="id2561098"></a>
+          Heading 3
         </h3>
 <a name="quickbook.syntax.block.headings.heading_4"></a><h4>
-<a name="id445885"></a>
-          <a href="block.html#quickbook.syntax.block.headings.heading_4">Heading 4</a>
+<a name="id2561110"></a>
+          Heading 4
         </h4>
 <a name="quickbook.syntax.block.headings.heading_5"></a><h5>
-<a name="id445910"></a>
-          <a href="block.html#quickbook.syntax.block.headings.heading_5">Heading 5</a>
+<a name="id2561124"></a>
+          Heading 5
         </h5>
 <a name="quickbook.syntax.block.headings.heading_6"></a><h5>
-<a name="id445935"></a>
-          <a href="block.html#quickbook.syntax.block.headings.heading_6">Heading 6</a>
+<a name="id2561136"></a>
+          Heading 6
         </h5>
 <p>
           Headings 1-3 [h1 h2 and h3] will automatically have anchors with normalized
-          names with <tt class="literal">name="section_id.normalized_header_text"</tt>
-          (i.e. valid characters are <tt class="literal">a-z</tt>, <tt class="literal">A-Z</tt>,
-          <tt class="literal">0-9</tt> and <tt class="literal">_</tt>. All non-valid characters
+          names with <code class="literal">name="section_id.normalized_header_text"</code>
+          (i.e. valid characters are <code class="literal">a-z</code>, <code class="literal">A-Z</code>,
+          <code class="literal">0-9</code> and <code class="literal">_</code>. All non-valid characters
           are converted to underscore and all upper-case are converted to lower-case.
-          For example: Heading 1 in section Section 2 will be normalized to <tt class="literal">section_2.heading_1</tt>).
+          For example: Heading 1 in section Section 2 will be normalized to <code class="literal">section_2.heading_1</code>).
           You can use:
         </p>
 <pre class="programlisting">[link section_id.normalized_header_text The link text]
@@ -674,62 +667,14 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.generic_heading"></a><a href="block.html#quickbook.syntax.block.generic_heading" title="Generic Heading">Generic Heading</a></h4></div></div></div>
-<p>
-          In cases when you don't want to care about the heading level (1 to 6),
-          you can use the <span class="emphasis"><em>Generic Heading</em></span>:
-        </p>
-<pre class="programlisting">[heading Heading]
-</pre>
-<p>
-          The <span class="emphasis"><em>Generic Heading</em></span> assumes the level, plus one, of
-          the innermost section where it is placed. For example, if it is placed
-          in the outermost section, then, it assumes <span class="emphasis"><em>h2</em></span>.
-        </p>
-<p>
-          Headings are often used as an alternative to sections. It is used particularly
-          if you do not want to start a new section. In many cases, however, headings
-          in a particular section is just flat. Example:
-        </p>
-<pre class="programlisting">[section A]
-[h2 X]
-[h2 Y]
-[h2 Z]
-[endsect] 
-</pre>
-<p>
-          Here we use h2 assuming that section A is the outermost level. If it is
-          placed in an inner level, you'll have to use h3, h4, etc. depending on
-          where the section is. In general, it is the section level plus one. It
-          is rather tedious, however, to scan the section level everytime. If you
-          rewrite the example above as shown below, this will be automatic:
-        </p>
-<pre class="programlisting">[section A]
-[heading X]
-[heading Y]
-[heading Z]
-[endsect] 
-</pre>
-<p>
-          They work well regardless where you place them. You can rearrange sections
-          at will without any extra work to ensure correct heading levels. In fact,
-          with <span class="emphasis"><em>section</em></span> and <span class="emphasis"><em>heading</em></span>, you
-          have all you need. <span class="emphasis"><em>h1</em></span>..<span class="emphasis"><em>h6</em></span> becomes
-          redundant. <span class="emphasis"><em>h1</em></span>..<span class="emphasis"><em>h6</em></span> might be deprecated
-          in the future.
-        </p>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.macros"></a><a href="block.html#quickbook.syntax.block.macros" title="Macros">Macros</a></h4></div></div></div>
+<a name="quickbook.syntax.block.macros"></a>Macros</h4></div></div></div>
 <pre class="programlisting">[def macro_identifier some text]
 </pre>
 <p>
           When a macro is defined, the identifier replaces the text anywhere in the
-          file, in paragraphs, in markups, etc. macro_identifier is a string of non-
-          white space characters except ']'. A macro may not follow an alphabetic
-          character or the underscore. The replacement text can be any phrase (even
-          marked up). Example:
+          file, in paragraphs, in markups, etc. macro_identifier is a string of non-white
+          space characters except ']' while the replacement text can be any phrase
+          (even marked up). Example:
         </p>
 <pre class="programlisting">[def sf_logo [$http://sourceforge.net/sflogo.php?group_id=28447&amp;type=1]]
 sf_logo
@@ -740,28 +685,23 @@
 <p>
           <span class="inlinemediaobject"></span>
         </p>
-<div class="tip"><table border="0" summary="Tip">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../images/tip.png"></td>
-<th align="left">Tip</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
-            It's a good idea to use macro identifiers that are distinguishable. For
-            instance, in this document, macro identifiers have two leading and trailing
-            underscores (e.g. <tt class="literal">
+<div class="informaltable"><table class="table">
+<colgroup><col></colgroup>
+<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> It's a good idea to use macro identifiers that
+                are distinguishable. For instance, in this document, macro identifiers
+                have two leading and trailing underscores (e.g. <code class="literal">
 __spirit__
-            </tt>). The reason is to avoid unwanted macro replacement.
-          </p></td></tr>
+                </code>). The reason is to avoid unwanted macro replacement.</td></tr></tbody>
 </table></div>
 <p>
-          Links (URLS) and images are good candidates for macros. <span class="bold"><b>1</b></span>)
+          Links (URLS) and images are good candidates for macros. <span class="bold"><strong>1</strong></span>)
           They tend to change a lot. It is a good idea to place all links and images
-          in one place near the top to make it easy to make changes. <span class="bold"><b>2</b></span>)
-          The syntax is not pretty. It's easier to read and write, e.g. <tt class="literal">
+          in one place near the top to make it easy to make changes. <span class="bold"><strong>2</strong></span>)
+          The syntax is not pretty. It's easier to read and write, e.g. <code class="literal">
 __spirit__
-          </tt> than <tt class="literal">
+          </code> than <code class="literal">
 [@http://spirit.sourceforge.net Spirit]
-          </tt>.
+          </code>.
         </p>
 <p>
           Some more examples:
@@ -787,15 +727,13 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.predefined_macros"></a><a href="block.html#quickbook.syntax.block.predefined_macros" title="Predefined
-        Macros">Predefined
-        Macros</a></h4></div></div></div>
+<a name="quickbook.syntax.block.predefined_macros"></a>Predefined Macros</h4></div></div></div>
 <p>
           Quickbook has some predefined macros that you can already use.
         </p>
 <div class="informaltable">
 <h4>
-<a name="id446370"></a>
+<a name="id2561441"></a>
             <span class="table-title">Predefined Macros</span>
           </h4>
 <table class="table">
@@ -815,21 +753,21 @@
 __DATE__
                 </td>
 <td>Today's date</td>
-<td>2006-May-22</td>
+<td>2006-Aug-27</td>
 </tr>
 <tr>
 <td>
 __TIME__
                 </td>
 <td>The current time</td>
-<td>05:05:58 PM</td>
+<td>06:24:19 AM</td>
 </tr>
 <tr>
 <td>
 __FILENAME__
                 </td>
 <td>Quickbook source filename</td>
-<td>C:\dev\boost\tools\quickbook\doc\quickbook.qbk</td>
+<td>/home/daniel/src/boost-1.34/tools/quickbook/doc/quickbook.qbk</td>
 </tr>
 </tbody>
 </table>
@@ -837,95 +775,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.templates"></a><a href="block.html#quickbook.syntax.block.templates" title="Templates">Templates</a></h4></div></div></div>
-<p>
-          Templates provide a more versatile text substitution mechanism. Templates
-          come in handy when you need to create parameterizable, multi-line, boilerplate
-          text that you specify once and expand many times. Templates accept one
-          or more arguments. These arguments act like place-holders for text replacement.
-          Unlike simple macros, which are limited to phrase level markup, templates
-          can contain block level markup (e.g. paragraphs, code blocks and tables).
-        </p>
-<p>
-          Example template:
-        </p>
-<pre class="programlisting">[template person(name_, age_, id_)
-
-Hi, my name is name_. I am age_ years old. My id is id_.
-
-]
-</pre>
-<p>
-          Template formal arguments are identifiers consisting of an initial alphabetic
-          character or the underscore, followed by zero or more alphanumeric characters
-          or the underscore. This is similar to your typical C/C++ identifier. A
-          template formal argument temporarily hides a macro of the same name at
-          the point where the template is invoked. At template invocation, you supply
-          the actual arguments. At that point, the template will be expanded with
-          your supplied arguments. Example:
-        </p>
-<pre class="programlisting">person(James Bond, 39, 007)
-person(Santa Clause, 87, 12-25)
-</pre>
-<p>
-          Which will expand to:
-        </p>
-<p>
-          </p>
-<p>
-            Hi, my name is <span class="bold"><b>James Bond</b></span>. I am <span class="bold"><b> 39</b></span> years old. My id is <span class="bold"><b>
-            007</b></span>.
-          </p>
-<p>
-          </p>
-<p>
-            Hi, my name is <span class="bold"><b>Santa Clause</b></span>. I am <span class="bold"><b> 87</b></span> years old. My id is <span class="bold"><b>
-            12-25</b></span>.
-          </p>
-<p>
-        </p>
-<p>
-          Each actual argument can be a word, a text fragment or just about any
-          <a href="phrase.html" title=" Phrase Level Elements">QuickBook phrase</a>. Arguments
-          are comma separated and terminated by the close parenthesis. If your arguments
-          have embedded commas or close parentheses, you'll have to <a href="phrase.html#quickbook.syntax.phrase.single_char_escape" title="Single
-        char escape">escape
-          them</a>.
-        </p>
-<div class="caution"><table border="0" summary="Caution">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../images/caution.png"></td>
-<th align="left">Caution</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
-            Templates are recursive. A template can call another template or even
-            itself, directly or indirectly. There are no control structures in QuickBook
-            (yet) so this will always mean infinite recursion. QuickBook can detect
-            this situation and report an error if recursion exceeds a certain limit.
-          </p></td></tr>
-</table></div>
-<p>
-          Templates may be phrase or block level. Phrase templates are of the form:
-        </p>
-<pre class="programlisting">[template sample(arg1, arg2,...argN) replacement text... ]
-</pre>
-<p>
-          Block templates are of the form:
-        </p>
-<pre class="programlisting">[template sample(arg1, arg2,...argN) 
-replacement text... 
-]
-</pre>
-<p>
-          The basic rule is as follows: if a newline immediately follows the argument
-          list, then it is a block template, otherwise, it is a phrase template.
-          Phrase templates are typically expanded as part of phrases. Like macros,
-          block level elements are not allowed in phrase templates.
-        </p>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.blurbs"></a><a href="block.html#quickbook.syntax.block.blurbs" title="Blurbs">Blurbs</a></h4></div></div></div>
+<a name="quickbook.syntax.block.blurbs"></a>Blurbs</h4></div></div></div>
 <pre class="programlisting">[blurb :-) [*An eye catching advertisement or note...]\n\n
     __spirit__ is an object-oriented recursive-descent parser generator framework
     implemented using template meta-programming techniques. Expression templates
@@ -936,28 +786,19 @@
 <p>
           will generate this:
         </p>
-<p class="blurb">
-          <span class="inlinemediaobject"><img src="../../images/smiley.png" alt="smiley"></span> <span class="bold"><b>An eye catching advertisement
-          or note...</b></span><br> <br> <a href="http://spirit.sourceforge.net" target="_top">Spirit</a>
-          is an object-oriented recursive-descent parser generator framework implemented
-          using template meta-programming techniques. Expression templates allow
-          us to approximate the syntax of Extended Backus-Normal Form (EBNF) completely
-          in C++.
-        </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
-            Prefer <a href="block.html#quickbook.syntax.block.admonitions" title="Admonitions">admonitions</a>
-            wherever appropriate.
-          </p></td></tr>
+<div class="informaltable"><table class="table">
+<colgroup><col></colgroup>
+<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../../images/smiley.png" alt="smiley"></span> <span class="bold"><strong>An eye catching advertisement
+                or note...</strong></span><br> <br> <a href="http://spirit.sourceforge.net" target="_top">Spirit</a>
+                is an object-oriented recursive-descent parser generator framework
+                implemented using template meta-programming techniques. Expression
+                templates allow us to approximate the syntax of Extended Backus-Normal
+                Form (EBNF) completely in C++. </td></tr></tbody>
 </table></div>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.tables"></a><a href="block.html#quickbook.syntax.block.tables" title="Tables">Tables</a></h4></div></div></div>
+<a name="quickbook.syntax.block.tables"></a>Tables</h4></div></div></div>
 <pre class="programlisting">[table A Simple Table
     [[Heading 1] [Heading 2] [Heading 3]]
     [[R0-C0]     [R0-C1]     [R0-C2]]
@@ -970,7 +811,7 @@
         </p>
 <div class="informaltable">
 <h4>
-<a name="id446766"></a>
+<a name="id2561624"></a>
             <span class="table-title">A Simple Table</span>
           </h4>
 <table class="table">
@@ -1005,7 +846,7 @@
 </div>
 <p>
           The table title is optional. The first row of the table is automatically
-          treated as the table header; that is, it is wrapped in <tt class="literal">&lt;thead&gt;...&lt;/thead&gt;</tt>
+          treated as the table header; that is, it is wrapped in <code class="literal">&lt;thead&gt;...&lt;/thead&gt;</code>
           XML tags. Note that unlike the original QuickDoc, the columns are nested
           in [ cells... ]. The syntax is free-format and allows big cells to be formatted
           nicely. Example:
@@ -1032,7 +873,7 @@
         </p>
 <div class="informaltable">
 <h4>
-<a name="id446883"></a>
+<a name="id2508134"></a>
             <span class="table-title">Table with fat cells</span>
           </h4>
 <table class="table">
@@ -1081,7 +922,7 @@
 </pre>
 <div class="informaltable">
 <h4>
-<a name="id446972"></a>
+<a name="id2508215"></a>
             <span class="table-title">Table with code</span>
           </h4>
 <table class="table">
@@ -1112,7 +953,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.variable_lists"></a><a href="block.html#quickbook.syntax.block.variable_lists" title="Variable Lists">Variable Lists</a></h4></div></div></div>
+<a name="quickbook.syntax.block.variable_lists"></a>Variable Lists</h4></div></div></div>
 <pre class="programlisting">[variablelist A Variable List
     [[term 1] [The definition of term 1]]
     [[term 2] [The definition of term 2]]
@@ -1148,7 +989,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.block.include"></a><a href="block.html#quickbook.syntax.block.include" title="Include">Include</a></h4></div></div></div>
+<a name="quickbook.syntax.block.include"></a>Include</h4></div></div></div>
 <p>
           You can include one QuickBook file from another. The syntax is simply:
         </p>
@@ -1173,7 +1014,7 @@
           of two sections having the same name. Since QuickBook generates an anchor
           for each section based on the section name, it is possible to end up with
           two identically named anchors, leading to link ambiguities. To resolve
-          these ambiguities, the <tt class="literal">[include]</tt> directive lets you
+          these ambiguities, the <code class="literal">[include]</code> directive lets you
           specify a document id to use for the included file. You can use it like
           this:
         </p>
@@ -1183,11 +1024,11 @@
           When using this form, all auto-generated anchors will use "someid"
           as a unique prefix. So for instance, if there is a section in someother.qbk
           named "Intro", the named anchor for that section will be "someid.intro",
-          and you can link to it with <tt class="literal">[link someid.intro The Intro]</tt>.
+          and you can link to it with <code class="literal">[link someid.intro The Intro]</code>.
         </p>
 </div>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<table width="100%"><tr>
 <td align="left"></td>
 <td align="right"><small>Copyright © 2002, 2004 Joel de Guzman, Eric Niebler</small></td>
 </tr></table>

Modified: boost/trunk/tools/quickbook/doc/html/quickbook/syntax/comments.html
===================================================================
--- boost/trunk/tools/quickbook/doc/html/quickbook/syntax/comments.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/doc/html/quickbook/syntax/comments.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,20 @@
 <html>
 <head>
+
+    <--
+    Copyright (c) 2002 2004 Joel de Guzman
+    Copyright (c) 2004 Eric Niebler
+    http://spirit.sourceforge.net/
+
+    Use, modification and distribution is subject to the Boost Software
+    License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+    http://www.boost.org/LICENSE_1_0.txt)
+    -->
+
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
 <title>Comments</title>
 <link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.68.1">
 <link rel="start" href="../../index.html" title="Quickbook 1.3">
 <link rel="up" href="../syntax.html" title=" Syntax Summary">
 <link rel="prev" href="../syntax.html" title=" Syntax Summary">
@@ -24,14 +35,14 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="quickbook.syntax.comments"></a><a href="comments.html" title="Comments">Comments</a></h3></div></div></div>
+<a name="quickbook.syntax.comments"></a>Comments</h3></div></div></div>
 <p>
         Can be placed anywhere.
       </p>
 <pre class="programlisting">[/ comment (no output generated) ]
 </pre>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<table width="100%"><tr>
 <td align="left"></td>
 <td align="right"><small>Copyright © 2002, 2004 Joel de Guzman, Eric Niebler</small></td>
 </tr></table>

Modified: boost/trunk/tools/quickbook/doc/html/quickbook/syntax/phrase.html
===================================================================
--- boost/trunk/tools/quickbook/doc/html/quickbook/syntax/phrase.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/doc/html/quickbook/syntax/phrase.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,20 @@
 <html>
 <head>
+
+    <--
+    Copyright (c) 2002 2004 Joel de Guzman
+    Copyright (c) 2004 Eric Niebler
+    http://spirit.sourceforge.net/
+
+    Use, modification and distribution is subject to the Boost Software
+    License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+    http://www.boost.org/LICENSE_1_0.txt)
+    -->
+
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
 <title> Phrase Level Elements</title>
 <link rel="stylesheet" href="../../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.68.1">
 <link rel="start" href="../../index.html" title="Quickbook 1.3">
 <link rel="up" href="../syntax.html" title=" Syntax Summary">
 <link rel="prev" href="comments.html" title="Comments">
@@ -24,7 +35,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="quickbook.syntax.phrase"></a><a href="phrase.html" title=" Phrase Level Elements"> Phrase Level Elements</a></h3></div></div></div>
+<a name="quickbook.syntax.phrase"></a> Phrase Level Elements</h3></div></div></div>
 <div class="toc"><dl>
 <dt><span class="section"><a href="phrase.html#quickbook.syntax.phrase.font_styles">Font Styles</a></span></dt>
 <dt><span class="section"><a href="phrase.html#quickbook.syntax.phrase.replaceable">Replaceable</a></span></dt>
@@ -40,21 +51,20 @@
 <dt><span class="section"><a href="phrase.html#quickbook.syntax.phrase.refentry_links">refentry links</a></span></dt>
 <dt><span class="section"><a href="phrase.html#quickbook.syntax.phrase.code_links"> Code Links</a></span></dt>
 <dt><span class="section"><a href="phrase.html#quickbook.syntax.phrase.escape">Escape</a></span></dt>
-<dt><span class="section"><a href="phrase.html#quickbook.syntax.phrase.single_char_escape">Single
-        char escape</a></span></dt>
+<dt><span class="section"><a href="phrase.html#quickbook.syntax.phrase.single_char_escape">Single char escape</a></span></dt>
 <dt><span class="section"><a href="phrase.html#quickbook.syntax.phrase.images">Images</a></span></dt>
 <dt><span class="section"><a href="phrase.html#quickbook.syntax.phrase.footnotes">Footnotes</a></span></dt>
 </dl></div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.font_styles"></a><a href="phrase.html#quickbook.syntax.phrase.font_styles" title="Font Styles">Font Styles</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.font_styles"></a>Font Styles</h4></div></div></div>
 <pre class="programlisting">['italic], [*bold], [_underline], [^teletype], [-strikethrough]
 </pre>
 <p>
           will generate:
         </p>
 <p>
-          <span class="emphasis"><em>italic</em></span>, <span class="bold"><b>bold</b></span>, <span class="underline">underline</span>, <tt class="literal">teletype</tt>, <span class="strikethrough">strikethrough</span>
+          <span class="emphasis"><em>italic</em></span>, <span class="bold"><strong>bold</strong></span>, <span class="underline">underline</span>, <code class="literal">teletype</code>, <span class="strikethrough">strikethrough</span>
         </p>
 <p>
           Like all non-terminal phrase level elements, this can of course be nested:
@@ -65,12 +75,12 @@
           will generate:
         </p>
 <p>
-          <span class="bold"><b><span class="emphasis"><em>bold-italic</em></span></b></span>
+          <span class="bold"><strong><span class="emphasis"><em>bold-italic</em></span></strong></span>
         </p>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.replaceable"></a><a href="phrase.html#quickbook.syntax.phrase.replaceable" title="Replaceable">Replaceable</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.replaceable"></a>Replaceable</h4></div></div></div>
 <p>
           When you want content that may or must be replaced by the user, use the
           syntax:
@@ -81,14 +91,14 @@
           This will generate:
         </p>
 <p>
-          <i class="replaceable"><tt>
+          <em class="replaceable"><code>
             replacement
-          </tt></i>
+          </code></em>
         </p>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.quotations"></a><a href="phrase.html#quickbook.syntax.phrase.quotations" title="Quotations">Quotations</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.quotations"></a>Quotations</h4></div></div></div>
 <pre class="programlisting">["A question that sometimes drives me hazy: am I or are the others crazy?]--Einstein
 </pre>
 <p>
@@ -119,7 +129,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.simple_formatting"></a><a href="phrase.html#quickbook.syntax.phrase.simple_formatting" title="Simple formatting">Simple formatting</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.simple_formatting"></a>Simple formatting</h4></div></div></div>
 <p>
           Simple markup for formatting text, common in many applications, is now
           supported:
@@ -130,13 +140,11 @@
           will generate:
         </p>
 <p>
-          <span class="emphasis"><em>italic</em></span>, <span class="bold"><b>bold</b></span>, <span class="underline">underline</span>, <tt class="literal">teletype</tt>
+          <span class="emphasis"><em>italic</em></span>, <span class="bold"><strong>bold</strong></span>, <span class="underline">underline</span>, <code class="literal">teletype</code>
         </p>
 <p>
           Unlike QuickBook's standard formatting scheme, the rules for simpler alternatives
-          are much stricter
-          <sup>[<a name="id372350" href="#ftn.id372350">1</a>]</sup>
-          .
+          are much stricter.
         </p>
 <div class="itemizedlist"><ul type="disc">
 <li>
@@ -161,14 +169,13 @@
           </li>
 <li>
             A line starting with the star will be interpreted as an unordered list.
-            See <a href="block.html#quickbook.syntax.block.lists.unordered_lists" title="Unordered
-          lists">Unordered
+            See <a href="block.html#quickbook.syntax.block.lists.unordered_lists" title="Unordered lists">Unordered
             lists</a>.
           </li>
 </ul></div>
 <div class="informaltable">
 <h4>
-<a name="id372430"></a>
+<a name="id2508715"></a>
             <span class="table-title">More Formatting Samples</span>
           </h4>
 <table class="table">
@@ -182,100 +189,108 @@
 </tr></thead>
 <tbody>
 <tr>
-<td><tt class="literal">
+<td><code class="literal">
 *Bold*
-                </tt></td>
-<td><span class="bold"><b>Bold</b></span></td>
+                </code></td>
+<td><span class="bold"><strong>Bold</strong></span></td>
 </tr>
 <tr>
-<td><tt class="literal">
+<td><code class="literal">
 *Is bold*
-                </tt></td>
-<td><span class="bold"><b>Is bold</b></span></td>
+                </code></td>
+<td><span class="bold"><strong>Is bold</strong></span></td>
 </tr>
 <tr>
-<td><tt class="literal">
+<td><code class="literal">
 * Not bold* *Not bold * * Not bold *
-                </tt></td>
+                </code></td>
 <td>* Not bold* *Not bold * * Not bold *</td>
 </tr>
 <tr>
-<td><tt class="literal">
+<td><code class="literal">
 This*Isn't*Bold (no bold)
-                </tt></td>
+                </code></td>
 <td>This*Isn't*Bold (no bold)</td>
 </tr>
 <tr>
-<td><tt class="literal">
+<td><code class="literal">
 (*Bold Inside*) (parenthesis not bold)
-                </tt></td>
-<td>(<span class="bold"><b>Bold Inside</b></span>)
+                </code></td>
+<td>(<span class="bold"><strong>Bold Inside</strong></span>)
                 (parenthesis not bold)</td>
 </tr>
 <tr>
-<td><tt class="literal">
+<td><code class="literal">
 *(Bold Outside)* (parenthesis bold)
-                </tt></td>
+                </code></td>
 <td>
-<span class="bold"><b>(Bold Outside)</b></span>
+<span class="bold"><strong>(Bold Outside)</strong></span>
                 (parenthesis bold)</td>
 </tr>
 <tr>
-<td><tt class="literal">
+<td><code class="literal">
 3*4*5 = 60 (no bold)
-                </tt></td>
+                </code></td>
 <td>3*4*5 = 60 (no bold)</td>
 </tr>
 <tr>
-<td><tt class="literal">
+<td><code class="literal">
 3 * 4 * 5 = 60 (no bold)
-                </tt></td>
+                </code></td>
 <td>3 * 4 * 5 = 60 (no bold)</td>
 </tr>
 <tr>
-<td><tt class="literal">
+<td><code class="literal">
 3 *4* 5 = 60 (4 is bold)
-                </tt></td>
-<td>3 <span class="bold"><b>4</b></span> 5 =
+                </code></td>
+<td>3 <span class="bold"><strong>4</strong></span> 5 =
                 60 (4 is bold)</td>
 </tr>
 <tr>
-<td><tt class="literal">
+<td><code class="literal">
 *This is bold* this is not *but this is*
-                </tt></td>
+                </code></td>
 <td>
-<span class="bold"><b>This is bold</b></span>
-                this is not <span class="bold"><b>but this is</b></span>
+<span class="bold"><strong>This is bold</strong></span>
+                this is not <span class="bold"><strong>but this is</strong></span>
 </td>
 </tr>
 <tr>
-<td><tt class="literal">
+<td><code class="literal">
 *This is bold*.
-                </tt></td>
+                </code></td>
 <td>
-<span class="bold"><b>This is bold</b></span>.</td>
+<span class="bold"><strong>This is bold</strong></span>.</td>
 </tr>
 <tr>
-<td><tt class="literal">
+<td><code class="literal">
 *B*. (bold B)
-                </tt></td>
+                </code></td>
 <td>
-<span class="bold"><b>B</b></span>. (bold
+<span class="bold"><strong>B</strong></span>. (bold
                 B)</td>
 </tr>
 <tr>
-<td><tt class="literal">
+<td><code class="literal">
 ['*Bold-Italic*]
-                </tt></td>
-<td><span class="emphasis"><em><span class="bold"><b>Bold-Italic</b></span></em></span></td>
+                </code></td>
+<td><span class="emphasis"><em><span class="bold"><strong>Bold-Italic</strong></span></em></span></td>
 </tr>
 </tbody>
 </table>
 </div>
+<div class="informaltable"><table class="table">
+<colgroup><col></colgroup>
+<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../../images/note.png" alt="note"></span> Thanks to David Barrett, author of <a href="http://quinthar.com/qwikiwiki/index.php?page=Home" target="_top">Qwiki</a>,
+                for sharing these samples and teaching me these obscure formatting
+                rules. I wasn't sure at all if <a href="http://spirit.sourceforge.net" target="_top">Spirit</a>,
+                being more or less a formal EBNF parser, can handle the context sensitivity
+                and ambiguity.</td></tr></tbody>
+</table></div>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.inline_code"></a><a href="phrase.html#quickbook.syntax.phrase.inline_code" title="Inline code">Inline code</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.inline_code"></a>Inline code</h4></div></div></div>
 <p>
           Inlining code in paragraphs is quite common when writing C++ documentation.
           We provide a very simple markup for this. For example, this:
@@ -286,35 +301,29 @@
           will generate:
         </p>
 <p>
-          This text has inlined code <tt class="computeroutput"><span class="keyword">int</span> <span class="identifier">main</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></tt> in it. The code will be syntax highlighted.
+          This text has inlined code <code class="computeroutput"><span class="keyword">int</span> <span class="identifier">main</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></code> in it. The code will be syntax highlighted.
         </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
-            We simply enclose the code with the tick: <tt class="literal">
+<div class="informaltable"><table class="table">
+<colgroup><col></colgroup>
+<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../../images/note.png" alt="note"></span> Note that we simply enclose the code with the
+                tick: <code class="literal">
 "`"
-            </tt>, not the single quote: <tt class="computeroutput"><span class="string">"'"</span></tt>.
-            Note too that <tt class="literal">
+                </code>, not the single quote: <code class="computeroutput"><span class="string">"'"</span></code>.
+                Note too that <code class="literal">
 `some code`
-            </tt> is prefered over <tt class="literal">
+                </code> is preferred over <code class="literal">
 [^some code]
-            </tt>.
-          </p></td></tr>
+                </code>. </td></tr></tbody>
 </table></div>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.code_blocks"></a><a href="phrase.html#quickbook.syntax.phrase.code_blocks" title="Code blocks">Code blocks</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.code_blocks"></a>Code blocks</h4></div></div></div>
 <p>
           Preformatted code simply starts with a space or a tab (See <a href="block.html#quickbook.syntax.block.code" title="Code">Code</a>).
           However, such a simple syntax cannot be used as phrase elements in lists
-          (See <a href="block.html#quickbook.syntax.block.lists.ordered_lists" title="Ordered
-          lists">Ordered
-          lists</a> and <a href="block.html#quickbook.syntax.block.lists.unordered_lists" title="Unordered
-          lists">Unordered
+          (See <a href="block.html#quickbook.syntax.block.lists.ordered_lists" title="Ordered lists">Ordered
+          lists</a> and <a href="block.html#quickbook.syntax.block.lists.unordered_lists" title="Unordered lists">Unordered
           lists</a>), tables (See <a href="block.html#quickbook.syntax.block.tables" title="Tables">Tables</a>),
           etc. Inline code (see above) can. The problem is, inline code does not
           allow formatting with newlines, spaces, and tabs. These are lost.
@@ -354,7 +363,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.source_mode"></a><a href="phrase.html#quickbook.syntax.phrase.source_mode" title="Source Mode">Source Mode</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.source_mode"></a>Source Mode</h4></div></div></div>
 <p>
           If a document contains more than one type of source code then the source
           mode may be changed dynamically as the document is processed. All QuickBook
@@ -363,8 +372,8 @@
           section.
         </p>
 <p>
-          To change the source mode, use the <tt class="literal">[source-mode]</tt> markup,
-          where <tt class="literal">source-mode</tt> is one of the supported modes. For
+          To change the source mode, use the <code class="literal">[source-mode]</code> markup,
+          where <code class="literal">source-mode</code> is one of the supported modes. For
           example, this:
         </p>
 <pre class="programlisting">Python's [python] `import` is rather like C++'s [c++] `#include`. A
@@ -375,14 +384,14 @@
           will generate:
         </p>
 <p>
-          Python's <tt class="computeroutput"><span class="keyword">import</span></tt> is rather
-          like C++'s <tt class="computeroutput"><span class="preprocessor">#include</span></tt>.
-          A C++ comment <tt class="computeroutput"><span class="comment">// looks like this</span></tt>
-          whereas a Python comment <tt class="computeroutput"><span class="comment">#looks like this</span></tt>.
+          Python's <code class="computeroutput"><span class="keyword">import</span></code> is rather
+          like C++'s <code class="computeroutput"><span class="preprocessor">#include</span></code>.
+          A C++ comment <code class="computeroutput"><span class="comment">// looks like this</span></code>
+          whereas a Python comment <code class="computeroutput"><span class="comment">#looks like this</span></code>.
         </p>
 <div class="informaltable">
 <h4>
-<a name="id443563"></a>
+<a name="id2559064"></a>
             <span class="table-title">Supported Source Modes</span>
           </h4>
 <table class="table">
@@ -397,66 +406,55 @@
 <tbody>
 <tr>
 <td>C++</td>
-<td><tt class="literal">[c++]</tt></td>
+<td><code class="literal">[c++]</code></td>
 </tr>
 <tr>
 <td>Python</td>
-<td><tt class="literal">[python]</tt></td>
+<td><code class="literal">[python]</code></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="../../images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
-            The source mode strings are lowercase.
-          </p></td></tr>
+<div class="informaltable"><table class="table">
+<colgroup><col></colgroup>
+<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../../images/note.png" alt="note"></span> The source mode strings are lowercase.</td></tr></tbody>
 </table></div>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.line_break"></a><a href="phrase.html#quickbook.syntax.phrase.line_break" title="line-break">line-break</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.line_break"></a>line-break</h4></div></div></div>
 <pre class="programlisting">[br]
 </pre>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
-            Note that <tt class="computeroutput"><span class="special">\</span><span class="identifier">n</span></tt>
-            is now preferred over <tt class="computeroutput"><span class="special">[</span><span class="identifier">br</span><span class="special">]</span></tt>.
-          </p></td></tr>
+<div class="informaltable"><table class="table">
+<colgroup><col></colgroup>
+<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../../images/note.png" alt="note"></span> Note that <code class="computeroutput"><span class="special">\</span><span class="identifier">n</span></code> is now preferred over <code class="computeroutput"><span class="special">[</span><span class="identifier">br</span><span class="special">]</span></code>.</td></tr></tbody>
 </table></div>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.anchors"></a><a href="phrase.html#quickbook.syntax.phrase.anchors" title="Anchors">Anchors</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.anchors"></a>Anchors</h4></div></div></div>
 <pre class="programlisting">[#named_anchor]
 </pre>
 <p>
           A named anchor is a hook that can be referenced by a link elsewhere in
-          the document. You can then reference an anchor with <tt class="literal">
+          the document. You can then reference an anchor with <code class="literal">
 [link named_anchor
 Some link text]
-          </tt>. See <a href="phrase.html#quickbook.syntax.phrase.anchor_links" title="Anchor links">Anchor
+          </code>. See <a href="phrase.html#quickbook.syntax.phrase.anchor_links" title="Anchor links">Anchor
           links</a>, <a href="block.html#quickbook.syntax.block.section" title="Section">Section</a>
           and <a href="block.html#quickbook.syntax.block.headings" title="Headings">Heading</a>.
         </p>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.links"></a><a href="phrase.html#quickbook.syntax.phrase.links" title="Links">Links</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.links"></a>Links</h4></div></div></div>
 <pre class="programlisting">[@http://www.boost.org this is [*boost's] website....]
 </pre>
 <p>
           will generate:
         </p>
 <p>
-          <a href="http://www.boost.org" target="_top">this is <span class="bold"><b>boost's</b></span>
+          <a href="http://www.boost.org" target="_top">this is <span class="bold"><strong>boost's</strong></span>
           website....</a>
         </p>
 <p>
@@ -478,7 +476,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.anchor_links"></a><a href="phrase.html#quickbook.syntax.phrase.anchor_links" title="Anchor links">Anchor links</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.anchor_links"></a>Anchor links</h4></div></div></div>
 <p>
           You can link within a document using:
         </p>
@@ -492,15 +490,15 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.refentry_links"></a><a href="phrase.html#quickbook.syntax.phrase.refentry_links" title="refentry links">refentry links</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.refentry_links"></a>refentry links</h4></div></div></div>
 <p>
           In addition, you can link internally to an XML refentry like:
         </p>
 <pre class="programlisting">[link xml.refentry The link text]
 </pre>
 <p>
-          This gets converted into <tt class="literal">&lt;link linkend="xml.refentry"&gt;The
-          link text&lt;/link&gt;</tt>.
+          This gets converted into <code class="literal">&lt;link linkend="xml.refentry"&gt;The
+          link text&lt;/link&gt;</code>.
         </p>
 <p>
           Like URLs, the link text is optional. If this is not present, the link
@@ -509,12 +507,12 @@
 <pre class="programlisting">[link xml.refentry]
 </pre>
 <p>
-          This gets converted into <tt class="literal">&lt;link linkend="xml.refentry"&gt;xml.refentry&lt;/link&gt;</tt>.
+          This gets converted into <code class="literal">&lt;link linkend="xml.refentry"&gt;xml.refentry&lt;/link&gt;</code>.
         </p>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.code_links"></a><a href="phrase.html#quickbook.syntax.phrase.code_links" title=" Code Links"> Code Links</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.code_links"></a> Code Links</h4></div></div></div>
 <p>
           If you want to link to a function, class, member, enum or header in the
           reference section, you can use:
@@ -537,7 +535,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.escape"></a><a href="phrase.html#quickbook.syntax.phrase.escape" title="Escape">Escape</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.escape"></a>Escape</h4></div></div></div>
 <p>
           The escape mark-up is used when we don't want to do any processing.
         </p>
@@ -555,73 +553,60 @@
 </pre>
 <p>
           
-<span class="bold"><b>This is direct XML markup</b></span>
+<span class="bold"><strong>This is direct XML markup</strong></span>
 
         </p>
-<div class="important"><table border="0" summary="Important">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../images/important.png"></td>
-<th align="left">Important</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
-            Be careful when using the escape. The text must conform to <a href="http://www.boost.org/doc/html/boostbook.html" target="_top">BoostBook</a>/<a href="http://www.docbook.org/" target="_top">DocBook</a> syntax.
-          </p></td></tr>
+<div class="informaltable"><table class="table">
+<colgroup><col></colgroup>
+<tbody><tr><td class="blurb"> <span class="inlinemediaobject"><img src="../../images/alert.png" alt="alert"></span> Be careful when using the escape. The text must
+                conform to <a href="http://www.boost.org/doc/html/boostbook.html" target="_top">BoostBook</a>/<a href="http://www.docbook.org/" target="_top">DocBook</a> syntax.</td></tr></tbody>
 </table></div>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.single_char_escape"></a><a href="phrase.html#quickbook.syntax.phrase.single_char_escape" title="Single
-        char escape">Single
-        char escape</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.single_char_escape"></a>Single char escape</h4></div></div></div>
 <p>
           The backslash may be used to escape a single punctuation character. The
           punctuation immediately after the backslash is passed without any processing.
-          This is useful when we need to escape QuickBook punctuations such as <tt class="computeroutput"><span class="special">[</span></tt> and <tt class="computeroutput"><span class="special">]</span></tt>.
-          For example, how do you escape the triple quote? Simple: <tt class="literal">\'\'\'</tt>
+          This is useful when we need to escape QuickBook punctuations such as <code class="computeroutput"><span class="special">[</span></code> and <code class="computeroutput"><span class="special">]</span></code>.
+          For example, how do you escape the triple quote? Simple: <code class="literal">\'\'\'</code>
         </p>
 <p>
-          <tt class="computeroutput"><span class="special">\</span><span class="identifier">n</span></tt>
-          has a special meaning. It is used to generate line breaks. Note that <tt class="computeroutput"><span class="special">\</span><span class="identifier">n</span></tt> is
-          now preferred over <tt class="computeroutput"><span class="special">[</span><span class="identifier">br</span><span class="special">]</span></tt>.
+          <code class="computeroutput"><span class="special">\</span><span class="identifier">n</span></code>
+          has a special meaning. It is used to generate line breaks. Note that <code class="computeroutput"><span class="special">\</span><span class="identifier">n</span></code> is
+          now preferred over <code class="computeroutput"><span class="special">[</span><span class="identifier">br</span><span class="special">]</span></code>.
         </p>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.images"></a><a href="phrase.html#quickbook.syntax.phrase.images" title="Images">Images</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.images"></a>Images</h4></div></div></div>
 <pre class="programlisting">[$image.jpg]
 </pre>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="quickbook.syntax.phrase.footnotes"></a><a href="phrase.html#quickbook.syntax.phrase.footnotes" title="Footnotes">Footnotes</a></h4></div></div></div>
+<a name="quickbook.syntax.phrase.footnotes"></a>Footnotes</h4></div></div></div>
 <p>
           As of version 1.3, QuickBook supports footnotes. Just put the text of the
-          footnote in a <tt class="computeroutput"><span class="special">[</span><span class="identifier">footnote</span><span class="special">]</span></tt> block, and the text will be put at the
+          footnote in a <code class="computeroutput"><span class="special">[</span><span class="identifier">footnote</span><span class="special">]</span></code> block, and the text will be put at the
           bottom of the current page. For example, this:
         </p>
 <pre class="programlisting">[footnote A sample footnote]
 </pre>
 <p>
           will generate this
-          <sup>[<a name="id444304" href="#ftn.id444304">2</a>]</sup>
+          <sup>[<a name="id2559780" href="#ftn.id2559780">1</a>]</sup>
           .
         </p>
 </div>
 <div class="footnotes">
 <br><hr width="100" align="left">
-<div class="footnote"><p><sup>[<a name="ftn.id372350" href="#id372350">1</a>] </sup>
-              Thanks to David Barrett, author of <a href="http://quinthar.com/qwikiwiki/index.php?page=Home" target="_top">Qwiki</a>,
-              for sharing these samples and teaching me these obscure formatting
-              rules. I wasn't sure at all if <a href="http://spirit.sourceforge.net" target="_top">Spirit</a>,
-              being more or less a formal EBNF parser, can handle the context sensitivity
-              and ambiguity.
-            </p></div>
-<div class="footnote"><p><sup>[<a name="ftn.id444304" href="#id444304">2</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id2559780" href="#id2559780">1</a>] </sup>
               A sample footnote
             </p></div>
 </div>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<table width="100%"><tr>
 <td align="left"></td>
 <td align="right"><small>Copyright © 2002, 2004 Joel de Guzman, Eric Niebler</small></td>
 </tr></table>

Modified: boost/trunk/tools/quickbook/doc/html/quickbook/syntax.html
===================================================================
--- boost/trunk/tools/quickbook/doc/html/quickbook/syntax.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/doc/html/quickbook/syntax.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,20 @@
 <html>
 <head>
+
+    <--
+    Copyright (c) 2002 2004 Joel de Guzman
+    Copyright (c) 2004 Eric Niebler
+    http://spirit.sourceforge.net/
+
+    Use, modification and distribution is subject to the Boost Software
+    License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+    http://www.boost.org/LICENSE_1_0.txt)
+    -->
+
 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
 <title> Syntax Summary</title>
 <link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.68.1">
 <link rel="start" href="../index.html" title="Quickbook 1.3">
 <link rel="up" href="../index.html" title="Quickbook 1.3">
 <link rel="prev" href="change_log.html" title=" Change Log">
@@ -24,7 +35,7 @@
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="quickbook.syntax"></a><a href="syntax.html" title=" Syntax Summary"> Syntax Summary</a></h2></div></div></div>
+<a name="quickbook.syntax"></a> Syntax Summary</h2></div></div></div>
 <div class="toc"><dl>
 <dt><span class="section"><a href="syntax/comments.html">Comments</a></span></dt>
 <dt><span class="section"><a href="syntax/phrase.html"> Phrase Level Elements</a></span></dt>
@@ -46,7 +57,7 @@
       past a single block.
     </p>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<table width="100%"><tr>
 <td align="left"></td>
 <td align="right"><small>Copyright © 2002, 2004 Joel de Guzman, Eric Niebler</small></td>
 </tr></table>

Modified: boost/trunk/tools/quickbook/doc/quickbook.qbk
===================================================================
--- boost/trunk/tools/quickbook/doc/quickbook.qbk	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/doc/quickbook.qbk	2007-02-16 16:48:35 UTC (rev 14035)
@@ -137,10 +137,6 @@
 * Footnotes, with the \[footnote This is the footnote\] syntax.
 * Post-processor bug fix for escaped XML code that it does not recognize.
 * Replaceable, with the \[~replacement\] syntax.
-* Generic Headers
-* Code changes to allow full recursion (i.e. Collectors and push/pop functions)
-* Various code cleanup/maintenance
-* Templates!
 
 [endsect]
 
@@ -247,12 +243,8 @@
 
 /italic/, *bold*, _underline_, =teletype=
 
-Unlike QuickBook's standard formatting scheme, the rules for simpler 
-alternatives are much stricter[footnote Thanks to David Barrett, author of 
-[@http://quinthar.com/qwikiwiki/index.php?page=Home Qwiki], for sharing 
-these samples and teaching me these obscure formatting rules. I wasn't sure 
-at all if __spirit__, being more or less a formal EBNF parser, can handle 
-the context sensitivity and ambiguity.].
+Unlike QuickBook's standard formatting scheme, the rules for simpler alternatives
+are much stricter.
 
 * Simple markups cannot nest. You can combine a simple markup with a nestable markup.
 * A non-space character must follow the leading markup
@@ -283,6 +275,11 @@
     [[[^'''['*Bold-Italic*]''']]                        [['*Bold-Italic*]]]
 ]
 
+[blurb __note__ Thanks to David Barrett, author of
+[@http://quinthar.com/qwikiwiki/index.php?page=Home Qwiki], for sharing these samples
+and teaching me these obscure formatting rules. I wasn't sure at all if __spirit__,
+being more or less a formal EBNF parser, can handle the context sensitivity and ambiguity.]
+
 [endsect]
 [section Inline code]
 
@@ -298,9 +295,11 @@
 This text has inlined code `int main() { return 0; }` in it. The code will be
 syntax highlighted.
 
-[note We simply enclose the code with the tick: [^'''"`"'''], not the 
-single quote: `"'"`. Note too that [^'''`some code`'''] is prefered over 
-[^'''[^some code]''']. ]
+[blurb __note__
+Note that we simply enclose the code with the tick: [^'''"`"'''], not the
+single quote: `"'"`. Note too that [^'''`some code`'''] is preferred over
+[^'''[^some code]'''].
+]
 
 [endsect]
 [section Code blocks]
@@ -368,7 +367,7 @@
     [[Python]               [[^\[python\]]]]
 ]
 
-[note The source mode strings are lowercase.]
+[blurb __note__ The source mode strings are lowercase.]
 
 [endsect]
 [section line-break]
@@ -377,7 +376,7 @@
 [br]
 ''']
 
-[note Note that `\n` is now preferred over `[br]`.]
+[blurb __note__ Note that `\n` is now preferred over `[br]`.]
 
 [endsect]
 [section Anchors]
@@ -494,7 +493,7 @@
 <emphasis role="bold">This is direct XML markup</emphasis>
 '''
 
-[important Be careful when using the escape. The text must conform to 
+[blurb __alert__ Be careful when using the escape. The text must conform to
 __boostbook__/__docbook__ syntax.]
 
 [endsect]
@@ -794,18 +793,18 @@
 Macros that are already defined are expanded in source code. Example:
 
 [pre'''
-[def __syntax_highlight__ [@quickbook/highlight.html syntax_highlight]]
-[def __quickbook__ [@index.html quickbook]]
+[def __array__ [@http://www.boost.org/doc/html/array/reference.html array]]
+[def __boost__ [@http://www.boost.org/libs/libraries.htm boost]]
 
-    using __quickbook__::__syntax_highlight__;
+    using __boost__::__array__;
 ''']
 
 Generates:
 
-[def __syntax_highlight__ [@quickbook/highlight.html syntax_highlight]]
-[def __quickbook__ [@index.html quickbook]]
+[def __array__ [@http://www.boost.org/doc/html/array/reference.html array]]
+[def __boost__ [@http://www.boost.org/libs/libraries.htm boost]]
 
-    using __quickbook__::__syntax_highlight__;
+    using __boost__::__array__;
 
 [endsect]
 [section:escape_back Escaping Back To QuickBook]
@@ -930,61 +929,15 @@
 to link to them. See __anchor_links__ and __section__ for more info.
 
 [endsect]
-[section Generic Heading]
-
-In cases when you don't want to care about the heading level (1 to 6), you 
-can use the /Generic Heading/:
-
-[pre'''
-[heading Heading]
-''']
-
-The /Generic Heading/ assumes the level, plus one, of the innermost section
-where it is placed. For example, if it is placed in the outermost section,
-then, it assumes /h2/.
-
-Headings are often used as an alternative to sections. It is used 
-particularly if you do not want to start a new section. In many cases, 
-however, headings in a particular section is just flat. Example:
-
-[pre'''
-[section A]
-[h2 X]
-[h2 Y]
-[h2 Z]
-[endsect] 
-''']
-
-Here we use h2 assuming that section A is the outermost level. If it is 
-placed in an inner level, you'll have to use h3, h4, etc. depending on 
-where the section is. In general, it is the section level plus one. It is 
-rather tedious, however, to scan the section level everytime. If you
-rewrite the example above as shown below, this will be automatic:
-
-[pre'''
-[section A]
-[heading X]
-[heading Y]
-[heading Z]
-[endsect] 
-''']
-
-They work well regardless where you place them. You can rearrange sections 
-at will without any extra work to ensure correct heading levels. In fact, 
-with /section/ and /heading/, you have all you need. /h1/../h6/ becomes 
-redundant. /h1/../h6/ might be deprecated in the future.
-
-[endsect]
 [section Macros]
 
 [pre'''
 [def macro_identifier some text]
 ''']
 
-When a macro is defined, the identifier replaces the text anywhere in the 
-file, in paragraphs, in markups, etc. macro_identifier is a string of non-
-white space characters except '\]'. A macro may not follow an alphabetic 
-character or the underscore. The replacement text can be any phrase (even 
+When a macro is defined, the identifier replaces the text anywhere in the file,
+in paragraphs, in markups, etc. macro_identifier is a string of non-white space
+characters except '\]' while the replacement text can be any phrase (even
 marked up). Example:
 
 [pre'''
@@ -997,10 +950,9 @@
 [def sf_logo [$http://sourceforge.net/sflogo.php?group_id=28447&type=1]]
 sf_logo
 
-[tip It's a good idea to use macro identifiers that are distinguishable. 
-For instance, in this document, macro identifiers have two leading and 
-trailing underscores (e.g. [^'''__spirit__''']). The reason is to avoid 
-unwanted macro replacement.]
+[blurb __tip__ It's a good idea to use macro identifiers that are distinguishable.
+For instance, in this document, macro identifiers have two leading and trailing
+underscores (e.g. [^'''__spirit__''']). The reason is to avoid unwanted macro replacement.]
 
 Links (URLS) and images are good candidates for macros. *1*) They tend to
 change a lot. It is a good idea to place all links and images in one place near the top
@@ -1039,82 +991,6 @@
 ]
 
 [endsect]
-[section Templates]
-
-Templates provide a more versatile text substitution mechanism. Templates 
-come in handy when you need to create parameterizable, multi-line, 
-boilerplate text that you specify once and expand many times. Templates 
-accept one or more arguments. These arguments act like place-holders for 
-text replacement. Unlike simple macros, which are limited to phrase level 
-markup, templates can contain block level markup (e.g. paragraphs, code 
-blocks and tables).
-
-Example template:
-
-[pre'''
-[template person(name_, age_, id_)
-
-Hi, my name is name_. I am age_ years old. My id is id_.
-
-]
-''']
-
-[template person(name_, age_, id_)
-
-Hi, my name is *name_*. I am *age_* years old. My id is *id_*.
-
-]
-
-Template formal arguments are identifiers consisting of an initial 
-alphabetic character or the underscore, followed by zero or more 
-alphanumeric characters or the underscore. This is similar to your typical 
-C/C++ identifier. A template formal argument temporarily hides a macro of 
-the same name at the point where the template is invoked. At template 
-invocation, you supply the actual arguments. At that point, the template 
-will be expanded with your supplied arguments. Example:
-
-[pre'''
-person(James Bond, 39, 007)
-person(Santa Clause, 87, 12-25)
-''']
-
-Which will expand to:
-
-person(James Bond, 39, 007)
-person(Santa Clause, 87, 12-25)
-
-Each actual argument can be a word, a text fragment or just about any 
-[link quickbook.syntax.phrase QuickBook phrase]. Arguments are comma 
-separated and terminated by the close parenthesis. If your arguments have 
-embedded commas or close parentheses, you'll have to 
-[link quickbook.syntax.phrase.single_char_escape escape them].
-
-[caution Templates are recursive. A template can call another template or 
-even itself, directly or indirectly. There are no control structures in 
-QuickBook (yet) so this will always mean infinite recursion. QuickBook can 
-detect this situation and report an error if recursion exceeds a certain 
-limit.]
-
-Templates may be phrase or block level. Phrase templates are of the form:
-
-[pre'''
-[template sample(arg1, arg2,...argN) replacement text... ]
-''']
-
-Block templates are of the form:
-
-[pre'''
-[template sample(arg1, arg2,...argN) 
-replacement text... 
-]
-''']
-
-The basic rule is as follows: if a newline immediately follows the argument 
-list, then it is a block template, otherwise, it is a phrase template.
-Phrase templates are typically expanded as part of phrases. Like macros, 
-block level elements are not allowed in phrase templates. 
-
-[endsect]
 [section Blurbs]
 
 [pre'''
@@ -1135,9 +1011,6 @@
     (EBNF) completely in C++.
 ]
 
-[note Prefer [link quickbook.syntax.block.admonitions admonitions] wherever 
-appropriate.]
-
 [endsect]
 [section Tables]
 

Modified: boost/trunk/tools/quickbook/doc/quickbook.xml
===================================================================
--- boost/trunk/tools/quickbook/doc/quickbook.xml	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/doc/quickbook.xml	2007-02-16 16:48:35 UTC (rev 14035)
@@ -399,7 +399,7 @@
                 </inlinemediaobject> Note that we simply enclose the code with the
                 tick: <literal>"`"</literal>, not the single quote: <code><phrase
                 role="string">&quot;'&quot;</phrase></code>. Note too that <literal>`some
-                code`</literal> is prefered over <literal>[^some code]</literal>.
+                code`</literal> is preferred over <literal>[^some code]</literal>.
                 </entry>
               </row>
             </tbody>

Modified: boost/trunk/tools/quickbook/index.html
===================================================================
--- boost/trunk/tools/quickbook/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,6 +2,17 @@
 <html>
   <head>
     <meta http-equiv="refresh" content="0; URL=doc/html/index.html">
+
+    <--
+    Copyright (c) 2002 2004 Joel de Guzman
+    Copyright (c) 2004 Eric Niebler
+    http://spirit.sourceforge.net/
+
+    Use, modification and distribution is subject to the Boost Software
+    License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+    http://www.boost.org/LICENSE_1_0.txt)
+    -->
+
   </head>
   <body>
     Automatic redirection failed, click this 

Modified: boost/trunk/tools/quickbook/phrase.hpp
===================================================================
--- boost/trunk/tools/quickbook/phrase.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/phrase.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -31,20 +31,17 @@
                 (
                     graph_p                     // A single char. e.g. *c*
                     >> eps_p(mark
-                        >> (space_p | punct_p | end_p)) 
-                                                // space_p, punct_p or end_p 
-                )                               // must follow mark
-            |   
-                (   graph_p >>                  // graph_p must follow mark
+                        >> (space_p | punct_p))
+                )
+            |   (   graph_p >>                  // graph_p must follow mark
                     *(anychar_p -
                         (   eol                 // Make sure that we don't go
                         |   (graph_p >> mark)   // past a single line
                         )
                     ) >> graph_p                // graph_p must precede mark
                     >> eps_p(mark
-                        >> (space_p | punct_p | end_p)) 
-                                                // space_p, punct_p or end_p 
-                )                               // must follow mark
+                        >> (space_p | punct_p)) // space_p or punct_p must
+                )                               // follow mark
             )                                   [action]
             >> mark
             ;
@@ -92,8 +89,7 @@
                     ;
 
                 common =
-                        macro
-                    |   template_                       [actions.do_template]
+                        actions.macro                   [actions.do_macro]
                     |   phrase_markup
                     |   code_block
                     |   inline_code
@@ -101,30 +97,6 @@
                     |   escape
                     |   comment
                     ;
-                    
-                macro = 
-                    eps_p(actions.macro                 // must not be followed by
-                        >> (eps_p - (alpha_p | '_')))   // alpha or underscore
-                    >> actions.macro                    [actions.do_macro]
-                    ;
-                
-                template_ =
-                    (actions.templates >> eps_p)        [push_back_a(actions.template_info)]
-                    >> space >> '('
-                    >> template_arg                     [push_back_a(actions.template_info)]
-                    >> *(
-                            ',' >> template_arg         [push_back_a(actions.template_info)]
-                        )
-                    >> space >> ')'
-                    ;
-                
-                template_arg = 
-                    +("\\," | parens | (anychar_p - (ch_p(',') | ')')))
-                    ;
-                    
-                parens = 
-                    '(' >> +template_arg >> ')'
-                    ;
 
                 inline_code =
                     '`' >>
@@ -337,9 +309,8 @@
                             classref, memberref, enumref, headerref, anchor, 
                             link, hard_space, eol, inline_code, simple_format, 
                             simple_bold, simple_italic, simple_underline, 
-                            simple_teletype, source_mode, template_, template_arg,
-                            quote, code_block, footnote, replaceable, parens,
-                            macro;
+                            simple_teletype, source_mode, 
+                            quote, code_block, footnote, replaceable;
 
             rule<Scanner> const&
             start() const { return common; }
@@ -348,44 +319,6 @@
         bool& is_not_preformatted;
         Actions& actions;
     };
-
-    template <typename Actions>
-    struct simple_phrase_grammar
-    : public grammar<simple_phrase_grammar<Actions> >
-    {
-        simple_phrase_grammar(Actions& actions)
-            : actions(actions) {}
-
-        template <typename Scanner>
-        struct definition
-        {
-            definition(simple_phrase_grammar const& self)
-                : unused(false), common(self.actions, unused)
-            {
-                Actions& actions = self.actions;
-
-                phrase =
-                   *(   common
-                    |   comment
-                    |   (anychar_p - ']')           [actions.plain_char]
-                    )
-                    ;
-
-                comment =
-                    "[/" >> *(anychar_p - ']') >> ']'
-                    ;
-            }
-
-            bool unused;
-            rule<Scanner> phrase, comment;
-            phrase_grammar<Actions> common;
-
-            rule<Scanner> const&
-            start() const { return phrase; }
-        };
-
-        Actions& actions;
-    };
 }
 
 #endif // BOOST_SPIRIT_QUICKBOOK_PHRASE_HPP

Modified: boost/trunk/tools/quickbook/syntax_highlight.hpp
===================================================================
--- boost/trunk/tools/quickbook/syntax_highlight.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/syntax_highlight.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -48,7 +48,7 @@
                 program
                     =
                     *(  (+space_p)      [Space(self.out)]
-                    |   macro
+                    |   self.macro      [self.do_macro]
                     |   escape
                     |   preprocessor    [Process("preprocessor", self.out)]
                     |   comment         [Process("comment", self.out)]
@@ -62,12 +62,6 @@
                     )
                     ;
 
-                macro = 
-                    eps_p(self.macro                    // must not be followed by
-                        >> (eps_p - (alpha_p | '_')))   // alpha or underscore
-                    >> self.macro                       [self.do_macro]
-                    ;
-
                 qbk_phrase =
                    *(   common
                     |   (anychar_p - str_p("``"))   [self.escape_actions.plain_char]
@@ -185,7 +179,7 @@
                 program
                     =
                     *(  (+space_p)      [Space(self.out)]
-                    |   macro
+                    |   self.macro      [self.do_macro]
                     |   escape          
                     |   comment         [Process("comment", self.out)]
                     |   keyword         [Process("keyword", self.out)]
@@ -197,12 +191,6 @@
                     )
                     ;
 
-                macro = 
-                    eps_p(self.macro                    // must not be followed by
-                        >> (eps_p - (alpha_p | '_')))   // alpha or underscore
-                    >> self.macro                       [self.do_macro]
-                    ;
-
                 qbk_phrase =
                    *(   common
                     |   (anychar_p - str_p("``"))   [self.escape_actions.plain_char]

Modified: boost/trunk/tools/quickbook/test/Jamfile.v2
===================================================================
--- boost/trunk/tools/quickbook/test/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/test/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -18,5 +18,4 @@
     [ quickbook-test preformatted ]
     [ quickbook-test link-side-by-side ]
     [ quickbook-test escape ]
-    [ quickbook-test templates ]
     ;

Modified: boost/trunk/tools/quickbook/test/quickbook-manual.gold
===================================================================
--- boost/trunk/tools/quickbook/test/quickbook-manual.gold	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/test/quickbook-manual.gold	2007-02-16 16:48:35 UTC (rev 14035)
@@ -24,7 +24,7 @@
   </articleinfo>
   <title>Quickbook 1.3</title>
   <section id="quickbook.intro">
-    <title><link linkend="quickbook.intro"> Introduction</link></title>
+    <title> Introduction</title>
     <blockquote>
       <para>
         <emphasis role="bold"><emphasis><quote>Why program by hand in five days what
@@ -86,10 +86,9 @@
     </itemizedlist>
   </section>
   <section id="quickbook.change_log">
-    <title><link linkend="quickbook.change_log"> Change Log</link></title> <anchor
-    id="quickbook.change_log.version_1_3"/>
+    <title> Change Log</title> <anchor id="quickbook.change_log.version_1_3" />
     <bridgehead renderas="sect3">
-      <link linkend="quickbook.change_log.version_1_3">Version 1.3</link>
+      Version 1.3
     </bridgehead>
     <itemizedlist>
       <listitem>
@@ -160,7 +159,7 @@
     </itemizedlist>
   </section>
   <section id="quickbook.syntax">
-    <title><link linkend="quickbook.syntax"> Syntax Summary</link></title>
+    <title> Syntax Summary</title>
     <para>
       A QuickBook document is composed of one or more blocks. An example of a block
       is the paragraph or a C++ code snippet. Some blocks have special mark-ups.
@@ -177,7 +176,7 @@
       past a single block.
     </para>
     <section id="quickbook.syntax.comments">
-      <title><link linkend="quickbook.syntax.comments">Comments</link></title>
+      <title>Comments</title>
       <para>
         Can be placed anywhere.
       </para>
@@ -186,10 +185,9 @@
 </programlisting>
     </section>
     <section id="quickbook.syntax.phrase">
-      <title><link linkend="quickbook.syntax.phrase"> Phrase Level Elements</link></title>
+      <title> Phrase Level Elements</title>
       <section id="quickbook.syntax.phrase.font_styles">
-        <title><link linkend="quickbook.syntax.phrase.font_styles">Font Styles</link></title>
-        
+        <title>Font Styles</title> 
 <programlisting><!--quickbook-escape-prefix-->['italic], [*bold], [_underline], [^teletype], [-strikethrough]
 <!--quickbook-escape-postfix--></programlisting>
         <para>
@@ -214,7 +212,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.phrase.replaceable">
-        <title><link linkend="quickbook.syntax.phrase.replaceable">Replaceable</link></title>
+        <title>Replaceable</title>
         <para>
           When you want content that may or must be replaced by the user, use the
           syntax:
@@ -232,8 +230,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.phrase.quotations">
-        <title><link linkend="quickbook.syntax.phrase.quotations">Quotations</link></title>
-        
+        <title>Quotations</title> 
 <programlisting><!--quickbook-escape-prefix-->["A question that sometimes drives me hazy: am I or are the others crazy?]--Einstein
 <!--quickbook-escape-postfix--></programlisting>
         <para>
@@ -264,7 +261,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.phrase.simple_formatting">
-        <title><link linkend="quickbook.syntax.phrase.simple_formatting">Simple formatting</link></title>
+        <title>Simple formatting</title>
         <para>
           Simple markup for formatting text, common in many applications, is now
           supported:
@@ -394,20 +391,27 @@
             </tbody>
           </tgroup>
         </informaltable>
-        <para role="blurb">
-          <inlinemediaobject><imageobject><imagedata fileref="images/note.png"></imagedata></imageobject>
-          <textobject>
-            <phrase>note</phrase>
-          </textobject>
-          </inlinemediaobject> Thanks to David Barrett, author of <ulink url="http://quinthar.com/qwikiwiki/index.php?page=Home">Qwiki</ulink>,
-          for sharing these samples and teaching me these obscure formatting rules.
-          I wasn't sure at all if <ulink url="http://spirit.sourceforge.net">Spirit</ulink>,
-          being more or less a formal EBNF parser, can handle the context sensitivity
-          and ambiguity.
-        </para>
+        <informaltable frame="all">
+          <?dbhtml table-width="74%" ?>
+          <tgroup cols="1">
+            <tbody>
+              <row>
+                <entry role="blurb"> <inlinemediaobject><imageobject><imagedata fileref="images/note.png"></imagedata></imageobject>
+                <textobject>
+                  <phrase>note</phrase>
+                </textobject>
+                </inlinemediaobject> Thanks to David Barrett, author of <ulink url="http://quinthar.com/qwikiwiki/index.php?page=Home">Qwiki</ulink>,
+                for sharing these samples and teaching me these obscure formatting
+                rules. I wasn't sure at all if <ulink url="http://spirit.sourceforge.net">Spirit</ulink>,
+                being more or less a formal EBNF parser, can handle the context sensitivity
+                and ambiguity.</entry>
+              </row>
+            </tbody>
+          </tgroup>
+        </informaltable>
       </section>
       <section id="quickbook.syntax.phrase.inline_code">
-        <title><link linkend="quickbook.syntax.phrase.inline_code">Inline code</link></title>
+        <title>Inline code</title>
         <para>
           Inlining code in paragraphs is quite common when writing C++ documentation.
           We provide a very simple markup for this. For example, this:
@@ -425,24 +429,31 @@
           role="number">0</phrase><phrase role="special">;</phrase>&nbsp;<phrase
           role="special">}</phrase></code> in it. The code will be syntax highlighted.
         </para>
-        <para role="blurb">
-          <inlinemediaobject><imageobject><imagedata fileref="images/note.png"></imagedata></imageobject>
-          <textobject>
-            <phrase>note</phrase>
-          </textobject>
-          </inlinemediaobject> Note that we simply enclose the code with the tick:
-          <literal>
+        <informaltable frame="all">
+          <?dbhtml table-width="74%" ?>
+          <tgroup cols="1">
+            <tbody>
+              <row>
+                <entry role="blurb"> <inlinemediaobject><imageobject><imagedata fileref="images/note.png"></imagedata></imageobject>
+                <textobject>
+                  <phrase>note</phrase>
+                </textobject>
+                </inlinemediaobject> Note that we simply enclose the code with the
+                tick: <literal>
 <!--quickbook-escape-prefix-->"`"<!--quickbook-escape-postfix-->
-          </literal>, not the single quote: <code><phrase role="string">&quot;'&quot;</phrase></code>.
-          Note too that <literal>
+                </literal>, not the single quote: <code><phrase role="string">&quot;'&quot;</phrase></code>.
+                Note too that <literal>
 <!--quickbook-escape-prefix-->`some code`<!--quickbook-escape-postfix-->
-          </literal> is prefered over <literal>
+                </literal> is preferred over <literal>
 <!--quickbook-escape-prefix-->[^some code]<!--quickbook-escape-postfix-->
-          </literal>.
-        </para>
+                </literal>. </entry>
+              </row>
+            </tbody>
+          </tgroup>
+        </informaltable>
       </section>
       <section id="quickbook.syntax.phrase.code_blocks">
-        <title><link linkend="quickbook.syntax.phrase.code_blocks">Code blocks</link></title>
+        <title>Code blocks</title>
         <para>
           Preformatted code simply starts with a space or a tab (See <link linkend="quickbook.syntax.block.code">Code</link>).
           However, such a simple syntax cannot be used as phrase elements in lists
@@ -485,7 +496,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.phrase.source_mode">
-        <title><link linkend="quickbook.syntax.phrase.source_mode">Source Mode</link></title>
+        <title>Source Mode</title>
         <para>
           If a document contains more than one type of source code then the source
           mode may be changed dynamically as the document is processed. All QuickBook
@@ -532,32 +543,45 @@
             </tbody>
           </tgroup>
         </informaltable>
-        <para role="blurb">
-          <inlinemediaobject><imageobject><imagedata fileref="images/note.png"></imagedata></imageobject>
-          <textobject>
-            <phrase>note</phrase>
-          </textobject>
-          </inlinemediaobject> The source mode strings are lowercase.
-        </para>
+        <informaltable frame="all">
+          <?dbhtml table-width="74%" ?>
+          <tgroup cols="1">
+            <tbody>
+              <row>
+                <entry role="blurb"> <inlinemediaobject><imageobject><imagedata fileref="images/note.png"></imagedata></imageobject>
+                <textobject>
+                  <phrase>note</phrase>
+                </textobject>
+                </inlinemediaobject> The source mode strings are lowercase.</entry>
+              </row>
+            </tbody>
+          </tgroup>
+        </informaltable>
       </section>
       <section id="quickbook.syntax.phrase.line_break">
-        <title><link linkend="quickbook.syntax.phrase.line_break">line-break</link></title>
-        
+        <title>line-break</title> 
 <programlisting><!--quickbook-escape-prefix-->[br]
 <!--quickbook-escape-postfix--></programlisting>
-        <para role="blurb">
-          <inlinemediaobject><imageobject><imagedata fileref="images/note.png"></imagedata></imageobject>
-          <textobject>
-            <phrase>note</phrase>
-          </textobject>
-          </inlinemediaobject> Note that <code><phrase role="special">\</phrase><phrase
-          role="identifier">n</phrase></code> is now preferred over <code><phrase
-          role="special">[</phrase><phrase role="identifier">br</phrase><phrase role="special">]</phrase></code>.
-        </para>
+        <informaltable frame="all">
+          <?dbhtml table-width="74%" ?>
+          <tgroup cols="1">
+            <tbody>
+              <row>
+                <entry role="blurb"> <inlinemediaobject><imageobject><imagedata fileref="images/note.png"></imagedata></imageobject>
+                <textobject>
+                  <phrase>note</phrase>
+                </textobject>
+                </inlinemediaobject> Note that <code><phrase role="special">\</phrase><phrase
+                role="identifier">n</phrase></code> is now preferred over <code><phrase
+                role="special">[</phrase><phrase role="identifier">br</phrase><phrase
+                role="special">]</phrase></code>.</entry>
+              </row>
+            </tbody>
+          </tgroup>
+        </informaltable>
       </section>
       <section id="quickbook.syntax.phrase.anchors">
-        <title><link linkend="quickbook.syntax.phrase.anchors">Anchors</link></title>
-        
+        <title>Anchors</title> 
 <programlisting><!--quickbook-escape-prefix-->[#named_anchor]
 <!--quickbook-escape-postfix--></programlisting>
         <para>
@@ -571,8 +595,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.phrase.links">
-        <title><link linkend="quickbook.syntax.phrase.links">Links</link></title>
-        
+        <title>Links</title> 
 <programlisting><!--quickbook-escape-prefix-->[@http://www.boost.org this is [*boost's] website....]
 <!--quickbook-escape-postfix--></programlisting>
         <para>
@@ -602,7 +625,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.phrase.anchor_links">
-        <title><link linkend="quickbook.syntax.phrase.anchor_links">Anchor links</link></title>
+        <title>Anchor links</title>
         <para>
           You can link within a document using:
         </para>
@@ -616,7 +639,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.phrase.refentry_links">
-        <title><link linkend="quickbook.syntax.phrase.refentry_links">refentry links</link></title>
+        <title>refentry links</title>
         <para>
           In addition, you can link internally to an XML refentry like:
         </para>
@@ -639,7 +662,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.phrase.code_links">
-        <title><link linkend="quickbook.syntax.phrase.code_links"> Code Links</link></title>
+        <title> Code Links</title>
         <para>
           If you want to link to a function, class, member, enum or header in the
           reference section, you can use:
@@ -663,7 +686,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.phrase.escape">
-        <title><link linkend="quickbook.syntax.phrase.escape">Escape</link></title>
+        <title>Escape</title>
         <para>
           The escape mark-up is used when we don't want to do any processing.
         </para>
@@ -686,19 +709,25 @@
 <!--quickbook-escape-prefix--><emphasis role="bold">This is direct XML markup</emphasis>
 <!--quickbook-escape-postfix-->
         </para>
-        <para role="blurb">
-          <inlinemediaobject><imageobject><imagedata fileref="images/alert.png"></imagedata></imageobject>
-          <textobject>
-            <phrase>alert</phrase>
-          </textobject>
-          </inlinemediaobject> Be careful when using the escape. The text must conform
-          to <ulink url="http://www.boost.org/doc/html/boostbook.html">BoostBook</ulink>/<ulink
-          url="http://www.docbook.org/">DocBook</ulink> syntax.
-        </para>
+        <informaltable frame="all">
+          <?dbhtml table-width="74%" ?>
+          <tgroup cols="1">
+            <tbody>
+              <row>
+                <entry role="blurb"> <inlinemediaobject><imageobject><imagedata fileref="images/alert.png"></imagedata></imageobject>
+                <textobject>
+                  <phrase>alert</phrase>
+                </textobject>
+                </inlinemediaobject> Be careful when using the escape. The text must
+                conform to <ulink url="http://www.boost.org/doc/html/boostbook.html">BoostBook</ulink>/<ulink
+                url="http://www.docbook.org/">DocBook</ulink> syntax.</entry>
+              </row>
+            </tbody>
+          </tgroup>
+        </informaltable>
       </section>
       <section id="quickbook.syntax.phrase.single_char_escape">
-        <title><link linkend="quickbook.syntax.phrase.single_char_escape">Single
-        char escape</link></title>
+        <title>Single char escape</title>
         <para>
           The backslash may be used to escape a single punctuation character. The
           punctuation immediately after the backslash is passed without any processing.
@@ -715,13 +744,12 @@
         </para>
       </section>
       <section id="quickbook.syntax.phrase.images">
-        <title><link linkend="quickbook.syntax.phrase.images">Images</link></title>
-        
+        <title>Images</title> 
 <programlisting><!--quickbook-escape-prefix-->[$image.jpg]
 <!--quickbook-escape-postfix--></programlisting>
       </section>
       <section id="quickbook.syntax.phrase.footnotes">
-        <title><link linkend="quickbook.syntax.phrase.footnotes">Footnotes</link></title>
+        <title>Footnotes</title>
         <para>
           As of version 1.3, QuickBook supports footnotes. Just put the text of the
           footnote in a <code><phrase role="special">[</phrase><phrase role="identifier">footnote</phrase><phrase
@@ -743,9 +771,9 @@
       </section>
     </section>
     <section id="quickbook.syntax.block">
-      <title><link linkend="quickbook.syntax.block"> Block Level Elements</link></title>
+      <title> Block Level Elements</title>
       <section id="quickbook.syntax.block.document">
-        <title><link linkend="quickbook.syntax.block.document">Document</link></title>
+        <title>Document</title>
         <para>
           Every document must begin with a Document Info section, which should look
           like this:
@@ -820,7 +848,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.block.section">
-        <title><link linkend="quickbook.syntax.block.section">Section</link></title>
+        <title>Section</title>
         <para>
           Starting a new section is accomplished with:
         </para>
@@ -847,7 +875,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.block.xinclude">
-        <title><link linkend="quickbook.syntax.block.xinclude">xinclude</link></title>
+        <title>xinclude</title>
         <para>
           You can include another XML file with:
         </para>
@@ -860,7 +888,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.block.paragraphs">
-        <title><link linkend="quickbook.syntax.block.paragraphs">Paragraphs</link></title>
+        <title>Paragraphs</title>
         <para>
           Paragraphs start left-flushed and are terminated by two or more newlines.
           No markup is needed for paragraphs. QuickBook automatically detects paragraphs
@@ -870,10 +898,9 @@
         </para>
       </section>
       <section id="quickbook.syntax.block.lists">
-        <title><link linkend="quickbook.syntax.block.lists">Lists</link></title>
+        <title>Lists</title>
         <section id="quickbook.syntax.block.lists.ordered_lists">
-          <title><link linkend="quickbook.syntax.block.lists.ordered_lists">Ordered
-          lists</link></title> 
+          <title>Ordered lists</title> 
 <programlisting># One
 # Two
 # Three
@@ -894,8 +921,7 @@
           </orderedlist>
         </section>
         <section id="quickbook.syntax.block.lists.list_hierarchies">
-          <title><link linkend="quickbook.syntax.block.lists.list_hierarchies">List
-          Hierarchies</link></title>
+          <title>List Hierarchies</title>
           <para>
             List hierarchies are supported. Example:
           </para>
@@ -958,8 +984,7 @@
           </orderedlist>
         </section>
         <section id="quickbook.syntax.block.lists.long_list_lines">
-          <title><link linkend="quickbook.syntax.block.lists.long_list_lines">Long
-          List Lines</link></title>
+          <title>Long List Lines</title>
           <para>
             Long lines will be wrapped appropriately. Example:
           </para>
@@ -988,8 +1013,7 @@
           </orderedlist>
         </section>
         <section id="quickbook.syntax.block.lists.unordered_lists">
-          <title><link linkend="quickbook.syntax.block.lists.unordered_lists">Unordered
-          lists</link></title> 
+          <title>Unordered lists</title> 
 <programlisting><!--quickbook-escape-prefix-->* First
 * Second
 * Third
@@ -1010,7 +1034,7 @@
           </itemizedlist>
         </section>
         <section id="quickbook.syntax.block.lists.mixed_lists">
-          <title><link linkend="quickbook.syntax.block.lists.mixed_lists">Mixed lists</link></title>
+          <title>Mixed lists</title>
           <para>
             Mixed lists (ordered and unordered) are supported. Example:
           </para>
@@ -1122,7 +1146,7 @@
         </section>
       </section>
       <section id="quickbook.syntax.block.code">
-        <title><link linkend="quickbook.syntax.block.code">Code</link></title>
+        <title>Code</title>
         <para>
           Preformatted code starts with a space or a tab. The code will be syntax
           highlighted according to the current <link linkend="quickbook.syntax.phrase.source_mode">Source
@@ -1170,8 +1194,7 @@
 </programlisting>
       </section>
       <section id="quickbook.syntax.block.escape_back">
-        <title><link linkend="quickbook.syntax.block.escape_back"> Escaping Back
-        To QuickBook</link></title>
+        <title> Escaping Back To QuickBook</title>
         <para>
           Inside code, code blocks and inline code, QuickBook does not allow any
           markup to avoid conflicts with the target syntax (e.g. c++). In case you
@@ -1200,7 +1223,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.block.preformatted">
-        <title><link linkend="quickbook.syntax.block.preformatted">Preformatted</link></title>
+        <title>Preformatted</title>
         <para>
           Sometimes, you don't want some preformatted text to be parsed as C++. In
           such cases, use the <literal>[pre ... ]</literal> markup block.
@@ -1235,8 +1258,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.block.blockquote">
-        <title><link linkend="quickbook.syntax.block.blockquote">Blockquote</link></title>
-        
+        <title>Blockquote</title> 
 <programlisting><!--quickbook-escape-prefix-->[:sometext...]<!--quickbook-escape-postfix-->
 </programlisting>
         <blockquote>
@@ -1246,8 +1268,7 @@
         </blockquote>
       </section>
       <section id="quickbook.syntax.block.admonitions">
-        <title><link linkend="quickbook.syntax.block.admonitions">Admonitions</link></title>
-        
+        <title>Admonitions</title> 
 <programlisting><!--quickbook-escape-prefix-->[note This is a note]
 [tip This is a tip]
 [important This is important]
@@ -1289,8 +1310,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.block.headings">
-        <title><link linkend="quickbook.syntax.block.headings">Headings</link></title>
-        
+        <title>Headings</title> 
 <programlisting><!--quickbook-escape-prefix-->[h1 Heading 1]
 [h2 Heading 2]
 [h3 Heading 3]
@@ -1298,29 +1318,29 @@
 [h5 Heading 5]
 [h6 Heading 6]
 <!--quickbook-escape-postfix--></programlisting>
-        <anchor id="quickbook.syntax.block.headings.heading_1"/>
+        <anchor id="quickbook.syntax.block.headings.heading_1" />
         <bridgehead renderas="sect1">
-          <link linkend="quickbook.syntax.block.headings.heading_1">Heading 1</link>
+          Heading 1
         </bridgehead>
-        <anchor id="quickbook.syntax.block.headings.heading_2"/>
+        <anchor id="quickbook.syntax.block.headings.heading_2" />
         <bridgehead renderas="sect2">
-          <link linkend="quickbook.syntax.block.headings.heading_2">Heading 2</link>
+          Heading 2
         </bridgehead>
-        <anchor id="quickbook.syntax.block.headings.heading_3"/>
+        <anchor id="quickbook.syntax.block.headings.heading_3" />
         <bridgehead renderas="sect3">
-          <link linkend="quickbook.syntax.block.headings.heading_3">Heading 3</link>
+          Heading 3
         </bridgehead>
-        <anchor id="quickbook.syntax.block.headings.heading_4"/>
+        <anchor id="quickbook.syntax.block.headings.heading_4" />
         <bridgehead renderas="sect4">
-          <link linkend="quickbook.syntax.block.headings.heading_4">Heading 4</link>
+          Heading 4
         </bridgehead>
-        <anchor id="quickbook.syntax.block.headings.heading_5"/>
+        <anchor id="quickbook.syntax.block.headings.heading_5" />
         <bridgehead renderas="sect5">
-          <link linkend="quickbook.syntax.block.headings.heading_5">Heading 5</link>
+          Heading 5
         </bridgehead>
-        <anchor id="quickbook.syntax.block.headings.heading_6"/>
+        <anchor id="quickbook.syntax.block.headings.heading_6" />
         <bridgehead renderas="sect6">
-          <link linkend="quickbook.syntax.block.headings.heading_6">Heading 6</link>
+          Heading 6
         </bridgehead>
         <para>
           Headings 1-3 [h1 h2 and h3] will automatically have anchors with normalized
@@ -1341,8 +1361,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.block.macros">
-        <title><link linkend="quickbook.syntax.block.macros">Macros</link></title>
-        
+        <title>Macros</title> 
 <programlisting><!--quickbook-escape-prefix-->[def macro_identifier some text]
 <!--quickbook-escape-postfix--></programlisting>
         <para>
@@ -1365,17 +1384,24 @@
           </textobject>
           </inlinemediaobject>
         </para>
-        <para role="blurb">
-          <inlinemediaobject><imageobject><imagedata fileref="images/tip.png"></imagedata></imageobject>
-          <textobject>
-            <phrase>tip</phrase>
-          </textobject>
-          </inlinemediaobject> It's a good idea to use macro identifiers that are
-          distinguishable. For instance, in this document, macro identifiers have
-          two leading and trailing underscores (e.g. <literal>
+        <informaltable frame="all">
+          <?dbhtml table-width="74%" ?>
+          <tgroup cols="1">
+            <tbody>
+              <row>
+                <entry role="blurb"> <inlinemediaobject><imageobject><imagedata fileref="images/tip.png"></imagedata></imageobject>
+                <textobject>
+                  <phrase>tip</phrase>
+                </textobject>
+                </inlinemediaobject> It's a good idea to use macro identifiers that
+                are distinguishable. For instance, in this document, macro identifiers
+                have two leading and trailing underscores (e.g. <literal>
 <!--quickbook-escape-prefix-->__spirit__<!--quickbook-escape-postfix-->
-          </literal>). The reason is to avoid unwanted macro replacement.
-        </para>
+                </literal>). The reason is to avoid unwanted macro replacement.</entry>
+              </row>
+            </tbody>
+          </tgroup>
+        </informaltable>
         <para>
           Links (URLS) and images are good candidates for macros. <emphasis role="bold">1</emphasis>)
           They tend to change a lot. It is a good idea to place all links and images
@@ -1416,8 +1442,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.block.predefined_macros">
-        <title><link linkend="quickbook.syntax.block.predefined_macros">Predefined
-        Macros</link></title>
+        <title>Predefined Macros</title>
         <para>
           Quickbook has some predefined macros that you can already use.
         </para>
@@ -1452,8 +1477,7 @@
         </informaltable>
       </section>
       <section id="quickbook.syntax.block.blurbs">
-        <title><link linkend="quickbook.syntax.block.blurbs">Blurbs</link></title>
-        
+        <title>Blurbs</title> 
 <programlisting><!--quickbook-escape-prefix-->[blurb :-) [*An eye catching advertisement or note...]\n\n
     __spirit__ is an object-oriented recursive-descent parser generator framework
     implemented using template meta-programming techniques. Expression templates
@@ -1464,22 +1488,28 @@
         <para>
           will generate this:
         </para>
-        <para role="blurb">
-          <inlinemediaobject><imageobject><imagedata fileref="images/smiley.png"></imagedata></imageobject>
-          <textobject>
-            <phrase>smiley</phrase>
-          </textobject>
-          </inlinemediaobject>&nbsp;<emphasis role="bold">An eye catching advertisement
-          or note...</emphasis><sbr/> <sbr/> <ulink url="http://spirit.sourceforge.net">Spirit</ulink>
-          is an object-oriented recursive-descent parser generator framework implemented
-          using template meta-programming techniques. Expression templates allow
-          us to approximate the syntax of Extended Backus-Normal Form (EBNF) completely
-          in C++.
-        </para>
+        <informaltable frame="all">
+          <?dbhtml table-width="74%" ?>
+          <tgroup cols="1">
+            <tbody>
+              <row>
+                <entry role="blurb"> <inlinemediaobject><imageobject><imagedata fileref="images/smiley.png"></imagedata></imageobject>
+                <textobject>
+                  <phrase>smiley</phrase>
+                </textobject>
+                </inlinemediaobject>&nbsp;<emphasis role="bold">An eye catching advertisement
+                or note...</emphasis><sbr/> <sbr/> <ulink url="http://spirit.sourceforge.net">Spirit</ulink>
+                is an object-oriented recursive-descent parser generator framework
+                implemented using template meta-programming techniques. Expression
+                templates allow us to approximate the syntax of Extended Backus-Normal
+                Form (EBNF) completely in C++. </entry>
+              </row>
+            </tbody>
+          </tgroup>
+        </informaltable>
       </section>
       <section id="quickbook.syntax.block.tables">
-        <title><link linkend="quickbook.syntax.block.tables">Tables</link></title>
-        
+        <title>Tables</title> 
 <programlisting><!--quickbook-escape-prefix-->[table A Simple Table
     [[Heading 1] [Heading 2] [Heading 3]]
     [[R0-C0]     [R0-C1]     [R0-C2]]
@@ -1614,8 +1644,7 @@
         </informaltable>
       </section>
       <section id="quickbook.syntax.block.variable_lists">
-        <title><link linkend="quickbook.syntax.block.variable_lists">Variable Lists</link></title>
-        
+        <title>Variable Lists</title> 
 <programlisting><!--quickbook-escape-prefix-->[variablelist A Variable List
     [[term 1] [The definition of term 1]]
     [[term 2] [The definition of term 2]]
@@ -1648,7 +1677,7 @@
         </para>
       </section>
       <section id="quickbook.syntax.block.include">
-        <title><link linkend="quickbook.syntax.block.include">Include</link></title>
+        <title>Include</title>
         <para>
           You can include one QuickBook file from another. The syntax is simply:
         </para>
@@ -1691,7 +1720,7 @@
     </section>
   </section>
   <section id="quickbook.ref">
-    <title><link linkend="quickbook.ref"> Quick Reference</link></title>
+    <title> Quick Reference</title>
     <informaltable frame="all">
       <bridgehead renderas="sect4">
         <phrase role="table-title">Syntax Compendium</phrase>

Modified: boost/trunk/tools/quickbook/test/quickbook-manual.quickbook
===================================================================
--- boost/trunk/tools/quickbook/test/quickbook-manual.quickbook	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/test/quickbook-manual.quickbook	2007-02-16 16:48:35 UTC (rev 14035)
@@ -297,7 +297,7 @@
 
 [blurb __note__
 Note that we simply enclose the code with the tick: [^'''"`"'''], not the
-single quote: `"'"`. Note too that [^'''`some code`'''] is prefered over
+single quote: `"'"`. Note too that [^'''`some code`'''] is preferred over
 [^'''[^some code]'''].
 ]
 

Deleted: boost/trunk/tools/quickbook/test/templates.gold
===================================================================
--- boost/trunk/tools/quickbook/test/templates.gold	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/test/templates.gold	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,46 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN" "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
-<article id="templates" name="Templates" dirname="templates" last-revision="DEBUG MODE Date: 2000/12/20 12:00:00 $"
- xmlns:xi="http://www.w3.org/2001/XInclude">
-  <articleinfo>
-  </articleinfo>
-  <title>Templates</title>
-  <section id="templates.templates">
-    <title><link linkend="templates.templates">Templates</link></title>
-    <para>
-      foo baz
-    </para>
-    <para>
-      <para>
-        foo baz
-      </para>
-    </para>
-    <para>
-      <para>
-        This is a complete paragraph. kalamazoo kalamazoo kalamazoo kalamazoo kalamazoo
-        kalamazoo kalamazoo kalamazoo kalamazoo.... blah blah blah......
-      </para>
-    </para>
-    <para>
-      <para>
-        This is a complete paragraph. madagascar madagascar madagascar madagascar
-        madagascar madagascar madagascar madagascar madagascar.... blah blah blah......
-      </para>
-    </para>
-    <para>
-      zoom peanut zoom
-    </para>
-    <para>
-      exactly xanadu
-    </para>
-    <para>
-      
-<programlisting>
-<phrase role="keyword">int</phrase>&nbsp;<phrase role="identifier">main</phrase><phrase role="special">()</phrase>
-<phrase role="special">{</phrase>
-    <phrase role="identifier">std</phrase><phrase role="special">::</phrase><phrase role="identifier">cout</phrase>&nbsp;<phrase role="special">&lt;&lt;</phrase> &quot;Hello, World&quot; <phrase role="special">&lt;&lt;</phrase>&nbsp;<phrase role="identifier">std</phrase><phrase role="special">::</phrase><phrase role="identifier">endl</phrase><phrase role="special">;</phrase>
-<phrase role="special">}</phrase>
-</programlisting>
-    </para>
-  </section>
-</article>

Deleted: boost/trunk/tools/quickbook/test/templates.quickbook
===================================================================
--- boost/trunk/tools/quickbook/test/templates.quickbook	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/quickbook/test/templates.quickbook	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,48 +0,0 @@
-[article Templates
-    [quickbook 1.3]
-]
-
-[section Templates]
-
-[template foo1(bar) foo bar]
-
-foo1(baz)
-
-[template foo2(bar) 
-foo bar
-]
-
-foo2(baz)
-
-[template foo3(bar)
-This is a complete paragraph. bar bar bar bar bar
-bar bar bar bar.... blah blah blah......
-]
-
-foo3(kalamazoo)
-
-[template foo4(bar)
-foo3(bar)
-]
-
-foo3(madagascar)
-
-[template foo4(x) zoom x]
-[template foo5(x) x zoom]
-
-foo5(foo4(peanut))
-
-[template kinda_weird(x, y) x y]
-
-kinda_weird(exactly, xanadu)
-
-[template code(x)
-    int main()
-    {
-        std::cout << x << std::endl;
-    }
-]
-
-code("Hello\, World")
-
-[endsect]

Deleted: boost/trunk/tools/regression/build/Jamfile
===================================================================
--- boost/trunk/tools/regression/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,35 +0,0 @@
-# Regression test status reporting tools build Jamfile
-
-subproject tools/regression/build ;
-
-exe process_jam_log
-        :
-        ../process_jam_log.cpp ../detail/tiny_xml.cpp
-        <lib>../../../libs/filesystem/build/boost_filesystem
-        :
-        <sysinclude>$(BOOST_ROOT)
-        <define>BOOST_ALL_NO_LIB=1
-        :
-        release
-        ;
-
-exe compiler_status
-        :
-        ../compiler_status.cpp ../detail/tiny_xml.cpp
-        <lib>../../../libs/filesystem/build/boost_filesystem
-        :
-        <sysinclude>$(BOOST_ROOT)
-        <define>BOOST_ALL_NO_LIB=1
-        :
-        release
-        ;
-
-stage run
-    :
-        <exe>process_jam_log
-        <exe>compiler_status
-    :
-    :
-        release
-        <suppress>true
-    ;

Modified: boost/trunk/tools/regression/build/vcide/process_jam_log.vcproj
===================================================================
--- boost/trunk/tools/regression/build/vcide/process_jam_log.vcproj	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/build/vcide/process_jam_log.vcproj	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,65 +1,68 @@
-<?xml version="1.0" encoding="windows-1251"?>
-<VisualStudioProject
-	ProjectType="Visual C++"
-	Version="7.10"
-	Name="process_jam_log"
-	ProjectGUID="{9A751791-929F-496A-8DE7-B61020619BFA}"
-	Keyword="MakeFileProj">
-	<Platforms>
-		<Platform
-			Name="Win32"/>
-	</Platforms>
-	<Configurations>
-		<Configuration
-			Name="Debug|Win32"
-			OutputDirectory="Debug"
-			IntermediateDirectory="Debug"
-			ConfigurationType="0">
-			<Tool
-				Name="VCNMakeTool"
+<?xml version="1.0" encoding="windows-1251"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="7.10"
+	Name="process_jam_log"
+	ProjectGUID="{9A751791-929F-496A-8DE7-B61020619BFA}"
+	Keyword="MakeFileProj">
+	<Platforms>
+		<Platform
+			Name="Win32"/>
+	</Platforms>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="Debug"
+			IntermediateDirectory="Debug"
+			ConfigurationType="0">
+			<Tool
+				Name="VCNMakeTool"
 				BuildCommandLine="cd ..\..\..\..\tools\regression\build
-..\..\build\jam_src\bin.ntx86\bjam.exe -sBUILD=debug
-"
+..\..\jam\src\bin.ntx86\bjam.exe variant=debug
+"
 				ReBuildCommandLine="cd ..\..\..\..\tools\regression\build
-..\..\build\jam_src\bin.ntx86\bjam.exe -a -sBUILD=debug
+..\..\jam\src\bin.ntx86\bjam.exe -a variant=debug
 
-"
-				Output="process_jam_log.exe"/>
-		</Configuration>
-		<Configuration
-			Name="Release|Win32"
-			OutputDirectory="Release"
-			IntermediateDirectory="Release"
-			ConfigurationType="0">
-			<Tool
-				Name="VCNMakeTool"
-				BuildCommandLine="cd C:\users\misha\Stuff\boost\boost\tools\regression\build"
-				ReBuildCommandLine="cd C:\users\misha\Stuff\boost\boost\tools\regression\build"
-				Output="process_jam_log.exe"/>
-		</Configuration>
-	</Configurations>
-	<References>
-	</References>
-	<Files>
-		<Filter
-			Name="Source Files"
-			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
-			UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}">
-		</Filter>
-		<Filter
-			Name="Header Files"
-			Filter="h;hpp;hxx;hm;inl;inc;xsd"
-			UniqueIdentifier="{93995380-89BD-4b04-88EB-625FBE52EBFB}">
-		</Filter>
-		<Filter
-			Name="Resource Files"
-			Filter="rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx"
-			UniqueIdentifier="{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}">
-		</Filter>
-		<File
-			RelativePath=".\readme.txt">
-		</File>
-	</Files>
-	<Globals>
-	</Globals>
-</VisualStudioProject>
+"
+				Output="process_jam_log.exe"/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="Release"
+			IntermediateDirectory="Release"
+			ConfigurationType="0">
+			<Tool
+				Name="VCNMakeTool"
+				BuildCommandLine="cd C:\users\misha\Stuff\boost\boost\tools\regression\build"
+				ReBuildCommandLine="cd C:\users\misha\Stuff\boost\boost\tools\regression\build"
+				Output="process_jam_log.exe"/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
+			UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}">
+			<File
+				RelativePath="..\..\process_jam_log.cpp">
+			</File>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl;inc;xsd"
+			UniqueIdentifier="{93995380-89BD-4b04-88EB-625FBE52EBFB}">
+		</Filter>
+		<Filter
+			Name="Resource Files"
+			Filter="rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx"
+			UniqueIdentifier="{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}">
+		</Filter>
+		<File
+			RelativePath=".\readme.txt">
+		</File>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>

Modified: boost/trunk/tools/regression/compiler_status.cpp
===================================================================
--- boost/trunk/tools/regression/compiler_status.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/compiler_status.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
 //  Software License, Version 1.0. (See accompanying file
 //  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
-//  See http://www.boost.org/tools/regression for documentation.
+//  See http://www.boost.org/tools/regression/ for documentation.
 
 /*******************************************************************************
 
@@ -84,8 +84,9 @@
   const string empty_string;
 
   // prefix for library and test hyperlink prefix
-  string url_prefix_dir_view( "http://cvs.sourceforge.net/viewcvs.py/boost/boost" );
-  string url_prefix_checkout_view( "http://cvs.sourceforge.net/viewcvs.py/*checkout*/boost/boost" );
+  string cvs_root ( "http://boost.cvs.sourceforge.net/" );
+  string url_prefix_dir_view( cvs_root + "boost/boost" );
+  string url_prefix_checkout_view( cvs_root + "*checkout*/boost/boost" );
   string url_suffix_text_view( "?view=markup&rev=HEAD" );
 
 //  build notes_bookmarks from notes HTML  -----------------------------------//

Modified: boost/trunk/tools/regression/index.htm
===================================================================
--- boost/trunk/tools/regression/index.htm	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/index.htm	2007-02-16 16:48:35 UTC (rev 14035)
@@ -30,7 +30,7 @@
     <li><a href="compiler_status.cpp">compiler_status.cpp</a> -
         Generates HTML status tables from test_log.xml and other
         files.</li>
-    <li><a href="build/Jamfile">Jamfile</a> - Builds
+    <li><a href="build/Jamfile.v2">Jamfile.v2</a> - Builds
         process_jam_log and compiler_status executables.</li>
 </ul>
 

Modified: boost/trunk/tools/regression/process_jam_log.cpp
===================================================================
--- boost/trunk/tools/regression/process_jam_log.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/process_jam_log.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -89,6 +89,33 @@
       if ( *itr == '\\' || *itr == '!' ) *itr = '/';
   }
 
+//  trim_left ----------------------------------------------------------------//
+
+  std::string trim_left( std::string const& s )
+  {
+    std::string::size_type const pos( s.find_first_not_of(' ') );
+    return pos != std::string::npos
+        ? s.substr( pos, s.size() - pos + 1 )
+        : ""
+        ;
+  }
+  
+
+//  split --------------------------------------------------------------------//
+
+  std::vector<std::string> split( std::string const& s )
+  {
+    std::string::size_type const pos( s.find_first_of(' ') );
+    std::vector<std::string> result( 1, s.substr( 0, pos ) );
+    if ( pos == std::string::npos )
+        return result;
+
+    std::vector<std::string> const rest( split( trim_left( s.substr( pos, s.size() - pos + 1 ) ) ) );
+    result.insert( result.end(), rest.begin(), rest.end() );    
+    return result;
+  }
+
+
 //  extract a target directory path from a jam target string  ----------------//
 //  s may be relative to the initial_path:
 //    ..\..\..\libs\foo\build\bin\libfoo.lib\vc7\debug\runtime-link-dynamic\boo.obj
@@ -102,11 +129,11 @@
     string temp( s );
     convert_path_separators( temp );
     temp.erase( temp.find_last_of( "/" ) ); // remove leaf
-    string::size_type pos = temp.find_last_of( " " ); // remove leading spaces
-    if ( pos != string::npos ) temp.erase( 0, pos+1 );
+    temp = split( trim_left( temp ) ).back();
     if ( temp[0] == '.' ) temp.erase( 0, temp.find_first_not_of( "./" ) ); 
     else temp.erase( 0, locate_root.string().size()+1 );
-//std::cout << "\"" << s << "\", \"" << temp << "\"" << std::endl;
+    if ( echo )
+        std::cout << "\ttarget_directory( \"" << s << "\") -> \"" << temp << "\"" << std::endl;
     return temp;
   }
 
@@ -124,6 +151,7 @@
   string toolset( const string & s )
   {
     string::size_type pos = target_name_end( s );
+    if ( pos == string::npos ) pos = s.find( "build/" );
     if ( pos == string::npos ) return "";
     pos = s.find( "/", pos ) + 1;
     return s.substr( pos, s.find( "/", pos ) - pos );
@@ -215,6 +243,8 @@
         // We need path from root, not from 'status' dir.
         if (dir.find("../") == 0)
           dir.erase(0,3);
+        else // dir is always relative to the boost directory tree
+          dir.erase( 0, locate_root.string().size()+1 );
     }
     else
     {
@@ -229,7 +259,17 @@
         // old style build path, integrated build tree
         start_pos = dir.rfind( '!' );
         convert_path_separators( dir );
-        dir.insert( dir.find( '/', start_pos + 1), "/bin" );
+        string::size_type path_sep_pos = dir.find( '/', start_pos + 1 );
+        if ( path_sep_pos != string::npos )
+           dir.insert( path_sep_pos, "/bin" );
+        else
+        {
+          // see http://article.gmane.org/gmane.comp.lib.boost.devel/146688;
+          // the following code assumes that: a) 'dir' is not empty,
+          // b) 'end_pos != string::npos' and c) 'msg' always ends with '...'
+          if ( dir[dir.size() - 1] == '@' )
+            dir += "/" + msg.substr( end_pos + 1, msg.size() - end_pos - 1 - 3 );
+        }
       }
     }
     return end_pos;
@@ -298,6 +338,7 @@
           || target_directory.find( ".dll/" ) != string::npos 
           || target_directory.find( ".so/" ) != string::npos 
           || target_directory.find( ".dylib/" ) != string::npos 
+          || target_directory.find( "/build/" ) != string::npos 
           )
         {
           info.type = "lib";
@@ -396,12 +437,15 @@
                       const string & toolset,
                       const string & prior_content )
     {
+      assert( !target_directory.empty() );
+
       if ( !m_action_name.empty() ) stop_message( prior_content );
       m_action_name = action_name;
       m_target_directory = target_directory;
       m_test_name = test_name;
       m_toolset = toolset;
       m_note = false;
+
       if ( m_previous_target_directory != target_directory )
       {
         m_previous_target_directory = target_directory;
@@ -455,7 +499,10 @@
           tl.remove_action( "run" );
           if ( result == "fail" ) m_compile_failed = true;
         }
-        else if ( action_name == "link" ) { tl.remove_action( "run" ); }
+        else if ( action_name == "link" )
+        {
+          tl.remove_action( "run" );
+        }
 
         // dependency removal won't work right with random names, so assert
         else { assert( action_name == "run" ); }
@@ -504,7 +551,8 @@
     return 1;
   }
 
-
+  boost_root.normalize();
+  
   if ( argc > 1 && std::strcmp( argv[1], "--echo" ) == 0 )
   {
     echo = true;
@@ -528,6 +576,9 @@
   if (argc > 1)
   {
       locate_root = fs::path( argv[1], fs::native );
+      if ( !locate_root.is_complete() )
+        locate_root = ( fs::initial_path() / locate_root ).normalize();
+      
       --argc; ++argv;
   } 
   else
@@ -560,12 +611,26 @@
   //   * Calls stop_message() to stop capturing lines.
   //   * Capture lines if line capture on.
 
+  int line_num = 0;
   while ( std::getline( *input, line ) )
   {
-    if ( echo ) std::cout << line << "\n";
+    ++line_num;
+    
+    std::vector<std::string> const line_parts( split( line ) );
+    std::string const line_start( line_parts[0] != "...failed" 
+        ? line_parts[0]
+        : line_parts[0] + " " + line_parts[1]
+        );
+    
+    if ( echo )
+    {
+      std::cout
+        << "line " << line_num << ": " << line << "\n"
+        << "\tline_start: " << line_start << "\n";        
+    }
 
     // create map of test-name to test-info
-    if ( line.find( "boost-test(" ) == 0 )
+    if ( line_start.find( "boost-test(" ) == 0 )
     {
       string::size_type pos = line.find( '"' );
       string test_name( line.substr( pos+1, line.find( '"', pos+1)-pos-1 ) );
@@ -598,30 +663,38 @@
 
     // these actions represent both the start of a new action
     // and the end of a failed action
-    else if ( line.find( "C++-action " ) != string::npos
-      || line.find( "vc-C++ " ) != string::npos
-      || line.find( "C-action " ) != string::npos
-      || line.find( "Cc-action " ) != string::npos
-      || line.find( "vc-Cc " ) != string::npos
-      || line.find( "Link-action " ) != string::npos
-      // archive can fail too
-      || line.find( "Archive-action " ) != string::npos
-      || line.find( "vc-Link " ) != string::npos 
-      || line.find( ".compile.") != string::npos
-      || ( line.find( ".link") != string::npos &&
+    else if ( line_start.find( "C++-action" ) != string::npos
+      || line_start.find( "vc-C++" ) != string::npos
+      || line_start.find( "C-action" ) != string::npos
+      || line_start.find( "Cc-action" ) != string::npos
+      || line_start.find( "vc-Cc" ) != string::npos
+      || line_start.find( ".compile.") != string::npos
+      || line_start.find( "compile-") != string::npos
+      || line_start.find( "-compile") != string::npos
+      || line_start.find( "Link-action" ) != string::npos
+      || line_start.find( "vc-Link" ) != string::npos 
+      || line_start.find( "Archive-action" ) != string::npos
+      || line_start.find( ".archive") != string::npos
+      || ( line_start.find( ".link") != string::npos &&
            // .linkonce is present in gcc linker messages about
            // unresolved symbols. We don't have to parse those
-           line.find( ".linkonce" ) == string::npos )
+           line_start.find( ".linkonce" ) == string::npos )
     )
     {
-      string action( ( line.find( "Link-action " ) != string::npos
-        || line.find( "vc-Link " ) != string::npos 
-        || line.find( ".link") != string::npos
-        || line.find( "Archive-action ") != string::npos )
-        ? "link" : "compile" );
-      if ( line.find( "...failed " ) != string::npos )
+      string action( ( line_start.find( "Link-action" ) != string::npos
+            || line_start.find( "vc-Link" ) != string::npos 
+            || line_start.find( "Archive-action" ) != string::npos
+            || line_start.find( ".archive") != string::npos
+            || line_start.find( ".link") != string::npos
+            )
+          ? "link" : "compile"
+        );
+      
+      if ( line_start.find( "...failed " ) != string::npos )
+      {
         mgr.stop_message( action, target_directory( line ),
           "fail", timestamp(), content );
+      }
       else
       {
         string target_dir( target_directory( line ) );
@@ -633,18 +706,18 @@
     }
 
     // these actions are only used to stop the previous action
-    else if ( line.find( "-Archive" ) != string::npos
-      || line.find( "MkDir" ) == 0 )
+    else if ( line_start.find( "-Archive" ) != string::npos
+      || line_start.find( "MkDir" ) == 0 )
     {
       mgr.stop_message( content );
       content.clear();
       capture_lines = false;
     }
 
-    else if ( line.find( "execute-test" ) != string::npos 
-             || line.find( "capture-output" ) != string::npos )
+    else if ( line_start.find( "execute-test" ) != string::npos 
+             || line_start.find( "capture-output" ) != string::npos )
     {
-      if ( line.find( "...failed " ) != string::npos )
+      if ( line_start.find( "...failed " ) != string::npos )
       {
         mgr.stop_message( "run", target_directory( line ),
           "fail", timestamp(), content );
@@ -676,7 +749,9 @@
     }
 
     // bjam indicates some prior dependency failed by a "...skipped" message
-    else if ( line.find( "...skipped <" ) != string::npos && line.find( "<directory-grist>" ) == string::npos)
+    else if ( line_start.find( "...skipped" ) != string::npos 
+        && line.find( "<directory-grist>" ) == string::npos
+        )
     {
       mgr.stop_message( content );
       content.clear();
@@ -703,9 +778,9 @@
 
     }
 
-    else if ( line.find( "**passed**" ) != string::npos
-      || line.find( "failed-test-file " ) != string::npos
-      || line.find( "command-file-dump" ) != string::npos )
+    else if ( line_start.find( "**passed**" ) != string::npos
+      || line_start.find( "failed-test-file" ) != string::npos
+      || line_start.find( "command-file-dump" ) != string::npos )
     {
       mgr.stop_message( content );
       content = "\n";

Modified: boost/trunk/tools/regression/run_tests.sh
===================================================================
--- boost/trunk/tools/regression/run_tests.sh	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/run_tests.sh	2007-02-16 16:48:35 UTC (rev 14035)
@@ -46,6 +46,12 @@
 # The content of this file will be embedded in the status pages being produced.
 #
 comment_path="$boost_root/../regression_comment.html"
+#
+# "test_dir" is the relative path to the directory to run the tests in,
+# defaults to "status" and runs all the tests, but could be a sub-directory
+# for example "libs/regex/test" to run the regex tests alone.
+#
+test_dir="status"
 
 
 ### DEFAULTS ARE OK FOR THESE.
@@ -63,15 +69,15 @@
 # The location of the binary for running bjam. The default should work
 # under most circumstances.
 #
-bjam="$boost_root/tools/build/jam_src/bin/bjam$exe_suffix"
+bjam="$boost_root/tools/jam/src/bin/bjam$exe_suffix"
 
 #
 # "process_jam_log", and "compiler_status" paths to built helper programs:
 # The location of the executables of the regression help programs. These
 # are built locally so the default should work in most situations.
 #
-process_jam_log="$boost_root/tools/regression/build/run/process_jam_log$exe_suffix"
-compiler_status="$boost_root/tools/regression/build/run/compiler_status$exe_suffix"
+process_jam_log="$boost_root/dist/bin/process_jam_log$exe_suffix"
+compiler_status="$boost_root/dist/bin/compiler_status$exe_suffix"
 
 #
 # "boost_build_path" can point to additional locations to find toolset files.
@@ -121,7 +127,7 @@
 # rebuild bjam if required:
 #
 echo building bjam:
-cd "$boost_root/tools/build/jam_src" && \
+cd "$boost_root/tools/jam/src" && \
 LOCATE_TARGET=bin sh ./build.sh
 if test $? != 0 ; then
     echo "bjam build failed."
@@ -134,7 +140,7 @@
 #
 echo building regression test helper programs:
 cd "$boost_root/tools/regression/build" && \
-"$bjam" -sTOOLS=$toolset -sBUILD=release run
+"$bjam" $toolset release
 if test $? != 0 ; then
     echo "helper program build failed."
     exit 256
@@ -151,15 +157,15 @@
 # run the regression tests:
 #
 echo running the $tool regression tests:
-cd "$boost_root/status"
-"$bjam" -sTOOLS=$tool --dump-tests test 2>&1 | tee regress.log
+cd "$boost_root/$test_dir"
+"$bjam" $tool --dump-tests 2>&1 | tee regress.log
 
 #
 # STEP 4:
 # post process the results:
 #
 echo processing the regression test results for $tool:
-cat regress.log | "$process_jam_log"
+cat regress.log | "$process_jam_log" --v2
 if test $? != 0 ; then
     echo "Failed regression log post processing."
     exit 256
@@ -173,7 +179,7 @@
 #
 uname=`uname`
 echo generating html tables:
-"$compiler_status" --comment "$comment_path" "$boost_root" cs-$uname.html cs-$uname-links.html
+"$compiler_status" --v2  --comment "$comment_path" "$boost_root" cs-$uname.html cs-$uname-links.html
 if test $? != 0 ; then
     echo "Failed HTML result table generation."
     exit 256
@@ -181,3 +187,5 @@
 
 echo "done!"
 
+
+

Deleted: boost/trunk/tools/regression/test/Jamfile
===================================================================
--- boost/trunk/tools/regression/test/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/test/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,46 +0,0 @@
-# Boost Regression Reporting test Jamfile
-
-#  (C) Copyright Beman Dawes 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
-
-subproject libs/regression/test ;
-
-# bring in rules for testing
-import testing ;
-
-# Make tests run by default.
-DEPENDS all : test ;
-
-{
-    # look in BOOST_ROOT for sources first, just in this Jamfile
-    local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
-    
-
-#  Test naming convention: the portion of the name before the tilde ("~")
-#  identifies the bjam test type. The portion after the tilde
-#  identifies the correct result to be reported by compiler_status.
-
-    compile compile~fail.cpp ;
-    compile compile~pass.cpp ;
-    compile compile~warn.cpp ;
-    
-    compile-fail compile-fail~fail.cpp ;
-    compile-fail compile-fail~pass.cpp ;
-    
-    run run~compile-fail.cpp ;
-    run run~fail.cpp ;
-    run run~fail-note.cpp ;
-    run run~fail-warn.cpp ;
-    run run~note.cpp ;
-    run run~pass.cpp ;
-    run run~warn.cpp ;
-    run run~warn-note.cpp ;
-    
-    run-fail run-fail~compile-fail.cpp ;
-    run-fail run-fail~fail.cpp ;
-    run-fail run-fail~fail-warn.cpp ;
-    run-fail run-fail~pass.cpp ;
-    run-fail run-fail~warn.cpp ;
-}

Copied: boost/trunk/tools/regression/test/test-cases (from rev 14034, boost/branches/upstream/current/tools/regression/test/test-cases)

Modified: boost/trunk/tools/regression/test/test.py
===================================================================
--- boost/trunk/tools/regression/test/test.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/test/test.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -51,7 +51,7 @@
 def find_process_jam_log():
     root = "../../../"
     
-    for root, dirs, files in os.walk( os.path.join( root, "bin" ), topdown=False ):
+    for root, dirs, files in os.walk( os.path.join( root, "bin.v2" ), topdown=False ):
         if "process_jam_log.exe" in files:
             return os.path.abspath( os.path.normpath( os.path.join( root, "process_jam_log.exe" ) ) )
         if "process_jam_log" in files:
@@ -61,9 +61,11 @@
 def process_jam_log( executable, file, locate_root, results_dir ):
     args = []
     args.append( executable )
-    args.append( "--results-dir" )
-    args.append( results_dir )
+    # args.append( '--echo' )
+    args.append( '--create-directories' )
+    args.append( '--v2' )
     args.append( locate_root )
+    args.append( '<' )
     args.append( file )
 
     cmd = " ".join( args )
@@ -80,50 +82,98 @@
 
 def remove_timestamps( log_lines ):
     return [ re.sub( "timestamp=\"[^\"]+\"", "timestamp=\"\"", x ) for x in log_lines ]    
-    
+
+def determine_locate_root( bjam_log ):
+    locate_root = None
+    f = open( 'bjam.log' )
+    try:
+        locate_root_re = re.compile( r'locate-root\s+"(.*)"' )
+        for l in f.readlines():
+            m = locate_root_re.match( l )
+            if m:
+                locate_root = m.group(1)
+                break
+    finally:
+        f.close()
+    return locate_root
+
+def read_file( path ):    
+    f = open( path )
+    try:
+        return f.read()
+    finally:
+        f.close()
+
+def read_file_lines( path ):    
+    f = open( path )
+    try:
+        return f.readlines()
+    finally:
+        f.close()
+
+def write_file( path, content ):    
+    f = open( path, 'w' )
+    try:
+        return f.write( content )
+    finally:
+        f.close()
+
+def write_file_lines( path, content ):    
+    f = open( path, 'w' )
+    try:
+        return f.writelines( content )
+    finally:
+        f.close()
+
+        
 def run_test_cases( test_cases ):
     process_jam_log_executable = find_process_jam_log()
+    print 'Found process_jam_log: %s' % process_jam_log_executable
+    initial_dir = os.getcwd()
     for test_case in test_cases:
+        os.chdir( initial_dir )
         print 'Running test case "%s"' % test_case
         os.chdir( test_case )
         if os.path.exists( "expected" ):
+            locate_root = determine_locate_root( 'bjam.log' )
+            print 'locate_root: %s' % locate_root
+            
             actual_results_dir = os.path.join( test_case, "actual" )
-            f = open( "locate_root.txt" ) 
-            try:
-                locate_root = f.read().splitlines()[0]
-            finally:
-                f.close()
-
             clean_dir( "actual" )
             os.chdir( "actual" )
-            process_jam_log( executable = process_jam_log_executable
-                             , results_dir = "."
-                             , locate_root = locate_root
-                             , file="..\\bjam.log" )
-            os.chdir( ".." )
-
-            actual_content = list_recursively( "actual" )
+            root = os.getcwd()
+            i = 0
+            while 1:
+                if i == 0:
+                    bjam_log_file = 'bjam.log'
+                else:
+                    bjam_log_file = 'bjam.log.%0d' % i
+                i += 1
+                print 'Looking for %s' % bjam_log_file
+                if not os.path.exists( os.path.join( '..', bjam_log_file ) ):
+                    print '    does not exists'
+                    break
+                print '    found'
+                write_file_lines(bjam_log_file.replace( 'bjam', 'bjam_' ), 
+                                 [ x.replace( locate_root, root  ) for x in read_file_lines( os.path.join( '..', bjam_log_file ) ) ]  )
+                
+                process_jam_log( executable = process_jam_log_executable
+                                 , results_dir = "."
+                                 , locate_root = root 
+                                 , file=bjam_log_file.replace( 'bjam', 'bjam_' ) )
+            
+            actual_content = list_recursively( "." )
             actual_content.sort()
-
-            expected_content = list_recursively( "expected" )
-            expected_content.sort()
-
-            structure_diffs = list( difflib.unified_diff( actual_content, expected_content ) )
-            if ( len( structure_diffs ) > 0 ):
-                raise "Actual results are different from expected \n %s" % "\n".join( structure_diffs )
-            else:
-                for i in range( 0, len( actual_content ) ):
-                    expected_file = os.path.join( "expected", expected_content[ i ] )
-                    actual_file = os.path.join( "actual", actual_content[ i ] )
-                    
-                    print "Comparing %s to %s" % ( expected_file, actual_file )
-                    if ( not os.path.isdir( expected_file ) and not os.path.isdir( actual_file ) ):
-                        expected = remove_timestamps( read_file( expected_file ).splitlines() )
-                        actual = remove_timestamps( read_file( actual_file ).splitlines() )
-                        content_diff = list( difflib.unified_diff( expected, actual ) )
-                        if ( len( content_diff ) > 0 ):
-                            raise "difference \n%s" % "\n".join( content_diff )
-                                         
+            result_xml = []
+            for test_log in [ x for x in actual_content if os.path.splitext( x )[1] == '.xml' ]:
+                print 'reading %s' % test_log
+                result = [ re.sub( r'timestamp="(.*)"', 'timestamp="xxx"', x ) for x in read_file_lines( test_log ) ]
+                result_xml.extend( result )
+                
+            write_file_lines( 'results.xml', result_xml )
+            os.chdir( '..' )
+            assert read_file( 'expected/results.xml' ) == read_file( 'actual/results.xml' )
+            os.chdir( '..' )
         else:
             raise '   Test case "%s" doesn\'t contain the expected results directory ("expected" )' % ( test_case )
         

Modified: boost/trunk/tools/regression/xsl_reports/boost_wide_report.py
===================================================================
--- boost/trunk/tools/regression/xsl_reports/boost_wide_report.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/xsl_reports/boost_wide_report.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -9,6 +9,7 @@
 import codecs
 import xml.sax.handler
 import glob
+import re
 import os.path
 import os
 import string
@@ -346,6 +347,7 @@
     f.cwd( site_path )
 
     source_content = list_ftp( f )
+    source_content = [ x for x in source_content if re.match( r'.+[.](?<!log[.])zip', x.name ) and x.name.lower() != 'boostbook.zip' ]
     destination_content = list_dir( destination )
     d = diff( source_content, destination_content )
 

Copied: boost/trunk/tools/regression/xsl_reports/boostbook_report.py (from rev 14034, boost/branches/upstream/current/tools/regression/xsl_reports/boostbook_report.py)

Copied: boost/trunk/tools/regression/xsl_reports/db (from rev 14034, boost/branches/upstream/current/tools/regression/xsl_reports/db)

Modified: boost/trunk/tools/regression/xsl_reports/make_snapshot.py
===================================================================
--- boost/trunk/tools/regression/xsl_reports/make_snapshot.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/xsl_reports/make_snapshot.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -38,7 +38,7 @@
 
 
 def cvs_command( user, command ):
-    cmd = 'cvs -d:ext:%(user)s at boost.cvs.sourceforge.net:/cvsroot/boost -z9 %(command)s' \
+    cmd = 'cvs -d:ext:%(user)s at cvs.sourceforge.net:/cvsroot/boost -z9 %(command)s' \
             % { 'user': user, 'command': command }
     
     utils.log( 'Executing CVS command "%s"' % cmd )

Modified: boost/trunk/tools/regression/xsl_reports/runner/collect_and_upload_logs.py
===================================================================
--- boost/trunk/tools/regression/xsl_reports/runner/collect_and_upload_logs.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/xsl_reports/runner/collect_and_upload_logs.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,5 +1,5 @@
 
-# Copyright (c) MetaCommunications, Inc. 2003-2004
+# Copyright (c) MetaCommunications, Inc. 2003-2007
 #
 # Distributed under the Boost Software License, Version 1.0. 
 # (See accompanying file LICENSE_1_0.txt or copy at 
@@ -87,13 +87,48 @@
     results_xml.endElement( 'comment' )
 
 
+def compress_file( file_path, archive_path ):
+    utils.log( 'Compressing "%s"...' % file_path )
+
+    try:
+        z = zipfile.ZipFile( archive_path, 'w', zipfile.ZIP_DEFLATED )
+        z.write( file_path, os.path.basename( file_path ) )
+        z.close()
+        utils.log( 'Done writing "%s".'% archive_path )
+    except Exception, msg:
+        utils.log( 'Warning: Compressing falied (%s)' % msg )
+        utils.log( '         Trying to compress using a platform-specific tool...' )
+        try: import zip_cmd
+        except ImportError:
+            script_dir = os.path.dirname( os.path.abspath( sys.argv[0] ) )
+            utils.log( 'Could not find \'zip_cmd\' module in the script directory (%s).' % script_dir )
+            raise Exception( 'Compressing failed!' )
+        else:
+            if os.path.exists( archive_path ):
+                os.unlink( archive_path )
+                utils.log( 'Removing stale "%s".' % archive_path )
+                
+            zip_cmd.main( file_path, archive_path )
+            utils.log( 'Done compressing "%s".' % archive_path )
+
+
+def read_timestamp( file ):
+    if not os.path.exists( file ):
+        result = time.gmtime()
+        utils.log( 'Warning: timestamp file "%s" does not exist'% file )
+        utils.log( 'Using current UTC time (%s)' % result )
+        return result
+
+    return time.gmtime( os.stat( file ).st_mtime )
+
+
 def collect_logs( 
           results_dir
         , runner_id
         , tag
         , platform
         , comment_file
-        , timestamp
+        , timestamp_file
         , user
         , source
         , run_type
@@ -103,14 +138,7 @@
     results_file = os.path.join( results_dir, '%s.xml' % runner_id )
     results_writer = open( results_file, 'w' )
     utils.log( 'Collecting test logs into "%s"...' % results_file )
-    
-    if not os.path.exists( timestamp ):
-        t = time.gmtime()
-        utils.log( 'Warning: timestamp file "%s" does not exist'% timestamp )
-        utils.log( 'Using current UTC time (%s)' % t )
-    else:
-        t = time.gmtime( os.stat( timestamp ).st_mtime )
-    
+        
     results_xml = xml.sax.saxutils.XMLGenerator( results_writer )
     results_xml.startDocument()
     results_xml.startElement( 
@@ -119,7 +147,7 @@
               'tag':        tag
             , 'platform':   platform
             , 'runner':     runner_id
-            , 'timestamp':  time.strftime( '%Y-%m-%dT%H:%M:%SZ', t )
+            , 'timestamp':  time.strftime( '%Y-%m-%dT%H:%M:%SZ', read_timestamp( timestamp_file ) )
             , 'source':     source
             , 'run-type':   run_type
             }
@@ -133,31 +161,12 @@
     results_writer.close()
     utils.log( 'Done writing "%s".' % results_file )
 
-    utils.log( 'Compressing "%s"...' % results_file )
-    archive_path = os.path.join( results_dir,'%s.zip' % runner_id )
+    compress_file(
+          results_file
+        , os.path.join( results_dir,'%s.zip' % runner_id )
+        )
 
-    try:
-        z = zipfile.ZipFile( archive_path, 'w', zipfile.ZIP_DEFLATED )
-        z.write( results_file, os.path.basename( results_file ) )
-        z.close()
-        utils.log( 'Done writing "%s".'% archive_path )
-    except Exception, msg:
-        utils.log( 'Warning: Compressing falied (%s)' % msg )
-        utils.log( '         Trying to compress using a platform-specific tool...' )
-        try: import zip_cmd
-        except ImportError:
-            script_dir = os.path.dirname( os.path.abspath( sys.argv[0] ) )
-            utils.log( 'Could not find \'zip_cmd\' module in the script directory (%s).' % script_dir )
-            raise Exception( 'Compressing failed!' )
-        else:
-            if os.path.exists( archive_path ):
-                os.unlink( archive_path )
-                utils.log( 'Removing stale "%s".' % archive_path )
-                
-            zip_cmd.main( results_file, archive_path )
-            utils.log( 'Done compressing "%s".' % archive_path )
 
-
 def upload_logs(
           results_dir
         , runner_id
@@ -165,25 +174,37 @@
         , user
         , ftp_proxy
         , debug_level
+        , send_bjam_log = False
+        , timestamp_file = None
         , **unused
         ):
 
     logs_archive = os.path.join( results_dir, '%s.zip' % runner_id )
     upload_to_ftp( tag, logs_archive, ftp_proxy, debug_level )
+    if send_bjam_log:
+        bjam_log_path = os.path.join( results_dir, 'bjam.log' )
+        if not timestamp_file:
+            timestamp_file = bjam_log_path
 
+        timestamp = time.strftime( '%Y-%m-%d-%H-%M-%S', read_timestamp( timestamp_file ) )
+        logs_archive = os.path.join( results_dir, '%s.%s.log.zip' % ( runner_id, timestamp ) )
+        compress_file( bjam_log_path, logs_archive )
+        upload_to_ftp( '%s/logs' % tag, logs_archive, ftp_proxy, debug_level )
 
+
 def collect_and_upload_logs( 
           results_dir
         , runner_id
         , tag
         , platform
         , comment_file
-        , timestamp
+        , timestamp_file
         , user
         , source
         , run_type
         , ftp_proxy = None
         , debug_level = 0
+        , send_bjam_log = False
         , **unused
         ):
     
@@ -193,13 +214,22 @@
         , tag
         , platform
         , comment_file
-        , timestamp
+        , timestamp_file
         , user
         , source
         , run_type
         )
     
-    upload_logs( results_dir, runner_id, tag, user, ftp_proxy, debug_level )
+    upload_logs(
+          results_dir
+        , runner_id
+        , tag
+        , user
+        , ftp_proxy
+        , debug_level
+        , send_bjam_log
+        , timestamp_file
+        )
 
 
 def accept_args( args ):
@@ -215,6 +245,7 @@
         , 'user='
         , 'ftp-proxy='
         , 'debug-level='
+        , 'send-bjam-log'
         , 'help'
         ]
     
@@ -226,8 +257,8 @@
         , '--user'          : None
         , '--source'        : 'CVS'
         , '--run-type'      : 'full'
+        , '--ftp-proxy'     : None
         , '--debug-level'   : 0
-        , '--ftp-proxy'     : None
         }
     
     utils.accept_args( args_spec, args, options, usage )
@@ -238,12 +269,13 @@
         , 'tag'             : options[ '--tag' ]
         , 'platform'        : options[ '--platform']
         , 'comment_file'    : options[ '--comment' ]
-        , 'timestamp'       : options[ '--timestamp' ]
+        , 'timestamp_file'  : options[ '--timestamp' ]
         , 'user'            : options[ '--user' ]
         , 'source'          : options[ '--source' ]
         , 'run_type'        : options[ '--run-type' ]
         , 'ftp_proxy'       : options[ '--ftp-proxy' ]
         , 'debug_level'     : int(options[ '--debug-level' ])
+        , 'send_bjam_log'   : options.has_key( '--send-bjam-log' )
         }
 
 
@@ -271,6 +303,8 @@
 \t--source        where Boost sources came from (e.g. "CVS", "tarball",
 \t                "anonymous CVS"; "CVS" by default)
 \t--run-type      "incremental" or "full" ("full" by default)
+\t--send-bjam-log in addition to regular XML results, send in full bjam
+\t                log of the regression run
 \t--ftp-proxy     FTP proxy server (e.g. 'ftpproxy', optional)
 \t--debug-level   debugging level; controls the amount of debugging 
 \t                output printed; 0 by default (no debug output)

Modified: boost/trunk/tools/regression/xsl_reports/runner/instructions.html
===================================================================
--- boost/trunk/tools/regression/xsl_reports/runner/instructions.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/xsl_reports/runner/instructions.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,34 +3,42 @@
 <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.3.10: http://docutils.sourceforge.net/" />
+<meta name="generator" content="Docutils 0.4.1: http://docutils.sourceforge.net/" />
 <title>Running Boost Regression Tests</title>
 <style type="text/css">
 
 /*
 :Author: David Goodger
 :Contact: goodger at users.sourceforge.net
-:date: $Date: 2006/02/27 13:46:51 $
-:version: $Revision: 1.14 $
-:copyright: This stylesheet has been placed in the public domain.
+:Date: $Date: 2007/01/13 15:21:12 $
+:Revision: $Revision: 1.14.2.1 $
+:Copyright: This stylesheet has been placed in the public domain.
 
 Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
 */
 
-body {
-    background-color: #fffff5;
-}
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+  border: 0 }
 
-h2 {
-    text-decoration: underline;
-}
+table.borderless td, table.borderless th {
+  /* Override padding for "table.docutils td" with "! important".
+     The right padding separates the table cells. */
+  padding: 0 0.5em 0 0 ! important }
 
 .first {
-  margin-top: 0 }
+  /* Override more specific margin styles with "! important". */
+  margin-top: 0 ! important }
 
-.last {
-  margin-bottom: 0 }
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
 
+.hidden {
+  display: none }
+
 a.toc-backref {
   text-decoration: none ;
   color: black }
@@ -38,9 +46,14 @@
 blockquote.epigraph {
   margin: 2em 5em ; }
 
-dd {
+dl.docutils dd {
   margin-bottom: 0.5em }
 
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
 div.abstract {
   margin: 2em 5em }
 
@@ -48,12 +61,18 @@
   font-weight: bold ;
   text-align: center }
 
-div.attention, div.caution, div.danger, div.error, div.hint,
-div.important, div.note, div.tip, div.warning, div.admonition {
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
   margin: 2em ;
   border: medium outset ;
   padding: 1em }
 
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
 div.attention p.admonition-title, div.caution p.admonition-title,
 div.danger p.admonition-title, div.error p.admonition-title,
 div.warning p.admonition-title {
@@ -61,12 +80,15 @@
   font-weight: bold ;
   font-family: sans-serif }
 
-div.hint p.admonition-title, div.important p.admonition-title,
-div.note p.admonition-title, div.tip p.admonition-title,
-div.admonition p.admonition-title {
-  font-weight: bold ;
-  font-family: sans-serif }
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
 
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
 div.dedication {
   margin: 2em 5em ;
   text-align: center ;
@@ -77,15 +99,27 @@
   font-style: normal }
 
 div.figure {
-  margin-left: 2em }
+  margin-left: 2em ;
+  margin-right: 2em }
 
 div.footer, div.header {
+  clear: both;
   font-size: smaller }
 
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
 div.sidebar {
   margin-left: 1em ;
   border: medium outset ;
-  padding: 0em 1em ;
+  padding: 1em ;
   background-color: #ffffee ;
   width: 40% ;
   float: right ;
@@ -112,15 +146,25 @@
 div.topic {
   margin: 2em }
 
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
 h1.title {
   text-align: center }
 
 h2.subtitle {
   text-align: center }
 
-hr {
+hr.docutils {
   width: 75% }
 
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
 ol.simple, ul.simple {
   margin-bottom: 1em }
 
@@ -177,10 +221,6 @@
   font-family: serif ;
   font-size: 100% }
 
-pre.line-block {
-  font-family: serif ;
-  font-size: 100% }
-
 pre.literal-block, pre.doctest-block {
   margin-left: 2em ;
   margin-right: 2em ;
@@ -200,44 +240,48 @@
 span.option {
   white-space: nowrap }
 
-span.option-argument {
-  font-style: italic }
-
 span.pre {
   white-space: pre }
 
 span.problematic {
   color: red }
 
-table {
-  margin-top: 0.5em ;
-  margin-bottom: 0.5em }
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
 
 table.citation {
-  border-left: solid thin gray ;
-  padding-left: 0.5ex }
+  border-left: solid 1px gray;
+  margin-left: 1px }
 
 table.docinfo {
   margin: 2em 4em }
 
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
 table.footnote {
-  border-left: solid thin black ;
-  padding-left: 0.5ex }
+  border-left: solid 1px black;
+  margin-left: 1px }
 
-td, th {
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
   padding-left: 0.5em ;
   padding-right: 0.5em ;
   vertical-align: top }
 
-th.docinfo-name, th.field-name {
+table.docutils th.field-name, table.docinfo th.docinfo-name {
   font-weight: bold ;
   text-align: left ;
-  white-space: nowrap }
+  white-space: nowrap ;
+  padding-left: 0 }
 
-h1 tt, h2 tt, h3 tt, h4 tt, h5 tt, h6 tt {
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
   font-size: 100% }
 
-tt {
+tt.docutils {
   background-color: #eeeeee }
 
 ul.auto-toc {
@@ -259,8 +303,8 @@
 <div class="section">
 <h1><a id="installation" name="installation">Installation</a></h1>
 <ul class="simple">
-<li>Download regression driver <tt class="docutils literal"><span class="pre">regression.py</span></tt> from <a class="reference" href="http://cvs.sourceforge.net/viewcvs.py/*checkout*/boost/boost/tools/regression/xsl_reports/runner/regression.py">here</a> (<a class="reference" href="http://tinyurl.com/4fp4g">http://tinyurl.com/4fp4g</a>)
-and put it in the directory where you want all the regression 
+<li>Download regression driver <tt class="docutils literal"><span class="pre">regression.py</span></tt> from <a class="reference" href="http://boost.cvs.sourceforge.net/*checkout*/boost/boost/tools/regression/xsl_reports/runner/regression.py">here</a> (<a class="reference" href="http://tinyurl.com/uufav">http://tinyurl.com/uufav</a>)
+and put it in the directory where you want all the regression
 test files to be placed.</li>
 </ul>
 <ul>
@@ -279,7 +323,7 @@
 <p>To start a regression run, simply run <tt class="docutils literal"><span class="pre">regression.py</span></tt> providing it with the following
 two arguments:</p>
 <ul class="simple">
-<li>runner id (something unique of your choice that will identify your 
+<li>runner id (something unique of your choice that will identify your
 results in the reports <a class="footnote-reference" href="#runnerid1" id="id2" name="id2">[1]</a>, <a class="footnote-reference" href="#runnerid2" id="id3" name="id3">[2]</a>)</li>
 <li>a particular set of toolsets you want to test with <a class="footnote-reference" href="#toolsets" id="id4" name="id4">[3]</a>.</li>
 </ul>
@@ -289,8 +333,8 @@
 </pre>
 <p>If you are interested in seeing all available options, run <tt class="docutils literal"><span class="pre">python</span> <span class="pre">regression.py</span></tt>
 or <tt class="docutils literal"><span class="pre">python</span> <span class="pre">regression.py</span> <span class="pre">--help</span></tt>. See also the <a class="reference" href="#advanced-use">Advanced use</a> section below.</p>
-<p><strong>Note</strong>: If you are behind a firewall/proxy server, everything should still &quot;just work&quot;. 
-In the rare cases when it doesn't, you can explicitly specify the proxy server 
+<p><strong>Note</strong>: If you are behind a firewall/proxy server, everything should still &quot;just work&quot;.
+In the rare cases when it doesn't, you can explicitly specify the proxy server
 parameters through the <tt class="docutils literal"><span class="pre">--proxy</span></tt> option, e.g.:</p>
 <pre class="literal-block">
 python regression.py ... <strong>--proxy=http://www.someproxy.com:3128</strong>
@@ -303,13 +347,13 @@
 <li>Download the most recent tarball from <a class="reference" href="http://www.meta-comm.com/engineering/boost/snapshot/">http://www.meta-comm.com/engineering/boost/snapshot/</a>,
 unpack it in the subdirectory <tt class="docutils literal"><span class="pre">boost</span></tt>.</li>
 <li>Build <tt class="docutils literal"><span class="pre">bjam</span></tt> and <tt class="docutils literal"><span class="pre">process_jam_log</span></tt> if needed. (<tt class="docutils literal"><span class="pre">process_jam_log</span></tt> is an
-utility, which extracts the test results from the log file produced by 
+utility, which extracts the test results from the log file produced by
 Boost.Build).</li>
 <li>Run regression tests, process and collect the results.</li>
 <li>Upload the results to <a class="reference" href="ftp://fx.meta-comm.com/boost-regression">ftp://fx.meta-comm.com/boost-regression</a>.</li>
 </ul>
-<p>The report merger process running continuously on MetaCommunications site will 
-merge all submitted test runs and publish them at 
+<p>The report merger process running continuously on MetaCommunications site will
+merge all submitted test runs and publish them at
 <a class="reference" href="http://boost.sourceforge.net/regression-logs/developer">http://boost.sourceforge.net/regression-logs/developer</a>.</p>
 </div>
 <div class="section">
@@ -330,7 +374,7 @@
 </div>
 <div class="section">
 <h2><a id="incremental-runs" name="incremental-runs">Incremental runs</a></h2>
-<p>You can run <tt class="docutils literal"><span class="pre">regression.py</span></tt> in incremental mode <a class="footnote-reference" href="#incremental" id="id5" name="id5">[4]</a> by simply passing 
+<p>You can run <tt class="docutils literal"><span class="pre">regression.py</span></tt> in incremental mode <a class="footnote-reference" href="#incremental" id="id5" name="id5">[4]</a> by simply passing
 it an identically named command-line flag:</p>
 <pre class="literal-block">
 python regression.py ... <strong>--incremental</strong>
@@ -338,42 +382,42 @@
 </div>
 <div class="section">
 <h2><a id="dealing-with-misbehaved-tests-compilers" name="dealing-with-misbehaved-tests-compilers">Dealing with misbehaved tests/compilers</a></h2>
-<p>Depending on the environment/C++ runtime support library the test is compiled with, 
+<p>Depending on the environment/C++ runtime support library the test is compiled with,
 a test failure/termination may cause an appearance of a dialog window, requiring
 human intervention to proceed. Moreover, the test (or even of the compiler itself)
-can fall into infinite loop, or simply run for too long. To allow <tt class="docutils literal"><span class="pre">regression.py</span></tt> 
-to take care of these obstacles, add the <tt class="docutils literal"><span class="pre">--monitored</span></tt> flag to the script 
+can fall into infinite loop, or simply run for too long. To allow <tt class="docutils literal"><span class="pre">regression.py</span></tt>
+to take care of these obstacles, add the <tt class="docutils literal"><span class="pre">--monitored</span></tt> flag to the script
 invocation:</p>
 <pre class="literal-block">
 python regression.py ... <strong>--monitored</strong>
 </pre>
-<p>That's it. Knowing your intentions, the script will be able to automatically deal 
+<p>That's it. Knowing your intentions, the script will be able to automatically deal
 with the listed issues <a class="footnote-reference" href="#monitored" id="id6" name="id6">[5]</a>.</p>
 </div>
 <div class="section">
 <h2><a id="getting-sources-from-cvs" name="getting-sources-from-cvs">Getting sources from CVS</a></h2>
 <p>If you already have a CVS client installed and configured, you might prefer to get
-the sources directly from the Boost CVS repository. To communicate this to the 
-script, you just need to pass it your SourceForge user ID using the <tt class="docutils literal"><span class="pre">--user</span></tt> 
+the sources directly from the Boost CVS repository. To communicate this to the
+script, you just need to pass it your SourceForge user ID using the <tt class="docutils literal"><span class="pre">--user</span></tt>
 option; for instance:</p>
 <pre class="literal-block">
 python regression.py ... <strong>--user=agurtovoy</strong>
 </pre>
-<p>You can also specify the user as <tt class="docutils literal"><span class="pre">anonymous</span></tt>, requesting anonymous CVS access. 
-Note, though, that the files obtained this way tend to lag behind the actual CVS 
-state by several hours, sometimes up to twelve. By contrast, the tarball the script 
+<p>You can also specify the user as <tt class="docutils literal"><span class="pre">anonymous</span></tt>, requesting anonymous CVS access.
+Note, though, that the files obtained this way tend to lag behind the actual CVS
+state by several hours, sometimes up to twelve. By contrast, the tarball the script
 downloads by default is at most one hour behind.</p>
 </div>
 <div class="section">
 <h2><a id="integration-with-a-custom-driver-script" name="integration-with-a-custom-driver-script">Integration with a custom driver script</a></h2>
-<p>Even if you've already been using a custom driver script, and for some 
-reason you don't  want <tt class="docutils literal"><span class="pre">regression.py</span></tt> to take over of the entire test cycle, 
+<p>Even if you've already been using a custom driver script, and for some
+reason you don't  want <tt class="docutils literal"><span class="pre">regression.py</span></tt> to take over of the entire test cycle,
 getting your regression results into <a class="reference" href="http://www.boost.org/regression-logs/developer/">Boost-wide reports</a> is still easy!</p>
-<p>In fact, it's just a matter of modifying your script to perform two straightforward 
+<p>In fact, it's just a matter of modifying your script to perform two straightforward
 operations:</p>
 <ol class="arabic">
 <li><p class="first"><em>Timestamp file creation</em> needs to be done before the CVS update/checkout.
-The file's location doesn't matter (nor does the content), as long as you know how 
+The file's location doesn't matter (nor does the content), as long as you know how
 to access it later. Making your script to do something as simple as
 <tt class="docutils literal"><span class="pre">echo</span> <span class="pre">&gt;timestamp</span></tt> would work just fine.</p>
 </li>
@@ -386,14 +430,14 @@
 <pre class="literal-block">
 --locate-root   directory to to scan for &quot;test_log.xml&quot; files
 --runner        runner ID (e.g. &quot;Metacomm&quot;)
---timestamp     path to a file which modification time will be used 
+--timestamp     path to a file which modification time will be used
                 as a timestamp of the run (&quot;timestamp&quot; by default)
 </pre>
 <p>For example, assuming that the run's resulting  binaries are in the
-<tt class="docutils literal"><span class="pre">$BOOST_ROOT/bin</span></tt> directory (the default Boost.Build setup), the 
+<tt class="docutils literal"><span class="pre">$BOOST_ROOT/bin</span></tt> directory (the default Boost.Build setup), the
 <tt class="docutils literal"><span class="pre">collect_and_upload_logs.py</span></tt> invocation might look like this:</p>
 <pre class="literal-block">
-python $BOOST_ROOT/tools/regression/xsl_reports/runner/collect_and_upload_logs.py 
+python $BOOST_ROOT/tools/regression/xsl_reports/runner/collect_and_upload_logs.py
    --locate-root=$BOOST_ROOT/bin
    --runner=Metacomm
    --timestamp=timestamp
@@ -419,7 +463,7 @@
 </div>
 <div class="section">
 <h1><a id="feedback" name="feedback">Feedback</a></h1>
-<p>Please send all comments/suggestions regarding this document and the testing procedure 
+<p>Please send all comments/suggestions regarding this document and the testing procedure
 itself to the <a class="reference" href="http://lists.boost.org/mailman/listinfo.cgi/boost-testing">Boost Testing list</a>.</p>
 </div>
 <div class="section">
@@ -427,8 +471,8 @@
 <table class="docutils footnote" frame="void" id="runnerid1" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id2" name="runnerid1">[1]</a></td><td>If you are running regressions interlacingly with a different 
-set of compilers (e.g. for Intel in the morning and GCC at the end of the day), you need 
+<tr><td class="label"><a class="fn-backref" href="#id2" name="runnerid1">[1]</a></td><td>If you are running regressions interlacingly with a different
+set of compilers (e.g. for Intel in the morning and GCC at the end of the day), you need
 to provide a <em>different</em> runner id for each of these runs, e.g. <tt class="docutils literal"><span class="pre">your_name-intel</span></tt>, and
 <tt class="docutils literal"><span class="pre">your_name-gcc</span></tt>.</td></tr>
 </tbody>
@@ -437,32 +481,32 @@
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
 <tr><td class="label"><a class="fn-backref" href="#id3" name="runnerid2">[2]</a></td><td>The limitations of the reports' format/medium impose a direct dependency
-between the number of compilers you are testing with and the amount of space available 
-for your runner id. If you are running regressions for a single compiler, please make 
+between the number of compilers you are testing with and the amount of space available
+for your runner id. If you are running regressions for a single compiler, please make
 sure to choose a short enough id that does not significantly disturb the reports' layout.</td></tr>
 </tbody>
 </table>
 <table class="docutils footnote" frame="void" id="toolsets" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id4" name="toolsets">[3]</a></td><td>If <tt class="docutils literal"><span class="pre">--toolsets</span></tt> option is not provided, the script will try to use the 
+<tr><td class="label"><a class="fn-backref" href="#id4" name="toolsets">[3]</a></td><td>If <tt class="docutils literal"><span class="pre">--toolsets</span></tt> option is not provided, the script will try to use the
 platform's default toolset (<tt class="docutils literal"><span class="pre">gcc</span></tt> for most Unix-based systems).</td></tr>
 </tbody>
 </table>
 <table class="docutils footnote" frame="void" id="incremental" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id5" name="incremental">[4]</a></td><td><p class="first">By default, the script runs in what is known as <em>full mode</em>: on 
-each <tt class="docutils literal"><span class="pre">regression.py</span></tt> invocation all the files that were left in place by the 
-previous run -- including the binaries for the successfully built tests and libraries 
--- are deleted, and everything is rebuilt once again from scratch. By contrast, in 
-<em>incremental mode</em> the already existing binaries are left intact, and only the 
-tests and libraries which source files has changed since the previous run are 
+<tr><td class="label"><a class="fn-backref" href="#id5" name="incremental">[4]</a></td><td><p class="first">By default, the script runs in what is known as <em>full mode</em>: on
+each <tt class="docutils literal"><span class="pre">regression.py</span></tt> invocation all the files that were left in place by the
+previous run -- including the binaries for the successfully built tests and libraries
+-- are deleted, and everything is rebuilt once again from scratch. By contrast, in
+<em>incremental mode</em> the already existing binaries are left intact, and only the
+tests and libraries which source files has changed since the previous run are
 re-built and re-tested.</p>
-<p>The main advantage of incremental runs is a significantly shorter turnaround time, 
+<p>The main advantage of incremental runs is a significantly shorter turnaround time,
 but unfortunately they don't always produce reliable results. Some type of changes
 to the codebase (changes to the bjam testing subsystem in particular)
-often require switching to a full mode for one cycle in order to produce 
+often require switching to a full mode for one cycle in order to produce
 trustworthy reports.</p>
 <p class="last">As a general guideline, if you can afford it, testing in full mode is preferable.</p>
 </td></tr>
@@ -471,17 +515,11 @@
 <table class="docutils footnote" frame="void" id="monitored" rules="none">
 <colgroup><col class="label" /><col /></colgroup>
 <tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id6" name="monitored">[5]</a></td><td>Note that at the moment this functionality is available only if you 
+<tr><td class="label"><a class="fn-backref" href="#id6" name="monitored">[5]</a></td><td>Note that at the moment this functionality is available only if you
 are running on a Windows platform. Contributions are welcome!</td></tr>
 </tbody>
 </table>
 </div>
 </div>
-<div class="footer">
-<hr class="footer" />
-Generated on: 2006-02-27 13:46 UTC.
-Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
-
-</div>
 </body>
 </html>

Modified: boost/trunk/tools/regression/xsl_reports/runner/instructions.rst
===================================================================
--- boost/trunk/tools/regression/xsl_reports/runner/instructions.rst	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/xsl_reports/runner/instructions.rst	2007-02-16 16:48:35 UTC (rev 14035)
@@ -13,11 +13,11 @@
 Installation
 ------------
 
-* Download regression driver ``regression.py`` from here__ (http://tinyurl.com/4fp4g)
+* Download regression driver ``regression.py`` from here__ (http://tinyurl.com/uufav)
   and put it in the directory where you want all the regression 
   test files to be placed.
 
-__ http://cvs.sourceforge.net/viewcvs.py/*checkout*/boost/boost/tools/regression/xsl_reports/runner/regression.py
+__ http://boost.cvs.sourceforge.net/*checkout*/boost/boost/tools/regression/xsl_reports/runner/regression.py
 
 
 * **Optional**: If you already have ``bjam`` and/or ``process_jam_log`` executables

Modified: boost/trunk/tools/regression/xsl_reports/runner/regression.py
===================================================================
--- boost/trunk/tools/regression/xsl_reports/runner/regression.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/xsl_reports/runner/regression.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,9 +1,9 @@
 #!/usr/bin/python
 
-# Copyright (c) MetaCommunications, Inc. 2003-2006
+# Copyright (c) MetaCommunications, Inc. 2003-2007
 #
-# Distributed under the Boost Software License, Version 1.0. 
-# (See accompanying file LICENSE_1_0.txt or copy at 
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at
 # http://www.boost.org/LICENSE_1_0.txt)
 
 import urllib
@@ -25,6 +25,8 @@
 regression_results = os.path.join( regression_root, 'results' )
 regression_log     = os.path.join( regression_results, 'bjam.log' )
 install_log        = os.path.join( regression_results, 'bjam_install.log' )
+boostbook_log      = os.path.join( regression_results, 'boostbook.log' )
+boostbook_archive_name = os.path.join( regression_results, 'boostbook.zip' )
 
 boost_root      = os.path.join( regression_root, 'boost' )
 xsl_reports_dir = os.path.join( boost_root, 'tools', 'regression', 'xsl_reports' )
@@ -80,7 +82,7 @@
     if v2:
         return os.path.join(boost_root, 'dist', 'bin')
     else:
-        return os.path.join( 
+        return os.path.join(
             boost_root, 'bin', 'boost', 'tools', 'regression', 'build'
             , process_jam_log[ 'name' ])
 
@@ -90,7 +92,7 @@
 process_jam_log[ 'build_cmd' ] = lambda toolset, v2: bjam_command( toolset, v2 )
 process_jam_log[ 'is_supported_toolset' ] = lambda x : True
 
-build_monitor_url = 'http://www.meta-comm.com/engineering/resources/build_monitor.zip'
+build_monitor_url = 'http://engineering.meta-comm.com/resources/build_monitor.zip'
 pskill_url = 'http://www.sysinternals.com/files/pskill.zip'
 
 utils = None
@@ -128,7 +130,7 @@
             return f( *args )
         except Exception, msg:
             log( '%s failed with message "%s"' % ( f.__name__, msg ) )
-            if attempts == 0: 
+            if attempts == 0:
                 log( 'Giving up.' )
                 raise
 
@@ -142,7 +144,7 @@
     if 'source' in args:
         log( 'Cleaning up "%s" directory ...' % boost_root )
         rmtree( boost_root )
-    
+
     if 'bin' in args:
         boost_bin_dir = os.path.join( boost_root, 'bin' )
         log( 'Cleaning up "%s" directory ...' % boost_bin_dir )
@@ -180,7 +182,7 @@
 def download_boost_tarball( destination, tag, proxy, timestamp_only = False ):
     tarball_name = tarball_name_for_tag( tag, timestamp_only )
     tarball_path = os.path.join( destination, tarball_name )
-    tarball_url = 'http://www.meta-comm.com/engineering/boost/snapshot/%s' % tarball_name
+    tarball_url = 'http://engineering.meta-comm.com/boost/snapshot/%s' % tarball_name
 
     log( 'Downloading "%s" to "%s"...'  % ( tarball_url, os.path.dirname( tarball_path ) ) )
     if os.path.exists( tarball_path ):
@@ -203,10 +205,10 @@
 def unpack_tarball( tarball_path, destination  ):
     log( 'Looking for old unpacked archives...' )
     old_boost_dirs = find_boost_dirs( destination )
-    
+
     for old_boost_dir in old_boost_dirs:
         if old_boost_dir != tarball_path:
-            log( 'Deleting old directory %s.' % old_boost_dir ) 
+            log( 'Deleting old directory %s.' % old_boost_dir )
             rmtree( old_boost_dir )
 
     log( 'Unpacking boost tarball ("%s")...' % tarball_path )
@@ -228,11 +230,11 @@
         tar.close()
     elif extension in ( ".zip" ):
         import zipfile
-        
-        z = zipfile.ZipFile( tarball_path, 'r', zipfile.ZIP_DEFLATED ) 
+
+        z = zipfile.ZipFile( tarball_path, 'r', zipfile.ZIP_DEFLATED )
         for f in z.infolist():
             destination_file_path = os.path.join( destination, f.filename )
-            if destination_file_path[-1] == "/": # directory 
+            if destination_file_path[-1] == "/": # directory
                 if not os.path.exists( destination_file_path  ):
                     os.makedirs( destination_file_path  )
             else: # file
@@ -245,7 +247,7 @@
 
     boost_dir = find_boost_dirs( destination )[0]
     log( '    Unpacked into directory "%s"' % boost_dir )
-    
+
     if os.path.exists( boost_root ):
         log( 'Deleting "%s" directory...' % boost_root )
         rmtree( boost_root )
@@ -261,7 +263,7 @@
         cmd = cvs_pserver_command_line % { 'user': user, 'command': command }
     else:
         cmd = cvs_ext_command_line % { 'user': user, 'command': command }
-    
+
     log( 'Executing CVS command "%s"' % cmd )
     rc = os.system( cmd )
     if rc != 0:
@@ -273,7 +275,7 @@
         command = 'checkout -r %s boost' % tag
     else:
         command = 'checkout boost'
-    
+
     os.chdir( regression_root )
     cvs_command( user, command )
 
@@ -283,13 +285,13 @@
         command = 'update -dPA -r %s' % tag
     else:
         command = 'update -dPA'
-    
+
     os.chdir( os.path.join( regression_root, 'boost' ) )
     cvs_command( user, command )
 
 
 def format_time( t ):
-    return time.strftime( 
+    return time.strftime(
           '%a, %d %b %Y %H:%M:%S +0000'
         , t
         )
@@ -328,12 +330,12 @@
     log( 'Getting sources (%s)...' % timestamp() )
 
     if user is not None:
-        retry( 
+        retry(
               cvs_checkout
             , ( user, tag, args )
             )
     else:
-        retry( 
+        retry(
               get_tarball
             , ( tag, proxy, args )
             )
@@ -343,7 +345,7 @@
     if user is not None or os.path.exists( os.path.join( boost_root, 'CVS' ) ):
         open( timestamp_path, 'w' ).close()
         log( 'Updating sources from CVS (%s)...' % timestamp() )
-        retry( 
+        retry(
               cvs_update
             , ( user, tag, args )
             )
@@ -366,7 +368,7 @@
     for root, dirs, files in os.walk( build_path_root ):
         if name_or_spec[ 'name' ] in files:
             return os.path.join( root, name_or_spec[ 'name' ] )
-    
+
     raise Exception( 'Cannot find "%s" in any of the following locations:\n%s' % (
           name_or_spec[ 'name' ]
         , '\n'.join( [ name_or_spec[ 'path' ], build_path_root ] )
@@ -398,7 +400,7 @@
         log( 'Found "%s" source directory "%s"' % ( tool[ 'name' ], tool[ 'source_dir' ] ) )
         build_cmd = tool[ 'build_cmd' ]( toolset, v2 )
         log( 'Building "%s" (%s)...' % ( tool[ 'name'], build_cmd ) )
-        utils.system( [ 
+        utils.system( [
               'cd "%s"' % tool[ 'source_dir' ]
             , build_cmd
             ] )
@@ -427,7 +429,7 @@
     if not os.path.exists( path ):
         log( 'Preinstalled "%s" is not found.' % path )
         log( '  Downloading from %s...' % tool_url )
-        
+
         zip_path = '%s.zip' % os.path.splitext( path )[0]
         http_get( tool_url, zip_path, proxy )
 
@@ -442,6 +444,7 @@
 def setup(
           comment
         , toolsets
+        , book
         , bjam_toolset
         , pjl_toolset
         , monitored
@@ -460,16 +463,15 @@
 
     build_if_needed( bjam, bjam_toolset, toolsets, v2 )
     build_if_needed( process_jam_log, pjl_toolset, toolsets, v2 )
-    
+
     if monitored:
         if sys.platform == 'win32':
             download_if_needed( 'build_monitor.exe', build_monitor_url, proxy )
             download_if_needed( 'pskill.exe', pskill_url, proxy )
         else:
-            log( 'Warning: Test monitoring is not supported on this platform (yet).' )
+            log( 'Warning: Test monitoring is not supported on this platform (yet).'     )
             log( '         Please consider contributing this piece!' )
 
-
 def bjam_build_script_cmd( cmd ):
     env_setup_key = 'BJAM_ENVIRONMENT_SETUP'
     if os.environ.has_key( env_setup_key ):
@@ -491,7 +493,7 @@
           , build_path
           , boost_root
           )
-    
+
     if not toolsets is None:
         if v2:
             result += ' ' + string.join(string.split( toolsets, ',' ), ' ' )
@@ -507,7 +509,7 @@
 
     log( 'Making "%s" directory...' % regression_results )
     utils.makedirs( regression_results )
-    
+
     install_cmd = '%s -d2 install >>%s 2>&1' % ( bjam_command( toolsets, v2 ), install_log )
     log( 'Installing libraries (%s)...' % install_cmd )
     utils.system( [ install_cmd ] )
@@ -537,22 +539,22 @@
     else:
         v2 = ""
 
-    utils.checked_system( [ 
+    utils.checked_system( [
         '"%s" %s "%s" <"%s"' % (
               tool_path( process_jam_log, v2 )
-            , v2  
+            , v2
             , regression_results
             , regression_log
             )
         ] )
 
 
-def test( 
+def test(
           toolsets
         , bjam_options
         , monitored
         , timeout
-        , v2  
+        , v2
         , args
         , **unused
         ):
@@ -573,7 +575,7 @@
 
         results_libs = os.path.join( regression_results, 'libs' )
         results_status = os.path.join( regression_results, 'status' )
-        
+
         if "clean" in args:
             rmtree( results_libs )
             rmtree( results_status )
@@ -586,7 +588,7 @@
             test_cmd = '%s -d2 --dump-tests %s "%s=%s" >>"%s" 2>&1' % (
                   bjam_command( toolsets, v2 )
                 , bjam_options
-                , build_dir_option  
+                , build_dir_option
                 , regression_results
                 , regression_log
                 )
@@ -602,8 +604,25 @@
         if monitored:
             stop_build_monitor()
 
+def build_book( **kargs ):
+    # To do
+    # 1. PDF generation
+    # 2. Do we need to cleanup before the build?
+    # 3. Incremental builds
+    if not os.path.exists( regression_results ):
+        os.makedirs( regression_results )
+    import_utils()
+    cwd = os.getcwd()
+    try:
+        os.chdir( os.path.join( boost_root, 'doc' ) )
+        if os.path.exists( boostbook_log ):
+            os.unlink( boostbook_log )
+        utils.system( [ '%s --v2 html >>%s 2>&1' % ( tool_path( bjam, v2=True ), boostbook_log ) ] )
+        # utils.system( [ '%s --v2 pdf >>%s 2>&1' % ( tool_path( bjam, v2=True ), boostbook_log ) ] )
+    finally:
+        os.chdir( cwd )
 
-def collect_logs( 
+def collect_logs(
           tag
         , runner
         , platform
@@ -614,7 +633,7 @@
         , **unused
         ):
     import_utils()
-    
+
     if comment is None:
         comment = 'comment.html'
 
@@ -624,7 +643,7 @@
         f = open( comment_path, 'w' )
         f.write( '<p>Tests are run on %s platform.</p>' % platform_name() )
         f.close()
-    
+
     run_type = ''
     if incremental: run_type = 'incremental'
     else:           run_type = 'full'
@@ -636,9 +655,9 @@
             source = 'anonymous CVS'
         else:
             source = 'CVS'
-   
+
     from runner import collect_logs
-    collect_logs( 
+    collect_logs(
           regression_results
         , runner
         , tag
@@ -649,24 +668,44 @@
         , source
         , run_type
         )
-        
 
-def upload_logs( 
+def collect_book( **unused ):
+    log( 'Collecting files for BoostBook into "%s"...' % boostbook_archive_name )
+    import zipfile
+    boostbook_archive = zipfile.ZipFile( boostbook_archive_name, 'w', zipfile.ZIP_DEFLATED )
+    html_root = os.path.join( boost_root, 'doc/html' )
+
+    boostbook_archive.writestr( 'timestamp', timestamp())
+    boostbook_archive.write( boostbook_log, os.path.basename( boostbook_log ) )
+    
+    def add_files( arg, dirname, names ):
+        for name in names:
+            path = os.path.join( dirname, name )
+            if not os.path.isdir( path ):
+                boostbook_archive.write( path, path[ len(html_root) + 1: ] )
+    os.path.walk( html_root, add_files, None ) 
+    
+def upload_logs(
           tag
         , runner
         , user
         , ftp_proxy
         , debug_level
+        , send_bjam_log
         , **unused
         ):
     import_utils()
     from runner import upload_logs
     retry(
           upload_logs
-        , ( regression_results, runner, tag, user, ftp_proxy, debug_level )
+        , ( regression_results, runner, tag, user, ftp_proxy, debug_level, send_bjam_log, timestamp_path )
         )
 
-
+def upload_book( tag, runner, ftp_proxy, debug_level, **unused ):
+    import_utils()
+    from runner import upload_to_ftp
+    upload_to_ftp( tag, boostbook_archive_name, ftp_proxy, debug_level )
+    
 def update_itself( tag, **unused ):
     source = os.path.join( xsl_reports_dir, 'runner', os.path.basename( sys.argv[0] ) )
     self = os.path.join( regression_root, os.path.basename( sys.argv[0] ) )
@@ -693,21 +732,21 @@
     else:
         server_name = smtp_login.split( '@' )[-1]
         ( user_name, password ) = string.split( smtp_login.split( '@' )[0], ':' )
-        
+
     log( '    Sending mail through "%s"...' % server_name )
     smtp_server = smtplib.SMTP( server_name )
     smtp_server.set_debuglevel( debug_level )
     if user_name:
         smtp_server.login( user_name, password )
-    
-    smtp_server.sendmail( 
+
+    smtp_server.sendmail(
           mail
         , [ mail ]
         , 'Subject: %s\nTo: %s\n\n%s' % ( subject, mail, msg )
         )
 
 
-def regression( 
+def regression(
           tag
         , local
         , runner
@@ -715,10 +754,12 @@
         , user
         , comment
         , toolsets
+        , book
         , bjam_options
         , bjam_toolset
         , pjl_toolset
         , incremental
+        , send_bjam_log
         , force_update
         , monitored
         , timeout
@@ -727,7 +768,7 @@
         , proxy = None
         , ftp_proxy = None
         , debug_level = 0
-        , v2 = 0
+        , v2 = 1
         , args = []
         ):
 
@@ -745,11 +786,11 @@
 
         if local is not None:
             log( 'Using local file "%s"' % local )
-            
+
             b = os.path.basename( local )
             tag = b[ 0: b.find( '.' ) ]
             log( 'Tag: "%s"' % tag  )
-            
+
             unpack_tarball( local, regression_root )
         else:
             if incremental or force_update:
@@ -759,17 +800,27 @@
                 cleanup( [] )
                 get_source( user, tag, proxy, [] )
 
-        setup( comment, toolsets, bjam_toolset, pjl_toolset, monitored, proxy,
+        setup( comment, toolsets, book, bjam_toolset, pjl_toolset, monitored, proxy,
                v2, [] )
-        test( toolsets, bjam_options, monitored, timeout, v2, [] )
-        collect_logs( tag, runner, platform, user, comment, incremental, [] )
-        upload_logs( tag, runner, user, ftp_proxy, debug_level )
+        # Not specifying --toolset in command line is not enough
+        # that would mean to use Boost.Build default ones
+        # We can skip test only we were explictly 
+        # told to have no toolsets in command line "--toolset="
+        if  toolsets != '': # --toolset=,
+            test( toolsets, book, bjam_options, monitored, timeout, v2, [] )
+            collect_logs( tag, runner, platform, user, comment, incremental, [] )
+            upload_logs( tag, runner, user, ftp_proxy, debug_level, send_bjam_log )
+        if book:
+            build_book()    
+            collect_book()
+            upload_book( tag, runner, ftp_proxy, debug_level )
+
         update_itself( tag )
-        
+
         if mail:
             log( 'Sending report to "%s"' % mail )
             end_time = time.localtime()
-            send_mail( 
+            send_mail(
                   smtp_login
                 , mail
                 , '%s completed successfully at %s.' % ( mail_subject, format_time( end_time ) )
@@ -791,8 +842,8 @@
 
 
 def show_revision( **unused ):
-    modified = '$Date: 2006/05/16 13:55:33 $'
-    revision = '$Revision: 1.65 $'
+    modified = '$Date: 2007/02/11 20:08:58 $'
+    revision = '$Revision: 1.63.2.20 $'
 
     import re
     re_keyword_value = re.compile( r'^\$\w+:\s+(.*)\s+\$$' )
@@ -809,6 +860,7 @@
         , 'user='
         , 'comment='
         , 'toolsets='
+        , 'book'
         , 'bjam-options='
         , 'bjam-toolset='
         , 'pjl-toolset='
@@ -820,11 +872,13 @@
         , 'debug-level='
         , 'incremental'
         , 'force-update'
+        , 'dont-send-bjam-log'
         , 'monitored'
         , 'help'
-        , 'v2'  
+        , 'v2'
+        , 'v1'
         ]
-    
+
     options = {
           '--tag'           : 'CVS-HEAD'
         , '--local'         : None
@@ -832,6 +886,7 @@
         , '--user'          : None
         , '--comment'       : None
         , '--toolsets'      : None
+        , '--book'          : False
         , '--bjam-options'  : ''
         , '--bjam-toolset'  : None
         , '--pjl-toolset'   : None
@@ -842,7 +897,7 @@
         , '--debug-level'   : 0
         , '--ftp-proxy'     : None
         }
-    
+
     ( option_pairs, other_args ) = getopt.getopt( args, '', args_spec )
     map( lambda x: options.__setitem__( x[0], x[1] ), option_pairs )
 
@@ -858,10 +913,12 @@
         , 'user'            : options[ '--user' ]
         , 'comment'         : options[ '--comment' ]
         , 'toolsets'        : options[ '--toolsets' ]
+        , 'book'            : options.has_key( '--book' )
         , 'bjam_options'    : options[ '--bjam-options' ]
         , 'bjam_toolset'    : options[ '--bjam-toolset' ]
         , 'pjl_toolset'     : options[ '--pjl-toolset' ]
         , 'incremental'     : options.has_key( '--incremental' )
+        , 'send_bjam_log'   : not options.has_key( '--dont-send-bjam-log' )
         , 'force_update'    : options.has_key( '--force-update' )
         , 'monitored'       : options.has_key( '--monitored' )
         , 'timeout'         : options[ '--timeout' ]
@@ -870,11 +927,10 @@
         , 'proxy'           : options[ '--proxy' ]
         , 'ftp_proxy'       : options[ '--ftp-proxy' ]
         , 'debug_level'     : int(options[ '--debug-level' ])
-        , 'v2'              : options.has_key( '--v2' )  
+        , 'v2'              : not options.has_key( '--v1' )
         , 'args'            : other_args
         }
 
-
 commands = {
       'cleanup'         : cleanup
     , 'get-source'      : get_source
@@ -882,8 +938,11 @@
     , 'setup'           : setup
     , 'install'         : install
     , 'test'            : test
+    , 'build-book'      : build_book
     , 'collect-logs'    : collect_logs
+    , 'collect-book'    : collect_book
     , 'upload-logs'     : upload_logs
+    , 'upload-book'     : upload_book
     , 'update-itself'   : update_itself
     , 'regression'      : regression
     , 'show-revision'   : show_revision
@@ -902,14 +961,17 @@
 \t--comment       an HTML comment file to be inserted in the reports
 \t                ('comment.html' by default)
 \t--incremental   do incremental run (do not remove previous binaries)
+\t--dont-send-bjam-log 
+\t                do not send full bjam log of the regression run
 \t--force-update  do a CVS update (if applicable) instead of a clean
 \t                checkout, even when performing a full run
 \t--monitored     do a monitored run
 \t--timeout       specifies the timeout, in minutes, for a single test
-\t                run/compilation (enforced only in monitored runs, 5 by 
+\t                run/compilation (enforced only in monitored runs, 5 by
 \t                default)
 \t--user          SourceForge user name for a shell/CVS account (optional)
 \t--toolsets      comma-separated list of toolsets to test with (optional)
+\t--book          build BoostBook (optional)
 \t--bjam-options  options to pass to the regression test (optional)
 \t--bjam-toolset  bootstrap toolset for 'bjam' executable (optional)
 \t--pjl-toolset   bootstrap toolset for 'process_jam_log' executable
@@ -917,12 +979,13 @@
 \t--mail          email address to send run notification to (optional)
 \t--smtp-login    STMP server address/login information, in the following
 \t                form: <user>:<password>@<host>[:<port>] (optional).
-\t--proxy         HTTP proxy server address and port (e.g. 
+\t--proxy         HTTP proxy server address and port (e.g.
 \t                'http://www.someproxy.com:3128', optional)
 \t--ftp-proxy     FTP proxy server (e.g. 'ftpproxy', optional)
-\t--debug-level   debugging level; controls the amount of debugging 
+\t--debug-level   debugging level; controls the amount of debugging
 \t                output printed; 0 by default (no debug output)
-\t--v2            Use Boost.Build V2
+\t--v1            Use Boost.Build V1
+\t--v2            Use Boost.Build V2 (default)
 ''' % '\n\t'.join( commands.keys() )
 
     print 'Example:\n\t%s --runner=Metacomm\n' % os.path.basename( sys.argv[0] )

Modified: boost/trunk/tools/regression/xsl_reports/test/common.py
===================================================================
--- boost/trunk/tools/regression/xsl_reports/test/common.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/xsl_reports/test/common.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -45,10 +45,9 @@
     toolset_name = make_toolset_name( toolset_idx )
     
     target_directory = ""
-
-    if test_type == "run":
+    if test_type != "lib":
         target_directory = make_test_target_directory( library_idx, toolset_idx, test_name, variant )
-    if test_type == "lib":
+    else:
         target_directory = make_library_target_directory( library_idx, toolset_idx, variant )
         
     xml_generator.startElement( "test-log", { "library": library
@@ -59,25 +58,29 @@
                                   , "target-directory": target_directory
                                   , "show-run-output": show_run_output
                                   } )
-    if test_type ==  "run":
-        xml_generator.startElement( "compile", { "result": "success" } );
-        xml_generator.characters( "Compiling in %s" % target_directory )
-        xml_generator.endElement( "compile" )
 
-        
-        xml_generator.startElement( "lib", { "result": test_result } );
-        xml_generator.characters( make_library_target_directory( library_idx, toolset_idx ) )
-        xml_generator.endElement( "lib" )
+    if test_type != "lib":
 
-        xml_generator.startElement( "link", { "result": "success" } );
-        xml_generator.characters( "Linking in %s" % target_directory )
-        xml_generator.endElement( "link" )
+        if test_result == "success" and ( toolset_idx + 1 ) % 4:
+            xml_generator.startElement( "compile", { "result": "success" } );
+            xml_generator.characters( "Compiling in %s" % target_directory )
+            xml_generator.endElement( "compile" )
 
-        xml_generator.startElement( "run", { "result": test_result } );
-        xml_generator.characters( "Running in %s" % target_directory )
-        xml_generator.endElement( "run" )
+        if test_type.find( "link" ) == 0 or test_type.find( "run" ) == 0 and toolset_idx % 4:
+            xml_generator.startElement( "lib", { "result": test_result } );
+            xml_generator.characters( make_library_target_directory( library_idx, toolset_idx ) )
+            xml_generator.endElement( "lib" )
 
-    if test_type ==  "lib":
+            xml_generator.startElement( "link", { "result": "success" } );
+            xml_generator.characters( "Linking in %s" % target_directory )
+            xml_generator.endElement( "link" )
+
+        if test_type.find( "run" ) == 0 and ( toolset_idx + 2 ) % 4:
+            xml_generator.startElement( "run", { "result": test_result } );
+            xml_generator.characters( "Running in %s" % target_directory )
+            xml_generator.endElement( "run" )
+
+    else:
         xml_generator.startElement( "compile", { "result": test_result } );
         xml_generator.characters( "Compiling in %s" % make_library_target_directory( library_idx, toolset_idx ) )
         xml_generator.endElement( "compile" )

Modified: boost/trunk/tools/regression/xsl_reports/test/generate_test_results.py
===================================================================
--- boost/trunk/tools/regression/xsl_reports/test/generate_test_results.py	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/xsl_reports/test/generate_test_results.py	2007-02-16 16:48:35 UTC (rev 14035)
@@ -41,6 +41,11 @@
     else:              return "full"
 
 
+def test_type( i ):
+    types = [ "compile", "compile_fail", "link", "link_fail", "run", "run_fail", "run_pyd" ]
+    return types[ i % len( types) ]
+
+
 def make_test_results():
     if not os.path.exists( results_directory ):
         os.makedirs( results_directory )
@@ -95,14 +100,13 @@
                 for i_test in range( num_of_tests ):
                     test_name = "test_%02d_%02d" % ( i_lib, i_test )
                     test_result = ""
-                    test_type = "run"
                     show_run_output = "false"
                     
                     if num_of_runners - 1 == i_runner and i_test % 2:
                         continue
                     
                     if i_runner % 2: test_result = "success"
-                    else:             test_result = "fail"
+                    else:            test_result = "fail"
 
                     if i_runner == 1 and i_toolset == 2 and i_test % 6 == 0:
                         test_result = "fail"
@@ -120,7 +124,7 @@
                                               , library_idx = i_lib
                                               , toolset_idx = i_toolset
                                               , test_name = test_name
-                                              , test_type = test_type
+                                              , test_type = test_type( i_test )
                                               , test_result = test_result
                                               , show_run_output = show_run_output
                                               , variant = variant )

Copied: boost/trunk/tools/regression/xsl_reports/test/test-components (from rev 14034, boost/branches/upstream/current/tools/regression/xsl_reports/test/test-components)

Modified: boost/trunk/tools/regression/xsl_reports/xsl/v2/add_expected_results.xsl
===================================================================
--- boost/trunk/tools/regression/xsl_reports/xsl/v2/add_expected_results.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/xsl_reports/xsl/v2/add_expected_results.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!--
 
-Copyright MetaCommunications, Inc. 2003-2005.
+Copyright MetaCommunications, Inc. 2003-2007.
 
 Distributed under the Boost Software License, Version 1.0. (See
 accompanying file LICENSE_1_0.txt or copy at
@@ -11,8 +11,10 @@
 
 <xsl:stylesheet 
     xmlns:xsl="http://www.w3.org/1999/XSL/Transform" 
+    xmlns:func="http://exslt.org/functions"
     xmlns:meta="http://www.meta-comm.com"
-    exclude-result-prefixes="meta"
+    extension-element-prefixes="func"
+    exclude-result-prefixes="func meta"
     version="1.0">
 
     <xsl:import href="common.xsl"/>
@@ -23,7 +25,31 @@
     <xsl:param name="failures_markup_file"/>
     <xsl:variable name="expected_results" select="document( $expected_results_file )" />
 
+    <func:function name="meta:is_test_log_complete">
+        <xsl:param name="test_log"/>
+        <xsl:variable name="type" select="$test_log/@test-type"/>
+        <func:result>
+            <xsl:choose>
+                <xsl:when test="$type='compile' or $type='compile_fail'  or $test_log/compile/@result='fail' ">
+                    <xsl:value-of select="count( $test_log/compile ) = 1 and count( $test_log/link) = 0 and count( $test_log/run) = 0"/>
+                </xsl:when>
+                <xsl:when test="$type='link' or $type='link_fail' or $type='' or $type='lib' or $test_log/link/@result='fail'">
+                    <xsl:value-of select="count( $test_log/compile) = 1  and count( $test_log/link) = 1 and count( $test_log/run) = 0"/></xsl:when>
+                <xsl:when test="$type='run' or $type='run_fail' or $type='run_pyd'">
+                    <xsl:value-of select="count( $test_log/compile) = 1  and count( $test_log/link)  = 1 and count($test_log/run) = 1 "/>
+                </xsl:when>
+                <xsl:otherwise> 
+                    <xsl:message terminate="yes">
+                        Unknown test type "<xsl:value-of select="$type"/>"
+                    </xsl:message>
+                </xsl:otherwise>
+            </xsl:choose>
+        </func:result>            
+    </func:function>
+
+
     <xsl:key name = "trk" match = "test-result" use = "concat( ../../@name, '-', ../@name, '-', @test-name )" />
+    <xsl:key name = "tak" match = "toolset-alias" use = "@name" />
 
     <xsl:variable name="failures_markup" select="document( $failures_markup_file )" />
     <xsl:template match="/">
@@ -36,23 +62,21 @@
         <xsl:variable name="test-name" select="@test-name"/>
         <xsl:variable name="toolset" select="@toolset"/>
 
+        <xsl:variable name="is_complete" select="meta:is_test_log_complete( $test_log )"/>
+
         <xsl:element name="{local-name()}">
             <xsl:apply-templates select="@*"/>
 
-
+            <xsl:variable name="has_failures" select="./*/@result = 'fail'"/>
             <xsl:variable name="actual_result">
                 <xsl:choose>
-                    <!-- Hack: needs to be researched (and removed). See M.Wille's incident. -->
-                    <xsl:when test="run/@result='succeed' and lib/@result='fail'">
-                        <xsl:text>success</xsl:text>
-                    </xsl:when>
-                    <xsl:when test="./*/@result = 'fail'" >
+                    <xsl:when test="$has_failures or not( $is_complete )" >
                         <xsl:text>fail</xsl:text>
                     </xsl:when>
                     <xsl:otherwise>
                         <xsl:text>success</xsl:text>
                     </xsl:otherwise>
-                </xsl:choose>                     
+                </xsl:choose>
             </xsl:variable>
             
             <!-- 
@@ -64,12 +88,20 @@
                  -->
 
             <xsl:for-each select="$expected_results">
-                
-                <xsl:variable name="expected_results_test_case" select="key( 'trk', concat( $toolset, '-', $library, '-', $test-name ) )"/>
-                <xsl:variable name="test_case_markup"      select="$failures_markup//library[@name=$library]/test[ meta:re_match( @name, $test-name ) ]"/>
-                <xsl:variable name="test_failures_markup"  select="$test_case_markup/mark-failure/toolset[ meta:re_match( @name, $toolset ) ]/.."/>
-                <xsl:variable name="test_failures_markup2" select="$failures_markup//library[@name=$library]/mark-expected-failures/test[ meta:re_match( @name, $test-name ) ]/../toolset[ meta:re_match( @name, $toolset ) ]/.."/>
 
+                <xsl:variable name="main_toolset" select="key( 'tak', $toolset )/../@name" />
+                <xsl:variable name="toolset_name">
+                    <xsl:choose>
+                        <xsl:when test="$main_toolset"><xsl:value-of select="$main_toolset"/></xsl:when>
+                        <xsl:otherwise><xsl:value-of select="$toolset"/></xsl:otherwise>
+                    </xsl:choose>
+                </xsl:variable>
+
+                <xsl:variable name="expected_results_test_case" select="key( 'trk', concat( $toolset_name, '-', $library, '-', $test-name ) )"/>
+                <xsl:variable name="test_case_markup"           select="$failures_markup//library[@name=$library]/test[ meta:re_match( @name, $test-name ) ]"/>
+                <xsl:variable name="test_failures_markup"       select="$test_case_markup/mark-failure/toolset[ meta:re_match( @name, $toolset ) ]/.."/>
+                <xsl:variable name="test_failures_markup2"      select="$failures_markup//library[@name=$library]/mark-expected-failures/test[ meta:re_match( @name, $test-name ) ]/../toolset[ meta:re_match( @name, $toolset ) ]/.."/>
+
                 <xsl:variable name="category">
                     <xsl:choose>
                         <xsl:when test="$test_case_markup/@category">
@@ -197,9 +229,19 @@
                             </xsl:otherwise>
                         </xsl:choose>
                     </xsl:if>
+
+                    <xsl:if test="not( $is_complete ) and not( $has_failures )">
+                        <note>
+                            <span class="internal-error-note">
+                                <b>[Reporting Tools Internal Error]</b> This test case's XML is missing one or more log entries
+                                of the regression run's steps associated with the test case's type ("<xsl:value-of select="$test_log/@test-type"/>").
+                                Please <a href="mailto:mailto:boost-testing at lists.boost.org">contact reporting tools 
+                                maintainers</a> about this problem.
+                            </span>
+                        </note>
+                    </xsl:if>
                 </xsl:variable>
                 
-                
                 <xsl:attribute name="result"><xsl:value-of select="$actual_result"/></xsl:attribute>
                 <xsl:attribute name="expected-result"><xsl:value-of select="$expected_result"/></xsl:attribute>
                 <xsl:attribute name="expected-reason"><xsl:value-of select="$expected_reason"/></xsl:attribute>

Modified: boost/trunk/tools/regression/xsl_reports/xsl/v2/common.xsl
===================================================================
--- boost/trunk/tools/regression/xsl_reports/xsl/v2/common.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/xsl_reports/xsl/v2/common.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -108,8 +108,8 @@
 
 
     <func:function name="meta:test_case_status">
+        <xsl:param name="explicit_markup"/>
         <xsl:param name="test_log"/>
-        <xsl:param name="$explicit_markup"/>
 
         <xsl:variable name="status">
             <xsl:choose> 
@@ -147,8 +147,10 @@
     </func:function>
 
     <func:function name="meta:is_test_log_a_test_case">
-        <xsl:param name="test_log"/>      
-        <func:result select="$test_log/@test-type='compile' or $test_log/@test-type='compile_fail' or $test_log/@test-type='run' or $test_log/@test-type='run_pyd'"/>
+        <xsl:param name="test_log"/>       
+        <xsl:variable name="type" select="$test_log/@test-type"/>
+        <func:result select="$type='compile' or $type='compile_fail' or $type='link' or $type='link_fail' 
+                             or $type='run' or $type='run_fail' or $type='run_pyd'"/>
     </func:function>
 
 

Copied: boost/trunk/tools/regression/xsl_reports/xsl/v2/dump_toolsets.xsl (from rev 14034, boost/branches/upstream/current/tools/regression/xsl_reports/xsl/v2/dump_toolsets.xsl)

Modified: boost/trunk/tools/regression/xsl_reports/xsl/v2/html/master.css
===================================================================
--- boost/trunk/tools/regression/xsl_reports/xsl/v2/html/master.css	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/xsl_reports/xsl/v2/html/master.css	2007-02-16 16:48:35 UTC (rev 14035)
@@ -568,6 +568,11 @@
     font-style: italic;
 }
 
+span.internal-error-note
+{
+    color: red;
+}
+
 /* Log */
 
 div.log-test-title
@@ -609,7 +614,12 @@
   font-weight: bold;
 }
 
+span.output-fail
+{
+  color: red;
+}
 
+
 /* Issues page */
 
 table.library-issues-table

Modified: boost/trunk/tools/regression/xsl_reports/xsl/v2/links_page.xsl
===================================================================
--- boost/trunk/tools/regression/xsl_reports/xsl/v2/links_page.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/xsl_reports/xsl/v2/links_page.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="utf-8"?>
 <!--
 
-Copyright MetaCommunications, Inc. 2003-2005.
+Copyright MetaCommunications, Inc. 2003-2006.
 
 Distributed under the Boost Software License, Version 1.0. (See
 accompanying file LICENSE_1_0.txt or copy at
@@ -71,7 +71,7 @@
          -->
 
     <xsl:template match="/">
-        <xsl:variable name="test_logs_to_show" select="//test-log[ meta:show_output( $explicit_markup, . ) ]"/>
+        <xsl:variable name="test_logs_to_show" select="//test-log"/>
         <xsl:variable name="libs_test_test_log_tree" select="meta:restructure_logs( $test_logs_to_show )"/>
         
         <exsl:document href="debug.xml"
@@ -90,7 +90,7 @@
             <xsl:variable name="toolset_name" select="$toolset/@name"/>
             <xsl:message>Processing test "<xsl:value-of select="$runner_id"/>/<xsl:value-of select="$library_name"/>/<xsl:value-of select="$test_name"/>/<xsl:value-of select="$toolset_name"/>"</xsl:message>
 
-            <xsl:if test="count( $toolset/* ) != 1">
+            <xsl:if test="count( $toolset/* ) &gt; 1">
                 <xsl:message>  Processing variants</xsl:message>
 
                 <xsl:variable name="variants_file_path" select="meta:output_file_path( concat( $runner_id, '-', $library_name, '-', $toolset_name, '-', $test_name, '-variants' ) )"/>
@@ -98,6 +98,7 @@
                 <xsl:call-template name="write_variants_file">
                     <xsl:with-param name="path" select="$variants_file_path"/>
                     <xsl:with-param name="test_logs" select="$toolset/*"/>
+                    <xsl:with-param name="runner_id" select="$runner_id"/>
                 </xsl:call-template>
 
                 <xsl:for-each select="str:tokenize( string( ' |_release' ), '|')">
@@ -119,27 +120,29 @@
                 <xsl:message>  Processing test-log</xsl:message>
                 <xsl:variable name="test_log" select="."/>
 
-                <xsl:variable name="log_file_path" select="meta:log_file_path( ., $runner_id )"/>
-                
-                <xsl:call-template name="write_test_result_file">
-                    <xsl:with-param name="path" select="$log_file_path"/>
-                    <xsl:with-param name="test_log" select="$test_log"/>
-                    <xsl:with-param name="runner_id" select="$runner_id"/>
-                </xsl:call-template>
-                
-                <xsl:for-each select="str:tokenize( string( ' |_release' ), '|')">
-                    <xsl:variable name="release_postfix" select="translate(.,' ','')"/>
-                    <xsl:for-each select="str:tokenize( string( 'developer|user' ), '|')">
-                        <xsl:variable name="directory" select="."/>
+                <xsl:if test="meta:show_output( $explicit_markup, $test_log )">
+                    <xsl:variable name="log_file_path" select="meta:log_file_path( ., $runner_id )"/>
+                    
+                    <xsl:call-template name="write_test_result_file">
+                        <xsl:with-param name="path" select="$log_file_path"/>
+                        <xsl:with-param name="test_log" select="$test_log"/>
+                        <xsl:with-param name="runner_id" select="$runner_id"/>
+                    </xsl:call-template>
+                    
+                    <xsl:for-each select="str:tokenize( string( ' |_release' ), '|')">
+                        <xsl:variable name="release_postfix" select="translate(.,' ','')"/>
+                        <xsl:for-each select="str:tokenize( string( 'developer|user' ), '|')">
+                            <xsl:variable name="directory" select="."/>
 
-                        <xsl:variable name="reference_file_path" select="concat( $directory, '/', meta:log_file_path( $test_log, $runner_id, $release_postfix ) )"/>
-                        <xsl:call-template name="write_test_results_reference_file">
-                            <xsl:with-param name="path" select="$reference_file_path"/>
-                            <xsl:with-param name="log_file_path" select="$log_file_path"/>
-                        </xsl:call-template>
+                            <xsl:variable name="reference_file_path" select="concat( $directory, '/', meta:log_file_path( $test_log, $runner_id, $release_postfix ) )"/>
+                            <xsl:call-template name="write_test_results_reference_file">
+                                <xsl:with-param name="path" select="$reference_file_path"/>
+                                <xsl:with-param name="log_file_path" select="$log_file_path"/>
+                            </xsl:call-template>
+                        </xsl:for-each>                
                     </xsl:for-each>
-        
-                </xsl:for-each>
+                </xsl:if>
+
             </xsl:for-each>
         </xsl:for-each>
     </xsl:template>
@@ -200,9 +203,24 @@
         
     </xsl:template>
 
+    <func:function name="meta:output_page_header">
+        <xsl:param name="test_log"/>
+        <xsl:param name="runner_id"/>
+        <xsl:choose>
+            <xsl:when test="$test_log/@test-name != ''">
+                <func:result select="concat( $runner_id, ' - ', $test_log/@library, ' - ', $test_log/@test-name, ' / ', $test_log/@toolset )"/>
+            </xsl:when>
+            <xsl:otherwise>
+                <func:result select="$test_log/@target-dir"/>
+            </xsl:otherwise>
+        </xsl:choose>
+    </func:function>
+
+
     <xsl:template name="write_variants_file">
         <xsl:param name="path"/>
         <xsl:param name="test_logs"/>
+        <xsl:param name="runner_id"/>
         <xsl:message>    Writing variants file <xsl:value-of select="$path"/></xsl:message>
         <exsl:document href="{$path}"
             method="html" 
@@ -211,14 +229,32 @@
             indent="yes">
             
             <html>
+                <xsl:variable name="component" select="meta:output_page_header( $test_logs[1], $runner_id )"/>
+
+                <head>
+                    <link rel="stylesheet" type="text/css" href="../master.css" title="master" />
+                    <title>Test output: <xsl:value-of select="$component"/></title>
+                </head>
+
                 <body>
+                    <div>
+                        <div class="log-test-title">
+                            Test output: <xsl:value-of select="$component"/>
+                        </div>
+                    </div>
+                    
+                    <div>
+                        <b>Report Time: </b> <xsl:value-of select="meta:format_timestamp( $run_date )"/>
+                    </div>
+
+                    <p>Output by test variants:</p>
                     <table>
                         <xsl:for-each select="$test_logs">
                             <tr>
                                 <td>
                                      <xsl:choose>
                                          <xsl:when test="meta:log_file_path(.,$runner_id) != ''">
-                                             <a href="../{meta:log_file_path(.,$runner_id)}" target="_top" >
+                                             <a href="../{meta:log_file_path(.,$runner_id)}">
                                                  <xsl:value-of select="@target-directory"/>
                                              </a>
                                          </xsl:when>
@@ -248,28 +284,16 @@
             indent="yes">
                         
             <html>
-                <xsl:variable name="component">
-                    <xsl:choose>
-                        <xsl:when test="$test_log/@test-name != ''">
-                            <div class="log-test-title">
-                                <xsl:value-of select="concat( $runner_id, ' - ', @library, ' - ', @test-name, ' / ', @toolset )"/>
-                            </div>
-                        </xsl:when>
-                        <xsl:otherwise>
-                            <xsl:value-of select="@target-dir"/>
-                        </xsl:otherwise>
-                    </xsl:choose>
-                </xsl:variable>
-                
+                <xsl:variable name="component" select="meta:output_page_header( $test_log, $runner_id )"/>
+
                 <head>
                     <link rel="stylesheet" type="text/css" href="../master.css" title="master" />
                     <title>Test output: <xsl:value-of select="$component"/></title>
                 </head>
                 
                 <body>
-                    <div>
-                        <div class="log-test-title">
-                            Test output: <xsl:value-of select="$component"/>
+                    <div class="log-test-title">
+                        Test output: <xsl:value-of select="$component"/>
                     </div>
                     
                     <div>
@@ -288,47 +312,39 @@
                     
                     <xsl:if test="compile">
                         <p>
-                            <div class="log-compiler-output-title">Compiler output [<xsl:value-of select="compile/@timestamp"/>]:
-                        </div>
-                        <pre>
-                            <xsl:copy-of select="compile/node()"/>
-                        </pre>
-                    </p>
-                </xsl:if>
+                            <div class="log-compiler-output-title">Compile [<xsl:value-of select="compile/@timestamp"/>]: <span class="output-{compile/@result}"><xsl:value-of select="compile/@result"/></span></div>
+                            <pre><xsl:copy-of select="compile/node()"/></pre>
+                        </p>
+                    </xsl:if>
                 
-                <xsl:if test="link">
-                    <p>
-                        <div class="log-linker-output-title">Linker output [<xsl:value-of select="link/@timestamp"/>]:</div>
-                                    <pre>
-                                        <xsl:copy-of select="link/node()"/>
-                                    </pre>
-                                </p>
-                            </xsl:if>
+                    <xsl:if test="link">
+                        <p>
+                            <div class="log-linker-output-title">Link [<xsl:value-of select="link/@timestamp"/>]: <span class="output-{link/@result}"><xsl:value-of select="link/@result"/></span></div>
+                            <pre><xsl:copy-of select="link/node()"/></pre>
+                        </p>
+                    </xsl:if>
                             
-                            <xsl:if test="lib">
-                                <p>
-                                    <div class="log-linker-output-title">Lib output [<xsl:value-of select="lib/@timestamp"/>]:</div>
-                                    <p>
-                                        See <a href="{meta:encode_path( concat( $runner_id, '-',  lib/node() )  ) }.html">
-                                        <xsl:copy-of select="lib/node()"/>
-                                    </a>
-                                </p>
-                            </p>
-                        </xsl:if>
-                        
-                        <xsl:if test="run">
+                    <xsl:if test="lib">
+                        <p>
+                            <div class="log-linker-output-title">Lib [<xsl:value-of select="lib/@timestamp"/>]: <span class="output-{lib/@result}"><xsl:value-of select="lib/@result"/></span></div>
                             <p>
-                                <div class="log-run-output-title">Run output [<xsl:value-of select="run/@timestamp"/>]:</div>
-                                <pre>
-                                    <xsl:copy-of select="run/node()"/>
-                                </pre>
+                                See <a href="{meta:encode_path( concat( $runner_id, '-',  lib/node() )  ) }.html">
+                                <xsl:copy-of select="lib/node()"/>
+                                </a>
                             </p>
-                        </xsl:if>
+                        </p>
+                    </xsl:if>
                         
-                    </div>
-                    
+                    <xsl:if test="run">
+                        <p>
+                            <div class="log-run-output-title">Run [<xsl:value-of select="run/@timestamp"/>]: <span class="output-{run/@result}"><xsl:value-of select="run/@result"/></span></div>
+                            <pre>
+                                <xsl:copy-of select="run/node()"/>
+                            </pre>
+                        </p>
+                    </xsl:if>
+                        
                     <xsl:copy-of select="document( 'html/make_tinyurl.html' )"/>
-                    
                 </body>
                 
             </html>

Modified: boost/trunk/tools/regression/xsl_reports/xsl/v2/result_page.xsl
===================================================================
--- boost/trunk/tools/regression/xsl_reports/xsl/v2/result_page.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/xsl_reports/xsl/v2/result_page.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -102,6 +102,8 @@
             <xsl:when test="$test_type='run_fail'">     <xsl:text>rf</xsl:text> </xsl:when>
             <xsl:when test="$test_type='compile'">      <xsl:text>c</xsl:text>  </xsl:when>
             <xsl:when test="$test_type='compile_fail'"> <xsl:text>cf</xsl:text> </xsl:when>
+            <xsl:when test="$test_type='link'">         <xsl:text>l</xsl:text> </xsl:when>
+            <xsl:when test="$test_type='link_fail'">    <xsl:text>lf</xsl:text> </xsl:when>
             <xsl:otherwise>
                 <xsl:message terminate="yes">Incorrect test type "<xsl:value-of select="$test_type"/>"</xsl:message>
             </xsl:otherwise>
@@ -468,7 +470,7 @@
                 <xsl:text>&#160;&#160;&#160;&#160;</xsl:text>
             </xsl:when> 
  
-            <xsl:when test="$test_log/@result != 'success' and $test_log/@status = 'expected'">
+            <xsl:when test="count( $test_log[ @result != 'success' and @status = 'expected' ] ) &gt; 0">
                 <xsl:call-template name="insert_test_result">
                     <xsl:with-param name="result">
                         <xsl:choose>

Modified: boost/trunk/tools/regression/xsl_reports/xsl/v2/summary_page.xsl
===================================================================
--- boost/trunk/tools/regression/xsl_reports/xsl/v2/summary_page.xsl	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/regression/xsl_reports/xsl/v2/summary_page.xsl	2007-02-16 16:48:35 UTC (rev 14035)
@@ -147,11 +147,11 @@
             </xsl:call-template>
 
             <div class="statistics">
-            Unusable: <xsl:value-of select="count( $test_case_logs[ meta:test_case_status( . ) = 'unusable' ] )"/>
+            Unusable: <xsl:value-of select="count( $test_case_logs[ meta:test_case_status( $explicit_markup, . ) = 'unusable' ] )"/>
             &#160;|&#160;
-            Regressions: <xsl:value-of select="count( $test_case_logs[ meta:test_case_status( . ) = 'fail-unexpected' ] )"/>
+            Regressions: <xsl:value-of select="count( $test_case_logs[ meta:test_case_status( $explicit_markup, . ) = 'fail-unexpected' ] )"/>
             &#160;|&#160;
-            New failures: <xsl:value-of select="count( $test_case_logs[ meta:test_case_status( . ) = 'fail-unexpected-new' ] )"/>
+            New failures: <xsl:value-of select="count( $test_case_logs[ meta:test_case_status( $explicit_markup, . ) = 'fail-unexpected-new' ] )"/>
             </div>
             
             <!-- summary table -->

Modified: boost/trunk/tools/release/user-config.jam
===================================================================
--- boost/trunk/tools/release/user-config.jam	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/release/user-config.jam	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,7 +1,6 @@
-#  Copyright (C) Vladimir Prus 2003. Permission to copy, use, modify, sell and
-#  distribute this software is granted provided this copyright notice appears in
-#  all copies. This software is provided "as is" without express or implied
-#  warranty, and with no claim as to its suitability for any purpose.
+# Copyright 2003 Vladimir Prus
+# Distributed under the Boost Software License, Version 1.0. 
+# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) 
 
 #  This file is used to configure your Boost.Build installation. Please read
 #  the user manual to find out where to put it.

Deleted: boost/trunk/tools/wave/build/Jamfile
===================================================================
--- boost/trunk/tools/wave/build/Jamfile	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/wave/build/Jamfile	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,26 +0,0 @@
-# Wave: A Standard compliant C++ preprocessor
-#
-# Boost Wave Library Build Jamfile
-#
-# http://www.boost.org/
-#
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
-# Software License, Version 1.0. (See accompanying file
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-subproject tools/wave/build ;
-
-exe wave
-    : ../cpp.cpp 
-      <lib>../../../libs/wave/build/boost_wave
-      <lib>../../../libs/program_options/build/boost_program_options
-      <lib>../../../libs/filesystem/build/boost_filesystem
-      <lib>../../../libs/serialization/build/boost_serialization
-    :
-      <sysinclude>$(BOOST_ROOT)
-      <vc-7_1><*><rtti>off        # workaround for compiler bug
-      <vc-7_1-stlport><*><rtti>off
-    :
-      release
-    ;
-

Modified: boost/trunk/tools/wave/build/Jamfile.v2
===================================================================
--- boost/trunk/tools/wave/build/Jamfile.v2	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/wave/build/Jamfile.v2	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
 #
 # http://www.boost.org/
 #
-# Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+# Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
 # Software License, Version 1.0. (See accompanying file
 # LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -24,7 +24,6 @@
     /boost/filesystem//boost_filesystem
     /boost/serialization//boost_serialization
     :
-    <toolset-msvc:version>7.1:<rtti>off   # workaround for compiler bug
 #   <debug-symbols>on
     :
     release

Modified: boost/trunk/tools/wave/cpp.cpp
===================================================================
--- boost/trunk/tools/wave/cpp.cpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/wave/cpp.cpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -133,7 +133,7 @@
         "Wave: A Standard conformant C++ preprocessor based on the Boost.Wave library",
         "http://www.boost.org/",
         "",
-        "Copyright (c) 2001-2006 Hartmut Kaiser, Distributed under the Boost",
+        "Copyright (c) 2001-2007 Hartmut Kaiser, Distributed under the Boost",
         "Software License, Version 1.0. (See accompanying file",
         "LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)",
         0
@@ -217,7 +217,7 @@
 
     // Read all options from a given config file, parse and add them to the
     // given variables_map
-    void read_config_file_options(string const &filename, 
+    bool read_config_file_options(string const &filename, 
         po::options_description const &desc, po::variables_map &vm,
         bool may_fail = false)
     {
@@ -229,7 +229,7 @@
                     << ": command line warning: config file not found"
                     << endl;
             }
-            return;
+            return false;
         }
         
     vector<string> options;
@@ -240,10 +240,14 @@
             string::size_type pos = line.find_first_not_of(" \t");
             if (pos == string::npos) 
                 continue;
-
+            
         // skip comment lines
-            if ('#' != line[pos])
-                options.push_back(line);
+            if ('#' != line[pos]) {
+            // strip leading and trailing whitespace
+                string::size_type endpos = line.find_last_not_of(" \t");
+                BOOST_ASSERT(endpos != string::npos);
+                options.push_back(line.substr(pos, endpos-pos+1));
+            }
         }
 
         if (options.size() > 0) {
@@ -252,6 +256,7 @@
                 .options(desc).style(unix_style).run(), vm);
             po::notify(vm);
         }
+        return true;
     }
 
     // predicate to extract all positional arguments from the command line
@@ -262,6 +267,16 @@
         }
     };
 
+    // trim quotes from path names, if any
+    std::string trim_quotes(std::string const& file)
+    {
+        if (('"' == file[0] || '\'' == file[0]) && file[0] == file[file.size()-1])
+        {
+            return file.substr(1, file.size()-2);
+        }
+        return file;
+    }
+    
 ///////////////////////////////////////////////////////////////////////////////
 }
 
@@ -351,15 +366,27 @@
 
     ///////////////////////////////////////////////////////////////////////////
     //  Generate some meaningful error messages
-    template <typename Context>
+    template <typename Exception>        
     inline int 
-    report_error_message(Context &ctx, boost::wave::cpp_exception const &e)
+    report_error_message(Exception const &e)
     {
         // default error reporting
         cerr 
             << e.file_name() << ":" << e.line_no() << ":" << e.column_no() 
             << ": " << e.description() << endl;
 
+        // errors count as one
+        return (e.get_severity() == boost::wave::util::severity_error ||
+                e.get_severity() == boost::wave::util::severity_fatal) ? 1 : 0;
+    }
+
+    template <typename Context>
+    inline int 
+    report_error_message(Context &ctx, boost::wave::cpp_exception const &e)
+    {
+        // default error reporting
+        int result = report_error_message(e);
+
         using boost::wave::preprocess_exception;
         switch(e.get_errorcode()) {
         case preprocess_exception::macro_redefinition:
@@ -387,12 +414,10 @@
         default:
             break;
         }
-        
-        // errors count as one
-        return (e.get_severity() == boost::wave::util::severity_error ||
-                e.get_severity() == boost::wave::util::severity_fatal) ? 1 : 0;
+
+        return result;
     }
-
+    
     ///////////////////////////////////////////////////////////////////////////
     //  Read one logical line of text
     inline bool 
@@ -664,9 +689,16 @@
         
     // control the generation of #line directives
         if (vm.count("line")) {
+            int lineopt = vm["line"].as<int>();
+            if (0 != lineopt && 1 != lineopt) {
+                cerr << "wave: bogus value for --line command line option: " 
+                    << lineopt << endl;
+                return -1;
+            }
             ctx.set_language(
                 boost::wave::enable_emit_line_directives(ctx.get_language(), 
-                    vm["line"].as<int>() != 0));
+                    lineopt != 0));
+
         }
 
     // add include directories to the system include search paths
@@ -677,7 +709,7 @@
             for (vector<string>::const_iterator cit = syspaths.begin(); 
                  cit != end; ++cit)
             {
-                ctx.add_sysinclude_path((*cit).c_str());
+                ctx.add_sysinclude_path(cmd_line_utils::trim_quotes(*cit).c_str());
             }
         }
         
@@ -690,10 +722,10 @@
             for (vector<string>::const_iterator cit = ip.paths.begin(); 
                  cit != end; ++cit)
             {
-                ctx.add_include_path((*cit).c_str());
+                ctx.add_include_path(cmd_line_utils::trim_quotes(*cit).c_str());
             }
 
-        // if -I- was goven on the command line, this has to be propagated
+        // if -I- was given on the command line, this has to be propagated
             if (ip.seen_separator) 
                 ctx.set_sysinclude_delimiter();
                  
@@ -702,7 +734,7 @@
             for (vector<string>::const_iterator syscit = ip.syspaths.begin(); 
                  syscit != sysend; ++syscit)
             {
-                ctx.add_sysinclude_path((*syscit).c_str());
+                ctx.add_sysinclude_path(cmd_line_utils::trim_quotes(*syscit).c_str());
             }
         }
     
@@ -762,6 +794,7 @@
                 default_outfile = "-";
             }
             else {
+                out_file = fs::complete(out_file);
                 fs::create_directories(out_file.branch_path());
                 output.open(out_file.string().c_str());
                 if (!output.is_open()) {
@@ -792,6 +825,16 @@
             default_outfile = out_file.string();
         }
 
+    //  we assume the session to be interactive if input is stdin and output is 
+    //  stdout and the output is not inhibited
+    bool is_interactive = input_is_stdin && !output.is_open() && allow_output;
+    
+        if (is_interactive) {
+        // if interactive we don't warn for missing endif's etc.
+            ctx.set_language(
+                boost::wave::enable_single_line(ctx.get_language()));
+        }
+        
     // analyze the input file
     context_type::iterator_type first = ctx.begin();
     context_type::iterator_type last = ctx.end();
@@ -812,10 +855,6 @@
             }
         }
 
-    //  we assume the session to be interactive if input is stdin and output is 
-    //  stdout and the output is not inhibited
-    bool is_interactive = input_is_stdin && !output.is_open() && allow_output;
-    
         elapsed_time.set_print_time(!input_is_stdin && vm.count("timer") > 0);
         if (is_interactive) {
             print_interactive_version();  // print welcome message
@@ -880,6 +919,17 @@
                         throw;      // re-throw for non-recoverable errors
                     }
                 }
+                catch (boost::wave::cpplexer::lexing_exception const &e) {
+                // some preprocessing error
+                    if (is_interactive || 
+                        boost::wave::cpplexer::is_recoverable(e)) 
+                    {
+                        error_count += report_error_message(e);
+                    }
+                    else {
+                        throw;      // re-throw for non-recoverable errors
+                    }
+                }
             } while (!finished);
         } while (input_is_stdin);
 
@@ -888,16 +938,12 @@
     }
     catch (boost::wave::cpp_exception const &e) {
     // some preprocessing error
-        cerr 
-            << e.file_name() << ":" << e.line_no() << ":" << e.column_no() << ": "
-            << e.description() << endl;
+        report_error_message(e);
         return 1;
     }
     catch (boost::wave::cpplexer::lexing_exception const &e) {
     // some lexing error
-        cerr 
-            << e.file_name() << ":" << e.line_no() << ":" << e.column_no() << ": "
-            << e.description() << endl;
+        report_error_message(e);
         return 2;
     }
     catch (std::exception const &e) {
@@ -990,7 +1036,7 @@
                             "2: all whitespace is preserved")
             ("line,L", po::value<int>()->default_value(1), 
                 "control the generation of #line directives\n"
-                            "0: no #line directives are generated\n"
+                            "0: no #line directives are generated,\n"
                             "1: #line directives will be emitted (default)")
             ("extended,x", "enable the #pragma wave system() directive")
 #if BOOST_WAVE_SUPPORT_PRAGMA_ONCE != 0
@@ -1020,14 +1066,40 @@
         po::store(opts, vm);
         po::notify(vm);
 
-    // Try to find a wave.cfg in the same directory as the executable was 
-    // started from. If this exists, treat it as a wave config file
-    fs::path filename(argv[0], fs::native);
+//     // Try to find a wave.cfg in the same directory as the executable was 
+//     // started from. If this exists, treat it as a wave config file
+//     fs::path filename(argv[0], fs::native);
+// 
+//         filename = filename.branch_path() / "wave.cfg";
+//         cmd_line_utils::read_config_file_options(filename.string(), 
+//             desc_overall_cfgfile, vm, true);
 
-        filename = filename.branch_path() / "wave.cfg";
-        cmd_line_utils::read_config_file_options(filename.string(), 
-            desc_overall_cfgfile, vm, true);
+    // extract the arguments from the parsed command line
+    vector<po::option> arguments;
+    
+        std::remove_copy_if(opts.options.begin(), opts.options.end(), 
+            back_inserter(arguments), cmd_line_utils::is_argument());
+            
+    // try to find a config file somewhere up the filesystem hierarchy 
+    // starting with the input file path. This allows to use a general wave.cfg 
+    // file for all files in a certain project.
+        if (arguments.size() > 0 && arguments[0].value[0] != "-") {
+        // construct full path of input file
+            fs::path input_dir (fs::complete(fs::path(arguments[0].value[0], fs::native)));
+            input_dir = input_dir.normalize().branch_path();    // chop of file name
 
+        // walk up the hierarchy, trying to find a file wave.cfg 
+            while (!input_dir.empty()) {
+                fs::path filename = input_dir / "wave.cfg";
+                if (cmd_line_utils::read_config_file_options(filename.string(), 
+                    desc_overall_cfgfile, vm, true))
+                {
+                    break;    // break on the first cfg file found
+                }
+                input_dir = input_dir.branch_path();
+            }
+        }
+        
     // if there is specified at least one config file, parse it and add the 
     // options to the main variables_map
         if (vm.count("config-file")) {
@@ -1062,12 +1134,6 @@
             return print_copyright();
         }
 
-    // extract the arguments from the parsed command line
-    vector<po::option> arguments;
-    
-        std::remove_copy_if(opts.options.begin(), opts.options.end(), 
-            back_inserter(arguments), cmd_line_utils::is_argument());
-            
     // if there is no input file given, then take input from stdin
         if (0 == arguments.size() || 0 == arguments[0].value.size() ||
             arguments[0].value[0] == "-") 
@@ -1076,6 +1142,12 @@
             return do_actual_work("<stdin>", std::cin, vm, true);
         }
         else {
+            if (arguments.size() > 1) {
+            // this driver understands to parse one input file only
+                cerr << "wave: more than one input file specified, "
+                     << "ignoring all but the first!" << endl;
+            }
+
         std::string file_name(arguments[0].value[0]);
         ifstream instream(file_name.c_str());
 

Modified: boost/trunk/tools/wave/cpp.hpp
===================================================================
--- boost/trunk/tools/wave/cpp.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/wave/cpp.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -3,7 +3,7 @@
 
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/tools/wave/cpp_config.hpp
===================================================================
--- boost/trunk/tools/wave/cpp_config.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/wave/cpp_config.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -4,7 +4,7 @@
     
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/tools/wave/cpp_version.hpp
===================================================================
--- boost/trunk/tools/wave/cpp_version.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/wave/cpp_version.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
     Boost.Wave: A Standard compliant C++ preprocessor library
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -19,7 +19,7 @@
 
 #define CPP_VERSION_FULL_STR        BOOST_PP_STRINGIZE(CPP_VERSION_FULL)
                                      
-#define CPP_VERSION_DATE            20060514L
-#define CPP_VERSION_DATE_STR        "20060514"
+#define CPP_VERSION_DATE            20060919L
+#define CPP_VERSION_DATE_STR        "20060919"
 
 #endif // !defined(CPP_VERSION_HPP_CE4FE67F_63F9_468D_8364_C855F89D3C5D_INCLUDED)

Modified: boost/trunk/tools/wave/stop_watch.hpp
===================================================================
--- boost/trunk/tools/wave/stop_watch.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/wave/stop_watch.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
     Boost.Wave: A Standard compliant C++ preprocessor library
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/

Modified: boost/trunk/tools/wave/trace_macro_expansion.hpp
===================================================================
--- boost/trunk/tools/wave/trace_macro_expansion.hpp	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/tools/wave/trace_macro_expansion.hpp	2007-02-16 16:48:35 UTC (rev 14035)
@@ -2,7 +2,7 @@
     Boost.Wave: A Standard compliant C++ preprocessor library
     http://www.boost.org/
 
-    Copyright (c) 2001-2006 Hartmut Kaiser. Distributed under the Boost
+    Copyright (c) 2001-2007 Hartmut Kaiser. Distributed under the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 =============================================================================*/
@@ -149,45 +149,23 @@
     //  The function 'expanding_function_like_macro' is called, whenever a 
     //  function-like macro is to be expanded.
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
-    //  The parameter 'macrodef' marks the position, where the macro to expand 
+    //  The 'macrodef' parameter marks the position, where the macro to expand 
     //  is defined.
-    //
-    //  The parameter 'formal_args' holds the formal arguments used during the
+    //  The 'formal_args' parameter holds the formal arguments used during the
     //  definition of the macro.
-    //
-    //  The parameter 'definition' holds the macro definition for the macro to 
+    //  The 'definition' parameter holds the macro definition for the macro to 
     //  trace.
     //
-    //  The parameter 'macro_call' marks the position, where this macro invoked.
-    //
-    //  The parameter 'arguments' holds the macro arguments used during the 
+    //  The 'macrocall' parameter marks the position, where this macro invoked.
+    //  The 'arguments' parameter holds the macro arguments used during the 
     //  invocation of the macro
     //
-    //  The parameters 'seqstart' and 'seqend' point into the input token 
-    //  stream allowing to access the whole token sequence comprising the macro
-    //  invocation (starting with the opening parenthesis and ending after the
-    //  closing one).
-    //
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS
-    // old signature
     template <typename ContainerT>
     void expanding_function_like_macro(
         TokenT const &macrodef, std::vector<TokenT> const &formal_args, 
         ContainerT const &definition,
         TokenT const &macrocall, std::vector<ContainerT> const &arguments) 
-#else
-    // new signature
-    template <typename ContextT, typename ContainerT, typename IteratorT>
-    void expanding_function_like_macro(ContextT const& ctx,
-        TokenT const &macrodef, std::vector<TokenT> const &formal_args, 
-        ContainerT const &definition,
-        TokenT const &macrocall, std::vector<ContainerT> const &arguments,
-        IteratorT const& seqstart, IteratorT const& seqend) 
-#endif
     {
         if (!enabled_macro_tracing()) return;
         
@@ -269,30 +247,17 @@
     //  The function 'expanding_object_like_macro' is called, whenever a 
     //  object-like macro is to be expanded .
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
-    //  The parameter 'macrodef' marks the position, where the macro to expand 
+    //  The 'macrodef' parameter marks the position, where the macro to expand 
     //  is defined.
-    //
-    //  The definition 'definition' holds the macro definition for the macro to 
+    //  The 'definition' parameter holds the macro definition for the macro to 
     //  trace.
     //
-    //  The parameter 'macrocall' marks the position, where this macro invoked.
+    //  The 'macrocall' parameter marks the position, where this macro invoked.
     //
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS
-    // old signature
     template <typename ContainerT>
     void expanding_object_like_macro(TokenT const &macrodef, 
         ContainerT const &definition, TokenT const &macrocall)
-#else
-    // new signature
-    template <typename ContextT, typename ContainerT>
-    void expanding_object_like_macro(ContextT const& ctx,
-        TokenT const &macrodef, ContainerT const &definition, 
-        TokenT const &macrocall)
-#endif
     {
         if (!enabled_macro_tracing()) return;
         
@@ -324,22 +289,12 @@
     //  The function 'expanded_macro' is called, whenever the expansion of a 
     //  macro is finished but before the rescanning process starts.
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
     //  The parameter 'result' contains the token sequence generated as the 
     //  result of the macro expansion.
     //
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS
-    // old signature
     template <typename ContainerT>
     void expanded_macro(ContainerT const &result)
-#else
-    // new signature
-    template <typename ContextT, typename ContainerT>
-    void expanded_macro(ContextT const& ctx,ContainerT const &result)
-#endif
     {
         if (!enabled_macro_tracing()) return;
         
@@ -355,22 +310,12 @@
     //  The function 'rescanned_macro' is called, whenever the rescanning of a 
     //  macro is finished.
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
     //  The parameter 'result' contains the token sequence generated as the 
     //  result of the rescanning.
     //
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS
-    // old signature
     template <typename ContainerT>
     void rescanned_macro(ContainerT const &result)
-#else
-    // new signature
-    template <typename ContextT, typename ContainerT>
-    void rescanned_macro(ContextT const& ctx,ContainerT const &result)
-#endif
     {
         if (!enabled_macro_tracing() || get_level() == 0) 
             return;
@@ -387,17 +332,15 @@
 
     ///////////////////////////////////////////////////////////////////////////
     //  
-    //  The function 'interpret_pragma' is called, whenever a #pragma command 
-    //  directive is found which isn't known to the core Wave library, where
-    //  command is the value defined as the BOOST_WAVE_PRAGMA_KEYWORD constant
-    //  which defaults to "wave".
+    //  The function 'interpret_pragma' is called, whenever a #pragma wave 
+    //  directive is found, which isn't known to the core Wave library. 
     //
     //  The parameter 'ctx' is a reference to the context object used for 
     //  instantiating the preprocessing iterators by the user.
     //
     //  The parameter 'pending' may be used to push tokens back into the input 
     //  stream, which are to be used as the replacement text for the whole 
-    //  #pragma directive.
+    //  #pragma wave() directive.
     //
     //  The parameter 'option' contains the name of the interpreted pragma.
     //
@@ -472,9 +415,6 @@
     //  The function 'opened_include_file' is called, whenever a file referred 
     //  by an #include directive was successfully located and opened.
     //
-    //  The parameter 'ctx' is a reference to the context object used for 
-    //  instantiating the preprocessing iterators by the user.
-    //
     //  The parameter 'filename' contains the file system path of the 
     //  opened file (this is relative to the directory of the currently 
     //  processed file or a absolute path depending on the paths given as the
@@ -486,21 +426,10 @@
     //  found as a result of a #include <...> directive.
     //  
     ///////////////////////////////////////////////////////////////////////////
-#if BOOST_WAVE_USE_DEPRECIATED_PREPROCESSING_HOOKS
-    // old signature
     void 
     opened_include_file(std::string const &relname, std::string const &absname, 
         std::size_t include_depth, bool is_system_include) 
     {
-#else
-    // new signature
-    template <typename ContextT>
-    void 
-    opened_include_file(ContextT const& ctx, std::string const &relname, 
-        std::string const &absname, bool is_system_include) 
-    {
-        std::size_t include_depth = ctx.get_max_include_nesting_depth();
-#endif
         if (enabled_include_tracing()) {
             // print indented filename
             for (std::size_t i = 0; i < include_depth; ++i)
@@ -541,8 +470,7 @@
     //
     ///////////////////////////////////////////////////////////////////////////
     template <typename ContextT>
-    bool may_skip_whitespace(ContextT const &ctx, TokenT &token, 
-        bool &skipped_newline)
+    bool may_skip_whitespace(ContextT const &ctx, TokenT &token, bool &skipped_newline)
     {
         return this->base_type::may_skip_whitespace(ctx, token, skipped_newline) ?
             !preserve_whitespace : false;

Modified: boost/trunk/wiki/index.html
===================================================================
--- boost/trunk/wiki/index.html	2007-02-16 16:29:15 UTC (rev 14034)
+++ boost/trunk/wiki/index.html	2007-02-16 16:48:35 UTC (rev 14035)
@@ -1,3 +1,7 @@
+<!-- Copyright 2005 Dave Abrahams -->
+<!-- Distributed under the Boost Software License, Version 1.0. -->
+<!-- (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) -->
+
 <html>
 <head>
 <meta http-equiv="refresh" content="0; URL=http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl">

More information about the pkg-boost-commits mailing list